From 1883c6d16f7f4d1005d927bbd7f4160746a68449 Mon Sep 17 00:00:00 2001 From: victoryforphil Date: Sun, 2 Jun 2024 04:51:22 +0000 Subject: [PATCH] deploy: 6d684673c12f87c1ed28a2bebddf7fcb7755fb7b --- anyhow/all.html | 2 +- anyhow/fn.Ok.html | 2 +- anyhow/index.html | 2 +- anyhow/macro.anyhow.html | 2 +- anyhow/macro.bail.html | 2 +- anyhow/macro.ensure.html | 2 +- anyhow/struct.Chain.html | 2 +- anyhow/struct.Error.html | 6 +- anyhow/trait.Context.html | 2 +- anyhow/type.Result.html | 2 +- crates.js | 2 +- env_logger/fmt/enum.WriteStyle.html | 2 +- equivalent/all.html | 2 + equivalent/index.html | 58 + equivalent/sidebar-items.js | 1 + equivalent/trait.Comparable.html | 13 + equivalent/trait.Equivalent.html | 15 + flatten_json_object/enum.ArrayFormatting.html | 8 +- flatten_json_object/enum.Error.html | 2 +- flatten_json_object/struct.Flattener.html | 8 +- hashbrown/all.html | 2 + hashbrown/enum.TryReserveError.html | 27 + .../hash_map/enum.DefaultHashBuilder.html | 13 + hashbrown/hash_map/enum.Entry.html | 239 + hashbrown/hash_map/enum.EntryRef.html | 245 + hashbrown/hash_map/enum.RawEntryMut.html | 228 + hashbrown/hash_map/index.html | 20 + hashbrown/hash_map/sidebar-items.js | 1 + hashbrown/hash_map/struct.Drain.html | 225 + hashbrown/hash_map/struct.ExtractIf.html | 231 + hashbrown/hash_map/struct.HashMap.html | 1388 + hashbrown/hash_map/struct.IntoIter.html | 227 + hashbrown/hash_map/struct.IntoKeys.html | 227 + hashbrown/hash_map/struct.IntoValues.html | 226 + hashbrown/hash_map/struct.Iter.html | 220 + hashbrown/hash_map/struct.IterMut.html | 215 + hashbrown/hash_map/struct.Keys.html | 220 + hashbrown/hash_map/struct.OccupiedEntry.html | 282 + .../hash_map/struct.OccupiedEntryRef.html | 279 + hashbrown/hash_map/struct.OccupiedError.html | 53 + .../hash_map/struct.RawEntryBuilder.html | 102 + .../hash_map/struct.RawEntryBuilderMut.html | 125 + .../hash_map/struct.RawOccupiedEntryMut.html | 323 + .../hash_map/struct.RawVacantEntryMut.html | 153 + hashbrown/hash_map/struct.VacantEntry.html | 81 + hashbrown/hash_map/struct.VacantEntryRef.html | 89 + hashbrown/hash_map/struct.Values.html | 220 + hashbrown/hash_map/struct.ValuesMut.html | 215 + hashbrown/hash_set/enum.Entry.html | 109 + hashbrown/hash_set/index.html | 5 + hashbrown/hash_set/sidebar-items.js | 1 + hashbrown/hash_set/struct.Difference.html | 216 + hashbrown/hash_set/struct.Drain.html | 201 + hashbrown/hash_set/struct.ExtractIf.html | 207 + hashbrown/hash_set/struct.HashSet.html | 715 + hashbrown/hash_set/struct.Intersection.html | 216 + hashbrown/hash_set/struct.IntoIter.html | 204 + hashbrown/hash_set/struct.Iter.html | 199 + hashbrown/hash_set/struct.OccupiedEntry.html | 109 + .../hash_set/struct.SymmetricDifference.html | 216 + hashbrown/hash_set/struct.Union.html | 216 + hashbrown/hash_set/struct.VacantEntry.html | 73 + hashbrown/hash_table/enum.Entry.html | 192 + hashbrown/hash_table/index.html | 8 + hashbrown/hash_table/sidebar-items.js | 1 + hashbrown/hash_table/struct.AbsentEntry.html | 49 + hashbrown/hash_table/struct.Drain.html | 201 + hashbrown/hash_table/struct.ExtractIf.html | 207 + hashbrown/hash_table/struct.HashTable.html | 588 + hashbrown/hash_table/struct.IntoIter.html | 210 + hashbrown/hash_table/struct.Iter.html | 198 + hashbrown/hash_table/struct.IterMut.html | 197 + .../hash_table/struct.OccupiedEntry.html | 171 + hashbrown/hash_table/struct.VacantEntry.html | 68 + hashbrown/index.html | 9 + hashbrown/map/enum.DefaultHashBuilder.html | 11 + hashbrown/map/enum.Entry.html | 11 + hashbrown/map/enum.EntryRef.html | 11 + hashbrown/map/enum.RawEntryMut.html | 11 + hashbrown/map/struct.Drain.html | 11 + hashbrown/map/struct.ExtractIf.html | 11 + hashbrown/map/struct.HashMap.html | 11 + hashbrown/map/struct.IntoIter.html | 11 + hashbrown/map/struct.IntoKeys.html | 11 + hashbrown/map/struct.IntoValues.html | 11 + hashbrown/map/struct.Iter.html | 11 + hashbrown/map/struct.IterMut.html | 11 + hashbrown/map/struct.Keys.html | 11 + hashbrown/map/struct.OccupiedEntry.html | 11 + hashbrown/map/struct.OccupiedEntryRef.html | 11 + hashbrown/map/struct.OccupiedError.html | 11 + hashbrown/map/struct.RawEntryBuilder.html | 11 + hashbrown/map/struct.RawEntryBuilderMut.html | 11 + hashbrown/map/struct.RawOccupiedEntryMut.html | 11 + hashbrown/map/struct.RawVacantEntryMut.html | 11 + hashbrown/map/struct.VacantEntry.html | 11 + hashbrown/map/struct.VacantEntryRef.html | 11 + hashbrown/map/struct.Values.html | 11 + hashbrown/map/struct.ValuesMut.html | 11 + hashbrown/raw/index.html | 4 + hashbrown/raw/inner/struct.Bucket.html | 11 + hashbrown/raw/inner/struct.InsertSlot.html | 11 + hashbrown/raw/inner/struct.RawDrain.html | 11 + hashbrown/raw/inner/struct.RawIntoIter.html | 11 + hashbrown/raw/inner/struct.RawIter.html | 11 + hashbrown/raw/inner/struct.RawIterHash.html | 11 + hashbrown/raw/inner/struct.RawTable.html | 11 + hashbrown/raw/sidebar-items.js | 1 + hashbrown/raw/struct.Bucket.html | 141 + hashbrown/raw/struct.InsertSlot.html | 13 + hashbrown/raw/struct.RawDrain.html | 199 + hashbrown/raw/struct.RawIntoIter.html | 202 + hashbrown/raw/struct.RawIter.html | 218 + hashbrown/raw/struct.RawIterHash.html | 209 + hashbrown/raw/struct.RawTable.html | 206 + hashbrown/set/enum.Entry.html | 11 + hashbrown/set/struct.Difference.html | 11 + hashbrown/set/struct.Drain.html | 11 + hashbrown/set/struct.ExtractIf.html | 11 + hashbrown/set/struct.HashSet.html | 11 + hashbrown/set/struct.Intersection.html | 11 + hashbrown/set/struct.IntoIter.html | 11 + hashbrown/set/struct.Iter.html | 11 + hashbrown/set/struct.OccupiedEntry.html | 11 + hashbrown/set/struct.SymmetricDifference.html | 11 + hashbrown/set/struct.Union.html | 11 + hashbrown/set/struct.VacantEntry.html | 11 + hashbrown/sidebar-items.js | 1 + hashbrown/struct.HashMap.html | 1388 + hashbrown/struct.HashSet.html | 715 + hashbrown/struct.HashTable.html | 588 + hashbrown/table/enum.Entry.html | 11 + hashbrown/table/struct.AbsentEntry.html | 11 + hashbrown/table/struct.Drain.html | 11 + hashbrown/table/struct.ExtractIf.html | 11 + hashbrown/table/struct.HashTable.html | 11 + hashbrown/table/struct.IntoIter.html | 11 + hashbrown/table/struct.Iter.html | 11 + hashbrown/table/struct.IterMut.html | 11 + hashbrown/table/struct.OccupiedEntry.html | 11 + hashbrown/table/struct.VacantEntry.html | 11 + hashbrown/trait.Equivalent.html | 20 + indexmap/all.html | 2 + indexmap/index.html | 80 + indexmap/macro.indexmap!.html | 11 + indexmap/macro.indexmap.html | 19 + indexmap/macro.indexset!.html | 11 + indexmap/macro.indexset.html | 19 + indexmap/map/core/entry/enum.Entry.html | 11 + .../map/core/entry/struct.IndexedEntry.html | 11 + .../map/core/entry/struct.OccupiedEntry.html | 11 + .../map/core/entry/struct.VacantEntry.html | 11 + .../core/raw_entry_v1/enum.RawEntryMut.html | 11 + indexmap/map/core/raw_entry_v1/index.html | 11 + .../raw_entry_v1/struct.RawEntryBuilder.html | 11 + .../struct.RawEntryBuilderMut.html | 11 + .../struct.RawOccupiedEntryMut.html | 11 + .../struct.RawVacantEntryMut.html | 11 + .../raw_entry_v1/trait.RawEntryApiV1.html | 11 + indexmap/map/enum.Entry.html | 48 + indexmap/map/index.html | 8 + indexmap/map/iter/struct.Drain.html | 11 + indexmap/map/iter/struct.IntoIter.html | 11 + indexmap/map/iter/struct.IntoKeys.html | 11 + indexmap/map/iter/struct.IntoValues.html | 11 + indexmap/map/iter/struct.Iter.html | 11 + indexmap/map/iter/struct.IterMut.html | 11 + indexmap/map/iter/struct.Keys.html | 11 + indexmap/map/iter/struct.Splice.html | 11 + indexmap/map/iter/struct.Values.html | 11 + indexmap/map/iter/struct.ValuesMut.html | 11 + indexmap/map/mutable/trait.MutableKeys.html | 11 + .../map/raw_entry_v1/enum.RawEntryMut.html | 44 + indexmap/map/raw_entry_v1/index.html | 13 + indexmap/map/raw_entry_v1/sidebar-items.js | 1 + .../raw_entry_v1/struct.RawEntryBuilder.html | 46 + .../struct.RawEntryBuilderMut.html | 35 + .../struct.RawOccupiedEntryMut.html | 94 + .../struct.RawVacantEntryMut.html | 56 + .../map/raw_entry_v1/trait.RawEntryApiV1.html | 141 + indexmap/map/sidebar-items.js | 1 + indexmap/map/slice/struct.Slice.html | 11 + indexmap/map/struct.Drain.html | 217 + indexmap/map/struct.IndexMap.html | 572 + indexmap/map/struct.IndexedEntry.html | 64 + indexmap/map/struct.IntoIter.html | 220 + indexmap/map/struct.IntoKeys.html | 218 + indexmap/map/struct.IntoValues.html | 218 + indexmap/map/struct.Iter.html | 219 + indexmap/map/struct.IterMut.html | 217 + indexmap/map/struct.Keys.html | 266 + indexmap/map/struct.OccupiedEntry.html | 77 + indexmap/map/struct.Slice.html | 97 + indexmap/map/struct.Splice.html | 249 + indexmap/map/struct.VacantEntry.html | 39 + indexmap/map/struct.Values.html | 218 + indexmap/map/struct.ValuesMut.html | 214 + indexmap/map/trait.MutableKeys.html | 49 + indexmap/map/trait.RawEntryApiV1.html | 141 + indexmap/set/index.html | 4 + indexmap/set/iter/struct.Difference.html | 11 + indexmap/set/iter/struct.Drain.html | 11 + indexmap/set/iter/struct.Intersection.html | 11 + indexmap/set/iter/struct.IntoIter.html | 11 + indexmap/set/iter/struct.Iter.html | 11 + indexmap/set/iter/struct.Splice.html | 11 + .../set/iter/struct.SymmetricDifference.html | 11 + indexmap/set/iter/struct.Union.html | 11 + indexmap/set/mutable/trait.MutableValues.html | 11 + indexmap/set/sidebar-items.js | 1 + indexmap/set/slice/struct.Slice.html | 11 + indexmap/set/struct.Difference.html | 226 + indexmap/set/struct.Drain.html | 213 + indexmap/set/struct.IndexSet.html | 481 + indexmap/set/struct.Intersection.html | 226 + indexmap/set/struct.IntoIter.html | 214 + indexmap/set/struct.Iter.html | 215 + indexmap/set/struct.Slice.html | 69 + indexmap/set/struct.Splice.html | 241 + indexmap/set/struct.SymmetricDifference.html | 232 + indexmap/set/struct.Union.html | 224 + indexmap/set/trait.MutableValues.html | 38 + indexmap/sidebar-items.js | 1 + indexmap/struct.TryReserveError.html | 21 + indexmap/trait.Equivalent.html | 16 + json_unflattening/all.html | 2 + json_unflattening/errors/enum.Error.html | 22 + json_unflattening/errors/index.html | 2 + json_unflattening/errors/sidebar-items.js | 1 + json_unflattening/flattening/fn.flatten.html | 9 + json_unflattening/flattening/index.html | 2 + json_unflattening/flattening/sidebar-items.js | 1 + json_unflattening/index.html | 3 + json_unflattening/sidebar-items.js | 1 + .../unflattening/fn.unflatten.html | 9 + json_unflattening/unflattening/index.html | 2 + .../unflattening/sidebar-items.js | 1 + lil_broker/enum.Primatives.html | 37 +- lil_broker/enum.QueryCommand.html | 4 +- lil_broker/struct.Bucket.html | 10 +- lil_broker/struct.Database.html | 16 +- lil_broker/struct.GetLatestQuery.html | 4 +- lil_broker/struct.QueryResponse.html | 4 +- lil_broker/struct.Tag.html | 36 +- lil_broker/struct.Timestamp.html | 14 +- lil_broker/struct.WriteQuery.html | 8 +- proc_macro2/all.html | 2 +- proc_macro2/enum.Delimiter.html | 14 +- proc_macro2/enum.Spacing.html | 8 +- proc_macro2/enum.TokenTree.html | 6 +- proc_macro2/extra/index.html | 2 +- proc_macro2/extra/struct.DelimSpan.html | 2 +- proc_macro2/index.html | 4 +- proc_macro2/struct.Group.html | 22 +- proc_macro2/struct.Ident.html | 28 +- proc_macro2/struct.LexError.html | 4 +- proc_macro2/struct.Literal.html | 78 +- proc_macro2/struct.Punct.html | 18 +- proc_macro2/struct.Span.html | 2 +- proc_macro2/struct.TokenStream.html | 8 +- proc_macro2/token_stream/index.html | 4 +- proc_macro2/token_stream/struct.IntoIter.html | 6 +- quote/trait.ToTokens.html | 2 +- regex/bytes/struct.Captures.html | 8 +- regex/bytes/struct.Regex.html | 10 +- regex/bytes/struct.SetMatches.html | 2 +- regex/enum.Error.html | 2 +- regex/struct.Match.html | 2 +- regex/struct.Regex.html | 6 +- regex/struct.SetMatches.html | 2 +- regex_automata/hybrid/struct.CacheError.html | 2 +- regex_automata/struct.MatchError.html | 2 +- regex_automata/struct.PatternID.html | 4 +- .../struct.PatternSetInsertError.html | 2 +- .../util/primitives/struct.PatternID.html | 4 +- .../util/primitives/struct.SmallIndex.html | 4 +- .../util/primitives/struct.StateID.html | 2 +- .../util/primitives/struct.StateIDError.html | 2 +- .../util/wire/struct.DeserializeError.html | 2 +- .../util/wire/struct.SerializeError.html | 2 +- regex_syntax/enum.Error.html | 2 +- regex_syntax/hir/enum.ErrorKind.html | 2 +- regex_syntax/hir/struct.Error.html | 2 +- regex_syntax/hir/struct.Hir.html | 4 +- regex_syntax/struct.UnicodeWordError.html | 2 +- search-index.js | 26 +- serde/all.html | 2 +- serde/de/enum.Unexpected.html | 4 +- serde/de/index.html | 2 +- serde/de/struct.IgnoredAny.html | 2 +- serde/de/trait.Deserialize.html | 342 +- serde/de/trait.DeserializeOwned.html | 2 +- serde/de/trait.DeserializeSeed.html | 2 +- serde/de/trait.Deserializer.html | 2 +- serde/de/trait.EnumAccess.html | 2 +- serde/de/trait.Error.html | 2 +- serde/de/trait.Expected.html | 2 +- serde/de/trait.IntoDeserializer.html | 4 +- serde/de/trait.MapAccess.html | 2 +- serde/de/trait.SeqAccess.html | 2 +- serde/de/trait.VariantAccess.html | 2 +- serde/de/trait.Visitor.html | 2 +- serde/de/value/index.html | 2 +- serde/de/value/struct.BoolDeserializer.html | 2 +- .../struct.BorrowedBytesDeserializer.html | 2 +- .../value/struct.BorrowedStrDeserializer.html | 2 +- serde/de/value/struct.BytesDeserializer.html | 2 +- serde/de/value/struct.CharDeserializer.html | 2 +- serde/de/value/struct.CowStrDeserializer.html | 6 +- .../value/struct.EnumAccessDeserializer.html | 2 +- serde/de/value/struct.Error.html | 10 +- serde/de/value/struct.F32Deserializer.html | 2 +- serde/de/value/struct.F64Deserializer.html | 2 +- serde/de/value/struct.I128Deserializer.html | 2 +- serde/de/value/struct.I16Deserializer.html | 2 +- serde/de/value/struct.I32Deserializer.html | 2 +- serde/de/value/struct.I64Deserializer.html | 2 +- serde/de/value/struct.I8Deserializer.html | 2 +- serde/de/value/struct.IsizeDeserializer.html | 2 +- .../value/struct.MapAccessDeserializer.html | 2 +- serde/de/value/struct.MapDeserializer.html | 6 +- .../value/struct.SeqAccessDeserializer.html | 2 +- serde/de/value/struct.SeqDeserializer.html | 6 +- serde/de/value/struct.StrDeserializer.html | 2 +- serde/de/value/struct.StringDeserializer.html | 2 +- serde/de/value/struct.U128Deserializer.html | 2 +- serde/de/value/struct.U16Deserializer.html | 2 +- serde/de/value/struct.U32Deserializer.html | 6 +- serde/de/value/struct.U64Deserializer.html | 2 +- serde/de/value/struct.U8Deserializer.html | 2 +- serde/de/value/struct.UnitDeserializer.html | 2 +- serde/de/value/struct.UsizeDeserializer.html | 2 +- serde/derive.Deserialize.html | 2 +- serde/derive.Serialize.html | 2 +- serde/index.html | 4 +- serde/macro.forward_to_deserialize_any.html | 2 +- serde/ser/index.html | 2 +- serde/ser/struct.Impossible.html | 16 +- serde/ser/trait.Error.html | 2 +- serde/ser/trait.Serialize.html | 264 +- serde/ser/trait.SerializeMap.html | 2 +- serde/ser/trait.SerializeSeq.html | 2 +- serde/ser/trait.SerializeStruct.html | 2 +- serde/ser/trait.SerializeStructVariant.html | 2 +- serde/ser/trait.SerializeTuple.html | 2 +- serde/ser/trait.SerializeTupleStruct.html | 2 +- serde/ser/trait.SerializeTupleVariant.html | 2 +- serde/ser/trait.Serializer.html | 2 +- serde/trait.Deserialize.html | 342 +- serde/trait.Deserializer.html | 2 +- serde/trait.Serialize.html | 264 +- serde/trait.Serializer.html | 2 +- serde_derive/all.html | 2 +- serde_derive/derive.Deserialize.html | 2 +- serde_derive/derive.Serialize.html | 2 +- serde_derive/index.html | 2 +- serde_json/enum.Value.html | 402 +- serde_json/error/enum.Category.html | 8 +- serde_json/error/struct.Error.html | 6 +- serde_json/map/struct.Map.html | 50 +- serde_json/struct.Error.html | 6 +- serde_json/struct.Map.html | 50 +- serde_json/struct.Number.html | 146 +- serde_json/value/enum.Value.html | 402 +- serde_json/value/struct.Number.html | 146 +- src-files.js | 8 +- src/anyhow/backtrace.rs.html | 2 +- src/anyhow/chain.rs.html | 2 +- src/anyhow/context.rs.html | 2 +- src/anyhow/ensure.rs.html | 102 +- src/anyhow/error.rs.html | 2 +- src/anyhow/fmt.rs.html | 2 +- src/anyhow/kind.rs.html | 2 +- src/anyhow/lib.rs.html | 2 +- src/anyhow/macros.rs.html | 2 +- src/anyhow/ptr.rs.html | 2 +- src/anyhow/wrapper.rs.html | 2 +- src/equivalent/lib.rs.html | 229 + .../external_trait_impls/mod.rs.html | 15 + src/hashbrown/lib.rs.html | 379 + src/hashbrown/macros.rs.html | 143 + src/hashbrown/map.rs.html | 17923 ++++++++++++ src/hashbrown/raw/alloc.rs.html | 175 + src/hashbrown/raw/bitmask.rs.html | 269 + src/hashbrown/raw/mod.rs.html | 9637 +++++++ src/hashbrown/raw/sse2.rs.html | 301 + src/hashbrown/scopeguard.rs.html | 147 + src/hashbrown/set.rs.html | 5943 ++++ src/hashbrown/table.rs.html | 4143 +++ src/indexmap/arbitrary.rs.html | 157 + src/indexmap/lib.rs.html | 551 + src/indexmap/macros.rs.html | 359 + src/indexmap/map.rs.html | 2837 ++ src/indexmap/map/core.rs.html | 1287 + src/indexmap/map/core/entry.rs.html | 965 + src/indexmap/map/core/raw.rs.html | 309 + src/indexmap/map/core/raw_entry_v1.rs.html | 1307 + src/indexmap/map/iter.rs.html | 1429 + src/indexmap/map/mutable.rs.html | 177 + src/indexmap/map/slice.rs.html | 1081 + src/indexmap/set.rs.html | 2341 ++ src/indexmap/set/iter.rs.html | 1255 + src/indexmap/set/mutable.rs.html | 175 + src/indexmap/set/slice.rs.html | 683 + src/indexmap/util.rs.html | 109 + src/json_unflattening/errors.rs.html | 88 + src/json_unflattening/flattening.rs.html | 528 + src/json_unflattening/lib.rs.html | 40 + src/json_unflattening/unflattening.rs.html | 428 + src/lil_broker/buckets/mod.rs.html | 39 +- src/lil_broker/buckets/querying.rs.html | 99 +- src/lil_broker/database/mod.rs.html | 57 +- .../database/query/get_latest.rs.html | 126 +- src/lil_broker/database/query/lookup.rs.html | 11 +- .../database/query/lookup_range.rs.html | 162 +- src/lil_broker/database/query/mod.rs.html | 115 +- .../database/query/tag_filter.rs.html | 33 +- src/lil_broker/database/query/write.rs.html | 80 +- src/lil_broker/datapoint/mod.rs.html | 27 +- src/lil_broker/datapoint/primatives.rs.html | 81 +- src/lil_broker/lib.rs.html | 3 +- src/lil_broker/types/mod.rs.html | 7 +- src/lil_broker/types/tag.rs.html | 81 +- src/lil_broker/types/timestamp.rs.html | 2 +- src/lil_broker/utils/mod.rs.html | 4 +- src/proc_macro2/detection.rs.html | 2 +- src/proc_macro2/extra.rs.html | 4 +- src/proc_macro2/fallback.rs.html | 12 +- src/proc_macro2/lib.rs.html | 50 +- src/proc_macro2/marker.rs.html | 2 +- src/proc_macro2/parse.rs.html | 2 +- src/proc_macro2/rcvec.rs.html | 2 +- src/proc_macro2/wrapper.rs.html | 2 +- src/regex_syntax/unicode_tables/age.rs.html | 3585 +++ .../case_folding_simple.rs.html | 5779 ++++ .../unicode_tables/general_category.rs.html | 13107 +++++++++ .../grapheme_cluster_break.rs.html | 2835 ++ .../unicode_tables/perl_word.rs.html | 1565 ++ .../unicode_tables/property_bool.rs.html | 22737 ++++++++++++++++ .../unicode_tables/property_names.rs.html | 531 + .../unicode_tables/property_values.rs.html | 1851 ++ .../unicode_tables/script.rs.html | 2529 ++ .../unicode_tables/script_extension.rs.html | 2917 ++ .../unicode_tables/sentence_break.rs.html | 4957 ++++ .../unicode_tables/word_break.rs.html | 2243 ++ src/serde/de/format.rs.html | 2 +- src/serde/de/ignored_any.rs.html | 2 +- src/serde/de/impls.rs.html | 226 +- src/serde/de/mod.rs.html | 6 +- src/serde/de/seed.rs.html | 2 +- src/serde/de/size_hint.rs.html | 2 +- src/serde/de/value.rs.html | 26 +- src/serde/integer128.rs.html | 2 +- src/serde/lib.rs.html | 10 +- src/serde/macros.rs.html | 2 +- src/serde/private/de.rs.html | 2 +- src/serde/private/doc.rs.html | 2 +- src/serde/private/mod.rs.html | 2 +- src/serde/private/ser.rs.html | 2 +- src/serde/ser/fmt.rs.html | 2 +- src/serde/ser/impls.rs.html | 130 +- src/serde/ser/impossible.rs.html | 2 +- src/serde/ser/mod.rs.html | 2 +- src/serde_derive/bound.rs.html | 2 +- src/serde_derive/de.rs.html | 2 +- src/serde_derive/dummy.rs.html | 2 +- src/serde_derive/fragment.rs.html | 2 +- src/serde_derive/internals/ast.rs.html | 2 +- src/serde_derive/internals/attr.rs.html | 2 +- src/serde_derive/internals/case.rs.html | 2 +- src/serde_derive/internals/check.rs.html | 2 +- src/serde_derive/internals/ctxt.rs.html | 2 +- src/serde_derive/internals/mod.rs.html | 2 +- src/serde_derive/internals/receiver.rs.html | 2 +- src/serde_derive/internals/respan.rs.html | 2 +- src/serde_derive/internals/symbol.rs.html | 2 +- src/serde_derive/lib.rs.html | 4 +- src/serde_derive/pretend.rs.html | 2 +- src/serde_derive/ser.rs.html | 2 +- src/serde_derive/this.rs.html | 2 +- src/syn/attr.rs.html | 46 +- src/syn/bigint.rs.html | 2 +- src/syn/buffer.rs.html | 4 +- src/syn/classify.rs.html | 2 +- src/syn/custom_keyword.rs.html | 2 +- src/syn/custom_punctuation.rs.html | 2 +- src/syn/data.rs.html | 30 +- src/syn/derive.rs.html | 16 +- src/syn/discouraged.rs.html | 2 +- src/syn/drops.rs.html | 2 +- src/syn/error.rs.html | 4 +- src/syn/export.rs.html | 2 +- src/syn/expr.rs.html | 310 +- src/syn/ext.rs.html | 2 +- src/syn/file.rs.html | 8 +- src/syn/fixup.rs.html | 46 +- src/syn/gen/clone.rs.html | 358 +- src/syn/gen/debug.rs.html | 348 +- src/syn/gen/eq.rs.html | 700 +- src/syn/gen/hash.rs.html | 344 +- src/syn/gen/visit_mut.rs.html | 686 +- src/syn/gen_helper.rs.html | 71 - src/syn/generics.rs.html | 92 +- src/syn/group.rs.html | 8 +- src/syn/ident.rs.html | 4 +- src/syn/item.rs.html | 232 +- src/syn/lib.rs.html | 78 +- src/syn/lifetime.rs.html | 6 +- src/syn/lit.rs.html | 68 +- src/syn/lookahead.rs.html | 4 +- src/syn/mac.rs.html | 14 +- src/syn/macros.rs.html | 4 +- src/syn/meta.rs.html | 2 +- src/syn/op.rs.html | 14 +- src/syn/parse.rs.html | 32 +- src/syn/parse_macro_input.rs.html | 4 +- src/syn/parse_quote.rs.html | 6 +- src/syn/pat.rs.html | 56 +- src/syn/path.rs.html | 58 +- src/syn/precedence.rs.html | 2 +- src/syn/print.rs.html | 2 +- src/syn/punctuated.rs.html | 76 +- src/syn/restriction.rs.html | 14 +- src/syn/sealed.rs.html | 2 +- src/syn/span.rs.html | 2 +- src/syn/spanned.rs.html | 2 +- src/syn/stmt.rs.html | 26 +- src/syn/thread.rs.html | 2 +- src/syn/token.rs.html | 62 +- src/syn/tt.rs.html | 2 +- src/syn/ty.rs.html | 122 +- src/syn/verbatim.rs.html | 2 +- src/syn/whitespace.rs.html | 2 +- syn/all.html | 2 +- syn/buffer/index.html | 2 +- syn/buffer/struct.Cursor.html | 2 +- syn/buffer/struct.TokenBuffer.html | 2 +- syn/enum.AttrStyle.html | 2 +- syn/enum.BinOp.html | 2 +- syn/enum.Data.html | 2 +- syn/enum.Expr.html | 4 +- syn/enum.FieldMutability.html | 2 +- syn/enum.Fields.html | 6 +- syn/enum.FnArg.html | 2 +- syn/enum.ForeignItem.html | 4 +- syn/enum.GenericArgument.html | 2 +- syn/enum.GenericParam.html | 4 +- syn/enum.ImplItem.html | 4 +- syn/enum.ImplRestriction.html | 2 +- syn/enum.Item.html | 4 +- syn/enum.Lit.html | 4 +- syn/enum.MacroDelimiter.html | 2 +- syn/enum.Member.html | 6 +- syn/enum.Meta.html | 4 +- syn/enum.Pat.html | 4 +- syn/enum.PathArguments.html | 2 +- syn/enum.RangeLimits.html | 4 +- syn/enum.ReturnType.html | 2 +- syn/enum.StaticMutability.html | 2 +- syn/enum.Stmt.html | 2 +- syn/enum.TraitBoundModifier.html | 2 +- syn/enum.TraitItem.html | 4 +- syn/enum.Type.html | 4 +- syn/enum.TypeParamBound.html | 2 +- syn/enum.UnOp.html | 2 +- syn/enum.UseTree.html | 4 +- syn/enum.Visibility.html | 2 +- syn/enum.WherePredicate.html | 2 +- syn/ext/index.html | 2 +- syn/ext/trait.IdentExt.html | 2 +- syn/fn.parse.html | 4 +- syn/fn.parse2.html | 4 +- syn/fn.parse_file.html | 4 +- syn/fn.parse_str.html | 4 +- syn/index.html | 4 +- syn/macro.Token.html | 2 +- syn/macro.braced.html | 2 +- syn/macro.bracketed.html | 2 +- syn/macro.custom_keyword.html | 2 +- syn/macro.custom_punctuation.html | 2 +- syn/macro.parenthesized.html | 2 +- syn/macro.parse_macro_input.html | 2 +- syn/macro.parse_quote.html | 2 +- syn/macro.parse_quote_spanned.html | 2 +- syn/meta/fn.parser.html | 2 +- syn/meta/index.html | 2 +- syn/meta/struct.ParseNestedMeta.html | 2 +- syn/parse/discouraged/index.html | 2 +- syn/parse/discouraged/trait.AnyDelimiter.html | 2 +- syn/parse/discouraged/trait.Speculative.html | 2 +- syn/parse/index.html | 2 +- syn/parse/struct.Error.html | 4 +- syn/parse/struct.Lookahead1.html | 2 +- syn/parse/struct.Nothing.html | 2 +- syn/parse/struct.ParseBuffer.html | 2 +- syn/parse/struct.StepCursor.html | 2 +- syn/parse/trait.Parse.html | 2 +- syn/parse/trait.Parser.html | 2 +- syn/parse/trait.Peek.html | 2 +- syn/parse/type.ParseStream.html | 2 +- syn/parse/type.Result.html | 2 +- syn/punctuated/enum.Pair.html | 6 +- syn/punctuated/index.html | 4 +- syn/punctuated/struct.IntoIter.html | 2 +- syn/punctuated/struct.IntoPairs.html | 2 +- syn/punctuated/struct.Iter.html | 2 +- syn/punctuated/struct.IterMut.html | 2 +- syn/punctuated/struct.Pairs.html | 2 +- syn/punctuated/struct.PairsMut.html | 2 +- syn/punctuated/struct.Punctuated.html | 14 +- syn/spanned/index.html | 2 +- syn/spanned/trait.Spanned.html | 2 +- syn/struct.Abi.html | 2 +- ...struct.AngleBracketedGenericArguments.html | 2 +- syn/struct.Arm.html | 4 +- syn/struct.AssocConst.html | 2 +- syn/struct.AssocType.html | 2 +- syn/struct.Attribute.html | 2 +- syn/struct.BareFnArg.html | 2 +- syn/struct.BareVariadic.html | 2 +- syn/struct.Block.html | 2 +- syn/struct.BoundLifetimes.html | 2 +- syn/struct.ConstParam.html | 2 +- syn/struct.Constraint.html | 2 +- syn/struct.DataEnum.html | 2 +- syn/struct.DataStruct.html | 2 +- syn/struct.DataUnion.html | 2 +- syn/struct.DeriveInput.html | 4 +- syn/struct.Error.html | 4 +- syn/struct.ExprArray.html | 2 +- syn/struct.ExprAssign.html | 4 +- syn/struct.ExprAsync.html | 4 +- syn/struct.ExprAwait.html | 4 +- syn/struct.ExprBinary.html | 4 +- syn/struct.ExprBlock.html | 4 +- syn/struct.ExprBreak.html | 4 +- syn/struct.ExprCall.html | 4 +- syn/struct.ExprCast.html | 4 +- syn/struct.ExprClosure.html | 4 +- syn/struct.ExprConst.html | 4 +- syn/struct.ExprContinue.html | 4 +- syn/struct.ExprField.html | 4 +- syn/struct.ExprForLoop.html | 4 +- syn/struct.ExprGroup.html | 4 +- syn/struct.ExprIf.html | 4 +- syn/struct.ExprIndex.html | 4 +- syn/struct.ExprInfer.html | 4 +- syn/struct.ExprLet.html | 4 +- syn/struct.ExprLit.html | 6 +- syn/struct.ExprLoop.html | 4 +- syn/struct.ExprMacro.html | 4 +- syn/struct.ExprMatch.html | 4 +- syn/struct.ExprMethodCall.html | 4 +- syn/struct.ExprParen.html | 4 +- syn/struct.ExprPath.html | 6 +- syn/struct.ExprRange.html | 4 +- syn/struct.ExprReference.html | 4 +- syn/struct.ExprRepeat.html | 4 +- syn/struct.ExprReturn.html | 4 +- syn/struct.ExprStruct.html | 4 +- syn/struct.ExprTry.html | 4 +- syn/struct.ExprTryBlock.html | 4 +- syn/struct.ExprTuple.html | 4 +- syn/struct.ExprUnary.html | 4 +- syn/struct.ExprUnsafe.html | 4 +- syn/struct.ExprWhile.html | 4 +- syn/struct.ExprYield.html | 4 +- syn/struct.Field.html | 2 +- syn/struct.FieldPat.html | 2 +- syn/struct.FieldValue.html | 4 +- syn/struct.FieldsNamed.html | 2 +- syn/struct.FieldsUnnamed.html | 2 +- syn/struct.File.html | 2 +- syn/struct.ForeignItemFn.html | 2 +- syn/struct.ForeignItemMacro.html | 2 +- syn/struct.ForeignItemStatic.html | 2 +- syn/struct.ForeignItemType.html | 2 +- syn/struct.Generics.html | 2 +- syn/struct.Ident.html | 28 +- syn/struct.ImplGenerics.html | 2 +- syn/struct.ImplItemConst.html | 2 +- syn/struct.ImplItemFn.html | 2 +- syn/struct.ImplItemMacro.html | 2 +- syn/struct.ImplItemType.html | 2 +- syn/struct.Index.html | 8 +- syn/struct.ItemConst.html | 2 +- syn/struct.ItemEnum.html | 2 +- syn/struct.ItemExternCrate.html | 2 +- syn/struct.ItemFn.html | 2 +- syn/struct.ItemForeignMod.html | 2 +- syn/struct.ItemImpl.html | 2 +- syn/struct.ItemMacro.html | 2 +- syn/struct.ItemMod.html | 2 +- syn/struct.ItemStatic.html | 2 +- syn/struct.ItemStruct.html | 4 +- syn/struct.ItemTrait.html | 2 +- syn/struct.ItemTraitAlias.html | 2 +- syn/struct.ItemType.html | 2 +- syn/struct.ItemUnion.html | 4 +- syn/struct.ItemUse.html | 2 +- syn/struct.Label.html | 4 +- syn/struct.Lifetime.html | 4 +- syn/struct.LifetimeParam.html | 2 +- syn/struct.LitBool.html | 2 +- syn/struct.LitByte.html | 2 +- syn/struct.LitByteStr.html | 2 +- syn/struct.LitCStr.html | 2 +- syn/struct.LitChar.html | 2 +- syn/struct.LitFloat.html | 4 +- syn/struct.LitInt.html | 4 +- syn/struct.LitStr.html | 2 +- syn/struct.Local.html | 2 +- syn/struct.LocalInit.html | 2 +- syn/struct.Macro.html | 2 +- syn/struct.MetaList.html | 2 +- syn/struct.MetaNameValue.html | 2 +- syn/struct.ParenthesizedGenericArguments.html | 2 +- syn/struct.PatConst.html | 4 +- syn/struct.PatIdent.html | 2 +- syn/struct.PatLit.html | 6 +- syn/struct.PatMacro.html | 4 +- syn/struct.PatOr.html | 2 +- syn/struct.PatParen.html | 2 +- syn/struct.PatPath.html | 6 +- syn/struct.PatRange.html | 4 +- syn/struct.PatReference.html | 2 +- syn/struct.PatRest.html | 2 +- syn/struct.PatSlice.html | 2 +- syn/struct.PatStruct.html | 2 +- syn/struct.PatTuple.html | 2 +- syn/struct.PatTupleStruct.html | 2 +- syn/struct.PatType.html | 2 +- syn/struct.PatWild.html | 2 +- syn/struct.Path.html | 6 +- syn/struct.PathSegment.html | 2 +- syn/struct.PredicateLifetime.html | 2 +- syn/struct.PredicateType.html | 2 +- syn/struct.QSelf.html | 2 +- syn/struct.Receiver.html | 2 +- syn/struct.Signature.html | 2 +- syn/struct.StmtMacro.html | 2 +- syn/struct.TraitBound.html | 2 +- syn/struct.TraitItemConst.html | 2 +- syn/struct.TraitItemFn.html | 2 +- syn/struct.TraitItemMacro.html | 2 +- syn/struct.TraitItemType.html | 2 +- syn/struct.Turbofish.html | 2 +- syn/struct.TypeArray.html | 2 +- syn/struct.TypeBareFn.html | 2 +- syn/struct.TypeGenerics.html | 2 +- syn/struct.TypeGroup.html | 2 +- syn/struct.TypeImplTrait.html | 2 +- syn/struct.TypeInfer.html | 2 +- syn/struct.TypeMacro.html | 2 +- syn/struct.TypeNever.html | 2 +- syn/struct.TypeParam.html | 2 +- syn/struct.TypeParen.html | 2 +- syn/struct.TypePath.html | 2 +- syn/struct.TypePtr.html | 2 +- syn/struct.TypeReference.html | 2 +- syn/struct.TypeSlice.html | 2 +- syn/struct.TypeTraitObject.html | 2 +- syn/struct.TypeTuple.html | 2 +- syn/struct.UseGlob.html | 2 +- syn/struct.UseGroup.html | 2 +- syn/struct.UseName.html | 2 +- syn/struct.UsePath.html | 2 +- syn/struct.UseRename.html | 2 +- syn/struct.Variadic.html | 2 +- syn/struct.Variant.html | 2 +- syn/struct.VisRestricted.html | 2 +- syn/struct.WhereClause.html | 2 +- syn/token/index.html | 2 +- syn/token/struct.Abstract.html | 2 +- syn/token/struct.And.html | 2 +- syn/token/struct.AndAnd.html | 2 +- syn/token/struct.AndEq.html | 2 +- syn/token/struct.As.html | 2 +- syn/token/struct.Async.html | 2 +- syn/token/struct.At.html | 2 +- syn/token/struct.Auto.html | 2 +- syn/token/struct.Await.html | 2 +- syn/token/struct.Become.html | 2 +- syn/token/struct.Box.html | 2 +- syn/token/struct.Brace.html | 2 +- syn/token/struct.Bracket.html | 2 +- syn/token/struct.Break.html | 2 +- syn/token/struct.Caret.html | 2 +- syn/token/struct.CaretEq.html | 2 +- syn/token/struct.Colon.html | 2 +- syn/token/struct.Comma.html | 2 +- syn/token/struct.Const.html | 2 +- syn/token/struct.Continue.html | 2 +- syn/token/struct.Crate.html | 2 +- syn/token/struct.Default.html | 2 +- syn/token/struct.Do.html | 2 +- syn/token/struct.Dollar.html | 2 +- syn/token/struct.Dot.html | 2 +- syn/token/struct.DotDot.html | 2 +- syn/token/struct.DotDotDot.html | 2 +- syn/token/struct.DotDotEq.html | 2 +- syn/token/struct.Dyn.html | 2 +- syn/token/struct.Else.html | 2 +- syn/token/struct.Enum.html | 2 +- syn/token/struct.Eq.html | 2 +- syn/token/struct.EqEq.html | 2 +- syn/token/struct.Extern.html | 2 +- syn/token/struct.FatArrow.html | 2 +- syn/token/struct.Final.html | 2 +- syn/token/struct.Fn.html | 2 +- syn/token/struct.For.html | 2 +- syn/token/struct.Ge.html | 2 +- syn/token/struct.Group.html | 2 +- syn/token/struct.Gt.html | 2 +- syn/token/struct.If.html | 2 +- syn/token/struct.Impl.html | 2 +- syn/token/struct.In.html | 2 +- syn/token/struct.LArrow.html | 2 +- syn/token/struct.Le.html | 2 +- syn/token/struct.Let.html | 2 +- syn/token/struct.Loop.html | 2 +- syn/token/struct.Lt.html | 2 +- syn/token/struct.Macro.html | 2 +- syn/token/struct.Match.html | 2 +- syn/token/struct.Minus.html | 2 +- syn/token/struct.MinusEq.html | 2 +- syn/token/struct.Mod.html | 2 +- syn/token/struct.Move.html | 2 +- syn/token/struct.Mut.html | 2 +- syn/token/struct.Ne.html | 2 +- syn/token/struct.Not.html | 2 +- syn/token/struct.Or.html | 2 +- syn/token/struct.OrEq.html | 2 +- syn/token/struct.OrOr.html | 2 +- syn/token/struct.Override.html | 2 +- syn/token/struct.Paren.html | 2 +- syn/token/struct.PathSep.html | 2 +- syn/token/struct.Percent.html | 2 +- syn/token/struct.PercentEq.html | 2 +- syn/token/struct.Plus.html | 2 +- syn/token/struct.PlusEq.html | 2 +- syn/token/struct.Pound.html | 2 +- syn/token/struct.Priv.html | 2 +- syn/token/struct.Pub.html | 2 +- syn/token/struct.Question.html | 2 +- syn/token/struct.RArrow.html | 2 +- syn/token/struct.Ref.html | 2 +- syn/token/struct.Return.html | 2 +- syn/token/struct.SelfType.html | 2 +- syn/token/struct.SelfValue.html | 2 +- syn/token/struct.Semi.html | 2 +- syn/token/struct.Shl.html | 2 +- syn/token/struct.ShlEq.html | 2 +- syn/token/struct.Shr.html | 2 +- syn/token/struct.ShrEq.html | 2 +- syn/token/struct.Slash.html | 2 +- syn/token/struct.SlashEq.html | 2 +- syn/token/struct.Star.html | 2 +- syn/token/struct.StarEq.html | 2 +- syn/token/struct.Static.html | 2 +- syn/token/struct.Struct.html | 2 +- syn/token/struct.Super.html | 2 +- syn/token/struct.Tilde.html | 2 +- syn/token/struct.Trait.html | 2 +- syn/token/struct.Try.html | 2 +- syn/token/struct.Type.html | 2 +- syn/token/struct.Typeof.html | 2 +- syn/token/struct.Underscore.html | 2 +- syn/token/struct.Union.html | 2 +- syn/token/struct.Unsafe.html | 2 +- syn/token/struct.Unsized.html | 2 +- syn/token/struct.Use.html | 2 +- syn/token/struct.Virtual.html | 2 +- syn/token/struct.Where.html | 2 +- syn/token/struct.While.html | 2 +- syn/token/struct.Yield.html | 2 +- syn/token/trait.Token.html | 2 +- syn/type.Result.html | 2 +- syn/visit_mut/fn.visit_abi_mut.html | 2 +- ...angle_bracketed_generic_arguments_mut.html | 2 +- syn/visit_mut/fn.visit_arm_mut.html | 2 +- syn/visit_mut/fn.visit_assoc_const_mut.html | 2 +- syn/visit_mut/fn.visit_assoc_type_mut.html | 2 +- syn/visit_mut/fn.visit_attr_style_mut.html | 2 +- syn/visit_mut/fn.visit_attribute_mut.html | 2 +- syn/visit_mut/fn.visit_bare_fn_arg_mut.html | 2 +- syn/visit_mut/fn.visit_bare_variadic_mut.html | 2 +- syn/visit_mut/fn.visit_bin_op_mut.html | 2 +- syn/visit_mut/fn.visit_block_mut.html | 2 +- .../fn.visit_bound_lifetimes_mut.html | 2 +- syn/visit_mut/fn.visit_const_param_mut.html | 2 +- syn/visit_mut/fn.visit_constraint_mut.html | 2 +- syn/visit_mut/fn.visit_data_enum_mut.html | 2 +- syn/visit_mut/fn.visit_data_mut.html | 2 +- syn/visit_mut/fn.visit_data_struct_mut.html | 2 +- syn/visit_mut/fn.visit_data_union_mut.html | 2 +- syn/visit_mut/fn.visit_derive_input_mut.html | 2 +- syn/visit_mut/fn.visit_expr_array_mut.html | 2 +- syn/visit_mut/fn.visit_expr_assign_mut.html | 2 +- syn/visit_mut/fn.visit_expr_async_mut.html | 2 +- syn/visit_mut/fn.visit_expr_await_mut.html | 2 +- syn/visit_mut/fn.visit_expr_binary_mut.html | 2 +- syn/visit_mut/fn.visit_expr_block_mut.html | 2 +- syn/visit_mut/fn.visit_expr_break_mut.html | 2 +- syn/visit_mut/fn.visit_expr_call_mut.html | 2 +- syn/visit_mut/fn.visit_expr_cast_mut.html | 2 +- syn/visit_mut/fn.visit_expr_closure_mut.html | 2 +- syn/visit_mut/fn.visit_expr_const_mut.html | 2 +- syn/visit_mut/fn.visit_expr_continue_mut.html | 2 +- syn/visit_mut/fn.visit_expr_field_mut.html | 2 +- syn/visit_mut/fn.visit_expr_for_loop_mut.html | 2 +- syn/visit_mut/fn.visit_expr_group_mut.html | 2 +- syn/visit_mut/fn.visit_expr_if_mut.html | 2 +- syn/visit_mut/fn.visit_expr_index_mut.html | 2 +- syn/visit_mut/fn.visit_expr_infer_mut.html | 2 +- syn/visit_mut/fn.visit_expr_let_mut.html | 2 +- syn/visit_mut/fn.visit_expr_lit_mut.html | 2 +- syn/visit_mut/fn.visit_expr_loop_mut.html | 2 +- syn/visit_mut/fn.visit_expr_macro_mut.html | 2 +- syn/visit_mut/fn.visit_expr_match_mut.html | 2 +- .../fn.visit_expr_method_call_mut.html | 2 +- syn/visit_mut/fn.visit_expr_mut.html | 2 +- syn/visit_mut/fn.visit_expr_paren_mut.html | 2 +- syn/visit_mut/fn.visit_expr_path_mut.html | 2 +- syn/visit_mut/fn.visit_expr_range_mut.html | 2 +- .../fn.visit_expr_reference_mut.html | 2 +- syn/visit_mut/fn.visit_expr_repeat_mut.html | 2 +- syn/visit_mut/fn.visit_expr_return_mut.html | 2 +- syn/visit_mut/fn.visit_expr_struct_mut.html | 2 +- .../fn.visit_expr_try_block_mut.html | 2 +- syn/visit_mut/fn.visit_expr_try_mut.html | 2 +- syn/visit_mut/fn.visit_expr_tuple_mut.html | 2 +- syn/visit_mut/fn.visit_expr_unary_mut.html | 2 +- syn/visit_mut/fn.visit_expr_unsafe_mut.html | 2 +- syn/visit_mut/fn.visit_expr_while_mut.html | 2 +- syn/visit_mut/fn.visit_expr_yield_mut.html | 2 +- syn/visit_mut/fn.visit_field_mut.html | 2 +- .../fn.visit_field_mutability_mut.html | 2 +- syn/visit_mut/fn.visit_field_pat_mut.html | 2 +- syn/visit_mut/fn.visit_field_value_mut.html | 2 +- syn/visit_mut/fn.visit_fields_mut.html | 2 +- syn/visit_mut/fn.visit_fields_named_mut.html | 2 +- .../fn.visit_fields_unnamed_mut.html | 2 +- syn/visit_mut/fn.visit_file_mut.html | 2 +- syn/visit_mut/fn.visit_fn_arg_mut.html | 2 +- .../fn.visit_foreign_item_fn_mut.html | 2 +- .../fn.visit_foreign_item_macro_mut.html | 2 +- syn/visit_mut/fn.visit_foreign_item_mut.html | 2 +- .../fn.visit_foreign_item_static_mut.html | 2 +- .../fn.visit_foreign_item_type_mut.html | 2 +- .../fn.visit_generic_argument_mut.html | 2 +- syn/visit_mut/fn.visit_generic_param_mut.html | 2 +- syn/visit_mut/fn.visit_generics_mut.html | 2 +- syn/visit_mut/fn.visit_ident_mut.html | 2 +- .../fn.visit_impl_item_const_mut.html | 2 +- syn/visit_mut/fn.visit_impl_item_fn_mut.html | 2 +- .../fn.visit_impl_item_macro_mut.html | 2 +- syn/visit_mut/fn.visit_impl_item_mut.html | 2 +- .../fn.visit_impl_item_type_mut.html | 2 +- .../fn.visit_impl_restriction_mut.html | 2 +- syn/visit_mut/fn.visit_index_mut.html | 2 +- syn/visit_mut/fn.visit_item_const_mut.html | 2 +- syn/visit_mut/fn.visit_item_enum_mut.html | 2 +- .../fn.visit_item_extern_crate_mut.html | 2 +- syn/visit_mut/fn.visit_item_fn_mut.html | 2 +- .../fn.visit_item_foreign_mod_mut.html | 2 +- syn/visit_mut/fn.visit_item_impl_mut.html | 2 +- syn/visit_mut/fn.visit_item_macro_mut.html | 2 +- syn/visit_mut/fn.visit_item_mod_mut.html | 2 +- syn/visit_mut/fn.visit_item_mut.html | 2 +- syn/visit_mut/fn.visit_item_static_mut.html | 2 +- syn/visit_mut/fn.visit_item_struct_mut.html | 2 +- .../fn.visit_item_trait_alias_mut.html | 2 +- syn/visit_mut/fn.visit_item_trait_mut.html | 2 +- syn/visit_mut/fn.visit_item_type_mut.html | 2 +- syn/visit_mut/fn.visit_item_union_mut.html | 2 +- syn/visit_mut/fn.visit_item_use_mut.html | 2 +- syn/visit_mut/fn.visit_label_mut.html | 2 +- syn/visit_mut/fn.visit_lifetime_mut.html | 2 +- .../fn.visit_lifetime_param_mut.html | 2 +- syn/visit_mut/fn.visit_lit_bool_mut.html | 2 +- syn/visit_mut/fn.visit_lit_byte_mut.html | 2 +- syn/visit_mut/fn.visit_lit_byte_str_mut.html | 2 +- syn/visit_mut/fn.visit_lit_char_mut.html | 2 +- syn/visit_mut/fn.visit_lit_cstr_mut.html | 2 +- syn/visit_mut/fn.visit_lit_float_mut.html | 2 +- syn/visit_mut/fn.visit_lit_int_mut.html | 2 +- syn/visit_mut/fn.visit_lit_mut.html | 2 +- syn/visit_mut/fn.visit_lit_str_mut.html | 2 +- syn/visit_mut/fn.visit_local_init_mut.html | 2 +- syn/visit_mut/fn.visit_local_mut.html | 2 +- .../fn.visit_macro_delimiter_mut.html | 2 +- syn/visit_mut/fn.visit_macro_mut.html | 2 +- syn/visit_mut/fn.visit_member_mut.html | 2 +- syn/visit_mut/fn.visit_meta_list_mut.html | 2 +- syn/visit_mut/fn.visit_meta_mut.html | 2 +- .../fn.visit_meta_name_value_mut.html | 2 +- ...t_parenthesized_generic_arguments_mut.html | 2 +- syn/visit_mut/fn.visit_pat_ident_mut.html | 2 +- syn/visit_mut/fn.visit_pat_mut.html | 2 +- syn/visit_mut/fn.visit_pat_or_mut.html | 2 +- syn/visit_mut/fn.visit_pat_paren_mut.html | 2 +- syn/visit_mut/fn.visit_pat_reference_mut.html | 2 +- syn/visit_mut/fn.visit_pat_rest_mut.html | 2 +- syn/visit_mut/fn.visit_pat_slice_mut.html | 2 +- syn/visit_mut/fn.visit_pat_struct_mut.html | 2 +- syn/visit_mut/fn.visit_pat_tuple_mut.html | 2 +- .../fn.visit_pat_tuple_struct_mut.html | 2 +- syn/visit_mut/fn.visit_pat_type_mut.html | 2 +- syn/visit_mut/fn.visit_pat_wild_mut.html | 2 +- .../fn.visit_path_arguments_mut.html | 2 +- syn/visit_mut/fn.visit_path_mut.html | 2 +- syn/visit_mut/fn.visit_path_segment_mut.html | 2 +- .../fn.visit_predicate_lifetime_mut.html | 2 +- .../fn.visit_predicate_type_mut.html | 2 +- syn/visit_mut/fn.visit_qself_mut.html | 2 +- syn/visit_mut/fn.visit_range_limits_mut.html | 2 +- syn/visit_mut/fn.visit_receiver_mut.html | 2 +- syn/visit_mut/fn.visit_return_type_mut.html | 2 +- syn/visit_mut/fn.visit_signature_mut.html | 2 +- syn/visit_mut/fn.visit_span_mut.html | 2 +- .../fn.visit_static_mutability_mut.html | 2 +- syn/visit_mut/fn.visit_stmt_macro_mut.html | 2 +- syn/visit_mut/fn.visit_stmt_mut.html | 2 +- .../fn.visit_trait_bound_modifier_mut.html | 2 +- syn/visit_mut/fn.visit_trait_bound_mut.html | 2 +- .../fn.visit_trait_item_const_mut.html | 2 +- syn/visit_mut/fn.visit_trait_item_fn_mut.html | 2 +- .../fn.visit_trait_item_macro_mut.html | 2 +- syn/visit_mut/fn.visit_trait_item_mut.html | 2 +- .../fn.visit_trait_item_type_mut.html | 2 +- syn/visit_mut/fn.visit_type_array_mut.html | 2 +- syn/visit_mut/fn.visit_type_bare_fn_mut.html | 2 +- syn/visit_mut/fn.visit_type_group_mut.html | 2 +- .../fn.visit_type_impl_trait_mut.html | 2 +- syn/visit_mut/fn.visit_type_infer_mut.html | 2 +- syn/visit_mut/fn.visit_type_macro_mut.html | 2 +- syn/visit_mut/fn.visit_type_mut.html | 2 +- syn/visit_mut/fn.visit_type_never_mut.html | 2 +- .../fn.visit_type_param_bound_mut.html | 2 +- syn/visit_mut/fn.visit_type_param_mut.html | 2 +- syn/visit_mut/fn.visit_type_paren_mut.html | 2 +- syn/visit_mut/fn.visit_type_path_mut.html | 2 +- syn/visit_mut/fn.visit_type_ptr_mut.html | 2 +- .../fn.visit_type_reference_mut.html | 2 +- syn/visit_mut/fn.visit_type_slice_mut.html | 2 +- .../fn.visit_type_trait_object_mut.html | 2 +- syn/visit_mut/fn.visit_type_tuple_mut.html | 2 +- syn/visit_mut/fn.visit_un_op_mut.html | 2 +- syn/visit_mut/fn.visit_use_glob_mut.html | 2 +- syn/visit_mut/fn.visit_use_group_mut.html | 2 +- syn/visit_mut/fn.visit_use_name_mut.html | 2 +- syn/visit_mut/fn.visit_use_path_mut.html | 2 +- syn/visit_mut/fn.visit_use_rename_mut.html | 2 +- syn/visit_mut/fn.visit_use_tree_mut.html | 2 +- syn/visit_mut/fn.visit_variadic_mut.html | 2 +- syn/visit_mut/fn.visit_variant_mut.html | 2 +- .../fn.visit_vis_restricted_mut.html | 2 +- syn/visit_mut/fn.visit_visibility_mut.html | 2 +- syn/visit_mut/fn.visit_where_clause_mut.html | 2 +- .../fn.visit_where_predicate_mut.html | 2 +- syn/visit_mut/index.html | 2 +- syn/visit_mut/trait.VisitMut.html | 2 +- tracing/span/struct.EnteredSpan.html | 2 +- trait.impl/core/clone/trait.Clone.js | 2 + trait.impl/core/cmp/trait.Eq.js | 2 + trait.impl/core/cmp/trait.Ord.js | 1 + trait.impl/core/cmp/trait.PartialEq.js | 2 + trait.impl/core/cmp/trait.PartialOrd.js | 1 + trait.impl/core/convert/trait.From.js | 2 + trait.impl/core/default/trait.Default.js | 2 + trait.impl/core/error/trait.Error.js | 2 + trait.impl/core/fmt/trait.Debug.js | 3 + trait.impl/core/fmt/trait.Display.js | 3 + trait.impl/core/hash/trait.Hash.js | 1 + .../core/iter/traits/collect/trait.Extend.js | 2 + .../iter/traits/collect/trait.FromIterator.js | 2 + .../iter/traits/collect/trait.IntoIterator.js | 2 + .../double_ended/trait.DoubleEndedIterator.js | 1 + .../exact_size/trait.ExactSizeIterator.js | 2 + .../iter/traits/iterator/trait.Iterator.js | 2 + .../iter/traits/marker/trait.FusedIterator.js | 2 + trait.impl/core/marker/trait.Freeze.js | 3 + trait.impl/core/marker/trait.Send.js | 3 + trait.impl/core/marker/trait.Sized.js | 3 + .../core/marker/trait.StructuralPartialEq.js | 2 + trait.impl/core/marker/trait.Sync.js | 3 + trait.impl/core/marker/trait.Unpin.js | 5 +- trait.impl/core/ops/arith/trait.Sub.js | 2 + trait.impl/core/ops/bit/trait.BitAnd.js | 4 + trait.impl/core/ops/bit/trait.BitOr.js | 4 +- trait.impl/core/ops/bit/trait.BitXor.js | 4 + trait.impl/core/ops/drop/trait.Drop.js | 2 + trait.impl/core/ops/index/trait.Index.js | 2 + trait.impl/core/ops/index/trait.IndexMut.js | 1 + .../panic/unwind_safe/trait.RefUnwindSafe.js | 3 + .../panic/unwind_safe/trait.UnwindSafe.js | 5 +- trait.impl/equivalent/trait.Comparable.js | 3 + trait.impl/equivalent/trait.Equivalent.js | 4 + trait.impl/hashbrown/trait.Equivalent.js | 3 + .../core/raw_entry_v1/trait.RawEntryApiV1.js | 3 + .../indexmap/map/mutable/trait.MutableKeys.js | 3 + .../set/mutable/trait.MutableValues.js | 3 + trait.impl/serde/de/trait.Deserialize.js | 2 +- trait.impl/serde/ser/trait.Serialize.js | 2 +- type.impl/core/result/enum.Result.js | 2 +- 1106 files changed, 147589 insertions(+), 4506 deletions(-) create mode 100644 equivalent/all.html create mode 100644 equivalent/index.html create mode 100644 equivalent/sidebar-items.js create mode 100644 equivalent/trait.Comparable.html create mode 100644 equivalent/trait.Equivalent.html create mode 100644 hashbrown/all.html create mode 100644 hashbrown/enum.TryReserveError.html create mode 100644 hashbrown/hash_map/enum.DefaultHashBuilder.html create mode 100644 hashbrown/hash_map/enum.Entry.html create mode 100644 hashbrown/hash_map/enum.EntryRef.html create mode 100644 hashbrown/hash_map/enum.RawEntryMut.html create mode 100644 hashbrown/hash_map/index.html create mode 100644 hashbrown/hash_map/sidebar-items.js create mode 100644 hashbrown/hash_map/struct.Drain.html create mode 100644 hashbrown/hash_map/struct.ExtractIf.html create mode 100644 hashbrown/hash_map/struct.HashMap.html create mode 100644 hashbrown/hash_map/struct.IntoIter.html create mode 100644 hashbrown/hash_map/struct.IntoKeys.html create mode 100644 hashbrown/hash_map/struct.IntoValues.html create mode 100644 hashbrown/hash_map/struct.Iter.html create mode 100644 hashbrown/hash_map/struct.IterMut.html create mode 100644 hashbrown/hash_map/struct.Keys.html create mode 100644 hashbrown/hash_map/struct.OccupiedEntry.html create mode 100644 hashbrown/hash_map/struct.OccupiedEntryRef.html create mode 100644 hashbrown/hash_map/struct.OccupiedError.html create mode 100644 hashbrown/hash_map/struct.RawEntryBuilder.html create mode 100644 hashbrown/hash_map/struct.RawEntryBuilderMut.html create mode 100644 hashbrown/hash_map/struct.RawOccupiedEntryMut.html create mode 100644 hashbrown/hash_map/struct.RawVacantEntryMut.html create mode 100644 hashbrown/hash_map/struct.VacantEntry.html create mode 100644 hashbrown/hash_map/struct.VacantEntryRef.html create mode 100644 hashbrown/hash_map/struct.Values.html create mode 100644 hashbrown/hash_map/struct.ValuesMut.html create mode 100644 hashbrown/hash_set/enum.Entry.html create mode 100644 hashbrown/hash_set/index.html create mode 100644 hashbrown/hash_set/sidebar-items.js create mode 100644 hashbrown/hash_set/struct.Difference.html create mode 100644 hashbrown/hash_set/struct.Drain.html create mode 100644 hashbrown/hash_set/struct.ExtractIf.html create mode 100644 hashbrown/hash_set/struct.HashSet.html create mode 100644 hashbrown/hash_set/struct.Intersection.html create mode 100644 hashbrown/hash_set/struct.IntoIter.html create mode 100644 hashbrown/hash_set/struct.Iter.html create mode 100644 hashbrown/hash_set/struct.OccupiedEntry.html create mode 100644 hashbrown/hash_set/struct.SymmetricDifference.html create mode 100644 hashbrown/hash_set/struct.Union.html create mode 100644 hashbrown/hash_set/struct.VacantEntry.html create mode 100644 hashbrown/hash_table/enum.Entry.html create mode 100644 hashbrown/hash_table/index.html create mode 100644 hashbrown/hash_table/sidebar-items.js create mode 100644 hashbrown/hash_table/struct.AbsentEntry.html create mode 100644 hashbrown/hash_table/struct.Drain.html create mode 100644 hashbrown/hash_table/struct.ExtractIf.html create mode 100644 hashbrown/hash_table/struct.HashTable.html create mode 100644 hashbrown/hash_table/struct.IntoIter.html create mode 100644 hashbrown/hash_table/struct.Iter.html create mode 100644 hashbrown/hash_table/struct.IterMut.html create mode 100644 hashbrown/hash_table/struct.OccupiedEntry.html create mode 100644 hashbrown/hash_table/struct.VacantEntry.html create mode 100644 hashbrown/index.html create mode 100644 hashbrown/map/enum.DefaultHashBuilder.html create mode 100644 hashbrown/map/enum.Entry.html create mode 100644 hashbrown/map/enum.EntryRef.html create mode 100644 hashbrown/map/enum.RawEntryMut.html create mode 100644 hashbrown/map/struct.Drain.html create mode 100644 hashbrown/map/struct.ExtractIf.html create mode 100644 hashbrown/map/struct.HashMap.html create mode 100644 hashbrown/map/struct.IntoIter.html create mode 100644 hashbrown/map/struct.IntoKeys.html create mode 100644 hashbrown/map/struct.IntoValues.html create mode 100644 hashbrown/map/struct.Iter.html create mode 100644 hashbrown/map/struct.IterMut.html create mode 100644 hashbrown/map/struct.Keys.html create mode 100644 hashbrown/map/struct.OccupiedEntry.html create mode 100644 hashbrown/map/struct.OccupiedEntryRef.html create mode 100644 hashbrown/map/struct.OccupiedError.html create mode 100644 hashbrown/map/struct.RawEntryBuilder.html create mode 100644 hashbrown/map/struct.RawEntryBuilderMut.html create mode 100644 hashbrown/map/struct.RawOccupiedEntryMut.html create mode 100644 hashbrown/map/struct.RawVacantEntryMut.html create mode 100644 hashbrown/map/struct.VacantEntry.html create mode 100644 hashbrown/map/struct.VacantEntryRef.html create mode 100644 hashbrown/map/struct.Values.html create mode 100644 hashbrown/map/struct.ValuesMut.html create mode 100644 hashbrown/raw/index.html create mode 100644 hashbrown/raw/inner/struct.Bucket.html create mode 100644 hashbrown/raw/inner/struct.InsertSlot.html create mode 100644 hashbrown/raw/inner/struct.RawDrain.html create mode 100644 hashbrown/raw/inner/struct.RawIntoIter.html create mode 100644 hashbrown/raw/inner/struct.RawIter.html create mode 100644 hashbrown/raw/inner/struct.RawIterHash.html create mode 100644 hashbrown/raw/inner/struct.RawTable.html create mode 100644 hashbrown/raw/sidebar-items.js create mode 100644 hashbrown/raw/struct.Bucket.html create mode 100644 hashbrown/raw/struct.InsertSlot.html create mode 100644 hashbrown/raw/struct.RawDrain.html create mode 100644 hashbrown/raw/struct.RawIntoIter.html create mode 100644 hashbrown/raw/struct.RawIter.html create mode 100644 hashbrown/raw/struct.RawIterHash.html create mode 100644 hashbrown/raw/struct.RawTable.html create mode 100644 hashbrown/set/enum.Entry.html create mode 100644 hashbrown/set/struct.Difference.html create mode 100644 hashbrown/set/struct.Drain.html create mode 100644 hashbrown/set/struct.ExtractIf.html create mode 100644 hashbrown/set/struct.HashSet.html create mode 100644 hashbrown/set/struct.Intersection.html create mode 100644 hashbrown/set/struct.IntoIter.html create mode 100644 hashbrown/set/struct.Iter.html create mode 100644 hashbrown/set/struct.OccupiedEntry.html create mode 100644 hashbrown/set/struct.SymmetricDifference.html create mode 100644 hashbrown/set/struct.Union.html create mode 100644 hashbrown/set/struct.VacantEntry.html create mode 100644 hashbrown/sidebar-items.js create mode 100644 hashbrown/struct.HashMap.html create mode 100644 hashbrown/struct.HashSet.html create mode 100644 hashbrown/struct.HashTable.html create mode 100644 hashbrown/table/enum.Entry.html create mode 100644 hashbrown/table/struct.AbsentEntry.html create mode 100644 hashbrown/table/struct.Drain.html create mode 100644 hashbrown/table/struct.ExtractIf.html create mode 100644 hashbrown/table/struct.HashTable.html create mode 100644 hashbrown/table/struct.IntoIter.html create mode 100644 hashbrown/table/struct.Iter.html create mode 100644 hashbrown/table/struct.IterMut.html create mode 100644 hashbrown/table/struct.OccupiedEntry.html create mode 100644 hashbrown/table/struct.VacantEntry.html create mode 100644 hashbrown/trait.Equivalent.html create mode 100644 indexmap/all.html create mode 100644 indexmap/index.html create mode 100644 indexmap/macro.indexmap!.html create mode 100644 indexmap/macro.indexmap.html create mode 100644 indexmap/macro.indexset!.html create mode 100644 indexmap/macro.indexset.html create mode 100644 indexmap/map/core/entry/enum.Entry.html create mode 100644 indexmap/map/core/entry/struct.IndexedEntry.html create mode 100644 indexmap/map/core/entry/struct.OccupiedEntry.html create mode 100644 indexmap/map/core/entry/struct.VacantEntry.html create mode 100644 indexmap/map/core/raw_entry_v1/enum.RawEntryMut.html create mode 100644 indexmap/map/core/raw_entry_v1/index.html create mode 100644 indexmap/map/core/raw_entry_v1/struct.RawEntryBuilder.html create mode 100644 indexmap/map/core/raw_entry_v1/struct.RawEntryBuilderMut.html create mode 100644 indexmap/map/core/raw_entry_v1/struct.RawOccupiedEntryMut.html create mode 100644 indexmap/map/core/raw_entry_v1/struct.RawVacantEntryMut.html create mode 100644 indexmap/map/core/raw_entry_v1/trait.RawEntryApiV1.html create mode 100644 indexmap/map/enum.Entry.html create mode 100644 indexmap/map/index.html create mode 100644 indexmap/map/iter/struct.Drain.html create mode 100644 indexmap/map/iter/struct.IntoIter.html create mode 100644 indexmap/map/iter/struct.IntoKeys.html create mode 100644 indexmap/map/iter/struct.IntoValues.html create mode 100644 indexmap/map/iter/struct.Iter.html create mode 100644 indexmap/map/iter/struct.IterMut.html create mode 100644 indexmap/map/iter/struct.Keys.html create mode 100644 indexmap/map/iter/struct.Splice.html create mode 100644 indexmap/map/iter/struct.Values.html create mode 100644 indexmap/map/iter/struct.ValuesMut.html create mode 100644 indexmap/map/mutable/trait.MutableKeys.html create mode 100644 indexmap/map/raw_entry_v1/enum.RawEntryMut.html create mode 100644 indexmap/map/raw_entry_v1/index.html create mode 100644 indexmap/map/raw_entry_v1/sidebar-items.js create mode 100644 indexmap/map/raw_entry_v1/struct.RawEntryBuilder.html create mode 100644 indexmap/map/raw_entry_v1/struct.RawEntryBuilderMut.html create mode 100644 indexmap/map/raw_entry_v1/struct.RawOccupiedEntryMut.html create mode 100644 indexmap/map/raw_entry_v1/struct.RawVacantEntryMut.html create mode 100644 indexmap/map/raw_entry_v1/trait.RawEntryApiV1.html create mode 100644 indexmap/map/sidebar-items.js create mode 100644 indexmap/map/slice/struct.Slice.html create mode 100644 indexmap/map/struct.Drain.html create mode 100644 indexmap/map/struct.IndexMap.html create mode 100644 indexmap/map/struct.IndexedEntry.html create mode 100644 indexmap/map/struct.IntoIter.html create mode 100644 indexmap/map/struct.IntoKeys.html create mode 100644 indexmap/map/struct.IntoValues.html create mode 100644 indexmap/map/struct.Iter.html create mode 100644 indexmap/map/struct.IterMut.html create mode 100644 indexmap/map/struct.Keys.html create mode 100644 indexmap/map/struct.OccupiedEntry.html create mode 100644 indexmap/map/struct.Slice.html create mode 100644 indexmap/map/struct.Splice.html create mode 100644 indexmap/map/struct.VacantEntry.html create mode 100644 indexmap/map/struct.Values.html create mode 100644 indexmap/map/struct.ValuesMut.html create mode 100644 indexmap/map/trait.MutableKeys.html create mode 100644 indexmap/map/trait.RawEntryApiV1.html create mode 100644 indexmap/set/index.html create mode 100644 indexmap/set/iter/struct.Difference.html create mode 100644 indexmap/set/iter/struct.Drain.html create mode 100644 indexmap/set/iter/struct.Intersection.html create mode 100644 indexmap/set/iter/struct.IntoIter.html create mode 100644 indexmap/set/iter/struct.Iter.html create mode 100644 indexmap/set/iter/struct.Splice.html create mode 100644 indexmap/set/iter/struct.SymmetricDifference.html create mode 100644 indexmap/set/iter/struct.Union.html create mode 100644 indexmap/set/mutable/trait.MutableValues.html create mode 100644 indexmap/set/sidebar-items.js create mode 100644 indexmap/set/slice/struct.Slice.html create mode 100644 indexmap/set/struct.Difference.html create mode 100644 indexmap/set/struct.Drain.html create mode 100644 indexmap/set/struct.IndexSet.html create mode 100644 indexmap/set/struct.Intersection.html create mode 100644 indexmap/set/struct.IntoIter.html create mode 100644 indexmap/set/struct.Iter.html create mode 100644 indexmap/set/struct.Slice.html create mode 100644 indexmap/set/struct.Splice.html create mode 100644 indexmap/set/struct.SymmetricDifference.html create mode 100644 indexmap/set/struct.Union.html create mode 100644 indexmap/set/trait.MutableValues.html create mode 100644 indexmap/sidebar-items.js create mode 100644 indexmap/struct.TryReserveError.html create mode 100644 indexmap/trait.Equivalent.html create mode 100644 json_unflattening/all.html create mode 100644 json_unflattening/errors/enum.Error.html create mode 100644 json_unflattening/errors/index.html create mode 100644 json_unflattening/errors/sidebar-items.js create mode 100644 json_unflattening/flattening/fn.flatten.html create mode 100644 json_unflattening/flattening/index.html create mode 100644 json_unflattening/flattening/sidebar-items.js create mode 100644 json_unflattening/index.html create mode 100644 json_unflattening/sidebar-items.js create mode 100644 json_unflattening/unflattening/fn.unflatten.html create mode 100644 json_unflattening/unflattening/index.html create mode 100644 json_unflattening/unflattening/sidebar-items.js create mode 100644 src/equivalent/lib.rs.html create mode 100644 src/hashbrown/external_trait_impls/mod.rs.html create mode 100644 src/hashbrown/lib.rs.html create mode 100644 src/hashbrown/macros.rs.html create mode 100644 src/hashbrown/map.rs.html create mode 100644 src/hashbrown/raw/alloc.rs.html create mode 100644 src/hashbrown/raw/bitmask.rs.html create mode 100644 src/hashbrown/raw/mod.rs.html create mode 100644 src/hashbrown/raw/sse2.rs.html create mode 100644 src/hashbrown/scopeguard.rs.html create mode 100644 src/hashbrown/set.rs.html create mode 100644 src/hashbrown/table.rs.html create mode 100644 src/indexmap/arbitrary.rs.html create mode 100644 src/indexmap/lib.rs.html create mode 100644 src/indexmap/macros.rs.html create mode 100644 src/indexmap/map.rs.html create mode 100644 src/indexmap/map/core.rs.html create mode 100644 src/indexmap/map/core/entry.rs.html create mode 100644 src/indexmap/map/core/raw.rs.html create mode 100644 src/indexmap/map/core/raw_entry_v1.rs.html create mode 100644 src/indexmap/map/iter.rs.html create mode 100644 src/indexmap/map/mutable.rs.html create mode 100644 src/indexmap/map/slice.rs.html create mode 100644 src/indexmap/set.rs.html create mode 100644 src/indexmap/set/iter.rs.html create mode 100644 src/indexmap/set/mutable.rs.html create mode 100644 src/indexmap/set/slice.rs.html create mode 100644 src/indexmap/util.rs.html create mode 100644 src/json_unflattening/errors.rs.html create mode 100644 src/json_unflattening/flattening.rs.html create mode 100644 src/json_unflattening/lib.rs.html create mode 100644 src/json_unflattening/unflattening.rs.html create mode 100644 src/regex_syntax/unicode_tables/age.rs.html create mode 100644 src/regex_syntax/unicode_tables/case_folding_simple.rs.html create mode 100644 src/regex_syntax/unicode_tables/general_category.rs.html create mode 100644 src/regex_syntax/unicode_tables/grapheme_cluster_break.rs.html create mode 100644 src/regex_syntax/unicode_tables/perl_word.rs.html create mode 100644 src/regex_syntax/unicode_tables/property_bool.rs.html create mode 100644 src/regex_syntax/unicode_tables/property_names.rs.html create mode 100644 src/regex_syntax/unicode_tables/property_values.rs.html create mode 100644 src/regex_syntax/unicode_tables/script.rs.html create mode 100644 src/regex_syntax/unicode_tables/script_extension.rs.html create mode 100644 src/regex_syntax/unicode_tables/sentence_break.rs.html create mode 100644 src/regex_syntax/unicode_tables/word_break.rs.html delete mode 100644 src/syn/gen_helper.rs.html create mode 100644 trait.impl/core/marker/trait.Sized.js create mode 100644 trait.impl/core/ops/bit/trait.BitAnd.js create mode 100644 trait.impl/core/ops/bit/trait.BitXor.js create mode 100644 trait.impl/equivalent/trait.Comparable.js create mode 100644 trait.impl/equivalent/trait.Equivalent.js create mode 100644 trait.impl/hashbrown/trait.Equivalent.js create mode 100644 trait.impl/indexmap/map/core/raw_entry_v1/trait.RawEntryApiV1.js create mode 100644 trait.impl/indexmap/map/mutable/trait.MutableKeys.js create mode 100644 trait.impl/indexmap/set/mutable/trait.MutableValues.js diff --git a/anyhow/all.html b/anyhow/all.html index 8a72682aad..a6a5907f48 100644 --- a/anyhow/all.html +++ b/anyhow/all.html @@ -1,2 +1,2 @@ -List of all items in this crate
+List of all items in this crate

List of all items

Structs

Traits

Macros

Functions

Type Aliases

\ No newline at end of file diff --git a/anyhow/fn.Ok.html b/anyhow/fn.Ok.html index 3dfac76926..b3e4997321 100644 --- a/anyhow/fn.Ok.html +++ b/anyhow/fn.Ok.html @@ -1,4 +1,4 @@ -Ok in anyhow - Rust
+Ok in anyhow - Rust

Function anyhow::Ok

source · 
pub fn Ok<T>(t: T) -> Result<T>
Expand description

Equivalent to Ok::<_, anyhow::Error>(value).

This simplifies creation of an anyhow::Result in places where type inference cannot deduce the E type of the result — without needing to write diff --git a/anyhow/index.html b/anyhow/index.html index f817cfe470..8c9f301507 100644 --- a/anyhow/index.html +++ b/anyhow/index.html @@ -1,4 +1,4 @@ -anyhow - Rust

Trait Implementations§

source§

impl AsRef<dyn Error> for Error

source§

fn as_ref(&self) -> &(dyn StdError + 'static)

Converts this type into a shared reference of the (usually inferred) input type.
source§

impl AsRef<dyn Error + Send + Sync> for Error

source§

fn as_ref(&self) -> &(dyn StdError + Send + Sync + 'static)

Converts this type into a shared reference of the (usually inferred) input type.
source§

impl Debug for Error

source§

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

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

impl Deref for Error

§

type Target = dyn Error + Send + Sync

The resulting type after dereferencing.
source§

fn deref(&self) -> &Self::Target

Dereferences the value.
source§

impl DerefMut for Error

source§

fn deref_mut(&mut self) -> &mut Self::Target

Mutably dereferences the value.
source§

impl Display for Error

source§

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

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

impl Drop for Error

source§

fn drop(&mut self)

Executes the destructor for this type. Read more
source§

impl<E> From<E> for Error
where - E: StdError + Send + Sync + 'static,

source§

fn from(error: E) -> Self

Converts to this type from the input type.
source§

impl From<Error> for Box<dyn StdError + 'static>

source§

fn from(error: Error) -> Self

Converts to this type from the input type.
source§

impl From<Error> for Box<dyn StdError + Send + 'static>

source§

fn from(error: Error) -> Self

Converts to this type from the input type.
source§

impl From<Error> for Box<dyn StdError + Send + Sync + 'static>

source§

fn from(error: Error) -> Self

Converts to this type from the input type.

Auto Trait Implementations§

§

impl Freeze for Error

§

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 T
where +

Trait Implementations§

source§

impl AsRef<dyn Error> for Error

source§

fn as_ref(&self) -> &(dyn StdError + 'static)

Converts this type into a shared reference of the (usually inferred) input type.
source§

impl AsRef<dyn Error + Send + Sync> for Error

source§

fn as_ref(&self) -> &(dyn StdError + Send + Sync + 'static)

Converts this type into a shared reference of the (usually inferred) input type.
source§

impl Debug for Error

source§

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

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

impl Deref for Error

§

type Target = dyn Error + Send + Sync

The resulting type after dereferencing.
source§

fn deref(&self) -> &Self::Target

Dereferences the value.
source§

impl DerefMut for Error

source§

fn deref_mut(&mut self) -> &mut Self::Target

Mutably dereferences the value.
source§

impl Display for Error

source§

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

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

impl Drop for Error

source§

fn drop(&mut self)

Executes the destructor for this type. Read more
source§

impl<E> From<E> for Error
where + E: StdError + Send + Sync + 'static,

source§

fn from(error: E) -> Self

Converts to this type from the input type.
source§

impl From<Error> for Box<dyn StdError + 'static>

source§

fn from(error: Error) -> Self

Converts to this type from the input type.
source§

impl From<Error> for Box<dyn StdError + Send + 'static>

source§

fn from(error: Error) -> Self

Converts to this type from the input type.
source§

impl From<Error> for Box<dyn StdError + Send + Sync + 'static>

source§

fn from(error: Error) -> Self

Converts to this type from the input type.

Auto Trait Implementations§

§

impl Freeze for Error

§

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 T
where T: 'static + ?Sized,

source§

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more
source§

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

source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
source§

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

source§

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

Mutably borrows from an owned value. Read more
source§

impl<T> From<!> for T

source§

fn from(t: !) -> T

Converts to this type from the input type.
source§

impl<T> From<T> for T

source§

fn from(t: T) -> T

Returns the argument unchanged.

diff --git a/anyhow/trait.Context.html b/anyhow/trait.Context.html index 77f1438e7f..1b9073a740 100644 --- a/anyhow/trait.Context.html +++ b/anyhow/trait.Context.html @@ -1,4 +1,4 @@ -Context in anyhow - Rust
+Context in anyhow - Rust

Trait anyhow::Context

source · 
pub trait Context<T, E>: Sealed {
     // Required methods
     fn context<C>(self, context: C) -> Result<T, Error>
diff --git a/anyhow/type.Result.html b/anyhow/type.Result.html
index 31c1184c7d..6b9fcea230 100644
--- a/anyhow/type.Result.html
+++ b/anyhow/type.Result.html
@@ -1,4 +1,4 @@
-Result in anyhow - Rust

+Result in anyhow - Rust

     
Type Alias anyhow::Result
source · 
pub type Result<T, E = Error> = Result<T, E>;
Expand description
Result<T, Error>

 
This is a reasonable return type to use throughout your application but also
 for fn main; if you do, failures will be printed along with any
diff --git a/crates.js b/crates.js
index 7b786c0f9f..cbd13c74a8 100644
--- a/crates.js
+++ b/crates.js
@@ -1 +1 @@
-window.ALL_CRATES = ["aho_corasick","anstream","anstyle","anstyle_parse","anstyle_query","anyhow","colorchoice","diff","env_filter","env_logger","flatten_json_object","humantime","is_terminal_polyfill","itoa","lil_broker","lil_helper","lil_quad","lil_sym","log","memchr","once_cell","pin_project_lite","pretty_assertions","proc_macro2","quote","regex","regex_automata","regex_syntax","ryu","serde","serde_derive","serde_json","syn","thiserror","thiserror_impl","tracing","tracing_attributes","tracing_core","unicode_ident","utf8parse","yansi"];
\ No newline at end of file
+window.ALL_CRATES = ["aho_corasick","anstream","anstyle","anstyle_parse","anstyle_query","anyhow","colorchoice","diff","env_filter","env_logger","equivalent","flatten_json_object","hashbrown","humantime","indexmap","is_terminal_polyfill","itoa","json_unflattening","lil_broker","lil_helper","lil_quad","lil_sym","log","memchr","once_cell","pin_project_lite","pretty_assertions","proc_macro2","quote","regex","regex_automata","regex_syntax","ryu","serde","serde_derive","serde_json","syn","thiserror","thiserror_impl","tracing","tracing_attributes","tracing_core","unicode_ident","utf8parse","yansi"];
\ No newline at end of file
diff --git a/env_logger/fmt/enum.WriteStyle.html b/env_logger/fmt/enum.WriteStyle.html
index 98f15fbdd2..1882281056 100644
--- a/env_logger/fmt/enum.WriteStyle.html
+++ b/env_logger/fmt/enum.WriteStyle.html
@@ -7,7 +7,7 @@
 
Variants§
§
Auto
Try to print styles, but don’t force the issue.

 
§
Always
Try very hard to print styles.

 
§
Never
Never print styles.

-
Trait Implementations§
source§
impl Clone for WriteStyle
source§
fn clone(&self) -> WriteStyle
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 WriteStyle
source§
fn fmt(&self, f: &mut Formatter<'_>) -> Result
Formats the value using the given formatter. Read more
source§
impl Default for WriteStyle
source§
fn default() -> WriteStyle
Returns the “default value” for a type. Read more
source§
impl From<ColorChoice> for WriteStyle
source§
fn from(choice: ColorChoice) -> Self
Converts to this type from the input type.
source§
impl From<WriteStyle> for ColorChoice
source§
fn from(choice: WriteStyle) -> Self
Converts to this type from the input type.
source§
impl Hash for WriteStyle
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
+
Trait Implementations§
source§
impl Clone for WriteStyle
source§
fn clone(&self) -> WriteStyle
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 WriteStyle
source§
fn fmt(&self, f: &mut Formatter<'_>) -> Result
Formats the value using the given formatter. Read more
source§
impl Default for WriteStyle
source§
fn default() -> WriteStyle
Returns the “default value” for a type. Read more
source§
impl From<ColorChoice> for WriteStyle
source§
fn from(choice: ColorChoice) -> Self
Converts to this type from the input type.
source§
impl From<WriteStyle> for ColorChoice
source§
fn from(choice: WriteStyle) -> Self
Converts to this type from the input type.
source§
impl Hash for WriteStyle
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 PartialEq for WriteStyle
source§
fn eq(&self, other: &WriteStyle) -> 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
diff --git a/equivalent/all.html b/equivalent/all.html
new file mode 100644
index 0000000000..b35d121efb
--- /dev/null
+++ b/equivalent/all.html
@@ -0,0 +1,2 @@
+List of all items in this crate

+    
List of all items
Traits

\ No newline at end of file
diff --git a/equivalent/index.html b/equivalent/index.html
new file mode 100644
index 0000000000..81d6517188
--- /dev/null
+++ b/equivalent/index.html
@@ -0,0 +1,58 @@
+equivalent - Rust

+    
Crate equivalent
source · 
Expand description
Equivalent and Comparable are traits for key comparison in maps.

+
These may be used in the implementation of maps where the lookup type Q
+may be different than the stored key type K.

+
    
+
  • Q: Equivalent<K> checks for equality, similar to the HashMap<K, V>
+constraint K: Borrow<Q>, Q: Eq.
    • 
+
  • Q: Comparable<K> checks the ordering, similar to the BTreeMap<K, V>
+constraint K: Borrow<Q>, Q: Ord.
    • 
+

+
These traits are not used by the maps in the standard library, but they may
+add more flexibility in third-party map implementations, especially in
+situations where a strict K: Borrow<Q> relationship is not available.

+
§Examples

+
use equivalent::*;
+use std::cmp::Ordering;
+
+pub struct Pair<A, B>(pub A, pub B);
+
+impl<'a, A: ?Sized, B: ?Sized, C, D> Equivalent<(C, D)> for Pair<&'a A, &'a B>
+where
+    A: Equivalent<C>,
+    B: Equivalent<D>,
+{
+    fn equivalent(&self, key: &(C, D)) -> bool {
+        self.0.equivalent(&key.0) && self.1.equivalent(&key.1)
+    }
+}
+
+impl<'a, A: ?Sized, B: ?Sized, C, D> Comparable<(C, D)> for Pair<&'a A, &'a B>
+where
+    A: Comparable<C>,
+    B: Comparable<D>,
+{
+    fn compare(&self, key: &(C, D)) -> Ordering {
+        match self.0.compare(&key.0) {
+            Ordering::Equal => self.1.compare(&key.1),
+            not_equal => not_equal,
+        }
+    }
+}
+
+fn main() {
+    let key = (String::from("foo"), String::from("bar"));
+    let q1 = Pair("foo", "bar");
+    let q2 = Pair("boo", "bar");
+    let q3 = Pair("foo", "baz");
+
+    assert!(q1.equivalent(&key));
+    assert!(!q2.equivalent(&key));
+    assert!(!q3.equivalent(&key));
+
+    assert_eq!(q1.compare(&key), Ordering::Equal);
+    assert_eq!(q2.compare(&key), Ordering::Less);
+    assert_eq!(q3.compare(&key), Ordering::Greater);
+}

+
Traits§

\ No newline at end of file
diff --git a/equivalent/sidebar-items.js b/equivalent/sidebar-items.js
new file mode 100644
index 0000000000..53eeda8c81
--- /dev/null
+++ b/equivalent/sidebar-items.js
@@ -0,0 +1 @@
+window.SIDEBAR_ITEMS = {"trait":["Comparable","Equivalent"]};
\ No newline at end of file
diff --git a/equivalent/trait.Comparable.html b/equivalent/trait.Comparable.html
new file mode 100644
index 0000000000..03924fba14
--- /dev/null
+++ b/equivalent/trait.Comparable.html
@@ -0,0 +1,13 @@
+Comparable in equivalent - Rust

+    
Trait equivalent::Comparable
source · 
pub trait Comparable<K: ?Sized>: Equivalent<K> {
+    // Required method
+    fn compare(&self, key: &K) -> Ordering;
+}
Expand description
Key ordering trait.

+
This trait allows ordered map lookup to be customized. It has one blanket
+implementation that uses the regular solution with Borrow and Ord, just
+like BTreeMap does, so that you can pass &str to lookup into a map with
+String keys and so on.

+
Required Methods§
source
fn compare(&self, key: &K) -> Ordering
Compare self to key and return their ordering.

+
Implementors§
source§
impl<Q, K> Comparable<K> for Q
where
+    Q: Ord + ?Sized,
+    K: Borrow<Q> + ?Sized,

\ No newline at end of file
diff --git a/equivalent/trait.Equivalent.html b/equivalent/trait.Equivalent.html
new file mode 100644
index 0000000000..100cd3f89e
--- /dev/null
+++ b/equivalent/trait.Equivalent.html
@@ -0,0 +1,15 @@
+Equivalent in equivalent - Rust

+    
Trait equivalent::Equivalent
source · 
pub trait Equivalent<K: ?Sized> {
+    // Required method
+    fn equivalent(&self, key: &K) -> bool;
+}
Expand description
Key equivalence trait.

+
This trait allows hash table lookup to be customized. It has one blanket
+implementation that uses the regular solution with Borrow and Eq, just
+like HashMap does, so that you can pass &str to lookup into a map with
+String keys and so on.

+
§Contract

+
The implementor must hash like K, if it is hashable.

+
Required Methods§
source
fn equivalent(&self, key: &K) -> bool
Compare self to key and return true if they are equal.

+
Implementors§
source§
impl<Q, K> Equivalent<K> for Q
where
+    Q: Eq + ?Sized,
+    K: Borrow<Q> + ?Sized,

\ No newline at end of file
diff --git a/flatten_json_object/enum.ArrayFormatting.html b/flatten_json_object/enum.ArrayFormatting.html
index e3336b6b75..28c6297560 100644
--- a/flatten_json_object/enum.ArrayFormatting.html
+++ b/flatten_json_object/enum.ArrayFormatting.html
@@ -1,4 +1,4 @@
-ArrayFormatting in flatten_json_object - Rust

+ArrayFormatting in flatten_json_object - Rust

     
Enum flatten_json_object::ArrayFormatting
source · 
pub enum ArrayFormatting {
     Plain,
     Surrounded {
@@ -15,7 +15,11 @@
 sufficient, and should not be overridden without very good reason.
source§
impl Eq for ArrayFormatting
source§
impl StructuralPartialEq for ArrayFormatting
Auto Trait Implementations§
Blanket Implementations§
source§
impl<T> Any for T
where
     T: 'static + ?Sized,
source§
fn type_id(&self) -> TypeId
Gets the TypeId of self. Read more
source§
impl<T> Borrow<T> for T
where
     T: ?Sized,
source§
fn borrow(&self) -> &T
Immutably borrows from an owned value. Read more
source§
impl<T> BorrowMut<T> for T
where
-    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.

+    T: ?Sized,
source§
fn borrow_mut(&mut self) -> &mut T
Mutably borrows from an owned value. Read more
source§

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

source§

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

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

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

source§

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 T
where U: From<T>,

source§

fn into(self) -> U

Calls U::from(self).

That is, this conversion is whatever the implementation of diff --git a/flatten_json_object/enum.Error.html b/flatten_json_object/enum.Error.html index 54004af1e9..10188d89ea 100644 --- a/flatten_json_object/enum.Error.html +++ b/flatten_json_object/enum.Error.html @@ -3,7 +3,7 @@ FirstLevelMustBeAnObject, KeyWillBeOverwritten(String), }

Expand description

Errors that can happen while using this crate.

-

Variants§

§

FirstLevelMustBeAnObject

§

KeyWillBeOverwritten(String)

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()
Read more
1.0.0 · source§

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

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

fn provide<'a>(&'a self, 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

Auto Trait Implementations§

§

impl Freeze for Error

§

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 T
where +

Variants§

§

FirstLevelMustBeAnObject

§

KeyWillBeOverwritten(String)

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()
Read more
1.0.0 · source§

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

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

fn provide<'a>(&'a self, 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

Auto Trait Implementations§

§

impl Freeze for Error

§

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 T
where T: 'static + ?Sized,

source§

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more
source§

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

source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
source§

impl<T> BorrowMut<T> for T
where 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.

diff --git a/flatten_json_object/struct.Flattener.html b/flatten_json_object/struct.Flattener.html index 75ef250538..afad891af3 100644 --- a/flatten_json_object/struct.Flattener.html +++ b/flatten_json_object/struct.Flattener.html @@ -1,4 +1,4 @@ -Flattener in flatten_json_object - Rust
+Flattener in flatten_json_object - Rust

Struct flatten_json_object::Flattener

source · 
pub struct Flattener { /* private fields */ }
Expand description

Basic struct of this crate. It contains the configuration. Instantiate it and use the method flatten to flatten a JSON object.

Implementations§

source§

impl Flattener

source

pub fn new() -> Self

Creates a JSON object flattener with the default configuration.

@@ -18,7 +18,11 @@
§Errors
sufficient, and should not be overridden without very good reason.
source§

impl Eq for Flattener

source§

impl StructuralPartialEq for Flattener

Auto Trait Implementations§

Blanket Implementations§

source§

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

source§

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more
source§

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

source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
source§

impl<T> BorrowMut<T> for T
where - 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.

+ T: ?Sized,
source§

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

Mutably borrows from an owned value. Read more
source§

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

source§

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

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

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

source§

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 T
where U: From<T>,

source§

fn into(self) -> U

Calls U::from(self).

That is, this conversion is whatever the implementation of diff --git a/hashbrown/all.html b/hashbrown/all.html new file mode 100644 index 0000000000..d3783baf4e --- /dev/null +++ b/hashbrown/all.html @@ -0,0 +1,2 @@ +List of all items in this crate

+

List of all items

Structs

Enums

Traits

\ No newline at end of file diff --git a/hashbrown/enum.TryReserveError.html b/hashbrown/enum.TryReserveError.html new file mode 100644 index 0000000000..3ba0198146 --- /dev/null +++ b/hashbrown/enum.TryReserveError.html @@ -0,0 +1,27 @@ +TryReserveError in hashbrown - Rust
+

Enum hashbrown::TryReserveError

source · 
pub enum TryReserveError {
+    CapacityOverflow,
+    AllocError {
+        layout: Layout,
+    },
+}
Expand description

The error type for try_reserve methods.

+

Variants§

§

CapacityOverflow

Error due to the computed capacity exceeding the collection’s maximum +(usually isize::MAX bytes).

+
§

AllocError

Fields

§layout: Layout

The layout of the allocation request that failed.

+

The memory allocator returned an error

+

Trait Implementations§

source§

impl Clone for TryReserveError

source§

fn clone(&self) -> TryReserveError

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 TryReserveError

source§

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

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

impl PartialEq for TryReserveError

source§

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

source§

impl StructuralPartialEq for TryReserveError

Auto Trait Implementations§

Blanket Implementations§

source§

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

source§

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more
source§

impl<T> Borrow<T> for T
where + T: ?Sized,

source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
source§

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

source§

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

Mutably borrows from an owned value. Read more
source§

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

source§

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

Checks if this value is equivalent to the given key. 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 T
where + 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 T
where + 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 T
where + 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 T
where + 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/hashbrown/hash_map/enum.DefaultHashBuilder.html b/hashbrown/hash_map/enum.DefaultHashBuilder.html new file mode 100644 index 0000000000..c44c959b8a --- /dev/null +++ b/hashbrown/hash_map/enum.DefaultHashBuilder.html @@ -0,0 +1,13 @@ +DefaultHashBuilder in hashbrown::hash_map - Rust
+

Enum hashbrown::hash_map::DefaultHashBuilder

source · 
pub enum DefaultHashBuilder {}
Expand description

Dummy default hasher for HashMap.

+

Auto Trait Implementations§

Blanket Implementations§

source§

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

source§

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more
source§

impl<T> Borrow<T> for T
where + T: ?Sized,

source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
source§

impl<T> BorrowMut<T> for T
where + 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 T
where + 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 T
where + 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 T
where + 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/hashbrown/hash_map/enum.Entry.html b/hashbrown/hash_map/enum.Entry.html new file mode 100644 index 0000000000..a8dabd4dbc --- /dev/null +++ b/hashbrown/hash_map/enum.Entry.html @@ -0,0 +1,239 @@ +Entry in hashbrown::hash_map - Rust
+

Enum hashbrown::hash_map::Entry

source · 
pub enum Entry<'a, K, V, S, A = Global>
where
+    A: Allocator,
{
+    Occupied(OccupiedEntry<'a, K, V, S, A>),
+    Vacant(VacantEntry<'a, K, V, S, A>),
+}
Expand description

A view into a single entry in a map, which may either be vacant or occupied.

+

This enum is constructed from the entry method on HashMap.

+

§Examples

+
use hashbrown::hash_map::{Entry, HashMap, OccupiedEntry};
+
+let mut map = HashMap::new();
+map.extend([("a", 10), ("b", 20), ("c", 30)]);
+assert_eq!(map.len(), 3);
+
+// Existing key (insert)
+let entry: Entry<_, _, _> = map.entry("a");
+let _raw_o: OccupiedEntry<_, _, _> = entry.insert(1);
+assert_eq!(map.len(), 3);
+// Nonexistent key (insert)
+map.entry("d").insert(4);
+
+// Existing key (or_insert)
+let v = map.entry("b").or_insert(2);
+assert_eq!(std::mem::replace(v, 2), 20);
+// Nonexistent key (or_insert)
+map.entry("e").or_insert(5);
+
+// Existing key (or_insert_with)
+let v = map.entry("c").or_insert_with(|| 3);
+assert_eq!(std::mem::replace(v, 3), 30);
+// Nonexistent key (or_insert_with)
+map.entry("f").or_insert_with(|| 6);
+
+println!("Our HashMap: {:?}", map);
+
+let mut vec: Vec<_> = map.iter().map(|(&k, &v)| (k, v)).collect();
+// The `Iter` iterator produces items in arbitrary order, so the
+// items must be sorted to test them against a sorted array.
+vec.sort_unstable();
+assert_eq!(vec, [("a", 1), ("b", 2), ("c", 3), ("d", 4), ("e", 5), ("f", 6)]);
+

Variants§

§

Occupied(OccupiedEntry<'a, K, V, S, A>)

An occupied entry.

+

§Examples

+
use hashbrown::hash_map::{Entry, HashMap};
+let mut map: HashMap<_, _> = [("a", 100), ("b", 200)].into();
+
+match map.entry("a") {
+    Entry::Vacant(_) => unreachable!(),
+    Entry::Occupied(_) => { }
+}
+
§

Vacant(VacantEntry<'a, K, V, S, A>)

A vacant entry.

+

§Examples

+
use hashbrown::hash_map::{Entry, HashMap};
+let mut map: HashMap<&str, i32> = HashMap::new();
+
+match map.entry("a") {
+    Entry::Occupied(_) => unreachable!(),
+    Entry::Vacant(_) => { }
+}
+

Implementations§

source§

impl<'a, K, V, S, A: Allocator> Entry<'a, K, V, S, A>

source

pub fn insert(self, value: V) -> OccupiedEntry<'a, K, V, S, A>
where + K: Hash, + S: BuildHasher,

Sets the value of the entry, and returns an OccupiedEntry.

+
§Examples
+
use hashbrown::HashMap;
+
+let mut map: HashMap<&str, u32> = HashMap::new();
+let entry = map.entry("horseyland").insert(37);
+
+assert_eq!(entry.key(), &"horseyland");
+
source

pub fn or_insert(self, default: V) -> &'a mut V
where + K: Hash, + S: BuildHasher,

Ensures a value is in the entry by inserting the default if empty, and returns +a mutable reference to the value in the entry.

+
§Examples
+
use hashbrown::HashMap;
+
+let mut map: HashMap<&str, u32> = HashMap::new();
+
+// nonexistent key
+map.entry("poneyland").or_insert(3);
+assert_eq!(map["poneyland"], 3);
+
+// existing key
+*map.entry("poneyland").or_insert(10) *= 2;
+assert_eq!(map["poneyland"], 6);
+
source

pub fn or_insert_with<F: FnOnce() -> V>(self, default: F) -> &'a mut V
where + K: Hash, + S: BuildHasher,

Ensures a value is in the entry by inserting the result of the default function if empty, +and returns a mutable reference to the value in the entry.

+
§Examples
+
use hashbrown::HashMap;
+
+let mut map: HashMap<&str, u32> = HashMap::new();
+
+// nonexistent key
+map.entry("poneyland").or_insert_with(|| 3);
+assert_eq!(map["poneyland"], 3);
+
+// existing key
+*map.entry("poneyland").or_insert_with(|| 10) *= 2;
+assert_eq!(map["poneyland"], 6);
+
source

pub fn or_insert_with_key<F: FnOnce(&K) -> V>(self, default: F) -> &'a mut V
where + K: Hash, + S: BuildHasher,

Ensures a value is in the entry by inserting, if empty, the result of the default function. +This method allows for generating key-derived values for insertion by providing the default +function a reference to the key that was moved during the .entry(key) method call.

+

The reference to the moved key is provided so that cloning or copying the key is +unnecessary, unlike with .or_insert_with(|| ... ).

+
§Examples
+
use hashbrown::HashMap;
+
+let mut map: HashMap<&str, usize> = HashMap::new();
+
+// nonexistent key
+map.entry("poneyland").or_insert_with_key(|key| key.chars().count());
+assert_eq!(map["poneyland"], 9);
+
+// existing key
+*map.entry("poneyland").or_insert_with_key(|key| key.chars().count() * 10) *= 2;
+assert_eq!(map["poneyland"], 18);
+
source

pub fn key(&self) -> &K

Returns a reference to this entry’s key.

+
§Examples
+
use hashbrown::HashMap;
+
+let mut map: HashMap<&str, u32> = HashMap::new();
+map.entry("poneyland").or_insert(3);
+// existing key
+assert_eq!(map.entry("poneyland").key(), &"poneyland");
+// nonexistent key
+assert_eq!(map.entry("horseland").key(), &"horseland");
+
source

pub fn and_modify<F>(self, f: F) -> Self
where + F: FnOnce(&mut V),

Provides in-place mutable access to an occupied entry before any +potential inserts into the map.

+
§Examples
+
use hashbrown::HashMap;
+
+let mut map: HashMap<&str, u32> = HashMap::new();
+
+map.entry("poneyland")
+   .and_modify(|e| { *e += 1 })
+   .or_insert(42);
+assert_eq!(map["poneyland"], 42);
+
+map.entry("poneyland")
+   .and_modify(|e| { *e += 1 })
+   .or_insert(42);
+assert_eq!(map["poneyland"], 43);
+
source

pub fn and_replace_entry_with<F>(self, f: F) -> Self
where + F: FnOnce(&K, V) -> Option<V>,

Provides shared access to the key and owned access to the value of +an occupied entry and allows to replace or remove it based on the +value of the returned option.

+
§Examples
+
use hashbrown::HashMap;
+use hashbrown::hash_map::Entry;
+
+let mut map: HashMap<&str, u32> = HashMap::new();
+
+let entry = map
+    .entry("poneyland")
+    .and_replace_entry_with(|_k, _v| panic!());
+
+match entry {
+    Entry::Vacant(e) => {
+        assert_eq!(e.key(), &"poneyland");
+    }
+    Entry::Occupied(_) => panic!(),
+}
+
+map.insert("poneyland", 42);
+
+let entry = map
+    .entry("poneyland")
+    .and_replace_entry_with(|k, v| {
+        assert_eq!(k, &"poneyland");
+        assert_eq!(v, 42);
+        Some(v + 1)
+    });
+
+match entry {
+    Entry::Occupied(e) => {
+        assert_eq!(e.key(), &"poneyland");
+        assert_eq!(e.get(), &43);
+    }
+    Entry::Vacant(_) => panic!(),
+}
+
+assert_eq!(map["poneyland"], 43);
+
+let entry = map
+    .entry("poneyland")
+    .and_replace_entry_with(|_k, _v| None);
+
+match entry {
+    Entry::Vacant(e) => assert_eq!(e.key(), &"poneyland"),
+    Entry::Occupied(_) => panic!(),
+}
+
+assert!(!map.contains_key("poneyland"));
+
source§

impl<'a, K, V: Default, S, A: Allocator> Entry<'a, K, V, S, A>

source

pub fn or_default(self) -> &'a mut V
where + K: Hash, + S: BuildHasher,

Ensures a value is in the entry by inserting the default value if empty, +and returns a mutable reference to the value in the entry.

+
§Examples
+
use hashbrown::HashMap;
+
+let mut map: HashMap<&str, Option<u32>> = HashMap::new();
+
+// nonexistent key
+map.entry("poneyland").or_default();
+assert_eq!(map["poneyland"], None);
+
+map.insert("horseland", Some(3));
+
+// existing key
+assert_eq!(map.entry("horseland").or_default(), &mut Some(3));
+

Trait Implementations§

source§

impl<K: Debug, V: Debug, S, A: Allocator> Debug for Entry<'_, K, V, S, A>

source§

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

Formats the value using the given formatter. Read more

Auto Trait Implementations§

§

impl<'a, K, V, S, A> Freeze for Entry<'a, K, V, S, A>
where + K: Freeze,

§

impl<'a, K, V, S, A> RefUnwindSafe for Entry<'a, K, V, S, A>
where + A: RefUnwindSafe, + K: RefUnwindSafe, + S: RefUnwindSafe, + V: RefUnwindSafe,

§

impl<'a, K, V, S, A> Send for Entry<'a, K, V, S, A>
where + A: Send, + K: Send, + S: Send, + V: Send,

§

impl<'a, K, V, S, A> Sync for Entry<'a, K, V, S, A>
where + A: Sync, + K: Sync, + S: Sync, + V: Sync,

§

impl<'a, K, V, S, A> Unpin for Entry<'a, K, V, S, A>
where + K: Unpin,

§

impl<'a, K, V, S, A = Global> !UnwindSafe for Entry<'a, K, V, S, A>

Blanket Implementations§

source§

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

source§

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more
source§

impl<T> Borrow<T> for T
where + T: ?Sized,

source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
source§

impl<T> BorrowMut<T> for T
where + 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 T
where + 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 T
where + 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 T
where + 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/hashbrown/hash_map/enum.EntryRef.html b/hashbrown/hash_map/enum.EntryRef.html new file mode 100644 index 0000000000..0de8af2f8e --- /dev/null +++ b/hashbrown/hash_map/enum.EntryRef.html @@ -0,0 +1,245 @@ +EntryRef in hashbrown::hash_map - Rust
+

Enum hashbrown::hash_map::EntryRef

source · 
pub enum EntryRef<'a, 'b, K, Q: ?Sized, V, S, A = Global>
where
+    A: Allocator,
{
+    Occupied(OccupiedEntryRef<'a, 'b, K, Q, V, S, A>),
+    Vacant(VacantEntryRef<'a, 'b, K, Q, V, S, A>),
+}
Expand description

A view into a single entry in a map, which may either be vacant or occupied, +with any borrowed form of the map’s key type.

+

This enum is constructed from the entry_ref method on HashMap.

+

Hash and Eq on the borrowed form of the map’s key type must match those +for the key type. It also require that key may be constructed from the borrowed +form through the From trait.

+

§Examples

+
use hashbrown::hash_map::{EntryRef, HashMap, OccupiedEntryRef};
+
+let mut map = HashMap::new();
+map.extend([("a".to_owned(), 10), ("b".into(), 20), ("c".into(), 30)]);
+assert_eq!(map.len(), 3);
+
+// Existing key (insert)
+let key = String::from("a");
+let entry: EntryRef<_, _, _, _> = map.entry_ref(&key);
+let _raw_o: OccupiedEntryRef<_, _, _, _> = entry.insert(1);
+assert_eq!(map.len(), 3);
+// Nonexistent key (insert)
+map.entry_ref("d").insert(4);
+
+// Existing key (or_insert)
+let v = map.entry_ref("b").or_insert(2);
+assert_eq!(std::mem::replace(v, 2), 20);
+// Nonexistent key (or_insert)
+map.entry_ref("e").or_insert(5);
+
+// Existing key (or_insert_with)
+let v = map.entry_ref("c").or_insert_with(|| 3);
+assert_eq!(std::mem::replace(v, 3), 30);
+// Nonexistent key (or_insert_with)
+map.entry_ref("f").or_insert_with(|| 6);
+
+println!("Our HashMap: {:?}", map);
+
+for (key, value) in ["a", "b", "c", "d", "e", "f"].into_iter().zip(1..=6) {
+    assert_eq!(map[key], value)
+}
+assert_eq!(map.len(), 6);
+

Variants§

§

Occupied(OccupiedEntryRef<'a, 'b, K, Q, V, S, A>)

An occupied entry.

+

§Examples

+
use hashbrown::hash_map::{EntryRef, HashMap};
+let mut map: HashMap<_, _> = [("a".to_owned(), 100), ("b".into(), 200)].into();
+
+match map.entry_ref("a") {
+    EntryRef::Vacant(_) => unreachable!(),
+    EntryRef::Occupied(_) => { }
+}
+
§

Vacant(VacantEntryRef<'a, 'b, K, Q, V, S, A>)

A vacant entry.

+

§Examples

+
use hashbrown::hash_map::{EntryRef, HashMap};
+let mut map: HashMap<String, i32> = HashMap::new();
+
+match map.entry_ref("a") {
+    EntryRef::Occupied(_) => unreachable!(),
+    EntryRef::Vacant(_) => { }
+}
+

Implementations§

source§

impl<'a, 'b, K, Q: ?Sized, V, S, A: Allocator> EntryRef<'a, 'b, K, Q, V, S, A>

source

pub fn insert(self, value: V) -> OccupiedEntryRef<'a, 'b, K, Q, V, S, A>
where + K: Hash + From<&'b Q>, + S: BuildHasher,

Sets the value of the entry, and returns an OccupiedEntryRef.

+
§Examples
+
use hashbrown::HashMap;
+
+let mut map: HashMap<String, u32> = HashMap::new();
+let entry = map.entry_ref("horseyland").insert(37);
+
+assert_eq!(entry.key(), "horseyland");
+
source

pub fn or_insert(self, default: V) -> &'a mut V
where + K: Hash + From<&'b Q>, + S: BuildHasher,

Ensures a value is in the entry by inserting the default if empty, and returns +a mutable reference to the value in the entry.

+
§Examples
+
use hashbrown::HashMap;
+
+let mut map: HashMap<String, u32> = HashMap::new();
+
+// nonexistent key
+map.entry_ref("poneyland").or_insert(3);
+assert_eq!(map["poneyland"], 3);
+
+// existing key
+*map.entry_ref("poneyland").or_insert(10) *= 2;
+assert_eq!(map["poneyland"], 6);
+
source

pub fn or_insert_with<F: FnOnce() -> V>(self, default: F) -> &'a mut V
where + K: Hash + From<&'b Q>, + S: BuildHasher,

Ensures a value is in the entry by inserting the result of the default function if empty, +and returns a mutable reference to the value in the entry.

+
§Examples
+
use hashbrown::HashMap;
+
+let mut map: HashMap<String, u32> = HashMap::new();
+
+// nonexistent key
+map.entry_ref("poneyland").or_insert_with(|| 3);
+assert_eq!(map["poneyland"], 3);
+
+// existing key
+*map.entry_ref("poneyland").or_insert_with(|| 10) *= 2;
+assert_eq!(map["poneyland"], 6);
+
source

pub fn or_insert_with_key<F: FnOnce(&Q) -> V>(self, default: F) -> &'a mut V
where + K: Hash + Borrow<Q> + From<&'b Q>, + S: BuildHasher,

Ensures a value is in the entry by inserting, if empty, the result of the default function. +This method allows for generating key-derived values for insertion by providing the default +function an access to the borrower form of the key.

+
§Examples
+
use hashbrown::HashMap;
+
+let mut map: HashMap<String, usize> = HashMap::new();
+
+// nonexistent key
+map.entry_ref("poneyland").or_insert_with_key(|key| key.chars().count());
+assert_eq!(map["poneyland"], 9);
+
+// existing key
+*map.entry_ref("poneyland").or_insert_with_key(|key| key.chars().count() * 10) *= 2;
+assert_eq!(map["poneyland"], 18);
+
source

pub fn key(&self) -> &Q
where + K: Borrow<Q>,

Returns a reference to this entry’s key.

+
§Examples
+
use hashbrown::HashMap;
+
+let mut map: HashMap<String, u32> = HashMap::new();
+map.entry_ref("poneyland").or_insert(3);
+// existing key
+assert_eq!(map.entry_ref("poneyland").key(), "poneyland");
+// nonexistent key
+assert_eq!(map.entry_ref("horseland").key(), "horseland");
+
source

pub fn and_modify<F>(self, f: F) -> Self
where + F: FnOnce(&mut V),

Provides in-place mutable access to an occupied entry before any +potential inserts into the map.

+
§Examples
+
use hashbrown::HashMap;
+
+let mut map: HashMap<String, u32> = HashMap::new();
+
+map.entry_ref("poneyland")
+   .and_modify(|e| { *e += 1 })
+   .or_insert(42);
+assert_eq!(map["poneyland"], 42);
+
+map.entry_ref("poneyland")
+   .and_modify(|e| { *e += 1 })
+   .or_insert(42);
+assert_eq!(map["poneyland"], 43);
+
source

pub fn and_replace_entry_with<F>(self, f: F) -> Self
where + F: FnOnce(&K, V) -> Option<V>,

Provides shared access to the key and owned access to the value of +an occupied entry and allows to replace or remove it based on the +value of the returned option.

+
§Examples
+
use hashbrown::HashMap;
+use hashbrown::hash_map::EntryRef;
+
+let mut map: HashMap<String, u32> = HashMap::new();
+
+let entry = map
+    .entry_ref("poneyland")
+    .and_replace_entry_with(|_k, _v| panic!());
+
+match entry {
+    EntryRef::Vacant(e) => {
+        assert_eq!(e.key(), "poneyland");
+    }
+    EntryRef::Occupied(_) => panic!(),
+}
+
+map.insert("poneyland".to_string(), 42);
+
+let entry = map
+    .entry_ref("poneyland")
+    .and_replace_entry_with(|k, v| {
+        assert_eq!(k, "poneyland");
+        assert_eq!(v, 42);
+        Some(v + 1)
+    });
+
+match entry {
+    EntryRef::Occupied(e) => {
+        assert_eq!(e.key(), "poneyland");
+        assert_eq!(e.get(), &43);
+    }
+    EntryRef::Vacant(_) => panic!(),
+}
+
+assert_eq!(map["poneyland"], 43);
+
+let entry = map
+    .entry_ref("poneyland")
+    .and_replace_entry_with(|_k, _v| None);
+
+match entry {
+    EntryRef::Vacant(e) => assert_eq!(e.key(), "poneyland"),
+    EntryRef::Occupied(_) => panic!(),
+}
+
+assert!(!map.contains_key("poneyland"));
+
source§

impl<'a, 'b, K, Q: ?Sized, V: Default, S, A: Allocator> EntryRef<'a, 'b, K, Q, V, S, A>

source

pub fn or_default(self) -> &'a mut V
where + K: Hash + From<&'b Q>, + S: BuildHasher,

Ensures a value is in the entry by inserting the default value if empty, +and returns a mutable reference to the value in the entry.

+
§Examples
+
use hashbrown::HashMap;
+
+let mut map: HashMap<String, Option<u32>> = HashMap::new();
+
+// nonexistent key
+map.entry_ref("poneyland").or_default();
+assert_eq!(map["poneyland"], None);
+
+map.insert("horseland".to_string(), Some(3));
+
+// existing key
+assert_eq!(map.entry_ref("horseland").or_default(), &mut Some(3));
+

Trait Implementations§

source§

impl<K: Borrow<Q>, Q: ?Sized + Debug, V: Debug, S, A: Allocator> Debug for EntryRef<'_, '_, K, Q, V, S, A>

source§

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

Formats the value using the given formatter. Read more

Auto Trait Implementations§

§

impl<'a, 'b, K, Q: ?Sized, V, S, A> Freeze for EntryRef<'a, 'b, K, Q, V, S, A>
where + K: Freeze,

§

impl<'a, 'b, K, Q: ?Sized, V, S, A> RefUnwindSafe for EntryRef<'a, 'b, K, Q, V, S, A>
where + A: RefUnwindSafe, + K: RefUnwindSafe, + Q: RefUnwindSafe, + S: RefUnwindSafe, + V: RefUnwindSafe,

§

impl<'a, 'b, K, Q: ?Sized, V, S, A> Send for EntryRef<'a, 'b, K, Q, V, S, A>
where + A: Send, + K: Send, + Q: Sync, + S: Send, + V: Send,

§

impl<'a, 'b, K, Q: ?Sized, V, S, A> Sync for EntryRef<'a, 'b, K, Q, V, S, A>
where + A: Sync, + K: Sync, + Q: Sync, + S: Sync, + V: Sync,

§

impl<'a, 'b, K, Q: ?Sized, V, S, A> Unpin for EntryRef<'a, 'b, K, Q, V, S, A>
where + K: Unpin,

§

impl<'a, 'b, K, Q, V, S, A = Global> !UnwindSafe for EntryRef<'a, 'b, K, Q, V, S, A>

Blanket Implementations§

source§

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

source§

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more
source§

impl<T> Borrow<T> for T
where + T: ?Sized,

source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
source§

impl<T> BorrowMut<T> for T
where + 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 T
where + 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 T
where + 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 T
where + 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/hashbrown/hash_map/enum.RawEntryMut.html b/hashbrown/hash_map/enum.RawEntryMut.html new file mode 100644 index 0000000000..29edb741b2 --- /dev/null +++ b/hashbrown/hash_map/enum.RawEntryMut.html @@ -0,0 +1,228 @@ +RawEntryMut in hashbrown::hash_map - Rust
+

Enum hashbrown::hash_map::RawEntryMut

source · 
pub enum RawEntryMut<'a, K, V, S, A: Allocator = Global> {
+    Occupied(RawOccupiedEntryMut<'a, K, V, S, A>),
+    Vacant(RawVacantEntryMut<'a, K, V, S, A>),
+}
Expand description

A view into a single entry in a map, which may either be vacant or occupied.

+

This is a lower-level version of Entry.

+

This enum is constructed through the raw_entry_mut method on HashMap, +then calling one of the methods of that RawEntryBuilderMut.

+

§Examples

+
use core::hash::{BuildHasher, Hash};
+use hashbrown::hash_map::{HashMap, RawEntryMut, RawOccupiedEntryMut};
+
+let mut map = HashMap::new();
+map.extend([('a', 1), ('b', 2), ('c', 3)]);
+assert_eq!(map.len(), 3);
+
+fn compute_hash<K: Hash + ?Sized, S: BuildHasher>(hash_builder: &S, key: &K) -> u64 {
+    use core::hash::Hasher;
+    let mut state = hash_builder.build_hasher();
+    key.hash(&mut state);
+    state.finish()
+}
+
+// Existing key (insert)
+let raw: RawEntryMut<_, _, _> = map.raw_entry_mut().from_key(&'a');
+let _raw_o: RawOccupiedEntryMut<_, _, _> = raw.insert('a', 10);
+assert_eq!(map.len(), 3);
+
+// Nonexistent key (insert)
+map.raw_entry_mut().from_key(&'d').insert('d', 40);
+assert_eq!(map.len(), 4);
+
+// Existing key (or_insert)
+let hash = compute_hash(map.hasher(), &'b');
+let kv = map
+    .raw_entry_mut()
+    .from_key_hashed_nocheck(hash, &'b')
+    .or_insert('b', 20);
+assert_eq!(kv, (&mut 'b', &mut 2));
+*kv.1 = 20;
+assert_eq!(map.len(), 4);
+
+// Nonexistent key (or_insert)
+let hash = compute_hash(map.hasher(), &'e');
+let kv = map
+    .raw_entry_mut()
+    .from_key_hashed_nocheck(hash, &'e')
+    .or_insert('e', 50);
+assert_eq!(kv, (&mut 'e', &mut 50));
+assert_eq!(map.len(), 5);
+
+// Existing key (or_insert_with)
+let hash = compute_hash(map.hasher(), &'c');
+let kv = map
+    .raw_entry_mut()
+    .from_hash(hash, |q| q == &'c')
+    .or_insert_with(|| ('c', 30));
+assert_eq!(kv, (&mut 'c', &mut 3));
+*kv.1 = 30;
+assert_eq!(map.len(), 5);
+
+// Nonexistent key (or_insert_with)
+let hash = compute_hash(map.hasher(), &'f');
+let kv = map
+    .raw_entry_mut()
+    .from_hash(hash, |q| q == &'f')
+    .or_insert_with(|| ('f', 60));
+assert_eq!(kv, (&mut 'f', &mut 60));
+assert_eq!(map.len(), 6);
+
+println!("Our HashMap: {:?}", map);
+
+let mut vec: Vec<_> = map.iter().map(|(&k, &v)| (k, v)).collect();
+// The `Iter` iterator produces items in arbitrary order, so the
+// items must be sorted to test them against a sorted array.
+vec.sort_unstable();
+assert_eq!(vec, [('a', 10), ('b', 20), ('c', 30), ('d', 40), ('e', 50), ('f', 60)]);
+

Variants§

§

Occupied(RawOccupiedEntryMut<'a, K, V, S, A>)

An occupied entry.

+

§Examples

+
use hashbrown::{hash_map::RawEntryMut, HashMap};
+let mut map: HashMap<_, _> = [("a", 100), ("b", 200)].into();
+
+match map.raw_entry_mut().from_key(&"a") {
+    RawEntryMut::Vacant(_) => unreachable!(),
+    RawEntryMut::Occupied(_) => { }
+}
+
§

Vacant(RawVacantEntryMut<'a, K, V, S, A>)

A vacant entry.

+

§Examples

+
use hashbrown::{hash_map::RawEntryMut, HashMap};
+let mut map: HashMap<&str, i32> = HashMap::new();
+
+match map.raw_entry_mut().from_key("a") {
+    RawEntryMut::Occupied(_) => unreachable!(),
+    RawEntryMut::Vacant(_) => { }
+}
+

Implementations§

source§

impl<'a, K, V, S, A: Allocator> RawEntryMut<'a, K, V, S, A>

source

pub fn insert(self, key: K, value: V) -> RawOccupiedEntryMut<'a, K, V, S, A>
where + K: Hash, + S: BuildHasher,

Sets the value of the entry, and returns a RawOccupiedEntryMut.

+
§Examples
+
use hashbrown::HashMap;
+
+let mut map: HashMap<&str, u32> = HashMap::new();
+let entry = map.raw_entry_mut().from_key("horseyland").insert("horseyland", 37);
+
+assert_eq!(entry.remove_entry(), ("horseyland", 37));
+
source

pub fn or_insert(self, default_key: K, default_val: V) -> (&'a mut K, &'a mut V)
where + K: Hash, + S: BuildHasher,

Ensures a value is in the entry by inserting the default if empty, and returns +mutable references to the key and value in the entry.

+
§Examples
+
use hashbrown::HashMap;
+
+let mut map: HashMap<&str, u32> = HashMap::new();
+
+map.raw_entry_mut().from_key("poneyland").or_insert("poneyland", 3);
+assert_eq!(map["poneyland"], 3);
+
+*map.raw_entry_mut().from_key("poneyland").or_insert("poneyland", 10).1 *= 2;
+assert_eq!(map["poneyland"], 6);
+
source

pub fn or_insert_with<F>(self, default: F) -> (&'a mut K, &'a mut V)
where + F: FnOnce() -> (K, V), + K: Hash, + S: BuildHasher,

Ensures a value is in the entry by inserting the result of the default function if empty, +and returns mutable references to the key and value in the entry.

+
§Examples
+
use hashbrown::HashMap;
+
+let mut map: HashMap<&str, String> = HashMap::new();
+
+map.raw_entry_mut().from_key("poneyland").or_insert_with(|| {
+    ("poneyland", "hoho".to_string())
+});
+
+assert_eq!(map["poneyland"], "hoho".to_string());
+
source

pub fn and_modify<F>(self, f: F) -> Self
where + F: FnOnce(&mut K, &mut V),

Provides in-place mutable access to an occupied entry before any +potential inserts into the map.

+
§Examples
+
use hashbrown::HashMap;
+
+let mut map: HashMap<&str, u32> = HashMap::new();
+
+map.raw_entry_mut()
+   .from_key("poneyland")
+   .and_modify(|_k, v| { *v += 1 })
+   .or_insert("poneyland", 42);
+assert_eq!(map["poneyland"], 42);
+
+map.raw_entry_mut()
+   .from_key("poneyland")
+   .and_modify(|_k, v| { *v += 1 })
+   .or_insert("poneyland", 0);
+assert_eq!(map["poneyland"], 43);
+
source

pub fn and_replace_entry_with<F>(self, f: F) -> Self
where + F: FnOnce(&K, V) -> Option<V>,

Provides shared access to the key and owned access to the value of +an occupied entry and allows to replace or remove it based on the +value of the returned option.

+
§Examples
+
use hashbrown::HashMap;
+use hashbrown::hash_map::RawEntryMut;
+
+let mut map: HashMap<&str, u32> = HashMap::new();
+
+let entry = map
+    .raw_entry_mut()
+    .from_key("poneyland")
+    .and_replace_entry_with(|_k, _v| panic!());
+
+match entry {
+    RawEntryMut::Vacant(_) => {},
+    RawEntryMut::Occupied(_) => panic!(),
+}
+
+map.insert("poneyland", 42);
+
+let entry = map
+    .raw_entry_mut()
+    .from_key("poneyland")
+    .and_replace_entry_with(|k, v| {
+        assert_eq!(k, &"poneyland");
+        assert_eq!(v, 42);
+        Some(v + 1)
+    });
+
+match entry {
+    RawEntryMut::Occupied(e) => {
+        assert_eq!(e.key(), &"poneyland");
+        assert_eq!(e.get(), &43);
+    },
+    RawEntryMut::Vacant(_) => panic!(),
+}
+
+assert_eq!(map["poneyland"], 43);
+
+let entry = map
+    .raw_entry_mut()
+    .from_key("poneyland")
+    .and_replace_entry_with(|_k, _v| None);
+
+match entry {
+    RawEntryMut::Vacant(_) => {},
+    RawEntryMut::Occupied(_) => panic!(),
+}
+
+assert!(!map.contains_key("poneyland"));
+

Trait Implementations§

source§

impl<K: Debug, V: Debug, S, A: Allocator> Debug for RawEntryMut<'_, K, V, S, A>

source§

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

Formats the value using the given formatter. Read more

Auto Trait Implementations§

§

impl<'a, K, V, S, A> Freeze for RawEntryMut<'a, K, V, S, A>

§

impl<'a, K, V, S, A> RefUnwindSafe for RawEntryMut<'a, K, V, S, A>
where + A: RefUnwindSafe, + K: RefUnwindSafe, + S: RefUnwindSafe, + V: RefUnwindSafe,

§

impl<'a, K, V, S, A> Send for RawEntryMut<'a, K, V, S, A>
where + A: Send, + K: Send, + S: Sync + Send, + V: Send,

§

impl<'a, K, V, S, A> Sync for RawEntryMut<'a, K, V, S, A>
where + A: Sync, + K: Sync, + S: Sync, + V: Sync,

§

impl<'a, K, V, S, A> Unpin for RawEntryMut<'a, K, V, S, A>

§

impl<'a, K, V, S, A = Global> !UnwindSafe for RawEntryMut<'a, K, V, S, A>

Blanket Implementations§

source§

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

source§

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more
source§

impl<T> Borrow<T> for T
where + T: ?Sized,

source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
source§

impl<T> BorrowMut<T> for T
where + 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 T
where + 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 T
where + 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 T
where + 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/hashbrown/hash_map/index.html b/hashbrown/hash_map/index.html new file mode 100644 index 0000000000..21db9b3d2b --- /dev/null +++ b/hashbrown/hash_map/index.html @@ -0,0 +1,20 @@ +hashbrown::hash_map - Rust
+

Module hashbrown::hash_map

source ·
Expand description

A hash map implemented with quadratic probing and SIMD lookup.

+

Structs§

  • Drain
    A draining iterator over the entries of a HashMap in arbitrary +order. The iterator element type is (K, V).
  • ExtractIf
    A draining iterator over entries of a HashMap which don’t satisfy the predicate +f(&k, &mut v) in arbitrary order. The iterator element type is (K, V).
  • HashMap
    A hash map implemented with quadratic probing and SIMD lookup.
  • IntoIter
    An owning iterator over the entries of a HashMap in arbitrary order. +The iterator element type is (K, V).
  • IntoKeys
    An owning iterator over the keys of a HashMap in arbitrary order. +The iterator element type is K.
  • IntoValues
    An owning iterator over the values of a HashMap in arbitrary order. +The iterator element type is V.
  • Iter
    An iterator over the entries of a HashMap in arbitrary order. +The iterator element type is (&'a K, &'a V).
  • IterMut
    A mutable iterator over the entries of a HashMap in arbitrary order. +The iterator element type is (&'a K, &'a mut V).
  • Keys
    An iterator over the keys of a HashMap in arbitrary order. +The iterator element type is &'a K.
  • OccupiedEntry
    A view into an occupied entry in a HashMap. +It is part of the Entry enum.
  • OccupiedEntryRef
    A view into an occupied entry in a HashMap. +It is part of the EntryRef enum.
  • OccupiedError
    The error returned by try_insert when the key already exists.
  • RawEntryBuilder
    A builder for computing where in a HashMap a key-value pair would be stored.
  • RawEntryBuilderMut
    A builder for computing where in a HashMap a key-value pair would be stored.
  • RawOccupiedEntryMut
    A view into an occupied entry in a HashMap. +It is part of the RawEntryMut enum.
  • RawVacantEntryMut
    A view into a vacant entry in a HashMap. +It is part of the RawEntryMut enum.
  • VacantEntry
    A view into a vacant entry in a HashMap. +It is part of the Entry enum.
  • VacantEntryRef
    A view into a vacant entry in a HashMap. +It is part of the EntryRef enum.
  • Values
    An iterator over the values of a HashMap in arbitrary order. +The iterator element type is &'a V.
  • ValuesMut
    A mutable iterator over the values of a HashMap in arbitrary order. +The iterator element type is &'a mut V.

Enums§

  • DefaultHashBuilder
    Dummy default hasher for HashMap.
  • Entry
    A view into a single entry in a map, which may either be vacant or occupied.
  • EntryRef
    A view into a single entry in a map, which may either be vacant or occupied, +with any borrowed form of the map’s key type.
  • RawEntryMut
    A view into a single entry in a map, which may either be vacant or occupied.
\ No newline at end of file diff --git a/hashbrown/hash_map/sidebar-items.js b/hashbrown/hash_map/sidebar-items.js new file mode 100644 index 0000000000..2853fe6a4e --- /dev/null +++ b/hashbrown/hash_map/sidebar-items.js @@ -0,0 +1 @@ +window.SIDEBAR_ITEMS = {"enum":["DefaultHashBuilder","Entry","EntryRef","RawEntryMut"],"struct":["Drain","ExtractIf","HashMap","IntoIter","IntoKeys","IntoValues","Iter","IterMut","Keys","OccupiedEntry","OccupiedEntryRef","OccupiedError","RawEntryBuilder","RawEntryBuilderMut","RawOccupiedEntryMut","RawVacantEntryMut","VacantEntry","VacantEntryRef","Values","ValuesMut"]}; \ No newline at end of file diff --git a/hashbrown/hash_map/struct.Drain.html b/hashbrown/hash_map/struct.Drain.html new file mode 100644 index 0000000000..fdcfeeacf1 --- /dev/null +++ b/hashbrown/hash_map/struct.Drain.html @@ -0,0 +1,225 @@ +Drain in hashbrown::hash_map - Rust
+

Struct hashbrown::hash_map::Drain

source · 
pub struct Drain<'a, K, V, A: Allocator = Global> { /* private fields */ }
Expand description

A draining iterator over the entries of a HashMap in arbitrary +order. The iterator element type is (K, V).

+

This struct is created by the drain method on HashMap. See its +documentation for more.

+

§Examples

+
use hashbrown::HashMap;
+
+let mut map: HashMap<_, _> = [(1, "a"), (2, "b"), (3, "c")].into();
+
+let mut drain_iter = map.drain();
+let mut vec = vec![drain_iter.next(), drain_iter.next(), drain_iter.next()];
+
+// The `Drain` iterator produces items in arbitrary order, so the
+// items must be sorted to test them against a sorted array.
+vec.sort_unstable();
+assert_eq!(vec, [Some((1, "a")), Some((2, "b")), Some((3, "c"))]);
+
+// It is fused iterator
+assert_eq!(drain_iter.next(), None);
+assert_eq!(drain_iter.next(), None);
+

Trait Implementations§

source§

impl<K, V, A> Debug for Drain<'_, K, V, A>
where + K: Debug, + V: Debug, + A: Allocator,

source§

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

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

impl<K, V, A: Allocator> ExactSizeIterator for Drain<'_, K, V, A>

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, K, V, A: Allocator> Iterator for Drain<'a, K, V, A>

§

type Item = (K, V)

The type of the elements being iterated over.
source§

fn next(&mut self) -> Option<(K, V)>

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 fold<B, F>(self, init: B, f: F) -> B
where + Self: Sized, + F: FnMut(B, Self::Item) -> B,

Folds every element into an accumulator by applying an operation, +returning the final result. 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) -> usize
where + 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<(), NonZero<usize>>

🔬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 Self
where + Self: Sized,

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

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

Transforms an iterator into a collection. Read more
source§

fn collect_into<E>(self, collection: &mut E) -> &mut E
where + 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) -> bool
where + 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) -> R
where + 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) -> R
where + 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.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>>>::TryType
where + 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) -> bool
where + 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) -> bool
where + 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>>>::TryType
where + 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) -> S
where + Self: Sized, + S: Sum<Self::Item>,

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

fn product<P>(self) -> P
where + 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) -> Ordering
where + 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) -> bool
where + 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) -> bool
where + 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) -> bool
where + 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) -> bool
where + 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) -> bool
where + 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) -> bool
where + 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) -> bool
where + 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) -> bool
where + Self: Sized, + F: FnMut(&Self::Item, &Self::Item) -> bool,

🔬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) -> bool
where + 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<K, V, A: Allocator> FusedIterator for Drain<'_, K, V, A>

Auto Trait Implementations§

§

impl<'a, K, V, A> Freeze for Drain<'a, K, V, A>

§

impl<'a, K, V, A> RefUnwindSafe for Drain<'a, K, V, A>
where + A: RefUnwindSafe, + K: RefUnwindSafe, + V: RefUnwindSafe,

§

impl<'a, K, V, A> Send for Drain<'a, K, V, A>
where + A: Send, + K: Send, + V: Send,

§

impl<'a, K, V, A> Sync for Drain<'a, K, V, A>
where + A: Sync, + K: Sync, + V: Sync,

§

impl<'a, K, V, A> Unpin for Drain<'a, K, V, A>

§

impl<'a, K, V, A> UnwindSafe for Drain<'a, K, V, A>
where + A: RefUnwindSafe, + K: RefUnwindSafe, + V: RefUnwindSafe,

Blanket Implementations§

source§

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

source§

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more
source§

impl<T> Borrow<T> for T
where + T: ?Sized,

source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
source§

impl<T> BorrowMut<T> for T
where + 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 T
where + 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 I
where + 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, U> TryFrom<U> for T
where + 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 T
where + 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/hashbrown/hash_map/struct.ExtractIf.html b/hashbrown/hash_map/struct.ExtractIf.html new file mode 100644 index 0000000000..5119113515 --- /dev/null +++ b/hashbrown/hash_map/struct.ExtractIf.html @@ -0,0 +1,231 @@ +ExtractIf in hashbrown::hash_map - Rust
+

Struct hashbrown::hash_map::ExtractIf

source · 
pub struct ExtractIf<'a, K, V, F, A: Allocator = Global>
where
+    F: FnMut(&K, &mut V) -> bool,
{ /* private fields */ }
Expand description

A draining iterator over entries of a HashMap which don’t satisfy the predicate +f(&k, &mut v) in arbitrary order. The iterator element type is (K, V).

+

This struct is created by the extract_if method on HashMap. See its +documentation for more.

+

§Examples

+
use hashbrown::HashMap;
+
+let mut map: HashMap<i32, &str> = [(1, "a"), (2, "b"), (3, "c")].into();
+
+let mut extract_if = map.extract_if(|k, _v| k % 2 != 0);
+let mut vec = vec![extract_if.next(), extract_if.next()];
+
+// The `ExtractIf` iterator produces items in arbitrary order, so the
+// items must be sorted to test them against a sorted array.
+vec.sort_unstable();
+assert_eq!(vec, [Some((1, "a")),Some((3, "c"))]);
+
+// It is fused iterator
+assert_eq!(extract_if.next(), None);
+assert_eq!(extract_if.next(), None);
+drop(extract_if);
+
+assert_eq!(map.len(), 1);
+

Trait Implementations§

source§

impl<K, V, F, A> Iterator for ExtractIf<'_, K, V, F, A>
where + F: FnMut(&K, &mut V) -> bool, + A: Allocator,

§

type Item = (K, V)

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) -> usize
where + 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<(), NonZero<usize>>

🔬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 Self
where + Self: Sized,

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

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

Transforms an iterator into a collection. Read more
source§

fn collect_into<E>(self, collection: &mut E) -> &mut E
where + 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) -> bool
where + 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) -> R
where + 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) -> R
where + 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) -> B
where + 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>>>::TryType
where + 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) -> bool
where + 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) -> bool
where + 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>>>::TryType
where + 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) -> S
where + Self: Sized, + S: Sum<Self::Item>,

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

fn product<P>(self) -> P
where + 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) -> Ordering
where + 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) -> bool
where + 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) -> bool
where + 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) -> bool
where + 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) -> bool
where + 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) -> bool
where + 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) -> bool
where + 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) -> bool
where + 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) -> bool
where + Self: Sized, + F: FnMut(&Self::Item, &Self::Item) -> bool,

🔬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) -> bool
where + 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<K, V, F> FusedIterator for ExtractIf<'_, K, V, F>
where + F: FnMut(&K, &mut V) -> bool,

Auto Trait Implementations§

§

impl<'a, K, V, F, A> Freeze for ExtractIf<'a, K, V, F, A>
where + F: Freeze,

§

impl<'a, K, V, F, A> RefUnwindSafe for ExtractIf<'a, K, V, F, A>
where + A: RefUnwindSafe, + F: RefUnwindSafe, + K: RefUnwindSafe, + V: RefUnwindSafe,

§

impl<'a, K, V, F, A> Send for ExtractIf<'a, K, V, F, A>
where + A: Send, + F: Send, + K: Send, + V: Send,

§

impl<'a, K, V, F, A> Sync for ExtractIf<'a, K, V, F, A>
where + A: Sync, + F: Sync, + K: Sync, + V: Sync,

§

impl<'a, K, V, F, A> Unpin for ExtractIf<'a, K, V, F, A>
where + F: Unpin,

§

impl<'a, K, V, F, A = Global> !UnwindSafe for ExtractIf<'a, K, V, F, A>

Blanket Implementations§

source§

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

source§

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more
source§

impl<T> Borrow<T> for T
where + T: ?Sized,

source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
source§

impl<T> BorrowMut<T> for T
where + 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 T
where + 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 I
where + 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, U> TryFrom<U> for T
where + 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 T
where + 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/hashbrown/hash_map/struct.HashMap.html b/hashbrown/hash_map/struct.HashMap.html new file mode 100644 index 0000000000..900eaf265e --- /dev/null +++ b/hashbrown/hash_map/struct.HashMap.html @@ -0,0 +1,1388 @@ +HashMap in hashbrown::hash_map - Rust
+

Struct hashbrown::hash_map::HashMap

source · 
pub struct HashMap<K, V, S = DefaultHashBuilder, A: Allocator = Global> { /* private fields */ }
Expand description

A hash map implemented with quadratic probing and SIMD lookup.

+

The default hashing algorithm is currently AHash, though this is +subject to change at any point in the future. This hash function is very +fast for all types of keys, but this algorithm will typically not protect +against attacks such as HashDoS.

+

The hashing algorithm can be replaced on a per-HashMap basis using the +default, with_hasher, and with_capacity_and_hasher methods. Many +alternative algorithms are available on crates.io, such as the fnv crate.

+

It is required that the keys implement the Eq and Hash traits, although +this can frequently be achieved by using #[derive(PartialEq, Eq, Hash)]. +If you implement these yourself, it is important that the following +property holds:

+
k1 == k2 -> hash(k1) == hash(k2)
+
+

In other words, if two keys are equal, their hashes must be equal.

+

It is a logic error for a key to be modified in such a way that the key’s +hash, as determined by the Hash trait, or its equality, as determined by +the Eq trait, changes while it is in the map. This is normally only +possible through Cell, RefCell, global state, I/O, or unsafe code.

+

It is also a logic error for the Hash implementation of a key to panic. +This is generally only possible if the trait is implemented manually. If a +panic does occur then the contents of the HashMap may become corrupted and +some items may be dropped from the table.

+

§Examples

+
use hashbrown::HashMap;
+
+// Type inference lets us omit an explicit type signature (which
+// would be `HashMap<String, String>` in this example).
+let mut book_reviews = HashMap::new();
+
+// Review some books.
+book_reviews.insert(
+    "Adventures of Huckleberry Finn".to_string(),
+    "My favorite book.".to_string(),
+);
+book_reviews.insert(
+    "Grimms' Fairy Tales".to_string(),
+    "Masterpiece.".to_string(),
+);
+book_reviews.insert(
+    "Pride and Prejudice".to_string(),
+    "Very enjoyable.".to_string(),
+);
+book_reviews.insert(
+    "The Adventures of Sherlock Holmes".to_string(),
+    "Eye lyked it alot.".to_string(),
+);
+
+// Check for a specific one.
+// When collections store owned values (String), they can still be
+// queried using references (&str).
+if !book_reviews.contains_key("Les Misérables") {
+    println!("We've got {} reviews, but Les Misérables ain't one.",
+             book_reviews.len());
+}
+
+// oops, this review has a lot of spelling mistakes, let's delete it.
+book_reviews.remove("The Adventures of Sherlock Holmes");
+
+// Look up the values associated with some keys.
+let to_find = ["Pride and Prejudice", "Alice's Adventure in Wonderland"];
+for &book in &to_find {
+    match book_reviews.get(book) {
+        Some(review) => println!("{}: {}", book, review),
+        None => println!("{} is unreviewed.", book)
+    }
+}
+
+// Look up the value for a key (will panic if the key is not found).
+println!("Review for Jane: {}", book_reviews["Pride and Prejudice"]);
+
+// Iterate over everything.
+for (book, review) in &book_reviews {
+    println!("{}: \"{}\"", book, review);
+}
+

HashMap also implements an Entry API, which allows +for more complex methods of getting, setting, updating and removing keys and +their values:

+ +
use hashbrown::HashMap;
+
+// type inference lets us omit an explicit type signature (which
+// would be `HashMap<&str, u8>` in this example).
+let mut player_stats = HashMap::new();
+
+fn random_stat_buff() -> u8 {
+    // could actually return some random value here - let's just return
+    // some fixed value for now
+    42
+}
+
+// insert a key only if it doesn't already exist
+player_stats.entry("health").or_insert(100);
+
+// insert a key using a function that provides a new value only if it
+// doesn't already exist
+player_stats.entry("defence").or_insert_with(random_stat_buff);
+
+// update a key, guarding against the key possibly not being set
+let stat = player_stats.entry("attack").or_insert(100);
+*stat += random_stat_buff();
+

The easiest way to use HashMap with a custom key type is to derive Eq and Hash. +We must also derive PartialEq.

+ +
use hashbrown::HashMap;
+
+#[derive(Hash, Eq, PartialEq, Debug)]
+struct Viking {
+    name: String,
+    country: String,
+}
+
+impl Viking {
+    /// Creates a new Viking.
+    fn new(name: &str, country: &str) -> Viking {
+        Viking { name: name.to_string(), country: country.to_string() }
+    }
+}
+
+// Use a HashMap to store the vikings' health points.
+let mut vikings = HashMap::new();
+
+vikings.insert(Viking::new("Einar", "Norway"), 25);
+vikings.insert(Viking::new("Olaf", "Denmark"), 24);
+vikings.insert(Viking::new("Harald", "Iceland"), 12);
+
+// Use derived implementation to print the status of the vikings.
+for (viking, health) in &vikings {
+    println!("{:?} has {} hp", viking, health);
+}
+

A HashMap with fixed list of elements can be initialized from an array:

+ +
use hashbrown::HashMap;
+
+let timber_resources: HashMap<&str, i32> = [("Norway", 100), ("Denmark", 50), ("Iceland", 10)]
+    .into_iter().collect();
+// use the values stored in map
+

Implementations§

source§

impl<K, V, S> HashMap<K, V, S>

source

pub const fn with_hasher(hash_builder: S) -> Self

Creates an empty HashMap which will use the given hash builder to hash +keys.

+

The hash map is initially created with a capacity of 0, so it will not +allocate until it is first inserted into.

+
§HashDoS resistance
+

The hash_builder normally use a fixed key by default and that does +not allow the HashMap to be protected against attacks such as HashDoS. +Users who require HashDoS resistance should explicitly use +[ahash::RandomState] or std::collections::hash_map::RandomState +as the hasher when creating a HashMap.

+

The hash_builder passed should implement the BuildHasher trait for +the HashMap to be useful, see its documentation for details.

+
§Examples
+
use hashbrown::HashMap;
+use hashbrown::hash_map::DefaultHashBuilder;
+
+let s = DefaultHashBuilder::default();
+let mut map = HashMap::with_hasher(s);
+assert_eq!(map.len(), 0);
+assert_eq!(map.capacity(), 0);
+
+map.insert(1, 2);
+
source

pub fn with_capacity_and_hasher(capacity: usize, hash_builder: S) -> Self

Creates an empty HashMap with the specified capacity, using hash_builder +to hash the keys.

+

The hash map will be able to hold at least capacity elements without +reallocating. If capacity is 0, the hash map will not allocate.

+
§HashDoS resistance
+

The hash_builder normally use a fixed key by default and that does +not allow the HashMap to be protected against attacks such as HashDoS. +Users who require HashDoS resistance should explicitly use +[ahash::RandomState] or std::collections::hash_map::RandomState +as the hasher when creating a HashMap.

+

The hash_builder passed should implement the BuildHasher trait for +the HashMap to be useful, see its documentation for details.

+
§Examples
+
use hashbrown::HashMap;
+use hashbrown::hash_map::DefaultHashBuilder;
+
+let s = DefaultHashBuilder::default();
+let mut map = HashMap::with_capacity_and_hasher(10, s);
+assert_eq!(map.len(), 0);
+assert!(map.capacity() >= 10);
+
+map.insert(1, 2);
+
source§

impl<K, V, S, A: Allocator> HashMap<K, V, S, A>

source

pub fn allocator(&self) -> &A

Returns a reference to the underlying allocator.

+
source

pub const fn with_hasher_in(hash_builder: S, alloc: A) -> Self

Creates an empty HashMap which will use the given hash builder to hash +keys. It will be allocated with the given allocator.

+

The hash map is initially created with a capacity of 0, so it will not allocate until it +is first inserted into.

+
§HashDoS resistance
+

The hash_builder normally use a fixed key by default and that does +not allow the HashMap to be protected against attacks such as HashDoS. +Users who require HashDoS resistance should explicitly use +[ahash::RandomState] or std::collections::hash_map::RandomState +as the hasher when creating a HashMap.

+
§Examples
+
use hashbrown::HashMap;
+use hashbrown::hash_map::DefaultHashBuilder;
+
+let s = DefaultHashBuilder::default();
+let mut map = HashMap::with_hasher(s);
+map.insert(1, 2);
+
source

pub fn with_capacity_and_hasher_in( + capacity: usize, + hash_builder: S, + alloc: A +) -> Self

Creates an empty HashMap with the specified capacity, using hash_builder +to hash the keys. It will be allocated with the given allocator.

+

The hash map will be able to hold at least capacity elements without +reallocating. If capacity is 0, the hash map will not allocate.

+
§HashDoS resistance
+

The hash_builder normally use a fixed key by default and that does +not allow the HashMap to be protected against attacks such as HashDoS. +Users who require HashDoS resistance should explicitly use +[ahash::RandomState] or std::collections::hash_map::RandomState +as the hasher when creating a HashMap.

+
§Examples
+
use hashbrown::HashMap;
+use hashbrown::hash_map::DefaultHashBuilder;
+
+let s = DefaultHashBuilder::default();
+let mut map = HashMap::with_capacity_and_hasher(10, s);
+map.insert(1, 2);
+
source

pub fn hasher(&self) -> &S

Returns a reference to the map’s BuildHasher.

+
§Examples
+
use hashbrown::HashMap;
+use hashbrown::hash_map::DefaultHashBuilder;
+
+let hasher = DefaultHashBuilder::default();
+let map: HashMap<i32, i32> = HashMap::with_hasher(hasher);
+let hasher: &DefaultHashBuilder = map.hasher();
+
source

pub fn capacity(&self) -> usize

Returns the number of elements the map can hold without reallocating.

+

This number is a lower bound; the HashMap<K, V> might be able to hold +more, but is guaranteed to be able to hold at least this many.

+
§Examples
+
use hashbrown::HashMap;
+let map: HashMap<i32, i32> = HashMap::with_capacity(100);
+assert_eq!(map.len(), 0);
+assert!(map.capacity() >= 100);
+
source

pub fn keys(&self) -> Keys<'_, K, V> ⓘ

An iterator visiting all keys in arbitrary order. +The iterator element type is &'a K.

+
§Examples
+
use hashbrown::HashMap;
+
+let mut map = HashMap::new();
+map.insert("a", 1);
+map.insert("b", 2);
+map.insert("c", 3);
+assert_eq!(map.len(), 3);
+let mut vec: Vec<&str> = Vec::new();
+
+for key in map.keys() {
+    println!("{}", key);
+    vec.push(*key);
+}
+
+// The `Keys` iterator produces keys in arbitrary order, so the
+// keys must be sorted to test them against a sorted array.
+vec.sort_unstable();
+assert_eq!(vec, ["a", "b", "c"]);
+
+assert_eq!(map.len(), 3);
+
source

pub fn values(&self) -> Values<'_, K, V> ⓘ

An iterator visiting all values in arbitrary order. +The iterator element type is &'a V.

+
§Examples
+
use hashbrown::HashMap;
+
+let mut map = HashMap::new();
+map.insert("a", 1);
+map.insert("b", 2);
+map.insert("c", 3);
+assert_eq!(map.len(), 3);
+let mut vec: Vec<i32> = Vec::new();
+
+for val in map.values() {
+    println!("{}", val);
+    vec.push(*val);
+}
+
+// The `Values` iterator produces values in arbitrary order, so the
+// values must be sorted to test them against a sorted array.
+vec.sort_unstable();
+assert_eq!(vec, [1, 2, 3]);
+
+assert_eq!(map.len(), 3);
+
source

pub fn values_mut(&mut self) -> ValuesMut<'_, K, V> ⓘ

An iterator visiting all values mutably in arbitrary order. +The iterator element type is &'a mut V.

+
§Examples
+
use hashbrown::HashMap;
+
+let mut map = HashMap::new();
+
+map.insert("a", 1);
+map.insert("b", 2);
+map.insert("c", 3);
+
+for val in map.values_mut() {
+    *val = *val + 10;
+}
+
+assert_eq!(map.len(), 3);
+let mut vec: Vec<i32> = Vec::new();
+
+for val in map.values() {
+    println!("{}", val);
+    vec.push(*val);
+}
+
+// The `Values` iterator produces values in arbitrary order, so the
+// values must be sorted to test them against a sorted array.
+vec.sort_unstable();
+assert_eq!(vec, [11, 12, 13]);
+
+assert_eq!(map.len(), 3);
+
source

pub fn iter(&self) -> Iter<'_, K, V> ⓘ

An iterator visiting all key-value pairs in arbitrary order. +The iterator element type is (&'a K, &'a V).

+
§Examples
+
use hashbrown::HashMap;
+
+let mut map = HashMap::new();
+map.insert("a", 1);
+map.insert("b", 2);
+map.insert("c", 3);
+assert_eq!(map.len(), 3);
+let mut vec: Vec<(&str, i32)> = Vec::new();
+
+for (key, val) in map.iter() {
+    println!("key: {} val: {}", key, val);
+    vec.push((*key, *val));
+}
+
+// The `Iter` iterator produces items in arbitrary order, so the
+// items must be sorted to test them against a sorted array.
+vec.sort_unstable();
+assert_eq!(vec, [("a", 1), ("b", 2), ("c", 3)]);
+
+assert_eq!(map.len(), 3);
+
source

pub fn iter_mut(&mut self) -> IterMut<'_, K, V> ⓘ

An iterator visiting all key-value pairs in arbitrary order, +with mutable references to the values. +The iterator element type is (&'a K, &'a mut V).

+
§Examples
+
use hashbrown::HashMap;
+
+let mut map = HashMap::new();
+map.insert("a", 1);
+map.insert("b", 2);
+map.insert("c", 3);
+
+// Update all values
+for (_, val) in map.iter_mut() {
+    *val *= 2;
+}
+
+assert_eq!(map.len(), 3);
+let mut vec: Vec<(&str, i32)> = Vec::new();
+
+for (key, val) in &map {
+    println!("key: {} val: {}", key, val);
+    vec.push((*key, *val));
+}
+
+// The `Iter` iterator produces items in arbitrary order, so the
+// items must be sorted to test them against a sorted array.
+vec.sort_unstable();
+assert_eq!(vec, [("a", 2), ("b", 4), ("c", 6)]);
+
+assert_eq!(map.len(), 3);
+
source

pub fn len(&self) -> usize

Returns the number of elements in the map.

+
§Examples
+
use hashbrown::HashMap;
+
+let mut a = HashMap::new();
+assert_eq!(a.len(), 0);
+a.insert(1, "a");
+assert_eq!(a.len(), 1);
+
source

pub fn is_empty(&self) -> bool

Returns true if the map contains no elements.

+
§Examples
+
use hashbrown::HashMap;
+
+let mut a = HashMap::new();
+assert!(a.is_empty());
+a.insert(1, "a");
+assert!(!a.is_empty());
+
source

pub fn drain(&mut self) -> Drain<'_, K, V, A> ⓘ

Clears the map, returning all key-value pairs as an iterator. Keeps the +allocated memory for reuse.

+

If the returned iterator is dropped before being fully consumed, it +drops the remaining key-value pairs. The returned iterator keeps a +mutable borrow on the vector to optimize its implementation.

+
§Examples
+
use hashbrown::HashMap;
+
+let mut a = HashMap::new();
+a.insert(1, "a");
+a.insert(2, "b");
+let capacity_before_drain = a.capacity();
+
+for (k, v) in a.drain().take(1) {
+    assert!(k == 1 || k == 2);
+    assert!(v == "a" || v == "b");
+}
+
+// As we can see, the map is empty and contains no element.
+assert!(a.is_empty() && a.len() == 0);
+// But map capacity is equal to old one.
+assert_eq!(a.capacity(), capacity_before_drain);
+
+let mut a = HashMap::new();
+a.insert(1, "a");
+a.insert(2, "b");
+
+{   // Iterator is dropped without being consumed.
+    let d = a.drain();
+}
+
+// But the map is empty even if we do not use Drain iterator.
+assert!(a.is_empty());
+
source

pub fn retain<F>(&mut self, f: F)
where + F: FnMut(&K, &mut V) -> bool,

Retains only the elements specified by the predicate. Keeps the +allocated memory for reuse.

+

In other words, remove all pairs (k, v) such that f(&k, &mut v) returns false. +The elements are visited in unsorted (and unspecified) order.

+
§Examples
+
use hashbrown::HashMap;
+
+let mut map: HashMap<i32, i32> = (0..8).map(|x|(x, x*10)).collect();
+assert_eq!(map.len(), 8);
+
+map.retain(|&k, _| k % 2 == 0);
+
+// We can see, that the number of elements inside map is changed.
+assert_eq!(map.len(), 4);
+
+let mut vec: Vec<(i32, i32)> = map.iter().map(|(&k, &v)| (k, v)).collect();
+vec.sort_unstable();
+assert_eq!(vec, [(0, 0), (2, 20), (4, 40), (6, 60)]);
+
source

pub fn extract_if<F>(&mut self, f: F) -> ExtractIf<'_, K, V, F, A> ⓘ
where + F: FnMut(&K, &mut V) -> bool,

Drains elements which are true under the given predicate, +and returns an iterator over the removed items.

+

In other words, move all pairs (k, v) such that f(&k, &mut v) returns true out +into another iterator.

+

Note that extract_if lets you mutate every value in the filter closure, regardless of +whether you choose to keep or remove it.

+

If the returned ExtractIf is not exhausted, e.g. because it is dropped without iterating +or the iteration short-circuits, then the remaining elements will be retained. +Use retain() with a negated predicate if you do not need the returned iterator.

+

Keeps the allocated memory for reuse.

+
§Examples
+
use hashbrown::HashMap;
+
+let mut map: HashMap<i32, i32> = (0..8).map(|x| (x, x)).collect();
+
+let drained: HashMap<i32, i32> = map.extract_if(|k, _v| k % 2 == 0).collect();
+
+let mut evens = drained.keys().cloned().collect::<Vec<_>>();
+let mut odds = map.keys().cloned().collect::<Vec<_>>();
+evens.sort();
+odds.sort();
+
+assert_eq!(evens, vec![0, 2, 4, 6]);
+assert_eq!(odds, vec![1, 3, 5, 7]);
+
+let mut map: HashMap<i32, i32> = (0..8).map(|x| (x, x)).collect();
+
+{   // Iterator is dropped without being consumed.
+    let d = map.extract_if(|k, _v| k % 2 != 0);
+}
+
+// ExtractIf was not exhausted, therefore no elements were drained.
+assert_eq!(map.len(), 8);
+
source

pub fn clear(&mut self)

Clears the map, removing all key-value pairs. Keeps the allocated memory +for reuse.

+
§Examples
+
use hashbrown::HashMap;
+
+let mut a = HashMap::new();
+a.insert(1, "a");
+let capacity_before_clear = a.capacity();
+
+a.clear();
+
+// Map is empty.
+assert!(a.is_empty());
+// But map capacity is equal to old one.
+assert_eq!(a.capacity(), capacity_before_clear);
+
source

pub fn into_keys(self) -> IntoKeys<K, V, A> ⓘ

Creates a consuming iterator visiting all the keys in arbitrary order. +The map cannot be used after calling this. +The iterator element type is K.

+
§Examples
+
use hashbrown::HashMap;
+
+let mut map = HashMap::new();
+map.insert("a", 1);
+map.insert("b", 2);
+map.insert("c", 3);
+
+let mut vec: Vec<&str> = map.into_keys().collect();
+
+// The `IntoKeys` iterator produces keys in arbitrary order, so the
+// keys must be sorted to test them against a sorted array.
+vec.sort_unstable();
+assert_eq!(vec, ["a", "b", "c"]);
+
source

pub fn into_values(self) -> IntoValues<K, V, A> ⓘ

Creates a consuming iterator visiting all the values in arbitrary order. +The map cannot be used after calling this. +The iterator element type is V.

+
§Examples
+
use hashbrown::HashMap;
+
+let mut map = HashMap::new();
+map.insert("a", 1);
+map.insert("b", 2);
+map.insert("c", 3);
+
+let mut vec: Vec<i32> = map.into_values().collect();
+
+// The `IntoValues` iterator produces values in arbitrary order, so
+// the values must be sorted to test them against a sorted array.
+vec.sort_unstable();
+assert_eq!(vec, [1, 2, 3]);
+
source§

impl<K, V, S, A> HashMap<K, V, S, A>
where + K: Eq + Hash, + S: BuildHasher, + A: Allocator,

source

pub fn reserve(&mut self, additional: usize)

Reserves capacity for at least additional more elements to be inserted +in the HashMap. The collection may reserve more space to avoid +frequent reallocations.

+
§Panics
+

Panics if the new capacity exceeds isize::MAX bytes and abort the program +in case of allocation error. Use try_reserve instead +if you want to handle memory allocation failure.

+
§Examples
+
use hashbrown::HashMap;
+let mut map: HashMap<&str, i32> = HashMap::new();
+// Map is empty and doesn't allocate memory
+assert_eq!(map.capacity(), 0);
+
+map.reserve(10);
+
+// And now map can hold at least 10 elements
+assert!(map.capacity() >= 10);
+
source

pub fn try_reserve(&mut self, additional: usize) -> Result<(), TryReserveError>

Tries to reserve capacity for at least additional more elements to be inserted +in the given HashMap<K,V>. The collection may reserve more space to avoid +frequent reallocations.

+
§Errors
+

If the capacity overflows, or the allocator reports a failure, then an error +is returned.

+
§Examples
+
use hashbrown::HashMap;
+
+let mut map: HashMap<&str, isize> = HashMap::new();
+// Map is empty and doesn't allocate memory
+assert_eq!(map.capacity(), 0);
+
+map.try_reserve(10).expect("why is the test harness OOMing on 10 bytes?");
+
+// And now map can hold at least 10 elements
+assert!(map.capacity() >= 10);
+

If the capacity overflows, or the allocator reports a failure, then an error +is returned:

+ +
use hashbrown::HashMap;
+use hashbrown::TryReserveError;
+let mut map: HashMap<i32, i32> = HashMap::new();
+
+match map.try_reserve(usize::MAX) {
+    Err(error) => match error {
+        TryReserveError::CapacityOverflow => {}
+        _ => panic!("TryReserveError::AllocError ?"),
+    },
+    _ => panic!(),
+}
+
source

pub fn shrink_to_fit(&mut self)

Shrinks the capacity of the map as much as possible. It will drop +down as much as possible while maintaining the internal rules +and possibly leaving some space in accordance with the resize policy.

+
§Examples
+
use hashbrown::HashMap;
+
+let mut map: HashMap<i32, i32> = HashMap::with_capacity(100);
+map.insert(1, 2);
+map.insert(3, 4);
+assert!(map.capacity() >= 100);
+map.shrink_to_fit();
+assert!(map.capacity() >= 2);
+
source

pub fn shrink_to(&mut self, min_capacity: usize)

Shrinks the capacity of the map with a lower limit. It will drop +down no lower than the supplied limit while maintaining the internal rules +and possibly leaving some space in accordance with the resize policy.

+

This function does nothing if the current capacity is smaller than the +supplied minimum capacity.

+
§Examples
+
use hashbrown::HashMap;
+
+let mut map: HashMap<i32, i32> = HashMap::with_capacity(100);
+map.insert(1, 2);
+map.insert(3, 4);
+assert!(map.capacity() >= 100);
+map.shrink_to(10);
+assert!(map.capacity() >= 10);
+map.shrink_to(0);
+assert!(map.capacity() >= 2);
+map.shrink_to(10);
+assert!(map.capacity() >= 2);
+
source

pub fn entry(&mut self, key: K) -> Entry<'_, K, V, S, A>

Gets the given key’s corresponding entry in the map for in-place manipulation.

+
§Examples
+
use hashbrown::HashMap;
+
+let mut letters = HashMap::new();
+
+for ch in "a short treatise on fungi".chars() {
+    let counter = letters.entry(ch).or_insert(0);
+    *counter += 1;
+}
+
+assert_eq!(letters[&'s'], 2);
+assert_eq!(letters[&'t'], 3);
+assert_eq!(letters[&'u'], 1);
+assert_eq!(letters.get(&'y'), None);
+
source

pub fn entry_ref<'a, 'b, Q>( + &'a mut self, + key: &'b Q +) -> EntryRef<'a, 'b, K, Q, V, S, A>
where + Q: Hash + Equivalent<K> + ?Sized,

Gets the given key’s corresponding entry by reference in the map for in-place manipulation.

+
§Examples
+
use hashbrown::HashMap;
+
+let mut words: HashMap<String, usize> = HashMap::new();
+let source = ["poneyland", "horseyland", "poneyland", "poneyland"];
+for (i, &s) in source.iter().enumerate() {
+    let counter = words.entry_ref(s).or_insert(0);
+    *counter += 1;
+}
+
+assert_eq!(words["poneyland"], 3);
+assert_eq!(words["horseyland"], 1);
+
source

pub fn get<Q>(&self, k: &Q) -> Option<&V>
where + Q: Hash + Equivalent<K> + ?Sized,

Returns a reference to the value corresponding to the key.

+

The key may be any borrowed form of the map’s key type, but +Hash and Eq on the borrowed form must match those for +the key type.

+
§Examples
+
use hashbrown::HashMap;
+
+let mut map = HashMap::new();
+map.insert(1, "a");
+assert_eq!(map.get(&1), Some(&"a"));
+assert_eq!(map.get(&2), None);
+
source

pub fn get_key_value<Q>(&self, k: &Q) -> Option<(&K, &V)>
where + Q: Hash + Equivalent<K> + ?Sized,

Returns the key-value pair corresponding to the supplied key.

+

The supplied key may be any borrowed form of the map’s key type, but +Hash and Eq on the borrowed form must match those for +the key type.

+
§Examples
+
use hashbrown::HashMap;
+
+let mut map = HashMap::new();
+map.insert(1, "a");
+assert_eq!(map.get_key_value(&1), Some((&1, &"a")));
+assert_eq!(map.get_key_value(&2), None);
+
source

pub fn get_key_value_mut<Q>(&mut self, k: &Q) -> Option<(&K, &mut V)>
where + Q: Hash + Equivalent<K> + ?Sized,

Returns the key-value pair corresponding to the supplied key, with a mutable reference to value.

+

The supplied key may be any borrowed form of the map’s key type, but +Hash and Eq on the borrowed form must match those for +the key type.

+
§Examples
+
use hashbrown::HashMap;
+
+let mut map = HashMap::new();
+map.insert(1, "a");
+let (k, v) = map.get_key_value_mut(&1).unwrap();
+assert_eq!(k, &1);
+assert_eq!(v, &mut "a");
+*v = "b";
+assert_eq!(map.get_key_value_mut(&1), Some((&1, &mut "b")));
+assert_eq!(map.get_key_value_mut(&2), None);
+
source

pub fn contains_key<Q>(&self, k: &Q) -> bool
where + Q: Hash + Equivalent<K> + ?Sized,

Returns true if the map contains a value for the specified key.

+

The key may be any borrowed form of the map’s key type, but +Hash and Eq on the borrowed form must match those for +the key type.

+
§Examples
+
use hashbrown::HashMap;
+
+let mut map = HashMap::new();
+map.insert(1, "a");
+assert_eq!(map.contains_key(&1), true);
+assert_eq!(map.contains_key(&2), false);
+
source

pub fn get_mut<Q>(&mut self, k: &Q) -> Option<&mut V>
where + Q: Hash + Equivalent<K> + ?Sized,

Returns a mutable reference to the value corresponding to the key.

+

The key may be any borrowed form of the map’s key type, but +Hash and Eq on the borrowed form must match those for +the key type.

+
§Examples
+
use hashbrown::HashMap;
+
+let mut map = HashMap::new();
+map.insert(1, "a");
+if let Some(x) = map.get_mut(&1) {
+    *x = "b";
+}
+assert_eq!(map[&1], "b");
+
+assert_eq!(map.get_mut(&2), None);
+
source

pub fn get_many_mut<Q, const N: usize>( + &mut self, + ks: [&Q; N] +) -> Option<[&mut V; N]>
where + Q: Hash + Equivalent<K> + ?Sized,

Attempts to get mutable references to N values in the map at once.

+

Returns an array of length N with the results of each query. For soundness, at most one +mutable reference will be returned to any value. None will be returned if any of the +keys are duplicates or missing.

+
§Examples
+
use hashbrown::HashMap;
+
+let mut libraries = HashMap::new();
+libraries.insert("Bodleian Library".to_string(), 1602);
+libraries.insert("Athenæum".to_string(), 1807);
+libraries.insert("Herzogin-Anna-Amalia-Bibliothek".to_string(), 1691);
+libraries.insert("Library of Congress".to_string(), 1800);
+
+let got = libraries.get_many_mut([
+    "Athenæum",
+    "Library of Congress",
+]);
+assert_eq!(
+    got,
+    Some([
+        &mut 1807,
+        &mut 1800,
+    ]),
+);
+
+// Missing keys result in None
+let got = libraries.get_many_mut([
+    "Athenæum",
+    "New York Public Library",
+]);
+assert_eq!(got, None);
+
+// Duplicate keys result in None
+let got = libraries.get_many_mut([
+    "Athenæum",
+    "Athenæum",
+]);
+assert_eq!(got, None);
+
source

pub unsafe fn get_many_unchecked_mut<Q, const N: usize>( + &mut self, + ks: [&Q; N] +) -> Option<[&mut V; N]>
where + Q: Hash + Equivalent<K> + ?Sized,

Attempts to get mutable references to N values in the map at once, without validating that +the values are unique.

+

Returns an array of length N with the results of each query. None will be returned if +any of the keys are missing.

+

For a safe alternative see get_many_mut.

+
§Safety
+

Calling this method with overlapping keys is undefined behavior even if the resulting +references are not used.

+
§Examples
+
use hashbrown::HashMap;
+
+let mut libraries = HashMap::new();
+libraries.insert("Bodleian Library".to_string(), 1602);
+libraries.insert("Athenæum".to_string(), 1807);
+libraries.insert("Herzogin-Anna-Amalia-Bibliothek".to_string(), 1691);
+libraries.insert("Library of Congress".to_string(), 1800);
+
+let got = libraries.get_many_mut([
+    "Athenæum",
+    "Library of Congress",
+]);
+assert_eq!(
+    got,
+    Some([
+        &mut 1807,
+        &mut 1800,
+    ]),
+);
+
+// Missing keys result in None
+let got = libraries.get_many_mut([
+    "Athenæum",
+    "New York Public Library",
+]);
+assert_eq!(got, None);
+
source

pub fn get_many_key_value_mut<Q, const N: usize>( + &mut self, + ks: [&Q; N] +) -> Option<[(&K, &mut V); N]>
where + Q: Hash + Equivalent<K> + ?Sized,

Attempts to get mutable references to N values in the map at once, with immutable +references to the corresponding keys.

+

Returns an array of length N with the results of each query. For soundness, at most one +mutable reference will be returned to any value. None will be returned if any of the keys +are duplicates or missing.

+
§Examples
+
use hashbrown::HashMap;
+
+let mut libraries = HashMap::new();
+libraries.insert("Bodleian Library".to_string(), 1602);
+libraries.insert("Athenæum".to_string(), 1807);
+libraries.insert("Herzogin-Anna-Amalia-Bibliothek".to_string(), 1691);
+libraries.insert("Library of Congress".to_string(), 1800);
+
+let got = libraries.get_many_key_value_mut([
+    "Bodleian Library",
+    "Herzogin-Anna-Amalia-Bibliothek",
+]);
+assert_eq!(
+    got,
+    Some([
+        (&"Bodleian Library".to_string(), &mut 1602),
+        (&"Herzogin-Anna-Amalia-Bibliothek".to_string(), &mut 1691),
+    ]),
+);
+// Missing keys result in None
+let got = libraries.get_many_key_value_mut([
+    "Bodleian Library",
+    "Gewandhaus",
+]);
+assert_eq!(got, None);
+
+// Duplicate keys result in None
+let got = libraries.get_many_key_value_mut([
+    "Bodleian Library",
+    "Herzogin-Anna-Amalia-Bibliothek",
+    "Herzogin-Anna-Amalia-Bibliothek",
+]);
+assert_eq!(got, None);
+
source

pub unsafe fn get_many_key_value_unchecked_mut<Q, const N: usize>( + &mut self, + ks: [&Q; N] +) -> Option<[(&K, &mut V); N]>
where + Q: Hash + Equivalent<K> + ?Sized,

Attempts to get mutable references to N values in the map at once, with immutable +references to the corresponding keys, without validating that the values are unique.

+

Returns an array of length N with the results of each query. None will be returned if +any of the keys are missing.

+

For a safe alternative see get_many_key_value_mut.

+
§Safety
+

Calling this method with overlapping keys is undefined behavior even if the resulting +references are not used.

+
§Examples
+
use hashbrown::HashMap;
+
+let mut libraries = HashMap::new();
+libraries.insert("Bodleian Library".to_string(), 1602);
+libraries.insert("Athenæum".to_string(), 1807);
+libraries.insert("Herzogin-Anna-Amalia-Bibliothek".to_string(), 1691);
+libraries.insert("Library of Congress".to_string(), 1800);
+
+let got = libraries.get_many_key_value_mut([
+    "Bodleian Library",
+    "Herzogin-Anna-Amalia-Bibliothek",
+]);
+assert_eq!(
+    got,
+    Some([
+        (&"Bodleian Library".to_string(), &mut 1602),
+        (&"Herzogin-Anna-Amalia-Bibliothek".to_string(), &mut 1691),
+    ]),
+);
+// Missing keys result in None
+let got = libraries.get_many_key_value_mut([
+    "Bodleian Library",
+    "Gewandhaus",
+]);
+assert_eq!(got, None);
+
source

pub fn insert(&mut self, k: K, v: V) -> Option<V>

Inserts a key-value pair into the map.

+

If the map did not have this key present, None is returned.

+

If the map did have this key present, the value is updated, and the old +value is returned. The key is not updated, though; this matters for +types that can be == without being identical. See the std::collections +module-level documentation for more.

+
§Examples
+
use hashbrown::HashMap;
+
+let mut map = HashMap::new();
+assert_eq!(map.insert(37, "a"), None);
+assert_eq!(map.is_empty(), false);
+
+map.insert(37, "b");
+assert_eq!(map.insert(37, "c"), Some("b"));
+assert_eq!(map[&37], "c");
+
source

pub fn insert_unique_unchecked(&mut self, k: K, v: V) -> (&K, &mut V)

Insert a key-value pair into the map without checking +if the key already exists in the map.

+

Returns a reference to the key and value just inserted.

+

This operation is safe if a key does not exist in the map.

+

However, if a key exists in the map already, the behavior is unspecified: +this operation may panic, loop forever, or any following operation with the map +may panic, loop forever or return arbitrary result.

+

That said, this operation (and following operations) are guaranteed to +not violate memory safety.

+

This operation is faster than regular insert, because it does not perform +lookup before insertion.

+

This operation is useful during initial population of the map. +For example, when constructing a map from another map, we know +that keys are unique.

+
§Examples
+
use hashbrown::HashMap;
+
+let mut map1 = HashMap::new();
+assert_eq!(map1.insert(1, "a"), None);
+assert_eq!(map1.insert(2, "b"), None);
+assert_eq!(map1.insert(3, "c"), None);
+assert_eq!(map1.len(), 3);
+
+let mut map2 = HashMap::new();
+
+for (key, value) in map1.into_iter() {
+    map2.insert_unique_unchecked(key, value);
+}
+
+let (key, value) = map2.insert_unique_unchecked(4, "d");
+assert_eq!(key, &4);
+assert_eq!(value, &mut "d");
+*value = "e";
+
+assert_eq!(map2[&1], "a");
+assert_eq!(map2[&2], "b");
+assert_eq!(map2[&3], "c");
+assert_eq!(map2[&4], "e");
+assert_eq!(map2.len(), 4);
+
source

pub fn try_insert( + &mut self, + key: K, + value: V +) -> Result<&mut V, OccupiedError<'_, K, V, S, A>>

Tries to insert a key-value pair into the map, and returns +a mutable reference to the value in the entry.

+
§Errors
+

If the map already had this key present, nothing is updated, and +an error containing the occupied entry and the value is returned.

+
§Examples
+

Basic usage:

+ +
use hashbrown::HashMap;
+use hashbrown::hash_map::OccupiedError;
+
+let mut map = HashMap::new();
+assert_eq!(map.try_insert(37, "a").unwrap(), &"a");
+
+match map.try_insert(37, "b") {
+    Err(OccupiedError { entry, value }) => {
+        assert_eq!(entry.key(), &37);
+        assert_eq!(entry.get(), &"a");
+        assert_eq!(value, "b");
+    }
+    _ => panic!()
+}
+
source

pub fn remove<Q>(&mut self, k: &Q) -> Option<V>
where + Q: Hash + Equivalent<K> + ?Sized,

Removes a key from the map, returning the value at the key if the key +was previously in the map. Keeps the allocated memory for reuse.

+

The key may be any borrowed form of the map’s key type, but +Hash and Eq on the borrowed form must match those for +the key type.

+
§Examples
+
use hashbrown::HashMap;
+
+let mut map = HashMap::new();
+// The map is empty
+assert!(map.is_empty() && map.capacity() == 0);
+
+map.insert(1, "a");
+
+assert_eq!(map.remove(&1), Some("a"));
+assert_eq!(map.remove(&1), None);
+
+// Now map holds none elements
+assert!(map.is_empty());
+
source

pub fn remove_entry<Q>(&mut self, k: &Q) -> Option<(K, V)>
where + Q: Hash + Equivalent<K> + ?Sized,

Removes a key from the map, returning the stored key and value if the +key was previously in the map. Keeps the allocated memory for reuse.

+

The key may be any borrowed form of the map’s key type, but +Hash and Eq on the borrowed form must match those for +the key type.

+
§Examples
+
use hashbrown::HashMap;
+
+let mut map = HashMap::new();
+// The map is empty
+assert!(map.is_empty() && map.capacity() == 0);
+
+map.insert(1, "a");
+
+assert_eq!(map.remove_entry(&1), Some((1, "a")));
+assert_eq!(map.remove(&1), None);
+
+// Now map hold none elements
+assert!(map.is_empty());
+
source§

impl<K, V, S, A: Allocator> HashMap<K, V, S, A>

source

pub fn raw_entry_mut(&mut self) -> RawEntryBuilderMut<'_, K, V, S, A>

Creates a raw entry builder for the HashMap.

+

Raw entries provide the lowest level of control for searching and +manipulating a map. They must be manually initialized with a hash and +then manually searched. After this, insertions into a vacant entry +still require an owned key to be provided.

+

Raw entries are useful for such exotic situations as:

+
    +
  • Hash memoization
    • +
  • Deferring the creation of an owned key until it is known to be required
    • +
  • Using a search key that doesn’t work with the Borrow trait
    • +
  • Using custom comparison logic without newtype wrappers
    • +
+

Because raw entries provide much more low-level control, it’s much easier +to put the HashMap into an inconsistent state which, while memory-safe, +will cause the map to produce seemingly random results. Higher-level and +more foolproof APIs like entry should be preferred when possible.

+

In particular, the hash used to initialized the raw entry must still be +consistent with the hash of the key that is ultimately stored in the entry. +This is because implementations of HashMap may need to recompute hashes +when resizing, at which point only the keys are available.

+

Raw entries give mutable access to the keys. This must not be used +to modify how the key would compare or hash, as the map will not re-evaluate +where the key should go, meaning the keys may become “lost” if their +location does not reflect their state. For instance, if you change a key +so that the map now contains keys which compare equal, search may start +acting erratically, with two keys randomly masking each other. Implementations +are free to assume this doesn’t happen (within the limits of memory-safety).

+
§Examples
+
use core::hash::{BuildHasher, Hash};
+use hashbrown::hash_map::{HashMap, RawEntryMut};
+
+let mut map = HashMap::new();
+map.extend([("a", 100), ("b", 200), ("c", 300)]);
+
+fn compute_hash<K: Hash + ?Sized, S: BuildHasher>(hash_builder: &S, key: &K) -> u64 {
+    use core::hash::Hasher;
+    let mut state = hash_builder.build_hasher();
+    key.hash(&mut state);
+    state.finish()
+}
+
+// Existing key (insert and update)
+match map.raw_entry_mut().from_key(&"a") {
+    RawEntryMut::Vacant(_) => unreachable!(),
+    RawEntryMut::Occupied(mut view) => {
+        assert_eq!(view.get(), &100);
+        let v = view.get_mut();
+        let new_v = (*v) * 10;
+        *v = new_v;
+        assert_eq!(view.insert(1111), 1000);
+    }
+}
+
+assert_eq!(map[&"a"], 1111);
+assert_eq!(map.len(), 3);
+
+// Existing key (take)
+let hash = compute_hash(map.hasher(), &"c");
+match map.raw_entry_mut().from_key_hashed_nocheck(hash, &"c") {
+    RawEntryMut::Vacant(_) => unreachable!(),
+    RawEntryMut::Occupied(view) => {
+        assert_eq!(view.remove_entry(), ("c", 300));
+    }
+}
+assert_eq!(map.raw_entry().from_key(&"c"), None);
+assert_eq!(map.len(), 2);
+
+// Nonexistent key (insert and update)
+let key = "d";
+let hash = compute_hash(map.hasher(), &key);
+match map.raw_entry_mut().from_hash(hash, |q| *q == key) {
+    RawEntryMut::Occupied(_) => unreachable!(),
+    RawEntryMut::Vacant(view) => {
+        let (k, value) = view.insert("d", 4000);
+        assert_eq!((*k, *value), ("d", 4000));
+        *value = 40000;
+    }
+}
+assert_eq!(map[&"d"], 40000);
+assert_eq!(map.len(), 3);
+
+match map.raw_entry_mut().from_hash(hash, |q| *q == key) {
+    RawEntryMut::Vacant(_) => unreachable!(),
+    RawEntryMut::Occupied(view) => {
+        assert_eq!(view.remove_entry(), ("d", 40000));
+    }
+}
+assert_eq!(map.get(&"d"), None);
+assert_eq!(map.len(), 2);
+
source

pub fn raw_entry(&self) -> RawEntryBuilder<'_, K, V, S, A>

Creates a raw immutable entry builder for the HashMap.

+

Raw entries provide the lowest level of control for searching and +manipulating a map. They must be manually initialized with a hash and +then manually searched.

+

This is useful for

+
    +
  • Hash memoization
    • +
  • Using a search key that doesn’t work with the Borrow trait
    • +
  • Using custom comparison logic without newtype wrappers
    • +
+

Unless you are in such a situation, higher-level and more foolproof APIs like +get should be preferred.

+

Immutable raw entries have very limited use; you might instead want raw_entry_mut.

+
§Examples
+
use core::hash::{BuildHasher, Hash};
+use hashbrown::HashMap;
+
+let mut map = HashMap::new();
+map.extend([("a", 100), ("b", 200), ("c", 300)]);
+
+fn compute_hash<K: Hash + ?Sized, S: BuildHasher>(hash_builder: &S, key: &K) -> u64 {
+    use core::hash::Hasher;
+    let mut state = hash_builder.build_hasher();
+    key.hash(&mut state);
+    state.finish()
+}
+
+for k in ["a", "b", "c", "d", "e", "f"] {
+    let hash = compute_hash(map.hasher(), k);
+    let v = map.get(&k).cloned();
+    let kv = v.as_ref().map(|v| (&k, v));
+
+    println!("Key: {} and value: {:?}", k, v);
+
+    assert_eq!(map.raw_entry().from_key(&k), kv);
+    assert_eq!(map.raw_entry().from_hash(hash, |q| *q == k), kv);
+    assert_eq!(map.raw_entry().from_key_hashed_nocheck(hash, &k), kv);
+}
+
source

pub fn raw_table(&self) -> &RawTable<(K, V), A>

Returns a reference to the RawTable used underneath HashMap. +This function is only available if the raw feature of the crate is enabled.

+

See raw_table_mut for more.

+
source

pub fn raw_table_mut(&mut self) -> &mut RawTable<(K, V), A>

Returns a mutable reference to the RawTable used underneath HashMap. +This function is only available if the raw feature of the crate is enabled.

+
§Note
+

Calling this function is safe, but using the raw hash table API may require +unsafe functions or blocks.

+

RawTable API gives the lowest level of control under the map that can be useful +for extending the HashMap’s API, but may lead to undefined behavior.

+
§Examples
+
use core::hash::{BuildHasher, Hash};
+use hashbrown::HashMap;
+
+let mut map = HashMap::new();
+map.extend([("a", 10), ("b", 20), ("c", 30)]);
+assert_eq!(map.len(), 3);
+
+// Let's imagine that we have a value and a hash of the key, but not the key itself.
+// However, if you want to remove the value from the map by hash and value, and you
+// know exactly that the value is unique, then you can create a function like this:
+fn remove_by_hash<K, V, S, F>(
+    map: &mut HashMap<K, V, S>,
+    hash: u64,
+    is_match: F,
+) -> Option<(K, V)>
+where
+    F: Fn(&(K, V)) -> bool,
+{
+    let raw_table = map.raw_table_mut();
+    match raw_table.find(hash, is_match) {
+        Some(bucket) => Some(unsafe { raw_table.remove(bucket).0 }),
+        None => None,
+    }
+}
+
+fn compute_hash<K: Hash + ?Sized, S: BuildHasher>(hash_builder: &S, key: &K) -> u64 {
+    use core::hash::Hasher;
+    let mut state = hash_builder.build_hasher();
+    key.hash(&mut state);
+    state.finish()
+}
+
+let hash = compute_hash(map.hasher(), "a");
+assert_eq!(remove_by_hash(&mut map, hash, |(_, v)| *v == 10), Some(("a", 10)));
+assert_eq!(map.get(&"a"), None);
+assert_eq!(map.len(), 2);
+

Trait Implementations§

source§

impl<K: Clone, V: Clone, S: Clone, A: Allocator + Clone> Clone for HashMap<K, V, S, A>

source§

fn clone(&self) -> Self

Returns a copy of the value. Read more
source§

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

Performs copy-assignment from source. Read more
source§

impl<K, V, S, A> Debug for HashMap<K, V, S, A>
where + K: Debug, + V: Debug, + A: Allocator,

source§

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

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

impl<K, V, S, A> Default for HashMap<K, V, S, A>
where + S: Default, + A: Default + Allocator,

source§

fn default() -> Self

Creates an empty HashMap<K, V, S, A>, with the Default value for the hasher and allocator.

+
§Examples
+
use hashbrown::HashMap;
+use std::collections::hash_map::RandomState;
+
+// You can specify all types of HashMap, including hasher and allocator.
+// Created map is empty and don't allocate memory
+let map: HashMap<u32, String> = Default::default();
+assert_eq!(map.capacity(), 0);
+let map: HashMap<u32, String, RandomState> = HashMap::default();
+assert_eq!(map.capacity(), 0);
+
source§

impl<'a, K, V, S, A> Extend<&'a (K, V)> for HashMap<K, V, S, A>
where + K: Eq + Hash + Copy, + V: Copy, + S: BuildHasher, + A: Allocator,

Inserts all new key-values from the iterator and replaces values with existing +keys with new values returned from the iterator.

+
source§

fn extend<T: IntoIterator<Item = &'a (K, V)>>(&mut self, iter: T)

Inserts all new key-values from the iterator to existing HashMap<K, V, S, A>. +Replace values with existing keys with new values returned from the iterator. +The keys and values must implement Copy trait.

+
§Examples
+
use hashbrown::hash_map::HashMap;
+
+let mut map = HashMap::new();
+map.insert(1, 100);
+
+let arr = [(1, 1), (2, 2)];
+let some_iter = arr.iter();
+map.extend(some_iter);
+// Replace values with existing keys with new values returned from the iterator.
+// So that the map.get(&1) doesn't return Some(&100).
+assert_eq!(map.get(&1), Some(&1));
+
+let some_vec: Vec<_> = vec![(3, 3), (4, 4)];
+map.extend(&some_vec);
+
+let some_arr = [(5, 5), (6, 6)];
+map.extend(&some_arr);
+
+let mut vec: Vec<_> = map.into_iter().collect();
+// The `IntoIter` iterator produces items in arbitrary order, so the
+// items must be sorted to test them against a sorted array.
+vec.sort_unstable();
+assert_eq!(vec, [(1, 1), (2, 2), (3, 3), (4, 4), (5, 5), (6, 6)]);
+
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<'a, K, V, S, A> Extend<(&'a K, &'a V)> for HashMap<K, V, S, A>
where + K: Eq + Hash + Copy, + V: Copy, + S: BuildHasher, + A: Allocator,

Inserts all new key-values from the iterator and replaces values with existing +keys with new values returned from the iterator.

+
source§

fn extend<T: IntoIterator<Item = (&'a K, &'a V)>>(&mut self, iter: T)

Inserts all new key-values from the iterator to existing HashMap<K, V, S, A>. +Replace values with existing keys with new values returned from the iterator. +The keys and values must implement Copy trait.

+
§Examples
+
use hashbrown::hash_map::HashMap;
+
+let mut map = HashMap::new();
+map.insert(1, 100);
+
+let arr = [(1, 1), (2, 2)];
+let some_iter = arr.iter().map(|(k, v)| (k, v));
+map.extend(some_iter);
+// Replace values with existing keys with new values returned from the iterator.
+// So that the map.get(&1) doesn't return Some(&100).
+assert_eq!(map.get(&1), Some(&1));
+
+let some_vec: Vec<_> = vec![(3, 3), (4, 4)];
+map.extend(some_vec.iter().map(|(k, v)| (k, v)));
+
+let some_arr = [(5, 5), (6, 6)];
+map.extend(some_arr.iter().map(|(k, v)| (k, v)));
+
+// You can also extend from another HashMap
+let mut new_map = HashMap::new();
+new_map.extend(&map);
+assert_eq!(new_map, map);
+
+let mut vec: Vec<_> = new_map.into_iter().collect();
+// The `IntoIter` iterator produces items in arbitrary order, so the
+// items must be sorted to test them against a sorted array.
+vec.sort_unstable();
+assert_eq!(vec, [(1, 1), (2, 2), (3, 3), (4, 4), (5, 5), (6, 6)]);
+
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<K, V, S, A> Extend<(K, V)> for HashMap<K, V, S, A>
where + K: Eq + Hash, + S: BuildHasher, + A: Allocator,

Inserts all new key-values from the iterator and replaces values with existing +keys with new values returned from the iterator.

+
source§

fn extend<T: IntoIterator<Item = (K, V)>>(&mut self, iter: T)

Inserts all new key-values from the iterator to existing HashMap<K, V, S, A>. +Replace values with existing keys with new values returned from the iterator.

+
§Examples
+
use hashbrown::hash_map::HashMap;
+
+let mut map = HashMap::new();
+map.insert(1, 100);
+
+let some_iter = [(1, 1), (2, 2)].into_iter();
+map.extend(some_iter);
+// Replace values with existing keys with new values returned from the iterator.
+// So that the map.get(&1) doesn't return Some(&100).
+assert_eq!(map.get(&1), Some(&1));
+
+let some_vec: Vec<_> = vec![(3, 3), (4, 4)];
+map.extend(some_vec);
+
+let some_arr = [(5, 5), (6, 6)];
+map.extend(some_arr);
+let old_map_len = map.len();
+
+// You can also extend from another HashMap
+let mut new_map = HashMap::new();
+new_map.extend(map);
+assert_eq!(new_map.len(), old_map_len);
+
+let mut vec: Vec<_> = new_map.into_iter().collect();
+// The `IntoIter` iterator produces items in arbitrary order, so the
+// items must be sorted to test them against a sorted array.
+vec.sort_unstable();
+assert_eq!(vec, [(1, 1), (2, 2), (3, 3), (4, 4), (5, 5), (6, 6)]);
+
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<T, S, A> From<HashMap<T, (), S, A>> for HashSet<T, S, A>
where + A: Allocator,

source§

fn from(map: HashMap<T, (), S, A>) -> Self

Converts to this type from the input type.
source§

impl<K, V, S, A> FromIterator<(K, V)> for HashMap<K, V, S, A>
where + K: Eq + Hash, + S: BuildHasher + Default, + A: Default + Allocator,

source§

fn from_iter<T: IntoIterator<Item = (K, V)>>(iter: T) -> Self

Creates a value from an iterator. Read more
source§

impl<K, Q, V, S, A> Index<&Q> for HashMap<K, V, S, A>
where + K: Eq + Hash, + Q: Hash + Equivalent<K> + ?Sized, + S: BuildHasher, + A: Allocator,

source§

fn index(&self, key: &Q) -> &V

Returns a reference to the value corresponding to the supplied key.

+
§Panics
+

Panics if the key is not present in the HashMap.

+
§Examples
+
use hashbrown::HashMap;
+
+let map: HashMap<_, _> = [("a", "One"), ("b", "Two")].into();
+
+assert_eq!(map[&"a"], "One");
+assert_eq!(map[&"b"], "Two");
+
§

type Output = V

The returned type after indexing.
source§

impl<'a, K, V, S, A: Allocator> IntoIterator for &'a HashMap<K, V, S, A>

source§

fn into_iter(self) -> Iter<'a, K, V> ⓘ

Creates an iterator over the entries of a HashMap in arbitrary order. +The iterator element type is (&'a K, &'a V).

+

Return the same Iter struct as by the iter method on HashMap.

+
§Examples
+
use hashbrown::HashMap;
+let map_one: HashMap<_, _> = [(1, "a"), (2, "b"), (3, "c")].into();
+let mut map_two = HashMap::new();
+
+for (key, value) in &map_one {
+    println!("Key: {}, Value: {}", key, value);
+    map_two.insert_unique_unchecked(*key, *value);
+}
+
+assert_eq!(map_one, map_two);
+
§

type Item = (&'a K, &'a V)

The type of the elements being iterated over.
§

type IntoIter = Iter<'a, K, V>

Which kind of iterator are we turning this into?
source§

impl<'a, K, V, S, A: Allocator> IntoIterator for &'a mut HashMap<K, V, S, A>

source§

fn into_iter(self) -> IterMut<'a, K, V> ⓘ

Creates an iterator over the entries of a HashMap in arbitrary order +with mutable references to the values. The iterator element type is +(&'a K, &'a mut V).

+

Return the same IterMut struct as by the iter_mut method on +HashMap.

+
§Examples
+
use hashbrown::HashMap;
+let mut map: HashMap<_, _> = [("a", 1), ("b", 2), ("c", 3)].into();
+
+for (key, value) in &mut map {
+    println!("Key: {}, Value: {}", key, value);
+    *value *= 2;
+}
+
+let mut vec = map.iter().collect::<Vec<_>>();
+// The `Iter` iterator produces items in arbitrary order, so the
+// items must be sorted to test them against a sorted array.
+vec.sort_unstable();
+assert_eq!(vec, [(&"a", &2), (&"b", &4), (&"c", &6)]);
+
§

type Item = (&'a K, &'a mut V)

The type of the elements being iterated over.
§

type IntoIter = IterMut<'a, K, V>

Which kind of iterator are we turning this into?
source§

impl<K, V, S, A: Allocator> IntoIterator for HashMap<K, V, S, A>

source§

fn into_iter(self) -> IntoIter<K, V, A> ⓘ

Creates a consuming iterator, that is, one that moves each key-value +pair out of the map in arbitrary order. The map cannot be used after +calling this.

+
§Examples
+
use hashbrown::HashMap;
+
+let map: HashMap<_, _> = [("a", 1), ("b", 2), ("c", 3)].into();
+
+// Not possible with .iter()
+let mut vec: Vec<(&str, i32)> = map.into_iter().collect();
+// The `IntoIter` iterator produces items in arbitrary order, so
+// the items must be sorted to test them against a sorted array.
+vec.sort_unstable();
+assert_eq!(vec, [("a", 1), ("b", 2), ("c", 3)]);
+
§

type Item = (K, V)

The type of the elements being iterated over.
§

type IntoIter = IntoIter<K, V, A>

Which kind of iterator are we turning this into?
source§

impl<K, V, S, A> PartialEq for HashMap<K, V, S, A>
where + K: Eq + Hash, + V: PartialEq, + S: BuildHasher, + A: Allocator,

source§

fn eq(&self, other: &Self) -> 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<K, V, S, A> Eq for HashMap<K, V, S, A>
where + K: Eq + Hash, + V: Eq, + S: BuildHasher, + A: Allocator,

Auto Trait Implementations§

§

impl<K, V, S, A> Freeze for HashMap<K, V, S, A>
where + A: Freeze, + S: Freeze,

§

impl<K, V, S, A> RefUnwindSafe for HashMap<K, V, S, A>
where + A: RefUnwindSafe, + K: RefUnwindSafe, + S: RefUnwindSafe, + V: RefUnwindSafe,

§

impl<K, V, S, A> Send for HashMap<K, V, S, A>
where + A: Send, + K: Send, + S: Send, + V: Send,

§

impl<K, V, S, A> Sync for HashMap<K, V, S, A>
where + A: Sync, + K: Sync, + S: Sync, + V: Sync,

§

impl<K, V, S, A> Unpin for HashMap<K, V, S, A>
where + A: Unpin, + K: Unpin, + S: Unpin, + V: Unpin,

§

impl<K, V, S, A> UnwindSafe for HashMap<K, V, S, A>
where + A: UnwindSafe, + K: UnwindSafe, + S: UnwindSafe, + V: UnwindSafe,

Blanket Implementations§

source§

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

source§

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more
source§

impl<T> Borrow<T> for T
where + T: ?Sized,

source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
source§

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

source§

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

Mutably borrows from an owned value. Read more
source§

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

source§

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

Checks if this value is equivalent to the given key. 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 T
where + 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 T
where + 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 T
where + 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 T
where + 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/hashbrown/hash_map/struct.IntoIter.html b/hashbrown/hash_map/struct.IntoIter.html new file mode 100644 index 0000000000..35098e34cc --- /dev/null +++ b/hashbrown/hash_map/struct.IntoIter.html @@ -0,0 +1,227 @@ +IntoIter in hashbrown::hash_map - Rust
+

Struct hashbrown::hash_map::IntoIter

source · 
pub struct IntoIter<K, V, A: Allocator = Global> { /* private fields */ }
Expand description

An owning iterator over the entries of a HashMap in arbitrary order. +The iterator element type is (K, V).

+

This struct is created by the into_iter method on HashMap +(provided by the IntoIterator trait). See its documentation for more. +The map cannot be used after calling that method.

+

§Examples

+
use hashbrown::HashMap;
+
+let map: HashMap<_, _> = [(1, "a"), (2, "b"), (3, "c")].into();
+
+let mut iter = map.into_iter();
+let mut vec = vec![iter.next(), iter.next(), iter.next()];
+
+// The `IntoIter` iterator produces items in arbitrary order, so the
+// items must be sorted to test them against a sorted array.
+vec.sort_unstable();
+assert_eq!(vec, [Some((1, "a")), Some((2, "b")), Some((3, "c"))]);
+
+// It is fused iterator
+assert_eq!(iter.next(), None);
+assert_eq!(iter.next(), None);
+

Trait Implementations§

source§

impl<K: Debug, V: Debug, A: Allocator> Debug for IntoIter<K, V, A>

source§

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

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

impl<K, V, A: Allocator> ExactSizeIterator for IntoIter<K, V, A>

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<K, V, A: Allocator> Iterator for IntoIter<K, V, A>

§

type Item = (K, V)

The type of the elements being iterated over.
source§

fn next(&mut self) -> Option<(K, V)>

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 fold<B, F>(self, init: B, f: F) -> B
where + Self: Sized, + F: FnMut(B, Self::Item) -> B,

Folds every element into an accumulator by applying an operation, +returning the final result. 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) -> usize
where + 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<(), NonZero<usize>>

🔬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 Self
where + Self: Sized,

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

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

Transforms an iterator into a collection. Read more
source§

fn collect_into<E>(self, collection: &mut E) -> &mut E
where + 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) -> bool
where + 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) -> R
where + 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) -> R
where + 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.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>>>::TryType
where + 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) -> bool
where + 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) -> bool
where + 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>>>::TryType
where + 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) -> S
where + Self: Sized, + S: Sum<Self::Item>,

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

fn product<P>(self) -> P
where + 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) -> Ordering
where + 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) -> bool
where + 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) -> bool
where + 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) -> bool
where + 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) -> bool
where + 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) -> bool
where + 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) -> bool
where + 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) -> bool
where + 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) -> bool
where + Self: Sized, + F: FnMut(&Self::Item, &Self::Item) -> bool,

🔬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) -> bool
where + 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<K, V, A: Allocator> FusedIterator for IntoIter<K, V, A>

Auto Trait Implementations§

§

impl<K, V, A> Freeze for IntoIter<K, V, A>
where + A: Freeze,

§

impl<K, V, A> RefUnwindSafe for IntoIter<K, V, A>
where + A: RefUnwindSafe, + K: RefUnwindSafe, + V: RefUnwindSafe,

§

impl<K, V, A> Send for IntoIter<K, V, A>
where + A: Send, + K: Send, + V: Send,

§

impl<K, V, A> Sync for IntoIter<K, V, A>
where + A: Sync, + K: Sync, + V: Sync,

§

impl<K, V, A> Unpin for IntoIter<K, V, A>
where + A: Unpin, + K: Unpin, + V: Unpin,

§

impl<K, V, A> UnwindSafe for IntoIter<K, V, A>
where + A: UnwindSafe, + K: UnwindSafe + RefUnwindSafe, + V: UnwindSafe + RefUnwindSafe,

Blanket Implementations§

source§

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

source§

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more
source§

impl<T> Borrow<T> for T
where + T: ?Sized,

source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
source§

impl<T> BorrowMut<T> for T
where + 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 T
where + 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 I
where + 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, U> TryFrom<U> for T
where + 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 T
where + 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/hashbrown/hash_map/struct.IntoKeys.html b/hashbrown/hash_map/struct.IntoKeys.html new file mode 100644 index 0000000000..4f2df236ed --- /dev/null +++ b/hashbrown/hash_map/struct.IntoKeys.html @@ -0,0 +1,227 @@ +IntoKeys in hashbrown::hash_map - Rust
+

Struct hashbrown::hash_map::IntoKeys

source · 
pub struct IntoKeys<K, V, A: Allocator = Global> { /* private fields */ }
Expand description

An owning iterator over the keys of a HashMap in arbitrary order. +The iterator element type is K.

+

This struct is created by the into_keys method on HashMap. +See its documentation for more. +The map cannot be used after calling that method.

+

§Examples

+
use hashbrown::HashMap;
+
+let map: HashMap<_, _> = [(1, "a"), (2, "b"), (3, "c")].into();
+
+let mut keys = map.into_keys();
+let mut vec = vec![keys.next(), keys.next(), keys.next()];
+
+// The `IntoKeys` iterator produces keys in arbitrary order, so the
+// keys must be sorted to test them against a sorted array.
+vec.sort_unstable();
+assert_eq!(vec, [Some(1), Some(2), Some(3)]);
+
+// It is fused iterator
+assert_eq!(keys.next(), None);
+assert_eq!(keys.next(), None);
+

Trait Implementations§

source§

impl<K: Debug, V: Debug, A: Allocator> Debug for IntoKeys<K, V, A>

source§

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

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

impl<K, V, A: Allocator> ExactSizeIterator for IntoKeys<K, V, A>

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<K, V, A: Allocator> Iterator for IntoKeys<K, V, A>

§

type Item = K

The type of the elements being iterated over.
source§

fn next(&mut self) -> Option<K>

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 fold<B, F>(self, init: B, f: F) -> B
where + Self: Sized, + F: FnMut(B, Self::Item) -> B,

Folds every element into an accumulator by applying an operation, +returning the final result. 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) -> usize
where + 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<(), NonZero<usize>>

🔬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 Self
where + Self: Sized,

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

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

Transforms an iterator into a collection. Read more
source§

fn collect_into<E>(self, collection: &mut E) -> &mut E
where + 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) -> bool
where + 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) -> R
where + 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) -> R
where + 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.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>>>::TryType
where + 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) -> bool
where + 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) -> bool
where + 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>>>::TryType
where + 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) -> S
where + Self: Sized, + S: Sum<Self::Item>,

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

fn product<P>(self) -> P
where + 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) -> Ordering
where + 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) -> bool
where + 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) -> bool
where + 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) -> bool
where + 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) -> bool
where + 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) -> bool
where + 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) -> bool
where + 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) -> bool
where + 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) -> bool
where + Self: Sized, + F: FnMut(&Self::Item, &Self::Item) -> bool,

🔬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) -> bool
where + 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<K, V, A: Allocator> FusedIterator for IntoKeys<K, V, A>

Auto Trait Implementations§

§

impl<K, V, A> Freeze for IntoKeys<K, V, A>
where + A: Freeze,

§

impl<K, V, A> RefUnwindSafe for IntoKeys<K, V, A>
where + A: RefUnwindSafe, + K: RefUnwindSafe, + V: RefUnwindSafe,

§

impl<K, V, A> Send for IntoKeys<K, V, A>
where + A: Send, + K: Send, + V: Send,

§

impl<K, V, A> Sync for IntoKeys<K, V, A>
where + A: Sync, + K: Sync, + V: Sync,

§

impl<K, V, A> Unpin for IntoKeys<K, V, A>
where + A: Unpin, + K: Unpin, + V: Unpin,

§

impl<K, V, A> UnwindSafe for IntoKeys<K, V, A>
where + A: UnwindSafe, + K: UnwindSafe + RefUnwindSafe, + V: UnwindSafe + RefUnwindSafe,

Blanket Implementations§

source§

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

source§

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more
source§

impl<T> Borrow<T> for T
where + T: ?Sized,

source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
source§

impl<T> BorrowMut<T> for T
where + 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 T
where + 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 I
where + 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, U> TryFrom<U> for T
where + 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 T
where + 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/hashbrown/hash_map/struct.IntoValues.html b/hashbrown/hash_map/struct.IntoValues.html new file mode 100644 index 0000000000..a63fe392c9 --- /dev/null +++ b/hashbrown/hash_map/struct.IntoValues.html @@ -0,0 +1,226 @@ +IntoValues in hashbrown::hash_map - Rust
+

Struct hashbrown::hash_map::IntoValues

source · 
pub struct IntoValues<K, V, A: Allocator = Global> { /* private fields */ }
Expand description

An owning iterator over the values of a HashMap in arbitrary order. +The iterator element type is V.

+

This struct is created by the into_values method on HashMap. +See its documentation for more. The map cannot be used after calling that method.

+

§Examples

+
use hashbrown::HashMap;
+
+let map: HashMap<_, _> = [(1, "a"), (2, "b"), (3, "c")].into();
+
+let mut values = map.into_values();
+let mut vec = vec![values.next(), values.next(), values.next()];
+
+// The `IntoValues` iterator produces values in arbitrary order, so
+// the values must be sorted to test them against a sorted array.
+vec.sort_unstable();
+assert_eq!(vec, [Some("a"), Some("b"), Some("c")]);
+
+// It is fused iterator
+assert_eq!(values.next(), None);
+assert_eq!(values.next(), None);
+

Trait Implementations§

source§

impl<K, V: Debug, A: Allocator> Debug for IntoValues<K, V, A>

source§

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

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

impl<K, V, A: Allocator> ExactSizeIterator for IntoValues<K, V, A>

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<K, V, A: Allocator> Iterator for IntoValues<K, V, A>

§

type Item = V

The type of the elements being iterated over.
source§

fn next(&mut self) -> Option<V>

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 fold<B, F>(self, init: B, f: F) -> B
where + Self: Sized, + F: FnMut(B, Self::Item) -> B,

Folds every element into an accumulator by applying an operation, +returning the final result. 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) -> usize
where + 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<(), NonZero<usize>>

🔬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 Self
where + Self: Sized,

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

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

Transforms an iterator into a collection. Read more
source§

fn collect_into<E>(self, collection: &mut E) -> &mut E
where + 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) -> bool
where + 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) -> R
where + 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) -> R
where + 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.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>>>::TryType
where + 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) -> bool
where + 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) -> bool
where + 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>>>::TryType
where + 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) -> S
where + Self: Sized, + S: Sum<Self::Item>,

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

fn product<P>(self) -> P
where + 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) -> Ordering
where + 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) -> bool
where + 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) -> bool
where + 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) -> bool
where + 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) -> bool
where + 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) -> bool
where + 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) -> bool
where + 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) -> bool
where + 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) -> bool
where + Self: Sized, + F: FnMut(&Self::Item, &Self::Item) -> bool,

🔬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) -> bool
where + 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<K, V, A: Allocator> FusedIterator for IntoValues<K, V, A>

Auto Trait Implementations§

§

impl<K, V, A> Freeze for IntoValues<K, V, A>
where + A: Freeze,

§

impl<K, V, A> RefUnwindSafe for IntoValues<K, V, A>
where + A: RefUnwindSafe, + K: RefUnwindSafe, + V: RefUnwindSafe,

§

impl<K, V, A> Send for IntoValues<K, V, A>
where + A: Send, + K: Send, + V: Send,

§

impl<K, V, A> Sync for IntoValues<K, V, A>
where + A: Sync, + K: Sync, + V: Sync,

§

impl<K, V, A> Unpin for IntoValues<K, V, A>
where + A: Unpin, + K: Unpin, + V: Unpin,

§

impl<K, V, A> UnwindSafe for IntoValues<K, V, A>
where + A: UnwindSafe, + K: UnwindSafe + RefUnwindSafe, + V: UnwindSafe + RefUnwindSafe,

Blanket Implementations§

source§

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

source§

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more
source§

impl<T> Borrow<T> for T
where + T: ?Sized,

source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
source§

impl<T> BorrowMut<T> for T
where + 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 T
where + 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 I
where + 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, U> TryFrom<U> for T
where + 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 T
where + 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/hashbrown/hash_map/struct.Iter.html b/hashbrown/hash_map/struct.Iter.html new file mode 100644 index 0000000000..00f80a97ea --- /dev/null +++ b/hashbrown/hash_map/struct.Iter.html @@ -0,0 +1,220 @@ +Iter in hashbrown::hash_map - Rust
+

Struct hashbrown::hash_map::Iter

source · 
pub struct Iter<'a, K, V> { /* private fields */ }
Expand description

An iterator over the entries of a HashMap in arbitrary order. +The iterator element type is (&'a K, &'a V).

+

This struct is created by the iter method on HashMap. See its +documentation for more.

+

§Examples

+
use hashbrown::HashMap;
+
+let map: HashMap<_, _> = [(1, "a"), (2, "b"), (3, "c")].into();
+
+let mut iter = map.iter();
+let mut vec = vec![iter.next(), iter.next(), iter.next()];
+
+// The `Iter` iterator produces items in arbitrary order, so the
+// items must be sorted to test them against a sorted array.
+vec.sort_unstable();
+assert_eq!(vec, [Some((&1, &"a")), Some((&2, &"b")), Some((&3, &"c"))]);
+
+// It is fused iterator
+assert_eq!(iter.next(), None);
+assert_eq!(iter.next(), None);
+

Trait Implementations§

source§

impl<K, V> Clone for Iter<'_, K, V>

source§

fn clone(&self) -> Self

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<K: Debug, V: Debug> Debug for Iter<'_, K, V>

source§

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

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

impl<K, V> ExactSizeIterator for Iter<'_, K, V>

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, K, V> Iterator for Iter<'a, K, V>

§

type Item = (&'a K, &'a V)

The type of the elements being iterated over.
source§

fn next(&mut self) -> Option<(&'a K, &'a V)>

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 fold<B, F>(self, init: B, f: F) -> B
where + Self: Sized, + F: FnMut(B, Self::Item) -> B,

Folds every element into an accumulator by applying an operation, +returning the final result. 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) -> usize
where + 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<(), NonZero<usize>>

🔬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 Self
where + Self: Sized,

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

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

Transforms an iterator into a collection. Read more
source§

fn collect_into<E>(self, collection: &mut E) -> &mut E
where + 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) -> bool
where + 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) -> R
where + 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) -> R
where + 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.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>>>::TryType
where + 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) -> bool
where + 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) -> bool
where + 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>>>::TryType
where + 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
1.0.0 · source§

fn cycle(self) -> Cycle<Self>
where + Self: Sized + Clone,

Repeats an iterator endlessly. 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) -> S
where + Self: Sized, + S: Sum<Self::Item>,

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

fn product<P>(self) -> P
where + 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) -> Ordering
where + 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) -> bool
where + 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) -> bool
where + 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) -> bool
where + 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) -> bool
where + 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) -> bool
where + 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) -> bool
where + 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) -> bool
where + 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) -> bool
where + Self: Sized, + F: FnMut(&Self::Item, &Self::Item) -> bool,

🔬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) -> bool
where + 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<K, V> FusedIterator for Iter<'_, K, V>

Auto Trait Implementations§

§

impl<'a, K, V> Freeze for Iter<'a, K, V>

§

impl<'a, K, V> RefUnwindSafe for Iter<'a, K, V>
where + K: RefUnwindSafe, + V: RefUnwindSafe,

§

impl<'a, K, V> Send for Iter<'a, K, V>
where + K: Sync, + V: Sync,

§

impl<'a, K, V> Sync for Iter<'a, K, V>
where + K: Sync, + V: Sync,

§

impl<'a, K, V> Unpin for Iter<'a, K, V>

§

impl<'a, K, V> UnwindSafe for Iter<'a, K, V>
where + K: RefUnwindSafe, + V: RefUnwindSafe,

Blanket Implementations§

source§

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

source§

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more
source§

impl<T> Borrow<T> for T
where + T: ?Sized,

source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
source§

impl<T> BorrowMut<T> for T
where + 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 T
where + 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 I
where + 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> ToOwned for T
where + 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 T
where + 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 T
where + 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/hashbrown/hash_map/struct.IterMut.html b/hashbrown/hash_map/struct.IterMut.html new file mode 100644 index 0000000000..fe99b8c6c3 --- /dev/null +++ b/hashbrown/hash_map/struct.IterMut.html @@ -0,0 +1,215 @@ +IterMut in hashbrown::hash_map - Rust
+

Struct hashbrown::hash_map::IterMut

source · 
pub struct IterMut<'a, K, V> { /* private fields */ }
Expand description

A mutable iterator over the entries of a HashMap in arbitrary order. +The iterator element type is (&'a K, &'a mut V).

+

This struct is created by the iter_mut method on HashMap. See its +documentation for more.

+

§Examples

+
use hashbrown::HashMap;
+
+let mut map: HashMap<_, _> = [(1, "One".to_owned()), (2, "Two".into())].into();
+
+let mut iter = map.iter_mut();
+iter.next().map(|(_, v)| v.push_str(" Mississippi"));
+iter.next().map(|(_, v)| v.push_str(" Mississippi"));
+
+// It is fused iterator
+assert_eq!(iter.next(), None);
+assert_eq!(iter.next(), None);
+
+assert_eq!(map.get(&1).unwrap(), &"One Mississippi".to_owned());
+assert_eq!(map.get(&2).unwrap(), &"Two Mississippi".to_owned());
+

Trait Implementations§

source§

impl<K, V> Debug for IterMut<'_, K, V>
where + K: Debug, + V: Debug,

source§

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

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

impl<K, V> ExactSizeIterator for IterMut<'_, K, V>

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, K, V> Iterator for IterMut<'a, K, V>

§

type Item = (&'a K, &'a mut V)

The type of the elements being iterated over.
source§

fn next(&mut self) -> Option<(&'a K, &'a mut V)>

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 fold<B, F>(self, init: B, f: F) -> B
where + Self: Sized, + F: FnMut(B, Self::Item) -> B,

Folds every element into an accumulator by applying an operation, +returning the final result. 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) -> usize
where + 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<(), NonZero<usize>>

🔬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 Self
where + Self: Sized,

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

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

Transforms an iterator into a collection. Read more
source§

fn collect_into<E>(self, collection: &mut E) -> &mut E
where + 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) -> bool
where + 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) -> R
where + 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) -> R
where + 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.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>>>::TryType
where + 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) -> bool
where + 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) -> bool
where + 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>>>::TryType
where + 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) -> S
where + Self: Sized, + S: Sum<Self::Item>,

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

fn product<P>(self) -> P
where + 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) -> Ordering
where + 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) -> bool
where + 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) -> bool
where + 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) -> bool
where + 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) -> bool
where + 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) -> bool
where + 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) -> bool
where + 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) -> bool
where + 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) -> bool
where + Self: Sized, + F: FnMut(&Self::Item, &Self::Item) -> bool,

🔬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) -> bool
where + 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<K, V> FusedIterator for IterMut<'_, K, V>

source§

impl<K: Send, V: Send> Send for IterMut<'_, K, V>

Auto Trait Implementations§

§

impl<'a, K, V> Freeze for IterMut<'a, K, V>

§

impl<'a, K, V> RefUnwindSafe for IterMut<'a, K, V>
where + K: RefUnwindSafe, + V: RefUnwindSafe,

§

impl<'a, K, V> Sync for IterMut<'a, K, V>
where + K: Sync, + V: Sync,

§

impl<'a, K, V> Unpin for IterMut<'a, K, V>

§

impl<'a, K, V> !UnwindSafe for IterMut<'a, K, V>

Blanket Implementations§

source§

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

source§

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more
source§

impl<T> Borrow<T> for T
where + T: ?Sized,

source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
source§

impl<T> BorrowMut<T> for T
where + 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 T
where + 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 I
where + 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, U> TryFrom<U> for T
where + 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 T
where + 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/hashbrown/hash_map/struct.Keys.html b/hashbrown/hash_map/struct.Keys.html new file mode 100644 index 0000000000..93c5c8a5ce --- /dev/null +++ b/hashbrown/hash_map/struct.Keys.html @@ -0,0 +1,220 @@ +Keys in hashbrown::hash_map - Rust
+

Struct hashbrown::hash_map::Keys

source · 
pub struct Keys<'a, K, V> { /* private fields */ }
Expand description

An iterator over the keys of a HashMap in arbitrary order. +The iterator element type is &'a K.

+

This struct is created by the keys method on HashMap. See its +documentation for more.

+

§Examples

+
use hashbrown::HashMap;
+
+let map: HashMap<_, _> = [(1, "a"), (2, "b"), (3, "c")].into();
+
+let mut keys = map.keys();
+let mut vec = vec![keys.next(), keys.next(), keys.next()];
+
+// The `Keys` iterator produces keys in arbitrary order, so the
+// keys must be sorted to test them against a sorted array.
+vec.sort_unstable();
+assert_eq!(vec, [Some(&1), Some(&2), Some(&3)]);
+
+// It is fused iterator
+assert_eq!(keys.next(), None);
+assert_eq!(keys.next(), None);
+

Trait Implementations§

source§

impl<K, V> Clone for Keys<'_, K, V>

source§

fn clone(&self) -> Self

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<K: Debug, V> Debug for Keys<'_, K, V>

source§

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

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

impl<K, V> ExactSizeIterator for Keys<'_, K, V>

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, K, V> Iterator for Keys<'a, K, V>

§

type Item = &'a K

The type of the elements being iterated over.
source§

fn next(&mut self) -> Option<&'a K>

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 fold<B, F>(self, init: B, f: F) -> B
where + Self: Sized, + F: FnMut(B, Self::Item) -> B,

Folds every element into an accumulator by applying an operation, +returning the final result. 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) -> usize
where + 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<(), NonZero<usize>>

🔬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 Self
where + Self: Sized,

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

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

Transforms an iterator into a collection. Read more
source§

fn collect_into<E>(self, collection: &mut E) -> &mut E
where + 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) -> bool
where + 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) -> R
where + 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) -> R
where + 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.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>>>::TryType
where + 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) -> bool
where + 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) -> bool
where + 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>>>::TryType
where + 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
1.0.0 · source§

fn cycle(self) -> Cycle<Self>
where + Self: Sized + Clone,

Repeats an iterator endlessly. 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) -> S
where + Self: Sized, + S: Sum<Self::Item>,

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

fn product<P>(self) -> P
where + 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) -> Ordering
where + 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) -> bool
where + 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) -> bool
where + 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) -> bool
where + 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) -> bool
where + 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) -> bool
where + 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) -> bool
where + 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) -> bool
where + 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) -> bool
where + Self: Sized, + F: FnMut(&Self::Item, &Self::Item) -> bool,

🔬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) -> bool
where + 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<K, V> FusedIterator for Keys<'_, K, V>

Auto Trait Implementations§

§

impl<'a, K, V> Freeze for Keys<'a, K, V>

§

impl<'a, K, V> RefUnwindSafe for Keys<'a, K, V>
where + K: RefUnwindSafe, + V: RefUnwindSafe,

§

impl<'a, K, V> Send for Keys<'a, K, V>
where + K: Sync, + V: Sync,

§

impl<'a, K, V> Sync for Keys<'a, K, V>
where + K: Sync, + V: Sync,

§

impl<'a, K, V> Unpin for Keys<'a, K, V>

§

impl<'a, K, V> UnwindSafe for Keys<'a, K, V>
where + K: RefUnwindSafe, + V: RefUnwindSafe,

Blanket Implementations§

source§

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

source§

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more
source§

impl<T> Borrow<T> for T
where + T: ?Sized,

source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
source§

impl<T> BorrowMut<T> for T
where + 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 T
where + 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 I
where + 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> ToOwned for T
where + 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 T
where + 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 T
where + 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/hashbrown/hash_map/struct.OccupiedEntry.html b/hashbrown/hash_map/struct.OccupiedEntry.html new file mode 100644 index 0000000000..b1f307563d --- /dev/null +++ b/hashbrown/hash_map/struct.OccupiedEntry.html @@ -0,0 +1,282 @@ +OccupiedEntry in hashbrown::hash_map - Rust
+

Struct hashbrown::hash_map::OccupiedEntry

source · 
pub struct OccupiedEntry<'a, K, V, S = DefaultHashBuilder, A: Allocator = Global> { /* private fields */ }
Expand description

A view into an occupied entry in a HashMap. +It is part of the Entry enum.

+

§Examples

+
use hashbrown::hash_map::{Entry, HashMap, OccupiedEntry};
+
+let mut map = HashMap::new();
+map.extend([("a", 10), ("b", 20), ("c", 30)]);
+
+let _entry_o: OccupiedEntry<_, _, _> = map.entry("a").insert(100);
+assert_eq!(map.len(), 3);
+
+// Existing key (insert and update)
+match map.entry("a") {
+    Entry::Vacant(_) => unreachable!(),
+    Entry::Occupied(mut view) => {
+        assert_eq!(view.get(), &100);
+        let v = view.get_mut();
+        *v *= 10;
+        assert_eq!(view.insert(1111), 1000);
+    }
+}
+
+assert_eq!(map[&"a"], 1111);
+assert_eq!(map.len(), 3);
+
+// Existing key (take)
+match map.entry("c") {
+    Entry::Vacant(_) => unreachable!(),
+    Entry::Occupied(view) => {
+        assert_eq!(view.remove_entry(), ("c", 30));
+    }
+}
+assert_eq!(map.get(&"c"), None);
+assert_eq!(map.len(), 2);
+

Implementations§

source§

impl<'a, K, V, S, A: Allocator> OccupiedEntry<'a, K, V, S, A>

source

pub fn key(&self) -> &K

Gets a reference to the key in the entry.

+
§Examples
+
use hashbrown::hash_map::{Entry, HashMap};
+
+let mut map: HashMap<&str, u32> = HashMap::new();
+map.entry("poneyland").or_insert(12);
+
+match map.entry("poneyland") {
+    Entry::Vacant(_) => panic!(),
+    Entry::Occupied(entry) => assert_eq!(entry.key(), &"poneyland"),
+}
+
source

pub fn remove_entry(self) -> (K, V)

Take the ownership of the key and value from the map. +Keeps the allocated memory for reuse.

+
§Examples
+
use hashbrown::HashMap;
+use hashbrown::hash_map::Entry;
+
+let mut map: HashMap<&str, u32> = HashMap::new();
+// The map is empty
+assert!(map.is_empty() && map.capacity() == 0);
+
+map.entry("poneyland").or_insert(12);
+
+if let Entry::Occupied(o) = map.entry("poneyland") {
+    // We delete the entry from the map.
+    assert_eq!(o.remove_entry(), ("poneyland", 12));
+}
+
+assert_eq!(map.contains_key("poneyland"), false);
+// Now map hold none elements
+assert!(map.is_empty());
+
source

pub fn get(&self) -> &V

Gets a reference to the value in the entry.

+
§Examples
+
use hashbrown::HashMap;
+use hashbrown::hash_map::Entry;
+
+let mut map: HashMap<&str, u32> = HashMap::new();
+map.entry("poneyland").or_insert(12);
+
+match map.entry("poneyland") {
+    Entry::Vacant(_) => panic!(),
+    Entry::Occupied(entry) => assert_eq!(entry.get(), &12),
+}
+
source

pub fn get_mut(&mut self) -> &mut V

Gets a mutable reference to the value in the entry.

+

If you need a reference to the OccupiedEntry which may outlive the +destruction of the Entry value, see into_mut.

+
§Examples
+
use hashbrown::HashMap;
+use hashbrown::hash_map::Entry;
+
+let mut map: HashMap<&str, u32> = HashMap::new();
+map.entry("poneyland").or_insert(12);
+
+assert_eq!(map["poneyland"], 12);
+if let Entry::Occupied(mut o) = map.entry("poneyland") {
+    *o.get_mut() += 10;
+    assert_eq!(*o.get(), 22);
+
+    // We can use the same Entry multiple times.
+    *o.get_mut() += 2;
+}
+
+assert_eq!(map["poneyland"], 24);
+
source

pub fn into_mut(self) -> &'a mut V

Converts the OccupiedEntry into a mutable reference to the value in the entry +with a lifetime bound to the map itself.

+

If you need multiple references to the OccupiedEntry, see get_mut.

+
§Examples
+
use hashbrown::hash_map::{Entry, HashMap};
+
+let mut map: HashMap<&str, u32> = HashMap::new();
+map.entry("poneyland").or_insert(12);
+
+assert_eq!(map["poneyland"], 12);
+
+let value: &mut u32;
+match map.entry("poneyland") {
+    Entry::Occupied(entry) => value = entry.into_mut(),
+    Entry::Vacant(_) => panic!(),
+}
+*value += 10;
+
+assert_eq!(map["poneyland"], 22);
+
source

pub fn insert(&mut self, value: V) -> V

Sets the value of the entry, and returns the entry’s old value.

+
§Examples
+
use hashbrown::HashMap;
+use hashbrown::hash_map::Entry;
+
+let mut map: HashMap<&str, u32> = HashMap::new();
+map.entry("poneyland").or_insert(12);
+
+if let Entry::Occupied(mut o) = map.entry("poneyland") {
+    assert_eq!(o.insert(15), 12);
+}
+
+assert_eq!(map["poneyland"], 15);
+
source

pub fn remove(self) -> V

Takes the value out of the entry, and returns it. +Keeps the allocated memory for reuse.

+
§Examples
+
use hashbrown::HashMap;
+use hashbrown::hash_map::Entry;
+
+let mut map: HashMap<&str, u32> = HashMap::new();
+// The map is empty
+assert!(map.is_empty() && map.capacity() == 0);
+
+map.entry("poneyland").or_insert(12);
+
+if let Entry::Occupied(o) = map.entry("poneyland") {
+    assert_eq!(o.remove(), 12);
+}
+
+assert_eq!(map.contains_key("poneyland"), false);
+// Now map hold none elements
+assert!(map.is_empty());
+
source

pub fn replace_entry(self, value: V) -> (K, V)

Replaces the entry, returning the old key and value. The new key in the hash map will be +the key used to create this entry.

+
§Panics
+

Will panic if this OccupiedEntry was created through Entry::insert.

+
§Examples
+
 use hashbrown::hash_map::{Entry, HashMap};
+ use std::rc::Rc;
+
+ let mut map: HashMap<Rc<String>, u32> = HashMap::new();
+ let key_one = Rc::new("Stringthing".to_string());
+ let key_two = Rc::new("Stringthing".to_string());
+
+ map.insert(key_one.clone(), 15);
+ assert!(Rc::strong_count(&key_one) == 2 && Rc::strong_count(&key_two) == 1);
+
+ match map.entry(key_two.clone()) {
+     Entry::Occupied(entry) => {
+         let (old_key, old_value): (Rc<String>, u32) = entry.replace_entry(16);
+         assert!(Rc::ptr_eq(&key_one, &old_key) && old_value == 15);
+     }
+     Entry::Vacant(_) => panic!(),
+ }
+
+ assert!(Rc::strong_count(&key_one) == 1 && Rc::strong_count(&key_two) == 2);
+ assert_eq!(map[&"Stringthing".to_owned()], 16);
+
source

pub fn replace_key(self) -> K

Replaces the key in the hash map with the key used to create this entry.

+
§Panics
+

Will panic if this OccupiedEntry was created through Entry::insert.

+
§Examples
+
use hashbrown::hash_map::{Entry, HashMap};
+use std::rc::Rc;
+
+let mut map: HashMap<Rc<String>, usize> = HashMap::with_capacity(6);
+let mut keys_one: Vec<Rc<String>> = Vec::with_capacity(6);
+let mut keys_two: Vec<Rc<String>> = Vec::with_capacity(6);
+
+for (value, key) in ["a", "b", "c", "d", "e", "f"].into_iter().enumerate() {
+    let rc_key = Rc::new(key.to_owned());
+    keys_one.push(rc_key.clone());
+    map.insert(rc_key.clone(), value);
+    keys_two.push(Rc::new(key.to_owned()));
+}
+
+assert!(
+    keys_one.iter().all(|key| Rc::strong_count(key) == 2)
+        && keys_two.iter().all(|key| Rc::strong_count(key) == 1)
+);
+
+reclaim_memory(&mut map, &keys_two);
+
+assert!(
+    keys_one.iter().all(|key| Rc::strong_count(key) == 1)
+        && keys_two.iter().all(|key| Rc::strong_count(key) == 2)
+);
+
+fn reclaim_memory(map: &mut HashMap<Rc<String>, usize>, keys: &[Rc<String>]) {
+    for key in keys {
+        if let Entry::Occupied(entry) = map.entry(key.clone()) {
+        // Replaces the entry's key with our version of it in `keys`.
+            entry.replace_key();
+        }
+    }
+}
+
source

pub fn replace_entry_with<F>(self, f: F) -> Entry<'a, K, V, S, A>
where + F: FnOnce(&K, V) -> Option<V>,

Provides shared access to the key and owned access to the value of +the entry and allows to replace or remove it based on the +value of the returned option.

+
§Examples
+
use hashbrown::HashMap;
+use hashbrown::hash_map::Entry;
+
+let mut map: HashMap<&str, u32> = HashMap::new();
+map.insert("poneyland", 42);
+
+let entry = match map.entry("poneyland") {
+    Entry::Occupied(e) => {
+        e.replace_entry_with(|k, v| {
+            assert_eq!(k, &"poneyland");
+            assert_eq!(v, 42);
+            Some(v + 1)
+        })
+    }
+    Entry::Vacant(_) => panic!(),
+};
+
+match entry {
+    Entry::Occupied(e) => {
+        assert_eq!(e.key(), &"poneyland");
+        assert_eq!(e.get(), &43);
+    }
+    Entry::Vacant(_) => panic!(),
+}
+
+assert_eq!(map["poneyland"], 43);
+
+let entry = match map.entry("poneyland") {
+    Entry::Occupied(e) => e.replace_entry_with(|_k, _v| None),
+    Entry::Vacant(_) => panic!(),
+};
+
+match entry {
+    Entry::Vacant(e) => {
+        assert_eq!(e.key(), &"poneyland");
+    }
+    Entry::Occupied(_) => panic!(),
+}
+
+assert!(!map.contains_key("poneyland"));
+

Trait Implementations§

source§

impl<K: Debug, V: Debug, S, A: Allocator> Debug for OccupiedEntry<'_, K, V, S, A>

source§

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

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

impl<K, V, S, A> Send for OccupiedEntry<'_, K, V, S, A>
where + K: Send, + V: Send, + S: Send, + A: Send + Allocator,

source§

impl<K, V, S, A> Sync for OccupiedEntry<'_, K, V, S, A>
where + K: Sync, + V: Sync, + S: Sync, + A: Sync + Allocator,

Auto Trait Implementations§

§

impl<'a, K, V, S, A> Freeze for OccupiedEntry<'a, K, V, S, A>
where + K: Freeze,

§

impl<'a, K, V, S, A> RefUnwindSafe for OccupiedEntry<'a, K, V, S, A>
where + A: RefUnwindSafe, + K: RefUnwindSafe, + S: RefUnwindSafe, + V: RefUnwindSafe,

§

impl<'a, K, V, S, A> Unpin for OccupiedEntry<'a, K, V, S, A>
where + K: Unpin,

§

impl<'a, K, V, S = DefaultHashBuilder, A = Global> !UnwindSafe for OccupiedEntry<'a, K, V, S, A>

Blanket Implementations§

source§

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

source§

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more
source§

impl<T> Borrow<T> for T
where + T: ?Sized,

source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
source§

impl<T> BorrowMut<T> for T
where + 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 T
where + 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 T
where + 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 T
where + 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/hashbrown/hash_map/struct.OccupiedEntryRef.html b/hashbrown/hash_map/struct.OccupiedEntryRef.html new file mode 100644 index 0000000000..4bc8348385 --- /dev/null +++ b/hashbrown/hash_map/struct.OccupiedEntryRef.html @@ -0,0 +1,279 @@ +OccupiedEntryRef in hashbrown::hash_map - Rust
+

Struct hashbrown::hash_map::OccupiedEntryRef

source · 
pub struct OccupiedEntryRef<'a, 'b, K, Q: ?Sized, V, S, A: Allocator = Global> { /* private fields */ }
Expand description

A view into an occupied entry in a HashMap. +It is part of the EntryRef enum.

+

§Examples

+
use hashbrown::hash_map::{EntryRef, HashMap, OccupiedEntryRef};
+
+let mut map = HashMap::new();
+map.extend([("a".to_owned(), 10), ("b".into(), 20), ("c".into(), 30)]);
+
+let key = String::from("a");
+let _entry_o: OccupiedEntryRef<_, _, _, _> = map.entry_ref(&key).insert(100);
+assert_eq!(map.len(), 3);
+
+// Existing key (insert and update)
+match map.entry_ref("a") {
+    EntryRef::Vacant(_) => unreachable!(),
+    EntryRef::Occupied(mut view) => {
+        assert_eq!(view.get(), &100);
+        let v = view.get_mut();
+        *v *= 10;
+        assert_eq!(view.insert(1111), 1000);
+    }
+}
+
+assert_eq!(map["a"], 1111);
+assert_eq!(map.len(), 3);
+
+// Existing key (take)
+match map.entry_ref("c") {
+    EntryRef::Vacant(_) => unreachable!(),
+    EntryRef::Occupied(view) => {
+        assert_eq!(view.remove_entry(), ("c".to_owned(), 30));
+    }
+}
+assert_eq!(map.get("c"), None);
+assert_eq!(map.len(), 2);
+

Implementations§

source§

impl<'a, 'b, K, Q: ?Sized, V, S, A: Allocator> OccupiedEntryRef<'a, 'b, K, Q, V, S, A>

source

pub fn key(&self) -> &K

Gets a reference to the key in the entry.

+
§Examples
+
use hashbrown::hash_map::{EntryRef, HashMap};
+
+let mut map: HashMap<String, u32> = HashMap::new();
+map.entry_ref("poneyland").or_insert(12);
+
+match map.entry_ref("poneyland") {
+    EntryRef::Vacant(_) => panic!(),
+    EntryRef::Occupied(entry) => assert_eq!(entry.key(), "poneyland"),
+}
+
source

pub fn remove_entry(self) -> (K, V)

Take the ownership of the key and value from the map. +Keeps the allocated memory for reuse.

+
§Examples
+
use hashbrown::HashMap;
+use hashbrown::hash_map::EntryRef;
+
+let mut map: HashMap<String, u32> = HashMap::new();
+// The map is empty
+assert!(map.is_empty() && map.capacity() == 0);
+
+map.entry_ref("poneyland").or_insert(12);
+
+if let EntryRef::Occupied(o) = map.entry_ref("poneyland") {
+    // We delete the entry from the map.
+    assert_eq!(o.remove_entry(), ("poneyland".to_owned(), 12));
+}
+
+assert_eq!(map.contains_key("poneyland"), false);
+// Now map hold none elements but capacity is equal to the old one
+assert!(map.is_empty());
+
source

pub fn get(&self) -> &V

Gets a reference to the value in the entry.

+
§Examples
+
use hashbrown::HashMap;
+use hashbrown::hash_map::EntryRef;
+
+let mut map: HashMap<String, u32> = HashMap::new();
+map.entry_ref("poneyland").or_insert(12);
+
+match map.entry_ref("poneyland") {
+    EntryRef::Vacant(_) => panic!(),
+    EntryRef::Occupied(entry) => assert_eq!(entry.get(), &12),
+}
+
source

pub fn get_mut(&mut self) -> &mut V

Gets a mutable reference to the value in the entry.

+

If you need a reference to the OccupiedEntryRef which may outlive the +destruction of the EntryRef value, see into_mut.

+
§Examples
+
use hashbrown::HashMap;
+use hashbrown::hash_map::EntryRef;
+
+let mut map: HashMap<String, u32> = HashMap::new();
+map.entry_ref("poneyland").or_insert(12);
+
+assert_eq!(map["poneyland"], 12);
+if let EntryRef::Occupied(mut o) = map.entry_ref("poneyland") {
+    *o.get_mut() += 10;
+    assert_eq!(*o.get(), 22);
+
+    // We can use the same Entry multiple times.
+    *o.get_mut() += 2;
+}
+
+assert_eq!(map["poneyland"], 24);
+
source

pub fn into_mut(self) -> &'a mut V

Converts the OccupiedEntryRef into a mutable reference to the value in the entry +with a lifetime bound to the map itself.

+

If you need multiple references to the OccupiedEntryRef, see get_mut.

+
§Examples
+
use hashbrown::hash_map::{EntryRef, HashMap};
+
+let mut map: HashMap<String, u32> = HashMap::new();
+map.entry_ref("poneyland").or_insert(12);
+
+let value: &mut u32;
+match map.entry_ref("poneyland") {
+    EntryRef::Occupied(entry) => value = entry.into_mut(),
+    EntryRef::Vacant(_) => panic!(),
+}
+*value += 10;
+
+assert_eq!(map["poneyland"], 22);
+
source

pub fn insert(&mut self, value: V) -> V

Sets the value of the entry, and returns the entry’s old value.

+
§Examples
+
use hashbrown::HashMap;
+use hashbrown::hash_map::EntryRef;
+
+let mut map: HashMap<String, u32> = HashMap::new();
+map.entry_ref("poneyland").or_insert(12);
+
+if let EntryRef::Occupied(mut o) = map.entry_ref("poneyland") {
+    assert_eq!(o.insert(15), 12);
+}
+
+assert_eq!(map["poneyland"], 15);
+
source

pub fn remove(self) -> V

Takes the value out of the entry, and returns it. +Keeps the allocated memory for reuse.

+
§Examples
+
use hashbrown::HashMap;
+use hashbrown::hash_map::EntryRef;
+
+let mut map: HashMap<String, u32> = HashMap::new();
+// The map is empty
+assert!(map.is_empty() && map.capacity() == 0);
+
+map.entry_ref("poneyland").or_insert(12);
+
+if let EntryRef::Occupied(o) = map.entry_ref("poneyland") {
+    assert_eq!(o.remove(), 12);
+}
+
+assert_eq!(map.contains_key("poneyland"), false);
+// Now map hold none elements but capacity is equal to the old one
+assert!(map.is_empty());
+
source

pub fn replace_entry(self, value: V) -> (K, V)
where + K: From<&'b Q>,

Replaces the entry, returning the old key and value. The new key in the hash map will be +the key used to create this entry.

+
§Panics
+

Will panic if this OccupiedEntryRef was created through EntryRef::insert.

+
§Examples
+
use hashbrown::hash_map::{EntryRef, HashMap};
+use std::rc::Rc;
+
+let mut map: HashMap<Rc<str>, u32> = HashMap::new();
+let key: Rc<str> = Rc::from("Stringthing");
+
+map.insert(key.clone(), 15);
+assert_eq!(Rc::strong_count(&key), 2);
+
+match map.entry_ref("Stringthing") {
+    EntryRef::Occupied(entry) => {
+        let (old_key, old_value): (Rc<str>, u32) = entry.replace_entry(16);
+        assert!(Rc::ptr_eq(&key, &old_key) && old_value == 15);
+    }
+    EntryRef::Vacant(_) => panic!(),
+}
+
+assert_eq!(Rc::strong_count(&key), 1);
+assert_eq!(map["Stringthing"], 16);
+
source

pub fn replace_key(self) -> K
where + K: From<&'b Q>,

Replaces the key in the hash map with the key used to create this entry.

+
§Panics
+

Will panic if this OccupiedEntryRef was created through EntryRef::insert.

+
§Examples
+
use hashbrown::hash_map::{EntryRef, HashMap};
+use std::rc::Rc;
+
+let mut map: HashMap<Rc<str>, usize> = HashMap::with_capacity(6);
+let mut keys: Vec<Rc<str>> = Vec::with_capacity(6);
+
+for (value, key) in ["a", "b", "c", "d", "e", "f"].into_iter().enumerate() {
+    let rc_key: Rc<str> = Rc::from(key);
+    keys.push(rc_key.clone());
+    map.insert(rc_key.clone(), value);
+}
+
+assert!(keys.iter().all(|key| Rc::strong_count(key) == 2));
+
+// It doesn't matter that we kind of use a vector with the same keys,
+// because all keys will be newly created from the references
+reclaim_memory(&mut map, &keys);
+
+assert!(keys.iter().all(|key| Rc::strong_count(key) == 1));
+
+fn reclaim_memory(map: &mut HashMap<Rc<str>, usize>, keys: &[Rc<str>]) {
+    for key in keys {
+        if let EntryRef::Occupied(entry) = map.entry_ref(key.as_ref()) {
+            // Replaces the entry's key with our version of it in `keys`.
+            entry.replace_key();
+        }
+    }
+}
+
source

pub fn replace_entry_with<F>(self, f: F) -> EntryRef<'a, 'b, K, Q, V, S, A>
where + F: FnOnce(&K, V) -> Option<V>,

Provides shared access to the key and owned access to the value of +the entry and allows to replace or remove it based on the +value of the returned option.

+
§Examples
+
use hashbrown::HashMap;
+use hashbrown::hash_map::EntryRef;
+
+let mut map: HashMap<String, u32> = HashMap::new();
+map.insert("poneyland".to_string(), 42);
+
+let entry = match map.entry_ref("poneyland") {
+    EntryRef::Occupied(e) => {
+        e.replace_entry_with(|k, v| {
+            assert_eq!(k, "poneyland");
+            assert_eq!(v, 42);
+            Some(v + 1)
+        })
+    }
+    EntryRef::Vacant(_) => panic!(),
+};
+
+match entry {
+    EntryRef::Occupied(e) => {
+        assert_eq!(e.key(), "poneyland");
+        assert_eq!(e.get(), &43);
+    }
+    EntryRef::Vacant(_) => panic!(),
+}
+
+assert_eq!(map["poneyland"], 43);
+
+let entry = match map.entry_ref("poneyland") {
+    EntryRef::Occupied(e) => e.replace_entry_with(|_k, _v| None),
+    EntryRef::Vacant(_) => panic!(),
+};
+
+match entry {
+    EntryRef::Vacant(e) => {
+        assert_eq!(e.key(), "poneyland");
+    }
+    EntryRef::Occupied(_) => panic!(),
+}
+
+assert!(!map.contains_key("poneyland"));
+

Trait Implementations§

source§

impl<K: Borrow<Q>, Q: ?Sized + Debug, V: Debug, S, A: Allocator> Debug for OccupiedEntryRef<'_, '_, K, Q, V, S, A>

source§

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

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

impl<'a, 'b, K, Q, V, S, A> Send for OccupiedEntryRef<'a, 'b, K, Q, V, S, A>
where + K: Send, + Q: Sync + ?Sized, + V: Send, + S: Send, + A: Send + Allocator,

source§

impl<'a, 'b, K, Q, V, S, A> Sync for OccupiedEntryRef<'a, 'b, K, Q, V, S, A>
where + K: Sync, + Q: Sync + ?Sized, + V: Sync, + S: Sync, + A: Sync + Allocator,

Auto Trait Implementations§

§

impl<'a, 'b, K, Q: ?Sized, V, S, A> Freeze for OccupiedEntryRef<'a, 'b, K, Q, V, S, A>
where + K: Freeze,

§

impl<'a, 'b, K, Q: ?Sized, V, S, A> RefUnwindSafe for OccupiedEntryRef<'a, 'b, K, Q, V, S, A>
where + A: RefUnwindSafe, + K: RefUnwindSafe, + Q: RefUnwindSafe, + S: RefUnwindSafe, + V: RefUnwindSafe,

§

impl<'a, 'b, K, Q: ?Sized, V, S, A> Unpin for OccupiedEntryRef<'a, 'b, K, Q, V, S, A>
where + K: Unpin,

§

impl<'a, 'b, K, Q, V, S, A = Global> !UnwindSafe for OccupiedEntryRef<'a, 'b, K, Q, V, S, A>

Blanket Implementations§

source§

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

source§

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more
source§

impl<T> Borrow<T> for T
where + T: ?Sized,

source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
source§

impl<T> BorrowMut<T> for T
where + 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 T
where + 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 T
where + 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 T
where + 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/hashbrown/hash_map/struct.OccupiedError.html b/hashbrown/hash_map/struct.OccupiedError.html new file mode 100644 index 0000000000..aa77efe946 --- /dev/null +++ b/hashbrown/hash_map/struct.OccupiedError.html @@ -0,0 +1,53 @@ +OccupiedError in hashbrown::hash_map - Rust
+

Struct hashbrown::hash_map::OccupiedError

source · 
pub struct OccupiedError<'a, K, V, S, A: Allocator = Global> {
+    pub entry: OccupiedEntry<'a, K, V, S, A>,
+    pub value: V,
+}
Expand description

The error returned by try_insert when the key already exists.

+

Contains the occupied entry, and the value that was not inserted.

+

§Examples

+
use hashbrown::hash_map::{HashMap, OccupiedError};
+
+let mut map: HashMap<_, _> = [("a", 10), ("b", 20)].into();
+
+// try_insert method returns mutable reference to the value if keys are vacant,
+// but if the map did have key present, nothing is updated, and the provided
+// value is returned inside `Err(_)` variant
+match map.try_insert("a", 100) {
+    Err(OccupiedError { mut entry, value }) => {
+        assert_eq!(entry.key(), &"a");
+        assert_eq!(value, 100);
+        assert_eq!(entry.insert(100), 10)
+    }
+    _ => unreachable!(),
+}
+assert_eq!(map[&"a"], 100);
+

Fields§

§entry: OccupiedEntry<'a, K, V, S, A>

The entry in the map that was already occupied.

+
§value: V

The value which was not inserted, because the entry was already occupied.

+

Trait Implementations§

source§

impl<K: Debug, V: Debug, S, A: Allocator> Debug for OccupiedError<'_, K, V, S, A>

source§

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

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

impl<'a, K: Debug, V: Debug, S, A: Allocator> Display for OccupiedError<'a, K, V, S, A>

source§

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

Formats the value using the given formatter. Read more

Auto Trait Implementations§

§

impl<'a, K, V, S, A> Freeze for OccupiedError<'a, K, V, S, A>
where + K: Freeze, + V: Freeze,

§

impl<'a, K, V, S, A> RefUnwindSafe for OccupiedError<'a, K, V, S, A>
where + A: RefUnwindSafe, + K: RefUnwindSafe, + S: RefUnwindSafe, + V: RefUnwindSafe,

§

impl<'a, K, V, S, A> Send for OccupiedError<'a, K, V, S, A>
where + A: Send, + K: Send, + S: Send, + V: Send,

§

impl<'a, K, V, S, A> Sync for OccupiedError<'a, K, V, S, A>
where + A: Sync, + K: Sync, + S: Sync, + V: Sync,

§

impl<'a, K, V, S, A> Unpin for OccupiedError<'a, K, V, S, A>
where + K: Unpin, + V: Unpin,

§

impl<'a, K, V, S, A = Global> !UnwindSafe for OccupiedError<'a, K, V, S, A>

Blanket Implementations§

source§

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

source§

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more
source§

impl<T> Borrow<T> for T
where + T: ?Sized,

source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
source§

impl<T> BorrowMut<T> for T
where + 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 T
where + 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 T
where + 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 T
where + 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 T
where + 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/hashbrown/hash_map/struct.RawEntryBuilder.html b/hashbrown/hash_map/struct.RawEntryBuilder.html new file mode 100644 index 0000000000..4ff359a8a7 --- /dev/null +++ b/hashbrown/hash_map/struct.RawEntryBuilder.html @@ -0,0 +1,102 @@ +RawEntryBuilder in hashbrown::hash_map - Rust
+

Struct hashbrown::hash_map::RawEntryBuilder

source · 
pub struct RawEntryBuilder<'a, K, V, S, A: Allocator = Global> { /* private fields */ }
Expand description

A builder for computing where in a HashMap a key-value pair would be stored.

+

See the HashMap::raw_entry docs for usage examples.

+

§Examples

+
use hashbrown::hash_map::{HashMap, RawEntryBuilder};
+use core::hash::{BuildHasher, Hash};
+
+let mut map = HashMap::new();
+map.extend([(1, 10), (2, 20), (3, 30)]);
+
+fn compute_hash<K: Hash + ?Sized, S: BuildHasher>(hash_builder: &S, key: &K) -> u64 {
+    use core::hash::Hasher;
+    let mut state = hash_builder.build_hasher();
+    key.hash(&mut state);
+    state.finish()
+}
+
+for k in 0..6 {
+    let hash = compute_hash(map.hasher(), &k);
+    let v = map.get(&k).cloned();
+    let kv = v.as_ref().map(|v| (&k, v));
+
+    println!("Key: {} and value: {:?}", k, v);
+    let builder: RawEntryBuilder<_, _, _> = map.raw_entry();
+    assert_eq!(builder.from_key(&k), kv);
+    assert_eq!(map.raw_entry().from_hash(hash, |q| *q == k), kv);
+    assert_eq!(map.raw_entry().from_key_hashed_nocheck(hash, &k), kv);
+}
+

Implementations§

source§

impl<'a, K, V, S, A: Allocator> RawEntryBuilder<'a, K, V, S, A>

source

pub fn from_key<Q>(self, k: &Q) -> Option<(&'a K, &'a V)>
where + S: BuildHasher, + Q: Hash + Equivalent<K> + ?Sized,

Access an immutable entry by key.

+
§Examples
+
use hashbrown::HashMap;
+
+let map: HashMap<&str, u32> = [("a", 100), ("b", 200)].into();
+let key = "a";
+assert_eq!(map.raw_entry().from_key(&key), Some((&"a", &100)));
+
source

pub fn from_key_hashed_nocheck<Q>( + self, + hash: u64, + k: &Q +) -> Option<(&'a K, &'a V)>
where + Q: Equivalent<K> + ?Sized,

Access an immutable entry by a key and its hash.

+
§Examples
+
use core::hash::{BuildHasher, Hash};
+use hashbrown::HashMap;
+
+fn compute_hash<K: Hash + ?Sized, S: BuildHasher>(hash_builder: &S, key: &K) -> u64 {
+    use core::hash::Hasher;
+    let mut state = hash_builder.build_hasher();
+    key.hash(&mut state);
+    state.finish()
+}
+
+let map: HashMap<&str, u32> = [("a", 100), ("b", 200)].into();
+let key = "a";
+let hash = compute_hash(map.hasher(), &key);
+assert_eq!(map.raw_entry().from_key_hashed_nocheck(hash, &key), Some((&"a", &100)));
+
source

pub fn from_hash<F>(self, hash: u64, is_match: F) -> Option<(&'a K, &'a V)>
where + F: FnMut(&K) -> bool,

Access an immutable entry by hash and matching function.

+
§Examples
+
use core::hash::{BuildHasher, Hash};
+use hashbrown::HashMap;
+
+fn compute_hash<K: Hash + ?Sized, S: BuildHasher>(hash_builder: &S, key: &K) -> u64 {
+    use core::hash::Hasher;
+    let mut state = hash_builder.build_hasher();
+    key.hash(&mut state);
+    state.finish()
+}
+
+let map: HashMap<&str, u32> = [("a", 100), ("b", 200)].into();
+let key = "a";
+let hash = compute_hash(map.hasher(), &key);
+assert_eq!(map.raw_entry().from_hash(hash, |k| k == &key), Some((&"a", &100)));
+

Trait Implementations§

source§

impl<K, V, S, A: Allocator> Debug for RawEntryBuilder<'_, K, V, S, A>

source§

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

Formats the value using the given formatter. Read more

Auto Trait Implementations§

§

impl<'a, K, V, S, A> Freeze for RawEntryBuilder<'a, K, V, S, A>

§

impl<'a, K, V, S, A> RefUnwindSafe for RawEntryBuilder<'a, K, V, S, A>
where + A: RefUnwindSafe, + K: RefUnwindSafe, + S: RefUnwindSafe, + V: RefUnwindSafe,

§

impl<'a, K, V, S, A> Send for RawEntryBuilder<'a, K, V, S, A>
where + A: Sync, + K: Sync, + S: Sync, + V: Sync,

§

impl<'a, K, V, S, A> Sync for RawEntryBuilder<'a, K, V, S, A>
where + A: Sync, + K: Sync, + S: Sync, + V: Sync,

§

impl<'a, K, V, S, A> Unpin for RawEntryBuilder<'a, K, V, S, A>

§

impl<'a, K, V, S, A> UnwindSafe for RawEntryBuilder<'a, K, V, S, A>
where + A: RefUnwindSafe, + K: RefUnwindSafe, + S: RefUnwindSafe, + V: RefUnwindSafe,

Blanket Implementations§

source§

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

source§

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more
source§

impl<T> Borrow<T> for T
where + T: ?Sized,

source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
source§

impl<T> BorrowMut<T> for T
where + 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 T
where + 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 T
where + 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 T
where + 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/hashbrown/hash_map/struct.RawEntryBuilderMut.html b/hashbrown/hash_map/struct.RawEntryBuilderMut.html new file mode 100644 index 0000000000..69de65a611 --- /dev/null +++ b/hashbrown/hash_map/struct.RawEntryBuilderMut.html @@ -0,0 +1,125 @@ +RawEntryBuilderMut in hashbrown::hash_map - Rust
+

Struct hashbrown::hash_map::RawEntryBuilderMut

source · 
pub struct RawEntryBuilderMut<'a, K, V, S, A: Allocator = Global> { /* private fields */ }
Expand description

A builder for computing where in a HashMap a key-value pair would be stored.

+

See the HashMap::raw_entry_mut docs for usage examples.

+

§Examples

+
use hashbrown::hash_map::{RawEntryBuilderMut, RawEntryMut::Vacant, RawEntryMut::Occupied};
+use hashbrown::HashMap;
+use core::hash::{BuildHasher, Hash};
+
+let mut map = HashMap::new();
+map.extend([(1, 11), (2, 12), (3, 13), (4, 14), (5, 15), (6, 16)]);
+assert_eq!(map.len(), 6);
+
+fn compute_hash<K: Hash + ?Sized, S: BuildHasher>(hash_builder: &S, key: &K) -> u64 {
+    use core::hash::Hasher;
+    let mut state = hash_builder.build_hasher();
+    key.hash(&mut state);
+    state.finish()
+}
+
+let builder: RawEntryBuilderMut<_, _, _> = map.raw_entry_mut();
+
+// Existing key
+match builder.from_key(&6) {
+    Vacant(_) => unreachable!(),
+    Occupied(view) => assert_eq!(view.get(), &16),
+}
+
+for key in 0..12 {
+    let hash = compute_hash(map.hasher(), &key);
+    let value = map.get(&key).cloned();
+    let key_value = value.as_ref().map(|v| (&key, v));
+
+    println!("Key: {} and value: {:?}", key, value);
+
+    match map.raw_entry_mut().from_key(&key) {
+        Occupied(mut o) => assert_eq!(Some(o.get_key_value()), key_value),
+        Vacant(_) => assert_eq!(value, None),
+    }
+    match map.raw_entry_mut().from_key_hashed_nocheck(hash, &key) {
+        Occupied(mut o) => assert_eq!(Some(o.get_key_value()), key_value),
+        Vacant(_) => assert_eq!(value, None),
+    }
+    match map.raw_entry_mut().from_hash(hash, |q| *q == key) {
+        Occupied(mut o) => assert_eq!(Some(o.get_key_value()), key_value),
+        Vacant(_) => assert_eq!(value, None),
+    }
+}
+
+assert_eq!(map.len(), 6);
+

Implementations§

source§

impl<'a, K, V, S, A: Allocator> RawEntryBuilderMut<'a, K, V, S, A>

source

pub fn from_key<Q>(self, k: &Q) -> RawEntryMut<'a, K, V, S, A>
where + S: BuildHasher, + Q: Hash + Equivalent<K> + ?Sized,

Creates a RawEntryMut from the given key.

+
§Examples
+
use hashbrown::hash_map::{HashMap, RawEntryMut};
+
+let mut map: HashMap<&str, u32> = HashMap::new();
+let key = "a";
+let entry: RawEntryMut<&str, u32, _> = map.raw_entry_mut().from_key(&key);
+entry.insert(key, 100);
+assert_eq!(map[&"a"], 100);
+
source

pub fn from_key_hashed_nocheck<Q>( + self, + hash: u64, + k: &Q +) -> RawEntryMut<'a, K, V, S, A>
where + Q: Equivalent<K> + ?Sized,

Creates a RawEntryMut from the given key and its hash.

+
§Examples
+
use core::hash::{BuildHasher, Hash};
+use hashbrown::hash_map::{HashMap, RawEntryMut};
+
+fn compute_hash<K: Hash + ?Sized, S: BuildHasher>(hash_builder: &S, key: &K) -> u64 {
+    use core::hash::Hasher;
+    let mut state = hash_builder.build_hasher();
+    key.hash(&mut state);
+    state.finish()
+}
+
+let mut map: HashMap<&str, u32> = HashMap::new();
+let key = "a";
+let hash = compute_hash(map.hasher(), &key);
+let entry: RawEntryMut<&str, u32, _> = map.raw_entry_mut().from_key_hashed_nocheck(hash, &key);
+entry.insert(key, 100);
+assert_eq!(map[&"a"], 100);
+
source§

impl<'a, K, V, S, A: Allocator> RawEntryBuilderMut<'a, K, V, S, A>

source

pub fn from_hash<F>(self, hash: u64, is_match: F) -> RawEntryMut<'a, K, V, S, A>
where + for<'b> F: FnMut(&'b K) -> bool,

Creates a RawEntryMut from the given hash and matching function.

+
§Examples
+
use core::hash::{BuildHasher, Hash};
+use hashbrown::hash_map::{HashMap, RawEntryMut};
+
+fn compute_hash<K: Hash + ?Sized, S: BuildHasher>(hash_builder: &S, key: &K) -> u64 {
+    use core::hash::Hasher;
+    let mut state = hash_builder.build_hasher();
+    key.hash(&mut state);
+    state.finish()
+}
+
+let mut map: HashMap<&str, u32> = HashMap::new();
+let key = "a";
+let hash = compute_hash(map.hasher(), &key);
+let entry: RawEntryMut<&str, u32, _> = map.raw_entry_mut().from_hash(hash, |k| k == &key);
+entry.insert(key, 100);
+assert_eq!(map[&"a"], 100);
+

Trait Implementations§

source§

impl<K, V, S, A: Allocator> Debug for RawEntryBuilderMut<'_, K, V, S, A>

source§

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

Formats the value using the given formatter. Read more

Auto Trait Implementations§

§

impl<'a, K, V, S, A> Freeze for RawEntryBuilderMut<'a, K, V, S, A>

§

impl<'a, K, V, S, A> RefUnwindSafe for RawEntryBuilderMut<'a, K, V, S, A>
where + A: RefUnwindSafe, + K: RefUnwindSafe, + S: RefUnwindSafe, + V: RefUnwindSafe,

§

impl<'a, K, V, S, A> Send for RawEntryBuilderMut<'a, K, V, S, A>
where + A: Send, + K: Send, + S: Send, + V: Send,

§

impl<'a, K, V, S, A> Sync for RawEntryBuilderMut<'a, K, V, S, A>
where + A: Sync, + K: Sync, + S: Sync, + V: Sync,

§

impl<'a, K, V, S, A> Unpin for RawEntryBuilderMut<'a, K, V, S, A>

§

impl<'a, K, V, S, A = Global> !UnwindSafe for RawEntryBuilderMut<'a, K, V, S, A>

Blanket Implementations§

source§

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

source§

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more
source§

impl<T> Borrow<T> for T
where + T: ?Sized,

source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
source§

impl<T> BorrowMut<T> for T
where + 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 T
where + 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 T
where + 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 T
where + 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/hashbrown/hash_map/struct.RawOccupiedEntryMut.html b/hashbrown/hash_map/struct.RawOccupiedEntryMut.html new file mode 100644 index 0000000000..3fc8786000 --- /dev/null +++ b/hashbrown/hash_map/struct.RawOccupiedEntryMut.html @@ -0,0 +1,323 @@ +RawOccupiedEntryMut in hashbrown::hash_map - Rust
+

Struct hashbrown::hash_map::RawOccupiedEntryMut

source · 
pub struct RawOccupiedEntryMut<'a, K, V, S, A: Allocator = Global> { /* private fields */ }
Expand description

A view into an occupied entry in a HashMap. +It is part of the RawEntryMut enum.

+

§Examples

+
use core::hash::{BuildHasher, Hash};
+use hashbrown::hash_map::{HashMap, RawEntryMut, RawOccupiedEntryMut};
+
+let mut map = HashMap::new();
+map.extend([("a", 10), ("b", 20), ("c", 30)]);
+
+fn compute_hash<K: Hash + ?Sized, S: BuildHasher>(hash_builder: &S, key: &K) -> u64 {
+    use core::hash::Hasher;
+    let mut state = hash_builder.build_hasher();
+    key.hash(&mut state);
+    state.finish()
+}
+
+let _raw_o: RawOccupiedEntryMut<_, _, _> = map.raw_entry_mut().from_key(&"a").insert("a", 100);
+assert_eq!(map.len(), 3);
+
+// Existing key (insert and update)
+match map.raw_entry_mut().from_key(&"a") {
+    RawEntryMut::Vacant(_) => unreachable!(),
+    RawEntryMut::Occupied(mut view) => {
+        assert_eq!(view.get(), &100);
+        let v = view.get_mut();
+        let new_v = (*v) * 10;
+        *v = new_v;
+        assert_eq!(view.insert(1111), 1000);
+    }
+}
+
+assert_eq!(map[&"a"], 1111);
+assert_eq!(map.len(), 3);
+
+// Existing key (take)
+let hash = compute_hash(map.hasher(), &"c");
+match map.raw_entry_mut().from_key_hashed_nocheck(hash, &"c") {
+    RawEntryMut::Vacant(_) => unreachable!(),
+    RawEntryMut::Occupied(view) => {
+        assert_eq!(view.remove_entry(), ("c", 30));
+    }
+}
+assert_eq!(map.raw_entry().from_key(&"c"), None);
+assert_eq!(map.len(), 2);
+
+let hash = compute_hash(map.hasher(), &"b");
+match map.raw_entry_mut().from_hash(hash, |q| *q == "b") {
+    RawEntryMut::Vacant(_) => unreachable!(),
+    RawEntryMut::Occupied(view) => {
+        assert_eq!(view.remove_entry(), ("b", 20));
+    }
+}
+assert_eq!(map.get(&"b"), None);
+assert_eq!(map.len(), 1);
+

Implementations§

source§

impl<'a, K, V, S, A: Allocator> RawOccupiedEntryMut<'a, K, V, S, A>

source

pub fn key(&self) -> &K

Gets a reference to the key in the entry.

+
§Examples
+
use hashbrown::hash_map::{HashMap, RawEntryMut};
+
+let mut map: HashMap<&str, u32> = [("a", 100), ("b", 200)].into();
+
+match map.raw_entry_mut().from_key(&"a") {
+    RawEntryMut::Vacant(_) => panic!(),
+    RawEntryMut::Occupied(o) => assert_eq!(o.key(), &"a")
+}
+
source

pub fn key_mut(&mut self) -> &mut K

Gets a mutable reference to the key in the entry.

+
§Examples
+
use hashbrown::hash_map::{HashMap, RawEntryMut};
+use std::rc::Rc;
+
+let key_one = Rc::new("a");
+let key_two = Rc::new("a");
+
+let mut map: HashMap<Rc<&str>, u32> = HashMap::new();
+map.insert(key_one.clone(), 10);
+
+assert_eq!(map[&key_one], 10);
+assert!(Rc::strong_count(&key_one) == 2 && Rc::strong_count(&key_two) == 1);
+
+match map.raw_entry_mut().from_key(&key_one) {
+    RawEntryMut::Vacant(_) => panic!(),
+    RawEntryMut::Occupied(mut o) => {
+        *o.key_mut() = key_two.clone();
+    }
+}
+assert_eq!(map[&key_two], 10);
+assert!(Rc::strong_count(&key_one) == 1 && Rc::strong_count(&key_two) == 2);
+
source

pub fn into_key(self) -> &'a mut K

Converts the entry into a mutable reference to the key in the entry +with a lifetime bound to the map itself.

+
§Examples
+
use hashbrown::hash_map::{HashMap, RawEntryMut};
+use std::rc::Rc;
+
+let key_one = Rc::new("a");
+let key_two = Rc::new("a");
+
+let mut map: HashMap<Rc<&str>, u32> = HashMap::new();
+map.insert(key_one.clone(), 10);
+
+assert_eq!(map[&key_one], 10);
+assert!(Rc::strong_count(&key_one) == 2 && Rc::strong_count(&key_two) == 1);
+
+let inside_key: &mut Rc<&str>;
+
+match map.raw_entry_mut().from_key(&key_one) {
+    RawEntryMut::Vacant(_) => panic!(),
+    RawEntryMut::Occupied(o) => inside_key = o.into_key(),
+}
+*inside_key = key_two.clone();
+
+assert_eq!(map[&key_two], 10);
+assert!(Rc::strong_count(&key_one) == 1 && Rc::strong_count(&key_two) == 2);
+
source

pub fn get(&self) -> &V

Gets a reference to the value in the entry.

+
§Examples
+
use hashbrown::hash_map::{HashMap, RawEntryMut};
+
+let mut map: HashMap<&str, u32> = [("a", 100), ("b", 200)].into();
+
+match map.raw_entry_mut().from_key(&"a") {
+    RawEntryMut::Vacant(_) => panic!(),
+    RawEntryMut::Occupied(o) => assert_eq!(o.get(), &100),
+}
+
source

pub fn into_mut(self) -> &'a mut V

Converts the OccupiedEntry into a mutable reference to the value in the entry +with a lifetime bound to the map itself.

+
§Examples
+
use hashbrown::hash_map::{HashMap, RawEntryMut};
+
+let mut map: HashMap<&str, u32> = [("a", 100), ("b", 200)].into();
+
+let value: &mut u32;
+
+match map.raw_entry_mut().from_key(&"a") {
+    RawEntryMut::Vacant(_) => panic!(),
+    RawEntryMut::Occupied(o) => value = o.into_mut(),
+}
+*value += 900;
+
+assert_eq!(map[&"a"], 1000);
+
source

pub fn get_mut(&mut self) -> &mut V

Gets a mutable reference to the value in the entry.

+
§Examples
+
use hashbrown::hash_map::{HashMap, RawEntryMut};
+
+let mut map: HashMap<&str, u32> = [("a", 100), ("b", 200)].into();
+
+match map.raw_entry_mut().from_key(&"a") {
+    RawEntryMut::Vacant(_) => panic!(),
+    RawEntryMut::Occupied(mut o) => *o.get_mut() += 900,
+}
+
+assert_eq!(map[&"a"], 1000);
+
source

pub fn get_key_value(&self) -> (&K, &V)

Gets a reference to the key and value in the entry.

+
§Examples
+
use hashbrown::hash_map::{HashMap, RawEntryMut};
+
+let mut map: HashMap<&str, u32> = [("a", 100), ("b", 200)].into();
+
+match map.raw_entry_mut().from_key(&"a") {
+    RawEntryMut::Vacant(_) => panic!(),
+    RawEntryMut::Occupied(o) => assert_eq!(o.get_key_value(), (&"a", &100)),
+}
+
source

pub fn get_key_value_mut(&mut self) -> (&mut K, &mut V)

Gets a mutable reference to the key and value in the entry.

+
§Examples
+
use hashbrown::hash_map::{HashMap, RawEntryMut};
+use std::rc::Rc;
+
+let key_one = Rc::new("a");
+let key_two = Rc::new("a");
+
+let mut map: HashMap<Rc<&str>, u32> = HashMap::new();
+map.insert(key_one.clone(), 10);
+
+assert_eq!(map[&key_one], 10);
+assert!(Rc::strong_count(&key_one) == 2 && Rc::strong_count(&key_two) == 1);
+
+match map.raw_entry_mut().from_key(&key_one) {
+    RawEntryMut::Vacant(_) => panic!(),
+    RawEntryMut::Occupied(mut o) => {
+        let (inside_key, inside_value) = o.get_key_value_mut();
+        *inside_key = key_two.clone();
+        *inside_value = 100;
+    }
+}
+assert_eq!(map[&key_two], 100);
+assert!(Rc::strong_count(&key_one) == 1 && Rc::strong_count(&key_two) == 2);
+
source

pub fn into_key_value(self) -> (&'a mut K, &'a mut V)

Converts the OccupiedEntry into a mutable reference to the key and value in the entry +with a lifetime bound to the map itself.

+
§Examples
+
use hashbrown::hash_map::{HashMap, RawEntryMut};
+use std::rc::Rc;
+
+let key_one = Rc::new("a");
+let key_two = Rc::new("a");
+
+let mut map: HashMap<Rc<&str>, u32> = HashMap::new();
+map.insert(key_one.clone(), 10);
+
+assert_eq!(map[&key_one], 10);
+assert!(Rc::strong_count(&key_one) == 2 && Rc::strong_count(&key_two) == 1);
+
+let inside_key: &mut Rc<&str>;
+let inside_value: &mut u32;
+match map.raw_entry_mut().from_key(&key_one) {
+    RawEntryMut::Vacant(_) => panic!(),
+    RawEntryMut::Occupied(o) => {
+        let tuple = o.into_key_value();
+        inside_key = tuple.0;
+        inside_value = tuple.1;
+    }
+}
+*inside_key = key_two.clone();
+*inside_value = 100;
+assert_eq!(map[&key_two], 100);
+assert!(Rc::strong_count(&key_one) == 1 && Rc::strong_count(&key_two) == 2);
+
source

pub fn insert(&mut self, value: V) -> V

Sets the value of the entry, and returns the entry’s old value.

+
§Examples
+
use hashbrown::hash_map::{HashMap, RawEntryMut};
+
+let mut map: HashMap<&str, u32> = [("a", 100), ("b", 200)].into();
+
+match map.raw_entry_mut().from_key(&"a") {
+    RawEntryMut::Vacant(_) => panic!(),
+    RawEntryMut::Occupied(mut o) => assert_eq!(o.insert(1000), 100),
+}
+
+assert_eq!(map[&"a"], 1000);
+
source

pub fn insert_key(&mut self, key: K) -> K

Sets the value of the entry, and returns the entry’s old value.

+
§Examples
+
use hashbrown::hash_map::{HashMap, RawEntryMut};
+use std::rc::Rc;
+
+let key_one = Rc::new("a");
+let key_two = Rc::new("a");
+
+let mut map: HashMap<Rc<&str>, u32> = HashMap::new();
+map.insert(key_one.clone(), 10);
+
+assert_eq!(map[&key_one], 10);
+assert!(Rc::strong_count(&key_one) == 2 && Rc::strong_count(&key_two) == 1);
+
+match map.raw_entry_mut().from_key(&key_one) {
+    RawEntryMut::Vacant(_) => panic!(),
+    RawEntryMut::Occupied(mut o) => {
+        let old_key = o.insert_key(key_two.clone());
+        assert!(Rc::ptr_eq(&old_key, &key_one));
+    }
+}
+assert_eq!(map[&key_two], 10);
+assert!(Rc::strong_count(&key_one) == 1 && Rc::strong_count(&key_two) == 2);
+
source

pub fn remove(self) -> V

Takes the value out of the entry, and returns it.

+
§Examples
+
use hashbrown::hash_map::{HashMap, RawEntryMut};
+
+let mut map: HashMap<&str, u32> = [("a", 100), ("b", 200)].into();
+
+match map.raw_entry_mut().from_key(&"a") {
+    RawEntryMut::Vacant(_) => panic!(),
+    RawEntryMut::Occupied(o) => assert_eq!(o.remove(), 100),
+}
+assert_eq!(map.get(&"a"), None);
+
source

pub fn remove_entry(self) -> (K, V)

Take the ownership of the key and value from the map.

+
§Examples
+
use hashbrown::hash_map::{HashMap, RawEntryMut};
+
+let mut map: HashMap<&str, u32> = [("a", 100), ("b", 200)].into();
+
+match map.raw_entry_mut().from_key(&"a") {
+    RawEntryMut::Vacant(_) => panic!(),
+    RawEntryMut::Occupied(o) => assert_eq!(o.remove_entry(), ("a", 100)),
+}
+assert_eq!(map.get(&"a"), None);
+
source

pub fn replace_entry_with<F>(self, f: F) -> RawEntryMut<'a, K, V, S, A>
where + F: FnOnce(&K, V) -> Option<V>,

Provides shared access to the key and owned access to the value of +the entry and allows to replace or remove it based on the +value of the returned option.

+
§Examples
+
use hashbrown::hash_map::{HashMap, RawEntryMut};
+
+let mut map: HashMap<&str, u32> = [("a", 100), ("b", 200)].into();
+
+let raw_entry = match map.raw_entry_mut().from_key(&"a") {
+    RawEntryMut::Vacant(_) => panic!(),
+    RawEntryMut::Occupied(o) => o.replace_entry_with(|k, v| {
+        assert_eq!(k, &"a");
+        assert_eq!(v, 100);
+        Some(v + 900)
+    }),
+};
+let raw_entry = match raw_entry {
+    RawEntryMut::Vacant(_) => panic!(),
+    RawEntryMut::Occupied(o) => o.replace_entry_with(|k, v| {
+        assert_eq!(k, &"a");
+        assert_eq!(v, 1000);
+        None
+    }),
+};
+match raw_entry {
+    RawEntryMut::Vacant(_) => { },
+    RawEntryMut::Occupied(_) => panic!(),
+};
+assert_eq!(map.get(&"a"), None);
+

Trait Implementations§

source§

impl<K: Debug, V: Debug, S, A: Allocator> Debug for RawOccupiedEntryMut<'_, K, V, S, A>

source§

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

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

impl<K, V, S, A> Send for RawOccupiedEntryMut<'_, K, V, S, A>
where + K: Send, + V: Send, + S: Send, + A: Send + Allocator,

source§

impl<K, V, S, A> Sync for RawOccupiedEntryMut<'_, K, V, S, A>
where + K: Sync, + V: Sync, + S: Sync, + A: Sync + Allocator,

Auto Trait Implementations§

§

impl<'a, K, V, S, A> Freeze for RawOccupiedEntryMut<'a, K, V, S, A>

§

impl<'a, K, V, S, A> RefUnwindSafe for RawOccupiedEntryMut<'a, K, V, S, A>
where + A: RefUnwindSafe, + K: RefUnwindSafe, + S: RefUnwindSafe, + V: RefUnwindSafe,

§

impl<'a, K, V, S, A> Unpin for RawOccupiedEntryMut<'a, K, V, S, A>

§

impl<'a, K, V, S, A = Global> !UnwindSafe for RawOccupiedEntryMut<'a, K, V, S, A>

Blanket Implementations§

source§

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

source§

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more
source§

impl<T> Borrow<T> for T
where + T: ?Sized,

source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
source§

impl<T> BorrowMut<T> for T
where + 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 T
where + 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 T
where + 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 T
where + 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/hashbrown/hash_map/struct.RawVacantEntryMut.html b/hashbrown/hash_map/struct.RawVacantEntryMut.html new file mode 100644 index 0000000000..4297a6f398 --- /dev/null +++ b/hashbrown/hash_map/struct.RawVacantEntryMut.html @@ -0,0 +1,153 @@ +RawVacantEntryMut in hashbrown::hash_map - Rust
+

Struct hashbrown::hash_map::RawVacantEntryMut

source · 
pub struct RawVacantEntryMut<'a, K, V, S, A: Allocator = Global> { /* private fields */ }
Expand description

A view into a vacant entry in a HashMap. +It is part of the RawEntryMut enum.

+

§Examples

+
use core::hash::{BuildHasher, Hash};
+use hashbrown::hash_map::{HashMap, RawEntryMut, RawVacantEntryMut};
+
+let mut map = HashMap::<&str, i32>::new();
+
+fn compute_hash<K: Hash + ?Sized, S: BuildHasher>(hash_builder: &S, key: &K) -> u64 {
+    use core::hash::Hasher;
+    let mut state = hash_builder.build_hasher();
+    key.hash(&mut state);
+    state.finish()
+}
+
+let raw_v: RawVacantEntryMut<_, _, _> = match map.raw_entry_mut().from_key(&"a") {
+    RawEntryMut::Vacant(view) => view,
+    RawEntryMut::Occupied(_) => unreachable!(),
+};
+raw_v.insert("a", 10);
+assert!(map[&"a"] == 10 && map.len() == 1);
+
+// Nonexistent key (insert and update)
+let hash = compute_hash(map.hasher(), &"b");
+match map.raw_entry_mut().from_key_hashed_nocheck(hash, &"b") {
+    RawEntryMut::Occupied(_) => unreachable!(),
+    RawEntryMut::Vacant(view) => {
+        let (k, value) = view.insert("b", 2);
+        assert_eq!((*k, *value), ("b", 2));
+        *value = 20;
+    }
+}
+assert!(map[&"b"] == 20 && map.len() == 2);
+
+let hash = compute_hash(map.hasher(), &"c");
+match map.raw_entry_mut().from_hash(hash, |q| *q == "c") {
+    RawEntryMut::Occupied(_) => unreachable!(),
+    RawEntryMut::Vacant(view) => {
+        assert_eq!(view.insert("c", 30), (&mut "c", &mut 30));
+    }
+}
+assert!(map[&"c"] == 30 && map.len() == 3);
+

Implementations§

source§

impl<'a, K, V, S, A: Allocator> RawVacantEntryMut<'a, K, V, S, A>

source

pub fn insert(self, key: K, value: V) -> (&'a mut K, &'a mut V)
where + K: Hash, + S: BuildHasher,

Sets the value of the entry with the VacantEntry’s key, +and returns a mutable reference to it.

+
§Examples
+
use hashbrown::hash_map::{HashMap, RawEntryMut};
+
+let mut map: HashMap<&str, u32> = [("a", 100), ("b", 200)].into();
+
+match map.raw_entry_mut().from_key(&"c") {
+    RawEntryMut::Occupied(_) => panic!(),
+    RawEntryMut::Vacant(v) => assert_eq!(v.insert("c", 300), (&mut "c", &mut 300)),
+}
+
+assert_eq!(map[&"c"], 300);
+
source

pub fn insert_hashed_nocheck( + self, + hash: u64, + key: K, + value: V +) -> (&'a mut K, &'a mut V)
where + K: Hash, + S: BuildHasher,

Sets the value of the entry with the VacantEntry’s key, +and returns a mutable reference to it.

+
§Examples
+
use core::hash::{BuildHasher, Hash};
+use hashbrown::hash_map::{HashMap, RawEntryMut};
+
+fn compute_hash<K: Hash + ?Sized, S: BuildHasher>(hash_builder: &S, key: &K) -> u64 {
+    use core::hash::Hasher;
+    let mut state = hash_builder.build_hasher();
+    key.hash(&mut state);
+    state.finish()
+}
+
+let mut map: HashMap<&str, u32> = [("a", 100), ("b", 200)].into();
+let key = "c";
+let hash = compute_hash(map.hasher(), &key);
+
+match map.raw_entry_mut().from_key_hashed_nocheck(hash, &key) {
+    RawEntryMut::Occupied(_) => panic!(),
+    RawEntryMut::Vacant(v) => assert_eq!(
+        v.insert_hashed_nocheck(hash, key, 300),
+        (&mut "c", &mut 300)
+    ),
+}
+
+assert_eq!(map[&"c"], 300);
+
source

pub fn insert_with_hasher<H>( + self, + hash: u64, + key: K, + value: V, + hasher: H +) -> (&'a mut K, &'a mut V)
where + H: Fn(&K) -> u64,

Set the value of an entry with a custom hasher function.

+
§Examples
+
use core::hash::{BuildHasher, Hash};
+use hashbrown::hash_map::{HashMap, RawEntryMut};
+
+fn make_hasher<K, S>(hash_builder: &S) -> impl Fn(&K) -> u64 + '_
+where
+    K: Hash + ?Sized,
+    S: BuildHasher,
+{
+    move |key: &K| {
+        use core::hash::Hasher;
+        let mut state = hash_builder.build_hasher();
+        key.hash(&mut state);
+        state.finish()
+    }
+}
+
+let mut map: HashMap<&str, u32> = HashMap::new();
+let key = "a";
+let hash_builder = map.hasher().clone();
+let hash = make_hasher(&hash_builder)(&key);
+
+match map.raw_entry_mut().from_hash(hash, |q| q == &key) {
+    RawEntryMut::Occupied(_) => panic!(),
+    RawEntryMut::Vacant(v) => assert_eq!(
+        v.insert_with_hasher(hash, key, 100, make_hasher(&hash_builder)),
+        (&mut "a", &mut 100)
+    ),
+}
+map.extend([("b", 200), ("c", 300), ("d", 400), ("e", 500), ("f", 600)]);
+assert_eq!(map[&"a"], 100);
+

Trait Implementations§

source§

impl<K, V, S, A: Allocator> Debug for RawVacantEntryMut<'_, K, V, S, A>

source§

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

Formats the value using the given formatter. Read more

Auto Trait Implementations§

§

impl<'a, K, V, S, A> Freeze for RawVacantEntryMut<'a, K, V, S, A>

§

impl<'a, K, V, S, A> RefUnwindSafe for RawVacantEntryMut<'a, K, V, S, A>
where + A: RefUnwindSafe, + K: RefUnwindSafe, + S: RefUnwindSafe, + V: RefUnwindSafe,

§

impl<'a, K, V, S, A> Send for RawVacantEntryMut<'a, K, V, S, A>
where + A: Send, + K: Send, + S: Sync, + V: Send,

§

impl<'a, K, V, S, A> Sync for RawVacantEntryMut<'a, K, V, S, A>
where + A: Sync, + K: Sync, + S: Sync, + V: Sync,

§

impl<'a, K, V, S, A> Unpin for RawVacantEntryMut<'a, K, V, S, A>

§

impl<'a, K, V, S, A = Global> !UnwindSafe for RawVacantEntryMut<'a, K, V, S, A>

Blanket Implementations§

source§

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

source§

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more
source§

impl<T> Borrow<T> for T
where + T: ?Sized,

source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
source§

impl<T> BorrowMut<T> for T
where + 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 T
where + 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 T
where + 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 T
where + 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/hashbrown/hash_map/struct.VacantEntry.html b/hashbrown/hash_map/struct.VacantEntry.html new file mode 100644 index 0000000000..02e24afe6d --- /dev/null +++ b/hashbrown/hash_map/struct.VacantEntry.html @@ -0,0 +1,81 @@ +VacantEntry in hashbrown::hash_map - Rust
+

Struct hashbrown::hash_map::VacantEntry

source · 
pub struct VacantEntry<'a, K, V, S = DefaultHashBuilder, A: Allocator = Global> { /* private fields */ }
Expand description

A view into a vacant entry in a HashMap. +It is part of the Entry enum.

+

§Examples

+
use hashbrown::hash_map::{Entry, HashMap, VacantEntry};
+
+let mut map = HashMap::<&str, i32>::new();
+
+let entry_v: VacantEntry<_, _, _> = match map.entry("a") {
+    Entry::Vacant(view) => view,
+    Entry::Occupied(_) => unreachable!(),
+};
+entry_v.insert(10);
+assert!(map[&"a"] == 10 && map.len() == 1);
+
+// Nonexistent key (insert and update)
+match map.entry("b") {
+    Entry::Occupied(_) => unreachable!(),
+    Entry::Vacant(view) => {
+        let value = view.insert(2);
+        assert_eq!(*value, 2);
+        *value = 20;
+    }
+}
+assert!(map[&"b"] == 20 && map.len() == 2);
+

Implementations§

source§

impl<'a, K, V, S, A: Allocator> VacantEntry<'a, K, V, S, A>

source

pub fn key(&self) -> &K

Gets a reference to the key that would be used when inserting a value +through the VacantEntry.

+
§Examples
+
use hashbrown::HashMap;
+
+let mut map: HashMap<&str, u32> = HashMap::new();
+assert_eq!(map.entry("poneyland").key(), &"poneyland");
+
source

pub fn into_key(self) -> K

Take ownership of the key.

+
§Examples
+
use hashbrown::hash_map::{Entry, HashMap};
+
+let mut map: HashMap<&str, u32> = HashMap::new();
+
+match map.entry("poneyland") {
+    Entry::Occupied(_) => panic!(),
+    Entry::Vacant(v) => assert_eq!(v.into_key(), "poneyland"),
+}
+
source

pub fn insert(self, value: V) -> &'a mut V
where + K: Hash, + S: BuildHasher,

Sets the value of the entry with the VacantEntry’s key, +and returns a mutable reference to it.

+
§Examples
+
use hashbrown::HashMap;
+use hashbrown::hash_map::Entry;
+
+let mut map: HashMap<&str, u32> = HashMap::new();
+
+if let Entry::Vacant(o) = map.entry("poneyland") {
+    o.insert(37);
+}
+assert_eq!(map["poneyland"], 37);
+

Trait Implementations§

source§

impl<K: Debug, V, S, A: Allocator> Debug for VacantEntry<'_, K, V, S, A>

source§

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

Formats the value using the given formatter. Read more

Auto Trait Implementations§

§

impl<'a, K, V, S, A> Freeze for VacantEntry<'a, K, V, S, A>
where + K: Freeze,

§

impl<'a, K, V, S, A> RefUnwindSafe for VacantEntry<'a, K, V, S, A>
where + A: RefUnwindSafe, + K: RefUnwindSafe, + S: RefUnwindSafe, + V: RefUnwindSafe,

§

impl<'a, K, V, S, A> Send for VacantEntry<'a, K, V, S, A>
where + A: Send, + K: Send, + S: Send, + V: Send,

§

impl<'a, K, V, S, A> Sync for VacantEntry<'a, K, V, S, A>
where + A: Sync, + K: Sync, + S: Sync, + V: Sync,

§

impl<'a, K, V, S, A> Unpin for VacantEntry<'a, K, V, S, A>
where + K: Unpin,

§

impl<'a, K, V, S = DefaultHashBuilder, A = Global> !UnwindSafe for VacantEntry<'a, K, V, S, A>

Blanket Implementations§

source§

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

source§

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more
source§

impl<T> Borrow<T> for T
where + T: ?Sized,

source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
source§

impl<T> BorrowMut<T> for T
where + 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 T
where + 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 T
where + 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 T
where + 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/hashbrown/hash_map/struct.VacantEntryRef.html b/hashbrown/hash_map/struct.VacantEntryRef.html new file mode 100644 index 0000000000..cdc744aca4 --- /dev/null +++ b/hashbrown/hash_map/struct.VacantEntryRef.html @@ -0,0 +1,89 @@ +VacantEntryRef in hashbrown::hash_map - Rust
+

Struct hashbrown::hash_map::VacantEntryRef

source · 
pub struct VacantEntryRef<'a, 'b, K, Q: ?Sized, V, S, A: Allocator = Global> { /* private fields */ }
Expand description

A view into a vacant entry in a HashMap. +It is part of the EntryRef enum.

+

§Examples

+
use hashbrown::hash_map::{EntryRef, HashMap, VacantEntryRef};
+
+let mut map = HashMap::<String, i32>::new();
+
+let entry_v: VacantEntryRef<_, _, _, _> = match map.entry_ref("a") {
+    EntryRef::Vacant(view) => view,
+    EntryRef::Occupied(_) => unreachable!(),
+};
+entry_v.insert(10);
+assert!(map["a"] == 10 && map.len() == 1);
+
+// Nonexistent key (insert and update)
+match map.entry_ref("b") {
+    EntryRef::Occupied(_) => unreachable!(),
+    EntryRef::Vacant(view) => {
+        let value = view.insert(2);
+        assert_eq!(*value, 2);
+        *value = 20;
+    }
+}
+assert!(map["b"] == 20 && map.len() == 2);
+

Implementations§

source§

impl<'a, 'b, K, Q: ?Sized, V, S, A: Allocator> VacantEntryRef<'a, 'b, K, Q, V, S, A>

source

pub fn key(&self) -> &Q
where + K: Borrow<Q>,

Gets a reference to the key that would be used when inserting a value +through the VacantEntryRef.

+
§Examples
+
use hashbrown::HashMap;
+
+let mut map: HashMap<String, u32> = HashMap::new();
+let key: &str = "poneyland";
+assert_eq!(map.entry_ref(key).key(), "poneyland");
+
source

pub fn into_key(self) -> K
where + K: From<&'b Q>,

Take ownership of the key.

+
§Examples
+
use hashbrown::hash_map::{EntryRef, HashMap};
+
+let mut map: HashMap<String, u32> = HashMap::new();
+let key: &str = "poneyland";
+
+match map.entry_ref(key) {
+    EntryRef::Occupied(_) => panic!(),
+    EntryRef::Vacant(v) => assert_eq!(v.into_key(), "poneyland".to_owned()),
+}
+
source

pub fn insert(self, value: V) -> &'a mut V
where + K: Hash + From<&'b Q>, + S: BuildHasher,

Sets the value of the entry with the VacantEntryRef’s key, +and returns a mutable reference to it.

+
§Examples
+
use hashbrown::HashMap;
+use hashbrown::hash_map::EntryRef;
+
+let mut map: HashMap<String, u32> = HashMap::new();
+let key: &str = "poneyland";
+
+if let EntryRef::Vacant(o) = map.entry_ref(key) {
+    o.insert(37);
+}
+assert_eq!(map["poneyland"], 37);
+

Trait Implementations§

source§

impl<K: Borrow<Q>, Q: ?Sized + Debug, V, S, A: Allocator> Debug for VacantEntryRef<'_, '_, K, Q, V, S, A>

source§

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

Formats the value using the given formatter. Read more

Auto Trait Implementations§

§

impl<'a, 'b, K, Q: ?Sized, V, S, A> Freeze for VacantEntryRef<'a, 'b, K, Q, V, S, A>
where + K: Freeze,

§

impl<'a, 'b, K, Q: ?Sized, V, S, A> RefUnwindSafe for VacantEntryRef<'a, 'b, K, Q, V, S, A>
where + A: RefUnwindSafe, + K: RefUnwindSafe, + Q: RefUnwindSafe, + S: RefUnwindSafe, + V: RefUnwindSafe,

§

impl<'a, 'b, K, Q: ?Sized, V, S, A> Send for VacantEntryRef<'a, 'b, K, Q, V, S, A>
where + A: Send, + K: Send, + Q: Sync, + S: Send, + V: Send,

§

impl<'a, 'b, K, Q: ?Sized, V, S, A> Sync for VacantEntryRef<'a, 'b, K, Q, V, S, A>
where + A: Sync, + K: Sync, + Q: Sync, + S: Sync, + V: Sync,

§

impl<'a, 'b, K, Q: ?Sized, V, S, A> Unpin for VacantEntryRef<'a, 'b, K, Q, V, S, A>
where + K: Unpin,

§

impl<'a, 'b, K, Q, V, S, A = Global> !UnwindSafe for VacantEntryRef<'a, 'b, K, Q, V, S, A>

Blanket Implementations§

source§

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

source§

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more
source§

impl<T> Borrow<T> for T
where + T: ?Sized,

source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
source§

impl<T> BorrowMut<T> for T
where + 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 T
where + 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 T
where + 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 T
where + 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/hashbrown/hash_map/struct.Values.html b/hashbrown/hash_map/struct.Values.html new file mode 100644 index 0000000000..da253b94c7 --- /dev/null +++ b/hashbrown/hash_map/struct.Values.html @@ -0,0 +1,220 @@ +Values in hashbrown::hash_map - Rust
+

Struct hashbrown::hash_map::Values

source · 
pub struct Values<'a, K, V> { /* private fields */ }
Expand description

An iterator over the values of a HashMap in arbitrary order. +The iterator element type is &'a V.

+

This struct is created by the values method on HashMap. See its +documentation for more.

+

§Examples

+
use hashbrown::HashMap;
+
+let map: HashMap<_, _> = [(1, "a"), (2, "b"), (3, "c")].into();
+
+let mut values = map.values();
+let mut vec = vec![values.next(), values.next(), values.next()];
+
+// The `Values` iterator produces values in arbitrary order, so the
+// values must be sorted to test them against a sorted array.
+vec.sort_unstable();
+assert_eq!(vec, [Some(&"a"), Some(&"b"), Some(&"c")]);
+
+// It is fused iterator
+assert_eq!(values.next(), None);
+assert_eq!(values.next(), None);
+

Trait Implementations§

source§

impl<K, V> Clone for Values<'_, K, V>

source§

fn clone(&self) -> Self

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<K, V: Debug> Debug for Values<'_, K, V>

source§

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

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

impl<K, V> ExactSizeIterator for Values<'_, K, V>

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, K, V> Iterator for Values<'a, K, V>

§

type Item = &'a V

The type of the elements being iterated over.
source§

fn next(&mut self) -> Option<&'a V>

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 fold<B, F>(self, init: B, f: F) -> B
where + Self: Sized, + F: FnMut(B, Self::Item) -> B,

Folds every element into an accumulator by applying an operation, +returning the final result. 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) -> usize
where + 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<(), NonZero<usize>>

🔬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 Self
where + Self: Sized,

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

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

Transforms an iterator into a collection. Read more
source§

fn collect_into<E>(self, collection: &mut E) -> &mut E
where + 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) -> bool
where + 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) -> R
where + 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) -> R
where + 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.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>>>::TryType
where + 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) -> bool
where + 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) -> bool
where + 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>>>::TryType
where + 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
1.0.0 · source§

fn cycle(self) -> Cycle<Self>
where + Self: Sized + Clone,

Repeats an iterator endlessly. 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) -> S
where + Self: Sized, + S: Sum<Self::Item>,

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

fn product<P>(self) -> P
where + 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) -> Ordering
where + 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) -> bool
where + 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) -> bool
where + 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) -> bool
where + 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) -> bool
where + 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) -> bool
where + 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) -> bool
where + 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) -> bool
where + 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) -> bool
where + Self: Sized, + F: FnMut(&Self::Item, &Self::Item) -> bool,

🔬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) -> bool
where + 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<K, V> FusedIterator for Values<'_, K, V>

Auto Trait Implementations§

§

impl<'a, K, V> Freeze for Values<'a, K, V>

§

impl<'a, K, V> RefUnwindSafe for Values<'a, K, V>
where + K: RefUnwindSafe, + V: RefUnwindSafe,

§

impl<'a, K, V> Send for Values<'a, K, V>
where + K: Sync, + V: Sync,

§

impl<'a, K, V> Sync for Values<'a, K, V>
where + K: Sync, + V: Sync,

§

impl<'a, K, V> Unpin for Values<'a, K, V>

§

impl<'a, K, V> UnwindSafe for Values<'a, K, V>
where + K: RefUnwindSafe, + V: RefUnwindSafe,

Blanket Implementations§

source§

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

source§

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more
source§

impl<T> Borrow<T> for T
where + T: ?Sized,

source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
source§

impl<T> BorrowMut<T> for T
where + 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 T
where + 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 I
where + 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> ToOwned for T
where + 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 T
where + 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 T
where + 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/hashbrown/hash_map/struct.ValuesMut.html b/hashbrown/hash_map/struct.ValuesMut.html new file mode 100644 index 0000000000..e51eb010f3 --- /dev/null +++ b/hashbrown/hash_map/struct.ValuesMut.html @@ -0,0 +1,215 @@ +ValuesMut in hashbrown::hash_map - Rust
+

Struct hashbrown::hash_map::ValuesMut

source · 
pub struct ValuesMut<'a, K, V> { /* private fields */ }
Expand description

A mutable iterator over the values of a HashMap in arbitrary order. +The iterator element type is &'a mut V.

+

This struct is created by the values_mut method on HashMap. See its +documentation for more.

+

§Examples

+
use hashbrown::HashMap;
+
+let mut map: HashMap<_, _> = [(1, "One".to_owned()), (2, "Two".into())].into();
+
+let mut values = map.values_mut();
+values.next().map(|v| v.push_str(" Mississippi"));
+values.next().map(|v| v.push_str(" Mississippi"));
+
+// It is fused iterator
+assert_eq!(values.next(), None);
+assert_eq!(values.next(), None);
+
+assert_eq!(map.get(&1).unwrap(), &"One Mississippi".to_owned());
+assert_eq!(map.get(&2).unwrap(), &"Two Mississippi".to_owned());
+

Trait Implementations§

source§

impl<K, V: Debug> Debug for ValuesMut<'_, K, V>

source§

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

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

impl<K, V> ExactSizeIterator for ValuesMut<'_, K, V>

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, K, V> Iterator for ValuesMut<'a, K, V>

§

type Item = &'a mut V

The type of the elements being iterated over.
source§

fn next(&mut self) -> Option<&'a mut V>

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 fold<B, F>(self, init: B, f: F) -> B
where + Self: Sized, + F: FnMut(B, Self::Item) -> B,

Folds every element into an accumulator by applying an operation, +returning the final result. 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) -> usize
where + 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<(), NonZero<usize>>

🔬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 Self
where + Self: Sized,

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

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

Transforms an iterator into a collection. Read more
source§

fn collect_into<E>(self, collection: &mut E) -> &mut E
where + 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) -> bool
where + 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) -> R
where + 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) -> R
where + 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.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>>>::TryType
where + 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) -> bool
where + 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) -> bool
where + 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>>>::TryType
where + 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) -> S
where + Self: Sized, + S: Sum<Self::Item>,

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

fn product<P>(self) -> P
where + 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) -> Ordering
where + 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) -> bool
where + 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) -> bool
where + 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) -> bool
where + 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) -> bool
where + 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) -> bool
where + 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) -> bool
where + 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) -> bool
where + 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) -> bool
where + Self: Sized, + F: FnMut(&Self::Item, &Self::Item) -> bool,

🔬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) -> bool
where + 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<K, V> FusedIterator for ValuesMut<'_, K, V>

Auto Trait Implementations§

§

impl<'a, K, V> Freeze for ValuesMut<'a, K, V>

§

impl<'a, K, V> RefUnwindSafe for ValuesMut<'a, K, V>
where + K: RefUnwindSafe, + V: RefUnwindSafe,

§

impl<'a, K, V> Send for ValuesMut<'a, K, V>
where + K: Send, + V: Send,

§

impl<'a, K, V> Sync for ValuesMut<'a, K, V>
where + K: Sync, + V: Sync,

§

impl<'a, K, V> Unpin for ValuesMut<'a, K, V>

§

impl<'a, K, V> !UnwindSafe for ValuesMut<'a, K, V>

Blanket Implementations§

source§

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

source§

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more
source§

impl<T> Borrow<T> for T
where + T: ?Sized,

source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
source§

impl<T> BorrowMut<T> for T
where + 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 T
where + 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 I
where + 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, U> TryFrom<U> for T
where + 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 T
where + 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/hashbrown/hash_set/enum.Entry.html b/hashbrown/hash_set/enum.Entry.html new file mode 100644 index 0000000000..9c893d4b8b --- /dev/null +++ b/hashbrown/hash_set/enum.Entry.html @@ -0,0 +1,109 @@ +Entry in hashbrown::hash_set - Rust
+

Enum hashbrown::hash_set::Entry

source · 
pub enum Entry<'a, T, S, A = Global>
where
+    A: Allocator,
{
+    Occupied(OccupiedEntry<'a, T, S, A>),
+    Vacant(VacantEntry<'a, T, S, A>),
+}
Expand description

A view into a single entry in a set, which may either be vacant or occupied.

+

This enum is constructed from the entry method on HashSet.

+

§Examples

+
use hashbrown::hash_set::{Entry, HashSet, OccupiedEntry};
+
+let mut set = HashSet::new();
+set.extend(["a", "b", "c"]);
+assert_eq!(set.len(), 3);
+
+// Existing value (insert)
+let entry: Entry<_, _> = set.entry("a");
+let _raw_o: OccupiedEntry<_, _> = entry.insert();
+assert_eq!(set.len(), 3);
+// Nonexistent value (insert)
+set.entry("d").insert();
+
+// Existing value (or_insert)
+set.entry("b").or_insert();
+// Nonexistent value (or_insert)
+set.entry("e").or_insert();
+
+println!("Our HashSet: {:?}", set);
+
+let mut vec: Vec<_> = set.iter().copied().collect();
+// The `Iter` iterator produces items in arbitrary order, so the
+// items must be sorted to test them against a sorted array.
+vec.sort_unstable();
+assert_eq!(vec, ["a", "b", "c", "d", "e"]);
+

Variants§

§

Occupied(OccupiedEntry<'a, T, S, A>)

An occupied entry.

+

§Examples

+
use hashbrown::hash_set::{Entry, HashSet};
+let mut set: HashSet<_> = ["a", "b"].into();
+
+match set.entry("a") {
+    Entry::Vacant(_) => unreachable!(),
+    Entry::Occupied(_) => { }
+}
+
§

Vacant(VacantEntry<'a, T, S, A>)

A vacant entry.

+

§Examples

+
use hashbrown::hash_set::{Entry, HashSet};
+let mut set: HashSet<&str> = HashSet::new();
+
+match set.entry("a") {
+    Entry::Occupied(_) => unreachable!(),
+    Entry::Vacant(_) => { }
+}
+

Implementations§

source§

impl<'a, T, S, A: Allocator> Entry<'a, T, S, A>

source

pub fn insert(self) -> OccupiedEntry<'a, T, S, A>
where + T: Hash, + S: BuildHasher,

Sets the value of the entry, and returns an OccupiedEntry.

+
§Examples
+
use hashbrown::HashSet;
+
+let mut set: HashSet<&str> = HashSet::new();
+let entry = set.entry("horseyland").insert();
+
+assert_eq!(entry.get(), &"horseyland");
+
source

pub fn or_insert(self)
where + T: Hash, + S: BuildHasher,

Ensures a value is in the entry by inserting if it was vacant.

+
§Examples
+
use hashbrown::HashSet;
+
+let mut set: HashSet<&str> = HashSet::new();
+
+// nonexistent key
+set.entry("poneyland").or_insert();
+assert!(set.contains("poneyland"));
+
+// existing key
+set.entry("poneyland").or_insert();
+assert!(set.contains("poneyland"));
+assert_eq!(set.len(), 1);
+
source

pub fn get(&self) -> &T

Returns a reference to this entry’s value.

+
§Examples
+
use hashbrown::HashSet;
+
+let mut set: HashSet<&str> = HashSet::new();
+set.entry("poneyland").or_insert();
+// existing key
+assert_eq!(set.entry("poneyland").get(), &"poneyland");
+// nonexistent key
+assert_eq!(set.entry("horseland").get(), &"horseland");
+

Trait Implementations§

source§

impl<T: Debug, S, A: Allocator> Debug for Entry<'_, T, S, A>

source§

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

Formats the value using the given formatter. Read more

Auto Trait Implementations§

§

impl<'a, T, S, A> Freeze for Entry<'a, T, S, A>
where + T: Freeze,

§

impl<'a, T, S, A> RefUnwindSafe for Entry<'a, T, S, A>
where + A: RefUnwindSafe, + S: RefUnwindSafe, + T: RefUnwindSafe,

§

impl<'a, T, S, A> Send for Entry<'a, T, S, A>
where + A: Send, + S: Send, + T: Send,

§

impl<'a, T, S, A> Sync for Entry<'a, T, S, A>
where + A: Sync, + S: Sync, + T: Sync,

§

impl<'a, T, S, A> Unpin for Entry<'a, T, S, A>
where + T: Unpin,

§

impl<'a, T, S, A = Global> !UnwindSafe for Entry<'a, T, S, A>

Blanket Implementations§

source§

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

source§

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more
source§

impl<T> Borrow<T> for T
where + T: ?Sized,

source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
source§

impl<T> BorrowMut<T> for T
where + 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 T
where + 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 T
where + 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 T
where + 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/hashbrown/hash_set/index.html b/hashbrown/hash_set/index.html new file mode 100644 index 0000000000..522a1c4f87 --- /dev/null +++ b/hashbrown/hash_set/index.html @@ -0,0 +1,5 @@ +hashbrown::hash_set - Rust
+

Module hashbrown::hash_set

source ·
Expand description

A hash set implemented as a HashMap where the value is ().

+

Structs§

  • Difference
    A lazy iterator producing elements in the difference of HashSets.
  • Drain
    A draining iterator over the items of a HashSet.
  • ExtractIf
    A draining iterator over entries of a HashSet which don’t satisfy the predicate f.
  • HashSet
    A hash set implemented as a HashMap where the value is ().
  • Intersection
    A lazy iterator producing elements in the intersection of HashSets.
  • IntoIter
    An owning iterator over the items of a HashSet.
  • Iter
    An iterator over the items of a HashSet.
  • OccupiedEntry
    A view into an occupied entry in a HashSet. +It is part of the Entry enum.
  • SymmetricDifference
    A lazy iterator producing elements in the symmetric difference of HashSets.
  • Union
    A lazy iterator producing elements in the union of HashSets.
  • VacantEntry
    A view into a vacant entry in a HashSet. +It is part of the Entry enum.

Enums§

  • Entry
    A view into a single entry in a set, which may either be vacant or occupied.
\ No newline at end of file diff --git a/hashbrown/hash_set/sidebar-items.js b/hashbrown/hash_set/sidebar-items.js new file mode 100644 index 0000000000..cc309fcd90 --- /dev/null +++ b/hashbrown/hash_set/sidebar-items.js @@ -0,0 +1 @@ +window.SIDEBAR_ITEMS = {"enum":["Entry"],"struct":["Difference","Drain","ExtractIf","HashSet","Intersection","IntoIter","Iter","OccupiedEntry","SymmetricDifference","Union","VacantEntry"]}; \ No newline at end of file diff --git a/hashbrown/hash_set/struct.Difference.html b/hashbrown/hash_set/struct.Difference.html new file mode 100644 index 0000000000..48c1dc42fd --- /dev/null +++ b/hashbrown/hash_set/struct.Difference.html @@ -0,0 +1,216 @@ +Difference in hashbrown::hash_set - Rust
+

Struct hashbrown::hash_set::Difference

source · 
pub struct Difference<'a, T, S, A: Allocator = Global> { /* private fields */ }
Expand description

A lazy iterator producing elements in the difference of HashSets.

+

This struct is created by the difference method on HashSet. +See its documentation for more.

+

Trait Implementations§

source§

impl<T, S, A: Allocator> Clone for Difference<'_, T, S, A>

source§

fn clone(&self) -> Self

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<T, S, A> Debug for Difference<'_, T, S, A>
where + T: Debug + Eq + Hash, + S: BuildHasher, + A: Allocator,

source§

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

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

impl<'a, T, S, A> Iterator for Difference<'a, T, S, A>
where + T: Eq + Hash, + S: BuildHasher, + A: Allocator,

§

type Item = &'a T

The type of the elements being iterated over.
source§

fn next(&mut self) -> Option<&'a T>

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 fold<B, F>(self, init: B, f: F) -> B
where + Self: Sized, + F: FnMut(B, Self::Item) -> B,

Folds every element into an accumulator by applying an operation, +returning the final result. 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) -> usize
where + 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<(), NonZero<usize>>

🔬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 Self
where + Self: Sized,

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

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

Transforms an iterator into a collection. Read more
source§

fn collect_into<E>(self, collection: &mut E) -> &mut E
where + 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) -> bool
where + 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) -> R
where + 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) -> R
where + 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.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>>>::TryType
where + 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) -> bool
where + 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) -> bool
where + 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>>>::TryType
where + 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
1.0.0 · source§

fn cycle(self) -> Cycle<Self>
where + Self: Sized + Clone,

Repeats an iterator endlessly. 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) -> S
where + Self: Sized, + S: Sum<Self::Item>,

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

fn product<P>(self) -> P
where + 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) -> Ordering
where + 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) -> bool
where + 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) -> bool
where + 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) -> bool
where + 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) -> bool
where + 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) -> bool
where + 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) -> bool
where + 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) -> bool
where + 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) -> bool
where + Self: Sized, + F: FnMut(&Self::Item, &Self::Item) -> bool,

🔬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) -> bool
where + 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<T, S, A> FusedIterator for Difference<'_, T, S, A>
where + T: Eq + Hash, + S: BuildHasher, + A: Allocator,

Auto Trait Implementations§

§

impl<'a, T, S, A> Freeze for Difference<'a, T, S, A>

§

impl<'a, T, S, A> RefUnwindSafe for Difference<'a, T, S, A>
where + A: RefUnwindSafe, + S: RefUnwindSafe, + T: RefUnwindSafe,

§

impl<'a, T, S, A> Send for Difference<'a, T, S, A>
where + A: Sync, + S: Sync, + T: Sync,

§

impl<'a, T, S, A> Sync for Difference<'a, T, S, A>
where + A: Sync, + S: Sync, + T: Sync,

§

impl<'a, T, S, A> Unpin for Difference<'a, T, S, A>

§

impl<'a, T, S, A> UnwindSafe for Difference<'a, T, S, A>
where + A: RefUnwindSafe, + S: RefUnwindSafe, + T: RefUnwindSafe,

Blanket Implementations§

source§

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

source§

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more
source§

impl<T> Borrow<T> for T
where + T: ?Sized,

source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
source§

impl<T> BorrowMut<T> for T
where + 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 T
where + 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 I
where + 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> ToOwned for T
where + 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 T
where + 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 T
where + 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/hashbrown/hash_set/struct.Drain.html b/hashbrown/hash_set/struct.Drain.html new file mode 100644 index 0000000000..881c072af6 --- /dev/null +++ b/hashbrown/hash_set/struct.Drain.html @@ -0,0 +1,201 @@ +Drain in hashbrown::hash_set - Rust
+

Struct hashbrown::hash_set::Drain

source · 
pub struct Drain<'a, K, A: Allocator = Global> { /* private fields */ }
Expand description

A draining iterator over the items of a HashSet.

+

This struct is created by the drain method on HashSet. +See its documentation for more.

+

Trait Implementations§

source§

impl<K: Debug, A: Allocator> Debug for Drain<'_, K, A>

source§

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

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

impl<K, A: Allocator> ExactSizeIterator for Drain<'_, K, A>

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<K, A: Allocator> Iterator for Drain<'_, K, A>

§

type Item = K

The type of the elements being iterated over.
source§

fn next(&mut self) -> Option<K>

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 fold<B, F>(self, init: B, f: F) -> B
where + Self: Sized, + F: FnMut(B, Self::Item) -> B,

Folds every element into an accumulator by applying an operation, +returning the final result. 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) -> usize
where + 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<(), NonZero<usize>>

🔬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 Self
where + Self: Sized,

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

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

Transforms an iterator into a collection. Read more
source§

fn collect_into<E>(self, collection: &mut E) -> &mut E
where + 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) -> bool
where + 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) -> R
where + 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) -> R
where + 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.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>>>::TryType
where + 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) -> bool
where + 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) -> bool
where + 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>>>::TryType
where + 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) -> S
where + Self: Sized, + S: Sum<Self::Item>,

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

fn product<P>(self) -> P
where + 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) -> Ordering
where + 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) -> bool
where + 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) -> bool
where + 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) -> bool
where + 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) -> bool
where + 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) -> bool
where + 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) -> bool
where + 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) -> bool
where + 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) -> bool
where + Self: Sized, + F: FnMut(&Self::Item, &Self::Item) -> bool,

🔬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) -> bool
where + 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<K, A: Allocator> FusedIterator for Drain<'_, K, A>

Auto Trait Implementations§

§

impl<'a, K, A> Freeze for Drain<'a, K, A>

§

impl<'a, K, A> RefUnwindSafe for Drain<'a, K, A>
where + A: RefUnwindSafe, + K: RefUnwindSafe,

§

impl<'a, K, A> Send for Drain<'a, K, A>
where + A: Send, + K: Send,

§

impl<'a, K, A> Sync for Drain<'a, K, A>
where + A: Sync, + K: Sync,

§

impl<'a, K, A> Unpin for Drain<'a, K, A>

§

impl<'a, K, A> UnwindSafe for Drain<'a, K, A>
where + A: RefUnwindSafe, + K: RefUnwindSafe,

Blanket Implementations§

source§

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

source§

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more
source§

impl<T> Borrow<T> for T
where + T: ?Sized,

source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
source§

impl<T> BorrowMut<T> for T
where + 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 T
where + 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 I
where + 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, U> TryFrom<U> for T
where + 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 T
where + 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/hashbrown/hash_set/struct.ExtractIf.html b/hashbrown/hash_set/struct.ExtractIf.html new file mode 100644 index 0000000000..04819b3b09 --- /dev/null +++ b/hashbrown/hash_set/struct.ExtractIf.html @@ -0,0 +1,207 @@ +ExtractIf in hashbrown::hash_set - Rust
+

Struct hashbrown::hash_set::ExtractIf

source · 
pub struct ExtractIf<'a, K, F, A: Allocator = Global>
where
+    F: FnMut(&K) -> bool,
{ /* private fields */ }
Expand description

A draining iterator over entries of a HashSet which don’t satisfy the predicate f.

+

This struct is created by the extract_if method on HashSet. See its +documentation for more.

+

Trait Implementations§

source§

impl<K, F, A: Allocator> Iterator for ExtractIf<'_, K, F, A>
where + F: FnMut(&K) -> bool,

§

type Item = K

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) -> usize
where + 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<(), NonZero<usize>>

🔬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 Self
where + Self: Sized,

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

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

Transforms an iterator into a collection. Read more
source§

fn collect_into<E>(self, collection: &mut E) -> &mut E
where + 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) -> bool
where + 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) -> R
where + 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) -> R
where + 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) -> B
where + 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>>>::TryType
where + 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) -> bool
where + 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) -> bool
where + 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>>>::TryType
where + 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) -> S
where + Self: Sized, + S: Sum<Self::Item>,

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

fn product<P>(self) -> P
where + 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) -> Ordering
where + 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) -> bool
where + 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) -> bool
where + 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) -> bool
where + 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) -> bool
where + 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) -> bool
where + 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) -> bool
where + 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) -> bool
where + 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) -> bool
where + Self: Sized, + F: FnMut(&Self::Item, &Self::Item) -> bool,

🔬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) -> bool
where + 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<K, F, A: Allocator> FusedIterator for ExtractIf<'_, K, F, A>
where + F: FnMut(&K) -> bool,

Auto Trait Implementations§

§

impl<'a, K, F, A> Freeze for ExtractIf<'a, K, F, A>
where + F: Freeze,

§

impl<'a, K, F, A> RefUnwindSafe for ExtractIf<'a, K, F, A>
where + A: RefUnwindSafe, + F: RefUnwindSafe, + K: RefUnwindSafe,

§

impl<'a, K, F, A> Send for ExtractIf<'a, K, F, A>
where + A: Send, + F: Send, + K: Send,

§

impl<'a, K, F, A> Sync for ExtractIf<'a, K, F, A>
where + A: Sync, + F: Sync, + K: Sync,

§

impl<'a, K, F, A> Unpin for ExtractIf<'a, K, F, A>
where + F: Unpin,

§

impl<'a, K, F, A = Global> !UnwindSafe for ExtractIf<'a, K, F, A>

Blanket Implementations§

source§

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

source§

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more
source§

impl<T> Borrow<T> for T
where + T: ?Sized,

source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
source§

impl<T> BorrowMut<T> for T
where + 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 T
where + 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 I
where + 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, U> TryFrom<U> for T
where + 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 T
where + 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/hashbrown/hash_set/struct.HashSet.html b/hashbrown/hash_set/struct.HashSet.html new file mode 100644 index 0000000000..2366f69dd6 --- /dev/null +++ b/hashbrown/hash_set/struct.HashSet.html @@ -0,0 +1,715 @@ +HashSet in hashbrown::hash_set - Rust
+

Struct hashbrown::hash_set::HashSet

source · 
pub struct HashSet<T, S = DefaultHashBuilder, A: Allocator = Global> { /* private fields */ }
Expand description

A hash set implemented as a HashMap where the value is ().

+

As with the HashMap type, a HashSet requires that the elements +implement the Eq and Hash traits. This can frequently be achieved by +using #[derive(PartialEq, Eq, Hash)]. If you implement these yourself, +it is important that the following property holds:

+
k1 == k2 -> hash(k1) == hash(k2)
+
+

In other words, if two keys are equal, their hashes must be equal.

+

It is a logic error for an item to be modified in such a way that the +item’s hash, as determined by the Hash trait, or its equality, as +determined by the Eq trait, changes while it is in the set. This is +normally only possible through Cell, RefCell, global state, I/O, or +unsafe code.

+

It is also a logic error for the Hash implementation of a key to panic. +This is generally only possible if the trait is implemented manually. If a +panic does occur then the contents of the HashSet may become corrupted and +some items may be dropped from the table.

+

§Examples

+
use hashbrown::HashSet;
+// Type inference lets us omit an explicit type signature (which
+// would be `HashSet<String>` in this example).
+let mut books = HashSet::new();
+
+// Add some books.
+books.insert("A Dance With Dragons".to_string());
+books.insert("To Kill a Mockingbird".to_string());
+books.insert("The Odyssey".to_string());
+books.insert("The Great Gatsby".to_string());
+
+// Check for a specific one.
+if !books.contains("The Winds of Winter") {
+    println!("We have {} books, but The Winds of Winter ain't one.",
+             books.len());
+}
+
+// Remove a book.
+books.remove("The Odyssey");
+
+// Iterate over everything.
+for book in &books {
+    println!("{}", book);
+}
+

The easiest way to use HashSet with a custom type is to derive +Eq and Hash. We must also derive PartialEq. This will in the +future be implied by Eq.

+ +
use hashbrown::HashSet;
+#[derive(Hash, Eq, PartialEq, Debug)]
+struct Viking {
+    name: String,
+    power: usize,
+}
+
+let mut vikings = HashSet::new();
+
+vikings.insert(Viking { name: "Einar".to_string(), power: 9 });
+vikings.insert(Viking { name: "Einar".to_string(), power: 9 });
+vikings.insert(Viking { name: "Olaf".to_string(), power: 4 });
+vikings.insert(Viking { name: "Harald".to_string(), power: 8 });
+
+// Use derived implementation to print the vikings.
+for x in &vikings {
+    println!("{:?}", x);
+}
+

A HashSet with fixed list of elements can be initialized from an array:

+ +
use hashbrown::HashSet;
+
+let viking_names: HashSet<&'static str> =
+    [ "Einar", "Olaf", "Harald" ].into_iter().collect();
+// use the values stored in the set
+

Implementations§

source§

impl<T, S, A: Allocator> HashSet<T, S, A>

source

pub fn capacity(&self) -> usize

Returns the number of elements the set can hold without reallocating.

+
§Examples
+
use hashbrown::HashSet;
+let set: HashSet<i32> = HashSet::with_capacity(100);
+assert!(set.capacity() >= 100);
+
source

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

An iterator visiting all elements in arbitrary order. +The iterator element type is &'a T.

+
§Examples
+
use hashbrown::HashSet;
+let mut set = HashSet::new();
+set.insert("a");
+set.insert("b");
+
+// Will print in an arbitrary order.
+for x in set.iter() {
+    println!("{}", x);
+}
+
source

pub fn len(&self) -> usize

Returns the number of elements in the set.

+
§Examples
+
use hashbrown::HashSet;
+
+let mut v = HashSet::new();
+assert_eq!(v.len(), 0);
+v.insert(1);
+assert_eq!(v.len(), 1);
+
source

pub fn is_empty(&self) -> bool

Returns true if the set contains no elements.

+
§Examples
+
use hashbrown::HashSet;
+
+let mut v = HashSet::new();
+assert!(v.is_empty());
+v.insert(1);
+assert!(!v.is_empty());
+
source

pub fn drain(&mut self) -> Drain<'_, T, A> ⓘ

Clears the set, returning all elements in an iterator.

+
§Examples
+
use hashbrown::HashSet;
+
+let mut set: HashSet<_> = [1, 2, 3].into_iter().collect();
+assert!(!set.is_empty());
+
+// print 1, 2, 3 in an arbitrary order
+for i in set.drain() {
+    println!("{}", i);
+}
+
+assert!(set.is_empty());
+
source

pub fn retain<F>(&mut self, f: F)
where + F: FnMut(&T) -> bool,

Retains only the elements specified by the predicate.

+

In other words, remove all elements e such that f(&e) returns false.

+
§Examples
+
use hashbrown::HashSet;
+
+let xs = [1,2,3,4,5,6];
+let mut set: HashSet<i32> = xs.into_iter().collect();
+set.retain(|&k| k % 2 == 0);
+assert_eq!(set.len(), 3);
+
source

pub fn extract_if<F>(&mut self, f: F) -> ExtractIf<'_, T, F, A> ⓘ
where + F: FnMut(&T) -> bool,

Drains elements which are true under the given predicate, +and returns an iterator over the removed items.

+

In other words, move all elements e such that f(&e) returns true out +into another iterator.

+

If the returned ExtractIf is not exhausted, e.g. because it is dropped without iterating +or the iteration short-circuits, then the remaining elements will be retained. +Use retain() with a negated predicate if you do not need the returned iterator.

+
§Examples
+
use hashbrown::HashSet;
+
+let mut set: HashSet<i32> = (0..8).collect();
+let drained: HashSet<i32> = set.extract_if(|v| v % 2 == 0).collect();
+
+let mut evens = drained.into_iter().collect::<Vec<_>>();
+let mut odds = set.into_iter().collect::<Vec<_>>();
+evens.sort();
+odds.sort();
+
+assert_eq!(evens, vec![0, 2, 4, 6]);
+assert_eq!(odds, vec![1, 3, 5, 7]);
+
source

pub fn clear(&mut self)

Clears the set, removing all values.

+
§Examples
+
use hashbrown::HashSet;
+
+let mut v = HashSet::new();
+v.insert(1);
+v.clear();
+assert!(v.is_empty());
+
source§

impl<T, S> HashSet<T, S, Global>

source

pub const fn with_hasher(hasher: S) -> Self

Creates a new empty hash set which will use the given hasher to hash +keys.

+

The hash set is initially created with a capacity of 0, so it will not +allocate until it is first inserted into.

+
§HashDoS resistance
+

The hash_builder normally use a fixed key by default and that does +not allow the HashSet to be protected against attacks such as HashDoS. +Users who require HashDoS resistance should explicitly use +[ahash::RandomState] or std::collections::hash_map::RandomState +as the hasher when creating a HashSet.

+

The hash_builder passed should implement the BuildHasher trait for +the HashSet to be useful, see its documentation for details.

+
§Examples
+
use hashbrown::HashSet;
+use hashbrown::hash_map::DefaultHashBuilder;
+
+let s = DefaultHashBuilder::default();
+let mut set = HashSet::with_hasher(s);
+set.insert(2);
+
source

pub fn with_capacity_and_hasher(capacity: usize, hasher: S) -> Self

Creates an empty HashSet with the specified capacity, using +hasher to hash the keys.

+

The hash set will be able to hold at least capacity elements without +reallocating. If capacity is 0, the hash set will not allocate.

+
§HashDoS resistance
+

The hash_builder normally use a fixed key by default and that does +not allow the HashSet to be protected against attacks such as HashDoS. +Users who require HashDoS resistance should explicitly use +[ahash::RandomState] or std::collections::hash_map::RandomState +as the hasher when creating a HashSet.

+

The hash_builder passed should implement the BuildHasher trait for +the HashSet to be useful, see its documentation for details.

+
§Examples
+
use hashbrown::HashSet;
+use hashbrown::hash_map::DefaultHashBuilder;
+
+let s = DefaultHashBuilder::default();
+let mut set = HashSet::with_capacity_and_hasher(10, s);
+set.insert(1);
+
source§

impl<T, S, A> HashSet<T, S, A>
where + A: Allocator,

source

pub fn allocator(&self) -> &A

Returns a reference to the underlying allocator.

+
source

pub const fn with_hasher_in(hasher: S, alloc: A) -> Self

Creates a new empty hash set which will use the given hasher to hash +keys.

+

The hash set is initially created with a capacity of 0, so it will not +allocate until it is first inserted into.

+
§HashDoS resistance
+

The hash_builder normally use a fixed key by default and that does +not allow the HashSet to be protected against attacks such as HashDoS. +Users who require HashDoS resistance should explicitly use +[ahash::RandomState] or std::collections::hash_map::RandomState +as the hasher when creating a HashSet.

+

The hash_builder passed should implement the BuildHasher trait for +the HashSet to be useful, see its documentation for details.

+
§Examples
+
use hashbrown::HashSet;
+use hashbrown::hash_map::DefaultHashBuilder;
+
+let s = DefaultHashBuilder::default();
+let mut set = HashSet::with_hasher(s);
+set.insert(2);
+
source

pub fn with_capacity_and_hasher_in(capacity: usize, hasher: S, alloc: A) -> Self

Creates an empty HashSet with the specified capacity, using +hasher to hash the keys.

+

The hash set will be able to hold at least capacity elements without +reallocating. If capacity is 0, the hash set will not allocate.

+
§HashDoS resistance
+

The hash_builder normally use a fixed key by default and that does +not allow the HashSet to be protected against attacks such as HashDoS. +Users who require HashDoS resistance should explicitly use +[ahash::RandomState] or std::collections::hash_map::RandomState +as the hasher when creating a HashSet.

+

The hash_builder passed should implement the BuildHasher trait for +the HashSet to be useful, see its documentation for details.

+
§Examples
+
use hashbrown::HashSet;
+use hashbrown::hash_map::DefaultHashBuilder;
+
+let s = DefaultHashBuilder::default();
+let mut set = HashSet::with_capacity_and_hasher(10, s);
+set.insert(1);
+
source

pub fn hasher(&self) -> &S

Returns a reference to the set’s BuildHasher.

+
§Examples
+
use hashbrown::HashSet;
+use hashbrown::hash_map::DefaultHashBuilder;
+
+let hasher = DefaultHashBuilder::default();
+let set: HashSet<i32> = HashSet::with_hasher(hasher);
+let hasher: &DefaultHashBuilder = set.hasher();
+
source§

impl<T, S, A> HashSet<T, S, A>
where + T: Eq + Hash, + S: BuildHasher, + A: Allocator,

source

pub fn reserve(&mut self, additional: usize)

Reserves capacity for at least additional more elements to be inserted +in the HashSet. The collection may reserve more space to avoid +frequent reallocations.

+
§Panics
+

Panics if the new capacity exceeds isize::MAX bytes and abort the program +in case of allocation error. Use try_reserve instead +if you want to handle memory allocation failure.

+
§Examples
+
use hashbrown::HashSet;
+let mut set: HashSet<i32> = HashSet::new();
+set.reserve(10);
+assert!(set.capacity() >= 10);
+
source

pub fn try_reserve(&mut self, additional: usize) -> Result<(), TryReserveError>

Tries to reserve capacity for at least additional more elements to be inserted +in the given HashSet<K,V>. The collection may reserve more space to avoid +frequent reallocations.

+
§Errors
+

If the capacity overflows, or the allocator reports a failure, then an error +is returned.

+
§Examples
+
use hashbrown::HashSet;
+let mut set: HashSet<i32> = HashSet::new();
+set.try_reserve(10).expect("why is the test harness OOMing on 10 bytes?");
+
source

pub fn shrink_to_fit(&mut self)

Shrinks the capacity of the set as much as possible. It will drop +down as much as possible while maintaining the internal rules +and possibly leaving some space in accordance with the resize policy.

+
§Examples
+
use hashbrown::HashSet;
+
+let mut set = HashSet::with_capacity(100);
+set.insert(1);
+set.insert(2);
+assert!(set.capacity() >= 100);
+set.shrink_to_fit();
+assert!(set.capacity() >= 2);
+
source

pub fn shrink_to(&mut self, min_capacity: usize)

Shrinks the capacity of the set with a lower limit. It will drop +down no lower than the supplied limit while maintaining the internal rules +and possibly leaving some space in accordance with the resize policy.

+

Panics if the current capacity is smaller than the supplied +minimum capacity.

+
§Examples
+
use hashbrown::HashSet;
+
+let mut set = HashSet::with_capacity(100);
+set.insert(1);
+set.insert(2);
+assert!(set.capacity() >= 100);
+set.shrink_to(10);
+assert!(set.capacity() >= 10);
+set.shrink_to(0);
+assert!(set.capacity() >= 2);
+
source

pub fn difference<'a>(&'a self, other: &'a Self) -> Difference<'a, T, S, A> ⓘ

Visits the values representing the difference, +i.e., the values that are in self but not in other.

+
§Examples
+
use hashbrown::HashSet;
+let a: HashSet<_> = [1, 2, 3].into_iter().collect();
+let b: HashSet<_> = [4, 2, 3, 4].into_iter().collect();
+
+// Can be seen as `a - b`.
+for x in a.difference(&b) {
+    println!("{}", x); // Print 1
+}
+
+let diff: HashSet<_> = a.difference(&b).collect();
+assert_eq!(diff, [1].iter().collect());
+
+// Note that difference is not symmetric,
+// and `b - a` means something else:
+let diff: HashSet<_> = b.difference(&a).collect();
+assert_eq!(diff, [4].iter().collect());
+
source

pub fn symmetric_difference<'a>( + &'a self, + other: &'a Self +) -> SymmetricDifference<'a, T, S, A> ⓘ

Visits the values representing the symmetric difference, +i.e., the values that are in self or in other but not in both.

+
§Examples
+
use hashbrown::HashSet;
+let a: HashSet<_> = [1, 2, 3].into_iter().collect();
+let b: HashSet<_> = [4, 2, 3, 4].into_iter().collect();
+
+// Print 1, 4 in arbitrary order.
+for x in a.symmetric_difference(&b) {
+    println!("{}", x);
+}
+
+let diff1: HashSet<_> = a.symmetric_difference(&b).collect();
+let diff2: HashSet<_> = b.symmetric_difference(&a).collect();
+
+assert_eq!(diff1, diff2);
+assert_eq!(diff1, [1, 4].iter().collect());
+
source

pub fn intersection<'a>(&'a self, other: &'a Self) -> Intersection<'a, T, S, A> ⓘ

Visits the values representing the intersection, +i.e., the values that are both in self and other.

+
§Examples
+
use hashbrown::HashSet;
+let a: HashSet<_> = [1, 2, 3].into_iter().collect();
+let b: HashSet<_> = [4, 2, 3, 4].into_iter().collect();
+
+// Print 2, 3 in arbitrary order.
+for x in a.intersection(&b) {
+    println!("{}", x);
+}
+
+let intersection: HashSet<_> = a.intersection(&b).collect();
+assert_eq!(intersection, [2, 3].iter().collect());
+
source

pub fn union<'a>(&'a self, other: &'a Self) -> Union<'a, T, S, A> ⓘ

Visits the values representing the union, +i.e., all the values in self or other, without duplicates.

+
§Examples
+
use hashbrown::HashSet;
+let a: HashSet<_> = [1, 2, 3].into_iter().collect();
+let b: HashSet<_> = [4, 2, 3, 4].into_iter().collect();
+
+// Print 1, 2, 3, 4 in arbitrary order.
+for x in a.union(&b) {
+    println!("{}", x);
+}
+
+let union: HashSet<_> = a.union(&b).collect();
+assert_eq!(union, [1, 2, 3, 4].iter().collect());
+
source

pub fn contains<Q>(&self, value: &Q) -> bool
where + Q: Hash + Equivalent<T> + ?Sized,

Returns true if the set contains a value.

+

The value may be any borrowed form of the set’s value type, but +Hash and Eq on the borrowed form must match those for +the value type.

+
§Examples
+
use hashbrown::HashSet;
+
+let set: HashSet<_> = [1, 2, 3].into_iter().collect();
+assert_eq!(set.contains(&1), true);
+assert_eq!(set.contains(&4), false);
+
source

pub fn get<Q>(&self, value: &Q) -> Option<&T>
where + Q: Hash + Equivalent<T> + ?Sized,

Returns a reference to the value in the set, if any, that is equal to the given value.

+

The value may be any borrowed form of the set’s value type, but +Hash and Eq on the borrowed form must match those for +the value type.

+
§Examples
+
use hashbrown::HashSet;
+
+let set: HashSet<_> = [1, 2, 3].into_iter().collect();
+assert_eq!(set.get(&2), Some(&2));
+assert_eq!(set.get(&4), None);
+
source

pub fn get_or_insert(&mut self, value: T) -> &T

Inserts the given value into the set if it is not present, then +returns a reference to the value in the set.

+
§Examples
+
use hashbrown::HashSet;
+
+let mut set: HashSet<_> = [1, 2, 3].into_iter().collect();
+assert_eq!(set.len(), 3);
+assert_eq!(set.get_or_insert(2), &2);
+assert_eq!(set.get_or_insert(100), &100);
+assert_eq!(set.len(), 4); // 100 was inserted
+
source

pub fn get_or_insert_owned<Q>(&mut self, value: &Q) -> &T
where + Q: Hash + Equivalent<T> + ToOwned<Owned = T> + ?Sized,

Inserts an owned copy of the given value into the set if it is not +present, then returns a reference to the value in the set.

+
§Examples
+
use hashbrown::HashSet;
+
+let mut set: HashSet<String> = ["cat", "dog", "horse"]
+    .iter().map(|&pet| pet.to_owned()).collect();
+
+assert_eq!(set.len(), 3);
+for &pet in &["cat", "dog", "fish"] {
+    let value = set.get_or_insert_owned(pet);
+    assert_eq!(value, pet);
+}
+assert_eq!(set.len(), 4); // a new "fish" was inserted
+
source

pub fn get_or_insert_with<Q, F>(&mut self, value: &Q, f: F) -> &T
where + Q: Hash + Equivalent<T> + ?Sized, + F: FnOnce(&Q) -> T,

Inserts a value computed from f into the set if the given value is +not present, then returns a reference to the value in the set.

+
§Examples
+
use hashbrown::HashSet;
+
+let mut set: HashSet<String> = ["cat", "dog", "horse"]
+    .iter().map(|&pet| pet.to_owned()).collect();
+
+assert_eq!(set.len(), 3);
+for &pet in &["cat", "dog", "fish"] {
+    let value = set.get_or_insert_with(pet, str::to_owned);
+    assert_eq!(value, pet);
+}
+assert_eq!(set.len(), 4); // a new "fish" was inserted
+
source

pub fn entry(&mut self, value: T) -> Entry<'_, T, S, A>

Gets the given value’s corresponding entry in the set for in-place manipulation.

+
§Examples
+
use hashbrown::HashSet;
+use hashbrown::hash_set::Entry::*;
+
+let mut singles = HashSet::new();
+let mut dupes = HashSet::new();
+
+for ch in "a short treatise on fungi".chars() {
+    if let Vacant(dupe_entry) = dupes.entry(ch) {
+        // We haven't already seen a duplicate, so
+        // check if we've at least seen it once.
+        match singles.entry(ch) {
+            Vacant(single_entry) => {
+                // We found a new character for the first time.
+                single_entry.insert()
+            }
+            Occupied(single_entry) => {
+                // We've already seen this once, "move" it to dupes.
+                single_entry.remove();
+                dupe_entry.insert();
+            }
+        }
+    }
+}
+
+assert!(!singles.contains(&'t') && dupes.contains(&'t'));
+assert!(singles.contains(&'u') && !dupes.contains(&'u'));
+assert!(!singles.contains(&'v') && !dupes.contains(&'v'));
+
source

pub fn is_disjoint(&self, other: &Self) -> bool

Returns true if self has no elements in common with other. +This is equivalent to checking for an empty intersection.

+
§Examples
+
use hashbrown::HashSet;
+
+let a: HashSet<_> = [1, 2, 3].into_iter().collect();
+let mut b = HashSet::new();
+
+assert_eq!(a.is_disjoint(&b), true);
+b.insert(4);
+assert_eq!(a.is_disjoint(&b), true);
+b.insert(1);
+assert_eq!(a.is_disjoint(&b), false);
+
source

pub fn is_subset(&self, other: &Self) -> bool

Returns true if the set is a subset of another, +i.e., other contains at least all the values in self.

+
§Examples
+
use hashbrown::HashSet;
+
+let sup: HashSet<_> = [1, 2, 3].into_iter().collect();
+let mut set = HashSet::new();
+
+assert_eq!(set.is_subset(&sup), true);
+set.insert(2);
+assert_eq!(set.is_subset(&sup), true);
+set.insert(4);
+assert_eq!(set.is_subset(&sup), false);
+
source

pub fn is_superset(&self, other: &Self) -> bool

Returns true if the set is a superset of another, +i.e., self contains at least all the values in other.

+
§Examples
+
use hashbrown::HashSet;
+
+let sub: HashSet<_> = [1, 2].into_iter().collect();
+let mut set = HashSet::new();
+
+assert_eq!(set.is_superset(&sub), false);
+
+set.insert(0);
+set.insert(1);
+assert_eq!(set.is_superset(&sub), false);
+
+set.insert(2);
+assert_eq!(set.is_superset(&sub), true);
+
source

pub fn insert(&mut self, value: T) -> bool

Adds a value to the set.

+

If the set did not have this value present, true is returned.

+

If the set did have this value present, false is returned.

+
§Examples
+
use hashbrown::HashSet;
+
+let mut set = HashSet::new();
+
+assert_eq!(set.insert(2), true);
+assert_eq!(set.insert(2), false);
+assert_eq!(set.len(), 1);
+
source

pub fn insert_unique_unchecked(&mut self, value: T) -> &T

Insert a value the set without checking if the value already exists in the set.

+

Returns a reference to the value just inserted.

+

This operation is safe if a value does not exist in the set.

+

However, if a value exists in the set already, the behavior is unspecified: +this operation may panic, loop forever, or any following operation with the set +may panic, loop forever or return arbitrary result.

+

That said, this operation (and following operations) are guaranteed to +not violate memory safety.

+

This operation is faster than regular insert, because it does not perform +lookup before insertion.

+

This operation is useful during initial population of the set. +For example, when constructing a set from another set, we know +that values are unique.

+
source

pub fn replace(&mut self, value: T) -> Option<T>

Adds a value to the set, replacing the existing value, if any, that is equal to the given +one. Returns the replaced value.

+
§Examples
+
use hashbrown::HashSet;
+
+let mut set = HashSet::new();
+set.insert(Vec::<i32>::new());
+
+assert_eq!(set.get(&[][..]).unwrap().capacity(), 0);
+set.replace(Vec::with_capacity(10));
+assert_eq!(set.get(&[][..]).unwrap().capacity(), 10);
+
source

pub fn remove<Q>(&mut self, value: &Q) -> bool
where + Q: Hash + Equivalent<T> + ?Sized,

Removes a value from the set. Returns whether the value was +present in the set.

+

The value may be any borrowed form of the set’s value type, but +Hash and Eq on the borrowed form must match those for +the value type.

+
§Examples
+
use hashbrown::HashSet;
+
+let mut set = HashSet::new();
+
+set.insert(2);
+assert_eq!(set.remove(&2), true);
+assert_eq!(set.remove(&2), false);
+
source

pub fn take<Q>(&mut self, value: &Q) -> Option<T>
where + Q: Hash + Equivalent<T> + ?Sized,

Removes and returns the value in the set, if any, that is equal to the given one.

+

The value may be any borrowed form of the set’s value type, but +Hash and Eq on the borrowed form must match those for +the value type.

+
§Examples
+
use hashbrown::HashSet;
+
+let mut set: HashSet<_> = [1, 2, 3].into_iter().collect();
+assert_eq!(set.take(&2), Some(2));
+assert_eq!(set.take(&2), None);
+
source§

impl<T, S, A: Allocator> HashSet<T, S, A>

source

pub fn raw_table(&self) -> &RawTable<(T, ()), A>

Returns a reference to the RawTable used underneath HashSet. +This function is only available if the raw feature of the crate is enabled.

+
§Note
+

Calling this function is safe, but using the raw hash table API may require +unsafe functions or blocks.

+

RawTable API gives the lowest level of control under the set that can be useful +for extending the HashSet’s API, but may lead to undefined behavior.

+
source

pub fn raw_table_mut(&mut self) -> &mut RawTable<(T, ()), A>

Returns a mutable reference to the RawTable used underneath HashSet. +This function is only available if the raw feature of the crate is enabled.

+
§Note
+

Calling this function is safe, but using the raw hash table API may require +unsafe functions or blocks.

+

RawTable API gives the lowest level of control under the set that can be useful +for extending the HashSet’s API, but may lead to undefined behavior.

+

Trait Implementations§

source§

impl<T, S, A> BitAnd<&HashSet<T, S, A>> for &HashSet<T, S, A>
where + T: Eq + Hash + Clone, + S: BuildHasher + Default, + A: Allocator,

source§

fn bitand(self, rhs: &HashSet<T, S, A>) -> HashSet<T, S>

Returns the intersection of self and rhs as a new HashSet<T, S>.

+
§Examples
+
use hashbrown::HashSet;
+
+let a: HashSet<_> = vec![1, 2, 3].into_iter().collect();
+let b: HashSet<_> = vec![2, 3, 4].into_iter().collect();
+
+let set = &a & &b;
+
+let mut i = 0;
+let expected = [2, 3];
+for x in &set {
+    assert!(expected.contains(x));
+    i += 1;
+}
+assert_eq!(i, expected.len());
+
§

type Output = HashSet<T, S>

The resulting type after applying the & operator.
source§

impl<T, S, A> BitOr<&HashSet<T, S, A>> for &HashSet<T, S, A>
where + T: Eq + Hash + Clone, + S: BuildHasher + Default, + A: Allocator,

source§

fn bitor(self, rhs: &HashSet<T, S, A>) -> HashSet<T, S>

Returns the union of self and rhs as a new HashSet<T, S>.

+
§Examples
+
use hashbrown::HashSet;
+
+let a: HashSet<_> = vec![1, 2, 3].into_iter().collect();
+let b: HashSet<_> = vec![3, 4, 5].into_iter().collect();
+
+let set = &a | &b;
+
+let mut i = 0;
+let expected = [1, 2, 3, 4, 5];
+for x in &set {
+    assert!(expected.contains(x));
+    i += 1;
+}
+assert_eq!(i, expected.len());
+
§

type Output = HashSet<T, S>

The resulting type after applying the | operator.
source§

impl<T, S> BitXor<&HashSet<T, S>> for &HashSet<T, S>
where + T: Eq + Hash + Clone, + S: BuildHasher + Default,

source§

fn bitxor(self, rhs: &HashSet<T, S>) -> HashSet<T, S>

Returns the symmetric difference of self and rhs as a new HashSet<T, S>.

+
§Examples
+
use hashbrown::HashSet;
+
+let a: HashSet<_> = vec![1, 2, 3].into_iter().collect();
+let b: HashSet<_> = vec![3, 4, 5].into_iter().collect();
+
+let set = &a ^ &b;
+
+let mut i = 0;
+let expected = [1, 2, 4, 5];
+for x in &set {
+    assert!(expected.contains(x));
+    i += 1;
+}
+assert_eq!(i, expected.len());
+
§

type Output = HashSet<T, S>

The resulting type after applying the ^ operator.
source§

impl<T: Clone, S: Clone, A: Allocator + Clone> Clone for HashSet<T, S, A>

source§

fn clone(&self) -> Self

Returns a copy of the value. Read more
source§

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

Performs copy-assignment from source. Read more
source§

impl<T, S, A> Debug for HashSet<T, S, A>
where + T: Debug, + A: Allocator,

source§

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

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

impl<T, S, A> Default for HashSet<T, S, A>
where + S: Default, + A: Default + Allocator,

source§

fn default() -> Self

Creates an empty HashSet<T, S> with the Default value for the hasher.

+
source§

impl<'a, T, S, A> Extend<&'a T> for HashSet<T, S, A>
where + T: 'a + Eq + Hash + Copy, + S: BuildHasher, + A: Allocator,

source§

fn extend<I: IntoIterator<Item = &'a T>>(&mut self, iter: I)

Extends a collection with the contents of an iterator. Read more
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<T, S, A> Extend<T> for HashSet<T, S, A>
where + T: Eq + Hash, + S: BuildHasher, + A: Allocator,

source§

fn extend<I: IntoIterator<Item = T>>(&mut self, iter: I)

Extends a collection with the contents of an iterator. Read more
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<T, S, A> From<HashMap<T, (), S, A>> for HashSet<T, S, A>
where + A: Allocator,

source§

fn from(map: HashMap<T, (), S, A>) -> Self

Converts to this type from the input type.
source§

impl<T, S, A> FromIterator<T> for HashSet<T, S, A>
where + T: Eq + Hash, + S: BuildHasher + Default, + A: Default + Allocator,

source§

fn from_iter<I: IntoIterator<Item = T>>(iter: I) -> Self

Creates a value from an iterator. Read more
source§

impl<'a, T, S, A: Allocator> IntoIterator for &'a HashSet<T, S, A>

§

type Item = &'a T

The type of the elements being iterated over.
§

type IntoIter = Iter<'a, T>

Which kind of iterator are we turning this into?
source§

fn into_iter(self) -> Iter<'a, T> ⓘ

Creates an iterator from a value. Read more
source§

impl<T, S, A: Allocator> IntoIterator for HashSet<T, S, A>

source§

fn into_iter(self) -> IntoIter<T, A> ⓘ

Creates a consuming iterator, that is, one that moves each value out +of the set in arbitrary order. The set cannot be used after calling +this.

+
§Examples
+
use hashbrown::HashSet;
+let mut set = HashSet::new();
+set.insert("a".to_string());
+set.insert("b".to_string());
+
+// Not possible to collect to a Vec<String> with a regular `.iter()`.
+let v: Vec<String> = set.into_iter().collect();
+
+// Will print in an arbitrary order.
+for x in &v {
+    println!("{}", x);
+}
+
§

type Item = T

The type of the elements being iterated over.
§

type IntoIter = IntoIter<T, A>

Which kind of iterator are we turning this into?
source§

impl<T, S, A> PartialEq for HashSet<T, S, A>
where + T: Eq + Hash, + S: BuildHasher, + A: Allocator,

source§

fn eq(&self, other: &Self) -> 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<T, S> Sub<&HashSet<T, S>> for &HashSet<T, S>
where + T: Eq + Hash + Clone, + S: BuildHasher + Default,

source§

fn sub(self, rhs: &HashSet<T, S>) -> HashSet<T, S>

Returns the difference of self and rhs as a new HashSet<T, S>.

+
§Examples
+
use hashbrown::HashSet;
+
+let a: HashSet<_> = vec![1, 2, 3].into_iter().collect();
+let b: HashSet<_> = vec![3, 4, 5].into_iter().collect();
+
+let set = &a - &b;
+
+let mut i = 0;
+let expected = [1, 2];
+for x in &set {
+    assert!(expected.contains(x));
+    i += 1;
+}
+assert_eq!(i, expected.len());
+
§

type Output = HashSet<T, S>

The resulting type after applying the - operator.
source§

impl<T, S, A> Eq for HashSet<T, S, A>
where + T: Eq + Hash, + S: BuildHasher, + A: Allocator,

Auto Trait Implementations§

§

impl<T, S, A> Freeze for HashSet<T, S, A>
where + A: Freeze, + S: Freeze,

§

impl<T, S, A> RefUnwindSafe for HashSet<T, S, A>
where + A: RefUnwindSafe, + S: RefUnwindSafe, + T: RefUnwindSafe,

§

impl<T, S, A> Send for HashSet<T, S, A>
where + A: Send, + S: Send, + T: Send,

§

impl<T, S, A> Sync for HashSet<T, S, A>
where + A: Sync, + S: Sync, + T: Sync,

§

impl<T, S, A> Unpin for HashSet<T, S, A>
where + A: Unpin, + S: Unpin, + T: Unpin,

§

impl<T, S, A> UnwindSafe for HashSet<T, S, A>
where + A: UnwindSafe, + S: UnwindSafe, + T: UnwindSafe,

Blanket Implementations§

source§

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

source§

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more
source§

impl<T> Borrow<T> for T
where + T: ?Sized,

source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
source§

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

source§

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

Mutably borrows from an owned value. Read more
source§

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

source§

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

Checks if this value is equivalent to the given key. 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 T
where + 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 T
where + 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 T
where + 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 T
where + 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/hashbrown/hash_set/struct.Intersection.html b/hashbrown/hash_set/struct.Intersection.html new file mode 100644 index 0000000000..98d044f5a7 --- /dev/null +++ b/hashbrown/hash_set/struct.Intersection.html @@ -0,0 +1,216 @@ +Intersection in hashbrown::hash_set - Rust
+

Struct hashbrown::hash_set::Intersection

source · 
pub struct Intersection<'a, T, S, A: Allocator = Global> { /* private fields */ }
Expand description

A lazy iterator producing elements in the intersection of HashSets.

+

This struct is created by the intersection method on HashSet. +See its documentation for more.

+

Trait Implementations§

source§

impl<T, S, A: Allocator> Clone for Intersection<'_, T, S, A>

source§

fn clone(&self) -> Self

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<T, S, A> Debug for Intersection<'_, T, S, A>
where + T: Debug + Eq + Hash, + S: BuildHasher, + A: Allocator,

source§

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

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

impl<'a, T, S, A> Iterator for Intersection<'a, T, S, A>
where + T: Eq + Hash, + S: BuildHasher, + A: Allocator,

§

type Item = &'a T

The type of the elements being iterated over.
source§

fn next(&mut self) -> Option<&'a T>

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 fold<B, F>(self, init: B, f: F) -> B
where + Self: Sized, + F: FnMut(B, Self::Item) -> B,

Folds every element into an accumulator by applying an operation, +returning the final result. 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) -> usize
where + 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<(), NonZero<usize>>

🔬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 Self
where + Self: Sized,

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

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

Transforms an iterator into a collection. Read more
source§

fn collect_into<E>(self, collection: &mut E) -> &mut E
where + 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) -> bool
where + 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) -> R
where + 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) -> R
where + 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.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>>>::TryType
where + 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) -> bool
where + 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) -> bool
where + 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>>>::TryType
where + 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
1.0.0 · source§

fn cycle(self) -> Cycle<Self>
where + Self: Sized + Clone,

Repeats an iterator endlessly. 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) -> S
where + Self: Sized, + S: Sum<Self::Item>,

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

fn product<P>(self) -> P
where + 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) -> Ordering
where + 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) -> bool
where + 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) -> bool
where + 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) -> bool
where + 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) -> bool
where + 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) -> bool
where + 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) -> bool
where + 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) -> bool
where + 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) -> bool
where + Self: Sized, + F: FnMut(&Self::Item, &Self::Item) -> bool,

🔬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) -> bool
where + 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<T, S, A> FusedIterator for Intersection<'_, T, S, A>
where + T: Eq + Hash, + S: BuildHasher, + A: Allocator,

Auto Trait Implementations§

§

impl<'a, T, S, A> Freeze for Intersection<'a, T, S, A>

§

impl<'a, T, S, A> RefUnwindSafe for Intersection<'a, T, S, A>
where + A: RefUnwindSafe, + S: RefUnwindSafe, + T: RefUnwindSafe,

§

impl<'a, T, S, A> Send for Intersection<'a, T, S, A>
where + A: Sync, + S: Sync, + T: Sync,

§

impl<'a, T, S, A> Sync for Intersection<'a, T, S, A>
where + A: Sync, + S: Sync, + T: Sync,

§

impl<'a, T, S, A> Unpin for Intersection<'a, T, S, A>

§

impl<'a, T, S, A> UnwindSafe for Intersection<'a, T, S, A>
where + A: RefUnwindSafe, + S: RefUnwindSafe, + T: RefUnwindSafe,

Blanket Implementations§

source§

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

source§

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more
source§

impl<T> Borrow<T> for T
where + T: ?Sized,

source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
source§

impl<T> BorrowMut<T> for T
where + 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 T
where + 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 I
where + 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> ToOwned for T
where + 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 T
where + 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 T
where + 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/hashbrown/hash_set/struct.IntoIter.html b/hashbrown/hash_set/struct.IntoIter.html new file mode 100644 index 0000000000..472f98213c --- /dev/null +++ b/hashbrown/hash_set/struct.IntoIter.html @@ -0,0 +1,204 @@ +IntoIter in hashbrown::hash_set - Rust
+

Struct hashbrown::hash_set::IntoIter

source · 
pub struct IntoIter<K, A: Allocator = Global> { /* private fields */ }
Expand description

An owning iterator over the items of a HashSet.

+

This struct is created by the into_iter method on HashSet +(provided by the IntoIterator trait). See its documentation for more.

+

Trait Implementations§

source§

impl<K: Debug, A: Allocator> Debug for IntoIter<K, A>

source§

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

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

impl<K, A: Allocator> ExactSizeIterator for IntoIter<K, A>

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<K, A: Allocator> Iterator for IntoIter<K, A>

§

type Item = K

The type of the elements being iterated over.
source§

fn next(&mut self) -> Option<K>

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 fold<B, F>(self, init: B, f: F) -> B
where + Self: Sized, + F: FnMut(B, Self::Item) -> B,

Folds every element into an accumulator by applying an operation, +returning the final result. 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) -> usize
where + 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<(), NonZero<usize>>

🔬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 Self
where + Self: Sized,

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

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

Transforms an iterator into a collection. Read more
source§

fn collect_into<E>(self, collection: &mut E) -> &mut E
where + 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) -> bool
where + 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) -> R
where + 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) -> R
where + 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.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>>>::TryType
where + 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) -> bool
where + 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) -> bool
where + 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>>>::TryType
where + 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) -> S
where + Self: Sized, + S: Sum<Self::Item>,

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

fn product<P>(self) -> P
where + 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) -> Ordering
where + 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) -> bool
where + 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) -> bool
where + 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) -> bool
where + 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) -> bool
where + 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) -> bool
where + 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) -> bool
where + 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) -> bool
where + 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) -> bool
where + Self: Sized, + F: FnMut(&Self::Item, &Self::Item) -> bool,

🔬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) -> bool
where + 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<K, A: Allocator> FusedIterator for IntoIter<K, A>

Auto Trait Implementations§

§

impl<K, A> Freeze for IntoIter<K, A>
where + A: Freeze,

§

impl<K, A> RefUnwindSafe for IntoIter<K, A>
where + A: RefUnwindSafe, + K: RefUnwindSafe,

§

impl<K, A> Send for IntoIter<K, A>
where + A: Send, + K: Send,

§

impl<K, A> Sync for IntoIter<K, A>
where + A: Sync, + K: Sync,

§

impl<K, A> Unpin for IntoIter<K, A>
where + A: Unpin, + K: Unpin,

§

impl<K, A> UnwindSafe for IntoIter<K, A>
where + A: UnwindSafe, + K: UnwindSafe + RefUnwindSafe,

Blanket Implementations§

source§

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

source§

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more
source§

impl<T> Borrow<T> for T
where + T: ?Sized,

source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
source§

impl<T> BorrowMut<T> for T
where + 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 T
where + 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 I
where + 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, U> TryFrom<U> for T
where + 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 T
where + 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/hashbrown/hash_set/struct.Iter.html b/hashbrown/hash_set/struct.Iter.html new file mode 100644 index 0000000000..19df9e9ba5 --- /dev/null +++ b/hashbrown/hash_set/struct.Iter.html @@ -0,0 +1,199 @@ +Iter in hashbrown::hash_set - Rust
+

Struct hashbrown::hash_set::Iter

source · 
pub struct Iter<'a, K> { /* private fields */ }
Expand description

An iterator over the items of a HashSet.

+

This struct is created by the iter method on HashSet. +See its documentation for more.

+

Trait Implementations§

source§

impl<K> Clone for Iter<'_, K>

source§

fn clone(&self) -> Self

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<K: Debug> Debug for Iter<'_, K>

source§

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

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

impl<'a, K> ExactSizeIterator for Iter<'a, K>

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, K> Iterator for Iter<'a, K>

§

type Item = &'a K

The type of the elements being iterated over.
source§

fn next(&mut self) -> Option<&'a K>

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 fold<B, F>(self, init: B, f: F) -> B
where + Self: Sized, + F: FnMut(B, Self::Item) -> B,

Folds every element into an accumulator by applying an operation, +returning the final result. 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) -> usize
where + 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<(), NonZero<usize>>

🔬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 Self
where + Self: Sized,

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

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

Transforms an iterator into a collection. Read more
source§

fn collect_into<E>(self, collection: &mut E) -> &mut E
where + 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) -> bool
where + 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) -> R
where + 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) -> R
where + 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.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>>>::TryType
where + 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) -> bool
where + 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) -> bool
where + 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>>>::TryType
where + 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
1.0.0 · source§

fn cycle(self) -> Cycle<Self>
where + Self: Sized + Clone,

Repeats an iterator endlessly. 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) -> S
where + Self: Sized, + S: Sum<Self::Item>,

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

fn product<P>(self) -> P
where + 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) -> Ordering
where + 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) -> bool
where + 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) -> bool
where + 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) -> bool
where + 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) -> bool
where + 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) -> bool
where + 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) -> bool
where + 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) -> bool
where + 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) -> bool
where + Self: Sized, + F: FnMut(&Self::Item, &Self::Item) -> bool,

🔬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) -> bool
where + 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<K> FusedIterator for Iter<'_, K>

Auto Trait Implementations§

§

impl<'a, K> Freeze for Iter<'a, K>

§

impl<'a, K> RefUnwindSafe for Iter<'a, K>
where + K: RefUnwindSafe,

§

impl<'a, K> Send for Iter<'a, K>
where + K: Sync,

§

impl<'a, K> Sync for Iter<'a, K>
where + K: Sync,

§

impl<'a, K> Unpin for Iter<'a, K>

§

impl<'a, K> UnwindSafe for Iter<'a, K>
where + K: RefUnwindSafe,

Blanket Implementations§

source§

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

source§

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more
source§

impl<T> Borrow<T> for T
where + T: ?Sized,

source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
source§

impl<T> BorrowMut<T> for T
where + 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 T
where + 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 I
where + 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> ToOwned for T
where + 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 T
where + 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 T
where + 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/hashbrown/hash_set/struct.OccupiedEntry.html b/hashbrown/hash_set/struct.OccupiedEntry.html new file mode 100644 index 0000000000..1edfa99226 --- /dev/null +++ b/hashbrown/hash_set/struct.OccupiedEntry.html @@ -0,0 +1,109 @@ +OccupiedEntry in hashbrown::hash_set - Rust
+

Struct hashbrown::hash_set::OccupiedEntry

source · 
pub struct OccupiedEntry<'a, T, S, A: Allocator = Global> { /* private fields */ }
Expand description

A view into an occupied entry in a HashSet. +It is part of the Entry enum.

+

§Examples

+
use hashbrown::hash_set::{Entry, HashSet, OccupiedEntry};
+
+let mut set = HashSet::new();
+set.extend(["a", "b", "c"]);
+
+let _entry_o: OccupiedEntry<_, _> = set.entry("a").insert();
+assert_eq!(set.len(), 3);
+
+// Existing key
+match set.entry("a") {
+    Entry::Vacant(_) => unreachable!(),
+    Entry::Occupied(view) => {
+        assert_eq!(view.get(), &"a");
+    }
+}
+
+assert_eq!(set.len(), 3);
+
+// Existing key (take)
+match set.entry("c") {
+    Entry::Vacant(_) => unreachable!(),
+    Entry::Occupied(view) => {
+        assert_eq!(view.remove(), "c");
+    }
+}
+assert_eq!(set.get(&"c"), None);
+assert_eq!(set.len(), 2);
+

Implementations§

source§

impl<T, S, A: Allocator> OccupiedEntry<'_, T, S, A>

source

pub fn get(&self) -> &T

Gets a reference to the value in the entry.

+
§Examples
+
use hashbrown::hash_set::{Entry, HashSet};
+
+let mut set: HashSet<&str> = HashSet::new();
+set.entry("poneyland").or_insert();
+
+match set.entry("poneyland") {
+    Entry::Vacant(_) => panic!(),
+    Entry::Occupied(entry) => assert_eq!(entry.get(), &"poneyland"),
+}
+
source

pub fn remove(self) -> T

Takes the value out of the entry, and returns it. +Keeps the allocated memory for reuse.

+
§Examples
+
use hashbrown::HashSet;
+use hashbrown::hash_set::Entry;
+
+let mut set: HashSet<&str> = HashSet::new();
+// The set is empty
+assert!(set.is_empty() && set.capacity() == 0);
+
+set.entry("poneyland").or_insert();
+let capacity_before_remove = set.capacity();
+
+if let Entry::Occupied(o) = set.entry("poneyland") {
+    assert_eq!(o.remove(), "poneyland");
+}
+
+assert_eq!(set.contains("poneyland"), false);
+// Now set hold none elements but capacity is equal to the old one
+assert!(set.len() == 0 && set.capacity() == capacity_before_remove);
+
source

pub fn replace(self) -> T

Replaces the entry, returning the old value. The new value in the hash map will be +the value used to create this entry.

+
§Panics
+

Will panic if this OccupiedEntry was created through Entry::insert.

+
§Examples
+
 use hashbrown::hash_set::{Entry, HashSet};
+ use std::rc::Rc;
+
+ let mut set: HashSet<Rc<String>> = HashSet::new();
+ let key_one = Rc::new("Stringthing".to_string());
+ let key_two = Rc::new("Stringthing".to_string());
+
+ set.insert(key_one.clone());
+ assert!(Rc::strong_count(&key_one) == 2 && Rc::strong_count(&key_two) == 1);
+
+ match set.entry(key_two.clone()) {
+     Entry::Occupied(entry) => {
+         let old_key: Rc<String> = entry.replace();
+         assert!(Rc::ptr_eq(&key_one, &old_key));
+     }
+     Entry::Vacant(_) => panic!(),
+ }
+
+ assert!(Rc::strong_count(&key_one) == 1 && Rc::strong_count(&key_two) == 2);
+ assert!(set.contains(&"Stringthing".to_owned()));
+

Trait Implementations§

source§

impl<T: Debug, S, A: Allocator> Debug for OccupiedEntry<'_, T, S, A>

source§

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

Formats the value using the given formatter. Read more

Auto Trait Implementations§

§

impl<'a, T, S, A> Freeze for OccupiedEntry<'a, T, S, A>
where + T: Freeze,

§

impl<'a, T, S, A> RefUnwindSafe for OccupiedEntry<'a, T, S, A>
where + A: RefUnwindSafe, + S: RefUnwindSafe, + T: RefUnwindSafe,

§

impl<'a, T, S, A> Send for OccupiedEntry<'a, T, S, A>
where + A: Send, + S: Send, + T: Send,

§

impl<'a, T, S, A> Sync for OccupiedEntry<'a, T, S, A>
where + A: Sync, + S: Sync, + T: Sync,

§

impl<'a, T, S, A> Unpin for OccupiedEntry<'a, T, S, A>
where + T: Unpin,

§

impl<'a, T, S, A = Global> !UnwindSafe for OccupiedEntry<'a, T, S, A>

Blanket Implementations§

source§

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

source§

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more
source§

impl<T> Borrow<T> for T
where + T: ?Sized,

source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
source§

impl<T> BorrowMut<T> for T
where + 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 T
where + 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 T
where + 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 T
where + 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/hashbrown/hash_set/struct.SymmetricDifference.html b/hashbrown/hash_set/struct.SymmetricDifference.html new file mode 100644 index 0000000000..3ef10e6f52 --- /dev/null +++ b/hashbrown/hash_set/struct.SymmetricDifference.html @@ -0,0 +1,216 @@ +SymmetricDifference in hashbrown::hash_set - Rust
+

Struct hashbrown::hash_set::SymmetricDifference

source · 
pub struct SymmetricDifference<'a, T, S, A: Allocator = Global> { /* private fields */ }
Expand description

A lazy iterator producing elements in the symmetric difference of HashSets.

+

This struct is created by the symmetric_difference method on +HashSet. See its documentation for more.

+

Trait Implementations§

source§

impl<T, S, A: Allocator> Clone for SymmetricDifference<'_, T, S, A>

source§

fn clone(&self) -> Self

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<T, S, A> Debug for SymmetricDifference<'_, T, S, A>
where + T: Debug + Eq + Hash, + S: BuildHasher, + A: Allocator,

source§

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

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

impl<'a, T, S, A> Iterator for SymmetricDifference<'a, T, S, A>
where + T: Eq + Hash, + S: BuildHasher, + A: Allocator,

§

type Item = &'a T

The type of the elements being iterated over.
source§

fn next(&mut self) -> Option<&'a T>

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 fold<B, F>(self, init: B, f: F) -> B
where + Self: Sized, + F: FnMut(B, Self::Item) -> B,

Folds every element into an accumulator by applying an operation, +returning the final result. 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) -> usize
where + 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<(), NonZero<usize>>

🔬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 Self
where + Self: Sized,

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

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

Transforms an iterator into a collection. Read more
source§

fn collect_into<E>(self, collection: &mut E) -> &mut E
where + 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) -> bool
where + 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) -> R
where + 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) -> R
where + 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.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>>>::TryType
where + 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) -> bool
where + 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) -> bool
where + 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>>>::TryType
where + 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
1.0.0 · source§

fn cycle(self) -> Cycle<Self>
where + Self: Sized + Clone,

Repeats an iterator endlessly. 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) -> S
where + Self: Sized, + S: Sum<Self::Item>,

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

fn product<P>(self) -> P
where + 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) -> Ordering
where + 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) -> bool
where + 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) -> bool
where + 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) -> bool
where + 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) -> bool
where + 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) -> bool
where + 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) -> bool
where + 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) -> bool
where + 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) -> bool
where + Self: Sized, + F: FnMut(&Self::Item, &Self::Item) -> bool,

🔬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) -> bool
where + 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<T, S, A> FusedIterator for SymmetricDifference<'_, T, S, A>
where + T: Eq + Hash, + S: BuildHasher, + A: Allocator,

Auto Trait Implementations§

§

impl<'a, T, S, A> Freeze for SymmetricDifference<'a, T, S, A>

§

impl<'a, T, S, A> RefUnwindSafe for SymmetricDifference<'a, T, S, A>
where + A: RefUnwindSafe, + S: RefUnwindSafe, + T: RefUnwindSafe,

§

impl<'a, T, S, A> Send for SymmetricDifference<'a, T, S, A>
where + A: Sync, + S: Sync, + T: Sync,

§

impl<'a, T, S, A> Sync for SymmetricDifference<'a, T, S, A>
where + A: Sync, + S: Sync, + T: Sync,

§

impl<'a, T, S, A> Unpin for SymmetricDifference<'a, T, S, A>

§

impl<'a, T, S, A> UnwindSafe for SymmetricDifference<'a, T, S, A>
where + A: RefUnwindSafe, + S: RefUnwindSafe, + T: RefUnwindSafe,

Blanket Implementations§

source§

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

source§

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more
source§

impl<T> Borrow<T> for T
where + T: ?Sized,

source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
source§

impl<T> BorrowMut<T> for T
where + 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 T
where + 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 I
where + 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> ToOwned for T
where + 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 T
where + 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 T
where + 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/hashbrown/hash_set/struct.Union.html b/hashbrown/hash_set/struct.Union.html new file mode 100644 index 0000000000..6251d740ab --- /dev/null +++ b/hashbrown/hash_set/struct.Union.html @@ -0,0 +1,216 @@ +Union in hashbrown::hash_set - Rust
+

Struct hashbrown::hash_set::Union

source · 
pub struct Union<'a, T, S, A: Allocator = Global> { /* private fields */ }
Expand description

A lazy iterator producing elements in the union of HashSets.

+

This struct is created by the union method on HashSet. +See its documentation for more.

+

Trait Implementations§

source§

impl<T, S, A: Allocator> Clone for Union<'_, T, S, A>

source§

fn clone(&self) -> Self

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<T, S, A> Debug for Union<'_, T, S, A>
where + T: Debug + Eq + Hash, + S: BuildHasher, + A: Allocator,

source§

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

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

impl<'a, T, S, A> Iterator for Union<'a, T, S, A>
where + T: Eq + Hash, + S: BuildHasher, + A: Allocator,

§

type Item = &'a T

The type of the elements being iterated over.
source§

fn next(&mut self) -> Option<&'a T>

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 fold<B, F>(self, init: B, f: F) -> B
where + Self: Sized, + F: FnMut(B, Self::Item) -> B,

Folds every element into an accumulator by applying an operation, +returning the final result. 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) -> usize
where + 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<(), NonZero<usize>>

🔬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 Self
where + Self: Sized,

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

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

Transforms an iterator into a collection. Read more
source§

fn collect_into<E>(self, collection: &mut E) -> &mut E
where + 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) -> bool
where + 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) -> R
where + 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) -> R
where + 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.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>>>::TryType
where + 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) -> bool
where + 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) -> bool
where + 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>>>::TryType
where + 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
1.0.0 · source§

fn cycle(self) -> Cycle<Self>
where + Self: Sized + Clone,

Repeats an iterator endlessly. 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) -> S
where + Self: Sized, + S: Sum<Self::Item>,

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

fn product<P>(self) -> P
where + 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) -> Ordering
where + 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) -> bool
where + 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) -> bool
where + 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) -> bool
where + 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) -> bool
where + 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) -> bool
where + 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) -> bool
where + 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) -> bool
where + 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) -> bool
where + Self: Sized, + F: FnMut(&Self::Item, &Self::Item) -> bool,

🔬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) -> bool
where + 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<T, S, A> FusedIterator for Union<'_, T, S, A>
where + T: Eq + Hash, + S: BuildHasher, + A: Allocator,

Auto Trait Implementations§

§

impl<'a, T, S, A> Freeze for Union<'a, T, S, A>

§

impl<'a, T, S, A> RefUnwindSafe for Union<'a, T, S, A>
where + A: RefUnwindSafe, + S: RefUnwindSafe, + T: RefUnwindSafe,

§

impl<'a, T, S, A> Send for Union<'a, T, S, A>
where + A: Sync, + S: Sync, + T: Sync,

§

impl<'a, T, S, A> Sync for Union<'a, T, S, A>
where + A: Sync, + S: Sync, + T: Sync,

§

impl<'a, T, S, A> Unpin for Union<'a, T, S, A>

§

impl<'a, T, S, A> UnwindSafe for Union<'a, T, S, A>
where + A: RefUnwindSafe, + S: RefUnwindSafe, + T: RefUnwindSafe,

Blanket Implementations§

source§

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

source§

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more
source§

impl<T> Borrow<T> for T
where + T: ?Sized,

source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
source§

impl<T> BorrowMut<T> for T
where + 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 T
where + 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 I
where + 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> ToOwned for T
where + 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 T
where + 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 T
where + 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/hashbrown/hash_set/struct.VacantEntry.html b/hashbrown/hash_set/struct.VacantEntry.html new file mode 100644 index 0000000000..5357e8a326 --- /dev/null +++ b/hashbrown/hash_set/struct.VacantEntry.html @@ -0,0 +1,73 @@ +VacantEntry in hashbrown::hash_set - Rust
+

Struct hashbrown::hash_set::VacantEntry

source · 
pub struct VacantEntry<'a, T, S, A: Allocator = Global> { /* private fields */ }
Expand description

A view into a vacant entry in a HashSet. +It is part of the Entry enum.

+

§Examples

+
use hashbrown::hash_set::{Entry, HashSet, VacantEntry};
+
+let mut set = HashSet::<&str>::new();
+
+let entry_v: VacantEntry<_, _> = match set.entry("a") {
+    Entry::Vacant(view) => view,
+    Entry::Occupied(_) => unreachable!(),
+};
+entry_v.insert();
+assert!(set.contains("a") && set.len() == 1);
+
+// Nonexistent key (insert)
+match set.entry("b") {
+    Entry::Vacant(view) => view.insert(),
+    Entry::Occupied(_) => unreachable!(),
+}
+assert!(set.contains("b") && set.len() == 2);
+

Implementations§

source§

impl<'a, T, S, A: Allocator> VacantEntry<'a, T, S, A>

source

pub fn get(&self) -> &T

Gets a reference to the value that would be used when inserting +through the VacantEntry.

+
§Examples
+
use hashbrown::HashSet;
+
+let mut set: HashSet<&str> = HashSet::new();
+assert_eq!(set.entry("poneyland").get(), &"poneyland");
+
source

pub fn into_value(self) -> T

Take ownership of the value.

+
§Examples
+
use hashbrown::hash_set::{Entry, HashSet};
+
+let mut set: HashSet<&str> = HashSet::new();
+
+match set.entry("poneyland") {
+    Entry::Occupied(_) => panic!(),
+    Entry::Vacant(v) => assert_eq!(v.into_value(), "poneyland"),
+}
+
source

pub fn insert(self)
where + T: Hash, + S: BuildHasher,

Sets the value of the entry with the VacantEntry’s value.

+
§Examples
+
use hashbrown::HashSet;
+use hashbrown::hash_set::Entry;
+
+let mut set: HashSet<&str> = HashSet::new();
+
+if let Entry::Vacant(o) = set.entry("poneyland") {
+    o.insert();
+}
+assert!(set.contains("poneyland"));
+

Trait Implementations§

source§

impl<T: Debug, S, A: Allocator> Debug for VacantEntry<'_, T, S, A>

source§

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

Formats the value using the given formatter. Read more

Auto Trait Implementations§

§

impl<'a, T, S, A> Freeze for VacantEntry<'a, T, S, A>
where + T: Freeze,

§

impl<'a, T, S, A> RefUnwindSafe for VacantEntry<'a, T, S, A>
where + A: RefUnwindSafe, + S: RefUnwindSafe, + T: RefUnwindSafe,

§

impl<'a, T, S, A> Send for VacantEntry<'a, T, S, A>
where + A: Send, + S: Send, + T: Send,

§

impl<'a, T, S, A> Sync for VacantEntry<'a, T, S, A>
where + A: Sync, + S: Sync, + T: Sync,

§

impl<'a, T, S, A> Unpin for VacantEntry<'a, T, S, A>
where + T: Unpin,

§

impl<'a, T, S, A = Global> !UnwindSafe for VacantEntry<'a, T, S, A>

Blanket Implementations§

source§

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

source§

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more
source§

impl<T> Borrow<T> for T
where + T: ?Sized,

source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
source§

impl<T> BorrowMut<T> for T
where + 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 T
where + 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 T
where + 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 T
where + 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/hashbrown/hash_table/enum.Entry.html b/hashbrown/hash_table/enum.Entry.html new file mode 100644 index 0000000000..75147f54fb --- /dev/null +++ b/hashbrown/hash_table/enum.Entry.html @@ -0,0 +1,192 @@ +Entry in hashbrown::hash_table - Rust
+

Enum hashbrown::hash_table::Entry

source · 
pub enum Entry<'a, T, A = Global>
where
+    A: Allocator,
{
+    Occupied(OccupiedEntry<'a, T, A>),
+    Vacant(VacantEntry<'a, T, A>),
+}
Expand description

A view into a single entry in a table, which may either be vacant or occupied.

+

This enum is constructed from the entry method on HashTable.

+

§Examples

+
use ahash::AHasher;
+use hashbrown::hash_table::{Entry, HashTable, OccupiedEntry};
+use std::hash::{BuildHasher, BuildHasherDefault};
+
+let mut table = HashTable::new();
+let hasher = BuildHasherDefault::<AHasher>::default();
+let hasher = |val: &_| hasher.hash_one(val);
+for x in ["a", "b", "c"] {
+    table.insert_unique(hasher(&x), x, hasher);
+}
+assert_eq!(table.len(), 3);
+
+// Existing value (insert)
+let entry: Entry<_> = table.entry(hasher(&"a"), |&x| x == "a", hasher);
+let _raw_o: OccupiedEntry<_, _> = entry.insert("a");
+assert_eq!(table.len(), 3);
+// Nonexistent value (insert)
+table.entry(hasher(&"d"), |&x| x == "d", hasher).insert("d");
+
+// Existing value (or_insert)
+table
+    .entry(hasher(&"b"), |&x| x == "b", hasher)
+    .or_insert("b");
+// Nonexistent value (or_insert)
+table
+    .entry(hasher(&"e"), |&x| x == "e", hasher)
+    .or_insert("e");
+
+println!("Our HashTable: {:?}", table);
+
+let mut vec: Vec<_> = table.iter().copied().collect();
+// The `Iter` iterator produces items in arbitrary order, so the
+// items must be sorted to test them against a sorted array.
+vec.sort_unstable();
+assert_eq!(vec, ["a", "b", "c", "d", "e"]);
+

Variants§

§

Occupied(OccupiedEntry<'a, T, A>)

An occupied entry.

+

§Examples

+
use ahash::AHasher;
+use hashbrown::hash_table::{Entry, HashTable, OccupiedEntry};
+use std::hash::{BuildHasher, BuildHasherDefault};
+
+let mut table = HashTable::new();
+let hasher = BuildHasherDefault::<AHasher>::default();
+let hasher = |val: &_| hasher.hash_one(val);
+for x in ["a", "b"] {
+    table.insert_unique(hasher(&x), x, hasher);
+}
+
+match table.entry(hasher(&"a"), |&x| x == "a", hasher) {
+    Entry::Vacant(_) => unreachable!(),
+    Entry::Occupied(_) => {}
+}
+
§

Vacant(VacantEntry<'a, T, A>)

A vacant entry.

+

§Examples

+
use ahash::AHasher;
+use hashbrown::hash_table::{Entry, HashTable, OccupiedEntry};
+use std::hash::{BuildHasher, BuildHasherDefault};
+
+let mut table = HashTable::<&str>::new();
+let hasher = BuildHasherDefault::<AHasher>::default();
+let hasher = |val: &_| hasher.hash_one(val);
+
+match table.entry(hasher(&"a"), |&x| x == "a", hasher) {
+    Entry::Vacant(_) => {}
+    Entry::Occupied(_) => unreachable!(),
+}
+

Implementations§

source§

impl<'a, T, A> Entry<'a, T, A>
where + A: Allocator,

source

pub fn insert(self, value: T) -> OccupiedEntry<'a, T, A>

Sets the value of the entry, replacing any existing value if there is +one, and returns an OccupiedEntry.

+
§Examples
+
use ahash::AHasher;
+use hashbrown::HashTable;
+use std::hash::{BuildHasher, BuildHasherDefault};
+
+let mut table: HashTable<&str> = HashTable::new();
+let hasher = BuildHasherDefault::<AHasher>::default();
+let hasher = |val: &_| hasher.hash_one(val);
+
+let entry = table
+    .entry(hasher(&"horseyland"), |&x| x == "horseyland", hasher)
+    .insert("horseyland");
+
+assert_eq!(entry.get(), &"horseyland");
+
source

pub fn or_insert(self, default: T) -> OccupiedEntry<'a, T, A>

Ensures a value is in the entry by inserting if it was vacant.

+

Returns an OccupiedEntry pointing to the now-occupied entry.

+
§Examples
+
use ahash::AHasher;
+use hashbrown::HashTable;
+use std::hash::{BuildHasher, BuildHasherDefault};
+
+let mut table: HashTable<&str> = HashTable::new();
+let hasher = BuildHasherDefault::<AHasher>::default();
+let hasher = |val: &_| hasher.hash_one(val);
+
+// nonexistent key
+table
+    .entry(hasher(&"poneyland"), |&x| x == "poneyland", hasher)
+    .or_insert("poneyland");
+assert!(table
+    .find(hasher(&"poneyland"), |&x| x == "poneyland")
+    .is_some());
+
+// existing key
+table
+    .entry(hasher(&"poneyland"), |&x| x == "poneyland", hasher)
+    .or_insert("poneyland");
+assert!(table
+    .find(hasher(&"poneyland"), |&x| x == "poneyland")
+    .is_some());
+assert_eq!(table.len(), 1);
+
source

pub fn or_insert_with( + self, + default: impl FnOnce() -> T +) -> OccupiedEntry<'a, T, A>

Ensures a value is in the entry by inserting the result of the default function if empty..

+

Returns an OccupiedEntry pointing to the now-occupied entry.

+
§Examples
+
use ahash::AHasher;
+use hashbrown::HashTable;
+use std::hash::{BuildHasher, BuildHasherDefault};
+
+let mut table: HashTable<String> = HashTable::new();
+let hasher = BuildHasherDefault::<AHasher>::default();
+let hasher = |val: &_| hasher.hash_one(val);
+
+table
+    .entry(hasher("poneyland"), |x| x == "poneyland", |val| hasher(val))
+    .or_insert_with(|| "poneyland".to_string());
+
+assert!(table
+    .find(hasher(&"poneyland"), |x| x == "poneyland")
+    .is_some());
+
source

pub fn and_modify(self, f: impl FnOnce(&mut T)) -> Self

Provides in-place mutable access to an occupied entry before any +potential inserts into the table.

+
§Examples
+
use ahash::AHasher;
+use hashbrown::HashTable;
+use std::hash::{BuildHasher, BuildHasherDefault};
+
+let mut table: HashTable<(&str, u32)> = HashTable::new();
+let hasher = BuildHasherDefault::<AHasher>::default();
+let hasher = |val: &_| hasher.hash_one(val);
+
+table
+    .entry(
+        hasher(&"poneyland"),
+        |&(x, _)| x == "poneyland",
+        |(k, _)| hasher(&k),
+    )
+    .and_modify(|(_, v)| *v += 1)
+    .or_insert(("poneyland", 42));
+assert_eq!(
+    table.find(hasher(&"poneyland"), |&(k, _)| k == "poneyland"),
+    Some(&("poneyland", 42))
+);
+
+table
+    .entry(
+        hasher(&"poneyland"),
+        |&(x, _)| x == "poneyland",
+        |(k, _)| hasher(&k),
+    )
+    .and_modify(|(_, v)| *v += 1)
+    .or_insert(("poneyland", 42));
+assert_eq!(
+    table.find(hasher(&"poneyland"), |&(k, _)| k == "poneyland"),
+    Some(&("poneyland", 43))
+);
+

Trait Implementations§

source§

impl<T: Debug, A: Allocator> Debug for Entry<'_, T, A>

source§

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

Formats the value using the given formatter. Read more

Auto Trait Implementations§

§

impl<'a, T, A> Freeze for Entry<'a, T, A>

§

impl<'a, T, A> RefUnwindSafe for Entry<'a, T, A>
where + A: RefUnwindSafe, + T: RefUnwindSafe,

§

impl<'a, T, A> Send for Entry<'a, T, A>
where + A: Send, + T: Send,

§

impl<'a, T, A> Sync for Entry<'a, T, A>
where + A: Sync, + T: Sync,

§

impl<'a, T, A> Unpin for Entry<'a, T, A>

§

impl<'a, T, A = Global> !UnwindSafe for Entry<'a, T, A>

Blanket Implementations§

source§

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

source§

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more
source§

impl<T> Borrow<T> for T
where + T: ?Sized,

source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
source§

impl<T> BorrowMut<T> for T
where + 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 T
where + 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 T
where + 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 T
where + 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/hashbrown/hash_table/index.html b/hashbrown/hash_table/index.html new file mode 100644 index 0000000000..4027cca1b4 --- /dev/null +++ b/hashbrown/hash_table/index.html @@ -0,0 +1,8 @@ +hashbrown::hash_table - Rust
+

Module hashbrown::hash_table

source ·
Expand description

A hash table implemented with quadratic probing and SIMD lookup.

+

Structs§

  • AbsentEntry
    Type representing the absence of an entry, as returned by HashTable::find_entry.
  • Drain
    A draining iterator over the items of a HashTable.
  • ExtractIf
    A draining iterator over entries of a HashTable which don’t satisfy the predicate f.
  • HashTable
    Low-level hash table with explicit hashing.
  • IntoIter
    An owning iterator over the entries of a HashTable in arbitrary order. +The iterator element type is T.
  • Iter
    An iterator over the entries of a HashTable in arbitrary order. +The iterator element type is &'a T.
  • IterMut
    A mutable iterator over the entries of a HashTable in arbitrary order. +The iterator element type is &'a mut T.
  • OccupiedEntry
    A view into an occupied entry in a HashTable. +It is part of the Entry enum.
  • VacantEntry
    A view into a vacant entry in a HashTable. +It is part of the Entry enum.

Enums§

  • Entry
    A view into a single entry in a table, which may either be vacant or occupied.
\ No newline at end of file diff --git a/hashbrown/hash_table/sidebar-items.js b/hashbrown/hash_table/sidebar-items.js new file mode 100644 index 0000000000..9723a38031 --- /dev/null +++ b/hashbrown/hash_table/sidebar-items.js @@ -0,0 +1 @@ +window.SIDEBAR_ITEMS = {"enum":["Entry"],"struct":["AbsentEntry","Drain","ExtractIf","HashTable","IntoIter","Iter","IterMut","OccupiedEntry","VacantEntry"]}; \ No newline at end of file diff --git a/hashbrown/hash_table/struct.AbsentEntry.html b/hashbrown/hash_table/struct.AbsentEntry.html new file mode 100644 index 0000000000..eb9eba4bdd --- /dev/null +++ b/hashbrown/hash_table/struct.AbsentEntry.html @@ -0,0 +1,49 @@ +AbsentEntry in hashbrown::hash_table - Rust
+

Struct hashbrown::hash_table::AbsentEntry

source · 
pub struct AbsentEntry<'a, T, A = Global>
where
+    A: Allocator,
{ /* private fields */ }
Expand description

Type representing the absence of an entry, as returned by HashTable::find_entry.

+

This type only exists due to limitations in Rust’s NLL borrow checker. In +the future, find_entry will return an Option<OccupiedEntry> and this +type will be removed.

+

§Examples

+
use ahash::AHasher;
+use hashbrown::hash_table::{AbsentEntry, Entry, HashTable};
+use std::hash::{BuildHasher, BuildHasherDefault};
+
+let mut table: HashTable<&str> = HashTable::new();
+let hasher = BuildHasherDefault::<AHasher>::default();
+let hasher = |val: &_| hasher.hash_one(val);
+
+let entry_v: AbsentEntry<_, _> = table.find_entry(hasher(&"a"), |&x| x == "a").unwrap_err();
+entry_v
+    .into_table()
+    .insert_unique(hasher(&"a"), "a", hasher);
+assert!(table.find(hasher(&"a"), |&x| x == "a").is_some() && table.len() == 1);
+
+// Nonexistent key (insert)
+match table.entry(hasher(&"b"), |&x| x == "b", hasher) {
+    Entry::Vacant(view) => {
+        view.insert("b");
+    }
+    Entry::Occupied(_) => unreachable!(),
+}
+assert!(table.find(hasher(&"b"), |&x| x == "b").is_some() && table.len() == 2);
+

Implementations§

source§

impl<'a, T, A> AbsentEntry<'a, T, A>
where + A: Allocator,

source

pub fn into_table(self) -> &'a mut HashTable<T, A>

Converts the AbsentEntry into a mutable reference to the underlying +table.

+

Trait Implementations§

source§

impl<T: Debug, A: Allocator> Debug for AbsentEntry<'_, T, A>

source§

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

Formats the value using the given formatter. Read more

Auto Trait Implementations§

§

impl<'a, T, A> Freeze for AbsentEntry<'a, T, A>

§

impl<'a, T, A> RefUnwindSafe for AbsentEntry<'a, T, A>
where + A: RefUnwindSafe, + T: RefUnwindSafe,

§

impl<'a, T, A> Send for AbsentEntry<'a, T, A>
where + A: Send, + T: Send,

§

impl<'a, T, A> Sync for AbsentEntry<'a, T, A>
where + A: Sync, + T: Sync,

§

impl<'a, T, A> Unpin for AbsentEntry<'a, T, A>

§

impl<'a, T, A = Global> !UnwindSafe for AbsentEntry<'a, T, A>

Blanket Implementations§

source§

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

source§

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more
source§

impl<T> Borrow<T> for T
where + T: ?Sized,

source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
source§

impl<T> BorrowMut<T> for T
where + 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 T
where + 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 T
where + 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 T
where + 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/hashbrown/hash_table/struct.Drain.html b/hashbrown/hash_table/struct.Drain.html new file mode 100644 index 0000000000..e75be3a60f --- /dev/null +++ b/hashbrown/hash_table/struct.Drain.html @@ -0,0 +1,201 @@ +Drain in hashbrown::hash_table - Rust
+

Struct hashbrown::hash_table::Drain

source · 
pub struct Drain<'a, T, A: Allocator = Global> { /* private fields */ }
Expand description

A draining iterator over the items of a HashTable.

+

This struct is created by the drain method on HashTable. +See its documentation for more.

+

Trait Implementations§

source§

impl<T: Debug, A: Allocator> Debug for Drain<'_, T, A>

source§

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

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

impl<T, A: Allocator> ExactSizeIterator for Drain<'_, T, A>

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<T, A: Allocator> Iterator for Drain<'_, T, A>

§

type Item = T

The type of the elements being iterated over.
source§

fn next(&mut self) -> Option<T>

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) -> usize
where + 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<(), NonZero<usize>>

🔬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 Self
where + Self: Sized,

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

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

Transforms an iterator into a collection. Read more
source§

fn collect_into<E>(self, collection: &mut E) -> &mut E
where + 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) -> bool
where + 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) -> R
where + 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) -> R
where + 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) -> B
where + 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>>>::TryType
where + 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) -> bool
where + 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) -> bool
where + 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>>>::TryType
where + 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) -> S
where + Self: Sized, + S: Sum<Self::Item>,

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

fn product<P>(self) -> P
where + 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) -> Ordering
where + 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) -> bool
where + 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) -> bool
where + 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) -> bool
where + 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) -> bool
where + 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) -> bool
where + 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) -> bool
where + 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) -> bool
where + 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) -> bool
where + Self: Sized, + F: FnMut(&Self::Item, &Self::Item) -> bool,

🔬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) -> bool
where + 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<T, A: Allocator> FusedIterator for Drain<'_, T, A>

Auto Trait Implementations§

§

impl<'a, T, A> Freeze for Drain<'a, T, A>

§

impl<'a, T, A> RefUnwindSafe for Drain<'a, T, A>
where + A: RefUnwindSafe, + T: RefUnwindSafe,

§

impl<'a, T, A> Send for Drain<'a, T, A>
where + A: Send, + T: Send,

§

impl<'a, T, A> Sync for Drain<'a, T, A>
where + A: Sync, + T: Sync,

§

impl<'a, T, A> Unpin for Drain<'a, T, A>

§

impl<'a, T, A> UnwindSafe for Drain<'a, T, A>
where + A: RefUnwindSafe, + T: RefUnwindSafe,

Blanket Implementations§

source§

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

source§

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more
source§

impl<T> Borrow<T> for T
where + T: ?Sized,

source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
source§

impl<T> BorrowMut<T> for T
where + 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 T
where + 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 I
where + 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, U> TryFrom<U> for T
where + 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 T
where + 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/hashbrown/hash_table/struct.ExtractIf.html b/hashbrown/hash_table/struct.ExtractIf.html new file mode 100644 index 0000000000..e7e4750f81 --- /dev/null +++ b/hashbrown/hash_table/struct.ExtractIf.html @@ -0,0 +1,207 @@ +ExtractIf in hashbrown::hash_table - Rust
+

Struct hashbrown::hash_table::ExtractIf

source · 
pub struct ExtractIf<'a, T, F, A: Allocator = Global>
where
+    F: FnMut(&mut T) -> bool,
{ /* private fields */ }
Expand description

A draining iterator over entries of a HashTable which don’t satisfy the predicate f.

+

This struct is created by HashTable::extract_if. See its +documentation for more.

+

Trait Implementations§

source§

impl<T, F, A: Allocator> Iterator for ExtractIf<'_, T, F, A>
where + F: FnMut(&mut T) -> bool,

§

type Item = 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) -> usize
where + 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<(), NonZero<usize>>

🔬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 Self
where + Self: Sized,

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

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

Transforms an iterator into a collection. Read more
source§

fn collect_into<E>(self, collection: &mut E) -> &mut E
where + 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) -> bool
where + 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) -> R
where + 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) -> R
where + 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) -> B
where + 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>>>::TryType
where + 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) -> bool
where + 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) -> bool
where + 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>>>::TryType
where + 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) -> S
where + Self: Sized, + S: Sum<Self::Item>,

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

fn product<P>(self) -> P
where + 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) -> Ordering
where + 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) -> bool
where + 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) -> bool
where + 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) -> bool
where + 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) -> bool
where + 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) -> bool
where + 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) -> bool
where + 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) -> bool
where + 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) -> bool
where + Self: Sized, + F: FnMut(&Self::Item, &Self::Item) -> bool,

🔬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) -> bool
where + 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<T, F, A: Allocator> FusedIterator for ExtractIf<'_, T, F, A>
where + F: FnMut(&mut T) -> bool,

Auto Trait Implementations§

§

impl<'a, T, F, A> Freeze for ExtractIf<'a, T, F, A>
where + F: Freeze,

§

impl<'a, T, F, A> RefUnwindSafe for ExtractIf<'a, T, F, A>
where + A: RefUnwindSafe, + F: RefUnwindSafe, + T: RefUnwindSafe,

§

impl<'a, T, F, A> Send for ExtractIf<'a, T, F, A>
where + A: Send, + F: Send, + T: Send,

§

impl<'a, T, F, A> Sync for ExtractIf<'a, T, F, A>
where + A: Sync, + F: Sync, + T: Sync,

§

impl<'a, T, F, A> Unpin for ExtractIf<'a, T, F, A>
where + F: Unpin,

§

impl<'a, T, F, A = Global> !UnwindSafe for ExtractIf<'a, T, F, A>

Blanket Implementations§

source§

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

source§

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more
source§

impl<T> Borrow<T> for T
where + T: ?Sized,

source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
source§

impl<T> BorrowMut<T> for T
where + 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 T
where + 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 I
where + 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, U> TryFrom<U> for T
where + 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 T
where + 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/hashbrown/hash_table/struct.HashTable.html b/hashbrown/hash_table/struct.HashTable.html new file mode 100644 index 0000000000..2950aa465d --- /dev/null +++ b/hashbrown/hash_table/struct.HashTable.html @@ -0,0 +1,588 @@ +HashTable in hashbrown::hash_table - Rust
+

Struct hashbrown::hash_table::HashTable

source · 
pub struct HashTable<T, A = Global>
where
+    A: Allocator,
{ /* private fields */ }
Expand description

Low-level hash table with explicit hashing.

+

The primary use case for this type over HashMap or HashSet is to +support types that do not implement the Hash and Eq traits, but +instead require additional data not contained in the key itself to compute a +hash and compare two elements for equality.

+

Examples of when this can be useful include:

+
    +
  • An IndexMap implementation where indices into a Vec are stored as +elements in a HashTable<usize>. Hashing and comparing the elements +requires indexing the associated Vec to get the actual value referred to +by the index.
    • +
  • Avoiding re-computing a hash when it is already known.
    • +
  • Mutating the key of an element in a way that doesn’t affect its hash.
    • +
+

To achieve this, HashTable methods that search for an element in the table +require a hash value and equality function to be explicitly passed in as +arguments. The method will then iterate over the elements with the given +hash and call the equality function on each of them, until a match is found.

+

In most cases, a HashTable will not be exposed directly in an API. It will +instead be wrapped in a helper type which handles the work of calculating +hash values and comparing elements.

+

Due to its low-level nature, this type provides fewer guarantees than +HashMap and HashSet. Specifically, the API allows you to shoot +yourself in the foot by having multiple elements with identical keys in the +table. The table itself will still function correctly and lookups will +arbitrarily return one of the matching elements. However you should avoid +doing this because it changes the runtime of hash table operations from +O(1) to O(k) where k is the number of duplicate entries.

+

Implementations§

source§

impl<T> HashTable<T, Global>

source

pub const fn new() -> Self

Creates an empty HashTable.

+

The hash table is initially created with a capacity of 0, so it will not allocate until it +is first inserted into.

+
§Examples
+
use hashbrown::HashTable;
+let mut table: HashTable<&str> = HashTable::new();
+assert_eq!(table.len(), 0);
+assert_eq!(table.capacity(), 0);
+
source

pub fn with_capacity(capacity: usize) -> Self

Creates an empty HashTable with the specified capacity.

+

The hash table will be able to hold at least capacity elements without +reallocating. If capacity is 0, the hash table will not allocate.

+
§Examples
+
use hashbrown::HashTable;
+let mut table: HashTable<&str> = HashTable::with_capacity(10);
+assert_eq!(table.len(), 0);
+assert!(table.capacity() >= 10);
+
source§

impl<T, A> HashTable<T, A>
where + A: Allocator,

source

pub const fn new_in(alloc: A) -> Self

Creates an empty HashTable using the given allocator.

+

The hash table is initially created with a capacity of 0, so it will not allocate until it +is first inserted into.

+
§Examples
+
use ahash::AHasher;
+use bumpalo::Bump;
+use hashbrown::HashTable;
+use std::hash::{BuildHasher, BuildHasherDefault};
+
+let bump = Bump::new();
+let mut table = HashTable::new_in(&bump);
+let hasher = BuildHasherDefault::<AHasher>::default();
+let hasher = |val: &_| hasher.hash_one(val);
+
+// The created HashTable holds none elements
+assert_eq!(table.len(), 0);
+
+// The created HashTable also doesn't allocate memory
+assert_eq!(table.capacity(), 0);
+
+// Now we insert element inside created HashTable
+table.insert_unique(hasher(&"One"), "One", hasher);
+// We can see that the HashTable holds 1 element
+assert_eq!(table.len(), 1);
+// And it also allocates some capacity
+assert!(table.capacity() > 1);
+
source

pub fn with_capacity_in(capacity: usize, alloc: A) -> Self

Creates an empty HashTable with the specified capacity using the given allocator.

+

The hash table will be able to hold at least capacity elements without +reallocating. If capacity is 0, the hash table will not allocate.

+
§Examples
+
use ahash::AHasher;
+use bumpalo::Bump;
+use hashbrown::HashTable;
+use std::hash::{BuildHasher, BuildHasherDefault};
+
+let bump = Bump::new();
+let mut table = HashTable::with_capacity_in(5, &bump);
+let hasher = BuildHasherDefault::<AHasher>::default();
+let hasher = |val: &_| hasher.hash_one(val);
+
+// The created HashTable holds none elements
+assert_eq!(table.len(), 0);
+// But it can hold at least 5 elements without reallocating
+let empty_map_capacity = table.capacity();
+assert!(empty_map_capacity >= 5);
+
+// Now we insert some 5 elements inside created HashTable
+table.insert_unique(hasher(&"One"), "One", hasher);
+table.insert_unique(hasher(&"Two"), "Two", hasher);
+table.insert_unique(hasher(&"Three"), "Three", hasher);
+table.insert_unique(hasher(&"Four"), "Four", hasher);
+table.insert_unique(hasher(&"Five"), "Five", hasher);
+
+// We can see that the HashTable holds 5 elements
+assert_eq!(table.len(), 5);
+// But its capacity isn't changed
+assert_eq!(table.capacity(), empty_map_capacity)
+
source

pub fn allocator(&self) -> &A

Returns a reference to the underlying allocator.

+
source

pub fn find(&self, hash: u64, eq: impl FnMut(&T) -> bool) -> Option<&T>

Returns a reference to an entry in the table with the given hash and +which satisfies the equality function passed.

+

This method will call eq for all entries with the given hash, but may +also call it for entries with a different hash. eq should only return +true for the desired entry, at which point the search is stopped.

+
§Examples
+
use ahash::AHasher;
+use hashbrown::HashTable;
+use std::hash::{BuildHasher, BuildHasherDefault};
+
+let mut table = HashTable::new();
+let hasher = BuildHasherDefault::<AHasher>::default();
+let hasher = |val: &_| hasher.hash_one(val);
+table.insert_unique(hasher(&1), 1, hasher);
+table.insert_unique(hasher(&2), 2, hasher);
+table.insert_unique(hasher(&3), 3, hasher);
+assert_eq!(table.find(hasher(&2), |&val| val == 2), Some(&2));
+assert_eq!(table.find(hasher(&4), |&val| val == 4), None);
+
source

pub fn find_mut( + &mut self, + hash: u64, + eq: impl FnMut(&T) -> bool +) -> Option<&mut T>

Returns a mutable reference to an entry in the table with the given hash +and which satisfies the equality function passed.

+

This method will call eq for all entries with the given hash, but may +also call it for entries with a different hash. eq should only return +true for the desired entry, at which point the search is stopped.

+

When mutating an entry, you should ensure that it still retains the same +hash value as when it was inserted, otherwise lookups of that entry may +fail to find it.

+
§Examples
+
use ahash::AHasher;
+use hashbrown::HashTable;
+use std::hash::{BuildHasher, BuildHasherDefault};
+
+let mut table = HashTable::new();
+let hasher = BuildHasherDefault::<AHasher>::default();
+let hasher = |val: &_| hasher.hash_one(val);
+table.insert_unique(hasher(&1), (1, "a"), |val| hasher(&val.0));
+if let Some(val) = table.find_mut(hasher(&1), |val| val.0 == 1) {
+    val.1 = "b";
+}
+assert_eq!(table.find(hasher(&1), |val| val.0 == 1), Some(&(1, "b")));
+assert_eq!(table.find(hasher(&2), |val| val.0 == 2), None);
+
source

pub fn find_entry( + &mut self, + hash: u64, + eq: impl FnMut(&T) -> bool +) -> Result<OccupiedEntry<'_, T, A>, AbsentEntry<'_, T, A>>

Returns an OccupiedEntry for an entry in the table with the given hash +and which satisfies the equality function passed.

+

This can be used to remove the entry from the table. Call +HashTable::entry instead if you wish to insert an entry if the +lookup fails.

+

This method will call eq for all entries with the given hash, but may +also call it for entries with a different hash. eq should only return +true for the desired entry, at which point the search is stopped.

+
§Examples
+
use ahash::AHasher;
+use hashbrown::HashTable;
+use std::hash::{BuildHasher, BuildHasherDefault};
+
+let mut table = HashTable::new();
+let hasher = BuildHasherDefault::<AHasher>::default();
+let hasher = |val: &_| hasher.hash_one(val);
+table.insert_unique(hasher(&1), (1, "a"), |val| hasher(&val.0));
+if let Ok(entry) = table.find_entry(hasher(&1), |val| val.0 == 1) {
+    entry.remove();
+}
+assert_eq!(table.find(hasher(&1), |val| val.0 == 1), None);
+
source

pub fn entry( + &mut self, + hash: u64, + eq: impl FnMut(&T) -> bool, + hasher: impl Fn(&T) -> u64 +) -> Entry<'_, T, A>

Returns an Entry for an entry in the table with the given hash +and which satisfies the equality function passed.

+

This can be used to remove the entry from the table, or insert a new +entry with the given hash if one doesn’t already exist.

+

This method will call eq for all entries with the given hash, but may +also call it for entries with a different hash. eq should only return +true for the desired entry, at which point the search is stopped.

+

This method may grow the table in preparation for an insertion. Call +HashTable::find_entry if this is undesirable.

+

hasher is called if entries need to be moved or copied to a new table. +This must return the same hash value that each entry was inserted with.

+
§Examples
+
use ahash::AHasher;
+use hashbrown::hash_table::Entry;
+use hashbrown::HashTable;
+use std::hash::{BuildHasher, BuildHasherDefault};
+
+let mut table = HashTable::new();
+let hasher = BuildHasherDefault::<AHasher>::default();
+let hasher = |val: &_| hasher.hash_one(val);
+table.insert_unique(hasher(&1), (1, "a"), |val| hasher(&val.0));
+if let Entry::Occupied(entry) = table.entry(hasher(&1), |val| val.0 == 1, |val| hasher(&val.0))
+{
+    entry.remove();
+}
+if let Entry::Vacant(entry) = table.entry(hasher(&2), |val| val.0 == 2, |val| hasher(&val.0)) {
+    entry.insert((2, "b"));
+}
+assert_eq!(table.find(hasher(&1), |val| val.0 == 1), None);
+assert_eq!(table.find(hasher(&2), |val| val.0 == 2), Some(&(2, "b")));
+
source

pub fn insert_unique( + &mut self, + hash: u64, + value: T, + hasher: impl Fn(&T) -> u64 +) -> OccupiedEntry<'_, T, A>

Inserts an element into the HashTable with the given hash value, but +without checking whether an equivalent element already exists within the +table.

+

hasher is called if entries need to be moved or copied to a new table. +This must return the same hash value that each entry was inserted with.

+
§Examples
+
use ahash::AHasher;
+use hashbrown::HashTable;
+use std::hash::{BuildHasher, BuildHasherDefault};
+
+let mut v = HashTable::new();
+let hasher = BuildHasherDefault::<AHasher>::default();
+let hasher = |val: &_| hasher.hash_one(val);
+v.insert_unique(hasher(&1), 1, hasher);
+
source

pub fn clear(&mut self)

Clears the table, removing all values.

+
§Examples
+
use ahash::AHasher;
+use hashbrown::HashTable;
+use std::hash::{BuildHasher, BuildHasherDefault};
+
+let mut v = HashTable::new();
+let hasher = BuildHasherDefault::<AHasher>::default();
+let hasher = |val: &_| hasher.hash_one(val);
+v.insert_unique(hasher(&1), 1, hasher);
+v.clear();
+assert!(v.is_empty());
+
source

pub fn shrink_to_fit(&mut self, hasher: impl Fn(&T) -> u64)

Shrinks the capacity of the table as much as possible. It will drop +down as much as possible while maintaining the internal rules +and possibly leaving some space in accordance with the resize policy.

+

hasher is called if entries need to be moved or copied to a new table. +This must return the same hash value that each entry was inserted with.

+
§Examples
+
use ahash::AHasher;
+use hashbrown::HashTable;
+use std::hash::{BuildHasher, BuildHasherDefault};
+
+let mut table = HashTable::with_capacity(100);
+let hasher = BuildHasherDefault::<AHasher>::default();
+let hasher = |val: &_| hasher.hash_one(val);
+table.insert_unique(hasher(&1), 1, hasher);
+table.insert_unique(hasher(&2), 2, hasher);
+assert!(table.capacity() >= 100);
+table.shrink_to_fit(hasher);
+assert!(table.capacity() >= 2);
+
source

pub fn shrink_to(&mut self, min_capacity: usize, hasher: impl Fn(&T) -> u64)

Shrinks the capacity of the table with a lower limit. It will drop +down no lower than the supplied limit while maintaining the internal rules +and possibly leaving some space in accordance with the resize policy.

+

hasher is called if entries need to be moved or copied to a new table. +This must return the same hash value that each entry was inserted with.

+

Panics if the current capacity is smaller than the supplied +minimum capacity.

+
§Examples
+
use ahash::AHasher;
+use hashbrown::HashTable;
+use std::hash::{BuildHasher, BuildHasherDefault};
+
+let mut table = HashTable::with_capacity(100);
+let hasher = BuildHasherDefault::<AHasher>::default();
+let hasher = |val: &_| hasher.hash_one(val);
+table.insert_unique(hasher(&1), 1, hasher);
+table.insert_unique(hasher(&2), 2, hasher);
+assert!(table.capacity() >= 100);
+table.shrink_to(10, hasher);
+assert!(table.capacity() >= 10);
+table.shrink_to(0, hasher);
+assert!(table.capacity() >= 2);
+
source

pub fn reserve(&mut self, additional: usize, hasher: impl Fn(&T) -> u64)

Reserves capacity for at least additional more elements to be inserted +in the HashTable. The collection may reserve more space to avoid +frequent reallocations.

+

hasher is called if entries need to be moved or copied to a new table. +This must return the same hash value that each entry was inserted with.

+
§Panics
+

Panics if the new capacity exceeds isize::MAX bytes and abort the program +in case of allocation error. Use try_reserve instead +if you want to handle memory allocation failure.

+
§Examples
+
use ahash::AHasher;
+use hashbrown::HashTable;
+use std::hash::{BuildHasher, BuildHasherDefault};
+
+let mut table: HashTable<i32> = HashTable::new();
+let hasher = BuildHasherDefault::<AHasher>::default();
+let hasher = |val: &_| hasher.hash_one(val);
+table.reserve(10, hasher);
+assert!(table.capacity() >= 10);
+
source

pub fn try_reserve( + &mut self, + additional: usize, + hasher: impl Fn(&T) -> u64 +) -> Result<(), TryReserveError>

Tries to reserve capacity for at least additional more elements to be inserted +in the given HashTable. The collection may reserve more space to avoid +frequent reallocations.

+

hasher is called if entries need to be moved or copied to a new table. +This must return the same hash value that each entry was inserted with.

+
§Errors
+

If the capacity overflows, or the allocator reports a failure, then an error +is returned.

+
§Examples
+
use ahash::AHasher;
+use hashbrown::HashTable;
+use std::hash::{BuildHasher, BuildHasherDefault};
+
+let mut table: HashTable<i32> = HashTable::new();
+let hasher = BuildHasherDefault::<AHasher>::default();
+let hasher = |val: &_| hasher.hash_one(val);
+table
+    .try_reserve(10, hasher)
+    .expect("why is the test harness OOMing on 10 bytes?");
+
source

pub fn capacity(&self) -> usize

Returns the number of elements the table can hold without reallocating.

+
§Examples
+
use hashbrown::HashTable;
+let table: HashTable<i32> = HashTable::with_capacity(100);
+assert!(table.capacity() >= 100);
+
source

pub fn len(&self) -> usize

Returns the number of elements in the table.

+
§Examples
+
use ahash::AHasher;
+use hashbrown::HashTable;
+use std::hash::{BuildHasher, BuildHasherDefault};
+
+let hasher = BuildHasherDefault::<AHasher>::default();
+let hasher = |val: &_| hasher.hash_one(val);
+let mut v = HashTable::new();
+assert_eq!(v.len(), 0);
+v.insert_unique(hasher(&1), 1, hasher);
+assert_eq!(v.len(), 1);
+
source

pub fn is_empty(&self) -> bool

Returns true if the set contains no elements.

+
§Examples
+
use ahash::AHasher;
+use hashbrown::HashTable;
+use std::hash::{BuildHasher, BuildHasherDefault};
+
+let hasher = BuildHasherDefault::<AHasher>::default();
+let hasher = |val: &_| hasher.hash_one(val);
+let mut v = HashTable::new();
+assert!(v.is_empty());
+v.insert_unique(hasher(&1), 1, hasher);
+assert!(!v.is_empty());
+
source

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

An iterator visiting all elements in arbitrary order. +The iterator element type is &'a T.

+
§Examples
+
use ahash::AHasher;
+use hashbrown::HashTable;
+use std::hash::{BuildHasher, BuildHasherDefault};
+
+let mut table = HashTable::new();
+let hasher = BuildHasherDefault::<AHasher>::default();
+let hasher = |val: &_| hasher.hash_one(val);
+table.insert_unique(hasher(&"a"), "b", hasher);
+table.insert_unique(hasher(&"b"), "b", hasher);
+
+// Will print in an arbitrary order.
+for x in table.iter() {
+    println!("{}", x);
+}
+
source

pub fn iter_mut(&mut self) -> IterMut<'_, T> ⓘ

An iterator visiting all elements in arbitrary order, +with mutable references to the elements. +The iterator element type is &'a mut T.

+
§Examples
+
use ahash::AHasher;
+use hashbrown::HashTable;
+use std::hash::{BuildHasher, BuildHasherDefault};
+
+let mut table = HashTable::new();
+let hasher = BuildHasherDefault::<AHasher>::default();
+let hasher = |val: &_| hasher.hash_one(val);
+table.insert_unique(hasher(&1), 1, hasher);
+table.insert_unique(hasher(&2), 2, hasher);
+table.insert_unique(hasher(&3), 3, hasher);
+
+// Update all values
+for val in table.iter_mut() {
+    *val *= 2;
+}
+
+assert_eq!(table.len(), 3);
+let mut vec: Vec<i32> = Vec::new();
+
+for val in &table {
+    println!("val: {}", val);
+    vec.push(*val);
+}
+
+// The `Iter` iterator produces items in arbitrary order, so the
+// items must be sorted to test them against a sorted array.
+vec.sort_unstable();
+assert_eq!(vec, [2, 4, 6]);
+
+assert_eq!(table.len(), 3);
+
source

pub fn retain(&mut self, f: impl FnMut(&mut T) -> bool)

Retains only the elements specified by the predicate.

+

In other words, remove all elements e such that f(&e) returns false.

+
§Examples
+
use ahash::AHasher;
+use hashbrown::HashTable;
+use std::hash::{BuildHasher, BuildHasherDefault};
+
+let mut table = HashTable::new();
+let hasher = BuildHasherDefault::<AHasher>::default();
+let hasher = |val: &_| hasher.hash_one(val);
+for x in 1..=6 {
+    table.insert_unique(hasher(&x), x, hasher);
+}
+table.retain(|&mut x| x % 2 == 0);
+assert_eq!(table.len(), 3);
+
source

pub fn drain(&mut self) -> Drain<'_, T, A> ⓘ

Clears the set, returning all elements in an iterator.

+
§Examples
+
use ahash::AHasher;
+use hashbrown::HashTable;
+use std::hash::{BuildHasher, BuildHasherDefault};
+
+let mut table = HashTable::new();
+let hasher = BuildHasherDefault::<AHasher>::default();
+let hasher = |val: &_| hasher.hash_one(val);
+for x in 1..=3 {
+    table.insert_unique(hasher(&x), x, hasher);
+}
+assert!(!table.is_empty());
+
+// print 1, 2, 3 in an arbitrary order
+for i in table.drain() {
+    println!("{}", i);
+}
+
+assert!(table.is_empty());
+
source

pub fn extract_if<F>(&mut self, f: F) -> ExtractIf<'_, T, F, A> ⓘ
where + F: FnMut(&mut T) -> bool,

Drains elements which are true under the given predicate, +and returns an iterator over the removed items.

+

In other words, move all elements e such that f(&e) returns true out +into another iterator.

+

If the returned ExtractIf is not exhausted, e.g. because it is dropped without iterating +or the iteration short-circuits, then the remaining elements will be retained. +Use retain() with a negated predicate if you do not need the returned iterator.

+
§Examples
+
use ahash::AHasher;
+use hashbrown::HashTable;
+use std::hash::{BuildHasher, BuildHasherDefault};
+
+let mut table = HashTable::new();
+let hasher = BuildHasherDefault::<AHasher>::default();
+let hasher = |val: &_| hasher.hash_one(val);
+for x in 0..8 {
+    table.insert_unique(hasher(&x), x, hasher);
+}
+let drained: Vec<i32> = table.extract_if(|&mut v| v % 2 == 0).collect();
+
+let mut evens = drained.into_iter().collect::<Vec<_>>();
+let mut odds = table.into_iter().collect::<Vec<_>>();
+evens.sort();
+odds.sort();
+
+assert_eq!(evens, vec![0, 2, 4, 6]);
+assert_eq!(odds, vec![1, 3, 5, 7]);
+
source

pub fn get_many_mut<const N: usize>( + &mut self, + hashes: [u64; N], + eq: impl FnMut(usize, &T) -> bool +) -> Option<[&mut T; N]>

Attempts to get mutable references to N values in the map at once.

+

The eq argument should be a closure such that eq(i, k) returns true if k is equal to +the ith key to be looked up.

+

Returns an array of length N with the results of each query. For soundness, at most one +mutable reference will be returned to any value. None will be returned if any of the +keys are duplicates or missing.

+
§Examples
+
use ahash::AHasher;
+use hashbrown::hash_table::Entry;
+use hashbrown::HashTable;
+use std::hash::{BuildHasher, BuildHasherDefault};
+
+let mut libraries: HashTable<(&str, u32)> = HashTable::new();
+let hasher = BuildHasherDefault::<AHasher>::default();
+let hasher = |val: &_| hasher.hash_one(val);
+for (k, v) in [
+    ("Bodleian Library", 1602),
+    ("Athenæum", 1807),
+    ("Herzogin-Anna-Amalia-Bibliothek", 1691),
+    ("Library of Congress", 1800),
+] {
+    libraries.insert_unique(hasher(&k), (k, v), |(k, _)| hasher(&k));
+}
+
+let keys = ["Athenæum", "Library of Congress"];
+let got = libraries.get_many_mut(keys.map(|k| hasher(&k)), |i, val| keys[i] == val.0);
+assert_eq!(
+    got,
+    Some([&mut ("Athenæum", 1807), &mut ("Library of Congress", 1800),]),
+);
+
+// Missing keys result in None
+let keys = ["Athenæum", "New York Public Library"];
+let got = libraries.get_many_mut(keys.map(|k| hasher(&k)), |i, val| keys[i] == val.0);
+assert_eq!(got, None);
+
+// Duplicate keys result in None
+let keys = ["Athenæum", "Athenæum"];
+let got = libraries.get_many_mut(keys.map(|k| hasher(&k)), |i, val| keys[i] == val.0);
+assert_eq!(got, None);
+
source

pub unsafe fn get_many_unchecked_mut<const N: usize>( + &mut self, + hashes: [u64; N], + eq: impl FnMut(usize, &T) -> bool +) -> Option<[&mut T; N]>

Attempts to get mutable references to N values in the map at once, without validating that +the values are unique.

+

The eq argument should be a closure such that eq(i, k) returns true if k is equal to +the ith key to be looked up.

+

Returns an array of length N with the results of each query. None will be returned if +any of the keys are missing.

+

For a safe alternative see get_many_mut.

+
§Safety
+

Calling this method with overlapping keys is undefined behavior even if the resulting +references are not used.

+
§Examples
+
use ahash::AHasher;
+use hashbrown::hash_table::Entry;
+use hashbrown::HashTable;
+use std::hash::{BuildHasher, BuildHasherDefault};
+
+let mut libraries: HashTable<(&str, u32)> = HashTable::new();
+let hasher = BuildHasherDefault::<AHasher>::default();
+let hasher = |val: &_| hasher.hash_one(val);
+for (k, v) in [
+    ("Bodleian Library", 1602),
+    ("Athenæum", 1807),
+    ("Herzogin-Anna-Amalia-Bibliothek", 1691),
+    ("Library of Congress", 1800),
+] {
+    libraries.insert_unique(hasher(&k), (k, v), |(k, _)| hasher(&k));
+}
+
+let keys = ["Athenæum", "Library of Congress"];
+let got = libraries.get_many_mut(keys.map(|k| hasher(&k)), |i, val| keys[i] == val.0);
+assert_eq!(
+    got,
+    Some([&mut ("Athenæum", 1807), &mut ("Library of Congress", 1800),]),
+);
+
+// Missing keys result in None
+let keys = ["Athenæum", "New York Public Library"];
+let got = libraries.get_many_mut(keys.map(|k| hasher(&k)), |i, val| keys[i] == val.0);
+assert_eq!(got, None);
+
+// Duplicate keys result in None
+let keys = ["Athenæum", "Athenæum"];
+let got = libraries.get_many_mut(keys.map(|k| hasher(&k)), |i, val| keys[i] == val.0);
+assert_eq!(got, None);
+

Trait Implementations§

source§

impl<T, A> Clone for HashTable<T, A>
where + T: Clone, + A: Allocator + Clone,

source§

fn clone(&self) -> Self

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<T, A> Debug for HashTable<T, A>
where + T: Debug, + A: Allocator,

source§

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

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

impl<T, A> Default for HashTable<T, A>
where + A: Allocator + Default,

source§

fn default() -> Self

Returns the “default value” for a type. Read more
source§

impl<'a, T, A> IntoIterator for &'a HashTable<T, A>
where + A: Allocator,

§

type Item = &'a T

The type of the elements being iterated over.
§

type IntoIter = Iter<'a, T>

Which kind of iterator are we turning this into?
source§

fn into_iter(self) -> Iter<'a, T> ⓘ

Creates an iterator from a value. Read more
source§

impl<'a, T, A> IntoIterator for &'a mut HashTable<T, A>
where + A: Allocator,

§

type Item = &'a mut T

The type of the elements being iterated over.
§

type IntoIter = IterMut<'a, T>

Which kind of iterator are we turning this into?
source§

fn into_iter(self) -> IterMut<'a, T> ⓘ

Creates an iterator from a value. Read more
source§

impl<T, A> IntoIterator for HashTable<T, A>
where + A: Allocator,

§

type Item = T

The type of the elements being iterated over.
§

type IntoIter = IntoIter<T, A>

Which kind of iterator are we turning this into?
source§

fn into_iter(self) -> IntoIter<T, A> ⓘ

Creates an iterator from a value. Read more

Auto Trait Implementations§

§

impl<T, A> Freeze for HashTable<T, A>
where + A: Freeze,

§

impl<T, A> RefUnwindSafe for HashTable<T, A>
where + A: RefUnwindSafe, + T: RefUnwindSafe,

§

impl<T, A> Send for HashTable<T, A>
where + A: Send, + T: Send,

§

impl<T, A> Sync for HashTable<T, A>
where + A: Sync, + T: Sync,

§

impl<T, A> Unpin for HashTable<T, A>
where + A: Unpin, + T: Unpin,

§

impl<T, A> UnwindSafe for HashTable<T, A>
where + A: UnwindSafe, + T: UnwindSafe,

Blanket Implementations§

source§

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

source§

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more
source§

impl<T> Borrow<T> for T
where + T: ?Sized,

source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
source§

impl<T> BorrowMut<T> for T
where + 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 T
where + 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 T
where + 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 T
where + 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 T
where + 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/hashbrown/hash_table/struct.IntoIter.html b/hashbrown/hash_table/struct.IntoIter.html new file mode 100644 index 0000000000..bc6a0f4113 --- /dev/null +++ b/hashbrown/hash_table/struct.IntoIter.html @@ -0,0 +1,210 @@ +IntoIter in hashbrown::hash_table - Rust
+

Struct hashbrown::hash_table::IntoIter

source · 
pub struct IntoIter<T, A = Global>
where
+    A: Allocator,
{ /* private fields */ }
Expand description

An owning iterator over the entries of a HashTable in arbitrary order. +The iterator element type is T.

+

This struct is created by the into_iter method on HashTable +(provided by the IntoIterator trait). See its documentation for more. +The table cannot be used after calling that method.

+

Trait Implementations§

source§

impl<T, A> ExactSizeIterator for IntoIter<T, A>
where + A: Allocator,

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<T, A> Iterator for IntoIter<T, A>
where + A: Allocator,

§

type Item = 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 fold<B, F>(self, init: B, f: F) -> B
where + Self: Sized, + F: FnMut(B, Self::Item) -> B,

Folds every element into an accumulator by applying an operation, +returning the final result. 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) -> usize
where + 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<(), NonZero<usize>>

🔬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 Self
where + Self: Sized,

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

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

Transforms an iterator into a collection. Read more
source§

fn collect_into<E>(self, collection: &mut E) -> &mut E
where + 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) -> bool
where + 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) -> R
where + 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) -> R
where + 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.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>>>::TryType
where + 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) -> bool
where + 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) -> bool
where + 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>>>::TryType
where + 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) -> S
where + Self: Sized, + S: Sum<Self::Item>,

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

fn product<P>(self) -> P
where + 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) -> Ordering
where + 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) -> bool
where + 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) -> bool
where + 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) -> bool
where + 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) -> bool
where + 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) -> bool
where + 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) -> bool
where + 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) -> bool
where + 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) -> bool
where + Self: Sized, + F: FnMut(&Self::Item, &Self::Item) -> bool,

🔬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) -> bool
where + 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<T, A> FusedIterator for IntoIter<T, A>
where + A: Allocator,

Auto Trait Implementations§

§

impl<T, A> Freeze for IntoIter<T, A>
where + A: Freeze,

§

impl<T, A> RefUnwindSafe for IntoIter<T, A>
where + A: RefUnwindSafe, + T: RefUnwindSafe,

§

impl<T, A> Send for IntoIter<T, A>
where + A: Send, + T: Send,

§

impl<T, A> Sync for IntoIter<T, A>
where + A: Sync, + T: Sync,

§

impl<T, A> Unpin for IntoIter<T, A>
where + A: Unpin, + T: Unpin,

§

impl<T, A> UnwindSafe for IntoIter<T, A>
where + A: UnwindSafe, + T: UnwindSafe + RefUnwindSafe,

Blanket Implementations§

source§

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

source§

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more
source§

impl<T> Borrow<T> for T
where + T: ?Sized,

source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
source§

impl<T> BorrowMut<T> for T
where + 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 T
where + 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 I
where + 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, U> TryFrom<U> for T
where + 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 T
where + 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/hashbrown/hash_table/struct.Iter.html b/hashbrown/hash_table/struct.Iter.html new file mode 100644 index 0000000000..4e4ad29e9e --- /dev/null +++ b/hashbrown/hash_table/struct.Iter.html @@ -0,0 +1,198 @@ +Iter in hashbrown::hash_table - Rust
+

Struct hashbrown::hash_table::Iter

source · 
pub struct Iter<'a, T> { /* private fields */ }
Expand description

An iterator over the entries of a HashTable in arbitrary order. +The iterator element type is &'a T.

+

This struct is created by the iter method on HashTable. See its +documentation for more.

+

Trait Implementations§

source§

impl<T> ExactSizeIterator for Iter<'_, 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> Iterator for Iter<'a, T>

§

type Item = &'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 fold<B, F>(self, init: B, f: F) -> B
where + Self: Sized, + F: FnMut(B, Self::Item) -> B,

Folds every element into an accumulator by applying an operation, +returning the final result. 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) -> usize
where + 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<(), NonZero<usize>>

🔬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 Self
where + Self: Sized,

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

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

Transforms an iterator into a collection. Read more
source§

fn collect_into<E>(self, collection: &mut E) -> &mut E
where + 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) -> bool
where + 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) -> R
where + 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) -> R
where + 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.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>>>::TryType
where + 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) -> bool
where + 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) -> bool
where + 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>>>::TryType
where + 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) -> S
where + Self: Sized, + S: Sum<Self::Item>,

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

fn product<P>(self) -> P
where + 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) -> Ordering
where + 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) -> bool
where + 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) -> bool
where + 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) -> bool
where + 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) -> bool
where + 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) -> bool
where + 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) -> bool
where + 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) -> bool
where + 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) -> bool
where + Self: Sized, + F: FnMut(&Self::Item, &Self::Item) -> bool,

🔬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) -> bool
where + 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<T> FusedIterator for Iter<'_, T>

Auto Trait Implementations§

§

impl<'a, T> Freeze for Iter<'a, T>

§

impl<'a, T> RefUnwindSafe for Iter<'a, T>
where + T: RefUnwindSafe,

§

impl<'a, T> Send for Iter<'a, T>
where + T: Sync,

§

impl<'a, T> Sync for Iter<'a, T>
where + T: Sync,

§

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

§

impl<'a, T> UnwindSafe for Iter<'a, T>
where + T: RefUnwindSafe,

Blanket Implementations§

source§

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

source§

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more
source§

impl<T> Borrow<T> for T
where + T: ?Sized,

source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
source§

impl<T> BorrowMut<T> for T
where + 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 T
where + 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 I
where + 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, U> TryFrom<U> for T
where + 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 T
where + 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/hashbrown/hash_table/struct.IterMut.html b/hashbrown/hash_table/struct.IterMut.html new file mode 100644 index 0000000000..ba512f8820 --- /dev/null +++ b/hashbrown/hash_table/struct.IterMut.html @@ -0,0 +1,197 @@ +IterMut in hashbrown::hash_table - Rust
+

Struct hashbrown::hash_table::IterMut

source · 
pub struct IterMut<'a, T> { /* private fields */ }
Expand description

A mutable iterator over the entries of a HashTable in arbitrary order. +The iterator element type is &'a mut T.

+

This struct is created by the iter_mut method on HashTable. See its +documentation for more.

+

Trait Implementations§

source§

impl<T> ExactSizeIterator for IterMut<'_, 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> Iterator for IterMut<'a, T>

§

type Item = &'a mut 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 fold<B, F>(self, init: B, f: F) -> B
where + Self: Sized, + F: FnMut(B, Self::Item) -> B,

Folds every element into an accumulator by applying an operation, +returning the final result. 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) -> usize
where + 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<(), NonZero<usize>>

🔬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 Self
where + Self: Sized,

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

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

Transforms an iterator into a collection. Read more
source§

fn collect_into<E>(self, collection: &mut E) -> &mut E
where + 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) -> bool
where + 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) -> R
where + 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) -> R
where + 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.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>>>::TryType
where + 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) -> bool
where + 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) -> bool
where + 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>>>::TryType
where + 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) -> S
where + Self: Sized, + S: Sum<Self::Item>,

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

fn product<P>(self) -> P
where + 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) -> Ordering
where + 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) -> bool
where + 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) -> bool
where + 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) -> bool
where + 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) -> bool
where + 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) -> bool
where + 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) -> bool
where + 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) -> bool
where + 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) -> bool
where + Self: Sized, + F: FnMut(&Self::Item, &Self::Item) -> bool,

🔬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) -> bool
where + 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<T> FusedIterator for IterMut<'_, T>

Auto Trait Implementations§

§

impl<'a, T> Freeze for IterMut<'a, T>

§

impl<'a, T> RefUnwindSafe for IterMut<'a, T>
where + T: RefUnwindSafe,

§

impl<'a, T> Send for IterMut<'a, T>
where + T: Send,

§

impl<'a, T> Sync for IterMut<'a, T>
where + T: Sync,

§

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

§

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

Blanket Implementations§

source§

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

source§

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more
source§

impl<T> Borrow<T> for T
where + T: ?Sized,

source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
source§

impl<T> BorrowMut<T> for T
where + 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 T
where + 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 I
where + 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, U> TryFrom<U> for T
where + 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 T
where + 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/hashbrown/hash_table/struct.OccupiedEntry.html b/hashbrown/hash_table/struct.OccupiedEntry.html new file mode 100644 index 0000000000..5494ddf1cf --- /dev/null +++ b/hashbrown/hash_table/struct.OccupiedEntry.html @@ -0,0 +1,171 @@ +OccupiedEntry in hashbrown::hash_table - Rust
+

Struct hashbrown::hash_table::OccupiedEntry

source · 
pub struct OccupiedEntry<'a, T, A = Global>
where
+    A: Allocator,
{ /* private fields */ }
Expand description

A view into an occupied entry in a HashTable. +It is part of the Entry enum.

+

§Examples

+
use ahash::AHasher;
+use hashbrown::hash_table::{Entry, HashTable, OccupiedEntry};
+use std::hash::{BuildHasher, BuildHasherDefault};
+
+let mut table = HashTable::new();
+let hasher = BuildHasherDefault::<AHasher>::default();
+let hasher = |val: &_| hasher.hash_one(val);
+for x in ["a", "b", "c"] {
+    table.insert_unique(hasher(&x), x, hasher);
+}
+assert_eq!(table.len(), 3);
+
+let _entry_o: OccupiedEntry<_, _> = table.find_entry(hasher(&"a"), |&x| x == "a").unwrap();
+assert_eq!(table.len(), 3);
+
+// Existing key
+match table.entry(hasher(&"a"), |&x| x == "a", hasher) {
+    Entry::Vacant(_) => unreachable!(),
+    Entry::Occupied(view) => {
+        assert_eq!(view.get(), &"a");
+    }
+}
+
+assert_eq!(table.len(), 3);
+
+// Existing key (take)
+match table.entry(hasher(&"c"), |&x| x == "c", hasher) {
+    Entry::Vacant(_) => unreachable!(),
+    Entry::Occupied(view) => {
+        assert_eq!(view.remove().0, "c");
+    }
+}
+assert_eq!(table.find(hasher(&"c"), |&x| x == "c"), None);
+assert_eq!(table.len(), 2);
+

Implementations§

source§

impl<'a, T, A> OccupiedEntry<'a, T, A>
where + A: Allocator,

source

pub fn remove(self) -> (T, VacantEntry<'a, T, A>)

Takes the value out of the entry, and returns it along with a +VacantEntry that can be used to insert another value with the same +hash as the one that was just removed.

+
§Examples
+
use ahash::AHasher;
+use hashbrown::hash_table::Entry;
+use hashbrown::HashTable;
+use std::hash::{BuildHasher, BuildHasherDefault};
+
+let mut table: HashTable<&str> = HashTable::new();
+let hasher = BuildHasherDefault::<AHasher>::default();
+let hasher = |val: &_| hasher.hash_one(val);
+// The table is empty
+assert!(table.is_empty() && table.capacity() == 0);
+
+table.insert_unique(hasher(&"poneyland"), "poneyland", hasher);
+let capacity_before_remove = table.capacity();
+
+if let Entry::Occupied(o) = table.entry(hasher(&"poneyland"), |&x| x == "poneyland", hasher) {
+    assert_eq!(o.remove().0, "poneyland");
+}
+
+assert!(table
+    .find(hasher(&"poneyland"), |&x| x == "poneyland")
+    .is_none());
+// Now table hold none elements but capacity is equal to the old one
+assert!(table.len() == 0 && table.capacity() == capacity_before_remove);
+
source

pub fn get(&self) -> &T

Gets a reference to the value in the entry.

+
§Examples
+
use ahash::AHasher;
+use hashbrown::hash_table::Entry;
+use hashbrown::HashTable;
+use std::hash::{BuildHasher, BuildHasherDefault};
+
+let mut table: HashTable<&str> = HashTable::new();
+let hasher = BuildHasherDefault::<AHasher>::default();
+let hasher = |val: &_| hasher.hash_one(val);
+table.insert_unique(hasher(&"poneyland"), "poneyland", hasher);
+
+match table.entry(hasher(&"poneyland"), |&x| x == "poneyland", hasher) {
+    Entry::Vacant(_) => panic!(),
+    Entry::Occupied(entry) => assert_eq!(entry.get(), &"poneyland"),
+}
+
source

pub fn get_mut(&mut self) -> &mut T

Gets a mutable reference to the value in the entry.

+

If you need a reference to the OccupiedEntry which may outlive the +destruction of the Entry value, see into_mut.

+
§Examples
+
use ahash::AHasher;
+use hashbrown::hash_table::Entry;
+use hashbrown::HashTable;
+use std::hash::{BuildHasher, BuildHasherDefault};
+
+let mut table: HashTable<(&str, u32)> = HashTable::new();
+let hasher = BuildHasherDefault::<AHasher>::default();
+let hasher = |val: &_| hasher.hash_one(val);
+table.insert_unique(hasher(&"poneyland"), ("poneyland", 12), |(k, _)| hasher(&k));
+
+assert_eq!(
+    table.find(hasher(&"poneyland"), |&(x, _)| x == "poneyland",),
+    Some(&("poneyland", 12))
+);
+
+if let Entry::Occupied(mut o) = table.entry(
+    hasher(&"poneyland"),
+    |&(x, _)| x == "poneyland",
+    |(k, _)| hasher(&k),
+) {
+    o.get_mut().1 += 10;
+    assert_eq!(o.get().1, 22);
+
+    // We can use the same Entry multiple times.
+    o.get_mut().1 += 2;
+}
+
+assert_eq!(
+    table.find(hasher(&"poneyland"), |&(x, _)| x == "poneyland",),
+    Some(&("poneyland", 24))
+);
+
source

pub fn into_mut(self) -> &'a mut T

Converts the OccupiedEntry into a mutable reference to the value in the entry +with a lifetime bound to the table itself.

+

If you need multiple references to the OccupiedEntry, see get_mut.

+
§Examples
+
use ahash::AHasher;
+use hashbrown::hash_table::Entry;
+use hashbrown::HashTable;
+use std::hash::{BuildHasher, BuildHasherDefault};
+
+let mut table: HashTable<(&str, u32)> = HashTable::new();
+let hasher = BuildHasherDefault::<AHasher>::default();
+let hasher = |val: &_| hasher.hash_one(val);
+table.insert_unique(hasher(&"poneyland"), ("poneyland", 12), |(k, _)| hasher(&k));
+
+assert_eq!(
+    table.find(hasher(&"poneyland"), |&(x, _)| x == "poneyland",),
+    Some(&("poneyland", 12))
+);
+
+let value: &mut (&str, u32);
+match table.entry(
+    hasher(&"poneyland"),
+    |&(x, _)| x == "poneyland",
+    |(k, _)| hasher(&k),
+) {
+    Entry::Occupied(entry) => value = entry.into_mut(),
+    Entry::Vacant(_) => panic!(),
+}
+value.1 += 10;
+
+assert_eq!(
+    table.find(hasher(&"poneyland"), |&(x, _)| x == "poneyland",),
+    Some(&("poneyland", 22))
+);
+
source

pub fn into_table(self) -> &'a mut HashTable<T, A>

Converts the OccupiedEntry into a mutable reference to the underlying +table.

+

Trait Implementations§

source§

impl<T: Debug, A: Allocator> Debug for OccupiedEntry<'_, T, A>

source§

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

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

impl<T, A> Send for OccupiedEntry<'_, T, A>
where + T: Send, + A: Send + Allocator,

source§

impl<T, A> Sync for OccupiedEntry<'_, T, A>
where + T: Sync, + A: Sync + Allocator,

Auto Trait Implementations§

§

impl<'a, T, A> Freeze for OccupiedEntry<'a, T, A>

§

impl<'a, T, A> RefUnwindSafe for OccupiedEntry<'a, T, A>
where + A: RefUnwindSafe, + T: RefUnwindSafe,

§

impl<'a, T, A> Unpin for OccupiedEntry<'a, T, A>

§

impl<'a, T, A = Global> !UnwindSafe for OccupiedEntry<'a, T, A>

Blanket Implementations§

source§

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

source§

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more
source§

impl<T> Borrow<T> for T
where + T: ?Sized,

source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
source§

impl<T> BorrowMut<T> for T
where + 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 T
where + 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 T
where + 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 T
where + 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/hashbrown/hash_table/struct.VacantEntry.html b/hashbrown/hash_table/struct.VacantEntry.html new file mode 100644 index 0000000000..e6fee558fb --- /dev/null +++ b/hashbrown/hash_table/struct.VacantEntry.html @@ -0,0 +1,68 @@ +VacantEntry in hashbrown::hash_table - Rust
+

Struct hashbrown::hash_table::VacantEntry

source · 
pub struct VacantEntry<'a, T, A = Global>
where
+    A: Allocator,
{ /* private fields */ }
Expand description

A view into a vacant entry in a HashTable. +It is part of the Entry enum.

+

§Examples

+
use ahash::AHasher;
+use hashbrown::hash_table::{Entry, HashTable, VacantEntry};
+use std::hash::{BuildHasher, BuildHasherDefault};
+
+let mut table: HashTable<&str> = HashTable::new();
+let hasher = BuildHasherDefault::<AHasher>::default();
+let hasher = |val: &_| hasher.hash_one(val);
+
+let entry_v: VacantEntry<_, _> = match table.entry(hasher(&"a"), |&x| x == "a", hasher) {
+    Entry::Vacant(view) => view,
+    Entry::Occupied(_) => unreachable!(),
+};
+entry_v.insert("a");
+assert!(table.find(hasher(&"a"), |&x| x == "a").is_some() && table.len() == 1);
+
+// Nonexistent key (insert)
+match table.entry(hasher(&"b"), |&x| x == "b", hasher) {
+    Entry::Vacant(view) => {
+        view.insert("b");
+    }
+    Entry::Occupied(_) => unreachable!(),
+}
+assert!(table.find(hasher(&"b"), |&x| x == "b").is_some() && table.len() == 2);
+

Implementations§

source§

impl<'a, T, A> VacantEntry<'a, T, A>
where + A: Allocator,

source

pub fn insert(self, value: T) -> OccupiedEntry<'a, T, A>

Inserts a new element into the table with the hash that was used to +obtain the VacantEntry.

+

An OccupiedEntry is returned for the newly inserted element.

+
§Examples
+
use ahash::AHasher;
+use hashbrown::hash_table::Entry;
+use hashbrown::HashTable;
+use std::hash::{BuildHasher, BuildHasherDefault};
+
+let mut table: HashTable<&str> = HashTable::new();
+let hasher = BuildHasherDefault::<AHasher>::default();
+let hasher = |val: &_| hasher.hash_one(val);
+
+if let Entry::Vacant(o) = table.entry(hasher(&"poneyland"), |&x| x == "poneyland", hasher) {
+    o.insert("poneyland");
+}
+assert_eq!(
+    table.find(hasher(&"poneyland"), |&x| x == "poneyland"),
+    Some(&"poneyland")
+);
+
source

pub fn into_table(self) -> &'a mut HashTable<T, A>

Converts the VacantEntry into a mutable reference to the underlying +table.

+

Trait Implementations§

source§

impl<T: Debug, A: Allocator> Debug for VacantEntry<'_, T, A>

source§

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

Formats the value using the given formatter. Read more

Auto Trait Implementations§

§

impl<'a, T, A> Freeze for VacantEntry<'a, T, A>

§

impl<'a, T, A> RefUnwindSafe for VacantEntry<'a, T, A>
where + A: RefUnwindSafe, + T: RefUnwindSafe,

§

impl<'a, T, A> Send for VacantEntry<'a, T, A>
where + A: Send, + T: Send,

§

impl<'a, T, A> Sync for VacantEntry<'a, T, A>
where + A: Sync, + T: Sync,

§

impl<'a, T, A> Unpin for VacantEntry<'a, T, A>

§

impl<'a, T, A = Global> !UnwindSafe for VacantEntry<'a, T, A>

Blanket Implementations§

source§

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

source§

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more
source§

impl<T> Borrow<T> for T
where + T: ?Sized,

source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
source§

impl<T> BorrowMut<T> for T
where + 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 T
where + 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 T
where + 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 T
where + 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/hashbrown/index.html b/hashbrown/index.html new file mode 100644 index 0000000000..b4e606eff4 --- /dev/null +++ b/hashbrown/index.html @@ -0,0 +1,9 @@ +hashbrown - Rust
+

Crate hashbrown

source ·
Expand description

This crate is a Rust port of Google’s high-performance SwissTable hash +map, adapted to make it a drop-in replacement for Rust’s standard HashMap +and HashSet types.

+

The original C++ version of SwissTable can be found here, and this +CppCon talk gives an overview of how the algorithm works.

+

Modules§

  • hash_map
    A hash map implemented with quadratic probing and SIMD lookup.
  • hash_set
    A hash set implemented as a HashMap where the value is ().
  • hash_table
    A hash table implemented with quadratic probing and SIMD lookup.
  • raw
    Experimental and unsafe RawTable API. This module is only available if the +raw feature is enabled.

Structs§

  • HashMap
    A hash map implemented with quadratic probing and SIMD lookup.
  • HashSet
    A hash set implemented as a HashMap where the value is ().
  • HashTable
    Low-level hash table with explicit hashing.

Enums§

Traits§

\ No newline at end of file diff --git a/hashbrown/map/enum.DefaultHashBuilder.html b/hashbrown/map/enum.DefaultHashBuilder.html new file mode 100644 index 0000000000..4ea833b2bd --- /dev/null +++ b/hashbrown/map/enum.DefaultHashBuilder.html @@ -0,0 +1,11 @@ + + + + + Redirection + + +

Redirecting to ../../hashbrown/hash_map/enum.DefaultHashBuilder.html...

+ + + \ No newline at end of file diff --git a/hashbrown/map/enum.Entry.html b/hashbrown/map/enum.Entry.html new file mode 100644 index 0000000000..4628247b0a --- /dev/null +++ b/hashbrown/map/enum.Entry.html @@ -0,0 +1,11 @@ + + + + + Redirection + + +

Redirecting to ../../hashbrown/hash_map/enum.Entry.html...

+ + + \ No newline at end of file diff --git a/hashbrown/map/enum.EntryRef.html b/hashbrown/map/enum.EntryRef.html new file mode 100644 index 0000000000..f5c02d90e6 --- /dev/null +++ b/hashbrown/map/enum.EntryRef.html @@ -0,0 +1,11 @@ + + + + + Redirection + + +

Redirecting to ../../hashbrown/hash_map/enum.EntryRef.html...

+ + + \ No newline at end of file diff --git a/hashbrown/map/enum.RawEntryMut.html b/hashbrown/map/enum.RawEntryMut.html new file mode 100644 index 0000000000..e5157b5bbc --- /dev/null +++ b/hashbrown/map/enum.RawEntryMut.html @@ -0,0 +1,11 @@ + + + + + Redirection + + +

Redirecting to ../../hashbrown/hash_map/enum.RawEntryMut.html...

+ + + \ No newline at end of file diff --git a/hashbrown/map/struct.Drain.html b/hashbrown/map/struct.Drain.html new file mode 100644 index 0000000000..8638f95693 --- /dev/null +++ b/hashbrown/map/struct.Drain.html @@ -0,0 +1,11 @@ + + + + + Redirection + + +

Redirecting to ../../hashbrown/hash_map/struct.Drain.html...

+ + + \ No newline at end of file diff --git a/hashbrown/map/struct.ExtractIf.html b/hashbrown/map/struct.ExtractIf.html new file mode 100644 index 0000000000..03109298ca --- /dev/null +++ b/hashbrown/map/struct.ExtractIf.html @@ -0,0 +1,11 @@ + + + + + Redirection + + +

Redirecting to ../../hashbrown/hash_map/struct.ExtractIf.html...

+ + + \ No newline at end of file diff --git a/hashbrown/map/struct.HashMap.html b/hashbrown/map/struct.HashMap.html new file mode 100644 index 0000000000..20322e82c3 --- /dev/null +++ b/hashbrown/map/struct.HashMap.html @@ -0,0 +1,11 @@ + + + + + Redirection + + +

Redirecting to ../../hashbrown/hash_map/struct.HashMap.html...

+ + + \ No newline at end of file diff --git a/hashbrown/map/struct.IntoIter.html b/hashbrown/map/struct.IntoIter.html new file mode 100644 index 0000000000..ab081586d7 --- /dev/null +++ b/hashbrown/map/struct.IntoIter.html @@ -0,0 +1,11 @@ + + + + + Redirection + + +

Redirecting to ../../hashbrown/hash_map/struct.IntoIter.html...

+ + + \ No newline at end of file diff --git a/hashbrown/map/struct.IntoKeys.html b/hashbrown/map/struct.IntoKeys.html new file mode 100644 index 0000000000..3d8c19e717 --- /dev/null +++ b/hashbrown/map/struct.IntoKeys.html @@ -0,0 +1,11 @@ + + + + + Redirection + + +

Redirecting to ../../hashbrown/hash_map/struct.IntoKeys.html...

+ + + \ No newline at end of file diff --git a/hashbrown/map/struct.IntoValues.html b/hashbrown/map/struct.IntoValues.html new file mode 100644 index 0000000000..9abfbe0128 --- /dev/null +++ b/hashbrown/map/struct.IntoValues.html @@ -0,0 +1,11 @@ + + + + + Redirection + + +

Redirecting to ../../hashbrown/hash_map/struct.IntoValues.html...

+ + + \ No newline at end of file diff --git a/hashbrown/map/struct.Iter.html b/hashbrown/map/struct.Iter.html new file mode 100644 index 0000000000..1d3bab1dd4 --- /dev/null +++ b/hashbrown/map/struct.Iter.html @@ -0,0 +1,11 @@ + + + + + Redirection + + +

Redirecting to ../../hashbrown/hash_map/struct.Iter.html...

+ + + \ No newline at end of file diff --git a/hashbrown/map/struct.IterMut.html b/hashbrown/map/struct.IterMut.html new file mode 100644 index 0000000000..c35f1e7650 --- /dev/null +++ b/hashbrown/map/struct.IterMut.html @@ -0,0 +1,11 @@ + + + + + Redirection + + +

Redirecting to ../../hashbrown/hash_map/struct.IterMut.html...

+ + + \ No newline at end of file diff --git a/hashbrown/map/struct.Keys.html b/hashbrown/map/struct.Keys.html new file mode 100644 index 0000000000..c4981538df --- /dev/null +++ b/hashbrown/map/struct.Keys.html @@ -0,0 +1,11 @@ + + + + + Redirection + + +

Redirecting to ../../hashbrown/hash_map/struct.Keys.html...

+ + + \ No newline at end of file diff --git a/hashbrown/map/struct.OccupiedEntry.html b/hashbrown/map/struct.OccupiedEntry.html new file mode 100644 index 0000000000..6df905bfa3 --- /dev/null +++ b/hashbrown/map/struct.OccupiedEntry.html @@ -0,0 +1,11 @@ + + + + + Redirection + + +

Redirecting to ../../hashbrown/hash_map/struct.OccupiedEntry.html...

+ + + \ No newline at end of file diff --git a/hashbrown/map/struct.OccupiedEntryRef.html b/hashbrown/map/struct.OccupiedEntryRef.html new file mode 100644 index 0000000000..c8f8df6606 --- /dev/null +++ b/hashbrown/map/struct.OccupiedEntryRef.html @@ -0,0 +1,11 @@ + + + + + Redirection + + +

Redirecting to ../../hashbrown/hash_map/struct.OccupiedEntryRef.html...

+ + + \ No newline at end of file diff --git a/hashbrown/map/struct.OccupiedError.html b/hashbrown/map/struct.OccupiedError.html new file mode 100644 index 0000000000..f13f8ea926 --- /dev/null +++ b/hashbrown/map/struct.OccupiedError.html @@ -0,0 +1,11 @@ + + + + + Redirection + + +

Redirecting to ../../hashbrown/hash_map/struct.OccupiedError.html...

+ + + \ No newline at end of file diff --git a/hashbrown/map/struct.RawEntryBuilder.html b/hashbrown/map/struct.RawEntryBuilder.html new file mode 100644 index 0000000000..3916c7ae06 --- /dev/null +++ b/hashbrown/map/struct.RawEntryBuilder.html @@ -0,0 +1,11 @@ + + + + + Redirection + + +

Redirecting to ../../hashbrown/hash_map/struct.RawEntryBuilder.html...

+ + + \ No newline at end of file diff --git a/hashbrown/map/struct.RawEntryBuilderMut.html b/hashbrown/map/struct.RawEntryBuilderMut.html new file mode 100644 index 0000000000..e700cbcef4 --- /dev/null +++ b/hashbrown/map/struct.RawEntryBuilderMut.html @@ -0,0 +1,11 @@ + + + + + Redirection + + +

Redirecting to ../../hashbrown/hash_map/struct.RawEntryBuilderMut.html...

+ + + \ No newline at end of file diff --git a/hashbrown/map/struct.RawOccupiedEntryMut.html b/hashbrown/map/struct.RawOccupiedEntryMut.html new file mode 100644 index 0000000000..4b655918a4 --- /dev/null +++ b/hashbrown/map/struct.RawOccupiedEntryMut.html @@ -0,0 +1,11 @@ + + + + + Redirection + + +

Redirecting to ../../hashbrown/hash_map/struct.RawOccupiedEntryMut.html...

+ + + \ No newline at end of file diff --git a/hashbrown/map/struct.RawVacantEntryMut.html b/hashbrown/map/struct.RawVacantEntryMut.html new file mode 100644 index 0000000000..8415047183 --- /dev/null +++ b/hashbrown/map/struct.RawVacantEntryMut.html @@ -0,0 +1,11 @@ + + + + + Redirection + + +

Redirecting to ../../hashbrown/hash_map/struct.RawVacantEntryMut.html...

+ + + \ No newline at end of file diff --git a/hashbrown/map/struct.VacantEntry.html b/hashbrown/map/struct.VacantEntry.html new file mode 100644 index 0000000000..e88c09f2a6 --- /dev/null +++ b/hashbrown/map/struct.VacantEntry.html @@ -0,0 +1,11 @@ + + + + + Redirection + + +

Redirecting to ../../hashbrown/hash_map/struct.VacantEntry.html...

+ + + \ No newline at end of file diff --git a/hashbrown/map/struct.VacantEntryRef.html b/hashbrown/map/struct.VacantEntryRef.html new file mode 100644 index 0000000000..33ef25cd29 --- /dev/null +++ b/hashbrown/map/struct.VacantEntryRef.html @@ -0,0 +1,11 @@ + + + + + Redirection + + +

Redirecting to ../../hashbrown/hash_map/struct.VacantEntryRef.html...

+ + + \ No newline at end of file diff --git a/hashbrown/map/struct.Values.html b/hashbrown/map/struct.Values.html new file mode 100644 index 0000000000..24cd81deb1 --- /dev/null +++ b/hashbrown/map/struct.Values.html @@ -0,0 +1,11 @@ + + + + + Redirection + + +

Redirecting to ../../hashbrown/hash_map/struct.Values.html...

+ + + \ No newline at end of file diff --git a/hashbrown/map/struct.ValuesMut.html b/hashbrown/map/struct.ValuesMut.html new file mode 100644 index 0000000000..51309c87c4 --- /dev/null +++ b/hashbrown/map/struct.ValuesMut.html @@ -0,0 +1,11 @@ + + + + + Redirection + + +

Redirecting to ../../hashbrown/hash_map/struct.ValuesMut.html...

+ + + \ No newline at end of file diff --git a/hashbrown/raw/index.html b/hashbrown/raw/index.html new file mode 100644 index 0000000000..cba65f4546 --- /dev/null +++ b/hashbrown/raw/index.html @@ -0,0 +1,4 @@ +hashbrown::raw - Rust
+

Module hashbrown::raw

source ·
Expand description

Experimental and unsafe RawTable API. This module is only available if the +raw feature is enabled.

+

Structs§

  • Bucket
    A reference to a hash table bucket containing a T.
  • InsertSlot
    A reference to an empty bucket into which an can be inserted.
  • RawDrain
    Iterator which consumes elements without freeing the table storage.
  • RawIntoIter
    Iterator which consumes a table and returns elements.
  • RawIter
    Iterator which returns a raw pointer to every full bucket in the table.
  • RawIterHash
    Iterator over occupied buckets that could match a given hash.
  • RawTable
    A raw hash table with an unsafe API.
\ No newline at end of file diff --git a/hashbrown/raw/inner/struct.Bucket.html b/hashbrown/raw/inner/struct.Bucket.html new file mode 100644 index 0000000000..f0e10ff4c5 --- /dev/null +++ b/hashbrown/raw/inner/struct.Bucket.html @@ -0,0 +1,11 @@ + + + + + Redirection + + +

Redirecting to ../../../hashbrown/raw/struct.Bucket.html...

+ + + \ No newline at end of file diff --git a/hashbrown/raw/inner/struct.InsertSlot.html b/hashbrown/raw/inner/struct.InsertSlot.html new file mode 100644 index 0000000000..aad88c86a7 --- /dev/null +++ b/hashbrown/raw/inner/struct.InsertSlot.html @@ -0,0 +1,11 @@ + + + + + Redirection + + +

Redirecting to ../../../hashbrown/raw/struct.InsertSlot.html...

+ + + \ No newline at end of file diff --git a/hashbrown/raw/inner/struct.RawDrain.html b/hashbrown/raw/inner/struct.RawDrain.html new file mode 100644 index 0000000000..78e3bfd161 --- /dev/null +++ b/hashbrown/raw/inner/struct.RawDrain.html @@ -0,0 +1,11 @@ + + + + + Redirection + + +

Redirecting to ../../../hashbrown/raw/struct.RawDrain.html...

+ + + \ No newline at end of file diff --git a/hashbrown/raw/inner/struct.RawIntoIter.html b/hashbrown/raw/inner/struct.RawIntoIter.html new file mode 100644 index 0000000000..7ec63bde3a --- /dev/null +++ b/hashbrown/raw/inner/struct.RawIntoIter.html @@ -0,0 +1,11 @@ + + + + + Redirection + + +

Redirecting to ../../../hashbrown/raw/struct.RawIntoIter.html...

+ + + \ No newline at end of file diff --git a/hashbrown/raw/inner/struct.RawIter.html b/hashbrown/raw/inner/struct.RawIter.html new file mode 100644 index 0000000000..44ec46bfda --- /dev/null +++ b/hashbrown/raw/inner/struct.RawIter.html @@ -0,0 +1,11 @@ + + + + + Redirection + + +

Redirecting to ../../../hashbrown/raw/struct.RawIter.html...

+ + + \ No newline at end of file diff --git a/hashbrown/raw/inner/struct.RawIterHash.html b/hashbrown/raw/inner/struct.RawIterHash.html new file mode 100644 index 0000000000..6337cfe303 --- /dev/null +++ b/hashbrown/raw/inner/struct.RawIterHash.html @@ -0,0 +1,11 @@ + + + + + Redirection + + +

Redirecting to ../../../hashbrown/raw/struct.RawIterHash.html...

+ + + \ No newline at end of file diff --git a/hashbrown/raw/inner/struct.RawTable.html b/hashbrown/raw/inner/struct.RawTable.html new file mode 100644 index 0000000000..8d3f709d1b --- /dev/null +++ b/hashbrown/raw/inner/struct.RawTable.html @@ -0,0 +1,11 @@ + + + + + Redirection + + +

Redirecting to ../../../hashbrown/raw/struct.RawTable.html...

+ + + \ No newline at end of file diff --git a/hashbrown/raw/sidebar-items.js b/hashbrown/raw/sidebar-items.js new file mode 100644 index 0000000000..c5efeb9e60 --- /dev/null +++ b/hashbrown/raw/sidebar-items.js @@ -0,0 +1 @@ +window.SIDEBAR_ITEMS = {"struct":["Bucket","InsertSlot","RawDrain","RawIntoIter","RawIter","RawIterHash","RawTable"]}; \ No newline at end of file diff --git a/hashbrown/raw/struct.Bucket.html b/hashbrown/raw/struct.Bucket.html new file mode 100644 index 0000000000..23d0360b73 --- /dev/null +++ b/hashbrown/raw/struct.Bucket.html @@ -0,0 +1,141 @@ +Bucket in hashbrown::raw - Rust
+

Struct hashbrown::raw::Bucket

source · 
pub struct Bucket<T> { /* private fields */ }
Expand description

A reference to a hash table bucket containing a T.

+

This is usually just a pointer to the element itself. However if the element +is a ZST, then we instead track the index of the element in the table so +that erase works properly.

+

Implementations§

source§

impl<T> Bucket<T>

source

pub fn as_ptr(&self) -> *mut T

Acquires the underlying raw pointer *mut T to data.

+
§Note
+

If T is not Copy, do not use *mut T methods that can cause calling the +destructor of T (for example the <*mut T>::drop_in_place method), because +for properly dropping the data we also need to clear data control bytes. If we +drop data, but do not clear data control byte it leads to double drop when +RawTable goes out of scope.

+

If you modify an already initialized value, so Hash and Eq on the new +T value and its borrowed form must match those for the old T value, as the map +will not re-evaluate where the new value should go, meaning the value may become +“lost” if their location does not reflect their state.

+
§Examples
+
use core::hash::{BuildHasher, Hash};
+use hashbrown::raw::{Bucket, RawTable};
+
+type NewHashBuilder = core::hash::BuildHasherDefault<ahash::AHasher>;
+
+fn make_hash<K: Hash + ?Sized, S: BuildHasher>(hash_builder: &S, key: &K) -> u64 {
+    use core::hash::Hasher;
+    let mut state = hash_builder.build_hasher();
+    key.hash(&mut state);
+    state.finish()
+}
+
+let hash_builder = NewHashBuilder::default();
+let mut table = RawTable::new();
+
+let value = ("a", 100);
+let hash = make_hash(&hash_builder, &value.0);
+
+table.insert(hash, value.clone(), |val| make_hash(&hash_builder, &val.0));
+
+let bucket: Bucket<(&str, i32)> = table.find(hash, |(k1, _)| k1 == &value.0).unwrap();
+
+assert_eq!(unsafe { &*bucket.as_ptr() }, &("a", 100));
+
source

pub unsafe fn as_ref<'a>(&self) -> &'a T

Returns a shared immutable reference to the value.

+
§Safety
+

See NonNull::as_ref for safety concerns.

+
§Examples
+
use core::hash::{BuildHasher, Hash};
+use hashbrown::raw::{Bucket, RawTable};
+
+type NewHashBuilder = core::hash::BuildHasherDefault<ahash::AHasher>;
+
+fn make_hash<K: Hash + ?Sized, S: BuildHasher>(hash_builder: &S, key: &K) -> u64 {
+    use core::hash::Hasher;
+    let mut state = hash_builder.build_hasher();
+    key.hash(&mut state);
+    state.finish()
+}
+
+let hash_builder = NewHashBuilder::default();
+let mut table = RawTable::new();
+
+let value: (&str, String) = ("A pony", "is a small horse".to_owned());
+let hash = make_hash(&hash_builder, &value.0);
+
+table.insert(hash, value.clone(), |val| make_hash(&hash_builder, &val.0));
+
+let bucket: Bucket<(&str, String)> = table.find(hash, |(k, _)| k == &value.0).unwrap();
+
+assert_eq!(
+    unsafe { bucket.as_ref() },
+    &("A pony", "is a small horse".to_owned())
+);
+
source

pub unsafe fn as_mut<'a>(&self) -> &'a mut T

Returns a unique mutable reference to the value.

+
§Safety
+

See NonNull::as_mut for safety concerns.

+
§Note
+

Hash and Eq on the new T value and its borrowed form must match +those for the old T value, as the map will not re-evaluate where the new +value should go, meaning the value may become “lost” if their location +does not reflect their state.

+
§Examples
+
use core::hash::{BuildHasher, Hash};
+use hashbrown::raw::{Bucket, RawTable};
+
+type NewHashBuilder = core::hash::BuildHasherDefault<ahash::AHasher>;
+
+fn make_hash<K: Hash + ?Sized, S: BuildHasher>(hash_builder: &S, key: &K) -> u64 {
+    use core::hash::Hasher;
+    let mut state = hash_builder.build_hasher();
+    key.hash(&mut state);
+    state.finish()
+}
+
+let hash_builder = NewHashBuilder::default();
+let mut table = RawTable::new();
+
+let value: (&str, String) = ("A pony", "is a small horse".to_owned());
+let hash = make_hash(&hash_builder, &value.0);
+
+table.insert(hash, value.clone(), |val| make_hash(&hash_builder, &val.0));
+
+let bucket: Bucket<(&str, String)> = table.find(hash, |(k, _)| k == &value.0).unwrap();
+
+unsafe {
+    bucket
+        .as_mut()
+        .1
+        .push_str(" less than 147 cm at the withers")
+};
+assert_eq!(
+    unsafe { bucket.as_ref() },
+    &(
+        "A pony",
+        "is a small horse less than 147 cm at the withers".to_owned()
+    )
+);
+
source

pub unsafe fn copy_from_nonoverlapping(&self, other: &Self)

Copies size_of<T> bytes from other to self. The source +and destination may not overlap.

+
§Safety
+

See ptr::copy_nonoverlapping for safety concerns.

+

Like read, copy_nonoverlapping creates a bitwise copy of T, regardless of +whether T is Copy. If T is not Copy, using both the values +in the region beginning at *self and the region beginning at *other can +violate memory safety.

+
§Note
+

Hash and Eq on the new T value and its borrowed form must match +those for the old T value, as the map will not re-evaluate where the new +value should go, meaning the value may become “lost” if their location +does not reflect their state.

+

Trait Implementations§

source§

impl<T> Clone for Bucket<T>

source§

fn clone(&self) -> Self

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<T> Send for Bucket<T>

Auto Trait Implementations§

§

impl<T> Freeze for Bucket<T>

§

impl<T> RefUnwindSafe for Bucket<T>
where + T: RefUnwindSafe,

§

impl<T> !Sync for Bucket<T>

§

impl<T> Unpin for Bucket<T>

§

impl<T> UnwindSafe for Bucket<T>
where + T: RefUnwindSafe,

Blanket Implementations§

source§

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

source§

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more
source§

impl<T> Borrow<T> for T
where + T: ?Sized,

source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
source§

impl<T> BorrowMut<T> for T
where + 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 T
where + 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 T
where + 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 T
where + 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 T
where + 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/hashbrown/raw/struct.InsertSlot.html b/hashbrown/raw/struct.InsertSlot.html new file mode 100644 index 0000000000..263e9f014d --- /dev/null +++ b/hashbrown/raw/struct.InsertSlot.html @@ -0,0 +1,13 @@ +InsertSlot in hashbrown::raw - Rust
+

Struct hashbrown::raw::InsertSlot

source · 
pub struct InsertSlot { /* private fields */ }
Expand description

A reference to an empty bucket into which an can be inserted.

+

Auto Trait Implementations§

Blanket Implementations§

source§

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

source§

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more
source§

impl<T> Borrow<T> for T
where + T: ?Sized,

source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
source§

impl<T> BorrowMut<T> for T
where + 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 T
where + 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 T
where + 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 T
where + 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/hashbrown/raw/struct.RawDrain.html b/hashbrown/raw/struct.RawDrain.html new file mode 100644 index 0000000000..5885bbe885 --- /dev/null +++ b/hashbrown/raw/struct.RawDrain.html @@ -0,0 +1,199 @@ +RawDrain in hashbrown::raw - Rust
+

Struct hashbrown::raw::RawDrain

source · 
pub struct RawDrain<'a, T, A: Allocator = Global> { /* private fields */ }
Expand description

Iterator which consumes elements without freeing the table storage.

+

Implementations§

source§

impl<T, A: Allocator> RawDrain<'_, T, A>

source

pub fn iter(&self) -> RawIter<T> ⓘ

Trait Implementations§

source§

impl<T, A: Allocator> Drop for RawDrain<'_, T, A>

source§

fn drop(&mut self)

Executes the destructor for this type. Read more
source§

impl<T, A: Allocator> ExactSizeIterator for RawDrain<'_, T, A>

1.0.0 · 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<T, A: Allocator> Iterator for RawDrain<'_, T, A>

§

type Item = T

The type of the elements being iterated over.
source§

fn next(&mut self) -> Option<T>

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) -> usize
where + 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<(), NonZero<usize>>

🔬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 Self
where + Self: Sized,

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

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

Transforms an iterator into a collection. Read more
source§

fn collect_into<E>(self, collection: &mut E) -> &mut E
where + 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) -> bool
where + 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) -> R
where + 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) -> R
where + 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) -> B
where + 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>>>::TryType
where + 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) -> bool
where + 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) -> bool
where + 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>>>::TryType
where + 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) -> S
where + Self: Sized, + S: Sum<Self::Item>,

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

fn product<P>(self) -> P
where + 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) -> Ordering
where + 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) -> bool
where + 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) -> bool
where + 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) -> bool
where + 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) -> bool
where + 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) -> bool
where + 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) -> bool
where + 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) -> bool
where + 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) -> bool
where + Self: Sized, + F: FnMut(&Self::Item, &Self::Item) -> bool,

🔬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) -> bool
where + 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<T, A: Allocator> FusedIterator for RawDrain<'_, T, A>

source§

impl<T, A> Send for RawDrain<'_, T, A>
where + T: Send, + A: Send + Allocator,

source§

impl<T, A> Sync for RawDrain<'_, T, A>
where + T: Sync, + A: Sync + Allocator,

Auto Trait Implementations§

§

impl<'a, T, A> Freeze for RawDrain<'a, T, A>

§

impl<'a, T, A> RefUnwindSafe for RawDrain<'a, T, A>
where + A: RefUnwindSafe, + T: RefUnwindSafe,

§

impl<'a, T, A> Unpin for RawDrain<'a, T, A>

§

impl<'a, T, A> UnwindSafe for RawDrain<'a, T, A>
where + A: RefUnwindSafe, + T: RefUnwindSafe,

Blanket Implementations§

source§

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

source§

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more
source§

impl<T> Borrow<T> for T
where + T: ?Sized,

source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
source§

impl<T> BorrowMut<T> for T
where + 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 T
where + 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 I
where + 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, U> TryFrom<U> for T
where + 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 T
where + 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/hashbrown/raw/struct.RawIntoIter.html b/hashbrown/raw/struct.RawIntoIter.html new file mode 100644 index 0000000000..5f4b197742 --- /dev/null +++ b/hashbrown/raw/struct.RawIntoIter.html @@ -0,0 +1,202 @@ +RawIntoIter in hashbrown::raw - Rust
+

Struct hashbrown::raw::RawIntoIter

source · 
pub struct RawIntoIter<T, A: Allocator = Global> { /* private fields */ }
Expand description

Iterator which consumes a table and returns elements.

+

Implementations§

source§

impl<T, A: Allocator> RawIntoIter<T, A>

source

pub fn iter(&self) -> RawIter<T> ⓘ

Trait Implementations§

source§

impl<T, A: Allocator> Drop for RawIntoIter<T, A>

source§

fn drop(&mut self)

Executes the destructor for this type. Read more
source§

impl<T, A: Allocator> ExactSizeIterator for RawIntoIter<T, A>

1.0.0 · 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<T, A: Allocator> Iterator for RawIntoIter<T, A>

§

type Item = T

The type of the elements being iterated over.
source§

fn next(&mut self) -> Option<T>

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) -> usize
where + 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<(), NonZero<usize>>

🔬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 Self
where + Self: Sized,

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

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

Transforms an iterator into a collection. Read more
source§

fn collect_into<E>(self, collection: &mut E) -> &mut E
where + 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) -> bool
where + 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) -> R
where + 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) -> R
where + 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) -> B
where + 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>>>::TryType
where + 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) -> bool
where + 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) -> bool
where + 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>>>::TryType
where + 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) -> S
where + Self: Sized, + S: Sum<Self::Item>,

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

fn product<P>(self) -> P
where + 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) -> Ordering
where + 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) -> bool
where + 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) -> bool
where + 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) -> bool
where + 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) -> bool
where + 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) -> bool
where + 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) -> bool
where + 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) -> bool
where + 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) -> bool
where + Self: Sized, + F: FnMut(&Self::Item, &Self::Item) -> bool,

🔬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) -> bool
where + 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<T, A: Allocator> FusedIterator for RawIntoIter<T, A>

source§

impl<T, A> Send for RawIntoIter<T, A>
where + T: Send, + A: Send + Allocator,

source§

impl<T, A> Sync for RawIntoIter<T, A>
where + T: Sync, + A: Sync + Allocator,

Auto Trait Implementations§

§

impl<T, A> Freeze for RawIntoIter<T, A>
where + A: Freeze,

§

impl<T, A> RefUnwindSafe for RawIntoIter<T, A>
where + A: RefUnwindSafe, + T: RefUnwindSafe,

§

impl<T, A> Unpin for RawIntoIter<T, A>
where + A: Unpin, + T: Unpin,

§

impl<T, A> UnwindSafe for RawIntoIter<T, A>
where + A: UnwindSafe, + T: UnwindSafe + RefUnwindSafe,

Blanket Implementations§

source§

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

source§

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more
source§

impl<T> Borrow<T> for T
where + T: ?Sized,

source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
source§

impl<T> BorrowMut<T> for T
where + 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 T
where + 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 I
where + 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, U> TryFrom<U> for T
where + 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 T
where + 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/hashbrown/raw/struct.RawIter.html b/hashbrown/raw/struct.RawIter.html new file mode 100644 index 0000000000..087812e017 --- /dev/null +++ b/hashbrown/raw/struct.RawIter.html @@ -0,0 +1,218 @@ +RawIter in hashbrown::raw - Rust
+

Struct hashbrown::raw::RawIter

source · 
pub struct RawIter<T> { /* private fields */ }
Expand description

Iterator which returns a raw pointer to every full bucket in the table.

+

For maximum flexibility this iterator is not bound by a lifetime, but you +must observe several rules when using it:

+
    +
  • You must not free the hash table while iterating (including via growing/shrinking).
    • +
  • It is fine to erase a bucket that has been yielded by the iterator.
    • +
  • Erasing a bucket that has not yet been yielded by the iterator may still +result in the iterator yielding that bucket (unless reflect_remove is called).
    • +
  • It is unspecified whether an element inserted after the iterator was +created will be yielded by that iterator (unless reflect_insert is called).
    • +
  • The order in which the iterator yields bucket is unspecified and may +change in the future.
    • +
+

Implementations§

source§

impl<T> RawIter<T>

source

pub unsafe fn reflect_remove(&mut self, b: &Bucket<T>)

Refresh the iterator so that it reflects a removal from the given bucket.

+

For the iterator to remain valid, this method must be called once +for each removed bucket before next is called again.

+

This method should be called before the removal is made. It is not necessary to call this +method if you are removing an item that this iterator yielded in the past.

+
source

pub unsafe fn reflect_insert(&mut self, b: &Bucket<T>)

Refresh the iterator so that it reflects an insertion into the given bucket.

+

For the iterator to remain valid, this method must be called once +for each insert before next is called again.

+

This method does not guarantee that an insertion of a bucket with a greater +index than the last one yielded will be reflected in the iterator.

+

This method should be called after the given insert is made.

+

Trait Implementations§

source§

impl<T> Clone for RawIter<T>

source§

fn clone(&self) -> Self

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<T> ExactSizeIterator for RawIter<T>

1.0.0 · 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<T> Iterator for RawIter<T>

§

type Item = Bucket<T>

The type of the elements being iterated over.
source§

fn next(&mut self) -> Option<Bucket<T>>

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 fold<B, F>(self, init: B, f: F) -> B
where + Self: Sized, + F: FnMut(B, Self::Item) -> B,

Folds every element into an accumulator by applying an operation, +returning the final result. 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) -> usize
where + 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<(), NonZero<usize>>

🔬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 Self
where + Self: Sized,

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

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

Transforms an iterator into a collection. Read more
source§

fn collect_into<E>(self, collection: &mut E) -> &mut E
where + 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) -> bool
where + 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) -> R
where + 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) -> R
where + 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.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>>>::TryType
where + 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) -> bool
where + 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) -> bool
where + 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>>>::TryType
where + 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
1.0.0 · source§

fn cycle(self) -> Cycle<Self>
where + Self: Sized + Clone,

Repeats an iterator endlessly. 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) -> S
where + Self: Sized, + S: Sum<Self::Item>,

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

fn product<P>(self) -> P
where + 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) -> Ordering
where + 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) -> bool
where + 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) -> bool
where + 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) -> bool
where + 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) -> bool
where + 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) -> bool
where + 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) -> bool
where + 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) -> bool
where + 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) -> bool
where + Self: Sized, + F: FnMut(&Self::Item, &Self::Item) -> bool,

🔬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) -> bool
where + 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<T> FusedIterator for RawIter<T>

Auto Trait Implementations§

§

impl<T> Freeze for RawIter<T>

§

impl<T> RefUnwindSafe for RawIter<T>
where + T: RefUnwindSafe,

§

impl<T> Send for RawIter<T>

§

impl<T> Sync for RawIter<T>

§

impl<T> Unpin for RawIter<T>

§

impl<T> UnwindSafe for RawIter<T>
where + T: RefUnwindSafe,

Blanket Implementations§

source§

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

source§

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more
source§

impl<T> Borrow<T> for T
where + T: ?Sized,

source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
source§

impl<T> BorrowMut<T> for T
where + 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 T
where + 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 I
where + 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> ToOwned for T
where + 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 T
where + 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 T
where + 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/hashbrown/raw/struct.RawIterHash.html b/hashbrown/raw/struct.RawIterHash.html new file mode 100644 index 0000000000..3eac5c8bf5 --- /dev/null +++ b/hashbrown/raw/struct.RawIterHash.html @@ -0,0 +1,209 @@ +RawIterHash in hashbrown::raw - Rust
+

Struct hashbrown::raw::RawIterHash

source · 
pub struct RawIterHash<T> { /* private fields */ }
Expand description

Iterator over occupied buckets that could match a given hash.

+

RawTable only stores 7 bits of the hash value, so this iterator may return +items that have a hash value different than the one provided. You should +always validate the returned values before using them.

+

For maximum flexibility this iterator is not bound by a lifetime, but you +must observe several rules when using it:

+
    +
  • You must not free the hash table while iterating (including via growing/shrinking).
    • +
  • It is fine to erase a bucket that has been yielded by the iterator.
    • +
  • Erasing a bucket that has not yet been yielded by the iterator may still +result in the iterator yielding that bucket.
    • +
  • It is unspecified whether an element inserted after the iterator was +created will be yielded by that iterator.
    • +
  • The order in which the iterator yields buckets is unspecified and may +change in the future.
    • +
+

Trait Implementations§

source§

impl<T> Iterator for RawIterHash<T>

§

type Item = Bucket<T>

The type of the elements being iterated over.
source§

fn next(&mut self) -> Option<Bucket<T>>

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) -> usize
where + 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<(), NonZero<usize>>

🔬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 Self
where + Self: Sized,

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

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

Transforms an iterator into a collection. Read more
source§

fn collect_into<E>(self, collection: &mut E) -> &mut E
where + 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) -> bool
where + 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) -> R
where + 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) -> R
where + 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) -> B
where + 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>>>::TryType
where + 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) -> bool
where + 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) -> bool
where + 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>>>::TryType
where + 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) -> S
where + Self: Sized, + S: Sum<Self::Item>,

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

fn product<P>(self) -> P
where + 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) -> Ordering
where + 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) -> bool
where + 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) -> bool
where + 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) -> bool
where + 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) -> bool
where + 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) -> bool
where + 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) -> bool
where + 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) -> bool
where + 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) -> bool
where + Self: Sized, + F: FnMut(&Self::Item, &Self::Item) -> bool,

🔬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) -> bool
where + 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<T> Freeze for RawIterHash<T>

§

impl<T> RefUnwindSafe for RawIterHash<T>
where + T: RefUnwindSafe,

§

impl<T> !Send for RawIterHash<T>

§

impl<T> !Sync for RawIterHash<T>

§

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

§

impl<T> UnwindSafe for RawIterHash<T>
where + T: UnwindSafe,

Blanket Implementations§

source§

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

source§

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more
source§

impl<T> Borrow<T> for T
where + T: ?Sized,

source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
source§

impl<T> BorrowMut<T> for T
where + 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 T
where + 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 I
where + 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, U> TryFrom<U> for T
where + 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 T
where + 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/hashbrown/raw/struct.RawTable.html b/hashbrown/raw/struct.RawTable.html new file mode 100644 index 0000000000..bd84dfc00b --- /dev/null +++ b/hashbrown/raw/struct.RawTable.html @@ -0,0 +1,206 @@ +RawTable in hashbrown::raw - Rust
+

Struct hashbrown::raw::RawTable

source · 
pub struct RawTable<T, A: Allocator = Global> { /* private fields */ }
Expand description

A raw hash table with an unsafe API.

+

Implementations§

source§

impl<T> RawTable<T, Global>

source

pub const fn new() -> Self

Creates a new empty hash table without allocating any memory.

+

In effect this returns a table with exactly 1 bucket. However we can +leave the data pointer dangling since that bucket is never written to +due to our load factor forcing us to always have at least 1 free bucket.

+
source

pub fn try_with_capacity(capacity: usize) -> Result<Self, TryReserveError>

Attempts to allocate a new hash table with at least enough capacity +for inserting the given number of elements without reallocating.

+
source

pub fn with_capacity(capacity: usize) -> Self

Allocates a new hash table with at least enough capacity for inserting +the given number of elements without reallocating.

+
source§

impl<T, A: Allocator> RawTable<T, A>

source

pub const fn new_in(alloc: A) -> Self

Creates a new empty hash table without allocating any memory, using the +given allocator.

+

In effect this returns a table with exactly 1 bucket. However we can +leave the data pointer dangling since that bucket is never written to +due to our load factor forcing us to always have at least 1 free bucket.

+
source

pub fn try_with_capacity_in( + capacity: usize, + alloc: A +) -> Result<Self, TryReserveError>

Attempts to allocate a new hash table using the given allocator, with at least enough +capacity for inserting the given number of elements without reallocating.

+
source

pub fn with_capacity_in(capacity: usize, alloc: A) -> Self

Allocates a new hash table using the given allocator, with at least enough capacity for +inserting the given number of elements without reallocating.

+
source

pub fn allocator(&self) -> &A

Returns a reference to the underlying allocator.

+
source

pub fn data_end(&self) -> NonNull<T>

Returns pointer to one past last data element in the table as viewed from +the start point of the allocation.

+

The caller must ensure that the RawTable outlives the returned NonNull<T>, +otherwise using it may result in undefined behavior.

+
source

pub unsafe fn data_start(&self) -> NonNull<T>

Returns pointer to start of data table.

+
source

pub fn allocation_info(&self) -> (NonNull<u8>, Layout)

Return the information about memory allocated by the table.

+

RawTable allocates single memory block to store both data and metadata. +This function returns allocation size and alignment and the beginning of the area. +These are the arguments which will be passed to dealloc when the table is dropped.

+

This function might be useful for memory profiling.

+
source

pub unsafe fn bucket_index(&self, bucket: &Bucket<T>) -> usize

Returns the index of a bucket from a Bucket.

+
source

pub unsafe fn bucket(&self, index: usize) -> Bucket<T>

Returns a pointer to an element in the table.

+

The caller must ensure that the RawTable outlives the returned Bucket<T>, +otherwise using it may result in undefined behavior.

+
§Safety
+

If mem::size_of::<T>() != 0, then the caller of this function must observe the +following safety rules:

+
    +
  • +

    The table must already be allocated;

    +
    • +
  • +

    The index must not be greater than the number returned by the RawTable::buckets +function, i.e. (index + 1) <= self.buckets().

    +
    • +
+

It is safe to call this function with index of zero (index == 0) on a table that has +not been allocated, but using the returned Bucket results in undefined behavior.

+

If mem::size_of::<T>() == 0, then the only requirement is that the index must +not be greater than the number returned by the RawTable::buckets function, i.e. +(index + 1) <= self.buckets().

+
source

pub unsafe fn erase(&mut self, item: Bucket<T>)

Erases an element from the table, dropping it in place.

+
source

pub fn erase_entry(&mut self, hash: u64, eq: impl FnMut(&T) -> bool) -> bool

Finds and erases an element from the table, dropping it in place. +Returns true if an element was found.

+
source

pub unsafe fn remove(&mut self, item: Bucket<T>) -> (T, InsertSlot)

Removes an element from the table, returning it.

+

This also returns an InsertSlot pointing to the newly free bucket.

+
source

pub fn remove_entry( + &mut self, + hash: u64, + eq: impl FnMut(&T) -> bool +) -> Option<T>

Finds and removes an element from the table, returning it.

+
source

pub fn clear_no_drop(&mut self)

Marks all table buckets as empty without dropping their contents.

+
source

pub fn clear(&mut self)

Removes all elements from the table without freeing the backing memory.

+
source

pub fn shrink_to(&mut self, min_size: usize, hasher: impl Fn(&T) -> u64)

Shrinks the table to fit max(self.len(), min_size) elements.

+
source

pub fn reserve(&mut self, additional: usize, hasher: impl Fn(&T) -> u64)

Ensures that at least additional items can be inserted into the table +without reallocation.

+
source

pub fn try_reserve( + &mut self, + additional: usize, + hasher: impl Fn(&T) -> u64 +) -> Result<(), TryReserveError>

Tries to ensure that at least additional items can be inserted into +the table without reallocation.

+
source

pub fn insert( + &mut self, + hash: u64, + value: T, + hasher: impl Fn(&T) -> u64 +) -> Bucket<T>

Inserts a new element into the table, and returns its raw bucket.

+

This does not check if the given element already exists in the table.

+
source

pub fn try_insert_no_grow( + &mut self, + hash: u64, + value: T +) -> Result<Bucket<T>, T>

Attempts to insert a new element without growing the table and return its raw bucket.

+

Returns an Err containing the given element if inserting it would require growing the +table.

+

This does not check if the given element already exists in the table.

+
source

pub fn insert_entry( + &mut self, + hash: u64, + value: T, + hasher: impl Fn(&T) -> u64 +) -> &mut T

Inserts a new element into the table, and returns a mutable reference to it.

+

This does not check if the given element already exists in the table.

+
source

pub unsafe fn insert_no_grow(&mut self, hash: u64, value: T) -> Bucket<T>

Inserts a new element into the table, without growing the table.

+

There must be enough space in the table to insert the new element.

+

This does not check if the given element already exists in the table.

+
source

pub unsafe fn replace_bucket_with<F>(&mut self, bucket: Bucket<T>, f: F) -> bool
where + F: FnOnce(T) -> Option<T>,

Temporary removes a bucket, applying the given function to the removed +element and optionally put back the returned value in the same bucket.

+

Returns true if the bucket still contains an element

+

This does not check if the given bucket is actually occupied.

+
source

pub fn find_or_find_insert_slot( + &mut self, + hash: u64, + eq: impl FnMut(&T) -> bool, + hasher: impl Fn(&T) -> u64 +) -> Result<Bucket<T>, InsertSlot>

Searches for an element in the table. If the element is not found, +returns Err with the position of a slot where an element with the +same hash could be inserted.

+

This function may resize the table if additional space is required for +inserting an element.

+
source

pub unsafe fn insert_in_slot( + &mut self, + hash: u64, + slot: InsertSlot, + value: T +) -> Bucket<T>

Inserts a new element into the table in the given slot, and returns its +raw bucket.

+
§Safety
+

slot must point to a slot previously returned by +find_or_find_insert_slot, and no mutation of the table must have +occurred since that call.

+
source

pub fn find(&self, hash: u64, eq: impl FnMut(&T) -> bool) -> Option<Bucket<T>>

Searches for an element in the table.

+
source

pub fn get(&self, hash: u64, eq: impl FnMut(&T) -> bool) -> Option<&T>

Gets a reference to an element in the table.

+
source

pub fn get_mut( + &mut self, + hash: u64, + eq: impl FnMut(&T) -> bool +) -> Option<&mut T>

Gets a mutable reference to an element in the table.

+
source

pub fn get_many_mut<const N: usize>( + &mut self, + hashes: [u64; N], + eq: impl FnMut(usize, &T) -> bool +) -> Option<[&mut T; N]>

Attempts to get mutable references to N entries in the table at once.

+

Returns an array of length N with the results of each query.

+

At most one mutable reference will be returned to any entry. None will be returned if any +of the hashes are duplicates. None will be returned if the hash is not found.

+

The eq argument should be a closure such that eq(i, k) returns true if k is equal to +the ith key to be looked up.

+
source

pub unsafe fn get_many_unchecked_mut<const N: usize>( + &mut self, + hashes: [u64; N], + eq: impl FnMut(usize, &T) -> bool +) -> Option<[&mut T; N]>

source

pub fn capacity(&self) -> usize

Returns the number of elements the map can hold without reallocating.

+

This number is a lower bound; the table might be able to hold +more, but is guaranteed to be able to hold at least this many.

+
source

pub fn len(&self) -> usize

Returns the number of elements in the table.

+
source

pub fn is_empty(&self) -> bool

Returns true if the table contains no elements.

+
source

pub fn buckets(&self) -> usize

Returns the number of buckets in the table.

+
source

pub unsafe fn is_bucket_full(&self, index: usize) -> bool

Checks whether the bucket at index is full.

+
§Safety
+

The caller must ensure index is less than the number of buckets.

+
source

pub unsafe fn iter(&self) -> RawIter<T> ⓘ

Returns an iterator over every element in the table. It is up to +the caller to ensure that the RawTable outlives the RawIter. +Because we cannot make the next method unsafe on the RawIter +struct, we have to make the iter method unsafe.

+
source

pub unsafe fn iter_hash(&self, hash: u64) -> RawIterHash<T> ⓘ

Returns an iterator over occupied buckets that could match a given hash.

+

RawTable only stores 7 bits of the hash value, so this iterator may +return items that have a hash value different than the one provided. You +should always validate the returned values before using them.

+

It is up to the caller to ensure that the RawTable outlives the +RawIterHash. Because we cannot make the next method unsafe on the +RawIterHash struct, we have to make the iter_hash method unsafe.

+
source

pub fn drain(&mut self) -> RawDrain<'_, T, A> ⓘ

Returns an iterator which removes all elements from the table without +freeing the memory.

+
source

pub unsafe fn drain_iter_from(&mut self, iter: RawIter<T>) -> RawDrain<'_, T, A> ⓘ

Returns an iterator which removes all elements from the table without +freeing the memory.

+

Iteration starts at the provided iterator’s current location.

+

It is up to the caller to ensure that the iterator is valid for this +RawTable and covers all items that remain in the table.

+
source

pub unsafe fn into_iter_from(self, iter: RawIter<T>) -> RawIntoIter<T, A> ⓘ

Returns an iterator which consumes all elements from the table.

+

Iteration starts at the provided iterator’s current location.

+

It is up to the caller to ensure that the iterator is valid for this +RawTable and covers all items that remain in the table.

+
source§

impl<T: Clone, A: Allocator + Clone> RawTable<T, A>

source

pub fn clone_from_with_hasher( + &mut self, + source: &Self, + hasher: impl Fn(&T) -> u64 +)

Variant of clone_from to use when a hasher is available.

+

Trait Implementations§

source§

impl<T: Clone, A: Allocator + Clone> Clone for RawTable<T, A>

source§

fn clone(&self) -> Self

Returns a copy of the value. Read more
source§

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

Performs copy-assignment from source. Read more
source§

impl<T, A: Allocator + Default> Default for RawTable<T, A>

source§

fn default() -> Self

Returns the “default value” for a type. Read more
source§

impl<T, A: Allocator> Drop for RawTable<T, A>

source§

fn drop(&mut self)

Executes the destructor for this type. Read more
source§

impl<T, A: Allocator> IntoIterator for RawTable<T, A>

§

type Item = T

The type of the elements being iterated over.
§

type IntoIter = RawIntoIter<T, A>

Which kind of iterator are we turning this into?
source§

fn into_iter(self) -> RawIntoIter<T, A> ⓘ

Creates an iterator from a value. Read more
source§

impl<T, A> Send for RawTable<T, A>
where + T: Send, + A: Send + Allocator,

source§

impl<T, A> Sync for RawTable<T, A>
where + T: Sync, + A: Sync + Allocator,

Auto Trait Implementations§

§

impl<T, A> Freeze for RawTable<T, A>
where + A: Freeze,

§

impl<T, A> RefUnwindSafe for RawTable<T, A>
where + A: RefUnwindSafe, + T: RefUnwindSafe,

§

impl<T, A> Unpin for RawTable<T, A>
where + A: Unpin, + T: Unpin,

§

impl<T, A> UnwindSafe for RawTable<T, A>
where + A: UnwindSafe, + T: UnwindSafe,

Blanket Implementations§

source§

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

source§

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more
source§

impl<T> Borrow<T> for T
where + T: ?Sized,

source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
source§

impl<T> BorrowMut<T> for T
where + 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 T
where + 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 T
where + 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 T
where + 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 T
where + 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/hashbrown/set/enum.Entry.html b/hashbrown/set/enum.Entry.html new file mode 100644 index 0000000000..8e3df22637 --- /dev/null +++ b/hashbrown/set/enum.Entry.html @@ -0,0 +1,11 @@ + + + + + Redirection + + +

Redirecting to ../../hashbrown/hash_set/enum.Entry.html...

+ + + \ No newline at end of file diff --git a/hashbrown/set/struct.Difference.html b/hashbrown/set/struct.Difference.html new file mode 100644 index 0000000000..32e41828e9 --- /dev/null +++ b/hashbrown/set/struct.Difference.html @@ -0,0 +1,11 @@ + + + + + Redirection + + +

Redirecting to ../../hashbrown/hash_set/struct.Difference.html...

+ + + \ No newline at end of file diff --git a/hashbrown/set/struct.Drain.html b/hashbrown/set/struct.Drain.html new file mode 100644 index 0000000000..35a3a7ed2d --- /dev/null +++ b/hashbrown/set/struct.Drain.html @@ -0,0 +1,11 @@ + + + + + Redirection + + +

Redirecting to ../../hashbrown/hash_set/struct.Drain.html...

+ + + \ No newline at end of file diff --git a/hashbrown/set/struct.ExtractIf.html b/hashbrown/set/struct.ExtractIf.html new file mode 100644 index 0000000000..ab0e949a27 --- /dev/null +++ b/hashbrown/set/struct.ExtractIf.html @@ -0,0 +1,11 @@ + + + + + Redirection + + +

Redirecting to ../../hashbrown/hash_set/struct.ExtractIf.html...

+ + + \ No newline at end of file diff --git a/hashbrown/set/struct.HashSet.html b/hashbrown/set/struct.HashSet.html new file mode 100644 index 0000000000..583fb70ae2 --- /dev/null +++ b/hashbrown/set/struct.HashSet.html @@ -0,0 +1,11 @@ + + + + + Redirection + + +

Redirecting to ../../hashbrown/hash_set/struct.HashSet.html...

+ + + \ No newline at end of file diff --git a/hashbrown/set/struct.Intersection.html b/hashbrown/set/struct.Intersection.html new file mode 100644 index 0000000000..2e2ac867a3 --- /dev/null +++ b/hashbrown/set/struct.Intersection.html @@ -0,0 +1,11 @@ + + + + + Redirection + + +

Redirecting to ../../hashbrown/hash_set/struct.Intersection.html...

+ + + \ No newline at end of file diff --git a/hashbrown/set/struct.IntoIter.html b/hashbrown/set/struct.IntoIter.html new file mode 100644 index 0000000000..997ff48aa4 --- /dev/null +++ b/hashbrown/set/struct.IntoIter.html @@ -0,0 +1,11 @@ + + + + + Redirection + + +

Redirecting to ../../hashbrown/hash_set/struct.IntoIter.html...

+ + + \ No newline at end of file diff --git a/hashbrown/set/struct.Iter.html b/hashbrown/set/struct.Iter.html new file mode 100644 index 0000000000..4af76fba1d --- /dev/null +++ b/hashbrown/set/struct.Iter.html @@ -0,0 +1,11 @@ + + + + + Redirection + + +

Redirecting to ../../hashbrown/hash_set/struct.Iter.html...

+ + + \ No newline at end of file diff --git a/hashbrown/set/struct.OccupiedEntry.html b/hashbrown/set/struct.OccupiedEntry.html new file mode 100644 index 0000000000..e840319a9c --- /dev/null +++ b/hashbrown/set/struct.OccupiedEntry.html @@ -0,0 +1,11 @@ + + + + + Redirection + + +

Redirecting to ../../hashbrown/hash_set/struct.OccupiedEntry.html...

+ + + \ No newline at end of file diff --git a/hashbrown/set/struct.SymmetricDifference.html b/hashbrown/set/struct.SymmetricDifference.html new file mode 100644 index 0000000000..76b5de1248 --- /dev/null +++ b/hashbrown/set/struct.SymmetricDifference.html @@ -0,0 +1,11 @@ + + + + + Redirection + + +

Redirecting to ../../hashbrown/hash_set/struct.SymmetricDifference.html...

+ + + \ No newline at end of file diff --git a/hashbrown/set/struct.Union.html b/hashbrown/set/struct.Union.html new file mode 100644 index 0000000000..5c4b9ac40e --- /dev/null +++ b/hashbrown/set/struct.Union.html @@ -0,0 +1,11 @@ + + + + + Redirection + + +

Redirecting to ../../hashbrown/hash_set/struct.Union.html...

+ + + \ No newline at end of file diff --git a/hashbrown/set/struct.VacantEntry.html b/hashbrown/set/struct.VacantEntry.html new file mode 100644 index 0000000000..d431a51047 --- /dev/null +++ b/hashbrown/set/struct.VacantEntry.html @@ -0,0 +1,11 @@ + + + + + Redirection + + +

Redirecting to ../../hashbrown/hash_set/struct.VacantEntry.html...

+ + + \ No newline at end of file diff --git a/hashbrown/sidebar-items.js b/hashbrown/sidebar-items.js new file mode 100644 index 0000000000..e0d0070ce5 --- /dev/null +++ b/hashbrown/sidebar-items.js @@ -0,0 +1 @@ +window.SIDEBAR_ITEMS = {"enum":["TryReserveError"],"mod":["hash_map","hash_set","hash_table","raw"],"struct":["HashMap","HashSet","HashTable"],"trait":["Equivalent"]}; \ No newline at end of file diff --git a/hashbrown/struct.HashMap.html b/hashbrown/struct.HashMap.html new file mode 100644 index 0000000000..e679b7444d --- /dev/null +++ b/hashbrown/struct.HashMap.html @@ -0,0 +1,1388 @@ +HashMap in hashbrown - Rust
+

Struct hashbrown::HashMap

source · 
pub struct HashMap<K, V, S = DefaultHashBuilder, A: Allocator = Global> { /* private fields */ }
Expand description

A hash map implemented with quadratic probing and SIMD lookup.

+

The default hashing algorithm is currently AHash, though this is +subject to change at any point in the future. This hash function is very +fast for all types of keys, but this algorithm will typically not protect +against attacks such as HashDoS.

+

The hashing algorithm can be replaced on a per-HashMap basis using the +default, with_hasher, and with_capacity_and_hasher methods. Many +alternative algorithms are available on crates.io, such as the fnv crate.

+

It is required that the keys implement the Eq and Hash traits, although +this can frequently be achieved by using #[derive(PartialEq, Eq, Hash)]. +If you implement these yourself, it is important that the following +property holds:

+
k1 == k2 -> hash(k1) == hash(k2)
+
+

In other words, if two keys are equal, their hashes must be equal.

+

It is a logic error for a key to be modified in such a way that the key’s +hash, as determined by the Hash trait, or its equality, as determined by +the Eq trait, changes while it is in the map. This is normally only +possible through Cell, RefCell, global state, I/O, or unsafe code.

+

It is also a logic error for the Hash implementation of a key to panic. +This is generally only possible if the trait is implemented manually. If a +panic does occur then the contents of the HashMap may become corrupted and +some items may be dropped from the table.

+

§Examples

+
use hashbrown::HashMap;
+
+// Type inference lets us omit an explicit type signature (which
+// would be `HashMap<String, String>` in this example).
+let mut book_reviews = HashMap::new();
+
+// Review some books.
+book_reviews.insert(
+    "Adventures of Huckleberry Finn".to_string(),
+    "My favorite book.".to_string(),
+);
+book_reviews.insert(
+    "Grimms' Fairy Tales".to_string(),
+    "Masterpiece.".to_string(),
+);
+book_reviews.insert(
+    "Pride and Prejudice".to_string(),
+    "Very enjoyable.".to_string(),
+);
+book_reviews.insert(
+    "The Adventures of Sherlock Holmes".to_string(),
+    "Eye lyked it alot.".to_string(),
+);
+
+// Check for a specific one.
+// When collections store owned values (String), they can still be
+// queried using references (&str).
+if !book_reviews.contains_key("Les Misérables") {
+    println!("We've got {} reviews, but Les Misérables ain't one.",
+             book_reviews.len());
+}
+
+// oops, this review has a lot of spelling mistakes, let's delete it.
+book_reviews.remove("The Adventures of Sherlock Holmes");
+
+// Look up the values associated with some keys.
+let to_find = ["Pride and Prejudice", "Alice's Adventure in Wonderland"];
+for &book in &to_find {
+    match book_reviews.get(book) {
+        Some(review) => println!("{}: {}", book, review),
+        None => println!("{} is unreviewed.", book)
+    }
+}
+
+// Look up the value for a key (will panic if the key is not found).
+println!("Review for Jane: {}", book_reviews["Pride and Prejudice"]);
+
+// Iterate over everything.
+for (book, review) in &book_reviews {
+    println!("{}: \"{}\"", book, review);
+}
+

HashMap also implements an Entry API, which allows +for more complex methods of getting, setting, updating and removing keys and +their values:

+ +
use hashbrown::HashMap;
+
+// type inference lets us omit an explicit type signature (which
+// would be `HashMap<&str, u8>` in this example).
+let mut player_stats = HashMap::new();
+
+fn random_stat_buff() -> u8 {
+    // could actually return some random value here - let's just return
+    // some fixed value for now
+    42
+}
+
+// insert a key only if it doesn't already exist
+player_stats.entry("health").or_insert(100);
+
+// insert a key using a function that provides a new value only if it
+// doesn't already exist
+player_stats.entry("defence").or_insert_with(random_stat_buff);
+
+// update a key, guarding against the key possibly not being set
+let stat = player_stats.entry("attack").or_insert(100);
+*stat += random_stat_buff();
+

The easiest way to use HashMap with a custom key type is to derive Eq and Hash. +We must also derive PartialEq.

+ +
use hashbrown::HashMap;
+
+#[derive(Hash, Eq, PartialEq, Debug)]
+struct Viking {
+    name: String,
+    country: String,
+}
+
+impl Viking {
+    /// Creates a new Viking.
+    fn new(name: &str, country: &str) -> Viking {
+        Viking { name: name.to_string(), country: country.to_string() }
+    }
+}
+
+// Use a HashMap to store the vikings' health points.
+let mut vikings = HashMap::new();
+
+vikings.insert(Viking::new("Einar", "Norway"), 25);
+vikings.insert(Viking::new("Olaf", "Denmark"), 24);
+vikings.insert(Viking::new("Harald", "Iceland"), 12);
+
+// Use derived implementation to print the status of the vikings.
+for (viking, health) in &vikings {
+    println!("{:?} has {} hp", viking, health);
+}
+

A HashMap with fixed list of elements can be initialized from an array:

+ +
use hashbrown::HashMap;
+
+let timber_resources: HashMap<&str, i32> = [("Norway", 100), ("Denmark", 50), ("Iceland", 10)]
+    .into_iter().collect();
+// use the values stored in map
+

Implementations§

source§

impl<K, V, S> HashMap<K, V, S>

source

pub const fn with_hasher(hash_builder: S) -> Self

Creates an empty HashMap which will use the given hash builder to hash +keys.

+

The hash map is initially created with a capacity of 0, so it will not +allocate until it is first inserted into.

+
§HashDoS resistance
+

The hash_builder normally use a fixed key by default and that does +not allow the HashMap to be protected against attacks such as HashDoS. +Users who require HashDoS resistance should explicitly use +[ahash::RandomState] or std::collections::hash_map::RandomState +as the hasher when creating a HashMap.

+

The hash_builder passed should implement the BuildHasher trait for +the HashMap to be useful, see its documentation for details.

+
§Examples
+
use hashbrown::HashMap;
+use hashbrown::hash_map::DefaultHashBuilder;
+
+let s = DefaultHashBuilder::default();
+let mut map = HashMap::with_hasher(s);
+assert_eq!(map.len(), 0);
+assert_eq!(map.capacity(), 0);
+
+map.insert(1, 2);
+
source

pub fn with_capacity_and_hasher(capacity: usize, hash_builder: S) -> Self

Creates an empty HashMap with the specified capacity, using hash_builder +to hash the keys.

+

The hash map will be able to hold at least capacity elements without +reallocating. If capacity is 0, the hash map will not allocate.

+
§HashDoS resistance
+

The hash_builder normally use a fixed key by default and that does +not allow the HashMap to be protected against attacks such as HashDoS. +Users who require HashDoS resistance should explicitly use +[ahash::RandomState] or std::collections::hash_map::RandomState +as the hasher when creating a HashMap.

+

The hash_builder passed should implement the BuildHasher trait for +the HashMap to be useful, see its documentation for details.

+
§Examples
+
use hashbrown::HashMap;
+use hashbrown::hash_map::DefaultHashBuilder;
+
+let s = DefaultHashBuilder::default();
+let mut map = HashMap::with_capacity_and_hasher(10, s);
+assert_eq!(map.len(), 0);
+assert!(map.capacity() >= 10);
+
+map.insert(1, 2);
+
source§

impl<K, V, S, A: Allocator> HashMap<K, V, S, A>

source

pub fn allocator(&self) -> &A

Returns a reference to the underlying allocator.

+
source

pub const fn with_hasher_in(hash_builder: S, alloc: A) -> Self

Creates an empty HashMap which will use the given hash builder to hash +keys. It will be allocated with the given allocator.

+

The hash map is initially created with a capacity of 0, so it will not allocate until it +is first inserted into.

+
§HashDoS resistance
+

The hash_builder normally use a fixed key by default and that does +not allow the HashMap to be protected against attacks such as HashDoS. +Users who require HashDoS resistance should explicitly use +[ahash::RandomState] or std::collections::hash_map::RandomState +as the hasher when creating a HashMap.

+
§Examples
+
use hashbrown::HashMap;
+use hashbrown::hash_map::DefaultHashBuilder;
+
+let s = DefaultHashBuilder::default();
+let mut map = HashMap::with_hasher(s);
+map.insert(1, 2);
+
source

pub fn with_capacity_and_hasher_in( + capacity: usize, + hash_builder: S, + alloc: A +) -> Self

Creates an empty HashMap with the specified capacity, using hash_builder +to hash the keys. It will be allocated with the given allocator.

+

The hash map will be able to hold at least capacity elements without +reallocating. If capacity is 0, the hash map will not allocate.

+
§HashDoS resistance
+

The hash_builder normally use a fixed key by default and that does +not allow the HashMap to be protected against attacks such as HashDoS. +Users who require HashDoS resistance should explicitly use +[ahash::RandomState] or std::collections::hash_map::RandomState +as the hasher when creating a HashMap.

+
§Examples
+
use hashbrown::HashMap;
+use hashbrown::hash_map::DefaultHashBuilder;
+
+let s = DefaultHashBuilder::default();
+let mut map = HashMap::with_capacity_and_hasher(10, s);
+map.insert(1, 2);
+
source

pub fn hasher(&self) -> &S

Returns a reference to the map’s BuildHasher.

+
§Examples
+
use hashbrown::HashMap;
+use hashbrown::hash_map::DefaultHashBuilder;
+
+let hasher = DefaultHashBuilder::default();
+let map: HashMap<i32, i32> = HashMap::with_hasher(hasher);
+let hasher: &DefaultHashBuilder = map.hasher();
+
source

pub fn capacity(&self) -> usize

Returns the number of elements the map can hold without reallocating.

+

This number is a lower bound; the HashMap<K, V> might be able to hold +more, but is guaranteed to be able to hold at least this many.

+
§Examples
+
use hashbrown::HashMap;
+let map: HashMap<i32, i32> = HashMap::with_capacity(100);
+assert_eq!(map.len(), 0);
+assert!(map.capacity() >= 100);
+
source

pub fn keys(&self) -> Keys<'_, K, V> ⓘ

An iterator visiting all keys in arbitrary order. +The iterator element type is &'a K.

+
§Examples
+
use hashbrown::HashMap;
+
+let mut map = HashMap::new();
+map.insert("a", 1);
+map.insert("b", 2);
+map.insert("c", 3);
+assert_eq!(map.len(), 3);
+let mut vec: Vec<&str> = Vec::new();
+
+for key in map.keys() {
+    println!("{}", key);
+    vec.push(*key);
+}
+
+// The `Keys` iterator produces keys in arbitrary order, so the
+// keys must be sorted to test them against a sorted array.
+vec.sort_unstable();
+assert_eq!(vec, ["a", "b", "c"]);
+
+assert_eq!(map.len(), 3);
+
source

pub fn values(&self) -> Values<'_, K, V> ⓘ

An iterator visiting all values in arbitrary order. +The iterator element type is &'a V.

+
§Examples
+
use hashbrown::HashMap;
+
+let mut map = HashMap::new();
+map.insert("a", 1);
+map.insert("b", 2);
+map.insert("c", 3);
+assert_eq!(map.len(), 3);
+let mut vec: Vec<i32> = Vec::new();
+
+for val in map.values() {
+    println!("{}", val);
+    vec.push(*val);
+}
+
+// The `Values` iterator produces values in arbitrary order, so the
+// values must be sorted to test them against a sorted array.
+vec.sort_unstable();
+assert_eq!(vec, [1, 2, 3]);
+
+assert_eq!(map.len(), 3);
+
source

pub fn values_mut(&mut self) -> ValuesMut<'_, K, V> ⓘ

An iterator visiting all values mutably in arbitrary order. +The iterator element type is &'a mut V.

+
§Examples
+
use hashbrown::HashMap;
+
+let mut map = HashMap::new();
+
+map.insert("a", 1);
+map.insert("b", 2);
+map.insert("c", 3);
+
+for val in map.values_mut() {
+    *val = *val + 10;
+}
+
+assert_eq!(map.len(), 3);
+let mut vec: Vec<i32> = Vec::new();
+
+for val in map.values() {
+    println!("{}", val);
+    vec.push(*val);
+}
+
+// The `Values` iterator produces values in arbitrary order, so the
+// values must be sorted to test them against a sorted array.
+vec.sort_unstable();
+assert_eq!(vec, [11, 12, 13]);
+
+assert_eq!(map.len(), 3);
+
source

pub fn iter(&self) -> Iter<'_, K, V> ⓘ

An iterator visiting all key-value pairs in arbitrary order. +The iterator element type is (&'a K, &'a V).

+
§Examples
+
use hashbrown::HashMap;
+
+let mut map = HashMap::new();
+map.insert("a", 1);
+map.insert("b", 2);
+map.insert("c", 3);
+assert_eq!(map.len(), 3);
+let mut vec: Vec<(&str, i32)> = Vec::new();
+
+for (key, val) in map.iter() {
+    println!("key: {} val: {}", key, val);
+    vec.push((*key, *val));
+}
+
+// The `Iter` iterator produces items in arbitrary order, so the
+// items must be sorted to test them against a sorted array.
+vec.sort_unstable();
+assert_eq!(vec, [("a", 1), ("b", 2), ("c", 3)]);
+
+assert_eq!(map.len(), 3);
+
source

pub fn iter_mut(&mut self) -> IterMut<'_, K, V> ⓘ

An iterator visiting all key-value pairs in arbitrary order, +with mutable references to the values. +The iterator element type is (&'a K, &'a mut V).

+
§Examples
+
use hashbrown::HashMap;
+
+let mut map = HashMap::new();
+map.insert("a", 1);
+map.insert("b", 2);
+map.insert("c", 3);
+
+// Update all values
+for (_, val) in map.iter_mut() {
+    *val *= 2;
+}
+
+assert_eq!(map.len(), 3);
+let mut vec: Vec<(&str, i32)> = Vec::new();
+
+for (key, val) in &map {
+    println!("key: {} val: {}", key, val);
+    vec.push((*key, *val));
+}
+
+// The `Iter` iterator produces items in arbitrary order, so the
+// items must be sorted to test them against a sorted array.
+vec.sort_unstable();
+assert_eq!(vec, [("a", 2), ("b", 4), ("c", 6)]);
+
+assert_eq!(map.len(), 3);
+
source

pub fn len(&self) -> usize

Returns the number of elements in the map.

+
§Examples
+
use hashbrown::HashMap;
+
+let mut a = HashMap::new();
+assert_eq!(a.len(), 0);
+a.insert(1, "a");
+assert_eq!(a.len(), 1);
+
source

pub fn is_empty(&self) -> bool

Returns true if the map contains no elements.

+
§Examples
+
use hashbrown::HashMap;
+
+let mut a = HashMap::new();
+assert!(a.is_empty());
+a.insert(1, "a");
+assert!(!a.is_empty());
+
source

pub fn drain(&mut self) -> Drain<'_, K, V, A> ⓘ

Clears the map, returning all key-value pairs as an iterator. Keeps the +allocated memory for reuse.

+

If the returned iterator is dropped before being fully consumed, it +drops the remaining key-value pairs. The returned iterator keeps a +mutable borrow on the vector to optimize its implementation.

+
§Examples
+
use hashbrown::HashMap;
+
+let mut a = HashMap::new();
+a.insert(1, "a");
+a.insert(2, "b");
+let capacity_before_drain = a.capacity();
+
+for (k, v) in a.drain().take(1) {
+    assert!(k == 1 || k == 2);
+    assert!(v == "a" || v == "b");
+}
+
+// As we can see, the map is empty and contains no element.
+assert!(a.is_empty() && a.len() == 0);
+// But map capacity is equal to old one.
+assert_eq!(a.capacity(), capacity_before_drain);
+
+let mut a = HashMap::new();
+a.insert(1, "a");
+a.insert(2, "b");
+
+{   // Iterator is dropped without being consumed.
+    let d = a.drain();
+}
+
+// But the map is empty even if we do not use Drain iterator.
+assert!(a.is_empty());
+
source

pub fn retain<F>(&mut self, f: F)
where + F: FnMut(&K, &mut V) -> bool,

Retains only the elements specified by the predicate. Keeps the +allocated memory for reuse.

+

In other words, remove all pairs (k, v) such that f(&k, &mut v) returns false. +The elements are visited in unsorted (and unspecified) order.

+
§Examples
+
use hashbrown::HashMap;
+
+let mut map: HashMap<i32, i32> = (0..8).map(|x|(x, x*10)).collect();
+assert_eq!(map.len(), 8);
+
+map.retain(|&k, _| k % 2 == 0);
+
+// We can see, that the number of elements inside map is changed.
+assert_eq!(map.len(), 4);
+
+let mut vec: Vec<(i32, i32)> = map.iter().map(|(&k, &v)| (k, v)).collect();
+vec.sort_unstable();
+assert_eq!(vec, [(0, 0), (2, 20), (4, 40), (6, 60)]);
+
source

pub fn extract_if<F>(&mut self, f: F) -> ExtractIf<'_, K, V, F, A> ⓘ
where + F: FnMut(&K, &mut V) -> bool,

Drains elements which are true under the given predicate, +and returns an iterator over the removed items.

+

In other words, move all pairs (k, v) such that f(&k, &mut v) returns true out +into another iterator.

+

Note that extract_if lets you mutate every value in the filter closure, regardless of +whether you choose to keep or remove it.

+

If the returned ExtractIf is not exhausted, e.g. because it is dropped without iterating +or the iteration short-circuits, then the remaining elements will be retained. +Use retain() with a negated predicate if you do not need the returned iterator.

+

Keeps the allocated memory for reuse.

+
§Examples
+
use hashbrown::HashMap;
+
+let mut map: HashMap<i32, i32> = (0..8).map(|x| (x, x)).collect();
+
+let drained: HashMap<i32, i32> = map.extract_if(|k, _v| k % 2 == 0).collect();
+
+let mut evens = drained.keys().cloned().collect::<Vec<_>>();
+let mut odds = map.keys().cloned().collect::<Vec<_>>();
+evens.sort();
+odds.sort();
+
+assert_eq!(evens, vec![0, 2, 4, 6]);
+assert_eq!(odds, vec![1, 3, 5, 7]);
+
+let mut map: HashMap<i32, i32> = (0..8).map(|x| (x, x)).collect();
+
+{   // Iterator is dropped without being consumed.
+    let d = map.extract_if(|k, _v| k % 2 != 0);
+}
+
+// ExtractIf was not exhausted, therefore no elements were drained.
+assert_eq!(map.len(), 8);
+
source

pub fn clear(&mut self)

Clears the map, removing all key-value pairs. Keeps the allocated memory +for reuse.

+
§Examples
+
use hashbrown::HashMap;
+
+let mut a = HashMap::new();
+a.insert(1, "a");
+let capacity_before_clear = a.capacity();
+
+a.clear();
+
+// Map is empty.
+assert!(a.is_empty());
+// But map capacity is equal to old one.
+assert_eq!(a.capacity(), capacity_before_clear);
+
source

pub fn into_keys(self) -> IntoKeys<K, V, A> ⓘ

Creates a consuming iterator visiting all the keys in arbitrary order. +The map cannot be used after calling this. +The iterator element type is K.

+
§Examples
+
use hashbrown::HashMap;
+
+let mut map = HashMap::new();
+map.insert("a", 1);
+map.insert("b", 2);
+map.insert("c", 3);
+
+let mut vec: Vec<&str> = map.into_keys().collect();
+
+// The `IntoKeys` iterator produces keys in arbitrary order, so the
+// keys must be sorted to test them against a sorted array.
+vec.sort_unstable();
+assert_eq!(vec, ["a", "b", "c"]);
+
source

pub fn into_values(self) -> IntoValues<K, V, A> ⓘ

Creates a consuming iterator visiting all the values in arbitrary order. +The map cannot be used after calling this. +The iterator element type is V.

+
§Examples
+
use hashbrown::HashMap;
+
+let mut map = HashMap::new();
+map.insert("a", 1);
+map.insert("b", 2);
+map.insert("c", 3);
+
+let mut vec: Vec<i32> = map.into_values().collect();
+
+// The `IntoValues` iterator produces values in arbitrary order, so
+// the values must be sorted to test them against a sorted array.
+vec.sort_unstable();
+assert_eq!(vec, [1, 2, 3]);
+
source§

impl<K, V, S, A> HashMap<K, V, S, A>
where + K: Eq + Hash, + S: BuildHasher, + A: Allocator,

source

pub fn reserve(&mut self, additional: usize)

Reserves capacity for at least additional more elements to be inserted +in the HashMap. The collection may reserve more space to avoid +frequent reallocations.

+
§Panics
+

Panics if the new capacity exceeds isize::MAX bytes and abort the program +in case of allocation error. Use try_reserve instead +if you want to handle memory allocation failure.

+
§Examples
+
use hashbrown::HashMap;
+let mut map: HashMap<&str, i32> = HashMap::new();
+// Map is empty and doesn't allocate memory
+assert_eq!(map.capacity(), 0);
+
+map.reserve(10);
+
+// And now map can hold at least 10 elements
+assert!(map.capacity() >= 10);
+
source

pub fn try_reserve(&mut self, additional: usize) -> Result<(), TryReserveError>

Tries to reserve capacity for at least additional more elements to be inserted +in the given HashMap<K,V>. The collection may reserve more space to avoid +frequent reallocations.

+
§Errors
+

If the capacity overflows, or the allocator reports a failure, then an error +is returned.

+
§Examples
+
use hashbrown::HashMap;
+
+let mut map: HashMap<&str, isize> = HashMap::new();
+// Map is empty and doesn't allocate memory
+assert_eq!(map.capacity(), 0);
+
+map.try_reserve(10).expect("why is the test harness OOMing on 10 bytes?");
+
+// And now map can hold at least 10 elements
+assert!(map.capacity() >= 10);
+

If the capacity overflows, or the allocator reports a failure, then an error +is returned:

+ +
use hashbrown::HashMap;
+use hashbrown::TryReserveError;
+let mut map: HashMap<i32, i32> = HashMap::new();
+
+match map.try_reserve(usize::MAX) {
+    Err(error) => match error {
+        TryReserveError::CapacityOverflow => {}
+        _ => panic!("TryReserveError::AllocError ?"),
+    },
+    _ => panic!(),
+}
+
source

pub fn shrink_to_fit(&mut self)

Shrinks the capacity of the map as much as possible. It will drop +down as much as possible while maintaining the internal rules +and possibly leaving some space in accordance with the resize policy.

+
§Examples
+
use hashbrown::HashMap;
+
+let mut map: HashMap<i32, i32> = HashMap::with_capacity(100);
+map.insert(1, 2);
+map.insert(3, 4);
+assert!(map.capacity() >= 100);
+map.shrink_to_fit();
+assert!(map.capacity() >= 2);
+
source

pub fn shrink_to(&mut self, min_capacity: usize)

Shrinks the capacity of the map with a lower limit. It will drop +down no lower than the supplied limit while maintaining the internal rules +and possibly leaving some space in accordance with the resize policy.

+

This function does nothing if the current capacity is smaller than the +supplied minimum capacity.

+
§Examples
+
use hashbrown::HashMap;
+
+let mut map: HashMap<i32, i32> = HashMap::with_capacity(100);
+map.insert(1, 2);
+map.insert(3, 4);
+assert!(map.capacity() >= 100);
+map.shrink_to(10);
+assert!(map.capacity() >= 10);
+map.shrink_to(0);
+assert!(map.capacity() >= 2);
+map.shrink_to(10);
+assert!(map.capacity() >= 2);
+
source

pub fn entry(&mut self, key: K) -> Entry<'_, K, V, S, A>

Gets the given key’s corresponding entry in the map for in-place manipulation.

+
§Examples
+
use hashbrown::HashMap;
+
+let mut letters = HashMap::new();
+
+for ch in "a short treatise on fungi".chars() {
+    let counter = letters.entry(ch).or_insert(0);
+    *counter += 1;
+}
+
+assert_eq!(letters[&'s'], 2);
+assert_eq!(letters[&'t'], 3);
+assert_eq!(letters[&'u'], 1);
+assert_eq!(letters.get(&'y'), None);
+
source

pub fn entry_ref<'a, 'b, Q>( + &'a mut self, + key: &'b Q +) -> EntryRef<'a, 'b, K, Q, V, S, A>
where + Q: Hash + Equivalent<K> + ?Sized,

Gets the given key’s corresponding entry by reference in the map for in-place manipulation.

+
§Examples
+
use hashbrown::HashMap;
+
+let mut words: HashMap<String, usize> = HashMap::new();
+let source = ["poneyland", "horseyland", "poneyland", "poneyland"];
+for (i, &s) in source.iter().enumerate() {
+    let counter = words.entry_ref(s).or_insert(0);
+    *counter += 1;
+}
+
+assert_eq!(words["poneyland"], 3);
+assert_eq!(words["horseyland"], 1);
+
source

pub fn get<Q>(&self, k: &Q) -> Option<&V>
where + Q: Hash + Equivalent<K> + ?Sized,

Returns a reference to the value corresponding to the key.

+

The key may be any borrowed form of the map’s key type, but +Hash and Eq on the borrowed form must match those for +the key type.

+
§Examples
+
use hashbrown::HashMap;
+
+let mut map = HashMap::new();
+map.insert(1, "a");
+assert_eq!(map.get(&1), Some(&"a"));
+assert_eq!(map.get(&2), None);
+
source

pub fn get_key_value<Q>(&self, k: &Q) -> Option<(&K, &V)>
where + Q: Hash + Equivalent<K> + ?Sized,

Returns the key-value pair corresponding to the supplied key.

+

The supplied key may be any borrowed form of the map’s key type, but +Hash and Eq on the borrowed form must match those for +the key type.

+
§Examples
+
use hashbrown::HashMap;
+
+let mut map = HashMap::new();
+map.insert(1, "a");
+assert_eq!(map.get_key_value(&1), Some((&1, &"a")));
+assert_eq!(map.get_key_value(&2), None);
+
source

pub fn get_key_value_mut<Q>(&mut self, k: &Q) -> Option<(&K, &mut V)>
where + Q: Hash + Equivalent<K> + ?Sized,

Returns the key-value pair corresponding to the supplied key, with a mutable reference to value.

+

The supplied key may be any borrowed form of the map’s key type, but +Hash and Eq on the borrowed form must match those for +the key type.

+
§Examples
+
use hashbrown::HashMap;
+
+let mut map = HashMap::new();
+map.insert(1, "a");
+let (k, v) = map.get_key_value_mut(&1).unwrap();
+assert_eq!(k, &1);
+assert_eq!(v, &mut "a");
+*v = "b";
+assert_eq!(map.get_key_value_mut(&1), Some((&1, &mut "b")));
+assert_eq!(map.get_key_value_mut(&2), None);
+
source

pub fn contains_key<Q>(&self, k: &Q) -> bool
where + Q: Hash + Equivalent<K> + ?Sized,

Returns true if the map contains a value for the specified key.

+

The key may be any borrowed form of the map’s key type, but +Hash and Eq on the borrowed form must match those for +the key type.

+
§Examples
+
use hashbrown::HashMap;
+
+let mut map = HashMap::new();
+map.insert(1, "a");
+assert_eq!(map.contains_key(&1), true);
+assert_eq!(map.contains_key(&2), false);
+
source

pub fn get_mut<Q>(&mut self, k: &Q) -> Option<&mut V>
where + Q: Hash + Equivalent<K> + ?Sized,

Returns a mutable reference to the value corresponding to the key.

+

The key may be any borrowed form of the map’s key type, but +Hash and Eq on the borrowed form must match those for +the key type.

+
§Examples
+
use hashbrown::HashMap;
+
+let mut map = HashMap::new();
+map.insert(1, "a");
+if let Some(x) = map.get_mut(&1) {
+    *x = "b";
+}
+assert_eq!(map[&1], "b");
+
+assert_eq!(map.get_mut(&2), None);
+
source

pub fn get_many_mut<Q, const N: usize>( + &mut self, + ks: [&Q; N] +) -> Option<[&mut V; N]>
where + Q: Hash + Equivalent<K> + ?Sized,

Attempts to get mutable references to N values in the map at once.

+

Returns an array of length N with the results of each query. For soundness, at most one +mutable reference will be returned to any value. None will be returned if any of the +keys are duplicates or missing.

+
§Examples
+
use hashbrown::HashMap;
+
+let mut libraries = HashMap::new();
+libraries.insert("Bodleian Library".to_string(), 1602);
+libraries.insert("Athenæum".to_string(), 1807);
+libraries.insert("Herzogin-Anna-Amalia-Bibliothek".to_string(), 1691);
+libraries.insert("Library of Congress".to_string(), 1800);
+
+let got = libraries.get_many_mut([
+    "Athenæum",
+    "Library of Congress",
+]);
+assert_eq!(
+    got,
+    Some([
+        &mut 1807,
+        &mut 1800,
+    ]),
+);
+
+// Missing keys result in None
+let got = libraries.get_many_mut([
+    "Athenæum",
+    "New York Public Library",
+]);
+assert_eq!(got, None);
+
+// Duplicate keys result in None
+let got = libraries.get_many_mut([
+    "Athenæum",
+    "Athenæum",
+]);
+assert_eq!(got, None);
+
source

pub unsafe fn get_many_unchecked_mut<Q, const N: usize>( + &mut self, + ks: [&Q; N] +) -> Option<[&mut V; N]>
where + Q: Hash + Equivalent<K> + ?Sized,

Attempts to get mutable references to N values in the map at once, without validating that +the values are unique.

+

Returns an array of length N with the results of each query. None will be returned if +any of the keys are missing.

+

For a safe alternative see get_many_mut.

+
§Safety
+

Calling this method with overlapping keys is undefined behavior even if the resulting +references are not used.

+
§Examples
+
use hashbrown::HashMap;
+
+let mut libraries = HashMap::new();
+libraries.insert("Bodleian Library".to_string(), 1602);
+libraries.insert("Athenæum".to_string(), 1807);
+libraries.insert("Herzogin-Anna-Amalia-Bibliothek".to_string(), 1691);
+libraries.insert("Library of Congress".to_string(), 1800);
+
+let got = libraries.get_many_mut([
+    "Athenæum",
+    "Library of Congress",
+]);
+assert_eq!(
+    got,
+    Some([
+        &mut 1807,
+        &mut 1800,
+    ]),
+);
+
+// Missing keys result in None
+let got = libraries.get_many_mut([
+    "Athenæum",
+    "New York Public Library",
+]);
+assert_eq!(got, None);
+
source

pub fn get_many_key_value_mut<Q, const N: usize>( + &mut self, + ks: [&Q; N] +) -> Option<[(&K, &mut V); N]>
where + Q: Hash + Equivalent<K> + ?Sized,

Attempts to get mutable references to N values in the map at once, with immutable +references to the corresponding keys.

+

Returns an array of length N with the results of each query. For soundness, at most one +mutable reference will be returned to any value. None will be returned if any of the keys +are duplicates or missing.

+
§Examples
+
use hashbrown::HashMap;
+
+let mut libraries = HashMap::new();
+libraries.insert("Bodleian Library".to_string(), 1602);
+libraries.insert("Athenæum".to_string(), 1807);
+libraries.insert("Herzogin-Anna-Amalia-Bibliothek".to_string(), 1691);
+libraries.insert("Library of Congress".to_string(), 1800);
+
+let got = libraries.get_many_key_value_mut([
+    "Bodleian Library",
+    "Herzogin-Anna-Amalia-Bibliothek",
+]);
+assert_eq!(
+    got,
+    Some([
+        (&"Bodleian Library".to_string(), &mut 1602),
+        (&"Herzogin-Anna-Amalia-Bibliothek".to_string(), &mut 1691),
+    ]),
+);
+// Missing keys result in None
+let got = libraries.get_many_key_value_mut([
+    "Bodleian Library",
+    "Gewandhaus",
+]);
+assert_eq!(got, None);
+
+// Duplicate keys result in None
+let got = libraries.get_many_key_value_mut([
+    "Bodleian Library",
+    "Herzogin-Anna-Amalia-Bibliothek",
+    "Herzogin-Anna-Amalia-Bibliothek",
+]);
+assert_eq!(got, None);
+
source

pub unsafe fn get_many_key_value_unchecked_mut<Q, const N: usize>( + &mut self, + ks: [&Q; N] +) -> Option<[(&K, &mut V); N]>
where + Q: Hash + Equivalent<K> + ?Sized,

Attempts to get mutable references to N values in the map at once, with immutable +references to the corresponding keys, without validating that the values are unique.

+

Returns an array of length N with the results of each query. None will be returned if +any of the keys are missing.

+

For a safe alternative see get_many_key_value_mut.

+
§Safety
+

Calling this method with overlapping keys is undefined behavior even if the resulting +references are not used.

+
§Examples
+
use hashbrown::HashMap;
+
+let mut libraries = HashMap::new();
+libraries.insert("Bodleian Library".to_string(), 1602);
+libraries.insert("Athenæum".to_string(), 1807);
+libraries.insert("Herzogin-Anna-Amalia-Bibliothek".to_string(), 1691);
+libraries.insert("Library of Congress".to_string(), 1800);
+
+let got = libraries.get_many_key_value_mut([
+    "Bodleian Library",
+    "Herzogin-Anna-Amalia-Bibliothek",
+]);
+assert_eq!(
+    got,
+    Some([
+        (&"Bodleian Library".to_string(), &mut 1602),
+        (&"Herzogin-Anna-Amalia-Bibliothek".to_string(), &mut 1691),
+    ]),
+);
+// Missing keys result in None
+let got = libraries.get_many_key_value_mut([
+    "Bodleian Library",
+    "Gewandhaus",
+]);
+assert_eq!(got, None);
+
source

pub fn insert(&mut self, k: K, v: V) -> Option<V>

Inserts a key-value pair into the map.

+

If the map did not have this key present, None is returned.

+

If the map did have this key present, the value is updated, and the old +value is returned. The key is not updated, though; this matters for +types that can be == without being identical. See the std::collections +module-level documentation for more.

+
§Examples
+
use hashbrown::HashMap;
+
+let mut map = HashMap::new();
+assert_eq!(map.insert(37, "a"), None);
+assert_eq!(map.is_empty(), false);
+
+map.insert(37, "b");
+assert_eq!(map.insert(37, "c"), Some("b"));
+assert_eq!(map[&37], "c");
+
source

pub fn insert_unique_unchecked(&mut self, k: K, v: V) -> (&K, &mut V)

Insert a key-value pair into the map without checking +if the key already exists in the map.

+

Returns a reference to the key and value just inserted.

+

This operation is safe if a key does not exist in the map.

+

However, if a key exists in the map already, the behavior is unspecified: +this operation may panic, loop forever, or any following operation with the map +may panic, loop forever or return arbitrary result.

+

That said, this operation (and following operations) are guaranteed to +not violate memory safety.

+

This operation is faster than regular insert, because it does not perform +lookup before insertion.

+

This operation is useful during initial population of the map. +For example, when constructing a map from another map, we know +that keys are unique.

+
§Examples
+
use hashbrown::HashMap;
+
+let mut map1 = HashMap::new();
+assert_eq!(map1.insert(1, "a"), None);
+assert_eq!(map1.insert(2, "b"), None);
+assert_eq!(map1.insert(3, "c"), None);
+assert_eq!(map1.len(), 3);
+
+let mut map2 = HashMap::new();
+
+for (key, value) in map1.into_iter() {
+    map2.insert_unique_unchecked(key, value);
+}
+
+let (key, value) = map2.insert_unique_unchecked(4, "d");
+assert_eq!(key, &4);
+assert_eq!(value, &mut "d");
+*value = "e";
+
+assert_eq!(map2[&1], "a");
+assert_eq!(map2[&2], "b");
+assert_eq!(map2[&3], "c");
+assert_eq!(map2[&4], "e");
+assert_eq!(map2.len(), 4);
+
source

pub fn try_insert( + &mut self, + key: K, + value: V +) -> Result<&mut V, OccupiedError<'_, K, V, S, A>>

Tries to insert a key-value pair into the map, and returns +a mutable reference to the value in the entry.

+
§Errors
+

If the map already had this key present, nothing is updated, and +an error containing the occupied entry and the value is returned.

+
§Examples
+

Basic usage:

+ +
use hashbrown::HashMap;
+use hashbrown::hash_map::OccupiedError;
+
+let mut map = HashMap::new();
+assert_eq!(map.try_insert(37, "a").unwrap(), &"a");
+
+match map.try_insert(37, "b") {
+    Err(OccupiedError { entry, value }) => {
+        assert_eq!(entry.key(), &37);
+        assert_eq!(entry.get(), &"a");
+        assert_eq!(value, "b");
+    }
+    _ => panic!()
+}
+
source

pub fn remove<Q>(&mut self, k: &Q) -> Option<V>
where + Q: Hash + Equivalent<K> + ?Sized,

Removes a key from the map, returning the value at the key if the key +was previously in the map. Keeps the allocated memory for reuse.

+

The key may be any borrowed form of the map’s key type, but +Hash and Eq on the borrowed form must match those for +the key type.

+
§Examples
+
use hashbrown::HashMap;
+
+let mut map = HashMap::new();
+// The map is empty
+assert!(map.is_empty() && map.capacity() == 0);
+
+map.insert(1, "a");
+
+assert_eq!(map.remove(&1), Some("a"));
+assert_eq!(map.remove(&1), None);
+
+// Now map holds none elements
+assert!(map.is_empty());
+
source

pub fn remove_entry<Q>(&mut self, k: &Q) -> Option<(K, V)>
where + Q: Hash + Equivalent<K> + ?Sized,

Removes a key from the map, returning the stored key and value if the +key was previously in the map. Keeps the allocated memory for reuse.

+

The key may be any borrowed form of the map’s key type, but +Hash and Eq on the borrowed form must match those for +the key type.

+
§Examples
+
use hashbrown::HashMap;
+
+let mut map = HashMap::new();
+// The map is empty
+assert!(map.is_empty() && map.capacity() == 0);
+
+map.insert(1, "a");
+
+assert_eq!(map.remove_entry(&1), Some((1, "a")));
+assert_eq!(map.remove(&1), None);
+
+// Now map hold none elements
+assert!(map.is_empty());
+
source§

impl<K, V, S, A: Allocator> HashMap<K, V, S, A>

source

pub fn raw_entry_mut(&mut self) -> RawEntryBuilderMut<'_, K, V, S, A>

Creates a raw entry builder for the HashMap.

+

Raw entries provide the lowest level of control for searching and +manipulating a map. They must be manually initialized with a hash and +then manually searched. After this, insertions into a vacant entry +still require an owned key to be provided.

+

Raw entries are useful for such exotic situations as:

+
    +
  • Hash memoization
    • +
  • Deferring the creation of an owned key until it is known to be required
    • +
  • Using a search key that doesn’t work with the Borrow trait
    • +
  • Using custom comparison logic without newtype wrappers
    • +
+

Because raw entries provide much more low-level control, it’s much easier +to put the HashMap into an inconsistent state which, while memory-safe, +will cause the map to produce seemingly random results. Higher-level and +more foolproof APIs like entry should be preferred when possible.

+

In particular, the hash used to initialized the raw entry must still be +consistent with the hash of the key that is ultimately stored in the entry. +This is because implementations of HashMap may need to recompute hashes +when resizing, at which point only the keys are available.

+

Raw entries give mutable access to the keys. This must not be used +to modify how the key would compare or hash, as the map will not re-evaluate +where the key should go, meaning the keys may become “lost” if their +location does not reflect their state. For instance, if you change a key +so that the map now contains keys which compare equal, search may start +acting erratically, with two keys randomly masking each other. Implementations +are free to assume this doesn’t happen (within the limits of memory-safety).

+
§Examples
+
use core::hash::{BuildHasher, Hash};
+use hashbrown::hash_map::{HashMap, RawEntryMut};
+
+let mut map = HashMap::new();
+map.extend([("a", 100), ("b", 200), ("c", 300)]);
+
+fn compute_hash<K: Hash + ?Sized, S: BuildHasher>(hash_builder: &S, key: &K) -> u64 {
+    use core::hash::Hasher;
+    let mut state = hash_builder.build_hasher();
+    key.hash(&mut state);
+    state.finish()
+}
+
+// Existing key (insert and update)
+match map.raw_entry_mut().from_key(&"a") {
+    RawEntryMut::Vacant(_) => unreachable!(),
+    RawEntryMut::Occupied(mut view) => {
+        assert_eq!(view.get(), &100);
+        let v = view.get_mut();
+        let new_v = (*v) * 10;
+        *v = new_v;
+        assert_eq!(view.insert(1111), 1000);
+    }
+}
+
+assert_eq!(map[&"a"], 1111);
+assert_eq!(map.len(), 3);
+
+// Existing key (take)
+let hash = compute_hash(map.hasher(), &"c");
+match map.raw_entry_mut().from_key_hashed_nocheck(hash, &"c") {
+    RawEntryMut::Vacant(_) => unreachable!(),
+    RawEntryMut::Occupied(view) => {
+        assert_eq!(view.remove_entry(), ("c", 300));
+    }
+}
+assert_eq!(map.raw_entry().from_key(&"c"), None);
+assert_eq!(map.len(), 2);
+
+// Nonexistent key (insert and update)
+let key = "d";
+let hash = compute_hash(map.hasher(), &key);
+match map.raw_entry_mut().from_hash(hash, |q| *q == key) {
+    RawEntryMut::Occupied(_) => unreachable!(),
+    RawEntryMut::Vacant(view) => {
+        let (k, value) = view.insert("d", 4000);
+        assert_eq!((*k, *value), ("d", 4000));
+        *value = 40000;
+    }
+}
+assert_eq!(map[&"d"], 40000);
+assert_eq!(map.len(), 3);
+
+match map.raw_entry_mut().from_hash(hash, |q| *q == key) {
+    RawEntryMut::Vacant(_) => unreachable!(),
+    RawEntryMut::Occupied(view) => {
+        assert_eq!(view.remove_entry(), ("d", 40000));
+    }
+}
+assert_eq!(map.get(&"d"), None);
+assert_eq!(map.len(), 2);
+
source

pub fn raw_entry(&self) -> RawEntryBuilder<'_, K, V, S, A>

Creates a raw immutable entry builder for the HashMap.

+

Raw entries provide the lowest level of control for searching and +manipulating a map. They must be manually initialized with a hash and +then manually searched.

+

This is useful for

+
    +
  • Hash memoization
    • +
  • Using a search key that doesn’t work with the Borrow trait
    • +
  • Using custom comparison logic without newtype wrappers
    • +
+

Unless you are in such a situation, higher-level and more foolproof APIs like +get should be preferred.

+

Immutable raw entries have very limited use; you might instead want raw_entry_mut.

+
§Examples
+
use core::hash::{BuildHasher, Hash};
+use hashbrown::HashMap;
+
+let mut map = HashMap::new();
+map.extend([("a", 100), ("b", 200), ("c", 300)]);
+
+fn compute_hash<K: Hash + ?Sized, S: BuildHasher>(hash_builder: &S, key: &K) -> u64 {
+    use core::hash::Hasher;
+    let mut state = hash_builder.build_hasher();
+    key.hash(&mut state);
+    state.finish()
+}
+
+for k in ["a", "b", "c", "d", "e", "f"] {
+    let hash = compute_hash(map.hasher(), k);
+    let v = map.get(&k).cloned();
+    let kv = v.as_ref().map(|v| (&k, v));
+
+    println!("Key: {} and value: {:?}", k, v);
+
+    assert_eq!(map.raw_entry().from_key(&k), kv);
+    assert_eq!(map.raw_entry().from_hash(hash, |q| *q == k), kv);
+    assert_eq!(map.raw_entry().from_key_hashed_nocheck(hash, &k), kv);
+}
+
source

pub fn raw_table(&self) -> &RawTable<(K, V), A>

Returns a reference to the RawTable used underneath HashMap. +This function is only available if the raw feature of the crate is enabled.

+

See raw_table_mut for more.

+
source

pub fn raw_table_mut(&mut self) -> &mut RawTable<(K, V), A>

Returns a mutable reference to the RawTable used underneath HashMap. +This function is only available if the raw feature of the crate is enabled.

+
§Note
+

Calling this function is safe, but using the raw hash table API may require +unsafe functions or blocks.

+

RawTable API gives the lowest level of control under the map that can be useful +for extending the HashMap’s API, but may lead to undefined behavior.

+
§Examples
+
use core::hash::{BuildHasher, Hash};
+use hashbrown::HashMap;
+
+let mut map = HashMap::new();
+map.extend([("a", 10), ("b", 20), ("c", 30)]);
+assert_eq!(map.len(), 3);
+
+// Let's imagine that we have a value and a hash of the key, but not the key itself.
+// However, if you want to remove the value from the map by hash and value, and you
+// know exactly that the value is unique, then you can create a function like this:
+fn remove_by_hash<K, V, S, F>(
+    map: &mut HashMap<K, V, S>,
+    hash: u64,
+    is_match: F,
+) -> Option<(K, V)>
+where
+    F: Fn(&(K, V)) -> bool,
+{
+    let raw_table = map.raw_table_mut();
+    match raw_table.find(hash, is_match) {
+        Some(bucket) => Some(unsafe { raw_table.remove(bucket).0 }),
+        None => None,
+    }
+}
+
+fn compute_hash<K: Hash + ?Sized, S: BuildHasher>(hash_builder: &S, key: &K) -> u64 {
+    use core::hash::Hasher;
+    let mut state = hash_builder.build_hasher();
+    key.hash(&mut state);
+    state.finish()
+}
+
+let hash = compute_hash(map.hasher(), "a");
+assert_eq!(remove_by_hash(&mut map, hash, |(_, v)| *v == 10), Some(("a", 10)));
+assert_eq!(map.get(&"a"), None);
+assert_eq!(map.len(), 2);
+

Trait Implementations§

source§

impl<K: Clone, V: Clone, S: Clone, A: Allocator + Clone> Clone for HashMap<K, V, S, A>

source§

fn clone(&self) -> Self

Returns a copy of the value. Read more
source§

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

Performs copy-assignment from source. Read more
source§

impl<K, V, S, A> Debug for HashMap<K, V, S, A>
where + K: Debug, + V: Debug, + A: Allocator,

source§

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

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

impl<K, V, S, A> Default for HashMap<K, V, S, A>
where + S: Default, + A: Default + Allocator,

source§

fn default() -> Self

Creates an empty HashMap<K, V, S, A>, with the Default value for the hasher and allocator.

+
§Examples
+
use hashbrown::HashMap;
+use std::collections::hash_map::RandomState;
+
+// You can specify all types of HashMap, including hasher and allocator.
+// Created map is empty and don't allocate memory
+let map: HashMap<u32, String> = Default::default();
+assert_eq!(map.capacity(), 0);
+let map: HashMap<u32, String, RandomState> = HashMap::default();
+assert_eq!(map.capacity(), 0);
+
source§

impl<'a, K, V, S, A> Extend<&'a (K, V)> for HashMap<K, V, S, A>
where + K: Eq + Hash + Copy, + V: Copy, + S: BuildHasher, + A: Allocator,

Inserts all new key-values from the iterator and replaces values with existing +keys with new values returned from the iterator.

+
source§

fn extend<T: IntoIterator<Item = &'a (K, V)>>(&mut self, iter: T)

Inserts all new key-values from the iterator to existing HashMap<K, V, S, A>. +Replace values with existing keys with new values returned from the iterator. +The keys and values must implement Copy trait.

+
§Examples
+
use hashbrown::hash_map::HashMap;
+
+let mut map = HashMap::new();
+map.insert(1, 100);
+
+let arr = [(1, 1), (2, 2)];
+let some_iter = arr.iter();
+map.extend(some_iter);
+// Replace values with existing keys with new values returned from the iterator.
+// So that the map.get(&1) doesn't return Some(&100).
+assert_eq!(map.get(&1), Some(&1));
+
+let some_vec: Vec<_> = vec![(3, 3), (4, 4)];
+map.extend(&some_vec);
+
+let some_arr = [(5, 5), (6, 6)];
+map.extend(&some_arr);
+
+let mut vec: Vec<_> = map.into_iter().collect();
+// The `IntoIter` iterator produces items in arbitrary order, so the
+// items must be sorted to test them against a sorted array.
+vec.sort_unstable();
+assert_eq!(vec, [(1, 1), (2, 2), (3, 3), (4, 4), (5, 5), (6, 6)]);
+
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<'a, K, V, S, A> Extend<(&'a K, &'a V)> for HashMap<K, V, S, A>
where + K: Eq + Hash + Copy, + V: Copy, + S: BuildHasher, + A: Allocator,

Inserts all new key-values from the iterator and replaces values with existing +keys with new values returned from the iterator.

+
source§

fn extend<T: IntoIterator<Item = (&'a K, &'a V)>>(&mut self, iter: T)

Inserts all new key-values from the iterator to existing HashMap<K, V, S, A>. +Replace values with existing keys with new values returned from the iterator. +The keys and values must implement Copy trait.

+
§Examples
+
use hashbrown::hash_map::HashMap;
+
+let mut map = HashMap::new();
+map.insert(1, 100);
+
+let arr = [(1, 1), (2, 2)];
+let some_iter = arr.iter().map(|(k, v)| (k, v));
+map.extend(some_iter);
+// Replace values with existing keys with new values returned from the iterator.
+// So that the map.get(&1) doesn't return Some(&100).
+assert_eq!(map.get(&1), Some(&1));
+
+let some_vec: Vec<_> = vec![(3, 3), (4, 4)];
+map.extend(some_vec.iter().map(|(k, v)| (k, v)));
+
+let some_arr = [(5, 5), (6, 6)];
+map.extend(some_arr.iter().map(|(k, v)| (k, v)));
+
+// You can also extend from another HashMap
+let mut new_map = HashMap::new();
+new_map.extend(&map);
+assert_eq!(new_map, map);
+
+let mut vec: Vec<_> = new_map.into_iter().collect();
+// The `IntoIter` iterator produces items in arbitrary order, so the
+// items must be sorted to test them against a sorted array.
+vec.sort_unstable();
+assert_eq!(vec, [(1, 1), (2, 2), (3, 3), (4, 4), (5, 5), (6, 6)]);
+
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<K, V, S, A> Extend<(K, V)> for HashMap<K, V, S, A>
where + K: Eq + Hash, + S: BuildHasher, + A: Allocator,

Inserts all new key-values from the iterator and replaces values with existing +keys with new values returned from the iterator.

+
source§

fn extend<T: IntoIterator<Item = (K, V)>>(&mut self, iter: T)

Inserts all new key-values from the iterator to existing HashMap<K, V, S, A>. +Replace values with existing keys with new values returned from the iterator.

+
§Examples
+
use hashbrown::hash_map::HashMap;
+
+let mut map = HashMap::new();
+map.insert(1, 100);
+
+let some_iter = [(1, 1), (2, 2)].into_iter();
+map.extend(some_iter);
+// Replace values with existing keys with new values returned from the iterator.
+// So that the map.get(&1) doesn't return Some(&100).
+assert_eq!(map.get(&1), Some(&1));
+
+let some_vec: Vec<_> = vec![(3, 3), (4, 4)];
+map.extend(some_vec);
+
+let some_arr = [(5, 5), (6, 6)];
+map.extend(some_arr);
+let old_map_len = map.len();
+
+// You can also extend from another HashMap
+let mut new_map = HashMap::new();
+new_map.extend(map);
+assert_eq!(new_map.len(), old_map_len);
+
+let mut vec: Vec<_> = new_map.into_iter().collect();
+// The `IntoIter` iterator produces items in arbitrary order, so the
+// items must be sorted to test them against a sorted array.
+vec.sort_unstable();
+assert_eq!(vec, [(1, 1), (2, 2), (3, 3), (4, 4), (5, 5), (6, 6)]);
+
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<T, S, A> From<HashMap<T, (), S, A>> for HashSet<T, S, A>
where + A: Allocator,

source§

fn from(map: HashMap<T, (), S, A>) -> Self

Converts to this type from the input type.
source§

impl<K, V, S, A> FromIterator<(K, V)> for HashMap<K, V, S, A>
where + K: Eq + Hash, + S: BuildHasher + Default, + A: Default + Allocator,

source§

fn from_iter<T: IntoIterator<Item = (K, V)>>(iter: T) -> Self

Creates a value from an iterator. Read more
source§

impl<K, Q, V, S, A> Index<&Q> for HashMap<K, V, S, A>
where + K: Eq + Hash, + Q: Hash + Equivalent<K> + ?Sized, + S: BuildHasher, + A: Allocator,

source§

fn index(&self, key: &Q) -> &V

Returns a reference to the value corresponding to the supplied key.

+
§Panics
+

Panics if the key is not present in the HashMap.

+
§Examples
+
use hashbrown::HashMap;
+
+let map: HashMap<_, _> = [("a", "One"), ("b", "Two")].into();
+
+assert_eq!(map[&"a"], "One");
+assert_eq!(map[&"b"], "Two");
+
§

type Output = V

The returned type after indexing.
source§

impl<'a, K, V, S, A: Allocator> IntoIterator for &'a HashMap<K, V, S, A>

source§

fn into_iter(self) -> Iter<'a, K, V> ⓘ

Creates an iterator over the entries of a HashMap in arbitrary order. +The iterator element type is (&'a K, &'a V).

+

Return the same Iter struct as by the iter method on HashMap.

+
§Examples
+
use hashbrown::HashMap;
+let map_one: HashMap<_, _> = [(1, "a"), (2, "b"), (3, "c")].into();
+let mut map_two = HashMap::new();
+
+for (key, value) in &map_one {
+    println!("Key: {}, Value: {}", key, value);
+    map_two.insert_unique_unchecked(*key, *value);
+}
+
+assert_eq!(map_one, map_two);
+
§

type Item = (&'a K, &'a V)

The type of the elements being iterated over.
§

type IntoIter = Iter<'a, K, V>

Which kind of iterator are we turning this into?
source§

impl<'a, K, V, S, A: Allocator> IntoIterator for &'a mut HashMap<K, V, S, A>

source§

fn into_iter(self) -> IterMut<'a, K, V> ⓘ

Creates an iterator over the entries of a HashMap in arbitrary order +with mutable references to the values. The iterator element type is +(&'a K, &'a mut V).

+

Return the same IterMut struct as by the iter_mut method on +HashMap.

+
§Examples
+
use hashbrown::HashMap;
+let mut map: HashMap<_, _> = [("a", 1), ("b", 2), ("c", 3)].into();
+
+for (key, value) in &mut map {
+    println!("Key: {}, Value: {}", key, value);
+    *value *= 2;
+}
+
+let mut vec = map.iter().collect::<Vec<_>>();
+// The `Iter` iterator produces items in arbitrary order, so the
+// items must be sorted to test them against a sorted array.
+vec.sort_unstable();
+assert_eq!(vec, [(&"a", &2), (&"b", &4), (&"c", &6)]);
+
§

type Item = (&'a K, &'a mut V)

The type of the elements being iterated over.
§

type IntoIter = IterMut<'a, K, V>

Which kind of iterator are we turning this into?
source§

impl<K, V, S, A: Allocator> IntoIterator for HashMap<K, V, S, A>

source§

fn into_iter(self) -> IntoIter<K, V, A> ⓘ

Creates a consuming iterator, that is, one that moves each key-value +pair out of the map in arbitrary order. The map cannot be used after +calling this.

+
§Examples
+
use hashbrown::HashMap;
+
+let map: HashMap<_, _> = [("a", 1), ("b", 2), ("c", 3)].into();
+
+// Not possible with .iter()
+let mut vec: Vec<(&str, i32)> = map.into_iter().collect();
+// The `IntoIter` iterator produces items in arbitrary order, so
+// the items must be sorted to test them against a sorted array.
+vec.sort_unstable();
+assert_eq!(vec, [("a", 1), ("b", 2), ("c", 3)]);
+
§

type Item = (K, V)

The type of the elements being iterated over.
§

type IntoIter = IntoIter<K, V, A>

Which kind of iterator are we turning this into?
source§

impl<K, V, S, A> PartialEq for HashMap<K, V, S, A>
where + K: Eq + Hash, + V: PartialEq, + S: BuildHasher, + A: Allocator,

source§

fn eq(&self, other: &Self) -> 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<K, V, S, A> Eq for HashMap<K, V, S, A>
where + K: Eq + Hash, + V: Eq, + S: BuildHasher, + A: Allocator,

Auto Trait Implementations§

§

impl<K, V, S, A> Freeze for HashMap<K, V, S, A>
where + A: Freeze, + S: Freeze,

§

impl<K, V, S, A> RefUnwindSafe for HashMap<K, V, S, A>
where + A: RefUnwindSafe, + K: RefUnwindSafe, + S: RefUnwindSafe, + V: RefUnwindSafe,

§

impl<K, V, S, A> Send for HashMap<K, V, S, A>
where + A: Send, + K: Send, + S: Send, + V: Send,

§

impl<K, V, S, A> Sync for HashMap<K, V, S, A>
where + A: Sync, + K: Sync, + S: Sync, + V: Sync,

§

impl<K, V, S, A> Unpin for HashMap<K, V, S, A>
where + A: Unpin, + K: Unpin, + S: Unpin, + V: Unpin,

§

impl<K, V, S, A> UnwindSafe for HashMap<K, V, S, A>
where + A: UnwindSafe, + K: UnwindSafe, + S: UnwindSafe, + V: UnwindSafe,

Blanket Implementations§

source§

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

source§

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more
source§

impl<T> Borrow<T> for T
where + T: ?Sized,

source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
source§

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

source§

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

Mutably borrows from an owned value. Read more
source§

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

source§

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

Checks if this value is equivalent to the given key. 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 T
where + 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 T
where + 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 T
where + 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 T
where + 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/hashbrown/struct.HashSet.html b/hashbrown/struct.HashSet.html new file mode 100644 index 0000000000..fd6bd5948f --- /dev/null +++ b/hashbrown/struct.HashSet.html @@ -0,0 +1,715 @@ +HashSet in hashbrown - Rust
+

Struct hashbrown::HashSet

source · 
pub struct HashSet<T, S = DefaultHashBuilder, A: Allocator = Global> { /* private fields */ }
Expand description

A hash set implemented as a HashMap where the value is ().

+

As with the HashMap type, a HashSet requires that the elements +implement the Eq and Hash traits. This can frequently be achieved by +using #[derive(PartialEq, Eq, Hash)]. If you implement these yourself, +it is important that the following property holds:

+
k1 == k2 -> hash(k1) == hash(k2)
+
+

In other words, if two keys are equal, their hashes must be equal.

+

It is a logic error for an item to be modified in such a way that the +item’s hash, as determined by the Hash trait, or its equality, as +determined by the Eq trait, changes while it is in the set. This is +normally only possible through Cell, RefCell, global state, I/O, or +unsafe code.

+

It is also a logic error for the Hash implementation of a key to panic. +This is generally only possible if the trait is implemented manually. If a +panic does occur then the contents of the HashSet may become corrupted and +some items may be dropped from the table.

+

§Examples

+
use hashbrown::HashSet;
+// Type inference lets us omit an explicit type signature (which
+// would be `HashSet<String>` in this example).
+let mut books = HashSet::new();
+
+// Add some books.
+books.insert("A Dance With Dragons".to_string());
+books.insert("To Kill a Mockingbird".to_string());
+books.insert("The Odyssey".to_string());
+books.insert("The Great Gatsby".to_string());
+
+// Check for a specific one.
+if !books.contains("The Winds of Winter") {
+    println!("We have {} books, but The Winds of Winter ain't one.",
+             books.len());
+}
+
+// Remove a book.
+books.remove("The Odyssey");
+
+// Iterate over everything.
+for book in &books {
+    println!("{}", book);
+}
+

The easiest way to use HashSet with a custom type is to derive +Eq and Hash. We must also derive PartialEq. This will in the +future be implied by Eq.

+ +
use hashbrown::HashSet;
+#[derive(Hash, Eq, PartialEq, Debug)]
+struct Viking {
+    name: String,
+    power: usize,
+}
+
+let mut vikings = HashSet::new();
+
+vikings.insert(Viking { name: "Einar".to_string(), power: 9 });
+vikings.insert(Viking { name: "Einar".to_string(), power: 9 });
+vikings.insert(Viking { name: "Olaf".to_string(), power: 4 });
+vikings.insert(Viking { name: "Harald".to_string(), power: 8 });
+
+// Use derived implementation to print the vikings.
+for x in &vikings {
+    println!("{:?}", x);
+}
+

A HashSet with fixed list of elements can be initialized from an array:

+ +
use hashbrown::HashSet;
+
+let viking_names: HashSet<&'static str> =
+    [ "Einar", "Olaf", "Harald" ].into_iter().collect();
+// use the values stored in the set
+

Implementations§

source§

impl<T, S, A: Allocator> HashSet<T, S, A>

source

pub fn capacity(&self) -> usize

Returns the number of elements the set can hold without reallocating.

+
§Examples
+
use hashbrown::HashSet;
+let set: HashSet<i32> = HashSet::with_capacity(100);
+assert!(set.capacity() >= 100);
+
source

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

An iterator visiting all elements in arbitrary order. +The iterator element type is &'a T.

+
§Examples
+
use hashbrown::HashSet;
+let mut set = HashSet::new();
+set.insert("a");
+set.insert("b");
+
+// Will print in an arbitrary order.
+for x in set.iter() {
+    println!("{}", x);
+}
+
source

pub fn len(&self) -> usize

Returns the number of elements in the set.

+
§Examples
+
use hashbrown::HashSet;
+
+let mut v = HashSet::new();
+assert_eq!(v.len(), 0);
+v.insert(1);
+assert_eq!(v.len(), 1);
+
source

pub fn is_empty(&self) -> bool

Returns true if the set contains no elements.

+
§Examples
+
use hashbrown::HashSet;
+
+let mut v = HashSet::new();
+assert!(v.is_empty());
+v.insert(1);
+assert!(!v.is_empty());
+
source

pub fn drain(&mut self) -> Drain<'_, T, A> ⓘ

Clears the set, returning all elements in an iterator.

+
§Examples
+
use hashbrown::HashSet;
+
+let mut set: HashSet<_> = [1, 2, 3].into_iter().collect();
+assert!(!set.is_empty());
+
+// print 1, 2, 3 in an arbitrary order
+for i in set.drain() {
+    println!("{}", i);
+}
+
+assert!(set.is_empty());
+
source

pub fn retain<F>(&mut self, f: F)
where + F: FnMut(&T) -> bool,

Retains only the elements specified by the predicate.

+

In other words, remove all elements e such that f(&e) returns false.

+
§Examples
+
use hashbrown::HashSet;
+
+let xs = [1,2,3,4,5,6];
+let mut set: HashSet<i32> = xs.into_iter().collect();
+set.retain(|&k| k % 2 == 0);
+assert_eq!(set.len(), 3);
+
source

pub fn extract_if<F>(&mut self, f: F) -> ExtractIf<'_, T, F, A> ⓘ
where + F: FnMut(&T) -> bool,

Drains elements which are true under the given predicate, +and returns an iterator over the removed items.

+

In other words, move all elements e such that f(&e) returns true out +into another iterator.

+

If the returned ExtractIf is not exhausted, e.g. because it is dropped without iterating +or the iteration short-circuits, then the remaining elements will be retained. +Use retain() with a negated predicate if you do not need the returned iterator.

+
§Examples
+
use hashbrown::HashSet;
+
+let mut set: HashSet<i32> = (0..8).collect();
+let drained: HashSet<i32> = set.extract_if(|v| v % 2 == 0).collect();
+
+let mut evens = drained.into_iter().collect::<Vec<_>>();
+let mut odds = set.into_iter().collect::<Vec<_>>();
+evens.sort();
+odds.sort();
+
+assert_eq!(evens, vec![0, 2, 4, 6]);
+assert_eq!(odds, vec![1, 3, 5, 7]);
+
source

pub fn clear(&mut self)

Clears the set, removing all values.

+
§Examples
+
use hashbrown::HashSet;
+
+let mut v = HashSet::new();
+v.insert(1);
+v.clear();
+assert!(v.is_empty());
+
source§

impl<T, S> HashSet<T, S, Global>

source

pub const fn with_hasher(hasher: S) -> Self

Creates a new empty hash set which will use the given hasher to hash +keys.

+

The hash set is initially created with a capacity of 0, so it will not +allocate until it is first inserted into.

+
§HashDoS resistance
+

The hash_builder normally use a fixed key by default and that does +not allow the HashSet to be protected against attacks such as HashDoS. +Users who require HashDoS resistance should explicitly use +[ahash::RandomState] or std::collections::hash_map::RandomState +as the hasher when creating a HashSet.

+

The hash_builder passed should implement the BuildHasher trait for +the HashSet to be useful, see its documentation for details.

+
§Examples
+
use hashbrown::HashSet;
+use hashbrown::hash_map::DefaultHashBuilder;
+
+let s = DefaultHashBuilder::default();
+let mut set = HashSet::with_hasher(s);
+set.insert(2);
+
source

pub fn with_capacity_and_hasher(capacity: usize, hasher: S) -> Self

Creates an empty HashSet with the specified capacity, using +hasher to hash the keys.

+

The hash set will be able to hold at least capacity elements without +reallocating. If capacity is 0, the hash set will not allocate.

+
§HashDoS resistance
+

The hash_builder normally use a fixed key by default and that does +not allow the HashSet to be protected against attacks such as HashDoS. +Users who require HashDoS resistance should explicitly use +[ahash::RandomState] or std::collections::hash_map::RandomState +as the hasher when creating a HashSet.

+

The hash_builder passed should implement the BuildHasher trait for +the HashSet to be useful, see its documentation for details.

+
§Examples
+
use hashbrown::HashSet;
+use hashbrown::hash_map::DefaultHashBuilder;
+
+let s = DefaultHashBuilder::default();
+let mut set = HashSet::with_capacity_and_hasher(10, s);
+set.insert(1);
+
source§

impl<T, S, A> HashSet<T, S, A>
where + A: Allocator,

source

pub fn allocator(&self) -> &A

Returns a reference to the underlying allocator.

+
source

pub const fn with_hasher_in(hasher: S, alloc: A) -> Self

Creates a new empty hash set which will use the given hasher to hash +keys.

+

The hash set is initially created with a capacity of 0, so it will not +allocate until it is first inserted into.

+
§HashDoS resistance
+

The hash_builder normally use a fixed key by default and that does +not allow the HashSet to be protected against attacks such as HashDoS. +Users who require HashDoS resistance should explicitly use +[ahash::RandomState] or std::collections::hash_map::RandomState +as the hasher when creating a HashSet.

+

The hash_builder passed should implement the BuildHasher trait for +the HashSet to be useful, see its documentation for details.

+
§Examples
+
use hashbrown::HashSet;
+use hashbrown::hash_map::DefaultHashBuilder;
+
+let s = DefaultHashBuilder::default();
+let mut set = HashSet::with_hasher(s);
+set.insert(2);
+
source

pub fn with_capacity_and_hasher_in(capacity: usize, hasher: S, alloc: A) -> Self

Creates an empty HashSet with the specified capacity, using +hasher to hash the keys.

+

The hash set will be able to hold at least capacity elements without +reallocating. If capacity is 0, the hash set will not allocate.

+
§HashDoS resistance
+

The hash_builder normally use a fixed key by default and that does +not allow the HashSet to be protected against attacks such as HashDoS. +Users who require HashDoS resistance should explicitly use +[ahash::RandomState] or std::collections::hash_map::RandomState +as the hasher when creating a HashSet.

+

The hash_builder passed should implement the BuildHasher trait for +the HashSet to be useful, see its documentation for details.

+
§Examples
+
use hashbrown::HashSet;
+use hashbrown::hash_map::DefaultHashBuilder;
+
+let s = DefaultHashBuilder::default();
+let mut set = HashSet::with_capacity_and_hasher(10, s);
+set.insert(1);
+
source

pub fn hasher(&self) -> &S

Returns a reference to the set’s BuildHasher.

+
§Examples
+
use hashbrown::HashSet;
+use hashbrown::hash_map::DefaultHashBuilder;
+
+let hasher = DefaultHashBuilder::default();
+let set: HashSet<i32> = HashSet::with_hasher(hasher);
+let hasher: &DefaultHashBuilder = set.hasher();
+
source§

impl<T, S, A> HashSet<T, S, A>
where + T: Eq + Hash, + S: BuildHasher, + A: Allocator,

source

pub fn reserve(&mut self, additional: usize)

Reserves capacity for at least additional more elements to be inserted +in the HashSet. The collection may reserve more space to avoid +frequent reallocations.

+
§Panics
+

Panics if the new capacity exceeds isize::MAX bytes and abort the program +in case of allocation error. Use try_reserve instead +if you want to handle memory allocation failure.

+
§Examples
+
use hashbrown::HashSet;
+let mut set: HashSet<i32> = HashSet::new();
+set.reserve(10);
+assert!(set.capacity() >= 10);
+
source

pub fn try_reserve(&mut self, additional: usize) -> Result<(), TryReserveError>

Tries to reserve capacity for at least additional more elements to be inserted +in the given HashSet<K,V>. The collection may reserve more space to avoid +frequent reallocations.

+
§Errors
+

If the capacity overflows, or the allocator reports a failure, then an error +is returned.

+
§Examples
+
use hashbrown::HashSet;
+let mut set: HashSet<i32> = HashSet::new();
+set.try_reserve(10).expect("why is the test harness OOMing on 10 bytes?");
+
source

pub fn shrink_to_fit(&mut self)

Shrinks the capacity of the set as much as possible. It will drop +down as much as possible while maintaining the internal rules +and possibly leaving some space in accordance with the resize policy.

+
§Examples
+
use hashbrown::HashSet;
+
+let mut set = HashSet::with_capacity(100);
+set.insert(1);
+set.insert(2);
+assert!(set.capacity() >= 100);
+set.shrink_to_fit();
+assert!(set.capacity() >= 2);
+
source

pub fn shrink_to(&mut self, min_capacity: usize)

Shrinks the capacity of the set with a lower limit. It will drop +down no lower than the supplied limit while maintaining the internal rules +and possibly leaving some space in accordance with the resize policy.

+

Panics if the current capacity is smaller than the supplied +minimum capacity.

+
§Examples
+
use hashbrown::HashSet;
+
+let mut set = HashSet::with_capacity(100);
+set.insert(1);
+set.insert(2);
+assert!(set.capacity() >= 100);
+set.shrink_to(10);
+assert!(set.capacity() >= 10);
+set.shrink_to(0);
+assert!(set.capacity() >= 2);
+
source

pub fn difference<'a>(&'a self, other: &'a Self) -> Difference<'a, T, S, A> ⓘ

Visits the values representing the difference, +i.e., the values that are in self but not in other.

+
§Examples
+
use hashbrown::HashSet;
+let a: HashSet<_> = [1, 2, 3].into_iter().collect();
+let b: HashSet<_> = [4, 2, 3, 4].into_iter().collect();
+
+// Can be seen as `a - b`.
+for x in a.difference(&b) {
+    println!("{}", x); // Print 1
+}
+
+let diff: HashSet<_> = a.difference(&b).collect();
+assert_eq!(diff, [1].iter().collect());
+
+// Note that difference is not symmetric,
+// and `b - a` means something else:
+let diff: HashSet<_> = b.difference(&a).collect();
+assert_eq!(diff, [4].iter().collect());
+
source

pub fn symmetric_difference<'a>( + &'a self, + other: &'a Self +) -> SymmetricDifference<'a, T, S, A> ⓘ

Visits the values representing the symmetric difference, +i.e., the values that are in self or in other but not in both.

+
§Examples
+
use hashbrown::HashSet;
+let a: HashSet<_> = [1, 2, 3].into_iter().collect();
+let b: HashSet<_> = [4, 2, 3, 4].into_iter().collect();
+
+// Print 1, 4 in arbitrary order.
+for x in a.symmetric_difference(&b) {
+    println!("{}", x);
+}
+
+let diff1: HashSet<_> = a.symmetric_difference(&b).collect();
+let diff2: HashSet<_> = b.symmetric_difference(&a).collect();
+
+assert_eq!(diff1, diff2);
+assert_eq!(diff1, [1, 4].iter().collect());
+
source

pub fn intersection<'a>(&'a self, other: &'a Self) -> Intersection<'a, T, S, A> ⓘ

Visits the values representing the intersection, +i.e., the values that are both in self and other.

+
§Examples
+
use hashbrown::HashSet;
+let a: HashSet<_> = [1, 2, 3].into_iter().collect();
+let b: HashSet<_> = [4, 2, 3, 4].into_iter().collect();
+
+// Print 2, 3 in arbitrary order.
+for x in a.intersection(&b) {
+    println!("{}", x);
+}
+
+let intersection: HashSet<_> = a.intersection(&b).collect();
+assert_eq!(intersection, [2, 3].iter().collect());
+
source

pub fn union<'a>(&'a self, other: &'a Self) -> Union<'a, T, S, A> ⓘ

Visits the values representing the union, +i.e., all the values in self or other, without duplicates.

+
§Examples
+
use hashbrown::HashSet;
+let a: HashSet<_> = [1, 2, 3].into_iter().collect();
+let b: HashSet<_> = [4, 2, 3, 4].into_iter().collect();
+
+// Print 1, 2, 3, 4 in arbitrary order.
+for x in a.union(&b) {
+    println!("{}", x);
+}
+
+let union: HashSet<_> = a.union(&b).collect();
+assert_eq!(union, [1, 2, 3, 4].iter().collect());
+
source

pub fn contains<Q>(&self, value: &Q) -> bool
where + Q: Hash + Equivalent<T> + ?Sized,

Returns true if the set contains a value.

+

The value may be any borrowed form of the set’s value type, but +Hash and Eq on the borrowed form must match those for +the value type.

+
§Examples
+
use hashbrown::HashSet;
+
+let set: HashSet<_> = [1, 2, 3].into_iter().collect();
+assert_eq!(set.contains(&1), true);
+assert_eq!(set.contains(&4), false);
+
source

pub fn get<Q>(&self, value: &Q) -> Option<&T>
where + Q: Hash + Equivalent<T> + ?Sized,

Returns a reference to the value in the set, if any, that is equal to the given value.

+

The value may be any borrowed form of the set’s value type, but +Hash and Eq on the borrowed form must match those for +the value type.

+
§Examples
+
use hashbrown::HashSet;
+
+let set: HashSet<_> = [1, 2, 3].into_iter().collect();
+assert_eq!(set.get(&2), Some(&2));
+assert_eq!(set.get(&4), None);
+
source

pub fn get_or_insert(&mut self, value: T) -> &T

Inserts the given value into the set if it is not present, then +returns a reference to the value in the set.

+
§Examples
+
use hashbrown::HashSet;
+
+let mut set: HashSet<_> = [1, 2, 3].into_iter().collect();
+assert_eq!(set.len(), 3);
+assert_eq!(set.get_or_insert(2), &2);
+assert_eq!(set.get_or_insert(100), &100);
+assert_eq!(set.len(), 4); // 100 was inserted
+
source

pub fn get_or_insert_owned<Q>(&mut self, value: &Q) -> &T
where + Q: Hash + Equivalent<T> + ToOwned<Owned = T> + ?Sized,

Inserts an owned copy of the given value into the set if it is not +present, then returns a reference to the value in the set.

+
§Examples
+
use hashbrown::HashSet;
+
+let mut set: HashSet<String> = ["cat", "dog", "horse"]
+    .iter().map(|&pet| pet.to_owned()).collect();
+
+assert_eq!(set.len(), 3);
+for &pet in &["cat", "dog", "fish"] {
+    let value = set.get_or_insert_owned(pet);
+    assert_eq!(value, pet);
+}
+assert_eq!(set.len(), 4); // a new "fish" was inserted
+
source

pub fn get_or_insert_with<Q, F>(&mut self, value: &Q, f: F) -> &T
where + Q: Hash + Equivalent<T> + ?Sized, + F: FnOnce(&Q) -> T,

Inserts a value computed from f into the set if the given value is +not present, then returns a reference to the value in the set.

+
§Examples
+
use hashbrown::HashSet;
+
+let mut set: HashSet<String> = ["cat", "dog", "horse"]
+    .iter().map(|&pet| pet.to_owned()).collect();
+
+assert_eq!(set.len(), 3);
+for &pet in &["cat", "dog", "fish"] {
+    let value = set.get_or_insert_with(pet, str::to_owned);
+    assert_eq!(value, pet);
+}
+assert_eq!(set.len(), 4); // a new "fish" was inserted
+
source

pub fn entry(&mut self, value: T) -> Entry<'_, T, S, A>

Gets the given value’s corresponding entry in the set for in-place manipulation.

+
§Examples
+
use hashbrown::HashSet;
+use hashbrown::hash_set::Entry::*;
+
+let mut singles = HashSet::new();
+let mut dupes = HashSet::new();
+
+for ch in "a short treatise on fungi".chars() {
+    if let Vacant(dupe_entry) = dupes.entry(ch) {
+        // We haven't already seen a duplicate, so
+        // check if we've at least seen it once.
+        match singles.entry(ch) {
+            Vacant(single_entry) => {
+                // We found a new character for the first time.
+                single_entry.insert()
+            }
+            Occupied(single_entry) => {
+                // We've already seen this once, "move" it to dupes.
+                single_entry.remove();
+                dupe_entry.insert();
+            }
+        }
+    }
+}
+
+assert!(!singles.contains(&'t') && dupes.contains(&'t'));
+assert!(singles.contains(&'u') && !dupes.contains(&'u'));
+assert!(!singles.contains(&'v') && !dupes.contains(&'v'));
+
source

pub fn is_disjoint(&self, other: &Self) -> bool

Returns true if self has no elements in common with other. +This is equivalent to checking for an empty intersection.

+
§Examples
+
use hashbrown::HashSet;
+
+let a: HashSet<_> = [1, 2, 3].into_iter().collect();
+let mut b = HashSet::new();
+
+assert_eq!(a.is_disjoint(&b), true);
+b.insert(4);
+assert_eq!(a.is_disjoint(&b), true);
+b.insert(1);
+assert_eq!(a.is_disjoint(&b), false);
+
source

pub fn is_subset(&self, other: &Self) -> bool

Returns true if the set is a subset of another, +i.e., other contains at least all the values in self.

+
§Examples
+
use hashbrown::HashSet;
+
+let sup: HashSet<_> = [1, 2, 3].into_iter().collect();
+let mut set = HashSet::new();
+
+assert_eq!(set.is_subset(&sup), true);
+set.insert(2);
+assert_eq!(set.is_subset(&sup), true);
+set.insert(4);
+assert_eq!(set.is_subset(&sup), false);
+
source

pub fn is_superset(&self, other: &Self) -> bool

Returns true if the set is a superset of another, +i.e., self contains at least all the values in other.

+
§Examples
+
use hashbrown::HashSet;
+
+let sub: HashSet<_> = [1, 2].into_iter().collect();
+let mut set = HashSet::new();
+
+assert_eq!(set.is_superset(&sub), false);
+
+set.insert(0);
+set.insert(1);
+assert_eq!(set.is_superset(&sub), false);
+
+set.insert(2);
+assert_eq!(set.is_superset(&sub), true);
+
source

pub fn insert(&mut self, value: T) -> bool

Adds a value to the set.

+

If the set did not have this value present, true is returned.

+

If the set did have this value present, false is returned.

+
§Examples
+
use hashbrown::HashSet;
+
+let mut set = HashSet::new();
+
+assert_eq!(set.insert(2), true);
+assert_eq!(set.insert(2), false);
+assert_eq!(set.len(), 1);
+
source

pub fn insert_unique_unchecked(&mut self, value: T) -> &T

Insert a value the set without checking if the value already exists in the set.

+

Returns a reference to the value just inserted.

+

This operation is safe if a value does not exist in the set.

+

However, if a value exists in the set already, the behavior is unspecified: +this operation may panic, loop forever, or any following operation with the set +may panic, loop forever or return arbitrary result.

+

That said, this operation (and following operations) are guaranteed to +not violate memory safety.

+

This operation is faster than regular insert, because it does not perform +lookup before insertion.

+

This operation is useful during initial population of the set. +For example, when constructing a set from another set, we know +that values are unique.

+
source

pub fn replace(&mut self, value: T) -> Option<T>

Adds a value to the set, replacing the existing value, if any, that is equal to the given +one. Returns the replaced value.

+
§Examples
+
use hashbrown::HashSet;
+
+let mut set = HashSet::new();
+set.insert(Vec::<i32>::new());
+
+assert_eq!(set.get(&[][..]).unwrap().capacity(), 0);
+set.replace(Vec::with_capacity(10));
+assert_eq!(set.get(&[][..]).unwrap().capacity(), 10);
+
source

pub fn remove<Q>(&mut self, value: &Q) -> bool
where + Q: Hash + Equivalent<T> + ?Sized,

Removes a value from the set. Returns whether the value was +present in the set.

+

The value may be any borrowed form of the set’s value type, but +Hash and Eq on the borrowed form must match those for +the value type.

+
§Examples
+
use hashbrown::HashSet;
+
+let mut set = HashSet::new();
+
+set.insert(2);
+assert_eq!(set.remove(&2), true);
+assert_eq!(set.remove(&2), false);
+
source

pub fn take<Q>(&mut self, value: &Q) -> Option<T>
where + Q: Hash + Equivalent<T> + ?Sized,

Removes and returns the value in the set, if any, that is equal to the given one.

+

The value may be any borrowed form of the set’s value type, but +Hash and Eq on the borrowed form must match those for +the value type.

+
§Examples
+
use hashbrown::HashSet;
+
+let mut set: HashSet<_> = [1, 2, 3].into_iter().collect();
+assert_eq!(set.take(&2), Some(2));
+assert_eq!(set.take(&2), None);
+
source§

impl<T, S, A: Allocator> HashSet<T, S, A>

source

pub fn raw_table(&self) -> &RawTable<(T, ()), A>

Returns a reference to the RawTable used underneath HashSet. +This function is only available if the raw feature of the crate is enabled.

+
§Note
+

Calling this function is safe, but using the raw hash table API may require +unsafe functions or blocks.

+

RawTable API gives the lowest level of control under the set that can be useful +for extending the HashSet’s API, but may lead to undefined behavior.

+
source

pub fn raw_table_mut(&mut self) -> &mut RawTable<(T, ()), A>

Returns a mutable reference to the RawTable used underneath HashSet. +This function is only available if the raw feature of the crate is enabled.

+
§Note
+

Calling this function is safe, but using the raw hash table API may require +unsafe functions or blocks.

+

RawTable API gives the lowest level of control under the set that can be useful +for extending the HashSet’s API, but may lead to undefined behavior.

+

Trait Implementations§

source§

impl<T, S, A> BitAnd<&HashSet<T, S, A>> for &HashSet<T, S, A>
where + T: Eq + Hash + Clone, + S: BuildHasher + Default, + A: Allocator,

source§

fn bitand(self, rhs: &HashSet<T, S, A>) -> HashSet<T, S>

Returns the intersection of self and rhs as a new HashSet<T, S>.

+
§Examples
+
use hashbrown::HashSet;
+
+let a: HashSet<_> = vec![1, 2, 3].into_iter().collect();
+let b: HashSet<_> = vec![2, 3, 4].into_iter().collect();
+
+let set = &a & &b;
+
+let mut i = 0;
+let expected = [2, 3];
+for x in &set {
+    assert!(expected.contains(x));
+    i += 1;
+}
+assert_eq!(i, expected.len());
+
§

type Output = HashSet<T, S>

The resulting type after applying the & operator.
source§

impl<T, S, A> BitOr<&HashSet<T, S, A>> for &HashSet<T, S, A>
where + T: Eq + Hash + Clone, + S: BuildHasher + Default, + A: Allocator,

source§

fn bitor(self, rhs: &HashSet<T, S, A>) -> HashSet<T, S>

Returns the union of self and rhs as a new HashSet<T, S>.

+
§Examples
+
use hashbrown::HashSet;
+
+let a: HashSet<_> = vec![1, 2, 3].into_iter().collect();
+let b: HashSet<_> = vec![3, 4, 5].into_iter().collect();
+
+let set = &a | &b;
+
+let mut i = 0;
+let expected = [1, 2, 3, 4, 5];
+for x in &set {
+    assert!(expected.contains(x));
+    i += 1;
+}
+assert_eq!(i, expected.len());
+
§

type Output = HashSet<T, S>

The resulting type after applying the | operator.
source§

impl<T, S> BitXor<&HashSet<T, S>> for &HashSet<T, S>
where + T: Eq + Hash + Clone, + S: BuildHasher + Default,

source§

fn bitxor(self, rhs: &HashSet<T, S>) -> HashSet<T, S>

Returns the symmetric difference of self and rhs as a new HashSet<T, S>.

+
§Examples
+
use hashbrown::HashSet;
+
+let a: HashSet<_> = vec![1, 2, 3].into_iter().collect();
+let b: HashSet<_> = vec![3, 4, 5].into_iter().collect();
+
+let set = &a ^ &b;
+
+let mut i = 0;
+let expected = [1, 2, 4, 5];
+for x in &set {
+    assert!(expected.contains(x));
+    i += 1;
+}
+assert_eq!(i, expected.len());
+
§

type Output = HashSet<T, S>

The resulting type after applying the ^ operator.
source§

impl<T: Clone, S: Clone, A: Allocator + Clone> Clone for HashSet<T, S, A>

source§

fn clone(&self) -> Self

Returns a copy of the value. Read more
source§

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

Performs copy-assignment from source. Read more
source§

impl<T, S, A> Debug for HashSet<T, S, A>
where + T: Debug, + A: Allocator,

source§

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

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

impl<T, S, A> Default for HashSet<T, S, A>
where + S: Default, + A: Default + Allocator,

source§

fn default() -> Self

Creates an empty HashSet<T, S> with the Default value for the hasher.

+
source§

impl<'a, T, S, A> Extend<&'a T> for HashSet<T, S, A>
where + T: 'a + Eq + Hash + Copy, + S: BuildHasher, + A: Allocator,

source§

fn extend<I: IntoIterator<Item = &'a T>>(&mut self, iter: I)

Extends a collection with the contents of an iterator. Read more
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<T, S, A> Extend<T> for HashSet<T, S, A>
where + T: Eq + Hash, + S: BuildHasher, + A: Allocator,

source§

fn extend<I: IntoIterator<Item = T>>(&mut self, iter: I)

Extends a collection with the contents of an iterator. Read more
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<T, S, A> From<HashMap<T, (), S, A>> for HashSet<T, S, A>
where + A: Allocator,

source§

fn from(map: HashMap<T, (), S, A>) -> Self

Converts to this type from the input type.
source§

impl<T, S, A> FromIterator<T> for HashSet<T, S, A>
where + T: Eq + Hash, + S: BuildHasher + Default, + A: Default + Allocator,

source§

fn from_iter<I: IntoIterator<Item = T>>(iter: I) -> Self

Creates a value from an iterator. Read more
source§

impl<'a, T, S, A: Allocator> IntoIterator for &'a HashSet<T, S, A>

§

type Item = &'a T

The type of the elements being iterated over.
§

type IntoIter = Iter<'a, T>

Which kind of iterator are we turning this into?
source§

fn into_iter(self) -> Iter<'a, T> ⓘ

Creates an iterator from a value. Read more
source§

impl<T, S, A: Allocator> IntoIterator for HashSet<T, S, A>

source§

fn into_iter(self) -> IntoIter<T, A> ⓘ

Creates a consuming iterator, that is, one that moves each value out +of the set in arbitrary order. The set cannot be used after calling +this.

+
§Examples
+
use hashbrown::HashSet;
+let mut set = HashSet::new();
+set.insert("a".to_string());
+set.insert("b".to_string());
+
+// Not possible to collect to a Vec<String> with a regular `.iter()`.
+let v: Vec<String> = set.into_iter().collect();
+
+// Will print in an arbitrary order.
+for x in &v {
+    println!("{}", x);
+}
+
§

type Item = T

The type of the elements being iterated over.
§

type IntoIter = IntoIter<T, A>

Which kind of iterator are we turning this into?
source§

impl<T, S, A> PartialEq for HashSet<T, S, A>
where + T: Eq + Hash, + S: BuildHasher, + A: Allocator,

source§

fn eq(&self, other: &Self) -> 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<T, S> Sub<&HashSet<T, S>> for &HashSet<T, S>
where + T: Eq + Hash + Clone, + S: BuildHasher + Default,

source§

fn sub(self, rhs: &HashSet<T, S>) -> HashSet<T, S>

Returns the difference of self and rhs as a new HashSet<T, S>.

+
§Examples
+
use hashbrown::HashSet;
+
+let a: HashSet<_> = vec![1, 2, 3].into_iter().collect();
+let b: HashSet<_> = vec![3, 4, 5].into_iter().collect();
+
+let set = &a - &b;
+
+let mut i = 0;
+let expected = [1, 2];
+for x in &set {
+    assert!(expected.contains(x));
+    i += 1;
+}
+assert_eq!(i, expected.len());
+
§

type Output = HashSet<T, S>

The resulting type after applying the - operator.
source§

impl<T, S, A> Eq for HashSet<T, S, A>
where + T: Eq + Hash, + S: BuildHasher, + A: Allocator,

Auto Trait Implementations§

§

impl<T, S, A> Freeze for HashSet<T, S, A>
where + A: Freeze, + S: Freeze,

§

impl<T, S, A> RefUnwindSafe for HashSet<T, S, A>
where + A: RefUnwindSafe, + S: RefUnwindSafe, + T: RefUnwindSafe,

§

impl<T, S, A> Send for HashSet<T, S, A>
where + A: Send, + S: Send, + T: Send,

§

impl<T, S, A> Sync for HashSet<T, S, A>
where + A: Sync, + S: Sync, + T: Sync,

§

impl<T, S, A> Unpin for HashSet<T, S, A>
where + A: Unpin, + S: Unpin, + T: Unpin,

§

impl<T, S, A> UnwindSafe for HashSet<T, S, A>
where + A: UnwindSafe, + S: UnwindSafe, + T: UnwindSafe,

Blanket Implementations§

source§

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

source§

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more
source§

impl<T> Borrow<T> for T
where + T: ?Sized,

source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
source§

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

source§

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

Mutably borrows from an owned value. Read more
source§

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

source§

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

Checks if this value is equivalent to the given key. 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 T
where + 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 T
where + 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 T
where + 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 T
where + 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/hashbrown/struct.HashTable.html b/hashbrown/struct.HashTable.html new file mode 100644 index 0000000000..7e89ac9666 --- /dev/null +++ b/hashbrown/struct.HashTable.html @@ -0,0 +1,588 @@ +HashTable in hashbrown - Rust
+

Struct hashbrown::HashTable

source · 
pub struct HashTable<T, A = Global>
where
+    A: Allocator,
{ /* private fields */ }
Expand description

Low-level hash table with explicit hashing.

+

The primary use case for this type over HashMap or HashSet is to +support types that do not implement the Hash and Eq traits, but +instead require additional data not contained in the key itself to compute a +hash and compare two elements for equality.

+

Examples of when this can be useful include:

+
    +
  • An IndexMap implementation where indices into a Vec are stored as +elements in a HashTable<usize>. Hashing and comparing the elements +requires indexing the associated Vec to get the actual value referred to +by the index.
    • +
  • Avoiding re-computing a hash when it is already known.
    • +
  • Mutating the key of an element in a way that doesn’t affect its hash.
    • +
+

To achieve this, HashTable methods that search for an element in the table +require a hash value and equality function to be explicitly passed in as +arguments. The method will then iterate over the elements with the given +hash and call the equality function on each of them, until a match is found.

+

In most cases, a HashTable will not be exposed directly in an API. It will +instead be wrapped in a helper type which handles the work of calculating +hash values and comparing elements.

+

Due to its low-level nature, this type provides fewer guarantees than +HashMap and HashSet. Specifically, the API allows you to shoot +yourself in the foot by having multiple elements with identical keys in the +table. The table itself will still function correctly and lookups will +arbitrarily return one of the matching elements. However you should avoid +doing this because it changes the runtime of hash table operations from +O(1) to O(k) where k is the number of duplicate entries.

+

Implementations§

source§

impl<T> HashTable<T, Global>

source

pub const fn new() -> Self

Creates an empty HashTable.

+

The hash table is initially created with a capacity of 0, so it will not allocate until it +is first inserted into.

+
§Examples
+
use hashbrown::HashTable;
+let mut table: HashTable<&str> = HashTable::new();
+assert_eq!(table.len(), 0);
+assert_eq!(table.capacity(), 0);
+
source

pub fn with_capacity(capacity: usize) -> Self

Creates an empty HashTable with the specified capacity.

+

The hash table will be able to hold at least capacity elements without +reallocating. If capacity is 0, the hash table will not allocate.

+
§Examples
+
use hashbrown::HashTable;
+let mut table: HashTable<&str> = HashTable::with_capacity(10);
+assert_eq!(table.len(), 0);
+assert!(table.capacity() >= 10);
+
source§

impl<T, A> HashTable<T, A>
where + A: Allocator,

source

pub const fn new_in(alloc: A) -> Self

Creates an empty HashTable using the given allocator.

+

The hash table is initially created with a capacity of 0, so it will not allocate until it +is first inserted into.

+
§Examples
+
use ahash::AHasher;
+use bumpalo::Bump;
+use hashbrown::HashTable;
+use std::hash::{BuildHasher, BuildHasherDefault};
+
+let bump = Bump::new();
+let mut table = HashTable::new_in(&bump);
+let hasher = BuildHasherDefault::<AHasher>::default();
+let hasher = |val: &_| hasher.hash_one(val);
+
+// The created HashTable holds none elements
+assert_eq!(table.len(), 0);
+
+// The created HashTable also doesn't allocate memory
+assert_eq!(table.capacity(), 0);
+
+// Now we insert element inside created HashTable
+table.insert_unique(hasher(&"One"), "One", hasher);
+// We can see that the HashTable holds 1 element
+assert_eq!(table.len(), 1);
+// And it also allocates some capacity
+assert!(table.capacity() > 1);
+
source

pub fn with_capacity_in(capacity: usize, alloc: A) -> Self

Creates an empty HashTable with the specified capacity using the given allocator.

+

The hash table will be able to hold at least capacity elements without +reallocating. If capacity is 0, the hash table will not allocate.

+
§Examples
+
use ahash::AHasher;
+use bumpalo::Bump;
+use hashbrown::HashTable;
+use std::hash::{BuildHasher, BuildHasherDefault};
+
+let bump = Bump::new();
+let mut table = HashTable::with_capacity_in(5, &bump);
+let hasher = BuildHasherDefault::<AHasher>::default();
+let hasher = |val: &_| hasher.hash_one(val);
+
+// The created HashTable holds none elements
+assert_eq!(table.len(), 0);
+// But it can hold at least 5 elements without reallocating
+let empty_map_capacity = table.capacity();
+assert!(empty_map_capacity >= 5);
+
+// Now we insert some 5 elements inside created HashTable
+table.insert_unique(hasher(&"One"), "One", hasher);
+table.insert_unique(hasher(&"Two"), "Two", hasher);
+table.insert_unique(hasher(&"Three"), "Three", hasher);
+table.insert_unique(hasher(&"Four"), "Four", hasher);
+table.insert_unique(hasher(&"Five"), "Five", hasher);
+
+// We can see that the HashTable holds 5 elements
+assert_eq!(table.len(), 5);
+// But its capacity isn't changed
+assert_eq!(table.capacity(), empty_map_capacity)
+
source

pub fn allocator(&self) -> &A

Returns a reference to the underlying allocator.

+
source

pub fn find(&self, hash: u64, eq: impl FnMut(&T) -> bool) -> Option<&T>

Returns a reference to an entry in the table with the given hash and +which satisfies the equality function passed.

+

This method will call eq for all entries with the given hash, but may +also call it for entries with a different hash. eq should only return +true for the desired entry, at which point the search is stopped.

+
§Examples
+
use ahash::AHasher;
+use hashbrown::HashTable;
+use std::hash::{BuildHasher, BuildHasherDefault};
+
+let mut table = HashTable::new();
+let hasher = BuildHasherDefault::<AHasher>::default();
+let hasher = |val: &_| hasher.hash_one(val);
+table.insert_unique(hasher(&1), 1, hasher);
+table.insert_unique(hasher(&2), 2, hasher);
+table.insert_unique(hasher(&3), 3, hasher);
+assert_eq!(table.find(hasher(&2), |&val| val == 2), Some(&2));
+assert_eq!(table.find(hasher(&4), |&val| val == 4), None);
+
source

pub fn find_mut( + &mut self, + hash: u64, + eq: impl FnMut(&T) -> bool +) -> Option<&mut T>

Returns a mutable reference to an entry in the table with the given hash +and which satisfies the equality function passed.

+

This method will call eq for all entries with the given hash, but may +also call it for entries with a different hash. eq should only return +true for the desired entry, at which point the search is stopped.

+

When mutating an entry, you should ensure that it still retains the same +hash value as when it was inserted, otherwise lookups of that entry may +fail to find it.

+
§Examples
+
use ahash::AHasher;
+use hashbrown::HashTable;
+use std::hash::{BuildHasher, BuildHasherDefault};
+
+let mut table = HashTable::new();
+let hasher = BuildHasherDefault::<AHasher>::default();
+let hasher = |val: &_| hasher.hash_one(val);
+table.insert_unique(hasher(&1), (1, "a"), |val| hasher(&val.0));
+if let Some(val) = table.find_mut(hasher(&1), |val| val.0 == 1) {
+    val.1 = "b";
+}
+assert_eq!(table.find(hasher(&1), |val| val.0 == 1), Some(&(1, "b")));
+assert_eq!(table.find(hasher(&2), |val| val.0 == 2), None);
+
source

pub fn find_entry( + &mut self, + hash: u64, + eq: impl FnMut(&T) -> bool +) -> Result<OccupiedEntry<'_, T, A>, AbsentEntry<'_, T, A>>

Returns an OccupiedEntry for an entry in the table with the given hash +and which satisfies the equality function passed.

+

This can be used to remove the entry from the table. Call +HashTable::entry instead if you wish to insert an entry if the +lookup fails.

+

This method will call eq for all entries with the given hash, but may +also call it for entries with a different hash. eq should only return +true for the desired entry, at which point the search is stopped.

+
§Examples
+
use ahash::AHasher;
+use hashbrown::HashTable;
+use std::hash::{BuildHasher, BuildHasherDefault};
+
+let mut table = HashTable::new();
+let hasher = BuildHasherDefault::<AHasher>::default();
+let hasher = |val: &_| hasher.hash_one(val);
+table.insert_unique(hasher(&1), (1, "a"), |val| hasher(&val.0));
+if let Ok(entry) = table.find_entry(hasher(&1), |val| val.0 == 1) {
+    entry.remove();
+}
+assert_eq!(table.find(hasher(&1), |val| val.0 == 1), None);
+
source

pub fn entry( + &mut self, + hash: u64, + eq: impl FnMut(&T) -> bool, + hasher: impl Fn(&T) -> u64 +) -> Entry<'_, T, A>

Returns an Entry for an entry in the table with the given hash +and which satisfies the equality function passed.

+

This can be used to remove the entry from the table, or insert a new +entry with the given hash if one doesn’t already exist.

+

This method will call eq for all entries with the given hash, but may +also call it for entries with a different hash. eq should only return +true for the desired entry, at which point the search is stopped.

+

This method may grow the table in preparation for an insertion. Call +HashTable::find_entry if this is undesirable.

+

hasher is called if entries need to be moved or copied to a new table. +This must return the same hash value that each entry was inserted with.

+
§Examples
+
use ahash::AHasher;
+use hashbrown::hash_table::Entry;
+use hashbrown::HashTable;
+use std::hash::{BuildHasher, BuildHasherDefault};
+
+let mut table = HashTable::new();
+let hasher = BuildHasherDefault::<AHasher>::default();
+let hasher = |val: &_| hasher.hash_one(val);
+table.insert_unique(hasher(&1), (1, "a"), |val| hasher(&val.0));
+if let Entry::Occupied(entry) = table.entry(hasher(&1), |val| val.0 == 1, |val| hasher(&val.0))
+{
+    entry.remove();
+}
+if let Entry::Vacant(entry) = table.entry(hasher(&2), |val| val.0 == 2, |val| hasher(&val.0)) {
+    entry.insert((2, "b"));
+}
+assert_eq!(table.find(hasher(&1), |val| val.0 == 1), None);
+assert_eq!(table.find(hasher(&2), |val| val.0 == 2), Some(&(2, "b")));
+
source

pub fn insert_unique( + &mut self, + hash: u64, + value: T, + hasher: impl Fn(&T) -> u64 +) -> OccupiedEntry<'_, T, A>

Inserts an element into the HashTable with the given hash value, but +without checking whether an equivalent element already exists within the +table.

+

hasher is called if entries need to be moved or copied to a new table. +This must return the same hash value that each entry was inserted with.

+
§Examples
+
use ahash::AHasher;
+use hashbrown::HashTable;
+use std::hash::{BuildHasher, BuildHasherDefault};
+
+let mut v = HashTable::new();
+let hasher = BuildHasherDefault::<AHasher>::default();
+let hasher = |val: &_| hasher.hash_one(val);
+v.insert_unique(hasher(&1), 1, hasher);
+
source

pub fn clear(&mut self)

Clears the table, removing all values.

+
§Examples
+
use ahash::AHasher;
+use hashbrown::HashTable;
+use std::hash::{BuildHasher, BuildHasherDefault};
+
+let mut v = HashTable::new();
+let hasher = BuildHasherDefault::<AHasher>::default();
+let hasher = |val: &_| hasher.hash_one(val);
+v.insert_unique(hasher(&1), 1, hasher);
+v.clear();
+assert!(v.is_empty());
+
source

pub fn shrink_to_fit(&mut self, hasher: impl Fn(&T) -> u64)

Shrinks the capacity of the table as much as possible. It will drop +down as much as possible while maintaining the internal rules +and possibly leaving some space in accordance with the resize policy.

+

hasher is called if entries need to be moved or copied to a new table. +This must return the same hash value that each entry was inserted with.

+
§Examples
+
use ahash::AHasher;
+use hashbrown::HashTable;
+use std::hash::{BuildHasher, BuildHasherDefault};
+
+let mut table = HashTable::with_capacity(100);
+let hasher = BuildHasherDefault::<AHasher>::default();
+let hasher = |val: &_| hasher.hash_one(val);
+table.insert_unique(hasher(&1), 1, hasher);
+table.insert_unique(hasher(&2), 2, hasher);
+assert!(table.capacity() >= 100);
+table.shrink_to_fit(hasher);
+assert!(table.capacity() >= 2);
+
source

pub fn shrink_to(&mut self, min_capacity: usize, hasher: impl Fn(&T) -> u64)

Shrinks the capacity of the table with a lower limit. It will drop +down no lower than the supplied limit while maintaining the internal rules +and possibly leaving some space in accordance with the resize policy.

+

hasher is called if entries need to be moved or copied to a new table. +This must return the same hash value that each entry was inserted with.

+

Panics if the current capacity is smaller than the supplied +minimum capacity.

+
§Examples
+
use ahash::AHasher;
+use hashbrown::HashTable;
+use std::hash::{BuildHasher, BuildHasherDefault};
+
+let mut table = HashTable::with_capacity(100);
+let hasher = BuildHasherDefault::<AHasher>::default();
+let hasher = |val: &_| hasher.hash_one(val);
+table.insert_unique(hasher(&1), 1, hasher);
+table.insert_unique(hasher(&2), 2, hasher);
+assert!(table.capacity() >= 100);
+table.shrink_to(10, hasher);
+assert!(table.capacity() >= 10);
+table.shrink_to(0, hasher);
+assert!(table.capacity() >= 2);
+
source

pub fn reserve(&mut self, additional: usize, hasher: impl Fn(&T) -> u64)

Reserves capacity for at least additional more elements to be inserted +in the HashTable. The collection may reserve more space to avoid +frequent reallocations.

+

hasher is called if entries need to be moved or copied to a new table. +This must return the same hash value that each entry was inserted with.

+
§Panics
+

Panics if the new capacity exceeds isize::MAX bytes and abort the program +in case of allocation error. Use try_reserve instead +if you want to handle memory allocation failure.

+
§Examples
+
use ahash::AHasher;
+use hashbrown::HashTable;
+use std::hash::{BuildHasher, BuildHasherDefault};
+
+let mut table: HashTable<i32> = HashTable::new();
+let hasher = BuildHasherDefault::<AHasher>::default();
+let hasher = |val: &_| hasher.hash_one(val);
+table.reserve(10, hasher);
+assert!(table.capacity() >= 10);
+
source

pub fn try_reserve( + &mut self, + additional: usize, + hasher: impl Fn(&T) -> u64 +) -> Result<(), TryReserveError>

Tries to reserve capacity for at least additional more elements to be inserted +in the given HashTable. The collection may reserve more space to avoid +frequent reallocations.

+

hasher is called if entries need to be moved or copied to a new table. +This must return the same hash value that each entry was inserted with.

+
§Errors
+

If the capacity overflows, or the allocator reports a failure, then an error +is returned.

+
§Examples
+
use ahash::AHasher;
+use hashbrown::HashTable;
+use std::hash::{BuildHasher, BuildHasherDefault};
+
+let mut table: HashTable<i32> = HashTable::new();
+let hasher = BuildHasherDefault::<AHasher>::default();
+let hasher = |val: &_| hasher.hash_one(val);
+table
+    .try_reserve(10, hasher)
+    .expect("why is the test harness OOMing on 10 bytes?");
+
source

pub fn capacity(&self) -> usize

Returns the number of elements the table can hold without reallocating.

+
§Examples
+
use hashbrown::HashTable;
+let table: HashTable<i32> = HashTable::with_capacity(100);
+assert!(table.capacity() >= 100);
+
source

pub fn len(&self) -> usize

Returns the number of elements in the table.

+
§Examples
+
use ahash::AHasher;
+use hashbrown::HashTable;
+use std::hash::{BuildHasher, BuildHasherDefault};
+
+let hasher = BuildHasherDefault::<AHasher>::default();
+let hasher = |val: &_| hasher.hash_one(val);
+let mut v = HashTable::new();
+assert_eq!(v.len(), 0);
+v.insert_unique(hasher(&1), 1, hasher);
+assert_eq!(v.len(), 1);
+
source

pub fn is_empty(&self) -> bool

Returns true if the set contains no elements.

+
§Examples
+
use ahash::AHasher;
+use hashbrown::HashTable;
+use std::hash::{BuildHasher, BuildHasherDefault};
+
+let hasher = BuildHasherDefault::<AHasher>::default();
+let hasher = |val: &_| hasher.hash_one(val);
+let mut v = HashTable::new();
+assert!(v.is_empty());
+v.insert_unique(hasher(&1), 1, hasher);
+assert!(!v.is_empty());
+
source

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

An iterator visiting all elements in arbitrary order. +The iterator element type is &'a T.

+
§Examples
+
use ahash::AHasher;
+use hashbrown::HashTable;
+use std::hash::{BuildHasher, BuildHasherDefault};
+
+let mut table = HashTable::new();
+let hasher = BuildHasherDefault::<AHasher>::default();
+let hasher = |val: &_| hasher.hash_one(val);
+table.insert_unique(hasher(&"a"), "b", hasher);
+table.insert_unique(hasher(&"b"), "b", hasher);
+
+// Will print in an arbitrary order.
+for x in table.iter() {
+    println!("{}", x);
+}
+
source

pub fn iter_mut(&mut self) -> IterMut<'_, T> ⓘ

An iterator visiting all elements in arbitrary order, +with mutable references to the elements. +The iterator element type is &'a mut T.

+
§Examples
+
use ahash::AHasher;
+use hashbrown::HashTable;
+use std::hash::{BuildHasher, BuildHasherDefault};
+
+let mut table = HashTable::new();
+let hasher = BuildHasherDefault::<AHasher>::default();
+let hasher = |val: &_| hasher.hash_one(val);
+table.insert_unique(hasher(&1), 1, hasher);
+table.insert_unique(hasher(&2), 2, hasher);
+table.insert_unique(hasher(&3), 3, hasher);
+
+// Update all values
+for val in table.iter_mut() {
+    *val *= 2;
+}
+
+assert_eq!(table.len(), 3);
+let mut vec: Vec<i32> = Vec::new();
+
+for val in &table {
+    println!("val: {}", val);
+    vec.push(*val);
+}
+
+// The `Iter` iterator produces items in arbitrary order, so the
+// items must be sorted to test them against a sorted array.
+vec.sort_unstable();
+assert_eq!(vec, [2, 4, 6]);
+
+assert_eq!(table.len(), 3);
+
source

pub fn retain(&mut self, f: impl FnMut(&mut T) -> bool)

Retains only the elements specified by the predicate.

+

In other words, remove all elements e such that f(&e) returns false.

+
§Examples
+
use ahash::AHasher;
+use hashbrown::HashTable;
+use std::hash::{BuildHasher, BuildHasherDefault};
+
+let mut table = HashTable::new();
+let hasher = BuildHasherDefault::<AHasher>::default();
+let hasher = |val: &_| hasher.hash_one(val);
+for x in 1..=6 {
+    table.insert_unique(hasher(&x), x, hasher);
+}
+table.retain(|&mut x| x % 2 == 0);
+assert_eq!(table.len(), 3);
+
source

pub fn drain(&mut self) -> Drain<'_, T, A> ⓘ

Clears the set, returning all elements in an iterator.

+
§Examples
+
use ahash::AHasher;
+use hashbrown::HashTable;
+use std::hash::{BuildHasher, BuildHasherDefault};
+
+let mut table = HashTable::new();
+let hasher = BuildHasherDefault::<AHasher>::default();
+let hasher = |val: &_| hasher.hash_one(val);
+for x in 1..=3 {
+    table.insert_unique(hasher(&x), x, hasher);
+}
+assert!(!table.is_empty());
+
+// print 1, 2, 3 in an arbitrary order
+for i in table.drain() {
+    println!("{}", i);
+}
+
+assert!(table.is_empty());
+
source

pub fn extract_if<F>(&mut self, f: F) -> ExtractIf<'_, T, F, A> ⓘ
where + F: FnMut(&mut T) -> bool,

Drains elements which are true under the given predicate, +and returns an iterator over the removed items.

+

In other words, move all elements e such that f(&e) returns true out +into another iterator.

+

If the returned ExtractIf is not exhausted, e.g. because it is dropped without iterating +or the iteration short-circuits, then the remaining elements will be retained. +Use retain() with a negated predicate if you do not need the returned iterator.

+
§Examples
+
use ahash::AHasher;
+use hashbrown::HashTable;
+use std::hash::{BuildHasher, BuildHasherDefault};
+
+let mut table = HashTable::new();
+let hasher = BuildHasherDefault::<AHasher>::default();
+let hasher = |val: &_| hasher.hash_one(val);
+for x in 0..8 {
+    table.insert_unique(hasher(&x), x, hasher);
+}
+let drained: Vec<i32> = table.extract_if(|&mut v| v % 2 == 0).collect();
+
+let mut evens = drained.into_iter().collect::<Vec<_>>();
+let mut odds = table.into_iter().collect::<Vec<_>>();
+evens.sort();
+odds.sort();
+
+assert_eq!(evens, vec![0, 2, 4, 6]);
+assert_eq!(odds, vec![1, 3, 5, 7]);
+
source

pub fn get_many_mut<const N: usize>( + &mut self, + hashes: [u64; N], + eq: impl FnMut(usize, &T) -> bool +) -> Option<[&mut T; N]>

Attempts to get mutable references to N values in the map at once.

+

The eq argument should be a closure such that eq(i, k) returns true if k is equal to +the ith key to be looked up.

+

Returns an array of length N with the results of each query. For soundness, at most one +mutable reference will be returned to any value. None will be returned if any of the +keys are duplicates or missing.

+
§Examples
+
use ahash::AHasher;
+use hashbrown::hash_table::Entry;
+use hashbrown::HashTable;
+use std::hash::{BuildHasher, BuildHasherDefault};
+
+let mut libraries: HashTable<(&str, u32)> = HashTable::new();
+let hasher = BuildHasherDefault::<AHasher>::default();
+let hasher = |val: &_| hasher.hash_one(val);
+for (k, v) in [
+    ("Bodleian Library", 1602),
+    ("Athenæum", 1807),
+    ("Herzogin-Anna-Amalia-Bibliothek", 1691),
+    ("Library of Congress", 1800),
+] {
+    libraries.insert_unique(hasher(&k), (k, v), |(k, _)| hasher(&k));
+}
+
+let keys = ["Athenæum", "Library of Congress"];
+let got = libraries.get_many_mut(keys.map(|k| hasher(&k)), |i, val| keys[i] == val.0);
+assert_eq!(
+    got,
+    Some([&mut ("Athenæum", 1807), &mut ("Library of Congress", 1800),]),
+);
+
+// Missing keys result in None
+let keys = ["Athenæum", "New York Public Library"];
+let got = libraries.get_many_mut(keys.map(|k| hasher(&k)), |i, val| keys[i] == val.0);
+assert_eq!(got, None);
+
+// Duplicate keys result in None
+let keys = ["Athenæum", "Athenæum"];
+let got = libraries.get_many_mut(keys.map(|k| hasher(&k)), |i, val| keys[i] == val.0);
+assert_eq!(got, None);
+
source

pub unsafe fn get_many_unchecked_mut<const N: usize>( + &mut self, + hashes: [u64; N], + eq: impl FnMut(usize, &T) -> bool +) -> Option<[&mut T; N]>

Attempts to get mutable references to N values in the map at once, without validating that +the values are unique.

+

The eq argument should be a closure such that eq(i, k) returns true if k is equal to +the ith key to be looked up.

+

Returns an array of length N with the results of each query. None will be returned if +any of the keys are missing.

+

For a safe alternative see get_many_mut.

+
§Safety
+

Calling this method with overlapping keys is undefined behavior even if the resulting +references are not used.

+
§Examples
+
use ahash::AHasher;
+use hashbrown::hash_table::Entry;
+use hashbrown::HashTable;
+use std::hash::{BuildHasher, BuildHasherDefault};
+
+let mut libraries: HashTable<(&str, u32)> = HashTable::new();
+let hasher = BuildHasherDefault::<AHasher>::default();
+let hasher = |val: &_| hasher.hash_one(val);
+for (k, v) in [
+    ("Bodleian Library", 1602),
+    ("Athenæum", 1807),
+    ("Herzogin-Anna-Amalia-Bibliothek", 1691),
+    ("Library of Congress", 1800),
+] {
+    libraries.insert_unique(hasher(&k), (k, v), |(k, _)| hasher(&k));
+}
+
+let keys = ["Athenæum", "Library of Congress"];
+let got = libraries.get_many_mut(keys.map(|k| hasher(&k)), |i, val| keys[i] == val.0);
+assert_eq!(
+    got,
+    Some([&mut ("Athenæum", 1807), &mut ("Library of Congress", 1800),]),
+);
+
+// Missing keys result in None
+let keys = ["Athenæum", "New York Public Library"];
+let got = libraries.get_many_mut(keys.map(|k| hasher(&k)), |i, val| keys[i] == val.0);
+assert_eq!(got, None);
+
+// Duplicate keys result in None
+let keys = ["Athenæum", "Athenæum"];
+let got = libraries.get_many_mut(keys.map(|k| hasher(&k)), |i, val| keys[i] == val.0);
+assert_eq!(got, None);
+

Trait Implementations§

source§

impl<T, A> Clone for HashTable<T, A>
where + T: Clone, + A: Allocator + Clone,

source§

fn clone(&self) -> Self

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<T, A> Debug for HashTable<T, A>
where + T: Debug, + A: Allocator,

source§

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

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

impl<T, A> Default for HashTable<T, A>
where + A: Allocator + Default,

source§

fn default() -> Self

Returns the “default value” for a type. Read more
source§

impl<'a, T, A> IntoIterator for &'a HashTable<T, A>
where + A: Allocator,

§

type Item = &'a T

The type of the elements being iterated over.
§

type IntoIter = Iter<'a, T>

Which kind of iterator are we turning this into?
source§

fn into_iter(self) -> Iter<'a, T> ⓘ

Creates an iterator from a value. Read more
source§

impl<'a, T, A> IntoIterator for &'a mut HashTable<T, A>
where + A: Allocator,

§

type Item = &'a mut T

The type of the elements being iterated over.
§

type IntoIter = IterMut<'a, T>

Which kind of iterator are we turning this into?
source§

fn into_iter(self) -> IterMut<'a, T> ⓘ

Creates an iterator from a value. Read more
source§

impl<T, A> IntoIterator for HashTable<T, A>
where + A: Allocator,

§

type Item = T

The type of the elements being iterated over.
§

type IntoIter = IntoIter<T, A>

Which kind of iterator are we turning this into?
source§

fn into_iter(self) -> IntoIter<T, A> ⓘ

Creates an iterator from a value. Read more

Auto Trait Implementations§

§

impl<T, A> Freeze for HashTable<T, A>
where + A: Freeze,

§

impl<T, A> RefUnwindSafe for HashTable<T, A>
where + A: RefUnwindSafe, + T: RefUnwindSafe,

§

impl<T, A> Send for HashTable<T, A>
where + A: Send, + T: Send,

§

impl<T, A> Sync for HashTable<T, A>
where + A: Sync, + T: Sync,

§

impl<T, A> Unpin for HashTable<T, A>
where + A: Unpin, + T: Unpin,

§

impl<T, A> UnwindSafe for HashTable<T, A>
where + A: UnwindSafe, + T: UnwindSafe,

Blanket Implementations§

source§

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

source§

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more
source§

impl<T> Borrow<T> for T
where + T: ?Sized,

source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
source§

impl<T> BorrowMut<T> for T
where + 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 T
where + 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 T
where + 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 T
where + 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 T
where + 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/hashbrown/table/enum.Entry.html b/hashbrown/table/enum.Entry.html new file mode 100644 index 0000000000..07ad323ac3 --- /dev/null +++ b/hashbrown/table/enum.Entry.html @@ -0,0 +1,11 @@ + + + + + Redirection + + +

Redirecting to ../../hashbrown/hash_table/enum.Entry.html...

+ + + \ No newline at end of file diff --git a/hashbrown/table/struct.AbsentEntry.html b/hashbrown/table/struct.AbsentEntry.html new file mode 100644 index 0000000000..ae22184499 --- /dev/null +++ b/hashbrown/table/struct.AbsentEntry.html @@ -0,0 +1,11 @@ + + + + + Redirection + + +

Redirecting to ../../hashbrown/hash_table/struct.AbsentEntry.html...

+ + + \ No newline at end of file diff --git a/hashbrown/table/struct.Drain.html b/hashbrown/table/struct.Drain.html new file mode 100644 index 0000000000..65a7e99148 --- /dev/null +++ b/hashbrown/table/struct.Drain.html @@ -0,0 +1,11 @@ + + + + + Redirection + + +

Redirecting to ../../hashbrown/hash_table/struct.Drain.html...

+ + + \ No newline at end of file diff --git a/hashbrown/table/struct.ExtractIf.html b/hashbrown/table/struct.ExtractIf.html new file mode 100644 index 0000000000..5546734ca9 --- /dev/null +++ b/hashbrown/table/struct.ExtractIf.html @@ -0,0 +1,11 @@ + + + + + Redirection + + +

Redirecting to ../../hashbrown/hash_table/struct.ExtractIf.html...

+ + + \ No newline at end of file diff --git a/hashbrown/table/struct.HashTable.html b/hashbrown/table/struct.HashTable.html new file mode 100644 index 0000000000..e6a331469c --- /dev/null +++ b/hashbrown/table/struct.HashTable.html @@ -0,0 +1,11 @@ + + + + + Redirection + + +

Redirecting to ../../hashbrown/hash_table/struct.HashTable.html...

+ + + \ No newline at end of file diff --git a/hashbrown/table/struct.IntoIter.html b/hashbrown/table/struct.IntoIter.html new file mode 100644 index 0000000000..7cf6655d76 --- /dev/null +++ b/hashbrown/table/struct.IntoIter.html @@ -0,0 +1,11 @@ + + + + + Redirection + + +

Redirecting to ../../hashbrown/hash_table/struct.IntoIter.html...

+ + + \ No newline at end of file diff --git a/hashbrown/table/struct.Iter.html b/hashbrown/table/struct.Iter.html new file mode 100644 index 0000000000..bf425e56a9 --- /dev/null +++ b/hashbrown/table/struct.Iter.html @@ -0,0 +1,11 @@ + + + + + Redirection + + +

Redirecting to ../../hashbrown/hash_table/struct.Iter.html...

+ + + \ No newline at end of file diff --git a/hashbrown/table/struct.IterMut.html b/hashbrown/table/struct.IterMut.html new file mode 100644 index 0000000000..df9bd89805 --- /dev/null +++ b/hashbrown/table/struct.IterMut.html @@ -0,0 +1,11 @@ + + + + + Redirection + + +

Redirecting to ../../hashbrown/hash_table/struct.IterMut.html...

+ + + \ No newline at end of file diff --git a/hashbrown/table/struct.OccupiedEntry.html b/hashbrown/table/struct.OccupiedEntry.html new file mode 100644 index 0000000000..0a46f35b75 --- /dev/null +++ b/hashbrown/table/struct.OccupiedEntry.html @@ -0,0 +1,11 @@ + + + + + Redirection + + +

Redirecting to ../../hashbrown/hash_table/struct.OccupiedEntry.html...

+ + + \ No newline at end of file diff --git a/hashbrown/table/struct.VacantEntry.html b/hashbrown/table/struct.VacantEntry.html new file mode 100644 index 0000000000..7c80215de4 --- /dev/null +++ b/hashbrown/table/struct.VacantEntry.html @@ -0,0 +1,11 @@ + + + + + Redirection + + +

Redirecting to ../../hashbrown/hash_table/struct.VacantEntry.html...

+ + + \ No newline at end of file diff --git a/hashbrown/trait.Equivalent.html b/hashbrown/trait.Equivalent.html new file mode 100644 index 0000000000..d9b3fadf6f --- /dev/null +++ b/hashbrown/trait.Equivalent.html @@ -0,0 +1,20 @@ +Equivalent in hashbrown - Rust
+

Trait hashbrown::Equivalent

source · 
pub trait Equivalent<K: ?Sized> {
+    // Required method
+    fn equivalent(&self, key: &K) -> bool;
+}
Expand description

Key equivalence trait.

+

This trait defines the function used to compare the input value with the +map keys (or set values) during a lookup operation such as HashMap::get +or HashSet::contains. +It is provided with a blanket implementation based on the +Borrow trait.

+

§Correctness

+

Equivalent values must hash to the same value.

+

Required Methods§

source

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

Checks if this value is equivalent to the given key.

+

Returns true if both values are equivalent, and false otherwise.

+
§Correctness
+

When this function returns true, both self and key must hash to +the same value.

+

Implementors§

source§

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

\ No newline at end of file diff --git a/indexmap/all.html b/indexmap/all.html new file mode 100644 index 0000000000..5df322fd9a --- /dev/null +++ b/indexmap/all.html @@ -0,0 +1,2 @@ +List of all items in this crate
+

List of all items

Structs

Enums

Traits

Macros

\ No newline at end of file diff --git a/indexmap/index.html b/indexmap/index.html new file mode 100644 index 0000000000..f5f5f1b5c1 --- /dev/null +++ b/indexmap/index.html @@ -0,0 +1,80 @@ +indexmap - Rust
+

Crate indexmap

source ·
Expand description

IndexMap is a hash table where the iteration order of the key-value +pairs is independent of the hash values of the keys.

+

IndexSet is a corresponding hash set using the same implementation and +with similar properties.

+

§Highlights

+

IndexMap and IndexSet are drop-in compatible with the std HashMap +and HashSet, but they also have some features of note:

+
    +
  • The ordering semantics (see their documentation for details)
    • +
  • Sorting methods and the .pop() methods.
    • +
  • The Equivalent trait, which offers more flexible equality definitions +between borrowed and owned versions of keys.
    • +
  • The MutableKeys trait, which gives opt-in mutable +access to map keys, and MutableValues for sets.
    • +
+

§Feature Flags

+

To reduce the amount of compiled code in the crate by default, certain +features are gated behind feature flags. These allow you to opt in to (or +out of) functionality. Below is a list of the features available in this +crate.

+ +

Note: only the std feature is enabled by default.

+

§Alternate Hashers

+

IndexMap and IndexSet have a default hasher type +S = RandomState, +just like the standard HashMap and HashSet, which is resistant to +HashDoS attacks but not the most performant. Type aliases can make it easier +to use alternate hashers:

+ +
use fnv::FnvBuildHasher;
+use fxhash::FxBuildHasher;
+use indexmap::{IndexMap, IndexSet};
+
+type FnvIndexMap<K, V> = IndexMap<K, V, FnvBuildHasher>;
+type FnvIndexSet<T> = IndexSet<T, FnvBuildHasher>;
+
+type FxIndexMap<K, V> = IndexMap<K, V, FxBuildHasher>;
+type FxIndexSet<T> = IndexSet<T, FxBuildHasher>;
+
+let std: IndexSet<i32> = (0..100).collect();
+let fnv: FnvIndexSet<i32> = (0..100).collect();
+let fx: FxIndexSet<i32> = (0..100).collect();
+assert_eq!(std, fnv);
+assert_eq!(std, fx);
+

§Rust Version

+

This version of indexmap requires Rust 1.63 or later.

+

The indexmap 2.x release series will use a carefully considered version +upgrade policy, where in a later 2.x version, we will raise the minimum +required Rust version.

+

§No Standard Library Targets

+

This crate supports being built without std, requiring alloc instead. +This is chosen by disabling the default “std” cargo feature, by adding +default-features = false to your dependency specification.

+ +

Re-exports§

Modules§

  • map
    IndexMap is a hash table where the iteration order of the key-value +pairs is independent of the hash values of the keys.
  • set
    A hash set implemented using IndexMap

Macros§

Structs§

Traits§

\ No newline at end of file diff --git a/indexmap/macro.indexmap!.html b/indexmap/macro.indexmap!.html new file mode 100644 index 0000000000..3a2b8f034e --- /dev/null +++ b/indexmap/macro.indexmap!.html @@ -0,0 +1,11 @@ + + + + + Redirection + + +

Redirecting to macro.indexmap.html...

+ + + \ No newline at end of file diff --git a/indexmap/macro.indexmap.html b/indexmap/macro.indexmap.html new file mode 100644 index 0000000000..a831202643 --- /dev/null +++ b/indexmap/macro.indexmap.html @@ -0,0 +1,19 @@ +indexmap in indexmap - Rust
+

Macro indexmap::indexmap

source · 
macro_rules! indexmap {
+    ($($key:expr => $value:expr,)+) => { ... };
+    ($($key:expr => $value:expr),*) => { ... };
+}
Expand description

Create an IndexMap from a list of key-value pairs

+

§Example

+
use indexmap::indexmap;
+
+let map = indexmap!{
+    "a" => 1,
+    "b" => 2,
+};
+assert_eq!(map["a"], 1);
+assert_eq!(map["b"], 2);
+assert_eq!(map.get("c"), None);
+
+// "a" is the first key
+assert_eq!(map.keys().next(), Some(&"a"));
+
\ No newline at end of file diff --git a/indexmap/macro.indexset!.html b/indexmap/macro.indexset!.html new file mode 100644 index 0000000000..6a5bddf601 --- /dev/null +++ b/indexmap/macro.indexset!.html @@ -0,0 +1,11 @@ + + + + + Redirection + + +

Redirecting to macro.indexset.html...

+ + + \ No newline at end of file diff --git a/indexmap/macro.indexset.html b/indexmap/macro.indexset.html new file mode 100644 index 0000000000..9df5d33710 --- /dev/null +++ b/indexmap/macro.indexset.html @@ -0,0 +1,19 @@ +indexset in indexmap - Rust
+

Macro indexmap::indexset

source · 
macro_rules! indexset {
+    ($($value:expr,)+) => { ... };
+    ($($value:expr),*) => { ... };
+}
Expand description

Create an IndexSet from a list of values

+

§Example

+
use indexmap::indexset;
+
+let set = indexset!{
+    "a",
+    "b",
+};
+assert!(set.contains("a"));
+assert!(set.contains("b"));
+assert!(!set.contains("c"));
+
+// "a" is the first value
+assert_eq!(set.iter().next(), Some(&"a"));
+
\ No newline at end of file diff --git a/indexmap/map/core/entry/enum.Entry.html b/indexmap/map/core/entry/enum.Entry.html new file mode 100644 index 0000000000..40cb9827da --- /dev/null +++ b/indexmap/map/core/entry/enum.Entry.html @@ -0,0 +1,11 @@ + + + + + Redirection + + +

Redirecting to ../../../../indexmap/map/enum.Entry.html...

+ + + \ No newline at end of file diff --git a/indexmap/map/core/entry/struct.IndexedEntry.html b/indexmap/map/core/entry/struct.IndexedEntry.html new file mode 100644 index 0000000000..395a815cce --- /dev/null +++ b/indexmap/map/core/entry/struct.IndexedEntry.html @@ -0,0 +1,11 @@ + + + + + Redirection + + +

Redirecting to ../../../../indexmap/map/struct.IndexedEntry.html...

+ + + \ No newline at end of file diff --git a/indexmap/map/core/entry/struct.OccupiedEntry.html b/indexmap/map/core/entry/struct.OccupiedEntry.html new file mode 100644 index 0000000000..d4004c4fa3 --- /dev/null +++ b/indexmap/map/core/entry/struct.OccupiedEntry.html @@ -0,0 +1,11 @@ + + + + + Redirection + + +

Redirecting to ../../../../indexmap/map/struct.OccupiedEntry.html...

+ + + \ No newline at end of file diff --git a/indexmap/map/core/entry/struct.VacantEntry.html b/indexmap/map/core/entry/struct.VacantEntry.html new file mode 100644 index 0000000000..21df8a4a45 --- /dev/null +++ b/indexmap/map/core/entry/struct.VacantEntry.html @@ -0,0 +1,11 @@ + + + + + Redirection + + +

Redirecting to ../../../../indexmap/map/struct.VacantEntry.html...

+ + + \ No newline at end of file diff --git a/indexmap/map/core/raw_entry_v1/enum.RawEntryMut.html b/indexmap/map/core/raw_entry_v1/enum.RawEntryMut.html new file mode 100644 index 0000000000..6daf6220b4 --- /dev/null +++ b/indexmap/map/core/raw_entry_v1/enum.RawEntryMut.html @@ -0,0 +1,11 @@ + + + + + Redirection + + +

Redirecting to ../../../../indexmap/map/raw_entry_v1/enum.RawEntryMut.html...

+ + + \ No newline at end of file diff --git a/indexmap/map/core/raw_entry_v1/index.html b/indexmap/map/core/raw_entry_v1/index.html new file mode 100644 index 0000000000..5e18ea57df --- /dev/null +++ b/indexmap/map/core/raw_entry_v1/index.html @@ -0,0 +1,11 @@ + + + + + Redirection + + +

Redirecting to ../../../../indexmap/map/raw_entry_v1/index.html...

+ + + \ No newline at end of file diff --git a/indexmap/map/core/raw_entry_v1/struct.RawEntryBuilder.html b/indexmap/map/core/raw_entry_v1/struct.RawEntryBuilder.html new file mode 100644 index 0000000000..722ba88560 --- /dev/null +++ b/indexmap/map/core/raw_entry_v1/struct.RawEntryBuilder.html @@ -0,0 +1,11 @@ + + + + + Redirection + + +

Redirecting to ../../../../indexmap/map/raw_entry_v1/struct.RawEntryBuilder.html...

+ + + \ No newline at end of file diff --git a/indexmap/map/core/raw_entry_v1/struct.RawEntryBuilderMut.html b/indexmap/map/core/raw_entry_v1/struct.RawEntryBuilderMut.html new file mode 100644 index 0000000000..f84c472c66 --- /dev/null +++ b/indexmap/map/core/raw_entry_v1/struct.RawEntryBuilderMut.html @@ -0,0 +1,11 @@ + + + + + Redirection + + +

Redirecting to ../../../../indexmap/map/raw_entry_v1/struct.RawEntryBuilderMut.html...

+ + + \ No newline at end of file diff --git a/indexmap/map/core/raw_entry_v1/struct.RawOccupiedEntryMut.html b/indexmap/map/core/raw_entry_v1/struct.RawOccupiedEntryMut.html new file mode 100644 index 0000000000..fe82ca6211 --- /dev/null +++ b/indexmap/map/core/raw_entry_v1/struct.RawOccupiedEntryMut.html @@ -0,0 +1,11 @@ + + + + + Redirection + + +

Redirecting to ../../../../indexmap/map/raw_entry_v1/struct.RawOccupiedEntryMut.html...

+ + + \ No newline at end of file diff --git a/indexmap/map/core/raw_entry_v1/struct.RawVacantEntryMut.html b/indexmap/map/core/raw_entry_v1/struct.RawVacantEntryMut.html new file mode 100644 index 0000000000..580c92cdd7 --- /dev/null +++ b/indexmap/map/core/raw_entry_v1/struct.RawVacantEntryMut.html @@ -0,0 +1,11 @@ + + + + + Redirection + + +

Redirecting to ../../../../indexmap/map/raw_entry_v1/struct.RawVacantEntryMut.html...

+ + + \ No newline at end of file diff --git a/indexmap/map/core/raw_entry_v1/trait.RawEntryApiV1.html b/indexmap/map/core/raw_entry_v1/trait.RawEntryApiV1.html new file mode 100644 index 0000000000..c6d8975cde --- /dev/null +++ b/indexmap/map/core/raw_entry_v1/trait.RawEntryApiV1.html @@ -0,0 +1,11 @@ + + + + + Redirection + + +

Redirecting to ../../../../indexmap/map/raw_entry_v1/trait.RawEntryApiV1.html...

+ + + \ No newline at end of file diff --git a/indexmap/map/enum.Entry.html b/indexmap/map/enum.Entry.html new file mode 100644 index 0000000000..78707b4710 --- /dev/null +++ b/indexmap/map/enum.Entry.html @@ -0,0 +1,48 @@ +Entry in indexmap::map - Rust
+

Enum indexmap::map::Entry

source · 
pub enum Entry<'a, K, V> {
+    Occupied(OccupiedEntry<'a, K, V>),
+    Vacant(VacantEntry<'a, K, V>),
+}
Expand description

Entry for an existing key-value pair in an IndexMap +or a vacant location to insert one.

+

Variants§

§

Occupied(OccupiedEntry<'a, K, V>)

Existing slot with equivalent key.

+
§

Vacant(VacantEntry<'a, K, V>)

Vacant slot (no equivalent key in the map).

+

Implementations§

source§

impl<'a, K, V> Entry<'a, K, V>

source

pub fn index(&self) -> usize

Return the index where the key-value pair exists or will be inserted.

+
source

pub fn or_insert(self, default: V) -> &'a mut V

Inserts the given default value in the entry if it is vacant and returns a mutable +reference to it. Otherwise a mutable reference to an already existent value is returned.

+

Computes in O(1) time (amortized average).

+
source

pub fn or_insert_with<F>(self, call: F) -> &'a mut V
where + F: FnOnce() -> V,

Inserts the result of the call function in the entry if it is vacant and returns a mutable +reference to it. Otherwise a mutable reference to an already existent value is returned.

+

Computes in O(1) time (amortized average).

+
source

pub fn or_insert_with_key<F>(self, call: F) -> &'a mut V
where + F: FnOnce(&K) -> V,

Inserts the result of the call function with a reference to the entry’s key if it is +vacant, and returns a mutable reference to the new value. Otherwise a mutable reference to +an already existent value is returned.

+

Computes in O(1) time (amortized average).

+
source

pub fn key(&self) -> &K

Gets a reference to the entry’s key, either within the map if occupied, +or else the new key that was used to find the entry.

+
source

pub fn and_modify<F>(self, f: F) -> Self
where + F: FnOnce(&mut V),

Modifies the entry if it is occupied.

+
source

pub fn or_default(self) -> &'a mut V
where + V: Default,

Inserts a default-constructed value in the entry if it is vacant and returns a mutable +reference to it. Otherwise a mutable reference to an already existent value is returned.

+

Computes in O(1) time (amortized average).

+

Trait Implementations§

source§

impl<K: Debug, V: Debug> Debug for Entry<'_, K, V>

source§

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

Formats the value using the given formatter. Read more

Auto Trait Implementations§

§

impl<'a, K, V> Freeze for Entry<'a, K, V>
where + K: Freeze,

§

impl<'a, K, V> RefUnwindSafe for Entry<'a, K, V>
where + K: RefUnwindSafe, + V: RefUnwindSafe,

§

impl<'a, K, V> Send for Entry<'a, K, V>
where + K: Send, + V: Send,

§

impl<'a, K, V> Sync for Entry<'a, K, V>
where + K: Sync, + V: Sync,

§

impl<'a, K, V> Unpin for Entry<'a, K, V>
where + K: Unpin,

§

impl<'a, K, V> !UnwindSafe for Entry<'a, K, V>

Blanket Implementations§

source§

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

source§

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more
source§

impl<T> Borrow<T> for T
where + T: ?Sized,

source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
source§

impl<T> BorrowMut<T> for T
where + 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 T
where + 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 T
where + 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 T
where + 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/indexmap/map/index.html b/indexmap/map/index.html new file mode 100644 index 0000000000..67ebaf5595 --- /dev/null +++ b/indexmap/map/index.html @@ -0,0 +1,8 @@ +indexmap::map - Rust
+

Module indexmap::map

source ·
Expand description

IndexMap is a hash table where the iteration order of the key-value +pairs is independent of the hash values of the keys.

+

Modules§

  • raw_entry_v1
    Opt-in access to the experimental raw entry API.

Structs§

Enums§

  • Entry
    Entry for an existing key-value pair in an IndexMap +or a vacant location to insert one.

Traits§

\ No newline at end of file diff --git a/indexmap/map/iter/struct.Drain.html b/indexmap/map/iter/struct.Drain.html new file mode 100644 index 0000000000..a8f1dbc25d --- /dev/null +++ b/indexmap/map/iter/struct.Drain.html @@ -0,0 +1,11 @@ + + + + + Redirection + + +

Redirecting to ../../../indexmap/map/struct.Drain.html...

+ + + \ No newline at end of file diff --git a/indexmap/map/iter/struct.IntoIter.html b/indexmap/map/iter/struct.IntoIter.html new file mode 100644 index 0000000000..67c2eef84d --- /dev/null +++ b/indexmap/map/iter/struct.IntoIter.html @@ -0,0 +1,11 @@ + + + + + Redirection + + +

Redirecting to ../../../indexmap/map/struct.IntoIter.html...

+ + + \ No newline at end of file diff --git a/indexmap/map/iter/struct.IntoKeys.html b/indexmap/map/iter/struct.IntoKeys.html new file mode 100644 index 0000000000..2014bd78ed --- /dev/null +++ b/indexmap/map/iter/struct.IntoKeys.html @@ -0,0 +1,11 @@ + + + + + Redirection + + +

Redirecting to ../../../indexmap/map/struct.IntoKeys.html...

+ + + \ No newline at end of file diff --git a/indexmap/map/iter/struct.IntoValues.html b/indexmap/map/iter/struct.IntoValues.html new file mode 100644 index 0000000000..30a887617c --- /dev/null +++ b/indexmap/map/iter/struct.IntoValues.html @@ -0,0 +1,11 @@ + + + + + Redirection + + +

Redirecting to ../../../indexmap/map/struct.IntoValues.html...

+ + + \ No newline at end of file diff --git a/indexmap/map/iter/struct.Iter.html b/indexmap/map/iter/struct.Iter.html new file mode 100644 index 0000000000..8f764b8239 --- /dev/null +++ b/indexmap/map/iter/struct.Iter.html @@ -0,0 +1,11 @@ + + + + + Redirection + + +

Redirecting to ../../../indexmap/map/struct.Iter.html...

+ + + \ No newline at end of file diff --git a/indexmap/map/iter/struct.IterMut.html b/indexmap/map/iter/struct.IterMut.html new file mode 100644 index 0000000000..361a415496 --- /dev/null +++ b/indexmap/map/iter/struct.IterMut.html @@ -0,0 +1,11 @@ + + + + + Redirection + + +

Redirecting to ../../../indexmap/map/struct.IterMut.html...

+ + + \ No newline at end of file diff --git a/indexmap/map/iter/struct.Keys.html b/indexmap/map/iter/struct.Keys.html new file mode 100644 index 0000000000..0177358328 --- /dev/null +++ b/indexmap/map/iter/struct.Keys.html @@ -0,0 +1,11 @@ + + + + + Redirection + + +

Redirecting to ../../../indexmap/map/struct.Keys.html...

+ + + \ No newline at end of file diff --git a/indexmap/map/iter/struct.Splice.html b/indexmap/map/iter/struct.Splice.html new file mode 100644 index 0000000000..1424cadc41 --- /dev/null +++ b/indexmap/map/iter/struct.Splice.html @@ -0,0 +1,11 @@ + + + + + Redirection + + +

Redirecting to ../../../indexmap/map/struct.Splice.html...

+ + + \ No newline at end of file diff --git a/indexmap/map/iter/struct.Values.html b/indexmap/map/iter/struct.Values.html new file mode 100644 index 0000000000..963d12c441 --- /dev/null +++ b/indexmap/map/iter/struct.Values.html @@ -0,0 +1,11 @@ + + + + + Redirection + + +

Redirecting to ../../../indexmap/map/struct.Values.html...

+ + + \ No newline at end of file diff --git a/indexmap/map/iter/struct.ValuesMut.html b/indexmap/map/iter/struct.ValuesMut.html new file mode 100644 index 0000000000..a15e757ca0 --- /dev/null +++ b/indexmap/map/iter/struct.ValuesMut.html @@ -0,0 +1,11 @@ + + + + + Redirection + + +

Redirecting to ../../../indexmap/map/struct.ValuesMut.html...

+ + + \ No newline at end of file diff --git a/indexmap/map/mutable/trait.MutableKeys.html b/indexmap/map/mutable/trait.MutableKeys.html new file mode 100644 index 0000000000..dc54c855e7 --- /dev/null +++ b/indexmap/map/mutable/trait.MutableKeys.html @@ -0,0 +1,11 @@ + + + + + Redirection + + +

Redirecting to ../../../indexmap/map/trait.MutableKeys.html...

+ + + \ No newline at end of file diff --git a/indexmap/map/raw_entry_v1/enum.RawEntryMut.html b/indexmap/map/raw_entry_v1/enum.RawEntryMut.html new file mode 100644 index 0000000000..937a912af3 --- /dev/null +++ b/indexmap/map/raw_entry_v1/enum.RawEntryMut.html @@ -0,0 +1,44 @@ +RawEntryMut in indexmap::map::raw_entry_v1 - Rust
+

Enum indexmap::map::raw_entry_v1::RawEntryMut

source · 
pub enum RawEntryMut<'a, K, V, S> {
+    Occupied(RawOccupiedEntryMut<'a, K, V, S>),
+    Vacant(RawVacantEntryMut<'a, K, V, S>),
+}
Expand description

Raw entry for an existing key-value pair or a vacant location to +insert one.

+

Variants§

§

Occupied(RawOccupiedEntryMut<'a, K, V, S>)

Existing slot with equivalent key.

+
§

Vacant(RawVacantEntryMut<'a, K, V, S>)

Vacant slot (no equivalent key in the map).

+

Implementations§

source§

impl<'a, K, V, S> RawEntryMut<'a, K, V, S>

source

pub fn index(&self) -> usize

Return the index where the key-value pair exists or may be inserted.

+
source

pub fn or_insert( + self, + default_key: K, + default_value: V +) -> (&'a mut K, &'a mut V)
where + K: Hash, + S: BuildHasher,

Inserts the given default key and value in the entry if it is vacant and returns mutable +references to them. Otherwise mutable references to an already existent pair are returned.

+
source

pub fn or_insert_with<F>(self, call: F) -> (&'a mut K, &'a mut V)
where + F: FnOnce() -> (K, V), + K: Hash, + S: BuildHasher,

Inserts the result of the call function in the entry if it is vacant and returns mutable +references to them. Otherwise mutable references to an already existent pair are returned.

+
source

pub fn and_modify<F>(self, f: F) -> Self
where + F: FnOnce(&mut K, &mut V),

Modifies the entry if it is occupied.

+

Trait Implementations§

source§

impl<K: Debug, V: Debug, S> Debug for RawEntryMut<'_, K, V, S>

source§

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

Formats the value using the given formatter. Read more

Auto Trait Implementations§

§

impl<'a, K, V, S> Freeze for RawEntryMut<'a, K, V, S>

§

impl<'a, K, V, S> RefUnwindSafe for RawEntryMut<'a, K, V, S>
where + K: RefUnwindSafe, + S: RefUnwindSafe, + V: RefUnwindSafe,

§

impl<'a, K, V, S> Send for RawEntryMut<'a, K, V, S>
where + K: Send, + S: Sync, + V: Send,

§

impl<'a, K, V, S> Sync for RawEntryMut<'a, K, V, S>
where + K: Sync, + S: Sync, + V: Sync,

§

impl<'a, K, V, S> Unpin for RawEntryMut<'a, K, V, S>

§

impl<'a, K, V, S> !UnwindSafe for RawEntryMut<'a, K, V, S>

Blanket Implementations§

source§

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

source§

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more
source§

impl<T> Borrow<T> for T
where + T: ?Sized,

source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
source§

impl<T> BorrowMut<T> for T
where + 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 T
where + 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 T
where + 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 T
where + 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/indexmap/map/raw_entry_v1/index.html b/indexmap/map/raw_entry_v1/index.html new file mode 100644 index 0000000000..e1aab98933 --- /dev/null +++ b/indexmap/map/raw_entry_v1/index.html @@ -0,0 +1,13 @@ +indexmap::map::raw_entry_v1 - Rust
+

Module indexmap::map::raw_entry_v1

source ·
Expand description

Opt-in access to the experimental raw entry API.

+

This module is designed to mimic the raw entry API of HashMap, +matching its unstable state as of Rust 1.75. See the tracking issue +rust#56167 for more details.

+

The trait RawEntryApiV1 and the _v1 suffix on its methods are meant to insulate this for +the future, in case later breaking changes are needed. If the standard library stabilizes its +hash_raw_entry feature (or some replacement), matching inherent methods will be added to +IndexMap without such an opt-in trait.

+

Structs§

Enums§

  • RawEntryMut
    Raw entry for an existing key-value pair or a vacant location to +insert one.

Traits§

\ No newline at end of file diff --git a/indexmap/map/raw_entry_v1/sidebar-items.js b/indexmap/map/raw_entry_v1/sidebar-items.js new file mode 100644 index 0000000000..a0f18a19f9 --- /dev/null +++ b/indexmap/map/raw_entry_v1/sidebar-items.js @@ -0,0 +1 @@ +window.SIDEBAR_ITEMS = {"enum":["RawEntryMut"],"struct":["RawEntryBuilder","RawEntryBuilderMut","RawOccupiedEntryMut","RawVacantEntryMut"],"trait":["RawEntryApiV1"]}; \ No newline at end of file diff --git a/indexmap/map/raw_entry_v1/struct.RawEntryBuilder.html b/indexmap/map/raw_entry_v1/struct.RawEntryBuilder.html new file mode 100644 index 0000000000..33fb78ba20 --- /dev/null +++ b/indexmap/map/raw_entry_v1/struct.RawEntryBuilder.html @@ -0,0 +1,46 @@ +RawEntryBuilder in indexmap::map::raw_entry_v1 - Rust
+

Struct indexmap::map::raw_entry_v1::RawEntryBuilder

source · 
pub struct RawEntryBuilder<'a, K, V, S> { /* private fields */ }
Expand description

A builder for computing where in an IndexMap a key-value pair would be stored.

+

This struct is created by the IndexMap::raw_entry_v1 method, provided by the +RawEntryApiV1 trait. See its documentation for more.

+

Implementations§

source§

impl<'a, K, V, S> RawEntryBuilder<'a, K, V, S>

source

pub fn from_key<Q>(self, key: &Q) -> Option<(&'a K, &'a V)>
where + S: BuildHasher, + Q: ?Sized + Hash + Equivalent<K>,

Access an entry by key.

+
source

pub fn from_key_hashed_nocheck<Q>( + self, + hash: u64, + key: &Q +) -> Option<(&'a K, &'a V)>
where + Q: ?Sized + Equivalent<K>,

Access an entry by a key and its hash.

+
source

pub fn from_hash<F>(self, hash: u64, is_match: F) -> Option<(&'a K, &'a V)>
where + F: FnMut(&K) -> bool,

Access an entry by hash.

+
source

pub fn from_hash_full<F>( + self, + hash: u64, + is_match: F +) -> Option<(usize, &'a K, &'a V)>
where + F: FnMut(&K) -> bool,

Access an entry by hash, including its index.

+
source

pub fn index_from_hash<F>(self, hash: u64, is_match: F) -> Option<usize>
where + F: FnMut(&K) -> bool,

Access the index of an entry by hash.

+

Trait Implementations§

source§

impl<K, V, S> Debug for RawEntryBuilder<'_, K, V, S>

source§

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

Formats the value using the given formatter. Read more

Auto Trait Implementations§

§

impl<'a, K, V, S> Freeze for RawEntryBuilder<'a, K, V, S>

§

impl<'a, K, V, S> RefUnwindSafe for RawEntryBuilder<'a, K, V, S>
where + K: RefUnwindSafe, + S: RefUnwindSafe, + V: RefUnwindSafe,

§

impl<'a, K, V, S> Send for RawEntryBuilder<'a, K, V, S>
where + K: Sync, + S: Sync, + V: Sync,

§

impl<'a, K, V, S> Sync for RawEntryBuilder<'a, K, V, S>
where + K: Sync, + S: Sync, + V: Sync,

§

impl<'a, K, V, S> Unpin for RawEntryBuilder<'a, K, V, S>

§

impl<'a, K, V, S> UnwindSafe for RawEntryBuilder<'a, K, V, S>
where + K: RefUnwindSafe, + S: RefUnwindSafe, + V: RefUnwindSafe,

Blanket Implementations§

source§

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

source§

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more
source§

impl<T> Borrow<T> for T
where + T: ?Sized,

source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
source§

impl<T> BorrowMut<T> for T
where + 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 T
where + 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 T
where + 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 T
where + 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/indexmap/map/raw_entry_v1/struct.RawEntryBuilderMut.html b/indexmap/map/raw_entry_v1/struct.RawEntryBuilderMut.html new file mode 100644 index 0000000000..f9c63b5808 --- /dev/null +++ b/indexmap/map/raw_entry_v1/struct.RawEntryBuilderMut.html @@ -0,0 +1,35 @@ +RawEntryBuilderMut in indexmap::map::raw_entry_v1 - Rust
+

Struct indexmap::map::raw_entry_v1::RawEntryBuilderMut

source · 
pub struct RawEntryBuilderMut<'a, K, V, S> { /* private fields */ }
Expand description

A builder for computing where in an IndexMap a key-value pair would be stored.

+

This struct is created by the IndexMap::raw_entry_mut_v1 method, provided by the +RawEntryApiV1 trait. See its documentation for more.

+

Implementations§

source§

impl<'a, K, V, S> RawEntryBuilderMut<'a, K, V, S>

source

pub fn from_key<Q>(self, key: &Q) -> RawEntryMut<'a, K, V, S>
where + S: BuildHasher, + Q: ?Sized + Hash + Equivalent<K>,

Access an entry by key.

+
source

pub fn from_key_hashed_nocheck<Q>( + self, + hash: u64, + key: &Q +) -> RawEntryMut<'a, K, V, S>
where + Q: ?Sized + Equivalent<K>,

Access an entry by a key and its hash.

+
source

pub fn from_hash<F>(self, hash: u64, is_match: F) -> RawEntryMut<'a, K, V, S>
where + F: FnMut(&K) -> bool,

Access an entry by hash.

+

Trait Implementations§

source§

impl<K, V, S> Debug for RawEntryBuilderMut<'_, K, V, S>

source§

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

Formats the value using the given formatter. Read more

Auto Trait Implementations§

§

impl<'a, K, V, S> Freeze for RawEntryBuilderMut<'a, K, V, S>

§

impl<'a, K, V, S> RefUnwindSafe for RawEntryBuilderMut<'a, K, V, S>
where + K: RefUnwindSafe, + S: RefUnwindSafe, + V: RefUnwindSafe,

§

impl<'a, K, V, S> Send for RawEntryBuilderMut<'a, K, V, S>
where + K: Send, + S: Send, + V: Send,

§

impl<'a, K, V, S> Sync for RawEntryBuilderMut<'a, K, V, S>
where + K: Sync, + S: Sync, + V: Sync,

§

impl<'a, K, V, S> Unpin for RawEntryBuilderMut<'a, K, V, S>

§

impl<'a, K, V, S> !UnwindSafe for RawEntryBuilderMut<'a, K, V, S>

Blanket Implementations§

source§

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

source§

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more
source§

impl<T> Borrow<T> for T
where + T: ?Sized,

source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
source§

impl<T> BorrowMut<T> for T
where + 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 T
where + 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 T
where + 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 T
where + 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/indexmap/map/raw_entry_v1/struct.RawOccupiedEntryMut.html b/indexmap/map/raw_entry_v1/struct.RawOccupiedEntryMut.html new file mode 100644 index 0000000000..47c3771b9e --- /dev/null +++ b/indexmap/map/raw_entry_v1/struct.RawOccupiedEntryMut.html @@ -0,0 +1,94 @@ +RawOccupiedEntryMut in indexmap::map::raw_entry_v1 - Rust
+

Struct indexmap::map::raw_entry_v1::RawOccupiedEntryMut

source · 
pub struct RawOccupiedEntryMut<'a, K, V, S> { /* private fields */ }
Expand description

A raw view into an occupied entry in an IndexMap. +It is part of the RawEntryMut enum.

+

Implementations§

source§

impl<'a, K, V, S> RawOccupiedEntryMut<'a, K, V, S>

source

pub fn index(&self) -> usize

Return the index of the key-value pair

+
source

pub fn key(&self) -> &K

Gets a reference to the entry’s key in the map.

+

Note that this is not the key that was used to find the entry. There may be an observable +difference if the key type has any distinguishing features outside of Hash and Eq, like +extra fields or the memory address of an allocation.

+
source

pub fn key_mut(&mut self) -> &mut K

Gets a mutable reference to the entry’s key in the map.

+

Note that this is not the key that was used to find the entry. There may be an observable +difference if the key type has any distinguishing features outside of Hash and Eq, like +extra fields or the memory address of an allocation.

+
source

pub fn into_key(self) -> &'a mut K

Converts into a mutable reference to the entry’s key in the map, +with a lifetime bound to the map itself.

+

Note that this is not the key that was used to find the entry. There may be an observable +difference if the key type has any distinguishing features outside of Hash and Eq, like +extra fields or the memory address of an allocation.

+
source

pub fn get(&self) -> &V

Gets a reference to the entry’s value in the map.

+
source

pub fn get_mut(&mut self) -> &mut V

Gets a mutable reference to the entry’s value in the map.

+

If you need a reference which may outlive the destruction of the +RawEntryMut value, see into_mut.

+
source

pub fn into_mut(self) -> &'a mut V

Converts into a mutable reference to the entry’s value in the map, +with a lifetime bound to the map itself.

+
source

pub fn get_key_value(&self) -> (&K, &V)

Gets a reference to the entry’s key and value in the map.

+
source

pub fn get_key_value_mut(&mut self) -> (&mut K, &mut V)

Gets a reference to the entry’s key and value in the map.

+
source

pub fn into_key_value_mut(self) -> (&'a mut K, &'a mut V)

Converts into a mutable reference to the entry’s key and value in the map, +with a lifetime bound to the map itself.

+
source

pub fn insert(&mut self, value: V) -> V

Sets the value of the entry, and returns the entry’s old value.

+
source

pub fn insert_key(&mut self, key: K) -> K

Sets the key of the entry, and returns the entry’s old key.

+
source

pub fn remove(self) -> V

👎Deprecated: remove disrupts the map order – use swap_remove or shift_remove for explicit behavior.

Remove the key, value pair stored in the map for this entry, and return the value.

+

NOTE: This is equivalent to .swap_remove(), replacing this +entry’s position with the last element, and it is deprecated in favor of calling that +explicitly. If you need to preserve the relative order of the keys in the map, use +.shift_remove() instead.

+
source

pub fn swap_remove(self) -> V

Remove the key, value pair stored in the map for this entry, and return the value.

+

Like Vec::swap_remove, the pair is removed by swapping it with +the last element of the map and popping it off. +This perturbs the position of what used to be the last element!

+

Computes in O(1) time (average).

+
source

pub fn shift_remove(self) -> V

Remove the key, value pair stored in the map for this entry, and return the value.

+

Like Vec::remove, the pair is removed by shifting all of the +elements that follow it, preserving their relative order. +This perturbs the index of all of those elements!

+

Computes in O(n) time (average).

+
source

pub fn remove_entry(self) -> (K, V)

👎Deprecated: remove_entry disrupts the map order – use swap_remove_entry or shift_remove_entry for explicit behavior.

Remove and return the key, value pair stored in the map for this entry

+

NOTE: This is equivalent to .swap_remove_entry(), +replacing this entry’s position with the last element, and it is deprecated in favor of +calling that explicitly. If you need to preserve the relative order of the keys in the map, +use .shift_remove_entry() instead.

+
source

pub fn swap_remove_entry(self) -> (K, V)

Remove and return the key, value pair stored in the map for this entry

+

Like Vec::swap_remove, the pair is removed by swapping it with +the last element of the map and popping it off. +This perturbs the position of what used to be the last element!

+

Computes in O(1) time (average).

+
source

pub fn shift_remove_entry(self) -> (K, V)

Remove and return the key, value pair stored in the map for this entry

+

Like Vec::remove, the pair is removed by shifting all of the +elements that follow it, preserving their relative order. +This perturbs the index of all of those elements!

+

Computes in O(n) time (average).

+
source

pub fn move_index(self, to: usize)

Moves the position of the entry to a new index +by shifting all other entries in-between.

+

This is equivalent to IndexMap::move_index +coming from the current .index().

+
    +
  • If self.index() < to, the other pairs will shift down while the targeted pair moves up.
    • +
  • If self.index() > to, the other pairs will shift up while the targeted pair moves down.
    • +
+

Panics if to is out of bounds.

+

Computes in O(n) time (average).

+
source

pub fn swap_indices(self, other: usize)

Swaps the position of entry with another.

+

This is equivalent to IndexMap::swap_indices +with the current .index() as one of the two being swapped.

+

Panics if the other index is out of bounds.

+

Computes in O(1) time (average).

+

Trait Implementations§

source§

impl<K: Debug, V: Debug, S> Debug for RawOccupiedEntryMut<'_, K, V, S>

source§

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

Formats the value using the given formatter. Read more

Auto Trait Implementations§

§

impl<'a, K, V, S> Freeze for RawOccupiedEntryMut<'a, K, V, S>

§

impl<'a, K, V, S> RefUnwindSafe for RawOccupiedEntryMut<'a, K, V, S>
where + K: RefUnwindSafe, + S: RefUnwindSafe, + V: RefUnwindSafe,

§

impl<'a, K, V, S> Send for RawOccupiedEntryMut<'a, K, V, S>
where + K: Send, + S: Sync, + V: Send,

§

impl<'a, K, V, S> Sync for RawOccupiedEntryMut<'a, K, V, S>
where + K: Sync, + S: Sync, + V: Sync,

§

impl<'a, K, V, S> Unpin for RawOccupiedEntryMut<'a, K, V, S>

§

impl<'a, K, V, S> !UnwindSafe for RawOccupiedEntryMut<'a, K, V, S>

Blanket Implementations§

source§

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

source§

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more
source§

impl<T> Borrow<T> for T
where + T: ?Sized,

source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
source§

impl<T> BorrowMut<T> for T
where + 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 T
where + 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 T
where + 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 T
where + 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/indexmap/map/raw_entry_v1/struct.RawVacantEntryMut.html b/indexmap/map/raw_entry_v1/struct.RawVacantEntryMut.html new file mode 100644 index 0000000000..3a5623d0b8 --- /dev/null +++ b/indexmap/map/raw_entry_v1/struct.RawVacantEntryMut.html @@ -0,0 +1,56 @@ +RawVacantEntryMut in indexmap::map::raw_entry_v1 - Rust
+

Struct indexmap::map::raw_entry_v1::RawVacantEntryMut

source · 
pub struct RawVacantEntryMut<'a, K, V, S> { /* private fields */ }
Expand description

A view into a vacant raw entry in an IndexMap. +It is part of the RawEntryMut enum.

+

Implementations§

source§

impl<'a, K, V, S> RawVacantEntryMut<'a, K, V, S>

source

pub fn index(&self) -> usize

Return the index where a key-value pair may be inserted.

+
source

pub fn insert(self, key: K, value: V) -> (&'a mut K, &'a mut V)
where + K: Hash, + S: BuildHasher,

Inserts the given key and value into the map, +and returns mutable references to them.

+
source

pub fn insert_hashed_nocheck( + self, + hash: u64, + key: K, + value: V +) -> (&'a mut K, &'a mut V)

Inserts the given key and value into the map with the provided hash, +and returns mutable references to them.

+
source

pub fn shift_insert( + self, + index: usize, + key: K, + value: V +) -> (&'a mut K, &'a mut V)
where + K: Hash, + S: BuildHasher,

Inserts the given key and value into the map at the given index, +shifting others to the right, and returns mutable references to them.

+

Panics if index is out of bounds.

+

Computes in O(n) time (average).

+
source

pub fn shift_insert_hashed_nocheck( + self, + index: usize, + hash: u64, + key: K, + value: V +) -> (&'a mut K, &'a mut V)

Inserts the given key and value into the map with the provided hash +at the given index, and returns mutable references to them.

+

Panics if index is out of bounds.

+

Computes in O(n) time (average).

+

Trait Implementations§

source§

impl<K, V, S> Debug for RawVacantEntryMut<'_, K, V, S>

source§

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

Formats the value using the given formatter. Read more

Auto Trait Implementations§

§

impl<'a, K, V, S> Freeze for RawVacantEntryMut<'a, K, V, S>

§

impl<'a, K, V, S> RefUnwindSafe for RawVacantEntryMut<'a, K, V, S>
where + K: RefUnwindSafe, + S: RefUnwindSafe, + V: RefUnwindSafe,

§

impl<'a, K, V, S> Send for RawVacantEntryMut<'a, K, V, S>
where + K: Send, + S: Sync, + V: Send,

§

impl<'a, K, V, S> Sync for RawVacantEntryMut<'a, K, V, S>
where + K: Sync, + S: Sync, + V: Sync,

§

impl<'a, K, V, S> Unpin for RawVacantEntryMut<'a, K, V, S>

§

impl<'a, K, V, S> !UnwindSafe for RawVacantEntryMut<'a, K, V, S>

Blanket Implementations§

source§

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

source§

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more
source§

impl<T> Borrow<T> for T
where + T: ?Sized,

source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
source§

impl<T> BorrowMut<T> for T
where + 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 T
where + 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 T
where + 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 T
where + 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/indexmap/map/raw_entry_v1/trait.RawEntryApiV1.html b/indexmap/map/raw_entry_v1/trait.RawEntryApiV1.html new file mode 100644 index 0000000000..ddd1906a24 --- /dev/null +++ b/indexmap/map/raw_entry_v1/trait.RawEntryApiV1.html @@ -0,0 +1,141 @@ +RawEntryApiV1 in indexmap::map::raw_entry_v1 - Rust
+

Trait indexmap::map::raw_entry_v1::RawEntryApiV1

source · 
pub trait RawEntryApiV1<K, V, S>: Sealed {
+    // Required methods
+    fn raw_entry_v1(&self) -> RawEntryBuilder<'_, K, V, S>;
+    fn raw_entry_mut_v1(&mut self) -> RawEntryBuilderMut<'_, K, V, S>;
+}
Expand description

Opt-in access to the experimental raw entry API.

+

See the raw_entry_v1 module documentation for more information.

+

Required Methods§

source

fn raw_entry_v1(&self) -> RawEntryBuilder<'_, K, V, S>

Creates a raw immutable entry builder for the IndexMap.

+

Raw entries provide the lowest level of control for searching and +manipulating a map. They must be manually initialized with a hash and +then manually searched.

+

This is useful for

+
    +
  • Hash memoization
    • +
  • Using a search key that doesn’t work with the Equivalent trait
    • +
  • Using custom comparison logic without newtype wrappers
    • +
+

Unless you are in such a situation, higher-level and more foolproof APIs like +get should be preferred.

+

Immutable raw entries have very limited use; you might instead want +raw_entry_mut_v1.

+
§Examples
+
use core::hash::{BuildHasher, Hash};
+use indexmap::map::{IndexMap, RawEntryApiV1};
+
+let mut map = IndexMap::new();
+map.extend([("a", 100), ("b", 200), ("c", 300)]);
+
+fn compute_hash<K: Hash + ?Sized, S: BuildHasher>(hash_builder: &S, key: &K) -> u64 {
+    use core::hash::Hasher;
+    let mut state = hash_builder.build_hasher();
+    key.hash(&mut state);
+    state.finish()
+}
+
+for k in ["a", "b", "c", "d", "e", "f"] {
+    let hash = compute_hash(map.hasher(), k);
+    let i = map.get_index_of(k);
+    let v = map.get(k);
+    let kv = map.get_key_value(k);
+    let ikv = map.get_full(k);
+
+    println!("Key: {} and value: {:?}", k, v);
+
+    assert_eq!(map.raw_entry_v1().from_key(k), kv);
+    assert_eq!(map.raw_entry_v1().from_hash(hash, |q| *q == k), kv);
+    assert_eq!(map.raw_entry_v1().from_key_hashed_nocheck(hash, k), kv);
+    assert_eq!(map.raw_entry_v1().from_hash_full(hash, |q| *q == k), ikv);
+    assert_eq!(map.raw_entry_v1().index_from_hash(hash, |q| *q == k), i);
+}
+
source

fn raw_entry_mut_v1(&mut self) -> RawEntryBuilderMut<'_, K, V, S>

Creates a raw entry builder for the IndexMap.

+

Raw entries provide the lowest level of control for searching and +manipulating a map. They must be manually initialized with a hash and +then manually searched. After this, insertions into a vacant entry +still require an owned key to be provided.

+

Raw entries are useful for such exotic situations as:

+
    +
  • Hash memoization
    • +
  • Deferring the creation of an owned key until it is known to be required
    • +
  • Using a search key that doesn’t work with the Equivalent trait
    • +
  • Using custom comparison logic without newtype wrappers
    • +
+

Because raw entries provide much more low-level control, it’s much easier +to put the IndexMap into an inconsistent state which, while memory-safe, +will cause the map to produce seemingly random results. Higher-level and more +foolproof APIs like entry should be preferred when possible.

+

Raw entries give mutable access to the keys. This must not be used +to modify how the key would compare or hash, as the map will not re-evaluate +where the key should go, meaning the keys may become “lost” if their +location does not reflect their state. For instance, if you change a key +so that the map now contains keys which compare equal, search may start +acting erratically, with two keys randomly masking each other. Implementations +are free to assume this doesn’t happen (within the limits of memory-safety).

+
§Examples
+
use core::hash::{BuildHasher, Hash};
+use indexmap::map::{IndexMap, RawEntryApiV1};
+use indexmap::map::raw_entry_v1::RawEntryMut;
+
+let mut map = IndexMap::new();
+map.extend([("a", 100), ("b", 200), ("c", 300)]);
+
+fn compute_hash<K: Hash + ?Sized, S: BuildHasher>(hash_builder: &S, key: &K) -> u64 {
+    use core::hash::Hasher;
+    let mut state = hash_builder.build_hasher();
+    key.hash(&mut state);
+    state.finish()
+}
+
+// Existing key (insert and update)
+match map.raw_entry_mut_v1().from_key("a") {
+    RawEntryMut::Vacant(_) => unreachable!(),
+    RawEntryMut::Occupied(mut view) => {
+        assert_eq!(view.index(), 0);
+        assert_eq!(view.get(), &100);
+        let v = view.get_mut();
+        let new_v = (*v) * 10;
+        *v = new_v;
+        assert_eq!(view.insert(1111), 1000);
+    }
+}
+
+assert_eq!(map["a"], 1111);
+assert_eq!(map.len(), 3);
+
+// Existing key (take)
+let hash = compute_hash(map.hasher(), "c");
+match map.raw_entry_mut_v1().from_key_hashed_nocheck(hash, "c") {
+    RawEntryMut::Vacant(_) => unreachable!(),
+    RawEntryMut::Occupied(view) => {
+        assert_eq!(view.index(), 2);
+        assert_eq!(view.shift_remove_entry(), ("c", 300));
+    }
+}
+assert_eq!(map.raw_entry_v1().from_key("c"), None);
+assert_eq!(map.len(), 2);
+
+// Nonexistent key (insert and update)
+let key = "d";
+let hash = compute_hash(map.hasher(), key);
+match map.raw_entry_mut_v1().from_hash(hash, |q| *q == key) {
+    RawEntryMut::Occupied(_) => unreachable!(),
+    RawEntryMut::Vacant(view) => {
+        assert_eq!(view.index(), 2);
+        let (k, value) = view.insert("d", 4000);
+        assert_eq!((*k, *value), ("d", 4000));
+        *value = 40000;
+    }
+}
+assert_eq!(map["d"], 40000);
+assert_eq!(map.len(), 3);
+
+match map.raw_entry_mut_v1().from_hash(hash, |q| *q == key) {
+    RawEntryMut::Vacant(_) => unreachable!(),
+    RawEntryMut::Occupied(view) => {
+        assert_eq!(view.index(), 2);
+        assert_eq!(view.swap_remove_entry(), ("d", 40000));
+    }
+}
+assert_eq!(map.get("d"), None);
+assert_eq!(map.len(), 2);
+

Implementors§

source§

impl<K, V, S> RawEntryApiV1<K, V, S> for IndexMap<K, V, S>

\ No newline at end of file diff --git a/indexmap/map/sidebar-items.js b/indexmap/map/sidebar-items.js new file mode 100644 index 0000000000..cadff075b4 --- /dev/null +++ b/indexmap/map/sidebar-items.js @@ -0,0 +1 @@ +window.SIDEBAR_ITEMS = {"enum":["Entry"],"mod":["raw_entry_v1"],"struct":["Drain","IndexMap","IndexedEntry","IntoIter","IntoKeys","IntoValues","Iter","IterMut","Keys","OccupiedEntry","Slice","Splice","VacantEntry","Values","ValuesMut"],"trait":["MutableKeys","RawEntryApiV1"]}; \ No newline at end of file diff --git a/indexmap/map/slice/struct.Slice.html b/indexmap/map/slice/struct.Slice.html new file mode 100644 index 0000000000..5e268b74a6 --- /dev/null +++ b/indexmap/map/slice/struct.Slice.html @@ -0,0 +1,11 @@ + + + + + Redirection + + +

Redirecting to ../../../indexmap/map/struct.Slice.html...

+ + + \ No newline at end of file diff --git a/indexmap/map/struct.Drain.html b/indexmap/map/struct.Drain.html new file mode 100644 index 0000000000..1e884f37a3 --- /dev/null +++ b/indexmap/map/struct.Drain.html @@ -0,0 +1,217 @@ +Drain in indexmap::map - Rust
+

Struct indexmap::map::Drain

source · 
pub struct Drain<'a, K, V> { /* private fields */ }
Expand description

A draining iterator over the entries of an IndexMap.

+

This struct is created by the IndexMap::drain method. +See its documentation for more.

+

Implementations§

source§

impl<'a, K, V> Drain<'a, K, V>

source

pub fn as_slice(&self) -> &Slice<K, V>

Returns a slice of the remaining entries in the iterator.

+

Trait Implementations§

source§

impl<K: Debug, V: Debug> Debug for Drain<'_, K, V>

source§

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

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

impl<K, V> DoubleEndedIterator for Drain<'_, K, V>

source§

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

Removes and returns an element from the end of the iterator. Read more
source§

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

Returns the nth element from the end of the iterator. Read more
source§

fn advance_back_by(&mut self, n: usize) -> Result<(), NonZero<usize>>

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

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

This is the reverse version of Iterator::try_fold(): it takes +elements starting from the back of the iterator. Read more
1.27.0 · source§

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

An iterator method that reduces the iterator’s elements to a single, +final value, starting from the back. Read more
1.27.0 · source§

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

Searches for an element of an iterator from the back that satisfies a predicate. Read more
source§

impl<K, V> ExactSizeIterator for Drain<'_, K, V>

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<K, V> Iterator for Drain<'_, K, V>

§

type Item = (K, V)

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 count(self) -> usize

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

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

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

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

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

fn collect<C>(self) -> C
where + C: FromIterator<Self::Item>,

Transforms an iterator into a collection. 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
source§

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

🔬This is a nightly-only experimental API. (iter_advance_by)
Advances the iterator by n elements. 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 Self
where + Self: Sized,

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

fn collect_into<E>(self, collection: &mut E) -> &mut E
where + 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 partition_in_place<'a, T, P>(self, predicate: P) -> usize
where + T: 'a, + Self: Sized + DoubleEndedIterator<Item = &'a mut T>, + P: FnMut(&T) -> bool,

🔬This is a nightly-only experimental API. (iter_partition_in_place)
Reorders the elements of this iterator in-place according to the given predicate, +such that all those that return true precede all those that return false. +Returns the number of true elements found. Read more
source§

fn is_partitioned<P>(self, predicate: P) -> bool
where + 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) -> R
where + 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) -> R
where + 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) -> B
where + 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>>>::TryType
where + 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) -> bool
where + 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) -> bool
where + 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>>>::TryType
where + 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 rposition<P>(&mut self, predicate: P) -> Option<usize>
where + P: FnMut(Self::Item) -> bool, + Self: Sized + ExactSizeIterator + DoubleEndedIterator,

Searches for an element in an iterator from the right, 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 rev(self) -> Rev<Self>
where + Self: Sized + DoubleEndedIterator,

Reverses an iterator’s direction. 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) -> S
where + Self: Sized, + S: Sum<Self::Item>,

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

fn product<P>(self) -> P
where + 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) -> Ordering
where + 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) -> bool
where + 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) -> bool
where + 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) -> bool
where + 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) -> bool
where + 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) -> bool
where + 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) -> bool
where + 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) -> bool
where + 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) -> bool
where + Self: Sized, + F: FnMut(&Self::Item, &Self::Item) -> bool,

🔬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) -> bool
where + 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<K, V> FusedIterator for Drain<'_, K, V>

Auto Trait Implementations§

§

impl<'a, K, V> Freeze for Drain<'a, K, V>

§

impl<'a, K, V> RefUnwindSafe for Drain<'a, K, V>
where + K: RefUnwindSafe, + V: RefUnwindSafe,

§

impl<'a, K, V> Send for Drain<'a, K, V>
where + K: Send, + V: Send,

§

impl<'a, K, V> Sync for Drain<'a, K, V>
where + K: Sync, + V: Sync,

§

impl<'a, K, V> Unpin for Drain<'a, K, V>

§

impl<'a, K, V> UnwindSafe for Drain<'a, K, V>
where + K: RefUnwindSafe, + V: RefUnwindSafe,

Blanket Implementations§

source§

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

source§

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more
source§

impl<T> Borrow<T> for T
where + T: ?Sized,

source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
source§

impl<T> BorrowMut<T> for T
where + 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 T
where + 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 I
where + 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, U> TryFrom<U> for T
where + 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 T
where + 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/indexmap/map/struct.IndexMap.html b/indexmap/map/struct.IndexMap.html new file mode 100644 index 0000000000..7385fa3d7c --- /dev/null +++ b/indexmap/map/struct.IndexMap.html @@ -0,0 +1,572 @@ +IndexMap in indexmap::map - Rust
+

Struct indexmap::map::IndexMap

source · 
pub struct IndexMap<K, V, S = RandomState> { /* private fields */ }
Expand description

A hash table where the iteration order of the key-value pairs is independent +of the hash values of the keys.

+

The interface is closely compatible with the standard +HashMap, +but also has additional features.

+

§Order

+

The key-value pairs have a consistent order that is determined by +the sequence of insertion and removal calls on the map. The order does +not depend on the keys or the hash function at all.

+

All iterators traverse the map in the order.

+

The insertion order is preserved, with notable exceptions like the +.remove() or .swap_remove() methods. +Methods such as .sort_by() of +course result in a new order, depending on the sorting order.

+

§Indices

+

The key-value pairs are indexed in a compact range without holes in the +range 0..self.len(). For example, the method .get_full looks up the +index for a key, and the method .get_index looks up the key-value pair by +index.

+

§Examples

+
use indexmap::IndexMap;
+
+// count the frequency of each letter in a sentence.
+let mut letters = IndexMap::new();
+for ch in "a short treatise on fungi".chars() {
+    *letters.entry(ch).or_insert(0) += 1;
+}
+
+assert_eq!(letters[&'s'], 2);
+assert_eq!(letters[&'t'], 3);
+assert_eq!(letters[&'u'], 1);
+assert_eq!(letters.get(&'y'), None);
+

Implementations§

source§

impl<K, V> IndexMap<K, V>

source

pub fn new() -> Self

Create a new map. (Does not allocate.)

+
source

pub fn with_capacity(n: usize) -> Self

Create a new map with capacity for n key-value pairs. (Does not +allocate if n is zero.)

+

Computes in O(n) time.

+
source§

impl<K, V, S> IndexMap<K, V, S>

source

pub fn with_capacity_and_hasher(n: usize, hash_builder: S) -> Self

Create a new map with capacity for n key-value pairs. (Does not +allocate if n is zero.)

+

Computes in O(n) time.

+
source

pub const fn with_hasher(hash_builder: S) -> Self

Create a new map with hash_builder.

+

This function is const, so it +can be called in static contexts.

+
source

pub fn capacity(&self) -> usize

Return the number of elements the map can hold without reallocating.

+

This number is a lower bound; the map might be able to hold more, +but is guaranteed to be able to hold at least this many.

+

Computes in O(1) time.

+
source

pub fn hasher(&self) -> &S

Return a reference to the map’s BuildHasher.

+
source

pub fn len(&self) -> usize

Return the number of key-value pairs in the map.

+

Computes in O(1) time.

+
source

pub fn is_empty(&self) -> bool

Returns true if the map contains no elements.

+

Computes in O(1) time.

+
source

pub fn iter(&self) -> Iter<'_, K, V> ⓘ

Return an iterator over the key-value pairs of the map, in their order

+
source

pub fn iter_mut(&mut self) -> IterMut<'_, K, V> ⓘ

Return an iterator over the key-value pairs of the map, in their order

+
source

pub fn keys(&self) -> Keys<'_, K, V> ⓘ

Return an iterator over the keys of the map, in their order

+
source

pub fn into_keys(self) -> IntoKeys<K, V> ⓘ

Return an owning iterator over the keys of the map, in their order

+
source

pub fn values(&self) -> Values<'_, K, V> ⓘ

Return an iterator over the values of the map, in their order

+
source

pub fn values_mut(&mut self) -> ValuesMut<'_, K, V> ⓘ

Return an iterator over mutable references to the values of the map, +in their order

+
source

pub fn into_values(self) -> IntoValues<K, V> ⓘ

Return an owning iterator over the values of the map, in their order

+
source

pub fn clear(&mut self)

Remove all key-value pairs in the map, while preserving its capacity.

+

Computes in O(n) time.

+
source

pub fn truncate(&mut self, len: usize)

Shortens the map, keeping the first len elements and dropping the rest.

+

If len is greater than the map’s current length, this has no effect.

+
source

pub fn drain<R>(&mut self, range: R) -> Drain<'_, K, V> ⓘ
where + R: RangeBounds<usize>,

Clears the IndexMap in the given index range, returning those +key-value pairs as a drain iterator.

+

The range may be any type that implements RangeBounds<usize>, +including all of the std::ops::Range* types, or even a tuple pair of +Bound start and end values. To drain the map entirely, use RangeFull +like map.drain(..).

+

This shifts down all entries following the drained range to fill the +gap, and keeps the allocated memory for reuse.

+

Panics if the starting point is greater than the end point or if +the end point is greater than the length of the map.

+
source

pub fn split_off(&mut self, at: usize) -> Self
where + S: Clone,

Splits the collection into two at the given index.

+

Returns a newly allocated map containing the elements in the range +[at, len). After the call, the original map will be left containing +the elements [0, at) with its previous capacity unchanged.

+

Panics if at > len.

+
source

pub fn reserve(&mut self, additional: usize)

Reserve capacity for additional more key-value pairs.

+

Computes in O(n) time.

+
source

pub fn reserve_exact(&mut self, additional: usize)

Reserve capacity for additional more key-value pairs, without over-allocating.

+

Unlike reserve, this does not deliberately over-allocate the entry capacity to avoid +frequent re-allocations. However, the underlying data structures may still have internal +capacity requirements, and the allocator itself may give more space than requested, so this +cannot be relied upon to be precisely minimal.

+

Computes in O(n) time.

+
source

pub fn try_reserve(&mut self, additional: usize) -> Result<(), TryReserveError>

Try to reserve capacity for additional more key-value pairs.

+

Computes in O(n) time.

+
source

pub fn try_reserve_exact( + &mut self, + additional: usize +) -> Result<(), TryReserveError>

Try to reserve capacity for additional more key-value pairs, without over-allocating.

+

Unlike try_reserve, this does not deliberately over-allocate the entry capacity to avoid +frequent re-allocations. However, the underlying data structures may still have internal +capacity requirements, and the allocator itself may give more space than requested, so this +cannot be relied upon to be precisely minimal.

+

Computes in O(n) time.

+
source

pub fn shrink_to_fit(&mut self)

Shrink the capacity of the map as much as possible.

+

Computes in O(n) time.

+
source

pub fn shrink_to(&mut self, min_capacity: usize)

Shrink the capacity of the map with a lower limit.

+

Computes in O(n) time.

+
source§

impl<K, V, S> IndexMap<K, V, S>
where + K: Hash + Eq, + S: BuildHasher,

source

pub fn insert(&mut self, key: K, value: V) -> Option<V>

Insert a key-value pair in the map.

+

If an equivalent key already exists in the map: the key remains and +retains in its place in the order, its corresponding value is updated +with value, and the older value is returned inside Some(_).

+

If no equivalent key existed in the map: the new key-value pair is +inserted, last in order, and None is returned.

+

Computes in O(1) time (amortized average).

+

See also entry if you want to insert or modify, +or insert_full if you need to get the index of +the corresponding key-value pair.

+
source

pub fn insert_full(&mut self, key: K, value: V) -> (usize, Option<V>)

Insert a key-value pair in the map, and get their index.

+

If an equivalent key already exists in the map: the key remains and +retains in its place in the order, its corresponding value is updated +with value, and the older value is returned inside (index, Some(_)).

+

If no equivalent key existed in the map: the new key-value pair is +inserted, last in order, and (index, None) is returned.

+

Computes in O(1) time (amortized average).

+

See also entry if you want to insert or modify.

+
source

pub fn insert_sorted(&mut self, key: K, value: V) -> (usize, Option<V>)
where + K: Ord,

Insert a key-value pair in the map at its ordered position among sorted keys.

+

This is equivalent to finding the position with +binary_search_keys, then either updating +it or calling shift_insert for a new key.

+

If the sorted key is found in the map, its corresponding value is +updated with value, and the older value is returned inside +(index, Some(_)). Otherwise, the new key-value pair is inserted at +the sorted position, and (index, None) is returned.

+

If the existing keys are not already sorted, then the insertion +index is unspecified (like slice::binary_search), but the key-value +pair is moved to or inserted at that position regardless.

+

Computes in O(n) time (average). Instead of repeating calls to +insert_sorted, it may be faster to call batched insert +or extend and only call sort_keys +or sort_unstable_keys once.

+
source

pub fn shift_insert(&mut self, index: usize, key: K, value: V) -> Option<V>

Insert a key-value pair in the map at the given index.

+

If an equivalent key already exists in the map: the key remains and +is moved to the new position in the map, its corresponding value is updated +with value, and the older value is returned inside Some(_).

+

If no equivalent key existed in the map: the new key-value pair is +inserted at the given index, and None is returned.

+

Panics if index is out of bounds.

+

Computes in O(n) time (average).

+

See also entry if you want to insert or modify, +perhaps only using the index for new entries with VacantEntry::shift_insert.

+
source

pub fn entry(&mut self, key: K) -> Entry<'_, K, V>

Get the given key’s corresponding entry in the map for insertion and/or +in-place manipulation.

+

Computes in O(1) time (amortized average).

+
source

pub fn splice<R, I>( + &mut self, + range: R, + replace_with: I +) -> Splice<'_, I::IntoIter, K, V, S> ⓘ
where + R: RangeBounds<usize>, + I: IntoIterator<Item = (K, V)>,

Creates a splicing iterator that replaces the specified range in the map +with the given replace_with key-value iterator and yields the removed +items. replace_with does not need to be the same length as range.

+

The range is removed even if the iterator is not consumed until the +end. It is unspecified how many elements are removed from the map if the +Splice value is leaked.

+

The input iterator replace_with is only consumed when the Splice +value is dropped. If a key from the iterator matches an existing entry +in the map (outside of range), then the value will be updated in that +position. Otherwise, the new key-value pair will be inserted in the +replaced range.

+

Panics if the starting point is greater than the end point or if +the end point is greater than the length of the map.

+
§Examples
+
use indexmap::IndexMap;
+
+let mut map = IndexMap::from([(0, '_'), (1, 'a'), (2, 'b'), (3, 'c'), (4, 'd')]);
+let new = [(5, 'E'), (4, 'D'), (3, 'C'), (2, 'B'), (1, 'A')];
+let removed: Vec<_> = map.splice(2..4, new).collect();
+
+// 1 and 4 got new values, while 5, 3, and 2 were newly inserted.
+assert!(map.into_iter().eq([(0, '_'), (1, 'A'), (5, 'E'), (3, 'C'), (2, 'B'), (4, 'D')]));
+assert_eq!(removed, &[(2, 'b'), (3, 'c')]);
+
source§

impl<K, V, S> IndexMap<K, V, S>
where + S: BuildHasher,

source

pub fn contains_key<Q>(&self, key: &Q) -> bool
where + Q: ?Sized + Hash + Equivalent<K>,

Return true if an equivalent to key exists in the map.

+

Computes in O(1) time (average).

+
source

pub fn get<Q>(&self, key: &Q) -> Option<&V>
where + Q: ?Sized + Hash + Equivalent<K>,

Return a reference to the value stored for key, if it is present, +else None.

+

Computes in O(1) time (average).

+
source

pub fn get_key_value<Q>(&self, key: &Q) -> Option<(&K, &V)>
where + Q: ?Sized + Hash + Equivalent<K>,

Return references to the key-value pair stored for key, +if it is present, else None.

+

Computes in O(1) time (average).

+
source

pub fn get_full<Q>(&self, key: &Q) -> Option<(usize, &K, &V)>
where + Q: ?Sized + Hash + Equivalent<K>,

Return item index, key and value

+
source

pub fn get_index_of<Q>(&self, key: &Q) -> Option<usize>
where + Q: ?Sized + Hash + Equivalent<K>,

Return item index, if it exists in the map

+

Computes in O(1) time (average).

+
source

pub fn get_mut<Q>(&mut self, key: &Q) -> Option<&mut V>
where + Q: ?Sized + Hash + Equivalent<K>,

source

pub fn get_full_mut<Q>(&mut self, key: &Q) -> Option<(usize, &K, &mut V)>
where + Q: ?Sized + Hash + Equivalent<K>,

source

pub fn remove<Q>(&mut self, key: &Q) -> Option<V>
where + Q: ?Sized + Hash + Equivalent<K>,

👎Deprecated: remove disrupts the map order – use swap_remove or shift_remove for explicit behavior.

Remove the key-value pair equivalent to key and return +its value.

+

NOTE: This is equivalent to .swap_remove(key), replacing this +entry’s position with the last element, and it is deprecated in favor of calling that +explicitly. If you need to preserve the relative order of the keys in the map, use +.shift_remove(key) instead.

+
source

pub fn remove_entry<Q>(&mut self, key: &Q) -> Option<(K, V)>
where + Q: ?Sized + Hash + Equivalent<K>,

👎Deprecated: remove_entry disrupts the map order – use swap_remove_entry or shift_remove_entry for explicit behavior.

Remove and return the key-value pair equivalent to key.

+

NOTE: This is equivalent to .swap_remove_entry(key), +replacing this entry’s position with the last element, and it is deprecated in favor of +calling that explicitly. If you need to preserve the relative order of the keys in the map, +use .shift_remove_entry(key) instead.

+
source

pub fn swap_remove<Q>(&mut self, key: &Q) -> Option<V>
where + Q: ?Sized + Hash + Equivalent<K>,

Remove the key-value pair equivalent to key and return +its value.

+

Like Vec::swap_remove, the pair is removed by swapping it with the +last element of the map and popping it off. This perturbs +the position of what used to be the last element!

+

Return None if key is not in map.

+

Computes in O(1) time (average).

+
source

pub fn swap_remove_entry<Q>(&mut self, key: &Q) -> Option<(K, V)>
where + Q: ?Sized + Hash + Equivalent<K>,

Remove and return the key-value pair equivalent to key.

+

Like Vec::swap_remove, the pair is removed by swapping it with the +last element of the map and popping it off. This perturbs +the position of what used to be the last element!

+

Return None if key is not in map.

+

Computes in O(1) time (average).

+
source

pub fn swap_remove_full<Q>(&mut self, key: &Q) -> Option<(usize, K, V)>
where + Q: ?Sized + Hash + Equivalent<K>,

Remove the key-value pair equivalent to key and return it and +the index it had.

+

Like Vec::swap_remove, the pair is removed by swapping it with the +last element of the map and popping it off. This perturbs +the position of what used to be the last element!

+

Return None if key is not in map.

+

Computes in O(1) time (average).

+
source

pub fn shift_remove<Q>(&mut self, key: &Q) -> Option<V>
where + Q: ?Sized + Hash + Equivalent<K>,

Remove the key-value pair equivalent to key and return +its value.

+

Like Vec::remove, the pair is removed by shifting all of the +elements that follow it, preserving their relative order. +This perturbs the index of all of those elements!

+

Return None if key is not in map.

+

Computes in O(n) time (average).

+
source

pub fn shift_remove_entry<Q>(&mut self, key: &Q) -> Option<(K, V)>
where + Q: ?Sized + Hash + Equivalent<K>,

Remove and return the key-value pair equivalent to key.

+

Like Vec::remove, the pair is removed by shifting all of the +elements that follow it, preserving their relative order. +This perturbs the index of all of those elements!

+

Return None if key is not in map.

+

Computes in O(n) time (average).

+
source

pub fn shift_remove_full<Q>(&mut self, key: &Q) -> Option<(usize, K, V)>
where + Q: ?Sized + Hash + Equivalent<K>,

Remove the key-value pair equivalent to key and return it and +the index it had.

+

Like Vec::remove, the pair is removed by shifting all of the +elements that follow it, preserving their relative order. +This perturbs the index of all of those elements!

+

Return None if key is not in map.

+

Computes in O(n) time (average).

+
source§

impl<K, V, S> IndexMap<K, V, S>

source

pub fn pop(&mut self) -> Option<(K, V)>

Remove the last key-value pair

+

This preserves the order of the remaining elements.

+

Computes in O(1) time (average).

+
source

pub fn retain<F>(&mut self, keep: F)
where + F: FnMut(&K, &mut V) -> bool,

Scan through each key-value pair in the map and keep those where the +closure keep returns true.

+

The elements are visited in order, and remaining elements keep their +order.

+

Computes in O(n) time (average).

+
source

pub fn sort_keys(&mut self)
where + K: Ord,

Sort the map’s key-value pairs by the default ordering of the keys.

+

This is a stable sort – but equivalent keys should not normally coexist in +a map at all, so sort_unstable_keys is preferred +because it is generally faster and doesn’t allocate auxiliary memory.

+

See sort_by for details.

+
source

pub fn sort_by<F>(&mut self, cmp: F)
where + F: FnMut(&K, &V, &K, &V) -> Ordering,

Sort the map’s key-value pairs in place using the comparison +function cmp.

+

The comparison function receives two key and value pairs to compare (you +can sort by keys or values or their combination as needed).

+

Computes in O(n log n + c) time and O(n) space where n is +the length of the map and c the capacity. The sort is stable.

+
source

pub fn sorted_by<F>(self, cmp: F) -> IntoIter<K, V> ⓘ
where + F: FnMut(&K, &V, &K, &V) -> Ordering,

Sort the key-value pairs of the map and return a by-value iterator of +the key-value pairs with the result.

+

The sort is stable.

+
source

pub fn sort_unstable_keys(&mut self)
where + K: Ord,

Sort the map’s key-value pairs by the default ordering of the keys, but +may not preserve the order of equal elements.

+

See sort_unstable_by for details.

+
source

pub fn sort_unstable_by<F>(&mut self, cmp: F)
where + F: FnMut(&K, &V, &K, &V) -> Ordering,

Sort the map’s key-value pairs in place using the comparison function cmp, but +may not preserve the order of equal elements.

+

The comparison function receives two key and value pairs to compare (you +can sort by keys or values or their combination as needed).

+

Computes in O(n log n + c) time where n is +the length of the map and c is the capacity. The sort is unstable.

+
source

pub fn sorted_unstable_by<F>(self, cmp: F) -> IntoIter<K, V> ⓘ
where + F: FnMut(&K, &V, &K, &V) -> Ordering,

Sort the key-value pairs of the map and return a by-value iterator of +the key-value pairs with the result.

+

The sort is unstable.

+
source

pub fn sort_by_cached_key<T, F>(&mut self, sort_key: F)
where + T: Ord, + F: FnMut(&K, &V) -> T,

Sort the map’s key-value pairs in place using a sort-key extraction function.

+

During sorting, the function is called at most once per entry, by using temporary storage +to remember the results of its evaluation. The order of calls to the function is +unspecified and may change between versions of indexmap or the standard library.

+

Computes in O(m n + n log n + c) time () and O(n) space, where the function is +O(m), n is the length of the map, and c the capacity. The sort is stable.

+
source

pub fn binary_search_keys(&self, x: &K) -> Result<usize, usize>
where + K: Ord,

Search over a sorted map for a key.

+

Returns the position where that key is present, or the position where it can be inserted to +maintain the sort. See slice::binary_search for more details.

+

Computes in O(log(n)) time, which is notably less scalable than looking the key up +using get_index_of, but this can also position missing keys.

+
source

pub fn binary_search_by<'a, F>(&'a self, f: F) -> Result<usize, usize>
where + F: FnMut(&'a K, &'a V) -> Ordering,

Search over a sorted map with a comparator function.

+

Returns the position where that value is present, or the position where it can be inserted +to maintain the sort. See slice::binary_search_by for more details.

+

Computes in O(log(n)) time.

+
source

pub fn binary_search_by_key<'a, B, F>( + &'a self, + b: &B, + f: F +) -> Result<usize, usize>
where + F: FnMut(&'a K, &'a V) -> B, + B: Ord,

Search over a sorted map with an extraction function.

+

Returns the position where that value is present, or the position where it can be inserted +to maintain the sort. See slice::binary_search_by_key for more details.

+

Computes in O(log(n)) time.

+
source

pub fn partition_point<P>(&self, pred: P) -> usize
where + P: FnMut(&K, &V) -> bool,

Returns the index of the partition point of a sorted map according to the given predicate +(the index of the first element of the second partition).

+

See slice::partition_point for more details.

+

Computes in O(log(n)) time.

+
source

pub fn reverse(&mut self)

Reverses the order of the map’s key-value pairs in place.

+

Computes in O(n) time and O(1) space.

+
source

pub fn as_slice(&self) -> &Slice<K, V>

Returns a slice of all the key-value pairs in the map.

+

Computes in O(1) time.

+
source

pub fn as_mut_slice(&mut self) -> &mut Slice<K, V>

Returns a mutable slice of all the key-value pairs in the map.

+

Computes in O(1) time.

+
source

pub fn into_boxed_slice(self) -> Box<Slice<K, V>>

Converts into a boxed slice of all the key-value pairs in the map.

+

Note that this will drop the inner hash table and any excess capacity.

+
source

pub fn get_index(&self, index: usize) -> Option<(&K, &V)>

Get a key-value pair by index

+

Valid indices are 0 <= index < self.len()

+

Computes in O(1) time.

+
source

pub fn get_index_mut(&mut self, index: usize) -> Option<(&K, &mut V)>

Get a key-value pair by index

+

Valid indices are 0 <= index < self.len()

+

Computes in O(1) time.

+
source

pub fn get_index_entry( + &mut self, + index: usize +) -> Option<IndexedEntry<'_, K, V>>

Get an entry in the map by index for in-place manipulation.

+

Valid indices are 0 <= index < self.len()

+

Computes in O(1) time.

+
source

pub fn get_range<R: RangeBounds<usize>>(&self, range: R) -> Option<&Slice<K, V>>

Returns a slice of key-value pairs in the given range of indices.

+

Valid indices are 0 <= index < self.len()

+

Computes in O(1) time.

+
source

pub fn get_range_mut<R: RangeBounds<usize>>( + &mut self, + range: R +) -> Option<&mut Slice<K, V>>

Returns a mutable slice of key-value pairs in the given range of indices.

+

Valid indices are 0 <= index < self.len()

+

Computes in O(1) time.

+
source

pub fn first(&self) -> Option<(&K, &V)>

Get the first key-value pair

+

Computes in O(1) time.

+
source

pub fn first_mut(&mut self) -> Option<(&K, &mut V)>

Get the first key-value pair, with mutable access to the value

+

Computes in O(1) time.

+
source

pub fn last(&self) -> Option<(&K, &V)>

Get the last key-value pair

+

Computes in O(1) time.

+
source

pub fn last_mut(&mut self) -> Option<(&K, &mut V)>

Get the last key-value pair, with mutable access to the value

+

Computes in O(1) time.

+
source

pub fn swap_remove_index(&mut self, index: usize) -> Option<(K, V)>

Remove the key-value pair by index

+

Valid indices are 0 <= index < self.len()

+

Like Vec::swap_remove, the pair is removed by swapping it with the +last element of the map and popping it off. This perturbs +the position of what used to be the last element!

+

Computes in O(1) time (average).

+
source

pub fn shift_remove_index(&mut self, index: usize) -> Option<(K, V)>

Remove the key-value pair by index

+

Valid indices are 0 <= index < self.len()

+

Like Vec::remove, the pair is removed by shifting all of the +elements that follow it, preserving their relative order. +This perturbs the index of all of those elements!

+

Computes in O(n) time (average).

+
source

pub fn move_index(&mut self, from: usize, to: usize)

Moves the position of a key-value pair from one index to another +by shifting all other pairs in-between.

+
    +
  • If from < to, the other pairs will shift down while the targeted pair moves up.
    • +
  • If from > to, the other pairs will shift up while the targeted pair moves down.
    • +
+

Panics if from or to are out of bounds.

+

Computes in O(n) time (average).

+
source

pub fn swap_indices(&mut self, a: usize, b: usize)

Swaps the position of two key-value pairs in the map.

+

Panics if a or b are out of bounds.

+

Computes in O(1) time (average).

+

Trait Implementations§

source§

impl<K, V, S> Clone for IndexMap<K, V, S>
where + K: Clone, + V: Clone, + S: Clone,

source§

fn clone(&self) -> Self

Returns a copy of the value. Read more
source§

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

Performs copy-assignment from source. Read more
source§

impl<K, V, S> Debug for IndexMap<K, V, S>
where + K: Debug, + V: Debug,

source§

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

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

impl<K, V, S> Default for IndexMap<K, V, S>
where + S: Default,

source§

fn default() -> Self

Return an empty IndexMap

+
source§

impl<'a, K, V, S> Extend<(&'a K, &'a V)> for IndexMap<K, V, S>
where + K: Hash + Eq + Copy, + V: Copy, + S: BuildHasher,

source§

fn extend<I: IntoIterator<Item = (&'a K, &'a V)>>(&mut self, iterable: I)

Extend the map with all key-value pairs in the iterable.

+

See the first extend method for more details.

+
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<K, V, S> Extend<(K, V)> for IndexMap<K, V, S>
where + K: Hash + Eq, + S: BuildHasher,

source§

fn extend<I: IntoIterator<Item = (K, V)>>(&mut self, iterable: I)

Extend the map with all key-value pairs in the iterable.

+

This is equivalent to calling insert for each of +them in order, which means that for keys that already existed +in the map, their value is updated but it keeps the existing order.

+

New keys are inserted in the order they appear in the sequence. If +equivalents of a key occur more than once, the last corresponding value +prevails.

+
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<K, V, const N: usize> From<[(K, V); N]> for IndexMap<K, V, RandomState>
where + K: Hash + Eq,

source§

fn from(arr: [(K, V); N]) -> Self

§Examples
+
use indexmap::IndexMap;
+
+let map1 = IndexMap::from([(1, 2), (3, 4)]);
+let map2: IndexMap<_, _> = [(1, 2), (3, 4)].into();
+assert_eq!(map1, map2);
+
source§

impl<K, V, S> FromIterator<(K, V)> for IndexMap<K, V, S>
where + K: Hash + Eq, + S: BuildHasher + Default,

source§

fn from_iter<I: IntoIterator<Item = (K, V)>>(iterable: I) -> Self

Create an IndexMap from the sequence of key-value pairs in the +iterable.

+

from_iter uses the same logic as extend. See +extend for more details.

+
source§

impl<K, V, Q, S> Index<&Q> for IndexMap<K, V, S>
where + Q: Hash + Equivalent<K> + ?Sized, + S: BuildHasher,

Access IndexMap values corresponding to a key.

+

§Examples

+
use indexmap::IndexMap;
+
+let mut map = IndexMap::new();
+for word in "Lorem ipsum dolor sit amet".split_whitespace() {
+    map.insert(word.to_lowercase(), word.to_uppercase());
+}
+assert_eq!(map["lorem"], "LOREM");
+assert_eq!(map["ipsum"], "IPSUM");
+ +
ⓘ
use indexmap::IndexMap;
+
+let mut map = IndexMap::new();
+map.insert("foo", 1);
+println!("{:?}", map["bar"]); // panics!
+
source§

fn index(&self, key: &Q) -> &V

Returns a reference to the value corresponding to the supplied key.

+

Panics if key is not present in the map.

+
§

type Output = V

The returned type after indexing.
source§

impl<K, V, S> Index<(Bound<usize>, Bound<usize>)> for IndexMap<K, V, S>

§

type Output = Slice<K, V>

The returned type after indexing.
source§

fn index(&self, range: (Bound<usize>, Bound<usize>)) -> &Self::Output

Performs the indexing (container[index]) operation. Read more
source§

impl<K, V, S> Index<Range<usize>> for IndexMap<K, V, S>

§

type Output = Slice<K, V>

The returned type after indexing.
source§

fn index(&self, range: Range<usize>) -> &Self::Output

Performs the indexing (container[index]) operation. Read more
source§

impl<K, V, S> Index<RangeFrom<usize>> for IndexMap<K, V, S>

§

type Output = Slice<K, V>

The returned type after indexing.
source§

fn index(&self, range: RangeFrom<usize>) -> &Self::Output

Performs the indexing (container[index]) operation. Read more
source§

impl<K, V, S> Index<RangeFull> for IndexMap<K, V, S>

§

type Output = Slice<K, V>

The returned type after indexing.
source§

fn index(&self, range: RangeFull) -> &Self::Output

Performs the indexing (container[index]) operation. Read more
source§

impl<K, V, S> Index<RangeInclusive<usize>> for IndexMap<K, V, S>

§

type Output = Slice<K, V>

The returned type after indexing.
source§

fn index(&self, range: RangeInclusive<usize>) -> &Self::Output

Performs the indexing (container[index]) operation. Read more
source§

impl<K, V, S> Index<RangeTo<usize>> for IndexMap<K, V, S>

§

type Output = Slice<K, V>

The returned type after indexing.
source§

fn index(&self, range: RangeTo<usize>) -> &Self::Output

Performs the indexing (container[index]) operation. Read more
source§

impl<K, V, S> Index<RangeToInclusive<usize>> for IndexMap<K, V, S>

§

type Output = Slice<K, V>

The returned type after indexing.
source§

fn index(&self, range: RangeToInclusive<usize>) -> &Self::Output

Performs the indexing (container[index]) operation. Read more
source§

impl<K, V, S> Index<usize> for IndexMap<K, V, S>

Access IndexMap values at indexed positions.

+

See Index<usize> for Keys to access a map’s keys instead.

+

§Examples

+
use indexmap::IndexMap;
+
+let mut map = IndexMap::new();
+for word in "Lorem ipsum dolor sit amet".split_whitespace() {
+    map.insert(word.to_lowercase(), word.to_uppercase());
+}
+assert_eq!(map[0], "LOREM");
+assert_eq!(map[1], "IPSUM");
+map.reverse();
+assert_eq!(map[0], "AMET");
+assert_eq!(map[1], "SIT");
+map.sort_keys();
+assert_eq!(map[0], "AMET");
+assert_eq!(map[1], "DOLOR");
+ +
ⓘ
use indexmap::IndexMap;
+
+let mut map = IndexMap::new();
+map.insert("foo", 1);
+println!("{:?}", map[10]); // panics!
+
source§

fn index(&self, index: usize) -> &V

Returns a reference to the value at the supplied index.

+

Panics if index is out of bounds.

+
§

type Output = V

The returned type after indexing.
source§

impl<K, V, Q, S> IndexMut<&Q> for IndexMap<K, V, S>
where + Q: Hash + Equivalent<K> + ?Sized, + S: BuildHasher,

Access IndexMap values corresponding to a key.

+

Mutable indexing allows changing / updating values of key-value +pairs that are already present.

+

You can not insert new pairs with index syntax, use .insert().

+

§Examples

+
use indexmap::IndexMap;
+
+let mut map = IndexMap::new();
+for word in "Lorem ipsum dolor sit amet".split_whitespace() {
+    map.insert(word.to_lowercase(), word.to_string());
+}
+let lorem = &mut map["lorem"];
+assert_eq!(lorem, "Lorem");
+lorem.retain(char::is_lowercase);
+assert_eq!(map["lorem"], "orem");
+ +
ⓘ
use indexmap::IndexMap;
+
+let mut map = IndexMap::new();
+map.insert("foo", 1);
+map["bar"] = 1; // panics!
+
source§

fn index_mut(&mut self, key: &Q) -> &mut V

Returns a mutable reference to the value corresponding to the supplied key.

+

Panics if key is not present in the map.

+
source§

impl<K, V, S> IndexMut<(Bound<usize>, Bound<usize>)> for IndexMap<K, V, S>

source§

fn index_mut( + &mut self, + range: (Bound<usize>, Bound<usize>) +) -> &mut Self::Output

Performs the mutable indexing (container[index]) operation. Read more
source§

impl<K, V, S> IndexMut<Range<usize>> for IndexMap<K, V, S>

source§

fn index_mut(&mut self, range: Range<usize>) -> &mut Self::Output

Performs the mutable indexing (container[index]) operation. Read more
source§

impl<K, V, S> IndexMut<RangeFrom<usize>> for IndexMap<K, V, S>

source§

fn index_mut(&mut self, range: RangeFrom<usize>) -> &mut Self::Output

Performs the mutable indexing (container[index]) operation. Read more
source§

impl<K, V, S> IndexMut<RangeFull> for IndexMap<K, V, S>

source§

fn index_mut(&mut self, range: RangeFull) -> &mut Self::Output

Performs the mutable indexing (container[index]) operation. Read more
source§

impl<K, V, S> IndexMut<RangeInclusive<usize>> for IndexMap<K, V, S>

source§

fn index_mut(&mut self, range: RangeInclusive<usize>) -> &mut Self::Output

Performs the mutable indexing (container[index]) operation. Read more
source§

impl<K, V, S> IndexMut<RangeTo<usize>> for IndexMap<K, V, S>

source§

fn index_mut(&mut self, range: RangeTo<usize>) -> &mut Self::Output

Performs the mutable indexing (container[index]) operation. Read more
source§

impl<K, V, S> IndexMut<RangeToInclusive<usize>> for IndexMap<K, V, S>

source§

fn index_mut(&mut self, range: RangeToInclusive<usize>) -> &mut Self::Output

Performs the mutable indexing (container[index]) operation. Read more
source§

impl<K, V, S> IndexMut<usize> for IndexMap<K, V, S>

Access IndexMap values at indexed positions.

+

Mutable indexing allows changing / updating indexed values +that are already present.

+

You can not insert new values with index syntax – use .insert().

+

§Examples

+
use indexmap::IndexMap;
+
+let mut map = IndexMap::new();
+for word in "Lorem ipsum dolor sit amet".split_whitespace() {
+    map.insert(word.to_lowercase(), word.to_string());
+}
+let lorem = &mut map[0];
+assert_eq!(lorem, "Lorem");
+lorem.retain(char::is_lowercase);
+assert_eq!(map["lorem"], "orem");
+ +
ⓘ
use indexmap::IndexMap;
+
+let mut map = IndexMap::new();
+map.insert("foo", 1);
+map[10] = 1; // panics!
+
source§

fn index_mut(&mut self, index: usize) -> &mut V

Returns a mutable reference to the value at the supplied index.

+

Panics if index is out of bounds.

+
source§

impl<'a, K, V, S> IntoIterator for &'a IndexMap<K, V, S>

§

type Item = (&'a K, &'a V)

The type of the elements being iterated over.
§

type IntoIter = Iter<'a, K, V>

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<'a, K, V, S> IntoIterator for &'a mut IndexMap<K, V, S>

§

type Item = (&'a K, &'a mut V)

The type of the elements being iterated over.
§

type IntoIter = IterMut<'a, K, V>

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<K, V, S> IntoIterator for IndexMap<K, V, S>

§

type Item = (K, V)

The type of the elements being iterated over.
§

type IntoIter = IntoIter<K, V>

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<K, V, S> MutableKeys for IndexMap<K, V, S>
where + S: BuildHasher,

Opt-in mutable access to IndexMap keys.

+

See MutableKeys for more information.

+
§

type Key = K

§

type Value = V

source§

fn get_full_mut2<Q>(&mut self, key: &Q) -> Option<(usize, &mut K, &mut V)>
where + Q: ?Sized + Hash + Equivalent<K>,

Return item index, mutable reference to key and value Read more
source§

fn get_index_mut2(&mut self, index: usize) -> Option<(&mut K, &mut V)>

Return mutable reference to key and value at an index. Read more
source§

fn retain2<F>(&mut self, keep: F)
where + F: FnMut(&mut K, &mut V) -> bool,

Scan through each key-value pair in the map and keep those where the +closure keep returns true. Read more
source§

impl<K, V1, S1, V2, S2> PartialEq<IndexMap<K, V2, S2>> for IndexMap<K, V1, S1>
where + K: Hash + Eq, + V1: PartialEq<V2>, + S1: BuildHasher, + S2: BuildHasher,

source§

fn eq(&self, other: &IndexMap<K, V2, S2>) -> 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<K, V, S> RawEntryApiV1<K, V, S> for IndexMap<K, V, S>

source§

fn raw_entry_v1(&self) -> RawEntryBuilder<'_, K, V, S>

Creates a raw immutable entry builder for the IndexMap. Read more
source§

fn raw_entry_mut_v1(&mut self) -> RawEntryBuilderMut<'_, K, V, S>

Creates a raw entry builder for the IndexMap. Read more
source§

impl<K, V, S> Eq for IndexMap<K, V, S>
where + K: Eq + Hash, + V: Eq, + S: BuildHasher,

Auto Trait Implementations§

§

impl<K, V, S> Freeze for IndexMap<K, V, S>
where + S: Freeze,

§

impl<K, V, S> RefUnwindSafe for IndexMap<K, V, S>
where + K: RefUnwindSafe, + S: RefUnwindSafe, + V: RefUnwindSafe,

§

impl<K, V, S> Send for IndexMap<K, V, S>
where + K: Send, + S: Send, + V: Send,

§

impl<K, V, S> Sync for IndexMap<K, V, S>
where + K: Sync, + S: Sync, + V: Sync,

§

impl<K, V, S> Unpin for IndexMap<K, V, S>
where + K: Unpin, + S: Unpin, + V: Unpin,

§

impl<K, V, S> UnwindSafe for IndexMap<K, V, S>
where + K: UnwindSafe, + S: UnwindSafe, + V: UnwindSafe,

Blanket Implementations§

source§

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

source§

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more
source§

impl<T> Borrow<T> for T
where + T: ?Sized,

source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
source§

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

source§

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

Mutably borrows from an owned value. Read more
source§

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

source§

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

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

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

source§

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 T
where + 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 T
where + 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 T
where + 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 T
where + 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/indexmap/map/struct.IndexedEntry.html b/indexmap/map/struct.IndexedEntry.html new file mode 100644 index 0000000000..fc52973b9c --- /dev/null +++ b/indexmap/map/struct.IndexedEntry.html @@ -0,0 +1,64 @@ +IndexedEntry in indexmap::map - Rust
+

Struct indexmap::map::IndexedEntry

source · 
pub struct IndexedEntry<'a, K, V> { /* private fields */ }
Expand description

A view into an occupied entry in an IndexMap obtained by index.

+

This struct is created from the get_index_entry method.

+

Implementations§

source§

impl<'a, K, V> IndexedEntry<'a, K, V>

source

pub fn index(&self) -> usize

Return the index of the key-value pair

+
source

pub fn key(&self) -> &K

Gets a reference to the entry’s key in the map.

+
source

pub fn get(&self) -> &V

Gets a reference to the entry’s value in the map.

+
source

pub fn get_mut(&mut self) -> &mut V

Gets a mutable reference to the entry’s value in the map.

+

If you need a reference which may outlive the destruction of the +IndexedEntry value, see into_mut.

+
source

pub fn insert(&mut self, value: V) -> V

Sets the value of the entry to value, and returns the entry’s old value.

+
source

pub fn into_mut(self) -> &'a mut V

Converts into a mutable reference to the entry’s value in the map, +with a lifetime bound to the map itself.

+
source

pub fn swap_remove_entry(self) -> (K, V)

Remove and return the key, value pair stored in the map for this entry

+

Like Vec::swap_remove, the pair is removed by swapping it with +the last element of the map and popping it off. +This perturbs the position of what used to be the last element!

+

Computes in O(1) time (average).

+
source

pub fn shift_remove_entry(self) -> (K, V)

Remove and return the key, value pair stored in the map for this entry

+

Like Vec::remove, the pair is removed by shifting all of the +elements that follow it, preserving their relative order. +This perturbs the index of all of those elements!

+

Computes in O(n) time (average).

+
source

pub fn swap_remove(self) -> V

Remove the key, value pair stored in the map for this entry, and return the value.

+

Like Vec::swap_remove, the pair is removed by swapping it with +the last element of the map and popping it off. +This perturbs the position of what used to be the last element!

+

Computes in O(1) time (average).

+
source

pub fn shift_remove(self) -> V

Remove the key, value pair stored in the map for this entry, and return the value.

+

Like Vec::remove, the pair is removed by shifting all of the +elements that follow it, preserving their relative order. +This perturbs the index of all of those elements!

+

Computes in O(n) time (average).

+
source

pub fn move_index(self, to: usize)

Moves the position of the entry to a new index +by shifting all other entries in-between.

+

This is equivalent to IndexMap::move_index +coming from the current .index().

+
    +
  • If self.index() < to, the other pairs will shift down while the targeted pair moves up.
    • +
  • If self.index() > to, the other pairs will shift up while the targeted pair moves down.
    • +
+

Panics if to is out of bounds.

+

Computes in O(n) time (average).

+
source

pub fn swap_indices(self, other: usize)

Swaps the position of entry with another.

+

This is equivalent to IndexMap::swap_indices +with the current .index() as one of the two being swapped.

+

Panics if the other index is out of bounds.

+

Computes in O(1) time (average).

+

Trait Implementations§

source§

impl<K: Debug, V: Debug> Debug for IndexedEntry<'_, K, V>

source§

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

Formats the value using the given formatter. Read more

Auto Trait Implementations§

§

impl<'a, K, V> Freeze for IndexedEntry<'a, K, V>

§

impl<'a, K, V> RefUnwindSafe for IndexedEntry<'a, K, V>
where + K: RefUnwindSafe, + V: RefUnwindSafe,

§

impl<'a, K, V> Send for IndexedEntry<'a, K, V>
where + K: Send, + V: Send,

§

impl<'a, K, V> Sync for IndexedEntry<'a, K, V>
where + K: Sync, + V: Sync,

§

impl<'a, K, V> Unpin for IndexedEntry<'a, K, V>

§

impl<'a, K, V> !UnwindSafe for IndexedEntry<'a, K, V>

Blanket Implementations§

source§

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

source§

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more
source§

impl<T> Borrow<T> for T
where + T: ?Sized,

source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
source§

impl<T> BorrowMut<T> for T
where + 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 T
where + 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 T
where + 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 T
where + 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/indexmap/map/struct.IntoIter.html b/indexmap/map/struct.IntoIter.html new file mode 100644 index 0000000000..f60bee73c8 --- /dev/null +++ b/indexmap/map/struct.IntoIter.html @@ -0,0 +1,220 @@ +IntoIter in indexmap::map - Rust
+

Struct indexmap::map::IntoIter

source · 
pub struct IntoIter<K, V> { /* private fields */ }
Expand description

An owning iterator over the entries of an IndexMap.

+

This struct is created by the IndexMap::into_iter method +(provided by the IntoIterator trait). See its documentation for more.

+

Implementations§

source§

impl<K, V> IntoIter<K, V>

source

pub fn as_slice(&self) -> &Slice<K, V>

Returns a slice of the remaining entries in the iterator.

+
source

pub fn as_mut_slice(&mut self) -> &mut Slice<K, V>

Returns a mutable slice of the remaining entries in the iterator.

+

Trait Implementations§

source§

impl<K: Debug, V: Debug> Debug for IntoIter<K, V>

source§

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

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

impl<K, V> Default for IntoIter<K, V>

source§

fn default() -> Self

Returns the “default value” for a type. Read more
source§

impl<K, V> DoubleEndedIterator for IntoIter<K, V>

source§

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

Removes and returns an element from the end of the iterator. Read more
source§

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

Returns the nth element from the end of the iterator. Read more
source§

fn advance_back_by(&mut self, n: usize) -> Result<(), NonZero<usize>>

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

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

This is the reverse version of Iterator::try_fold(): it takes +elements starting from the back of the iterator. Read more
1.27.0 · source§

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

An iterator method that reduces the iterator’s elements to a single, +final value, starting from the back. Read more
1.27.0 · source§

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

Searches for an element of an iterator from the back that satisfies a predicate. Read more
source§

impl<K, V> ExactSizeIterator for IntoIter<K, V>

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<K, V> Iterator for IntoIter<K, V>

§

type Item = (K, V)

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 count(self) -> usize

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

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

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

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

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

fn collect<C>(self) -> C
where + C: FromIterator<Self::Item>,

Transforms an iterator into a collection. 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
source§

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

🔬This is a nightly-only experimental API. (iter_advance_by)
Advances the iterator by n elements. 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 Self
where + Self: Sized,

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

fn collect_into<E>(self, collection: &mut E) -> &mut E
where + 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 partition_in_place<'a, T, P>(self, predicate: P) -> usize
where + T: 'a, + Self: Sized + DoubleEndedIterator<Item = &'a mut T>, + P: FnMut(&T) -> bool,

🔬This is a nightly-only experimental API. (iter_partition_in_place)
Reorders the elements of this iterator in-place according to the given predicate, +such that all those that return true precede all those that return false. +Returns the number of true elements found. Read more
source§

fn is_partitioned<P>(self, predicate: P) -> bool
where + 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) -> R
where + 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) -> R
where + 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) -> B
where + 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>>>::TryType
where + 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) -> bool
where + 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) -> bool
where + 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>>>::TryType
where + 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 rposition<P>(&mut self, predicate: P) -> Option<usize>
where + P: FnMut(Self::Item) -> bool, + Self: Sized + ExactSizeIterator + DoubleEndedIterator,

Searches for an element in an iterator from the right, 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 rev(self) -> Rev<Self>
where + Self: Sized + DoubleEndedIterator,

Reverses an iterator’s direction. 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) -> S
where + Self: Sized, + S: Sum<Self::Item>,

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

fn product<P>(self) -> P
where + 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) -> Ordering
where + 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) -> bool
where + 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) -> bool
where + 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) -> bool
where + 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) -> bool
where + 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) -> bool
where + 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) -> bool
where + 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) -> bool
where + 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) -> bool
where + Self: Sized, + F: FnMut(&Self::Item, &Self::Item) -> bool,

🔬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) -> bool
where + 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<K, V> FusedIterator for IntoIter<K, V>

Auto Trait Implementations§

§

impl<K, V> Freeze for IntoIter<K, V>

§

impl<K, V> RefUnwindSafe for IntoIter<K, V>
where + K: RefUnwindSafe, + V: RefUnwindSafe,

§

impl<K, V> Send for IntoIter<K, V>
where + K: Send, + V: Send,

§

impl<K, V> Sync for IntoIter<K, V>
where + K: Sync, + V: Sync,

§

impl<K, V> Unpin for IntoIter<K, V>
where + K: Unpin, + V: Unpin,

§

impl<K, V> UnwindSafe for IntoIter<K, V>
where + K: UnwindSafe + RefUnwindSafe, + V: UnwindSafe + RefUnwindSafe,

Blanket Implementations§

source§

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

source§

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more
source§

impl<T> Borrow<T> for T
where + T: ?Sized,

source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
source§

impl<T> BorrowMut<T> for T
where + 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 T
where + 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 I
where + 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, U> TryFrom<U> for T
where + 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 T
where + 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/indexmap/map/struct.IntoKeys.html b/indexmap/map/struct.IntoKeys.html new file mode 100644 index 0000000000..ebba3494ad --- /dev/null +++ b/indexmap/map/struct.IntoKeys.html @@ -0,0 +1,218 @@ +IntoKeys in indexmap::map - Rust
+

Struct indexmap::map::IntoKeys

source · 
pub struct IntoKeys<K, V> { /* private fields */ }
Expand description

An owning iterator over the keys of an IndexMap.

+

This struct is created by the IndexMap::into_keys method. +See its documentation for more.

+

Trait Implementations§

source§

impl<K: Debug, V> Debug for IntoKeys<K, V>

source§

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

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

impl<K, V> Default for IntoKeys<K, V>

source§

fn default() -> Self

Returns the “default value” for a type. Read more
source§

impl<K, V> DoubleEndedIterator for IntoKeys<K, V>

source§

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

Removes and returns an element from the end of the iterator. Read more
source§

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

Returns the nth element from the end of the iterator. Read more
source§

fn advance_back_by(&mut self, n: usize) -> Result<(), NonZero<usize>>

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

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

This is the reverse version of Iterator::try_fold(): it takes +elements starting from the back of the iterator. Read more
1.27.0 · source§

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

An iterator method that reduces the iterator’s elements to a single, +final value, starting from the back. Read more
1.27.0 · source§

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

Searches for an element of an iterator from the back that satisfies a predicate. Read more
source§

impl<K, V> ExactSizeIterator for IntoKeys<K, V>

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<K, V> Iterator for IntoKeys<K, V>

§

type Item = K

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 count(self) -> usize

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

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

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

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

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

fn collect<C>(self) -> C
where + C: FromIterator<Self::Item>,

Transforms an iterator into a collection. 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
source§

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

🔬This is a nightly-only experimental API. (iter_advance_by)
Advances the iterator by n elements. 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 Self
where + Self: Sized,

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

fn collect_into<E>(self, collection: &mut E) -> &mut E
where + 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 partition_in_place<'a, T, P>(self, predicate: P) -> usize
where + T: 'a, + Self: Sized + DoubleEndedIterator<Item = &'a mut T>, + P: FnMut(&T) -> bool,

🔬This is a nightly-only experimental API. (iter_partition_in_place)
Reorders the elements of this iterator in-place according to the given predicate, +such that all those that return true precede all those that return false. +Returns the number of true elements found. Read more
source§

fn is_partitioned<P>(self, predicate: P) -> bool
where + 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) -> R
where + 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) -> R
where + 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) -> B
where + 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>>>::TryType
where + 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) -> bool
where + 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) -> bool
where + 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>>>::TryType
where + 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 rposition<P>(&mut self, predicate: P) -> Option<usize>
where + P: FnMut(Self::Item) -> bool, + Self: Sized + ExactSizeIterator + DoubleEndedIterator,

Searches for an element in an iterator from the right, 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 rev(self) -> Rev<Self>
where + Self: Sized + DoubleEndedIterator,

Reverses an iterator’s direction. 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) -> S
where + Self: Sized, + S: Sum<Self::Item>,

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

fn product<P>(self) -> P
where + 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) -> Ordering
where + 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) -> bool
where + 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) -> bool
where + 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) -> bool
where + 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) -> bool
where + 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) -> bool
where + 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) -> bool
where + 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) -> bool
where + 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) -> bool
where + Self: Sized, + F: FnMut(&Self::Item, &Self::Item) -> bool,

🔬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) -> bool
where + 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<K, V> FusedIterator for IntoKeys<K, V>

Auto Trait Implementations§

§

impl<K, V> Freeze for IntoKeys<K, V>

§

impl<K, V> RefUnwindSafe for IntoKeys<K, V>
where + K: RefUnwindSafe, + V: RefUnwindSafe,

§

impl<K, V> Send for IntoKeys<K, V>
where + K: Send, + V: Send,

§

impl<K, V> Sync for IntoKeys<K, V>
where + K: Sync, + V: Sync,

§

impl<K, V> Unpin for IntoKeys<K, V>
where + K: Unpin, + V: Unpin,

§

impl<K, V> UnwindSafe for IntoKeys<K, V>
where + K: UnwindSafe + RefUnwindSafe, + V: UnwindSafe + RefUnwindSafe,

Blanket Implementations§

source§

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

source§

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more
source§

impl<T> Borrow<T> for T
where + T: ?Sized,

source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
source§

impl<T> BorrowMut<T> for T
where + 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 T
where + 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 I
where + 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, U> TryFrom<U> for T
where + 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 T
where + 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/indexmap/map/struct.IntoValues.html b/indexmap/map/struct.IntoValues.html new file mode 100644 index 0000000000..0398abaa32 --- /dev/null +++ b/indexmap/map/struct.IntoValues.html @@ -0,0 +1,218 @@ +IntoValues in indexmap::map - Rust
+

Struct indexmap::map::IntoValues

source · 
pub struct IntoValues<K, V> { /* private fields */ }
Expand description

An owning iterator over the values of an IndexMap.

+

This struct is created by the IndexMap::into_values method. +See its documentation for more.

+

Trait Implementations§

source§

impl<K, V: Debug> Debug for IntoValues<K, V>

source§

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

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

impl<K, V> Default for IntoValues<K, V>

source§

fn default() -> Self

Returns the “default value” for a type. Read more
source§

impl<K, V> DoubleEndedIterator for IntoValues<K, V>

source§

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

Removes and returns an element from the end of the iterator. Read more
source§

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

Returns the nth element from the end of the iterator. Read more
source§

fn advance_back_by(&mut self, n: usize) -> Result<(), NonZero<usize>>

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

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

This is the reverse version of Iterator::try_fold(): it takes +elements starting from the back of the iterator. Read more
1.27.0 · source§

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

An iterator method that reduces the iterator’s elements to a single, +final value, starting from the back. Read more
1.27.0 · source§

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

Searches for an element of an iterator from the back that satisfies a predicate. Read more
source§

impl<K, V> ExactSizeIterator for IntoValues<K, V>

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<K, V> Iterator for IntoValues<K, V>

§

type Item = V

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 count(self) -> usize

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

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

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

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

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

fn collect<C>(self) -> C
where + C: FromIterator<Self::Item>,

Transforms an iterator into a collection. 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
source§

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

🔬This is a nightly-only experimental API. (iter_advance_by)
Advances the iterator by n elements. 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 Self
where + Self: Sized,

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

fn collect_into<E>(self, collection: &mut E) -> &mut E
where + 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 partition_in_place<'a, T, P>(self, predicate: P) -> usize
where + T: 'a, + Self: Sized + DoubleEndedIterator<Item = &'a mut T>, + P: FnMut(&T) -> bool,

🔬This is a nightly-only experimental API. (iter_partition_in_place)
Reorders the elements of this iterator in-place according to the given predicate, +such that all those that return true precede all those that return false. +Returns the number of true elements found. Read more
source§

fn is_partitioned<P>(self, predicate: P) -> bool
where + 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) -> R
where + 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) -> R
where + 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) -> B
where + 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>>>::TryType
where + 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) -> bool
where + 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) -> bool
where + 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>>>::TryType
where + 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 rposition<P>(&mut self, predicate: P) -> Option<usize>
where + P: FnMut(Self::Item) -> bool, + Self: Sized + ExactSizeIterator + DoubleEndedIterator,

Searches for an element in an iterator from the right, 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 rev(self) -> Rev<Self>
where + Self: Sized + DoubleEndedIterator,

Reverses an iterator’s direction. 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) -> S
where + Self: Sized, + S: Sum<Self::Item>,

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

fn product<P>(self) -> P
where + 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) -> Ordering
where + 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) -> bool
where + 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) -> bool
where + 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) -> bool
where + 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) -> bool
where + 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) -> bool
where + 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) -> bool
where + 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) -> bool
where + 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) -> bool
where + Self: Sized, + F: FnMut(&Self::Item, &Self::Item) -> bool,

🔬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) -> bool
where + 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<K, V> FusedIterator for IntoValues<K, V>

Auto Trait Implementations§

§

impl<K, V> Freeze for IntoValues<K, V>

§

impl<K, V> RefUnwindSafe for IntoValues<K, V>
where + K: RefUnwindSafe, + V: RefUnwindSafe,

§

impl<K, V> Send for IntoValues<K, V>
where + K: Send, + V: Send,

§

impl<K, V> Sync for IntoValues<K, V>
where + K: Sync, + V: Sync,

§

impl<K, V> Unpin for IntoValues<K, V>
where + K: Unpin, + V: Unpin,

§

impl<K, V> UnwindSafe for IntoValues<K, V>
where + K: UnwindSafe + RefUnwindSafe, + V: UnwindSafe + RefUnwindSafe,

Blanket Implementations§

source§

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

source§

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more
source§

impl<T> Borrow<T> for T
where + T: ?Sized,

source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
source§

impl<T> BorrowMut<T> for T
where + 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 T
where + 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 I
where + 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, U> TryFrom<U> for T
where + 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 T
where + 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/indexmap/map/struct.Iter.html b/indexmap/map/struct.Iter.html new file mode 100644 index 0000000000..6210545994 --- /dev/null +++ b/indexmap/map/struct.Iter.html @@ -0,0 +1,219 @@ +Iter in indexmap::map - Rust
+

Struct indexmap::map::Iter

source · 
pub struct Iter<'a, K, V> { /* private fields */ }
Expand description

An iterator over the entries of an IndexMap.

+

This struct is created by the IndexMap::iter method. +See its documentation for more.

+

Implementations§

source§

impl<'a, K, V> Iter<'a, K, V>

source

pub fn as_slice(&self) -> &'a Slice<K, V>

Returns a slice of the remaining entries in the iterator.

+

Trait Implementations§

source§

impl<K, V> Clone for Iter<'_, K, V>

source§

fn clone(&self) -> Self

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<K: Debug, V: Debug> Debug for Iter<'_, K, V>

source§

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

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

impl<K, V> Default for Iter<'_, K, V>

source§

fn default() -> Self

Returns the “default value” for a type. Read more
source§

impl<K, V> DoubleEndedIterator for Iter<'_, K, V>

source§

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

Removes and returns an element from the end of the iterator. Read more
source§

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

Returns the nth element from the end of the iterator. Read more
source§

fn advance_back_by(&mut self, n: usize) -> Result<(), NonZero<usize>>

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

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

This is the reverse version of Iterator::try_fold(): it takes +elements starting from the back of the iterator. Read more
1.27.0 · source§

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

An iterator method that reduces the iterator’s elements to a single, +final value, starting from the back. Read more
1.27.0 · source§

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

Searches for an element of an iterator from the back that satisfies a predicate. Read more
source§

impl<K, V> ExactSizeIterator for Iter<'_, K, V>

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, K, V> Iterator for Iter<'a, K, V>

§

type Item = (&'a K, &'a V)

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 count(self) -> usize

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

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

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

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

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

fn collect<C>(self) -> C
where + C: FromIterator<Self::Item>,

Transforms an iterator into a collection. 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
source§

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

🔬This is a nightly-only experimental API. (iter_advance_by)
Advances the iterator by n elements. 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 Self
where + Self: Sized,

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

fn collect_into<E>(self, collection: &mut E) -> &mut E
where + 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 partition_in_place<'a, T, P>(self, predicate: P) -> usize
where + T: 'a, + Self: Sized + DoubleEndedIterator<Item = &'a mut T>, + P: FnMut(&T) -> bool,

🔬This is a nightly-only experimental API. (iter_partition_in_place)
Reorders the elements of this iterator in-place according to the given predicate, +such that all those that return true precede all those that return false. +Returns the number of true elements found. Read more
source§

fn is_partitioned<P>(self, predicate: P) -> bool
where + 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) -> R
where + 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) -> R
where + 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) -> B
where + 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>>>::TryType
where + 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) -> bool
where + 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) -> bool
where + 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>>>::TryType
where + 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 rposition<P>(&mut self, predicate: P) -> Option<usize>
where + P: FnMut(Self::Item) -> bool, + Self: Sized + ExactSizeIterator + DoubleEndedIterator,

Searches for an element in an iterator from the right, 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 rev(self) -> Rev<Self>
where + Self: Sized + DoubleEndedIterator,

Reverses an iterator’s direction. 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
1.0.0 · source§

fn cycle(self) -> Cycle<Self>
where + Self: Sized + Clone,

Repeats an iterator endlessly. 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) -> S
where + Self: Sized, + S: Sum<Self::Item>,

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

fn product<P>(self) -> P
where + 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) -> Ordering
where + 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) -> bool
where + 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) -> bool
where + 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) -> bool
where + 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) -> bool
where + 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) -> bool
where + 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) -> bool
where + 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) -> bool
where + 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) -> bool
where + Self: Sized, + F: FnMut(&Self::Item, &Self::Item) -> bool,

🔬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) -> bool
where + 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<K, V> FusedIterator for Iter<'_, K, V>

Auto Trait Implementations§

§

impl<'a, K, V> Freeze for Iter<'a, K, V>

§

impl<'a, K, V> RefUnwindSafe for Iter<'a, K, V>
where + K: RefUnwindSafe, + V: RefUnwindSafe,

§

impl<'a, K, V> Send for Iter<'a, K, V>
where + K: Sync, + V: Sync,

§

impl<'a, K, V> Sync for Iter<'a, K, V>
where + K: Sync, + V: Sync,

§

impl<'a, K, V> Unpin for Iter<'a, K, V>

§

impl<'a, K, V> UnwindSafe for Iter<'a, K, V>
where + K: RefUnwindSafe, + V: RefUnwindSafe,

Blanket Implementations§

source§

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

source§

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more
source§

impl<T> Borrow<T> for T
where + T: ?Sized,

source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
source§

impl<T> BorrowMut<T> for T
where + 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 T
where + 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 I
where + 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> ToOwned for T
where + 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 T
where + 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 T
where + 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/indexmap/map/struct.IterMut.html b/indexmap/map/struct.IterMut.html new file mode 100644 index 0000000000..3806c7687a --- /dev/null +++ b/indexmap/map/struct.IterMut.html @@ -0,0 +1,217 @@ +IterMut in indexmap::map - Rust
+

Struct indexmap::map::IterMut

source · 
pub struct IterMut<'a, K, V> { /* private fields */ }
Expand description

A mutable iterator over the entries of an IndexMap.

+

This struct is created by the IndexMap::iter_mut method. +See its documentation for more.

+

Implementations§

source§

impl<'a, K, V> IterMut<'a, K, V>

source

pub fn as_slice(&self) -> &Slice<K, V>

Returns a slice of the remaining entries in the iterator.

+
source

pub fn into_slice(self) -> &'a mut Slice<K, V>

Returns a mutable slice of the remaining entries in the iterator.

+

To avoid creating &mut references that alias, this is forced to consume the iterator.

+

Trait Implementations§

source§

impl<K: Debug, V: Debug> Debug for IterMut<'_, K, V>

source§

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

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

impl<K, V> Default for IterMut<'_, K, V>

source§

fn default() -> Self

Returns the “default value” for a type. Read more
source§

impl<K, V> DoubleEndedIterator for IterMut<'_, K, V>

source§

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

Removes and returns an element from the end of the iterator. Read more
source§

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

Returns the nth element from the end of the iterator. Read more
source§

fn advance_back_by(&mut self, n: usize) -> Result<(), NonZero<usize>>

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

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

This is the reverse version of Iterator::try_fold(): it takes +elements starting from the back of the iterator. Read more
1.27.0 · source§

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

An iterator method that reduces the iterator’s elements to a single, +final value, starting from the back. Read more
1.27.0 · source§

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

Searches for an element of an iterator from the back that satisfies a predicate. Read more
source§

impl<K, V> ExactSizeIterator for IterMut<'_, K, V>

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, K, V> Iterator for IterMut<'a, K, V>

§

type Item = (&'a K, &'a mut V)

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 count(self) -> usize

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

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

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

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

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

fn collect<C>(self) -> C
where + C: FromIterator<Self::Item>,

Transforms an iterator into a collection. 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
source§

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

🔬This is a nightly-only experimental API. (iter_advance_by)
Advances the iterator by n elements. 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 Self
where + Self: Sized,

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

fn collect_into<E>(self, collection: &mut E) -> &mut E
where + 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 partition_in_place<'a, T, P>(self, predicate: P) -> usize
where + T: 'a, + Self: Sized + DoubleEndedIterator<Item = &'a mut T>, + P: FnMut(&T) -> bool,

🔬This is a nightly-only experimental API. (iter_partition_in_place)
Reorders the elements of this iterator in-place according to the given predicate, +such that all those that return true precede all those that return false. +Returns the number of true elements found. Read more
source§

fn is_partitioned<P>(self, predicate: P) -> bool
where + 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) -> R
where + 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) -> R
where + 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) -> B
where + 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>>>::TryType
where + 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) -> bool
where + 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) -> bool
where + 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>>>::TryType
where + 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 rposition<P>(&mut self, predicate: P) -> Option<usize>
where + P: FnMut(Self::Item) -> bool, + Self: Sized + ExactSizeIterator + DoubleEndedIterator,

Searches for an element in an iterator from the right, 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 rev(self) -> Rev<Self>
where + Self: Sized + DoubleEndedIterator,

Reverses an iterator’s direction. 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) -> S
where + Self: Sized, + S: Sum<Self::Item>,

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

fn product<P>(self) -> P
where + 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) -> Ordering
where + 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) -> bool
where + 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) -> bool
where + 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) -> bool
where + 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) -> bool
where + 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) -> bool
where + 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) -> bool
where + 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) -> bool
where + 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) -> bool
where + Self: Sized, + F: FnMut(&Self::Item, &Self::Item) -> bool,

🔬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) -> bool
where + 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<K, V> FusedIterator for IterMut<'_, K, V>

Auto Trait Implementations§

§

impl<'a, K, V> Freeze for IterMut<'a, K, V>

§

impl<'a, K, V> RefUnwindSafe for IterMut<'a, K, V>
where + K: RefUnwindSafe, + V: RefUnwindSafe,

§

impl<'a, K, V> Send for IterMut<'a, K, V>
where + K: Send, + V: Send,

§

impl<'a, K, V> Sync for IterMut<'a, K, V>
where + K: Sync, + V: Sync,

§

impl<'a, K, V> Unpin for IterMut<'a, K, V>

§

impl<'a, K, V> !UnwindSafe for IterMut<'a, K, V>

Blanket Implementations§

source§

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

source§

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more
source§

impl<T> Borrow<T> for T
where + T: ?Sized,

source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
source§

impl<T> BorrowMut<T> for T
where + 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 T
where + 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 I
where + 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, U> TryFrom<U> for T
where + 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 T
where + 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/indexmap/map/struct.Keys.html b/indexmap/map/struct.Keys.html new file mode 100644 index 0000000000..8cae09212a --- /dev/null +++ b/indexmap/map/struct.Keys.html @@ -0,0 +1,266 @@ +Keys in indexmap::map - Rust
+

Struct indexmap::map::Keys

source · 
pub struct Keys<'a, K, V> { /* private fields */ }
Expand description

An iterator over the keys of an IndexMap.

+

This struct is created by the IndexMap::keys method. +See its documentation for more.

+

Trait Implementations§

source§

impl<K, V> Clone for Keys<'_, K, V>

source§

fn clone(&self) -> Self

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<K: Debug, V> Debug for Keys<'_, K, V>

source§

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

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

impl<K, V> Default for Keys<'_, K, V>

source§

fn default() -> Self

Returns the “default value” for a type. Read more
source§

impl<K, V> DoubleEndedIterator for Keys<'_, K, V>

source§

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

Removes and returns an element from the end of the iterator. Read more
source§

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

Returns the nth element from the end of the iterator. Read more
source§

fn advance_back_by(&mut self, n: usize) -> Result<(), NonZero<usize>>

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

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

This is the reverse version of Iterator::try_fold(): it takes +elements starting from the back of the iterator. Read more
1.27.0 · source§

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

An iterator method that reduces the iterator’s elements to a single, +final value, starting from the back. Read more
1.27.0 · source§

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

Searches for an element of an iterator from the back that satisfies a predicate. Read more
source§

impl<K, V> ExactSizeIterator for Keys<'_, K, V>

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, K, V> Index<usize> for Keys<'a, K, V>

Access IndexMap keys at indexed positions.

+

While Index<usize> for IndexMap accesses a map’s values, +indexing through IndexMap::keys offers an alternative to access a map’s +keys instead.

+

Since Keys is also an iterator, consuming items from the iterator will +offset the effective indexes. Similarly, if Keys is obtained from +Slice::keys, indexes will be interpreted relative to the position of +that slice.

+

§Examples

+
use indexmap::IndexMap;
+
+let mut map = IndexMap::new();
+for word in "Lorem ipsum dolor sit amet".split_whitespace() {
+    map.insert(word.to_lowercase(), word.to_uppercase());
+}
+
+assert_eq!(map[0], "LOREM");
+assert_eq!(map.keys()[0], "lorem");
+assert_eq!(map[1], "IPSUM");
+assert_eq!(map.keys()[1], "ipsum");
+
+map.reverse();
+assert_eq!(map.keys()[0], "amet");
+assert_eq!(map.keys()[1], "sit");
+
+map.sort_keys();
+assert_eq!(map.keys()[0], "amet");
+assert_eq!(map.keys()[1], "dolor");
+
+// Advancing the iterator will offset the indexing
+let mut keys = map.keys();
+assert_eq!(keys[0], "amet");
+assert_eq!(keys.next().map(|s| &**s), Some("amet"));
+assert_eq!(keys[0], "dolor");
+assert_eq!(keys[1], "ipsum");
+
+// Slices may have an offset as well
+let slice = &map[2..];
+assert_eq!(slice[0], "IPSUM");
+assert_eq!(slice.keys()[0], "ipsum");
+ +
ⓘ
use indexmap::IndexMap;
+
+let mut map = IndexMap::new();
+map.insert("foo", 1);
+println!("{:?}", map.keys()[10]); // panics!
+
source§

fn index(&self, index: usize) -> &K

Returns a reference to the key at the supplied index.

+

Panics if index is out of bounds.

+
§

type Output = K

The returned type after indexing.
source§

impl<'a, K, V> Iterator for Keys<'a, K, V>

§

type Item = &'a K

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 count(self) -> usize

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

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

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

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

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

fn collect<C>(self) -> C
where + C: FromIterator<Self::Item>,

Transforms an iterator into a collection. 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
source§

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

🔬This is a nightly-only experimental API. (iter_advance_by)
Advances the iterator by n elements. 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 Self
where + Self: Sized,

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

fn collect_into<E>(self, collection: &mut E) -> &mut E
where + 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 partition_in_place<'a, T, P>(self, predicate: P) -> usize
where + T: 'a, + Self: Sized + DoubleEndedIterator<Item = &'a mut T>, + P: FnMut(&T) -> bool,

🔬This is a nightly-only experimental API. (iter_partition_in_place)
Reorders the elements of this iterator in-place according to the given predicate, +such that all those that return true precede all those that return false. +Returns the number of true elements found. Read more
source§

fn is_partitioned<P>(self, predicate: P) -> bool
where + 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) -> R
where + 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) -> R
where + 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) -> B
where + 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>>>::TryType
where + 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) -> bool
where + 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) -> bool
where + 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>>>::TryType
where + 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 rposition<P>(&mut self, predicate: P) -> Option<usize>
where + P: FnMut(Self::Item) -> bool, + Self: Sized + ExactSizeIterator + DoubleEndedIterator,

Searches for an element in an iterator from the right, 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 rev(self) -> Rev<Self>
where + Self: Sized + DoubleEndedIterator,

Reverses an iterator’s direction. 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
1.0.0 · source§

fn cycle(self) -> Cycle<Self>
where + Self: Sized + Clone,

Repeats an iterator endlessly. 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) -> S
where + Self: Sized, + S: Sum<Self::Item>,

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

fn product<P>(self) -> P
where + 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) -> Ordering
where + 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) -> bool
where + 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) -> bool
where + 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) -> bool
where + 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) -> bool
where + 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) -> bool
where + 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) -> bool
where + 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) -> bool
where + 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) -> bool
where + Self: Sized, + F: FnMut(&Self::Item, &Self::Item) -> bool,

🔬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) -> bool
where + 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<K, V> FusedIterator for Keys<'_, K, V>

Auto Trait Implementations§

§

impl<'a, K, V> Freeze for Keys<'a, K, V>

§

impl<'a, K, V> RefUnwindSafe for Keys<'a, K, V>
where + K: RefUnwindSafe, + V: RefUnwindSafe,

§

impl<'a, K, V> Send for Keys<'a, K, V>
where + K: Sync, + V: Sync,

§

impl<'a, K, V> Sync for Keys<'a, K, V>
where + K: Sync, + V: Sync,

§

impl<'a, K, V> Unpin for Keys<'a, K, V>

§

impl<'a, K, V> UnwindSafe for Keys<'a, K, V>
where + K: RefUnwindSafe, + V: RefUnwindSafe,

Blanket Implementations§

source§

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

source§

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more
source§

impl<T> Borrow<T> for T
where + T: ?Sized,

source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
source§

impl<T> BorrowMut<T> for T
where + 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 T
where + 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 I
where + 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> ToOwned for T
where + 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 T
where + 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 T
where + 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/indexmap/map/struct.OccupiedEntry.html b/indexmap/map/struct.OccupiedEntry.html new file mode 100644 index 0000000000..7c5f97295f --- /dev/null +++ b/indexmap/map/struct.OccupiedEntry.html @@ -0,0 +1,77 @@ +OccupiedEntry in indexmap::map - Rust
+

Struct indexmap::map::OccupiedEntry

source · 
pub struct OccupiedEntry<'a, K, V> { /* private fields */ }
Expand description

A view into an occupied entry in an IndexMap. +It is part of the Entry enum.

+

Implementations§

source§

impl<'a, K, V> OccupiedEntry<'a, K, V>

source

pub fn index(&self) -> usize

Return the index of the key-value pair

+
source

pub fn key(&self) -> &K

Gets a reference to the entry’s key in the map.

+

Note that this is not the key that was used to find the entry. There may be an observable +difference if the key type has any distinguishing features outside of Hash and Eq, like +extra fields or the memory address of an allocation.

+
source

pub fn get(&self) -> &V

Gets a reference to the entry’s value in the map.

+
source

pub fn get_mut(&mut self) -> &mut V

Gets a mutable reference to the entry’s value in the map.

+

If you need a reference which may outlive the destruction of the +Entry value, see into_mut.

+
source

pub fn into_mut(self) -> &'a mut V

Converts into a mutable reference to the entry’s value in the map, +with a lifetime bound to the map itself.

+
source

pub fn insert(&mut self, value: V) -> V

Sets the value of the entry to value, and returns the entry’s old value.

+
source

pub fn remove(self) -> V

👎Deprecated: remove disrupts the map order – use swap_remove or shift_remove for explicit behavior.

Remove the key, value pair stored in the map for this entry, and return the value.

+

NOTE: This is equivalent to .swap_remove(), replacing this +entry’s position with the last element, and it is deprecated in favor of calling that +explicitly. If you need to preserve the relative order of the keys in the map, use +.shift_remove() instead.

+
source

pub fn swap_remove(self) -> V

Remove the key, value pair stored in the map for this entry, and return the value.

+

Like Vec::swap_remove, the pair is removed by swapping it with +the last element of the map and popping it off. +This perturbs the position of what used to be the last element!

+

Computes in O(1) time (average).

+
source

pub fn shift_remove(self) -> V

Remove the key, value pair stored in the map for this entry, and return the value.

+

Like Vec::remove, the pair is removed by shifting all of the +elements that follow it, preserving their relative order. +This perturbs the index of all of those elements!

+

Computes in O(n) time (average).

+
source

pub fn remove_entry(self) -> (K, V)

👎Deprecated: remove_entry disrupts the map order – use swap_remove_entry or shift_remove_entry for explicit behavior.

Remove and return the key, value pair stored in the map for this entry

+

NOTE: This is equivalent to .swap_remove_entry(), +replacing this entry’s position with the last element, and it is deprecated in favor of +calling that explicitly. If you need to preserve the relative order of the keys in the map, +use .shift_remove_entry() instead.

+
source

pub fn swap_remove_entry(self) -> (K, V)

Remove and return the key, value pair stored in the map for this entry

+

Like Vec::swap_remove, the pair is removed by swapping it with +the last element of the map and popping it off. +This perturbs the position of what used to be the last element!

+

Computes in O(1) time (average).

+
source

pub fn shift_remove_entry(self) -> (K, V)

Remove and return the key, value pair stored in the map for this entry

+

Like Vec::remove, the pair is removed by shifting all of the +elements that follow it, preserving their relative order. +This perturbs the index of all of those elements!

+

Computes in O(n) time (average).

+
source

pub fn move_index(self, to: usize)

Moves the position of the entry to a new index +by shifting all other entries in-between.

+

This is equivalent to IndexMap::move_index +coming from the current .index().

+
    +
  • If self.index() < to, the other pairs will shift down while the targeted pair moves up.
    • +
  • If self.index() > to, the other pairs will shift up while the targeted pair moves down.
    • +
+

Panics if to is out of bounds.

+

Computes in O(n) time (average).

+
source

pub fn swap_indices(self, other: usize)

Swaps the position of entry with another.

+

This is equivalent to IndexMap::swap_indices +with the current .index() as one of the two being swapped.

+

Panics if the other index is out of bounds.

+

Computes in O(1) time (average).

+

Trait Implementations§

source§

impl<K: Debug, V: Debug> Debug for OccupiedEntry<'_, K, V>

source§

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

Formats the value using the given formatter. Read more

Auto Trait Implementations§

§

impl<'a, K, V> Freeze for OccupiedEntry<'a, K, V>

§

impl<'a, K, V> RefUnwindSafe for OccupiedEntry<'a, K, V>
where + K: RefUnwindSafe, + V: RefUnwindSafe,

§

impl<'a, K, V> Send for OccupiedEntry<'a, K, V>
where + K: Send, + V: Send,

§

impl<'a, K, V> Sync for OccupiedEntry<'a, K, V>
where + K: Sync, + V: Sync,

§

impl<'a, K, V> Unpin for OccupiedEntry<'a, K, V>

§

impl<'a, K, V> !UnwindSafe for OccupiedEntry<'a, K, V>

Blanket Implementations§

source§

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

source§

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more
source§

impl<T> Borrow<T> for T
where + T: ?Sized,

source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
source§

impl<T> BorrowMut<T> for T
where + 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 T
where + 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 T
where + 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 T
where + 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/indexmap/map/struct.Slice.html b/indexmap/map/struct.Slice.html new file mode 100644 index 0000000000..ba20a63bc8 --- /dev/null +++ b/indexmap/map/struct.Slice.html @@ -0,0 +1,97 @@ +Slice in indexmap::map - Rust
+

Struct indexmap::map::Slice

source · 
pub struct Slice<K, V> { /* private fields */ }
Expand description

A dynamically-sized slice of key-value pairs in an IndexMap.

+

This supports indexed operations much like a [(K, V)] slice, +but not any hashed operations on the map keys.

+

Unlike IndexMap, Slice does consider the order for PartialEq +and Eq, and it also implements PartialOrd, Ord, and Hash.

+

Implementations§

source§

impl<K, V> Slice<K, V>

source

pub const fn new<'a>() -> &'a Self

Returns an empty slice.

+
source

pub fn new_mut<'a>() -> &'a mut Self

Returns an empty mutable slice.

+
source

pub const fn len(&self) -> usize

Return the number of key-value pairs in the map slice.

+
source

pub const fn is_empty(&self) -> bool

Returns true if the map slice contains no elements.

+
source

pub fn get_index(&self, index: usize) -> Option<(&K, &V)>

Get a key-value pair by index.

+

Valid indices are 0 <= index < self.len()

+
source

pub fn get_index_mut(&mut self, index: usize) -> Option<(&K, &mut V)>

Get a key-value pair by index, with mutable access to the value.

+

Valid indices are 0 <= index < self.len()

+
source

pub fn get_range<R: RangeBounds<usize>>(&self, range: R) -> Option<&Self>

Returns a slice of key-value pairs in the given range of indices.

+

Valid indices are 0 <= index < self.len()

+
source

pub fn get_range_mut<R: RangeBounds<usize>>( + &mut self, + range: R +) -> Option<&mut Self>

Returns a mutable slice of key-value pairs in the given range of indices.

+

Valid indices are 0 <= index < self.len()

+
source

pub fn first(&self) -> Option<(&K, &V)>

Get the first key-value pair.

+
source

pub fn first_mut(&mut self) -> Option<(&K, &mut V)>

Get the first key-value pair, with mutable access to the value.

+
source

pub fn last(&self) -> Option<(&K, &V)>

Get the last key-value pair.

+
source

pub fn last_mut(&mut self) -> Option<(&K, &mut V)>

Get the last key-value pair, with mutable access to the value.

+
source

pub fn split_at(&self, index: usize) -> (&Self, &Self)

Divides one slice into two at an index.

+

Panics if index > len.

+
source

pub fn split_at_mut(&mut self, index: usize) -> (&mut Self, &mut Self)

Divides one mutable slice into two at an index.

+

Panics if index > len.

+
source

pub fn split_first(&self) -> Option<((&K, &V), &Self)>

Returns the first key-value pair and the rest of the slice, +or None if it is empty.

+
source

pub fn split_first_mut(&mut self) -> Option<((&K, &mut V), &mut Self)>

Returns the first key-value pair and the rest of the slice, +with mutable access to the value, or None if it is empty.

+
source

pub fn split_last(&self) -> Option<((&K, &V), &Self)>

Returns the last key-value pair and the rest of the slice, +or None if it is empty.

+
source

pub fn split_last_mut(&mut self) -> Option<((&K, &mut V), &mut Self)>

Returns the last key-value pair and the rest of the slice, +with mutable access to the value, or None if it is empty.

+
source

pub fn iter(&self) -> Iter<'_, K, V> ⓘ

Return an iterator over the key-value pairs of the map slice.

+
source

pub fn iter_mut(&mut self) -> IterMut<'_, K, V> ⓘ

Return an iterator over the key-value pairs of the map slice.

+
source

pub fn keys(&self) -> Keys<'_, K, V> ⓘ

Return an iterator over the keys of the map slice.

+
source

pub fn into_keys(self: Box<Self>) -> IntoKeys<K, V> ⓘ

Return an owning iterator over the keys of the map slice.

+
source

pub fn values(&self) -> Values<'_, K, V> ⓘ

Return an iterator over the values of the map slice.

+
source

pub fn values_mut(&mut self) -> ValuesMut<'_, K, V> ⓘ

Return an iterator over mutable references to the the values of the map slice.

+
source

pub fn into_values(self: Box<Self>) -> IntoValues<K, V> ⓘ

Return an owning iterator over the values of the map slice.

+
source

pub fn binary_search_keys(&self, x: &K) -> Result<usize, usize>
where + K: Ord,

Search over a sorted map for a key.

+

Returns the position where that key is present, or the position where it can be inserted to +maintain the sort. See slice::binary_search for more details.

+

Computes in O(log(n)) time, which is notably less scalable than looking the key up in +the map this is a slice from using IndexMap::get_index_of, but this can also position +missing keys.

+
source

pub fn binary_search_by<'a, F>(&'a self, f: F) -> Result<usize, usize>
where + F: FnMut(&'a K, &'a V) -> Ordering,

Search over a sorted map with a comparator function.

+

Returns the position where that value is present, or the position where it can be inserted +to maintain the sort. See slice::binary_search_by for more details.

+

Computes in O(log(n)) time.

+
source

pub fn binary_search_by_key<'a, B, F>( + &'a self, + b: &B, + f: F +) -> Result<usize, usize>
where + F: FnMut(&'a K, &'a V) -> B, + B: Ord,

Search over a sorted map with an extraction function.

+

Returns the position where that value is present, or the position where it can be inserted +to maintain the sort. See slice::binary_search_by_key for more details.

+

Computes in O(log(n)) time.

+
source

pub fn partition_point<P>(&self, pred: P) -> usize
where + P: FnMut(&K, &V) -> bool,

Returns the index of the partition point of a sorted map according to the given predicate +(the index of the first element of the second partition).

+

See slice::partition_point for more details.

+

Computes in O(log(n)) time.

+

Trait Implementations§

source§

impl<K: Clone, V: Clone> Clone for Box<Slice<K, V>>

source§

fn clone(&self) -> Self

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<K: Debug, V: Debug> Debug for Slice<K, V>

source§

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

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

impl<K, V> Default for &Slice<K, V>

source§

fn default() -> Self

Returns the “default value” for a type. Read more
source§

impl<K, V> Default for &mut Slice<K, V>

source§

fn default() -> Self

Returns the “default value” for a type. Read more
source§

impl<K, V> Default for Box<Slice<K, V>>

source§

fn default() -> Self

Returns the “default value” for a type. Read more
source§

impl<K: Copy, V: Copy> From<&Slice<K, V>> for Box<Slice<K, V>>

source§

fn from(slice: &Slice<K, V>) -> Self

Converts to this type from the input type.
source§

impl<K: Hash, V: Hash> Hash for Slice<K, V>

source§

fn hash<H: Hasher>(&self, state: &mut H)

Feeds this value into the given Hasher. Read more
source§

impl<K, V> Index<(Bound<usize>, Bound<usize>)> for Slice<K, V>

§

type Output = Slice<K, V>

The returned type after indexing.
source§

fn index(&self, range: (Bound<usize>, Bound<usize>)) -> &Self

Performs the indexing (container[index]) operation. Read more
source§

impl<K, V> Index<Range<usize>> for Slice<K, V>

§

type Output = Slice<K, V>

The returned type after indexing.
source§

fn index(&self, range: Range<usize>) -> &Self

Performs the indexing (container[index]) operation. Read more
source§

impl<K, V> Index<RangeFrom<usize>> for Slice<K, V>

§

type Output = Slice<K, V>

The returned type after indexing.
source§

fn index(&self, range: RangeFrom<usize>) -> &Self

Performs the indexing (container[index]) operation. Read more
source§

impl<K, V> Index<RangeFull> for Slice<K, V>

§

type Output = Slice<K, V>

The returned type after indexing.
source§

fn index(&self, range: RangeFull) -> &Self

Performs the indexing (container[index]) operation. Read more
source§

impl<K, V> Index<RangeInclusive<usize>> for Slice<K, V>

§

type Output = Slice<K, V>

The returned type after indexing.
source§

fn index(&self, range: RangeInclusive<usize>) -> &Self

Performs the indexing (container[index]) operation. Read more
source§

impl<K, V> Index<RangeTo<usize>> for Slice<K, V>

§

type Output = Slice<K, V>

The returned type after indexing.
source§

fn index(&self, range: RangeTo<usize>) -> &Self

Performs the indexing (container[index]) operation. Read more
source§

impl<K, V> Index<RangeToInclusive<usize>> for Slice<K, V>

§

type Output = Slice<K, V>

The returned type after indexing.
source§

fn index(&self, range: RangeToInclusive<usize>) -> &Self

Performs the indexing (container[index]) operation. Read more
source§

impl<K, V> Index<usize> for Slice<K, V>

§

type Output = V

The returned type after indexing.
source§

fn index(&self, index: usize) -> &V

Performs the indexing (container[index]) operation. Read more
source§

impl<K, V> IndexMut<(Bound<usize>, Bound<usize>)> for Slice<K, V>

source§

fn index_mut(&mut self, range: (Bound<usize>, Bound<usize>)) -> &mut Self

Performs the mutable indexing (container[index]) operation. Read more
source§

impl<K, V> IndexMut<Range<usize>> for Slice<K, V>

source§

fn index_mut(&mut self, range: Range<usize>) -> &mut Self

Performs the mutable indexing (container[index]) operation. Read more
source§

impl<K, V> IndexMut<RangeFrom<usize>> for Slice<K, V>

source§

fn index_mut(&mut self, range: RangeFrom<usize>) -> &mut Self

Performs the mutable indexing (container[index]) operation. Read more
source§

impl<K, V> IndexMut<RangeFull> for Slice<K, V>

source§

fn index_mut(&mut self, range: RangeFull) -> &mut Self

Performs the mutable indexing (container[index]) operation. Read more
source§

impl<K, V> IndexMut<RangeInclusive<usize>> for Slice<K, V>

source§

fn index_mut(&mut self, range: RangeInclusive<usize>) -> &mut Self

Performs the mutable indexing (container[index]) operation. Read more
source§

impl<K, V> IndexMut<RangeTo<usize>> for Slice<K, V>

source§

fn index_mut(&mut self, range: RangeTo<usize>) -> &mut Self

Performs the mutable indexing (container[index]) operation. Read more
source§

impl<K, V> IndexMut<RangeToInclusive<usize>> for Slice<K, V>

source§

fn index_mut(&mut self, range: RangeToInclusive<usize>) -> &mut Self

Performs the mutable indexing (container[index]) operation. Read more
source§

impl<K, V> IndexMut<usize> for Slice<K, V>

source§

fn index_mut(&mut self, index: usize) -> &mut V

Performs the mutable indexing (container[index]) operation. Read more
source§

impl<'a, K, V> IntoIterator for &'a Slice<K, V>

§

type IntoIter = Iter<'a, K, V>

Which kind of iterator are we turning this into?
§

type Item = (&'a K, &'a V)

The type of the elements being iterated over.
source§

fn into_iter(self) -> Self::IntoIter

Creates an iterator from a value. Read more
source§

impl<'a, K, V> IntoIterator for &'a mut Slice<K, V>

§

type IntoIter = IterMut<'a, K, V>

Which kind of iterator are we turning this into?
§

type Item = (&'a K, &'a mut V)

The type of the elements being iterated over.
source§

fn into_iter(self) -> Self::IntoIter

Creates an iterator from a value. Read more
source§

impl<K, V> IntoIterator for Box<Slice<K, V>>

§

type IntoIter = IntoIter<K, V>

Which kind of iterator are we turning this into?
§

type Item = (K, V)

The type of the elements being iterated over.
source§

fn into_iter(self) -> Self::IntoIter

Creates an iterator from a value. Read more
source§

impl<K: Ord, V: Ord> Ord for Slice<K, V>

source§

fn cmp(&self, other: &Self) -> Ordering

This method returns an Ordering between self and other. Read more
source§

impl<K: PartialEq, V: PartialEq> PartialEq for Slice<K, V>

source§

fn eq(&self, other: &Self) -> 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<K: PartialOrd, V: PartialOrd> PartialOrd for Slice<K, V>

source§

fn partial_cmp(&self, other: &Self) -> 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<K: Eq, V: Eq> Eq for Slice<K, V>

Auto Trait Implementations§

§

impl<K, V> Freeze for Slice<K, V>
where + K: Freeze, + V: Freeze,

§

impl<K, V> RefUnwindSafe for Slice<K, V>
where + K: RefUnwindSafe, + V: RefUnwindSafe,

§

impl<K, V> Send for Slice<K, V>
where + K: Send, + V: Send,

§

impl<K, V> !Sized for Slice<K, V>

§

impl<K, V> Sync for Slice<K, V>
where + K: Sync, + V: Sync,

§

impl<K, V> Unpin for Slice<K, V>
where + K: Unpin, + V: Unpin,

§

impl<K, V> UnwindSafe for Slice<K, V>
where + K: UnwindSafe, + V: UnwindSafe,

Blanket Implementations§

source§

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

source§

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more
source§

impl<T> Borrow<T> for T
where + T: ?Sized,

source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
source§

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

source§

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

Mutably borrows from an owned value. Read more
source§

impl<Q, K> Comparable<K> for Q
where + Q: Ord + ?Sized, + K: Borrow<Q> + ?Sized,

source§

fn compare(&self, key: &K) -> Ordering

Compare self to key and return their ordering.
source§

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

source§

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

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

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

source§

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

Compare self to key and return true if they are equal.
\ No newline at end of file diff --git a/indexmap/map/struct.Splice.html b/indexmap/map/struct.Splice.html new file mode 100644 index 0000000000..1121feccf8 --- /dev/null +++ b/indexmap/map/struct.Splice.html @@ -0,0 +1,249 @@ +Splice in indexmap::map - Rust
+

Struct indexmap::map::Splice

source · 
pub struct Splice<'a, I, K, V, S>
where
+    I: Iterator<Item = (K, V)>,
+    K: Hash + Eq,
+    S: BuildHasher,
{ /* private fields */ }
Expand description

A splicing iterator for IndexMap.

+

This struct is created by IndexMap::splice(). +See its documentation for more.

+

Trait Implementations§

source§

impl<'a, I, K, V, S> Debug for Splice<'a, I, K, V, S>
where + I: Debug + Iterator<Item = (K, V)>, + K: Debug + Hash + Eq, + V: Debug, + S: BuildHasher,

source§

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

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

impl<I, K, V, S> DoubleEndedIterator for Splice<'_, I, K, V, S>
where + I: Iterator<Item = (K, V)>, + K: Hash + Eq, + S: BuildHasher,

source§

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

Removes and returns an element from the end of the iterator. Read more
source§

fn advance_back_by(&mut self, n: usize) -> Result<(), NonZero<usize>>

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

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

Returns the nth element from the end of the iterator. Read more
1.27.0 · source§

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

This is the reverse version of Iterator::try_fold(): it takes +elements starting from the back of the iterator. Read more
1.27.0 · source§

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

An iterator method that reduces the iterator’s elements to a single, +final value, starting from the back. Read more
1.27.0 · source§

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

Searches for an element of an iterator from the back that satisfies a predicate. Read more
source§

impl<I, K, V, S> Drop for Splice<'_, I, K, V, S>
where + I: Iterator<Item = (K, V)>, + K: Hash + Eq, + S: BuildHasher,

source§

fn drop(&mut self)

Executes the destructor for this type. Read more
source§

impl<I, K, V, S> ExactSizeIterator for Splice<'_, I, K, V, S>
where + I: Iterator<Item = (K, V)>, + K: Hash + Eq, + S: BuildHasher,

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<I, K, V, S> Iterator for Splice<'_, I, K, V, S>
where + I: Iterator<Item = (K, V)>, + K: Hash + Eq, + S: BuildHasher,

§

type Item = (K, V)

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) -> usize
where + 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<(), NonZero<usize>>

🔬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 Self
where + Self: Sized,

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

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

Transforms an iterator into a collection. Read more
source§

fn collect_into<E>(self, collection: &mut E) -> &mut E
where + 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 partition_in_place<'a, T, P>(self, predicate: P) -> usize
where + T: 'a, + Self: Sized + DoubleEndedIterator<Item = &'a mut T>, + P: FnMut(&T) -> bool,

🔬This is a nightly-only experimental API. (iter_partition_in_place)
Reorders the elements of this iterator in-place according to the given predicate, +such that all those that return true precede all those that return false. +Returns the number of true elements found. Read more
source§

fn is_partitioned<P>(self, predicate: P) -> bool
where + 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) -> R
where + 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) -> R
where + 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) -> B
where + 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>>>::TryType
where + 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) -> bool
where + 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) -> bool
where + 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>>>::TryType
where + 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 rposition<P>(&mut self, predicate: P) -> Option<usize>
where + P: FnMut(Self::Item) -> bool, + Self: Sized + ExactSizeIterator + DoubleEndedIterator,

Searches for an element in an iterator from the right, 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 rev(self) -> Rev<Self>
where + Self: Sized + DoubleEndedIterator,

Reverses an iterator’s direction. 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) -> S
where + Self: Sized, + S: Sum<Self::Item>,

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

fn product<P>(self) -> P
where + 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) -> Ordering
where + 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) -> bool
where + 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) -> bool
where + 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) -> bool
where + 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) -> bool
where + 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) -> bool
where + 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) -> bool
where + 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) -> bool
where + 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) -> bool
where + Self: Sized, + F: FnMut(&Self::Item, &Self::Item) -> bool,

🔬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) -> bool
where + 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<I, K, V, S> FusedIterator for Splice<'_, I, K, V, S>
where + I: Iterator<Item = (K, V)>, + K: Hash + Eq, + S: BuildHasher,

Auto Trait Implementations§

§

impl<'a, I, K, V, S> Freeze for Splice<'a, I, K, V, S>
where + I: Freeze,

§

impl<'a, I, K, V, S> RefUnwindSafe for Splice<'a, I, K, V, S>
where + I: RefUnwindSafe, + K: RefUnwindSafe, + S: RefUnwindSafe, + V: RefUnwindSafe,

§

impl<'a, I, K, V, S> Send for Splice<'a, I, K, V, S>
where + I: Send, + K: Send, + S: Send, + V: Send,

§

impl<'a, I, K, V, S> Sync for Splice<'a, I, K, V, S>
where + I: Sync, + K: Sync, + S: Sync, + V: Sync,

§

impl<'a, I, K, V, S> Unpin for Splice<'a, I, K, V, S>
where + I: Unpin, + K: Unpin, + V: Unpin,

§

impl<'a, I, K, V, S> !UnwindSafe for Splice<'a, I, K, V, S>

Blanket Implementations§

source§

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

source§

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more
source§

impl<T> Borrow<T> for T
where + T: ?Sized,

source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
source§

impl<T> BorrowMut<T> for T
where + 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 T
where + 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 I
where + 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, U> TryFrom<U> for T
where + 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 T
where + 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/indexmap/map/struct.VacantEntry.html b/indexmap/map/struct.VacantEntry.html new file mode 100644 index 0000000000..23d3a6c16c --- /dev/null +++ b/indexmap/map/struct.VacantEntry.html @@ -0,0 +1,39 @@ +VacantEntry in indexmap::map - Rust
+

Struct indexmap::map::VacantEntry

source · 
pub struct VacantEntry<'a, K, V> { /* private fields */ }
Expand description

A view into a vacant entry in an IndexMap. +It is part of the Entry enum.

+

Implementations§

source§

impl<'a, K, V> VacantEntry<'a, K, V>

source

pub fn index(&self) -> usize

Return the index where a key-value pair may be inserted.

+
source

pub fn key(&self) -> &K

Gets a reference to the key that was used to find the entry.

+
source

pub fn into_key(self) -> K

Takes ownership of the key, leaving the entry vacant.

+
source

pub fn insert(self, value: V) -> &'a mut V

Inserts the entry’s key and the given value into the map, and returns a mutable reference +to the value.

+
source

pub fn insert_sorted(self, value: V) -> (usize, &'a mut V)
where + K: Ord,

Inserts the entry’s key and the given value into the map at its ordered +position among sorted keys, and returns the new index and a mutable +reference to the value.

+

If the existing keys are not already sorted, then the insertion +index is unspecified (like slice::binary_search), but the key-value +pair is inserted at that position regardless.

+

Computes in O(n) time (average).

+
source

pub fn shift_insert(self, index: usize, value: V) -> &'a mut V

Inserts the entry’s key and the given value into the map at the given index, +shifting others to the right, and returns a mutable reference to the value.

+

Panics if index is out of bounds.

+

Computes in O(n) time (average).

+

Trait Implementations§

source§

impl<K: Debug, V> Debug for VacantEntry<'_, K, V>

source§

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

Formats the value using the given formatter. Read more

Auto Trait Implementations§

§

impl<'a, K, V> Freeze for VacantEntry<'a, K, V>
where + K: Freeze,

§

impl<'a, K, V> RefUnwindSafe for VacantEntry<'a, K, V>
where + K: RefUnwindSafe, + V: RefUnwindSafe,

§

impl<'a, K, V> Send for VacantEntry<'a, K, V>
where + K: Send, + V: Send,

§

impl<'a, K, V> Sync for VacantEntry<'a, K, V>
where + K: Sync, + V: Sync,

§

impl<'a, K, V> Unpin for VacantEntry<'a, K, V>
where + K: Unpin,

§

impl<'a, K, V> !UnwindSafe for VacantEntry<'a, K, V>

Blanket Implementations§

source§

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

source§

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more
source§

impl<T> Borrow<T> for T
where + T: ?Sized,

source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
source§

impl<T> BorrowMut<T> for T
where + 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 T
where + 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 T
where + 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 T
where + 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/indexmap/map/struct.Values.html b/indexmap/map/struct.Values.html new file mode 100644 index 0000000000..3334c7cc41 --- /dev/null +++ b/indexmap/map/struct.Values.html @@ -0,0 +1,218 @@ +Values in indexmap::map - Rust
+

Struct indexmap::map::Values

source · 
pub struct Values<'a, K, V> { /* private fields */ }
Expand description

An iterator over the values of an IndexMap.

+

This struct is created by the IndexMap::values method. +See its documentation for more.

+

Trait Implementations§

source§

impl<K, V> Clone for Values<'_, K, V>

source§

fn clone(&self) -> Self

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<K, V: Debug> Debug for Values<'_, K, V>

source§

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

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

impl<K, V> Default for Values<'_, K, V>

source§

fn default() -> Self

Returns the “default value” for a type. Read more
source§

impl<K, V> DoubleEndedIterator for Values<'_, K, V>

source§

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

Removes and returns an element from the end of the iterator. Read more
source§

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

Returns the nth element from the end of the iterator. Read more
source§

fn advance_back_by(&mut self, n: usize) -> Result<(), NonZero<usize>>

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

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

This is the reverse version of Iterator::try_fold(): it takes +elements starting from the back of the iterator. Read more
1.27.0 · source§

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

An iterator method that reduces the iterator’s elements to a single, +final value, starting from the back. Read more
1.27.0 · source§

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

Searches for an element of an iterator from the back that satisfies a predicate. Read more
source§

impl<K, V> ExactSizeIterator for Values<'_, K, V>

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, K, V> Iterator for Values<'a, K, V>

§

type Item = &'a V

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 count(self) -> usize

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

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

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

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

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

fn collect<C>(self) -> C
where + C: FromIterator<Self::Item>,

Transforms an iterator into a collection. 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
source§

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

🔬This is a nightly-only experimental API. (iter_advance_by)
Advances the iterator by n elements. 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 Self
where + Self: Sized,

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

fn collect_into<E>(self, collection: &mut E) -> &mut E
where + 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 partition_in_place<'a, T, P>(self, predicate: P) -> usize
where + T: 'a, + Self: Sized + DoubleEndedIterator<Item = &'a mut T>, + P: FnMut(&T) -> bool,

🔬This is a nightly-only experimental API. (iter_partition_in_place)
Reorders the elements of this iterator in-place according to the given predicate, +such that all those that return true precede all those that return false. +Returns the number of true elements found. Read more
source§

fn is_partitioned<P>(self, predicate: P) -> bool
where + 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) -> R
where + 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) -> R
where + 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) -> B
where + 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>>>::TryType
where + 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) -> bool
where + 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) -> bool
where + 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>>>::TryType
where + 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 rposition<P>(&mut self, predicate: P) -> Option<usize>
where + P: FnMut(Self::Item) -> bool, + Self: Sized + ExactSizeIterator + DoubleEndedIterator,

Searches for an element in an iterator from the right, 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 rev(self) -> Rev<Self>
where + Self: Sized + DoubleEndedIterator,

Reverses an iterator’s direction. 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
1.0.0 · source§

fn cycle(self) -> Cycle<Self>
where + Self: Sized + Clone,

Repeats an iterator endlessly. 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) -> S
where + Self: Sized, + S: Sum<Self::Item>,

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

fn product<P>(self) -> P
where + 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) -> Ordering
where + 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) -> bool
where + 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) -> bool
where + 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) -> bool
where + 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) -> bool
where + 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) -> bool
where + 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) -> bool
where + 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) -> bool
where + 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) -> bool
where + Self: Sized, + F: FnMut(&Self::Item, &Self::Item) -> bool,

🔬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) -> bool
where + 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<K, V> FusedIterator for Values<'_, K, V>

Auto Trait Implementations§

§

impl<'a, K, V> Freeze for Values<'a, K, V>

§

impl<'a, K, V> RefUnwindSafe for Values<'a, K, V>
where + K: RefUnwindSafe, + V: RefUnwindSafe,

§

impl<'a, K, V> Send for Values<'a, K, V>
where + K: Sync, + V: Sync,

§

impl<'a, K, V> Sync for Values<'a, K, V>
where + K: Sync, + V: Sync,

§

impl<'a, K, V> Unpin for Values<'a, K, V>

§

impl<'a, K, V> UnwindSafe for Values<'a, K, V>
where + K: RefUnwindSafe, + V: RefUnwindSafe,

Blanket Implementations§

source§

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

source§

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more
source§

impl<T> Borrow<T> for T
where + T: ?Sized,

source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
source§

impl<T> BorrowMut<T> for T
where + 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 T
where + 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 I
where + 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> ToOwned for T
where + 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 T
where + 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 T
where + 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/indexmap/map/struct.ValuesMut.html b/indexmap/map/struct.ValuesMut.html new file mode 100644 index 0000000000..e508834a90 --- /dev/null +++ b/indexmap/map/struct.ValuesMut.html @@ -0,0 +1,214 @@ +ValuesMut in indexmap::map - Rust
+

Struct indexmap::map::ValuesMut

source · 
pub struct ValuesMut<'a, K, V> { /* private fields */ }
Expand description

A mutable iterator over the values of an IndexMap.

+

This struct is created by the IndexMap::values_mut method. +See its documentation for more.

+

Trait Implementations§

source§

impl<K, V: Debug> Debug for ValuesMut<'_, K, V>

source§

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

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

impl<K, V> Default for ValuesMut<'_, K, V>

source§

fn default() -> Self

Returns the “default value” for a type. Read more
source§

impl<K, V> DoubleEndedIterator for ValuesMut<'_, K, V>

source§

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

Removes and returns an element from the end of the iterator. Read more
source§

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

Returns the nth element from the end of the iterator. Read more
source§

fn advance_back_by(&mut self, n: usize) -> Result<(), NonZero<usize>>

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

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

This is the reverse version of Iterator::try_fold(): it takes +elements starting from the back of the iterator. Read more
1.27.0 · source§

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

An iterator method that reduces the iterator’s elements to a single, +final value, starting from the back. Read more
1.27.0 · source§

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

Searches for an element of an iterator from the back that satisfies a predicate. Read more
source§

impl<K, V> ExactSizeIterator for ValuesMut<'_, K, V>

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, K, V> Iterator for ValuesMut<'a, K, V>

§

type Item = &'a mut V

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 count(self) -> usize

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

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

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

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

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

fn collect<C>(self) -> C
where + C: FromIterator<Self::Item>,

Transforms an iterator into a collection. 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
source§

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

🔬This is a nightly-only experimental API. (iter_advance_by)
Advances the iterator by n elements. 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 Self
where + Self: Sized,

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

fn collect_into<E>(self, collection: &mut E) -> &mut E
where + 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 partition_in_place<'a, T, P>(self, predicate: P) -> usize
where + T: 'a, + Self: Sized + DoubleEndedIterator<Item = &'a mut T>, + P: FnMut(&T) -> bool,

🔬This is a nightly-only experimental API. (iter_partition_in_place)
Reorders the elements of this iterator in-place according to the given predicate, +such that all those that return true precede all those that return false. +Returns the number of true elements found. Read more
source§

fn is_partitioned<P>(self, predicate: P) -> bool
where + 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) -> R
where + 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) -> R
where + 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) -> B
where + 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>>>::TryType
where + 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) -> bool
where + 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) -> bool
where + 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>>>::TryType
where + 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 rposition<P>(&mut self, predicate: P) -> Option<usize>
where + P: FnMut(Self::Item) -> bool, + Self: Sized + ExactSizeIterator + DoubleEndedIterator,

Searches for an element in an iterator from the right, 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 rev(self) -> Rev<Self>
where + Self: Sized + DoubleEndedIterator,

Reverses an iterator’s direction. 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) -> S
where + Self: Sized, + S: Sum<Self::Item>,

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

fn product<P>(self) -> P
where + 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) -> Ordering
where + 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) -> bool
where + 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) -> bool
where + 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) -> bool
where + 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) -> bool
where + 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) -> bool
where + 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) -> bool
where + 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) -> bool
where + 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) -> bool
where + Self: Sized, + F: FnMut(&Self::Item, &Self::Item) -> bool,

🔬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) -> bool
where + 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<K, V> FusedIterator for ValuesMut<'_, K, V>

Auto Trait Implementations§

§

impl<'a, K, V> Freeze for ValuesMut<'a, K, V>

§

impl<'a, K, V> RefUnwindSafe for ValuesMut<'a, K, V>
where + K: RefUnwindSafe, + V: RefUnwindSafe,

§

impl<'a, K, V> Send for ValuesMut<'a, K, V>
where + K: Send, + V: Send,

§

impl<'a, K, V> Sync for ValuesMut<'a, K, V>
where + K: Sync, + V: Sync,

§

impl<'a, K, V> Unpin for ValuesMut<'a, K, V>

§

impl<'a, K, V> !UnwindSafe for ValuesMut<'a, K, V>

Blanket Implementations§

source§

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

source§

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more
source§

impl<T> Borrow<T> for T
where + T: ?Sized,

source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
source§

impl<T> BorrowMut<T> for T
where + 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 T
where + 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 I
where + 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, U> TryFrom<U> for T
where + 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 T
where + 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/indexmap/map/trait.MutableKeys.html b/indexmap/map/trait.MutableKeys.html new file mode 100644 index 0000000000..e851148da2 --- /dev/null +++ b/indexmap/map/trait.MutableKeys.html @@ -0,0 +1,49 @@ +MutableKeys in indexmap::map - Rust
+

Trait indexmap::map::MutableKeys

source · 
pub trait MutableKeys: Sealed {
+    type Key;
+    type Value;
+
+    // Required methods
+    fn get_full_mut2<Q>(
+        &mut self,
+        key: &Q
+    ) -> Option<(usize, &mut Self::Key, &mut Self::Value)>
+       where Q: ?Sized + Hash + Equivalent<Self::Key>;
+    fn get_index_mut2(
+        &mut self,
+        index: usize
+    ) -> Option<(&mut Self::Key, &mut Self::Value)>;
+    fn retain2<F>(&mut self, keep: F)
+       where F: FnMut(&mut Self::Key, &mut Self::Value) -> bool;
+}
Expand description

Opt-in mutable access to IndexMap keys.

+

These methods expose &mut K, mutable references to the key as it is stored +in the map. +You are allowed to modify the keys in the map if the modification +does not change the key’s hash and equality.

+

If keys are modified erroneously, you can no longer look them up. +This is sound (memory safe) but a logical error hazard (just like +implementing PartialEq, Eq, or Hash incorrectly would be).

+

use this trait to enable its methods for IndexMap.

+

This trait is sealed and cannot be implemented for types outside this crate.

+

Required Associated Types§

source

type Key

source

type Value

Required Methods§

source

fn get_full_mut2<Q>( + &mut self, + key: &Q +) -> Option<(usize, &mut Self::Key, &mut Self::Value)>
where + Q: ?Sized + Hash + Equivalent<Self::Key>,

Return item index, mutable reference to key and value

+

Computes in O(1) time (average).

+
source

fn get_index_mut2( + &mut self, + index: usize +) -> Option<(&mut Self::Key, &mut Self::Value)>

Return mutable reference to key and value at an index.

+

Valid indices are 0 <= index < self.len()

+

Computes in O(1) time.

+
source

fn retain2<F>(&mut self, keep: F)
where + F: FnMut(&mut Self::Key, &mut Self::Value) -> bool,

Scan through each key-value pair in the map and keep those where the +closure keep returns true.

+

The elements are visited in order, and remaining elements keep their +order.

+

Computes in O(n) time (average).

+

Object Safety§

This trait is not object safe.

Implementors§

source§

impl<K, V, S> MutableKeys for IndexMap<K, V, S>
where + S: BuildHasher,

Opt-in mutable access to IndexMap keys.

+

See MutableKeys for more information.

+
§

type Key = K

§

type Value = V

\ No newline at end of file diff --git a/indexmap/map/trait.RawEntryApiV1.html b/indexmap/map/trait.RawEntryApiV1.html new file mode 100644 index 0000000000..7fb8af2248 --- /dev/null +++ b/indexmap/map/trait.RawEntryApiV1.html @@ -0,0 +1,141 @@ +RawEntryApiV1 in indexmap::map - Rust
+

Trait indexmap::map::RawEntryApiV1

source · 
pub trait RawEntryApiV1<K, V, S>: Sealed {
+    // Required methods
+    fn raw_entry_v1(&self) -> RawEntryBuilder<'_, K, V, S>;
+    fn raw_entry_mut_v1(&mut self) -> RawEntryBuilderMut<'_, K, V, S>;
+}
Expand description

Opt-in access to the experimental raw entry API.

+

See the raw_entry_v1 module documentation for more information.

+

Required Methods§

source

fn raw_entry_v1(&self) -> RawEntryBuilder<'_, K, V, S>

Creates a raw immutable entry builder for the IndexMap.

+

Raw entries provide the lowest level of control for searching and +manipulating a map. They must be manually initialized with a hash and +then manually searched.

+

This is useful for

+
    +
  • Hash memoization
    • +
  • Using a search key that doesn’t work with the Equivalent trait
    • +
  • Using custom comparison logic without newtype wrappers
    • +
+

Unless you are in such a situation, higher-level and more foolproof APIs like +get should be preferred.

+

Immutable raw entries have very limited use; you might instead want +raw_entry_mut_v1.

+
§Examples
+
use core::hash::{BuildHasher, Hash};
+use indexmap::map::{IndexMap, RawEntryApiV1};
+
+let mut map = IndexMap::new();
+map.extend([("a", 100), ("b", 200), ("c", 300)]);
+
+fn compute_hash<K: Hash + ?Sized, S: BuildHasher>(hash_builder: &S, key: &K) -> u64 {
+    use core::hash::Hasher;
+    let mut state = hash_builder.build_hasher();
+    key.hash(&mut state);
+    state.finish()
+}
+
+for k in ["a", "b", "c", "d", "e", "f"] {
+    let hash = compute_hash(map.hasher(), k);
+    let i = map.get_index_of(k);
+    let v = map.get(k);
+    let kv = map.get_key_value(k);
+    let ikv = map.get_full(k);
+
+    println!("Key: {} and value: {:?}", k, v);
+
+    assert_eq!(map.raw_entry_v1().from_key(k), kv);
+    assert_eq!(map.raw_entry_v1().from_hash(hash, |q| *q == k), kv);
+    assert_eq!(map.raw_entry_v1().from_key_hashed_nocheck(hash, k), kv);
+    assert_eq!(map.raw_entry_v1().from_hash_full(hash, |q| *q == k), ikv);
+    assert_eq!(map.raw_entry_v1().index_from_hash(hash, |q| *q == k), i);
+}
+
source

fn raw_entry_mut_v1(&mut self) -> RawEntryBuilderMut<'_, K, V, S>

Creates a raw entry builder for the IndexMap.

+

Raw entries provide the lowest level of control for searching and +manipulating a map. They must be manually initialized with a hash and +then manually searched. After this, insertions into a vacant entry +still require an owned key to be provided.

+

Raw entries are useful for such exotic situations as:

+
    +
  • Hash memoization
    • +
  • Deferring the creation of an owned key until it is known to be required
    • +
  • Using a search key that doesn’t work with the Equivalent trait
    • +
  • Using custom comparison logic without newtype wrappers
    • +
+

Because raw entries provide much more low-level control, it’s much easier +to put the IndexMap into an inconsistent state which, while memory-safe, +will cause the map to produce seemingly random results. Higher-level and more +foolproof APIs like entry should be preferred when possible.

+

Raw entries give mutable access to the keys. This must not be used +to modify how the key would compare or hash, as the map will not re-evaluate +where the key should go, meaning the keys may become “lost” if their +location does not reflect their state. For instance, if you change a key +so that the map now contains keys which compare equal, search may start +acting erratically, with two keys randomly masking each other. Implementations +are free to assume this doesn’t happen (within the limits of memory-safety).

+
§Examples
+
use core::hash::{BuildHasher, Hash};
+use indexmap::map::{IndexMap, RawEntryApiV1};
+use indexmap::map::raw_entry_v1::RawEntryMut;
+
+let mut map = IndexMap::new();
+map.extend([("a", 100), ("b", 200), ("c", 300)]);
+
+fn compute_hash<K: Hash + ?Sized, S: BuildHasher>(hash_builder: &S, key: &K) -> u64 {
+    use core::hash::Hasher;
+    let mut state = hash_builder.build_hasher();
+    key.hash(&mut state);
+    state.finish()
+}
+
+// Existing key (insert and update)
+match map.raw_entry_mut_v1().from_key("a") {
+    RawEntryMut::Vacant(_) => unreachable!(),
+    RawEntryMut::Occupied(mut view) => {
+        assert_eq!(view.index(), 0);
+        assert_eq!(view.get(), &100);
+        let v = view.get_mut();
+        let new_v = (*v) * 10;
+        *v = new_v;
+        assert_eq!(view.insert(1111), 1000);
+    }
+}
+
+assert_eq!(map["a"], 1111);
+assert_eq!(map.len(), 3);
+
+// Existing key (take)
+let hash = compute_hash(map.hasher(), "c");
+match map.raw_entry_mut_v1().from_key_hashed_nocheck(hash, "c") {
+    RawEntryMut::Vacant(_) => unreachable!(),
+    RawEntryMut::Occupied(view) => {
+        assert_eq!(view.index(), 2);
+        assert_eq!(view.shift_remove_entry(), ("c", 300));
+    }
+}
+assert_eq!(map.raw_entry_v1().from_key("c"), None);
+assert_eq!(map.len(), 2);
+
+// Nonexistent key (insert and update)
+let key = "d";
+let hash = compute_hash(map.hasher(), key);
+match map.raw_entry_mut_v1().from_hash(hash, |q| *q == key) {
+    RawEntryMut::Occupied(_) => unreachable!(),
+    RawEntryMut::Vacant(view) => {
+        assert_eq!(view.index(), 2);
+        let (k, value) = view.insert("d", 4000);
+        assert_eq!((*k, *value), ("d", 4000));
+        *value = 40000;
+    }
+}
+assert_eq!(map["d"], 40000);
+assert_eq!(map.len(), 3);
+
+match map.raw_entry_mut_v1().from_hash(hash, |q| *q == key) {
+    RawEntryMut::Vacant(_) => unreachable!(),
+    RawEntryMut::Occupied(view) => {
+        assert_eq!(view.index(), 2);
+        assert_eq!(view.swap_remove_entry(), ("d", 40000));
+    }
+}
+assert_eq!(map.get("d"), None);
+assert_eq!(map.len(), 2);
+

Implementors§

source§

impl<K, V, S> RawEntryApiV1<K, V, S> for IndexMap<K, V, S>

\ No newline at end of file diff --git a/indexmap/set/index.html b/indexmap/set/index.html new file mode 100644 index 0000000000..53d2bc403a --- /dev/null +++ b/indexmap/set/index.html @@ -0,0 +1,4 @@ +indexmap::set - Rust
+

Module indexmap::set

source ·
Expand description

A hash set implemented using IndexMap

+

Structs§

Traits§

\ No newline at end of file diff --git a/indexmap/set/iter/struct.Difference.html b/indexmap/set/iter/struct.Difference.html new file mode 100644 index 0000000000..d466d59a1f --- /dev/null +++ b/indexmap/set/iter/struct.Difference.html @@ -0,0 +1,11 @@ + + + + + Redirection + + +

Redirecting to ../../../indexmap/set/struct.Difference.html...

+ + + \ No newline at end of file diff --git a/indexmap/set/iter/struct.Drain.html b/indexmap/set/iter/struct.Drain.html new file mode 100644 index 0000000000..2270ca74ba --- /dev/null +++ b/indexmap/set/iter/struct.Drain.html @@ -0,0 +1,11 @@ + + + + + Redirection + + +

Redirecting to ../../../indexmap/set/struct.Drain.html...

+ + + \ No newline at end of file diff --git a/indexmap/set/iter/struct.Intersection.html b/indexmap/set/iter/struct.Intersection.html new file mode 100644 index 0000000000..472841c8c6 --- /dev/null +++ b/indexmap/set/iter/struct.Intersection.html @@ -0,0 +1,11 @@ + + + + + Redirection + + +

Redirecting to ../../../indexmap/set/struct.Intersection.html...

+ + + \ No newline at end of file diff --git a/indexmap/set/iter/struct.IntoIter.html b/indexmap/set/iter/struct.IntoIter.html new file mode 100644 index 0000000000..acbd8fe573 --- /dev/null +++ b/indexmap/set/iter/struct.IntoIter.html @@ -0,0 +1,11 @@ + + + + + Redirection + + +

Redirecting to ../../../indexmap/set/struct.IntoIter.html...

+ + + \ No newline at end of file diff --git a/indexmap/set/iter/struct.Iter.html b/indexmap/set/iter/struct.Iter.html new file mode 100644 index 0000000000..53c18c9d86 --- /dev/null +++ b/indexmap/set/iter/struct.Iter.html @@ -0,0 +1,11 @@ + + + + + Redirection + + +

Redirecting to ../../../indexmap/set/struct.Iter.html...

+ + + \ No newline at end of file diff --git a/indexmap/set/iter/struct.Splice.html b/indexmap/set/iter/struct.Splice.html new file mode 100644 index 0000000000..4714a577ea --- /dev/null +++ b/indexmap/set/iter/struct.Splice.html @@ -0,0 +1,11 @@ + + + + + Redirection + + +

Redirecting to ../../../indexmap/set/struct.Splice.html...

+ + + \ No newline at end of file diff --git a/indexmap/set/iter/struct.SymmetricDifference.html b/indexmap/set/iter/struct.SymmetricDifference.html new file mode 100644 index 0000000000..0ac49db679 --- /dev/null +++ b/indexmap/set/iter/struct.SymmetricDifference.html @@ -0,0 +1,11 @@ + + + + + Redirection + + +

Redirecting to ../../../indexmap/set/struct.SymmetricDifference.html...

+ + + \ No newline at end of file diff --git a/indexmap/set/iter/struct.Union.html b/indexmap/set/iter/struct.Union.html new file mode 100644 index 0000000000..d3ec9cdfca --- /dev/null +++ b/indexmap/set/iter/struct.Union.html @@ -0,0 +1,11 @@ + + + + + Redirection + + +

Redirecting to ../../../indexmap/set/struct.Union.html...

+ + + \ No newline at end of file diff --git a/indexmap/set/mutable/trait.MutableValues.html b/indexmap/set/mutable/trait.MutableValues.html new file mode 100644 index 0000000000..edfc5816a5 --- /dev/null +++ b/indexmap/set/mutable/trait.MutableValues.html @@ -0,0 +1,11 @@ + + + + + Redirection + + +

Redirecting to ../../../indexmap/set/trait.MutableValues.html...

+ + + \ No newline at end of file diff --git a/indexmap/set/sidebar-items.js b/indexmap/set/sidebar-items.js new file mode 100644 index 0000000000..72c689d24c --- /dev/null +++ b/indexmap/set/sidebar-items.js @@ -0,0 +1 @@ +window.SIDEBAR_ITEMS = {"struct":["Difference","Drain","IndexSet","Intersection","IntoIter","Iter","Slice","Splice","SymmetricDifference","Union"],"trait":["MutableValues"]}; \ No newline at end of file diff --git a/indexmap/set/slice/struct.Slice.html b/indexmap/set/slice/struct.Slice.html new file mode 100644 index 0000000000..619b44b2af --- /dev/null +++ b/indexmap/set/slice/struct.Slice.html @@ -0,0 +1,11 @@ + + + + + Redirection + + +

Redirecting to ../../../indexmap/set/struct.Slice.html...

+ + + \ No newline at end of file diff --git a/indexmap/set/struct.Difference.html b/indexmap/set/struct.Difference.html new file mode 100644 index 0000000000..e397529bac --- /dev/null +++ b/indexmap/set/struct.Difference.html @@ -0,0 +1,226 @@ +Difference in indexmap::set - Rust
+

Struct indexmap::set::Difference

source · 
pub struct Difference<'a, T, S> { /* private fields */ }
Expand description

A lazy iterator producing elements in the difference of IndexSets.

+

This struct is created by the IndexSet::difference method. +See its documentation for more.

+

Trait Implementations§

source§

impl<T, S> Clone for Difference<'_, T, S>

source§

fn clone(&self) -> Self

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<T, S> Debug for Difference<'_, T, S>
where + T: Debug + Eq + Hash, + S: BuildHasher,

source§

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

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

impl<T, S> DoubleEndedIterator for Difference<'_, T, S>
where + T: Eq + Hash, + S: BuildHasher,

source§

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

Removes and returns an element from the end of the iterator. Read more
source§

fn advance_back_by(&mut self, n: usize) -> Result<(), NonZero<usize>>

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

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

Returns the nth element from the end of the iterator. Read more
1.27.0 · source§

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

This is the reverse version of Iterator::try_fold(): it takes +elements starting from the back of the iterator. Read more
1.27.0 · source§

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

An iterator method that reduces the iterator’s elements to a single, +final value, starting from the back. Read more
1.27.0 · source§

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

Searches for an element of an iterator from the back that satisfies a predicate. Read more
source§

impl<'a, T, S> Iterator for Difference<'a, T, S>
where + T: Eq + Hash, + S: BuildHasher,

§

type Item = &'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) -> usize
where + 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<(), NonZero<usize>>

🔬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 Self
where + Self: Sized,

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

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

Transforms an iterator into a collection. Read more
source§

fn collect_into<E>(self, collection: &mut E) -> &mut E
where + 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 partition_in_place<'a, T, P>(self, predicate: P) -> usize
where + T: 'a, + Self: Sized + DoubleEndedIterator<Item = &'a mut T>, + P: FnMut(&T) -> bool,

🔬This is a nightly-only experimental API. (iter_partition_in_place)
Reorders the elements of this iterator in-place according to the given predicate, +such that all those that return true precede all those that return false. +Returns the number of true elements found. Read more
source§

fn is_partitioned<P>(self, predicate: P) -> bool
where + 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) -> R
where + 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) -> R
where + 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) -> B
where + 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>>>::TryType
where + 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) -> bool
where + 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) -> bool
where + 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>>>::TryType
where + 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 rev(self) -> Rev<Self>
where + Self: Sized + DoubleEndedIterator,

Reverses an iterator’s direction. 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
1.0.0 · source§

fn cycle(self) -> Cycle<Self>
where + Self: Sized + Clone,

Repeats an iterator endlessly. 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) -> S
where + Self: Sized, + S: Sum<Self::Item>,

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

fn product<P>(self) -> P
where + 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) -> Ordering
where + 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) -> bool
where + 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) -> bool
where + 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) -> bool
where + 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) -> bool
where + 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) -> bool
where + 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) -> bool
where + 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) -> bool
where + 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) -> bool
where + Self: Sized, + F: FnMut(&Self::Item, &Self::Item) -> bool,

🔬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) -> bool
where + 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<T, S> FusedIterator for Difference<'_, T, S>
where + T: Eq + Hash, + S: BuildHasher,

Auto Trait Implementations§

§

impl<'a, T, S> Freeze for Difference<'a, T, S>

§

impl<'a, T, S> RefUnwindSafe for Difference<'a, T, S>
where + S: RefUnwindSafe, + T: RefUnwindSafe,

§

impl<'a, T, S> Send for Difference<'a, T, S>
where + S: Sync, + T: Sync,

§

impl<'a, T, S> Sync for Difference<'a, T, S>
where + S: Sync, + T: Sync,

§

impl<'a, T, S> Unpin for Difference<'a, T, S>

§

impl<'a, T, S> UnwindSafe for Difference<'a, T, S>
where + S: RefUnwindSafe, + T: RefUnwindSafe,

Blanket Implementations§

source§

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

source§

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more
source§

impl<T> Borrow<T> for T
where + T: ?Sized,

source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
source§

impl<T> BorrowMut<T> for T
where + 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 T
where + 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 I
where + 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> ToOwned for T
where + 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 T
where + 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 T
where + 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/indexmap/set/struct.Drain.html b/indexmap/set/struct.Drain.html new file mode 100644 index 0000000000..f9d01c9741 --- /dev/null +++ b/indexmap/set/struct.Drain.html @@ -0,0 +1,213 @@ +Drain in indexmap::set - Rust
+

Struct indexmap::set::Drain

source · 
pub struct Drain<'a, T> { /* private fields */ }
Expand description

A draining iterator over the items of an IndexSet.

+

This struct is created by the IndexSet::drain method. +See its documentation for more.

+

Implementations§

source§

impl<'a, T> Drain<'a, T>

source

pub fn as_slice(&self) -> &Slice<T>

Returns a slice of the remaining entries in the iterator.

+

Trait Implementations§

source§

impl<T: Debug> Debug for Drain<'_, T>

source§

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

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

impl<T> DoubleEndedIterator for Drain<'_, T>

source§

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

Removes and returns an element from the end of the iterator. Read more
source§

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

Returns the nth element from the end of the iterator. Read more
source§

fn advance_back_by(&mut self, n: usize) -> Result<(), NonZero<usize>>

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

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

This is the reverse version of Iterator::try_fold(): it takes +elements starting from the back of the iterator. Read more
1.27.0 · source§

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

An iterator method that reduces the iterator’s elements to a single, +final value, starting from the back. Read more
1.27.0 · source§

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

Searches for an element of an iterator from the back that satisfies a predicate. Read more
source§

impl<T> ExactSizeIterator for Drain<'_, 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<T> Iterator for Drain<'_, T>

§

type Item = 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 count(self) -> usize

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

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

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

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

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

fn collect<C>(self) -> C
where + C: FromIterator<Self::Item>,

Transforms an iterator into a collection. 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
source§

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

🔬This is a nightly-only experimental API. (iter_advance_by)
Advances the iterator by n elements. 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 Self
where + Self: Sized,

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

fn collect_into<E>(self, collection: &mut E) -> &mut E
where + 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 partition_in_place<'a, T, P>(self, predicate: P) -> usize
where + T: 'a, + Self: Sized + DoubleEndedIterator<Item = &'a mut T>, + P: FnMut(&T) -> bool,

🔬This is a nightly-only experimental API. (iter_partition_in_place)
Reorders the elements of this iterator in-place according to the given predicate, +such that all those that return true precede all those that return false. +Returns the number of true elements found. Read more
source§

fn is_partitioned<P>(self, predicate: P) -> bool
where + 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) -> R
where + 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) -> R
where + 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) -> B
where + 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>>>::TryType
where + 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) -> bool
where + 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) -> bool
where + 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>>>::TryType
where + 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 rposition<P>(&mut self, predicate: P) -> Option<usize>
where + P: FnMut(Self::Item) -> bool, + Self: Sized + ExactSizeIterator + DoubleEndedIterator,

Searches for an element in an iterator from the right, 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 rev(self) -> Rev<Self>
where + Self: Sized + DoubleEndedIterator,

Reverses an iterator’s direction. 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) -> S
where + Self: Sized, + S: Sum<Self::Item>,

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

fn product<P>(self) -> P
where + 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) -> Ordering
where + 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) -> bool
where + 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) -> bool
where + 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) -> bool
where + 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) -> bool
where + 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) -> bool
where + 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) -> bool
where + 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) -> bool
where + 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) -> bool
where + Self: Sized, + F: FnMut(&Self::Item, &Self::Item) -> bool,

🔬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) -> bool
where + 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<T> FusedIterator for Drain<'_, T>

Auto Trait Implementations§

§

impl<'a, T> Freeze for Drain<'a, T>

§

impl<'a, T> RefUnwindSafe for Drain<'a, T>
where + T: RefUnwindSafe,

§

impl<'a, T> Send for Drain<'a, T>
where + T: Send,

§

impl<'a, T> Sync for Drain<'a, T>
where + T: Sync,

§

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

§

impl<'a, T> UnwindSafe for Drain<'a, T>
where + T: RefUnwindSafe,

Blanket Implementations§

source§

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

source§

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more
source§

impl<T> Borrow<T> for T
where + T: ?Sized,

source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
source§

impl<T> BorrowMut<T> for T
where + 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 T
where + 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 I
where + 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, U> TryFrom<U> for T
where + 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 T
where + 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/indexmap/set/struct.IndexSet.html b/indexmap/set/struct.IndexSet.html new file mode 100644 index 0000000000..88d04be4cc --- /dev/null +++ b/indexmap/set/struct.IndexSet.html @@ -0,0 +1,481 @@ +IndexSet in indexmap::set - Rust
+

Struct indexmap::set::IndexSet

source · 
pub struct IndexSet<T, S = RandomState> { /* private fields */ }
Expand description

A hash set where the iteration order of the values is independent of their +hash values.

+

The interface is closely compatible with the standard +HashSet, +but also has additional features.

+

§Order

+

The values have a consistent order that is determined by the sequence of +insertion and removal calls on the set. The order does not depend on the +values or the hash function at all. Note that insertion order and value +are not affected if a re-insertion is attempted once an element is +already present.

+

All iterators traverse the set in order. Set operation iterators like +IndexSet::union produce a concatenated order, as do their matching “bitwise” +operators. See their documentation for specifics.

+

The insertion order is preserved, with notable exceptions like the +.remove() or .swap_remove() methods. +Methods such as .sort_by() of +course result in a new order, depending on the sorting order.

+

§Indices

+

The values are indexed in a compact range without holes in the range +0..self.len(). For example, the method .get_full looks up the index for +a value, and the method .get_index looks up the value by index.

+

§Complexity

+

Internally, IndexSet<T, S> just holds an IndexMap<T, (), S>. Thus the complexity +of the two are the same for most methods.

+

§Examples

+
use indexmap::IndexSet;
+
+// Collects which letters appear in a sentence.
+let letters: IndexSet<_> = "a short treatise on fungi".chars().collect();
+
+assert!(letters.contains(&'s'));
+assert!(letters.contains(&'t'));
+assert!(letters.contains(&'u'));
+assert!(!letters.contains(&'y'));
+

Implementations§

source§

impl<T> IndexSet<T>

source

pub fn new() -> Self

Create a new set. (Does not allocate.)

+
source

pub fn with_capacity(n: usize) -> Self

Create a new set with capacity for n elements. +(Does not allocate if n is zero.)

+

Computes in O(n) time.

+
source§

impl<T, S> IndexSet<T, S>

source

pub fn with_capacity_and_hasher(n: usize, hash_builder: S) -> Self

Create a new set with capacity for n elements. +(Does not allocate if n is zero.)

+

Computes in O(n) time.

+
source

pub const fn with_hasher(hash_builder: S) -> Self

Create a new set with hash_builder.

+

This function is const, so it +can be called in static contexts.

+
source

pub fn capacity(&self) -> usize

Return the number of elements the set can hold without reallocating.

+

This number is a lower bound; the set might be able to hold more, +but is guaranteed to be able to hold at least this many.

+

Computes in O(1) time.

+
source

pub fn hasher(&self) -> &S

Return a reference to the set’s BuildHasher.

+
source

pub fn len(&self) -> usize

Return the number of elements in the set.

+

Computes in O(1) time.

+
source

pub fn is_empty(&self) -> bool

Returns true if the set contains no elements.

+

Computes in O(1) time.

+
source

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

Return an iterator over the values of the set, in their order

+
source

pub fn clear(&mut self)

Remove all elements in the set, while preserving its capacity.

+

Computes in O(n) time.

+
source

pub fn truncate(&mut self, len: usize)

Shortens the set, keeping the first len elements and dropping the rest.

+

If len is greater than the set’s current length, this has no effect.

+
source

pub fn drain<R>(&mut self, range: R) -> Drain<'_, T> ⓘ
where + R: RangeBounds<usize>,

Clears the IndexSet in the given index range, returning those values +as a drain iterator.

+

The range may be any type that implements RangeBounds<usize>, +including all of the std::ops::Range* types, or even a tuple pair of +Bound start and end values. To drain the set entirely, use RangeFull +like set.drain(..).

+

This shifts down all entries following the drained range to fill the +gap, and keeps the allocated memory for reuse.

+

Panics if the starting point is greater than the end point or if +the end point is greater than the length of the set.

+
source

pub fn split_off(&mut self, at: usize) -> Self
where + S: Clone,

Splits the collection into two at the given index.

+

Returns a newly allocated set containing the elements in the range +[at, len). After the call, the original set will be left containing +the elements [0, at) with its previous capacity unchanged.

+

Panics if at > len.

+
source

pub fn reserve(&mut self, additional: usize)

Reserve capacity for additional more values.

+

Computes in O(n) time.

+
source

pub fn reserve_exact(&mut self, additional: usize)

Reserve capacity for additional more values, without over-allocating.

+

Unlike reserve, this does not deliberately over-allocate the entry capacity to avoid +frequent re-allocations. However, the underlying data structures may still have internal +capacity requirements, and the allocator itself may give more space than requested, so this +cannot be relied upon to be precisely minimal.

+

Computes in O(n) time.

+
source

pub fn try_reserve(&mut self, additional: usize) -> Result<(), TryReserveError>

Try to reserve capacity for additional more values.

+

Computes in O(n) time.

+
source

pub fn try_reserve_exact( + &mut self, + additional: usize +) -> Result<(), TryReserveError>

Try to reserve capacity for additional more values, without over-allocating.

+

Unlike try_reserve, this does not deliberately over-allocate the entry capacity to avoid +frequent re-allocations. However, the underlying data structures may still have internal +capacity requirements, and the allocator itself may give more space than requested, so this +cannot be relied upon to be precisely minimal.

+

Computes in O(n) time.

+
source

pub fn shrink_to_fit(&mut self)

Shrink the capacity of the set as much as possible.

+

Computes in O(n) time.

+
source

pub fn shrink_to(&mut self, min_capacity: usize)

Shrink the capacity of the set with a lower limit.

+

Computes in O(n) time.

+
source§

impl<T, S> IndexSet<T, S>
where + T: Hash + Eq, + S: BuildHasher,

source

pub fn insert(&mut self, value: T) -> bool

Insert the value into the set.

+

If an equivalent item already exists in the set, it returns +false leaving the original value in the set and without +altering its insertion order. Otherwise, it inserts the new +item and returns true.

+

Computes in O(1) time (amortized average).

+
source

pub fn insert_full(&mut self, value: T) -> (usize, bool)

Insert the value into the set, and get its index.

+

If an equivalent item already exists in the set, it returns +the index of the existing item and false, leaving the +original value in the set and without altering its insertion +order. Otherwise, it inserts the new item and returns the index +of the inserted item and true.

+

Computes in O(1) time (amortized average).

+
source

pub fn insert_sorted(&mut self, value: T) -> (usize, bool)
where + T: Ord,

Insert the value into the set at its ordered position among sorted values.

+

This is equivalent to finding the position with +binary_search, and if needed calling +shift_insert for a new value.

+

If the sorted item is found in the set, it returns the index of that +existing item and false, without any change. Otherwise, it inserts the +new item and returns its sorted index and true.

+

If the existing items are not already sorted, then the insertion +index is unspecified (like slice::binary_search), but the value +is moved to or inserted at that position regardless.

+

Computes in O(n) time (average). Instead of repeating calls to +insert_sorted, it may be faster to call batched insert +or extend and only call sort or +sort_unstable once.

+
source

pub fn shift_insert(&mut self, index: usize, value: T) -> bool

Insert the value into the set at the given index.

+

If an equivalent item already exists in the set, it returns +false leaving the original value in the set, but moving it to +the new position in the set. Otherwise, it inserts the new +item at the given index and returns true.

+

Panics if index is out of bounds.

+

Computes in O(n) time (average).

+
source

pub fn replace(&mut self, value: T) -> Option<T>

Adds a value to the set, replacing the existing value, if any, that is +equal to the given one, without altering its insertion order. Returns +the replaced value.

+

Computes in O(1) time (average).

+
source

pub fn replace_full(&mut self, value: T) -> (usize, Option<T>)

Adds a value to the set, replacing the existing value, if any, that is +equal to the given one, without altering its insertion order. Returns +the index of the item and its replaced value.

+

Computes in O(1) time (average).

+
source

pub fn difference<'a, S2>( + &'a self, + other: &'a IndexSet<T, S2> +) -> Difference<'a, T, S2> ⓘ
where + S2: BuildHasher,

Return an iterator over the values that are in self but not other.

+

Values are produced in the same order that they appear in self.

+
source

pub fn symmetric_difference<'a, S2>( + &'a self, + other: &'a IndexSet<T, S2> +) -> SymmetricDifference<'a, T, S, S2> ⓘ
where + S2: BuildHasher,

Return an iterator over the values that are in self or other, +but not in both.

+

Values from self are produced in their original order, followed by +values from other in their original order.

+
source

pub fn intersection<'a, S2>( + &'a self, + other: &'a IndexSet<T, S2> +) -> Intersection<'a, T, S2> ⓘ
where + S2: BuildHasher,

Return an iterator over the values that are in both self and other.

+

Values are produced in the same order that they appear in self.

+
source

pub fn union<'a, S2>(&'a self, other: &'a IndexSet<T, S2>) -> Union<'a, T, S> ⓘ
where + S2: BuildHasher,

Return an iterator over all values that are in self or other.

+

Values from self are produced in their original order, followed by +values that are unique to other in their original order.

+
source

pub fn splice<R, I>( + &mut self, + range: R, + replace_with: I +) -> Splice<'_, I::IntoIter, T, S> ⓘ
where + R: RangeBounds<usize>, + I: IntoIterator<Item = T>,

Creates a splicing iterator that replaces the specified range in the set +with the given replace_with iterator and yields the removed items. +replace_with does not need to be the same length as range.

+

The range is removed even if the iterator is not consumed until the +end. It is unspecified how many elements are removed from the set if the +Splice value is leaked.

+

The input iterator replace_with is only consumed when the Splice +value is dropped. If a value from the iterator matches an existing entry +in the set (outside of range), then the original will be unchanged. +Otherwise, the new value will be inserted in the replaced range.

+

Panics if the starting point is greater than the end point or if +the end point is greater than the length of the set.

+
§Examples
+
use indexmap::IndexSet;
+
+let mut set = IndexSet::from([0, 1, 2, 3, 4]);
+let new = [5, 4, 3, 2, 1];
+let removed: Vec<_> = set.splice(2..4, new).collect();
+
+// 1 and 4 kept their positions, while 5, 3, and 2 were newly inserted.
+assert!(set.into_iter().eq([0, 1, 5, 3, 2, 4]));
+assert_eq!(removed, &[2, 3]);
+
source§

impl<T, S> IndexSet<T, S>
where + S: BuildHasher,

source

pub fn contains<Q>(&self, value: &Q) -> bool
where + Q: ?Sized + Hash + Equivalent<T>,

Return true if an equivalent to value exists in the set.

+

Computes in O(1) time (average).

+
source

pub fn get<Q>(&self, value: &Q) -> Option<&T>
where + Q: ?Sized + Hash + Equivalent<T>,

Return a reference to the value stored in the set, if it is present, +else None.

+

Computes in O(1) time (average).

+
source

pub fn get_full<Q>(&self, value: &Q) -> Option<(usize, &T)>
where + Q: ?Sized + Hash + Equivalent<T>,

Return item index and value

+
source

pub fn get_index_of<Q>(&self, value: &Q) -> Option<usize>
where + Q: ?Sized + Hash + Equivalent<T>,

Return item index, if it exists in the set

+

Computes in O(1) time (average).

+
source

pub fn remove<Q>(&mut self, value: &Q) -> bool
where + Q: ?Sized + Hash + Equivalent<T>,

👎Deprecated: remove disrupts the set order – use swap_remove or shift_remove for explicit behavior.

Remove the value from the set, and return true if it was present.

+

NOTE: This is equivalent to .swap_remove(value), replacing this +value’s position with the last element, and it is deprecated in favor of calling that +explicitly. If you need to preserve the relative order of the values in the set, use +.shift_remove(value) instead.

+
source

pub fn swap_remove<Q>(&mut self, value: &Q) -> bool
where + Q: ?Sized + Hash + Equivalent<T>,

Remove the value from the set, and return true if it was present.

+

Like Vec::swap_remove, the value is removed by swapping it with the +last element of the set and popping it off. This perturbs +the position of what used to be the last element!

+

Return false if value was not in the set.

+

Computes in O(1) time (average).

+
source

pub fn shift_remove<Q>(&mut self, value: &Q) -> bool
where + Q: ?Sized + Hash + Equivalent<T>,

Remove the value from the set, and return true if it was present.

+

Like Vec::remove, the value is removed by shifting all of the +elements that follow it, preserving their relative order. +This perturbs the index of all of those elements!

+

Return false if value was not in the set.

+

Computes in O(n) time (average).

+
source

pub fn take<Q>(&mut self, value: &Q) -> Option<T>
where + Q: ?Sized + Hash + Equivalent<T>,

👎Deprecated: take disrupts the set order – use swap_take or shift_take for explicit behavior.

Removes and returns the value in the set, if any, that is equal to the +given one.

+

NOTE: This is equivalent to .swap_take(value), replacing this +value’s position with the last element, and it is deprecated in favor of calling that +explicitly. If you need to preserve the relative order of the values in the set, use +.shift_take(value) instead.

+
source

pub fn swap_take<Q>(&mut self, value: &Q) -> Option<T>
where + Q: ?Sized + Hash + Equivalent<T>,

Removes and returns the value in the set, if any, that is equal to the +given one.

+

Like Vec::swap_remove, the value is removed by swapping it with the +last element of the set and popping it off. This perturbs +the position of what used to be the last element!

+

Return None if value was not in the set.

+

Computes in O(1) time (average).

+
source

pub fn shift_take<Q>(&mut self, value: &Q) -> Option<T>
where + Q: ?Sized + Hash + Equivalent<T>,

Removes and returns the value in the set, if any, that is equal to the +given one.

+

Like Vec::remove, the value is removed by shifting all of the +elements that follow it, preserving their relative order. +This perturbs the index of all of those elements!

+

Return None if value was not in the set.

+

Computes in O(n) time (average).

+
source

pub fn swap_remove_full<Q>(&mut self, value: &Q) -> Option<(usize, T)>
where + Q: ?Sized + Hash + Equivalent<T>,

Remove the value from the set return it and the index it had.

+

Like Vec::swap_remove, the value is removed by swapping it with the +last element of the set and popping it off. This perturbs +the position of what used to be the last element!

+

Return None if value was not in the set.

+
source

pub fn shift_remove_full<Q>(&mut self, value: &Q) -> Option<(usize, T)>
where + Q: ?Sized + Hash + Equivalent<T>,

Remove the value from the set return it and the index it had.

+

Like Vec::remove, the value is removed by shifting all of the +elements that follow it, preserving their relative order. +This perturbs the index of all of those elements!

+

Return None if value was not in the set.

+
source§

impl<T, S> IndexSet<T, S>

source

pub fn pop(&mut self) -> Option<T>

Remove the last value

+

This preserves the order of the remaining elements.

+

Computes in O(1) time (average).

+
source

pub fn retain<F>(&mut self, keep: F)
where + F: FnMut(&T) -> bool,

Scan through each value in the set and keep those where the +closure keep returns true.

+

The elements are visited in order, and remaining elements keep their +order.

+

Computes in O(n) time (average).

+
source

pub fn sort(&mut self)
where + T: Ord,

Sort the set’s values by their default ordering.

+

This is a stable sort – but equivalent values should not normally coexist in +a set at all, so sort_unstable is preferred +because it is generally faster and doesn’t allocate auxiliary memory.

+

See sort_by for details.

+
source

pub fn sort_by<F>(&mut self, cmp: F)
where + F: FnMut(&T, &T) -> Ordering,

Sort the set’s values in place using the comparison function cmp.

+

Computes in O(n log n) time and O(n) space. The sort is stable.

+
source

pub fn sorted_by<F>(self, cmp: F) -> IntoIter<T> ⓘ
where + F: FnMut(&T, &T) -> Ordering,

Sort the values of the set and return a by-value iterator of +the values with the result.

+

The sort is stable.

+
source

pub fn sort_unstable(&mut self)
where + T: Ord,

Sort the set’s values by their default ordering.

+

See sort_unstable_by for details.

+
source

pub fn sort_unstable_by<F>(&mut self, cmp: F)
where + F: FnMut(&T, &T) -> Ordering,

Sort the set’s values in place using the comparison function cmp.

+

Computes in O(n log n) time. The sort is unstable.

+
source

pub fn sorted_unstable_by<F>(self, cmp: F) -> IntoIter<T> ⓘ
where + F: FnMut(&T, &T) -> Ordering,

Sort the values of the set and return a by-value iterator of +the values with the result.

+
source

pub fn sort_by_cached_key<K, F>(&mut self, sort_key: F)
where + K: Ord, + F: FnMut(&T) -> K,

Sort the set’s values in place using a key extraction function.

+

During sorting, the function is called at most once per entry, by using temporary storage +to remember the results of its evaluation. The order of calls to the function is +unspecified and may change between versions of indexmap or the standard library.

+

Computes in O(m n + n log n + c) time () and O(n) space, where the function is +O(m), n is the length of the map, and c the capacity. The sort is stable.

+

Search over a sorted set for a value.

+

Returns the position where that value is present, or the position where it can be inserted +to maintain the sort. See slice::binary_search for more details.

+

Computes in O(log(n)) time, which is notably less scalable than looking the value up +using get_index_of, but this can also position missing values.

+
source

pub fn binary_search_by<'a, F>(&'a self, f: F) -> Result<usize, usize>
where + F: FnMut(&'a T) -> Ordering,

Search over a sorted set with a comparator function.

+

Returns the position where that value is present, or the position where it can be inserted +to maintain the sort. See slice::binary_search_by for more details.

+

Computes in O(log(n)) time.

+
source

pub fn binary_search_by_key<'a, B, F>( + &'a self, + b: &B, + f: F +) -> Result<usize, usize>
where + F: FnMut(&'a T) -> B, + B: Ord,

Search over a sorted set with an extraction function.

+

Returns the position where that value is present, or the position where it can be inserted +to maintain the sort. See slice::binary_search_by_key for more details.

+

Computes in O(log(n)) time.

+
source

pub fn partition_point<P>(&self, pred: P) -> usize
where + P: FnMut(&T) -> bool,

Returns the index of the partition point of a sorted set according to the given predicate +(the index of the first element of the second partition).

+

See slice::partition_point for more details.

+

Computes in O(log(n)) time.

+
source

pub fn reverse(&mut self)

Reverses the order of the set’s values in place.

+

Computes in O(n) time and O(1) space.

+
source

pub fn as_slice(&self) -> &Slice<T>

Returns a slice of all the values in the set.

+

Computes in O(1) time.

+
source

pub fn into_boxed_slice(self) -> Box<Slice<T>>

Converts into a boxed slice of all the values in the set.

+

Note that this will drop the inner hash table and any excess capacity.

+
source

pub fn get_index(&self, index: usize) -> Option<&T>

Get a value by index

+

Valid indices are 0 <= index < self.len()

+

Computes in O(1) time.

+
source

pub fn get_range<R: RangeBounds<usize>>(&self, range: R) -> Option<&Slice<T>>

Returns a slice of values in the given range of indices.

+

Valid indices are 0 <= index < self.len()

+

Computes in O(1) time.

+
source

pub fn first(&self) -> Option<&T>

Get the first value

+

Computes in O(1) time.

+
source

pub fn last(&self) -> Option<&T>

Get the last value

+

Computes in O(1) time.

+
source

pub fn swap_remove_index(&mut self, index: usize) -> Option<T>

Remove the value by index

+

Valid indices are 0 <= index < self.len()

+

Like Vec::swap_remove, the value is removed by swapping it with the +last element of the set and popping it off. This perturbs +the position of what used to be the last element!

+

Computes in O(1) time (average).

+
source

pub fn shift_remove_index(&mut self, index: usize) -> Option<T>

Remove the value by index

+

Valid indices are 0 <= index < self.len()

+

Like Vec::remove, the value is removed by shifting all of the +elements that follow it, preserving their relative order. +This perturbs the index of all of those elements!

+

Computes in O(n) time (average).

+
source

pub fn move_index(&mut self, from: usize, to: usize)

Moves the position of a value from one index to another +by shifting all other values in-between.

+
    +
  • If from < to, the other values will shift down while the targeted value moves up.
    • +
  • If from > to, the other values will shift up while the targeted value moves down.
    • +
+

Panics if from or to are out of bounds.

+

Computes in O(n) time (average).

+
source

pub fn swap_indices(&mut self, a: usize, b: usize)

Swaps the position of two values in the set.

+

Panics if a or b are out of bounds.

+

Computes in O(1) time (average).

+
source§

impl<T, S> IndexSet<T, S>
where + T: Eq + Hash, + S: BuildHasher,

source

pub fn is_disjoint<S2>(&self, other: &IndexSet<T, S2>) -> bool
where + S2: BuildHasher,

Returns true if self has no elements in common with other.

+
source

pub fn is_subset<S2>(&self, other: &IndexSet<T, S2>) -> bool
where + S2: BuildHasher,

Returns true if all elements of self are contained in other.

+
source

pub fn is_superset<S2>(&self, other: &IndexSet<T, S2>) -> bool
where + S2: BuildHasher,

Returns true if all elements of other are contained in self.

+

Trait Implementations§

source§

impl<T, S1, S2> BitAnd<&IndexSet<T, S2>> for &IndexSet<T, S1>
where + T: Eq + Hash + Clone, + S1: BuildHasher + Default, + S2: BuildHasher,

source§

fn bitand(self, other: &IndexSet<T, S2>) -> Self::Output

Returns the set intersection, cloned into a new set.

+

Values are collected in the same order that they appear in self.

+
§

type Output = IndexSet<T, S1>

The resulting type after applying the & operator.
source§

impl<T, S1, S2> BitOr<&IndexSet<T, S2>> for &IndexSet<T, S1>
where + T: Eq + Hash + Clone, + S1: BuildHasher + Default, + S2: BuildHasher,

source§

fn bitor(self, other: &IndexSet<T, S2>) -> Self::Output

Returns the set union, cloned into a new set.

+

Values from self are collected in their original order, followed by +values that are unique to other in their original order.

+
§

type Output = IndexSet<T, S1>

The resulting type after applying the | operator.
source§

impl<T, S1, S2> BitXor<&IndexSet<T, S2>> for &IndexSet<T, S1>
where + T: Eq + Hash + Clone, + S1: BuildHasher + Default, + S2: BuildHasher,

source§

fn bitxor(self, other: &IndexSet<T, S2>) -> Self::Output

Returns the set symmetric-difference, cloned into a new set.

+

Values from self are collected in their original order, followed by +values from other in their original order.

+
§

type Output = IndexSet<T, S1>

The resulting type after applying the ^ operator.
source§

impl<T, S> Clone for IndexSet<T, S>
where + T: Clone, + S: Clone,

source§

fn clone(&self) -> Self

Returns a copy of the value. Read more
source§

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

Performs copy-assignment from source. Read more
source§

impl<T, S> Debug for IndexSet<T, S>
where + T: Debug,

source§

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

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

impl<T, S> Default for IndexSet<T, S>
where + S: Default,

source§

fn default() -> Self

Return an empty IndexSet

+
source§

impl<'a, T, S> Extend<&'a T> for IndexSet<T, S>
where + T: Hash + Eq + Copy + 'a, + S: BuildHasher,

source§

fn extend<I: IntoIterator<Item = &'a T>>(&mut self, iterable: I)

Extends a collection with the contents of an iterator. Read more
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<T, S> Extend<T> for IndexSet<T, S>
where + T: Hash + Eq, + S: BuildHasher,

source§

fn extend<I: IntoIterator<Item = T>>(&mut self, iterable: I)

Extends a collection with the contents of an iterator. Read more
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<T, const N: usize> From<[T; N]> for IndexSet<T, RandomState>
where + T: Eq + Hash,

source§

fn from(arr: [T; N]) -> Self

§Examples
+
use indexmap::IndexSet;
+
+let set1 = IndexSet::from([1, 2, 3, 4]);
+let set2: IndexSet<_> = [1, 2, 3, 4].into();
+assert_eq!(set1, set2);
+
source§

impl<T, S> FromIterator<T> for IndexSet<T, S>
where + T: Hash + Eq, + S: BuildHasher + Default,

source§

fn from_iter<I: IntoIterator<Item = T>>(iterable: I) -> Self

Creates a value from an iterator. Read more
source§

impl<T, S> Index<(Bound<usize>, Bound<usize>)> for IndexSet<T, S>

§

type Output = Slice<T>

The returned type after indexing.
source§

fn index(&self, range: (Bound<usize>, Bound<usize>)) -> &Self::Output

Performs the indexing (container[index]) operation. Read more
source§

impl<T, S> Index<Range<usize>> for IndexSet<T, S>

§

type Output = Slice<T>

The returned type after indexing.
source§

fn index(&self, range: Range<usize>) -> &Self::Output

Performs the indexing (container[index]) operation. Read more
source§

impl<T, S> Index<RangeFrom<usize>> for IndexSet<T, S>

§

type Output = Slice<T>

The returned type after indexing.
source§

fn index(&self, range: RangeFrom<usize>) -> &Self::Output

Performs the indexing (container[index]) operation. Read more
source§

impl<T, S> Index<RangeFull> for IndexSet<T, S>

§

type Output = Slice<T>

The returned type after indexing.
source§

fn index(&self, range: RangeFull) -> &Self::Output

Performs the indexing (container[index]) operation. Read more
source§

impl<T, S> Index<RangeInclusive<usize>> for IndexSet<T, S>

§

type Output = Slice<T>

The returned type after indexing.
source§

fn index(&self, range: RangeInclusive<usize>) -> &Self::Output

Performs the indexing (container[index]) operation. Read more
source§

impl<T, S> Index<RangeTo<usize>> for IndexSet<T, S>

§

type Output = Slice<T>

The returned type after indexing.
source§

fn index(&self, range: RangeTo<usize>) -> &Self::Output

Performs the indexing (container[index]) operation. Read more
source§

impl<T, S> Index<RangeToInclusive<usize>> for IndexSet<T, S>

§

type Output = Slice<T>

The returned type after indexing.
source§

fn index(&self, range: RangeToInclusive<usize>) -> &Self::Output

Performs the indexing (container[index]) operation. Read more
source§

impl<T, S> Index<usize> for IndexSet<T, S>

Access IndexSet values at indexed positions.

+

§Examples

+
use indexmap::IndexSet;
+
+let mut set = IndexSet::new();
+for word in "Lorem ipsum dolor sit amet".split_whitespace() {
+    set.insert(word.to_string());
+}
+assert_eq!(set[0], "Lorem");
+assert_eq!(set[1], "ipsum");
+set.reverse();
+assert_eq!(set[0], "amet");
+assert_eq!(set[1], "sit");
+set.sort();
+assert_eq!(set[0], "Lorem");
+assert_eq!(set[1], "amet");
+ +
ⓘ
use indexmap::IndexSet;
+
+let mut set = IndexSet::new();
+set.insert("foo");
+println!("{:?}", set[10]); // panics!
+
source§

fn index(&self, index: usize) -> &T

Returns a reference to the value at the supplied index.

+

Panics if index is out of bounds.

+
§

type Output = T

The returned type after indexing.
source§

impl<'a, T, S> IntoIterator for &'a IndexSet<T, S>

§

type Item = &'a T

The type of the elements being iterated over.
§

type IntoIter = Iter<'a, T>

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<T, S> IntoIterator for IndexSet<T, S>

§

type Item = T

The type of the elements being iterated over.
§

type IntoIter = IntoIter<T>

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<T, S> MutableValues for IndexSet<T, S>
where + S: BuildHasher,

Opt-in mutable access to IndexSet values.

+

See MutableValues for more information.

+
§

type Value = T

source§

fn get_full_mut2<Q>(&mut self, value: &Q) -> Option<(usize, &mut T)>
where + Q: ?Sized + Hash + Equivalent<T>,

Return item index and mutable reference to the value Read more
source§

fn get_index_mut2(&mut self, index: usize) -> Option<&mut T>

Return mutable reference to the value at an index. Read more
source§

fn retain2<F>(&mut self, keep: F)
where + F: FnMut(&mut T) -> bool,

Scan through each value in the set and keep those where the +closure keep returns true. Read more
source§

impl<T, S1, S2> PartialEq<IndexSet<T, S2>> for IndexSet<T, S1>
where + T: Hash + Eq, + S1: BuildHasher, + S2: BuildHasher,

source§

fn eq(&self, other: &IndexSet<T, S2>) -> 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<T, S1, S2> Sub<&IndexSet<T, S2>> for &IndexSet<T, S1>
where + T: Eq + Hash + Clone, + S1: BuildHasher + Default, + S2: BuildHasher,

source§

fn sub(self, other: &IndexSet<T, S2>) -> Self::Output

Returns the set difference, cloned into a new set.

+

Values are collected in the same order that they appear in self.

+
§

type Output = IndexSet<T, S1>

The resulting type after applying the - operator.
source§

impl<T, S> Eq for IndexSet<T, S>
where + T: Eq + Hash, + S: BuildHasher,

Auto Trait Implementations§

§

impl<T, S> Freeze for IndexSet<T, S>
where + S: Freeze,

§

impl<T, S> RefUnwindSafe for IndexSet<T, S>
where + S: RefUnwindSafe, + T: RefUnwindSafe,

§

impl<T, S> Send for IndexSet<T, S>
where + S: Send, + T: Send,

§

impl<T, S> Sync for IndexSet<T, S>
where + S: Sync, + T: Sync,

§

impl<T, S> Unpin for IndexSet<T, S>
where + S: Unpin, + T: Unpin,

§

impl<T, S> UnwindSafe for IndexSet<T, S>
where + S: UnwindSafe, + T: UnwindSafe,

Blanket Implementations§

source§

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

source§

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more
source§

impl<T> Borrow<T> for T
where + T: ?Sized,

source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
source§

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

source§

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

Mutably borrows from an owned value. Read more
source§

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

source§

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

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

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

source§

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 T
where + 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 T
where + 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 T
where + 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 T
where + 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/indexmap/set/struct.Intersection.html b/indexmap/set/struct.Intersection.html new file mode 100644 index 0000000000..4a6ef5c512 --- /dev/null +++ b/indexmap/set/struct.Intersection.html @@ -0,0 +1,226 @@ +Intersection in indexmap::set - Rust
+

Struct indexmap::set::Intersection

source · 
pub struct Intersection<'a, T, S> { /* private fields */ }
Expand description

A lazy iterator producing elements in the intersection of IndexSets.

+

This struct is created by the IndexSet::intersection method. +See its documentation for more.

+

Trait Implementations§

source§

impl<T, S> Clone for Intersection<'_, T, S>

source§

fn clone(&self) -> Self

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<T, S> Debug for Intersection<'_, T, S>
where + T: Debug + Eq + Hash, + S: BuildHasher,

source§

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

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

impl<T, S> DoubleEndedIterator for Intersection<'_, T, S>
where + T: Eq + Hash, + S: BuildHasher,

source§

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

Removes and returns an element from the end of the iterator. Read more
source§

fn advance_back_by(&mut self, n: usize) -> Result<(), NonZero<usize>>

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

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

Returns the nth element from the end of the iterator. Read more
1.27.0 · source§

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

This is the reverse version of Iterator::try_fold(): it takes +elements starting from the back of the iterator. Read more
1.27.0 · source§

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

An iterator method that reduces the iterator’s elements to a single, +final value, starting from the back. Read more
1.27.0 · source§

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

Searches for an element of an iterator from the back that satisfies a predicate. Read more
source§

impl<'a, T, S> Iterator for Intersection<'a, T, S>
where + T: Eq + Hash, + S: BuildHasher,

§

type Item = &'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) -> usize
where + 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<(), NonZero<usize>>

🔬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 Self
where + Self: Sized,

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

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

Transforms an iterator into a collection. Read more
source§

fn collect_into<E>(self, collection: &mut E) -> &mut E
where + 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 partition_in_place<'a, T, P>(self, predicate: P) -> usize
where + T: 'a, + Self: Sized + DoubleEndedIterator<Item = &'a mut T>, + P: FnMut(&T) -> bool,

🔬This is a nightly-only experimental API. (iter_partition_in_place)
Reorders the elements of this iterator in-place according to the given predicate, +such that all those that return true precede all those that return false. +Returns the number of true elements found. Read more
source§

fn is_partitioned<P>(self, predicate: P) -> bool
where + 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) -> R
where + 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) -> R
where + 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) -> B
where + 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>>>::TryType
where + 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) -> bool
where + 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) -> bool
where + 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>>>::TryType
where + 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 rev(self) -> Rev<Self>
where + Self: Sized + DoubleEndedIterator,

Reverses an iterator’s direction. 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
1.0.0 · source§

fn cycle(self) -> Cycle<Self>
where + Self: Sized + Clone,

Repeats an iterator endlessly. 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) -> S
where + Self: Sized, + S: Sum<Self::Item>,

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

fn product<P>(self) -> P
where + 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) -> Ordering
where + 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) -> bool
where + 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) -> bool
where + 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) -> bool
where + 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) -> bool
where + 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) -> bool
where + 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) -> bool
where + 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) -> bool
where + 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) -> bool
where + Self: Sized, + F: FnMut(&Self::Item, &Self::Item) -> bool,

🔬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) -> bool
where + 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<T, S> FusedIterator for Intersection<'_, T, S>
where + T: Eq + Hash, + S: BuildHasher,

Auto Trait Implementations§

§

impl<'a, T, S> Freeze for Intersection<'a, T, S>

§

impl<'a, T, S> RefUnwindSafe for Intersection<'a, T, S>
where + S: RefUnwindSafe, + T: RefUnwindSafe,

§

impl<'a, T, S> Send for Intersection<'a, T, S>
where + S: Sync, + T: Sync,

§

impl<'a, T, S> Sync for Intersection<'a, T, S>
where + S: Sync, + T: Sync,

§

impl<'a, T, S> Unpin for Intersection<'a, T, S>

§

impl<'a, T, S> UnwindSafe for Intersection<'a, T, S>
where + S: RefUnwindSafe, + T: RefUnwindSafe,

Blanket Implementations§

source§

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

source§

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more
source§

impl<T> Borrow<T> for T
where + T: ?Sized,

source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
source§

impl<T> BorrowMut<T> for T
where + 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 T
where + 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 I
where + 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> ToOwned for T
where + 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 T
where + 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 T
where + 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/indexmap/set/struct.IntoIter.html b/indexmap/set/struct.IntoIter.html new file mode 100644 index 0000000000..8b11330428 --- /dev/null +++ b/indexmap/set/struct.IntoIter.html @@ -0,0 +1,214 @@ +IntoIter in indexmap::set - Rust
+

Struct indexmap::set::IntoIter

source · 
pub struct IntoIter<T> { /* private fields */ }
Expand description

An owning iterator over the items of an IndexSet.

+

This struct is created by the IndexSet::into_iter method +(provided by the IntoIterator trait). See its documentation for more.

+

Implementations§

source§

impl<T> IntoIter<T>

source

pub fn as_slice(&self) -> &Slice<T>

Returns a slice of the remaining entries in the iterator.

+

Trait Implementations§

source§

impl<T: Debug> Debug for IntoIter<T>

source§

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

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

impl<T> Default for IntoIter<T>

source§

fn default() -> Self

Returns the “default value” for a type. Read more
source§

impl<T> DoubleEndedIterator for IntoIter<T>

source§

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

Removes and returns an element from the end of the iterator. Read more
source§

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

Returns the nth element from the end of the iterator. Read more
source§

fn advance_back_by(&mut self, n: usize) -> Result<(), NonZero<usize>>

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

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

This is the reverse version of Iterator::try_fold(): it takes +elements starting from the back of the iterator. Read more
1.27.0 · source§

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

An iterator method that reduces the iterator’s elements to a single, +final value, starting from the back. Read more
1.27.0 · source§

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

Searches for an element of an iterator from the back that satisfies a predicate. Read more
source§

impl<T> ExactSizeIterator for IntoIter<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<T> Iterator for IntoIter<T>

§

type Item = 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 count(self) -> usize

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

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

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

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

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

fn collect<C>(self) -> C
where + C: FromIterator<Self::Item>,

Transforms an iterator into a collection. 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
source§

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

🔬This is a nightly-only experimental API. (iter_advance_by)
Advances the iterator by n elements. 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 Self
where + Self: Sized,

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

fn collect_into<E>(self, collection: &mut E) -> &mut E
where + 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 partition_in_place<'a, T, P>(self, predicate: P) -> usize
where + T: 'a, + Self: Sized + DoubleEndedIterator<Item = &'a mut T>, + P: FnMut(&T) -> bool,

🔬This is a nightly-only experimental API. (iter_partition_in_place)
Reorders the elements of this iterator in-place according to the given predicate, +such that all those that return true precede all those that return false. +Returns the number of true elements found. Read more
source§

fn is_partitioned<P>(self, predicate: P) -> bool
where + 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) -> R
where + 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) -> R
where + 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) -> B
where + 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>>>::TryType
where + 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) -> bool
where + 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) -> bool
where + 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>>>::TryType
where + 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 rposition<P>(&mut self, predicate: P) -> Option<usize>
where + P: FnMut(Self::Item) -> bool, + Self: Sized + ExactSizeIterator + DoubleEndedIterator,

Searches for an element in an iterator from the right, 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 rev(self) -> Rev<Self>
where + Self: Sized + DoubleEndedIterator,

Reverses an iterator’s direction. 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) -> S
where + Self: Sized, + S: Sum<Self::Item>,

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

fn product<P>(self) -> P
where + 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) -> Ordering
where + 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) -> bool
where + 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) -> bool
where + 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) -> bool
where + 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) -> bool
where + 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) -> bool
where + 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) -> bool
where + 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) -> bool
where + 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) -> bool
where + Self: Sized, + F: FnMut(&Self::Item, &Self::Item) -> bool,

🔬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) -> bool
where + 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<T> FusedIterator for IntoIter<T>

Auto Trait Implementations§

§

impl<T> Freeze for IntoIter<T>

§

impl<T> RefUnwindSafe for IntoIter<T>
where + T: RefUnwindSafe,

§

impl<T> Send for IntoIter<T>
where + T: Send,

§

impl<T> Sync for IntoIter<T>
where + T: Sync,

§

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

§

impl<T> UnwindSafe for IntoIter<T>
where + T: UnwindSafe + RefUnwindSafe,

Blanket Implementations§

source§

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

source§

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more
source§

impl<T> Borrow<T> for T
where + T: ?Sized,

source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
source§

impl<T> BorrowMut<T> for T
where + 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 T
where + 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 I
where + 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, U> TryFrom<U> for T
where + 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 T
where + 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/indexmap/set/struct.Iter.html b/indexmap/set/struct.Iter.html new file mode 100644 index 0000000000..c377b10c64 --- /dev/null +++ b/indexmap/set/struct.Iter.html @@ -0,0 +1,215 @@ +Iter in indexmap::set - Rust
+

Struct indexmap::set::Iter

source · 
pub struct Iter<'a, T> { /* private fields */ }
Expand description

An iterator over the items of an IndexSet.

+

This struct is created by the IndexSet::iter method. +See its documentation for more.

+

Implementations§

source§

impl<'a, T> Iter<'a, T>

source

pub fn as_slice(&self) -> &'a Slice<T>

Returns a slice of the remaining entries in the iterator.

+

Trait Implementations§

source§

impl<T> Clone for Iter<'_, T>

source§

fn clone(&self) -> Self

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<T: Debug> Debug for Iter<'_, T>

source§

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

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

impl<T> Default for Iter<'_, T>

source§

fn default() -> Self

Returns the “default value” for a type. Read more
source§

impl<T> DoubleEndedIterator for Iter<'_, T>

source§

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

Removes and returns an element from the end of the iterator. Read more
source§

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

Returns the nth element from the end of the iterator. Read more
source§

fn advance_back_by(&mut self, n: usize) -> Result<(), NonZero<usize>>

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

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

This is the reverse version of Iterator::try_fold(): it takes +elements starting from the back of the iterator. Read more
1.27.0 · source§

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

An iterator method that reduces the iterator’s elements to a single, +final value, starting from the back. Read more
1.27.0 · source§

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

Searches for an element of an iterator from the back that satisfies a predicate. Read more
source§

impl<T> ExactSizeIterator for Iter<'_, 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> Iterator for Iter<'a, T>

§

type Item = &'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 count(self) -> usize

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

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

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

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

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

fn collect<C>(self) -> C
where + C: FromIterator<Self::Item>,

Transforms an iterator into a collection. 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
source§

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

🔬This is a nightly-only experimental API. (iter_advance_by)
Advances the iterator by n elements. 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 Self
where + Self: Sized,

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

fn collect_into<E>(self, collection: &mut E) -> &mut E
where + 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 partition_in_place<'a, T, P>(self, predicate: P) -> usize
where + T: 'a, + Self: Sized + DoubleEndedIterator<Item = &'a mut T>, + P: FnMut(&T) -> bool,

🔬This is a nightly-only experimental API. (iter_partition_in_place)
Reorders the elements of this iterator in-place according to the given predicate, +such that all those that return true precede all those that return false. +Returns the number of true elements found. Read more
source§

fn is_partitioned<P>(self, predicate: P) -> bool
where + 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) -> R
where + 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) -> R
where + 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) -> B
where + 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>>>::TryType
where + 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) -> bool
where + 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) -> bool
where + 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>>>::TryType
where + 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 rposition<P>(&mut self, predicate: P) -> Option<usize>
where + P: FnMut(Self::Item) -> bool, + Self: Sized + ExactSizeIterator + DoubleEndedIterator,

Searches for an element in an iterator from the right, 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 rev(self) -> Rev<Self>
where + Self: Sized + DoubleEndedIterator,

Reverses an iterator’s direction. 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
1.0.0 · source§

fn cycle(self) -> Cycle<Self>
where + Self: Sized + Clone,

Repeats an iterator endlessly. 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) -> S
where + Self: Sized, + S: Sum<Self::Item>,

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

fn product<P>(self) -> P
where + 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) -> Ordering
where + 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) -> bool
where + 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) -> bool
where + 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) -> bool
where + 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) -> bool
where + 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) -> bool
where + 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) -> bool
where + 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) -> bool
where + 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) -> bool
where + Self: Sized, + F: FnMut(&Self::Item, &Self::Item) -> bool,

🔬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) -> bool
where + 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<T> FusedIterator for Iter<'_, T>

Auto Trait Implementations§

§

impl<'a, T> Freeze for Iter<'a, T>

§

impl<'a, T> RefUnwindSafe for Iter<'a, T>
where + T: RefUnwindSafe,

§

impl<'a, T> Send for Iter<'a, T>
where + T: Sync,

§

impl<'a, T> Sync for Iter<'a, T>
where + T: Sync,

§

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

§

impl<'a, T> UnwindSafe for Iter<'a, T>
where + T: RefUnwindSafe,

Blanket Implementations§

source§

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

source§

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more
source§

impl<T> Borrow<T> for T
where + T: ?Sized,

source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
source§

impl<T> BorrowMut<T> for T
where + 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 T
where + 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 I
where + 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> ToOwned for T
where + 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 T
where + 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 T
where + 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/indexmap/set/struct.Slice.html b/indexmap/set/struct.Slice.html new file mode 100644 index 0000000000..bb5a8263cf --- /dev/null +++ b/indexmap/set/struct.Slice.html @@ -0,0 +1,69 @@ +Slice in indexmap::set - Rust
+

Struct indexmap::set::Slice

source · 
pub struct Slice<T> { /* private fields */ }
Expand description

A dynamically-sized slice of values in an IndexSet.

+

This supports indexed operations much like a [T] slice, +but not any hashed operations on the values.

+

Unlike IndexSet, Slice does consider the order for PartialEq +and Eq, and it also implements PartialOrd, Ord, and Hash.

+

Implementations§

source§

impl<T> Slice<T>

source

pub const fn new<'a>() -> &'a Self

Returns an empty slice.

+
source

pub const fn len(&self) -> usize

Return the number of elements in the set slice.

+
source

pub const fn is_empty(&self) -> bool

Returns true if the set slice contains no elements.

+
source

pub fn get_index(&self, index: usize) -> Option<&T>

Get a value by index.

+

Valid indices are 0 <= index < self.len()

+
source

pub fn get_range<R: RangeBounds<usize>>(&self, range: R) -> Option<&Self>

Returns a slice of values in the given range of indices.

+

Valid indices are 0 <= index < self.len()

+
source

pub fn first(&self) -> Option<&T>

Get the first value.

+
source

pub fn last(&self) -> Option<&T>

Get the last value.

+
source

pub fn split_at(&self, index: usize) -> (&Self, &Self)

Divides one slice into two at an index.

+

Panics if index > len.

+
source

pub fn split_first(&self) -> Option<(&T, &Self)>

Returns the first value and the rest of the slice, +or None if it is empty.

+
source

pub fn split_last(&self) -> Option<(&T, &Self)>

Returns the last value and the rest of the slice, +or None if it is empty.

+
source

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

Return an iterator over the values of the set slice.

+

Search over a sorted set for a value.

+

Returns the position where that value is present, or the position where it can be inserted +to maintain the sort. See slice::binary_search for more details.

+

Computes in O(log(n)) time, which is notably less scalable than looking the value up in +the set this is a slice from using IndexSet::get_index_of, but this can also position +missing values.

+
source

pub fn binary_search_by<'a, F>(&'a self, f: F) -> Result<usize, usize>
where + F: FnMut(&'a T) -> Ordering,

Search over a sorted set with a comparator function.

+

Returns the position where that value is present, or the position where it can be inserted +to maintain the sort. See slice::binary_search_by for more details.

+

Computes in O(log(n)) time.

+
source

pub fn binary_search_by_key<'a, B, F>( + &'a self, + b: &B, + f: F +) -> Result<usize, usize>
where + F: FnMut(&'a T) -> B, + B: Ord,

Search over a sorted set with an extraction function.

+

Returns the position where that value is present, or the position where it can be inserted +to maintain the sort. See slice::binary_search_by_key for more details.

+

Computes in O(log(n)) time.

+
source

pub fn partition_point<P>(&self, pred: P) -> usize
where + P: FnMut(&T) -> bool,

Returns the index of the partition point of a sorted set according to the given predicate +(the index of the first element of the second partition).

+

See slice::partition_point for more details.

+

Computes in O(log(n)) time.

+

Trait Implementations§

source§

impl<T: Clone> Clone for Box<Slice<T>>

source§

fn clone(&self) -> Self

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<T: Debug> Debug for Slice<T>

source§

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

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

impl<T> Default for &Slice<T>

source§

fn default() -> Self

Returns the “default value” for a type. Read more
source§

impl<T> Default for Box<Slice<T>>

source§

fn default() -> Self

Returns the “default value” for a type. Read more
source§

impl<T: Copy> From<&Slice<T>> for Box<Slice<T>>

source§

fn from(slice: &Slice<T>) -> Self

Converts to this type from the input type.
source§

impl<T: Hash> Hash for Slice<T>

source§

fn hash<H: Hasher>(&self, state: &mut H)

Feeds this value into the given Hasher. Read more
source§

impl<T> Index<(Bound<usize>, Bound<usize>)> for Slice<T>

§

type Output = Slice<T>

The returned type after indexing.
source§

fn index(&self, range: (Bound<usize>, Bound<usize>)) -> &Self::Output

Performs the indexing (container[index]) operation. Read more
source§

impl<T> Index<Range<usize>> for Slice<T>

§

type Output = Slice<T>

The returned type after indexing.
source§

fn index(&self, range: Range<usize>) -> &Self::Output

Performs the indexing (container[index]) operation. Read more
source§

impl<T> Index<RangeFrom<usize>> for Slice<T>

§

type Output = Slice<T>

The returned type after indexing.
source§

fn index(&self, range: RangeFrom<usize>) -> &Self::Output

Performs the indexing (container[index]) operation. Read more
source§

impl<T> Index<RangeFull> for Slice<T>

§

type Output = Slice<T>

The returned type after indexing.
source§

fn index(&self, range: RangeFull) -> &Self::Output

Performs the indexing (container[index]) operation. Read more
source§

impl<T> Index<RangeInclusive<usize>> for Slice<T>

§

type Output = Slice<T>

The returned type after indexing.
source§

fn index(&self, range: RangeInclusive<usize>) -> &Self::Output

Performs the indexing (container[index]) operation. Read more
source§

impl<T> Index<RangeTo<usize>> for Slice<T>

§

type Output = Slice<T>

The returned type after indexing.
source§

fn index(&self, range: RangeTo<usize>) -> &Self::Output

Performs the indexing (container[index]) operation. Read more
source§

impl<T> Index<RangeToInclusive<usize>> for Slice<T>

§

type Output = Slice<T>

The returned type after indexing.
source§

fn index(&self, range: RangeToInclusive<usize>) -> &Self::Output

Performs the indexing (container[index]) operation. Read more
source§

impl<T> Index<usize> for Slice<T>

§

type Output = T

The returned type after indexing.
source§

fn index(&self, index: usize) -> &Self::Output

Performs the indexing (container[index]) operation. Read more
source§

impl<'a, T> IntoIterator for &'a Slice<T>

§

type IntoIter = Iter<'a, T>

Which kind of iterator are we turning this into?
§

type Item = &'a T

The type of the elements being iterated over.
source§

fn into_iter(self) -> Self::IntoIter

Creates an iterator from a value. Read more
source§

impl<T> IntoIterator for Box<Slice<T>>

§

type IntoIter = IntoIter<T>

Which kind of iterator are we turning this into?
§

type Item = T

The type of the elements being iterated over.
source§

fn into_iter(self) -> Self::IntoIter

Creates an iterator from a value. Read more
source§

impl<T: Ord> Ord for Slice<T>

source§

fn cmp(&self, other: &Self) -> Ordering

This method returns an Ordering between self and other. Read more
source§

impl<T: PartialEq> PartialEq for Slice<T>

source§

fn eq(&self, other: &Self) -> 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<T: PartialOrd> PartialOrd for Slice<T>

source§

fn partial_cmp(&self, other: &Self) -> 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<T: Eq> Eq for Slice<T>

Auto Trait Implementations§

§

impl<T> Freeze for Slice<T>
where + T: Freeze,

§

impl<T> RefUnwindSafe for Slice<T>
where + T: RefUnwindSafe,

§

impl<T> Send for Slice<T>
where + T: Send,

§

impl<T> !Sized for Slice<T>

§

impl<T> Sync for Slice<T>
where + T: Sync,

§

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

§

impl<T> UnwindSafe for Slice<T>
where + T: UnwindSafe,

Blanket Implementations§

source§

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

source§

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more
source§

impl<T> Borrow<T> for T
where + T: ?Sized,

source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
source§

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

source§

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

Mutably borrows from an owned value. Read more
source§

impl<Q, K> Comparable<K> for Q
where + Q: Ord + ?Sized, + K: Borrow<Q> + ?Sized,

source§

fn compare(&self, key: &K) -> Ordering

Compare self to key and return their ordering.
source§

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

source§

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

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

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

source§

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

Compare self to key and return true if they are equal.
\ No newline at end of file diff --git a/indexmap/set/struct.Splice.html b/indexmap/set/struct.Splice.html new file mode 100644 index 0000000000..61f23a5348 --- /dev/null +++ b/indexmap/set/struct.Splice.html @@ -0,0 +1,241 @@ +Splice in indexmap::set - Rust
+

Struct indexmap::set::Splice

source · 
pub struct Splice<'a, I, T, S>
where
+    I: Iterator<Item = T>,
+    T: Hash + Eq,
+    S: BuildHasher,
{ /* private fields */ }
Expand description

A splicing iterator for IndexSet.

+

This struct is created by IndexSet::splice(). +See its documentation for more.

+

Trait Implementations§

source§

impl<'a, I, T, S> Debug for Splice<'a, I, T, S>
where + I: Debug + Iterator<Item = T>, + T: Debug + Hash + Eq, + S: BuildHasher,

source§

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

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

impl<I, T, S> DoubleEndedIterator for Splice<'_, I, T, S>
where + I: Iterator<Item = T>, + T: Hash + Eq, + S: BuildHasher,

source§

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

Removes and returns an element from the end of the iterator. Read more
source§

fn advance_back_by(&mut self, n: usize) -> Result<(), NonZero<usize>>

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

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

Returns the nth element from the end of the iterator. Read more
1.27.0 · source§

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

This is the reverse version of Iterator::try_fold(): it takes +elements starting from the back of the iterator. Read more
1.27.0 · source§

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

An iterator method that reduces the iterator’s elements to a single, +final value, starting from the back. Read more
1.27.0 · source§

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

Searches for an element of an iterator from the back that satisfies a predicate. Read more
source§

impl<I, T, S> ExactSizeIterator for Splice<'_, I, T, S>
where + I: Iterator<Item = T>, + T: Hash + Eq, + S: BuildHasher,

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<I, T, S> Iterator for Splice<'_, I, T, S>
where + I: Iterator<Item = T>, + T: Hash + Eq, + S: BuildHasher,

§

type Item = 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) -> usize
where + 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<(), NonZero<usize>>

🔬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 Self
where + Self: Sized,

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

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

Transforms an iterator into a collection. Read more
source§

fn collect_into<E>(self, collection: &mut E) -> &mut E
where + 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 partition_in_place<'a, T, P>(self, predicate: P) -> usize
where + T: 'a, + Self: Sized + DoubleEndedIterator<Item = &'a mut T>, + P: FnMut(&T) -> bool,

🔬This is a nightly-only experimental API. (iter_partition_in_place)
Reorders the elements of this iterator in-place according to the given predicate, +such that all those that return true precede all those that return false. +Returns the number of true elements found. Read more
source§

fn is_partitioned<P>(self, predicate: P) -> bool
where + 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) -> R
where + 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) -> R
where + 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) -> B
where + 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>>>::TryType
where + 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) -> bool
where + 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) -> bool
where + 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>>>::TryType
where + 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 rposition<P>(&mut self, predicate: P) -> Option<usize>
where + P: FnMut(Self::Item) -> bool, + Self: Sized + ExactSizeIterator + DoubleEndedIterator,

Searches for an element in an iterator from the right, 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 rev(self) -> Rev<Self>
where + Self: Sized + DoubleEndedIterator,

Reverses an iterator’s direction. 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) -> S
where + Self: Sized, + S: Sum<Self::Item>,

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

fn product<P>(self) -> P
where + 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) -> Ordering
where + 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) -> bool
where + 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) -> bool
where + 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) -> bool
where + 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) -> bool
where + 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) -> bool
where + 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) -> bool
where + 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) -> bool
where + 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) -> bool
where + Self: Sized, + F: FnMut(&Self::Item, &Self::Item) -> bool,

🔬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) -> bool
where + 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<I, T, S> FusedIterator for Splice<'_, I, T, S>
where + I: Iterator<Item = T>, + T: Hash + Eq, + S: BuildHasher,

Auto Trait Implementations§

§

impl<'a, I, T, S> Freeze for Splice<'a, I, T, S>
where + I: Freeze,

§

impl<'a, I, T, S> RefUnwindSafe for Splice<'a, I, T, S>
where + I: RefUnwindSafe, + S: RefUnwindSafe, + T: RefUnwindSafe,

§

impl<'a, I, T, S> Send for Splice<'a, I, T, S>
where + I: Send, + S: Send, + T: Send,

§

impl<'a, I, T, S> Sync for Splice<'a, I, T, S>
where + I: Sync, + S: Sync, + T: Sync,

§

impl<'a, I, T, S> Unpin for Splice<'a, I, T, S>
where + I: Unpin, + T: Unpin,

§

impl<'a, I, T, S> !UnwindSafe for Splice<'a, I, T, S>

Blanket Implementations§

source§

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

source§

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more
source§

impl<T> Borrow<T> for T
where + T: ?Sized,

source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
source§

impl<T> BorrowMut<T> for T
where + 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 T
where + 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 I
where + 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, U> TryFrom<U> for T
where + 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 T
where + 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/indexmap/set/struct.SymmetricDifference.html b/indexmap/set/struct.SymmetricDifference.html new file mode 100644 index 0000000000..5203260860 --- /dev/null +++ b/indexmap/set/struct.SymmetricDifference.html @@ -0,0 +1,232 @@ +SymmetricDifference in indexmap::set - Rust
+

Struct indexmap::set::SymmetricDifference

source · 
pub struct SymmetricDifference<'a, T, S1, S2> { /* private fields */ }
Expand description

A lazy iterator producing elements in the symmetric difference of IndexSets.

+

This struct is created by the IndexSet::symmetric_difference method. +See its documentation for more.

+

Trait Implementations§

source§

impl<T, S1, S2> Clone for SymmetricDifference<'_, T, S1, S2>

source§

fn clone(&self) -> Self

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<T, S1, S2> Debug for SymmetricDifference<'_, T, S1, S2>
where + T: Debug + Eq + Hash, + S1: BuildHasher, + S2: BuildHasher,

source§

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

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

impl<T, S1, S2> DoubleEndedIterator for SymmetricDifference<'_, T, S1, S2>
where + T: Eq + Hash, + S1: BuildHasher, + S2: BuildHasher,

source§

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

Removes and returns an element from the end of the iterator. Read more
source§

fn rfold<B, F>(self, init: B, f: F) -> B
where + F: FnMut(B, Self::Item) -> B,

An iterator method that reduces the iterator’s elements to a single, +final value, starting from the back. Read more
source§

fn advance_back_by(&mut self, n: usize) -> Result<(), NonZero<usize>>

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

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

Returns the nth element from the end of the iterator. Read more
1.27.0 · source§

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

This is the reverse version of Iterator::try_fold(): it takes +elements starting from the back of the iterator. Read more
1.27.0 · source§

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

Searches for an element of an iterator from the back that satisfies a predicate. Read more
source§

impl<'a, T, S1, S2> Iterator for SymmetricDifference<'a, T, S1, S2>
where + T: Eq + Hash, + S1: BuildHasher, + S2: BuildHasher,

§

type Item = &'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 fold<B, F>(self, init: B, f: F) -> B
where + F: FnMut(B, Self::Item) -> B,

Folds every element into an accumulator by applying an operation, +returning the final result. 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) -> usize
where + 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<(), NonZero<usize>>

🔬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 Self
where + Self: Sized,

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

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

Transforms an iterator into a collection. Read more
source§

fn collect_into<E>(self, collection: &mut E) -> &mut E
where + 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 partition_in_place<'a, T, P>(self, predicate: P) -> usize
where + T: 'a, + Self: Sized + DoubleEndedIterator<Item = &'a mut T>, + P: FnMut(&T) -> bool,

🔬This is a nightly-only experimental API. (iter_partition_in_place)
Reorders the elements of this iterator in-place according to the given predicate, +such that all those that return true precede all those that return false. +Returns the number of true elements found. Read more
source§

fn is_partitioned<P>(self, predicate: P) -> bool
where + 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) -> R
where + 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) -> R
where + 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.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>>>::TryType
where + 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) -> bool
where + 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) -> bool
where + 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>>>::TryType
where + 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 rev(self) -> Rev<Self>
where + Self: Sized + DoubleEndedIterator,

Reverses an iterator’s direction. 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
1.0.0 · source§

fn cycle(self) -> Cycle<Self>
where + Self: Sized + Clone,

Repeats an iterator endlessly. 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) -> S
where + Self: Sized, + S: Sum<Self::Item>,

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

fn product<P>(self) -> P
where + 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) -> Ordering
where + 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) -> bool
where + 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) -> bool
where + 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) -> bool
where + 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) -> bool
where + 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) -> bool
where + 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) -> bool
where + 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) -> bool
where + 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) -> bool
where + Self: Sized, + F: FnMut(&Self::Item, &Self::Item) -> bool,

🔬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) -> bool
where + 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<T, S1, S2> FusedIterator for SymmetricDifference<'_, T, S1, S2>
where + T: Eq + Hash, + S1: BuildHasher, + S2: BuildHasher,

Auto Trait Implementations§

§

impl<'a, T, S1, S2> Freeze for SymmetricDifference<'a, T, S1, S2>

§

impl<'a, T, S1, S2> RefUnwindSafe for SymmetricDifference<'a, T, S1, S2>
where + S1: RefUnwindSafe, + S2: RefUnwindSafe, + T: RefUnwindSafe,

§

impl<'a, T, S1, S2> Send for SymmetricDifference<'a, T, S1, S2>
where + S1: Sync, + S2: Sync, + T: Sync,

§

impl<'a, T, S1, S2> Sync for SymmetricDifference<'a, T, S1, S2>
where + S1: Sync, + S2: Sync, + T: Sync,

§

impl<'a, T, S1, S2> Unpin for SymmetricDifference<'a, T, S1, S2>

§

impl<'a, T, S1, S2> UnwindSafe for SymmetricDifference<'a, T, S1, S2>
where + S1: RefUnwindSafe, + S2: RefUnwindSafe, + T: RefUnwindSafe,

Blanket Implementations§

source§

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

source§

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more
source§

impl<T> Borrow<T> for T
where + T: ?Sized,

source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
source§

impl<T> BorrowMut<T> for T
where + 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 T
where + 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 I
where + 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> ToOwned for T
where + 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 T
where + 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 T
where + 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/indexmap/set/struct.Union.html b/indexmap/set/struct.Union.html new file mode 100644 index 0000000000..1f65843387 --- /dev/null +++ b/indexmap/set/struct.Union.html @@ -0,0 +1,224 @@ +Union in indexmap::set - Rust
+

Struct indexmap::set::Union

source · 
pub struct Union<'a, T, S> { /* private fields */ }
Expand description

A lazy iterator producing elements in the union of IndexSets.

+

This struct is created by the IndexSet::union method. +See its documentation for more.

+

Trait Implementations§

source§

impl<T, S> Clone for Union<'_, T, S>

source§

fn clone(&self) -> Self

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<T, S> Debug for Union<'_, T, S>
where + T: Debug + Eq + Hash, + S: BuildHasher,

source§

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

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

impl<T, S> DoubleEndedIterator for Union<'_, T, S>
where + T: Eq + Hash, + S: BuildHasher,

source§

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

Removes and returns an element from the end of the iterator. Read more
source§

fn rfold<B, F>(self, init: B, f: F) -> B
where + F: FnMut(B, Self::Item) -> B,

An iterator method that reduces the iterator’s elements to a single, +final value, starting from the back. Read more
source§

fn advance_back_by(&mut self, n: usize) -> Result<(), NonZero<usize>>

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

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

Returns the nth element from the end of the iterator. Read more
1.27.0 · source§

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

This is the reverse version of Iterator::try_fold(): it takes +elements starting from the back of the iterator. Read more
1.27.0 · source§

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

Searches for an element of an iterator from the back that satisfies a predicate. Read more
source§

impl<'a, T, S> Iterator for Union<'a, T, S>
where + T: Eq + Hash, + S: BuildHasher,

§

type Item = &'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 fold<B, F>(self, init: B, f: F) -> B
where + F: FnMut(B, Self::Item) -> B,

Folds every element into an accumulator by applying an operation, +returning the final result. 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) -> usize
where + 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<(), NonZero<usize>>

🔬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 Self
where + Self: Sized,

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

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

Transforms an iterator into a collection. Read more
source§

fn collect_into<E>(self, collection: &mut E) -> &mut E
where + 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 partition_in_place<'a, T, P>(self, predicate: P) -> usize
where + T: 'a, + Self: Sized + DoubleEndedIterator<Item = &'a mut T>, + P: FnMut(&T) -> bool,

🔬This is a nightly-only experimental API. (iter_partition_in_place)
Reorders the elements of this iterator in-place according to the given predicate, +such that all those that return true precede all those that return false. +Returns the number of true elements found. Read more
source§

fn is_partitioned<P>(self, predicate: P) -> bool
where + 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) -> R
where + 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) -> R
where + 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.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>>>::TryType
where + 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) -> bool
where + 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) -> bool
where + 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>>>::TryType
where + 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 rev(self) -> Rev<Self>
where + Self: Sized + DoubleEndedIterator,

Reverses an iterator’s direction. 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
1.0.0 · source§

fn cycle(self) -> Cycle<Self>
where + Self: Sized + Clone,

Repeats an iterator endlessly. 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) -> S
where + Self: Sized, + S: Sum<Self::Item>,

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

fn product<P>(self) -> P
where + 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) -> Ordering
where + 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) -> bool
where + 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) -> bool
where + 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) -> bool
where + 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) -> bool
where + 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) -> bool
where + 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) -> bool
where + 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) -> bool
where + 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) -> bool
where + Self: Sized, + F: FnMut(&Self::Item, &Self::Item) -> bool,

🔬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) -> bool
where + 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<T, S> FusedIterator for Union<'_, T, S>
where + T: Eq + Hash, + S: BuildHasher,

Auto Trait Implementations§

§

impl<'a, T, S> Freeze for Union<'a, T, S>

§

impl<'a, T, S> RefUnwindSafe for Union<'a, T, S>
where + S: RefUnwindSafe, + T: RefUnwindSafe,

§

impl<'a, T, S> Send for Union<'a, T, S>
where + S: Sync, + T: Sync,

§

impl<'a, T, S> Sync for Union<'a, T, S>
where + S: Sync, + T: Sync,

§

impl<'a, T, S> Unpin for Union<'a, T, S>

§

impl<'a, T, S> UnwindSafe for Union<'a, T, S>
where + S: RefUnwindSafe, + T: RefUnwindSafe,

Blanket Implementations§

source§

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

source§

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more
source§

impl<T> Borrow<T> for T
where + T: ?Sized,

source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
source§

impl<T> BorrowMut<T> for T
where + 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 T
where + 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 I
where + 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> ToOwned for T
where + 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 T
where + 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 T
where + 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/indexmap/set/trait.MutableValues.html b/indexmap/set/trait.MutableValues.html new file mode 100644 index 0000000000..756dd81681 --- /dev/null +++ b/indexmap/set/trait.MutableValues.html @@ -0,0 +1,38 @@ +MutableValues in indexmap::set - Rust
+

Trait indexmap::set::MutableValues

source · 
pub trait MutableValues: Sealed {
+    type Value;
+
+    // Required methods
+    fn get_full_mut2<Q>(
+        &mut self,
+        value: &Q
+    ) -> Option<(usize, &mut Self::Value)>
+       where Q: ?Sized + Hash + Equivalent<Self::Value>;
+    fn get_index_mut2(&mut self, index: usize) -> Option<&mut Self::Value>;
+    fn retain2<F>(&mut self, keep: F)
+       where F: FnMut(&mut Self::Value) -> bool;
+}
Expand description

Opt-in mutable access to IndexSet values.

+

These methods expose &mut T, mutable references to the value as it is stored +in the set. +You are allowed to modify the values in the set if the modification +does not change the value’s hash and equality.

+

If values are modified erroneously, you can no longer look them up. +This is sound (memory safe) but a logical error hazard (just like +implementing PartialEq, Eq, or Hash incorrectly would be).

+

use this trait to enable its methods for IndexSet.

+

This trait is sealed and cannot be implemented for types outside this crate.

+

Required Associated Types§

source

type Value

Required Methods§

source

fn get_full_mut2<Q>(&mut self, value: &Q) -> Option<(usize, &mut Self::Value)>
where + Q: ?Sized + Hash + Equivalent<Self::Value>,

Return item index and mutable reference to the value

+

Computes in O(1) time (average).

+
source

fn get_index_mut2(&mut self, index: usize) -> Option<&mut Self::Value>

Return mutable reference to the value at an index.

+

Valid indices are 0 <= index < self.len()

+

Computes in O(1) time.

+
source

fn retain2<F>(&mut self, keep: F)
where + F: FnMut(&mut Self::Value) -> bool,

Scan through each value in the set and keep those where the +closure keep returns true.

+

The values are visited in order, and remaining values keep their order.

+

Computes in O(n) time (average).

+

Object Safety§

This trait is not object safe.

Implementors§

source§

impl<T, S> MutableValues for IndexSet<T, S>
where + S: BuildHasher,

Opt-in mutable access to IndexSet values.

+

See MutableValues for more information.

+
§

type Value = T

\ No newline at end of file diff --git a/indexmap/sidebar-items.js b/indexmap/sidebar-items.js new file mode 100644 index 0000000000..6327322186 --- /dev/null +++ b/indexmap/sidebar-items.js @@ -0,0 +1 @@ +window.SIDEBAR_ITEMS = {"macro":["indexmap","indexset"],"mod":["map","set"],"struct":["TryReserveError"],"trait":["Equivalent"]}; \ No newline at end of file diff --git a/indexmap/struct.TryReserveError.html b/indexmap/struct.TryReserveError.html new file mode 100644 index 0000000000..7304e27530 --- /dev/null +++ b/indexmap/struct.TryReserveError.html @@ -0,0 +1,21 @@ +TryReserveError in indexmap - Rust
+

Struct indexmap::TryReserveError

source · 
pub struct TryReserveError { /* private fields */ }
Expand description

The error type for try_reserve methods.

+

Trait Implementations§

source§

impl Clone for TryReserveError

source§

fn clone(&self) -> TryReserveError

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 TryReserveError

source§

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

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

impl Display for TryReserveError

source§

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

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

impl Error for TryReserveError

1.30.0 · source§

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

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

fn description(&self) -> &str

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

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

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

fn provide<'a>(&'a self, 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 PartialEq for TryReserveError

source§

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

source§

impl StructuralPartialEq for TryReserveError

Auto Trait Implementations§

Blanket Implementations§

source§

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

source§

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more
source§

impl<T> Borrow<T> for T
where + T: ?Sized,

source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
source§

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

source§

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

Mutably borrows from an owned value. Read more
source§

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

source§

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

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

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

source§

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 T
where + 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 T
where + 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 T
where + 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 T
where + 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 T
where + 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/indexmap/trait.Equivalent.html b/indexmap/trait.Equivalent.html new file mode 100644 index 0000000000..415bf58dff --- /dev/null +++ b/indexmap/trait.Equivalent.html @@ -0,0 +1,16 @@ +Equivalent in indexmap - Rust
+

Trait indexmap::Equivalent

source · 
pub trait Equivalent<K>
where
+    K: ?Sized,
{
+    // Required method
+    fn equivalent(&self, key: &K) -> bool;
+}
Expand description

Key equivalence trait.

+

This trait allows hash table lookup to be customized. It has one blanket +implementation that uses the regular solution with Borrow and Eq, just +like HashMap does, so that you can pass &str to lookup into a map with +String keys and so on.

+

§Contract

+

The implementor must hash like K, if it is hashable.

+

Required Methods§

source

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

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

+

Implementors§

source§

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

\ No newline at end of file diff --git a/json_unflattening/all.html b/json_unflattening/all.html new file mode 100644 index 0000000000..04d806e520 --- /dev/null +++ b/json_unflattening/all.html @@ -0,0 +1,2 @@ +List of all items in this crate
+

List of all items

Enums

Functions

\ No newline at end of file diff --git a/json_unflattening/errors/enum.Error.html b/json_unflattening/errors/enum.Error.html new file mode 100644 index 0000000000..bb8271086d --- /dev/null +++ b/json_unflattening/errors/enum.Error.html @@ -0,0 +1,22 @@ +Error in json_unflattening::errors - Rust
+

Enum json_unflattening::errors::Error

source · 
pub enum Error {
+    NotAnObject,
+    NotAValue,
+    InvalidProperty,
+    MixedTypeArray,
+    InvalidType,
+    Unspecified,
+    FormatError,
+}
Expand description

List of errors that could happen

+

Variants§

§

NotAnObject

§

NotAValue

§

InvalidProperty

§

MixedTypeArray

§

InvalidType

§

Unspecified

§

FormatError

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()
Read more
1.0.0 · source§

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

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

fn provide<'a>(&'a self, 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

Auto Trait Implementations§

§

impl Freeze for Error

§

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 T
where + T: 'static + ?Sized,

source§

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more
source§

impl<T> Borrow<T> for T
where + T: ?Sized,

source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
source§

impl<T> BorrowMut<T> for T
where + 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 T
where + 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 T
where + 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 T
where + 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 T
where + 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/json_unflattening/errors/index.html b/json_unflattening/errors/index.html new file mode 100644 index 0000000000..2bfd4ec89c --- /dev/null +++ b/json_unflattening/errors/index.html @@ -0,0 +1,2 @@ +json_unflattening::errors - Rust
+

Module json_unflattening::errors

source ·

Enums§

  • Error
    List of errors that could happen
\ No newline at end of file diff --git a/json_unflattening/errors/sidebar-items.js b/json_unflattening/errors/sidebar-items.js new file mode 100644 index 0000000000..198d8c4275 --- /dev/null +++ b/json_unflattening/errors/sidebar-items.js @@ -0,0 +1 @@ +window.SIDEBAR_ITEMS = {"enum":["Error"]}; \ No newline at end of file diff --git a/json_unflattening/flattening/fn.flatten.html b/json_unflattening/flattening/fn.flatten.html new file mode 100644 index 0000000000..339e839dc6 --- /dev/null +++ b/json_unflattening/flattening/fn.flatten.html @@ -0,0 +1,9 @@ +flatten in json_unflattening::flattening - Rust
+

Function json_unflattening::flattening::flatten

source · 
pub fn flatten(value: &Value) -> Result<Map<String, Value>, Error>
Expand description

Flattens a JSON Value into a key-value map.

+

§Arguments

+
    +
  • value - The JSON Value to be flattened (serde_json::Value).
    • +
+

§Returns

+

A Result containing a flattened JSON structure (serde_json::Map<String, Value>) or an error (errors::Error).

+
\ No newline at end of file diff --git a/json_unflattening/flattening/index.html b/json_unflattening/flattening/index.html new file mode 100644 index 0000000000..c4814c9ffc --- /dev/null +++ b/json_unflattening/flattening/index.html @@ -0,0 +1,2 @@ +json_unflattening::flattening - Rust
+

Module json_unflattening::flattening

source ·

Functions§

  • flatten
    Flattens a JSON Value into a key-value map.
\ No newline at end of file diff --git a/json_unflattening/flattening/sidebar-items.js b/json_unflattening/flattening/sidebar-items.js new file mode 100644 index 0000000000..98389d9079 --- /dev/null +++ b/json_unflattening/flattening/sidebar-items.js @@ -0,0 +1 @@ +window.SIDEBAR_ITEMS = {"fn":["flatten"]}; \ No newline at end of file diff --git a/json_unflattening/index.html b/json_unflattening/index.html new file mode 100644 index 0000000000..14d1cf02f0 --- /dev/null +++ b/json_unflattening/index.html @@ -0,0 +1,3 @@ +json_unflattening - Rust
+

Crate json_unflattening

source ·

Modules§

\ No newline at end of file diff --git a/json_unflattening/sidebar-items.js b/json_unflattening/sidebar-items.js new file mode 100644 index 0000000000..996e53a753 --- /dev/null +++ b/json_unflattening/sidebar-items.js @@ -0,0 +1 @@ +window.SIDEBAR_ITEMS = {"mod":["errors","flattening","unflattening"]}; \ No newline at end of file diff --git a/json_unflattening/unflattening/fn.unflatten.html b/json_unflattening/unflattening/fn.unflatten.html new file mode 100644 index 0000000000..49b2f06bcb --- /dev/null +++ b/json_unflattening/unflattening/fn.unflatten.html @@ -0,0 +1,9 @@ +unflatten in json_unflattening::unflattening - Rust
+

Function json_unflattening::unflattening::unflatten

source · 
pub fn unflatten(data: &Map<String, Value>) -> Result<Value, Error>
Expand description

Unflattens a flattened JSON structure into the original JSON object.

+

§Arguments

+
    +
  • data - The flattened JSON structure represented as a key-value map (serde_json::Map<String, Value>).
    • +
+

§Returns

+

A Result containing the reconstructed original JSON object (serde_json::Value) or an error (errors::Error).

+
\ No newline at end of file diff --git a/json_unflattening/unflattening/index.html b/json_unflattening/unflattening/index.html new file mode 100644 index 0000000000..a7f43e6af0 --- /dev/null +++ b/json_unflattening/unflattening/index.html @@ -0,0 +1,2 @@ +json_unflattening::unflattening - Rust
+

Module json_unflattening::unflattening

source ·

Functions§

  • unflatten
    Unflattens a flattened JSON structure into the original JSON object.
\ No newline at end of file diff --git a/json_unflattening/unflattening/sidebar-items.js b/json_unflattening/unflattening/sidebar-items.js new file mode 100644 index 0000000000..9decd96d07 --- /dev/null +++ b/json_unflattening/unflattening/sidebar-items.js @@ -0,0 +1 @@ +window.SIDEBAR_ITEMS = {"fn":["unflatten"]}; \ No newline at end of file diff --git a/lil_broker/enum.Primatives.html b/lil_broker/enum.Primatives.html index c0bbefa0bd..8d939f5274 100644 --- a/lil_broker/enum.Primatives.html +++ b/lil_broker/enum.Primatives.html @@ -1,5 +1,5 @@ -Primatives in lil_broker - Rust
-

Enum lil_broker::Primatives

source · 
pub enum Primatives {
+Primatives in lil_broker - Rust

+    
Enum lil_broker::Primatives
source · 
pub enum Primatives {
     Number(f64),
     String(String),
     Boolean(bool),
@@ -7,21 +7,23 @@
     NumberArray(Vec<f64>),
     BooleanArray(Vec<bool>),
     ArrayRef(Vec<String>),
-}
Variants§
§
Number(f64)
§
String(String)
§
Boolean(bool)
§
StringArray(Vec<String>)
§
NumberArray(Vec<f64>)
§
BooleanArray(Vec<bool>)
§
ArrayRef(Vec<String>)
Trait Implementations§
source§
impl Clone for Primatives
source§
fn clone(&self) -> Primatives
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 Primatives
source§
fn fmt(&self, f: &mut Formatter<'_>) -> Result
Formats the value using the given formatter. Read more
source§
impl From<Primatives> for String
Conversion Function from Primative to String 

-
source§
fn from(p: Primatives) -> String
Converts to this type from the input type.
source§
impl From<Primatives> for Vec<String>
Conversion Function from Primative to Vec

-
source§
fn from(p: Primatives) -> Vec<String>
Converts to this type from the input type.
source§
impl From<Primatives> for Vec<bool>
Conversion Function from Primative to Vec

-
source§
fn from(p: Primatives) -> Vec<bool>
Converts to this type from the input type.
source§
impl From<Primatives> for Vec<f64>
Conversion Function from Primative to Vec

-
source§
fn from(p: Primatives) -> Vec<f64>
Converts to this type from the input type.
source§
impl From<Primatives> for bool
Conversion Function from Primative to bool

-
source§
fn from(p: Primatives) -> bool
Converts to this type from the input type.
source§
impl From<Primatives> for f64
Concversion Function from Primative to f64

-
source§
fn from(p: Primatives) -> f64
Converts to this type from the input type.
source§
impl From<String> for Primatives
Conversion Function from String to Primative

-
source§
fn from(s: String) -> Primatives
Converts to this type from the input type.
source§
impl From<Vec<String>> for Primatives
Conversion Function from Vec to Primative

-
source§
fn from(s: Vec<String>) -> Primatives
Converts to this type from the input type.
source§
impl From<Vec<bool>> for Primatives
Conversion Function from Vec to Primative

-
source§
fn from(b: Vec<bool>) -> Primatives
Converts to this type from the input type.
source§
impl From<Vec<f64>> for Primatives
Conversion Function from Vec to Primative

-
source§
fn from(n: Vec<f64>) -> Primatives
Converts to this type from the input type.
source§
impl From<bool> for Primatives
Conversion Function from bool to Primative

-
source§
fn from(b: bool) -> Primatives
Converts to this type from the input type.
source§
impl From<f64> for Primatives
Conversion Function from f64 to Primative

-
source§
fn from(n: f64) -> Primatives
Converts to this type from the input type.
source§
impl PartialEq for Primatives
source§
fn eq(&self, other: &Primatives) -> bool
This method tests for self and other values to be equal, and is used
+}

Variants§

§

Number(f64)

§

String(String)

§

Boolean(bool)

§

StringArray(Vec<String>)

§

NumberArray(Vec<f64>)

§

BooleanArray(Vec<bool>)

§

ArrayRef(Vec<String>)

Trait Implementations§

source§

impl Clone for Primatives

source§

fn clone(&self) -> Primatives

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 Primatives

source§

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

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

impl<'de> Deserialize<'de> for Primatives

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 From<Primatives> for String

Conversion Function from Primative to String

+
source§

fn from(p: Primatives) -> String

Converts to this type from the input type.
source§

impl From<Primatives> for Vec<String>

Conversion Function from Primative to Vec

+
source§

fn from(p: Primatives) -> Vec<String>

Converts to this type from the input type.
source§

impl From<Primatives> for Vec<bool>

Conversion Function from Primative to Vec

+
source§

fn from(p: Primatives) -> Vec<bool>

Converts to this type from the input type.
source§

impl From<Primatives> for Vec<f64>

Conversion Function from Primative to Vec

+
source§

fn from(p: Primatives) -> Vec<f64>

Converts to this type from the input type.
source§

impl From<Primatives> for bool

Conversion Function from Primative to bool

+
source§

fn from(p: Primatives) -> bool

Converts to this type from the input type.
source§

impl From<Primatives> for f64

Concversion Function from Primative to f64

+
source§

fn from(p: Primatives) -> f64

Converts to this type from the input type.
source§

impl From<String> for Primatives

Conversion Function from String to Primative

+
source§

fn from(s: String) -> Primatives

Converts to this type from the input type.
source§

impl From<Vec<String>> for Primatives

Conversion Function from Vec to Primative

+
source§

fn from(s: Vec<String>) -> Primatives

Converts to this type from the input type.
source§

impl From<Vec<bool>> for Primatives

Conversion Function from Vec to Primative

+
source§

fn from(b: Vec<bool>) -> Primatives

Converts to this type from the input type.
source§

impl From<Vec<f64>> for Primatives

Conversion Function from Vec to Primative

+
source§

fn from(n: Vec<f64>) -> Primatives

Converts to this type from the input type.
source§

impl From<bool> for Primatives

Conversion Function from bool to Primative

+
source§

fn from(b: bool) -> Primatives

Converts to this type from the input type.
source§

impl From<f64> for Primatives

Conversion Function from f64 to Primative

+
source§

fn from(n: f64) -> Primatives

Converts to this type from the input type.
source§

impl PartialEq for Primatives

source§

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

Auto Trait Implementations§

Blanket Implementations§

source§

impl<T> Any for T
where +sufficient, and should not be overridden without very good reason.

source§

impl Serialize for Primatives

source§

fn serialize<__S>(&self, __serializer: __S) -> Result<__S::Ok, __S::Error>
where + __S: Serializer,

Serialize this value into the given Serde serializer. Read more
source§

impl StructuralPartialEq for Primatives

Auto Trait Implementations§

Blanket Implementations§

source§

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

source§

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more
source§

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

source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
source§

impl<T> BorrowMut<T> for T
where 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.

@@ -37,4 +39,5 @@ 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> WithSubscriber for T

source§

fn with_subscriber<S>(self, subscriber: S) -> WithDispatch<Self>
where S: Into<Dispatch>,

Attaches the provided Subscriber to this type, returning a WithDispatch wrapper. Read more
source§

fn with_current_subscriber(self) -> WithDispatch<Self>

Attaches the current default Subscriber to this type, returning a -WithDispatch wrapper. Read more
\ No newline at end of file +WithDispatch wrapper. Read more
source§

impl<T> DeserializeOwned for T
where + T: for<'de> Deserialize<'de>,

\ No newline at end of file diff --git a/lil_broker/enum.QueryCommand.html b/lil_broker/enum.QueryCommand.html index 57fe7d5d22..2aa2b97018 100644 --- a/lil_broker/enum.QueryCommand.html +++ b/lil_broker/enum.QueryCommand.html @@ -5,8 +5,8 @@ LookupRange(LookupRangeQuery), Write(WriteQuery), }

Variants§

§

GetLatest(GetLatestQuery)

§

Lookup(LookupQuery)

§

LookupRange(LookupRangeQuery)

§

Write(WriteQuery)

Trait Implementations§

source§

impl Clone for QueryCommand

source§

fn clone(&self) -> QueryCommand

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 QueryCommand

source§

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

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

impl From<GetLatestQuery> for QueryCommand

Conversion Function from GetLatestQuery to QueryCommand

-
source§

fn from(query: GetLatestQuery) -> QueryCommand

Converts to this type from the input type.
source§

impl From<LookupRangeQuery> for QueryCommand

Conversion Function from LookupRangeQuery to QueryCommand

-
source§

fn from(query: LookupRangeQuery) -> QueryCommand

Converts to this type from the input type.
source§

impl From<QueryCommand> for GetLatestQuery

source§

fn from(command: QueryCommand) -> GetLatestQuery

Converts to this type from the input type.
source§

impl From<QueryCommand> for LookupRangeQuery

source§

fn from(command: QueryCommand) -> LookupRangeQuery

Converts to this type from the input type.
source§

impl From<QueryCommand> for WriteQuery

source§

fn from(query: QueryCommand) -> WriteQuery

Converts to this type from the input type.
source§

impl From<WriteQuery> for QueryCommand

source§

fn from(query: WriteQuery) -> QueryCommand

Converts to this type from the input type.

Auto Trait Implementations§

Blanket Implementations§

source§

impl<T> Any for T
where +
source§

fn from(query: GetLatestQuery) -> QueryCommand

Converts to this type from the input type.

source§

impl From<LookupRangeQuery> for QueryCommand

Conversion Function from LookupRangeQuery to QueryCommand

+
source§

fn from(query: LookupRangeQuery) -> QueryCommand

Converts to this type from the input type.
source§

impl From<QueryCommand> for GetLatestQuery

source§

fn from(command: QueryCommand) -> GetLatestQuery

Converts to this type from the input type.
source§

impl From<QueryCommand> for LookupRangeQuery

source§

fn from(command: QueryCommand) -> LookupRangeQuery

Converts to this type from the input type.
source§

impl From<QueryCommand> for WriteQuery

source§

fn from(query: QueryCommand) -> WriteQuery

Converts to this type from the input type.
source§

impl From<WriteQuery> for QueryCommand

source§

fn from(query: WriteQuery) -> QueryCommand

Converts to this type from the input type.

Auto Trait Implementations§

Blanket Implementations§

source§

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

source§

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more
source§

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

source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
source§

impl<T> BorrowMut<T> for T
where 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.

diff --git a/lil_broker/struct.Bucket.html b/lil_broker/struct.Bucket.html index 507cf85b40..a3ffc59677 100644 --- a/lil_broker/struct.Bucket.html +++ b/lil_broker/struct.Bucket.html @@ -3,14 +3,14 @@ pub name: String, pub bucket_tags: BTreeSet<Tag>, pub values: BTreeMap<Timestamp, DataPoint>, -}

Fields§

§name: String§bucket_tags: BTreeSet<Tag>§values: BTreeMap<Timestamp, DataPoint>

Implementations§

source§

impl Bucket

source

pub fn get_latest(&self) -> Option<DataPoint>

Get the latest DataPoint in the bucket

-
source

pub fn get_latest_mut(&mut self) -> Option<&mut DataPoint>

source

pub fn get_earliest(&self) -> Option<DataPoint>

source

pub fn lookup(&self, timestamp: Timestamp, before: bool) -> Option<DataPoint>

Get the datapoint right before/after the timestamp

-
source

pub fn range(&self, start: Timestamp, end: Timestamp) -> Vec<DataPoint>

Get all the datapoints between two timestamps

-
source§

impl Bucket

source

pub fn new(name: &str) -> Bucket

source

pub fn add_primative( +}

Fields§

§name: String§bucket_tags: BTreeSet<Tag>§values: BTreeMap<Timestamp, DataPoint>

Implementations§

source§

impl Bucket

source

pub fn get_latest(&self) -> Option<DataPoint>

Get the latest DataPoint in the bucket

+
source

pub fn get_latest_mut(&mut self) -> Option<&mut DataPoint>

source

pub fn get_earliest(&self) -> Option<DataPoint>

source

pub fn lookup(&self, timestamp: Timestamp, before: bool) -> Option<DataPoint>

Get the datapoint right before/after the timestamp

+
source

pub fn range(&self, start: Timestamp, end: Timestamp) -> Vec<DataPoint>

Get all the datapoints between two timestamps

+
source§

impl Bucket

source

pub fn new(name: &str) -> Bucket

source

pub fn add_primative( &mut self, timestamp: Timestamp, value: Primatives -) -> &mut Self

source

pub fn add_tag(&mut self, tag: Tag) -> &mut Self

source

pub fn add_data_point(&mut self, data_point: DataPoint) -> &mut Self

Auto Trait Implementations§

§

impl Freeze for Bucket

§

impl RefUnwindSafe for Bucket

§

impl Send for Bucket

§

impl Sync for Bucket

§

impl Unpin for Bucket

§

impl UnwindSafe for Bucket

Blanket Implementations§

source§

impl<T> Any for T
where +) -> &mut Self

source

pub fn add_tag(&mut self, tag: Tag) -> &mut Self

source

pub fn add_data_point(&mut self, data_point: DataPoint) -> &mut Self

Auto Trait Implementations§

§

impl Freeze for Bucket

§

impl RefUnwindSafe for Bucket

§

impl Send for Bucket

§

impl Sync for Bucket

§

impl Unpin for Bucket

§

impl UnwindSafe for Bucket

Blanket Implementations§

source§

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

source§

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more
source§

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

source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
source§

impl<T> BorrowMut<T> for T
where 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.

diff --git a/lil_broker/struct.Database.html b/lil_broker/struct.Database.html index 3f26739269..c1e81cce0c 100644 --- a/lil_broker/struct.Database.html +++ b/lil_broker/struct.Database.html @@ -1,19 +1,19 @@ Database in lil_broker - Rust
-

Struct lil_broker::Database

source · 
pub struct Database {
+    
Struct lil_broker::Database
source · 
pub struct Database {
     pub buckets: BTreeMap<String, Bucket>,
-}
Fields§
§buckets: BTreeMap<String, Bucket>
Implementations§

Fields§

§buckets: BTreeMap<String, Bucket>

Implementations§

source§

impl Database

source

pub fn query_get_latest( &mut self, query: GetLatestQuery -) -> Result<QueryResponse, String>

source§

impl Database

source

pub fn query_write( +) -> Result<QueryResponse, String>

source§

impl Database

source

pub fn query_lookup_range( + &mut self, + query: LookupRangeQuery +) -> Result<QueryResponse, String>

source§

impl Database

source

pub fn query_write( &mut self, query: WriteQuery -) -> Result<QueryResponse, String>

source§

impl Database

source

pub fn new() -> Database

source

pub fn get_keys(&self) -> Vec<String>

source

pub fn query(&mut self, query: QueryCommand) -> Result<QueryResponse, String>

source

pub fn add_tag_to_bucket(&mut self, bucket_name: &str, tag: Tag)

source

pub fn query_batch( +) -> Result<QueryResponse, String>

source§

impl Database

source

pub fn new() -> Database

source

pub fn get_keys(&self) -> Vec<String>

source

pub fn query(&mut self, query: QueryCommand) -> Result<QueryResponse, String>

source

pub fn add_tag_to_bucket(&mut self, bucket_name: &str, tag: Tag)

source

pub fn query_batch( &mut self, queries: Vec<QueryCommand> -) -> Result<Vec<QueryResponse>, String>

source

pub fn new_bucket(&mut self, name: &str)

Auto Trait Implementations§

Blanket Implementations§

source§

impl<T> Any for T
where +) -> Result<Vec<QueryResponse>, String>

source

pub fn new_bucket(&mut self, name: &str)

Auto Trait Implementations§

Blanket Implementations§

source§

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

source§

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more
source§

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

source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
source§

impl<T> BorrowMut<T> for T
where 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.

diff --git a/lil_broker/struct.GetLatestQuery.html b/lil_broker/struct.GetLatestQuery.html index 367691ec0f..3dde2ed1c4 100644 --- a/lil_broker/struct.GetLatestQuery.html +++ b/lil_broker/struct.GetLatestQuery.html @@ -3,8 +3,8 @@ pub topics: Vec<String>, pub ack_topics: Vec<String>, pub tag_filters: Vec<TagFilter>, -}

Fields§

§topics: Vec<String>§ack_topics: Vec<String>§tag_filters: Vec<TagFilter>

Trait Implementations§

source§

impl Clone for GetLatestQuery

source§

fn clone(&self) -> GetLatestQuery

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 GetLatestQuery

source§

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

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

impl Default for GetLatestQuery

source§

fn default() -> Self

Returns the “default value” for a type. Read more
source§

impl From<GetLatestQuery> for QueryCommand

Conversion Function from GetLatestQuery to QueryCommand

-
source§

fn from(query: GetLatestQuery) -> QueryCommand

Converts to this type from the input type.
source§

impl From<QueryCommand> for GetLatestQuery

source§

fn from(command: QueryCommand) -> GetLatestQuery

Converts to this type from the input type.
source§

impl From<Vec<String>> for GetLatestQuery

source§

fn from(topics: Vec<String>) -> GetLatestQuery

Converts to this type from the input type.

Auto Trait Implementations§

Blanket Implementations§

source§

impl<T> Any for T
where +}

Fields§

§topics: Vec<String>§ack_topics: Vec<String>§tag_filters: Vec<TagFilter>

Trait Implementations§

source§

impl Clone for GetLatestQuery

source§

fn clone(&self) -> GetLatestQuery

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 GetLatestQuery

source§

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

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

impl Default for GetLatestQuery

source§

fn default() -> Self

Returns the “default value” for a type. Read more
source§

impl From<GetLatestQuery> for QueryCommand

Conversion Function from GetLatestQuery to QueryCommand

+
source§

fn from(query: GetLatestQuery) -> QueryCommand

Converts to this type from the input type.
source§

impl From<QueryCommand> for GetLatestQuery

source§

fn from(command: QueryCommand) -> GetLatestQuery

Converts to this type from the input type.
source§

impl From<Vec<String>> for GetLatestQuery

source§

fn from(topics: Vec<String>) -> GetLatestQuery

Converts to this type from the input type.

Auto Trait Implementations§

Blanket Implementations§

source§

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

source§

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more
source§

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

source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
source§

impl<T> BorrowMut<T> for T
where 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.

diff --git a/lil_broker/struct.QueryResponse.html b/lil_broker/struct.QueryResponse.html index 4cdbcbe8f6..f664e1b83b 100644 --- a/lil_broker/struct.QueryResponse.html +++ b/lil_broker/struct.QueryResponse.html @@ -1,8 +1,8 @@ -QueryResponse in lil_broker - Rust
+QueryResponse in lil_broker - Rust

Struct lil_broker::QueryResponse

source · 
pub struct QueryResponse {
     pub data: BTreeMap<String, Vec<DataPoint>>,
     pub metadata: QueryResponseMetadata,
-}

Fields§

§data: BTreeMap<String, Vec<DataPoint>>§metadata: QueryResponseMetadata

Implementations§

Trait Implementations§

source§

impl Clone for QueryResponse

source§

fn clone(&self) -> QueryResponse

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 QueryResponse

source§

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

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

impl Default for QueryResponse

source§

fn default() -> Self

Returns the “default value” for a type. Read more

Auto Trait Implementations§

Blanket Implementations§

source§

impl<T> Any for T
where +}

Fields§

§data: BTreeMap<String, Vec<DataPoint>>§metadata: QueryResponseMetadata

Implementations§

source§

impl QueryResponse

source

pub fn new() -> QueryResponse

source

pub fn to_json(&self, prefix: &str) -> Value

source

pub fn to_json_timestamped(&self, prefix: &str) -> Value

Trait Implementations§

source§

impl Clone for QueryResponse

source§

fn clone(&self) -> QueryResponse

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 QueryResponse

source§

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

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

impl Default for QueryResponse

source§

fn default() -> Self

Returns the “default value” for a type. Read more

Auto Trait Implementations§

Blanket Implementations§

source§

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

source§

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more
source§

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

source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
source§

impl<T> BorrowMut<T> for T
where 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.

diff --git a/lil_broker/struct.Tag.html b/lil_broker/struct.Tag.html index 872473d158..0de9c6db91 100644 --- a/lil_broker/struct.Tag.html +++ b/lil_broker/struct.Tag.html @@ -1,38 +1,44 @@ -Tag in lil_broker - Rust
-

Struct lil_broker::Tag

source · 
pub struct Tag {
+Tag in lil_broker - Rust

+    
Struct lil_broker::Tag
source · 
pub struct Tag {
     pub name: String,
     pub value: Option<String>,
-}
Fields§
§name: String§value: Option<String>
Implementations§
source§
impl Tag
source
pub fn new(name: &str) -> Tag
Create a new tag with no value set

+}

Fields§

§name: String§value: Option<String>

Implementations§

source§

impl Tag

source

pub fn new(name: &str) -> Tag

Create a new tag with no value set

  • name: The name of the tag
-
source

pub fn new_with_value(name: &str, value: &str) -> Tag

Create a new tag with a value set

+
source

pub fn new_with_value(name: &str, value: &str) -> Tag

Create a new tag with a value set

  • name: The name of the tag
  • value: The value of the tag
-
source

pub fn value(self, value: &str) -> Self

Builder function to add a value to the tag

+
source

pub fn value(self, value: &str) -> Self

Builder function to add a value to the tag

  • value: The value of the tag
-

Trait Implementations§

source§

impl Clone for Tag

source§

fn clone(&self) -> Tag

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 Tag

source§

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

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

impl From<&str> for Tag

Conversion function from &str to Tag

-
source§

fn from(name: &str) -> Self

Converts to this type from the input type.
source§

impl From<(&str, &str)> for Tag

Conversion function from (&str, &str) to Tag

-
source§

fn from((name, value): (&str, &str)) -> Self

Converts to this type from the input type.
source§

impl From<(String, String)> for Tag

Conversion function from (String, String) to Tag

-
source§

fn from((name, value): (String, String)) -> Self

Converts to this type from the input type.
source§

impl From<String> for Tag

Conversion function from String to Tag

-
source§

fn from(name: String) -> Self

Converts to this type from the input type.
source§

impl Hash for Tag

source§

fn hash<H: Hasher>(&self, state: &mut H)

We only hash for the name

+

Trait Implementations§

source§

impl Clone for Tag

source§

fn clone(&self) -> Tag

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 Tag

source§

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

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

impl From<&str> for Tag

Conversion function from &str to Tag

+
source§

fn from(name: &str) -> Self

Converts to this type from the input type.
source§

impl From<(&str, &str)> for Tag

Conversion function from (&str, &str) to Tag

+
source§

fn from((name, value): (&str, &str)) -> Self

Converts to this type from the input type.
source§

impl From<(String, String)> for Tag

Conversion function from (String, String) to Tag

+
source§

fn from((name, value): (String, String)) -> Self

Converts to this type from the input type.
source§

impl From<String> for Tag

Conversion function from String to Tag

+
source§

fn from(name: String) -> Self

Converts to this type from the input type.
source§

impl Hash for Tag

source§

fn hash<H: Hasher>(&self, state: &mut H)

We only hash for the name

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 Tag

source§

fn cmp(&self, other: &Self) -> Ordering

This method returns an Ordering between self and other. Read more
1.21.0 · source§

fn max(self, other: Self) -> Self
where + Self: Sized,

Feeds a slice of this type into the given Hasher. Read more
source§

impl Ord for Tag

source§

fn cmp(&self, other: &Self) -> Ordering

This method returns an Ordering between self and other. Read more
1.21.0 · source§

fn max(self, other: Self) -> Self
where Self: Sized,

Compares and returns the maximum of two values. Read more
1.21.0 · source§

fn min(self, other: Self) -> Self
where Self: Sized,

Compares and returns the minimum of two values. Read more
1.50.0 · source§

fn clamp(self, min: Self, max: Self) -> Self
where - Self: Sized + PartialOrd,

Restrict a value to a certain interval. Read more
source§

impl PartialEq for Tag

source§

fn eq(&self, other: &Self) -> bool

This method tests for self and other values to be equal, and is used + Self: Sized + PartialOrd,

Restrict a value to a certain interval. Read more
source§

impl PartialEq for Tag

source§

fn eq(&self, other: &Self) -> 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 Tag

source§

fn partial_cmp(&self, other: &Tag) -> 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 <= +sufficient, and should not be overridden without very good reason.
source§

impl PartialOrd for Tag

source§

fn partial_cmp(&self, other: &Tag) -> 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 Eq for Tag

Auto Trait Implementations§

§

impl Freeze for Tag

§

impl RefUnwindSafe for Tag

§

impl Send for Tag

§

impl Sync for Tag

§

impl Unpin for Tag

§

impl UnwindSafe for Tag

Blanket Implementations§

source§

impl<T> Any for T
where +operator. Read more

source§

impl Eq for Tag

Auto Trait Implementations§

§

impl Freeze for Tag

§

impl RefUnwindSafe for Tag

§

impl Send for Tag

§

impl Sync for Tag

§

impl Unpin for Tag

§

impl UnwindSafe for Tag

Blanket Implementations§

source§

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

source§

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more
source§

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

source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
source§

impl<T> BorrowMut<T> for T
where - 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.

+ T: ?Sized,

source§

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

Mutably borrows from an owned value. Read more
source§

impl<Q, K> Comparable<K> for Q
where + Q: Ord + ?Sized, + K: Borrow<Q> + ?Sized,

source§

fn compare(&self, key: &K) -> Ordering

Compare self to key and return their ordering.
source§

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

source§

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

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

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

source§

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> Instrument for T

source§

fn instrument(self, span: Span) -> Instrumented<Self>

Instruments this type with the provided Span, returning an Instrumented wrapper. Read more
source§

fn in_current_span(self) -> Instrumented<Self>

Instruments this type with the current Span, returning an Instrumented wrapper. Read more
source§

impl<T, U> Into<U> for T
where diff --git a/lil_broker/struct.Timestamp.html b/lil_broker/struct.Timestamp.html index 2954cfc4dd..88bce54fa3 100644 --- a/lil_broker/struct.Timestamp.html +++ b/lil_broker/struct.Timestamp.html @@ -1,8 +1,8 @@ -Timestamp in lil_broker - Rust
+Timestamp in lil_broker - Rust

Struct lil_broker::Timestamp

source · 
pub struct Timestamp {
     pub tick_ms: u32,
-}

Fields§

§tick_ms: u32

Implementations§

source§

impl Timestamp

source

pub fn new(tick_ms: u32) -> Timestamp

source

pub fn zero() -> Timestamp

source

pub fn from_seconds(seconds: f32) -> Timestamp

source

pub fn from_hz(hz: f32) -> Timestamp

source

pub fn hz(&self) -> f32

source

pub fn seconds(&self) -> f64

source

pub fn minutes(&self) -> f64

source

pub fn hours(&self) -> f64

Trait Implementations§

source§

impl Add for Timestamp

§

type Output = Timestamp

The resulting type after applying the + operator.
source§

fn add(self, other: Timestamp) -> Timestamp

Performs the + operation. Read more
source§

impl Clone for Timestamp

source§

fn clone(&self) -> Timestamp

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 Timestamp

source§

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

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

impl Default for Timestamp

source§

fn default() -> Self

Returns the “default value” for a type. Read more
source§

impl<'de> Deserialize<'de> for Timestamp

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

source§

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

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

impl From<Duration> for Timestamp

source§

fn from(duration: Duration) -> Self

Converts to this type from the input type.
source§

impl From<Timestamp> for Duration

source§

fn from(timestamp: Timestamp) -> Self

Converts to this type from the input type.
source§

impl From<Timestamp> for u32

source§

fn from(timestamp: Timestamp) -> Self

Converts to this type from the input type.
source§

impl From<Timestamp> for u64

source§

fn from(timestamp: Timestamp) -> Self

Converts to this type from the input type.
source§

impl From<u32> for Timestamp

source§

fn from(tick_ms: u32) -> Self

Converts to this type from the input type.
source§

impl From<u64> for Timestamp

source§

fn from(tick_ms: u64) -> Self

Converts to this type from the input type.
source§

impl Hash for Timestamp

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 +}

Fields§

§tick_ms: u32

Implementations§

source§

impl Timestamp

source

pub fn new(tick_ms: u32) -> Timestamp

source

pub fn zero() -> Timestamp

source

pub fn from_seconds(seconds: f32) -> Timestamp

source

pub fn from_hz(hz: f32) -> Timestamp

source

pub fn hz(&self) -> f32

source

pub fn seconds(&self) -> f64

source

pub fn minutes(&self) -> f64

source

pub fn hours(&self) -> f64

Trait Implementations§

source§

impl Add for Timestamp

§

type Output = Timestamp

The resulting type after applying the + operator.
source§

fn add(self, other: Timestamp) -> Timestamp

Performs the + operation. Read more
source§

impl Clone for Timestamp

source§

fn clone(&self) -> Timestamp

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 Timestamp

source§

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

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

impl Default for Timestamp

source§

fn default() -> Self

Returns the “default value” for a type. Read more
source§

impl<'de> Deserialize<'de> for Timestamp

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

source§

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

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

impl From<Duration> for Timestamp

source§

fn from(duration: Duration) -> Self

Converts to this type from the input type.
source§

impl From<Timestamp> for Duration

source§

fn from(timestamp: Timestamp) -> Self

Converts to this type from the input type.
source§

impl From<Timestamp> for u32

source§

fn from(timestamp: Timestamp) -> Self

Converts to this type from the input type.
source§

impl From<Timestamp> for u64

source§

fn from(timestamp: Timestamp) -> Self

Converts to this type from the input type.
source§

impl From<u32> for Timestamp

source§

fn from(tick_ms: u32) -> Self

Converts to this type from the input type.
source§

impl From<u64> for Timestamp

source§

fn from(tick_ms: u64) -> Self

Converts to this type from the input type.
source§

impl Hash for Timestamp

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 Timestamp

source§

fn cmp(&self, other: &Timestamp) -> Ordering

This method returns an Ordering between self and other. Read more
1.21.0 · source§

fn max(self, other: Self) -> Self
where Self: Sized,

Compares and returns the maximum of two values. Read more
1.21.0 · source§

fn min(self, other: Self) -> Self
where @@ -15,7 +15,13 @@ __S: Serializer,

Serialize this value into the given Serde serializer. Read more
source§

impl Sub for Timestamp

§

type Output = Timestamp

The resulting type after applying the - operator.
source§

fn sub(self, other: Timestamp) -> Timestamp

Performs the - operation. Read more
source§

impl Copy for Timestamp

source§

impl Eq for Timestamp

Auto Trait Implementations§

Blanket Implementations§

source§

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

source§

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more
source§

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

source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
source§

impl<T> BorrowMut<T> for T
where - 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.

+ T: ?Sized,

source§

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

Mutably borrows from an owned value. Read more
source§

impl<Q, K> Comparable<K> for Q
where + Q: Ord + ?Sized, + K: Borrow<Q> + ?Sized,

source§

fn compare(&self, key: &K) -> Ordering

Compare self to key and return their ordering.
source§

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

source§

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

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

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

source§

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> Instrument for T

source§

fn instrument(self, span: Span) -> Instrumented<Self>

Instruments this type with the provided Span, returning an Instrumented wrapper. Read more
source§

fn in_current_span(self) -> Instrumented<Self>

Instruments this type with the current Span, returning an Instrumented wrapper. Read more
source§

impl<T, U> Into<U> for T
where diff --git a/lil_broker/struct.WriteQuery.html b/lil_broker/struct.WriteQuery.html index 511dfd152b..98dd2c3d57 100644 --- a/lil_broker/struct.WriteQuery.html +++ b/lil_broker/struct.WriteQuery.html @@ -1,14 +1,14 @@ WriteQuery in lil_broker - Rust
-

Struct lil_broker::WriteQuery

source · 
pub struct WriteQuery {
+    
Struct lil_broker::WriteQuery
source · 
pub struct WriteQuery {
     pub topic: String,
     pub data: Primatives,
     pub timestamp: Timestamp,
     pub tags: Vec<Tag>,
-}
Fields§
§topic: String§data: Primatives§timestamp: Timestamp§tags: Vec<Tag>
Implementations§
source§
impl WriteQuery
source
pub fn new(topic: String, data: Primatives, timestamp: Timestamp) -> WriteQuery
source
pub fn from_json_batch(
-    json_str: String,
+}

Fields§

§topic: String§data: Primatives§timestamp: Timestamp§tags: Vec<Tag>

Implementations§

source§

impl WriteQuery

source

pub fn new(topic: String, data: Primatives, timestamp: Timestamp) -> WriteQuery

source

pub fn from_json_batch( + json: Value, timestamp: Timestamp, prefix: String -) -> Vec<WriteQuery>

Trait Implementations§

source§

impl Clone for WriteQuery

source§

fn clone(&self) -> WriteQuery

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 WriteQuery

source§

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

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

impl From<QueryCommand> for WriteQuery

source§

fn from(query: QueryCommand) -> WriteQuery

Converts to this type from the input type.
source§

impl From<WriteQuery> for QueryCommand

source§

fn from(query: WriteQuery) -> QueryCommand

Converts to this type from the input type.

Auto Trait Implementations§

Blanket Implementations§

source§

impl<T> Any for T
where +) -> Vec<QueryCommand>

Trait Implementations§

source§

impl Clone for WriteQuery

source§

fn clone(&self) -> WriteQuery

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 WriteQuery

source§

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

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

impl From<QueryCommand> for WriteQuery

source§

fn from(query: QueryCommand) -> WriteQuery

Converts to this type from the input type.
source§

impl From<WriteQuery> for QueryCommand

source§

fn from(query: WriteQuery) -> QueryCommand

Converts to this type from the input type.

Auto Trait Implementations§

Blanket Implementations§

source§

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

source§

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more
source§

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

source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
source§

impl<T> BorrowMut<T> for T
where 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.

diff --git a/proc_macro2/all.html b/proc_macro2/all.html index 9150d6fbbf..0aa7de274d 100644 --- a/proc_macro2/all.html +++ b/proc_macro2/all.html @@ -1,2 +1,2 @@ -List of all items in this crate
+List of all items in this crate

List of all items

Structs

Enums

\ No newline at end of file diff --git a/proc_macro2/enum.Delimiter.html b/proc_macro2/enum.Delimiter.html index 22e1c289f2..7e57015cef 100644 --- a/proc_macro2/enum.Delimiter.html +++ b/proc_macro2/enum.Delimiter.html @@ -1,5 +1,5 @@ -Delimiter in proc_macro2 - Rust
-

Enum proc_macro2::Delimiter

source · 
pub enum Delimiter {
+Delimiter in proc_macro2 - Rust

+    
Enum proc_macro2::Delimiter
source · 
pub enum Delimiter {
     Parenthesis,
     Brace,
     Bracket,
@@ -14,7 +14,15 @@
 operator priorities in cases like $var * 3 where $var is 1 + 2.
 Invisible delimiters may not survive roundtrip of a token stream through
 a string.

-

Trait Implementations§

source§

impl Clone for Delimiter

source§

fn clone(&self) -> Delimiter

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 Delimiter

source§

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

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

impl PartialEq for Delimiter

source§

fn eq(&self, other: &Delimiter) -> bool

This method tests for self and other values to be equal, and is used +
+

Note: rustc currently can ignore the grouping of tokens delimited by None in the output +of a proc_macro. Only None-delimited groups created by a macro_rules macro in the input +of a proc_macro macro are preserved, and only in very specific circumstances. +Any None-delimited groups (re)created by a proc_macro will therefore not preserve +operator priorities as indicated above. The other Delimiter variants should be used +instead in this context. This is a rustc bug. For details, see +rust-lang/rust#67062.

+

Trait Implementations§

source§

impl Clone for Delimiter

source§

fn clone(&self) -> Delimiter

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 Delimiter

source§

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

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

impl PartialEq for Delimiter

source§

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

source§

impl Eq for Delimiter

source§

impl StructuralPartialEq for Delimiter

Auto Trait Implementations§

Blanket Implementations§

source§

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

source§

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more
source§

impl<T> Borrow<T> for T
where diff --git a/proc_macro2/enum.Spacing.html b/proc_macro2/enum.Spacing.html index 15f62da6c3..a7bfed84f1 100644 --- a/proc_macro2/enum.Spacing.html +++ b/proc_macro2/enum.Spacing.html @@ -1,5 +1,5 @@ -Spacing in proc_macro2 - Rust
-

Enum proc_macro2::Spacing

source · 
pub enum Spacing {
+Spacing in proc_macro2 - Rust

+    
Enum proc_macro2::Spacing
source · 
pub enum Spacing {
     Alone,
     Joint,
 }
Expand description
Whether a Punct is followed immediately by another Punct or followed by
@@ -8,9 +8,9 @@
 
§
Joint
E.g. + is Joint in += or ' is Joint in '#.

 
Additionally, single quote ' can join with identifiers to form
 lifetimes 'ident.

-
Trait Implementations§
source§
impl Clone for Spacing
source§
fn clone(&self) -> Spacing
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 Spacing
source§
fn fmt(&self, f: &mut Formatter<'_>) -> Result
Formats the value using the given formatter. Read more
source§
impl PartialEq for Spacing
source§
fn eq(&self, other: &Spacing) -> bool
This method tests for self and other values to be equal, and is used
+
Trait Implementations§
source§
impl Clone for Spacing
source§
fn clone(&self) -> Spacing
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 Spacing
source§
fn fmt(&self, f: &mut Formatter<'_>) -> Result
Formats the value using the given formatter. Read more
source§
impl PartialEq for Spacing
source§
fn eq(&self, other: &Spacing) -> 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 Spacing
source§
impl Eq for Spacing
source§
impl StructuralPartialEq for Spacing
Auto Trait Implementations§
Blanket Implementations§
source§
impl<T> Any for T
where
+sufficient, and should not be overridden without very good reason.
source§
impl Copy for Spacing
source§
impl Eq for Spacing
source§
impl StructuralPartialEq for Spacing
Auto Trait Implementations§
Blanket Implementations§
source§
impl<T> Any for T
where
     T: 'static + ?Sized,
source§
fn type_id(&self) -> TypeId
Gets the TypeId of self. Read more
source§
impl<T> Borrow<T> for T
where
     T: ?Sized,
source§
fn borrow(&self) -> &T
Immutably borrows from an owned value. Read more
source§
impl<T> BorrowMut<T> for T
where
     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.

diff --git a/proc_macro2/enum.TokenTree.html b/proc_macro2/enum.TokenTree.html
index dc6ff003b9..2805105e7d 100644
--- a/proc_macro2/enum.TokenTree.html
+++ b/proc_macro2/enum.TokenTree.html
@@ -1,4 +1,4 @@
-TokenTree in proc_macro2 - Rust

+TokenTree in proc_macro2 - Rust

     
Enum proc_macro2::TokenTree
source · 
pub enum TokenTree {
     Group(Group),
     Ident(Ident),
@@ -16,11 +16,11 @@
 the span of each of the internal tokens, this will simply delegate to
 the set_span method of each variant.

 
Trait Implementations§
source§
impl Clone for TokenTree
source§
fn clone(&self) -> TokenTree
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 TokenTree
Prints token tree in a form convenient for debugging.

-
source§
fn fmt(&self, f: &mut Formatter<'_>) -> Result
Formats the value using the given formatter. Read more
source§
impl Display for TokenTree
Prints the token tree as a string that is supposed to be losslessly
+
source§
fn fmt(&self, f: &mut Formatter<'_>) -> Result
Formats the value using the given formatter. Read more
source§
impl Display for TokenTree
Prints the token tree as a string that is supposed to be losslessly
 convertible back into the same token tree (modulo spans), except for
 possibly TokenTree::Groups with Delimiter::None delimiters and negative
 numeric literals.

-
source§
fn fmt(&self, f: &mut Formatter<'_>) -> Result
Formats the value using the given formatter. Read more
source§
impl Extend<TokenTree> for TokenStream
source§
fn extend<I: IntoIterator<Item = TokenTree>>(&mut self, streams: I)
Extends a collection with the contents of an iterator. Read more
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 From<Group> for TokenTree
source§
fn from(g: Group) -> Self
Converts to this type from the input type.
source§
impl From<Ident> for TokenTree
source§
fn from(g: Ident) -> Self
Converts to this type from the input type.
source§
impl From<Literal> for TokenTree
source§
fn from(g: Literal) -> Self
Converts to this type from the input type.
source§
impl From<Punct> for TokenTree
source§
fn from(g: Punct) -> Self
Converts to this type from the input type.
source§
impl From<TokenTree> for TokenStream
source§
fn from(token: TokenTree) -> Self
Converts to this type from the input type.
source§
impl FromIterator<TokenTree> for TokenStream
Collects a number of token trees into a single stream.

+
source§
fn fmt(&self, f: &mut Formatter<'_>) -> Result
Formats the value using the given formatter. Read more
source§
impl Extend<TokenTree> for TokenStream
source§
fn extend<I: IntoIterator<Item = TokenTree>>(&mut self, streams: I)
Extends a collection with the contents of an iterator. Read more
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 From<Group> for TokenTree
source§
fn from(g: Group) -> Self
Converts to this type from the input type.
source§
impl From<Ident> for TokenTree
source§
fn from(g: Ident) -> Self
Converts to this type from the input type.
source§
impl From<Literal> for TokenTree
source§
fn from(g: Literal) -> Self
Converts to this type from the input type.
source§
impl From<Punct> for TokenTree
source§
fn from(g: Punct) -> Self
Converts to this type from the input type.
source§
impl From<TokenTree> for TokenStream
source§
fn from(token: TokenTree) -> Self
Converts to this type from the input type.
source§
impl FromIterator<TokenTree> for TokenStream
Collects a number of token trees into a single stream.

 
source§
fn from_iter<I: IntoIterator<Item = TokenTree>>(streams: I) -> Self
Creates a value from an iterator. Read more
Auto Trait Implementations§
Blanket Implementations§
source§
impl<T> Any for T
where
     T: 'static + ?Sized,
source§
fn type_id(&self) -> TypeId
Gets the TypeId of self. Read more
source§
impl<T> Borrow<T> for T
where
     T: ?Sized,
source§
fn borrow(&self) -> &T
Immutably borrows from an owned value. Read more
source§
impl<T> BorrowMut<T> for T
where
diff --git a/proc_macro2/extra/index.html b/proc_macro2/extra/index.html
index b5d3c855a8..cc93218277 100644
--- a/proc_macro2/extra/index.html
+++ b/proc_macro2/extra/index.html
@@ -1,4 +1,4 @@
-proc_macro2::extra - Rust

+proc_macro2::extra - Rust

     
Module proc_macro2::extra
source · 
Expand description
Items which do not have a correspondence to any API in the proc_macro crate,
 but are necessary to include in proc-macro2.

 
Structs§
  • DelimSpan
    An object that holds a Group’s span_open() and span_close() together
diff --git a/proc_macro2/extra/struct.DelimSpan.html b/proc_macro2/extra/struct.DelimSpan.html
index 292294f05e..0c3b91d2dc 100644
--- a/proc_macro2/extra/struct.DelimSpan.html
+++ b/proc_macro2/extra/struct.DelimSpan.html
@@ -1,4 +1,4 @@
-DelimSpan in proc_macro2::extra - Rust
    
+DelimSpan in proc_macro2::extra - Rust
    
     
    Struct proc_macro2::extra::DelimSpan
    source · 
    pub struct DelimSpan { /* private fields */ }
    Expand description
    An object that holds a Group’s span_open() and span_close() together
 in a more compact representation than holding those 2 spans individually.
    
 
    Implementations§
    source§
    impl DelimSpan
    source
    pub fn join(&self) -> Span
    Returns a span covering the entire delimited group.
    
diff --git a/proc_macro2/index.html b/proc_macro2/index.html
index 92e614bf20..fd3e8d0e86 100644
--- a/proc_macro2/index.html
+++ b/proc_macro2/index.html
@@ -1,6 +1,6 @@
-proc_macro2 - Rust

source

pub fn span_open(&self) -> Span

Returns the span pointing to the opening delimiter of this group.

pub fn span_open(&self) -> Span {
                 ^
-
source

pub fn span_close(&self) -> Span

Returns the span pointing to the closing delimiter of this group.

+
source

pub fn span_close(&self) -> Span

Returns the span pointing to the closing delimiter of this group.

pub fn span_close(&self) -> Span {
                        ^
-
source

pub fn delim_span(&self) -> DelimSpan

Returns an object that holds this group’s span_open() and +

source

pub fn delim_span(&self) -> DelimSpan

Returns an object that holds this group’s span_open() and span_close() together (in a more compact representation than holding those 2 spans individually).

-
source

pub fn set_span(&mut self, span: Span)

Configures the span for this Group’s delimiters, but not its internal +

source

pub fn set_span(&mut self, span: Span)

Configures the span for this Group’s delimiters, but not its internal tokens.

This method will not set the span of all the internal tokens spanned by this group, but rather it will only set the span of the delimiter tokens at the level of the Group.

-

Trait Implementations§

source§

impl Clone for Group

source§

fn clone(&self) -> Group

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

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

Performs copy-assignment from source. Read more
source§

impl Debug for Group

source§

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

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

impl Display for Group

Prints the group as a string that should be losslessly convertible back +

Trait Implementations§

source§

impl Clone for Group

source§

fn clone(&self) -> Group

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

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

Performs copy-assignment from source. Read more
source§

impl Debug for Group

source§

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

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

impl Display for Group

Prints the group as a string that should be losslessly convertible back into the same group (modulo spans), except for possibly TokenTree::Groups with Delimiter::None delimiters.

-
source§

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

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

impl From<Group> for TokenTree

source§

fn from(g: Group) -> Self

Converts to this type from the input type.

Auto Trait Implementations§

§

impl Freeze for Group

§

impl RefUnwindSafe for Group

§

impl !Send for Group

§

impl !Sync for Group

§

impl Unpin for Group

§

impl UnwindSafe for Group

Blanket Implementations§

source§

impl<T> Any for T
where +
source§

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

Formats the value using the given formatter. Read more

source§

impl From<Group> for TokenTree

source§

fn from(g: Group) -> Self

Converts to this type from the input type.

Auto Trait Implementations§

§

impl Freeze for Group

§

impl RefUnwindSafe for Group

§

impl !Send for Group

§

impl !Sync for Group

§

impl Unpin for Group

§

impl UnwindSafe for Group

Blanket Implementations§

source§

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

source§

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more
source§

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

source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
source§

impl<T> BorrowMut<T> for T
where 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.

diff --git a/proc_macro2/struct.Ident.html b/proc_macro2/struct.Ident.html index 7a4a6a74a9..95f48f4f68 100644 --- a/proc_macro2/struct.Ident.html +++ b/proc_macro2/struct.Ident.html @@ -1,5 +1,5 @@ -Ident in proc_macro2 - Rust
-

Struct proc_macro2::Ident

source · 
pub struct Ident { /* private fields */ }
Expand description

A word of Rust code, which may be a keyword or legal variable name.

+Ident in proc_macro2 - Rust
+

Struct proc_macro2::Ident

source · 
pub struct Ident { /* private fields */ }
Expand description

A word of Rust code, which may be a keyword or legal variable name.

An identifier consists of at least one Unicode code point, the first of which has the XID_Start property and the rest of which have the XID_Continue property.

@@ -46,7 +46,7 @@

§Examples

if ident_string.len() > 60 { println!("Very long identifier: {}", ident_string) }
-

Implementations§

source§

impl Ident

source

pub fn new(string: &str, span: Span) -> Self

Creates a new Ident with the given string as well as the specified +

Implementations§

source§

impl Ident

source

pub fn new(string: &str, span: Span) -> Self

Creates a new Ident with the given string as well as the specified span.

The string argument must be a valid identifier permitted by the language, otherwise the function will panic.

@@ -70,29 +70,29 @@
§Panics
style="padding-right:0;">syn::parse_str::<Ident> rather than Ident::new.

-
source

pub fn new_raw(string: &str, span: Span) -> Self

Same as Ident::new, but creates a raw identifier (r#ident). The +

source

pub fn new_raw(string: &str, span: Span) -> Self

Same as Ident::new, but creates a raw identifier (r#ident). The string argument must be a valid identifier permitted by the language (including keywords, e.g. fn). Keywords which are usable in path segments (e.g. self, super) are not supported, and will cause a panic.

-
source

pub fn span(&self) -> Span

Returns the span of this Ident.

-
source

pub fn set_span(&mut self, span: Span)

Configures the span of this Ident, possibly changing its hygiene +

source

pub fn span(&self) -> Span

Returns the span of this Ident.

+
source

pub fn set_span(&mut self, span: Span)

Configures the span of this Ident, possibly changing its hygiene context.

-

Trait Implementations§

source§

impl Clone for Ident

source§

fn clone(&self) -> Ident

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 Ident

source§

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

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

impl Display for Ident

Prints the identifier as a string that should be losslessly convertible back +

Trait Implementations§

source§

impl Clone for Ident

source§

fn clone(&self) -> Ident

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 Ident

source§

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

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

impl Display for Ident

Prints the identifier as a string that should be losslessly convertible back into the same identifier.

-
source§

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

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

impl From<Ident> for TokenTree

source§

fn from(g: Ident) -> Self

Converts to this type from the input type.
source§

impl Hash for Ident

source§

fn hash<H: Hasher>(&self, hasher: &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 +
source§

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

Formats the value using the given formatter. Read more

source§

impl From<Ident> for TokenTree

source§

fn from(g: Ident) -> Self

Converts to this type from the input type.
source§

impl Hash for Ident

source§

fn hash<H: Hasher>(&self, hasher: &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 Ident

source§

fn cmp(&self, other: &Ident) -> Ordering

This method returns an Ordering between self and other. Read more
1.21.0 · source§

fn max(self, other: Self) -> Self
where + Self: Sized,

Feeds a slice of this type into the given Hasher. Read more
source§

impl Ord for Ident

source§

fn cmp(&self, other: &Ident) -> Ordering

This method returns an Ordering between self and other. Read more
1.21.0 · source§

fn max(self, other: Self) -> Self
where Self: Sized,

Compares and returns the maximum of two values. Read more
1.21.0 · source§

fn min(self, other: Self) -> Self
where Self: Sized,

Compares and returns the minimum of two values. Read more
1.50.0 · source§

fn clamp(self, min: Self, max: Self) -> Self
where - Self: Sized + PartialOrd,

Restrict a value to a certain interval. Read more
source§

impl<T> PartialEq<T> for Ident
where - T: ?Sized + AsRef<str>,

source§

fn eq(&self, other: &T) -> bool

This method tests for self and other values to be equal, and is used + Self: Sized + PartialOrd,

Restrict a value to a certain interval. Read more
source§

impl<T> PartialEq<T> for Ident
where + T: ?Sized + AsRef<str>,

source§

fn eq(&self, other: &T) -> 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 PartialEq for Ident

source§

fn eq(&self, other: &Ident) -> bool

This method tests for self and other values to be equal, and is used +sufficient, and should not be overridden without very good reason.
source§

impl PartialEq for Ident

source§

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

source§

fn partial_cmp(&self, other: &Ident) -> 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 <= +sufficient, and should not be overridden without very good reason.
source§

impl PartialOrd for Ident

source§

fn partial_cmp(&self, other: &Ident) -> 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 Eq for Ident

Auto Trait Implementations§

§

impl Freeze for Ident

§

impl RefUnwindSafe for Ident

§

impl !Send for Ident

§

impl !Sync for Ident

§

impl Unpin for Ident

§

impl UnwindSafe for Ident

Blanket Implementations§

source§

impl<T> Any for T
where +operator. Read more

source§

impl Eq for Ident

Auto Trait Implementations§

§

impl Freeze for Ident

§

impl RefUnwindSafe for Ident

§

impl !Send for Ident

§

impl !Sync for Ident

§

impl Unpin for Ident

§

impl UnwindSafe for Ident

Blanket Implementations§

source§

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

source§

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more
source§

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

source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
source§

impl<T> BorrowMut<T> for T
where 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.

diff --git a/proc_macro2/struct.LexError.html b/proc_macro2/struct.LexError.html index e4ccd4815d..c22806d6f8 100644 --- a/proc_macro2/struct.LexError.html +++ b/proc_macro2/struct.LexError.html @@ -1,6 +1,6 @@ -LexError in proc_macro2 - Rust
+LexError in proc_macro2 - Rust

Struct proc_macro2::LexError

source · 
pub struct LexError { /* private fields */ }
Expand description

Error returned from TokenStream::from_str.

-

Implementations§

source§

impl LexError

source

pub fn span(&self) -> Span

Trait Implementations§

source§

impl Debug for LexError

source§

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

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

impl Display for LexError

source§

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

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

impl Error for LexError

1.30.0 · source§

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

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

fn description(&self) -> &str

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

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

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

fn provide<'a>(&'a self, 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

Auto Trait Implementations§

Blanket Implementations§

source§

impl<T> Any for T
where +

Implementations§

source§

impl LexError

source

pub fn span(&self) -> Span

Trait Implementations§

source§

impl Debug for LexError

source§

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

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

impl Display for LexError

source§

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

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

impl Error for LexError

1.30.0 · source§

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

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

fn description(&self) -> &str

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

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

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

fn provide<'a>(&'a self, 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

Auto Trait Implementations§

Blanket Implementations§

source§

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

source§

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more
source§

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

source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
source§

impl<T> BorrowMut<T> for T
where 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.

diff --git a/proc_macro2/struct.Literal.html b/proc_macro2/struct.Literal.html index 044b72a7bf..21c88eae71 100644 --- a/proc_macro2/struct.Literal.html +++ b/proc_macro2/struct.Literal.html @@ -1,10 +1,10 @@ -Literal in proc_macro2 - Rust
-

Struct proc_macro2::Literal

source · 
pub struct Literal { /* private fields */ }
Expand description

A literal string ("hello"), byte string (b"hello"), character ('a'), +Literal in proc_macro2 - Rust

+

Struct proc_macro2::Literal

source · 
pub struct Literal { /* private fields */ }
Expand description

A literal string ("hello"), byte string (b"hello"), character ('a'), byte character (b'a'), an integer or floating point number with or without a suffix (1, 1u8, 2.3, 2.3f32).

Boolean literals like true and false do not belong here, they are Idents.

-

Implementations§

source§

impl Literal

source

pub fn u8_suffixed(n: u8) -> Literal

Creates a new suffixed integer literal with the specified value.

+

Implementations§

source§

impl Literal

source

pub fn u8_suffixed(n: u8) -> Literal

Creates a new suffixed integer literal with the specified value.

This function will create an integer like 1u32 where the integer value specified is the first part of the token and the integral is also suffixed at the end. Literals created from negative numbers may @@ -13,7 +13,7 @@

Literals created through this method have the Span::call_site() span by default, which can be configured with the set_span method below.

-
source

pub fn u16_suffixed(n: u16) -> Literal

Creates a new suffixed integer literal with the specified value.

+
source

pub fn u16_suffixed(n: u16) -> Literal

Creates a new suffixed integer literal with the specified value.

This function will create an integer like 1u32 where the integer value specified is the first part of the token and the integral is also suffixed at the end. Literals created from negative numbers may @@ -22,7 +22,7 @@

Literals created through this method have the Span::call_site() span by default, which can be configured with the set_span method below.

-
source

pub fn u32_suffixed(n: u32) -> Literal

Creates a new suffixed integer literal with the specified value.

+
source

pub fn u32_suffixed(n: u32) -> Literal

Creates a new suffixed integer literal with the specified value.

This function will create an integer like 1u32 where the integer value specified is the first part of the token and the integral is also suffixed at the end. Literals created from negative numbers may @@ -31,7 +31,7 @@

Literals created through this method have the Span::call_site() span by default, which can be configured with the set_span method below.

-
source

pub fn u64_suffixed(n: u64) -> Literal

Creates a new suffixed integer literal with the specified value.

+
source

pub fn u64_suffixed(n: u64) -> Literal

Creates a new suffixed integer literal with the specified value.

This function will create an integer like 1u32 where the integer value specified is the first part of the token and the integral is also suffixed at the end. Literals created from negative numbers may @@ -40,7 +40,7 @@

Literals created through this method have the Span::call_site() span by default, which can be configured with the set_span method below.

-
source

pub fn u128_suffixed(n: u128) -> Literal

Creates a new suffixed integer literal with the specified value.

+
source

pub fn u128_suffixed(n: u128) -> Literal

Creates a new suffixed integer literal with the specified value.

This function will create an integer like 1u32 where the integer value specified is the first part of the token and the integral is also suffixed at the end. Literals created from negative numbers may @@ -49,7 +49,7 @@

Literals created through this method have the Span::call_site() span by default, which can be configured with the set_span method below.

-
source

pub fn usize_suffixed(n: usize) -> Literal

Creates a new suffixed integer literal with the specified value.

+
source

pub fn usize_suffixed(n: usize) -> Literal

Creates a new suffixed integer literal with the specified value.

This function will create an integer like 1u32 where the integer value specified is the first part of the token and the integral is also suffixed at the end. Literals created from negative numbers may @@ -58,7 +58,7 @@

Literals created through this method have the Span::call_site() span by default, which can be configured with the set_span method below.

-
source

pub fn i8_suffixed(n: i8) -> Literal

Creates a new suffixed integer literal with the specified value.

+
source

pub fn i8_suffixed(n: i8) -> Literal

Creates a new suffixed integer literal with the specified value.

This function will create an integer like 1u32 where the integer value specified is the first part of the token and the integral is also suffixed at the end. Literals created from negative numbers may @@ -67,7 +67,7 @@

Literals created through this method have the Span::call_site() span by default, which can be configured with the set_span method below.

-
source

pub fn i16_suffixed(n: i16) -> Literal

Creates a new suffixed integer literal with the specified value.

+
source

pub fn i16_suffixed(n: i16) -> Literal

Creates a new suffixed integer literal with the specified value.

This function will create an integer like 1u32 where the integer value specified is the first part of the token and the integral is also suffixed at the end. Literals created from negative numbers may @@ -76,7 +76,7 @@

Literals created through this method have the Span::call_site() span by default, which can be configured with the set_span method below.

-
source

pub fn i32_suffixed(n: i32) -> Literal

Creates a new suffixed integer literal with the specified value.

+
source

pub fn i32_suffixed(n: i32) -> Literal

Creates a new suffixed integer literal with the specified value.

This function will create an integer like 1u32 where the integer value specified is the first part of the token and the integral is also suffixed at the end. Literals created from negative numbers may @@ -85,7 +85,7 @@

Literals created through this method have the Span::call_site() span by default, which can be configured with the set_span method below.

-
source

pub fn i64_suffixed(n: i64) -> Literal

Creates a new suffixed integer literal with the specified value.

+
source

pub fn i64_suffixed(n: i64) -> Literal

Creates a new suffixed integer literal with the specified value.

This function will create an integer like 1u32 where the integer value specified is the first part of the token and the integral is also suffixed at the end. Literals created from negative numbers may @@ -94,7 +94,7 @@

Literals created through this method have the Span::call_site() span by default, which can be configured with the set_span method below.

-
source

pub fn i128_suffixed(n: i128) -> Literal

Creates a new suffixed integer literal with the specified value.

+
source

pub fn i128_suffixed(n: i128) -> Literal

Creates a new suffixed integer literal with the specified value.

This function will create an integer like 1u32 where the integer value specified is the first part of the token and the integral is also suffixed at the end. Literals created from negative numbers may @@ -103,7 +103,7 @@

Literals created through this method have the Span::call_site() span by default, which can be configured with the set_span method below.

-
source

pub fn isize_suffixed(n: isize) -> Literal

Creates a new suffixed integer literal with the specified value.

+
source

pub fn isize_suffixed(n: isize) -> Literal

Creates a new suffixed integer literal with the specified value.

This function will create an integer like 1u32 where the integer value specified is the first part of the token and the integral is also suffixed at the end. Literals created from negative numbers may @@ -112,7 +112,7 @@

Literals created through this method have the Span::call_site() span by default, which can be configured with the set_span method below.

-
source

pub fn u8_unsuffixed(n: u8) -> Literal

Creates a new unsuffixed integer literal with the specified value.

+
source

pub fn u8_unsuffixed(n: u8) -> Literal

Creates a new unsuffixed integer literal with the specified value.

This function will create an integer like 1 where the integer value specified is the first part of the token. No suffix is specified on this token, meaning that invocations like @@ -123,7 +123,7 @@

Literals created through this method have the Span::call_site() span by default, which can be configured with the set_span method below.

-
source

pub fn u16_unsuffixed(n: u16) -> Literal

Creates a new unsuffixed integer literal with the specified value.

+
source

pub fn u16_unsuffixed(n: u16) -> Literal

Creates a new unsuffixed integer literal with the specified value.

This function will create an integer like 1 where the integer value specified is the first part of the token. No suffix is specified on this token, meaning that invocations like @@ -134,7 +134,7 @@

Literals created through this method have the Span::call_site() span by default, which can be configured with the set_span method below.

-
source

pub fn u32_unsuffixed(n: u32) -> Literal

Creates a new unsuffixed integer literal with the specified value.

+
source

pub fn u32_unsuffixed(n: u32) -> Literal

Creates a new unsuffixed integer literal with the specified value.

This function will create an integer like 1 where the integer value specified is the first part of the token. No suffix is specified on this token, meaning that invocations like @@ -145,7 +145,7 @@

Literals created through this method have the Span::call_site() span by default, which can be configured with the set_span method below.

-
source

pub fn u64_unsuffixed(n: u64) -> Literal

Creates a new unsuffixed integer literal with the specified value.

+
source

pub fn u64_unsuffixed(n: u64) -> Literal

Creates a new unsuffixed integer literal with the specified value.

This function will create an integer like 1 where the integer value specified is the first part of the token. No suffix is specified on this token, meaning that invocations like @@ -156,7 +156,7 @@

Literals created through this method have the Span::call_site() span by default, which can be configured with the set_span method below.

-
source

pub fn u128_unsuffixed(n: u128) -> Literal

Creates a new unsuffixed integer literal with the specified value.

+
source

pub fn u128_unsuffixed(n: u128) -> Literal

Creates a new unsuffixed integer literal with the specified value.

This function will create an integer like 1 where the integer value specified is the first part of the token. No suffix is specified on this token, meaning that invocations like @@ -167,7 +167,7 @@

Literals created through this method have the Span::call_site() span by default, which can be configured with the set_span method below.

-
source

pub fn usize_unsuffixed(n: usize) -> Literal

Creates a new unsuffixed integer literal with the specified value.

+
source

pub fn usize_unsuffixed(n: usize) -> Literal

Creates a new unsuffixed integer literal with the specified value.

This function will create an integer like 1 where the integer value specified is the first part of the token. No suffix is specified on this token, meaning that invocations like @@ -178,7 +178,7 @@

Literals created through this method have the Span::call_site() span by default, which can be configured with the set_span method below.

-
source

pub fn i8_unsuffixed(n: i8) -> Literal

Creates a new unsuffixed integer literal with the specified value.

+
source

pub fn i8_unsuffixed(n: i8) -> Literal

Creates a new unsuffixed integer literal with the specified value.

This function will create an integer like 1 where the integer value specified is the first part of the token. No suffix is specified on this token, meaning that invocations like @@ -189,7 +189,7 @@

Literals created through this method have the Span::call_site() span by default, which can be configured with the set_span method below.

-
source

pub fn i16_unsuffixed(n: i16) -> Literal

Creates a new unsuffixed integer literal with the specified value.

+
source

pub fn i16_unsuffixed(n: i16) -> Literal

Creates a new unsuffixed integer literal with the specified value.

This function will create an integer like 1 where the integer value specified is the first part of the token. No suffix is specified on this token, meaning that invocations like @@ -200,7 +200,7 @@

Literals created through this method have the Span::call_site() span by default, which can be configured with the set_span method below.

-
source

pub fn i32_unsuffixed(n: i32) -> Literal

Creates a new unsuffixed integer literal with the specified value.

+
source

pub fn i32_unsuffixed(n: i32) -> Literal

Creates a new unsuffixed integer literal with the specified value.

This function will create an integer like 1 where the integer value specified is the first part of the token. No suffix is specified on this token, meaning that invocations like @@ -211,7 +211,7 @@

Literals created through this method have the Span::call_site() span by default, which can be configured with the set_span method below.

-
source

pub fn i64_unsuffixed(n: i64) -> Literal

Creates a new unsuffixed integer literal with the specified value.

+
source

pub fn i64_unsuffixed(n: i64) -> Literal

Creates a new unsuffixed integer literal with the specified value.

This function will create an integer like 1 where the integer value specified is the first part of the token. No suffix is specified on this token, meaning that invocations like @@ -222,7 +222,7 @@

Literals created through this method have the Span::call_site() span by default, which can be configured with the set_span method below.

-
source

pub fn i128_unsuffixed(n: i128) -> Literal

Creates a new unsuffixed integer literal with the specified value.

+
source

pub fn i128_unsuffixed(n: i128) -> Literal

Creates a new unsuffixed integer literal with the specified value.

This function will create an integer like 1 where the integer value specified is the first part of the token. No suffix is specified on this token, meaning that invocations like @@ -233,7 +233,7 @@

Literals created through this method have the Span::call_site() span by default, which can be configured with the set_span method below.

-
source

pub fn isize_unsuffixed(n: isize) -> Literal

Creates a new unsuffixed integer literal with the specified value.

+
source

pub fn isize_unsuffixed(n: isize) -> Literal

Creates a new unsuffixed integer literal with the specified value.

This function will create an integer like 1 where the integer value specified is the first part of the token. No suffix is specified on this token, meaning that invocations like @@ -244,7 +244,7 @@

Literals created through this method have the Span::call_site() span by default, which can be configured with the set_span method below.

-
source

pub fn f64_unsuffixed(f: f64) -> Literal

Creates a new unsuffixed floating-point literal.

+
source

pub fn f64_unsuffixed(f: f64) -> Literal

Creates a new unsuffixed floating-point literal.

This constructor is similar to those like Literal::i8_unsuffixed where the float’s value is emitted directly into the token but no suffix is used, so it may be inferred to be a f64 later in the compiler. @@ -254,7 +254,7 @@

§Panics

This function requires that the specified float is finite, for example if it is infinity or NaN this function will panic.

-
source

pub fn f64_suffixed(f: f64) -> Literal

Creates a new suffixed floating-point literal.

+
source

pub fn f64_suffixed(f: f64) -> Literal

Creates a new suffixed floating-point literal.

This constructor will create a literal like 1.0f64 where the value specified is the preceding part of the token and f64 is the suffix of the token. This token will always be inferred to be an f64 in the @@ -264,7 +264,7 @@

§Panics
§Panics

This function requires that the specified float is finite, for example if it is infinity or NaN this function will panic.

-
source

pub fn f32_unsuffixed(f: f32) -> Literal

Creates a new unsuffixed floating-point literal.

+
source

pub fn f32_unsuffixed(f: f32) -> Literal

Creates a new unsuffixed floating-point literal.

This constructor is similar to those like Literal::i8_unsuffixed where the float’s value is emitted directly into the token but no suffix is used, so it may be inferred to be a f64 later in the compiler. @@ -274,7 +274,7 @@

§Panics
§Panics

This function requires that the specified float is finite, for example if it is infinity or NaN this function will panic.

-
source

pub fn f32_suffixed(f: f32) -> Literal

Creates a new suffixed floating-point literal.

+
source

pub fn f32_suffixed(f: f32) -> Literal

Creates a new suffixed floating-point literal.

This constructor will create a literal like 1.0f32 where the value specified is the preceding part of the token and f32 is the suffix of the token. This token will always be inferred to be an f32 in the @@ -284,20 +284,20 @@

§Panics
§Panics

This function requires that the specified float is finite, for example if it is infinity or NaN this function will panic.

-
source

pub fn string(string: &str) -> Literal

String literal.

-
source

pub fn character(ch: char) -> Literal

Character literal.

-
source

pub fn byte_character(byte: u8) -> Literal

Byte character literal.

-
source

pub fn byte_string(bytes: &[u8]) -> Literal

Byte string literal.

-
source

pub fn c_string(string: &CStr) -> Literal

C string literal.

-
source

pub fn span(&self) -> Span

Returns the span encompassing this literal.

-
source

pub fn set_span(&mut self, span: Span)

Configures the span associated for this literal.

-
source

pub fn subspan<R: RangeBounds<usize>>(&self, range: R) -> Option<Span>

Returns a Span that is a subset of self.span() containing only +

source

pub fn string(string: &str) -> Literal

String literal.

+
source

pub fn character(ch: char) -> Literal

Character literal.

+
source

pub fn byte_character(byte: u8) -> Literal

Byte character literal.

+
source

pub fn byte_string(bytes: &[u8]) -> Literal

Byte string literal.

+
source

pub fn c_string(string: &CStr) -> Literal

C string literal.

+
source

pub fn span(&self) -> Span

Returns the span encompassing this literal.

+
source

pub fn set_span(&mut self, span: Span)

Configures the span associated for this literal.

+
source

pub fn subspan<R: RangeBounds<usize>>(&self, range: R) -> Option<Span>

Returns a Span that is a subset of self.span() containing only the source bytes in range range. Returns None if the would-be trimmed span is outside the bounds of self.

Warning: the underlying proc_macro::Literal::subspan method is nightly-only. When called from within a procedural macro not using a nightly compiler, this method will always return None.

-

Trait Implementations§

source§

impl Clone for Literal

source§

fn clone(&self) -> Literal

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 Literal

source§

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

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

impl Display for Literal

source§

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

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

impl From<Literal> for TokenTree

source§

fn from(g: Literal) -> Self

Converts to this type from the input type.
source§

impl FromStr for Literal

§

type Err = LexError

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

fn from_str(repr: &str) -> Result<Self, LexError>

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

Auto Trait Implementations§

Blanket Implementations§

source§

impl<T> Any for T
where +

Trait Implementations§

source§

impl Clone for Literal

source§

fn clone(&self) -> Literal

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 Literal

source§

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

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

impl Display for Literal

source§

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

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

impl From<Literal> for TokenTree

source§

fn from(g: Literal) -> Self

Converts to this type from the input type.
source§

impl FromStr for Literal

§

type Err = LexError

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

fn from_str(repr: &str) -> Result<Self, LexError>

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

Auto Trait Implementations§

Blanket Implementations§

source§

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

source§

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more
source§

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

source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
source§

impl<T> BorrowMut<T> for T
where 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.

diff --git a/proc_macro2/struct.Punct.html b/proc_macro2/struct.Punct.html index 2f740ea83a..e4bbd1b3ef 100644 --- a/proc_macro2/struct.Punct.html +++ b/proc_macro2/struct.Punct.html @@ -1,23 +1,23 @@ -Punct in proc_macro2 - Rust
-

Struct proc_macro2::Punct

source · 
pub struct Punct { /* private fields */ }
Expand description

A Punct is a single punctuation character like +, - or #.

+Punct in proc_macro2 - Rust
+

Struct proc_macro2::Punct

source · 
pub struct Punct { /* private fields */ }
Expand description

A Punct is a single punctuation character like +, - or #.

Multicharacter operators like += are represented as two instances of Punct with different forms of Spacing returned.

-

Implementations§

source§

impl Punct

source

pub fn new(ch: char, spacing: Spacing) -> Self

Creates a new Punct from the given character and spacing.

+

Implementations§

source§

impl Punct

source

pub fn new(ch: char, spacing: Spacing) -> Self

Creates a new Punct from the given character and spacing.

The ch argument must be a valid punctuation character permitted by the language, otherwise the function will panic.

The returned Punct will have the default span of Span::call_site() which can be further configured with the set_span method below.

-
source

pub fn as_char(&self) -> char

Returns the value of this punctuation character as char.

-
source

pub fn spacing(&self) -> Spacing

Returns the spacing of this punctuation character, indicating whether +

source

pub fn as_char(&self) -> char

Returns the value of this punctuation character as char.

+
source

pub fn spacing(&self) -> Spacing

Returns the spacing of this punctuation character, indicating whether it’s immediately followed by another Punct in the token stream, so they can potentially be combined into a multicharacter operator (Joint), or it’s followed by some other token or whitespace (Alone) so the operator has certainly ended.

-
source

pub fn span(&self) -> Span

Returns the span for this punctuation character.

-
source

pub fn set_span(&mut self, span: Span)

Configure the span for this punctuation character.

-

Trait Implementations§

source§

impl Clone for Punct

source§

fn clone(&self) -> Punct

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 Punct

source§

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

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

impl Display for Punct

Prints the punctuation character as a string that should be losslessly +

source

pub fn span(&self) -> Span

Returns the span for this punctuation character.

+
source

pub fn set_span(&mut self, span: Span)

Configure the span for this punctuation character.

+

Trait Implementations§

source§

impl Clone for Punct

source§

fn clone(&self) -> Punct

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 Punct

source§

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

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

impl Display for Punct

Prints the punctuation character as a string that should be losslessly convertible back into the same character.

-
source§

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

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

impl From<Punct> for TokenTree

source§

fn from(g: Punct) -> Self

Converts to this type from the input type.

Auto Trait Implementations§

§

impl Freeze for Punct

§

impl RefUnwindSafe for Punct

§

impl !Send for Punct

§

impl !Sync for Punct

§

impl Unpin for Punct

§

impl UnwindSafe for Punct

Blanket Implementations§

source§

impl<T> Any for T
where +
source§

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

Formats the value using the given formatter. Read more

source§

impl From<Punct> for TokenTree

source§

fn from(g: Punct) -> Self

Converts to this type from the input type.

Auto Trait Implementations§

§

impl Freeze for Punct

§

impl RefUnwindSafe for Punct

§

impl !Send for Punct

§

impl !Sync for Punct

§

impl Unpin for Punct

§

impl UnwindSafe for Punct

Blanket Implementations§

source§

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

source§

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more
source§

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

source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
source§

impl<T> BorrowMut<T> for T
where 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.

diff --git a/proc_macro2/struct.Span.html b/proc_macro2/struct.Span.html index 0599e5b666..d0085d0797 100644 --- a/proc_macro2/struct.Span.html +++ b/proc_macro2/struct.Span.html @@ -1,4 +1,4 @@ -Span in proc_macro2 - Rust
+Span in proc_macro2 - Rust

Struct proc_macro2::Span

source · 
pub struct Span { /* private fields */ }
Expand description

A region of source code, along with macro expansion information.

Implementations§

source§

impl Span

source

pub fn call_site() -> Self

The span of the invocation of the current procedural macro.

Identifiers created with this span will be resolved as if they were diff --git a/proc_macro2/struct.TokenStream.html b/proc_macro2/struct.TokenStream.html index 1efbeda2ae..7aaddb7057 100644 --- a/proc_macro2/struct.TokenStream.html +++ b/proc_macro2/struct.TokenStream.html @@ -1,4 +1,4 @@ -TokenStream in proc_macro2 - Rust

+TokenStream in proc_macro2 - Rust

Struct proc_macro2::TokenStream

source · 
pub struct TokenStream { /* private fields */ }
Expand description

An abstract stream of tokens, or more concretely a sequence of token trees.

This type provides interfaces for iterating over token trees and for collecting token trees into one stream.

@@ -13,14 +13,14 @@ convertible back into the same token stream (modulo spans), except for possibly TokenTree::Groups with Delimiter::None delimiters and negative numeric literals.

-
source§

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

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

impl Extend<TokenStream> for TokenStream

source§

fn extend<I: IntoIterator<Item = TokenStream>>(&mut self, streams: I)

Extends a collection with the contents of an iterator. Read more
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 Extend<TokenTree> for TokenStream

source§

fn extend<I: IntoIterator<Item = TokenTree>>(&mut self, streams: I)

Extends a collection with the contents of an iterator. Read more
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 From<TokenStream> for TokenStream

source§

fn from(inner: TokenStream) -> Self

Converts to this type from the input type.
source§

impl From<TokenStream> for TokenStream

source§

fn from(inner: TokenStream) -> Self

Converts to this type from the input type.
source§

impl From<TokenTree> for TokenStream

source§

fn from(token: TokenTree) -> Self

Converts to this type from the input type.
source§

impl FromIterator<TokenStream> for TokenStream

source§

fn from_iter<I: IntoIterator<Item = TokenStream>>(streams: I) -> Self

Creates a value from an iterator. Read more
source§

impl FromIterator<TokenTree> for TokenStream

Collects a number of token trees into a single stream.

-
source§

fn from_iter<I: IntoIterator<Item = TokenTree>>(streams: I) -> Self

Creates a value from an iterator. Read more
source§

impl FromStr for TokenStream

Attempts to break the string into tokens and parse those tokens into a token +

source§

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

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

impl Extend<TokenStream> for TokenStream

source§

fn extend<I: IntoIterator<Item = TokenStream>>(&mut self, streams: I)

Extends a collection with the contents of an iterator. Read more
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 Extend<TokenTree> for TokenStream

source§

fn extend<I: IntoIterator<Item = TokenTree>>(&mut self, streams: I)

Extends a collection with the contents of an iterator. Read more
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 From<TokenStream> for TokenStream

source§

fn from(inner: TokenStream) -> Self

Converts to this type from the input type.
source§

impl From<TokenStream> for TokenStream

source§

fn from(inner: TokenStream) -> Self

Converts to this type from the input type.
source§

impl From<TokenTree> for TokenStream

source§

fn from(token: TokenTree) -> Self

Converts to this type from the input type.
source§

impl FromIterator<TokenStream> for TokenStream

source§

fn from_iter<I: IntoIterator<Item = TokenStream>>(streams: I) -> Self

Creates a value from an iterator. Read more
source§

impl FromIterator<TokenTree> for TokenStream

Collects a number of token trees into a single stream.

+
source§

fn from_iter<I: IntoIterator<Item = TokenTree>>(streams: I) -> Self

Creates a value from an iterator. Read more
source§

impl FromStr for TokenStream

Attempts to break the string into tokens and parse those tokens into a token stream.

May fail for a number of reasons, for example, if the string contains unbalanced delimiters or characters not existing in the language.

NOTE: Some errors may cause panics instead of returning LexError. We reserve the right to change these errors into LexErrors later.

-
§

type Err = LexError

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

fn from_str(src: &str) -> Result<TokenStream, LexError>

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

impl IntoIterator for TokenStream

§

type Item = TokenTree

The type of the elements being iterated over.
§

type IntoIter = IntoIter

Which kind of iterator are we turning this into?
source§

fn into_iter(self) -> IntoIter ⓘ

Creates an iterator from a value. Read more

Auto Trait Implementations§

Blanket Implementations§

source§

impl<T> Any for T
where +
§

type Err = LexError

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

fn from_str(src: &str) -> Result<TokenStream, LexError>

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

source§

impl IntoIterator for TokenStream

§

type Item = TokenTree

The type of the elements being iterated over.
§

type IntoIter = IntoIter

Which kind of iterator are we turning this into?
source§

fn into_iter(self) -> IntoIter ⓘ

Creates an iterator from a value. Read more

Auto Trait Implementations§

Blanket Implementations§

source§

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

source§

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more
source§

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

source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
source§

impl<T> BorrowMut<T> for T
where 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.

diff --git a/proc_macro2/token_stream/index.html b/proc_macro2/token_stream/index.html index e3706304d6..00b64e2539 100644 --- a/proc_macro2/token_stream/index.html +++ b/proc_macro2/token_stream/index.html @@ -1,3 +1,3 @@ -proc_macro2::token_stream - Rust
-

Module proc_macro2::token_stream

source ·
Expand description

Public implementation details for the TokenStream type, such as iterators.

+proc_macro2::token_stream - Rust
+

Module proc_macro2::token_stream

source ·
Expand description

Public implementation details for the TokenStream type, such as iterators.

Re-exports§

Structs§

  • IntoIter
    An iterator over TokenStream’s TokenTrees.
\ No newline at end of file diff --git a/proc_macro2/token_stream/struct.IntoIter.html b/proc_macro2/token_stream/struct.IntoIter.html index ef65809dcd..7c9fddf00d 100644 --- a/proc_macro2/token_stream/struct.IntoIter.html +++ b/proc_macro2/token_stream/struct.IntoIter.html @@ -1,8 +1,8 @@ -IntoIter in proc_macro2::token_stream - Rust
-

Struct proc_macro2::token_stream::IntoIter

source · 
pub struct IntoIter { /* private fields */ }
Expand description

An iterator over TokenStream’s TokenTrees.

+IntoIter in proc_macro2::token_stream - Rust
+

Struct proc_macro2::token_stream::IntoIter

source · 
pub struct IntoIter { /* private fields */ }
Expand description

An iterator over TokenStream’s TokenTrees.

The iteration is “shallow”, e.g. the iterator doesn’t recurse into delimited groups, and returns whole groups as token trees.

-

Trait Implementations§

source§

impl Clone for IntoIter

source§

fn clone(&self) -> IntoIter ⓘ

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 IntoIter

source§

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

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

impl Iterator for IntoIter

§

type Item = TokenTree

The type of the elements being iterated over.
source§

fn next(&mut self) -> Option<TokenTree>

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>( +

Trait Implementations§

source§

impl Clone for IntoIter

source§

fn clone(&self) -> IntoIter ⓘ

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 IntoIter

source§

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

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

impl Iterator for IntoIter

§

type Item = TokenTree

The type of the elements being iterated over.
source§

fn next(&mut self) -> Option<TokenTree>

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) -> usize
where diff --git a/quote/trait.ToTokens.html b/quote/trait.ToTokens.html index ff30eadd91..ad89e50165 100644 --- a/quote/trait.ToTokens.html +++ b/quote/trait.ToTokens.html @@ -42,4 +42,4 @@
§Example
Self: Sized,

Convert self directly into a TokenStream object.

This method is implicitly implemented using to_tokens, and acts as a convenience method for consumers of the ToTokens trait.

-

Implementations on Foreign Types§

source§

impl ToTokens for TokenTree

source§

fn to_tokens(&self, dst: &mut TokenStream)

source§

impl ToTokens for bool

source§

fn to_tokens(&self, tokens: &mut TokenStream)

source§

impl ToTokens for char

source§

fn to_tokens(&self, tokens: &mut TokenStream)

source§

impl ToTokens for f32

source§

fn to_tokens(&self, tokens: &mut TokenStream)

source§

impl ToTokens for f64

source§

fn to_tokens(&self, tokens: &mut TokenStream)

source§

impl ToTokens for i8

source§

fn to_tokens(&self, tokens: &mut TokenStream)

source§

impl ToTokens for i16

source§

fn to_tokens(&self, tokens: &mut TokenStream)

source§

impl ToTokens for i32

source§

fn to_tokens(&self, tokens: &mut TokenStream)

source§

impl ToTokens for i64

source§

fn to_tokens(&self, tokens: &mut TokenStream)

source§

impl ToTokens for i128

source§

fn to_tokens(&self, tokens: &mut TokenStream)

source§

impl ToTokens for isize

source§

fn to_tokens(&self, tokens: &mut TokenStream)

source§

impl ToTokens for str

source§

fn to_tokens(&self, tokens: &mut TokenStream)

source§

impl ToTokens for u8

source§

fn to_tokens(&self, tokens: &mut TokenStream)

source§

impl ToTokens for u16

source§

fn to_tokens(&self, tokens: &mut TokenStream)

source§

impl ToTokens for u32

source§

fn to_tokens(&self, tokens: &mut TokenStream)

source§

impl ToTokens for u64

source§

fn to_tokens(&self, tokens: &mut TokenStream)

source§

impl ToTokens for u128

source§

fn to_tokens(&self, tokens: &mut TokenStream)

source§

impl ToTokens for usize

source§

fn to_tokens(&self, tokens: &mut TokenStream)

source§

impl ToTokens for Group

source§

fn to_tokens(&self, tokens: &mut TokenStream)

source§

impl ToTokens for Ident

source§

fn to_tokens(&self, tokens: &mut TokenStream)

source§

impl ToTokens for Literal

source§

fn to_tokens(&self, tokens: &mut TokenStream)

source§

impl ToTokens for Punct

source§

fn to_tokens(&self, tokens: &mut TokenStream)

source§

impl ToTokens for TokenStream

source§

fn to_tokens(&self, dst: &mut TokenStream)

source§

fn into_token_stream(self) -> TokenStream

source§

impl ToTokens for String

source§

fn to_tokens(&self, tokens: &mut TokenStream)

source§

impl<'a, T: ?Sized + ToOwned + ToTokens> ToTokens for Cow<'a, T>

source§

fn to_tokens(&self, tokens: &mut TokenStream)

source§

impl<'a, T: ?Sized + ToTokens> ToTokens for &'a T

source§

fn to_tokens(&self, tokens: &mut TokenStream)

source§

impl<'a, T: ?Sized + ToTokens> ToTokens for &'a mut T

source§

fn to_tokens(&self, tokens: &mut TokenStream)

source§

impl<T: ToTokens> ToTokens for Option<T>

source§

fn to_tokens(&self, tokens: &mut TokenStream)

source§

impl<T: ?Sized + ToTokens> ToTokens for Box<T>

source§

fn to_tokens(&self, tokens: &mut TokenStream)

source§

impl<T: ?Sized + ToTokens> ToTokens for Rc<T>

source§

fn to_tokens(&self, tokens: &mut TokenStream)

Implementors§

\ No newline at end of file +

Implementations on Foreign Types§

source§

impl ToTokens for TokenTree

source§

fn to_tokens(&self, dst: &mut TokenStream)

source§

impl ToTokens for bool

source§

fn to_tokens(&self, tokens: &mut TokenStream)

source§

impl ToTokens for char

source§

fn to_tokens(&self, tokens: &mut TokenStream)

source§

impl ToTokens for f32

source§

fn to_tokens(&self, tokens: &mut TokenStream)

source§

impl ToTokens for f64

source§

fn to_tokens(&self, tokens: &mut TokenStream)

source§

impl ToTokens for i8

source§

fn to_tokens(&self, tokens: &mut TokenStream)

source§

impl ToTokens for i16

source§

fn to_tokens(&self, tokens: &mut TokenStream)

source§

impl ToTokens for i32

source§

fn to_tokens(&self, tokens: &mut TokenStream)

source§

impl ToTokens for i64

source§

fn to_tokens(&self, tokens: &mut TokenStream)

source§

impl ToTokens for i128

source§

fn to_tokens(&self, tokens: &mut TokenStream)

source§

impl ToTokens for isize

source§

fn to_tokens(&self, tokens: &mut TokenStream)

source§

impl ToTokens for str

source§

fn to_tokens(&self, tokens: &mut TokenStream)

source§

impl ToTokens for u8

source§

fn to_tokens(&self, tokens: &mut TokenStream)

source§

impl ToTokens for u16

source§

fn to_tokens(&self, tokens: &mut TokenStream)

source§

impl ToTokens for u32

source§

fn to_tokens(&self, tokens: &mut TokenStream)

source§

impl ToTokens for u64

source§

fn to_tokens(&self, tokens: &mut TokenStream)

source§

impl ToTokens for u128

source§

fn to_tokens(&self, tokens: &mut TokenStream)

source§

impl ToTokens for usize

source§

fn to_tokens(&self, tokens: &mut TokenStream)

source§

impl ToTokens for Group

source§

fn to_tokens(&self, tokens: &mut TokenStream)

source§

impl ToTokens for Ident

source§

fn to_tokens(&self, tokens: &mut TokenStream)

source§

impl ToTokens for Literal

source§

fn to_tokens(&self, tokens: &mut TokenStream)

source§

impl ToTokens for Punct

source§

fn to_tokens(&self, tokens: &mut TokenStream)

source§

impl ToTokens for TokenStream

source§

fn to_tokens(&self, dst: &mut TokenStream)

source§

fn into_token_stream(self) -> TokenStream

source§

impl ToTokens for String

source§

fn to_tokens(&self, tokens: &mut TokenStream)

source§

impl<'a, T: ?Sized + ToOwned + ToTokens> ToTokens for Cow<'a, T>

source§

fn to_tokens(&self, tokens: &mut TokenStream)

source§

impl<'a, T: ?Sized + ToTokens> ToTokens for &'a T

source§

fn to_tokens(&self, tokens: &mut TokenStream)

source§

impl<'a, T: ?Sized + ToTokens> ToTokens for &'a mut T

source§

fn to_tokens(&self, tokens: &mut TokenStream)

source§

impl<T: ToTokens> ToTokens for Option<T>

source§

fn to_tokens(&self, tokens: &mut TokenStream)

source§

impl<T: ?Sized + ToTokens> ToTokens for Box<T>

source§

fn to_tokens(&self, tokens: &mut TokenStream)

source§

impl<T: ?Sized + ToTokens> ToTokens for Rc<T>

source§

fn to_tokens(&self, tokens: &mut TokenStream)

Implementors§

\ No newline at end of file diff --git a/regex/bytes/struct.Captures.html b/regex/bytes/struct.Captures.html index c1a9cc26f7..5a97534820 100644 --- a/regex/bytes/struct.Captures.html +++ b/regex/bytes/struct.Captures.html @@ -223,9 +223,9 @@
§Example
&str returned by this implementation is the lifetime of the Captures value itself.

'n is the lifetime of the group name used to index the Captures value.

-

§Panics

+

§Panics

If there is no matching group at the given name.

-
§

type Output = [u8]

The returned type after indexing.
source§

fn index<'a>(&'a self, name: &'n str) -> &'a [u8] ⓘ

Performs the indexing (container[index]) operation. Read more
source§

impl<'h> Index<usize> for Captures<'h>

Get a matching capture group’s haystack substring by index.

+
§

type Output = [u8]

The returned type after indexing.
source§

fn index<'a>(&'a self, name: &'n str) -> &'a [u8] ⓘ

Performs the indexing (container[index]) operation. Read more
source§

impl<'h> Index<usize> for Captures<'h>

Get a matching capture group’s haystack substring by index.

The haystack substring returned can’t outlive the Captures object if this method is used, because of how Index is defined (normally a[i] is part of a and can’t outlive it). To work around this limitation, do that, use @@ -233,9 +233,9 @@

§Panics

'h is the lifetime of the matched haystack, but the lifetime of the &str returned by this implementation is the lifetime of the Captures value itself.

-

§Panics

+

§Panics

If there is no matching group at the given index.

-
§

type Output = [u8]

The returned type after indexing.
source§

fn index<'a>(&'a self, i: usize) -> &'a [u8] ⓘ

Performs the indexing (container[index]) operation. Read more

Auto Trait Implementations§

§

impl<'h> Freeze for Captures<'h>

§

impl<'h> RefUnwindSafe for Captures<'h>

§

impl<'h> Send for Captures<'h>

§

impl<'h> Sync for Captures<'h>

§

impl<'h> Unpin for Captures<'h>

§

impl<'h> UnwindSafe for Captures<'h>

Blanket Implementations§

source§

impl<T> Any for T
where +
§

type Output = [u8]

The returned type after indexing.
source§

fn index<'a>(&'a self, i: usize) -> &'a [u8] ⓘ

Performs the indexing (container[index]) operation. Read more

Auto Trait Implementations§

§

impl<'h> Freeze for Captures<'h>

§

impl<'h> RefUnwindSafe for Captures<'h>

§

impl<'h> Send for Captures<'h>

§

impl<'h> Sync for Captures<'h>

§

impl<'h> Unpin for Captures<'h>

§

impl<'h> UnwindSafe for Captures<'h>

Blanket Implementations§

source§

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

source§

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more
source§

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

source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
source§

impl<T> BorrowMut<T> for T
where 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.

diff --git a/regex/bytes/struct.Regex.html b/regex/bytes/struct.Regex.html index 25a110a09f..4365fef114 100644 --- a/regex/bytes/struct.Regex.html +++ b/regex/bytes/struct.Regex.html @@ -932,12 +932,12 @@
§Example
assert_eq!(locs.get(1), Some((0, 1))); assert_eq!(locs.get(2), Some((1, 2))); assert_eq!(locs.get(3), Some((2, 6)));
-

Trait Implementations§

source§

impl Clone for Regex

source§

fn clone(&self) -> Regex

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 Regex

source§

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

Shows the original regular expression.

-
source§

impl Display for Regex

source§

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

Shows the original regular expression.

+

Trait Implementations§

source§

impl Clone for Regex

source§

fn clone(&self) -> Regex

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 Regex

source§

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

Shows the original regular expression.

+
source§

impl Display for Regex

source§

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

Shows the original regular expression.

source§

impl FromStr for Regex

source§

fn from_str(s: &str) -> Result<Regex, Error>

Attempts to parse a string into a regular expression

-
§

type Err = Error

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

impl TryFrom<&str> for Regex

source§

fn try_from(s: &str) -> Result<Regex, Error>

Attempts to parse a string into a regular expression

-
§

type Error = Error

The type returned in the event of a conversion error.
source§

impl TryFrom<String> for Regex

source§

fn try_from(s: String) -> Result<Regex, Error>

Attempts to parse a string into a regular expression

-
§

type Error = Error

The type returned in the event of a conversion error.

Auto Trait Implementations§

§

impl Freeze for Regex

§

impl RefUnwindSafe for Regex

§

impl Send for Regex

§

impl Sync for Regex

§

impl Unpin for Regex

§

impl UnwindSafe for Regex

Blanket Implementations§

source§

impl<T> Any for T
where +

§

type Err = Error

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

impl TryFrom<&str> for Regex

source§

fn try_from(s: &str) -> Result<Regex, Error>

Attempts to parse a string into a regular expression

+
§

type Error = Error

The type returned in the event of a conversion error.
source§

impl TryFrom<String> for Regex

source§

fn try_from(s: String) -> Result<Regex, Error>

Attempts to parse a string into a regular expression

+
§

type Error = Error

The type returned in the event of a conversion error.

Auto Trait Implementations§

§

impl Freeze for Regex

§

impl RefUnwindSafe for Regex

§

impl Send for Regex

§

impl Sync for Regex

§

impl Unpin for Regex

§

impl UnwindSafe for Regex

Blanket Implementations§

source§

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

source§

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more
source§

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

source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
source§

impl<T> BorrowMut<T> for T
where 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.

diff --git a/regex/bytes/struct.SetMatches.html b/regex/bytes/struct.SetMatches.html index 643fd9edcc..c08bbf35c2 100644 --- a/regex/bytes/struct.SetMatches.html +++ b/regex/bytes/struct.SetMatches.html @@ -81,7 +81,7 @@
§Example
matches.push(index); } assert_eq!(matches, vec![0, 1, 3]);
-

Trait Implementations§

source§

impl Clone for SetMatches

source§

fn clone(&self) -> SetMatches

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 SetMatches

source§

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

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

impl<'a> IntoIterator for &'a SetMatches

§

type IntoIter = SetMatchesIter<'a>

Which kind of iterator are we turning this into?
§

type Item = usize

The type of the elements being iterated over.
source§

fn into_iter(self) -> Self::IntoIter

Creates an iterator from a value. Read more
source§

impl IntoIterator for SetMatches

§

type IntoIter = SetMatchesIntoIter

Which kind of iterator are we turning this into?
§

type Item = usize

The type of the elements being iterated over.
source§

fn into_iter(self) -> Self::IntoIter

Creates an iterator from a value. Read more

Auto Trait Implementations§

Blanket Implementations§

source§

impl<T> Any for T
where +

Trait Implementations§

source§

impl Clone for SetMatches

source§

fn clone(&self) -> SetMatches

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 SetMatches

source§

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

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

impl<'a> IntoIterator for &'a SetMatches

§

type IntoIter = SetMatchesIter<'a>

Which kind of iterator are we turning this into?
§

type Item = usize

The type of the elements being iterated over.
source§

fn into_iter(self) -> Self::IntoIter

Creates an iterator from a value. Read more
source§

impl IntoIterator for SetMatches

§

type IntoIter = SetMatchesIntoIter

Which kind of iterator are we turning this into?
§

type Item = usize

The type of the elements being iterated over.
source§

fn into_iter(self) -> Self::IntoIter

Creates an iterator from a value. Read more

Auto Trait Implementations§

Blanket Implementations§

source§

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

source§

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more
source§

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

source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
source§

impl<T> BorrowMut<T> for T
where 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.

diff --git a/regex/enum.Error.html b/regex/enum.Error.html index 6b9e10d8cb..09e7cb5289 100644 --- a/regex/enum.Error.html +++ b/regex/enum.Error.html @@ -22,7 +22,7 @@ your regex pattern is not from a trusted source, then neither of these approaches may be appropriate. Instead, you’ll have to determine just how big of a regex you want to allow.

-

Trait Implementations§

source§

impl Clone for Error

source§

fn clone(&self) -> Error

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 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, f: &mut Formatter<'_>) -> Result

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

impl Error for Error

source§

fn description(&self) -> &str

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

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

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

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

👎Deprecated since 1.33.0: replaced by Error::source, which can support downcasting
source§

fn provide<'a>(&'a self, 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 PartialEq for Error

source§

fn eq(&self, other: &Error) -> bool

This method tests for self and other values to be equal, and is used +

Trait Implementations§

source§

impl Clone for Error

source§

fn clone(&self) -> Error

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 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, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter. Read more
source§

impl Error for Error

source§

fn description(&self) -> &str

👎Deprecated since 1.42.0: use the Display impl or to_string()
Read more
1.30.0 · source§

fn source(&self) -> Option<&(dyn Error + 'static)>

The lower-level source of this error, if any. Read more
1.0.0 · source§

fn cause(&self) -> Option<&dyn Error>

👎Deprecated since 1.33.0: replaced by Error::source, which can support downcasting
source§

fn provide<'a>(&'a self, 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 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 StructuralPartialEq for Error

Auto Trait Implementations§

§

impl Freeze for Error

§

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 T
where T: 'static + ?Sized,

source§

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more
source§

impl<T> Borrow<T> for T
where diff --git a/regex/struct.Match.html b/regex/struct.Match.html index 8c275e2749..b379650b13 100644 --- a/regex/struct.Match.html +++ b/regex/struct.Match.html @@ -66,7 +66,7 @@

§Example

range. That is, because the offsets are guaranteed to fall on valid UTF-8 boundaries, the range returned is always valid.

source

pub fn as_str(&self) -> &'h str

Returns the substring of the haystack that matched.

-

Trait Implementations§

source§

impl<'h> Clone for Match<'h>

source§

fn clone(&self) -> Match<'h>

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<'h> Debug for Match<'h>

source§

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter. Read more
source§

impl<'h> From<Match<'h>> for &'h str

source§

fn from(m: Match<'h>) -> &'h str

Converts to this type from the input type.
source§

impl<'h> From<Match<'h>> for Range<usize>

source§

fn from(m: Match<'h>) -> Range<usize>

Converts to this type from the input type.
source§

impl<'h> PartialEq for Match<'h>

source§

fn eq(&self, other: &Match<'h>) -> bool

This method tests for self and other values to be equal, and is used +

Trait Implementations§

source§

impl<'h> Clone for Match<'h>

source§

fn clone(&self) -> Match<'h>

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<'h> Debug for Match<'h>

source§

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter. Read more
source§

impl<'h> From<Match<'h>> for &'h str

source§

fn from(m: Match<'h>) -> &'h str

Converts to this type from the input type.
source§

impl<'h> From<Match<'h>> for Range<usize>

source§

fn from(m: Match<'h>) -> Range<usize>

Converts to this type from the input type.
source§

impl<'h> PartialEq for Match<'h>

source§

fn eq(&self, other: &Match<'h>) -> 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<'h> Copy for Match<'h>

source§

impl<'h> Eq for Match<'h>

source§

impl<'h> StructuralPartialEq for Match<'h>

Auto Trait Implementations§

§

impl<'h> Freeze for Match<'h>

§

impl<'h> RefUnwindSafe for Match<'h>

§

impl<'h> Send for Match<'h>

§

impl<'h> Sync for Match<'h>

§

impl<'h> Unpin for Match<'h>

§

impl<'h> UnwindSafe for Match<'h>

Blanket Implementations§

source§

impl<T> Any for T
where T: 'static + ?Sized,

source§

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more
source§

impl<T> Borrow<T> for T
where diff --git a/regex/struct.Regex.html b/regex/struct.Regex.html index d01fc1f876..429631803c 100644 --- a/regex/struct.Regex.html +++ b/regex/struct.Regex.html @@ -928,9 +928,9 @@
§Example

Trait Implementations§

source§

impl Clone for Regex

source§

fn clone(&self) -> Regex

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 Regex

source§

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Shows the original regular expression.

source§

impl Display for Regex

source§

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Shows the original regular expression.

source§

impl FromStr for Regex

source§

fn from_str(s: &str) -> Result<Regex, Error>

Attempts to parse a string into a regular expression

-
§

type Err = Error

The associated error which can be returned from parsing.
source§

impl TryFrom<&str> for Regex

source§

fn try_from(s: &str) -> Result<Regex, Error>

Attempts to parse a string into a regular expression

-
§

type Error = Error

The type returned in the event of a conversion error.
source§

impl TryFrom<String> for Regex

source§

fn try_from(s: String) -> Result<Regex, Error>

Attempts to parse a string into a regular expression

-
§

type Error = Error

The type returned in the event of a conversion error.

Auto Trait Implementations§

§

impl Freeze for Regex

§

impl RefUnwindSafe for Regex

§

impl Send for Regex

§

impl Sync for Regex

§

impl Unpin for Regex

§

impl UnwindSafe for Regex

Blanket Implementations§

source§

impl<T> Any for T
where +

§

type Err = Error

The associated error which can be returned from parsing.
source§

impl TryFrom<&str> for Regex

source§

fn try_from(s: &str) -> Result<Regex, Error>

Attempts to parse a string into a regular expression

+
§

type Error = Error

The type returned in the event of a conversion error.
source§

impl TryFrom<String> for Regex

source§

fn try_from(s: String) -> Result<Regex, Error>

Attempts to parse a string into a regular expression

+
§

type Error = Error

The type returned in the event of a conversion error.

Auto Trait Implementations§

§

impl Freeze for Regex

§

impl RefUnwindSafe for Regex

§

impl Send for Regex

§

impl Sync for Regex

§

impl Unpin for Regex

§

impl UnwindSafe for Regex

Blanket Implementations§

source§

impl<T> Any for T
where T: 'static + ?Sized,

source§

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more
source§

impl<T> Borrow<T> for T
where T: ?Sized,

source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
source§

impl<T> BorrowMut<T> for T
where 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.

diff --git a/regex/struct.SetMatches.html b/regex/struct.SetMatches.html index 5d029b3e8c..c01953ad1c 100644 --- a/regex/struct.SetMatches.html +++ b/regex/struct.SetMatches.html @@ -81,7 +81,7 @@
§Example
matches.push(index); } assert_eq!(matches, vec![0, 1, 3]);
-

Trait Implementations§

source§

impl Clone for SetMatches

source§

fn clone(&self) -> SetMatches

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 SetMatches

source§

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter. Read more
source§

impl<'a> IntoIterator for &'a SetMatches

§

type IntoIter = SetMatchesIter<'a>

Which kind of iterator are we turning this into?
§

type Item = usize

The type of the elements being iterated over.
source§

fn into_iter(self) -> Self::IntoIter

Creates an iterator from a value. Read more
source§

impl IntoIterator for SetMatches

§

type IntoIter = SetMatchesIntoIter

Which kind of iterator are we turning this into?
§

type Item = usize

The type of the elements being iterated over.
source§

fn into_iter(self) -> Self::IntoIter

Creates an iterator from a value. Read more

Auto Trait Implementations§

Blanket Implementations§

source§

impl<T> Any for T
where +

Trait Implementations§

source§

impl Clone for SetMatches

source§

fn clone(&self) -> SetMatches

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 SetMatches

source§

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter. Read more
source§

impl<'a> IntoIterator for &'a SetMatches

§

type IntoIter = SetMatchesIter<'a>

Which kind of iterator are we turning this into?
§

type Item = usize

The type of the elements being iterated over.
source§

fn into_iter(self) -> Self::IntoIter

Creates an iterator from a value. Read more
source§

impl IntoIterator for SetMatches

§

type IntoIter = SetMatchesIntoIter

Which kind of iterator are we turning this into?
§

type Item = usize

The type of the elements being iterated over.
source§

fn into_iter(self) -> Self::IntoIter

Creates an iterator from a value. Read more

Auto Trait Implementations§

Blanket Implementations§

source§

impl<T> Any for T
where T: 'static + ?Sized,

source§

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more
source§

impl<T> Borrow<T> for T
where T: ?Sized,

source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
source§

impl<T> BorrowMut<T> for T
where 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.

diff --git a/regex_automata/hybrid/struct.CacheError.html b/regex_automata/hybrid/struct.CacheError.html index 8fc4454511..ad2cab7717 100644 --- a/regex_automata/hybrid/struct.CacheError.html +++ b/regex_automata/hybrid/struct.CacheError.html @@ -13,7 +13,7 @@ dfa::Config::minimum_bytes_per_state.

When the std feature is enabled, this implements the std::error::Error trait.

-

Trait Implementations§

source§

impl Clone for CacheError

source§

fn clone(&self) -> CacheError

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 CacheError

source§

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter. Read more
source§

impl Display for CacheError

source§

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter. Read more
source§

impl Error for CacheError

1.30.0 · source§

fn source(&self) -> Option<&(dyn Error + 'static)>

The lower-level source of this error, if any. Read more
1.0.0 · source§

fn description(&self) -> &str

👎Deprecated since 1.42.0: use the Display impl or to_string()
Read more
1.0.0 · source§

fn cause(&self) -> Option<&dyn Error>

👎Deprecated since 1.33.0: replaced by Error::source, which can support downcasting
source§

fn provide<'a>(&'a self, 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

Auto Trait Implementations§

Blanket Implementations§

source§

impl<T> Any for T
where +

Trait Implementations§

source§

impl Clone for CacheError

source§

fn clone(&self) -> CacheError

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 CacheError

source§

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter. Read more
source§

impl Display for CacheError

source§

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter. Read more
source§

impl Error for CacheError

1.30.0 · source§

fn source(&self) -> Option<&(dyn Error + 'static)>

The lower-level source of this error, if any. Read more
1.0.0 · source§

fn description(&self) -> &str

👎Deprecated since 1.42.0: use the Display impl or to_string()
Read more
1.0.0 · source§

fn cause(&self) -> Option<&dyn Error>

👎Deprecated since 1.33.0: replaced by Error::source, which can support downcasting
source§

fn provide<'a>(&'a self, 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

Auto Trait Implementations§

Blanket Implementations§

source§

impl<T> Any for T
where T: 'static + ?Sized,

source§

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more
source§

impl<T> Borrow<T> for T
where T: ?Sized,

source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
source§

impl<T> BorrowMut<T> for T
where 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.

diff --git a/regex_automata/struct.MatchError.html b/regex_automata/struct.MatchError.html index 9b3cc5930f..c603c8c3f6 100644 --- a/regex_automata/struct.MatchError.html +++ b/regex_automata/struct.MatchError.html @@ -61,7 +61,7 @@ regex engine.

This is the same as calling MatchError::new with a MatchErrorKind::UnsupportedAnchored kind.

-

Trait Implementations§

source§

impl Clone for MatchError

source§

fn clone(&self) -> MatchError

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 MatchError

source§

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter. Read more
source§

impl Display for MatchError

source§

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter. Read more
source§

impl Error for MatchError

1.30.0 · source§

fn source(&self) -> Option<&(dyn Error + 'static)>

The lower-level source of this error, if any. Read more
1.0.0 · source§

fn description(&self) -> &str

👎Deprecated since 1.42.0: use the Display impl or to_string()
Read more
1.0.0 · source§

fn cause(&self) -> Option<&dyn Error>

👎Deprecated since 1.33.0: replaced by Error::source, which can support downcasting
source§

fn provide<'a>(&'a self, 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 PartialEq for MatchError

source§

fn eq(&self, other: &MatchError) -> bool

This method tests for self and other values to be equal, and is used +

Trait Implementations§

source§

impl Clone for MatchError

source§

fn clone(&self) -> MatchError

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 MatchError

source§

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter. Read more
source§

impl Display for MatchError

source§

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter. Read more
source§

impl Error for MatchError

1.30.0 · source§

fn source(&self) -> Option<&(dyn Error + 'static)>

The lower-level source of this error, if any. Read more
1.0.0 · source§

fn description(&self) -> &str

👎Deprecated since 1.42.0: use the Display impl or to_string()
Read more
1.0.0 · source§

fn cause(&self) -> Option<&dyn Error>

👎Deprecated since 1.33.0: replaced by Error::source, which can support downcasting
source§

fn provide<'a>(&'a self, 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 PartialEq for MatchError

source§

fn eq(&self, other: &MatchError) -> 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 MatchError

source§

impl StructuralPartialEq for MatchError

Auto Trait Implementations§

Blanket Implementations§

source§

impl<T> Any for T
where T: 'static + ?Sized,

source§

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more
source§

impl<T> Borrow<T> for T
where diff --git a/regex_automata/struct.PatternID.html b/regex_automata/struct.PatternID.html index fcc5c13560..62951f62f8 100644 --- a/regex_automata/struct.PatternID.html +++ b/regex_automata/struct.PatternID.html @@ -50,14 +50,14 @@ format.

Trait Implementations§

source§

impl Clone for PatternID

source§

fn clone(&self) -> PatternID

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 PatternID

source§

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter. Read more
source§

impl Default for PatternID

source§

fn default() -> PatternID

Returns the “default value” for a type. Read more
source§

impl From<u8> for PatternID

source§

fn from(value: u8) -> PatternID

Converts to this type from the input type.
source§

impl Hash for PatternID

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<T> Index<PatternID> for [T]

§

type Output = T

The returned type after indexing.
source§

fn index(&self, index: PatternID) -> &T

Performs the indexing (container[index]) operation. Read more
source§

impl<T> Index<PatternID> for Vec<T>

§

type Output = T

The returned type after indexing.
source§

fn index(&self, index: PatternID) -> &T

Performs the indexing (container[index]) operation. Read more
source§

impl<T> IndexMut<PatternID> for [T]

source§

fn index_mut(&mut self, index: PatternID) -> &mut T

Performs the mutable indexing (container[index]) operation. Read more
source§

impl<T> IndexMut<PatternID> for Vec<T>

source§

fn index_mut(&mut self, index: PatternID) -> &mut T

Performs the mutable indexing (container[index]) operation. Read more
source§

impl Ord for PatternID

source§

fn cmp(&self, other: &PatternID) -> Ordering

This method returns an Ordering between self and other. Read more
1.21.0 · source§

fn max(self, other: Self) -> Self
where + Self: Sized,

Feeds a slice of this type into the given Hasher. Read more
source§

impl<T> Index<PatternID> for [T]

§

type Output = T

The returned type after indexing.
source§

fn index(&self, index: PatternID) -> &T

Performs the indexing (container[index]) operation. Read more
source§

impl<T> Index<PatternID> for Vec<T>

§

type Output = T

The returned type after indexing.
source§

fn index(&self, index: PatternID) -> &T

Performs the indexing (container[index]) operation. Read more
source§

impl<T> IndexMut<PatternID> for [T]

source§

fn index_mut(&mut self, index: PatternID) -> &mut T

Performs the mutable indexing (container[index]) operation. Read more
source§

impl<T> IndexMut<PatternID> for Vec<T>

source§

fn index_mut(&mut self, index: PatternID) -> &mut T

Performs the mutable indexing (container[index]) operation. Read more
source§

impl Ord for PatternID

source§

fn cmp(&self, other: &PatternID) -> Ordering

This method returns an Ordering between self and other. Read more
1.21.0 · source§

fn max(self, other: Self) -> Self
where Self: Sized,

Compares and returns the maximum of two values. Read more
1.21.0 · source§

fn min(self, other: Self) -> Self
where Self: Sized,

Compares and returns the minimum of two values. Read more
1.50.0 · source§

fn clamp(self, min: Self, max: Self) -> Self
where Self: Sized + PartialOrd,

Restrict a value to a certain interval. Read more
source§

impl PartialEq for PatternID

source§

fn eq(&self, other: &PatternID) -> 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 PatternID

source§

fn partial_cmp(&self, other: &PatternID) -> 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 TryFrom<u16> for PatternID

§

type Error = PatternIDError

The type returned in the event of a conversion error.
source§

fn try_from(value: u16) -> Result<PatternID, PatternIDError>

Performs the conversion.
source§

impl TryFrom<u32> for PatternID

§

type Error = PatternIDError

The type returned in the event of a conversion error.
source§

fn try_from(value: u32) -> Result<PatternID, PatternIDError>

Performs the conversion.
source§

impl TryFrom<u64> for PatternID

§

type Error = PatternIDError

The type returned in the event of a conversion error.
source§

fn try_from(value: u64) -> Result<PatternID, PatternIDError>

Performs the conversion.
source§

impl TryFrom<usize> for PatternID

§

type Error = PatternIDError

The type returned in the event of a conversion error.
source§

fn try_from(value: usize) -> Result<PatternID, PatternIDError>

Performs the conversion.
source§

impl Copy for PatternID

source§

impl Eq for PatternID

source§

impl StructuralPartialEq for PatternID

Auto Trait Implementations§

Blanket Implementations§

source§

impl<T> Any for T
where +operator. Read more

source§

impl TryFrom<u16> for PatternID

§

type Error = PatternIDError

The type returned in the event of a conversion error.
source§

fn try_from(value: u16) -> Result<PatternID, PatternIDError>

Performs the conversion.
source§

impl TryFrom<u32> for PatternID

§

type Error = PatternIDError

The type returned in the event of a conversion error.
source§

fn try_from(value: u32) -> Result<PatternID, PatternIDError>

Performs the conversion.
source§

impl TryFrom<u64> for PatternID

§

type Error = PatternIDError

The type returned in the event of a conversion error.
source§

fn try_from(value: u64) -> Result<PatternID, PatternIDError>

Performs the conversion.
source§

impl TryFrom<usize> for PatternID

§

type Error = PatternIDError

The type returned in the event of a conversion error.
source§

fn try_from(value: usize) -> Result<PatternID, PatternIDError>

Performs the conversion.
source§

impl Copy for PatternID

source§

impl Eq for PatternID

source§

impl StructuralPartialEq for PatternID

Auto Trait Implementations§

Blanket Implementations§

source§

impl<T> Any for T
where T: 'static + ?Sized,

source§

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more
source§

impl<T> Borrow<T> for T
where T: ?Sized,

source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
source§

impl<T> BorrowMut<T> for T
where 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.

diff --git a/regex_automata/struct.PatternSetInsertError.html b/regex_automata/struct.PatternSetInsertError.html index 91d1e641fe..af66344ae6 100644 --- a/regex_automata/struct.PatternSetInsertError.html +++ b/regex_automata/struct.PatternSetInsertError.html @@ -4,7 +4,7 @@

An insert fails when the given PatternID exceeds the configured capacity of the PatternSet.

This error is created by the PatternSet::try_insert routine.

-

Trait Implementations§

source§

impl Clone for PatternSetInsertError

source§

fn clone(&self) -> PatternSetInsertError

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 PatternSetInsertError

source§

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter. Read more
source§

impl Display for PatternSetInsertError

source§

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter. Read more
source§

impl Error for PatternSetInsertError

1.30.0 · source§

fn source(&self) -> Option<&(dyn Error + 'static)>

The lower-level source of this error, if any. Read more
1.0.0 · source§

fn description(&self) -> &str

👎Deprecated since 1.42.0: use the Display impl or to_string()
Read more
1.0.0 · source§

fn cause(&self) -> Option<&dyn Error>

👎Deprecated since 1.33.0: replaced by Error::source, which can support downcasting
source§

fn provide<'a>(&'a self, 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

Auto Trait Implementations§

Blanket Implementations§

source§

impl<T> Any for T
where +

Trait Implementations§

source§

impl Clone for PatternSetInsertError

source§

fn clone(&self) -> PatternSetInsertError

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 PatternSetInsertError

source§

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter. Read more
source§

impl Display for PatternSetInsertError

source§

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter. Read more
source§

impl Error for PatternSetInsertError

1.30.0 · source§

fn source(&self) -> Option<&(dyn Error + 'static)>

The lower-level source of this error, if any. Read more
1.0.0 · source§

fn description(&self) -> &str

👎Deprecated since 1.42.0: use the Display impl or to_string()
Read more
1.0.0 · source§

fn cause(&self) -> Option<&dyn Error>

👎Deprecated since 1.33.0: replaced by Error::source, which can support downcasting
source§

fn provide<'a>(&'a self, 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

Auto Trait Implementations§

Blanket Implementations§

source§

impl<T> Any for T
where T: 'static + ?Sized,

source§

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more
source§

impl<T> Borrow<T> for T
where T: ?Sized,

source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
source§

impl<T> BorrowMut<T> for T
where 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.

diff --git a/regex_automata/util/primitives/struct.PatternID.html b/regex_automata/util/primitives/struct.PatternID.html index 82c9908824..c4b12c5dd0 100644 --- a/regex_automata/util/primitives/struct.PatternID.html +++ b/regex_automata/util/primitives/struct.PatternID.html @@ -50,14 +50,14 @@ format.

Trait Implementations§

source§

impl Clone for PatternID

source§

fn clone(&self) -> PatternID

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 PatternID

source§

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter. Read more
source§

impl Default for PatternID

source§

fn default() -> PatternID

Returns the “default value” for a type. Read more
source§

impl From<u8> for PatternID

source§

fn from(value: u8) -> PatternID

Converts to this type from the input type.
source§

impl Hash for PatternID

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<T> Index<PatternID> for [T]

§

type Output = T

The returned type after indexing.
source§

fn index(&self, index: PatternID) -> &T

Performs the indexing (container[index]) operation. Read more
source§

impl<T> Index<PatternID> for Vec<T>

§

type Output = T

The returned type after indexing.
source§

fn index(&self, index: PatternID) -> &T

Performs the indexing (container[index]) operation. Read more
source§

impl<T> IndexMut<PatternID> for [T]

source§

fn index_mut(&mut self, index: PatternID) -> &mut T

Performs the mutable indexing (container[index]) operation. Read more
source§

impl<T> IndexMut<PatternID> for Vec<T>

source§

fn index_mut(&mut self, index: PatternID) -> &mut T

Performs the mutable indexing (container[index]) operation. Read more
source§

impl Ord for PatternID

source§

fn cmp(&self, other: &PatternID) -> Ordering

This method returns an Ordering between self and other. Read more
1.21.0 · source§

fn max(self, other: Self) -> Self
where + Self: Sized,

Feeds a slice of this type into the given Hasher. Read more
source§

impl<T> Index<PatternID> for [T]

§

type Output = T

The returned type after indexing.
source§

fn index(&self, index: PatternID) -> &T

Performs the indexing (container[index]) operation. Read more
source§

impl<T> Index<PatternID> for Vec<T>

§

type Output = T

The returned type after indexing.
source§

fn index(&self, index: PatternID) -> &T

Performs the indexing (container[index]) operation. Read more
source§

impl<T> IndexMut<PatternID> for [T]

source§

fn index_mut(&mut self, index: PatternID) -> &mut T

Performs the mutable indexing (container[index]) operation. Read more
source§

impl<T> IndexMut<PatternID> for Vec<T>

source§

fn index_mut(&mut self, index: PatternID) -> &mut T

Performs the mutable indexing (container[index]) operation. Read more
source§

impl Ord for PatternID

source§

fn cmp(&self, other: &PatternID) -> Ordering

This method returns an Ordering between self and other. Read more
1.21.0 · source§

fn max(self, other: Self) -> Self
where Self: Sized,

Compares and returns the maximum of two values. Read more
1.21.0 · source§

fn min(self, other: Self) -> Self
where Self: Sized,

Compares and returns the minimum of two values. Read more
1.50.0 · source§

fn clamp(self, min: Self, max: Self) -> Self
where Self: Sized + PartialOrd,

Restrict a value to a certain interval. Read more
source§

impl PartialEq for PatternID

source§

fn eq(&self, other: &PatternID) -> 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 PatternID

source§

fn partial_cmp(&self, other: &PatternID) -> 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 TryFrom<u16> for PatternID

§

type Error = PatternIDError

The type returned in the event of a conversion error.
source§

fn try_from(value: u16) -> Result<PatternID, PatternIDError>

Performs the conversion.
source§

impl TryFrom<u32> for PatternID

§

type Error = PatternIDError

The type returned in the event of a conversion error.
source§

fn try_from(value: u32) -> Result<PatternID, PatternIDError>

Performs the conversion.
source§

impl TryFrom<u64> for PatternID

§

type Error = PatternIDError

The type returned in the event of a conversion error.
source§

fn try_from(value: u64) -> Result<PatternID, PatternIDError>

Performs the conversion.
source§

impl TryFrom<usize> for PatternID

§

type Error = PatternIDError

The type returned in the event of a conversion error.
source§

fn try_from(value: usize) -> Result<PatternID, PatternIDError>

Performs the conversion.
source§

impl Copy for PatternID

source§

impl Eq for PatternID

source§

impl StructuralPartialEq for PatternID

Auto Trait Implementations§

Blanket Implementations§

source§

impl<T> Any for T
where +operator. Read more

source§

impl TryFrom<u16> for PatternID

§

type Error = PatternIDError

The type returned in the event of a conversion error.
source§

fn try_from(value: u16) -> Result<PatternID, PatternIDError>

Performs the conversion.
source§

impl TryFrom<u32> for PatternID

§

type Error = PatternIDError

The type returned in the event of a conversion error.
source§

fn try_from(value: u32) -> Result<PatternID, PatternIDError>

Performs the conversion.
source§

impl TryFrom<u64> for PatternID

§

type Error = PatternIDError

The type returned in the event of a conversion error.
source§

fn try_from(value: u64) -> Result<PatternID, PatternIDError>

Performs the conversion.
source§

impl TryFrom<usize> for PatternID

§

type Error = PatternIDError

The type returned in the event of a conversion error.
source§

fn try_from(value: usize) -> Result<PatternID, PatternIDError>

Performs the conversion.
source§

impl Copy for PatternID

source§

impl Eq for PatternID

source§

impl StructuralPartialEq for PatternID

Auto Trait Implementations§

Blanket Implementations§

source§

impl<T> Any for T
where T: 'static + ?Sized,

source§

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more
source§

impl<T> Borrow<T> for T
where T: ?Sized,

source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
source§

impl<T> BorrowMut<T> for T
where 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.

diff --git a/regex_automata/util/primitives/struct.SmallIndex.html b/regex_automata/util/primitives/struct.SmallIndex.html index 125771483c..7e79e717e3 100644 --- a/regex_automata/util/primitives/struct.SmallIndex.html +++ b/regex_automata/util/primitives/struct.SmallIndex.html @@ -83,14 +83,14 @@

§Safety

format.

Trait Implementations§

source§

impl Clone for SmallIndex

source§

fn clone(&self) -> SmallIndex

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 SmallIndex

source§

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter. Read more
source§

impl Default for SmallIndex

source§

fn default() -> SmallIndex

Returns the “default value” for a type. Read more
source§

impl From<u8> for SmallIndex

source§

fn from(index: u8) -> SmallIndex

Converts to this type from the input type.
source§

impl Hash for SmallIndex

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<T> Index<SmallIndex> for [T]

§

type Output = T

The returned type after indexing.
source§

fn index(&self, index: SmallIndex) -> &T

Performs the indexing (container[index]) operation. Read more
source§

impl<T> Index<SmallIndex> for Vec<T>

§

type Output = T

The returned type after indexing.
source§

fn index(&self, index: SmallIndex) -> &T

Performs the indexing (container[index]) operation. Read more
source§

impl<T> IndexMut<SmallIndex> for [T]

source§

fn index_mut(&mut self, index: SmallIndex) -> &mut T

Performs the mutable indexing (container[index]) operation. Read more
source§

impl<T> IndexMut<SmallIndex> for Vec<T>

source§

fn index_mut(&mut self, index: SmallIndex) -> &mut T

Performs the mutable indexing (container[index]) operation. Read more
source§

impl Ord for SmallIndex

source§

fn cmp(&self, other: &SmallIndex) -> Ordering

This method returns an Ordering between self and other. Read more
1.21.0 · source§

fn max(self, other: Self) -> Self
where + Self: Sized,

Feeds a slice of this type into the given Hasher. Read more
source§

impl<T> Index<SmallIndex> for [T]

§

type Output = T

The returned type after indexing.
source§

fn index(&self, index: SmallIndex) -> &T

Performs the indexing (container[index]) operation. Read more
source§

impl<T> Index<SmallIndex> for Vec<T>

§

type Output = T

The returned type after indexing.
source§

fn index(&self, index: SmallIndex) -> &T

Performs the indexing (container[index]) operation. Read more
source§

impl<T> IndexMut<SmallIndex> for [T]

source§

fn index_mut(&mut self, index: SmallIndex) -> &mut T

Performs the mutable indexing (container[index]) operation. Read more
source§

impl<T> IndexMut<SmallIndex> for Vec<T>

source§

fn index_mut(&mut self, index: SmallIndex) -> &mut T

Performs the mutable indexing (container[index]) operation. Read more
source§

impl Ord for SmallIndex

source§

fn cmp(&self, other: &SmallIndex) -> Ordering

This method returns an Ordering between self and other. Read more
1.21.0 · source§

fn max(self, other: Self) -> Self
where Self: Sized,

Compares and returns the maximum of two values. Read more
1.21.0 · source§

fn min(self, other: Self) -> Self
where Self: Sized,

Compares and returns the minimum of two values. Read more
1.50.0 · source§

fn clamp(self, min: Self, max: Self) -> Self
where Self: Sized + PartialOrd,

Restrict a value to a certain interval. Read more
source§

impl PartialEq for SmallIndex

source§

fn eq(&self, other: &SmallIndex) -> 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 SmallIndex

source§

fn partial_cmp(&self, other: &SmallIndex) -> 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 TryFrom<u16> for SmallIndex

§

type Error = SmallIndexError

The type returned in the event of a conversion error.
source§

fn try_from(index: u16) -> Result<SmallIndex, SmallIndexError>

Performs the conversion.
source§

impl TryFrom<u32> for SmallIndex

§

type Error = SmallIndexError

The type returned in the event of a conversion error.
source§

fn try_from(index: u32) -> Result<SmallIndex, SmallIndexError>

Performs the conversion.
source§

impl TryFrom<u64> for SmallIndex

§

type Error = SmallIndexError

The type returned in the event of a conversion error.
source§

fn try_from(index: u64) -> Result<SmallIndex, SmallIndexError>

Performs the conversion.
source§

impl TryFrom<usize> for SmallIndex

§

type Error = SmallIndexError

The type returned in the event of a conversion error.
source§

fn try_from(index: usize) -> Result<SmallIndex, SmallIndexError>

Performs the conversion.
source§

impl Copy for SmallIndex

source§

impl Eq for SmallIndex

source§

impl StructuralPartialEq for SmallIndex

Auto Trait Implementations§

Blanket Implementations§

source§

impl<T> Any for T
where +operator. Read more

source§

impl TryFrom<u16> for SmallIndex

§

type Error = SmallIndexError

The type returned in the event of a conversion error.
source§

fn try_from(index: u16) -> Result<SmallIndex, SmallIndexError>

Performs the conversion.
source§

impl TryFrom<u32> for SmallIndex

§

type Error = SmallIndexError

The type returned in the event of a conversion error.
source§

fn try_from(index: u32) -> Result<SmallIndex, SmallIndexError>

Performs the conversion.
source§

impl TryFrom<u64> for SmallIndex

§

type Error = SmallIndexError

The type returned in the event of a conversion error.
source§

fn try_from(index: u64) -> Result<SmallIndex, SmallIndexError>

Performs the conversion.
source§

impl TryFrom<usize> for SmallIndex

§

type Error = SmallIndexError

The type returned in the event of a conversion error.
source§

fn try_from(index: usize) -> Result<SmallIndex, SmallIndexError>

Performs the conversion.
source§

impl Copy for SmallIndex

source§

impl Eq for SmallIndex

source§

impl StructuralPartialEq for SmallIndex

Auto Trait Implementations§

Blanket Implementations§

source§

impl<T> Any for T
where T: 'static + ?Sized,

source§

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more
source§

impl<T> Borrow<T> for T
where T: ?Sized,

source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
source§

impl<T> BorrowMut<T> for T
where 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.

diff --git a/regex_automata/util/primitives/struct.StateID.html b/regex_automata/util/primitives/struct.StateID.html index bf07fc925c..f8961b3ee4 100644 --- a/regex_automata/util/primitives/struct.StateID.html +++ b/regex_automata/util/primitives/struct.StateID.html @@ -54,7 +54,7 @@ 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 StateID

source§

fn partial_cmp(&self, other: &StateID) -> 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 TryFrom<u16> for StateID

§

type Error = StateIDError

The type returned in the event of a conversion error.
source§

fn try_from(value: u16) -> Result<StateID, StateIDError>

Performs the conversion.
source§

impl TryFrom<u32> for StateID

§

type Error = StateIDError

The type returned in the event of a conversion error.
source§

fn try_from(value: u32) -> Result<StateID, StateIDError>

Performs the conversion.
source§

impl TryFrom<u64> for StateID

§

type Error = StateIDError

The type returned in the event of a conversion error.
source§

fn try_from(value: u64) -> Result<StateID, StateIDError>

Performs the conversion.
source§

impl TryFrom<usize> for StateID

§

type Error = StateIDError

The type returned in the event of a conversion error.
source§

fn try_from(value: usize) -> Result<StateID, StateIDError>

Performs the conversion.
source§

impl Copy for StateID

source§

impl Eq for StateID

source§

impl StructuralPartialEq for StateID

Auto Trait Implementations§

Blanket Implementations§

source§

impl<T> Any for T
where +operator. Read more

source§

impl TryFrom<u16> for StateID

§

type Error = StateIDError

The type returned in the event of a conversion error.
source§

fn try_from(value: u16) -> Result<StateID, StateIDError>

Performs the conversion.
source§

impl TryFrom<u32> for StateID

§

type Error = StateIDError

The type returned in the event of a conversion error.
source§

fn try_from(value: u32) -> Result<StateID, StateIDError>

Performs the conversion.
source§

impl TryFrom<u64> for StateID

§

type Error = StateIDError

The type returned in the event of a conversion error.
source§

fn try_from(value: u64) -> Result<StateID, StateIDError>

Performs the conversion.
source§

impl TryFrom<usize> for StateID

§

type Error = StateIDError

The type returned in the event of a conversion error.
source§

fn try_from(value: usize) -> Result<StateID, StateIDError>

Performs the conversion.
source§

impl Copy for StateID

source§

impl Eq for StateID

source§

impl StructuralPartialEq for StateID

Auto Trait Implementations§

Blanket Implementations§

source§

impl<T> Any for T
where T: 'static + ?Sized,

source§

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more
source§

impl<T> Borrow<T> for T
where T: ?Sized,

source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
source§

impl<T> BorrowMut<T> for T
where 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.

diff --git a/regex_automata/util/primitives/struct.StateIDError.html b/regex_automata/util/primitives/struct.StateIDError.html index 40bbbfba33..9763c2a41f 100644 --- a/regex_automata/util/primitives/struct.StateIDError.html +++ b/regex_automata/util/primitives/struct.StateIDError.html @@ -5,7 +5,7 @@

When the std feature is enabled, this implements the Error trait.

Implementations§

source§

impl StateIDError

source

pub fn attempted(&self) -> u64

Returns the value that could not be converted to an ID.

-

Trait Implementations§

source§

impl Clone for StateIDError

source§

fn clone(&self) -> StateIDError

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 StateIDError

source§

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter. Read more
source§

impl Display for StateIDError

source§

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter. Read more
source§

impl Error for StateIDError

1.30.0 · source§

fn source(&self) -> Option<&(dyn Error + 'static)>

The lower-level source of this error, if any. Read more
1.0.0 · source§

fn description(&self) -> &str

👎Deprecated since 1.42.0: use the Display impl or to_string()
Read more
1.0.0 · source§

fn cause(&self) -> Option<&dyn Error>

👎Deprecated since 1.33.0: replaced by Error::source, which can support downcasting
source§

fn provide<'a>(&'a self, 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 PartialEq for StateIDError

source§

fn eq(&self, other: &StateIDError) -> bool

This method tests for self and other values to be equal, and is used +

Trait Implementations§

source§

impl Clone for StateIDError

source§

fn clone(&self) -> StateIDError

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 StateIDError

source§

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter. Read more
source§

impl Display for StateIDError

source§

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter. Read more
source§

impl Error for StateIDError

1.30.0 · source§

fn source(&self) -> Option<&(dyn Error + 'static)>

The lower-level source of this error, if any. Read more
1.0.0 · source§

fn description(&self) -> &str

👎Deprecated since 1.42.0: use the Display impl or to_string()
Read more
1.0.0 · source§

fn cause(&self) -> Option<&dyn Error>

👎Deprecated since 1.33.0: replaced by Error::source, which can support downcasting
source§

fn provide<'a>(&'a self, 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 PartialEq for StateIDError

source§

fn eq(&self, other: &StateIDError) -> 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 StateIDError

source§

impl StructuralPartialEq for StateIDError

Auto Trait Implementations§

Blanket Implementations§

source§

impl<T> Any for T
where T: 'static + ?Sized,

source§

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more
source§

impl<T> Borrow<T> for T
where diff --git a/regex_automata/util/wire/struct.DeserializeError.html b/regex_automata/util/wire/struct.DeserializeError.html index e3c9a40a86..ffd4d31624 100644 --- a/regex_automata/util/wire/struct.DeserializeError.html +++ b/regex_automata/util/wire/struct.DeserializeError.html @@ -11,7 +11,7 @@

This error type implements the std::error::Error trait only when the std feature is enabled. Otherwise, this type is defined in all configurations.

-

Trait Implementations§

source§

impl Debug for DeserializeError

source§

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter. Read more
source§

impl Display for DeserializeError

source§

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter. Read more
source§

impl Error for DeserializeError

1.30.0 · source§

fn source(&self) -> Option<&(dyn Error + 'static)>

The lower-level source of this error, if any. Read more
1.0.0 · source§

fn description(&self) -> &str

👎Deprecated since 1.42.0: use the Display impl or to_string()
Read more
1.0.0 · source§

fn cause(&self) -> Option<&dyn Error>

👎Deprecated since 1.33.0: replaced by Error::source, which can support downcasting
source§

fn provide<'a>(&'a self, 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

Auto Trait Implementations§

Blanket Implementations§

source§

impl<T> Any for T
where +

Trait Implementations§

source§

impl Debug for DeserializeError

source§

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter. Read more
source§

impl Display for DeserializeError

source§

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter. Read more
source§

impl Error for DeserializeError

1.30.0 · source§

fn source(&self) -> Option<&(dyn Error + 'static)>

The lower-level source of this error, if any. Read more
1.0.0 · source§

fn description(&self) -> &str

👎Deprecated since 1.42.0: use the Display impl or to_string()
Read more
1.0.0 · source§

fn cause(&self) -> Option<&dyn Error>

👎Deprecated since 1.33.0: replaced by Error::source, which can support downcasting
source§

fn provide<'a>(&'a self, 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

Auto Trait Implementations§

Blanket Implementations§

source§

impl<T> Any for T
where T: 'static + ?Sized,

source§

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more
source§

impl<T> Borrow<T> for T
where T: ?Sized,

source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
source§

impl<T> BorrowMut<T> for T
where 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.

diff --git a/regex_automata/util/wire/struct.SerializeError.html b/regex_automata/util/wire/struct.SerializeError.html index 04d9f2f7d8..01b114320d 100644 --- a/regex_automata/util/wire/struct.SerializeError.html +++ b/regex_automata/util/wire/struct.SerializeError.html @@ -10,7 +10,7 @@

This error type implements the std::error::Error trait only when the std feature is enabled. Otherwise, this type is defined in all configurations.

-

Trait Implementations§

source§

impl Debug for SerializeError

source§

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter. Read more
source§

impl Display for SerializeError

source§

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter. Read more
source§

impl Error for SerializeError

1.30.0 · source§

fn source(&self) -> Option<&(dyn Error + 'static)>

The lower-level source of this error, if any. Read more
1.0.0 · source§

fn description(&self) -> &str

👎Deprecated since 1.42.0: use the Display impl or to_string()
Read more
1.0.0 · source§

fn cause(&self) -> Option<&dyn Error>

👎Deprecated since 1.33.0: replaced by Error::source, which can support downcasting
source§

fn provide<'a>(&'a self, 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

Auto Trait Implementations§

Blanket Implementations§

source§

impl<T> Any for T
where +

Trait Implementations§

source§

impl Debug for SerializeError

source§

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter. Read more
source§

impl Display for SerializeError

source§

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter. Read more
source§

impl Error for SerializeError

1.30.0 · source§

fn source(&self) -> Option<&(dyn Error + 'static)>

The lower-level source of this error, if any. Read more
1.0.0 · source§

fn description(&self) -> &str

👎Deprecated since 1.42.0: use the Display impl or to_string()
Read more
1.0.0 · source§

fn cause(&self) -> Option<&dyn Error>

👎Deprecated since 1.33.0: replaced by Error::source, which can support downcasting
source§

fn provide<'a>(&'a self, 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

Auto Trait Implementations§

Blanket Implementations§

source§

impl<T> Any for T
where T: 'static + ?Sized,

source§

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more
source§

impl<T> Borrow<T> for T
where T: ?Sized,

source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
source§

impl<T> BorrowMut<T> for T
where 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.

diff --git a/regex_syntax/enum.Error.html b/regex_syntax/enum.Error.html index d3d74c20a9..b813503b68 100644 --- a/regex_syntax/enum.Error.html +++ b/regex_syntax/enum.Error.html @@ -9,7 +9,7 @@ syntax (AST).

§

Translate(Error)

An error that occurred while translating abstract syntax into a high level intermediate representation (HIR).

-

Trait Implementations§

source§

impl Clone for Error

source§

fn clone(&self) -> Error

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 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, f: &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()
Read more
1.0.0 · source§

fn cause(&self) -> Option<&dyn Error>

👎Deprecated since 1.33.0: replaced by Error::source, which can support downcasting
source§

fn provide<'a>(&'a self, 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 Error

source§

fn from(err: Error) -> Error

Converts to this type from the input type.
source§

impl From<Error> for Error

source§

fn from(err: Error) -> Error

Converts to this type from the input type.
source§

impl PartialEq for Error

source§

fn eq(&self, other: &Error) -> bool

This method tests for self and other values to be equal, and is used +

Trait Implementations§

source§

impl Clone for Error

source§

fn clone(&self) -> Error

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 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, f: &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()
Read more
1.0.0 · source§

fn cause(&self) -> Option<&dyn Error>

👎Deprecated since 1.33.0: replaced by Error::source, which can support downcasting
source§

fn provide<'a>(&'a self, 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 Error

source§

fn from(err: Error) -> Error

Converts to this type from the input type.
source§

impl From<Error> for Error

source§

fn from(err: Error) -> Error

Converts to this type from the input type.
source§

impl 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 StructuralPartialEq for Error

Auto Trait Implementations§

§

impl Freeze for Error

§

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 T
where T: 'static + ?Sized,

source§

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more
source§

impl<T> Borrow<T> for T
where diff --git a/regex_syntax/hir/enum.ErrorKind.html b/regex_syntax/hir/enum.ErrorKind.html index b8382790da..e38e847b8f 100644 --- a/regex_syntax/hir/enum.ErrorKind.html +++ b/regex_syntax/hir/enum.ErrorKind.html @@ -26,7 +26,7 @@
§

UnicodeCaseUnavailable

This occurs when the Unicode simple case mapping tables are not available, and the regular expression required Unicode aware case insensitivity.

-

Trait Implementations§

source§

impl Clone for ErrorKind

source§

fn clone(&self) -> ErrorKind

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 ErrorKind

source§

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter. Read more
source§

impl Display for ErrorKind

source§

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter. Read more
source§

impl PartialEq for ErrorKind

source§

fn eq(&self, other: &ErrorKind) -> bool

This method tests for self and other values to be equal, and is used +

Trait Implementations§

source§

impl Clone for ErrorKind

source§

fn clone(&self) -> ErrorKind

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 ErrorKind

source§

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter. Read more
source§

impl Display for ErrorKind

source§

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter. Read more
source§

impl PartialEq for ErrorKind

source§

fn eq(&self, other: &ErrorKind) -> 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 ErrorKind

source§

impl StructuralPartialEq for ErrorKind

Auto Trait Implementations§

Blanket Implementations§

source§

impl<T> Any for T
where T: 'static + ?Sized,

source§

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more
source§

impl<T> Borrow<T> for T
where diff --git a/regex_syntax/hir/struct.Error.html b/regex_syntax/hir/struct.Error.html index d31bfe911c..ca81cb81d2 100644 --- a/regex_syntax/hir/struct.Error.html +++ b/regex_syntax/hir/struct.Error.html @@ -4,7 +4,7 @@

source

pub fn pattern(&self) -> &str

The original pattern string in which this error occurred.

Every span reported by this error is reported in terms of this string.

source

pub fn span(&self) -> &Span

Return the span at which this error occurred.

-

Trait Implementations§

source§

impl Clone for Error

source§

fn clone(&self) -> Error

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 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, f: &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()
Read more
1.0.0 · source§

fn cause(&self) -> Option<&dyn Error>

👎Deprecated since 1.33.0: replaced by Error::source, which can support downcasting
source§

fn provide<'a>(&'a self, 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 Error

source§

fn from(err: Error) -> Error

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 +

Trait Implementations§

source§

impl Clone for Error

source§

fn clone(&self) -> Error

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 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, f: &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()
Read more
1.0.0 · source§

fn cause(&self) -> Option<&dyn Error>

👎Deprecated since 1.33.0: replaced by Error::source, which can support downcasting
source§

fn provide<'a>(&'a self, 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 Error

source§

fn from(err: Error) -> Error

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 StructuralPartialEq for Error

Auto Trait Implementations§

§

impl Freeze for Error

§

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 T
where T: 'static + ?Sized,

source§

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more
source§

impl<T> Borrow<T> for T
where diff --git a/regex_syntax/hir/struct.Hir.html b/regex_syntax/hir/struct.Hir.html index 5fc3461a5d..e7449e7fcf 100644 --- a/regex_syntax/hir/struct.Hir.html +++ b/regex_syntax/hir/struct.Hir.html @@ -236,11 +236,11 @@
§Example
ClassBytesRange::new(0x00, 0xFF), ]))); assert_eq!(expected, hir);
-

Trait Implementations§

source§

impl Clone for Hir

source§

fn clone(&self) -> Hir

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 Hir

source§

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter. Read more
source§

impl Display for Hir

Print a display representation of this Hir.

+

Trait Implementations§

source§

impl Clone for Hir

source§

fn clone(&self) -> Hir

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 Hir

source§

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter. Read more
source§

impl Display for Hir

Print a display representation of this Hir.

The result of this is a valid regular expression pattern string.

This implementation uses constant stack space and heap space proportional to the size of the Hir.

-
source§

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter. Read more
source§

impl Drop for Hir

A custom Drop impl is used for HirKind such that it uses constant stack +

source§

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter. Read more
source§

impl Drop for Hir

A custom Drop impl is used for HirKind such that it uses constant stack space but heap space proportional to the depth of the total Hir.

source§

fn drop(&mut self)

Executes the destructor for this type. Read more
source§

impl PartialEq for Hir

source§

fn eq(&self, other: &Hir) -> 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 diff --git a/regex_syntax/struct.UnicodeWordError.html b/regex_syntax/struct.UnicodeWordError.html index 8b11c10f24..5bfb437115 100644 --- a/regex_syntax/struct.UnicodeWordError.html +++ b/regex_syntax/struct.UnicodeWordError.html @@ -3,7 +3,7 @@

This error can occur when the data tables necessary for the Unicode aware Perl character class \w are unavailable. This only occurs when the unicode-perl feature is disabled. (The feature is enabled by default.)

-

Trait Implementations§

source§

impl Debug for UnicodeWordError

source§

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter. Read more
source§

impl Display for UnicodeWordError

source§

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter. Read more
source§

impl Error for UnicodeWordError

1.30.0 · source§

fn source(&self) -> Option<&(dyn Error + 'static)>

The lower-level source of this error, if any. Read more
1.0.0 · source§

fn description(&self) -> &str

👎Deprecated since 1.42.0: use the Display impl or to_string()
Read more
1.0.0 · source§

fn cause(&self) -> Option<&dyn Error>

👎Deprecated since 1.33.0: replaced by Error::source, which can support downcasting
source§

fn provide<'a>(&'a self, 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

Auto Trait Implementations§

Blanket Implementations§

source§

impl<T> Any for T
where +

Trait Implementations§

source§

impl Debug for UnicodeWordError

source§

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter. Read more
source§

impl Display for UnicodeWordError

source§

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter. Read more
source§

impl Error for UnicodeWordError

1.30.0 · source§

fn source(&self) -> Option<&(dyn Error + 'static)>

The lower-level source of this error, if any. Read more
1.0.0 · source§

fn description(&self) -> &str

👎Deprecated since 1.42.0: use the Display impl or to_string()
Read more
1.0.0 · source§

fn cause(&self) -> Option<&dyn Error>

👎Deprecated since 1.33.0: replaced by Error::source, which can support downcasting
source§

fn provide<'a>(&'a self, 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

Auto Trait Implementations§

Blanket Implementations§

source§

impl<T> Any for T
where T: 'static + ?Sized,

source§

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more
source§

impl<T> Borrow<T> for T
where T: ?Sized,

source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
source§

impl<T> BorrowMut<T> for T
where 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.

diff --git a/search-index.js b/search-index.js index 9867bea35c..b161446e48 100644 --- a/search-index.js +++ b/search-index.js @@ -8,12 +8,16 @@ var searchIndex = new Map(JSON.parse('[\ ["colorchoice",{"doc":"Global override of color control","t":"PPPGPNNNNNNNNNNNNN","n":["Always","AlwaysAnsi","Auto","ColorChoice","Never","borrow","borrow_mut","clone","default","eq","fmt","from","global","into","try_from","try_into","type_id","write_global"],"q":[[0,"colorchoice"],[18,"core::fmt"],[19,"core::fmt"],[20,"core::any"]],"d":["Try very hard to emit colors.","Like Always, except it never tries to use anything other …","Use colors if the output device appears to support them","Selection for overriding color output","Never emit colors.","","","","","","","Returns the argument unchanged.","Get the current ColorChoice state","Calls U::from(self).","","","","Override the detected ColorChoice"],"i":[1,1,1,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1],"f":"`````{ce{}{}}0{bb}{{}b}{{bb}d}{{bf}h}{cc{}}35{c{{j{e}}}{}{}}0{cl{}}{bn}","c":[],"p":[[6,"ColorChoice",0],[1,"bool"],[5,"Formatter",18],[8,"Result",18],[6,"Result",19],[5,"TypeId",20],[1,"unit"]],"b":[]}],\ ["diff",{"doc":"","t":"PPGPNNHNNNNNNHHNNNN","n":["Both","Left","Result","Right","borrow","borrow_mut","chars","clone","clone_into","eq","fmt","from","into","lines","slice","to_owned","try_from","try_into","type_id"],"q":[[0,"diff"],[19,"alloc::vec"],[20,"core::clone"],[21,"core::cmp"],[22,"core::fmt"],[23,"core::fmt"],[24,"core::any"]],"d":["Elements that exist in both inputs.","An element that only exists in the left input.","A fragment of a computed diff.","An element that only exists in the right input.","","","Computes the diff between the chars of two strings.","","","","","Returns the argument unchanged.","Calls U::from(self).","Computes the diff between the lines of two strings.","Computes the diff between two slices.","","","",""],"i":[3,3,0,3,3,3,0,3,3,3,3,3,3,0,0,3,3,3,3],"f":"````{ce{}{}}0{{bb}{{h{{f{d}}}}}}{{{f{c}}}{{f{c}}}j}{{ce}l{}{}}{{{f{c}}{f{c}}}nA`}{{{f{c}}Ab}AdAf}{cc{}}6{{bb}{{h{{f{b}}}}}}{{{Ah{c}}{Ah{c}}}{{h{{f{c}}}}}A`}8{c{{Aj{e}}}{}{}}0{cAl{}}","c":[],"p":[[1,"str"],[1,"char"],[6,"Result",0],[5,"Vec",19],[10,"Clone",20],[1,"unit"],[1,"bool"],[10,"PartialEq",21],[5,"Formatter",22],[8,"Result",22],[10,"Debug",22],[1,"slice"],[6,"Result",23],[5,"TypeId",24]],"b":[]}],\ ["env_filter",{"doc":"Filtering for log records.","t":"FFFNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNN","n":["Builder","Filter","FilteredLog","borrow","borrow","borrow","borrow_mut","borrow_mut","borrow_mut","build","default","enabled","enabled","filter","filter","filter_level","filter_module","flush","fmt","fmt","fmt","from","from","from","from_env","into","into","into","log","matches","new","new","parse","try_from","try_from","try_from","try_into","try_into","try_into","type_id","type_id","type_id"],"q":[[0,"env_filter"],[42,"log"],[43,"log"],[44,"log"],[45,"core::fmt"],[46,"core::any"]],"d":["A builder for a log filter.","A log filter.","Decorate a log::Log with record Filtering.","","","","","","","Build a log filter.","","Determines if a log message with the specified metadata …","Determines if a log message with the specified metadata …","Adds a directive to the filter.","Returns the maximum LevelFilter that this filter instance …","Adds a directive to the filter for all modules.","Adds a directive to the filter for a specific module.","Flushes any buffered records.","","","","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Initializes the filter builder from an environment.","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Logs the record.","Checks if this record matches the configured filter.","Initializes the filter builder with defaults.","Create a new filtered log.","Parses the directives string.","","","","","","","","",""],"i":[0,0,0,1,2,5,1,2,5,1,1,2,5,1,2,1,1,5,1,2,5,1,2,5,1,1,2,5,5,2,1,5,1,1,2,5,1,2,5,1,2,5],"f":"```{ce{}{}}00000{bd}{{}b}{{df}h}{{{j{c}}f}hl}{{b{A`{n}}Ab}b}{dAb}{{bAb}b}{{bnAb}b}{{{j{c}}}Adl}{{bAf}Ah}{{dAf}Ah}{{{j{c}}Af}AhAj}{cc{}}00{nb}>>>{{{j{c}}Al}Adl}{{dAl}h}>{{cd}{{j{c}}}l}{{bn}b}{c{{An{e}}}{}{}}00000{cB`{}}00","c":[],"p":[[5,"Builder",0],[5,"Filter",0],[5,"Metadata",42],[1,"bool"],[5,"FilteredLog",0],[10,"Log",42],[1,"str"],[6,"Option",43],[6,"LevelFilter",42],[1,"unit"],[5,"Formatter",44],[8,"Result",44],[10,"Debug",44],[5,"Record",42],[6,"Result",45],[5,"TypeId",46]],"b":[]}],\ -["env_logger",{"doc":"A simple logger that can be configured via environment …","t":"FSSFFEEENNNNNNNHNNNNNNNNNNNNNCNNNNNNNNNNNNNNNNNNNNHNNHNHNNNNNNNNNNNNNNNNHNHNNNNNNNNNPPFPPPPPPPPGFGGNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNENNNNNNNNNNNNNNNNNNNNNNNN","n":["Builder","DEFAULT_FILTER_ENV","DEFAULT_WRITE_STYLE_ENV","Env","Logger","Target","TimestampPrecision","WriteStyle","borrow","borrow","borrow","borrow_mut","borrow_mut","borrow_mut","build","builder","default","default","default_filter_or","default_format","default_write_style_or","enabled","filter","filter","filter","filter_level","filter_module","filter_or","flush","fmt","fmt","fmt","fmt","format","format_indent","format_level","format_module_path","format_suffix","format_target","format_timestamp","format_timestamp_micros","format_timestamp_millis","format_timestamp_nanos","format_timestamp_secs","from","from","from","from","from_default_env","from_default_env","from_env","from_env","from_env","init","init","init_from_env","into","into","into","is_test","log","matches","new","new","parse_default_env","parse_env","parse_filters","parse_write_style","target","try_from","try_from","try_from","try_init","try_init","try_init_from_env","try_into","try_into","try_into","type_id","type_id","type_id","write_style","write_style","write_style_or","Always","Auto","Formatter","Micros","Millis","Nanos","Never","Pipe","Seconds","Stderr","Stdout","Target","Timestamp","TimestampPrecision","WriteStyle","borrow","borrow","borrow","borrow","borrow","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","clone","clone","clone_into","clone_into","default","default","default","default_level_style","eq","flush","fmt","fmt","fmt","fmt","fmt","fmt","from","from","from","from","from","from","hash","into","into","into","into","into","style","timestamp","timestamp_micros","timestamp_millis","timestamp_nanos","timestamp_seconds","to_owned","to_owned","to_string","try_from","try_from","try_from","try_from","try_from","try_into","try_into","try_into","try_into","try_into","type_id","type_id","type_id","type_id","type_id","write"],"q":[[0,"env_logger"],[84,"env_logger::fmt"],[162,"alloc::borrow"],[163,"core::convert"],[164,"log"],[165,"log"],[166,"core::fmt"],[167,"core::fmt"],[168,"core::ops::function"],[169,"core::marker"],[170,"core::marker"],[171,"log"],[172,"log"],[173,"colorchoice"],[174,"core::hash"],[175,"alloc::string"]],"d":["Builder acts as builder for initializing a Logger.","The default name for the environment variable to read …","The default name for the environment variable to read …","Set of environment variables to configure from.","The env logger.","","","","","","","","","","Build an env logger.","Create a new builder with the default environment …","","","Use the default environment variable to read the filter …","Use the default format.","Use the default environment variable to read the style …","","Returns the maximum LevelFilter that this env logger …","Adds filters to the logger.","Specify an environment variable to read the filter from.","Adds a directive to the filter for all modules.","Adds a directive to the filter for a specific module.","Specify an environment variable to read the filter from.","","Formatting for log records.","","","","Sets the format function for formatting the log output.","Configures the amount of spaces to use to indent multiline …","Whether or not to write the level in the default format.","Whether or not to write the module path in the default …","Configures the end of line suffix.","Whether or not to write the target in the default format.","Configures if timestamp should be included and in what …","Configures the timestamp to use microsecond precision.","Configures the timestamp to use millisecond precision.","Configures the timestamp to use nanosecond precision.","Configures the timestamp to use second precision.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","","Creates the logger from the environment using default …","Initializes the log builder from the environment using …","Create a builder from the given environment variables.","Creates the logger from the environment.","Initializes the log builder from the environment.","Initializes the global logger with an env logger.","Initializes the global logger with the built env logger.","Initializes the global logger with an env logger from the …","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Sets whether or not the logger will be used in unit tests.","","Checks if this record matches the configured filter.","Initializes the log builder with defaults.","Get a default set of environment variables.","Applies the configuration from the environment using …","Applies the configuration from the environment.","Parses the directives string in the same form as the …","Parses whether or not to write styles in the same form as …","Sets the target for the log output.","","","","Attempts to initialize the global logger with an env …","Initializes the global logger with the built env logger.","Attempts to initialize the global logger with an env …","","","","","","","Sets whether or not styles will be written.","Specify an environment variable to read the style from.","Specify an environment variable to read the style from.","Try very hard to print styles.","Try to print styles, but don’t force the issue.","A formatter to write logs into.","Microsecond precision (6 decimal digits)","Millisecond precision (3 decimal digits)","Nanosecond precision (9 decimal digits)","Never print styles.","Logs will be sent to a custom pipe.","Full second precision (0 decimal digits)","Logs will be sent to standard error.","Logs will be sent to standard output.","Log target, either stdout, stderr or a custom pipe.","An RFC3339 formatted timestamp.","Formatting precision of timestamps.","Whether or not to print styles to the target.","","","","","","","","","","","","","","","","","","Get the default style::Style for the given level.","","","","","","","","","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","","Returns the argument unchanged.","Returns the argument unchanged.","","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","","Get a Timestamp for the current date and time in UTC.","Get a Timestamp for the current date and time in UTC with …","Get a Timestamp for the current date and time in UTC with …","Get a Timestamp for the current date and time in UTC with …","Get a Timestamp for the current date and time in UTC with …","","","","","","","","","","","","","","","","","","",""],"i":[0,0,0,0,0,0,0,0,2,1,3,2,1,3,1,0,1,3,3,1,3,2,2,1,3,1,1,3,2,0,2,1,3,1,1,1,1,1,1,1,1,1,1,1,2,1,3,3,2,1,0,2,1,0,1,0,2,1,3,1,2,2,1,3,1,1,1,1,1,2,1,3,0,1,0,2,1,3,2,1,3,1,3,3,27,27,0,22,22,22,27,23,22,23,23,0,0,0,0,30,14,23,27,22,30,14,23,27,22,27,22,27,22,23,27,22,14,27,14,30,30,14,23,27,22,30,14,23,27,27,22,27,30,14,23,27,22,0,14,14,14,14,14,27,22,30,30,14,23,27,22,30,14,23,27,22,30,14,23,27,22,14],"f":"````````{ce{}{}}00000{bd}{{}b}0{{}f}{{fc}f{{l{{j{h}}}}}}{bb}1{{dn}A`}{dAb}{{b{Ad{h}}Ab}b}4{{bAb}b}{{bhAb}b}{{fce}f{{l{{j{h}}}}}{{l{{j{h}}}}}}{dAf}`{{dAh}Aj}{{bAh}Aj}{{fAh}Aj}{{bc}b{{Bd{AlAn}{{B`{{Bb{Af}}}}}}BfBh}}{{b{Ad{Bj}}}b}{{bA`}b}0{{bh}b}1{{b{Ad{Bl}}}b}????{cc{}}00{cf{{l{{j{h}}}}}}{{}d}{{}b}{cb{{l{f}}}}{cd{{l{f}}}}1{{}Af}{bAf}{cAf{{l{f}}}}{ce{}{}}00<{{dAn}Af}{{dAn}A`}8{{}f}{bb}{{bc}b{{l{f}}}}{{bh}b}0{{bBn}b}{c{{C`{e}}}{}{}}00{{}{{C`{AfCb}}}}{b{{C`{AfCb}}}}{c{{C`{AfCb}}}{{l{f}}}}333{cCd{}}00{{bCf}b}{{fc}f{{l{{j{h}}}}}}{{fce}f{{l{{j{h}}}}}{{l{{j{h}}}}}}```````````````??????????{CfCf}{BlBl}{{ce}Af{}{}}0{{}Bn}{{}Cf}{{}Bl}{{AlCh}Cj}{{CfCf}A`}{Al{{Bb{Af}}}}{{ClAh}Aj}0{{AlAh}Aj}{{BnAh}Aj}{{CfAh}Aj}{{BlAh}Aj}{cc{}}00{CnCf}11{{Cfc}AfD`}{ce{}{}}0000`{AlCl}000011{cDb{}}{c{{C`{e}}}{}{}}000000000{cCd{}}0000{{Al{Df{Dd}}}{{Bb{Bj}}}}","c":[50],"p":[[5,"Builder",0],[5,"Logger",0],[5,"Env",0],[1,"str"],[6,"Cow",162],[10,"Into",163],[5,"Metadata",164],[1,"bool"],[6,"LevelFilter",164],[6,"Option",165],[1,"unit"],[5,"Formatter",166],[8,"Result",166],[5,"Formatter",84],[5,"Record",164],[17,"Output"],[8,"Result",167],[10,"Fn",168],[10,"Sync",169],[10,"Send",169],[1,"usize"],[6,"TimestampPrecision",84],[6,"Target",84],[6,"Result",170],[5,"SetLoggerError",164],[5,"TypeId",171],[6,"WriteStyle",84],[6,"Level",164],[5,"Style",172],[5,"Timestamp",84],[6,"ColorChoice",173],[10,"Hasher",174],[5,"String",175],[1,"u8"],[1,"slice"]],"b":[[119,"impl-Debug-for-Timestamp"],[120,"impl-Display-for-Timestamp"]]}],\ -["flatten_json_object",{"doc":"Robust Rust library for flattening JSON objects","t":"GGPFPPPNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNOO","n":["ArrayFormatting","Error","FirstLevelMustBeAnObject","Flattener","KeyWillBeOverwritten","Plain","Surrounded","array_formatting","borrow","borrow","borrow","borrow_mut","borrow_mut","borrow_mut","clone","clone","clone_into","clone_into","default","eq","eq","flatten","fmt","fmt","fmt","fmt","from","from","from","into","into","into","key_separator","new","preserve_empty_arrays","preserve_empty_objects","set_array_formatting","set_key_separator","set_preserve_empty_arrays","set_preserve_empty_objects","to_owned","to_owned","to_string","try_from","try_from","try_from","try_into","try_into","try_into","type_id","type_id","type_id","end","start"],"q":[[0,"flatten_json_object"],[52,"flatten_json_object::ArrayFormatting"],[54,"serde_json::value"],[55,"core::result"],[56,"core::fmt"],[57,"core::fmt"],[58,"core::any"]],"d":["Enum to specify how arrays are formatted.","Errors that can happen while using this crate.","","Basic struct of this crate. It contains the configuration. …","","Uses only the key separator. Example: {"a": ["b"]} => …","Does not use the key separator. Instead, the position in …","","","","","","","","","","","","","","","Flattens the provided JSON object (current).","","","","","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 JSON object flattener with the default …","","","Changes the way arrays are formatted. By default the …","Changes the string used to separate keys in the resulting …","Changes the behaviour regarding empty arrays []","Changes the behaviour regarding empty objects {}","","","","","","","","","","","","","",""],"i":[0,0,6,0,6,2,2,1,6,2,1,6,2,1,2,1,2,1,1,2,1,1,6,6,2,1,6,2,1,6,2,1,1,1,1,1,1,1,1,1,2,1,6,6,2,1,6,2,1,6,2,1,13,13],"f":"```````{bd}{ce{}{}}00000{dd}{bb}{{ce}f{}{}}0{{}b}{{dd}h}{{bb}h}{{bj}{{n{jl}}}}{{lA`}Ab}0{{dA`}Ab}{{bA`}Ab}{cc{}}00;;;{bAd}8{bh}0{{bd}b}{{bAd}b}{{bh}b}0{ce{}{}}0{cAf{}}{c{{n{e}}}{}{}}00000{cAh{}}00``","c":[],"p":[[5,"Flattener",0],[6,"ArrayFormatting",0],[1,"unit"],[1,"bool"],[6,"Value",54],[6,"Error",0],[6,"Result",55],[5,"Formatter",56],[8,"Result",56],[1,"str"],[5,"String",57],[5,"TypeId",58],[15,"Surrounded",52]],"b":[[22,"impl-Display-for-Error"],[23,"impl-Debug-for-Error"]]}],\ +["env_logger",{"doc":"A simple logger that can be configured via environment …","t":"FSSFFEEENNNNNNNHNNNNNNNNNNNNNCNNNNNNNNNNNNNNNNNNNNHNNHNHNNNNNNNNNNNNNNNNHNHNNNNNNNNNPPFPPPPPPPPGFGGNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNENNNNNNNNNNNNNNNNNNNNNNNN","n":["Builder","DEFAULT_FILTER_ENV","DEFAULT_WRITE_STYLE_ENV","Env","Logger","Target","TimestampPrecision","WriteStyle","borrow","borrow","borrow","borrow_mut","borrow_mut","borrow_mut","build","builder","default","default","default_filter_or","default_format","default_write_style_or","enabled","filter","filter","filter","filter_level","filter_module","filter_or","flush","fmt","fmt","fmt","fmt","format","format_indent","format_level","format_module_path","format_suffix","format_target","format_timestamp","format_timestamp_micros","format_timestamp_millis","format_timestamp_nanos","format_timestamp_secs","from","from","from","from","from_default_env","from_default_env","from_env","from_env","from_env","init","init","init_from_env","into","into","into","is_test","log","matches","new","new","parse_default_env","parse_env","parse_filters","parse_write_style","target","try_from","try_from","try_from","try_init","try_init","try_init_from_env","try_into","try_into","try_into","type_id","type_id","type_id","write_style","write_style","write_style_or","Always","Auto","Formatter","Micros","Millis","Nanos","Never","Pipe","Seconds","Stderr","Stdout","Target","Timestamp","TimestampPrecision","WriteStyle","borrow","borrow","borrow","borrow","borrow","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","clone","clone","clone_into","clone_into","default","default","default","default_level_style","eq","flush","fmt","fmt","fmt","fmt","fmt","fmt","from","from","from","from","from","from","hash","into","into","into","into","into","style","timestamp","timestamp_micros","timestamp_millis","timestamp_nanos","timestamp_seconds","to_owned","to_owned","to_string","try_from","try_from","try_from","try_from","try_from","try_into","try_into","try_into","try_into","try_into","type_id","type_id","type_id","type_id","type_id","write"],"q":[[0,"env_logger"],[84,"env_logger::fmt"],[162,"alloc::borrow"],[163,"core::convert"],[164,"log"],[165,"log"],[166,"core::fmt"],[167,"core::fmt"],[168,"core::ops::function"],[169,"core::marker"],[170,"core::marker"],[171,"log"],[172,"log"],[173,"colorchoice"],[174,"core::hash"],[175,"alloc::string"]],"d":["Builder acts as builder for initializing a Logger.","The default name for the environment variable to read …","The default name for the environment variable to read …","Set of environment variables to configure from.","The env logger.","","","","","","","","","","Build an env logger.","Create a new builder with the default environment …","","","Use the default environment variable to read the filter …","Use the default format.","Use the default environment variable to read the style …","","Returns the maximum LevelFilter that this env logger …","Adds filters to the logger.","Specify an environment variable to read the filter from.","Adds a directive to the filter for all modules.","Adds a directive to the filter for a specific module.","Specify an environment variable to read the filter from.","","Formatting for log records.","","","","Sets the format function for formatting the log output.","Configures the amount of spaces to use to indent multiline …","Whether or not to write the level in the default format.","Whether or not to write the module path in the default …","Configures the end of line suffix.","Whether or not to write the target in the default format.","Configures if timestamp should be included and in what …","Configures the timestamp to use microsecond precision.","Configures the timestamp to use millisecond precision.","Configures the timestamp to use nanosecond precision.","Configures the timestamp to use second precision.","Returns the argument unchanged.","Returns the argument unchanged.","","Returns the argument unchanged.","Creates the logger from the environment using default …","Initializes the log builder from the environment using …","Create a builder from the given environment variables.","Creates the logger from the environment.","Initializes the log builder from the environment.","Initializes the global logger with an env logger.","Initializes the global logger with the built env logger.","Initializes the global logger with an env logger from the …","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Sets whether or not the logger will be used in unit tests.","","Checks if this record matches the configured filter.","Initializes the log builder with defaults.","Get a default set of environment variables.","Applies the configuration from the environment using …","Applies the configuration from the environment.","Parses the directives string in the same form as the …","Parses whether or not to write styles in the same form as …","Sets the target for the log output.","","","","Attempts to initialize the global logger with an env …","Initializes the global logger with the built env logger.","Attempts to initialize the global logger with an env …","","","","","","","Sets whether or not styles will be written.","Specify an environment variable to read the style from.","Specify an environment variable to read the style from.","Try very hard to print styles.","Try to print styles, but don’t force the issue.","A formatter to write logs into.","Microsecond precision (6 decimal digits)","Millisecond precision (3 decimal digits)","Nanosecond precision (9 decimal digits)","Never print styles.","Logs will be sent to a custom pipe.","Full second precision (0 decimal digits)","Logs will be sent to standard error.","Logs will be sent to standard output.","Log target, either stdout, stderr or a custom pipe.","An RFC3339 formatted timestamp.","Formatting precision of timestamps.","Whether or not to print styles to the target.","","","","","","","","","","","","","","","","","","Get the default style::Style for the given level.","","","","","","","","","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","","Returns the argument unchanged.","Returns the argument unchanged.","","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","","Get a Timestamp for the current date and time in UTC.","Get a Timestamp for the current date and time in UTC with …","Get a Timestamp for the current date and time in UTC with …","Get a Timestamp for the current date and time in UTC with …","Get a Timestamp for the current date and time in UTC with …","","","","","","","","","","","","","","","","","","",""],"i":[0,0,0,0,0,0,0,0,2,1,3,2,1,3,1,0,1,3,3,1,3,2,2,1,3,1,1,3,2,0,2,1,3,1,1,1,1,1,1,1,1,1,1,1,2,1,3,3,2,1,0,2,1,0,1,0,2,1,3,1,2,2,1,3,1,1,1,1,1,2,1,3,0,1,0,2,1,3,2,1,3,1,3,3,27,27,0,22,22,22,27,23,22,23,23,0,0,0,0,30,14,23,27,22,30,14,23,27,22,27,22,27,22,23,27,22,14,27,14,30,30,14,23,27,22,30,14,23,27,27,22,27,30,14,23,27,22,0,14,14,14,14,14,27,22,30,30,14,23,27,22,30,14,23,27,22,30,14,23,27,22,14],"f":"````````{ce{}{}}00000{bd}{{}b}0{{}f}{{fc}f{{l{{j{h}}}}}}{bb}1{{dn}A`}{dAb}{{b{Ad{h}}Ab}b}4{{bAb}b}{{bhAb}b}{{fce}f{{l{{j{h}}}}}{{l{{j{h}}}}}}{dAf}`{{dAh}Aj}{{bAh}Aj}{{fAh}Aj}{{bc}b{{Bd{AlAn}{{B`{{Bb{Af}}}}}}BfBh}}{{b{Ad{Bj}}}b}{{bA`}b}0{{bh}b}1{{b{Ad{Bl}}}b}????{cc{}}0{cf{{l{{j{h}}}}}}1{{}d}{{}b}{cb{{l{f}}}}{cd{{l{f}}}}1{{}Af}{bAf}{cAf{{l{f}}}}{ce{}{}}00<{{dAn}Af}{{dAn}A`}8{{}f}{bb}{{bc}b{{l{f}}}}{{bh}b}0{{bBn}b}{c{{C`{e}}}{}{}}00{{}{{C`{AfCb}}}}{b{{C`{AfCb}}}}{c{{C`{AfCb}}}{{l{f}}}}333{cCd{}}00{{bCf}b}{{fc}f{{l{{j{h}}}}}}{{fce}f{{l{{j{h}}}}}{{l{{j{h}}}}}}```````````````??????????{CfCf}{BlBl}{{ce}Af{}{}}0{{}Bn}{{}Cf}{{}Bl}{{AlCh}Cj}{{CfCf}A`}{Al{{Bb{Af}}}}{{ClAh}Aj}0{{AlAh}Aj}{{BnAh}Aj}{{CfAh}Aj}{{BlAh}Aj}{cc{}}00{CnCf}11{{Cfc}AfD`}{ce{}{}}0000`{AlCl}000011{cDb{}}{c{{C`{e}}}{}{}}000000000{cCd{}}0000{{Al{Df{Dd}}}{{Bb{Bj}}}}","c":[50],"p":[[5,"Builder",0],[5,"Logger",0],[5,"Env",0],[1,"str"],[6,"Cow",162],[10,"Into",163],[5,"Metadata",164],[1,"bool"],[6,"LevelFilter",164],[6,"Option",165],[1,"unit"],[5,"Formatter",166],[8,"Result",166],[5,"Formatter",84],[5,"Record",164],[17,"Output"],[8,"Result",167],[10,"Fn",168],[10,"Sync",169],[10,"Send",169],[1,"usize"],[6,"TimestampPrecision",84],[6,"Target",84],[6,"Result",170],[5,"SetLoggerError",164],[5,"TypeId",171],[6,"WriteStyle",84],[6,"Level",164],[5,"Style",172],[5,"Timestamp",84],[6,"ColorChoice",173],[10,"Hasher",174],[5,"String",175],[1,"u8"],[1,"slice"]],"b":[[119,"impl-Display-for-Timestamp"],[120,"impl-Debug-for-Timestamp"]]}],\ +["equivalent",{"doc":"Equivalent and Comparable are traits for key comparison in …","t":"KKMM","n":["Comparable","Equivalent","compare","equivalent"],"q":[[0,"equivalent"],[4,"core::cmp"],[5,"core::marker"]],"d":["Key ordering trait.","Key equivalence trait.","Compare self to key and return their ordering.","Compare self to key and return true if they are equal."],"i":[0,0,1,4],"f":"``{{bc}df}{{hc}jf}","c":[],"p":[[10,"Comparable",0],[6,"Ordering",4],[10,"Sized",5],[10,"Equivalent",0],[1,"bool"]],"b":[]}],\ +["flatten_json_object",{"doc":"Robust Rust library for flattening JSON objects","t":"GGPFPPPNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNOO","n":["ArrayFormatting","Error","FirstLevelMustBeAnObject","Flattener","KeyWillBeOverwritten","Plain","Surrounded","array_formatting","borrow","borrow","borrow","borrow_mut","borrow_mut","borrow_mut","clone","clone","clone_into","clone_into","default","eq","eq","equivalent","equivalent","equivalent","equivalent","equivalent","equivalent","flatten","fmt","fmt","fmt","fmt","from","from","from","into","into","into","key_separator","new","preserve_empty_arrays","preserve_empty_objects","set_array_formatting","set_key_separator","set_preserve_empty_arrays","set_preserve_empty_objects","to_owned","to_owned","to_string","try_from","try_from","try_from","try_into","try_into","try_into","type_id","type_id","type_id","end","start"],"q":[[0,"flatten_json_object"],[58,"flatten_json_object::ArrayFormatting"],[60,"serde_json::value"],[61,"core::result"],[62,"core::fmt"],[63,"core::fmt"],[64,"core::any"]],"d":["Enum to specify how arrays are formatted.","Errors that can happen while using this crate.","","Basic struct of this crate. It contains the configuration. …","","Uses only the key separator. Example: {"a": ["b"]} => …","Does not use the key separator. Instead, the position in …","","","","","","","","","","","","","","","","","","","","","Flattens the provided JSON object (current).","","","","","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 JSON object flattener with the default …","","","Changes the way arrays are formatted. By default the …","Changes the string used to separate keys in the resulting …","Changes the behaviour regarding empty arrays []","Changes the behaviour regarding empty objects {}","","","","","","","","","","","","","",""],"i":[0,0,6,0,6,2,2,1,6,2,1,6,2,1,2,1,2,1,1,2,1,2,2,2,1,1,1,1,6,6,2,1,6,2,1,6,2,1,1,1,1,1,1,1,1,1,2,1,6,6,2,1,6,2,1,6,2,1,13,13],"f":"```````{bd}{ce{}{}}00000{dd}{bb}{{ce}f{}{}}0{{}b}{{dd}h}{{bb}h}{{ce}h{}{}}00000{{bj}{{n{jl}}}}{{lA`}Ab}0{{dA`}Ab}{{bA`}Ab}{cc{}}00<<<{bAd}9{bh}0{{bd}b}{{bAd}b}{{bh}b}0{ce{}{}}0{cAf{}}{c{{n{e}}}{}{}}00000{cAh{}}00``","c":[],"p":[[5,"Flattener",0],[6,"ArrayFormatting",0],[1,"unit"],[1,"bool"],[6,"Value",60],[6,"Error",0],[6,"Result",61],[5,"Formatter",62],[8,"Result",62],[1,"str"],[5,"String",63],[5,"TypeId",64],[15,"Surrounded",58]],"b":[[28,"impl-Display-for-Error"],[29,"impl-Debug-for-Error"]]}],\ +["hashbrown",{"doc":"This crate is a Rust port of Google’s high-performance …","t":"PPKFFFGNNNNNMNNNCCCNCNNNNOGFGGFFFFFFFFPPPFFFFFGFFPPPFFFFNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNONNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNONNNNNNFFGFFFFFPFFFPFNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNFFGFFFFFPFPFNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNFFFFFFFNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNN","n":["AllocError","CapacityOverflow","Equivalent","HashMap","HashSet","HashTable","TryReserveError","borrow","borrow_mut","clone","clone_into","eq","equivalent","equivalent","fmt","from","hash_map","hash_set","hash_table","into","raw","to_owned","try_from","try_into","type_id","layout","DefaultHashBuilder","Drain","Entry","EntryRef","ExtractIf","HashMap","IntoIter","IntoKeys","IntoValues","Iter","IterMut","Keys","Occupied","Occupied","Occupied","OccupiedEntry","OccupiedEntryRef","OccupiedError","RawEntryBuilder","RawEntryBuilderMut","RawEntryMut","RawOccupiedEntryMut","RawVacantEntryMut","Vacant","Vacant","Vacant","VacantEntry","VacantEntryRef","Values","ValuesMut","allocator","and_modify","and_modify","and_modify","and_replace_entry_with","and_replace_entry_with","and_replace_entry_with","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","capacity","clear","clone","clone","clone","clone","clone_from","clone_into","clone_into","clone_into","clone_into","contains_key","default","drain","entry","entry","entry_ref","eq","equivalent","extend","extend","extend","extract_if","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fold","fold","fold","fold","fold","fold","fold","fold","fold","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from_hash","from_hash","from_iter","from_key","from_key","from_key_hashed_nocheck","from_key_hashed_nocheck","get","get","get","get","get_key_value","get_key_value","get_key_value_mut","get_key_value_mut","get_many_key_value_mut","get_many_key_value_unchecked_mut","get_many_mut","get_many_unchecked_mut","get_mut","get_mut","get_mut","get_mut","hasher","index","insert","insert","insert","insert","insert","insert","insert","insert","insert","insert","insert_hashed_nocheck","insert_key","insert_unique_unchecked","insert_with_hasher","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into_iter","into_iter","into_iter","into_iter","into_iter","into_iter","into_iter","into_iter","into_iter","into_iter","into_iter","into_iter","into_iter","into_key","into_key","into_key","into_key_value","into_keys","into_mut","into_mut","into_mut","into_values","is_empty","iter","iter_mut","key","key","key","key","key","key","key","key_mut","keys","len","len","len","len","len","len","len","len","len","len","next","next","next","next","next","next","next","next","next","next","or_default","or_default","or_insert","or_insert","or_insert","or_insert_with","or_insert_with","or_insert_with","or_insert_with_key","or_insert_with_key","raw_entry","raw_entry_mut","raw_table","raw_table_mut","remove","remove","remove","remove","remove_entry","remove_entry","remove_entry","remove_entry","replace_entry","replace_entry","replace_entry_with","replace_entry_with","replace_entry_with","replace_key","replace_key","reserve","retain","shrink_to","shrink_to_fit","size_hint","size_hint","size_hint","size_hint","size_hint","size_hint","size_hint","size_hint","size_hint","size_hint","to_owned","to_owned","to_owned","to_owned","to_string","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_insert","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_reserve","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","value","values","values_mut","with_capacity_and_hasher","with_capacity_and_hasher_in","with_hasher","with_hasher_in","Difference","Drain","Entry","ExtractIf","HashSet","Intersection","IntoIter","Iter","Occupied","OccupiedEntry","SymmetricDifference","Union","Vacant","VacantEntry","allocator","bitand","bitor","bitxor","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","capacity","clear","clone","clone","clone","clone","clone","clone","clone_from","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","contains","default","difference","drain","entry","eq","equivalent","extend","extend","extract_if","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fold","fold","fold","fold","fold","fold","fold","from","from","from","from","from","from","from","from","from","from","from","from","from","from_iter","get","get","get","get","get_or_insert","get_or_insert_owned","get_or_insert_with","hasher","insert","insert","insert","insert_unique_unchecked","intersection","into","into","into","into","into","into","into","into","into","into","into","into","into_iter","into_iter","into_iter","into_iter","into_iter","into_iter","into_iter","into_iter","into_iter","into_iter","into_value","is_disjoint","is_empty","is_subset","is_superset","iter","len","len","len","len","next","next","next","next","next","next","next","next","or_insert","raw_table","raw_table_mut","remove","remove","replace","replace","reserve","retain","shrink_to","shrink_to_fit","size_hint","size_hint","size_hint","size_hint","size_hint","size_hint","size_hint","size_hint","sub","symmetric_difference","take","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_reserve","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","union","with_capacity_and_hasher","with_capacity_and_hasher_in","with_hasher","with_hasher_in","AbsentEntry","Drain","Entry","ExtractIf","HashTable","IntoIter","Iter","IterMut","Occupied","OccupiedEntry","Vacant","VacantEntry","allocator","and_modify","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","capacity","clear","clone","clone_into","default","drain","entry","extract_if","find","find_entry","find_mut","fmt","fmt","fmt","fmt","fmt","fmt","fold","fold","fold","from","from","from","from","from","from","from","from","from","from","get","get_many_mut","get_many_unchecked_mut","get_mut","insert","insert","insert_unique","into","into","into","into","into","into","into","into","into","into","into_iter","into_iter","into_iter","into_iter","into_iter","into_iter","into_iter","into_iter","into_mut","into_table","into_table","into_table","is_empty","iter","iter_mut","len","len","len","len","len","new","new_in","next","next","next","next","next","or_insert","or_insert_with","remove","reserve","retain","shrink_to","shrink_to_fit","size_hint","size_hint","size_hint","size_hint","size_hint","to_owned","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_reserve","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","with_capacity","with_capacity_in","Bucket","InsertSlot","RawDrain","RawIntoIter","RawIter","RawIterHash","RawTable","allocation_info","allocator","as_mut","as_ptr","as_ref","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","bucket","bucket_index","buckets","capacity","clear","clear_no_drop","clone","clone","clone","clone_from","clone_from_with_hasher","clone_into","clone_into","clone_into","copy_from_nonoverlapping","data_end","data_start","default","drain","drain_iter_from","drop","drop","drop","erase","erase_entry","find","find_or_find_insert_slot","fold","from","from","from","from","from","from","from","get","get_many_mut","get_many_unchecked_mut","get_mut","insert","insert_entry","insert_in_slot","insert_no_grow","into","into","into","into","into","into","into","into_iter","into_iter","into_iter","into_iter","into_iter","into_iter_from","is_bucket_full","is_empty","iter","iter","iter","iter_hash","len","new","new_in","next","next","next","next","reflect_insert","reflect_remove","remove","remove_entry","replace_bucket_with","reserve","shrink_to","size_hint","size_hint","size_hint","to_owned","to_owned","to_owned","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_insert_no_grow","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_reserve","try_with_capacity","try_with_capacity_in","type_id","type_id","type_id","type_id","type_id","type_id","type_id","with_capacity","with_capacity_in"],"q":[[0,"hashbrown"],[25,"hashbrown::TryReserveError"],[26,"hashbrown::hash_map"],[436,"hashbrown::hash_set"],[658,"hashbrown::hash_table"],[812,"hashbrown::raw"],[947,"core::marker"],[948,"core::fmt"],[949,"core::fmt"],[950,"core::any"],[951,"core::ops::function"],[952,"core::option"],[953,"core::clone"],[954,"core::cmp"],[955,"core::hash"],[956,"core::hash"],[957,"core::cmp"],[958,"core::marker"],[959,"core::convert"],[960,"core::ops::function"],[961,"alloc::borrow"],[962,"core::ptr::non_null"],[963,"core::alloc::layout"]],"d":["The memory allocator returned an error","Error due to the computed capacity exceeding the collection…","Key equivalence trait.","A hash map implemented with quadratic probing and SIMD …","A hash set implemented as a HashMap where the value is ().","Low-level hash table with explicit hashing.","The error type for try_reserve methods.","","","","","","Checks if this value is equivalent to the given key.","","","Returns the argument unchanged.","A hash map implemented with quadratic probing and SIMD …","A hash set implemented as a HashMap where the value is ().","A hash table implemented with quadratic probing and SIMD …","Calls U::from(self).","Experimental and unsafe RawTable API. This module is only …","","","","","The layout of the allocation request that failed.","Dummy default hasher for HashMap.","A draining iterator over the entries of a HashMap in …","A view into a single entry in a map, which may either be …","A view into a single entry in a map, which may either be …","A draining iterator over entries of a HashMap which don’…","A hash map implemented with quadratic probing and SIMD …","An owning iterator over the entries of a HashMap in …","An owning iterator over the keys of a HashMap in arbitrary …","An owning iterator over the values of a HashMap in …","An iterator over the entries of a HashMap in arbitrary …","A mutable iterator over the entries of a HashMap in …","An iterator over the keys of a HashMap in arbitrary order. …","An occupied entry.","An occupied entry.","An occupied entry.","A view into an occupied entry in a HashMap. It is part of …","A view into an occupied entry in a HashMap. It is part of …","The error returned by try_insert when the key already …","A builder for computing where in a HashMap a key-value …","A builder for computing where in a HashMap a key-value …","A view into a single entry in a map, which may either be …","A view into an occupied entry in a HashMap. It is part of …","A view into a vacant entry in a HashMap. It is part of the …","A vacant entry.","A vacant entry.","A vacant entry.","A view into a vacant entry in a HashMap. It is part of the …","A view into a vacant entry in a HashMap. It is part of the …","An iterator over the values of a HashMap in arbitrary …","A mutable iterator over the values of a HashMap in …","Returns a reference to the underlying allocator.","Provides in-place mutable access to an occupied entry …","Provides in-place mutable access to an occupied entry …","Provides in-place mutable access to an occupied entry …","Provides shared access to the key and owned access to the …","Provides shared access to the key and owned access to the …","Provides shared access to the key and owned access to the …","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","Returns the number of elements the map can hold without …","Clears the map, removing all key-value pairs. Keeps the …","","","","","","","","","","Returns true if the map contains a value for the specified …","Creates an empty HashMap<K, V, S, A>, with the Default …","Clears the map, returning all key-value pairs as an …","Gets the given key’s corresponding entry in the map for …","The entry in the map that was already occupied.","Gets the given key’s corresponding entry by reference in …","","","Inserts all new key-values from the iterator to existing …","Inserts all new key-values from the iterator to existing …","Inserts all new key-values from the iterator to existing …","Drains elements which are true under the given predicate, …","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Creates a RawEntryMut from the given hash and matching …","Access an immutable entry by hash and matching function.","","Creates a RawEntryMut from the given key.","Access an immutable entry by key.","Creates a RawEntryMut from the given key and its hash.","Access an immutable entry by a key and its hash.","Returns a reference to the value corresponding to the key.","Gets a reference to the value in the entry.","Gets a reference to the value in the entry.","Gets a reference to the value in the entry.","Returns the key-value pair corresponding to the supplied …","Gets a reference to the key and value in the entry.","Returns the key-value pair corresponding to the supplied …","Gets a mutable reference to the key and value in the entry.","Attempts to get mutable references to N values in the map …","Attempts to get mutable references to N values in the map …","Attempts to get mutable references to N values in the map …","Attempts to get mutable references to N values in the map …","Returns a mutable reference to the value corresponding to …","Gets a mutable reference to the value in the entry.","Gets a mutable reference to the value in the entry.","Gets a mutable reference to the value in the entry.","Returns a reference to the map’s BuildHasher.","Returns a reference to the value corresponding to the …","Inserts a key-value pair into the map.","Sets the value of the entry, and returns a …","Sets the value of the entry, and returns the entry’s old …","Sets the value of the entry with the VacantEntry’s key, …","Sets the value of the entry, and returns an OccupiedEntry.","Sets the value of the entry, and returns the entry’s old …","Sets the value of the entry with the VacantEntry’s key, …","Sets the value of the entry, and returns an …","Sets the value of the entry, and returns the entry’s old …","Sets the value of the entry with the VacantEntryRef’s …","Sets the value of the entry with the VacantEntry’s key, …","Sets the value of the entry, and returns the entry’s old …","Insert a key-value pair into the map without checking if …","Set the value of an entry with a custom hasher function.","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Creates an iterator over the entries of a HashMap in …","Creates an iterator over the entries of a HashMap in …","Creates a consuming iterator, that is, one that moves each …","","","","","","","","","","","Converts the entry into a mutable reference to the key in …","Take ownership of the key.","Take ownership of the key.","Converts the OccupiedEntry into a mutable reference to the …","Creates a consuming iterator visiting all the keys in …","Converts the OccupiedEntry into a mutable reference to the …","Converts the OccupiedEntry into a mutable reference to the …","Converts the OccupiedEntryRef into a mutable reference to …","Creates a consuming iterator visiting all the values in …","Returns true if the map contains no elements.","An iterator visiting all key-value pairs in arbitrary …","An iterator visiting all key-value pairs in arbitrary …","Gets a reference to the key in the entry.","Returns a reference to this entry’s key.","Gets a reference to the key in the entry.","Gets a reference to the key that would be used when …","Returns a reference to this entry’s key.","Gets a reference to the key in the entry.","Gets a reference to the key that would be used when …","Gets a mutable reference to the key in the entry.","An iterator visiting all keys in arbitrary order. The …","Returns the number of elements in the map.","","","","","","","","","","","","","","","","","","","","Ensures a value is in the entry by inserting the default …","Ensures a value is in the entry by inserting the default …","Ensures a value is in the entry by inserting the default …","Ensures a value is in the entry by inserting the default …","Ensures a value is in the entry by inserting the default …","Ensures a value is in the entry by inserting the result of …","Ensures a value is in the entry by inserting the result of …","Ensures a value is in the entry by inserting the result of …","Ensures a value is in the entry by inserting, if empty, …","Ensures a value is in the entry by inserting, if empty, …","Creates a raw immutable entry builder for the HashMap.","Creates a raw entry builder for the HashMap.","Returns a reference to the RawTable used underneath HashMap…","Returns a mutable reference to the RawTable used …","Removes a key from the map, returning the value at the key …","Takes the value out of the entry, and returns it.","Takes the value out of the entry, and returns it. Keeps …","Takes the value out of the entry, and returns it. Keeps …","Removes a key from the map, returning the stored key and …","Take the ownership of the key and value from the map.","Take the ownership of the key and value from the map. …","Take the ownership of the key and value from the map. …","Replaces the entry, returning the old key and value. The …","Replaces the entry, returning the old key and value. The …","Provides shared access to the key and owned access to the …","Provides shared access to the key and owned access to the …","Provides shared access to the key and owned access to the …","Replaces the key in the hash map with the key used to …","Replaces the key in the hash map with the key used to …","Reserves capacity for at least additional more elements to …","Retains only the elements specified by the predicate. …","Shrinks the capacity of the map with a lower limit. It …","Shrinks the capacity of the map as much as possible. It …","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","Tries to insert a key-value pair into the map, and returns …","","","","","","","","","","","","","","","","","","","","","","","","","Tries to reserve capacity for at least additional more …","","","","","","","","","","","","","","","","","","","","","","","","","The value which was not inserted, because the entry was …","An iterator visiting all values in arbitrary order. The …","An iterator visiting all values mutably in arbitrary order.","Creates an empty HashMap with the specified capacity, …","Creates an empty HashMap with the specified capacity, …","Creates an empty HashMap which will use the given hash …","Creates an empty HashMap which will use the given hash …","A lazy iterator producing elements in the difference of …","A draining iterator over the items of a HashSet.","A view into a single entry in a set, which may either be …","A draining iterator over entries of a HashSet which don’…","A hash set implemented as a HashMap where the value is ().","A lazy iterator producing elements in the intersection of …","An owning iterator over the items of a HashSet.","An iterator over the items of a HashSet.","An occupied entry.","A view into an occupied entry in a HashSet. It is part of …","A lazy iterator producing elements in the symmetric …","A lazy iterator producing elements in the union of HashSet…","A vacant entry.","A view into a vacant entry in a HashSet. It is part of the …","Returns a reference to the underlying allocator.","Returns the intersection of self and rhs as a new …","Returns the union of self and rhs as a new HashSet<T, S>.","Returns the symmetric difference of self and rhs as a new …","","","","","","","","","","","","","","","","","","","","","","","","","Returns the number of elements the set can hold without …","Clears the set, removing all values.","","","","","","","","","","","","","","Returns true if the set contains a value.","Creates an empty HashSet<T, S> with the Default value for …","Visits the values representing the difference, i.e., the …","Clears the set, returning all elements in an iterator.","Gets the given value’s corresponding entry in the set …","","","","","Drains elements which are true under the given predicate, …","","","","","","","","","","","","","","","","","","","","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","","Returns a reference to the value in the set, if any, that …","Returns a reference to this entry’s value.","Gets a reference to the value in the entry.","Gets a reference to the value that would be used when …","Inserts the given value into the set if it is not present, …","Inserts an owned copy of the given value into the set if …","Inserts a value computed from f into the set if the given …","Returns a reference to the set’s BuildHasher.","Adds a value to the set.","Sets the value of the entry, and returns an OccupiedEntry.","Sets the value of the entry with the VacantEntry’s value.","Insert a value the set without checking if the value …","Visits the values representing the intersection, i.e., the …","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Creates a consuming iterator, that is, one that moves each …","","","","","","","","","","Take ownership of the value.","Returns true if self has no elements in common with other. …","Returns true if the set contains no elements.","Returns true if the set is a subset of another, i.e., other…","Returns true if the set is a superset of another, i.e., …","An iterator visiting all elements in arbitrary order. The …","Returns the number of elements in the set.","","","","","","","","","","","","Ensures a value is in the entry by inserting if it was …","Returns a reference to the RawTable used underneath HashSet…","Returns a mutable reference to the RawTable used …","Removes a value from the set. Returns whether the value was","Takes the value out of the entry, and returns it. Keeps …","Adds a value to the set, replacing the existing value, if …","Replaces the entry, returning the old value. The new value …","Reserves capacity for at least additional more elements to …","Retains only the elements specified by the predicate.","Shrinks the capacity of the set with a lower limit. It …","Shrinks the capacity of the set as much as possible. It …","","","","","","","","","Returns the difference of self and rhs as a new …","Visits the values representing the symmetric difference, …","Removes and returns the value in the set, if any, that is …","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","Tries to reserve capacity for at least additional more …","","","","","","","","","","","","","Visits the values representing the union, i.e., all the …","Creates an empty HashSet with the specified capacity, using","Creates an empty HashSet with the specified capacity, using","Creates a new empty hash set which will use the given …","Creates a new empty hash set which will use the given …","Type representing the absence of an entry, as returned by …","A draining iterator over the items of a HashTable.","A view into a single entry in a table, which may either be …","A draining iterator over entries of a HashTable which don…","Low-level hash table with explicit hashing.","An owning iterator over the entries of a HashTable in …","An iterator over the entries of a HashTable in arbitrary …","A mutable iterator over the entries of a HashTable in …","An occupied entry.","A view into an occupied entry in a HashTable. It is part …","A vacant entry.","A view into a vacant entry in a HashTable. It is part of …","Returns a reference to the underlying allocator.","Provides in-place mutable access to an occupied entry …","","","","","","","","","","","","","","","","","","","","","Returns the number of elements the table can hold without …","Clears the table, removing all values.","","","","Clears the set, returning all elements in an iterator.","Returns an Entry for an entry in the table with the given …","Drains elements which are true under the given predicate, …","Returns a reference to an entry in the table with the …","Returns an OccupiedEntry for an entry in the table with …","Returns a mutable reference to an entry in the table with …","","","","","","","","","","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Gets a reference to the value in the entry.","Attempts to get mutable references to N values in the map …","Attempts to get mutable references to N values in the map …","Gets a mutable reference to the value in the entry.","Sets the value of the entry, replacing any existing value …","Inserts a new element into the table with the hash that …","Inserts an element into the HashTable with the given hash …","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","","","","","","","","","Converts the OccupiedEntry into a mutable reference to the …","Converts the OccupiedEntry into a mutable reference to the …","Converts the VacantEntry into a mutable reference to the …","Converts the AbsentEntry into a mutable reference to the …","Returns true if the set contains no elements.","An iterator visiting all elements in arbitrary order. The …","An iterator visiting all elements in arbitrary order, with …","Returns the number of elements in the table.","","","","","Creates an empty HashTable.","Creates an empty HashTable using the given allocator.","","","","","","Ensures a value is in the entry by inserting if it was …","Ensures a value is in the entry by inserting the result of …","Takes the value out of the entry, and returns it along …","Reserves capacity for at least additional more elements to …","Retains only the elements specified by the predicate.","Shrinks the capacity of the table with a lower limit. It …","Shrinks the capacity of the table as much as possible. It …","","","","","","","","","","","","","","","","","","","","","","","","","","","Tries to reserve capacity for at least additional more …","","","","","","","","","","","Creates an empty HashTable with the specified capacity.","Creates an empty HashTable with the specified capacity …","A reference to a hash table bucket containing a T.","A reference to an empty bucket into which an can be …","Iterator which consumes elements without freeing the table …","Iterator which consumes a table and returns elements.","Iterator which returns a raw pointer to every full bucket …","Iterator over occupied buckets that could match a given …","A raw hash table with an unsafe API.","Return the information about memory allocated by the table.","Returns a reference to the underlying allocator.","Returns a unique mutable reference to the value.","Acquires the underlying raw pointer *mut T to data.","Returns a shared immutable reference to the value.","","","","","","","","","","","","","","","Returns a pointer to an element in the table.","Returns the index of a bucket from a Bucket.","Returns the number of buckets in the table.","Returns the number of elements the map can hold without …","Removes all elements from the table without freeing the …","Marks all table buckets as empty without dropping their …","","","","","Variant of clone_from to use when a hasher is available.","","","","Copies size_of<T> bytes from other to self. The source and …","Returns pointer to one past last data element in the table …","Returns pointer to start of data table.","","Returns an iterator which removes all elements from the …","Returns an iterator which removes all elements from the …","","","","Erases an element from the table, dropping it in place.","Finds and erases an element from the table, dropping it in …","Searches for an element in the table.","Searches for an element in the table. If the element is …","","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Gets a reference to an element in the table.","Attempts to get mutable references to N entries in the …","","Gets a mutable reference to an element in the table.","Inserts a new element into the table, and returns its raw …","Inserts a new element into the table, and returns a …","Inserts a new element into the table in the given slot, …","Inserts a new element into the table, without growing the …","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","","","","","","Returns an iterator which consumes all elements from the …","Checks whether the bucket at index is full.","Returns true if the table contains no elements.","Returns an iterator over every element in the table. It is …","","","Returns an iterator over occupied buckets that could match …","Returns the number of elements in the table.","Creates a new empty hash table without allocating any …","Creates a new empty hash table without allocating any …","","","","","Refresh the iterator so that it reflects an insertion into …","Refresh the iterator so that it reflects a removal from …","Removes an element from the table, returning it.","Finds and removes an element from the table, returning it.","Temporary removes a bucket, applying the given function to …","Ensures that at least additional items can be inserted …","Shrinks the table to fit max(self.len(), min_size) …","","","","","","","","","","","","","","Attempts to insert a new element without growing the table …","","","","","","","","Tries to ensure that at least additional items can be …","Attempts to allocate a new hash table with at least enough …","Attempts to allocate a new hash table using the given …","","","","","","","","Allocates a new hash table with at least enough capacity …","Allocates a new hash table using the given allocator, with …"],"i":[1,1,0,0,0,0,0,1,1,1,1,1,4,1,1,1,0,0,0,1,0,1,1,1,1,89,0,0,0,0,0,0,0,0,0,0,0,0,11,13,14,0,0,0,0,0,0,0,0,11,13,14,0,0,0,0,10,11,13,14,11,13,14,90,10,19,35,36,37,38,20,21,26,32,39,40,11,41,42,43,13,44,45,14,47,48,49,90,10,19,35,36,37,38,20,21,26,32,39,40,11,41,42,43,13,44,45,14,47,48,49,10,10,10,19,20,21,10,10,19,20,21,10,10,10,10,49,10,10,10,10,10,10,10,10,19,35,36,37,38,20,21,26,39,40,11,41,42,43,13,44,45,14,47,48,49,49,19,35,36,37,38,20,21,26,39,90,10,19,35,36,37,38,20,21,26,32,39,40,11,41,42,43,13,44,45,14,47,48,49,40,43,10,40,43,40,43,10,41,44,47,10,41,10,41,10,10,10,10,10,41,44,47,10,10,10,11,41,42,13,44,45,14,47,48,42,41,10,42,90,10,19,35,36,37,38,20,21,26,32,39,40,11,41,42,43,13,44,45,14,47,48,49,10,10,10,19,35,36,37,38,20,21,26,32,39,41,45,48,41,10,41,44,47,10,10,10,10,41,13,44,45,14,47,48,41,10,10,19,35,36,37,38,20,21,26,39,19,35,36,37,38,20,21,26,32,39,13,14,11,13,14,11,13,14,13,14,10,10,10,10,10,41,44,47,10,41,44,47,44,47,41,44,47,44,47,10,10,10,10,19,35,36,37,38,20,21,26,32,39,10,19,20,21,49,90,10,19,35,36,37,38,20,21,26,32,39,40,11,41,42,43,13,44,45,14,47,48,49,10,90,10,19,35,36,37,38,20,21,26,32,39,40,11,41,42,43,13,44,45,14,47,48,49,10,90,10,19,35,36,37,38,20,21,26,32,39,40,11,41,42,43,13,44,45,14,47,48,49,49,10,10,10,10,10,10,0,0,0,0,0,0,0,0,63,0,0,0,63,0,56,56,56,56,56,57,65,62,64,58,59,60,61,63,66,67,56,57,65,62,64,58,59,60,61,63,66,67,56,56,56,57,58,59,60,61,56,56,57,58,59,60,61,56,56,56,56,56,56,56,56,56,56,56,57,65,62,58,59,60,61,63,66,67,57,65,62,58,59,60,61,56,56,57,65,62,64,58,59,60,61,63,66,67,56,56,63,66,67,56,56,56,56,56,63,67,56,56,56,57,65,62,64,58,59,60,61,63,66,67,56,56,57,65,62,64,58,59,60,61,67,56,56,56,56,56,56,57,65,62,57,65,62,64,58,59,60,61,63,56,56,56,66,56,66,56,56,56,56,57,65,62,64,58,59,60,61,56,56,56,56,57,58,59,60,61,56,57,65,62,64,58,59,60,61,63,66,67,56,57,65,62,64,58,59,60,61,63,66,67,56,56,57,65,62,64,58,59,60,61,63,66,67,56,56,56,56,56,0,0,0,0,0,0,0,0,71,0,71,0,70,71,70,71,74,76,75,77,78,79,72,73,70,71,74,76,75,77,78,79,72,73,70,70,70,70,70,70,70,70,70,70,70,70,71,74,76,75,72,77,78,79,70,71,74,76,75,77,78,79,72,73,74,70,70,74,71,76,70,70,71,74,76,75,77,78,79,72,73,70,70,70,77,78,79,72,73,74,74,76,75,70,70,70,70,77,78,79,72,70,70,77,78,79,72,73,71,71,74,70,70,70,70,77,78,79,72,73,70,70,71,74,76,75,77,78,79,72,73,70,71,74,76,75,77,78,79,72,73,70,70,71,74,76,75,77,78,79,72,73,70,70,0,0,0,0,0,0,0,54,54,83,83,83,87,83,54,84,86,85,88,87,83,54,84,86,85,88,54,54,54,54,54,54,83,54,84,54,54,83,54,84,83,54,54,54,54,54,54,86,85,54,54,54,54,84,87,83,54,84,86,85,88,54,54,54,54,54,54,54,54,87,83,54,84,86,85,88,54,84,86,85,88,54,54,54,54,86,85,54,54,54,54,84,86,85,88,84,84,54,54,54,54,54,84,86,85,83,54,84,87,83,54,84,86,85,88,54,87,83,54,84,86,85,88,54,54,54,87,83,54,84,86,85,88,54,54],"f":"```````{ce{}{}}0{bb}{{ce}d{}{}}{{bb}f}{{hc}fj}{{ce}f{}{}}{{bl}n}{cc{}}```7`7{c{{A`{e}}}{}{}}0{cAb{}}```````````````````````````````{{{Ad{cegi}}}i{}{}{}`}{{{Af{cegi}}k}{{Af{cegi}}}{}{}{}`{{Ah{ce}}}}{{{Aj{cegi}}k}{{Aj{cegi}}}{}{}{}`{{Ah{e}}}}{{{Al{cegik}}m}{{Al{cegik}}}{}j{}{}`{{Ah{g}}}}{{{Af{cegi}}k}{{Af{cegi}}}{}{}{}`{{Ah{ce}{{An{{B`{e}}}}}}}}{{{Aj{cegi}}k}{{Aj{cegi}}}{}{}{}`{{Ah{ce}{{An{{B`{e}}}}}}}}{{{Al{cegik}}m}{{Al{cegik}}}{}j{}{}`{{Ah{cg}{{An{{B`{g}}}}}}}}{ce{}{}}00000000000000000000000000000000000000000000000{{{Ad{cegi}}}Bb{}{}{}`}{{{Ad{cegi}}}d{}{}{}`}{{{Ad{cegi}}}{{Ad{cegi}}}BdBdBd{`Bd}}{{{Bf{ce}}}{{Bf{ce}}}{}{}}{{{Bh{ce}}}{{Bh{ce}}}{}{}}{{{Bj{ce}}}{{Bj{ce}}}{}{}}{{{Ad{cegi}}{Ad{cegi}}}dBdBdBd{`Bd}}{{ce}d{}{}}000{{{Ad{cegi}}k}f{BlBn}{}C``{Bn{h{c}}j}}{{}{{Ad{cegi}}}{}{}Cb{Cb`}}{{{Ad{cegi}}}{{Cd{cei}}}{}{}{}`}{{{Ad{cegi}}c}{{Aj{cegi}}}{BlBn}{}C``}`{{{Ad{cegi}}k}{{Al{ckegi}}}{BlBn}{}C``{Bn{h{c}}j}}{{{Ad{cegi}}{Ad{cegi}}}f{BlBn}CfC``}{{ce}f{}{}}{{{Ad{cegi}}k}d{BlBn}{}C``{{Cl{}{{Ch{{Cj{ce}}}}}}}}{{{Ad{cegi}}k}d{BlBnCn}CnC``{{Cl{}{{Ch{{Cj{ce}}}}}}}}0{{{Ad{cegi}}k}{{D`{ceki}}}{}{}{}`{{Db{ce}{{An{f}}}}}}{{{Ad{cegi}}l}nDdDd{}`}{{{Bf{ce}}l}nDdDd}{{{Df{ce}}l}nDdDd}{{{Dh{ceg}}l}nDdDd`}{{{Dj{ceg}}l}nDdDd`}{{{Dl{ceg}}l}n{}Dd`}{{{Bh{ce}}l}nDd{}}{{{Bj{ce}}l}n{}Dd}{{{Cd{ceg}}l}nDdDd`}{{{Dn{ce}}l}n{}Dd}{{{E`{cegi}}l}n{}{}{}`}{{{Af{cegi}}l}nDdDd{}`}{{{Eb{cegi}}l}nDdDd{}`}{{{Ed{cegi}}l}n{}{}{}`}{{{Ef{cegi}}l}n{}{}{}`}{{{Aj{cegi}}l}nDdDd{}`}{{{Eh{cegi}}l}nDdDd{}`}{{{Ej{cegi}}l}nDd{}{}`}{{{Al{ecgik}}l}n{jDd}{{El{c}}}Dd{}`}{{{En{ecgik}}l}n{jDd}{{El{c}}}Dd{}`}{{{F`{ecgik}}l}n{jDd}{{El{c}}}{}{}`}{{{Fb{cegi}}l}nDdDd{}`}0{{{Bf{ce}}gk}g{}{}{}{}{{Db{gi}{{An{g}}}}}}{{{Df{ce}}gk}g{}{}{}{}{{Db{gi}{{An{g}}}}}}{{{Dh{ceg}}im}i{}{}`{}{}{{Db{ik}{{An{i}}}}}}{{{Dj{ceg}}im}i{}{}`{}{}{{Db{ik}{{An{i}}}}}}{{{Dl{ceg}}im}i{}{}`{}{}{{Db{ik}{{An{i}}}}}}{{{Bh{ce}}gk}g{}{}{}{}{{Db{gi}{{An{g}}}}}}{{{Bj{ce}}gk}g{}{}{}{}{{Db{gi}{{An{g}}}}}}{{{Cd{ceg}}im}i{}{}`{}{}{{Db{ik}{{An{i}}}}}}{{{Dn{ce}}gk}g{}{}{}{}{{Db{gi}{{An{g}}}}}}{cc{}}00000000000000000000000{{{E`{cegi}}Fdk}{{Af{cegi}}}{}{}{}`{{Db{c}{{An{f}}}}}}{{{Ef{cegi}}Fdk}{{B`{{Cj{ce}}}}}{}{}{}`{{Db{c}{{An{f}}}}}}{g{{Ad{ceik}}}{BlBn}{}{{Cl{}{{Ch{{Cj{ce}}}}}}}{C`Cb}{Cb`}}{{{E`{cegi}}k}{{Af{cegi}}}{}{}C``{Bn{h{c}}j}}{{{Ef{cegi}}k}{{B`{{Cj{ce}}}}}{}{}C``{Bn{h{c}}j}}{{{E`{cegi}}Fdk}{{Af{cegi}}}{}{}{}`{{h{c}}j}}{{{Ef{cegi}}Fdk}{{B`{{Cj{ce}}}}}{}{}{}`{{h{c}}j}}{{{Ad{cegi}}k}{{B`{e}}}{BlBn}{}C``{Bn{h{c}}j}}{{{Eb{cegi}}}e{}{}{}`}{{{Eh{cegi}}}e{}{}{}`}{{{En{cegik}}}g{}j{}{}`}{{{Ad{cegi}}k}{{B`{{Cj{ce}}}}}{BlBn}{}C``{Bn{h{c}}j}}{{{Eb{cegi}}}{{Cj{ce}}}{}{}{}`}10{{{Ad{cegi}}{Ff{k}}}{{B`{{Ff{{Cj{ce}}}}}}}{BlBn}{}C``{Bn{h{c}}j}}0{{{Ad{cegi}}{Ff{k}}}{{B`{{Ff{e}}}}}{BlBn}{}C``{Bn{h{c}}j}}07654{{{Ad{cegi}}}g{}{}{}`}{{{Ad{cegi}}k}e{BlBn}{}C``{Bn{h{c}}j}}{{{Ad{cegi}}ce}{{B`{e}}}{BlBn}{}C``}{{{Af{cegi}}ce}{{Eb{cegi}}}Bn{}C``}{{{Eb{cegi}}e}e{}{}{}`}{{{Ed{cegi}}ce}{{Cj{ce}}}Bn{}C``}{{{Aj{cegi}}e}{{Eh{cegi}}}Bn{}C``}{{{Eh{cegi}}e}e{}{}{}`}{{{Ej{cegi}}e}eBn{}C``}{{{Al{ecgik}}g}{{En{ecgik}}}j{Bn{Fh{c}}}{}C``}{{{En{cegik}}g}g{}j{}{}`}{{{F`{ecgik}}g}gj{Bn{Fh{c}}}{}C``}{{{Ed{cegi}}Fdce}{{Cj{ce}}}Bn{}C``}{{{Eb{cegi}}c}c{}{}{}`}{{{Ad{cegi}}ce}{{Cj{ce}}}{BlBn}{}C``}{{{Ed{cegi}}Fdcek}{{Cj{ce}}}{}{}{}`{{Fj{c}{{An{Fd}}}}}}{ce{}{}}00000000000000000000000{{{Ad{cegi}}}{{Bf{ce}}}{}{}{}`}{{{Ad{cegi}}}{{Df{ce}}}{}{}{}`}{{{Ad{cegi}}}{{Dh{cei}}}{}{}{}`}3333333333{{{Eb{cegi}}}c{}{}{}`}{{{Ej{cegi}}}c{}{}{}`}{{{F`{ecgik}}}ej{{Fh{c}}}{}{}`}{{{Eb{cegi}}}{{Cj{ce}}}{}{}{}`}{{{Ad{cegi}}}{{Dj{cei}}}{}{}{}`}{{{Eb{cegi}}}e{}{}{}`}{{{Eh{cegi}}}e{}{}{}`}{{{En{cegik}}}g{}j{}{}`}{{{Ad{cegi}}}{{Dl{cei}}}{}{}{}`}{{{Ad{cegi}}}f{}{}{}`}<;9{{{Aj{cegi}}}c{}{}{}`}{{{Eh{cegi}}}c{}{}{}`}:{{{Al{ecgik}}}cj{{El{c}}}{}{}`}{{{En{cegik}}}c{}j{}{}`}{{{F`{ecgik}}}cj{{El{c}}}{}{}`}>{{{Ad{cegi}}}{{Bh{ce}}}{}{}{}`}{{{Ad{cegi}}}Bb{}{}{}`}{{{Bf{ce}}}Bb{}{}}{{{Df{ce}}}Bb{}{}}{{{Dh{ceg}}}Bb{}{}`}{{{Dj{ceg}}}Bb{}{}`}{{{Dl{ceg}}}Bb{}{}`}{{{Bh{ce}}}Bb{}{}}{{{Bj{ce}}}Bb{}{}}{{{Cd{ceg}}}Bb{}{}`}{{{Dn{ce}}}Bb{}{}}{{{Bf{ce}}}{{B`{{Cj{ce}}}}}{}{}}{{{Df{ce}}}{{B`{{Cj{ce}}}}}{}{}}{{{Dh{ceg}}}{{B`{{Cj{ce}}}}}{}{}`}{{{Dj{ceg}}}{{B`{c}}}{}{}`}{{{Dl{ceg}}}{{B`{e}}}{}{}`}{{{Bh{ce}}}{{B`{c}}}{}{}}{{{Bj{ce}}}{{B`{e}}}{}{}}{{{Cd{ceg}}}{{B`{{Cj{ce}}}}}{}{}`}{{{D`{cegi}}}{{B`{k}}}{}{}{{Db{ce}{{An{f}}}}}`{}}{{{Dn{ce}}}{{B`{e}}}{}{}}{{{Aj{cegi}}}eBnCbC``}{{{Al{ecgik}}}gj{Bn{Fh{c}}}CbC``}{{{Af{cegi}}ce}{{Cj{ce}}}Bn{}C``}{{{Aj{cegi}}e}eBn{}C``}{{{Al{ecgik}}g}gj{Bn{Fh{c}}}{}C``}{{{Af{cegi}}k}{{Cj{ce}}}Bn{}C``{{Ah{}{{An{{Cj{ce}}}}}}}}{{{Aj{cegi}}k}eBn{}C``{{Ah{}{{An{e}}}}}}{{{Al{ecgik}}m}gj{Bn{Fh{c}}}{}C``{{Ah{}{{An{g}}}}}}{{{Aj{cegi}}k}eBn{}C``{{Ah{c}{{An{e}}}}}}{{{Al{ecgik}}m}gj{Bn{El{c}}{Fh{c}}}{}C``{{Ah{c}{{An{g}}}}}}{{{Ad{cegi}}}{{Ef{cegi}}}{}{}{}`}{{{Ad{cegi}}}{{E`{cegi}}}{}{}{}`}{{{Ad{cegi}}}{{Fl{{Cj{ce}}i}}}{}{}{}`}0{{{Ad{cegi}}k}{{B`{e}}}{BlBn}{}C``{Bn{h{c}}j}}{{{Eb{cegi}}}e{}{}{}`}{{{Eh{cegi}}}e{}{}{}`}{{{En{cegik}}}g{}j{}{}`}{{{Ad{cegi}}k}{{B`{{Cj{ce}}}}}{BlBn}{}C``{Bn{h{c}}j}}{{{Eb{cegi}}}{{Cj{ce}}}{}{}{}`}{{{Eh{cegi}}}{{Cj{ce}}}{}{}{}`}{{{En{cegik}}}{{Cj{cg}}}{}j{}{}`}{{{Eh{cegi}}e}{{Cj{ce}}}{}{}{}`}{{{En{ecgik}}g}{{Cj{eg}}}j{{Fh{c}}}{}{}`}{{{Eb{cegi}}k}{{Af{cegi}}}{}{}{}`{{Ah{ce}{{An{{B`{e}}}}}}}}{{{Eh{cegi}}k}{{Aj{cegi}}}{}{}{}`{{Ah{ce}{{An{{B`{e}}}}}}}}{{{En{cegik}}m}{{Al{cegik}}}{}j{}{}`{{Ah{cg}{{An{{B`{g}}}}}}}}{{{Eh{cegi}}}c{}{}{}`}{{{En{ecgik}}}ej{{Fh{c}}}{}{}`}{{{Ad{cegi}}Bb}d{BlBn}{}C``}{{{Ad{cegi}}k}d{}{}{}`{{Db{ce}{{An{f}}}}}}1{{{Ad{cegi}}}d{BlBn}{}C``}{{{Bf{ce}}}{{Cj{Bb{B`{Bb}}}}}{}{}}{{{Df{ce}}}{{Cj{Bb{B`{Bb}}}}}{}{}}{{{Dh{ceg}}}{{Cj{Bb{B`{Bb}}}}}{}{}`}{{{Dj{ceg}}}{{Cj{Bb{B`{Bb}}}}}{}{}`}{{{Dl{ceg}}}{{Cj{Bb{B`{Bb}}}}}{}{}`}{{{Bh{ce}}}{{Cj{Bb{B`{Bb}}}}}{}{}}{{{Bj{ce}}}{{Cj{Bb{B`{Bb}}}}}{}{}}{{{Cd{ceg}}}{{Cj{Bb{B`{Bb}}}}}{}{}`}{{{D`{cegi}}}{{Cj{Bb{B`{Bb}}}}}{}{}{{Db{ce}{{An{f}}}}}`}{{{Dn{ce}}}{{Cj{Bb{B`{Bb}}}}}{}{}}{ce{}{}}000{cFn{}}{c{{A`{e}}}{}{}}00000000000000000000000{{{Ad{cegi}}ce}{{A`{e{Fb{cegi}}}}}{BlBn}{}C``}111111111111111111111111{{{Ad{cegi}}Bb}{{A`{db}}}{BlBn}{}C``}{cAb{}}00000000000000000000000`{{{Ad{cegi}}}{{Bj{ce}}}{}{}{}`}{{{Ad{cegi}}}{{Dn{ce}}}{}{}{}`}{{Bbc}{{Ad{egc}}}{}{}{}}{{Bbce}{{Ad{gice}}}{}`{}{}}{c{{Ad{egc}}}{}{}{}}{{ce}{{Ad{gice}}}{}`{}{}}``````````````{{{G`{ceg}}}g{}{}`}{{{G`{ceg}}{G`{ceg}}}{{G`{ce}}}{BlBnBd}{C`Cb}`}0{{{G`{ce}}{G`{ce}}}{{G`{ce}}}{BlBnBd}{C`Cb}}>>>>>>>>>>>>>>>>>>>>>>>>{{{G`{ceg}}}Bb{}{}`}{{{G`{ceg}}}d{}{}`}{{{G`{ceg}}}{{G`{ceg}}}BdBd{`Bd}}{{{Gb{c}}}{{Gb{c}}}{}}{{{Gd{ceg}}}{{Gd{ceg}}}{}{}`}{{{Gf{ceg}}}{{Gf{ceg}}}{}{}`}{{{Gh{ceg}}}{{Gh{ceg}}}{}{}`}{{{Gj{ceg}}}{{Gj{ceg}}}{}{}`}{{{G`{ceg}}{G`{ceg}}}dBdBd{`Bd}}{{ce}d{}{}}00000{{{G`{ceg}}i}f{BlBn}C``{Bn{h{c}}j}}{{}{{G`{ceg}}}{}Cb{Cb`}}{{{G`{ceg}}{G`{ceg}}}{{Gf{ceg}}}{BlBn}C``}{{{G`{ceg}}}{{Gl{cg}}}{}{}`}{{{G`{ceg}}c}{{Gn{ceg}}}{BlBn}C``}{{{G`{ceg}}{G`{ceg}}}f{BlBn}C``}{{ce}f{}{}}{{{G`{ceg}}i}d{BlBnCn}C``{{Cl{}{{Ch{c}}}}}}{{{G`{ceg}}i}d{BlBn}C``{{Cl{}{{Ch{c}}}}}}{{{G`{ceg}}i}{{H`{cig}}}{}{}`{{Db{c}{{An{f}}}}}}{{{G`{ceg}}l}nDd{}`}{{{Gb{c}}l}nDd}{{{Hb{ce}}l}nDd`}{{{Gl{ce}}l}nDd`}{{{Gd{ceg}}l}n{DdBlBn}C``}{{{Gf{ceg}}l}n{DdBlBn}C``}{{{Gh{ceg}}l}n{DdBlBn}C``}{{{Gj{ceg}}l}n{DdBlBn}C``}{{{Gn{ceg}}l}nDd{}`}{{{Hd{ceg}}l}nDd{}`}{{{Hf{ceg}}l}nDd{}`}{{{Gb{c}}ei}e{}{}{}{{Db{eg}{{An{e}}}}}}{{{Hb{ce}}gk}g{}`{}{}{{Db{gi}{{An{g}}}}}}{{{Gl{ce}}gk}g{}`{}{}{{Db{gi}{{An{g}}}}}}{{{Gd{ceg}}im}i{BlBn}C``{}{}{{Db{ik}{{An{i}}}}}}{{{Gf{ceg}}im}i{BlBn}C``{}{}{{Db{ik}{{An{i}}}}}}{{{Gh{ceg}}im}i{BlBn}C``{}{}{{Db{ik}{{An{i}}}}}}{{{Gj{ceg}}im}i{BlBn}C``{}{}{{Db{ik}{{An{i}}}}}}{{{Ad{cdeg}}}{{G`{ceg}}}{}{}`}{cc{}}00000000000{e{{G`{cgi}}}{BlBn}{{Cl{}{{Ch{c}}}}}{C`Cb}{Cb`}}{{{G`{ceg}}i}{{B`{c}}}{BlBn}C``{Bn{h{c}}j}}{{{Gn{ceg}}}c{}{}`}{{{Hd{ceg}}}c{}{}`}{{{Hf{ceg}}}c{}{}`}{{{G`{ceg}}c}c{BlBn}C``}{{{G`{ceg}}i}c{BlBn}C``{Bn{h{c}}{Hj{}{{Hh{c}}}}j}}{{{G`{ceg}}ik}c{BlBn}C``{Bn{h{c}}j}{{Ah{i}{{An{c}}}}}}{{{G`{ceg}}}e{}{}`}{{{G`{ceg}}c}f{BlBn}C``}{{{Gn{ceg}}}{{Hd{ceg}}}BnC``}{{{Hf{ceg}}}dBnC``}6{{{G`{ceg}}{G`{ceg}}}{{Gd{ceg}}}{BlBn}C``}{ce{}{}}00000000000{{{G`{ceg}}}{{Hb{cg}}}{}{}`}{{{G`{ceg}}}{{Gb{c}}}{}{}`}22222222;{{{G`{ceg}}{G`{ceg}}}f{BlBn}C``}{{{G`{ceg}}}f{}{}`}112{{{G`{ceg}}}Bb{}{}`}{{{Gb{c}}}Bb{}}{{{Hb{ce}}}Bb{}`}{{{Gl{ce}}}Bb{}`}{{{Gb{c}}}{{B`{c}}}{}}{{{Hb{ce}}}{{B`{c}}}{}`}{{{Gl{ce}}}{{B`{c}}}{}`}{{{H`{ceg}}}{{B`{i}}}{}{{Db{c}{{An{f}}}}}`{}}{{{Gd{ceg}}}{{B`{c}}}{BlBn}C``}{{{Gf{ceg}}}{{B`{c}}}{BlBn}C``}{{{Gh{ceg}}}{{B`{c}}}{BlBn}C``}{{{Gj{ceg}}}{{B`{c}}}{BlBn}C``}{{{Gn{ceg}}}dBnC``}{{{G`{ceg}}}{{Fl{{Cj{cd}}g}}}{}{}`}0{{{G`{ceg}}i}f{BlBn}C``{Bn{h{c}}j}}{{{Hd{ceg}}}c{}{}`}{{{G`{ceg}}c}{{B`{c}}}{BlBn}C``}1{{{G`{ceg}}Bb}d{BlBn}C``}{{{G`{ceg}}i}d{}{}`{{Db{c}{{An{f}}}}}}1{{{G`{ceg}}}d{BlBn}C``}{{{Gb{c}}}{{Cj{Bb{B`{Bb}}}}}{}}{{{Hb{ce}}}{{Cj{Bb{B`{Bb}}}}}{}`}{{{Gl{ce}}}{{Cj{Bb{B`{Bb}}}}}{}`}{{{H`{ceg}}}{{Cj{Bb{B`{Bb}}}}}{}{{Db{c}{{An{f}}}}}`}{{{Gd{ceg}}}{{Cj{Bb{B`{Bb}}}}}{BlBn}C``}{{{Gf{ceg}}}{{Cj{Bb{B`{Bb}}}}}{BlBn}C``}{{{Gh{ceg}}}{{Cj{Bb{B`{Bb}}}}}{BlBn}C``}{{{Gj{ceg}}}{{Cj{Bb{B`{Bb}}}}}{BlBn}C``}{{{G`{ce}}{G`{ce}}}{{G`{ce}}}{BlBnBd}{C`Cb}}{{{G`{ceg}}{G`{ceg}}}{{Gh{ceg}}}{BlBn}C``}{{{G`{ceg}}i}{{B`{c}}}{BlBn}C``{Bn{h{c}}j}}{ce{}{}}00000{c{{A`{e}}}{}{}}00000000000000000000000{{{G`{ceg}}Bb}{{A`{db}}}{BlBn}C``}{cAb{}}00000000000{{{G`{ceg}}{G`{ceg}}}{{Gj{ceg}}}{BlBn}C``}{{Bbc}{{G`{ec`}}}{}{}}{{Bbce}{{G`{gce}}}{}`{}}{c{{G`{ec`}}}{}{}}{{ce}{{G`{gce}}}{}`{}}````````````{{{Hl{ce}}}e{}`}{{{Hn{ce}}g}{{Hn{ce}}}{}`{{Ah{c}}}}::::::::::::::::::::{{{Hl{ce}}}Bb{}`}{{{Hl{ce}}}d{}`}{{{Hl{ce}}}{{Hl{ce}}}Bd{`Bd}}{{ce}d{}{}}{{}{{Hl{ce}}}{}{`Cb}}{{{Hl{ce}}}{{I`{ce}}}{}`}{{{Hl{ce}}Fdgi}{{Hn{ce}}}{}`{{Db{c}{{An{f}}}}}{{Fj{c}{{An{Fd}}}}}}{{{Hl{ce}}g}{{Ib{cge}}}{}`{{Db{c}{{An{f}}}}}}{{{Hl{ce}}Fdg}{{B`{c}}}{}`{{Db{c}{{An{f}}}}}}{{{Hl{ce}}Fdg}{{A`{{Id{ce}}{If{ce}}}}}{}`{{Db{c}{{An{f}}}}}}1{{{Hl{ce}}l}nDd`}{{{Hn{ce}}l}nDd`}{{{Id{ce}}l}nDd`}{{{Ih{ce}}l}nDd`}{{{If{ce}}l}nDd`}{{{I`{ce}}l}nDd`}{{{Ij{c}}ei}e{}{}{}{{Db{eg}{{An{e}}}}}}{{{Il{c}}ei}e{}{}{}{{Db{eg}{{An{e}}}}}}{{{In{ce}}gk}g{}`{}{}{{Db{gi}{{An{g}}}}}}{cc{}}000000000{{{Id{ce}}}c{}`}{{{Hl{ce}}{Ff{Fd}}g}{{B`{{Ff{c}}}}}{}`{{Db{Bbc}{{An{f}}}}}}01{{{Hn{ce}}c}{{Id{ce}}}{}`}{{{Ih{ce}}c}{{Id{ce}}}{}`}{{{Hl{ce}}Fdcg}{{Id{ce}}}{}`{{Fj{c}{{An{Fd}}}}}}{ce{}{}}000000000{{{Hl{ce}}}{{Il{c}}}{}`}{{{Hl{ce}}}{{In{ce}}}{}`}{{{Hl{ce}}}{{Ij{c}}}{}`}333338{{{Id{ce}}}{{Hl{ce}}}{}`}{{{Ih{ce}}}{{Hl{ce}}}{}`}{{{If{ce}}}{{Hl{ce}}}{}`}{{{Hl{ce}}}f{}`}46{{{Hl{ce}}}Bb{}`}{{{Ij{c}}}Bb{}}{{{Il{c}}}Bb{}}{{{In{ce}}}Bb{}`}{{{I`{ce}}}Bb{}`}{{}{{Hl{c`}}}{}}{c{{Hl{ec}}}`{}}{{{Ij{c}}}{{B`{e}}}{}{}}{{{Il{c}}}{{B`{e}}}{}{}}{{{In{ce}}}{{B`{g}}}{}`{}}{{{I`{ce}}}{{B`{c}}}{}`}{{{Ib{ceg}}}{{B`{i}}}{}{{Db{c}{{An{f}}}}}`{}}{{{Hn{ce}}c}{{Id{ce}}}{}`}{{{Hn{ce}}g}{{Id{ce}}}{}`{{Ah{}{{An{c}}}}}}{{{Id{ce}}}{{Cj{c{Ih{ce}}}}}{}`}{{{Hl{ce}}Bbg}d{}`{{Fj{c}{{An{Fd}}}}}}{{{Hl{ce}}g}d{}`{{Db{c}{{An{f}}}}}}1{{{Hl{ce}}g}d{}`{{Fj{c}{{An{Fd}}}}}}{{{Ij{c}}}{{Cj{Bb{B`{Bb}}}}}{}}{{{Il{c}}}{{Cj{Bb{B`{Bb}}}}}{}}{{{In{ce}}}{{Cj{Bb{B`{Bb}}}}}{}`}{{{I`{ce}}}{{Cj{Bb{B`{Bb}}}}}{}`}{{{Ib{ceg}}}{{Cj{Bb{B`{Bb}}}}}{}{{Db{c}{{An{f}}}}}`}{ce{}{}}{c{{A`{e}}}{}{}}0000000000000000000{{{Hl{ce}}Bbg}{{A`{db}}}{}`{{Fj{c}{{An{Fd}}}}}}{cAb{}}000000000{Bb{{Hl{c`}}}{}}{{Bbc}{{Hl{ec}}}`{}}```````{{{Fl{ce}}}{{Cj{{Jb{J`}}Jd}}}{}`}{{{Fl{ce}}}e{}`}{{{Jf{c}}}c{}}{{{Jf{c}}}{}{}}199999999999999{{{Fl{ce}}Bb}{{Jf{c}}}{}`}{{{Fl{ce}}{Jf{c}}}Bb{}`}{{{Fl{ce}}}Bb{}`}0{{{Fl{ce}}}d{}`}0{{{Jf{c}}}{{Jf{c}}}{}}{{{Fl{ce}}}{{Fl{ce}}}Bd{`Bd}}{{{Jh{c}}}{{Jh{c}}}{}}{{{Fl{ce}}{Fl{ce}}}dBd{`Bd}}{{{Fl{ce}}{Fl{ce}}g}dBd{`Bd}{{Fj{c}{{An{Fd}}}}}}{{ce}d{}{}}00{{{Jf{c}}{Jf{c}}}d{}}{{{Fl{ce}}}{{Jb{c}}}{}`}0{{}{{Fl{ce}}}{}{`Cb}}{{{Fl{ce}}}{{Jj{ce}}}{}`}{{{Fl{ce}}{Jh{c}}}{{Jj{ce}}}{}`};{{{Jl{ce}}}d{}`}{{{Jj{ce}}}d{}`}{{{Fl{ce}}{Jf{c}}}d{}`}{{{Fl{ce}}Fdg}f{}`{{Db{c}{{An{f}}}}}}{{{Fl{ce}}Fdg}{{B`{{Jf{c}}}}}{}`{{Db{c}{{An{f}}}}}}{{{Fl{ce}}Fdgi}{{A`{{Jf{c}}Jn}}}{}`{{Db{c}{{An{f}}}}}{{Fj{c}{{An{Fd}}}}}}{{{Jh{c}}ei}e{}{}{}{{Db{eg}{{An{e}}}}}}{cc{}}000000{{{Fl{ce}}Fdg}{{B`{c}}}{}`{{Db{c}{{An{f}}}}}}{{{Fl{ce}}{Ff{Fd}}g}{{B`{{Ff{c}}}}}{}`{{Db{Bbc}{{An{f}}}}}}01{{{Fl{ce}}Fdcg}{{Jf{c}}}{}`{{Fj{c}{{An{Fd}}}}}}{{{Fl{ce}}Fdcg}c{}`{{Fj{c}{{An{Fd}}}}}}{{{Fl{ce}}FdJnc}{{Jf{c}}}{}`}{{{Fl{ce}}Fdc}{{Jf{c}}}{}`}{ce{}{}}000000{{{Fl{ce}}}{{Jl{ce}}}{}`}1111{{{Fl{ce}}{Jh{c}}}{{Jl{ce}}}{}`}{{{Fl{ce}}Bb}f{}`}{{{Fl{ce}}}f{}`}{{{Fl{ce}}}{{Jh{c}}}{}`}{{{Jl{ce}}}{{Jh{c}}}{}`}{{{Jj{ce}}}{{Jh{c}}}{}`}{{{Fl{ce}}Fd}{{K`{c}}}{}`}{{{Fl{ce}}}Bb{}`}{{}{{Fl{c`}}}{}}{c{{Fl{ec}}}`{}}{{{Jh{c}}}{{B`{{Jf{c}}}}}{}}{{{Jl{ce}}}{{B`{c}}}{}`}{{{Jj{ce}}}{{B`{c}}}{}`}{{{K`{c}}}{{B`{{Jf{c}}}}}{}}{{{Jh{c}}{Jf{c}}}d{}}0{{{Fl{ce}}{Jf{c}}}{{Cj{cJn}}}{}`}{{{Fl{ce}}Fdg}{{B`{c}}}{}`{{Db{c}{{An{f}}}}}}{{{Fl{ce}}{Jf{c}}g}f{}`{{Ah{c}{{An{{B`{c}}}}}}}}{{{Fl{ce}}Bbg}d{}`{{Fj{c}{{An{Fd}}}}}}0{{{Jh{c}}}{{Cj{Bb{B`{Bb}}}}}{}}{{{Jl{ce}}}{{Cj{Bb{B`{Bb}}}}}{}`}{{{Jj{ce}}}{{Cj{Bb{B`{Bb}}}}}{}`}{ce{}{}}00{c{{A`{e}}}{}{}}000000{{{Fl{ce}}Fdc}{{A`{{Jf{c}}c}}}{}`}1111111{{{Fl{ce}}Bbg}{{A`{db}}}{}`{{Fj{c}{{An{Fd}}}}}}{Bb{{A`{{Fl{c`}}b}}}{}}{{Bbc}{{A`{{Fl{ec}}b}}}`{}}{cAb{}}000000{Bb{{Fl{c`}}}{}}{{Bbc}{{Fl{ec}}}`{}}","c":[],"p":[[6,"TryReserveError",0],[1,"unit"],[1,"bool"],[10,"Equivalent",0],[10,"Sized",947],[5,"Formatter",948],[8,"Result",948],[6,"Result",949],[5,"TypeId",950],[5,"HashMap",26],[6,"RawEntryMut",26],[10,"FnOnce",951],[6,"Entry",26],[6,"EntryRef",26],[17,"Output"],[6,"Option",952],[1,"usize"],[10,"Clone",953],[5,"Iter",26],[5,"Keys",26],[5,"Values",26],[10,"Eq",954],[10,"Hash",955],[10,"BuildHasher",955],[10,"Default",956],[5,"Drain",26],[10,"PartialEq",954],[17,"Item"],[1,"tuple"],[10,"IntoIterator",957],[10,"Copy",947],[5,"ExtractIf",26],[10,"FnMut",951],[10,"Debug",948],[5,"IterMut",26],[5,"IntoIter",26],[5,"IntoKeys",26],[5,"IntoValues",26],[5,"ValuesMut",26],[5,"RawEntryBuilderMut",26],[5,"RawOccupiedEntryMut",26],[5,"RawVacantEntryMut",26],[5,"RawEntryBuilder",26],[5,"OccupiedEntry",26],[5,"VacantEntry",26],[10,"Borrow",958],[5,"OccupiedEntryRef",26],[5,"VacantEntryRef",26],[5,"OccupiedError",26],[1,"u64"],[1,"array"],[10,"From",959],[10,"Fn",951],[5,"RawTable",812],[5,"String",960],[5,"HashSet",436],[5,"Iter",436],[5,"Intersection",436],[5,"Difference",436],[5,"SymmetricDifference",436],[5,"Union",436],[5,"Drain",436],[6,"Entry",436],[5,"ExtractIf",436],[5,"IntoIter",436],[5,"OccupiedEntry",436],[5,"VacantEntry",436],[17,"Owned"],[10,"ToOwned",961],[5,"HashTable",658],[6,"Entry",658],[5,"Drain",658],[5,"ExtractIf",658],[5,"OccupiedEntry",658],[5,"AbsentEntry",658],[5,"VacantEntry",658],[5,"Iter",658],[5,"IterMut",658],[5,"IntoIter",658],[1,"u8"],[5,"NonNull",962],[5,"Layout",963],[5,"Bucket",812],[5,"RawIter",812],[5,"RawDrain",812],[5,"RawIntoIter",812],[5,"InsertSlot",812],[5,"RawIterHash",812],[15,"AllocError",25],[6,"DefaultHashBuilder",26]],"b":[[130,"impl-Extend%3C(K,+V)%3E-for-HashMap%3CK,+V,+S,+A%3E"],[131,"impl-Extend%3C(%26K,+%26V)%3E-for-HashMap%3CK,+V,+S,+A%3E"],[132,"impl-Extend%3C%26(K,+V)%3E-for-HashMap%3CK,+V,+S,+A%3E"],[155,"impl-Debug-for-OccupiedError%3C\'_,+K,+V,+S,+A%3E"],[156,"impl-Display-for-OccupiedError%3C\'a,+K,+V,+S,+A%3E"],[253,"impl-IntoIterator-for-%26HashMap%3CK,+V,+S,+A%3E"],[254,"impl-IntoIterator-for-%26mut+HashMap%3CK,+V,+S,+A%3E"],[255,"impl-IntoIterator-for-HashMap%3CK,+V,+S,+A%3E"],[500,"impl-Extend%3C%26T%3E-for-HashSet%3CT,+S,+A%3E"],[501,"impl-Extend%3CT%3E-for-HashSet%3CT,+S,+A%3E"],[560,"impl-IntoIterator-for-HashSet%3CT,+S,+A%3E"],[561,"impl-IntoIterator-for-%26HashSet%3CT,+S,+A%3E"],[739,"impl-IntoIterator-for-%26mut+HashTable%3CT,+A%3E"],[740,"impl-IntoIterator-for-HashTable%3CT,+A%3E"],[741,"impl-IntoIterator-for-%26HashTable%3CT,+A%3E"]]}],\ ["humantime",{"doc":"Human-friendly time parser and formatter","t":"FGPFPPPPPPFFGPNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNHHHHHHNNNNNNNNNNNNNNNNNNNNNHHHNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNOOOO","n":["Duration","DurationError","Empty","FormattedDuration","InvalidCharacter","InvalidDigit","InvalidFormat","NumberExpected","NumberOverflow","OutOfRange","Rfc3339Timestamp","Timestamp","TimestampError","UnknownUnit","as_ref","as_ref","borrow","borrow","borrow","borrow","borrow","borrow","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","clone","clone","clone","clone","clone","clone","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","deref","deref","eq","eq","eq","eq","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","format_duration","format_rfc3339","format_rfc3339_micros","format_rfc3339_millis","format_rfc3339_nanos","format_rfc3339_seconds","from","from","from","from","from","from","from","from","from_str","from_str","get_ref","get_ref","hash","into","into","into","into","into","into","into","into","parse_duration","parse_rfc3339","parse_rfc3339_weak","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_string","to_string","to_string","to_string","to_string","to_string","try_from","try_from","try_from","try_from","try_from","try_from","try_into","try_into","try_into","try_into","try_into","try_into","type_id","type_id","type_id","type_id","type_id","type_id","end","start","unit","value"],"q":[[0,"humantime"],[118,"humantime::DurationError"],[122,"core::time"],[123,"std::time"],[124,"core::fmt"],[125,"core::fmt"],[126,"core::hash"],[127,"alloc::string"],[128,"core::any"]],"d":["A wrapper for duration that has FromStr implementation","Error parsing human-friendly duration","The value was an empty string (or consists only whitespace)","A wrapper type that allows you to Display a Duration","Invalid character during parsing","Bad character where digit is expected","Other formatting errors","Non-numeric value where number is expected","The numeric value is too large","Numeric component is out of range","A wrapper type that allows you to Display a SystemTime","A wrapper for SystemTime that has FromStr implementation","Error parsing datetime (timestamp)","Unit in the number is not one of allowed units","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","Formats duration into a human-readable string","Format an RFC3339 timestamp 2018-02-14T00:28:07Z","Format an RFC3339 timestamp 2018-02-14T00:28:07.000000Z","Format an RFC3339 timestamp 2018-02-14T00:28:07.000Z","Format an RFC3339 timestamp 2018-02-14T00:28:07.000000000Z","Format an RFC3339 timestamp 2018-02-14T00:28:07Z","Returns the argument unchanged.","Returns the argument unchanged.","","Returns the argument unchanged.","","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","","","Returns a reference to the Duration that is being …","Returns a reference to the SystemTime that is being …","","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","","Calls U::from(self).","","Calls U::from(self).","Calls U::from(self).","Parse duration object 1hour 12min 5s","Parse RFC3339 timestamp 2018-02-14T00:28:07Z","Parse RFC3339-like timestamp 2018-02-14 00:28:07","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","End of the invalid unit inside the original string","Start of the invalid unit inside the original string","The unit verbatim","A number associated with the unit"],"i":[0,0,5,0,5,7,7,5,5,7,0,0,0,5,1,3,5,6,1,3,7,8,5,6,1,3,7,8,5,6,1,3,7,8,5,6,1,3,7,8,1,3,5,1,3,7,5,5,6,6,1,1,3,3,7,7,8,8,0,0,0,0,0,0,5,6,1,1,3,3,7,8,1,3,6,8,1,5,6,1,1,3,3,7,8,0,0,0,5,6,1,3,7,8,5,6,1,3,7,8,5,6,1,3,7,8,5,6,1,3,7,8,5,6,1,3,7,8,18,18,18,18],"f":"``````````````{bd}{fh}{ce{}{}}00000000000{jj}{ll}{bb}{ff}{nn}{A`A`}{{ce}Ab{}{}}0000098{{jj}Ad}{{bb}Ad}{{ff}Ad}{{nn}Ad}{{jAf}Ah}0{{lAf}Ah}0{{bAf}Ah}0{{fAf}Ah}0{{nAf}Ah}0{{A`Af}Ah}0{dl}{hA`}0000{cc{}}0{db}1{hf}222{Aj{{Al{bc}}}{}}{Aj{{Al{fc}}}{}}{ld}{A`h}{{bc}AbAn}{ce{}{}}00{bd}1{fh}22{Aj{{Al{dj}}}}{Aj{{Al{hn}}}}0444444{cB`{}}00000{c{{Al{e}}}{}{}}00000000000{cBb{}}00000````","c":[],"p":[[5,"Duration",0],[5,"Duration",122],[5,"Timestamp",0],[5,"SystemTime",123],[6,"DurationError",0],[5,"FormattedDuration",0],[6,"TimestampError",0],[5,"Rfc3339Timestamp",0],[1,"unit"],[1,"bool"],[5,"Formatter",124],[8,"Result",124],[1,"str"],[6,"Result",125],[10,"Hasher",126],[5,"String",127],[5,"TypeId",128],[15,"UnknownUnit",118]],"b":[[46,"impl-Display-for-Error"],[47,"impl-Debug-for-Error"],[48,"impl-Display-for-FormattedDuration"],[49,"impl-Debug-for-FormattedDuration"],[50,"impl-Display-for-Duration"],[51,"impl-Debug-for-Duration"],[52,"impl-Display-for-Timestamp"],[53,"impl-Debug-for-Timestamp"],[54,"impl-Debug-for-Error"],[55,"impl-Display-for-Error"],[56,"impl-Debug-for-Rfc3339Timestamp"],[57,"impl-Display-for-Rfc3339Timestamp"]]}],\ +["indexmap",{"doc":"IndexMap is a hash table where the iteration order of the …","t":"KEEFNNNNNMNNNNNNQQNCCNNNNNFGFFFFFFFRFKPFKFFPFRFFNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNMNNNNNNMNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNMNCMNNNNNNNNMNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNPKFFGFFPNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNMMNNNNNNNNNNNNNNNNNNNNNNNNFFFFFFKFFFFRNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNMNNNMNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNMNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNN","n":["Equivalent","IndexMap","IndexSet","TryReserveError","borrow","borrow_mut","clone","clone_into","eq","equivalent","equivalent","equivalent","equivalent","fmt","fmt","from","indexmap","indexset","into","map","set","to_owned","to_string","try_from","try_into","type_id","Drain","Entry","IndexMap","IndexedEntry","IntoIter","IntoKeys","IntoValues","Iter","IterMut","Key","Keys","MutableKeys","Occupied","OccupiedEntry","RawEntryApiV1","Slice","Splice","Vacant","VacantEntry","Value","Values","ValuesMut","and_modify","as_mut_slice","as_mut_slice","as_slice","as_slice","as_slice","as_slice","as_slice","binary_search_by","binary_search_by","binary_search_by_key","binary_search_by_key","binary_search_keys","binary_search_keys","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","capacity","clear","clone","clone","clone","clone","clone_from","clone_into","clone_into","clone_into","clone_into","cmp","collect","collect","collect","collect","collect","collect","collect","collect","collect","compare","contains_key","count","count","count","count","count","count","count","count","count","default","default","default","default","default","default","default","default","default","default","default","drain","drop","entry","eq","eq","equivalent","equivalent","equivalent","equivalent","equivalent","equivalent","extend","extend","first","first","first_mut","first_mut","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from_iter","get","get","get","get_full","get_full_mut","get_full_mut2","get_full_mut2","get_index","get_index","get_index_entry","get_index_mut","get_index_mut","get_index_mut2","get_index_mut2","get_index_of","get_key_value","get_mut","get_mut","get_mut","get_range","get_range","get_range_mut","get_range_mut","hash","hasher","index","index","index","index","index","index","index","index","index","index","index","index","index","index","index","index","index","index","index","index","index","index","index_mut","index_mut","index_mut","index_mut","index_mut","index_mut","index_mut","index_mut","index_mut","index_mut","index_mut","index_mut","index_mut","index_mut","index_mut","index_mut","index_mut","insert","insert","insert","insert","insert_full","insert_sorted","insert_sorted","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into_boxed_slice","into_iter","into_iter","into_iter","into_iter","into_iter","into_iter","into_iter","into_iter","into_iter","into_iter","into_iter","into_iter","into_iter","into_iter","into_iter","into_key","into_keys","into_keys","into_mut","into_mut","into_slice","into_values","into_values","is_empty","is_empty","iter","iter","iter_mut","iter_mut","key","key","key","key","keys","keys","last","last","last","last","last","last","last","last","last","last","last","last_mut","last_mut","len","len","len","len","len","len","len","len","len","len","len","len","move_index","move_index","move_index","new","new","new_mut","next","next","next","next","next","next","next","next","next","next","next_back","next_back","next_back","next_back","next_back","next_back","next_back","next_back","next_back","next_back","nth","nth","nth","nth","nth","nth","nth","nth","nth","nth_back","nth_back","nth_back","nth_back","nth_back","nth_back","nth_back","nth_back","nth_back","or_default","or_insert","or_insert_with","or_insert_with_key","partial_cmp","partition_point","partition_point","pop","raw_entry_mut_v1","raw_entry_mut_v1","raw_entry_v1","raw_entry_v1","raw_entry_v1","remove","remove","remove_entry","remove_entry","reserve","reserve_exact","retain","retain2","retain2","reverse","shift_insert","shift_insert","shift_remove","shift_remove","shift_remove","shift_remove_entry","shift_remove_entry","shift_remove_entry","shift_remove_full","shift_remove_index","shrink_to","shrink_to_fit","size_hint","size_hint","size_hint","size_hint","size_hint","size_hint","size_hint","size_hint","size_hint","size_hint","sort_by","sort_by_cached_key","sort_keys","sort_unstable_by","sort_unstable_keys","sorted_by","sorted_unstable_by","splice","split_at","split_at_mut","split_first","split_first_mut","split_last","split_last_mut","split_off","swap_indices","swap_indices","swap_indices","swap_remove","swap_remove","swap_remove","swap_remove_entry","swap_remove_entry","swap_remove_entry","swap_remove_full","swap_remove_index","to_owned","to_owned","to_owned","to_owned","truncate","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_reserve","try_reserve_exact","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","values","values","values_mut","values_mut","with_capacity","with_capacity_and_hasher","with_hasher","Occupied","RawEntryApiV1","RawEntryBuilder","RawEntryBuilderMut","RawEntryMut","RawOccupiedEntryMut","RawVacantEntryMut","Vacant","and_modify","borrow","borrow","borrow","borrow","borrow","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","fmt","fmt","fmt","fmt","fmt","from","from","from","from","from","from_hash","from_hash","from_hash_full","from_key","from_key","from_key_hashed_nocheck","from_key_hashed_nocheck","get","get_key_value","get_key_value_mut","get_mut","index","index","index","index_from_hash","insert","insert","insert_hashed_nocheck","insert_key","into","into","into","into","into","into_key","into_key_value_mut","into_mut","key","key_mut","move_index","or_insert","or_insert_with","raw_entry_mut_v1","raw_entry_v1","remove","remove_entry","shift_insert","shift_insert_hashed_nocheck","shift_remove","shift_remove_entry","swap_indices","swap_remove","swap_remove_entry","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","Difference","Drain","IndexSet","Intersection","IntoIter","Iter","MutableValues","Slice","Splice","SymmetricDifference","Union","Value","as_slice","as_slice","as_slice","as_slice","binary_search","binary_search","binary_search_by","binary_search_by","binary_search_by_key","binary_search_by_key","bitand","bitor","bitxor","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","capacity","clear","clone","clone","clone","clone","clone","clone","clone_from","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","cmp","collect","collect","collect","compare","contains","count","count","count","default","default","default","default","difference","drain","eq","eq","equivalent","equivalent","equivalent","equivalent","equivalent","equivalent","extend","extend","first","first","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fold","fold","from","from","from","from","from","from","from","from","from","from","from_iter","get","get_full","get_full_mut2","get_full_mut2","get_index","get_index","get_index_mut2","get_index_mut2","get_index_of","get_range","get_range","hash","hasher","index","index","index","index","index","index","index","index","index","index","index","index","index","index","index","index","insert","insert_full","insert_sorted","intersection","into","into","into","into","into","into","into","into","into","into_boxed_slice","into_iter","into_iter","into_iter","into_iter","into_iter","into_iter","into_iter","into_iter","into_iter","into_iter","into_iter","is_disjoint","is_empty","is_empty","is_subset","is_superset","iter","iter","last","last","last","last","last","len","len","len","len","len","len","move_index","new","new","next","next","next","next","next","next","next","next","next_back","next_back","next_back","next_back","next_back","next_back","next_back","next_back","nth","nth","nth","nth_back","nth_back","nth_back","partial_cmp","partition_point","partition_point","pop","remove","replace","replace_full","reserve","reserve_exact","retain","retain2","retain2","reverse","rfold","rfold","shift_insert","shift_remove","shift_remove_full","shift_remove_index","shift_take","shrink_to","shrink_to_fit","size_hint","size_hint","size_hint","size_hint","size_hint","size_hint","size_hint","size_hint","sort","sort_by","sort_by_cached_key","sort_unstable","sort_unstable_by","sorted_by","sorted_unstable_by","splice","split_at","split_first","split_last","split_off","sub","swap_indices","swap_remove","swap_remove_full","swap_remove_index","swap_take","symmetric_difference","take","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","truncate","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_reserve","try_reserve_exact","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","union","with_capacity","with_capacity_and_hasher","with_hasher"],"q":[[0,"indexmap"],[26,"indexmap::map"],[509,"indexmap::map::raw_entry_v1"],[596,"indexmap::set"],[894,"core::marker"],[895,"core::fmt"],[896,"core::fmt"],[897,"core::result"],[898,"core::any"],[899,"core::ops::function"],[900,"core::cmp"],[901,"core::ops::function"],[902,"core::iter::traits::collect"],[903,"core::hash"],[904,"core::hash"],[905,"core::ops::range"],[906,"core::cmp"],[907,"core::cmp"],[908,"core::fmt"],[909,"core::hash"],[910,"core::cmp"]],"d":["Key equivalence trait.","","","The error type for try_reserve methods.","","","","","","Compare self to key and return true if they are equal.","","","","","","Returns the argument unchanged.","Create an IndexMap from a list of key-value pairs","Create an IndexSet from a list of values","Calls U::from(self).","IndexMap is a hash table where the iteration order of the …","A hash set implemented using IndexMap","","","","","","A draining iterator over the entries of an IndexMap.","Entry for an existing key-value pair in an IndexMap or a …","A hash table where the iteration order of the key-value …","A view into an occupied entry in an IndexMap obtained by …","An owning iterator over the entries of an IndexMap.","An owning iterator over the keys of an IndexMap.","An owning iterator over the values of an IndexMap.","An iterator over the entries of an IndexMap.","A mutable iterator over the entries of an IndexMap.","","An iterator over the keys of an IndexMap.","Opt-in mutable access to IndexMap keys.","Existing slot with equivalent key.","A view into an occupied entry in an IndexMap. It is part …","Opt-in access to the experimental raw entry API.","A dynamically-sized slice of key-value pairs in an IndexMap…","A splicing iterator for IndexMap.","Vacant slot (no equivalent key in the map).","A view into a vacant entry in an IndexMap. It is part of …","","An iterator over the values of an IndexMap.","A mutable iterator over the values of an IndexMap.","Modifies the entry if it is occupied.","Returns a mutable slice of the remaining entries in the …","Returns a mutable slice of all the key-value pairs in the …","Returns a slice of the remaining entries in the iterator.","Returns a slice of the remaining entries in the iterator.","Returns a slice of the remaining entries in the iterator.","Returns a slice of the remaining entries in the iterator.","Returns a slice of all the key-value pairs in the map.","Search over a sorted map with a comparator function.","Search over a sorted map with a comparator function.","Search over a sorted map with an extraction function.","Search over a sorted map with an extraction function.","Search over a sorted map for a key.","Search over a sorted map for a key.","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","Return the number of elements the map can hold without …","Remove all key-value pairs in the map, while preserving …","","","","","","","","","","","","","","","","","","","","","Return true if an equivalent to key exists in the map.","","","","","","","","","","","","","","","","","","","","Return an empty IndexMap","Clears the IndexMap in the given index range, returning …","","Get the given key’s corresponding entry in the map for …","","","","","","","","","Extend the map with all key-value pairs in the iterable.","Extend the map with all key-value pairs in the iterable.","Get the first key-value pair.","Get the first key-value pair","Get the first key-value pair, with mutable access to the …","Get the first key-value pair, with mutable access to the …","","","","","","","","","","","","","","","","","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Examples","Create an IndexMap from the sequence of key-value pairs in …","Gets a reference to the entry’s value in the map.","Gets a reference to the entry’s value in the map.","Return a reference to the value stored for key, if it is …","Return item index, key and value","","Return item index, mutable reference to key and value","","Get a key-value pair by index.","Get a key-value pair by index","Get an entry in the map by index for in-place manipulation.","Get a key-value pair by index, with mutable access to the …","Get a key-value pair by index","Return mutable reference to key and value at an index.","","Return item index, if it exists in the map","Return references to the key-value pair stored for key, if …","Gets a mutable reference to the entry’s value in the map.","Gets a mutable reference to the entry’s value in the map.","","Returns a slice of key-value pairs in the given range of …","Returns a slice of key-value pairs in the given range of …","Returns a mutable slice of key-value pairs in the given …","Returns a mutable slice of key-value pairs in the given …","","Return a reference to the map’s BuildHasher.","Return the index where the key-value pair exists or will …","Return the index of the key-value pair","Return the index where a key-value pair may be inserted.","Return the index of the key-value pair","Returns a reference to the key at the supplied index.","","","","","","","","","","","","","","","Returns a reference to the value at the supplied index.","","Returns a reference to the value corresponding to the …","","","","","","","","","","","","","Returns a mutable reference to the value corresponding to …","","","","Returns a mutable reference to the value at the supplied …","Sets the value of the entry to value, and returns the entry…","Inserts the entry’s key and the given value into the …","Sets the value of the entry to value, and returns the entry…","Insert a key-value pair in the map.","Insert a key-value pair in the map, and get their index.","Inserts the entry’s key and the given value into the map …","Insert a key-value pair in the map at its ordered position …","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Converts into a boxed slice of all the key-value pairs in …","","","","","","","","","","","","","","","","Takes ownership of the key, leaving the entry vacant.","Return an owning iterator over the keys of the map slice.","Return an owning iterator over the keys of the map, in …","Converts into a mutable reference to the entry’s value …","Converts into a mutable reference to the entry’s value …","Returns a mutable slice of the remaining entries in the …","Return an owning iterator over the values of the map slice.","Return an owning iterator over the values of the map, in …","Returns true if the map slice contains no elements.","Returns true if the map contains no elements.","Return an iterator over the key-value pairs of the map …","Return an iterator over the key-value pairs of the map, in …","Return an iterator over the key-value pairs of the map …","Return an iterator over the key-value pairs of the map, in …","Gets a reference to the entry’s key, either within the …","Gets a reference to the entry’s key in the map.","Gets a reference to the key that was used to find the …","Gets a reference to the entry’s key in the map.","Return an iterator over the keys of the map slice.","Return an iterator over the keys of the map, in their order","","","","","","","","","","Get the last key-value pair.","Get the last key-value pair","Get the last key-value pair, with mutable access to the …","Get the last key-value pair, with mutable access to the …","","","","","","","","","","","Return the number of key-value pairs in the map slice.","Return the number of key-value pairs in the map.","Moves the position of the entry to a new index by shifting …","Moves the position of the entry to a new index by shifting …","Moves the position of a key-value pair from one index to …","Returns an empty slice.","Create a new map. (Does not allocate.)","Returns an empty mutable slice.","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","Inserts a default-constructed value in the entry if it is …","Inserts the given default value in the entry if it is …","Inserts the result of the call function in the entry if it …","Inserts the result of the call function with a reference …","","Returns the index of the partition point of a sorted map …","Returns the index of the partition point of a sorted map …","Remove the last key-value pair","Creates a raw entry builder for the IndexMap.","","Opt-in access to the experimental raw entry API.","Creates a raw immutable entry builder for the IndexMap.","","Remove the key, value pair stored in the map for this …","Remove the key-value pair equivalent to key and return its …","Remove and return the key, value pair stored in the map …","Remove and return the key-value pair equivalent to key.","Reserve capacity for additional more key-value pairs.","Reserve capacity for additional more key-value pairs, …","Scan through each key-value pair in the map and keep those …","Scan through each key-value pair in the map and keep those …","","Reverses the order of the map’s key-value pairs in place.","Inserts the entry’s key and the given value into the map …","Insert a key-value pair in the map at the given index.","Remove the key, value pair stored in the map for this …","Remove the key, value pair stored in the map for this …","Remove the key-value pair equivalent to key and return its …","Remove and return the key, value pair stored in the map …","Remove and return the key, value pair stored in the map …","Remove and return the key-value pair equivalent to key.","Remove the key-value pair equivalent to key and return it …","Remove the key-value pair by index","Shrink the capacity of the map with a lower limit.","Shrink the capacity of the map as much as possible.","","","","","","","","","","","Sort the map’s key-value pairs in place using the …","Sort the map’s key-value pairs in place using a sort-key …","Sort the map’s key-value pairs by the default ordering …","Sort the map’s key-value pairs in place using the …","Sort the map’s key-value pairs by the default ordering …","Sort the key-value pairs of the map and return a by-value …","Sort the key-value pairs of the map and return a by-value …","Creates a splicing iterator that replaces the specified …","Divides one slice into two at an index.","Divides one mutable slice into two at an index.","Returns the first key-value pair and the rest of the slice,","Returns the first key-value pair and the rest of the slice,","Returns the last key-value pair and the rest of the slice, …","Returns the last key-value pair and the rest of the slice, …","Splits the collection into two at the given index.","Swaps the position of entry with another.","Swaps the position of entry with another.","Swaps the position of two key-value pairs in the map.","Remove the key, value pair stored in the map for this …","Remove the key, value pair stored in the map for this …","Remove the key-value pair equivalent to key and return its …","Remove and return the key, value pair stored in the map …","Remove and return the key, value pair stored in the map …","Remove and return the key-value pair equivalent to key.","Remove the key-value pair equivalent to key and return it …","Remove the key-value pair by index","","","","","Shortens the map, keeping the first len elements and …","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","Try to reserve capacity for additional more key-value …","Try to reserve capacity for additional more key-value …","","","","","","","","","","","","","","","","","Return an iterator over the values of the map slice.","Return an iterator over the values of the map, in their …","Return an iterator over mutable references to the the …","Return an iterator over mutable references to the values …","Create a new map with capacity for n key-value pairs. …","Create a new map with capacity for n key-value pairs. …","Create a new map with hash_builder.","Existing slot with equivalent key.","Opt-in access to the experimental raw entry API.","A builder for computing where in an IndexMap a key-value …","A builder for computing where in an IndexMap a key-value …","Raw entry for an existing key-value pair or a vacant …","A raw view into an occupied entry in an IndexMap. It is …","A view into a vacant raw entry in an IndexMap. It is part …","Vacant slot (no equivalent key in the map).","Modifies the entry if it is occupied.","","","","","","","","","","","","","","","","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Access an entry by hash.","Access an entry by hash.","Access an entry by hash, including its index.","Access an entry by key.","Access an entry by key.","Access an entry by a key and its hash.","Access an entry by a key and its hash.","Gets a reference to the entry’s value in the map.","Gets a reference to the entry’s key and value in the map.","Gets a reference to the entry’s key and value in the map.","Gets a mutable reference to the entry’s value in the map.","Return the index where the key-value pair exists or may be …","Return the index of the key-value pair","Return the index where a key-value pair may be inserted.","Access the index of an entry by hash.","Sets the value of the entry, and returns the entry’s old …","Inserts the given key and value into the map, and returns …","Inserts the given key and value into the map with the …","Sets the key of the entry, and returns the entry’s old …","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Converts into a mutable reference to the entry’s key in …","Converts into a mutable reference to the entry’s key and …","Converts into a mutable reference to the entry’s value …","Gets a reference to the entry’s key in the map.","Gets a mutable reference to the entry’s key in the map.","Moves the position of the entry to a new index by shifting …","Inserts the given default key and value in the entry if it …","Inserts the result of the call function in the entry if it …","Creates a raw entry builder for the IndexMap.","Creates a raw immutable entry builder for the IndexMap.","Remove the key, value pair stored in the map for this …","Remove and return the key, value pair stored in the map …","Inserts the given key and value into the map at the given …","Inserts the given key and value into the map with the …","Remove the key, value pair stored in the map for this …","Remove and return the key, value pair stored in the map …","Swaps the position of entry with another.","Remove the key, value pair stored in the map for this …","Remove and return the key, value pair stored in the map …","","","","","","","","","","","","","","","","A lazy iterator producing elements in the difference of …","A draining iterator over the items of an IndexSet.","A hash set where the iteration order of the values is …","A lazy iterator producing elements in the intersection of …","An owning iterator over the items of an IndexSet.","An iterator over the items of an IndexSet.","Opt-in mutable access to IndexSet values.","A dynamically-sized slice of values in an IndexSet.","A splicing iterator for IndexSet.","A lazy iterator producing elements in the symmetric …","A lazy iterator producing elements in the union of IndexSet…","","Returns a slice of the remaining entries in the iterator.","Returns a slice of the remaining entries in the iterator.","Returns a slice of the remaining entries in the iterator.","Returns a slice of all the values in the set.","Search over a sorted set for a value.","Search over a sorted set for a value.","Search over a sorted set with a comparator function.","Search over a sorted set with a comparator function.","Search over a sorted set with an extraction function.","Search over a sorted set with an extraction function.","Returns the set intersection, cloned into a new set.","Returns the set union, cloned into a new set.","Returns the set symmetric-difference, cloned into a new …","","","","","","","","","","","","","","","","","","","","","Return the number of elements the set can hold without …","Remove all elements in the set, while preserving its …","","","","","","","","","","","","","","","","","","","Return true if an equivalent to value exists in the set.","","","","","","","Return an empty IndexSet","Return an iterator over the values that are in self but …","Clears the IndexSet in the given index range, returning …","","","","","","","","","","","Get the first value.","Get the first value","","","","","","","","","","","","","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Examples","","Return a reference to the value stored in the set, if it …","Return item index and value","Return item index and mutable reference to the value","","Get a value by index.","Get a value by index","Return mutable reference to the value at an index.","","Return item index, if it exists in the set","Returns a slice of values in the given range of indices.","Returns a slice of values in the given range of indices.","","Return a reference to the set’s BuildHasher.","","","","","","","","","","","","Returns a reference to the value at the supplied index.","","","","","Insert the value into the set.","Insert the value into the set, and get its index.","Insert the value into the set at its ordered position …","Return an iterator over the values that are in both self …","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Converts into a boxed slice of all the values in the set.","","","","","","","","","","","","Returns true if self has no elements in common with other.","Returns true if the set slice contains no elements.","Returns true if the set contains no elements.","Returns true if all elements of self are contained in other…","Returns true if all elements of other are contained in self…","Return an iterator over the values of the set slice.","Return an iterator over the values of the set, in their …","","","","Get the last value.","Get the last value","","","","","Return the number of elements in the set slice.","Return the number of elements in the set.","Moves the position of a value from one index to another by …","Returns an empty slice.","Create a new set. (Does not allocate.)","","","","","","","","","","","","","","","","","","","","","","","","Returns the index of the partition point of a sorted set …","Returns the index of the partition point of a sorted set …","Remove the last value","Remove the value from the set, and return true if it was …","Adds a value to the set, replacing the existing value, if …","Adds a value to the set, replacing the existing value, if …","Reserve capacity for additional more values.","Reserve capacity for additional more values, without …","Scan through each value in the set and keep those where the","Scan through each value in the set and keep those where the","","Reverses the order of the set’s values in place.","","","Insert the value into the set at the given index.","Remove the value from the set, and return true if it was …","Remove the value from the set return it and the index it …","Remove the value by index","Removes and returns the value in the set, if any, that is …","Shrink the capacity of the set with a lower limit.","Shrink the capacity of the set as much as possible.","","","","","","","","","Sort the set’s values by their default ordering.","Sort the set’s values in place using the comparison …","Sort the set’s values in place using a key extraction …","Sort the set’s values by their default ordering.","Sort the set’s values in place using the comparison …","Sort the values of the set and return a by-value iterator …","Sort the values of the set and return a by-value iterator …","Creates a splicing iterator that replaces the specified …","Divides one slice into two at an index.","Returns the first value and the rest of the slice, or None …","Returns the last value and the rest of the slice, or None …","Splits the collection into two at the given index.","Returns the set difference, cloned into a new set.","Swaps the position of two values in the set.","Remove the value from the set, and return true if it was …","Remove the value from the set return it and the index it …","Remove the value by index","Removes and returns the value in the set, if any, that is …","Return an iterator over the values that are in self or …","Removes and returns the value in the set, if any, that is …","","","","","","","Shortens the set, keeping the first len elements and …","","","","","","","","","","","","","","","","","","","Try to reserve capacity for additional more values.","Try to reserve capacity for additional more values, …","","","","","","","","","","","Return an iterator over all values that are in self or …","Create a new set with capacity for n elements. (Does not …","Create a new set with capacity for n elements. (Does not …","Create a new set with hash_builder."],"i":[0,0,0,0,1,1,1,1,1,4,1,1,1,1,1,1,0,0,1,0,0,1,1,1,1,1,0,0,0,0,0,0,0,0,0,52,0,0,11,0,0,0,0,11,0,52,0,0,11,13,15,16,17,13,18,15,14,15,14,15,14,15,11,45,46,47,16,17,13,18,24,28,25,29,30,35,14,15,11,45,46,47,16,17,13,18,24,28,25,29,30,35,14,15,15,15,16,24,25,15,15,16,24,25,15,14,16,17,13,18,24,28,25,29,30,14,15,16,17,13,18,24,28,25,29,30,16,17,13,24,28,25,29,30,14,14,15,15,35,15,14,15,14,14,14,15,15,15,15,15,14,15,14,15,11,45,46,47,16,17,13,18,24,28,25,29,30,35,14,15,11,45,46,47,16,17,13,18,24,28,25,29,30,35,15,15,15,45,47,15,15,15,52,15,14,15,15,14,15,52,15,15,15,45,47,15,14,15,14,15,14,15,11,45,46,47,24,14,14,14,14,14,14,14,14,15,15,15,15,15,15,15,15,15,14,14,14,14,14,14,14,14,15,15,15,15,15,15,15,15,15,45,46,47,15,15,46,15,11,45,46,47,16,17,13,18,24,28,25,29,30,35,15,15,16,17,13,18,24,28,25,29,30,35,14,14,15,15,15,46,14,15,45,47,17,14,15,14,15,14,15,14,15,11,45,46,47,14,15,16,17,13,18,24,28,25,29,30,14,15,14,15,16,17,13,18,24,28,25,29,30,35,14,15,45,47,15,14,15,14,16,17,13,18,24,28,25,29,30,35,16,17,13,18,24,28,25,29,30,35,16,17,13,18,24,28,25,29,30,16,17,13,18,24,28,25,29,30,11,11,11,11,14,14,15,15,63,15,0,63,15,45,15,45,15,15,15,15,52,15,15,46,15,45,47,15,45,47,15,15,15,15,15,16,17,13,18,24,28,25,29,30,35,15,15,15,15,15,15,15,15,14,14,14,14,14,14,15,45,47,15,45,47,15,45,47,15,15,15,16,24,25,15,15,11,45,46,47,16,17,13,18,24,28,25,29,30,35,15,11,45,46,47,16,17,13,18,24,28,25,29,30,35,15,15,15,11,45,46,47,16,17,13,18,24,28,25,29,30,35,14,15,14,15,14,15,15,15,15,66,0,0,0,0,0,0,66,66,65,64,66,67,68,65,64,66,67,68,65,64,66,67,68,65,64,66,67,68,65,64,65,65,64,65,64,67,67,67,67,66,67,68,65,67,68,68,67,65,64,66,67,68,67,67,67,67,67,67,66,66,63,63,67,67,68,68,67,67,67,67,67,65,64,66,67,68,65,64,66,67,68,65,64,66,67,68,0,0,0,0,0,0,0,0,0,0,0,80,70,72,73,74,71,74,71,74,71,74,74,74,74,70,72,73,75,76,77,78,79,71,74,70,72,73,75,76,77,78,79,71,74,74,74,70,75,76,77,78,74,74,70,75,76,77,78,74,71,70,72,73,71,74,70,72,73,70,72,71,74,74,74,71,74,71,71,71,74,74,74,74,74,71,74,70,72,73,75,76,77,78,79,71,74,77,78,70,72,73,75,76,77,78,79,74,74,74,74,74,80,74,71,74,80,74,74,71,74,71,74,71,71,71,71,71,71,71,71,74,74,74,74,74,74,74,74,74,74,74,74,70,72,73,75,76,77,78,79,74,74,70,72,73,75,76,77,78,79,71,74,74,74,71,74,74,74,71,74,70,72,73,71,74,70,72,73,79,71,74,74,71,74,70,72,73,75,76,77,78,79,70,72,73,75,76,77,78,79,70,72,73,70,72,73,71,71,74,74,74,74,74,74,74,74,80,74,74,77,78,74,74,74,74,74,74,74,70,72,73,75,76,77,78,79,74,74,74,74,74,74,74,74,71,71,71,74,74,74,74,74,74,74,74,74,70,75,76,77,78,74,74,70,72,73,75,76,77,78,79,74,70,72,73,75,76,77,78,79,74,74,74,70,72,73,75,76,77,78,79,71,74,74,74,74,74],"f":"````{ce{}{}}0{bb}{{ce}d{}{}}{{bb}f}{{hc}fj}{{ce}f{}{}}00{{bl}n}0{cc{}}``7``7{cA`{}}{c{{Ab{e}}}{}{}}0{cAd{}}``````````````````````{{{Af{ce}}g}{{Af{ce}}}{}{}{{Ah{e}}}}{{{Aj{ce}}}{{Al{ce}}}{}{}}{{{An{ceg}}}{{Al{ce}}}{}{}{}}{{{B`{ce}}}{{Al{ce}}}{}{}}{{{Bb{ce}}}{{Al{ce}}}{}{}}3{{{Bd{ce}}}{{Al{ce}}}{}{}}3{{{Al{ce}}g}{{Ab{BfBf}}}{}{}{{Bl{ce}{{Bh{Bj}}}}}}{{{An{ceg}}i}{{Ab{BfBf}}}{}{}{}{{Bl{ce}{{Bh{Bj}}}}}}{{{Al{ce}}gi}{{Ab{BfBf}}}{}{}Bn{{Bl{ce}{{Bh{g}}}}}}{{{An{ceg}}ik}{{Ab{BfBf}}}{}{}{}Bn{{Bl{ce}{{Bh{i}}}}}}{{{Al{ce}}c}{{Ab{BfBf}}}Bn{}}{{{An{ceg}}c}{{Ab{BfBf}}}Bn{}{}}{ce{}{}}0000000000000000000000000000000{{{An{ceg}}}Bf{}{}{}}{{{An{ceg}}}d{}{}{}}{{{B`{ce}}}{{B`{ce}}}{}{}}{{{C`{ce}}}{{C`{ce}}}{}{}}{{{Cb{ce}}}{{Cb{ce}}}{}{}}{{{An{ceg}}}{{An{ceg}}}CdCdCd}{{{An{ceg}}{An{ceg}}}dCdCdCd}{{ce}d{}{}}000{{{Al{ce}}{Al{ce}}}BjBnBn}{{{B`{ce}}}i{}{}{}{{Cf{g}}}}{{{Bb{ce}}}i{}{}{}{{Cf{g}}}}{{{Aj{ce}}}i{}{}{}{{Cf{g}}}}{{{Bd{ce}}}i{}{}{}{{Cf{g}}}}{{{C`{ce}}}i{}{}{}{{Cf{g}}}}{{{Ch{ce}}}i{}{}{}{{Cf{g}}}}{{{Cb{ce}}}i{}{}{}{{Cf{g}}}}{{{Cj{ce}}}i{}{}{}{{Cf{g}}}}{{{Cl{ce}}}i{}{}{}{{Cf{g}}}}{{ce}Bj{}{}}{{{An{ceg}}i}f{}{}Cn{jD`{h{c}}}}{{{B`{ce}}}Bf{}{}}{{{Bb{ce}}}Bf{}{}}{{{Aj{ce}}}Bf{}{}}{{{Bd{ce}}}Bf{}{}}{{{C`{ce}}}Bf{}{}}{{{Ch{ce}}}Bf{}{}}{{{Cb{ce}}}Bf{}{}}{{{Cj{ce}}}Bf{}{}}{{{Cl{ce}}}Bf{}{}}{{}{{B`{ce}}}{}{}}{{}{{Bb{ce}}}{}{}}{{}{{Aj{ce}}}{}{}}{{}{{C`{ce}}}{}{}}{{}{{Ch{ce}}}{}{}}{{}{{Cb{ce}}}{}{}}{{}{{Cj{ce}}}{}{}}{{}{{Cl{ce}}}{}{}}{{}{{Al{ce}}}{}{}}0{{}{{An{ceg}}}{}{}Db}{{{An{ceg}}i}{{Bd{ce}}}{}{}{}{{Dd{Bf}}}}{{{Df{gcei}}}d{D`Dh}{}{{Dn{}{{Dj{{Dl{ce}}}}}}}Cn}{{{An{ceg}}c}{{Af{ce}}}{D`Dh}{}Cn}{{{Al{ce}}{Al{ce}}}fE`E`}{{{An{cgi}}{An{cek}}}f{D`Dh}{}{{E`{e}}}CnCn}{{ce}f{}{}}00000{{{An{ceg}}i}d{D`DhEb}EbCn{{Ed{}{{Dj{{Dl{ce}}}}}}}}{{{An{ceg}}i}d{D`Dh}{}Cn{{Ed{}{{Dj{{Dl{ce}}}}}}}}{{{Al{ce}}}{{Ef{{Dl{ce}}}}}{}{}}{{{An{ceg}}}{{Ef{{Dl{ce}}}}}{}{}{}}10{{{Af{ce}}l}nEhEh}{{{Ej{ce}}l}nEhEh}{{{El{ce}}l}nEh{}}{{{En{ce}}l}nEhEh}{{{B`{ce}}l}nEhEh}{{{Bb{ce}}l}nEhEh}{{{Aj{ce}}l}nEhEh}{{{Bd{ce}}l}nEhEh}{{{C`{ce}}l}nEh{}}{{{Ch{ce}}l}nEh{}}{{{Cb{ce}}l}n{}Eh}{{{Cj{ce}}l}n{}Eh}{{{Cl{ce}}l}n{}Eh}{{{Df{gcei}}l}n{EhD`Dh}Eh{Eh{Dn{}{{Dj{{Dl{ce}}}}}}}Cn}{{{Al{ce}}l}nEhEh}{{{An{ceg}}l}nEhEh{}}{cc{}}00000000000000{{{F`{{Dl{ce}}}}}{{An{ceFb}}}{D`Dh}{}}{g{{An{cei}}}{D`Dh}{}{{Ed{}{{Dj{{Dl{ce}}}}}}}{CnDb}}{{{Ej{ce}}}e{}{}}{{{En{ce}}}e{}{}}{{{An{ceg}}i}{{Ef{e}}}{}{}Cn{jD`{h{c}}}}{{{An{ceg}}i}{{Ef{{Dl{Bfce}}}}}{}{}Cn{jD`{h{c}}}}0{{{Fh{}{{Fd{c}}{Ff{e}}}}g}{{Ef{{Dl{Bfce}}}}}{}{}{jD`{h{c}}}}1{{{Al{ce}}Bf}{{Ef{{Dl{ce}}}}}{}{}}{{{An{ceg}}Bf}{{Ef{{Dl{ce}}}}}{}{}{}}{{{An{ceg}}Bf}{{Ef{{En{ce}}}}}{}{}{}}21{{{Fh{}{{Fd{c}}{Ff{e}}}}Bf}{{Ef{{Dl{ce}}}}}{}{}}{{{An{ceg}}Bf}{{Ef{{Dl{ce}}}}}{}{}Cn}{{{An{ceg}}i}{{Ef{Bf}}}{}{}Cn{jD`{h{c}}}}{{{An{ceg}}i}{{Ef{{Dl{ce}}}}}{}{}Cn{jD`{h{c}}}};:9{{{Al{ce}}g}{{Ef{{Al{ce}}}}}{}{}{{Dd{Bf}}}}{{{An{ceg}}i}{{Ef{{Al{ce}}}}}{}{}{}{{Dd{Bf}}}}10{{{Al{ce}}g}dD`D`Fj}{{{An{ceg}}}g{}{}{}}{{{Af{ce}}}Bf{}{}}{{{Ej{ce}}}Bf{}{}}{{{El{ce}}}Bf{}{}}{{{En{ce}}}Bf{}{}}{{{C`{ce}}Bf}c{}{}}{{{Al{ce}}Bf}e{}{}}{{{Al{ce}}{Fl{Bf}}}{{Al{ce}}}{}{}}{{{Al{ce}}Fn}{{Al{ce}}}{}{}}{{{Al{ce}}{G`{Bf}}}{{Al{ce}}}{}{}}{{{Al{ce}}{Gb{Bf}}}{{Al{ce}}}{}{}}{{{Al{ce}}{Gd{Bf}}}{{Al{ce}}}{}{}}{{{Al{ce}}{Gf{Bf}}}{{Al{ce}}}{}{}}{{{Al{ce}}{Dl{{Gh{Bf}}{Gh{Bf}}}}}{{Al{ce}}}{}{}}{{{An{ceg}}Fn}i{}{}{}{}}{{{An{ceg}}{Dl{{Gh{Bf}}{Gh{Bf}}}}}i{}{}{}{}}{{{An{ceg}}{Gb{Bf}}}i{}{}{}{}}{{{An{ceg}}{Gf{Bf}}}i{}{}{}{}}{{{An{ceg}}{Fl{Bf}}}i{}{}{}{}}{{{An{ceg}}{Gd{Bf}}}i{}{}{}{}}{{{An{ceg}}Bf}e{}{}{}}{{{An{ceg}}{G`{Bf}}}i{}{}{}{}}{{{An{ceg}}i}e{}{}Cn{D`{h{c}}j}};{{{Al{ce}}Bf}e{}{}}=;:{{{Al{ce}}{Fl{Bf}}}{{Al{ce}}}{}{}}{{{Al{ce}}Fn}{{Al{ce}}}{}{}}{{{Al{ce}}{G`{Bf}}}{{Al{ce}}}{}{}}57984<:;6{{{Ej{ce}}e}e{}{}}{{{El{ce}}e}e{}{}}{{{En{ce}}e}e{}{}}{{{An{ceg}}ce}{{Ef{e}}}{D`Dh}{}Cn}{{{An{ceg}}ce}{{Dl{Bf{Ef{e}}}}}{D`Dh}{}Cn}{{{El{ce}}e}{{Dl{Bfe}}}Bn{}}{{{An{ceg}}ce}{{Dl{Bf{Ef{e}}}}}{BnD`Dh}{}Cn}{ce{}{}}00000000000000{{{An{ceg}}}{{Gj{{Al{ce}}}}}{}{}{}}1111111111{{{Al{ce}}}g{}{}{}}0{{{An{ceg}}}i{}{}{}{}}00{{{El{ce}}}c{}{}}{{{Gj{{Al{ce}}}}}{{Ch{ce}}}{}{}}{{{An{ceg}}}{{Ch{ce}}}{}{}{}}{{{Ej{ce}}}e{}{}}{{{En{ce}}}e{}{}}{{{Bb{ce}}}{{Al{ce}}}{}{}}{{{Gj{{Al{ce}}}}}{{Cl{ce}}}{}{}}{{{An{ceg}}}{{Cl{ce}}}{}{}{}}{{{Al{ce}}}f{}{}}{{{An{ceg}}}f{}{}{}}{{{Al{ce}}}{{B`{ce}}}{}{}}{{{An{ceg}}}{{B`{ce}}}{}{}{}}{{{Al{ce}}}{{Bb{ce}}}{}{}}{{{An{ceg}}}{{Bb{ce}}}{}{}{}}{{{Af{ce}}}c{}{}}{{{Ej{ce}}}c{}{}}?{{{En{ce}}}c{}{}}{{{Al{ce}}}{{C`{ce}}}{}{}}{{{An{ceg}}}{{C`{ce}}}{}{}{}}{{{B`{ce}}}{{Ef{g}}}{}{}{}}{{{Bb{ce}}}{{Ef{g}}}{}{}{}}{{{Aj{ce}}}{{Ef{g}}}{}{}{}}{{{Bd{ce}}}{{Ef{g}}}{}{}{}}{{{C`{ce}}}{{Ef{g}}}{}{}{}}{{{Ch{ce}}}{{Ef{g}}}{}{}{}}{{{Cb{ce}}}{{Ef{g}}}{}{}{}}{{{Cj{ce}}}{{Ef{g}}}{}{}{}}{{{Cl{ce}}}{{Ef{g}}}{}{}{}}{{{Al{ce}}}{{Ef{{Dl{ce}}}}}{}{}}{{{An{ceg}}}{{Ef{{Dl{ce}}}}}{}{}{}}10{{{B`{ce}}}Bf{}{}}{{{Bb{ce}}}Bf{}{}}{{{Aj{ce}}}Bf{}{}}{{{Bd{ce}}}Bf{}{}}{{{C`{ce}}}Bf{}{}}{{{Ch{ce}}}Bf{}{}}{{{Cb{ce}}}Bf{}{}}{{{Cj{ce}}}Bf{}{}}{{{Cl{ce}}}Bf{}{}}{{{Df{gcei}}}Bf{D`Dh}{}{{Dn{}{{Dj{{Dl{ce}}}}}}}Cn}{{{Al{ce}}}Bf{}{}}{{{An{ceg}}}Bf{}{}{}}{{{Ej{ce}}Bf}d{}{}}{{{En{ce}}Bf}d{}{}}{{{An{ceg}}BfBf}d{}{}{}}{{}{{Al{ce}}}{}{}}{{}{{An{ce}}}{}{}}1{{{B`{ce}}}{{Ef{g}}}{}{}{}}{{{Bb{ce}}}{{Ef{g}}}{}{}{}}{{{Aj{ce}}}{{Ef{g}}}{}{}{}}{{{Bd{ce}}}{{Ef{g}}}{}{}{}}{{{C`{ce}}}{{Ef{g}}}{}{}{}}{{{Ch{ce}}}{{Ef{g}}}{}{}{}}{{{Cb{ce}}}{{Ef{g}}}{}{}{}}{{{Cj{ce}}}{{Ef{g}}}{}{}{}}{{{Cl{ce}}}{{Ef{g}}}{}{}{}}{{{Df{gcei}}}{{Ef{k}}}{D`Dh}{}{{Dn{}{{Dj{{Dl{ce}}}}}}}Cn{}}9876543210{{{B`{ce}}Bf}{{Ef{g}}}{}{}{}}{{{Bb{ce}}Bf}{{Ef{g}}}{}{}{}}{{{Aj{ce}}Bf}{{Ef{g}}}{}{}{}}{{{Bd{ce}}Bf}{{Ef{g}}}{}{}{}}{{{C`{ce}}Bf}{{Ef{g}}}{}{}{}}{{{Ch{ce}}Bf}{{Ef{g}}}{}{}{}}{{{Cb{ce}}Bf}{{Ef{g}}}{}{}{}}{{{Cj{ce}}Bf}{{Ef{g}}}{}{}{}}{{{Cl{ce}}Bf}{{Ef{g}}}{}{}{}}876543210{{{Af{ce}}}e{}Db}{{{Af{ce}}e}e{}{}}{{{Af{ce}}g}e{}{}{{Ah{}{{Bh{e}}}}}}{{{Af{ce}}g}e{}{}{{Ah{c}{{Bh{e}}}}}}{{{Al{ce}}{Al{ce}}}{{Ef{Bj}}}GlGl}{{{Al{ce}}g}Bf{}{}{{Bl{ce}{{Bh{f}}}}}}{{{An{ceg}}i}Bf{}{}{}{{Bl{ce}{{Bh{f}}}}}}{{{An{ceg}}}{{Ef{{Dl{ce}}}}}{}{}{}}{Gn{{H`{ceg}}}{}{}{}}{{{An{ceg}}}{{H`{ceg}}}{}{}{}}`{Gn{{Hb{ceg}}}{}{}{}}{{{An{ceg}}}{{Hb{ceg}}}{}{}{}}{{{Ej{ce}}}e{}{}}{{{An{ceg}}i}{{Ef{e}}}{}{}Cn{jD`{h{c}}}}{{{Ej{ce}}}{{Dl{ce}}}{}{}}{{{An{ceg}}i}{{Ef{{Dl{ce}}}}}{}{}Cn{jD`{h{c}}}}{{{An{ceg}}Bf}d{}{}{}}0{{{An{ceg}}i}d{}{}{}{{Bl{ce}{{Bh{f}}}}}}{{{Fh{}{{Fd{c}}{Ff{e}}}}g}d{}{}{{Bl{ce}{{Bh{f}}}}}}{{{An{ceg}}i}d{}{}Cn{{Bl{ce}{{Bh{f}}}}}}{{{An{ceg}}}d{}{}{}}{{{El{ce}}Bfe}e{}{}}{{{An{ceg}}Bfce}{{Ef{e}}}{D`Dh}{}Cn}:{{{En{ce}}}e{}{}}:9{{{En{ce}}}{{Dl{ce}}}{}{}}9{{{An{ceg}}i}{{Ef{{Dl{Bfce}}}}}{}{}Cn{jD`{h{c}}}}{{{An{ceg}}Bf}{{Ef{{Dl{ce}}}}}{}{}{}}:6{{{B`{ce}}}{{Dl{Bf{Ef{Bf}}}}}{}{}}{{{Bb{ce}}}{{Dl{Bf{Ef{Bf}}}}}{}{}}{{{Aj{ce}}}{{Dl{Bf{Ef{Bf}}}}}{}{}}{{{Bd{ce}}}{{Dl{Bf{Ef{Bf}}}}}{}{}}{{{C`{ce}}}{{Dl{Bf{Ef{Bf}}}}}{}{}}{{{Ch{ce}}}{{Dl{Bf{Ef{Bf}}}}}{}{}}{{{Cb{ce}}}{{Dl{Bf{Ef{Bf}}}}}{}{}}{{{Cj{ce}}}{{Dl{Bf{Ef{Bf}}}}}{}{}}{{{Cl{ce}}}{{Dl{Bf{Ef{Bf}}}}}{}{}}{{{Df{gcei}}}{{Dl{Bf{Ef{Bf}}}}}{D`Dh}{}{{Dn{}{{Dj{{Dl{ce}}}}}}}Cn}{{{An{ceg}}i}d{}{}{}{{Bl{cece}{{Bh{Bj}}}}}}{{{An{ceg}}k}d{}{}{}Bn{{Bl{ce}{{Bh{i}}}}}}{{{An{ceg}}}dBn{}{}}20{{{An{ceg}}i}{{Aj{ce}}}{}{}{}{{Bl{cece}{{Bh{Bj}}}}}}0{{{An{ceg}}ik}{{Df{ceg}}}{D`Dh}{}Cn{{Dd{Bf}}}{{Ed{}{{Dj{{Dl{ce}}}}}}}}{{{Al{ce}}Bf}{{Dl{{Al{ce}}{Al{ce}}}}}{}{}}0{{{Al{ce}}}{{Ef{{Dl{{Dl{ce}}{Al{ce}}}}}}}{}{}}000{{{An{ceg}}Bf}{{An{ceg}}}{}{}Cd}{{{Ej{ce}}Bf}d{}{}}{{{En{ce}}Bf}d{}{}}{{{An{ceg}}BfBf}d{}{}{}}{{{Ej{ce}}}e{}{}}{{{En{ce}}}e{}{}}{{{An{ceg}}i}{{Ef{e}}}{}{}Cn{jD`{h{c}}}}{{{Ej{ce}}}{{Dl{ce}}}{}{}}{{{En{ce}}}{{Dl{ce}}}{}{}}{{{An{ceg}}i}{{Ef{{Dl{ce}}}}}{}{}Cn{jD`{h{c}}}}{{{An{ceg}}i}{{Ef{{Dl{Bfce}}}}}{}{}Cn{jD`{h{c}}}}{{{An{ceg}}Bf}{{Ef{{Dl{ce}}}}}{}{}{}}{ce{}{}}000{{{An{ceg}}Bf}d{}{}{}}{c{{Ab{e}}}{}{}}00000000000000000000000000000{{{An{ceg}}Bf}{{Ab{db}}}{}{}{}}0{cAd{}}000000000000000{{{Al{ce}}}{{Cb{ce}}}{}{}}{{{An{ceg}}}{{Cb{ce}}}{}{}{}}{{{Al{ce}}}{{Cj{ce}}}{}{}}{{{An{ceg}}}{{Cj{ce}}}{}{}{}}{Bf{{An{ce}}}{}{}}{{Bfc}{{An{egc}}}{}{}{}}{c{{An{egc}}}{}{}{}}````````{{{Hd{ceg}}i}{{Hd{ceg}}}{}{}{}{{Ah{ce}}}}<<<<<<<<<<{{{Hb{ceg}}l}n{}{}{}}{{{H`{ceg}}l}n{}{}{}}{{{Hd{ceg}}l}nEhEh{}}{{{Hf{ceg}}l}nEhEh{}}{{{Hh{ceg}}l}n{}{}{}}{cc{}}0000{{{Hb{ceg}}Hji}{{Ef{{Dl{ce}}}}}{}{}{}{{Bl{c}{{Bh{f}}}}}}{{{H`{ceg}}Hji}{{Hd{ceg}}}{}{}{}{{Bl{c}{{Bh{f}}}}}}{{{Hb{ceg}}Hji}{{Ef{{Dl{Bfce}}}}}{}{}{}{{Bl{c}{{Bh{f}}}}}}{{{Hb{ceg}}i}{{Ef{{Dl{ce}}}}}{}{}Cn{jD`{h{c}}}}{{{H`{ceg}}i}{{Hd{ceg}}}{}{}Cn{jD`{h{c}}}}{{{Hb{ceg}}Hji}{{Ef{{Dl{ce}}}}}{}{}{}{j{h{c}}}}{{{H`{ceg}}Hji}{{Hd{ceg}}}{}{}{}{j{h{c}}}}{{{Hf{ceg}}}e{}{}{}}{{{Hf{ceg}}}{{Dl{ce}}}{}{}{}}01{{{Hd{ceg}}}Bf{}{}{}}{{{Hf{ceg}}}Bf{}{}{}}{{{Hh{ceg}}}Bf{}{}{}}{{{Hb{ceg}}Hji}{{Ef{Bf}}}{}{}{}{{Bl{c}{{Bh{f}}}}}}{{{Hf{ceg}}e}e{}{}{}}{{{Hh{ceg}}ce}{{Dl{ce}}}D`{}Cn}{{{Hh{ceg}}Hjce}{{Dl{ce}}}{}{}{}}{{{Hf{ceg}}c}c{}{}{}}{ce{}{}}0000{{{Hf{ceg}}}c{}{}{}}:;00{{{Hf{ceg}}Bf}d{}{}{}}{{{Hd{ceg}}ce}{{Dl{ce}}}D`{}Cn}{{{Hd{ceg}}i}{{Dl{ce}}}D`{}Cn{{Ah{}{{Bh{{Dl{ce}}}}}}}}{Gn{{H`{ceg}}}{}{}{}}{Gn{{Hb{ceg}}}{}{}{}}{{{Hf{ceg}}}e{}{}{}}{{{Hf{ceg}}}{{Dl{ce}}}{}{}{}}{{{Hh{ceg}}Bfce}{{Dl{ce}}}D`{}Cn}{{{Hh{ceg}}BfHjce}{{Dl{ce}}}{}{}{}}32832{c{{Ab{e}}}{}{}}000000000{cAd{}}0000````````````{{{Hl{c}}}{{Hn{c}}}{}}{{{I`{c}}}{{Hn{c}}}{}}{{{Ib{c}}}{{Hn{c}}}{}}{{{Id{ce}}}{{Hn{c}}}{}{}}{{{Hn{c}}c}{{Ab{BfBf}}}Bn}{{{Id{ce}}c}{{Ab{BfBf}}}Bn{}}{{{Hn{c}}e}{{Ab{BfBf}}}{}{{Bl{c}{{Bh{Bj}}}}}}{{{Id{ce}}g}{{Ab{BfBf}}}{}{}{{Bl{c}{{Bh{Bj}}}}}}{{{Hn{c}}eg}{{Ab{BfBf}}}{}Bn{{Bl{c}{{Bh{e}}}}}}{{{Id{ce}}gi}{{Ab{BfBf}}}{}{}Bn{{Bl{c}{{Bh{g}}}}}}{{{Id{ce}}{Id{cg}}}i{DhD`Cd}{CnDb}Cn{}}00{ce{}{}}0000000000000000000{{{Id{ce}}}Bf{}{}}{{{Id{ce}}}d{}{}}{{{Hl{c}}}{{Hl{c}}}{}}{{{If{ce}}}{{If{ce}}}{}{}}{{{Ih{ce}}}{{Ih{ce}}}{}{}}{{{Ij{ceg}}}{{Ij{ceg}}}{}{}{}}{{{Il{ce}}}{{Il{ce}}}{}{}}{{{Id{ce}}}{{Id{ce}}}CdCd}{{{Id{ce}}{Id{ce}}}dCdCd}{{ce}d{}{}}00000{{{Hn{c}}{Hn{c}}}BjBn}{{{Hl{c}}}g{}{}{{Cf{e}}}}{{{I`{c}}}g{}{}{{Cf{e}}}}{{{Ib{c}}}g{}{}{{Cf{e}}}}{{ce}Bj{}{}}{{{Id{ce}}g}f{}Cn{jD`{h{c}}}}{{{Hl{c}}}Bf{}}{{{I`{c}}}Bf{}}{{{Ib{c}}}Bf{}}{{}{{Hl{c}}}{}}{{}{{I`{c}}}{}}{{}{{Hn{c}}}{}}{{}{{Id{ce}}}{}Db}{{{Id{ce}}{Id{cg}}}{{If{cg}}}{D`Dh}CnCn}{{{Id{ce}}g}{{Ib{c}}}{}{}{{Dd{Bf}}}}{{{Hn{c}}{Hn{c}}}fE`}{{{Id{ce}}{Id{cg}}}f{D`Dh}CnCn}{{ce}f{}{}}00000{{{Id{ce}}g}d{D`Dh}Cn{{Ed{}{{Dj{c}}}}}}{{{Id{ce}}g}d{D`DhEb}Cn{{Ed{}{{Dj{c}}}}}}{{{Hn{c}}}{{Ef{c}}}{}}{{{Id{ce}}}{{Ef{c}}}{}{}}{{{Hl{c}}l}nEh}{{{I`{c}}l}nEh}{{{Ib{c}}l}nEh}{{{If{ce}}l}n{EhDhD`}Cn}{{{Ih{ce}}l}n{EhDhD`}Cn}{{{Ij{ceg}}l}n{EhDhD`}CnCn}{{{Il{ce}}l}n{EhDhD`}Cn}{{{In{ecg}}l}n{EhD`Dh}{Eh{Dn{}{{Dj{c}}}}}Cn}{{{Hn{c}}l}nEh}{{{Id{ce}}l}nEh{}}{{{Ij{ceg}}im}i{DhD`}CnCn{}{}{{Bl{ik}{{Bh{i}}}}}}{{{Il{ce}}gk}g{DhD`}Cn{}{}{{Bl{gi}{{Bh{g}}}}}}{cc{}}00000000{{{F`{c}}}{{Id{cFb}}}{DhD`}}{e{{Id{cg}}}{D`Dh}{{Ed{}{{Dj{c}}}}}{CnDb}}{{{Id{ce}}g}{{Ef{c}}}{}Cn{jD`{h{c}}}}{{{Id{ce}}g}{{Ef{{Dl{Bfc}}}}}{}Cn{jD`{h{c}}}}{{{J`{}{{Ff{c}}}}e}{{Ef{{Dl{Bfc}}}}}{}{jD`{h{c}}}}1{{{Hn{c}}Bf}{{Ef{c}}}{}}{{{Id{ce}}Bf}{{Ef{c}}}{}{}}{{{J`{}{{Ff{c}}}}Bf}{{Ef{c}}}{}}{{{Id{ce}}Bf}{{Ef{c}}}{}Cn}{{{Id{ce}}g}{{Ef{Bf}}}{}Cn{jD`{h{c}}}}{{{Hn{c}}e}{{Ef{{Hn{c}}}}}{}{{Dd{Bf}}}}{{{Id{ce}}g}{{Ef{{Hn{c}}}}}{}{}{{Dd{Bf}}}}{{{Hn{c}}e}dD`Fj}{{{Id{ce}}}e{}{}}{{{Hn{c}}Bf}e{}{}}{{{Hn{c}}{Gb{Bf}}}e{}{}}{{{Hn{c}}Fn}e{}{}}{{{Hn{c}}{Dl{{Gh{Bf}}{Gh{Bf}}}}}e{}{}}{{{Hn{c}}{G`{Bf}}}e{}{}}{{{Hn{c}}{Gf{Bf}}}e{}{}}{{{Hn{c}}{Fl{Bf}}}e{}{}}{{{Hn{c}}{Gd{Bf}}}e{}{}}{{{Id{ce}}Fn}g{}{}{}}{{{Id{ce}}{Gb{Bf}}}g{}{}{}}{{{Id{ce}}{Fl{Bf}}}g{}{}{}}{{{Id{ce}}Bf}c{}{}}{{{Id{ce}}{G`{Bf}}}g{}{}{}}{{{Id{ce}}{Gf{Bf}}}g{}{}{}}{{{Id{ce}}{Dl{{Gh{Bf}}{Gh{Bf}}}}}g{}{}{}}{{{Id{ce}}{Gd{Bf}}}g{}{}{}}{{{Id{ce}}c}f{D`Dh}Cn}{{{Id{ce}}c}{{Dl{Bff}}}{D`Dh}Cn}{{{Id{ce}}c}{{Dl{Bff}}}{BnD`Dh}Cn}{{{Id{ce}}{Id{cg}}}{{Ih{cg}}}{D`Dh}CnCn}{ce{}{}}00000000{{{Id{ce}}}{{Gj{{Hn{c}}}}}{}{}}11111111{{{Hn{c}}}e{}{}}{{{Id{ce}}}g{}{}{}}0{{{Id{ce}}{Id{cg}}}f{DhD`}CnCn}{{{Hn{c}}}f{}}{{{Id{ce}}}f{}{}}22{{{Hn{c}}}{{Hl{c}}}{}}{{{Id{ce}}}{{Hl{c}}}{}{}}{{{Hl{c}}}{{Ef{e}}}{}{}}{{{I`{c}}}{{Ef{e}}}{}{}}{{{Ib{c}}}{{Ef{e}}}{}{}}{{{Hn{c}}}{{Ef{c}}}{}}{{{Id{ce}}}{{Ef{c}}}{}{}}{{{Hl{c}}}Bf{}}{{{I`{c}}}Bf{}}{{{Ib{c}}}Bf{}}{{{In{ecg}}}Bf{D`Dh}{{Dn{}{{Dj{c}}}}}Cn}{{{Hn{c}}}Bf{}}{{{Id{ce}}}Bf{}{}}{{{Id{ce}}BfBf}d{}{}}{{}{{Hn{c}}}{}}{{}{{Id{c}}}{}}=<;{{{If{ce}}}{{Ef{g}}}{DhD`}Cn{}}{{{Ih{ce}}}{{Ef{g}}}{DhD`}Cn{}}{{{Ij{ceg}}}{{Ef{i}}}{DhD`}CnCn{}}{{{Il{ce}}}{{Ef{g}}}{DhD`}Cn{}}{{{In{ecg}}}{{Ef{i}}}{D`Dh}{{Dn{}{{Dj{c}}}}}Cn{}}{{{Hl{c}}}{{Ef{e}}}{}{}}{{{I`{c}}}{{Ef{e}}}{}{}}{{{Ib{c}}}{{Ef{e}}}{}{}}76543{{{Hl{c}}Bf}{{Ef{e}}}{}{}}{{{I`{c}}Bf}{{Ef{e}}}{}{}}{{{Ib{c}}Bf}{{Ef{e}}}{}{}}210{{{Hn{c}}{Hn{c}}}{{Ef{Bj}}}Gl}{{{Hn{c}}e}Bf{}{{Bl{c}{{Bh{f}}}}}}{{{Id{ce}}g}Bf{}{}{{Bl{c}{{Bh{f}}}}}}{{{Id{ce}}}{{Ef{c}}}{}{}}{{{Id{ce}}g}f{}Cn{jD`{h{c}}}}{{{Id{ce}}c}{{Ef{c}}}{D`Dh}Cn}{{{Id{ce}}c}{{Dl{Bf{Ef{c}}}}}{D`Dh}Cn}{{{Id{ce}}Bf}d{}{}}0{{{Id{ce}}g}d{}{}{{Bl{c}{{Bh{f}}}}}}{{{J`{}{{Ff{c}}}}e}d{}{{Bl{c}{{Bh{f}}}}}}{{{Id{ce}}g}d{}Cn{{Bl{c}{{Bh{f}}}}}}{{{Id{ce}}}d{}{}}{{{Ij{ceg}}im}i{DhD`}CnCn{}{}{{Bl{ik}{{Bh{i}}}}}}{{{Il{ce}}gk}g{DhD`}Cn{}{}{{Bl{gi}{{Bh{g}}}}}}{{{Id{ce}}Bfc}f{D`Dh}Cn}:{{{Id{ce}}g}{{Ef{{Dl{Bfc}}}}}{}Cn{jD`{h{c}}}}{{{Id{ce}}Bf}{{Ef{c}}}{}{}}{{{Id{ce}}g}{{Ef{c}}}{}Cn{jD`{h{c}}}}:6{{{Hl{c}}}{{Dl{Bf{Ef{Bf}}}}}{}}{{{I`{c}}}{{Dl{Bf{Ef{Bf}}}}}{}}{{{Ib{c}}}{{Dl{Bf{Ef{Bf}}}}}{}}{{{If{ce}}}{{Dl{Bf{Ef{Bf}}}}}{DhD`}Cn}{{{Ih{ce}}}{{Dl{Bf{Ef{Bf}}}}}{DhD`}Cn}{{{Ij{ceg}}}{{Dl{Bf{Ef{Bf}}}}}{DhD`}CnCn}{{{Il{ce}}}{{Dl{Bf{Ef{Bf}}}}}{DhD`}Cn}{{{In{ecg}}}{{Dl{Bf{Ef{Bf}}}}}{D`Dh}{{Dn{}{{Dj{c}}}}}Cn}{{{Id{ce}}}dBn{}}{{{Id{ce}}g}d{}{}{{Bl{cc}{{Bh{Bj}}}}}}{{{Id{ce}}i}d{}{}Bn{{Bl{c}{{Bh{g}}}}}}21{{{Id{ce}}g}{{I`{c}}}{}{}{{Bl{cc}{{Bh{Bj}}}}}}0{{{Id{ce}}gi}{{In{ce}}}{D`Dh}Cn{{Dd{Bf}}}{{Ed{}{{Dj{c}}}}}}{{{Hn{c}}Bf}{{Dl{{Hn{c}}{Hn{c}}}}}{}}{{{Hn{c}}}{{Ef{{Dl{c{Hn{c}}}}}}}{}}0{{{Id{ce}}Bf}{{Id{ce}}}{}Cd}{{{Id{ce}}{Id{cg}}}i{DhD`Cd}{CnDb}Cn{}}{{{Id{ce}}BfBf}d{}{}}{{{Id{ce}}g}f{}Cn{jD`{h{c}}}}{{{Id{ce}}g}{{Ef{{Dl{Bfc}}}}}{}Cn{jD`{h{c}}}}{{{Id{ce}}Bf}{{Ef{c}}}{}{}}{{{Id{ce}}g}{{Ef{c}}}{}Cn{jD`{h{c}}}}{{{Id{ce}}{Id{cg}}}{{Ij{ceg}}}{D`Dh}CnCn}1{ce{}{}}00000{{{Id{ce}}Bf}d{}{}}{c{{Ab{e}}}{}{}}00000000000000000{{{Id{ce}}Bf}{{Ab{db}}}{}{}}0{cAd{}}000000000{{{Id{ce}}{Id{cg}}}{{Il{ce}}}{D`Dh}CnCn}{Bf{{Id{c}}}{}}{{Bfc}{{Id{ec}}}{}{}}{c{{Id{ec}}}{}{}}","c":[391,392,393,394,572,573,807,852],"p":[[5,"TryReserveError",0],[1,"unit"],[1,"bool"],[10,"Equivalent",0],[10,"Sized",894],[5,"Formatter",895],[8,"Result",895],[5,"String",896],[6,"Result",897],[5,"TypeId",898],[6,"Entry",26],[10,"FnOnce",899],[5,"IntoIter",26],[5,"Slice",26],[5,"IndexMap",26],[5,"Iter",26],[5,"IterMut",26],[5,"Drain",26],[1,"usize"],[17,"Output"],[6,"Ordering",900],[10,"FnMut",899],[10,"Ord",900],[5,"Keys",26],[5,"Values",26],[10,"Clone",901],[10,"FromIterator",902],[5,"IntoKeys",26],[5,"ValuesMut",26],[5,"IntoValues",26],[10,"BuildHasher",903],[10,"Hash",903],[10,"Default",904],[10,"RangeBounds",905],[5,"Splice",26],[10,"Eq",900],[17,"Item"],[1,"tuple"],[10,"Iterator",906],[10,"PartialEq",900],[10,"Copy",894],[10,"IntoIterator",902],[6,"Option",907],[10,"Debug",895],[5,"OccupiedEntry",26],[5,"VacantEntry",26],[5,"IndexedEntry",26],[1,"array"],[5,"RandomState",908],[17,"Key"],[17,"Value"],[10,"MutableKeys",26],[10,"Hasher",903],[5,"RangeTo",905],[5,"RangeFull",905],[5,"Range",905],[5,"RangeFrom",905],[5,"RangeToInclusive",905],[5,"RangeInclusive",905],[6,"Bound",905],[5,"Box",909],[10,"PartialOrd",900],[10,"RawEntryApiV1",509],[5,"RawEntryBuilderMut",509],[5,"RawEntryBuilder",509],[6,"RawEntryMut",509],[5,"RawOccupiedEntryMut",509],[5,"RawVacantEntryMut",509],[1,"u64"],[5,"Iter",596],[5,"Slice",596],[5,"IntoIter",596],[5,"Drain",596],[5,"IndexSet",596],[5,"Difference",596],[5,"Intersection",596],[5,"SymmetricDifference",596],[5,"Union",596],[5,"Splice",596],[10,"MutableValues",596]],"b":[[13,"impl-Debug-for-TryReserveError"],[14,"impl-Display-for-TryReserveError"],[134,"impl-Default-for-%26Slice%3CK,+V%3E"],[135,"impl-Default-for-%26mut+Slice%3CK,+V%3E"],[148,"impl-Extend%3C(%26K,+%26V)%3E-for-IndexMap%3CK,+V,+S%3E"],[149,"impl-Extend%3C(K,+V)%3E-for-IndexMap%3CK,+V,+S%3E"],[217,"impl-Index%3Cusize%3E-for-Slice%3CK,+V%3E"],[218,"impl-Index%3CRangeTo%3Cusize%3E%3E-for-Slice%3CK,+V%3E"],[219,"impl-Index%3CRangeFull%3E-for-Slice%3CK,+V%3E"],[220,"impl-Index%3CRange%3Cusize%3E%3E-for-Slice%3CK,+V%3E"],[221,"impl-Index%3CRangeFrom%3Cusize%3E%3E-for-Slice%3CK,+V%3E"],[222,"impl-Index%3CRangeToInclusive%3Cusize%3E%3E-for-Slice%3CK,+V%3E"],[223,"impl-Index%3CRangeInclusive%3Cusize%3E%3E-for-Slice%3CK,+V%3E"],[224,"impl-Index%3C(Bound%3Cusize%3E,+Bound%3Cusize%3E)%3E-for-Slice%3CK,+V%3E"],[225,"impl-Index%3CRangeFull%3E-for-IndexMap%3CK,+V,+S%3E"],[226,"impl-Index%3C(Bound%3Cusize%3E,+Bound%3Cusize%3E)%3E-for-IndexMap%3CK,+V,+S%3E"],[227,"impl-Index%3CRangeFrom%3Cusize%3E%3E-for-IndexMap%3CK,+V,+S%3E"],[228,"impl-Index%3CRangeInclusive%3Cusize%3E%3E-for-IndexMap%3CK,+V,+S%3E"],[229,"impl-Index%3CRangeTo%3Cusize%3E%3E-for-IndexMap%3CK,+V,+S%3E"],[230,"impl-Index%3CRangeToInclusive%3Cusize%3E%3E-for-IndexMap%3CK,+V,+S%3E"],[231,"impl-Index%3Cusize%3E-for-IndexMap%3CK,+V,+S%3E"],[232,"impl-Index%3CRange%3Cusize%3E%3E-for-IndexMap%3CK,+V,+S%3E"],[233,"impl-Index%3C%26Q%3E-for-IndexMap%3CK,+V,+S%3E"],[234,"impl-IndexMut%3CRangeToInclusive%3Cusize%3E%3E-for-Slice%3CK,+V%3E"],[235,"impl-IndexMut%3Cusize%3E-for-Slice%3CK,+V%3E"],[236,"impl-IndexMut%3CRangeFrom%3Cusize%3E%3E-for-Slice%3CK,+V%3E"],[237,"impl-IndexMut%3CRangeInclusive%3Cusize%3E%3E-for-Slice%3CK,+V%3E"],[238,"impl-IndexMut%3C(Bound%3Cusize%3E,+Bound%3Cusize%3E)%3E-for-Slice%3CK,+V%3E"],[239,"impl-IndexMut%3CRangeTo%3Cusize%3E%3E-for-Slice%3CK,+V%3E"],[240,"impl-IndexMut%3CRangeFull%3E-for-Slice%3CK,+V%3E"],[241,"impl-IndexMut%3CRange%3Cusize%3E%3E-for-Slice%3CK,+V%3E"],[242,"impl-IndexMut%3CRange%3Cusize%3E%3E-for-IndexMap%3CK,+V,+S%3E"],[243,"impl-IndexMut%3CRangeToInclusive%3Cusize%3E%3E-for-IndexMap%3CK,+V,+S%3E"],[244,"impl-IndexMut%3CRangeInclusive%3Cusize%3E%3E-for-IndexMap%3CK,+V,+S%3E"],[245,"impl-IndexMut%3CRangeTo%3Cusize%3E%3E-for-IndexMap%3CK,+V,+S%3E"],[246,"impl-IndexMut%3C%26Q%3E-for-IndexMap%3CK,+V,+S%3E"],[247,"impl-IndexMut%3CRangeFull%3E-for-IndexMap%3CK,+V,+S%3E"],[248,"impl-IndexMut%3CRangeFrom%3Cusize%3E%3E-for-IndexMap%3CK,+V,+S%3E"],[249,"impl-IndexMut%3C(Bound%3Cusize%3E,+Bound%3Cusize%3E)%3E-for-IndexMap%3CK,+V,+S%3E"],[250,"impl-IndexMut%3Cusize%3E-for-IndexMap%3CK,+V,+S%3E"],[284,"impl-IntoIterator-for-%26mut+Slice%3CK,+V%3E"],[285,"impl-IntoIterator-for-%26Slice%3CK,+V%3E"],[286,"impl-IntoIterator-for-IndexMap%3CK,+V,+S%3E"],[287,"impl-IntoIterator-for-%26mut+IndexMap%3CK,+V,+S%3E"],[288,"impl-IntoIterator-for-%26IndexMap%3CK,+V,+S%3E"],[679,"impl-Extend%3CT%3E-for-IndexSet%3CT,+S%3E"],[680,"impl-Extend%3C%26T%3E-for-IndexSet%3CT,+S%3E"],[719,"impl-Index%3Cusize%3E-for-Slice%3CT%3E"],[720,"impl-Index%3CRangeFrom%3Cusize%3E%3E-for-Slice%3CT%3E"],[721,"impl-Index%3CRangeFull%3E-for-Slice%3CT%3E"],[722,"impl-Index%3C(Bound%3Cusize%3E,+Bound%3Cusize%3E)%3E-for-Slice%3CT%3E"],[723,"impl-Index%3CRange%3Cusize%3E%3E-for-Slice%3CT%3E"],[724,"impl-Index%3CRangeInclusive%3Cusize%3E%3E-for-Slice%3CT%3E"],[725,"impl-Index%3CRangeTo%3Cusize%3E%3E-for-Slice%3CT%3E"],[726,"impl-Index%3CRangeToInclusive%3Cusize%3E%3E-for-Slice%3CT%3E"],[727,"impl-Index%3CRangeFull%3E-for-IndexSet%3CT,+S%3E"],[728,"impl-Index%3CRangeFrom%3Cusize%3E%3E-for-IndexSet%3CT,+S%3E"],[729,"impl-Index%3CRangeTo%3Cusize%3E%3E-for-IndexSet%3CT,+S%3E"],[730,"impl-Index%3Cusize%3E-for-IndexSet%3CT,+S%3E"],[731,"impl-Index%3CRange%3Cusize%3E%3E-for-IndexSet%3CT,+S%3E"],[732,"impl-Index%3CRangeInclusive%3Cusize%3E%3E-for-IndexSet%3CT,+S%3E"],[733,"impl-Index%3C(Bound%3Cusize%3E,+Bound%3Cusize%3E)%3E-for-IndexSet%3CT,+S%3E"],[734,"impl-Index%3CRangeToInclusive%3Cusize%3E%3E-for-IndexSet%3CT,+S%3E"],[758,"impl-IntoIterator-for-%26IndexSet%3CT,+S%3E"],[759,"impl-IntoIterator-for-IndexSet%3CT,+S%3E"]]}],\ ["is_terminal_polyfill",{"doc":"Polyfill for is_terminal stdlib feature for use with older …","t":"KM","n":["IsTerminal","is_terminal"],"q":[[0,"is_terminal_polyfill"]],"d":["Trait to determine if a descriptor/handle refers to a …","Returns true if the descriptor/handle refers to a …"],"i":[0,1],"f":"`{bd}","c":[],"p":[[10,"IsTerminal",0],[1,"bool"]],"b":[]}],\ ["itoa",{"doc":"github crates-io docs-rs","t":"FKNNNNNNNNNNN","n":["Buffer","Integer","borrow","borrow_mut","clone","default","format","from","into","new","try_from","try_into","type_id"],"q":[[0,"itoa"],[13,"core::result"],[14,"core::any"]],"d":["A correctly sized stack allocation for the formatted …","An integer that can be written into an itoa::Buffer.","","","","","Print an integer into this buffer and return a reference …","Returns the argument unchanged.","Calls U::from(self).","This is a cheap operation; you don’t need to worry about …","","",""],"i":[0,0,1,1,1,1,1,1,1,1,1,1,1],"f":"``{ce{}{}}0{bb}{{}b}{{bc}df}{cc{}}42{c{{h{e}}}{}{}}0{cj{}}","c":[],"p":[[5,"Buffer",0],[1,"str"],[10,"Integer",0],[6,"Result",13],[5,"TypeId",14]],"b":[]}],\ -["lil_broker",{"doc":"","t":"PPPFFFPPPFPPPFPFPPGGFFPPFFGFPFOOONNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNOONNNNNNNNNNNNNNNNNNNNNNNNNNNNOOONNNNNNOONNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNONOOOONNNNNNNNNNNNNNNNNNNNNNOOOOOOOOOOOONNNNNNNNNNNNNNOOOONNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNOOON","n":["ArrayRef","Boolean","BooleanArray","Bucket","DataPoint","Database","Exclude","ExcludeWithValue","GetLatest","GetLatestQuery","Include","IncludeWithValue","Lookup","LookupQuery","LookupRange","LookupRangeQuery","Number","NumberArray","Primatives","QueryCommand","QueryResponse","QueryResponseMetadata","String","StringArray","Tag","TagFilter","TagFilterMode","Timestamp","Write","WriteQuery","ack_topics","ack_topics","ack_topics","add","add_data_point","add_primative","add_tag","add_tag","add_tag_to_bucket","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","bucket_tags","buckets","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","cmp","cmp","data","data","data","default","default","default","default","default","deserialize","direction_before","direction_before","eq","eq","eq","eq","exclude","exclude_with_value","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from_hz","from_json_batch","from_seconds","get_earliest","get_keys","get_latest","get_latest_mut","hash","hash","hours","hz","include","include_with_value","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","is_valid","lookup","metadata","minutes","mode","n_results","name","name","new","new","new","new","new","new","new","new","new_bucket","new_with_value","partial_cmp","partial_cmp","query","query_batch","query_get_latest","query_lookup_range","query_write","range","seconds","serialize","sub","tag","tag","tag_filters","tag_filters","tag_filters","tags","tags","tick_ms","timestamp","timestamp","timestamp","timestamp_end","timestamp_start","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_string","topic","topics","topics","topics","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","value","value","values","was_successful","zero"],"q":[[0,"lil_broker"],[303,"core::cmp"],[304,"core::result"],[305,"serde::de"],[306,"core::fmt"],[307,"core::fmt"],[308,"alloc::vec"],[309,"core::time"],[310,"core::option"],[311,"core::hash"],[312,"serde::ser"],[313,"core::any"]],"d":["","","","","Stpres a single data point with a timestamp, data, and tags","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","","Returns the argument unchanged.","","Returns the argument unchanged.","","Returns the argument unchanged.","","","Returns the argument unchanged.","","","Returns the argument unchanged.","Returns the argument unchanged.","","","","","","Returns the argument unchanged.","","Returns the argument unchanged.","","","Returns the argument unchanged.","","","","","","Returns the argument unchanged.","","","","","","Get the latest DataPoint in the bucket","","","We only hash for the name","","","","","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","","Get the datapoint right before/after the timestamp ","","","","","","","","","","","","","","Create a new tag with no value set","","Create a new tag with a value set","","","","","","","","Get all the datapoints between two timestamps","","","","Builder function to add a tag to the DataPoint","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","Builder function to add a value to the tag","","","",""],"i":[4,4,4,0,0,0,9,9,15,0,9,9,15,0,15,0,4,4,0,0,0,0,4,4,0,0,0,0,15,0,11,12,13,1,2,2,2,3,7,2,7,9,10,11,12,13,14,15,16,17,4,3,1,5,2,7,9,10,11,12,13,14,15,16,17,4,3,1,5,2,7,9,10,11,12,13,14,15,16,17,4,3,1,5,9,10,11,12,13,14,15,16,17,4,3,1,5,1,5,14,17,3,11,12,13,17,1,1,11,12,4,3,1,5,10,10,9,10,11,12,13,14,15,16,17,4,3,1,1,5,2,7,9,10,11,12,12,13,13,13,14,14,15,15,15,15,16,17,4,4,4,4,4,4,4,3,1,1,1,1,5,5,5,5,5,1,14,1,2,7,2,2,1,5,1,1,10,10,2,7,9,10,11,12,13,14,15,16,17,4,3,1,5,10,2,17,1,10,16,2,5,2,7,10,14,17,3,1,5,7,5,1,5,7,7,7,7,7,2,1,1,1,3,10,11,12,13,14,3,1,11,14,3,12,12,9,10,11,12,13,14,15,16,17,4,3,1,5,1,14,11,12,13,2,7,9,10,11,12,13,14,15,16,17,4,3,1,5,2,7,9,10,11,12,13,14,15,16,17,4,3,1,5,2,7,9,10,11,12,13,14,15,16,17,4,3,1,5,5,5,2,16,1],"f":"`````````````````````````````````{{bb}b}{{df}d}{{dbh}d}{{dj}d}{{fj}l}{{nA`j}l}{ce{}{}}00000000000000000000000000000``{AbAb}{AdAd}{AfAf}{AhAh}{AjAj}{AlAl}{AnAn}{B`B`}{BbBb}{hh}{ff}{bb}{jj}{{ce}l{}{}}000000000000{{bb}Bd}{{jj}Bd}```{{}Af}{{}Ah}{{}Aj}{{}Bb}{{}b}{c{{Bf{b}}}Bh}``{{hh}Bj}{{ff}Bj}{{bb}Bj}{{jj}Bj}{AdAd}0{{AbBl}Bn}{{AdBl}Bn}{{AfBl}Bn}{{AhBl}Bn}{{AjBl}Bn}{{AlBl}Bn}{{AnBl}Bn}{{B`Bl}Bn}{{BbBl}Bn}{{hBl}Bn}{{fBl}Bn}{{bBl}Bn}0{{jBl}Bn}{cc{}}0000{AnAh}1{{{Cb{C`}}}Aj}2{AnAj}3{AnAl}{AlAn}5{AjAn}{AhAn}77{{{Cb{Cd}}}h}{C`h}{Bjh}{{{Cb{C`}}}h}{{{Cb{Bj}}}h}<{Cdh}={Cfb}{Chb}?{Cjb}{A`j}{{{Cl{A`A`}}}j}{C`j}{{{Cl{C`C`}}}j}{cc{}}{Cnb}{{C`bC`}{{Cb{Al}}}}1{d{{D`{f}}}}{n{{Cb{C`}}}}11{{bc}lDb}{{jc}lDb}{bCd}{bCn}{AdAd}0{ce{}{}}00000000000000{{Adf}Bj}{{dbBj}{{D`{f}}}}`5````{A`d}{{}n}{jAd}{{C`hb}Al}{{}Bb}{{bh}f}{Cfb}{A`j}{{nA`}l}{{A`A`}j}{{bb}{{D`{Bd}}}}{{jj}{{D`{Bd}}}}{{nAn}{{Bf{BbC`}}}}{{n{Cb{An}}}{{Bf{{Cb{Bb}}C`}}}}{{nAj}{{Bf{BbC`}}}}{{nAh}{{Bf{BbC`}}}}{{nAl}{{Bf{BbC`}}}}{{dbb}{{Cb{f}}}}{bCd}{{bc}BfDd}{{bb}b}{{fj}f}````````````{ce{}{}}000000000000{cC`{}}````{c{{Bf{e}}}{}{}}00000000000000000000000000000{cDf{}}00000000000000{{jA`}j}```{{}b}","c":[],"p":[[5,"Timestamp",0],[5,"Bucket",0],[5,"DataPoint",0],[6,"Primatives",0],[5,"Tag",0],[1,"unit"],[5,"Database",0],[1,"str"],[6,"TagFilterMode",0],[5,"TagFilter",0],[5,"LookupQuery",0],[5,"LookupRangeQuery",0],[5,"GetLatestQuery",0],[5,"WriteQuery",0],[6,"QueryCommand",0],[5,"QueryResponseMetadata",0],[5,"QueryResponse",0],[6,"Ordering",303],[6,"Result",304],[10,"Deserializer",305],[1,"bool"],[5,"Formatter",306],[8,"Result",306],[5,"String",307],[5,"Vec",308],[1,"f64"],[1,"u32"],[1,"u64"],[5,"Duration",309],[1,"tuple"],[1,"f32"],[6,"Option",310],[10,"Hasher",311],[10,"Serializer",312],[5,"TypeId",313]],"b":[[127,"impl-Debug-for-Timestamp"],[128,"impl-Display-for-Timestamp"],[137,"impl-From%3CVec%3CString%3E%3E-for-GetLatestQuery"],[139,"impl-From%3CQueryCommand%3E-for-GetLatestQuery"],[142,"impl-From%3CWriteQuery%3E-for-QueryCommand"],[144,"impl-From%3CGetLatestQuery%3E-for-QueryCommand"],[145,"impl-From%3CLookupRangeQuery%3E-for-QueryCommand"],[148,"impl-From%3CVec%3Cf64%3E%3E-for-Primatives"],[149,"impl-From%3CString%3E-for-Primatives"],[150,"impl-From%3Cbool%3E-for-Primatives"],[151,"impl-From%3CVec%3CString%3E%3E-for-Primatives"],[152,"impl-From%3CVec%3Cbool%3E%3E-for-Primatives"],[154,"impl-From%3Cf64%3E-for-Primatives"],[156,"impl-From%3Cu32%3E-for-Timestamp"],[157,"impl-From%3Cu64%3E-for-Timestamp"],[159,"impl-From%3CDuration%3E-for-Timestamp"],[160,"impl-From%3C%26str%3E-for-Tag"],[161,"impl-From%3C(%26str,+%26str)%3E-for-Tag"],[162,"impl-From%3CString%3E-for-Tag"],[163,"impl-From%3C(String,+String)%3E-for-Tag"]]}],\ +["json_unflattening",{"doc":"","t":"CCCGPPPPPPPNNNNNNNNNNHH","n":["errors","flattening","unflattening","Error","FormatError","InvalidProperty","InvalidType","MixedTypeArray","NotAValue","NotAnObject","Unspecified","borrow","borrow_mut","fmt","fmt","from","into","to_string","try_from","try_into","type_id","flatten","unflatten"],"q":[[0,"json_unflattening"],[3,"json_unflattening::errors"],[21,"json_unflattening::flattening"],[22,"json_unflattening::unflattening"],[23,"core::fmt"],[24,"core::fmt"],[25,"core::result"],[26,"core::any"],[27,"serde_json::value"],[28,"serde_json::map"]],"d":["","","","List of errors that could happen","","","","","","","","","","","","Returns the argument unchanged.","Calls U::from(self).","","","","","Flattens a JSON Value into a key-value map.","Unflattens a flattened JSON structure into the original …"],"i":[0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,0,0],"f":"```````````{ce{}{}}0{{bd}f}0{cc{}}2{ch{}}{c{{j{e}}}{}{}}0{cl{}}{n{{j{{A`{hn}}b}}}}{{{A`{hn}}}{{j{nb}}}}","c":[],"p":[[6,"Error",3],[5,"Formatter",23],[8,"Result",23],[5,"String",24],[6,"Result",25],[5,"TypeId",26],[6,"Value",27],[5,"Map",28]],"b":[[13,"impl-Display-for-Error"],[14,"impl-Debug-for-Error"]]}],\ +["lil_broker",{"doc":"","t":"PPPFFFPPPFPPPFPFPPGGFFPPFFGFPFOOONNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNOONNNNNNNNNNNNNNNNNNNNNNNNNNNNNNOOONNNNNNNOONNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNONOOOONNNNNNNNNNNNNNNNNNNNNNNOOOOOOOOOOOONNNNNNNNNNNNNNNNOOOONNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNOOON","n":["ArrayRef","Boolean","BooleanArray","Bucket","DataPoint","Database","Exclude","ExcludeWithValue","GetLatest","GetLatestQuery","Include","IncludeWithValue","Lookup","LookupQuery","LookupRange","LookupRangeQuery","Number","NumberArray","Primatives","QueryCommand","QueryResponse","QueryResponseMetadata","String","StringArray","Tag","TagFilter","TagFilterMode","Timestamp","Write","WriteQuery","ack_topics","ack_topics","ack_topics","add","add_data_point","add_primative","add_tag","add_tag","add_tag_to_bucket","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","bucket_tags","buckets","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","cmp","cmp","compare","compare","data","data","data","default","default","default","default","default","deserialize","deserialize","direction_before","direction_before","eq","eq","eq","eq","equivalent","equivalent","equivalent","equivalent","equivalent","equivalent","exclude","exclude_with_value","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from_hz","from_json_batch","from_seconds","get_earliest","get_keys","get_latest","get_latest_mut","hash","hash","hours","hz","include","include_with_value","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","is_valid","lookup","metadata","minutes","mode","n_results","name","name","new","new","new","new","new","new","new","new","new_bucket","new_with_value","partial_cmp","partial_cmp","query","query_batch","query_get_latest","query_lookup_range","query_write","range","seconds","serialize","serialize","sub","tag","tag","tag_filters","tag_filters","tag_filters","tags","tags","tick_ms","timestamp","timestamp","timestamp","timestamp_end","timestamp_start","to_json","to_json_timestamped","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_string","topic","topics","topics","topics","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","value","value","values","was_successful","zero"],"q":[[0,"lil_broker"],[315,"core::cmp"],[316,"core::result"],[317,"serde::de"],[318,"core::fmt"],[319,"core::fmt"],[320,"alloc::vec"],[321,"core::time"],[322,"serde_json::value"],[323,"core::option"],[324,"core::hash"],[325,"serde::ser"],[326,"core::any"]],"d":["","","","","Stpres a single data point with a timestamp, data, and tags","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","","","Returns the argument unchanged.","","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","","Returns the argument unchanged.","","","","Returns the argument unchanged.","Returns the argument unchanged.","","","","Returns the argument unchanged.","","","","Returns the argument unchanged.","","","","","Returns the argument unchanged.","","Returns the argument unchanged.","","","","","","","","Get the latest DataPoint in the bucket","","We only hash for the name","","","","","","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","","Get the datapoint right before/after the timestamp","","","","","","","","","","","","","Create a new tag with no value set","","","Create a new tag with a value set","","","","","","","","Get all the datapoints between two timestamps","","","","","Builder function to add a tag to the DataPoint","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","Builder function to add a value to the tag","","","",""],"i":[4,4,4,0,0,0,12,12,15,0,12,12,15,0,15,0,4,4,0,0,0,0,4,4,0,0,0,0,15,0,9,10,11,1,2,2,2,3,7,2,7,9,10,11,12,13,14,15,16,17,4,3,5,1,2,7,9,10,11,12,13,14,15,16,17,4,3,5,1,2,7,9,10,11,12,13,14,15,16,17,4,3,5,1,9,10,11,12,13,14,15,16,17,4,3,5,1,5,1,5,1,14,17,3,9,10,11,17,1,4,1,10,11,4,3,5,1,5,5,5,1,1,1,13,13,9,10,11,12,13,14,15,16,17,4,3,5,1,1,2,7,9,9,9,10,11,11,12,13,14,14,15,15,15,15,16,17,4,4,4,4,4,4,4,3,5,5,5,5,5,1,1,1,1,1,14,1,2,7,2,2,5,1,1,1,13,13,2,7,9,10,11,12,13,14,15,16,17,4,3,5,1,13,2,17,1,13,16,2,5,2,7,13,14,17,3,5,1,7,5,5,1,7,7,7,7,7,2,1,4,1,1,3,13,9,10,11,14,3,1,10,14,3,11,11,17,17,9,10,11,12,13,14,15,16,17,4,3,5,1,1,14,9,10,11,2,7,9,10,11,12,13,14,15,16,17,4,3,5,1,2,7,9,10,11,12,13,14,15,16,17,4,3,5,1,2,7,9,10,11,12,13,14,15,16,17,4,3,5,1,5,5,2,16,1],"f":"`````````````````````````````````{{bb}b}{{df}d}{{dbh}d}{{dj}d}{{fj}l}{{nA`j}l}{ce{}{}}00000000000000000000000000000``{AbAb}{AdAd}{AfAf}{AhAh}{AjAj}{AlAl}{AnAn}{B`B`}{BbBb}{hh}{ff}{jj}{bb}{{ce}l{}{}}000000000000{{jj}Bd}{{bb}Bd}{{ce}Bd{}{}}0```{{}Ab}{{}Ad}{{}Af}{{}Bb}{{}b}{c{{Bf{h}}}Bh}{c{{Bf{b}}}Bh}``{{hh}Bj}{{ff}Bj}{{jj}Bj}{{bb}Bj}{{ce}Bj{}{}}00000{AjAj}0{{AbBl}Bn}{{AdBl}Bn}{{AfBl}Bn}{{AhBl}Bn}{{AjBl}Bn}{{AlBl}Bn}{{AnBl}Bn}{{B`Bl}Bn}{{BbBl}Bn}{{hBl}Bn}{{fBl}Bn}{{jBl}Bn}{{bBl}Bn}0{cc{}}00{{{Cb{C`}}}Ab}{AnAb}2{AnAf}3333{AnAl}4{AbAn}{AlAn}{AfAn}77{{{Cb{Bj}}}h}{{{Cb{C`}}}h}{{{Cb{Cd}}}h}:{Cdh}{Bjh}{C`h}={A`j}{C`j}{{{Cf{A`A`}}}j}{{{Cf{C`C`}}}j}{cc{}}{Chb}1{Cjb}{Clb}{Cnb}{{D`bC`}{{Cb{An}}}}1{d{{Db{f}}}}{n{{Cb{C`}}}}11{{jc}lDd}{{bc}lDd}{bCd}{bCn}{AjAj}0{ce{}{}}00000000000000{{Ajf}Bj}{{dbBj}{{Db{f}}}}`5````{A`d}{{}n}{jAj}{{C`hb}Al}{{}Bb}{{bh}f}{A`j}{Cjb}{{nA`}l}{{A`A`}j}{{jj}{{Db{Bd}}}}{{bb}{{Db{Bd}}}}{{nAn}{{Bf{BbC`}}}}{{n{Cb{An}}}{{Bf{{Cb{Bb}}C`}}}}{{nAb}{{Bf{BbC`}}}}{{nAf}{{Bf{BbC`}}}}{{nAl}{{Bf{BbC`}}}}{{dbb}{{Cb{f}}}}{bCd}{{hc}BfDf}{{bc}BfDf}{{bb}b}{{fj}f}````````````{{BbA`}D`}0{ce{}{}}000000000000{cC`{}}````{c{{Bf{e}}}{}{}}00000000000000000000000000000{cDh{}}00000000000000{{jA`}j}```{{}b}","c":[],"p":[[5,"Timestamp",0],[5,"Bucket",0],[5,"DataPoint",0],[6,"Primatives",0],[5,"Tag",0],[1,"unit"],[5,"Database",0],[1,"str"],[5,"GetLatestQuery",0],[5,"LookupQuery",0],[5,"LookupRangeQuery",0],[6,"TagFilterMode",0],[5,"TagFilter",0],[5,"WriteQuery",0],[6,"QueryCommand",0],[5,"QueryResponseMetadata",0],[5,"QueryResponse",0],[6,"Ordering",315],[6,"Result",316],[10,"Deserializer",317],[1,"bool"],[5,"Formatter",318],[8,"Result",318],[5,"String",319],[5,"Vec",320],[1,"f64"],[1,"tuple"],[5,"Duration",321],[1,"u32"],[1,"u64"],[1,"f32"],[6,"Value",322],[6,"Option",323],[10,"Hasher",324],[10,"Serializer",325],[5,"TypeId",326]],"b":[[137,"impl-Debug-for-Timestamp"],[138,"impl-Display-for-Timestamp"],[142,"impl-From%3CVec%3CString%3E%3E-for-GetLatestQuery"],[143,"impl-From%3CQueryCommand%3E-for-GetLatestQuery"],[152,"impl-From%3CGetLatestQuery%3E-for-QueryCommand"],[153,"impl-From%3CWriteQuery%3E-for-QueryCommand"],[154,"impl-From%3CLookupRangeQuery%3E-for-QueryCommand"],[157,"impl-From%3CVec%3Cbool%3E%3E-for-Primatives"],[158,"impl-From%3CVec%3CString%3E%3E-for-Primatives"],[159,"impl-From%3CVec%3Cf64%3E%3E-for-Primatives"],[161,"impl-From%3Cf64%3E-for-Primatives"],[162,"impl-From%3Cbool%3E-for-Primatives"],[163,"impl-From%3CString%3E-for-Primatives"],[165,"impl-From%3C%26str%3E-for-Tag"],[166,"impl-From%3CString%3E-for-Tag"],[167,"impl-From%3C(%26str,+%26str)%3E-for-Tag"],[168,"impl-From%3C(String,+String)%3E-for-Tag"],[170,"impl-From%3CDuration%3E-for-Timestamp"],[172,"impl-From%3Cu32%3E-for-Timestamp"],[173,"impl-From%3Cu64%3E-for-Timestamp"]]}],\ ["lil_helper",{"doc":"","t":"H","n":["add"],"q":[[0,"lil_helper"]],"d":[""],"i":[0],"f":"{{bb}b}","c":[],"p":[[1,"usize"]],"b":[]}],\ ["lil_quad",{"doc":"","t":"CFFFPPKFIFFFFGFFFKPOCNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNOONNONNNONNNNNNNNNNNNNNNNNNNNNMNMNNNNNNNNNNNNNOMNNNOOOOONNNNNNNNOMNNNCOOOOONNNNNOONNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNKFFFMNNNNNNNNNNNONNNNNNNNONNNNNNNNNNNFKFNNNNNNONNNNNOMNONNNNNNN","n":["uav","EchoTask","MathTask","MockTask","Running","Skipping","Task","TaskEntry","TaskHandle","TaskManager","TaskMetadata","TaskResult","TaskState","TaskStatus","TaskSubscription","TestQuadRuntime","UAV","UAVRuntime","Waiting","ack","act","add_task","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","clone","clone","clone","clone_into","clone_into","clone_into","data","data","default","default","echo_topics","eq","eq","eq","execution_time","fmt","fmt","fmt","from","from","from","from","from","from","from","from","from","from","from","from","from","from","generate_latest_query","get_task","get_task_entry","get_task_mut","get_tasks","get_tasks","inital_state","inital_state","into","into","into","into","into","into","into","into","into","into","into","into","last_run","metadata","metadata","metadata","metadata","metadata","name","name","name","name","new","new","new","new","new","new","new","new","refresh_rate","run","run","run","run","sense","state","status","subscriptions","task","tasks","tick","tick","to_owned","to_owned","to_owned","topic_a","topic_b","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","with_ack","with_refresh_rate","with_refresh_rate_hz","with_subscription","with_subscriptions","ActHardware","ActHardwareInputs","ActHardwareOutput","MockActHardware","act","act","borrow","borrow","borrow","borrow_mut","borrow_mut","borrow_mut","clone","clone","clone_into","clone_into","debug_messages","fmt","fmt","from","from","from","into","into","into","motor_messages","to_owned","to_owned","try_from","try_from","try_from","try_into","try_into","try_into","type_id","type_id","type_id","MockSenseHardware","SenseHardware","SenseHardwareOutputs","borrow","borrow","borrow_mut","borrow_mut","clone","clone_into","debug_messages","fmt","from","from","into","into","nav_messages","sense","sense","telemetry_messages","to_owned","try_from","try_from","try_into","try_into","type_id","type_id"],"q":[[0,"lil_quad"],[1,"lil_quad::uav"],[175,"lil_quad::uav::act"],[212,"lil_quad::uav::sense"],[238,"core::fmt"],[239,"core::fmt"],[240,"alloc::vec"],[241,"lil_broker::database::query::get_latest"],[242,"core::option"],[243,"lil_broker::database"],[244,"lil_broker::types::timestamp"],[245,"lil_broker::datapoint"],[246,"alloc::collections::btree::map"],[247,"anyhow"],[248,"core::result"],[249,"core::any"]],"d":["","","MathTask - Performs basic operations based on given inputs …","Mock implementation of the Task trait Inputs:","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","","","","","","","","","","","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","Mock implementation of the ActHardware trait Inputs:","","","","","","","","","","","","","","","","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","","","","","","","","","","","","","Mock implementation of the SenseHardware trait Outputs:","","","","","","","","","","","Returns the argument unchanged.","Returns the argument unchanged.","Calls U::from(self).","Calls U::from(self).","","","","","","","","","","",""],"i":[0,0,0,0,4,4,0,0,0,0,0,0,0,0,0,0,0,0,4,6,0,1,7,16,1,21,22,28,23,18,24,4,5,6,7,16,1,21,22,28,23,18,24,4,5,6,4,5,6,4,5,6,1,28,7,5,21,4,5,6,28,4,5,6,7,16,1,21,22,28,23,18,24,4,5,6,6,6,6,1,1,1,17,18,17,18,7,16,1,21,22,28,23,18,24,4,5,6,7,20,21,22,23,16,7,16,5,6,7,16,1,21,22,24,5,6,5,20,21,22,23,0,16,7,5,16,1,1,24,4,5,6,22,22,7,16,1,21,22,28,23,18,24,4,5,6,7,16,1,21,22,28,23,18,24,4,5,6,7,16,1,21,22,28,23,18,24,4,5,6,6,5,5,5,5,0,0,0,0,33,36,36,34,35,36,34,35,34,35,34,35,35,34,35,36,34,35,36,34,35,34,34,35,36,34,35,36,34,35,36,34,35,0,0,0,39,37,39,37,37,37,37,37,39,37,39,37,37,38,39,37,37,39,37,39,37,39,37],"f":"`````````````````````{{bd}f}{ce{}{}}00000000000000000000000{hh}{jj}{ll}{{ce}f{}{}}00``{{}n}{{}j}`{{hh}A`}{{jj}A`}{{ll}A`}`{{hAb}Ad}{{jAb}Ad}{{lAb}Ad}{cc{}}00000000000{Afl}{Ahl}{{{Aj{l}}}Al}{{bAf}{{An{d}}}}{{bAf}{{An{B`}}}}1{Bb{{Aj{d}}}}{Bd{{Aj{d}}}}{{BbBf}f}{{BdBf}f}{ce{}{}}00000000000`{Bhj}{Bjj}{Blj}{Bnj}`````{Ahn}{dB`}{{}b}{{{Aj{Ah}}}Bj}{{ll}Bl}{BbC`}{Ahj}{Ahl}`{{BhCb{Cf{AhCd}}}{{Cl{ChCj}}}}{{BjCb{Cf{AhCd}}}{{Cl{ChCj}}}}{{BlCb{Cf{AhCd}}}{{Cl{ChCj}}}}{{BnCb{Cf{AhCd}}}{{Cl{ChCj}}}}``````{{bCb}{{Cl{fCj}}}}{{C`Cb}{{Cl{fCj}}}}{ce{}{}}00``{c{{Cl{e}}}{}{}}00000000000000000000000{cCn{}}00000000000{{lA`}l}{{jCb}j}{{jD`}j}{{jl}j}{{j{Aj{l}}}j}````{{DbCbDd}{{Cl{DfCj}}}}{{DhCbDd}{{Cl{DfCj}}}}999999{DdDd}{DfDf}{{ce}f{}{}}0`{{DdAb}Ad}{{DfAb}Ad}{cc{}}00???`??>>>>>>===```????{DjDj}4`{{DjAb}Ad}22{ce{}{}}0`{Dl{{Cl{DjCj}}}}{Dn{{Cl{DjCj}}}}`2{c{{Cl{e}}}{}{}}000{cCn{}}0","c":[],"p":[[5,"TaskManager",1],[8,"TaskHandle",1],[1,"unit"],[6,"TaskStatus",1],[5,"TaskMetadata",1],[5,"TaskSubscription",1],[5,"TaskState",1],[1,"bool"],[5,"Formatter",238],[8,"Result",238],[1,"str"],[5,"String",239],[5,"Vec",240],[5,"GetLatestQuery",241],[6,"Option",242],[5,"TaskEntry",1],[10,"UAVRuntime",1],[5,"TestQuadRuntime",1],[5,"Database",243],[10,"Task",1],[5,"EchoTask",1],[5,"MathTask",1],[5,"MockTask",1],[5,"UAV",1],[5,"Timestamp",244],[5,"DataPoint",245],[5,"BTreeMap",246],[5,"TaskResult",1],[5,"Error",247],[6,"Result",248],[5,"TypeId",249],[1,"f32"],[10,"ActHardware",175],[5,"ActHardwareInputs",175],[5,"ActHardwareOutput",175],[5,"MockActHardware",175],[5,"SenseHardwareOutputs",212],[10,"SenseHardware",212],[5,"MockSenseHardware",212]],"b":[[76,"impl-From%3C%26str%3E-for-TaskSubscription"],[77,"impl-From%3CString%3E-for-TaskSubscription"]]}],\ ["lil_sym",{"doc":"","t":"H","n":["main"],"q":[[0,"lil_sym"]],"d":[""],"i":[0],"f":"{{}b}","c":[],"p":[[1,"unit"]],"b":[]}],\ @@ -22,19 +26,19 @@ var searchIndex = new Map(JSON.parse('[\ ["once_cell",{"doc":"Overview","t":"CCCFFFFNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNFFNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNFFNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNN","n":["race","sync","unsync","OnceBool","OnceBox","OnceNonZeroUsize","OnceRef","borrow","borrow","borrow","borrow","borrow_mut","borrow_mut","borrow_mut","borrow_mut","default","default","default","default","drop","fmt","fmt","fmt","fmt","from","from","from","from","get","get","get","get","get_or_init","get_or_init","get_or_init","get_or_init","get_or_try_init","get_or_try_init","get_or_try_init","get_or_try_init","into","into","into","into","new","new","new","new","set","set","set","set","try_from","try_from","try_from","try_from","try_into","try_into","try_into","try_into","type_id","type_id","type_id","type_id","Lazy","OnceCell","borrow","borrow","borrow_mut","borrow_mut","clone","clone_from","clone_into","default","default","deref","deref_mut","eq","fmt","fmt","force","force_mut","from","from","from","from","get","get","get_mut","get_mut","get_or_init","get_or_try_init","get_unchecked","into","into","into_inner","into_value","new","new","set","take","to_owned","try_from","try_from","try_insert","try_into","try_into","type_id","type_id","wait","with_value","Lazy","OnceCell","borrow","borrow","borrow_mut","borrow_mut","clone","clone_from","clone_into","default","default","deref","deref_mut","eq","fmt","fmt","force","force_mut","from","from","from","from","get","get","get_mut","get_mut","get_or_init","get_or_try_init","into","into","into_inner","into_value","new","new","set","take","to_owned","try_from","try_from","try_insert","try_into","try_into","type_id","type_id","with_value"],"q":[[0,"once_cell"],[3,"once_cell::race"],[64,"once_cell::sync"],[111,"once_cell::unsync"],[156,"core::fmt"],[157,"core::fmt"],[158,"core::num::nonzero"],[159,"core::ops::function"],[160,"alloc::boxed"],[161,"core::result"],[162,"core::any"],[163,"core::clone"],[164,"core::default"],[165,"core::cmp"],[166,"core::fmt"]],"d":["Thread-safe, non-blocking, “first one wins” flavor of …","Thread-safe, blocking version of OnceCell.","Single-threaded version of OnceCell.","A thread-safe cell which can be written to only once.","A thread-safe cell which can be written to only once.","A thread-safe cell which can be written to only once.","A thread-safe cell which can be written to only once.","","","","","","","","","","","","","","","","","","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Gets a reference to the underlying value.","Gets a reference to the underlying value.","Gets the underlying value.","Gets the underlying value.","Gets the contents of the cell, initializing it with f if …","Gets the contents of the cell, initializing it with f if …","Gets the contents of the cell, initializing it with f if …","Gets the contents of the cell, initializing it with f if …","Gets the contents of the cell, initializing it with f if …","Gets the contents of the cell, initializing it with f if …","Gets the contents of the cell, initializing it with f if …","Gets the contents of the cell, initializing it with f if …","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Creates a new empty cell.","Creates a new empty cell.","Creates a new empty cell.","Creates a new empty cell.","Sets the contents of this cell to value.","Sets the contents of this cell to value.","Sets the contents of this cell to value.","Sets the contents of this cell to value.","","","","","","","","","","","","","A value which is initialized on the first access.","A thread-safe cell which can be written to only once.","","","","","","","","","Creates a new lazy value using Default as the initializing …","","","","","","Forces the evaluation of this lazy value and returns a …","Forces the evaluation of this lazy value and returns a …","","Returns the argument unchanged.","","Returns the argument unchanged.","Gets the reference to the underlying value.","Gets the reference to the result of this lazy value if it …","Gets the mutable reference to the underlying value.","Gets the reference to the result of this lazy value if it …","Gets the contents of the cell, initializing it with f if …","Gets the contents of the cell, initializing it with f if …","Get the reference to the underlying value, without …","Calls U::from(self).","Calls U::from(self).","Consumes the OnceCell, returning the wrapped value. Returns","Consumes this Lazy returning the stored value.","Creates a new empty cell.","Creates a new lazy value with the given initializing …","Sets the contents of this cell to value.","Takes the value out of this OnceCell, moving it back to an …","","","","Like set, but also returns a reference to the final cell …","","","","","Gets the reference to the underlying value, blocking the …","Creates a new initialized cell.","A value which is initialized on the first access.","A cell which can be written to only once. It is not thread …","","","","","","","","","Creates a new lazy value using Default as the initializing …","","","","","","Forces the evaluation of this lazy value and returns a …","Forces the evaluation of this lazy value and returns a …","","","Returns the argument unchanged.","Returns the argument unchanged.","Gets a reference to the underlying value.","Gets the reference to the result of this lazy value if it …","Gets a mutable reference to the underlying value.","Gets the mutable reference to the result of this lazy …","Gets the contents of the cell, initializing it with f if …","Gets the contents of the cell, initializing it with f if …","Calls U::from(self).","Calls U::from(self).","Consumes the OnceCell, returning the wrapped value.","Consumes this Lazy returning the stored value.","Creates a new empty cell.","Creates a new lazy value with the given initializing …","Sets the contents of this cell to value.","Takes the value out of this OnceCell, moving it back to an …","","","","Like set, but also returns a reference to the final cell …","","","","","Creates a new initialized cell."],"i":[0,0,0,0,0,0,0,1,2,3,4,1,2,3,4,1,2,3,4,2,1,2,3,4,1,2,3,4,1,2,3,4,1,2,3,4,1,2,3,4,1,2,3,4,1,2,3,4,1,2,3,4,1,2,3,4,1,2,3,4,1,2,3,4,0,0,16,18,16,18,16,16,16,16,18,18,18,16,16,18,18,18,16,16,16,18,16,18,16,18,16,16,16,16,18,16,18,16,18,16,16,16,16,18,16,16,18,16,18,16,16,0,0,24,25,24,25,24,24,24,24,25,25,25,24,24,25,25,25,24,24,24,25,24,25,24,25,24,24,24,25,24,25,24,25,24,24,24,24,25,24,24,25,24,25,24],"f":"```````{ce{}{}}0000000{{}{{b{c}}}{}}{{}{{d{c}}}{}}{{}f}{{}h}{{{d{c}}}j{}}{{{b{c}}l}n{}}{{{d{c}}l}n{}}{{fl}n}{{hl}n}{cc{}}000{{{b{c}}}{{A`{c}}}{}}{{{d{c}}}{{A`{c}}}{}}{f{{A`{Ab}}}}{h{{A`{Ad}}}}{{{b{c}}e}c{}{{Ah{}{{Af{c}}}}}}{{{d{c}}e}c{}{{Ah{}{{Af{{Aj{c}}}}}}}}{{fc}Ab{{Ah{}{{Af{Ab}}}}}}{{hc}Ad{{Ah{}{{Af{Ad}}}}}}{{{b{c}}g}{{Al{ce}}}{}{}{{Ah{}{{Af{{Al{ce}}}}}}}}{{{d{c}}g}{{Al{ce}}}{}{}{{Ah{}{{Af{{Al{{Aj{c}}e}}}}}}}}{{fe}{{Al{Abc}}}{}{{Ah{}{{Af{{Al{Abc}}}}}}}}{{he}{{Al{Adc}}}{}{{Ah{}{{Af{{Al{Adc}}}}}}}}{ce{}{}}000{{}{{b{c}}}{}}{{}{{d{c}}}{}}{{}f}{{}h}{{{b{c}}c}{{Al{jj}}}{}}{{{d{c}}{Aj{c}}}{{Al{j{Aj{c}}}}}{}}{{fAb}{{Al{jj}}}}{{hAd}{{Al{jj}}}}{c{{Al{e}}}{}{}}0000000{cAn{}}000``::::{{{B`{c}}}{{B`{c}}}Bb}{{{B`{c}}{B`{c}}}jBb}{{ce}j{}{}}{{}{{B`{c}}}{}}{{}{{Bd{c}}}Bf}{{{Bd{ce}}}c{}{{Ah{}{{Af{c}}}}}}0{{{B`{c}}{B`{c}}}AdBh}{{{B`{c}}l}nBj}{{{Bd{ce}}l}nBj{}}33{Blc{}}{cc{}}{c{{B`{c}}}{}}1{{{B`{c}}}{{A`{c}}}{}}{{{Bd{ce}}}{{A`{c}}}{}{{Ah{}{{Af{c}}}}}}10{{{B`{c}}e}c{}{{Ah{}{{Af{c}}}}}}{{{B`{c}}g}{{Al{ce}}}{}{}{{Ah{}{{Af{{Al{ce}}}}}}}}{{{B`{c}}}c{}}{ce{}{}}05{{{Bd{ce}}}{{Al{ce}}}{}{}}?{c{{Bd{ec}}}{}{}}{{{B`{c}}c}{{Al{jc}}}{}}83{c{{Al{e}}}{}{}}0{{{B`{c}}c}{{Al{c{Bn{cc}}}}}{}}11{cAn{}}07<``6666{{{C`{c}}}{{C`{c}}}Bb}{{{C`{c}}{C`{c}}}jBb}{{ce}j{}{}}{{}{{C`{c}}}{}}{{}{{Cb{c}}}Bf}{{{Cb{ce}}}c{}{{Ah{}{{Af{c}}}}}}0{{{C`{c}}{C`{c}}}AdBh}{{{C`{c}}l}nBj}{{{Cb{ce}}l}nBj{}}33{c{{C`{c}}}{}}{Blc{}}{cc{}}0{{{C`{c}}}{{A`{c}}}{}}{{{Cb{ce}}}{{A`{c}}}{}{{Ah{}{{Af{c}}}}}}10{{{C`{c}}e}c{}{{Ah{}{{Af{c}}}}}}{{{C`{c}}g}{{Al{ce}}}{}{}{{Ah{}{{Af{{Al{ce}}}}}}}}{ce{}{}}04{{{Cb{ce}}}{{Al{ce}}}{}{}}>{c{{Cb{ec}}}{}{}}{{{C`{c}}c}{{Al{jc}}}{}}73{c{{Al{e}}}{}{}}0{{{C`{c}}c}{{Al{c{Bn{cc}}}}}{}}11{cAn{}}0=","c":[],"p":[[5,"OnceRef",3],[5,"OnceBox",3],[5,"OnceNonZeroUsize",3],[5,"OnceBool",3],[1,"unit"],[5,"Formatter",156],[8,"Result",156],[6,"Option",157],[8,"NonZeroUsize",158],[1,"bool"],[17,"Output"],[10,"FnOnce",159],[5,"Box",160],[6,"Result",161],[5,"TypeId",162],[5,"OnceCell",64],[10,"Clone",163],[5,"Lazy",64],[10,"Default",164],[10,"PartialEq",165],[10,"Debug",156],[1,"never"],[1,"tuple"],[5,"OnceCell",111],[5,"Lazy",111]],"b":[]}],\ ["pin_project_lite",{"doc":"A lightweight version of pin-project written with …","t":"Q","n":["pin_project"],"q":[[0,"pin_project_lite"]],"d":["A macro that creates a projection type covering all the …"],"i":[0],"f":"`","c":[],"p":[],"b":[]}],\ ["pretty_assertions",{"doc":"Pretty Assertions","t":"FFQQQNNNNNNNNNNNNNNNNNNNN","n":["Comparison","StrComparison","assert_eq","assert_ne","assert_str_eq","borrow","borrow","borrow_mut","borrow_mut","fmt","fmt","from","from","into","into","new","new","to_string","to_string","try_from","try_from","try_into","try_into","type_id","type_id"],"q":[[0,"pretty_assertions"],[25,"core::fmt"],[26,"core::fmt"],[27,"core::convert"],[28,"alloc::string"],[29,"core::result"],[30,"core::any"]],"d":["A comparison of two values.","A comparison of two strings.","Asserts that two expressions are equal to each other …","Asserts that two expressions are not equal to each other …","Asserts that two expressions are equal to each other …","","","","","","","Returns the argument unchanged.","Returns the argument unchanged.","Calls U::from(self).","Calls U::from(self).","Store two values to be compared in future.","Store two values to be compared in future.","","","","","","","",""],"i":[0,0,0,0,0,1,6,1,6,1,6,1,6,1,6,1,6,1,6,1,6,1,6,1,6],"f":"`````{ce{}{}}000{{{b{ce}}d}f{hj}{hj}}{{{l{ce}}d}f{{A`{n}}j}{{A`{n}}j}}{cc{}}033{{ce}{{b{ce}}}jj}{{ce}{{l{ce}}}{{A`{n}}j}{{A`{n}}j}}{cAb{}}0{c{{Ad{e}}}{}{}}000{cAf{}}0","c":[],"p":[[5,"Comparison",0],[5,"Formatter",25],[8,"Result",25],[10,"Debug",25],[10,"Sized",26],[5,"StrComparison",0],[1,"str"],[10,"AsRef",27],[5,"String",28],[6,"Result",29],[5,"TypeId",30]],"b":[]}],\ -["proc_macro2",{"doc":"github crates-io docs-rs","t":"PPPGFPFPPFFPPPFPGFFGNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNCNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNCNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNFNNNNNNNNNNNNNNFENNNNNNNNNNNNNN","n":["Alone","Brace","Bracket","Delimiter","Group","Group","Ident","Ident","Joint","LexError","Literal","Literal","None","Parenthesis","Punct","Punct","Spacing","Span","TokenStream","TokenTree","as_char","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","byte_character","byte_string","c_string","call_site","character","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","cmp","default","delim_span","delimiter","eq","eq","eq","eq","extend","extend","extra","f32_suffixed","f32_unsuffixed","f64_suffixed","f64_unsuffixed","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from_iter","from_iter","from_str","from_str","hash","i128_suffixed","i128_unsuffixed","i16_suffixed","i16_unsuffixed","i32_suffixed","i32_unsuffixed","i64_suffixed","i64_unsuffixed","i8_suffixed","i8_unsuffixed","into","into","into","into","into","into","into","into","into","into","into_iter","is_empty","isize_suffixed","isize_unsuffixed","join","located_at","mixed_site","new","new","new","new","new_raw","partial_cmp","resolved_at","set_span","set_span","set_span","set_span","set_span","source_text","spacing","span","span","span","span","span","span","span_close","span_open","stream","string","subspan","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_string","to_string","to_string","to_string","to_string","to_string","to_string","token_stream","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","u128_suffixed","u128_unsuffixed","u16_suffixed","u16_unsuffixed","u32_suffixed","u32_unsuffixed","u64_suffixed","u64_unsuffixed","u8_suffixed","u8_unsuffixed","unwrap","usize_suffixed","usize_unsuffixed","DelimSpan","borrow","borrow_mut","clone","clone_into","close","fmt","from","into","join","open","to_owned","try_from","try_into","type_id","IntoIter","TokenStream","borrow","borrow_mut","clone","clone_into","fmt","from","into","into_iter","next","size_hint","to_owned","try_from","try_into","type_id"],"q":[[0,"proc_macro2"],[230,"proc_macro2::extra"],[245,"proc_macro2::token_stream"],[261,"core::ffi::c_str"],[262,"core::cmp"],[263,"core::marker"],[264,"core::convert"],[265,"core::iter::traits::collect"],[266,"core::fmt"],[267,"core::fmt"],[268,"proc_macro"],[269,"core::hash"],[270,"core::option"],[271,"alloc::string"],[272,"core::ops::range"],[273,"core::any"]],"d":["E.g. + is Alone in + =, +ident or +().","{ ... }","[ ... ]","Describes how a sequence of token trees is delimited.","A delimited token stream.","A token stream surrounded by bracket delimiters.","A word of Rust code, which may be a keyword or legal …","An identifier.","E.g. + is Joint in += or ' is Joint in '#.","Error returned from TokenStream::from_str.","A literal string ("hello"), byte string (b"hello"), …","A literal character ('a'), string ("hello"), number (2.3), …","∅ ... ∅","( ... )","A Punct is a single punctuation character like +, - or #.","A single punctuation character (+, ,, $, etc.).","Whether a Punct is followed immediately by another Punct …","A region of source code, along with macro expansion …","An abstract stream of tokens, or more concretely a …","A single token or a delimited sequence of token trees …","Returns the value of this punctuation character as char.","","","","","","","","","","","","","","","","","","","","","Byte character literal.","Byte string literal.","C string literal.","The span of the invocation of the current procedural macro.","Character literal.","","","","","","","","","","","","","","","","","","","","","Returns an object that holds this group’s span_open() and","Returns the punctuation used as the delimiter for this …","","","","","","","Items which do not have a correspondence to any API in the …","Creates a new suffixed floating-point literal.","Creates a new unsuffixed floating-point literal.","Creates a new suffixed floating-point literal.","Creates a new unsuffixed floating-point literal.","","","","","","","","","","","","","","","","","","Returns the argument unchanged.","Returns the argument unchanged.","","","","Returns the argument unchanged.","","","","Returns the argument unchanged.","","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","","","","","","Creates a new suffixed integer literal with the specified …","Creates a new unsuffixed integer literal with the …","Creates a new suffixed integer literal with the specified …","Creates a new unsuffixed integer literal with the …","Creates a new suffixed integer literal with the specified …","Creates a new unsuffixed integer literal with the …","Creates a new suffixed integer literal with the specified …","Creates a new unsuffixed integer literal with the …","Creates a new suffixed integer literal with the specified …","Creates a new unsuffixed integer literal with the …","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","","Checks if this TokenStream is empty.","Creates a new suffixed integer literal with the specified …","Creates a new unsuffixed integer literal with the …","Create a new span encompassing self and other.","Creates a new span with the same name resolution behavior …","The span located at the invocation of the procedural …","Returns an empty TokenStream containing no token trees.","Creates a new Group with the given delimiter and token …","Creates a new Punct from the given character and spacing.","Creates a new Ident with the given string as well as the …","Same as Ident::new, but creates a raw identifier (r#ident…","","Creates a new span with the same line/column information …","Configures the span for only this token.","Configures the span for this Group’s delimiters, but not …","Configure the span for this punctuation character.","Configures the span of this Ident, possibly changing its …","Configures the span associated for this literal.","Returns the source text behind a span. This preserves the …","Returns the spacing of this punctuation character, …","","Returns the span of this tree, delegating to the span …","Returns the span for the delimiters of this token stream, …","Returns the span for this punctuation character.","Returns the span of this Ident.","Returns the span encompassing this literal.","Returns the span pointing to the closing delimiter of this …","Returns the span pointing to the opening delimiter of this …","Returns the TokenStream of tokens that are delimited in …","String literal.","Returns a Span that is a subset of self.span() containing …","","","","","","","","","","","","","","","","","Public implementation details for the TokenStream type, …","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","Creates a new suffixed integer literal with the specified …","Creates a new unsuffixed integer literal with the …","Creates a new suffixed integer literal with the specified …","Creates a new unsuffixed integer literal with the …","Creates a new suffixed integer literal with the specified …","Creates a new unsuffixed integer literal with the …","Creates a new suffixed integer literal with the specified …","Creates a new unsuffixed integer literal with the …","Creates a new suffixed integer literal with the specified …","Creates a new unsuffixed integer literal with the …","Convert proc_macro2::Span to proc_macro::Span.","Creates a new suffixed integer literal with the specified …","Creates a new unsuffixed integer literal with the …","An object that holds a Group’s span_open() and …","","","","","Returns a span for the closing punctuation of the group …","","Returns the argument unchanged.","Calls U::from(self).","Returns a span covering the entire delimited group.","Returns a span for the opening punctuation of the group …","","","","","An iterator over TokenStream’s TokenTrees.","","","","","","","Returns the argument unchanged.","Calls U::from(self).","","","","","","",""],"i":[12,11,11,0,0,9,0,9,12,0,0,9,11,11,0,9,0,0,0,0,1,25,8,7,9,10,11,1,12,13,4,25,8,7,9,10,11,1,12,13,4,4,4,4,7,4,8,7,9,10,11,1,12,13,4,8,7,9,10,11,1,12,13,4,13,8,10,10,11,12,13,13,8,8,0,4,4,4,4,25,25,8,8,7,9,9,10,10,11,1,1,12,13,13,4,4,25,8,8,8,7,7,9,9,9,9,9,10,11,1,12,13,4,8,8,8,4,13,4,4,4,4,4,4,4,4,4,4,25,8,7,9,10,11,1,12,13,4,8,8,4,4,7,7,7,8,10,1,13,13,13,7,9,10,1,13,4,7,1,25,9,10,1,13,4,10,10,10,4,4,8,7,9,10,11,1,12,13,4,25,8,9,10,1,13,4,0,25,8,7,9,10,11,1,12,13,4,25,8,7,9,10,11,1,12,13,4,25,8,7,9,10,11,1,12,13,4,4,4,4,4,4,4,4,4,4,4,7,4,4,0,16,16,16,16,16,16,16,16,16,16,16,16,16,16,0,0,37,37,37,37,37,37,37,37,37,37,37,37,37,37],"f":"````````````````````{bd}{ce{}{}}0000000000000000000{fh}{{{j{f}}}h}{lh}{{}n}{dh}{A`A`}{nn}{AbAb}{AdAd}{AfAf}{bb}{AhAh}{AjAj}{hh}{{ce}Al{}{}}00000000{{AjAj}An}{{}A`}{AdB`}{AdAf}{{AfAf}Bb}{{AhAh}Bb}{{AjAj}Bb}{{Ajc}Bb{Bd{Bh{Bf}}}}{{A`c}Al{{Bl{}{{Bj{A`}}}}}}{{A`c}Al{{Bl{}{{Bj{Ab}}}}}}`{Bnh}0{C`h}0{{CbCd}Cf}0{{A`Cd}Cf}0{{nCd}Cf}{{AbCd}Cf}0{{AdCd}Cf}0{{AfCd}Cf}{{bCd}Cf}0{{AhCd}Cf}{{AjCd}Cf}0{{hCd}Cf}0{cc{}}0{AbA`}{ChA`}{Cjn}3{bAb}{hAb}{AdAb}6{AjAb}777777{cA`{{Bl{}{{Bj{A`}}}}}}{cA`{{Bl{}{{Bj{Ab}}}}}}{Bf{{Cl{A`Cb}}}}{Bf{{Cl{hCb}}}}{{Ajc}AlCn}{D`h}0{Dbh}0{Ddh}0{Dfh}0{Dhh}0{ce{}{}}000000000{A`Dj}{A`Bb}{Dlh}0{{nn}{{Dn{n}}}}{{nn}n}{{}n}{{}A`}{{AfA`}Ad}{{dAh}b}{{Bfn}Aj}0{{AjAj}{{Dn{An}}}}6{{Abn}Al}{{Adn}Al}{{bn}Al}{{Ajn}Al}{{hn}Al}{n{{Dn{E`}}}}{bAh}{Cbn}{Abn}{Adn}{bn}{Ajn}{hn}33{AdA`}{Bfh}{{hc}{{Dn{n}}}{{Ed{Eb}}}}{ce{}{}}00000000{cE`{}}000000`{c{{Cl{e}}}{}{}}0000000000000000000{cEf{}}000000000{Ehh}0{Ejh}0{Elh}0{Enh}0{fh}0{nCj}{Ebh}0`::{B`B`}{{ce}Al{}{}}{B`n}{{B`Cd}Cf}{cc{}}?22?==<``??{DjDj}4{{DjCd}Cf}2{ce{}{}}0{Dj{{Dn{Ab}}}}{Dj{{F`{Eb{Dn{Eb}}}}}}2{c{{Cl{e}}}{}{}}0{cEf{}}","c":[],"p":[[5,"Punct",0],[1,"char"],[1,"u8"],[5,"Literal",0],[1,"slice"],[5,"CStr",261],[5,"Span",0],[5,"TokenStream",0],[6,"TokenTree",0],[5,"Group",0],[6,"Delimiter",0],[6,"Spacing",0],[5,"Ident",0],[1,"unit"],[6,"Ordering",262],[5,"DelimSpan",230],[1,"bool"],[10,"Sized",263],[1,"str"],[10,"AsRef",264],[17,"Item"],[10,"IntoIterator",265],[1,"f32"],[1,"f64"],[5,"LexError",0],[5,"Formatter",266],[8,"Result",266],[5,"TokenStream",267],[5,"Span",267],[6,"Result",268],[10,"Hasher",269],[1,"i128"],[1,"i16"],[1,"i32"],[1,"i64"],[1,"i8"],[5,"IntoIter",245],[1,"isize"],[6,"Option",270],[5,"String",271],[1,"usize"],[10,"RangeBounds",272],[5,"TypeId",273],[1,"u128"],[1,"u16"],[1,"u32"],[1,"u64"],[1,"tuple"]],"b":[[70,"impl-PartialEq-for-Ident"],[71,"impl-PartialEq%3CT%3E-for-Ident"],[72,"impl-Extend%3CTokenStream%3E-for-TokenStream"],[73,"impl-Extend%3CTokenTree%3E-for-TokenStream"],[79,"impl-Display-for-LexError"],[80,"impl-Debug-for-LexError"],[81,"impl-Display-for-TokenStream"],[82,"impl-Debug-for-TokenStream"],[84,"impl-Display-for-TokenTree"],[85,"impl-Debug-for-TokenTree"],[86,"impl-Debug-for-Group"],[87,"impl-Display-for-Group"],[89,"impl-Display-for-Punct"],[90,"impl-Debug-for-Punct"],[92,"impl-Display-for-Ident"],[93,"impl-Debug-for-Ident"],[94,"impl-Debug-for-Literal"],[95,"impl-Display-for-Literal"],[98,"impl-From%3CTokenTree%3E-for-TokenStream"],[99,"impl-From%3CTokenStream%3E-for-TokenStream"],[102,"impl-From%3CPunct%3E-for-TokenTree"],[103,"impl-From%3CLiteral%3E-for-TokenTree"],[104,"impl-From%3CGroup%3E-for-TokenTree"],[106,"impl-From%3CIdent%3E-for-TokenTree"],[113,"impl-FromIterator%3CTokenStream%3E-for-TokenStream"],[114,"impl-FromIterator%3CTokenTree%3E-for-TokenStream"]]}],\ +["proc_macro2",{"doc":"github crates-io docs-rs","t":"PPPGFPFPPFFPPPFPGFFGNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNCNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNCNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNFNNNNNNNNNNNNNNFENNNNNNNNNNNNNN","n":["Alone","Brace","Bracket","Delimiter","Group","Group","Ident","Ident","Joint","LexError","Literal","Literal","None","Parenthesis","Punct","Punct","Spacing","Span","TokenStream","TokenTree","as_char","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","byte_character","byte_string","c_string","call_site","character","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","cmp","default","delim_span","delimiter","eq","eq","eq","eq","extend","extend","extra","f32_suffixed","f32_unsuffixed","f64_suffixed","f64_unsuffixed","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from_iter","from_iter","from_str","from_str","hash","i128_suffixed","i128_unsuffixed","i16_suffixed","i16_unsuffixed","i32_suffixed","i32_unsuffixed","i64_suffixed","i64_unsuffixed","i8_suffixed","i8_unsuffixed","into","into","into","into","into","into","into","into","into","into","into_iter","is_empty","isize_suffixed","isize_unsuffixed","join","located_at","mixed_site","new","new","new","new","new_raw","partial_cmp","resolved_at","set_span","set_span","set_span","set_span","set_span","source_text","spacing","span","span","span","span","span","span","span_close","span_open","stream","string","subspan","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_string","to_string","to_string","to_string","to_string","to_string","to_string","token_stream","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","u128_suffixed","u128_unsuffixed","u16_suffixed","u16_unsuffixed","u32_suffixed","u32_unsuffixed","u64_suffixed","u64_unsuffixed","u8_suffixed","u8_unsuffixed","unwrap","usize_suffixed","usize_unsuffixed","DelimSpan","borrow","borrow_mut","clone","clone_into","close","fmt","from","into","join","open","to_owned","try_from","try_into","type_id","IntoIter","TokenStream","borrow","borrow_mut","clone","clone_into","fmt","from","into","into_iter","next","size_hint","to_owned","try_from","try_into","type_id"],"q":[[0,"proc_macro2"],[230,"proc_macro2::extra"],[245,"proc_macro2::token_stream"],[261,"core::ffi::c_str"],[262,"core::cmp"],[263,"core::marker"],[264,"core::convert"],[265,"core::iter::traits::collect"],[266,"core::fmt"],[267,"core::fmt"],[268,"proc_macro"],[269,"core::hash"],[270,"core::option"],[271,"alloc::string"],[272,"core::ops::range"],[273,"core::any"]],"d":["E.g. + is Alone in + =, +ident or +().","{ ... }","[ ... ]","Describes how a sequence of token trees is delimited.","A delimited token stream.","A token stream surrounded by bracket delimiters.","A word of Rust code, which may be a keyword or legal …","An identifier.","E.g. + is Joint in += or ' is Joint in '#.","Error returned from TokenStream::from_str.","A literal string ("hello"), byte string (b"hello"), …","A literal character ('a'), string ("hello"), number (2.3), …","∅ ... ∅","( ... )","A Punct is a single punctuation character like +, - or #.","A single punctuation character (+, ,, $, etc.).","Whether a Punct is followed immediately by another Punct …","A region of source code, along with macro expansion …","An abstract stream of tokens, or more concretely a …","A single token or a delimited sequence of token trees …","Returns the value of this punctuation character as char.","","","","","","","","","","","","","","","","","","","","","Byte character literal.","Byte string literal.","C string literal.","The span of the invocation of the current procedural macro.","Character literal.","","","","","","","","","","","","","","","","","","","","","Returns an object that holds this group’s span_open() and","Returns the punctuation used as the delimiter for this …","","","","","","","Items which do not have a correspondence to any API in the …","Creates a new suffixed floating-point literal.","Creates a new unsuffixed floating-point literal.","Creates a new suffixed floating-point literal.","Creates a new unsuffixed floating-point literal.","","","","","","","","","","","","","","","","","","Returns the argument unchanged.","","","Returns the argument unchanged.","Returns the argument unchanged.","","","","Returns the argument unchanged.","","","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","","","","","","Creates a new suffixed integer literal with the specified …","Creates a new unsuffixed integer literal with the …","Creates a new suffixed integer literal with the specified …","Creates a new unsuffixed integer literal with the …","Creates a new suffixed integer literal with the specified …","Creates a new unsuffixed integer literal with the …","Creates a new suffixed integer literal with the specified …","Creates a new unsuffixed integer literal with the …","Creates a new suffixed integer literal with the specified …","Creates a new unsuffixed integer literal with the …","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","","Checks if this TokenStream is empty.","Creates a new suffixed integer literal with the specified …","Creates a new unsuffixed integer literal with the …","Create a new span encompassing self and other.","Creates a new span with the same name resolution behavior …","The span located at the invocation of the procedural …","Returns an empty TokenStream containing no token trees.","Creates a new Group with the given delimiter and token …","Creates a new Punct from the given character and spacing.","Creates a new Ident with the given string as well as the …","Same as Ident::new, but creates a raw identifier (r#ident…","","Creates a new span with the same line/column information …","Configures the span for only this token.","Configures the span for this Group’s delimiters, but not …","Configure the span for this punctuation character.","Configures the span of this Ident, possibly changing its …","Configures the span associated for this literal.","Returns the source text behind a span. This preserves the …","Returns the spacing of this punctuation character, …","","Returns the span of this tree, delegating to the span …","Returns the span for the delimiters of this token stream, …","Returns the span for this punctuation character.","Returns the span of this Ident.","Returns the span encompassing this literal.","Returns the span pointing to the closing delimiter of this …","Returns the span pointing to the opening delimiter of this …","Returns the TokenStream of tokens that are delimited in …","String literal.","Returns a Span that is a subset of self.span() containing …","","","","","","","","","","","","","","","","","Public implementation details for the TokenStream type, …","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","Creates a new suffixed integer literal with the specified …","Creates a new unsuffixed integer literal with the …","Creates a new suffixed integer literal with the specified …","Creates a new unsuffixed integer literal with the …","Creates a new suffixed integer literal with the specified …","Creates a new unsuffixed integer literal with the …","Creates a new suffixed integer literal with the specified …","Creates a new unsuffixed integer literal with the …","Creates a new suffixed integer literal with the specified …","Creates a new unsuffixed integer literal with the …","Convert proc_macro2::Span to proc_macro::Span.","Creates a new suffixed integer literal with the specified …","Creates a new unsuffixed integer literal with the …","An object that holds a Group’s span_open() and …","","","","","Returns a span for the closing punctuation of the group …","","Returns the argument unchanged.","Calls U::from(self).","Returns a span covering the entire delimited group.","Returns a span for the opening punctuation of the group …","","","","","An iterator over TokenStream’s TokenTrees.","","","","","","","Returns the argument unchanged.","Calls U::from(self).","","","","","","",""],"i":[12,11,11,0,0,9,0,9,12,0,0,9,11,11,0,9,0,0,0,0,1,25,8,7,9,10,11,1,12,13,4,25,8,7,9,10,11,1,12,13,4,4,4,4,7,4,8,7,9,10,11,1,12,13,4,8,7,9,10,11,1,12,13,4,13,8,10,10,11,12,13,13,8,8,0,4,4,4,4,25,25,8,8,7,9,9,10,10,11,1,1,12,13,13,4,4,25,8,8,8,7,7,9,9,9,9,9,10,11,1,12,13,4,8,8,8,4,13,4,4,4,4,4,4,4,4,4,4,25,8,7,9,10,11,1,12,13,4,8,8,4,4,7,7,7,8,10,1,13,13,13,7,9,10,1,13,4,7,1,25,9,10,1,13,4,10,10,10,4,4,8,7,9,10,11,1,12,13,4,25,8,9,10,1,13,4,0,25,8,7,9,10,11,1,12,13,4,25,8,7,9,10,11,1,12,13,4,25,8,7,9,10,11,1,12,13,4,4,4,4,4,4,4,4,4,4,4,7,4,4,0,16,16,16,16,16,16,16,16,16,16,16,16,16,16,0,0,37,37,37,37,37,37,37,37,37,37,37,37,37,37],"f":"````````````````````{bd}{ce{}{}}0000000000000000000{fh}{{{j{f}}}h}{lh}{{}n}{dh}{A`A`}{nn}{AbAb}{AdAd}{AfAf}{bb}{AhAh}{AjAj}{hh}{{ce}Al{}{}}00000000{{AjAj}An}{{}A`}{AdB`}{AdAf}{{AfAf}Bb}{{AhAh}Bb}{{AjAj}Bb}{{Ajc}Bb{Bd{Bh{Bf}}}}{{A`c}Al{{Bl{}{{Bj{A`}}}}}}{{A`c}Al{{Bl{}{{Bj{Ab}}}}}}`{Bnh}0{C`h}0{{CbCd}Cf}0{{A`Cd}Cf}0{{nCd}Cf}{{AbCd}Cf}0{{AdCd}Cf}0{{AfCd}Cf}{{bCd}Cf}0{{AhCd}Cf}{{AjCd}Cf}0{{hCd}Cf}0{cc{}}{ChA`}{AbA`}22{Cjn}{AjAb}{hAb}5{bAb}{AdAb}777777{cA`{{Bl{}{{Bj{A`}}}}}}{cA`{{Bl{}{{Bj{Ab}}}}}}{Bf{{Cl{A`Cb}}}}{Bf{{Cl{hCb}}}}{{Ajc}AlCn}{D`h}0{Dbh}0{Ddh}0{Dfh}0{Dhh}0{ce{}{}}000000000{A`Dj}{A`Bb}{Dlh}0{{nn}{{Dn{n}}}}{{nn}n}{{}n}{{}A`}{{AfA`}Ad}{{dAh}b}{{Bfn}Aj}0{{AjAj}{{Dn{An}}}}6{{Abn}Al}{{Adn}Al}{{bn}Al}{{Ajn}Al}{{hn}Al}{n{{Dn{E`}}}}{bAh}{Cbn}{Abn}{Adn}{bn}{Ajn}{hn}33{AdA`}{Bfh}{{hc}{{Dn{n}}}{{Ed{Eb}}}}{ce{}{}}00000000{cE`{}}000000`{c{{Cl{e}}}{}{}}0000000000000000000{cEf{}}000000000{Ehh}0{Ejh}0{Elh}0{Enh}0{fh}0{nCj}{Ebh}0`::{B`B`}{{ce}Al{}{}}{B`n}{{B`Cd}Cf}{cc{}}?22?==<``??{DjDj}4{{DjCd}Cf}2{ce{}{}}0{Dj{{Dn{Ab}}}}{Dj{{F`{Eb{Dn{Eb}}}}}}2{c{{Cl{e}}}{}{}}0{cEf{}}","c":[],"p":[[5,"Punct",0],[1,"char"],[1,"u8"],[5,"Literal",0],[1,"slice"],[5,"CStr",261],[5,"Span",0],[5,"TokenStream",0],[6,"TokenTree",0],[5,"Group",0],[6,"Delimiter",0],[6,"Spacing",0],[5,"Ident",0],[1,"unit"],[6,"Ordering",262],[5,"DelimSpan",230],[1,"bool"],[10,"Sized",263],[1,"str"],[10,"AsRef",264],[17,"Item"],[10,"IntoIterator",265],[1,"f32"],[1,"f64"],[5,"LexError",0],[5,"Formatter",266],[8,"Result",266],[5,"TokenStream",267],[5,"Span",267],[6,"Result",268],[10,"Hasher",269],[1,"i128"],[1,"i16"],[1,"i32"],[1,"i64"],[1,"i8"],[5,"IntoIter",245],[1,"isize"],[6,"Option",270],[5,"String",271],[1,"usize"],[10,"RangeBounds",272],[5,"TypeId",273],[1,"u128"],[1,"u16"],[1,"u32"],[1,"u64"],[1,"tuple"]],"b":[[70,"impl-PartialEq-for-Ident"],[71,"impl-PartialEq%3CT%3E-for-Ident"],[72,"impl-Extend%3CTokenStream%3E-for-TokenStream"],[73,"impl-Extend%3CTokenTree%3E-for-TokenStream"],[79,"impl-Debug-for-LexError"],[80,"impl-Display-for-LexError"],[81,"impl-Debug-for-TokenStream"],[82,"impl-Display-for-TokenStream"],[84,"impl-Debug-for-TokenTree"],[85,"impl-Display-for-TokenTree"],[86,"impl-Display-for-Group"],[87,"impl-Debug-for-Group"],[89,"impl-Display-for-Punct"],[90,"impl-Debug-for-Punct"],[92,"impl-Display-for-Ident"],[93,"impl-Debug-for-Ident"],[94,"impl-Debug-for-Literal"],[95,"impl-Display-for-Literal"],[97,"impl-From%3CTokenStream%3E-for-TokenStream"],[98,"impl-From%3CTokenTree%3E-for-TokenStream"],[102,"impl-From%3CIdent%3E-for-TokenTree"],[103,"impl-From%3CLiteral%3E-for-TokenTree"],[105,"impl-From%3CPunct%3E-for-TokenTree"],[106,"impl-From%3CGroup%3E-for-TokenTree"],[113,"impl-FromIterator%3CTokenStream%3E-for-TokenStream"],[114,"impl-FromIterator%3CTokenTree%3E-for-TokenStream"]]}],\ ["quote",{"doc":"github crates-io docs-rs","t":"KKKMMMMMQNNQQNNNNM","n":["IdentFragment","ToTokens","TokenStreamExt","append","append_all","append_separated","append_terminated","fmt","format_ident","into_token_stream","into_token_stream","quote","quote_spanned","span","span","to_token_stream","to_token_stream","to_tokens"],"q":[[0,"quote"],[18,"proc_macro2"],[19,"core::convert"],[20,"core::iter::traits::collect"],[21,"core::fmt"],[22,"core::fmt"]],"d":["Specialized formatting trait used by format_ident!.","Types that can be interpolated inside a quote! invocation.","TokenStream extension trait with methods for appending …","For use by ToTokens implementations.","For use by ToTokens implementations.","For use by ToTokens implementations.","For use by ToTokens implementations.","Format this value as an identifier fragment.","Formatting macro for constructing Idents.","Convert self directly into a TokenStream object.","Convert self directly into a TokenStream object.","The whole point.","Same as quote!, but applies a given span to all tokens …","Span associated with this IdentFragment.","Span associated with this IdentFragment.","Convert self directly into a TokenStream object.","Convert self directly into a TokenStream object.","Write self to the given TokenStream."],"i":[0,0,0,1,1,1,1,7,0,6,6,0,0,7,7,6,6,6],"f":"```{{bc}d{{h{f}}}}{{bc}dj}{{bce}djl}0{{nA`}Ab}`{lAd}0``{n{{Ah{Af}}}}011{{lAd}d}","c":[],"p":[[10,"TokenStreamExt",0],[1,"unit"],[6,"TokenTree",18],[10,"Into",19],[10,"IntoIterator",20],[10,"ToTokens",0],[10,"IdentFragment",0],[5,"Formatter",21],[8,"Result",21],[5,"TokenStream",18],[5,"Span",18],[6,"Option",22]],"b":[]}],\ -["regex",{"doc":"This crate provides routines for searching strings for …","t":"FFFFPGFFFFFFFKFFFFFFFPNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNCNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNHNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNMNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNFFFFFFFFFFFKFFFFFFFNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNMNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNN","n":["CaptureLocations","CaptureMatches","CaptureNames","Captures","CompiledTooBig","Error","Match","Matches","NoExpand","Regex","RegexBuilder","RegexSet","RegexSetBuilder","Replacer","ReplacerRef","SetMatches","SetMatchesIntoIter","SetMatchesIter","Split","SplitN","SubCaptureMatches","Syntax","as_str","as_str","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","build","build","by_ref","by_ref","bytes","capture_locations","capture_names","captures","captures_at","captures_iter","captures_len","captures_read","captures_read_at","case_insensitive","case_insensitive","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","count","count","count","count","crlf","crlf","default","description","dfa_size_limit","dfa_size_limit","dot_matches_new_line","dot_matches_new_line","empty","end","eq","eq","escape","expand","extract","find","find_at","find_iter","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from_str","get","get","ignore_whitespace","ignore_whitespace","index","index","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into_iter","into_iter","into_iter","into_iter","into_iter","into_iter","into_iter","into_iter","into_iter","into_iter","is_empty","is_empty","is_match","is_match","is_match_at","is_match_at","iter","iter","len","len","len","len","len","line_terminator","line_terminator","matched","matched_any","matches","matches_at","multi_line","multi_line","name","nest_limit","nest_limit","new","new","new","new","next","next","next","next","next","next","next","next","next_back","next_back","no_expansion","no_expansion","no_expansion","no_expansion","octal","octal","patterns","range","replace","replace_all","replace_append","replace_append","replace_append","replacen","shortest_match","shortest_match_at","size_hint","size_hint","size_hint","size_hint","size_hint","size_limit","size_limit","split","splitn","start","static_captures_len","swap_greed","swap_greed","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_string","to_string","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","unicode","unicode","CaptureLocations","CaptureMatches","CaptureNames","Captures","Match","Matches","NoExpand","Regex","RegexBuilder","RegexSet","RegexSetBuilder","Replacer","ReplacerRef","SetMatches","SetMatchesIntoIter","SetMatchesIter","Split","SplitN","SubCaptureMatches","as_bytes","as_str","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","build","build","by_ref","by_ref","capture_locations","capture_names","captures","captures_at","captures_iter","captures_len","captures_read","captures_read_at","case_insensitive","case_insensitive","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","count","count","count","count","crlf","crlf","default","dfa_size_limit","dfa_size_limit","dot_matches_new_line","dot_matches_new_line","empty","end","eq","expand","extract","find","find_at","find_iter","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from_str","get","get","ignore_whitespace","ignore_whitespace","index","index","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into_iter","into_iter","into_iter","into_iter","into_iter","into_iter","into_iter","into_iter","into_iter","into_iter","is_empty","is_empty","is_match","is_match","is_match_at","is_match_at","iter","iter","len","len","len","len","len","line_terminator","line_terminator","matched","matched_any","matches","matches_at","multi_line","multi_line","name","nest_limit","nest_limit","new","new","new","new","next","next","next","next","next","next","next","next","next_back","next_back","no_expansion","no_expansion","no_expansion","no_expansion","octal","octal","patterns","range","replace","replace_all","replace_append","replace_append","replace_append","replacen","shortest_match","shortest_match_at","size_hint","size_hint","size_hint","size_hint","size_hint","size_limit","size_limit","split","splitn","start","static_captures_len","swap_greed","swap_greed","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_string","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","unicode","unicode"],"q":[[0,"regex"],[341,"regex::bytes"],[662,"core::result"],[663,"core::option"],[664,"alloc::string"],[665,"core::fmt"],[666,"core::fmt"],[667,"core::convert"],[668,"core::iter::traits::collect"],[669,"alloc::borrow"],[670,"core::ops::range"],[671,"core::any"],[672,"alloc::vec"]],"d":["A low level representation of the byte offsets of each …","An iterator over all non-overlapping capture matches in a …","An iterator over the names of all capture groups in a …","Represents the capture groups for a single match.","The compiled program exceeded the set size limit. The …","An error that occurred during parsing or compiling a …","Represents a single match of a regex in a haystack.","An iterator over all non-overlapping matches in a haystack.","A helper type for forcing literal string replacement.","A compiled regular expression for searching Unicode …","A configurable builder for a Regex.","Match multiple, possibly overlapping, regexes in a single …","A configurable builder for a RegexSet.","A trait for types that can be used to replace matches in a …","A by-reference adaptor for a Replacer.","A set of matches returned by a regex set.","An owned iterator over the set of matches from a regex set.","A borrowed iterator over the set of matches from a regex …","An iterator over all substrings delimited by a regex match.","An iterator over at most N substrings delimited by a regex …","An iterator over all group matches in a Captures value.","A syntax error.","Returns the original string of this regex.","Returns the substring of the haystack that matched.","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","Compiles the pattern given to RegexBuilder::new with the …","Compiles the patterns given to RegexSetBuilder::new with …","Returns a type that implements Replacer, but that borrows …","Returns a type that implements Replacer, but that borrows …","Search for regex matches in &[u8] haystacks.","Returns a fresh allocated set of capture locations that can","Returns an iterator over the capture names in this regex.","This routine searches for the first match of this regex in …","Returns the same as Regex::captures, but starts the search …","Returns an iterator that yields successive non-overlapping …","Returns the number of captures groups in this regex.","This is like Regex::captures, but writes the byte offsets …","Returns the same as Regex::captures_read, but starts the …","This configures whether to enable case insensitive …","This configures whether to enable case insensitive …","","","","","","","","","","","","","","","","","","","","","","","","","","","","","This configures CRLF mode for the entire pattern.","This configures CRLF mode for all of the patterns.","","","Set the approximate capacity, in bytes, of the cache of …","Set the approximate capacity, in bytes, of the cache of …","This configures dot-matches-new-line mode for the entire …","This configures dot-matches-new-line mode for the entire …","Create a new empty regex set.","Returns the byte offset of the end of the match in the …","","","Escapes all regular expression meta characters in pattern.","Expands all instances of $ref in replacement to the …","This is a convenience routine for extracting the substrings","This routine searches for the first match of this regex in …","Returns the same as Regex::find, but starts the search at …","Returns an iterator that yields successive non-overlapping …","","","","","","Shows the original regular expression.","Shows the original regular expression.","","","","","","","","","","","","","","","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Attempts to parse a string into a regular expression","Returns the Match associated with the capture group at …","Returns the start and end byte offsets of the capture …","This configures verbose mode for the entire pattern.","This configures verbose mode for all of the patterns.","","","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","","","","","","","","","","","Returns true if and only if this match has a length of …","Returns true if this set contains no regexes.","Returns true if and only if there is a match for the regex …","Returns true if and only if one of the regexes in this set …","Returns the same as Regex::is_match, but starts the search …","Returns true if and only if one of the regexes in this set …","Returns an iterator over all capture groups. This includes …","Returns an iterator over the indices of the regexes that …","Returns the total number of capture groups. This includes …","Returns the length, in bytes, of this match.","Returns the total number of capture groups (even if they …","Returns the total number of regexes in this set.","The total number of regexes in the set that created these …","Configures the line terminator to be used by the regex.","Configures the line terminator to be used by the regex.","Whether the regex at the given index matched.","Whether this set contains any matches.","Returns the set of regexes that match in the given …","Returns the set of regexes that match in the given …","This configures multi-line mode for the entire pattern.","This configures multi-line mode for all of the patterns.","Returns the Match associated with the capture group named …","Set the nesting limit for this parser.","Set the nesting limit for this parser.","Create a new builder with a default configuration for the …","Create a new builder with a default configuration for the …","Compiles a regular expression. Once compiled, it can be …","Create a new regex set with the given regular expressions.","","","","","","","","","","","Return a fixed unchanging replacement string.","Return a fixed unchanging replacement string.","","","This configures octal mode for the entire pattern.","This configures octal mode for all of the patterns.","Returns the regex patterns that this regex set was …","Returns the range over the starting and ending byte …","Replaces the leftmost-first match in the given haystack …","Replaces all non-overlapping matches in the haystack with …","Appends possibly empty data to dst to replace the current …","","","Replaces at most limit non-overlapping matches in the …","Returns the end byte offset of the first match in the …","Returns the same as Regex::shortest_match, but starts the …","","","","","","Sets the approximate size limit, in bytes, of the compiled …","Sets the approximate size limit, in bytes, of the compiled …","Returns an iterator of substrings of the haystack given, …","Returns an iterator of at most limit substrings of the …","Returns the byte offset of the start of the match in the …","Returns the total number of capturing groups that appear …","This configures swap-greed mode for the entire pattern.","This configures swap-greed mode for all of the patterns.","","","","","","","","","","","","","","","","","","","","Attempts to parse a string into a regular expression","Attempts to parse a string into a regular expression","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","This configures Unicode mode for the entire pattern.","This configures Unicode mode for the all of the patterns.","A low level representation of the byte offsets of each …","An iterator over all non-overlapping capture matches in a …","An iterator over the names of all capture groups in a …","Represents the capture groups for a single match.","Represents a single match of a regex in a haystack.","An iterator over all non-overlapping matches in a haystack.","A helper type for forcing literal string replacement.","A compiled regular expression for searching Unicode …","A configurable builder for a Regex.","Match multiple, possibly overlapping, regexes in a single …","A configurable builder for a RegexSet.","A trait for types that can be used to replace matches in a …","A by-reference adaptor for a Replacer.","A set of matches returned by a regex set.","An owned iterator over the set of matches from a regex set.","A borrowed iterator over the set of matches from a regex …","An iterator over all substrings delimited by a regex match.","An iterator over at most N substrings delimited by a regex …","An iterator over all group matches in a Captures value.","Returns the substring of the haystack that matched.","Returns the original string of this regex.","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","Compiles the pattern given to RegexBuilder::new with the …","Compiles the patterns given to RegexSetBuilder::new with …","Returns a type that implements Replacer, but that borrows …","Returns a type that implements Replacer, but that borrows …","Returns a fresh allocated set of capture locations that can","Returns an iterator over the capture names in this regex.","This routine searches for the first match of this regex in …","Returns the same as Regex::captures, but starts the search …","Returns an iterator that yields successive non-overlapping …","Returns the number of captures groups in this regex.","This is like Regex::captures, but writes the byte offsets …","Returns the same as Regex::captures_read, but starts the …","This configures whether to enable case insensitive …","This configures whether to enable case insensitive …","","","","","","","","","","","","","","","","","","","","","","","","","","","This configures CRLF mode for the entire pattern.","This configures CRLF mode for all of the patterns.","","Set the approximate capacity, in bytes, of the cache of …","Set the approximate capacity, in bytes, of the cache of …","This configures dot-matches-new-line mode for the entire …","This configures dot-matches-new-line mode for the entire …","Create a new empty regex set.","Returns the byte offset of the end of the match in the …","","Expands all instances of $ref in replacement to the …","This is a convenience routine for extracting the substrings","This routine searches for the first match of this regex in …","Returns the same as Regex::find, but starts the search at …","Returns an iterator that yields successive non-overlapping …","","","","Shows the original regular expression.","Shows the original regular expression.","","","","","","","","","","","","","","","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Attempts to parse a string into a regular expression","Returns the Match associated with the capture group at …","Returns the start and end byte offsets of the capture …","This configures verbose mode for the entire pattern.","This configures verbose mode for all of the patterns.","","","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","","","","","","","","","","","Returns true if and only if this match has a length of …","Returns true if this set contains no regexes.","Returns true if and only if there is a match for the regex …","Returns true if and only if one of the regexes in this set …","Returns the same as Regex::is_match, but starts the search …","Returns true if and only if one of the regexes in this set …","Returns an iterator over all capture groups. This includes …","Returns an iterator over the indices of the regexes that …","Returns the total number of capture groups. This includes …","Returns the length, in bytes, of this match.","Returns the total number of capture groups (even if they …","Returns the total number of regexes in this set.","The total number of regexes in the set that created these …","Configures the line terminator to be used by the regex.","Configures the line terminator to be used by the regex.","Whether the regex at the given index matched.","Whether this set contains any matches.","Returns the set of regexes that match in the given …","Returns the set of regexes that match in the given …","This configures multi-line mode for the entire pattern.","This configures multi-line mode for all of the patterns.","Returns the Match associated with the capture group named …","Set the nesting limit for this parser.","Set the nesting limit for this parser.","Create a new builder with a default configuration for the …","Create a new builder with a default configuration for the …","Compiles a regular expression. Once compiled, it can be …","Create a new regex set with the given regular expressions.","","","","","","","","","","","Return a fixed unchanging replacement byte string.","Return a fixed unchanging replacement byte string.","","","This configures octal mode for the entire pattern.","This configures octal mode for all of the patterns.","Returns the regex patterns that this regex set was …","Returns the range over the starting and ending byte …","Replaces the leftmost-first match in the given haystack …","Replaces all non-overlapping matches in the haystack with …","Appends possibly empty data to dst to replace the current …","","","Replaces at most limit non-overlapping matches in the …","Returns the end byte offset of the first match in the …","Returns the same as shortest_match, but starts the search …","","","","","","Sets the approximate size limit, in bytes, of the compiled …","Sets the approximate size limit, in bytes, of the compiled …","Returns an iterator of substrings of the haystack given, …","Returns an iterator of at most limit substrings of the …","Returns the byte offset of the start of the match in the …","Returns the total number of capturing groups that appear …","This configures swap-greed mode for the entire pattern.","This configures swap-greed mode for all of the patterns.","","","","","","","","","","","","","","","","","Attempts to parse a string into a regular expression","Attempts to parse a string into a regular expression","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","This configures Unicode mode for the entire pattern.","This configures Unicode mode for the all of the patterns."],"i":[0,0,0,0,5,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,5,1,3,13,4,7,5,1,3,11,23,16,29,30,12,18,10,19,8,20,33,21,13,4,7,5,1,3,11,23,16,29,30,12,18,10,19,8,20,33,21,4,7,9,9,0,1,1,1,1,1,1,1,1,4,7,4,7,5,1,3,11,12,18,19,8,20,21,4,7,5,1,3,11,12,18,19,8,20,21,23,16,12,18,4,7,8,5,4,7,4,7,8,3,5,3,0,13,13,1,1,1,13,4,7,5,5,1,1,3,11,23,16,29,30,12,18,10,19,8,20,33,21,13,4,7,5,1,3,11,23,16,29,30,12,18,10,19,8,20,33,21,1,13,11,4,7,13,13,13,4,7,5,1,3,11,23,16,29,30,12,18,10,19,8,20,33,21,23,16,29,30,12,18,20,20,33,21,3,8,1,8,1,8,13,20,13,3,11,8,20,4,7,20,20,8,8,4,7,13,4,7,4,7,1,8,23,16,29,30,12,18,33,21,33,21,9,9,10,19,4,7,8,3,1,1,9,10,19,1,1,1,30,12,18,33,21,4,7,1,1,3,1,4,7,4,7,5,1,3,11,12,18,19,8,20,21,5,1,13,4,7,5,1,1,1,3,11,23,16,29,30,12,18,10,19,8,20,33,21,13,4,7,5,1,3,11,23,16,29,30,12,18,10,19,8,20,33,21,13,4,7,5,1,3,11,23,16,29,30,12,18,10,19,8,20,33,21,4,7,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,43,44,52,45,46,44,43,50,58,53,60,61,51,54,49,55,47,56,62,57,52,45,46,44,43,50,58,53,60,61,51,54,49,55,47,56,62,57,45,46,48,48,44,44,44,44,44,44,44,44,45,46,45,46,44,43,50,51,54,55,47,56,57,45,46,44,43,50,51,54,55,47,56,57,58,53,51,54,45,46,47,45,46,45,46,47,43,43,52,52,44,44,44,52,45,46,44,44,43,50,58,53,60,61,51,54,49,55,47,56,62,57,52,45,46,44,43,50,58,53,60,61,51,54,49,55,47,56,62,57,44,52,50,45,46,52,52,52,45,46,44,43,50,58,53,60,61,51,54,49,55,47,56,62,57,58,53,60,61,51,54,56,56,62,57,43,47,44,47,44,47,52,56,52,43,50,47,56,45,46,56,56,47,47,45,46,52,45,46,45,46,44,47,58,53,60,61,51,54,62,57,62,57,48,48,49,55,45,46,47,43,44,44,48,49,55,44,44,44,61,51,54,62,57,45,46,44,44,43,44,45,46,45,46,44,43,50,51,54,55,47,56,57,44,52,45,46,44,44,44,43,50,58,53,60,61,51,54,49,55,47,56,62,57,52,45,46,44,43,50,58,53,60,61,51,54,49,55,47,56,62,57,52,45,46,44,43,50,58,53,60,61,51,54,49,55,47,56,62,57,45,46],"f":"``````````````````````{bd}{fd}{ce{}{}}0000000000000000000000000000000000000{h{{l{bj}}}}{n{{l{A`j}}}}{Ab{{Ad{Ab}}}}0`{bAf}{bAh}{{bd}{{Al{Aj}}}}{{bdAn}{{Al{Aj}}}}{{bd}B`}{bAn}{{bAfd}{{Al{f}}}}{{bAfdAn}{{Al{f}}}}{{hBb}h}{{nBb}n}{hh}{nn}{jj}{bb}{ff}{AfAf}{AhAh}{BdBd}{BfBf}{A`A`}{BhBh}{BjBj}{{ce}Bl{}{}}00000000000{BnAn}{B`An}{AhAn}{BdAn}{{hBb}h}{{nBb}n}{{}A`}{jd}{{hAn}h}{{nAn}n}543{fAn}{{jj}Bb}{{ff}Bb}{dC`}{{AjdC`}Bl}{Aj{{Cd{d{Cb{d}}}}}}{{bd}{{Al{f}}}}{{bdAn}{{Al{f}}}}{{bd}Bn}{{AjCf}Ch}{{hCf}Ch}{{nCf}Ch}{{jCf}Ch}0{{bCf}Ch}0{{fCf}Ch}{{AfCf}Ch}{{BnCf}Ch}{{B`Cf}Ch}{{CjCf}Ch}{{ClCf}Ch}{{AhCf}Ch}{{BdCf}Ch}{{{Ad{c}}Cf}Ch{CnD`}}{{BfCf}Ch}{{A`Cf}Ch}{{BhCf}Ch}{{DbCf}Ch}{{BjCf}Ch}{cc{}}000000000000000000{d{{l{bj}}}}{{AjAn}{{Al{f}}}}{{AfAn}{{Al{{Cd{AnAn}}}}}}{{hBb}h}{{nBb}n}{{AjAn}d}{{Ajd}d}{ce{}{}}000000000000000000000000{Bhc{}}011{fBb}{A`Bb}{{bd}Bb}{{A`d}Bb}{{bdAn}Bb}{{A`dAn}Bb}{AjBd}{BhBj}{AjAn}{fAn}{AfAn}{A`An}{BhAn}{{hDd}h}{{nDd}n}{{BhAn}Bb}{BhBb}{{A`d}Bh}{{A`dAn}Bh}{{hBb}h}{{nBb}n}{{Ajd}{{Al{f}}}}{{hDf}h}{{nDf}n}{dh}{en{{Dh{d}}}{{Dl{}{{Dj{c}}}}}}{d{{l{bj}}}}{e{{l{A`j}}}{{Dh{d}}}{{Dl{}{{Dj{c}}}}}}{Bn{{Al{f}}}}{B`{{Al{Aj}}}}{Cj{{Al{d}}}}{Cl{{Al{d}}}}{Ah{{Al{{Al{d}}}}}}{Bd{{Al{{Al{f}}}}}}{Db{{Al{An}}}}{Bj{{Al{An}}}}10{Ab{{Al{{Dn{d}}}}}}0{{{Ad{c}}}{{Al{{Dn{d}}}}}{AbD`}}{Bf{{Al{{Dn{d}}}}}}{{hBb}h}{{nBb}n}{A`{{E`{C`}}}}{f{{Eb{An}}}}{{bdc}{{Dn{d}}}Ab}0{{AbAjC`}Bl}{{{Ad{c}}AjC`}Bl{AbD`}}{{BfAjC`}Bl}{{bdAnc}{{Dn{d}}}Ab}{{bd}{{Al{An}}}}{{bdAn}{{Al{An}}}}{Cl{{Cd{An{Al{An}}}}}}{Ah{{Cd{An{Al{An}}}}}}{Bd{{Cd{An{Al{An}}}}}}{Db{{Cd{An{Al{An}}}}}}{Bj{{Cd{An{Al{An}}}}}}{{hAn}h}{{nAn}n}{{bd}Cj}{{bdAn}Cl}{fAn}{b{{Al{An}}}}{{hBb}h}{{nBb}n}{ce{}{}}00000000000{cC`{}}0{c{{l{e}}}{}{}}0000{d{{l{bj}}}}{C`{{l{bj}}}}222222222222222222222222222222222{cEd{}}00000000000000000076```````````````````{Ef{{E`{Dd}}}}{Ehd}777777777777777777777777777777777777{Ej{{l{Ehj}}}}{El{{l{Enj}}}}{F`{{Fb{F`}}}}0{EhFd}{EhFf}{{Eh{E`{Dd}}}{{Al{Fh}}}}{{Eh{E`{Dd}}An}{{Al{Fh}}}}{{Eh{E`{Dd}}}Fj}{EhAn}{{EhFd{E`{Dd}}}{{Al{Ef}}}}{{EhFd{E`{Dd}}An}{{Al{Ef}}}}{{EjBb}Ej}{{ElBb}El}{EjEj}{ElEl}{EhEh}{EfEf}{FdFd}{FfFf}{FlFl}{FnFn}{EnEn}{G`G`}{GbGb}{{ce}Bl{}{}}0000000000{GdAn}{FjAn}{FfAn}{FlAn}{{EjBb}Ej}{{ElBb}El}{{}En}{{EjAn}Ej}{{ElAn}El}432{EfAn}{{EfEf}Bb}{{Fh{E`{Dd}}{Gf{Dd}}}Bl}{Fh{{Cd{{E`{Dd}}{Cb{{E`{Dd}}}}}}}}{{Eh{E`{Dd}}}{{Al{Ef}}}}{{Eh{E`{Dd}}An}{{Al{Ef}}}}{{Eh{E`{Dd}}}Gd}{{FhCf}Ch}{{EjCf}Ch}{{ElCf}Ch}{{EhCf}Ch}0{{EfCf}Ch}{{FdCf}Ch}{{GdCf}Ch}{{FjCf}Ch}{{GhCf}Ch}{{GjCf}Ch}{{FfCf}Ch}{{FlCf}Ch}{{{Fb{c}}Cf}Ch{CnD`}}{{FnCf}Ch}{{EnCf}Ch}{{G`Cf}Ch}{{GlCf}Ch}{{GbCf}Ch}{cc{}}00000000000000000{d{{l{Ehj}}}}{{FhAn}{{Al{Ef}}}}{{FdAn}{{Al{{Cd{AnAn}}}}}}{{EjBb}Ej}{{ElBb}El}{{FhAn}{{E`{Dd}}}}{{Fhd}{{E`{Dd}}}}{ce{}{}}00000000000000000000000{G`c{}}011{EfBb}{EnBb}{{Eh{E`{Dd}}}Bb}{{En{E`{Dd}}}Bb}{{Eh{E`{Dd}}An}Bb}{{En{E`{Dd}}An}Bb}{FhFl}{G`Gb}{FhAn}{EfAn}{FdAn}{EnAn}{G`An}{{EjDd}Ej}{{ElDd}El}{{G`An}Bb}{G`Bb}{{En{E`{Dd}}}G`}{{En{E`{Dd}}An}G`}{{EjBb}Ej}{{ElBb}El}{{Fhd}{{Al{Ef}}}}{{EjDf}Ej}{{ElDf}El}{dEj}{eEl{{Dh{d}}}{{Dl{}{{Dj{c}}}}}}{d{{l{Ehj}}}}{e{{l{Enj}}}{{Dh{d}}}{{Dl{}{{Dj{c}}}}}}{Gd{{Al{Ef}}}}{Fj{{Al{Fh}}}}{Gh{{Al{{E`{Dd}}}}}}{Gj{{Al{{E`{Dd}}}}}}{Ff{{Al{{Al{d}}}}}}{Fl{{Al{{Al{Ef}}}}}}{Gl{{Al{An}}}}{Gb{{Al{An}}}}10{F`{{Al{{Dn{{E`{Dd}}}}}}}}0{{{Fb{c}}}{{Al{{Dn{{E`{Dd}}}}}}}{F`D`}}{Fn{{Al{{Dn{{E`{Dd}}}}}}}}{{EjBb}Ej}{{ElBb}El}{En{{E`{C`}}}}{Ef{{Eb{An}}}}{{Eh{E`{Dd}}c}{{Dn{{E`{Dd}}}}}F`}0{{F`Fh{Gf{Dd}}}Bl}{{{Fb{c}}Fh{Gf{Dd}}}Bl{F`D`}}{{FnFh{Gf{Dd}}}Bl}{{Eh{E`{Dd}}Anc}{{Dn{{E`{Dd}}}}}F`}{{Eh{E`{Dd}}}{{Al{An}}}}{{Eh{E`{Dd}}An}{{Al{An}}}}{Gj{{Cd{An{Al{An}}}}}}{Ff{{Cd{An{Al{An}}}}}}{Fl{{Cd{An{Al{An}}}}}}{Gl{{Cd{An{Al{An}}}}}}{Gb{{Cd{An{Al{An}}}}}}{{EjAn}Ej}{{ElAn}El}{{Eh{E`{Dd}}}Gh}{{Eh{E`{Dd}}An}Gj}{EfAn}{Eh{{Al{An}}}}{{EjBb}Ej}{{ElBb}El}{ce{}{}}0000000000{cC`{}}{c{{l{e}}}{}{}}000{d{{l{Ehj}}}}{C`{{l{Ehj}}}}22222222222222222222222222222222{cEd{}}0000000000000000076","c":[],"p":[[5,"Regex",0],[1,"str"],[5,"Match",0],[5,"RegexBuilder",0],[6,"Error",0],[6,"Result",662],[5,"RegexSetBuilder",0],[5,"RegexSet",0],[10,"Replacer",0],[5,"ReplacerRef",0],[5,"CaptureLocations",0],[5,"CaptureNames",0],[5,"Captures",0],[6,"Option",663],[1,"usize"],[5,"CaptureMatches",0],[1,"bool"],[5,"SubCaptureMatches",0],[5,"NoExpand",0],[5,"SetMatches",0],[5,"SetMatchesIter",0],[1,"unit"],[5,"Matches",0],[5,"String",664],[1,"array"],[1,"tuple"],[5,"Formatter",665],[8,"Result",665],[5,"Split",0],[5,"SplitN",0],[10,"Debug",665],[10,"Sized",666],[5,"SetMatchesIntoIter",0],[1,"u8"],[1,"u32"],[10,"AsRef",667],[17,"Item"],[10,"IntoIterator",668],[6,"Cow",669],[1,"slice"],[5,"Range",670],[5,"TypeId",671],[5,"Match",341],[5,"Regex",341],[5,"RegexBuilder",341],[5,"RegexSetBuilder",341],[5,"RegexSet",341],[10,"Replacer",341],[5,"ReplacerRef",341],[5,"CaptureLocations",341],[5,"CaptureNames",341],[5,"Captures",341],[5,"CaptureMatches",341],[5,"SubCaptureMatches",341],[5,"NoExpand",341],[5,"SetMatches",341],[5,"SetMatchesIter",341],[5,"Matches",341],[5,"Vec",672],[5,"Split",341],[5,"SplitN",341],[5,"SetMatchesIntoIter",341]],"b":[[126,"impl-Debug-for-Error"],[127,"impl-Display-for-Error"],[128,"impl-Debug-for-Regex"],[129,"impl-Display-for-Regex"],[168,"impl-Index%3Cusize%3E-for-Captures%3C\'h%3E"],[169,"impl-Index%3C%26str%3E-for-Captures%3C\'h%3E"],[195,"impl-IntoIterator-for-%26SetMatches"],[196,"impl-IntoIterator-for-SetMatches"],[285,"impl-TryFrom%3C%26str%3E-for-Regex"],[286,"impl-TryFrom%3CString%3E-for-Regex"],[456,"impl-Debug-for-Regex"],[457,"impl-Display-for-Regex"],[495,"impl-Index%3Cusize%3E-for-Captures%3C\'h%3E"],[496,"impl-Index%3C%26str%3E-for-Captures%3C\'h%3E"],[521,"impl-IntoIterator-for-SetMatches"],[522,"impl-IntoIterator-for-%26SetMatches"],[608,"impl-TryFrom%3C%26str%3E-for-Regex"],[609,"impl-TryFrom%3CString%3E-for-Regex"]]}],\ -["regex_automata",{"doc":"This crate exposes a variety of regex engines used by the …","t":"PGPFPFPFFGGPPFFFFPFPPNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNCNNNONNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNCNNNNNNNNNNNNNNNNNNNNNNNNNNCNNNNNNNNNCNNNNNNNNNNNNNNNNNNNNNONNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNCOOOOOCFFFFFNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNFPFFPGPNNNNNNNNNNNNNNNNNNCNNNNNNNNNNNNNNNNNNNNNNNNCNNNNNNNNNNNNNNNNNNNNNOOOFFFFFNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNFFFFNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNFFFFFFFFFNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNCPPFFPPFFPFPPPPFPFPFGFPGNNNNNNNNNNNCNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNONNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNONNNNNCNNNNNNNNONNNNNNNNNNNNNNNNNNOONNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNOOOOOOOOOOOFFFFFFNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNHNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNFFFFFFNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNCCCCCCCCCCCCCFFFFFNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNFFFFFFNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNFFNNNNNNNNNNNNNNNNNNNHHFFFFFFFNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNFNNNNNNNNNNNPPPGFFFPPPFPPPPPPPPPPPPNNNONNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNFFNNNNNNNNNNNNNNNNNNNNNFNNNNNNNNNNNNNNNNNNNTTTTTTFFFTTTFFFFTTTNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNFNNNNNNNNNNNNNNNNNNFNNNNNNNNNNNNNNNNNNNNNNNNNNNNHHHHNNNNNNNFFFONNNNNNONNNNNNNNNNNNNNNNNNNNNN","n":["All","Anchored","GaveUp","HalfMatch","HaystackTooLong","Input","LeftmostFirst","Match","MatchError","MatchErrorKind","MatchKind","No","Pattern","PatternID","PatternSet","PatternSetInsertError","PatternSetIter","Quit","Span","UnsupportedAnchored","Yes","anchored","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","capacity","clear","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","cmp","contains","contains","default","default","dfa","earliest","end","end","end","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","gave_up","get_anchored","get_earliest","get_range","get_span","hash","hash","hash","hash","haystack","haystack_too_long","hybrid","insert","into","into","into","into","into","into","into","into","into","into","into","into","into_iter","is_anchored","is_char_boundary","is_done","is_empty","is_empty","is_empty","is_full","iter","kind","len","len","len","meta","must","must","new","new","new","new","new","next","next_back","nfa","offset","offset","partial_cmp","pattern","pattern","pattern","quit","range","range","range","set_anchored","set_earliest","set_end","set_range","set_span","set_start","size_hint","span","span","start","start","start","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_string","to_string","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_insert","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","unsupported_anchored","util","byte","len","mode","offset","offset","onepass","BuildError","Builder","Cache","Config","DFA","alphabet_len","always_match","borrow","borrow","borrow","borrow","borrow","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","build","build_from_nfa","build_many","builder","byte_classes","captures","clone","clone","clone","clone","clone","clone_into","clone_into","clone_into","clone_into","clone_into","config","configure","create_cache","create_captures","default","find","fmt","fmt","fmt","fmt","fmt","fmt","from","from","from","from","from","get_byte_classes","get_config","get_match_kind","get_nfa","get_size_limit","get_starts_for_each_pattern","into","into","into","into","into","is_match","match_kind","memory_usage","memory_usage","never_match","new","new","new","new","new_from_nfa","new_many","pattern_len","reset","reset_cache","size_limit","source","starts_for_each_pattern","state_len","stride","stride2","syntax","thompson","to_owned","to_owned","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","try_into","try_search","try_search_slots","type_id","type_id","type_id","type_id","type_id","BuildError","Cache","CacheError","LazyStateID","Quit","StartError","UnsupportedAnchored","borrow","borrow","borrow","borrow","borrow_mut","borrow_mut","borrow_mut","borrow_mut","clone","clone","clone","clone","clone_into","clone_into","clone_into","clone_into","cmp","default","dfa","eq","fmt","fmt","fmt","fmt","fmt","fmt","fmt","from","from","from","from","hash","into","into","into","into","is_dead","is_match","is_quit","is_start","is_tagged","is_unknown","partial_cmp","regex","source","source","to_owned","to_owned","to_owned","to_owned","to_string","to_string","to_string","try_from","try_from","try_from","try_from","try_into","try_into","try_into","try_into","type_id","type_id","type_id","type_id","byte","err","mode","Builder","Cache","Config","DFA","OverlappingState","always_match","borrow","borrow","borrow","borrow","borrow","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","build","build_from_nfa","build_many","builder","byte_classes","byte_classes","cache_capacity","clear_count","clone","clone","clone","clone","clone","clone_into","clone_into","clone_into","clone_into","clone_into","config","configure","create_cache","default","eq","fmt","fmt","fmt","fmt","fmt","from","from","from","from","from","get_byte_classes","get_cache_capacity","get_config","get_match","get_match_kind","get_minimum_bytes_per_state","get_minimum_cache_capacity","get_minimum_cache_clear_count","get_nfa","get_prefilter","get_quit","get_skip_cache_capacity_check","get_specialize_start_states","get_starts_for_each_pattern","get_unicode_word_boundary","into","into","into","into","into","match_kind","match_len","match_pattern","memory_usage","memory_usage","minimum_bytes_per_state","minimum_cache_clear_count","never_match","new","new","new","new","new_many","next_eoi_state","next_state","next_state_untagged","next_state_untagged_unchecked","pattern_len","prefilter","quit","reset","reset_cache","search_finish","search_start","search_total_len","search_update","skip_cache_capacity_check","specialize_start_states","start","start_state","start_state_forward","start_state_reverse","starts_for_each_pattern","syntax","thompson","to_owned","to_owned","to_owned","to_owned","to_owned","try_from","try_from","try_from","try_from","try_from","try_into","try_into","try_into","try_into","try_into","try_search_fwd","try_search_overlapping_fwd","try_search_overlapping_rev","try_search_rev","try_which_overlapping_matches","type_id","type_id","type_id","type_id","type_id","unicode_word_boundary","Builder","Cache","FindMatches","Regex","as_parts","as_parts_mut","borrow","borrow","borrow","borrow","borrow_mut","borrow_mut","borrow_mut","borrow_mut","build","build_from_dfas","build_many","builder","clone","clone","clone_into","clone_into","create_cache","default","dfa","find","find_iter","fmt","fmt","fmt","fmt","forward","forward","forward_mut","from","from","from","from","into","into","into","into","into_iter","is_match","memory_usage","new","new","new","new_many","next","pattern_len","reset","reset_cache","reverse","reverse","reverse_mut","syntax","thompson","to_owned","to_owned","try_from","try_from","try_from","try_from","try_into","try_into","try_into","try_into","try_search","type_id","type_id","type_id","type_id","BuildError","Builder","Cache","CapturesMatches","Config","FindMatches","Regex","Split","SplitN","auto_prefilter","backtrack","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","build","build_from_hir","build_many","build_many_from_hir","builder","byte_classes","captures","captures_iter","captures_len","clone","clone","clone","clone","clone","clone_into","clone_into","clone_into","clone_into","clone_into","config","configure","count","count","create_cache","create_captures","default","dfa","dfa_size_limit","dfa_state_limit","find","find_iter","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","from","from","from","from","from","from","from","from","from","get_auto_prefilter","get_backtrack","get_byte_classes","get_config","get_dfa","get_dfa_size_limit","get_dfa_state_limit","get_hybrid","get_hybrid_cache_capacity","get_line_terminator","get_match_kind","get_nfa_size_limit","get_onepass","get_onepass_size_limit","get_prefilter","get_utf8_empty","get_which_captures","group_info","hybrid","hybrid_cache_capacity","input","input","input","input","into","into","into","into","into","into","into","into","into","into_iter","into_iter","into_iter","into_iter","is_accelerated","is_match","line_terminator","match_kind","memory_usage","memory_usage","new","new","new","new","new_many","next","next","next","next","nfa_size_limit","onepass","onepass_size_limit","pattern","pattern_len","prefilter","regex","regex","reset","search","search_captures","search_captures_with","search_half","search_half_with","search_slots","search_slots_with","search_with","size_hint","size_limit","source","split","splitn","static_captures_len","syntax","syntax_error","to_owned","to_owned","to_owned","to_owned","to_owned","to_string","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","utf8_empty","which_captures","which_overlapping_matches","which_overlapping_matches_with","thompson","All","BinaryUnion","BuildError","Builder","ByteRange","Capture","Compiler","Config","Dense","DenseTransitions","Fail","Implicit","Look","Match","NFA","None","PatternIter","Sparse","SparseTransitions","State","Transition","Union","WhichCaptures","add_capture_end","add_capture_start","add_empty","add_fail","add_look","add_match","add_range","add_sparse","add_union","add_union_reverse","always_match","backtrack","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","build","build","build_from_hir","build_many","build_many_from_hir","byte_classes","captures","clear","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","compiler","config","configure","current_pattern_id","default","default","default","end","eq","eq","eq","eq","finish_pattern","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","from","from","from","from","from","from","from","from","from","from","from","get_captures","get_look_matcher","get_look_matcher","get_nfa_size_limit","get_reverse","get_reverse","get_shrink","get_size_limit","get_utf8","get_utf8","get_which_captures","group_info","has_capture","has_empty","hash","into","into","into","into","into","into","into","into","into","into","into","into_iter","is_always_start_anchored","is_any","is_epsilon","is_none","is_reverse","is_utf8","look_matcher","look_matcher","look_set_any","look_set_prefix_any","matches","matches","matches","matches_byte","matches_byte","matches_byte","matches_unit","memory_usage","memory_usage","never_match","new","new","new","new","new_many","next","next","nfa_size_limit","patch","pattern_len","pattern_len","patterns","pikevm","reverse","set_look_matcher","set_reverse","set_size_limit","set_utf8","shrink","size_limit","source","start","start_anchored","start_pattern","start_pattern","start_unanchored","state","states","syntax","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_string","transitions","transitions","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","utf8","which_captures","alt1","alt2","alternates","group_index","look","next","next","pattern_id","pattern_id","slot","trans","BoundedBacktracker","Builder","Cache","Config","TryCapturesMatches","TryFindMatches","always_match","borrow","borrow","borrow","borrow","borrow","borrow","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","build","build_from_nfa","build_many","builder","clone","clone","clone","clone","clone_into","clone_into","clone_into","clone_into","config","configure","create_cache","create_captures","default","fmt","fmt","fmt","fmt","fmt","fmt","from","from","from","from","from","from","get_config","get_nfa","get_prefilter","get_visited_capacity","into","into","into","into","into","into","into_iter","into_iter","max_haystack_len","memory_usage","min_visited_capacity","never_match","new","new","new","new","new_from_nfa","new_many","next","next","pattern_len","prefilter","reset","reset_cache","syntax","thompson","to_owned","to_owned","to_owned","to_owned","try_captures","try_captures_iter","try_find","try_find_iter","try_from","try_from","try_from","try_from","try_from","try_from","try_into","try_into","try_into","try_into","try_into","try_into","try_is_match","try_search","try_search_slots","type_id","type_id","type_id","type_id","type_id","type_id","visited_capacity","Builder","Cache","CapturesMatches","Config","FindMatches","PikeVM","always_match","borrow","borrow","borrow","borrow","borrow","borrow","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","build","build_from_nfa","build_many","builder","captures","captures_iter","clone","clone","clone","clone","clone_into","clone_into","clone_into","clone_into","config","configure","create_cache","create_captures","default","find","find_iter","fmt","fmt","fmt","fmt","fmt","fmt","from","from","from","from","from","from","get_config","get_match_kind","get_nfa","get_prefilter","into","into","into","into","into","into","into_iter","into_iter","is_match","match_kind","memory_usage","never_match","new","new","new","new","new_from_nfa","new_many","next","next","pattern_len","prefilter","reset","reset_cache","search","search_slots","syntax","thompson","to_owned","to_owned","to_owned","to_owned","try_from","try_from","try_from","try_from","try_from","try_from","try_into","try_into","try_into","try_into","try_into","try_into","type_id","type_id","type_id","type_id","type_id","type_id","which_overlapping_matches","alphabet","captures","escape","interpolate","iter","lazy","look","pool","prefilter","primitives","start","syntax","wire","ByteClassElements","ByteClassIter","ByteClassRepresentatives","ByteClasses","Unit","alphabet_len","as_eoi","as_u8","as_usize","borrow","borrow","borrow","borrow","borrow","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","clone","clone","clone_into","clone_into","cmp","default","elements","empty","eoi","eoi","eq","fmt","fmt","fmt","fmt","fmt","from","from","from","from","from","get","get_by_unit","into","into","into","into","into","into_iter","into_iter","into_iter","is_byte","is_eoi","is_singleton","is_word_byte","iter","next","next","next","partial_cmp","representatives","set","singletons","stride2","to_owned","to_owned","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","u8","Captures","CapturesPatternIter","GroupInfo","GroupInfoAllNames","GroupInfoError","GroupInfoPatternNames","all","all_group_len","all_names","borrow","borrow","borrow","borrow","borrow","borrow","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","clear","clone","clone","clone","clone","clone","clone_into","clone_into","clone_into","clone_into","clone_into","count","count","default","empty","empty","explicit_slot_len","extract","extract_bytes","fmt","fmt","fmt","fmt","fmt","fmt","fmt","from","from","from","from","from","from","get_group","get_group_by_name","get_match","group_info","group_len","group_len","implicit_slot_len","interpolate_bytes","interpolate_bytes_into","interpolate_string","interpolate_string_into","into","into","into","into","into","into","into_iter","into_iter","into_iter","is_match","iter","matches","memory_usage","new","next","next","next","pattern","pattern_len","pattern_names","set_pattern","size_hint","size_hint","slot","slot_len","slots","slots","slots_mut","source","to_index","to_name","to_owned","to_owned","to_owned","to_owned","to_owned","to_string","try_from","try_from","try_from","try_from","try_from","try_from","try_into","try_into","try_into","try_into","try_into","try_into","type_id","type_id","type_id","type_id","type_id","type_id","DebugByte","DebugHaystack","borrow","borrow","borrow_mut","borrow_mut","clone","clone_into","fmt","fmt","from","from","into","into","to_owned","try_from","try_from","try_into","try_into","type_id","type_id","bytes","string","CapturesIter","HalfMatchesIter","MatchesIter","Searcher","TryCapturesIter","TryHalfMatchesIter","TryMatchesIter","advance","advance_half","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","clone","clone_into","fmt","fmt","fmt","fmt","fmt","fmt","fmt","from","from","from","from","from","from","from","infallible","infallible","infallible","input","input","input","input","input","into","into","into","into","into","into","into","into_captures_iter","into_half_matches_iter","into_iter","into_iter","into_iter","into_iter","into_iter","into_iter","into_matches_iter","new","next","next","next","next","next","next","to_owned","try_advance","try_advance_half","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_into","try_into","try_into","try_into","try_into","try_into","try_into","type_id","type_id","type_id","type_id","type_id","type_id","type_id","Lazy","borrow","borrow_mut","deref","fmt","from","get","into","new","try_from","try_into","type_id","End","EndCRLF","EndLF","Look","LookMatcher","LookSet","LookSetIter","Start","StartCRLF","StartLF","UnicodeWordBoundaryError","WordAscii","WordAsciiNegate","WordEndAscii","WordEndHalfAscii","WordEndHalfUnicode","WordEndUnicode","WordStartAscii","WordStartHalfAscii","WordStartHalfUnicode","WordStartUnicode","WordUnicode","WordUnicodeNegate","as_char","as_repr","available","bits","borrow","borrow","borrow","borrow","borrow","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","check","clone","clone","clone","clone","clone","clone_into","clone_into","clone_into","clone_into","clone_into","contains","contains_anchor","contains_anchor_crlf","contains_anchor_haystack","contains_anchor_lf","contains_anchor_line","contains_word","contains_word_ascii","contains_word_unicode","default","default","empty","eq","eq","fmt","fmt","fmt","fmt","fmt","fmt","from","from","from","from","from","from_repr","full","get_line_terminator","insert","intersect","into","into","into","into","into","into_iter","is_empty","is_end","is_end_crlf","is_end_lf","is_start","is_start_crlf","is_start_lf","is_word_ascii","is_word_ascii_negate","is_word_end_ascii","is_word_end_half_ascii","is_word_end_half_unicode","is_word_end_unicode","is_word_start_ascii","is_word_start_half_ascii","is_word_start_half_unicode","is_word_start_unicode","is_word_unicode","is_word_unicode_negate","iter","len","matches","matches_set","new","next","read_repr","remove","reversed","set_insert","set_intersect","set_line_terminator","set_remove","set_subtract","set_union","singleton","subtract","to_owned","to_owned","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","try_into","type_id","type_id","type_id","type_id","type_id","union","write_repr","Pool","PoolGuard","borrow","borrow","borrow_mut","borrow_mut","deref","deref_mut","fmt","fmt","from","from","get","into","into","new","put","try_from","try_from","try_into","try_into","type_id","type_id","Prefilter","borrow","borrow_mut","clone","clone_into","find","fmt","from","from_hir_prefix","from_hirs_prefix","into","is_fast","max_needle_len","memory_usage","new","prefix","to_owned","try_from","try_into","type_id","LIMIT","LIMIT","LIMIT","MAX","MAX","MAX","NonMaxUsize","PatternID","PatternIDError","SIZE","SIZE","SIZE","SmallIndex","SmallIndexError","StateID","StateIDError","ZERO","ZERO","ZERO","as_i32","as_i32","as_i32","as_u32","as_u32","as_u32","as_u64","as_u64","as_u64","as_usize","as_usize","as_usize","attempted","attempted","attempted","borrow","borrow","borrow","borrow","borrow","borrow","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","clone","clone","clone","clone","clone","clone","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","cmp","cmp","cmp","default","default","eq","eq","eq","eq","eq","eq","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","from","from","from","from","from","from","from","from","from_ne_bytes","from_ne_bytes","from_ne_bytes","from_ne_bytes_unchecked","from_ne_bytes_unchecked","from_ne_bytes_unchecked","get","hash","hash","hash","into","into","into","into","into","into","must","must","must","new","new","new","new","new_unchecked","new_unchecked","new_unchecked","one_more","one_more","one_more","partial_cmp","partial_cmp","partial_cmp","to_ne_bytes","to_ne_bytes","to_ne_bytes","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_string","to_string","to_string","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_into","try_into","try_into","try_into","try_into","try_into","type_id","type_id","type_id","type_id","type_id","type_id","Config","anchored","borrow","borrow_mut","clone","clone_into","fmt","from","from_input_forward","from_input_reverse","get_anchored","get_look_behind","into","look_behind","new","to_owned","try_from","try_into","type_id","Config","borrow","borrow_mut","case_insensitive","clone","clone_into","crlf","default","dot_matches_new_line","fmt","from","get_case_insensitive","get_crlf","get_dot_matches_new_line","get_ignore_whitespace","get_line_terminator","get_multi_line","get_nest_limit","get_octal","get_swap_greed","get_unicode","get_utf8","ignore_whitespace","into","line_terminator","multi_line","nest_limit","new","octal","parse","parse_many","parse_many_with","parse_with","swap_greed","to_owned","try_from","try_into","type_id","unicode","utf8","AlignAs","DeserializeError","SerializeError","_align","borrow","borrow","borrow","borrow_mut","borrow_mut","borrow_mut","bytes","fmt","fmt","fmt","fmt","fmt","from","from","from","into","into","into","to_string","to_string","try_from","try_from","try_from","try_into","try_into","try_into","type_id","type_id","type_id"],"q":[[0,"regex_automata"],[249,"regex_automata::MatchErrorKind"],[254,"regex_automata::dfa"],[255,"regex_automata::dfa::onepass"],[361,"regex_automata::hybrid"],[433,"regex_automata::hybrid::StartError"],[436,"regex_automata::hybrid::dfa"],[566,"regex_automata::hybrid::regex"],[639,"regex_automata::meta"],[832,"regex_automata::nfa"],[833,"regex_automata::nfa::thompson"],[1078,"regex_automata::nfa::thompson::State"],[1089,"regex_automata::nfa::thompson::backtrack"],[1197,"regex_automata::nfa::thompson::pikevm"],[1304,"regex_automata::util"],[1317,"regex_automata::util::alphabet"],[1398,"regex_automata::util::captures"],[1517,"regex_automata::util::escape"],[1538,"regex_automata::util::interpolate"],[1540,"regex_automata::util::iter"],[1634,"regex_automata::util::lazy"],[1646,"regex_automata::util::look"],[1789,"regex_automata::util::pool"],[1812,"regex_automata::util::prefilter"],[1832,"regex_automata::util::primitives"],[1988,"regex_automata::util::start"],[2007,"regex_automata::util::syntax"],[2047,"regex_automata::util::wire"],[2080,"core::cmp"],[2081,"core::ops::range"],[2082,"core::fmt"],[2083,"core::fmt"],[2084,"core::convert"],[2085,"core::hash"],[2086,"core::convert"],[2087,"core::ops::range"],[2088,"core::result"],[2089,"core::any"],[2090,"core::error"],[2091,"regex_syntax::hir"],[2092,"core::borrow"],[2093,"regex_syntax::error"],[2094,"alloc::sync"],[2095,"alloc::vec"],[2096,"core::iter::traits::collect"],[2097,"core::ops::function"],[2098,"core::fmt"]],"d":["Report all possible matches.","The type of anchored search to perform.","The search, based on heuristics, determined that it would …","A representation of “half” of a match reported by a …","This error occurs if the haystack given to the regex …","The parameters for a regex search including the haystack …","Report only the leftmost matches. When multiple leftmost …","A representation of a match reported by a regex engine.","An error indicating that a search stopped before reporting …","The underlying kind of a MatchError.","The kind of match semantics to use for a regex pattern.","Run an unanchored search. This means a match may occur …","Run an anchored search for a specific pattern. This means …","The identifier of a regex pattern, represented by a …","A set of PatternIDs.","An error that occurs when a PatternID failed to insert …","An iterator over all pattern identifiers in a PatternSet.","The search saw a “quit” byte at which it was …","A representation of a span reported by a regex engine.","An error indicating that a particular type of anchored …","Run an anchored search. This means that a match must begin …","Sets the anchor mode of a search.","","","","","","","","","","","","","","","","","","","","","","","","","Returns the total number of pattern identifiers that may …","Clear this set such that it contains no pattern IDs.","","","","","","","","","","","","","","","","","","","","","","","","","","Returns true when the given offset is contained within …","Return true if and only if the given pattern identifier is …","","","A module for building and searching with deterministic …","Whether to execute an “earliest” search or not.","Return the end position of this search.","The ending position of the match.","The end offset of the span, exclusive.","","","","","","","","","","","","","","","","","","","","","","","","","Returns the argument unchanged.","","Returns the argument unchanged.","","Returns the argument unchanged.","","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Create a new “gave up” error. The given offset …","Return the anchored mode for this search configuration.","Return whether this search should execute in “earliest”…","Return the span as a range for this search configuration.","Return the span for this search configuration.","","","","","Return a borrow of the underlying haystack as a slice of …","Create a new “haystack too long” error. The given len …","A module for building and searching with lazy …","Insert the given pattern identifier into this set and …","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","","Returns true if and only if this anchor mode corresponds …","Returns true if and only if the given offset in this search…","Return true if and only if this search can never return …","Returns true when this span is empty. That is, when …","Returns true when the span in this match is empty.","Return true if and only if this set has no pattern …","Return true if and only if this set has the maximum number …","Returns an iterator over all pattern identifiers in this …","Returns a reference to the underlying error kind.","Returns the length of this span.","Returns the length of this match.","Returns the total number of pattern identifiers in this …","Provides a regex matcher that composes several other regex …","Create a new half match from a pattern ID and a byte …","Create a new match from a pattern ID and a byte offset …","Create a new search configuration for the given haystack.","Create a new half match from a pattern ID and a byte …","Create a new match from a pattern ID and a span.","Create a new set of pattern identifiers with the given …","Create a new error value with the given kind.","","","Provides non-deterministic finite automata (NFA) and regex …","Returns a new span with offset added to this span’s start…","The position of the match.","","Returns the ID of the pattern that matched.","Returns the ID of the pattern that matched.","Returns the pattern ID associated with this configuration …","Create a new “quit” error. The given byte corresponds …","Like Input::span, but accepts any range instead.","Returns this span as a range.","Returns the match span as a range.","Set the anchor mode of a search.","Set whether the search should execute in “earliest” …","Set the ending offset for the span for this search …","Set the span for this search configuration given any range.","Set the span for this search configuration.","Set the starting offset for the span for this search …","","Set the span for this search.","Returns the span for this match.","Return the start position of this search.","The starting position of the match.","The start offset of the span, inclusive.","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","Insert the given pattern identifier into this set and …","","","","","","","","","","","","","","","","","","","","","","","","","Create a new “unsupported anchored” error. This occurs …","A collection of modules that provide APIs that are useful …","The “quit” byte that was observed that caused the …","The length of the haystack that exceeded the limit.","The anchored mode given that is unsupported.","The offset at which the quit byte was observed.","The offset at which the search stopped. This corresponds …","A DFA that can return spans for matching capturing groups.","An error that occurred during the construction of a …","A builder for a one-pass DFA.","A cache represents mutable state that a one-pass DFA …","The configuration used for building a one-pass DFA.","A one-pass DFA for executing a subset of anchored regex …","Returns the total number of elements in the alphabet for …","Create a new one-pass DFA that matches every input.","","","","","","","","","","","Build a one-pass DFA from the given pattern.","Build a DFA from the given NFA.","Build a one-pass DFA from the given patterns.","Return a builder for configuring the construction of a DFA.","Whether to attempt to shrink the size of the DFA’s …","Executes an anchored leftmost forward search and writes …","","","","","","","","","","","Return a default configuration for a DFA.","Apply the given one-pass DFA configuration options to this …","Create a new cache for this DFA.","Create a new empty set of capturing groups that is …","","Executes an anchored leftmost forward search, and returns …","","","","","","","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns whether this configuration has enabled byte …","Return the config for this one-pass DFA.","Returns the match semantics set in this configuration.","Returns a reference to the underlying NFA.","Returns the DFA size limit of this configuration if one …","Returns whether this configuration has enabled anchored …","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Executes an anchored leftmost forward search, and returns …","Set the desired match semantics.","Returns the memory usage, in bytes, of this DFA.","Returns the heap memory usage, in bytes, of this cache.","Create a new one-pass DFA that never matches any input.","Return a new default one-pass DFA configuration.","Create a new one-pass DFA builder with the default …","Parse the given regular expression using the default …","Create a new onepass::DFA cache.","Like new, but builds a one-pass DFA directly from an NFA. …","Like new, but parses multiple patterns into a single “…","Returns the total number of patterns compiled into this …","Reset this cache such that it can be used for searching …","Reset the given cache such that it can be used for …","Set a size limit on the total heap used by a one-pass DFA.","","Whether to compile a separate start state for each pattern …","Returns the total number of states in this one-pass DFA.","Returns the total stride for every state in this DFA. This …","Returns the total stride for every state in this DFA, …","Set the syntax configuration for this builder using …","Set the Thompson NFA configuration for this builder using …","","","","","","","","","","","","","","","","","Executes an anchored leftmost forward search and writes …","Executes an anchored leftmost forward search and writes …","","","","","","An error that occurs when initial construction of a lazy …","An error that occurs when cache inefficiency has dropped …","An error that occurs when cache usage has become …","A state identifier specifically tailored for lazy DFAs.","An error that occurs when a starting configuration’s …","An error that can occur when computing the start state for …","An error that occurs when the caller requests an anchored …","","","","","","","","","","","","","","","","","","","Types and routines specific to lazy DFAs.","","","","","","","","","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).","Return true if and only if this represents a dead state. A …","Return true if and only if this lazy state ID has been …","Return true if and only if this represents a quit state. A …","Return true if and only if this lazy state ID has been …","Return true if and only if this lazy state ID is tagged.","Return true if and only if this represents a lazy state ID …","","A lazy DFA backed Regex.","","","","","","","","","","","","","","","","","","","","","","The quit byte that was found.","The underlying cache error that occurred.","The anchored mode given that is unsupported.","A builder for constructing a lazy deterministic finite …","A cache represents a partially computed DFA.","The configuration used for building a lazy DFA.","A hybrid NFA/DFA (also called a “lazy DFA”) for regex …","Represents the current state of an overlapping search.","Create a new lazy DFA that matches every input.","","","","","","","","","","","Build a lazy DFA from the given pattern.","Build a DFA from the given NFA.","Build a lazy DFA from the given patterns.","Return a builder for configuring the construction of a …","Returns the equivalence classes that make up the alphabet …","Whether to attempt to shrink the size of the lazy DFA’s …","Sets the maximum amount of heap memory, in bytes, to …","Returns the total number of times this cache has been …","","","","","","","","","","","Return a default configuration for a DFA.","Apply the given lazy DFA configuration options to this …","Create a new cache for this lazy DFA.","","","","","","","","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns whether this configuration has enabled byte …","Returns the cache capacity set on this configuration.","Returns this lazy DFA’s configuration.","Return the match result of the most recent search to …","Returns the match semantics set in this configuration.","Returns, if set, the minimum number of bytes per state …","Returns the minimum lazy DFA cache capacity required for …","Returns, if set, the minimum number of times the cache …","Returns a reference to the underlying NFA.","Returns the prefilter set in this configuration, if one at …","Returns whether this configuration will instruct the lazy …","Returns whether the cache capacity check should be skipped.","Returns whether this configuration will instruct the lazy …","Returns whether this configuration has enabled anchored …","Returns whether this configuration has enabled heuristic …","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Set the desired match semantics.","Returns the total number of patterns that match in this …","Returns the pattern ID corresponding to the given match …","Returns the memory usage, in bytes, of this lazy DFA.","Returns the heap memory usage, in bytes, of this cache.","Configure a lazy DFA search to quit only when its …","Configure a lazy DFA search to quit after a certain number …","Create a new lazy DFA that never matches any input.","Parse the given regular expression using a default …","Create a new cache for the given lazy DFA.","Return a new default lazy DFA builder configuration.","Create a new lazy DFA builder with the default …","Parse the given regular expressions using a default …","Transitions from the current state to the next state for …","Transitions from the current state to the next state, …","Transitions from the current state to the next state, …","Transitions from the current state to the next state, …","Returns the total number of patterns compiled into this …","Set a prefilter to be used whenever a start state is …","Add a “quit” byte to the lazy DFA.","Reset this cache such that it can be used for searching …","Reset the given cache such that it can be used for …","Indicates that a search has finished at the given position.","Initializes a new search starting at the given position.","Returns the total number of bytes that have been searched …","Updates the current search to indicate that it has search …","Configures construction of a lazy DFA to use the minimum …","Enable specializing start states in the lazy DFA.","Create a new overlapping state that begins at the start …","Return the ID of the start state for this lazy DFA for the …","Return the ID of the start state for this lazy DFA when …","Return the ID of the start state for this lazy DFA when …","Whether to compile a separate start state for each pattern …","Set the syntax configuration for this builder using …","Set the Thompson NFA configuration for this builder using …","","","","","","","","","","","","","","","","Executes a forward search and returns the end position of …","Executes an overlapping forward search and returns the end …","Executes a reverse overlapping search and returns the …","Executes a reverse search and returns the start of the …","Writes the set of patterns that match anywhere in the …","","","","","","Heuristically enable Unicode word boundaries.","A builder for a regex based on a hybrid NFA/DFA.","A cache represents a partially computed forward and …","An iterator over all non-overlapping matches for an …","A regular expression that uses hybrid NFA/DFAs (also …","Return references to the forward and reverse caches, …","Return mutable references to the forward and reverse …","","","","","","","","","Build a regex from the given pattern.","Build a regex from its component forward and reverse …","Build a regex from the given patterns.","Return a builder for configuring the construction of a …","","","","","Create a new cache for this Regex.","","Set the lazy DFA compilation configuration for this …","Returns the start and end offset of the leftmost match. If …","Returns an iterator over all non-overlapping leftmost …","","","","","Return the underlying lazy DFA responsible for forward …","Return a reference to the forward cache.","Return a mutable reference to the forward cache.","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).","","Returns true if and only if this regex matches the given …","Returns the heap memory usage, in bytes, as a sum of the …","Parse the given regular expression using the default …","Create a new cache for the given Regex.","Create a new regex builder with the default configuration.","Like new, but parses multiple patterns into a single “…","","Returns the total number of patterns matched by this regex.","Reset this cache such that it can be used for searching …","Reset the given cache such that it can be used for …","Return the underlying lazy DFA responsible for reverse …","Return a reference to the reverse cache.","Return a mutable reference to the reverse cache.","Set the syntax configuration for this builder using …","Set the Thompson NFA configuration for this builder using …","","","","","","","","","","","Returns the start and end offset of the leftmost match. If …","","","","","An error that occurs when construction of a Regex fails.","A builder for configuring and constructing a Regex.","Represents mutable scratch space used by regex engines …","An iterator over all non-overlapping leftmost matches with …","An object describing the configuration of a Regex.","An iterator over all non-overlapping matches.","A regex matcher that works by composing several other …","Yields all substrings delimited by a regular expression …","Yields at most N spans delimited by a regular expression …","Toggles whether automatic prefilter support is enabled.","Toggle whether a bounded backtracking regex engine should …","","","","","","","","","","","","","","","","","","","Builds a Regex from a single pattern string.","Builds a Regex directly from an Hir expression.","Builds a Regex from many pattern strings.","Builds a Regex directly from many Hir expressions.","Return a builder for configuring the construction of a …","Whether to attempt to shrink the size of the alphabet for …","Executes a leftmost forward search and writes the spans of …","Returns an iterator over all non-overlapping Captures …","Returns the total number of capturing groups.","","","","","","","","","","","Return a default configuration for a Regex.","Configure the behavior of a Regex.","","","Creates a new cache for use with lower level search APIs …","Creates a new object for recording capture group offsets. …","","Toggle whether a fully compiled DFA should be available …","Sets the size limit, in bytes, for heap memory used for a …","Sets a limit on the total number of NFA states, beyond …","Executes a leftmost search and returns the first match …","Returns an iterator over all non-overlapping leftmost …","","","","","","","","","","","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns whether automatic prefilters are enabled, as set by","Returns whether the bounded backtracking regex engine may …","Returns whether byte classes are enabled, as set by …","Returns the configuration object used to build this Regex.","Returns whether the DFA regex engine may be used, as set by","Returns DFA size limit, as set by Config::dfa_size_limit.","Returns DFA size limit in terms of the number of states in …","Returns whether the hybrid NFA/DFA regex engine may be …","Returns hybrid NFA/DFA cache capacity, as set by …","Returns the line terminator for this configuration, as set …","Returns the match kind on this configuration, as set by …","Returns NFA size limit, as set by Config::nfa_size_limit.","Returns whether the one-pass DFA regex engine may be used, …","Returns one-pass DFA size limit, as set by …","Returns a manually set prefilter, if one was set by …","Returns whether empty matches must fall on valid UTF-8 …","Returns the capture configuration, as set by …","Return information about the capture groups in this Regex.","Toggle whether the hybrid NFA/DFA (also known as the “…","Set the cache capacity, in bytes, for the lazy DFA.","Returns the current Input associated with this iterator.","Returns the current Input associated with this iterator.","Returns the current Input associated with this iterator.","Returns the current Input associated with this iterator.","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","","","","","Returns true if this regex has a high chance of being “…","Returns true if and only if this regex matches the given …","Set the line terminator to be used by the ^ and $ anchors …","Set the match semantics for a Regex.","Return the total approximate heap memory, in bytes, used …","Returns the heap memory usage, in bytes, of this cache.","Builds a Regex from a single pattern string using the …","Creates a new Cache for use with this regex.","Create a new configuration object for a Regex.","Creates a new builder for configuring and constructing a …","Builds a Regex from many pattern strings using the default …","","","","","Sets the size limit, in bytes, to enforce on the …","Toggle whether a one-pass DFA should be available for use …","Sets the size limit, in bytes, for the one-pass DFA.","If it is known which pattern ID caused this build error to …","Returns the total number of patterns in this regex.","Overrides and sets the prefilter to use inside a Regex.","Returns the Regex value that created this iterator.","Returns the Regex value that created this iterator.","Reset this cache such that it can be used for searching …","Returns the start and end offset of the leftmost match. If …","Executes a leftmost forward search and writes the spans of …","This is like Regex::search_captures, but requires the …","Returns the end offset of the leftmost match. If no match …","This is like Regex::search_half, but requires the caller to","Executes a leftmost forward search and writes the spans of …","This is like Regex::search_slots, but requires the caller …","This is like Regex::search, but requires the caller to …","","If this error occurred because the regex exceeded the …","","Returns an iterator of spans of the haystack given, …","Returns an iterator of at most limit spans of the haystack …","Returns the total number of capturing groups that appear …","Configure the syntax options when parsing a pattern string …","If this error corresponds to a syntax error, then a …","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","Toggles whether empty matches are permitted to occur …","Configures what kinds of groups are compiled as “…","Writes the set of patterns that match anywhere in the …","This is like Regex::which_overlapping_matches, but …","Defines a Thompson NFA and provides the PikeVM and …","All capture states, including those corresponding to both …","An alternation such that there exists precisely two …","An error that can occurred during the construction of a …","An abstraction for building Thompson NFAs by hand.","A state with a single transition that can only be taken if …","An empty state that records a capture location.","A builder for compiling an NFA from a regex’s high-level …","The configuration used for a Thompson NFA compiler.","A dense representation of a state with multiple …","A sequence of transitions used to represent a dense state.","A state that cannot be transitioned out of. This is useful …","Only capture states corresponding to implicit capture …","A conditional epsilon transition satisfied via some sort of","A match state. There is at least one such occurrence of …","A byte oriented Thompson non-deterministic finite …","No capture states are compiled into the Thompson NFA.","An iterator over all pattern IDs in an NFA.","A state with possibly many transitions represented in a …","A sequence of transitions used to represent a sparse state.","A state in an NFA.","A single transition to another state.","An alternation such that there exists an epsilon …","A configuration indicating which kinds of State::Capture …","Add a “end capture” NFA state.","Add a “start capture” NFA state.","Add an “empty” NFA state.","Adds a “fail” NFA state.","Add a “look” NFA state.","Adds a “match” NFA state.","Add a “range” NFA state.","Add a “sparse” NFA state.","Add a “union” NFA state.","Add a “reverse union” NFA state.","Returns an NFA with a single regex pattern that always …","An NFA backed bounded backtracker for executing regex …","","","","","","","","","","","","","","","","","","","","","","","Assemble a NFA from the states added so far.","Compile the given regular expression pattern into an NFA.","Compile the given high level intermediate representation …","Compile the given regular expression patterns into a …","Compile the given high level intermediate representations …","Get the byte classes for this NFA.","Whether to include ‘Capture’ states in the NFA.","Clear this builder.","","","","","","","","","","","","","","","","","","","","","Return a compiler for configuring the construction of an …","Return a default configuration for an NFA.","Apply the given NFA configuration options to this builder.","Returns the pattern identifier of the current pattern.","","","","The inclusive end of the byte range.","","","","","Finish the assembly of a pattern in this NFA.","","","","","","","","","","","","","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Return whether NFA compilation is configured to produce …","Returns the look-around matcher used for this builder.","Return the look-around matcher for this NFA.","Return the configured NFA size limit, if it exists, in the …","Returns whether reverse mode is enabled for this builder.","Returns whether this configuration has enabled reverse NFA …","Return whether NFA shrinking is enabled.","Return the currently configured size limit.","Returns whether UTF-8 mode is enabled for this builder.","Returns whether this configuration has enabled UTF-8 mode.","Return what kinds of capture states will be compiled into …","Returns the capturing group info for this NFA.","Returns true if and only if this NFA has at least one …","Returns true if and only if this NFA can match the empty …","","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","","Returns true if and only if all starting states for this …","Returns true if this configuration indicates that some …","Returns true if and only if this state contains one or …","Returns true if this configuration indicates that no …","Returns true when this NFA is meant to be matched in …","Whether UTF-8 mode is enabled for this NFA or not.","Sets the look-around matcher that should be used with this …","Returns the look-around matcher associated with this NFA.","Returns the union of all look-around assertions used …","Returns the union of all prefix look-around assertions for …","This follows the matching transition for a particular byte.","This follows the matching transition for a particular byte.","Returns true if the position at in haystack falls in this …","This follows the matching transition for a particular byte.","This follows the matching transition for a particular byte.","Returns true if the given byte falls in this transition’…","Returns true if the given alphabet unit falls in this …","Returns the heap memory usage, in bytes, used by the NFA …","Returns the memory usage, in bytes, of this NFA.","Returns an NFA that never matches at any position.","Create a new builder for hand-assembling NFAs.","Return a new default Thompson NFA compiler configuration.","Create a new NFA builder with its default configuration.","Parse the given regular expression using a default …","Parse the given regular expressions using a default …","","The identifier of the state to transition to.","Sets an approximate size limit on the total heap used by …","Add a transition from one state to another.","Returns the number of patterns added to this builder so …","Returns the total number of regex patterns in this NFA.","Returns an iterator over all pattern identifiers in this …","An NFA backed Pike VM for executing regex searches with …","Reverse the NFA.","Sets the look-around matcher that should be used for the …","Sets whether the NFA produced by this builder should be …","Set the size limit on this builder.","Set whether the NFA produced by this builder should only …","Apply best effort heuristics to shrink the NFA at the …","If this error occurred because the NFA exceeded the …","","The inclusive start of the byte range.","Return the state identifier of the initial anchored state …","Start the assembly of a pattern in this NFA.","Return the state identifier of the initial anchored state …","Return the state identifier of the initial unanchored …","Return a reference to the NFA state corresponding to the …","Returns a slice of all states in this NFA.","Set the syntax configuration for this builder using …","","","","","","","","","","","","The sorted sequence of non-overlapping transitions.","A dense representation of this state’s transitions on …","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","Whether to enable UTF-8 mode during search or not.","Configures what kinds of capture groups are compiled into …","An unconditional epsilon transition to another NFA state. …","An unconditional epsilon transition to another NFA state. …","An ordered sequence of unconditional epsilon transitions …","The capture group index that this capture belongs to. …","The look-around assertion that must be satisfied before …","The state to transition to if the look-around assertion is …","The state to transition to, unconditionally.","The pattern ID that this capture belongs to.","The matching pattern ID.","The slot index for this capture. Every capturing group has …","The transition from this state to the next.","A backtracking regex engine that bounds its execution to …","A builder for a bounded backtracker.","A cache represents mutable state that a BoundedBacktracker …","The configuration used for building a bounded backtracker.","An iterator over all non-overlapping leftmost matches, …","An iterator over all non-overlapping matches for a …","Create a new BoundedBacktracker that matches every input.","","","","","","","","","","","","","Build a BoundedBacktracker from the given pattern.","Build a BoundedBacktracker directly from its NFA.","Build a BoundedBacktracker from the given patterns.","Return a builder for configuring the construction of a …","","","","","","","","","Return a default configuration for a BoundedBacktracker.","Apply the given BoundedBacktracker configuration options …","Create a new cache for this regex.","Create a new empty set of capturing groups that is …","","","","","","","","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Return the config for this BoundedBacktracker.","Returns a reference to the underlying NFA.","Returns the prefilter set in this configuration, if one at …","Returns the configured visited capacity.","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","","","Returns the maximum haystack length supported by this …","Returns the heap memory usage, in bytes, of this cache.","Returns the minimum visited capacity for the given …","Create a new BoundedBacktracker that never matches any …","Return a new default regex configuration.","Create a new BoundedBacktracker builder with its default …","Parse the given regular expression using the default …","Create a new BoundedBacktracker cache.","Example","Like new, but parses multiple patterns into a single “…","","","Returns the total number of patterns compiled into this …","Set a prefilter to be used whenever a start state is …","Reset this cache such that it can be used for searching …","Reset the given cache such that it can be used for …","Set the syntax configuration for this builder using …","Set the Thompson NFA configuration for this builder using …","","","","","Executes a leftmost forward search and writes the spans of …","Returns an iterator over all non-overlapping Captures …","Executes a leftmost forward search and returns a Match if …","Returns an iterator over all non-overlapping leftmost …","","","","","","","","","","","","","Returns true if and only if this regex matches the given …","Executes a leftmost forward search and writes the spans of …","Executes a leftmost forward search and writes the spans of …","","","","","","","Set the visited capacity used to bound backtracking.","A builder for a PikeVM.","A cache represents mutable state that a PikeVM requires …","An iterator over all non-overlapping leftmost matches, …","The configuration used for building a PikeVM.","An iterator over all non-overlapping matches for a …","A virtual machine for executing regex searches with …","Create a new PikeVM that matches every input.","","","","","","","","","","","","","Build a PikeVM from the given pattern.","Build a PikeVM directly from its NFA.","Build a PikeVM from the given patterns.","Return a builder for configuring the construction of a …","Executes a leftmost forward search and writes the spans of …","Returns an iterator over all non-overlapping Captures …","","","","","","","","","Return a default configuration for a PikeVM.","Apply the given PikeVM configuration options to this …","Create a new cache for this PikeVM.","Create a new empty set of capturing groups that is …","","Executes a leftmost forward search and returns a Match if …","Returns an iterator over all non-overlapping leftmost …","","","","","","","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Return the config for this PikeVM.","Returns the match semantics set in this configuration.","Returns a reference to the underlying NFA.","Returns the prefilter set in this configuration, if one at …","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","","","Returns true if and only if this PikeVM matches the given …","Set the desired match semantics.","Returns the heap memory usage, in bytes, of this cache.","Create a new PikeVM that never matches any input.","Return a new default PikeVM configuration.","Create a new PikeVM builder with its default configuration.","Parse the given regular expression using the default …","Create a new PikeVM cache.","Like new, but builds a PikeVM directly from an NFA. This …","Like new, but parses multiple patterns into a single “…","","","Returns the total number of patterns compiled into this …","Set a prefilter to be used whenever a start state is …","Reset this cache such that it can be used for searching …","Reset the given cache such that it can be used for …","Executes a leftmost forward search and writes the spans of …","Executes a leftmost forward search and writes the spans of …","Set the syntax configuration for this builder using …","Set the Thompson NFA configuration for this builder using …","","","","","","","","","","","","","","","","","","","","","","","Writes the set of patterns that match anywhere in the …","This module provides APIs for dealing with the alphabets …","Provides types for dealing with capturing groups.","Provides convenience routines for escaping raw bytes.","Provides routines for interpolating capture group …","Generic helpers for iteration of matches from a regex …","A lazily initialized value for safe sharing between …","Types and routines for working with look-around assertions.","A thread safe memory pool.","Defines a prefilter for accelerating regex searches.","Lower level primitive types that are useful in a variety …","Provides helpers for dealing with start state …","Utilities for dealing with the syntax of a regular …","Types and routines that support the wire format of finite …","An iterator over all elements in an equivalence class.","An iterator over each equivalence class.","An iterator over representative bytes from each …","A representation of byte oriented equivalence classes.","Unit represents a single unit of haystack for DFA based …","Return the total number of elements in the alphabet …","If this unit is an “end of input” sentinel, then …","If this unit is not an “end of input” sentinel, then …","Return this unit as a usize, regardless of whether it is a …","","","","","","","","","","","","","","","","","Returns an iterator of the bytes in the given equivalence …","Creates a new set of equivalence classes where all bytes …","Create a new “end of input” haystack unit.","Create a unit that represents the “end of input” …","","","","","","","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Get the equivalence class for the given byte.","Get the equivalence class for the given haystack unit and …","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","","","","Returns true if and only of this unit is a byte value …","Returns true when this unit represents an “end of input…","Returns true if and only if every byte in this class maps …","Returns true when this unit corresponds to an ASCII word …","Returns an iterator over all equivalence classes in this …","","","","","Returns an iterator over a sequence of representative …","Set the equivalence class for the given byte.","Creates a new set of equivalence classes where each byte …","Returns the stride, as a base-2 exponent, required for …","","","","","","","","","","","","","","","","","","Create a new haystack unit from a byte value.","The span offsets of capturing groups after a match has …","An iterator over all capturing groups in a Captures value.","Represents information about capturing groups in a …","An iterator over capturing groups and their names for a …","An error that may occur when building a GroupInfo.","An iterator over capturing groups and their names for a …","Create new storage for the offsets of all matching …","Return the total number of capture groups across all …","Return an iterator of all capture groups for all patterns …","","","","","","","","","","","","","Clear this Captures value.","","","","","","","","","","","","","","Create new storage for only tracking which pattern …","This creates an empty GroupInfo.","Returns the total number of slots for explicit capturing …","This is a convenience routine for extracting the substrings","This is a convenience routine for extracting the substrings","","","","","","","","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the span of a capturing group match corresponding …","Returns the span of a capturing group match corresponding …","Returns the pattern ID and the span of the match, if one …","Returns a reference to the underlying group info on which …","Return the total number of capturing groups for the …","Return the number of capture groups in a pattern.","Returns the total number of slots for implicit capturing …","Interpolates the capture references in replacement with the","Interpolates the capture references in replacement with the","Interpolates the capture references in replacement with the","Interpolates the capture references in replacement with the","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","","","","Returns true if and only if this capturing group …","Returns an iterator of possible spans for every capturing …","Create new storage for only the full match spans of a …","Returns the memory usage, in bytes, of this GroupInfo.","Creates a new group info from a sequence of patterns, …","","","","Returns the identifier of the pattern that matched when …","Returns the total number of patterns in this GroupInfo.","Return an iterator of all capture groups and their names …","Set the pattern on this Captures value.","","","Returns the starting slot corresponding to the given …","Returns the total number of slots in this GroupInfo across …","Returns the underlying slots, where each slot stores a …","Returns the starting and ending slot corresponding to the …","Returns the underlying slots as a mutable slice, where …","","Return the capture group index corresponding to the given …","Return the capture name for the given index and given …","","","","","","","","","","","","","","","","","","","","","","","","","Provides a convenient Debug implementation for a u8.","Provides a convenient Debug implementation for &[u8].","","","","","","","","","Returns the argument unchanged.","Returns the argument unchanged.","Calls U::from(self).","Calls U::from(self).","","","","","","","","Accepts a replacement byte string and interpolates capture …","Accepts a replacement string and interpolates capture …","An iterator over all non-overlapping captures for an …","An iterator over all non-overlapping half matches for an …","An iterator over all non-overlapping matches for an …","A searcher for creating iterators and performing lower …","An iterator over all non-overlapping captures for a …","An iterator over all non-overlapping half matches for a …","An iterator over all non-overlapping matches for a …","Return the next match for an infallible search if one …","Return the next half match for an infallible search if one …","","","","","","","","","","","","","","","","","","","","","","","","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Return an infallible version of this iterator.","Return an infallible version of this iterator.","Return an infallible version of this iterator.","Returns the current Input used by this iterator.","Returns the current Input used by this iterator.","Returns the current Input used by this searcher.","Returns the current Input used by this iterator.","Returns the current Input used by this iterator.","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Given a closure that executes a single search, return an …","Given a closure that executes a single search, return an …","","","","","","","Given a closure that executes a single search, return an …","Create a new fallible non-overlapping matches iterator.","","","","","","","","Return the next match for a fallible search if one exists, …","Return the next half match for a fallible search if one …","","","","","","","","","","","","","","","","","","","","","","A lazily initialized value that implements Deref for T.","","","","","Returns the argument unchanged.","Return a reference to the lazily initialized value.","Calls U::from(self).","Create a new Lazy value that is initialized via the given …","","","","Match the end of text. Specifically, this matches at the …","Match the end of a line or the end of text. Specifically, …","Match the end of a line or the end of text. Specifically, …","A look-around assertion.","A matcher for look-around assertions.","LookSet is a memory-efficient set of look-around …","An iterator over all look-around assertions in a LookSet.","Match the beginning of text. Specifically, this matches at …","Match the beginning of a line or the beginning of text. …","Match the beginning of a line or the beginning of text. …","An error that occurs when the Unicode-aware \\\\w class is …","Match an ASCII-only word boundary. That is, this matches a …","Match an ASCII-only negation of a word boundary.","Match the end of an ASCII-only word boundary. That is, …","Match the end half of an ASCII-only word boundary. That …","Match the end half of a Unicode word boundary. That is, …","Match the end of a Unicode word boundary. That is, this …","Match the start of an ASCII-only word boundary. That is, …","Match the start half of an ASCII-only word boundary. That …","Match the start half of a Unicode word boundary. That is, …","Match the start of a Unicode word boundary. That is, this …","Match a Unicode-aware word boundary. That is, this matches …","Match a Unicode-aware negation of a word boundary.","Returns a convenient single codepoint representation of …","Return the underlying representation of this look-around …","Checks that all assertions in this set can be matched.","The underlying representation this set is exposed to make …","","","","","","","","","","","Returns an error if and only if Unicode word boundary data …","","","","","","","","","","","Returns true if and only if the given look-around …","Returns true if and only if this set contains any anchor …","Returns true if and only if this set contains any “…","Returns true if and only if this set contains any “…","Returns true if and only if this set contains any “…","Returns true if and only if this set contains any “…","Returns true if and only if this set contains any word …","Returns true if and only if this set contains any ASCII …","Returns true if and only if this set contains any Unicode …","","","Create an empty set of look-around assertions.","","","","","","","","","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Given the underlying representation of a Look value, …","Create a full set of look-around assertions.","Returns the line terminator that was configured for this …","Return a new set that is equivalent to the original, but …","Returns a new set that is the intersection of this and the …","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","","Returns true if and only if this set is empty.","Returns true when Look::End is satisfied at the given …","Returns true when Look::EndCRLF is satisfied at the given …","Returns true when Look::EndLF is satisfied at the given …","Returns true when Look::Start is satisfied at the given …","Returns true when Look::StartCRLF is satisfied at the given","Returns true when Look::StartLF is satisfied at the given …","Returns true when Look::WordAscii is satisfied at the given","Returns true when Look::WordAsciiNegate is satisfied at …","Returns true when Look::WordEndAscii is satisfied at the …","Returns true when Look::WordEndHalfAscii is satisfied at …","Returns true when Look::WordEndHalfUnicode is satisfied at …","Returns true when Look::WordEndUnicode is satisfied at the …","Returns true when Look::WordStartAscii is satisfied at the …","Returns true when Look::WordStartHalfAscii is satisfied at …","Returns true when Look::WordStartHalfUnicode is satisfied …","Returns true when Look::WordStartUnicode is satisfied at …","Returns true when Look::WordUnicode is satisfied at the …","Returns true when Look::WordUnicodeNegate is satisfied at …","Returns an iterator over all of the look-around assertions …","Returns the total number of look-around assertions in this …","Returns true when the position at in haystack satisfies …","Returns true when all of the assertions in the given set …","Creates a new default matcher for look-around assertions.","","Return a LookSet from the slice given as a native endian …","Return a new set that is equivalent to the original, but …","Flip the look-around assertion to its equivalent for …","Updates this set in place with the result of inserting the …","Updates this set in place with the result of intersecting …","Sets the line terminator for use with (?m:^) and (?m:$).","Updates this set in place with the result of removing the …","Updates this set in place with the result of subtracting …","Updates this set in place with the result of unioning it …","Create a look-around set containing the look-around …","Returns a new set that is the result of subtracting the …","","","","","","","","","","","","","","","","","","","","","","Returns a new set that is the union of this and the one …","Write a LookSet as a native endian 32-bit integer to the …","A thread safe pool that works in an alloc-only context.","A guard that is returned when a caller requests a value …","","","","","","","","","Returns the argument unchanged.","Returns the argument unchanged.","Get a value from the pool. The caller is guaranteed to have","Calls U::from(self).","Calls U::from(self).","Create a new pool. The given closure is used to create …","Consumes this guard and puts it back into the pool.","","","","","","","A prefilter for accelerating regex searches.","","","","","Run this prefilter on haystack[span.start..end] and return …","","Returns the argument unchanged.","This attempts to extract prefixes from the given Hir …","This attempts to extract prefixes from the given Hir …","Calls U::from(self).","Implementations might return true here if they believe …","Return the length of the longest needle in this Prefilter","Returns the heap memory, in bytes, used by the underlying …","Create a new prefilter from a sequence of needles and a …","Returns the span of a prefix of …","","","","","The total number of values that can be represented as a …","The total number of values that can be represented.","The total number of values that can be represented.","The maximum index value.","The maximum value.","The maximum value.","A usize that can never be usize::MAX.","The identifier of a regex pattern, represented by a …","This error occurs when a value could not be constructed.","The number of bytes that a single small index uses in …","The number of bytes that a single value uses in memory.","The number of bytes that a single value uses in memory.","A type that represents a “small” index.","This error occurs when a small index could not be …","The identifier of a finite automaton state, represented by …","This error occurs when a value could not be constructed.","The zero index value.","The zero value.","The zero value.","Return the internal u32 of this small index represented as …","Return the internal value as a i32…","Return the internal value as a i32…","Return the internal u32 of this small index. This is …","Return the internal value as a u32. This is guaranteed to …","Return the internal value as a u32. This is guaranteed to …","Return this small index as a u64. This is guaranteed to …","Return the internal value as a u64. This is guaranteed to …","Return the internal value as a u64. This is guaranteed to …","Return this small index as a usize. This is guaranteed to …","Return the internal value as a usize. This is guaranteed to","Return the internal value as a usize. This is guaranteed to","Returns the value that could not be converted to a small …","Returns the value that could not be converted to an ID.","Returns the value that could not be converted to an ID.","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","Returns the argument unchanged.","Returns the argument unchanged.","","Returns the argument unchanged.","","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Decode this small index from the bytes given using the …","Decode this value from the bytes given using the native …","Decode this value from the bytes given using the native …","Decode this small index from the bytes given using the …","Decode this value from the bytes given using the native …","Decode this value from the bytes given using the native …","Return the underlying usize value. The returned value is …","","","","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Like SmallIndex::new, but panics if the given index is not …","Like new, but panics if the given value is not valid.","Like new, but panics if the given value is not valid.","Create a new NonMaxUsize from the given value.","Create a new small index.","Create a new value that is represented by a “small index.…","Create a new value that is represented by a “small index.…","Create a new small index without checking whether the …","Create a new value without checking whether the given …","Create a new value without checking whether the given …","Returns one more than this small index as a usize.","Returns one more than this value as a usize.","Returns one more than this value as a usize.","","","","Return the underlying small index integer as raw bytes in …","Return the underlying integer as raw bytes in native endian","Return the underlying integer as raw bytes in native endian","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","The configuration used to determine a DFA’s start state …","Set the anchored mode of a search.","","","","","","Returns the argument unchanged.","A convenience routine for building a start configuration …","A convenience routine for building a start configuration …","Return the anchored mode in this configuration.","Return the look-behind byte in this configuration, if one …","Calls U::from(self).","Set the look-behind byte at the start of a search.","Create a new default start configuration.","","","","","A common set of configuration options that apply to the …","","","Enable or disable the case insensitive flag by default.","","","Enable or disable the “CRLF mode” flag by default.","","Enable or disable the “dot matches any character” flag …","","Returns the argument unchanged.","Returns whether “case insensitive” mode is enabled.","Returns whether “CRLF” mode is enabled.","Returns whether “dot matches new line” mode is enabled.","Returns whether “ignore whitespace” mode is enabled.","Returns the line terminator in this syntax configuration.","Returns whether “multi line” mode is enabled.","Returns the “nest limit” setting.","Returns whether “octal” mode is enabled.","Returns whether “swap greed” mode is enabled.","Returns whether “unicode” mode is enabled.","Returns whether UTF-8 mode is enabled.","Enable verbose mode in the regular expression.","Calls U::from(self).","Sets the line terminator for use with (?u-s:.) and (?-us:.)…","Enable or disable the multi-line matching flag by default.","Set the nesting limit used for the regular expression …","Return a new default syntax configuration.","Whether to support octal syntax or not.","A convenience routine for parsing a pattern into an HIR …","A convenience routine for parsing many patterns into HIR …","A convenience routine for parsing many patterns into HIR …","A convenience routine for parsing a pattern into an HIR …","Enable or disable the “swap greed” flag by default.","","","","","Enable or disable the Unicode flag (u) by default.","When disabled, the builder will permit the construction of …","A hack to align a smaller type B with a bigger type T.","An error that occurs when deserializing an object defined …","An error that occurs when serializing an object from this …","A zero-sized field indicating the alignment we want.","","","","","","","A possibly non-sized field containing a sequence of bytes.","","","","","","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","","","","","","","","","","",""],"i":[12,0,14,0,14,0,12,0,0,0,0,2,2,0,0,0,0,14,0,14,2,1,6,1,7,8,9,3,10,11,2,12,13,14,6,1,7,8,9,3,10,11,2,12,13,14,3,3,6,1,7,8,9,3,10,11,2,12,13,14,6,1,7,8,9,3,10,11,2,12,13,14,6,7,3,6,12,0,1,1,9,7,6,7,7,8,9,3,2,12,13,14,6,1,7,8,9,3,10,10,11,2,12,13,13,14,6,6,1,1,7,7,8,9,3,10,11,2,12,13,14,13,1,1,1,1,6,7,8,9,1,13,0,3,6,1,7,8,9,3,10,11,2,12,13,14,11,2,1,1,7,9,3,3,3,13,7,9,3,0,8,9,1,8,9,3,13,11,11,0,7,8,6,8,9,2,13,1,7,9,1,1,1,1,1,1,11,1,9,1,9,7,6,1,7,8,9,3,10,11,2,12,13,14,10,13,6,6,6,6,6,1,7,8,9,3,10,11,2,12,13,14,3,6,1,7,8,9,3,10,11,2,12,13,14,6,1,7,8,9,3,10,11,2,12,13,14,13,0,142,143,144,142,145,0,0,0,0,0,0,36,36,41,38,36,42,37,41,38,36,42,37,38,38,38,36,41,36,41,38,36,42,37,41,38,36,42,37,36,38,36,36,41,36,41,38,36,42,37,37,41,38,36,42,37,41,36,41,36,41,41,41,38,36,42,37,36,41,36,42,36,41,38,36,42,36,36,36,42,36,41,37,41,36,36,36,38,38,41,38,36,42,37,37,41,38,36,42,37,41,38,36,42,37,36,36,41,38,36,42,37,0,49,0,0,49,0,49,48,49,50,51,48,49,50,51,48,49,50,51,48,49,50,51,51,51,0,51,48,48,49,49,50,50,51,48,49,50,51,51,48,49,50,51,51,51,51,51,51,51,51,0,48,49,48,49,50,51,48,49,50,48,49,50,51,48,49,50,51,48,49,50,51,146,147,148,0,0,0,0,0,52,52,56,55,53,57,52,56,55,53,57,53,53,53,52,52,55,55,56,52,56,55,53,57,52,56,55,53,57,52,53,52,55,57,52,56,55,53,57,52,56,55,53,57,55,55,52,57,55,55,55,55,52,55,55,55,55,55,55,52,56,55,53,57,55,52,52,52,56,55,55,52,52,56,55,53,52,52,52,52,52,52,55,55,56,52,56,56,56,56,55,55,57,52,52,52,55,53,53,52,56,55,53,57,52,56,55,53,57,52,56,55,53,57,52,52,52,52,52,52,56,55,53,57,55,0,0,0,0,60,60,62,63,60,61,62,63,60,61,61,61,61,62,60,61,60,61,62,61,61,62,62,62,63,60,61,62,60,60,62,63,60,61,62,63,60,61,63,62,60,62,60,61,62,63,62,60,62,62,60,60,61,61,60,61,62,63,60,61,62,63,60,61,62,62,63,60,61,0,0,0,0,0,0,0,0,0,64,64,67,66,72,70,73,74,71,64,65,67,66,72,70,73,74,71,64,65,65,65,65,65,66,64,66,66,66,67,66,71,64,65,67,66,71,64,65,66,65,72,70,66,66,64,64,64,64,66,66,67,67,66,72,70,73,74,71,64,65,67,66,72,70,73,74,71,64,65,64,64,64,66,64,64,64,64,64,64,64,64,64,64,64,64,64,66,64,64,72,70,73,74,67,66,72,70,73,74,71,64,65,72,70,73,74,66,66,64,64,66,71,66,71,64,65,66,72,70,73,74,64,64,64,67,66,64,72,70,71,66,66,66,66,66,66,66,66,74,67,67,66,66,66,65,67,67,66,71,64,65,67,67,66,72,70,73,74,71,64,65,67,66,72,70,73,74,71,64,65,67,66,72,70,73,74,71,64,65,64,64,66,66,0,75,86,0,0,86,86,0,0,86,0,86,75,86,86,0,75,0,86,0,0,0,86,0,78,78,78,78,78,78,78,78,78,78,40,0,78,46,75,85,80,40,86,87,88,83,89,78,46,75,85,80,40,86,87,88,83,89,78,85,85,85,85,40,46,78,78,46,75,85,80,40,86,87,88,83,78,46,75,85,80,40,86,87,88,83,40,40,85,78,78,46,75,83,86,87,88,83,78,78,46,75,85,80,80,40,86,87,88,83,89,78,46,75,85,80,40,86,87,88,83,89,46,78,46,46,78,46,46,78,78,46,46,40,40,40,83,78,46,75,85,80,40,86,87,88,83,89,89,40,75,86,75,40,40,46,40,40,40,87,88,83,87,88,83,83,78,40,40,78,46,85,40,40,89,83,46,78,78,40,40,0,46,78,78,78,78,46,80,80,83,40,78,40,40,40,40,85,78,46,75,85,80,40,86,87,88,83,80,87,88,78,46,75,85,80,40,86,87,88,83,89,78,46,75,85,80,40,86,87,88,83,89,78,46,75,85,80,40,86,87,88,83,89,46,46,149,149,150,151,152,152,151,151,153,151,154,0,0,0,0,0,0,93,95,94,93,97,98,96,95,94,93,97,98,96,94,94,94,93,95,94,93,96,95,94,93,96,93,94,93,93,95,95,94,93,97,98,96,95,94,93,97,98,96,93,93,95,95,95,94,93,97,98,96,97,98,93,96,0,93,95,94,93,96,93,93,97,98,93,95,96,93,94,94,95,94,93,96,93,93,93,93,95,94,93,97,98,96,95,94,93,97,98,96,93,93,93,95,94,93,97,98,96,95,0,0,0,0,0,0,99,103,100,99,104,102,101,103,100,99,104,102,101,100,100,100,99,99,99,103,100,99,101,103,100,99,101,99,100,99,99,103,99,99,103,100,99,104,102,101,103,100,99,104,102,101,99,103,99,103,103,100,99,104,102,101,104,102,99,103,101,99,103,100,99,101,99,99,104,102,99,103,101,99,99,99,100,100,103,100,99,101,103,100,99,104,102,101,103,100,99,104,102,101,103,100,99,104,102,101,99,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,54,92,92,92,92,54,106,107,105,92,54,106,107,105,92,54,92,54,92,54,54,54,92,54,92,92,54,106,107,105,92,54,106,107,105,54,54,92,54,106,107,105,106,107,105,92,92,54,92,54,106,107,105,92,54,54,54,54,92,54,92,54,106,107,105,92,54,106,107,105,92,54,106,107,105,92,0,0,0,0,0,0,43,76,76,43,109,76,110,111,108,43,109,76,110,111,108,43,43,109,76,110,111,43,109,76,110,111,109,111,76,43,76,76,43,43,43,109,76,110,110,111,108,43,109,76,110,111,108,43,43,43,43,43,76,76,43,43,43,43,43,109,76,110,111,108,109,111,108,43,43,43,76,76,109,111,108,43,76,76,43,109,111,76,76,43,76,43,110,76,76,43,109,76,110,111,110,43,109,76,110,111,108,43,109,76,110,111,108,43,109,76,110,111,108,0,0,116,115,116,115,115,115,116,115,116,115,116,115,115,116,115,116,115,116,115,0,0,0,0,0,0,0,0,0,119,119,120,121,122,119,123,125,126,120,121,122,119,123,125,126,119,119,120,121,122,119,123,125,126,120,121,122,119,123,125,126,120,121,122,120,121,119,123,125,120,121,122,119,123,125,126,119,119,120,121,122,123,125,126,119,119,120,121,122,123,125,126,119,119,119,120,121,122,119,123,125,126,120,121,122,119,123,125,126,120,121,122,119,123,125,126,0,127,127,127,127,127,127,127,127,127,127,127,82,82,82,0,0,0,0,82,82,82,0,82,82,82,82,82,82,82,82,82,82,82,82,82,82,91,91,82,91,131,90,130,82,91,131,90,130,130,82,91,131,90,130,82,91,131,90,130,91,91,91,91,91,91,91,91,91,91,90,91,82,91,82,91,131,90,130,130,82,91,131,90,130,82,91,90,91,91,82,91,131,90,130,131,91,90,90,90,90,90,90,90,90,90,90,90,90,90,90,90,90,90,90,91,91,90,90,90,131,91,91,82,91,91,90,91,91,91,91,91,82,91,131,90,130,130,82,91,131,90,130,82,91,131,90,130,82,91,131,90,130,91,91,0,0,134,132,134,132,132,132,134,132,134,132,134,134,132,134,132,134,132,134,132,134,132,0,58,58,58,58,58,58,58,58,58,58,58,58,58,58,58,58,58,58,58,135,6,79,135,6,79,0,0,0,135,6,79,0,0,0,0,135,6,79,135,6,79,135,6,79,135,6,79,135,6,79,137,31,138,47,135,137,79,31,138,47,135,137,79,31,138,47,135,137,79,31,138,47,135,137,79,31,138,47,135,79,135,79,47,135,137,79,31,138,47,135,137,137,79,31,31,138,138,47,135,135,137,79,79,31,138,135,6,79,135,6,79,47,47,135,79,47,135,137,79,31,138,135,6,79,47,135,6,79,135,6,79,135,6,79,47,135,79,135,6,79,47,135,137,79,31,138,137,31,138,47,135,135,135,135,135,137,79,79,79,79,79,31,138,47,135,137,79,31,138,47,135,137,79,31,138,0,59,59,59,59,59,59,59,59,59,59,59,59,59,59,59,59,59,59,0,45,45,45,45,45,45,45,45,45,45,45,45,45,45,45,45,45,45,45,45,45,45,45,45,45,45,45,45,0,0,0,0,45,45,45,45,45,45,45,0,0,0,139,139,140,141,139,140,141,139,139,140,140,141,141,139,140,141,139,140,141,140,141,139,140,141,139,140,141,139,140,141],"f":"`````````````````````{{bd}b}{ce{}{}}00000000000000000000000{fh}{fj}{ll}{bb}{nn}{A`A`}{AbAb}{ff}{AdAd}{AfAf}{dd}{AhAh}{AjAj}{AlAl}{{ce}j{}{}}00000000000{{ll}An}{{nh}B`}{{fl}B`}{{}l}{{}Ah}`{{bB`}b}{bh}{Abh}`{{ll}B`}{{n{Bb{h}}}B`}{{nn}B`}{{A`A`}B`}{{AbAb}B`}{{ff}B`}{{dd}B`}{{AhAh}B`}{{AjAj}B`}{{AlAl}B`}{{lBd}Bf}{{bBd}Bf}{{nBd}Bf}{{A`Bd}Bf}{{AbBd}Bf}{{fBd}Bf}{{AdBd}Bf}0{{AfBd}Bf}{{dBd}Bf}{{AhBd}Bf}{{AjBd}Bf}0{{AlBd}Bf}{cc{}}{Bhl}1{cb{Bj{Bn{{Bl{Bh}}}}}}2{{{Bb{h}}}n}333333333{hAj}{bd}{bB`}{b{{Bb{h}}}}{bn}{{lc}jC`}{{nc}jC`}{{A`c}jC`}{{Abc}jC`}{b{{Bl{Bh}}}}9`{{fl}B`}{ce{}{}}000000000000{dB`}{{bh}B`};{nB`}{AbB`}{fB`}0{fAf}{AjAl}{nh}{Abh}{fh}`{{hh}A`}{{hc}Ab{{Cb{n}}}}{cb{Bj{Bn{{Bl{Bh}}}}}}{{lh}A`}{{lc}Ab{{Cb{n}}}}{hf}{AlAj}{Af{{Cd{l}}}}0`{{nh}n}{A`h}{{ll}{{Cd{An}}}}{A`l}{Abl}{d{{Cd{l}}}}{{Bhh}Aj}{{bc}b{{Cf{h}}}}{n{{Bb{h}}}}{Ab{{Bb{h}}}}{{bd}j}{{bB`}j}{{bh}j}{{bc}j{{Cf{h}}}}{{bc}j{{Cb{n}}}}2{Af{{Ch{h{Cd{h}}}}}}{{bc}b{{Cb{n}}}}{Abn}{bh}{Abh}`{ce{}{}}00000000000{cCj{}}0{Cl{{D`{lCn}}}}{c{{D`{e}}}{}{}}{Db{{D`{lCn}}}}{Dd{{D`{lCn}}}}{h{{D`{lCn}}}}33333333333{{fl}{{D`{B`Ad}}}}444444444444{cDf{}}00000000000{dAj}````````````{Dhh}{{}{{D`{DhDj}}}};;;;;;;;;;{{DlDn}{{D`{DhDj}}}}{{DlE`}{{D`{DhDj}}}}{{Dl{Bl{c}}}{{D`{DhDj}}}{{Bn{Dn}}}}{{}Dl}{{EbB`}Eb}{{DhEdcEf}j{{Cb{b}}}}{EbEb}{DlDl}{DhDh}{EdEd}{DjDj}{{ce}j{}{}}0000{{}Eb}{{DlEb}Dl}{DhEd}{DhEf}3{{DhEdc}{{Cd{Ab}}}{{Cb{b}}}}{{EbBd}Bf}{{DlBd}Bf}{{DhBd}Bf}{{EdBd}Bf}{{DjBd}Bf}0{cc{}}0000{EbB`}{DhEb}{EbAh}{DhE`}{Eb{{Cd{h}}}}4{ce{}{}}0000{{DhEdc}B`{{Cb{b}}}}{{EbAh}Eb}{Dhh}{Edh}{{}{{D`{DhDj}}}}{{}Eb}{{}Dl}{Dn{{D`{DhDj}}}}{DhEd}{E`{{D`{DhDj}}}}{{{Bl{c}}}{{D`{DhDj}}}{{Bn{Dn}}}}8{{EdDh}j}{{DhEd}j}{{Eb{Cd{h}}}Eb}{Dj{{Cd{Eh}}}}{{EbB`}Eb}==={{DlEj}Dl}{{DlEl}Dl}{ce{}{}}0000{cCj{}}{c{{D`{e}}}{}{}}000000000{{DhEdbEf}{{D`{jAj}}}}{{DhEdb{Bl{{Cd{En}}}}}{{D`{{Cd{l}}Aj}}}}{cDf{}}0000```````55555555{F`F`}{FbFb}{FdFd}{FfFf}{{ce}j{}{}}000{{FfFf}An}{{}Ff}`{{FfFf}B`}{{F`Bd}Bf}0{{FbBd}Bf}0{{FdBd}Bf}0{{FfBd}Bf}{cc{}}000{{Ffc}jC`}{ce{}{}}000{FfB`}00000{{FfFf}{{Cd{An}}}}`{F`{{Cd{Eh}}}}{Fb{{Cd{Eh}}}}4444{cCj{}}00{c{{D`{e}}}{}{}}0000000{cDf{}}000````````{{}{{D`{FhF`}}}}8888888888{{FjDn}{{D`{FhF`}}}}{{FjE`}{{D`{FhF`}}}}{{Fj{Bl{c}}}{{D`{FhF`}}}{{Bn{Dn}}}}{{}Fj}{FhFl}{{FnB`}Fn}{{Fnh}Fn}{G`h}{FhFh}{G`G`}{FnFn}{FjFj}{GbGb}{{ce}j{}{}}0000{{}Fn}{{FjFn}Fj}{FhG`}2{{GbGb}B`}{{FhBd}Bf}{{G`Bd}Bf}{{FnBd}Bf}{{FjBd}Bf}{{GbBd}Bf}{cc{}}0000{FnB`}{Fnh}{FhFn}{Gb{{Cd{A`}}}}{FnAh}{Fn{{Cd{h}}}}{{FnE`}{{D`{hF`}}}}1{FhE`}{Fn{{Cd{Gd}}}}{{FnBh}B`}9999{ce{}{}}0000{{FnAh}Fn}{{FhG`Ff}h}{{FhG`Ffh}l}{Fhh}{G`h}{{Fn{Cd{h}}}Fn}0{{}{{D`{FhF`}}}}{Dn{{D`{FhF`}}}}{FhG`}{{}Fn}{{}Fj}{{{Bl{c}}}{{D`{FhF`}}}{{Bn{Dn}}}}{{FhG`Ff}{{D`{FfFd}}}}{{FhG`FfBh}{{D`{FfFd}}}}{{FhG`FfBh}Ff}0;{{Fn{Cd{Gd}}}Fn}{{FnBhB`}Fn}{{G`Fh}j}{{FhG`}j}{{G`h}j}0?0{{FnB`}Fn}0{{}Gb}{{FhG`Gf}{{D`{FfFb}}}}{{FhG`b}{{D`{FfAj}}}}03{{FjEj}Fj}{{FjEl}Fj}{ce{}{}}0000{c{{D`{e}}}{}{}}000000000{{FhG`b}{{D`{{Cd{A`}}Aj}}}}{{FhG`bGb}{{D`{jAj}}}}01{{FhG`bf}{{D`{jAj}}}}{cDf{}}0000;````{Gh{{Ch{G`G`}}}}066666666{{GjDn}{{D`{GlF`}}}}{{GjFhFh}Gl}{{Gj{Bl{c}}}{{D`{GlF`}}}{{Bn{Dn}}}}{{}Gj}{GhGh}{GjGj}{{ce}j{}{}}0{GlGh}4{{GjFn}Gj}{{GlGhc}{{Cd{Ab}}}{{Cb{b}}}}{{GlGhc}Gn{{Cb{b}}}}{{GlBd}Bf}{{GnBd}Bf}{{GhBd}Bf}{{GjBd}Bf}{GlFh}{GhG`}0{cc{}}000{ce{}{}}0000{{GlGhc}B`{{Cb{b}}}}{Ghh}{Dn{{D`{GlF`}}}}>{{}Gj}{{{Bl{c}}}{{D`{GlF`}}}{{Bn{Dn}}}}{Gn{{Cd{Ab}}}}{Glh}{{GhGl}j}{{GlGh}j}<;;{{GjEj}Gj}{{GjEl}Gj};;{c{{D`{e}}}{}{}}0000000{{GlGhb}{{D`{{Cd{Ab}}Aj}}}}{cDf{}}000`````````{{H`B`}H`}0??????????????????{{HbDn}{{D`{HdHf}}}}{{HbHh}{{D`{HdHf}}}}{{Hb{Bl{c}}}{{D`{HdHf}}}{{Bn{Dn}}}}{{Hb{Bl{c}}}{{D`{HdHf}}}{{Hj{Hh}}}}{{}Hb}5{{HdcEf}j{{Cb{b}}}}{{Hdc}Hl{{Cb{b}}}}{Hdh}{HfHf}{HdHd}{HnHn}{H`H`}{HbHb}{{ce}j{}{}}0000{{}H`}{{HbH`}Hb}{I`h}{Hlh}{HdHn}{HdEf}5{{H`B`}H`}{{H`{Cd{h}}}H`}0{{Hdc}{{Cd{Ab}}}{{Cb{b}}}}{{Hdc}I`{{Cb{b}}}}{{HfBd}Bf}0{{HdBd}Bf}{{I`Bd}Bf}{{HlBd}Bf}{{IbBd}Bf}{{IdBd}Bf}{{HnBd}Bf}{{H`Bd}Bf}{{HbBd}Bf}{cc{}}00000000{H`B`}00{HdH`}1{H`{{Cd{h}}}}02{H`h}{H`Bh}{H`Ah}353{H`{{Cd{Gd}}}}6{H`If}{HdIh}{{H`B`}H`}{{H`h}H`}{I`b}{Hlb}{Ibb}{Idb}{ce{}{}}000000000000{HdB`}{{Hdc}B`{{Cb{b}}}}{{H`Bh}H`}{{H`Ah}H`}{Hdh}{Hnh}{Dn{{D`{HdHf}}}}{HdHn}{{}H`}{{}Hb}{{{Bl{c}}}{{D`{HdHf}}}{{Bn{Dn}}}}{I`{{Cd{Ab}}}}{Hl{{Cd{Ef}}}}{Ib{{Cd{n}}}}{Id{{Cd{n}}}}{{H`{Cd{h}}}H`}{{H`B`}H`}1{Hf{{Cd{l}}}}={{H`{Cd{Gd}}}H`}{I`Hd}{HlHd}{{HnHd}j}{{Hdb}{{Cd{Ab}}}}{{HdbEf}j}{{HdHnbEf}j}{{Hdb}{{Cd{A`}}}}{{HdHnb}{{Cd{A`}}}}{{Hdb{Bl{{Cd{En}}}}}{{Cd{l}}}}{{HdHnb{Bl{{Cd{En}}}}}{{Cd{l}}}}{{HdHnb}{{Cd{Ab}}}}{Id{{Ch{h{Cd{h}}}}}}{Hf{{Cd{h}}}}{Hf{{Cd{Eh}}}}{{Hdc}Ib{{Cb{b}}}}{{Hdch}Id{{Cb{b}}}}{Hd{{Cd{h}}}}{{HbEj}Hb}{Hf{{Cd{Ij}}}}{ce{}{}}0000{cCj{}}{c{{D`{e}}}{}{}}00000000000000000{cDf{}}00000000{{H`B`}H`}{{H`If}H`}{{Hdbf}j}{{HdHnbf}j}````````````````````````{{IlInDb}{{D`{InJ`}}}}{{IlInDb{Cd{{Jb{Dn}}}}}{{D`{InJ`}}}}{Il{{D`{InJ`}}}}0{{IlInJd}{{D`{InJ`}}}}1{{IlJf}{{D`{InJ`}}}}{{Il{Jh{Jf}}}{{D`{InJ`}}}}{{Il{Jh{In}}}{{D`{InJ`}}}}0{{}E`}`??????????????????????{{IlInIn}{{D`{E`J`}}}}{{JjDn}{{D`{E`J`}}}}{{JjHh}{{D`{E`J`}}}}{{Jj{Bl{c}}}{{D`{E`J`}}}{{Bn{Dn}}}}{{Jj{Bl{c}}}{{D`{E`J`}}}{{Hj{Hh}}}}{E`Fl}{{ElB`}El}{Ilj}{IlIl}{ElEl}{IfIf}{JjJj}{J`J`}{E`E`}{JlJl}{JnJn}{K`K`}{JfJf}{{ce}j{}{}}000000000{{}Jj}{{}El}{{JjEl}Jj}{Ill}{{}Il}3{{}If}`{{JlJl}B`}{{JnJn}B`}{{K`K`}B`}{{JfJf}B`}{{IlIn}{{D`{lJ`}}}}{{IlBd}Bf}{{ElBd}Bf}{{IfBd}Bf}{{JjBd}Bf}{{J`Bd}Bf}0{{E`Bd}Bf}{{JlBd}Bf}{{JnBd}Bf}{{K`Bd}Bf}{{JfBd}Bf}{{KbBd}Bf}{cc{}}0000000000{ElB`}{IlKd}{ElKd}{El{{Cd{h}}}}{IlB`}44{Il{{Cd{h}}}}15{ElIf}{E`Ih}{E`B`}0{{Jfc}jC`}{ce{}{}}000000000002{IfB`}{JlB`}144{{ElKd}El}{E`Kd}{E`Kf}0{{Jn{Bl{Bh}}h}{{Cd{In}}}}{{K`{Bl{Bh}}h}{{Cd{In}}}}{{Jf{Bl{Bh}}h}B`}{{JnBh}{{Cd{In}}}}{{K`Bh}{{Cd{In}}}}{{JfBh}B`}{{JfKh}B`}{Ilh}{E`h}{{}E`}{{}Il}{{}El}{{}Jj}{Dn{{D`{E`J`}}}}{{{Bl{c}}}{{D`{E`J`}}}{{Bn{Dn}}}}{Kb{{Cd{l}}}}`{{El{Cd{h}}}El}{{IlInIn}{{D`{jJ`}}}}:9{E`Kb}`{{ElB`}El}{{IlKd}j}{{IlB`}j}{{Il{Cd{h}}}{{D`{jJ`}}}}13{J`{{Cd{h}}}}{J`{{Cd{Eh}}}}`{E`In}{Il{{D`{lJ`}}}}{{E`l}{{Cd{In}}}}2{{E`In}Jl}{E`{{Bl{Jl}}}}{{JjEj}Jj}{ce{}{}}000000000{cCj{}}``{c{{D`{e}}}{}{}}000000000000000000000{cDf{}}0000000000?{{ElIf}El}`````````````````{{}{{D`{KjJ`}}}}555555555555{{KlDn}{{D`{KjJ`}}}}{{KlE`}{{D`{KjJ`}}}}{{Kl{Bl{c}}}{{D`{KjJ`}}}{{Bn{Dn}}}}{{}Kl}{KnKn}{KlKl}{KjKj}{L`L`}{{ce}j{}{}}000{{}Kn}{{KlKn}Kl}{KjL`}{KjEf}3{{KnBd}Bf}{{KlBd}Bf}{{KjBd}Bf}{{LbBd}Bf}{{LdBd}Bf}{{L`Bd}Bf}{cc{}}00000{KjKn}{KjE`}{Kn{{Cd{Gd}}}}{Knh}{ce{}{}}0000000{Kjh}{L`h}{{E`b}h}{{}{{D`{KjJ`}}}}{{}Kn}{{}Kl}{Dn{{D`{KjJ`}}}}{KjL`}{E`{{D`{KjJ`}}}}{{{Bl{c}}}{{D`{KjJ`}}}{{Bn{Dn}}}}{Lb{{Cd{{D`{AbAj}}}}}}{Ld{{Cd{{D`{EfAj}}}}}};{{Kn{Cd{Gd}}}Kn}{{L`Kj}j}{{KjL`}j}{{KlEj}Kl}{{KlEl}Kl}{ce{}{}}000{{KjL`cEf}{{D`{jAj}}}{{Cb{b}}}}{{KjL`c}Ld{{Cb{b}}}}{{KjL`c}{{D`{{Cd{Ab}}Aj}}}{{Cb{b}}}}{{KjL`c}Lb{{Cb{b}}}}{c{{D`{e}}}{}{}}00000000000{{KjL`c}{{D`{B`Aj}}}{{Cb{b}}}}{{KjL`bEf}{{D`{jAj}}}}{{KjL`b{Bl{{Cd{En}}}}}{{D`{{Cd{l}}Aj}}}}{cDf{}}00000{{Knh}Kn}``````{{}{{D`{LfJ`}}}};;;;;;;;;;;;{{LhDn}{{D`{LfJ`}}}}{{LhE`}{{D`{LfJ`}}}}{{Lh{Bl{c}}}{{D`{LfJ`}}}{{Bn{Dn}}}}{{}Lh}{{LfLjcEf}j{{Cb{b}}}}{{LfLjc}Ll{{Cb{b}}}}{LnLn}{LhLh}{LfLf}{LjLj}{{ce}j{}{}}000{{}Ln}{{LhLn}Lh}{LfLj}{LfEf}3{{LfLjc}{{Cd{Ab}}}{{Cb{b}}}}{{LfLjc}M`{{Cb{b}}}}{{LnBd}Bf}{{LhBd}Bf}{{LfBd}Bf}{{M`Bd}Bf}{{LlBd}Bf}{{LjBd}Bf}{cc{}}00000{LfLn}{LnAh}{LfE`}{Ln{{Cd{Gd}}}}{ce{}{}}0000000{{LfLjc}B`{{Cb{b}}}}{{LnAh}Ln}{Ljh}{{}{{D`{LfJ`}}}}{{}Ln}{{}Lh}{Dn{{D`{LfJ`}}}}{LfLj}{E`{{D`{LfJ`}}}}{{{Bl{c}}}{{D`{LfJ`}}}{{Bn{Dn}}}}{M`{{Cd{Ab}}}}{Ll{{Cd{Ef}}}}{Lfh}{{Ln{Cd{Gd}}}Ln}{{LjLf}j}{{LfLj}j}{{LfLjbEf}j}{{LfLjb{Bl{{Cd{En}}}}}{{Cd{l}}}}{{LhEj}Lh}{{LhEl}Lh}{ce{}{}}000{c{{D`{e}}}{}{}}00000000000{cDf{}}00000{{LfLjbf}j}``````````````````{Flh}{Kh{{Cd{Cl}}}}{Kh{{Cd{Bh}}}}{Khh}7777777777{KhKh}{FlFl}{{ce}j{}{}}0{{KhKh}An}{{}Fl}{{FlKh}Mb}1{hKh}{FlKh}{{KhKh}B`}{{KhBd}Bf}{{FlBd}Bf}{{MdBd}Bf}{{MfBd}Bf}{{MbBd}Bf}{cc{}}0000{{FlBh}Bh}{{FlKh}h}{ce{}{}}0000000{{KhBh}B`}{KhB`}{FlB`}1{FlMd}{Md{{Cd{Kh}}}}{Mf{{Cd{Kh}}}}{Mb{{Cd{Kh}}}}{{KhKh}{{Cd{An}}}}{{Flc}Mf{{Cf{Bh}}}}{{FlBhBh}j}{{}Fl}{Flh}<<{c{{D`{e}}}{}{}}000000000{cDf{}}0000{BhKh}``````{IhEf}{Ihh}{IhMh}{ce{}{}}00000000000{Efj}{EfEf}{MjMj}{IhIh}{MlMl}{MnMn}{{ce}j{}{}}0000{Mjh}{Mnh}{{}Ih}=0<{{EfDn}{{Ch{Dn{N`{Dn}}}}}}{{Ef{Bl{Bh}}}{{Ch{{Bl{Bh}}{N`{{Bl{Bh}}}}}}}}{{EfBd}Bf}{{MjBd}Bf}{{IhBd}Bf}{{MlBd}Bf}0{{MnBd}Bf}{{MhBd}Bf}{cc{}}00000{{Efh}{{Cd{n}}}}{{EfDn}{{Cd{n}}}}{Ef{{Cd{Ab}}}}{EfIh}{Efh}{{Ihl}h}{Ihh}{{Ef{Bl{Bh}}{Bl{Bh}}}{{Jh{Bh}}}}{{Ef{Bl{Bh}}{Bl{Bh}}{Jh{Bh}}}j}{{EfDnDn}Cj}{{EfDnDnCj}j}{ce{}{}}00000000{EfB`}{EfMj}{IhEf}8{g{{D`{IhMl}}}{{Bn{Dn}}}{{Nd{}{{Nb{{Cd{c}}}}}}}{{Nd{}{{Nb{e}}}}}}{Mj{{Cd{{Cd{n}}}}}}{Mn{{Cd{{Cd{Dn}}}}}}{Mh{{Cd{{Ch{lh{Cd{Dn}}}}}}}}{Ef{{Cd{l}}}}={{Ihl}Mn}{{Ef{Cd{l}}}j}{Mj{{Ch{h{Cd{h}}}}}}{Mn{{Ch{h{Cd{h}}}}}}{{Ihlh}{{Cd{h}}}}{Ihh}{Ef{{Bl{{Cd{En}}}}}}{{Ihlh}{{Cd{{Ch{hh}}}}}}1{Ml{{Cd{Eh}}}}{{IhlDn}{{Cd{h}}}}{{Ihlh}{{Cd{Dn}}}}{ce{}{}}0000{cCj{}}{c{{D`{e}}}{}{}}00000000000{cDf{}}00000``3333{NfNf}{{ce}j{}{}}{{NhBd}Bf}{{NfBd}Bf}{cc{}}0888666655{{{Bl{Bh}}ce{Jh{Bh}}}j{{Nj{h{Jh{Bh}}}}}{{Nj{Dn}{{Nl{{Cd{h}}}}}}}}{{DnceCj}j{{Nj{hCj}}}{{Nj{Dn}{{Nl{{Cd{h}}}}}}}}```````{{Nnc}{{Cd{Ab}}}{{Nj{b}{{Nl{{D`{{Cd{Ab}}Aj}}}}}}}}{{Nnc}{{Cd{A`}}}{{Nj{b}{{Nl{{D`{{Cd{A`}}Aj}}}}}}}}<<<<<<<<<<<<<<{NnNn}8{{{O`{c}}Bd}Bf{}}{{{Ob{c}}Bd}Bf{}}{{{Od{c}}Bd}Bf{}}{{NnBd}Bf}{{{Of{c}}Bd}BfOh}{{{Oj{c}}Bd}BfOh}{{{Ol{c}}Bd}BfOh}<<<<<<<{{{O`{c}}}{{Of{c}}}{}}{{{Ob{c}}}{{Oj{c}}}{}}{{{Od{c}}}{{Ol{c}}}{}}{{{O`{c}}}b{}}{{{Ob{c}}}b{}}{Nnb}{{{Of{c}}}b{}}{{{Oj{c}}}b{}}{ce{}{}}000000{{NnEfc}{{Od{c}}}{{Nj{bEf}{{Nl{{D`{jAj}}}}}}}}{{Nnc}{{O`{c}}}{{Nj{b}{{Nl{{D`{{Cd{A`}}Aj}}}}}}}}222222{{Nnc}{{Ob{c}}}{{Nj{b}{{Nl{{D`{{Cd{Ab}}Aj}}}}}}}}{bNn}{{{O`{c}}}{{Cd{{D`{A`Aj}}}}}{{Nj{b}{{Nl{{D`{{Cd{A`}}Aj}}}}}}}}{{{Ob{c}}}{{Cd{{D`{AbAj}}}}}{{Nj{b}{{Nl{{D`{{Cd{Ab}}Aj}}}}}}}}{{{Od{c}}}{{Cd{{D`{EfAj}}}}}{{Nj{bEf}{{Nl{{D`{jAj}}}}}}}}{{{Of{c}}}{{Cd{A`}}}{{Nj{b}{{Nl{{D`{{Cd{A`}}Aj}}}}}}}}{{{Oj{c}}}{{Cd{Ab}}}{{Nj{b}{{Nl{{D`{{Cd{Ab}}Aj}}}}}}}}{{{Ol{c}}}{{Cd{Ef}}}{{Nj{bEf}{{Nl{{D`{jAj}}}}}}}}:{{Nnc}{{D`{{Cd{Ab}}Aj}}}{{Nj{b}{{Nl{{D`{{Cd{Ab}}Aj}}}}}}}}{{Nnc}{{D`{{Cd{A`}}Aj}}}{{Nj{b}{{Nl{{D`{{Cd{A`}}Aj}}}}}}}}{c{{D`{e}}}{}{}}0000000000000{cDf{}}000000`>>{{{On{ce}}}c{}{{A`{}{{Nl{c}}}}}}{{{On{ce}}Bd}BfOh{{A`{}{{Nl{c}}}}}}{cc{}}2{ce{}{}}{c{{On{ec}}}{}{}}665```````````````````````{JdAb}{JdDb}{Kf{{D`{jAd}}}}`4444444444{{}{{D`{jAd}}}}{JdJd}{KfKf}{AfAf}{KdKd}{AdAd}{{ce}j{}{}}0000{{KfJd}B`}{KfB`}0000000{{}Kf}{{}Kd}1{{JdJd}B`}{{KfKf}B`}{{JdBd}Bf}{{KfBd}Bf}{{AfBd}Bf}{{KdBd}Bf}{{AdBd}Bf}0{cc{}}0000{Db{{Cd{Jd}}}}:{KdBh}{{KfJd}Kf}{{KfKf}Kf}{ce{}{}}00000?{{Kd{Bl{Bh}}h}B`}000000000{{Kd{Bl{Bh}}h}{{D`{B`Ad}}}}0110000{KfAf}{Kfh}{{KdJd{Bl{Bh}}h}B`}{{KdKf{Bl{Bh}}h}B`}{{}Kd}{Af{{Cd{Jd}}}}{{{Bl{Bh}}}Kf};{JdJd}{{KfJd}j}{{KfKf}j}{{KdBh}Kd}211{JdKf}?>>>>>{cCj{}}{c{{D`{e}}}{}{}}000000000{cDf{}}0000{{KfKf}Kf}{{Kf{Bl{Bh}}}j}``{ce{}{}}000{{{Ah{ce}}}cAj{{A`{}{{Nl{c}}}}}}0{{{Al{ce}}Bd}BfOh{}}{{{Ah{ce}}Bd}Bf{AjOh}{{A`{}{{Nl{c}}}}}}{cc{}}0{{{Al{ce}}}{{Ah{ce}}}Aj{{A`{}{{Nl{c}}}}}}55{c{{Al{ec}}}{}{}}{{{Ah{ce}}}jAj{{A`{}{{Nl{c}}}}}};;;;::`77{GdGd}{{ce}j{}{}}{{Gd{Bl{Bh}}n}{{Cd{n}}}}{{GdBd}Bf}7{{AhHh}{{Cd{Gd}}}}{{Ah{Bl{c}}}{{Cd{Gd}}}{{Hj{Hh}}}}={GdB`}{Gdh}0{{Ah{Bl{c}}}{{Cd{Gd}}}{{Bn{{Bl{Bh}}}}}}6{ce{}{}}{c{{D`{e}}}{}{}}0{cDf{}}```````````````````{AnAA`}{lAA`}{InAA`}{AnDb}{lDb}{InDb}{AnDd}{lDd}{InDd}{Anh}{lh}{Inh}{AAbDd}{CnDd}{AAdDd}{ce{}{}}00000000000{EnEn}{AnAn}{AAbAAb}{InIn}{CnCn}{AAdAAd}{{ce}j{}{}}00000{{EnEn}An}{{AnAn}An}{{InIn}An}{{}An}{{}In}{{EnEn}B`}{{AnAn}B`}{{AAbAAb}B`}{{InIn}B`}{{CnCn}B`}{{AAdAAd}B`}{{EnBd}Bf}{{AnBd}Bf}{{AAbBd}Bf}0{{InBd}Bf}{{CnBd}Bf}0{{AAdBd}Bf}0{cc{}}0{BhAn}1{BhIn}222{{{N`{Bh}}}{{D`{AnAAb}}}}{{{N`{Bh}}}{{D`{lCn}}}}{{{N`{Bh}}}{{D`{InAAd}}}}{{{N`{Bh}}}An}{{{N`{Bh}}}l}{{{N`{Bh}}}In}{Enh}{{Enc}jC`}{{Anc}jC`}{{Inc}jC`}{ce{}{}}00000{hAn}{hl}{hIn}{h{{Cd{En}}}}{h{{D`{AnAAb}}}}{h{{D`{lCn}}}}{h{{D`{InAAd}}}}654{Anh}{lh}{Inh}{{EnEn}{{Cd{An}}}}{{AnAn}{{Cd{An}}}}{{InIn}{{Cd{An}}}}{An{{N`{Bh}}}}{l{{N`{Bh}}}}{In{{N`{Bh}}}}{ce{}{}}00000{cCj{}}00{c{{D`{e}}}{}{}}0{Cl{{D`{AnAAb}}}}{Db{{D`{AnAAb}}}}{Dd{{D`{AnAAb}}}}{h{{D`{AnAAb}}}}4{Dd{{D`{InAAd}}}}5{Db{{D`{InAAd}}}}{h{{D`{InAAd}}}}{Cl{{D`{InAAd}}}}88888888{cDf{}}00000`{{Gfd}Gf}<<{GfGf}{{ce}j{}{}}{{GfBd}Bf}{cc{}}{bGf}0{Gfd}{Gf{{Cd{Bh}}}}{ce{}{}}{{Gf{Cd{Bh}}}Gf}{{}Gf}2{c{{D`{e}}}{}{}}0<`33{{EjB`}Ej}{EjEj};1{{}Ej}2{{EjBd}Bf};{EjB`}000{EjBh}1{EjDb}22226:{{EjBh}Ej}7{{EjDb}Ej}68{Dn{{D`{HhIj}}}}{{{Bl{c}}}{{D`{{Jh{Hh}}Ij}}}{{Bn{Dn}}}}{{{Bl{c}}Ej}{{D`{{Jh{Hh}}Ij}}}{{Bn{Dn}}}}{{DnEj}{{D`{HhIj}}}}<{ce{}{}}>>{cDf{}}>>````111111`{{{AAf{ce}}Bd}Bf{OhBj}Oh}{{AAhBd}Bf}0{{AAjBd}Bf}0{cc{}}00555{cCj{}}0{c{{D`{e}}}{}{}}00000666","c":[896,954],"p":[[5,"Input",0],[6,"Anchored",0],[5,"PatternSet",0],[1,"usize"],[1,"unit"],[5,"PatternID",0],[5,"Span",0],[5,"HalfMatch",0],[5,"Match",0],[5,"PatternSetInsertError",0],[5,"PatternSetIter",0],[6,"MatchKind",0],[5,"MatchError",0],[6,"MatchErrorKind",0],[6,"Ordering",2080],[1,"bool"],[5,"Range",2081],[5,"Formatter",2082],[8,"Result",2082],[1,"u8"],[10,"Sized",2083],[1,"slice"],[10,"AsRef",2084],[10,"Hasher",2085],[10,"Into",2084],[6,"Option",2086],[10,"RangeBounds",2081],[1,"tuple"],[5,"String",2087],[1,"u16"],[5,"PatternIDError",1832],[6,"Result",2088],[1,"u32"],[1,"u64"],[5,"TypeId",2089],[5,"DFA",255],[5,"BuildError",255],[5,"Builder",255],[1,"str"],[5,"NFA",833],[5,"Config",255],[5,"Cache",255],[5,"Captures",1398],[10,"Error",2090],[5,"Config",2007],[5,"Config",833],[5,"NonMaxUsize",1832],[5,"BuildError",361],[6,"StartError",361],[5,"CacheError",361],[5,"LazyStateID",361],[5,"DFA",436],[5,"Builder",436],[5,"ByteClasses",1317],[5,"Config",436],[5,"Cache",436],[5,"OverlappingState",436],[5,"Prefilter",1812],[5,"Config",1988],[5,"Cache",566],[5,"Builder",566],[5,"Regex",566],[5,"FindMatches",566],[5,"Config",639],[5,"Builder",639],[5,"Regex",639],[5,"BuildError",639],[5,"Hir",2091],[10,"Borrow",2092],[5,"CapturesMatches",639],[5,"Cache",639],[5,"FindMatches",639],[5,"Split",639],[5,"SplitN",639],[6,"WhichCaptures",833],[5,"GroupInfo",1398],[6,"Error",2093],[5,"Builder",833],[5,"StateID",1832],[5,"BuildError",833],[5,"Arc",2094],[6,"Look",1646],[5,"Transition",833],[5,"Vec",2095],[5,"Compiler",833],[6,"State",833],[5,"SparseTransitions",833],[5,"DenseTransitions",833],[5,"PatternIter",833],[5,"LookMatcher",1646],[5,"LookSet",1646],[5,"Unit",1317],[5,"BoundedBacktracker",1089],[5,"Builder",1089],[5,"Config",1089],[5,"Cache",1089],[5,"TryFindMatches",1089],[5,"TryCapturesMatches",1089],[5,"PikeVM",1197],[5,"Builder",1197],[5,"Cache",1197],[5,"CapturesMatches",1197],[5,"Config",1197],[5,"FindMatches",1197],[5,"ByteClassElements",1317],[5,"ByteClassIter",1317],[5,"ByteClassRepresentatives",1317],[5,"GroupInfoAllNames",1398],[5,"CapturesPatternIter",1398],[5,"GroupInfoError",1398],[5,"GroupInfoPatternNames",1398],[1,"array"],[17,"Item"],[10,"IntoIterator",2096],[5,"DebugByte",1517],[5,"DebugHaystack",1517],[10,"FnMut",2097],[17,"Output"],[5,"Searcher",1540],[5,"TryHalfMatchesIter",1540],[5,"TryMatchesIter",1540],[5,"TryCapturesIter",1540],[5,"HalfMatchesIter",1540],[10,"Debug",2082],[5,"MatchesIter",1540],[5,"CapturesIter",1540],[5,"Lazy",1634],[10,"Fn",2097],[1,"char"],[5,"UnicodeWordBoundaryError",1646],[5,"LookSetIter",1646],[5,"PoolGuard",1789],[10,"Send",2083],[5,"Pool",1789],[5,"SmallIndex",1832],[1,"i32"],[5,"SmallIndexError",1832],[5,"StateIDError",1832],[5,"AlignAs",2047],[5,"SerializeError",2047],[5,"DeserializeError",2047],[15,"Quit",249],[15,"HaystackTooLong",249],[15,"UnsupportedAnchored",249],[15,"GaveUp",249],[15,"Quit",433],[15,"Cache",433],[15,"UnsupportedAnchored",433],[15,"BinaryUnion",1078],[15,"Union",1078],[15,"Capture",1078],[15,"Look",1078],[15,"Match",1078],[15,"ByteRange",1078]],"b":[[83,"impl-PartialEq%3CRange%3Cusize%3E%3E-for-Span"],[84,"impl-PartialEq-for-Span"],[98,"impl-Debug-for-PatternSetInsertError"],[99,"impl-Display-for-PatternSetInsertError"],[103,"impl-Display-for-MatchError"],[104,"impl-Debug-for-MatchError"],[206,"impl-TryFrom%3Cu16%3E-for-PatternID"],[208,"impl-TryFrom%3Cu32%3E-for-PatternID"],[209,"impl-TryFrom%3Cu64%3E-for-PatternID"],[210,"impl-TryFrom%3Cusize%3E-for-PatternID"],[298,"impl-Debug-for-BuildError"],[299,"impl-Display-for-BuildError"],[388,"impl-Debug-for-BuildError"],[389,"impl-Display-for-BuildError"],[390,"impl-Display-for-StartError"],[391,"impl-Debug-for-StartError"],[392,"impl-Display-for-CacheError"],[393,"impl-Debug-for-CacheError"],[699,"impl-Debug-for-BuildError"],[700,"impl-Display-for-BuildError"],[935,"impl-Debug-for-BuildError"],[936,"impl-Display-for-BuildError"],[1441,"impl-Display-for-GroupInfoError"],[1442,"impl-Debug-for-GroupInfoError"],[1712,"impl-Display-for-UnicodeWordBoundaryError"],[1713,"impl-Debug-for-UnicodeWordBoundaryError"],[1903,"impl-Display-for-SmallIndexError"],[1904,"impl-Debug-for-SmallIndexError"],[1906,"impl-Display-for-PatternIDError"],[1907,"impl-Debug-for-PatternIDError"],[1908,"impl-Debug-for-StateIDError"],[1909,"impl-Display-for-StateIDError"],[1964,"impl-TryFrom%3Cu16%3E-for-SmallIndex"],[1965,"impl-TryFrom%3Cu32%3E-for-SmallIndex"],[1966,"impl-TryFrom%3Cu64%3E-for-SmallIndex"],[1967,"impl-TryFrom%3Cusize%3E-for-SmallIndex"],[1969,"impl-TryFrom%3Cu64%3E-for-StateID"],[1971,"impl-TryFrom%3Cu32%3E-for-StateID"],[1972,"impl-TryFrom%3Cusize%3E-for-StateID"],[1973,"impl-TryFrom%3Cu16%3E-for-StateID"],[2059,"impl-Display-for-SerializeError"],[2060,"impl-Debug-for-SerializeError"],[2061,"impl-Debug-for-DeserializeError"],[2062,"impl-Display-for-DeserializeError"]]}],\ -["regex_syntax",{"doc":"This crate provides a robust regular expression parser.","t":"GPFFPFCNNNNNNNNNNNNNNNNNNNNHHNNNNNNNNNNNNCNNNNNHHHHNNNNNNHNNNNNNNNNNNNNNNHNNNNNCNPPFPPPFPGGPPPPPPPPPFPPPFGFPPFPGPPGFGGFFPFPGGPPFFPPPPPPPPPPPPPRFGPPPPPPGPPPPPPFPFGPPFPGPPPPPPPPGPPPPFPPGPPPPPPPPPPPPPRPFPPPPFPPPPGPFGFPPPFPGPPPPPPPPPPPPPPPPPPPPKFPPPPPPPPPPPPPNNNOOOOONNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNONNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNOOONNNNNNOONNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNMNNNONNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNONONNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNOONOOOOOOOOOOOONOOOOONNOOCNNNCNNONNNNOOOOOOOOOOOOOOOOOOONNNOONNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNHNNNNNNNNNNNNNNNNNNNNOOOOOOOOFFNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNFNNNNNNNNNNPPPPPPPPPPFPFGPFFFFFFPGPPPPRFGFGPPFPGPFFRFFPPPPPPPPPPKPPPPPPPPPPPPNNNONNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNMNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNOONNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNCNNNNNNNNNNONNNNNONNNNONNNNNNNNNNNNNCNNNNNNNNNNNNNNNNNNNNNOONNNNNNNNNNNNNNNNNNNNNNNNNNNCNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNHNNNNNNNNNNGFFPFPNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNHNNNNNNNNNNNNNNNNNNNNNNFNNNNNNNNNNFFNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNPPPPFGFNNNNNNNNNNNNNONNNNNNNNNNNNNNNNNNNNNONNNNNNNNNNN","n":["Error","Parse","Parser","ParserBuilder","Translate","UnicodeWordError","ast","borrow","borrow","borrow","borrow","borrow_mut","borrow_mut","borrow_mut","borrow_mut","build","case_insensitive","clone","clone","clone","clone_into","clone_into","clone_into","crlf","default","dot_matches_new_line","eq","escape","escape_into","fmt","fmt","fmt","fmt","fmt","fmt","from","from","from","from","from","from","hir","ignore_whitespace","into","into","into","into","is_escapeable_character","is_meta_character","is_word_byte","is_word_character","line_terminator","multi_line","nest_limit","new","new","octal","parse","parse","swap_greed","to_owned","to_owned","to_owned","to_string","to_string","try_from","try_from","try_from","try_from","try_into","try_into","try_into","try_into","try_is_word_character","type_id","type_id","type_id","type_id","unicode","utf8","utf8","Alnum","Alpha","Alternation","Alternation","Ascii","Ascii","Assertion","Assertion","AssertionKind","Ast","AtLeast","Bell","BinaryOp","Blank","Bounded","Bracketed","CRLF","CaptureIndex","CaptureLimitExceeded","CaptureName","CaptureName","CarriageReturn","CaseInsensitive","ClassAscii","ClassAsciiKind","ClassBracketed","ClassBracketed","ClassEscapeInvalid","ClassPerl","ClassPerl","ClassPerlKind","ClassRangeInvalid","ClassRangeLiteral","ClassSet","ClassSetBinaryOp","ClassSetBinaryOpKind","ClassSetItem","ClassSetRange","ClassSetUnion","ClassUnclosed","ClassUnicode","ClassUnicode","ClassUnicodeKind","ClassUnicodeOpKind","Cntrl","Colon","Comment","Concat","Concat","DecimalEmpty","DecimalInvalid","Difference","Digit","Digit","Dot","DotMatchesNewLine","Empty","Empty","EndLine","EndText","Equal","Err","Error","ErrorKind","EscapeHexEmpty","EscapeHexInvalid","EscapeHexInvalidDigit","EscapeUnexpectedEof","EscapeUnrecognized","Exactly","Flag","Flag","FlagDanglingNegation","FlagDuplicate","FlagRepeatedNegation","FlagUnexpectedEof","FlagUnrecognized","Flags","Flags","FlagsItem","FlagsItemKind","FormFeed","Graph","Group","Group","GroupKind","GroupNameDuplicate","GroupNameEmpty","GroupNameInvalid","GroupNameUnexpectedEof","GroupUnclosed","GroupUnopened","HexBrace","HexFixed","HexLiteralKind","IgnoreWhitespace","Intersection","Item","LineFeed","Literal","Literal","Literal","LiteralKind","Lower","Meta","MultiLine","Named","NamedValue","Negation","NestLimitExceeded","NonCapturing","NotEqual","NotWordBoundary","Octal","OneLetter","OneOrMore","Output","Perl","Position","Print","Punct","Range","Range","Repetition","Repetition","RepetitionCountDecimalEmpty","RepetitionCountInvalid","RepetitionCountUnclosed","RepetitionKind","RepetitionMissing","RepetitionOp","RepetitionRange","SetFlags","Space","Space","Space","Span","Special","SpecialLiteralKind","SpecialWordBoundaryUnclosed","SpecialWordBoundaryUnrecognized","SpecialWordOrRepetitionUnexpectedEof","StartLine","StartText","Superfluous","SwapGreed","SymmetricDifference","Tab","Unicode","Unicode","UnicodeClassInvalid","UnicodeLong","UnicodeShort","Union","UnsupportedBackreference","UnsupportedLookAround","Upper","Verbatim","VerticalTab","Visitor","WithComments","Word","Word","WordBoundary","WordBoundaryEnd","WordBoundaryEndAngle","WordBoundaryEndHalf","WordBoundaryStart","WordBoundaryStartAngle","WordBoundaryStartHalf","X","Xdigit","ZeroOrMore","ZeroOrOne","add_item","alternation","assertion","ast","ast","ast","asts","asts","auxiliary_span","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","byte","c","capture_index","class_bracketed","class_perl","class_unicode","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","cmp","cmp","column","comment","comments","concat","digits","dot","drop","drop","empty","end","end","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","finish","flag_state","flags","flags","flags","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from_name","greedy","group","index","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into_ast","into_ast","into_item","is_capturing","is_empty","is_empty","is_equal","is_negated","is_negation","is_one_line","is_valid","is_valid","items","items","kind","kind","kind","kind","kind","kind","kind","kind","kind","kind","kind","lhs","line","literal","name","negated","negated","negated","negated","new","new","offset","op","parse","partial_cmp","partial_cmp","pattern","print","push","repetition","rhs","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","splat","start","start","start","start","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_string","to_string","to_string","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","union","visit","visit_alternation_in","visit_alternation_in","visit_class_set_binary_op_in","visit_class_set_binary_op_in","visit_class_set_binary_op_post","visit_class_set_binary_op_post","visit_class_set_binary_op_pre","visit_class_set_binary_op_pre","visit_class_set_item_post","visit_class_set_item_post","visit_class_set_item_pre","visit_class_set_item_pre","visit_concat_in","visit_concat_in","visit_post","visit_post","visit_pre","visit_pre","with_end","with_start","name","op","value","original","original","original","name","starts_with_p","Parser","ParserBuilder","borrow","borrow","borrow_mut","borrow_mut","build","clone","clone","clone_into","clone_into","default","empty_min_range","fmt","fmt","from","from","ignore_whitespace","into","into","nest_limit","new","new","octal","parse","parse_with_comments","to_owned","to_owned","try_from","try_from","try_into","try_into","type_id","type_id","Printer","borrow","borrow_mut","fmt","from","into","new","print","try_from","try_into","type_id","Alternation","AnyByte","AnyByteExcept","AnyByteExceptCRLF","AnyByteExceptLF","AnyChar","AnyCharExcept","AnyCharExceptCRLF","AnyCharExceptLF","Bytes","Capture","Capture","CaseFoldError","Class","Class","ClassBytes","ClassBytesIter","ClassBytesRange","ClassUnicode","ClassUnicodeIter","ClassUnicodeRange","Concat","Dot","Empty","End","EndCRLF","EndLF","Err","Error","ErrorKind","Hir","HirKind","InvalidLineTerminator","InvalidUtf8","Literal","Literal","Look","Look","LookSet","LookSetIter","Output","Properties","Repetition","Repetition","Start","StartCRLF","StartLF","Unicode","UnicodeCaseUnavailable","UnicodeNotAllowed","UnicodePerlClassNotFound","UnicodePropertyNotFound","UnicodePropertyValueNotFound","Visitor","WordAscii","WordAsciiNegate","WordEndAscii","WordEndHalfAscii","WordEndHalfUnicode","WordEndUnicode","WordStartAscii","WordStartHalfAscii","WordStartHalfUnicode","WordStartUnicode","WordUnicode","WordUnicodeNegate","alternation","as_char","as_repr","bits","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","capture","case_fold_simple","case_fold_simple","case_fold_simple","class","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","cmp","cmp","concat","contains","contains_anchor","contains_anchor_crlf","contains_anchor_haystack","contains_anchor_lf","contains_anchor_line","contains_word","contains_word_ascii","contains_word_unicode","default","default","default","difference","difference","dot","drop","empty","empty","empty","empty","end","end","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","explicit_captures_len","fail","finish","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from_repr","full","greedy","index","insert","intersect","intersect","intersect","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into_iter","into_iter","into_iter","into_kind","is_alternation_literal","is_ascii","is_ascii","is_empty","is_empty","is_literal","is_utf8","is_utf8","iter","iter","iter","kind","kind","len","len","len","literal","literal","literal","literal","literal","look","look_set","look_set_prefix","look_set_prefix_any","look_set_suffix","look_set_suffix_any","max","maximum_len","maximum_len","maximum_len","maximum_len","memory_usage","min","minimum_len","minimum_len","minimum_len","minimum_len","name","negate","negate","negate","new","new","new","new","next","next","next","partial_cmp","partial_cmp","pattern","print","properties","push","push","ranges","ranges","read_repr","remove","repetition","reversed","set_insert","set_intersect","set_remove","set_subtract","set_union","singleton","span","start","start","start","start","static_explicit_captures_len","sub","sub","subs","subtract","symmetric_difference","symmetric_difference","to_byte_class","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_string","to_string","to_string","to_string","to_unicode_class","translate","try_case_fold_simple","try_case_fold_simple","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","union","union","union","union","visit","visit_alternation_in","visit_alternation_in","visit_concat_in","visit_concat_in","visit_post","visit_post","visit_pre","visit_pre","with","write_repr","ExtractKind","Extractor","Literal","Prefix","Seq","Suffix","as_bytes","as_ref","borrow","borrow","borrow","borrow","borrow_mut","borrow_mut","borrow_mut","borrow_mut","clone","clone","clone","clone","clone_into","clone_into","clone_into","clone_into","cmp","cross_forward","cross_reverse","dedup","default","default","empty","eq","eq","exact","extend","extract","fmt","fmt","fmt","fmt","from","from","from","from","from","from","from_iter","inexact","infinite","into","into","into","into","into_bytes","is_empty","is_empty","is_exact","is_exact","is_finite","is_inexact","is_prefix","is_suffix","keep_first_bytes","keep_first_bytes","keep_last_bytes","keep_last_bytes","kind","len","len","limit_class","limit_literal_len","limit_repeat","limit_total","literals","longest_common_prefix","longest_common_suffix","make_inexact","make_inexact","make_infinite","max_cross_len","max_literal_len","max_union_len","min_literal_len","minimize_by_preference","new","new","optimize_for_prefix_by_preference","optimize_for_suffix_by_preference","partial_cmp","push","rank","reverse","reverse_literals","singleton","sort","to_owned","to_owned","to_owned","to_owned","try_from","try_from","try_from","try_from","try_into","try_into","try_into","try_into","type_id","type_id","type_id","type_id","union","union_into_empty","Printer","borrow","borrow_mut","fmt","from","into","new","print","try_from","try_into","type_id","Translator","TranslatorBuilder","borrow","borrow","borrow_mut","borrow_mut","build","case_insensitive","clone","clone","clone_into","clone_into","crlf","default","dot_matches_new_line","fmt","fmt","from","from","into","into","line_terminator","multi_line","new","new","swap_greed","to_owned","to_owned","translate","try_from","try_from","try_into","try_into","type_id","type_id","unicode","utf8","Four","One","Three","Two","Utf8Range","Utf8Sequence","Utf8Sequences","as_slice","borrow","borrow","borrow","borrow_mut","borrow_mut","borrow_mut","clone","clone","clone_into","clone_into","cmp","cmp","end","eq","eq","fmt","fmt","fmt","from","from","from","into","into","into","into_iter","into_iter","len","matches","matches","new","next","partial_cmp","partial_cmp","reverse","start","to_owned","to_owned","try_from","try_from","try_from","try_into","try_into","try_into","type_id","type_id","type_id"],"q":[[0,"regex_syntax"],[81,"regex_syntax::ast"],[885,"regex_syntax::ast::ClassUnicodeKind"],[888,"regex_syntax::ast::ErrorKind"],[891,"regex_syntax::ast::GroupKind"],[893,"regex_syntax::ast::parse"],[927,"regex_syntax::ast::print"],[938,"regex_syntax::hir"],[1388,"regex_syntax::hir::literal"],[1501,"regex_syntax::hir::print"],[1512,"regex_syntax::hir::translate"],[1549,"regex_syntax::utf8"],[1603,"alloc::string"],[1604,"core::fmt"],[1605,"core::fmt"],[1606,"core::any"],[1607,"core::option"],[1608,"core::cmp"],[1609,"core::fmt"],[1610,"alloc::boxed"],[1611,"core::convert"],[1612,"core::iter::traits::collect"],[1613,"core::borrow"],[1614,"core::convert"]],"d":["This error type encompasses any error that can be returned …","An error that occurred while translating concrete syntax …","A convenience parser for regular expressions.","A builder for a regular expression parser.","An error that occurred while translating abstract syntax …","An error that occurs when the Unicode-aware \\\\w class is …","Defines an abstract syntax for regular expressions.","","","","","","","","","Build a parser from this configuration with the given …","Enable or disable the case insensitive flag by default.","","","","","","","Enable or disable the CRLF mode flag by default.","","Enable or disable the “dot matches any character” flag …","","Escapes all regular expression meta characters in text.","Escapes all meta characters in text and writes the result …","","","","","","","","","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Defines a high-level intermediate (HIR) representation for …","Enable verbose mode in the regular expression.","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Returns true if the given character can be escaped in a …","Returns true if the given character has significance in a …","Returns true if and only if the given character is an …","Returns true if and only if the given character is a …","Sets the line terminator for use with (?u-s:.) and (?-us:.)…","Enable or disable the multi-line matching flag by default.","Set the nesting limit for this parser.","Create a new parser builder with a default configuration.","Create a new parser with a default configuration.","Whether to support octal syntax or not.","A convenience routine for parsing a regex using default …","Parse the regular expression into a high level intermediate","Enable or disable the “swap greed” flag by default.","","","","","","","","","","","","","","Returns true if and only if the given character is a …","","","","","Enable or disable the Unicode flag (u) by default.","Converts ranges of Unicode scalar values to equivalent …","When disabled, translation will permit the construction of …","[0-9A-Za-z]","[A-Za-z]","An alternation of regular expressions.","An alternation of regular expressions.","[\\\\x00-\\\\x7F]","An ASCII character class, e.g., [:alnum:] or [:punct:].","A single zero-width assertion.","A single zero-width assertion.","An assertion kind.","An abstract syntax tree for a single regular expression.","{m,}","Bell, spelled \\\\a (\\\\x07).","A single binary operation (i.e., &&, – or ~~).","[ \\\\t]","{m,n}","A bracketed character class set, which may contain zero or …","R","(a)","The capturing group limit was exceeded.","A capture name.","(?<name>a) or (?P<name>a)","Carriage return, spelled \\\\r (\\\\x0D).","i","An ASCII character class.","The available ASCII character classes.","A bracketed character class, e.g., [a-z0-9].","A single bracketed character class set, which may contain …","An invalid escape sequence was found in a character class …","A Perl character class.","A single perl character class, e.g., \\\\d or \\\\W.","The available Perl character classes.","An invalid character class range was found. An invalid …","An invalid range boundary was found in a character class. …","A character class set.","A Unicode character class set operation.","The type of a Unicode character class set operation.","A single component of a character class set.","A single character class range in a set.","A union of items inside a character class set.","An opening [ was found with no corresponding closing ].","A Unicode character class.","A single Unicode character class, e.g., \\\\pL or \\\\p{Greek}.","The available forms of Unicode character classes.","The type of op used in a Unicode character class.","[\\\\x00-\\\\x1F\\\\x7F]","A property set to a specific value using a colon, e.g., …","A comment from a regular expression with an associated …","A concatenation of regular expressions.","A concatenation of regular expressions.","Note that this error variant is no longer used. Namely, a …","An invalid decimal number was given where one was expected.","The difference of two sets, e.g., \\\\pN--[0-9].","Decimal numbers.","[0-9]","The “any character” class.","s","An empty regex that matches everything.","An empty item.","$","\\\\z","A property set to a specific value, e.g., \\\\p{scx=Katakana}.","An error that visiting an AST might return.","An error that occurred while parsing a regular expression …","The type of an error that occurred while building an AST.","A bracketed hex literal was empty.","A bracketed hex literal did not correspond to a Unicode …","An invalid hexadecimal digit was found.","EOF was found before an escape sequence was completed.","An unrecognized escape sequence.","{m}","A single flag.","A single flag in a group.","A dangling negation was used when setting flags, e.g., i-.","A flag was used twice, e.g., i-i.","The negation operator was used twice, e.g., -i-s.","Expected a flag but got EOF, e.g., (?.","Unrecognized flag, e.g., a.","A group of flags.","A set of flags, e.g., (?is).","A single item in a group of flags.","The kind of an item in a group of flags.","Form feed, spelled \\\\f (\\\\x0C).","[!-~]","A grouped regular expression.","A grouped regular expression.","The kind of a group.","A duplicate capture name was found.","A capture group name is empty, e.g., (?P<>abc).","An invalid character was seen for a capture group name. …","A closing > could not be found for a capture group name.","An unclosed group, e.g., (ab.","An unopened group, e.g., ab).","The literal is written as a hex code with a bracketed …","The literal is written as a hex code with a fixed number …","The type of a Unicode hex literal.","x","The intersection of two sets, e.g., \\\\pN&&[a-z].","An item, which can be a single literal, range, nested …","Line feed, spelled \\\\n (\\\\x0A).","A single literal expression.","A single character literal, which includes escape …","A single literal.","The kind of a single literal expression.","[a-z]","The literal is written as an escape because it is …","m","A binary property, general category or script. The string …","A property name and an associated value.","A negation operator applied to all subsequent flags in the …","The nest limit was exceeded. The limit stored here is the …","(?:a) and (?i:a)","A property that isn’t a particular value, e.g., …","\\\\B","The literal is written as an octal escape, e.g., \\\\141.","A one letter abbreviated class, e.g., \\\\pN.","+","The result of visiting an AST.","A perl character class, e.g., \\\\d or \\\\W.","A single position in a regular expression.","[ -~]","[!-/:-@\\\\[-{-~]`","A range between two literals.","{m,n}","A repetition operation applied to a regular expression.","A repetition operator applied to an arbitrary regular …","An opening { was not followed by a valid decimal value. …","The range provided in a counted repetition operator is …","An opening { was found with no corresponding closing }.","The kind of a repetition operator.","A repetition operator was applied to a missing …","The repetition operator itself.","A range repetition operator.","A group of flags that is not applied to a particular …","Space, spelled \\\\ (\\\\x20). Note that this can only appear …","Whitespace.","[\\\\t\\\\n\\\\v\\\\f\\\\r ]","Span represents the position information of a single AST …","The literal is written as a specially recognized escape, …","The type of a special literal.","The special word boundary syntax, \\\\b{something}, was used, …","The special word boundary syntax, \\\\b{something}, was used, …","The syntax \\\\b{ was observed, but afterwards the end of the …","^","\\\\A","The literal is written as an escape despite the fact that …","U","The symmetric difference of two sets. The symmetric …","Tab, spelled \\\\t (\\\\x09).","A Unicode character class, e.g., \\\\pL or \\\\p{Greek}.","u","The Unicode class is not valid. This typically occurs when …","A \\\\U prefix. When used without brackets, this form is …","A \\\\u prefix. When used without brackets, this form is …","A union of items.","When octal support is disabled, this error is produced …","When syntax similar to PCRE’s look-around is used, this …","[A-Z]","The literal is written verbatim, e.g., a or ☃.","Vertical tab, spelled \\\\v (\\\\x0B).","A trait for visiting an abstract syntax tree (AST) in …","An abstract syntax tree for a singular expression along …","Word characters.","[0-9A-Za-z_]","\\\\b","\\\\b{end}","\\\\> (alias for \\\\b{end})","\\\\b{end-half}","\\\\b{start}","\\\\< (alias for \\\\b{start})","\\\\b{start-half}","A \\\\x prefix. When used without brackets, this form is …","[0-9A-Fa-f]","*","?","Add the given item to this sequence of flags.","Create a “alternation” AST item.","Create a “assertion” AST item.","The actual ast.","The regular expression under repetition.","The regular expression in this group.","The alternate regular expressions.","The concatenation regular expressions.","Return an auxiliary span. This span exists only for some …","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","If this literal was written as a \\\\x hex escape, then this …","The Unicode scalar value corresponding to this literal.","Returns the capture index of this group, if this is a …","Create a “bracketed class” AST item.","Create a “Perl class” AST item.","Create a “Unicode class” AST item.","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","The approximate column number, starting at 1.","The comment text, starting with the first character …","All comments found in the original regular expression.","Create a “concat” AST item.","The number of digits that must be used with this literal …","Create a “dot” AST item.","","","Create an “empty” AST item.","The end byte offset.","The end of this range.","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","All implementors of Visitor must provide a finish method, …","Returns the state of the given flag in this set.","Create a “flags” AST item.","If this group is non-capturing, then this returns the …","The actual sequence of flags.","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Return the corresponding ClassAsciiKind variant for the …","Whether this operation was applied greedily or not.","Create a “group” AST item.","The capture index.","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Return this alternation as an AST.","Return this concatenation as an AST.","Return this union as a character class set item.","Returns true if and only if this group is capturing.","Returns true if and only if this span is empty. That is, …","Return true if and only if this Ast is empty.","Whether the op is an equality op or not.","Returns true if this class has been negated.","Returns true if and only if this item is a negation …","Returns true if and only if this span occurs on a single …","Returns true if and only if this character class range is …","Returns true if and only if this repetition range is valid.","The sequence of items that make up this union.","A sequence of flag items. Each item is either a flag or a …","Return the type of this error.","The kind of this literal.","The kind of Perl class.","The kind of ASCII class.","The kind of Unicode class.","The type of this set. A set is either a normal union of …","The type of this set operation.","The assertion kind, e.g., \\\\b or ^.","The type of operation.","The kind of this group.","The kind of this item.","The left hand side of the operation.","The line number, starting at 1.","Create a “literal” AST item.","The capture name.","Whether the class is negated or not. e.g., \\\\d is not …","Whether the class is negated or not. e.g., [[:alpha:]] is …","Whether this class is negated or not.","Whether this class is negated or not. e.g., [a] is not …","Create a new span with the given positions.","Create a new position with the given information.","The absolute offset of this position, starting at 0 from …","The actual operation.","This module provides a regular expression parser.","","","The original pattern string in which this error occurred.","This module provides a regular expression printer for Ast.","Push a new item in this union.","Create a “repetition” AST item.","The right hand side of the operation.","Return the span at which this error occurred.","Return the span of this abstract syntax tree.","Return the span of this character class set.","Return the span of this character class set item.","The span of this comment, including the beginning # and …","The span of this alternation.","The span of this concatenation.","The span of this literal.","The span of this class.","The span of this class.","The span of this class.","The span of this class.","The span of this range.","The span of the items in this operation. e.g., the a-z0-9 …","The span of this operation. e.g., the a-z--[h-p] in …","The span of this assertion.","The span of this operation.","The span of this operator. This includes things like +, *? …","The span of this group.","The span of this capture name.","The span of these flags, including the grouping …","The span of this group of flags.","The span of this item.","Create a new span using the given position as the start …","This method is called before beginning traversal of the …","This method is called before beginning traversal of the …","The start byte offset.","The start of this range.","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","Build a set from a union.","Executes an implementation of Visitor in constant stack …","This method is called between child nodes of an Alternation…","This method is called between child nodes of an Alternation…","This method is called between the left hand and right hand …","This method is called between the left hand and right hand …","This method is called on every ClassSetBinaryOp after …","This method is called on every ClassSetBinaryOp after …","This method is called on every ClassSetBinaryOp before …","This method is called on every ClassSetBinaryOp before …","This method is called on every ClassSetItem after …","This method is called on every ClassSetItem after …","This method is called on every ClassSetItem before …","This method is called on every ClassSetItem before …","This method is called between child nodes of a …","This method is called between child nodes of a …","This method is called on an Ast after descending all of …","This method is called on an Ast after descending all of …","This method is called on an Ast before descending into …","This method is called on an Ast before descending into …","Create a new span by replacing the ending the position …","Create a new span by replacing the starting the position …","The property name (which may be empty).","The type of Unicode op used to associate name with value.","The property value (which may be empty).","The position of the original flag. The error position …","The position of the original negation operator. The error …","The position of the initial occurrence of the capture …","The capture name.","True if the ?P< syntax is used and false if the ?< syntax …","A regular expression parser.","A builder for a regular expression parser.","","","","","Build a parser from this configuration with the given …","","","","","","Allow using {,n} as an equivalent to {0,n}.","","","Returns the argument unchanged.","Returns the argument unchanged.","Enable verbose mode in the regular expression.","Calls U::from(self).","Calls U::from(self).","Set the nesting limit for this parser.","Create a new parser builder with a default configuration.","Create a new parser with a default configuration.","Whether to support octal syntax or not.","Parse the regular expression into an abstract syntax tree.","Parse the regular expression and return an abstract syntax …","","","","","","","","","A printer for a regular expression abstract syntax tree.","","","","Returns the argument unchanged.","Calls U::from(self).","Create a new printer.","Print the given Ast to the given writer. The writer must …","","","","An alternation of expressions.","Matches any byte value.","Matches any byte value except for the u8 given.","Matches any byte value except for \\\\r and \\\\n.","Matches any byte value except for \\\\n.","Matches the UTF-8 encoding of any Unicode scalar value.","Matches the UTF-8 encoding of any Unicode scalar value …","Matches the UTF-8 encoding of any Unicode scalar value …","Matches the UTF-8 encoding of any Unicode scalar value …","A set of characters represented by arbitrary bytes (one …","The high-level intermediate representation for a capturing …","A capturing group, which contains a sub-expression.","An error that occurs when Unicode-aware simple case …","The high-level intermediate representation of a character …","A single character class that matches any of the …","A set of characters represented by arbitrary bytes.","An iterator over all ranges in a byte character class.","A single range of characters represented by arbitrary …","A set of characters represented by Unicode scalar values.","An iterator over all ranges in a Unicode character class.","A single range of characters represented by Unicode scalar …","A concatenation of expressions.","A type describing the different flavors of ..","The empty regular expression, which matches everything, …","Match the end of text. Specifically, this matches at the …","Match the end of a line or the end of text. Specifically, …","Match the end of a line or the end of text. Specifically, …","An error that visiting an HIR might return.","An error that can occur while translating an Ast to a Hir.","The type of an error that occurred while building an Hir.","A high-level intermediate representation (HIR) for a …","The underlying kind of an arbitrary Hir expression.","This error occurs when one uses a non-ASCII byte for a …","This error occurs when translating a pattern that could …","The high-level intermediate representation of a literal.","A literalstring that matches exactly these bytes.","The high-level intermediate representation for a …","A look-around assertion. A look-around match always has …","A set of look-around assertions.","An iterator over all look-around assertions in a LookSet.","The result of visiting an HIR.","A type that collects various properties of an HIR value.","The high-level intermediate representation of a repetition …","A repetition operation applied to a sub-expression.","Match the beginning of text. Specifically, this matches at …","Match the beginning of a line or the beginning of text. …","Match the beginning of a line or the beginning of text. …","A set of characters represented by Unicode scalar values.","This occurs when the Unicode simple case mapping tables …","This error occurs when a Unicode feature is used when …","This occurs when a Unicode-aware Perl character class (\\\\w, …","This occurs when an unrecognized Unicode property name …","This occurs when an unrecognized Unicode property value …","A trait for visiting the high-level IR (HIR) in depth …","Match an ASCII-only word boundary. That is, this matches a …","Match an ASCII-only negation of a word boundary.","Match the end of an ASCII-only word boundary. That is, …","Match the end half of an ASCII-only word boundary. That …","Match the end half of a Unicode word boundary. That is, …","Match the end of a Unicode word boundary. That is, this …","Match the start of an ASCII-only word boundary. That is, …","Match the start half of an ASCII-only word boundary. That …","Match the start half of a Unicode word boundary. That is, …","Match the start of a Unicode word boundary. That is, this …","Match a Unicode-aware word boundary. That is, this matches …","Match a Unicode-aware negation of a word boundary.","Returns the alternation of the given expressions.","Returns a convenient single codepoint representation of …","Return the underlying representation of this look-around …","The underlying representation this set is exposed to make …","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","Creates a capture HIR expression.","Apply Unicode simple case folding to this character class, …","Expand this character class such that it contains all case …","Expand this character class such that it contains all case …","Creates a class HIR expression. The class may either be …","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","Returns the concatenation of the given expressions.","Returns true if and only if the given look-around …","Returns true if and only if this set contains any anchor …","Returns true if and only if this set contains any “…","Returns true if and only if this set contains any “…","Returns true if and only if this set contains any “…","Returns true if and only if this set contains any “…","Returns true if and only if this set contains any word …","Returns true if and only if this set contains any ASCII …","Returns true if and only if this set contains any Unicode …","","","","Subtract the given character class from this character …","Subtract the given byte class from this byte class, in …","Returns an HIR expression for ..","","Returns an empty HIR expression.","Create a new class with no ranges.","Create a new class with no ranges.","Create an empty set of look-around assertions.","Return the end of this range.","Return the end of this range.","","","","","","","","","","","","","","","","","Returns the total number of explicit capturing groups in …","Returns an HIR expression that can never match anything. …","All implementors of Visitor must provide a finish method, …","","","","","","","","","","","","","","","","","","","","","","","","","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Given the underlying representation of a Look value, …","Create a full set of look-around assertions.","Whether this repetition operator is greedy or not. A …","The capture index of the capture.","Return a new set that is equivalent to the original, but …","Intersect this character class with the given character …","Intersect this byte class with the given byte class, in …","Returns a new set that is the intersection of this and the …","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","","","","Consumes ownership of this HIR expression and returns its …","Return true if and only if this HIR is either a simple …","Returns true if and only if this character class will …","Returns true if and only if this character class will …","Returns true if and only if this character class is empty. …","Returns true if and only if this set is empty.","Return true if and only if this HIR is a simple literal. …","Returns true if and only if this character class will only …","Return true if and only if the corresponding HIR will …","Return an iterator over all ranges in this class.","Return an iterator over all ranges in this class.","Returns an iterator over all of the look-around assertions …","Return the type of this error.","Returns a reference to the underlying HIR kind.","Returns the number of codepoints in this range.","Returns the number of bytes in this range.","Returns the total number of look-around assertions in this …","Provides literal extraction from Hir expressions.","Creates a literal HIR expression.","If this class consists of exactly one element (whether a …","If this class consists of exactly one codepoint, then …","If this class consists of exactly one byte, then return it …","Creates a look-around assertion HIR expression.","Returns a set of all look-around assertions that appear at …","Returns a set of all look-around assertions that appear as …","Returns a set of all look-around assertions that appear as …","Returns a set of all look-around assertions that appear as …","Returns a set of all look-around assertions that appear as …","The maximum range of the repetition.","Returns the length, in bytes, of the longest string …","Returns the length, in bytes, of the longest string …","Returns the length, in bytes, of the longest string …","Returns the length (in bytes) of the longest string …","Returns the total amount of heap memory usage, in bytes, …","The minimum range of the repetition.","Returns the length, in bytes, of the smallest string …","Returns the length, in bytes, of the smallest string …","Returns the length, in bytes, of the smallest string …","Returns the length (in bytes) of the smallest string …","The name of the capture, if it exists.","Negate this character class in place.","Negate this character class.","Negate this byte class.","Create a new class from a sequence of ranges.","Create a new Unicode scalar value range for a character …","Create a new class from a sequence of ranges.","Create a new byte range for a character class.","","","","","","The original pattern string in which this error occurred.","This module provides a regular expression printer for Hir.","Returns the properties computed for this Hir.","Add a new range to this set.","Add a new range to this set.","Return the underlying ranges as a slice.","Return the underlying ranges as a slice.","Return a LookSet from the slice given as a native endian …","Return a new set that is equivalent to the original, but …","Creates a repetition HIR expression.","Flip the look-around assertion to its equivalent for …","Updates this set in place with the result of inserting the …","Updates this set in place with the result of intersecting …","Updates this set in place with the result of removing the …","Updates this set in place with the result of subtracting …","Updates this set in place with the result of unioning it …","Create a look-around set containing the look-around …","Return the span at which this error occurred.","This method is called before beginning traversal of the …","This method is called before beginning traversal of the …","Return the start of this range.","Return the start of this range.","Returns the total number of explicit capturing groups that …","The expression inside the capturing group, which may be …","The expression being repeated.","Returns a slice of this kind’s sub-expressions, if any.","Returns a new set that is the result of subtracting the …","Compute the symmetric difference of the given character …","Compute the symmetric difference of the given byte …","If this class consists of only ASCII ranges, then return …","","","","","","","","","","","","","","","","","","","","","","If this class consists of only ASCII ranges, then return …","Defines a translator that converts an Ast to an Hir.","Apply Unicode simple case folding to this character class, …","Expand this character class such that it contains all case …","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","Union this character class with the given character class, …","Union this byte class with the given byte class, in place.","Returns a new set of properties that corresponds to the …","Returns a new set that is the union of this and the one …","Executes an implementation of Visitor in constant stack …","This method is called between child nodes of an …","This method is called between child nodes of an …","This method is called between child nodes of a …","This method is called between child nodes of a …","This method is called on an Hir after descending all of …","This method is called on an Hir after descending all of …","This method is called on an Hir before descending into …","This method is called on an Hir before descending into …","Returns a new repetition with the same min, max and greedy …","Write a LookSet as a native endian 32-bit integer to the …","The kind of literals to extract from an Hir expression.","Extracts prefix or suffix literal sequences from Hir …","A single literal extracted from an Hir expression.","Extracts only prefix literals from a regex.","A sequence of literals.","Extracts only suffix literals from a regex.","Returns the bytes in this literal.","","","","","","","","","","","","","","","","","","","Modify this sequence to contain the cross product between …","Modify this sequence to contain the cross product between …","Deduplicate adjacent equivalent literals in this sequence.","","","Returns an empty sequence.","","","Returns a new exact literal containing the bytes given.","Extend this literal with the literal given.","Execute the extractor and return a sequence of literals.","","","","","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","","","","Returns a new inexact literal containing the bytes given.","Returns a sequence of literals without a finite size and …","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Yields ownership of the bytes inside this literal.","Returns true if and only if this sequence is finite and …","Returns true if and only if this literal has zero bytes.","Returns true if and only if all literals in this sequence …","Returns true if and only if this literal is exact.","Returns true if this sequence is finite.","Returns true if and only if all literals in this sequence …","Returns true if this kind is the Prefix variant.","Returns true if this kind is the Suffix variant.","Trims all literals in this seq such that only the first len…","Trims this literal such that only the first len bytes …","Trims all literals in this seq such that only the last len …","Trims this literal such that only the last len bytes …","Set the kind of literal sequence to extract from an Hir …","Returns the number of literals in this sequence if the …","Returns the length of this literal in bytes.","Configure a limit on the length of the sequence that is …","Configure a limit on the maximum length of any literal in …","Configure a limit on the total number of repetitions that …","Configure a limit on the total number of literals that …","If this is a finite sequence, return its members as a …","Returns the longest common prefix from this seq.","Returns the longest common suffix from this seq.","Make all of the literals in this sequence inexact.","Marks this literal as inexact.","Converts this sequence to an infinite sequence.","Return the maximum length of the sequence that would …","Returns the length of the longest literal in this sequence.","Return the maximum length of the sequence that would …","Returns the length of the shortest literal in this …","Shrinks this seq to its minimal size while respecting the …","Create a new extractor with a default configuration.","Returns a sequence of exact literals from the given byte …","Optimizes this seq while treating its literals as prefixes …","Optimizes this seq while treating its literals as suffixes …","","Push a literal to the end of this sequence.","Returns the “rank” of the given byte.","Reverse the bytes in this literal.","Reverses all of the literals in this sequence.","Returns a sequence containing a single literal.","Sorts this sequence of literals lexicographically.","","","","","","","","","","","","","","","","","Unions the other sequence into this one.","Unions the other sequence into this one by splice the other","A printer for a regular expression’s high-level …","","","","Returns the argument unchanged.","Calls U::from(self).","Create a new printer.","Print the given Ast to the given writer. The writer must …","","","","A translator maps abstract syntax to a high level …","A builder for constructing an AST->HIR translator.","","","","","Build a translator using the current configuration.","Enable or disable the case insensitive flag (i) by default.","","","","","Enable or disable the CRLF mode flag (R) by default.","","Enable or disable the “dot matches any character” flag …","","","Returns the argument unchanged.","Returns the argument unchanged.","Calls U::from(self).","Calls U::from(self).","Sets the line terminator for use with (?u-s:.) and (?-us:.)…","Enable or disable the multi-line matching flag (m) by …","Create a new translator builder with a default c …","Create a new translator using the default configuration.","Enable or disable the “swap greed” flag (U) by default.","","","Translate the given abstract syntax tree (AST) into a high …","","","","","","","Enable or disable the Unicode flag (u) by default.","When disabled, translation will permit the construction of …","Four successive byte ranges.","One byte range.","Three successive byte ranges.","Two successive byte ranges.","A single inclusive range of UTF-8 bytes.","Utf8Sequence represents a sequence of byte ranges.","An iterator over ranges of matching UTF-8 byte sequences.","Returns the underlying sequence of byte ranges as a slice.","","","","","","","","","","","","","End of byte range (inclusive).","","","","","","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 number of byte ranges in this sequence.","Returns true if and only if a prefix of bytes matches this …","Returns true if and only if the given byte is in this …","Create a new iterator over UTF-8 byte ranges for the …","","","","Reverses the ranges in this sequence.","Start of byte range (inclusive).","","","","","","","","","","",""],"i":[0,4,0,0,4,0,0,4,1,2,10,4,1,2,10,1,1,4,1,2,4,1,2,1,1,1,4,0,0,4,4,1,2,10,10,4,4,4,1,2,10,0,1,4,1,2,10,0,0,0,0,1,1,1,1,2,1,0,2,1,4,1,2,4,10,4,1,2,10,4,1,2,10,0,4,1,2,10,1,0,1,42,42,0,24,42,46,0,24,0,0,55,38,45,42,55,46,60,56,32,0,56,38,60,0,0,0,24,32,0,24,0,32,32,0,0,0,0,0,0,32,0,24,0,0,42,44,0,0,24,32,32,50,40,42,24,60,24,46,51,51,44,64,0,0,32,32,32,32,32,55,0,59,32,32,32,32,32,0,24,0,0,38,42,0,24,0,32,32,32,32,32,32,37,37,0,60,50,45,38,0,24,46,0,42,37,60,43,43,59,32,56,44,51,37,43,54,64,46,0,42,42,46,54,0,24,32,32,32,0,32,0,0,0,38,40,42,0,37,0,32,32,32,51,51,37,60,50,38,46,60,32,39,39,46,32,32,42,37,38,0,0,40,42,51,51,51,51,51,51,51,39,42,54,54,19,24,24,34,52,28,23,36,12,12,32,26,33,34,35,24,23,36,27,37,38,39,30,40,41,42,31,43,44,29,45,46,47,48,49,50,25,51,52,53,54,55,28,56,57,58,19,20,59,60,12,32,26,33,34,35,24,23,36,27,37,38,39,30,40,41,42,31,43,44,29,45,46,47,48,49,50,25,51,52,53,54,55,28,56,57,58,19,20,59,60,27,27,28,24,24,24,12,32,26,33,34,35,24,23,36,27,37,38,39,30,40,41,42,31,43,44,29,45,46,47,48,49,50,25,51,52,53,54,55,28,56,57,58,19,20,59,60,12,32,26,33,34,35,24,23,36,27,37,38,39,30,40,41,42,31,43,44,29,45,46,47,48,49,50,25,51,52,53,54,55,28,56,57,58,19,20,59,60,26,33,33,35,34,24,39,24,24,45,24,26,47,12,32,26,33,34,35,24,23,36,27,37,38,39,30,40,41,42,31,43,44,29,45,46,47,48,49,50,25,51,52,53,54,55,28,56,57,58,19,20,59,60,64,19,24,28,58,12,12,32,32,26,33,34,35,24,24,23,36,27,37,38,39,30,40,41,42,31,43,44,29,45,46,47,48,49,50,25,51,52,53,54,55,28,56,57,58,19,20,59,60,12,32,26,33,34,35,24,23,36,27,37,38,39,30,40,41,42,31,43,44,29,45,46,47,48,49,50,25,51,52,53,54,55,28,56,57,58,19,20,59,60,42,52,24,57,12,32,26,33,34,35,24,23,36,27,37,38,39,30,40,41,42,31,43,44,29,45,46,47,48,49,50,25,51,52,53,54,55,28,56,57,58,19,20,59,60,23,36,48,28,26,24,44,31,59,26,47,55,48,19,12,27,30,41,31,29,49,25,53,28,20,49,33,24,57,30,41,31,29,26,33,33,52,0,26,33,12,0,48,24,49,12,24,45,46,35,23,36,27,30,41,31,29,47,48,49,25,52,53,28,57,58,19,20,26,64,64,26,47,12,32,26,33,34,35,24,23,36,27,37,38,39,30,40,41,42,31,43,44,29,45,46,47,48,49,50,25,51,52,53,54,55,28,56,57,58,19,20,59,60,12,32,24,12,32,26,33,34,35,24,23,36,27,37,38,39,30,40,41,42,31,43,44,29,45,46,47,48,49,50,25,51,52,53,54,55,28,56,57,58,19,20,59,60,12,32,26,33,34,35,24,23,36,27,37,38,39,30,40,41,42,31,43,44,29,45,46,47,48,49,50,25,51,52,53,54,55,28,56,57,58,19,20,59,60,12,32,26,33,34,35,24,23,36,27,37,38,39,30,40,41,42,31,43,44,29,45,46,47,48,49,50,25,51,52,53,54,55,28,56,57,58,19,20,59,60,45,0,64,64,64,64,64,64,64,64,64,64,64,64,64,64,64,64,64,64,26,26,106,106,106,107,108,109,110,110,0,0,65,66,65,66,65,65,66,65,66,65,65,65,66,65,66,65,65,66,65,65,66,65,66,66,65,66,65,66,65,66,65,66,0,67,67,67,67,67,67,67,67,67,67,76,81,81,81,81,81,81,81,81,72,0,76,0,0,76,0,0,0,0,0,0,76,0,76,70,70,70,85,0,0,0,0,75,75,0,76,0,76,0,0,85,0,0,76,70,70,70,72,75,75,75,75,75,0,70,70,70,70,70,70,70,70,70,70,70,70,16,70,70,83,11,75,16,76,77,72,73,86,78,74,87,79,70,71,80,81,82,83,84,88,11,75,16,76,77,72,73,86,78,74,87,79,70,71,80,81,82,83,84,88,16,72,73,74,16,11,75,16,76,77,72,73,78,74,79,70,71,80,81,82,83,84,11,75,16,76,77,72,73,78,74,79,70,71,80,81,82,83,84,78,79,16,83,83,83,83,83,83,83,83,83,78,79,83,73,74,16,16,16,73,74,83,78,79,11,75,16,76,77,72,73,78,74,79,70,71,80,81,82,83,82,16,85,11,11,75,75,16,16,76,77,72,73,86,78,74,87,79,70,71,80,81,82,83,84,88,88,11,75,16,76,77,72,73,86,78,74,87,79,70,71,80,81,82,83,84,88,70,83,80,71,83,73,74,83,11,75,16,76,77,72,73,86,78,74,87,79,70,71,80,81,82,83,84,88,86,87,84,16,82,73,74,72,83,82,72,82,73,74,83,11,16,78,79,83,0,16,72,73,74,16,82,82,82,82,82,80,72,73,74,82,82,80,72,73,74,82,71,72,73,74,73,78,74,79,86,87,84,78,79,11,0,16,73,74,73,74,83,83,16,70,83,83,83,83,83,83,11,85,85,78,79,82,71,80,76,83,73,74,73,11,75,16,76,77,72,73,78,74,79,70,71,80,81,82,83,84,11,75,16,88,74,0,72,73,11,75,16,76,77,72,73,86,78,74,87,79,70,71,80,81,82,83,84,88,11,75,16,76,77,72,73,86,78,74,87,79,70,71,80,81,82,83,84,88,11,75,16,76,77,72,73,86,78,74,87,79,70,71,80,81,82,83,84,88,73,74,82,83,0,85,85,85,85,85,85,85,85,80,83,0,0,0,97,0,97,95,95,96,97,98,95,96,97,98,95,96,97,98,95,96,97,98,95,95,98,98,98,96,97,98,98,95,95,95,96,96,97,98,95,96,97,98,95,95,95,98,95,98,96,97,98,95,95,98,95,98,95,98,98,97,97,98,95,98,95,96,98,95,96,96,96,96,98,98,98,98,95,98,98,98,98,98,98,96,98,98,98,95,98,0,95,98,98,98,96,97,98,95,96,97,98,95,96,97,98,95,96,97,98,95,98,98,0,100,100,100,100,100,100,100,100,100,100,0,0,101,102,101,102,101,101,101,102,101,102,101,101,101,101,102,101,102,101,102,101,101,101,102,101,101,102,102,101,102,101,102,101,102,101,101,103,103,103,103,0,0,0,103,103,104,105,103,104,105,103,104,103,104,103,104,104,103,104,103,104,105,103,104,105,103,104,105,103,105,103,103,104,105,105,103,104,103,104,103,104,103,104,105,103,104,105,103,104,105],"f":"```````{ce{}{}}0000000{bd}{{bf}b}{hh}{bb}{dd}{{ce}j{}{}}004{{}b}5{{hh}f}{ln}{{ln}j}{{hA`}Ab}0{{bA`}Ab}{{dA`}Ab}{{AdA`}Ab}0{Afh}{Ahh}{cc{}}000`?{ce{}{}}000{Ajf}0{Alf}1{{bAl}b}{{bf}b}{{bAn}b}{{}b}{{}d}3{l{{Bb{B`h}}}}{{dl}{{Bb{B`h}}}}5999{cn{}}0{c{{Bb{e}}}{}{}}0000000{Aj{{Bb{fAd}}}}{cBd{}}0009`9``````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````{{BfBh}{{Bl{Bj}}}}{BnC`}{CbC`}`````{Ah{{Bl{Cd}}}}{ce{}{}}000000000000000000000000000000000000000000000000000000000000000000000000000000000{Cf{{Bl{Al}}}}`{Ch{{Bl{An}}}}{CjC`}{ClC`}{CnC`}{AhAh}{D`D`}{CdCd}{DbDb}{DdDd}{DfDf}{C`C`}{BnBn}{DhDh}{CfCf}{DjDj}{DlDl}{DnDn}{ClCl}{E`E`}{EbEb}{EdEd}{CnCn}{EfEf}{EhEh}{CjCj}{EjEj}{ElEl}{EnEn}{F`F`}{FbFb}{FdFd}{CbCb}{FfFf}{FhFh}{FjFj}{FlFl}{FnFn}{ChCh}{G`G`}{GbGb}{GdGd}{BfBf}{BhBh}{GfGf}{GhGh}{{ce}j{}{}}0000000000000000000000000000000000000000{{CdCd}Gj}{{DbDb}Gj}```{DhC`}{DnAn}{CdC`}{C`j}{Ejj}2``{{AhAh}f}{{D`D`}f}{{CdCd}f}{{DbDb}f}{{DdDd}f}{{DfDf}f}{{C`C`}f}{{BnBn}f}{{DhDh}f}{{CfCf}f}{{DjDj}f}{{DlDl}f}{{DnDn}f}{{ClCl}f}{{E`E`}f}{{EbEb}f}{{EdEd}f}{{CnCn}f}{{EfEf}f}{{EhEh}f}{{CjCj}f}{{EjEj}f}{{ElEl}f}{{EnEn}f}{{F`F`}f}{{FbFb}f}{{FdFd}f}{{CbCb}f}{{FfFf}f}{{FhFh}f}{{FjFj}f}{{FlFl}f}{{FnFn}f}{{ChCh}f}{{G`G`}f}{{GbGb}f}{{GdGd}f}{{BfBf}f}{{BhBh}f}{{GfGf}f}{{GhGh}f}{{{H`{}{{Gl{c}}{Gn{e}}}}}{{Bb{ce}}}{}{}}{{BfGh}{{Bl{f}}}}{GdC`}{Ch{{Bl{Bf}}}}`{{AhA`}Ab}0{{D`A`}Ab}0{{CdA`}Ab}{{DbA`}Ab}{{DdA`}Ab}{{DfA`}Ab}{{C`A`}Ab}0{{BnA`}Ab}{{DhA`}Ab}{{CfA`}Ab}{{DjA`}Ab}{{DlA`}Ab}{{DnA`}Ab}{{ClA`}Ab}{{E`A`}Ab}{{EbA`}Ab}{{EdA`}Ab}{{CnA`}Ab}{{EfA`}Ab}{{EhA`}Ab}{{CjA`}Ab}{{EjA`}Ab}{{ElA`}Ab}{{EnA`}Ab}{{F`A`}Ab}{{FbA`}Ab}{{FdA`}Ab}{{CbA`}Ab}{{FfA`}Ab}{{FhA`}Ab}{{FjA`}Ab}{{FlA`}Ab}{{FnA`}Ab}{{ChA`}Ab}{{G`A`}Ab}{{GbA`}Ab}{{GdA`}Ab}{{BfA`}Ab}{{BhA`}Ab}{{GfA`}Ab}{{GhA`}Ab}{cc{}}0000000000000000000000000000000000000000{l{{Bl{Ed}}}}`{ChC`}`{ce{}{}}0000000000000000000000000000000000000000{BnC`}{DhC`}{F`El}{Chf}{Cdf}{C`f}{Ehf}{Cnf}{Gff}4{Enf}{Fnf}``{AhD`}````````````{CfC`}`````{{DbDb}Cd}{{BjBjBj}Db}```{{CdCd}{{Bl{Gj}}}}{{DbDb}{{Bl{Gj}}}}{Ahl}`{{F`El}j}{FhC`}`{AhCd}{C`Cd}{EjCd}{ElCd}```````````````````{DbCd}{{{H`{}{{Gl{c}}{Gn{e}}}}}j{}{}}0``{ce{}{}}0000000000000000000000000000000000000000{cn{}}00{c{{Bb{e}}}{}{}}000000000000000000000000000000000000000000000000000000000000000000000000000000000{cBd{}}0000000000000000000000000000000000000000{F`Ej}{{C`c}BbH`}{{{H`{}{{Gl{c}}{Gn{e}}}}}{{Bb{je}}}{}{}}0{{{H`{}{{Gl{c}}{Gn{e}}}}Fb}{{Bb{je}}}{}{}}00000{{{H`{}{{Gl{c}}{Gn{e}}}}El}{{Bb{je}}}{}{}}00022{{{H`{}{{Gl{c}}{Gn{e}}}}C`}{{Bb{je}}}{}{}}000{{CdDb}Cd}0``````````::::{HbHd}{HbHb}{HdHd}{{ce}j{}{}}0{{}Hb}{{Hbf}Hb}{{HbA`}Ab}{{HdA`}Ab}{cc{}}03{ce{}{}}0{{HbAn}Hb}6{{}Hd}6{{Hdl}{{Bb{C`Ah}}}}{{Hdl}{{Bb{DdAh}}}}44{c{{Bb{e}}}{}{}}000{cBd{}}0`66{{HfA`}Ab}87{{}Hf}{{HfC`c}AbHh}443``````````````````````````````````````````````````````````````````{{{Hj{B`}}}B`}{HlAj}{HlAn}`<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<{HnB`}{I`j}{Ibj}{Idj}{I`B`}{AfAf}{IfIf}{B`B`}{IhIh}{IjIj}{I`I`}{IbIb}{IlIl}{IdId}{InIn}{HlHl}{HnHn}{J`J`}{JbJb}{JdJd}{JfJf}{JhJh}{{ce}j{}{}}0000000000000000{{IlIl}Gj}{{InIn}Gj}{{{Hj{B`}}}B`}{{JfHl}f}{Jff}0000000{{}Il}{{}In}{{}Jf}{{IbIb}j}{{IdId}j}{JbB`}{B`j}{{}B`}{{}Ib}{{}Id}7{IlAj}{InAl}{{AfAf}f}{{IfIf}f}{{B`B`}f}{{IhIh}f}{{IjIj}f}{{I`I`}f}{{IbIb}f}{{IlIl}f}{{IdId}f}{{InIn}f}{{HlHl}f}{{HnHn}f}{{J`J`}f}{{JbJb}f}{{JdJd}f}{{JfJf}f}{JdBj}{{}B`}{{{Jj{}{{Gl{c}}{Gn{e}}}}}{{Bb{ce}}}{}{}}{{AfA`}Ab}0{{IfA`}Ab}0{{B`A`}Ab}0{{IhA`}Ab}{{IjA`}Ab}{{I`A`}Ab}{{IbA`}Ab}{{JlA`}Ab}{{IlA`}Ab}{{IdA`}Ab}{{JnA`}Ab}{{InA`}Ab}{{HlA`}Ab}{{HnA`}Ab}{{J`A`}Ab}{{JbA`}Ab}{{JdA`}Ab}{{JfA`}Ab}{{JhA`}Ab}{{K`A`}Ab}0{cc{}}0000000000000000000{An{{Bl{Hl}}}}{{}Jf}``{{JfHl}Jf}{{IbIb}j}{{IdId}j}{{JfJf}Jf}{ce{}{}}0000000000000000000000{B`Ih}{Jdf}{Ibf}{Idf}{I`f}{Jff}414{IbJl}{IdJn}{JfJh}{AfIf}9{IlBj}{InBj}{JfBj}`{cB`{{Kf{{Kd{{Kb{Al}}}}}}}}{I`{{Bl{{Hj{Al}}}}}}{Ib{{Bl{{Hj{Al}}}}}}{Id{{Bl{{Hj{Al}}}}}}{HlB`}{JdJf}0000`{I`{{Bl{Bj}}}}{Ib{{Bl{Bj}}}}{Id{{Bl{Bj}}}}{Jd{{Bl{Bj}}}}{JdBj}`4321`{I`j}{Ibj}{Idj}{cIb{{Kj{}{{Kh{Il}}}}}}{{AjAj}Il}{cId{{Kj{}{{Kh{In}}}}}}{{AlAl}In}{Jl{{Bl{Il}}}}{Jn{{Bl{In}}}}{Jh{{Bl{Hl}}}}{{IlIl}{{Bl{Gj}}}}{{InIn}{{Bl{Gj}}}}{Afl}`{B`Jd}{{IbIl}j}{{IdIn}j}{Ib{{Kb{Il}}}}{Id{{Kb{In}}}}{{{Kb{Al}}}Jf}{{JfHl}Jf}{J`B`}{HlHl}{{JfHl}j}{{JfJf}j}100{HlJf}{AfCd}{{{Jj{}{{Gl{c}}{Gn{e}}}}}j{}{}}0{IlAj}{InAl}{Jd{{Bl{Bj}}}}``{Ih{{Kb{B`}}}}{{JfJf}Jf}{{IbIb}j}{{IdId}j}{Ib{{Bl{Id}}}}{ce{}{}}0000000000000000{cn{}}000{Id{{Bl{Ib}}}}`{I`{{Bb{jK`}}}}{Ib{{Bb{jK`}}}}{c{{Bb{e}}}{}{}}000000000000000000000000000000000000000{cBd{}}000000000000000000098{eJd{{Kl{Jd}}}{{Kj{}{{Kh{c}}}}}};{{B`c}BbJj}{{{Jj{}{{Gl{c}}{Gn{e}}}}}{{Bb{je}}}{}{}}000{{{Jj{}{{Gl{c}}{Gn{e}}}}B`}{{Bb{je}}}{}{}}000{{J`B`}J`}{{Jf{Kb{Al}}}j}``````{Kn{{Kb{Al}}}}0========{L`L`}{LbLb}{LdLd}{KnKn}{{ce}j{}{}}000{{KnKn}Gj}{{LdLd}j}0{Ldj}{{}L`}{{}Lb}{{}Ld}{{LdLd}f}{{KnKn}f}{cKn{{Kf{{Hj{Al}}}}}}{{KnKn}j}{{L`B`}Ld}{{L`A`}Ab}{{LbA`}Ab}{{LdA`}Ab}{{KnA`}Ab}{cc{}}000{AlKn}{AjKn}{cLd{{Kj{}{{Kh{Kn}}}}}}:={ce{}{}}000{Kn{{Hj{Al}}}}{Ldf}{Knf}1011{Lbf}0{{LdBj}j}{{KnBj}j}10{{L`Lb}L`}{Ld{{Bl{Bj}}}}{KnBj}{{L`Bj}L`}000{Ld{{Bl{{Kb{Kn}}}}}}{Ld{{Bl{{Kb{Al}}}}}}0{Ldj}{Knj}1{{LdLd}{{Bl{Bj}}}}7072{{}L`}{eLd{{Lf{{Kb{Al}}}}}{{Kj{}{{Kh{c}}}}}}44{{KnKn}{{Bl{Gj}}}}{{LdKn}j}{AlAl}67{KnLd}8{ce{}{}}000{c{{Bb{e}}}{}{}}0000000{cBd{}}000{{LdLd}j}0`33{{LhA`}Ab}{cc{}}5{{}Lh}{{LhB`c}AbHh}665``7777{LjLl}{{Ljf}Lj}{LjLj}{LlLl}{{ce}j{}{}}03{{}Lj}4{{LjA`}Ab}{{LlA`}Ab}::??{{LjAl}Lj}73{{}Ll}8{ce{}{}}0{{LllC`}{{Bb{B`Af}}}}{c{{Bb{e}}}{}{}}000{cBd{}}0<<```````{Ln{{Kb{M`}}}}444444{LnLn}{M`M`}<<{{LnLn}Gj}{{M`M`}Gj}`{{LnLn}f}{{M`M`}f}{{LnA`}Ab}{{M`A`}Ab}{{MbA`}Ab}{cc{}}00>>>{Lnc{}}?{LnBj}{{Ln{Kb{Al}}}f}{{M`Al}f}{{AjAj}Mb}{Mb{{Bl{c}}}{}}{{LnLn}{{Bl{Gj}}}}{{M`M`}{{Bl{Gj}}}}{Lnj}`{ce{}{}}0{c{{Bb{e}}}{}{}}00000{cBd{}}00","c":[],"p":[[5,"ParserBuilder",0],[5,"Parser",0],[1,"bool"],[6,"Error",0],[1,"unit"],[1,"str"],[5,"String",1603],[5,"Formatter",1604],[8,"Result",1604],[5,"UnicodeWordError",0],[5,"Error",938],[5,"Error",81],[1,"char"],[1,"u8"],[1,"u32"],[5,"Hir",938],[6,"Result",1605],[5,"TypeId",1606],[5,"Flags",81],[5,"FlagsItem",81],[1,"usize"],[6,"Option",1607],[5,"Alternation",81],[6,"Ast",81],[5,"Assertion",81],[5,"Span",81],[5,"Literal",81],[5,"Group",81],[5,"ClassBracketed",81],[5,"ClassPerl",81],[5,"ClassUnicode",81],[6,"ErrorKind",81],[5,"Position",81],[5,"WithComments",81],[5,"Comment",81],[5,"Concat",81],[6,"LiteralKind",81],[6,"SpecialLiteralKind",81],[6,"HexLiteralKind",81],[6,"ClassPerlKind",81],[5,"ClassAscii",81],[6,"ClassAsciiKind",81],[6,"ClassUnicodeKind",81],[6,"ClassUnicodeOpKind",81],[6,"ClassSet",81],[6,"ClassSetItem",81],[5,"ClassSetRange",81],[5,"ClassSetUnion",81],[5,"ClassSetBinaryOp",81],[6,"ClassSetBinaryOpKind",81],[6,"AssertionKind",81],[5,"Repetition",81],[5,"RepetitionOp",81],[6,"RepetitionKind",81],[6,"RepetitionRange",81],[6,"GroupKind",81],[5,"CaptureName",81],[5,"SetFlags",81],[6,"FlagsItemKind",81],[6,"Flag",81],[6,"Ordering",1608],[17,"Output"],[17,"Err"],[10,"Visitor",81],[5,"ParserBuilder",893],[5,"Parser",893],[5,"Printer",927],[10,"Write",1604],[5,"Vec",1609],[6,"Look",938],[5,"Capture",938],[6,"Class",938],[5,"ClassUnicode",938],[5,"ClassBytes",938],[6,"ErrorKind",938],[6,"HirKind",938],[5,"Literal",938],[5,"ClassUnicodeRange",938],[5,"ClassBytesRange",938],[5,"Repetition",938],[6,"Dot",938],[5,"Properties",938],[5,"LookSet",938],[5,"LookSetIter",938],[10,"Visitor",938],[5,"ClassUnicodeIter",938],[5,"ClassBytesIter",938],[5,"CaseFoldError",938],[1,"slice"],[5,"Box",1610],[10,"Into",1611],[17,"Item"],[10,"IntoIterator",1612],[10,"Borrow",1613],[5,"Literal",1388],[5,"Extractor",1388],[6,"ExtractKind",1388],[5,"Seq",1388],[10,"AsRef",1611],[5,"Printer",1501],[5,"TranslatorBuilder",1512],[5,"Translator",1512],[6,"Utf8Sequence",1549],[5,"Utf8Range",1549],[5,"Utf8Sequences",1549],[15,"NamedValue",885],[15,"FlagDuplicate",888],[15,"FlagRepeatedNegation",888],[15,"GroupNameDuplicate",888],[15,"CaptureName",891]],"b":[[29,"impl-Debug-for-Error"],[30,"impl-Display-for-Error"],[33,"impl-Display-for-UnicodeWordError"],[34,"impl-Debug-for-UnicodeWordError"],[35,"impl-From%3CError%3E-for-Error"],[36,"impl-From%3CError%3E-for-Error"],[493,"impl-Display-for-Error"],[494,"impl-Debug-for-Error"],[495,"impl-Display-for-ErrorKind"],[496,"impl-Debug-for-ErrorKind"],[501,"impl-Debug-for-Ast"],[502,"impl-Display-for-Ast"],[1131,"impl-Display-for-Error"],[1132,"impl-Debug-for-Error"],[1133,"impl-Debug-for-ErrorKind"],[1134,"impl-Display-for-ErrorKind"],[1135,"impl-Debug-for-Hir"],[1136,"impl-Display-for-Hir"],[1153,"impl-Debug-for-CaseFoldError"],[1154,"impl-Display-for-CaseFoldError"],[1432,"impl-From%3Cu8%3E-for-Literal"],[1433,"impl-From%3Cchar%3E-for-Literal"]]}],\ +["regex",{"doc":"This crate provides routines for searching strings for …","t":"FFFFPGFFFFFFFKFFFFFFFPNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNCNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNHNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNMNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNFFFFFFFFFFFKFFFFFFFNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNMNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNN","n":["CaptureLocations","CaptureMatches","CaptureNames","Captures","CompiledTooBig","Error","Match","Matches","NoExpand","Regex","RegexBuilder","RegexSet","RegexSetBuilder","Replacer","ReplacerRef","SetMatches","SetMatchesIntoIter","SetMatchesIter","Split","SplitN","SubCaptureMatches","Syntax","as_str","as_str","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","build","build","by_ref","by_ref","bytes","capture_locations","capture_names","captures","captures_at","captures_iter","captures_len","captures_read","captures_read_at","case_insensitive","case_insensitive","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","count","count","count","count","crlf","crlf","default","description","dfa_size_limit","dfa_size_limit","dot_matches_new_line","dot_matches_new_line","empty","end","eq","eq","escape","expand","extract","find","find_at","find_iter","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from_str","get","get","ignore_whitespace","ignore_whitespace","index","index","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into_iter","into_iter","into_iter","into_iter","into_iter","into_iter","into_iter","into_iter","into_iter","into_iter","is_empty","is_empty","is_match","is_match","is_match_at","is_match_at","iter","iter","len","len","len","len","len","line_terminator","line_terminator","matched","matched_any","matches","matches_at","multi_line","multi_line","name","nest_limit","nest_limit","new","new","new","new","next","next","next","next","next","next","next","next","next_back","next_back","no_expansion","no_expansion","no_expansion","no_expansion","octal","octal","patterns","range","replace","replace_all","replace_append","replace_append","replace_append","replacen","shortest_match","shortest_match_at","size_hint","size_hint","size_hint","size_hint","size_hint","size_limit","size_limit","split","splitn","start","static_captures_len","swap_greed","swap_greed","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_string","to_string","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","unicode","unicode","CaptureLocations","CaptureMatches","CaptureNames","Captures","Match","Matches","NoExpand","Regex","RegexBuilder","RegexSet","RegexSetBuilder","Replacer","ReplacerRef","SetMatches","SetMatchesIntoIter","SetMatchesIter","Split","SplitN","SubCaptureMatches","as_bytes","as_str","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","build","build","by_ref","by_ref","capture_locations","capture_names","captures","captures_at","captures_iter","captures_len","captures_read","captures_read_at","case_insensitive","case_insensitive","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","count","count","count","count","crlf","crlf","default","dfa_size_limit","dfa_size_limit","dot_matches_new_line","dot_matches_new_line","empty","end","eq","expand","extract","find","find_at","find_iter","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from_str","get","get","ignore_whitespace","ignore_whitespace","index","index","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into_iter","into_iter","into_iter","into_iter","into_iter","into_iter","into_iter","into_iter","into_iter","into_iter","is_empty","is_empty","is_match","is_match","is_match_at","is_match_at","iter","iter","len","len","len","len","len","line_terminator","line_terminator","matched","matched_any","matches","matches_at","multi_line","multi_line","name","nest_limit","nest_limit","new","new","new","new","next","next","next","next","next","next","next","next","next_back","next_back","no_expansion","no_expansion","no_expansion","no_expansion","octal","octal","patterns","range","replace","replace_all","replace_append","replace_append","replace_append","replacen","shortest_match","shortest_match_at","size_hint","size_hint","size_hint","size_hint","size_hint","size_limit","size_limit","split","splitn","start","static_captures_len","swap_greed","swap_greed","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_string","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","unicode","unicode"],"q":[[0,"regex"],[341,"regex::bytes"],[662,"core::result"],[663,"core::option"],[664,"alloc::string"],[665,"core::fmt"],[666,"core::fmt"],[667,"core::convert"],[668,"core::iter::traits::collect"],[669,"alloc::borrow"],[670,"core::ops::range"],[671,"core::any"],[672,"alloc::vec"]],"d":["A low level representation of the byte offsets of each …","An iterator over all non-overlapping capture matches in a …","An iterator over the names of all capture groups in a …","Represents the capture groups for a single match.","The compiled program exceeded the set size limit. The …","An error that occurred during parsing or compiling a …","Represents a single match of a regex in a haystack.","An iterator over all non-overlapping matches in a haystack.","A helper type for forcing literal string replacement.","A compiled regular expression for searching Unicode …","A configurable builder for a Regex.","Match multiple, possibly overlapping, regexes in a single …","A configurable builder for a RegexSet.","A trait for types that can be used to replace matches in a …","A by-reference adaptor for a Replacer.","A set of matches returned by a regex set.","An owned iterator over the set of matches from a regex set.","A borrowed iterator over the set of matches from a regex …","An iterator over all substrings delimited by a regex match.","An iterator over at most N substrings delimited by a regex …","An iterator over all group matches in a Captures value.","A syntax error.","Returns the original string of this regex.","Returns the substring of the haystack that matched.","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","Compiles the pattern given to RegexBuilder::new with the …","Compiles the patterns given to RegexSetBuilder::new with …","Returns a type that implements Replacer, but that borrows …","Returns a type that implements Replacer, but that borrows …","Search for regex matches in &[u8] haystacks.","Returns a fresh allocated set of capture locations that can","Returns an iterator over the capture names in this regex.","This routine searches for the first match of this regex in …","Returns the same as Regex::captures, but starts the search …","Returns an iterator that yields successive non-overlapping …","Returns the number of captures groups in this regex.","This is like Regex::captures, but writes the byte offsets …","Returns the same as Regex::captures_read, but starts the …","This configures whether to enable case insensitive …","This configures whether to enable case insensitive …","","","","","","","","","","","","","","","","","","","","","","","","","","","","","This configures CRLF mode for the entire pattern.","This configures CRLF mode for all of the patterns.","","","Set the approximate capacity, in bytes, of the cache of …","Set the approximate capacity, in bytes, of the cache of …","This configures dot-matches-new-line mode for the entire …","This configures dot-matches-new-line mode for the entire …","Create a new empty regex set.","Returns the byte offset of the end of the match in the …","","","Escapes all regular expression meta characters in pattern.","Expands all instances of $ref in replacement to the …","This is a convenience routine for extracting the substrings","This routine searches for the first match of this regex in …","Returns the same as Regex::find, but starts the search at …","Returns an iterator that yields successive non-overlapping …","","","","","","Shows the original regular expression.","Shows the original regular expression.","","","","","","","","","","","","","","","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Attempts to parse a string into a regular expression","Returns the Match associated with the capture group at …","Returns the start and end byte offsets of the capture …","This configures verbose mode for the entire pattern.","This configures verbose mode for all of the patterns.","","","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","","","","","","","","","","","Returns true if and only if this match has a length of …","Returns true if this set contains no regexes.","Returns true if and only if there is a match for the regex …","Returns true if and only if one of the regexes in this set …","Returns the same as Regex::is_match, but starts the search …","Returns true if and only if one of the regexes in this set …","Returns an iterator over all capture groups. This includes …","Returns an iterator over the indices of the regexes that …","Returns the total number of capture groups. This includes …","Returns the length, in bytes, of this match.","Returns the total number of capture groups (even if they …","Returns the total number of regexes in this set.","The total number of regexes in the set that created these …","Configures the line terminator to be used by the regex.","Configures the line terminator to be used by the regex.","Whether the regex at the given index matched.","Whether this set contains any matches.","Returns the set of regexes that match in the given …","Returns the set of regexes that match in the given …","This configures multi-line mode for the entire pattern.","This configures multi-line mode for all of the patterns.","Returns the Match associated with the capture group named …","Set the nesting limit for this parser.","Set the nesting limit for this parser.","Create a new builder with a default configuration for the …","Create a new builder with a default configuration for the …","Compiles a regular expression. Once compiled, it can be …","Create a new regex set with the given regular expressions.","","","","","","","","","","","Return a fixed unchanging replacement string.","Return a fixed unchanging replacement string.","","","This configures octal mode for the entire pattern.","This configures octal mode for all of the patterns.","Returns the regex patterns that this regex set was …","Returns the range over the starting and ending byte …","Replaces the leftmost-first match in the given haystack …","Replaces all non-overlapping matches in the haystack with …","Appends possibly empty data to dst to replace the current …","","","Replaces at most limit non-overlapping matches in the …","Returns the end byte offset of the first match in the …","Returns the same as Regex::shortest_match, but starts the …","","","","","","Sets the approximate size limit, in bytes, of the compiled …","Sets the approximate size limit, in bytes, of the compiled …","Returns an iterator of substrings of the haystack given, …","Returns an iterator of at most limit substrings of the …","Returns the byte offset of the start of the match in the …","Returns the total number of capturing groups that appear …","This configures swap-greed mode for the entire pattern.","This configures swap-greed mode for all of the patterns.","","","","","","","","","","","","","","","","","","","Attempts to parse a string into a regular expression","","Attempts to parse a string into a regular expression","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","This configures Unicode mode for the entire pattern.","This configures Unicode mode for the all of the patterns.","A low level representation of the byte offsets of each …","An iterator over all non-overlapping capture matches in a …","An iterator over the names of all capture groups in a …","Represents the capture groups for a single match.","Represents a single match of a regex in a haystack.","An iterator over all non-overlapping matches in a haystack.","A helper type for forcing literal string replacement.","A compiled regular expression for searching Unicode …","A configurable builder for a Regex.","Match multiple, possibly overlapping, regexes in a single …","A configurable builder for a RegexSet.","A trait for types that can be used to replace matches in a …","A by-reference adaptor for a Replacer.","A set of matches returned by a regex set.","An owned iterator over the set of matches from a regex set.","A borrowed iterator over the set of matches from a regex …","An iterator over all substrings delimited by a regex match.","An iterator over at most N substrings delimited by a regex …","An iterator over all group matches in a Captures value.","Returns the substring of the haystack that matched.","Returns the original string of this regex.","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","Compiles the pattern given to RegexBuilder::new with the …","Compiles the patterns given to RegexSetBuilder::new with …","Returns a type that implements Replacer, but that borrows …","Returns a type that implements Replacer, but that borrows …","Returns a fresh allocated set of capture locations that can","Returns an iterator over the capture names in this regex.","This routine searches for the first match of this regex in …","Returns the same as Regex::captures, but starts the search …","Returns an iterator that yields successive non-overlapping …","Returns the number of captures groups in this regex.","This is like Regex::captures, but writes the byte offsets …","Returns the same as Regex::captures_read, but starts the …","This configures whether to enable case insensitive …","This configures whether to enable case insensitive …","","","","","","","","","","","","","","","","","","","","","","","","","","","This configures CRLF mode for the entire pattern.","This configures CRLF mode for all of the patterns.","","Set the approximate capacity, in bytes, of the cache of …","Set the approximate capacity, in bytes, of the cache of …","This configures dot-matches-new-line mode for the entire …","This configures dot-matches-new-line mode for the entire …","Create a new empty regex set.","Returns the byte offset of the end of the match in the …","","Expands all instances of $ref in replacement to the …","This is a convenience routine for extracting the substrings","This routine searches for the first match of this regex in …","Returns the same as Regex::find, but starts the search at …","Returns an iterator that yields successive non-overlapping …","","","","Shows the original regular expression.","Shows the original regular expression.","","","","","","","","","","","","","","","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Attempts to parse a string into a regular expression","Returns the Match associated with the capture group at …","Returns the start and end byte offsets of the capture …","This configures verbose mode for the entire pattern.","This configures verbose mode for all of the patterns.","","","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","","","","","","","","","","","Returns true if and only if this match has a length of …","Returns true if this set contains no regexes.","Returns true if and only if there is a match for the regex …","Returns true if and only if one of the regexes in this set …","Returns the same as Regex::is_match, but starts the search …","Returns true if and only if one of the regexes in this set …","Returns an iterator over all capture groups. This includes …","Returns an iterator over the indices of the regexes that …","Returns the total number of capture groups. This includes …","Returns the length, in bytes, of this match.","Returns the total number of capture groups (even if they …","Returns the total number of regexes in this set.","The total number of regexes in the set that created these …","Configures the line terminator to be used by the regex.","Configures the line terminator to be used by the regex.","Whether the regex at the given index matched.","Whether this set contains any matches.","Returns the set of regexes that match in the given …","Returns the set of regexes that match in the given …","This configures multi-line mode for the entire pattern.","This configures multi-line mode for all of the patterns.","Returns the Match associated with the capture group named …","Set the nesting limit for this parser.","Set the nesting limit for this parser.","Create a new builder with a default configuration for the …","Create a new builder with a default configuration for the …","Compiles a regular expression. Once compiled, it can be …","Create a new regex set with the given regular expressions.","","","","","","","","","","","Return a fixed unchanging replacement byte string.","Return a fixed unchanging replacement byte string.","","","This configures octal mode for the entire pattern.","This configures octal mode for all of the patterns.","Returns the regex patterns that this regex set was …","Returns the range over the starting and ending byte …","Replaces the leftmost-first match in the given haystack …","Replaces all non-overlapping matches in the haystack with …","Appends possibly empty data to dst to replace the current …","","","Replaces at most limit non-overlapping matches in the …","Returns the end byte offset of the first match in the …","Returns the same as shortest_match, but starts the search …","","","","","","Sets the approximate size limit, in bytes, of the compiled …","Sets the approximate size limit, in bytes, of the compiled …","Returns an iterator of substrings of the haystack given, …","Returns an iterator of at most limit substrings of the …","Returns the byte offset of the start of the match in the …","Returns the total number of capturing groups that appear …","This configures swap-greed mode for the entire pattern.","This configures swap-greed mode for all of the patterns.","","","","","","","","","","","","","","","","","Attempts to parse a string into a regular expression","Attempts to parse a string into a regular expression","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","This configures Unicode mode for the entire pattern.","This configures Unicode mode for the all of the patterns."],"i":[0,0,0,0,5,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,5,1,3,13,4,7,5,1,3,11,23,16,29,30,12,18,10,19,8,20,33,21,13,4,7,5,1,3,11,23,16,29,30,12,18,10,19,8,20,33,21,4,7,9,9,0,1,1,1,1,1,1,1,1,4,7,4,7,5,1,3,11,12,18,19,8,20,21,4,7,5,1,3,11,12,18,19,8,20,21,23,16,12,18,4,7,8,5,4,7,4,7,8,3,5,3,0,13,13,1,1,1,13,4,7,5,5,1,1,3,11,23,16,29,30,12,18,10,19,8,20,33,21,13,4,7,5,1,3,11,23,16,29,30,12,18,10,19,8,20,33,21,1,13,11,4,7,13,13,13,4,7,5,1,3,11,23,16,29,30,12,18,10,19,8,20,33,21,23,16,29,30,12,18,20,20,33,21,3,8,1,8,1,8,13,20,13,3,11,8,20,4,7,20,20,8,8,4,7,13,4,7,4,7,1,8,23,16,29,30,12,18,33,21,33,21,9,9,10,19,4,7,8,3,1,1,9,10,19,1,1,1,30,12,18,33,21,4,7,1,1,3,1,4,7,4,7,5,1,3,11,12,18,19,8,20,21,5,1,13,4,7,5,1,1,1,3,11,23,16,29,30,12,18,10,19,8,20,33,21,13,4,7,5,1,3,11,23,16,29,30,12,18,10,19,8,20,33,21,13,4,7,5,1,3,11,23,16,29,30,12,18,10,19,8,20,33,21,4,7,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,43,44,52,45,46,44,43,50,58,53,60,61,51,54,49,55,47,56,62,57,52,45,46,44,43,50,58,53,60,61,51,54,49,55,47,56,62,57,45,46,48,48,44,44,44,44,44,44,44,44,45,46,45,46,44,43,50,51,54,55,47,56,57,45,46,44,43,50,51,54,55,47,56,57,58,53,51,54,45,46,47,45,46,45,46,47,43,43,52,52,44,44,44,52,45,46,44,44,43,50,58,53,60,61,51,54,49,55,47,56,62,57,52,45,46,44,43,50,58,53,60,61,51,54,49,55,47,56,62,57,44,52,50,45,46,52,52,52,45,46,44,43,50,58,53,60,61,51,54,49,55,47,56,62,57,58,53,60,61,51,54,56,56,62,57,43,47,44,47,44,47,52,56,52,43,50,47,56,45,46,56,56,47,47,45,46,52,45,46,45,46,44,47,58,53,60,61,51,54,62,57,62,57,48,48,49,55,45,46,47,43,44,44,48,49,55,44,44,44,61,51,54,62,57,45,46,44,44,43,44,45,46,45,46,44,43,50,51,54,55,47,56,57,44,52,45,46,44,44,44,43,50,58,53,60,61,51,54,49,55,47,56,62,57,52,45,46,44,43,50,58,53,60,61,51,54,49,55,47,56,62,57,52,45,46,44,43,50,58,53,60,61,51,54,49,55,47,56,62,57,45,46],"f":"``````````````````````{bd}{fd}{ce{}{}}0000000000000000000000000000000000000{h{{l{bj}}}}{n{{l{A`j}}}}{Ab{{Ad{Ab}}}}0`{bAf}{bAh}{{bd}{{Al{Aj}}}}{{bdAn}{{Al{Aj}}}}{{bd}B`}{bAn}{{bAfd}{{Al{f}}}}{{bAfdAn}{{Al{f}}}}{{hBb}h}{{nBb}n}{hh}{nn}{jj}{bb}{ff}{AfAf}{AhAh}{BdBd}{BfBf}{A`A`}{BhBh}{BjBj}{{ce}Bl{}{}}00000000000{BnAn}{B`An}{AhAn}{BdAn}{{hBb}h}{{nBb}n}{{}A`}{jd}{{hAn}h}{{nAn}n}543{fAn}{{jj}Bb}{{ff}Bb}{dC`}{{AjdC`}Bl}{Aj{{Cd{d{Cb{d}}}}}}{{bd}{{Al{f}}}}{{bdAn}{{Al{f}}}}{{bd}Bn}{{AjCf}Ch}{{hCf}Ch}{{nCf}Ch}{{jCf}Ch}0{{bCf}Ch}0{{fCf}Ch}{{AfCf}Ch}{{BnCf}Ch}{{B`Cf}Ch}{{CjCf}Ch}{{ClCf}Ch}{{AhCf}Ch}{{BdCf}Ch}{{{Ad{c}}Cf}Ch{CnD`}}{{BfCf}Ch}{{A`Cf}Ch}{{BhCf}Ch}{{DbCf}Ch}{{BjCf}Ch}{cc{}}000000000000000000{d{{l{bj}}}}{{AjAn}{{Al{f}}}}{{AfAn}{{Al{{Cd{AnAn}}}}}}{{hBb}h}{{nBb}n}{{AjAn}d}{{Ajd}d}{ce{}{}}000000000000000000000000{Bhc{}}011{fBb}{A`Bb}{{bd}Bb}{{A`d}Bb}{{bdAn}Bb}{{A`dAn}Bb}{AjBd}{BhBj}{AjAn}{fAn}{AfAn}{A`An}{BhAn}{{hDd}h}{{nDd}n}{{BhAn}Bb}{BhBb}{{A`d}Bh}{{A`dAn}Bh}{{hBb}h}{{nBb}n}{{Ajd}{{Al{f}}}}{{hDf}h}{{nDf}n}{dh}{en{{Dh{d}}}{{Dl{}{{Dj{c}}}}}}{d{{l{bj}}}}{e{{l{A`j}}}{{Dh{d}}}{{Dl{}{{Dj{c}}}}}}{Bn{{Al{f}}}}{B`{{Al{Aj}}}}{Cj{{Al{d}}}}{Cl{{Al{d}}}}{Ah{{Al{{Al{d}}}}}}{Bd{{Al{{Al{f}}}}}}{Db{{Al{An}}}}{Bj{{Al{An}}}}10{Ab{{Al{{Dn{d}}}}}}0{{{Ad{c}}}{{Al{{Dn{d}}}}}{AbD`}}{Bf{{Al{{Dn{d}}}}}}{{hBb}h}{{nBb}n}{A`{{E`{C`}}}}{f{{Eb{An}}}}{{bdc}{{Dn{d}}}Ab}0{{AbAjC`}Bl}{{{Ad{c}}AjC`}Bl{AbD`}}{{BfAjC`}Bl}{{bdAnc}{{Dn{d}}}Ab}{{bd}{{Al{An}}}}{{bdAn}{{Al{An}}}}{Cl{{Cd{An{Al{An}}}}}}{Ah{{Cd{An{Al{An}}}}}}{Bd{{Cd{An{Al{An}}}}}}{Db{{Cd{An{Al{An}}}}}}{Bj{{Cd{An{Al{An}}}}}}{{hAn}h}{{nAn}n}{{bd}Cj}{{bdAn}Cl}{fAn}{b{{Al{An}}}}{{hBb}h}{{nBb}n}{ce{}{}}00000000000{cC`{}}0{c{{l{e}}}{}{}}000{d{{l{bj}}}}1{C`{{l{bj}}}}222222222222222222222222222222222{cEd{}}00000000000000000076```````````````````{Ef{{E`{Dd}}}}{Ehd}777777777777777777777777777777777777{Ej{{l{Ehj}}}}{El{{l{Enj}}}}{F`{{Fb{F`}}}}0{EhFd}{EhFf}{{Eh{E`{Dd}}}{{Al{Fh}}}}{{Eh{E`{Dd}}An}{{Al{Fh}}}}{{Eh{E`{Dd}}}Fj}{EhAn}{{EhFd{E`{Dd}}}{{Al{Ef}}}}{{EhFd{E`{Dd}}An}{{Al{Ef}}}}{{EjBb}Ej}{{ElBb}El}{EjEj}{ElEl}{EhEh}{EfEf}{FdFd}{FfFf}{FlFl}{FnFn}{EnEn}{G`G`}{GbGb}{{ce}Bl{}{}}0000000000{GdAn}{FjAn}{FfAn}{FlAn}{{EjBb}Ej}{{ElBb}El}{{}En}{{EjAn}Ej}{{ElAn}El}432{EfAn}{{EfEf}Bb}{{Fh{E`{Dd}}{Gf{Dd}}}Bl}{Fh{{Cd{{E`{Dd}}{Cb{{E`{Dd}}}}}}}}{{Eh{E`{Dd}}}{{Al{Ef}}}}{{Eh{E`{Dd}}An}{{Al{Ef}}}}{{Eh{E`{Dd}}}Gd}{{FhCf}Ch}{{EjCf}Ch}{{ElCf}Ch}{{EhCf}Ch}0{{EfCf}Ch}{{FdCf}Ch}{{GdCf}Ch}{{FjCf}Ch}{{GhCf}Ch}{{GjCf}Ch}{{FfCf}Ch}{{FlCf}Ch}{{{Fb{c}}Cf}Ch{CnD`}}{{FnCf}Ch}{{EnCf}Ch}{{G`Cf}Ch}{{GlCf}Ch}{{GbCf}Ch}{cc{}}00000000000000000{d{{l{Ehj}}}}{{FhAn}{{Al{Ef}}}}{{FdAn}{{Al{{Cd{AnAn}}}}}}{{EjBb}Ej}{{ElBb}El}{{FhAn}{{E`{Dd}}}}{{Fhd}{{E`{Dd}}}}{ce{}{}}00000000000000000000000{G`c{}}011{EfBb}{EnBb}{{Eh{E`{Dd}}}Bb}{{En{E`{Dd}}}Bb}{{Eh{E`{Dd}}An}Bb}{{En{E`{Dd}}An}Bb}{FhFl}{G`Gb}{FhAn}{EfAn}{FdAn}{EnAn}{G`An}{{EjDd}Ej}{{ElDd}El}{{G`An}Bb}{G`Bb}{{En{E`{Dd}}}G`}{{En{E`{Dd}}An}G`}{{EjBb}Ej}{{ElBb}El}{{Fhd}{{Al{Ef}}}}{{EjDf}Ej}{{ElDf}El}{dEj}{eEl{{Dh{d}}}{{Dl{}{{Dj{c}}}}}}{d{{l{Ehj}}}}{e{{l{Enj}}}{{Dh{d}}}{{Dl{}{{Dj{c}}}}}}{Gd{{Al{Ef}}}}{Fj{{Al{Fh}}}}{Gh{{Al{{E`{Dd}}}}}}{Gj{{Al{{E`{Dd}}}}}}{Ff{{Al{{Al{d}}}}}}{Fl{{Al{{Al{Ef}}}}}}{Gl{{Al{An}}}}{Gb{{Al{An}}}}10{F`{{Al{{Dn{{E`{Dd}}}}}}}}0{{{Fb{c}}}{{Al{{Dn{{E`{Dd}}}}}}}{F`D`}}{Fn{{Al{{Dn{{E`{Dd}}}}}}}}{{EjBb}Ej}{{ElBb}El}{En{{E`{C`}}}}{Ef{{Eb{An}}}}{{Eh{E`{Dd}}c}{{Dn{{E`{Dd}}}}}F`}0{{F`Fh{Gf{Dd}}}Bl}{{{Fb{c}}Fh{Gf{Dd}}}Bl{F`D`}}{{FnFh{Gf{Dd}}}Bl}{{Eh{E`{Dd}}Anc}{{Dn{{E`{Dd}}}}}F`}{{Eh{E`{Dd}}}{{Al{An}}}}{{Eh{E`{Dd}}An}{{Al{An}}}}{Gj{{Cd{An{Al{An}}}}}}{Ff{{Cd{An{Al{An}}}}}}{Fl{{Cd{An{Al{An}}}}}}{Gl{{Cd{An{Al{An}}}}}}{Gb{{Cd{An{Al{An}}}}}}{{EjAn}Ej}{{ElAn}El}{{Eh{E`{Dd}}}Gh}{{Eh{E`{Dd}}An}Gj}{EfAn}{Eh{{Al{An}}}}{{EjBb}Ej}{{ElBb}El}{ce{}{}}0000000000{cC`{}}{c{{l{e}}}{}{}}000{C`{{l{Ehj}}}}{d{{l{Ehj}}}}22222222222222222222222222222222{cEd{}}0000000000000000076","c":[],"p":[[5,"Regex",0],[1,"str"],[5,"Match",0],[5,"RegexBuilder",0],[6,"Error",0],[6,"Result",662],[5,"RegexSetBuilder",0],[5,"RegexSet",0],[10,"Replacer",0],[5,"ReplacerRef",0],[5,"CaptureLocations",0],[5,"CaptureNames",0],[5,"Captures",0],[6,"Option",663],[1,"usize"],[5,"CaptureMatches",0],[1,"bool"],[5,"SubCaptureMatches",0],[5,"NoExpand",0],[5,"SetMatches",0],[5,"SetMatchesIter",0],[1,"unit"],[5,"Matches",0],[5,"String",664],[1,"array"],[1,"tuple"],[5,"Formatter",665],[8,"Result",665],[5,"Split",0],[5,"SplitN",0],[10,"Debug",665],[10,"Sized",666],[5,"SetMatchesIntoIter",0],[1,"u8"],[1,"u32"],[10,"AsRef",667],[17,"Item"],[10,"IntoIterator",668],[6,"Cow",669],[1,"slice"],[5,"Range",670],[5,"TypeId",671],[5,"Match",341],[5,"Regex",341],[5,"RegexBuilder",341],[5,"RegexSetBuilder",341],[5,"RegexSet",341],[10,"Replacer",341],[5,"ReplacerRef",341],[5,"CaptureLocations",341],[5,"CaptureNames",341],[5,"Captures",341],[5,"CaptureMatches",341],[5,"SubCaptureMatches",341],[5,"NoExpand",341],[5,"SetMatches",341],[5,"SetMatchesIter",341],[5,"Matches",341],[5,"Vec",672],[5,"Split",341],[5,"SplitN",341],[5,"SetMatchesIntoIter",341]],"b":[[126,"impl-Debug-for-Error"],[127,"impl-Display-for-Error"],[128,"impl-Debug-for-Regex"],[129,"impl-Display-for-Regex"],[168,"impl-Index%3Cusize%3E-for-Captures%3C\'h%3E"],[169,"impl-Index%3C%26str%3E-for-Captures%3C\'h%3E"],[195,"impl-IntoIterator-for-%26SetMatches"],[196,"impl-IntoIterator-for-SetMatches"],[284,"impl-TryFrom%3C%26str%3E-for-Regex"],[286,"impl-TryFrom%3CString%3E-for-Regex"],[456,"impl-Debug-for-Regex"],[457,"impl-Display-for-Regex"],[495,"impl-Index%3Cusize%3E-for-Captures%3C\'h%3E"],[496,"impl-Index%3C%26str%3E-for-Captures%3C\'h%3E"],[521,"impl-IntoIterator-for-SetMatches"],[522,"impl-IntoIterator-for-%26SetMatches"],[608,"impl-TryFrom%3CString%3E-for-Regex"],[609,"impl-TryFrom%3C%26str%3E-for-Regex"]]}],\ +["regex_automata",{"doc":"This crate exposes a variety of regex engines used by the …","t":"PGPFPFPFFGGPPFFFFPFPPNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNCNNNONNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNCNNNNNNNNNNNNNNNNNNNNNNNNNNCNNNNNNNNNCNNNNNNNNNNNNNNNNNNNNNONNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNCOOOOOCFFFFFNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNFPFFPGPNNNNNNNNNNNNNNNNNNCNNNNNNNNNNNNNNNNNNNNNNNNCNNNNNNNNNNNNNNNNNNNNNOOOFFFFFNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNFFFFNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNFFFFFFFFFNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNCPPFFPPFFPFPPPPFPFPFGFPGNNNNNNNNNNNCNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNONNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNONNNNNCNNNNNNNNONNNNNNNNNNNNNNNNNNOONNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNOOOOOOOOOOOFFFFFFNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNHNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNFFFFFFNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNCCCCCCCCCCCCCFFFFFNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNFFFFFFNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNFFNNNNNNNNNNNNNNNNNNNHHFFFFFFFNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNFNNNNNNNNNNNPPPGFFFPPPFPPPPPPPPPPPPNNNONNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNFFNNNNNNNNNNNNNNNNNNNNNFNNNNNNNNNNNNNNNNNNNTTTTTTFFFTTTFFFFTTTNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNFNNNNNNNNNNNNNNNNNNFNNNNNNNNNNNNNNNNNNNNNNNNNNNNHHHHNNNNNNNFFFONNNNNNONNNNNNNNNNNNNNNNNNNNNN","n":["All","Anchored","GaveUp","HalfMatch","HaystackTooLong","Input","LeftmostFirst","Match","MatchError","MatchErrorKind","MatchKind","No","Pattern","PatternID","PatternSet","PatternSetInsertError","PatternSetIter","Quit","Span","UnsupportedAnchored","Yes","anchored","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","capacity","clear","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","cmp","contains","contains","default","default","dfa","earliest","end","end","end","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","gave_up","get_anchored","get_earliest","get_range","get_span","hash","hash","hash","hash","haystack","haystack_too_long","hybrid","insert","into","into","into","into","into","into","into","into","into","into","into","into","into_iter","is_anchored","is_char_boundary","is_done","is_empty","is_empty","is_empty","is_full","iter","kind","len","len","len","meta","must","must","new","new","new","new","new","next","next_back","nfa","offset","offset","partial_cmp","pattern","pattern","pattern","quit","range","range","range","set_anchored","set_earliest","set_end","set_range","set_span","set_start","size_hint","span","span","start","start","start","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_string","to_string","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_insert","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","unsupported_anchored","util","byte","len","mode","offset","offset","onepass","BuildError","Builder","Cache","Config","DFA","alphabet_len","always_match","borrow","borrow","borrow","borrow","borrow","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","build","build_from_nfa","build_many","builder","byte_classes","captures","clone","clone","clone","clone","clone","clone_into","clone_into","clone_into","clone_into","clone_into","config","configure","create_cache","create_captures","default","find","fmt","fmt","fmt","fmt","fmt","fmt","from","from","from","from","from","get_byte_classes","get_config","get_match_kind","get_nfa","get_size_limit","get_starts_for_each_pattern","into","into","into","into","into","is_match","match_kind","memory_usage","memory_usage","never_match","new","new","new","new","new_from_nfa","new_many","pattern_len","reset","reset_cache","size_limit","source","starts_for_each_pattern","state_len","stride","stride2","syntax","thompson","to_owned","to_owned","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","try_into","try_search","try_search_slots","type_id","type_id","type_id","type_id","type_id","BuildError","Cache","CacheError","LazyStateID","Quit","StartError","UnsupportedAnchored","borrow","borrow","borrow","borrow","borrow_mut","borrow_mut","borrow_mut","borrow_mut","clone","clone","clone","clone","clone_into","clone_into","clone_into","clone_into","cmp","default","dfa","eq","fmt","fmt","fmt","fmt","fmt","fmt","fmt","from","from","from","from","hash","into","into","into","into","is_dead","is_match","is_quit","is_start","is_tagged","is_unknown","partial_cmp","regex","source","source","to_owned","to_owned","to_owned","to_owned","to_string","to_string","to_string","try_from","try_from","try_from","try_from","try_into","try_into","try_into","try_into","type_id","type_id","type_id","type_id","byte","err","mode","Builder","Cache","Config","DFA","OverlappingState","always_match","borrow","borrow","borrow","borrow","borrow","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","build","build_from_nfa","build_many","builder","byte_classes","byte_classes","cache_capacity","clear_count","clone","clone","clone","clone","clone","clone_into","clone_into","clone_into","clone_into","clone_into","config","configure","create_cache","default","eq","fmt","fmt","fmt","fmt","fmt","from","from","from","from","from","get_byte_classes","get_cache_capacity","get_config","get_match","get_match_kind","get_minimum_bytes_per_state","get_minimum_cache_capacity","get_minimum_cache_clear_count","get_nfa","get_prefilter","get_quit","get_skip_cache_capacity_check","get_specialize_start_states","get_starts_for_each_pattern","get_unicode_word_boundary","into","into","into","into","into","match_kind","match_len","match_pattern","memory_usage","memory_usage","minimum_bytes_per_state","minimum_cache_clear_count","never_match","new","new","new","new","new_many","next_eoi_state","next_state","next_state_untagged","next_state_untagged_unchecked","pattern_len","prefilter","quit","reset","reset_cache","search_finish","search_start","search_total_len","search_update","skip_cache_capacity_check","specialize_start_states","start","start_state","start_state_forward","start_state_reverse","starts_for_each_pattern","syntax","thompson","to_owned","to_owned","to_owned","to_owned","to_owned","try_from","try_from","try_from","try_from","try_from","try_into","try_into","try_into","try_into","try_into","try_search_fwd","try_search_overlapping_fwd","try_search_overlapping_rev","try_search_rev","try_which_overlapping_matches","type_id","type_id","type_id","type_id","type_id","unicode_word_boundary","Builder","Cache","FindMatches","Regex","as_parts","as_parts_mut","borrow","borrow","borrow","borrow","borrow_mut","borrow_mut","borrow_mut","borrow_mut","build","build_from_dfas","build_many","builder","clone","clone","clone_into","clone_into","create_cache","default","dfa","find","find_iter","fmt","fmt","fmt","fmt","forward","forward","forward_mut","from","from","from","from","into","into","into","into","into_iter","is_match","memory_usage","new","new","new","new_many","next","pattern_len","reset","reset_cache","reverse","reverse","reverse_mut","syntax","thompson","to_owned","to_owned","try_from","try_from","try_from","try_from","try_into","try_into","try_into","try_into","try_search","type_id","type_id","type_id","type_id","BuildError","Builder","Cache","CapturesMatches","Config","FindMatches","Regex","Split","SplitN","auto_prefilter","backtrack","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","build","build_from_hir","build_many","build_many_from_hir","builder","byte_classes","captures","captures_iter","captures_len","clone","clone","clone","clone","clone","clone_into","clone_into","clone_into","clone_into","clone_into","config","configure","count","count","create_cache","create_captures","default","dfa","dfa_size_limit","dfa_state_limit","find","find_iter","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","from","from","from","from","from","from","from","from","from","get_auto_prefilter","get_backtrack","get_byte_classes","get_config","get_dfa","get_dfa_size_limit","get_dfa_state_limit","get_hybrid","get_hybrid_cache_capacity","get_line_terminator","get_match_kind","get_nfa_size_limit","get_onepass","get_onepass_size_limit","get_prefilter","get_utf8_empty","get_which_captures","group_info","hybrid","hybrid_cache_capacity","input","input","input","input","into","into","into","into","into","into","into","into","into","into_iter","into_iter","into_iter","into_iter","is_accelerated","is_match","line_terminator","match_kind","memory_usage","memory_usage","new","new","new","new","new_many","next","next","next","next","nfa_size_limit","onepass","onepass_size_limit","pattern","pattern_len","prefilter","regex","regex","reset","search","search_captures","search_captures_with","search_half","search_half_with","search_slots","search_slots_with","search_with","size_hint","size_limit","source","split","splitn","static_captures_len","syntax","syntax_error","to_owned","to_owned","to_owned","to_owned","to_owned","to_string","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","utf8_empty","which_captures","which_overlapping_matches","which_overlapping_matches_with","thompson","All","BinaryUnion","BuildError","Builder","ByteRange","Capture","Compiler","Config","Dense","DenseTransitions","Fail","Implicit","Look","Match","NFA","None","PatternIter","Sparse","SparseTransitions","State","Transition","Union","WhichCaptures","add_capture_end","add_capture_start","add_empty","add_fail","add_look","add_match","add_range","add_sparse","add_union","add_union_reverse","always_match","backtrack","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","build","build","build_from_hir","build_many","build_many_from_hir","byte_classes","captures","clear","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","compiler","config","configure","current_pattern_id","default","default","default","end","eq","eq","eq","eq","finish_pattern","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","from","from","from","from","from","from","from","from","from","from","from","get_captures","get_look_matcher","get_look_matcher","get_nfa_size_limit","get_reverse","get_reverse","get_shrink","get_size_limit","get_utf8","get_utf8","get_which_captures","group_info","has_capture","has_empty","hash","into","into","into","into","into","into","into","into","into","into","into","into_iter","is_always_start_anchored","is_any","is_epsilon","is_none","is_reverse","is_utf8","look_matcher","look_matcher","look_set_any","look_set_prefix_any","matches","matches","matches","matches_byte","matches_byte","matches_byte","matches_unit","memory_usage","memory_usage","never_match","new","new","new","new","new_many","next","next","nfa_size_limit","patch","pattern_len","pattern_len","patterns","pikevm","reverse","set_look_matcher","set_reverse","set_size_limit","set_utf8","shrink","size_limit","source","start","start_anchored","start_pattern","start_pattern","start_unanchored","state","states","syntax","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_string","transitions","transitions","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","utf8","which_captures","alt1","alt2","alternates","group_index","look","next","next","pattern_id","pattern_id","slot","trans","BoundedBacktracker","Builder","Cache","Config","TryCapturesMatches","TryFindMatches","always_match","borrow","borrow","borrow","borrow","borrow","borrow","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","build","build_from_nfa","build_many","builder","clone","clone","clone","clone","clone_into","clone_into","clone_into","clone_into","config","configure","create_cache","create_captures","default","fmt","fmt","fmt","fmt","fmt","fmt","from","from","from","from","from","from","get_config","get_nfa","get_prefilter","get_visited_capacity","into","into","into","into","into","into","into_iter","into_iter","max_haystack_len","memory_usage","min_visited_capacity","never_match","new","new","new","new","new_from_nfa","new_many","next","next","pattern_len","prefilter","reset","reset_cache","syntax","thompson","to_owned","to_owned","to_owned","to_owned","try_captures","try_captures_iter","try_find","try_find_iter","try_from","try_from","try_from","try_from","try_from","try_from","try_into","try_into","try_into","try_into","try_into","try_into","try_is_match","try_search","try_search_slots","type_id","type_id","type_id","type_id","type_id","type_id","visited_capacity","Builder","Cache","CapturesMatches","Config","FindMatches","PikeVM","always_match","borrow","borrow","borrow","borrow","borrow","borrow","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","build","build_from_nfa","build_many","builder","captures","captures_iter","clone","clone","clone","clone","clone_into","clone_into","clone_into","clone_into","config","configure","create_cache","create_captures","default","find","find_iter","fmt","fmt","fmt","fmt","fmt","fmt","from","from","from","from","from","from","get_config","get_match_kind","get_nfa","get_prefilter","into","into","into","into","into","into","into_iter","into_iter","is_match","match_kind","memory_usage","never_match","new","new","new","new","new_from_nfa","new_many","next","next","pattern_len","prefilter","reset","reset_cache","search","search_slots","syntax","thompson","to_owned","to_owned","to_owned","to_owned","try_from","try_from","try_from","try_from","try_from","try_from","try_into","try_into","try_into","try_into","try_into","try_into","type_id","type_id","type_id","type_id","type_id","type_id","which_overlapping_matches","alphabet","captures","escape","interpolate","iter","lazy","look","pool","prefilter","primitives","start","syntax","wire","ByteClassElements","ByteClassIter","ByteClassRepresentatives","ByteClasses","Unit","alphabet_len","as_eoi","as_u8","as_usize","borrow","borrow","borrow","borrow","borrow","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","clone","clone","clone_into","clone_into","cmp","default","elements","empty","eoi","eoi","eq","fmt","fmt","fmt","fmt","fmt","from","from","from","from","from","get","get_by_unit","into","into","into","into","into","into_iter","into_iter","into_iter","is_byte","is_eoi","is_singleton","is_word_byte","iter","next","next","next","partial_cmp","representatives","set","singletons","stride2","to_owned","to_owned","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","u8","Captures","CapturesPatternIter","GroupInfo","GroupInfoAllNames","GroupInfoError","GroupInfoPatternNames","all","all_group_len","all_names","borrow","borrow","borrow","borrow","borrow","borrow","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","clear","clone","clone","clone","clone","clone","clone_into","clone_into","clone_into","clone_into","clone_into","count","count","default","empty","empty","explicit_slot_len","extract","extract_bytes","fmt","fmt","fmt","fmt","fmt","fmt","fmt","from","from","from","from","from","from","get_group","get_group_by_name","get_match","group_info","group_len","group_len","implicit_slot_len","interpolate_bytes","interpolate_bytes_into","interpolate_string","interpolate_string_into","into","into","into","into","into","into","into_iter","into_iter","into_iter","is_match","iter","matches","memory_usage","new","next","next","next","pattern","pattern_len","pattern_names","set_pattern","size_hint","size_hint","slot","slot_len","slots","slots","slots_mut","source","to_index","to_name","to_owned","to_owned","to_owned","to_owned","to_owned","to_string","try_from","try_from","try_from","try_from","try_from","try_from","try_into","try_into","try_into","try_into","try_into","try_into","type_id","type_id","type_id","type_id","type_id","type_id","DebugByte","DebugHaystack","borrow","borrow","borrow_mut","borrow_mut","clone","clone_into","fmt","fmt","from","from","into","into","to_owned","try_from","try_from","try_into","try_into","type_id","type_id","bytes","string","CapturesIter","HalfMatchesIter","MatchesIter","Searcher","TryCapturesIter","TryHalfMatchesIter","TryMatchesIter","advance","advance_half","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","clone","clone_into","fmt","fmt","fmt","fmt","fmt","fmt","fmt","from","from","from","from","from","from","from","infallible","infallible","infallible","input","input","input","input","input","into","into","into","into","into","into","into","into_captures_iter","into_half_matches_iter","into_iter","into_iter","into_iter","into_iter","into_iter","into_iter","into_matches_iter","new","next","next","next","next","next","next","to_owned","try_advance","try_advance_half","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_into","try_into","try_into","try_into","try_into","try_into","try_into","type_id","type_id","type_id","type_id","type_id","type_id","type_id","Lazy","borrow","borrow_mut","deref","fmt","from","get","into","new","try_from","try_into","type_id","End","EndCRLF","EndLF","Look","LookMatcher","LookSet","LookSetIter","Start","StartCRLF","StartLF","UnicodeWordBoundaryError","WordAscii","WordAsciiNegate","WordEndAscii","WordEndHalfAscii","WordEndHalfUnicode","WordEndUnicode","WordStartAscii","WordStartHalfAscii","WordStartHalfUnicode","WordStartUnicode","WordUnicode","WordUnicodeNegate","as_char","as_repr","available","bits","borrow","borrow","borrow","borrow","borrow","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","check","clone","clone","clone","clone","clone","clone_into","clone_into","clone_into","clone_into","clone_into","contains","contains_anchor","contains_anchor_crlf","contains_anchor_haystack","contains_anchor_lf","contains_anchor_line","contains_word","contains_word_ascii","contains_word_unicode","default","default","empty","eq","eq","fmt","fmt","fmt","fmt","fmt","fmt","from","from","from","from","from","from_repr","full","get_line_terminator","insert","intersect","into","into","into","into","into","into_iter","is_empty","is_end","is_end_crlf","is_end_lf","is_start","is_start_crlf","is_start_lf","is_word_ascii","is_word_ascii_negate","is_word_end_ascii","is_word_end_half_ascii","is_word_end_half_unicode","is_word_end_unicode","is_word_start_ascii","is_word_start_half_ascii","is_word_start_half_unicode","is_word_start_unicode","is_word_unicode","is_word_unicode_negate","iter","len","matches","matches_set","new","next","read_repr","remove","reversed","set_insert","set_intersect","set_line_terminator","set_remove","set_subtract","set_union","singleton","subtract","to_owned","to_owned","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","try_into","type_id","type_id","type_id","type_id","type_id","union","write_repr","Pool","PoolGuard","borrow","borrow","borrow_mut","borrow_mut","deref","deref_mut","fmt","fmt","from","from","get","into","into","new","put","try_from","try_from","try_into","try_into","type_id","type_id","Prefilter","borrow","borrow_mut","clone","clone_into","find","fmt","from","from_hir_prefix","from_hirs_prefix","into","is_fast","max_needle_len","memory_usage","new","prefix","to_owned","try_from","try_into","type_id","LIMIT","LIMIT","LIMIT","MAX","MAX","MAX","NonMaxUsize","PatternID","PatternIDError","SIZE","SIZE","SIZE","SmallIndex","SmallIndexError","StateID","StateIDError","ZERO","ZERO","ZERO","as_i32","as_i32","as_i32","as_u32","as_u32","as_u32","as_u64","as_u64","as_u64","as_usize","as_usize","as_usize","attempted","attempted","attempted","borrow","borrow","borrow","borrow","borrow","borrow","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","clone","clone","clone","clone","clone","clone","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","cmp","cmp","cmp","default","default","eq","eq","eq","eq","eq","eq","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","from","from","from","from","from","from","from","from","from_ne_bytes","from_ne_bytes","from_ne_bytes","from_ne_bytes_unchecked","from_ne_bytes_unchecked","from_ne_bytes_unchecked","get","hash","hash","hash","into","into","into","into","into","into","must","must","must","new","new","new","new","new_unchecked","new_unchecked","new_unchecked","one_more","one_more","one_more","partial_cmp","partial_cmp","partial_cmp","to_ne_bytes","to_ne_bytes","to_ne_bytes","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_string","to_string","to_string","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_into","try_into","try_into","try_into","try_into","try_into","type_id","type_id","type_id","type_id","type_id","type_id","Config","anchored","borrow","borrow_mut","clone","clone_into","fmt","from","from_input_forward","from_input_reverse","get_anchored","get_look_behind","into","look_behind","new","to_owned","try_from","try_into","type_id","Config","borrow","borrow_mut","case_insensitive","clone","clone_into","crlf","default","dot_matches_new_line","fmt","from","get_case_insensitive","get_crlf","get_dot_matches_new_line","get_ignore_whitespace","get_line_terminator","get_multi_line","get_nest_limit","get_octal","get_swap_greed","get_unicode","get_utf8","ignore_whitespace","into","line_terminator","multi_line","nest_limit","new","octal","parse","parse_many","parse_many_with","parse_with","swap_greed","to_owned","try_from","try_into","type_id","unicode","utf8","AlignAs","DeserializeError","SerializeError","_align","borrow","borrow","borrow","borrow_mut","borrow_mut","borrow_mut","bytes","fmt","fmt","fmt","fmt","fmt","from","from","from","into","into","into","to_string","to_string","try_from","try_from","try_from","try_into","try_into","try_into","type_id","type_id","type_id"],"q":[[0,"regex_automata"],[249,"regex_automata::MatchErrorKind"],[254,"regex_automata::dfa"],[255,"regex_automata::dfa::onepass"],[361,"regex_automata::hybrid"],[433,"regex_automata::hybrid::StartError"],[436,"regex_automata::hybrid::dfa"],[566,"regex_automata::hybrid::regex"],[639,"regex_automata::meta"],[832,"regex_automata::nfa"],[833,"regex_automata::nfa::thompson"],[1078,"regex_automata::nfa::thompson::State"],[1089,"regex_automata::nfa::thompson::backtrack"],[1197,"regex_automata::nfa::thompson::pikevm"],[1304,"regex_automata::util"],[1317,"regex_automata::util::alphabet"],[1398,"regex_automata::util::captures"],[1517,"regex_automata::util::escape"],[1538,"regex_automata::util::interpolate"],[1540,"regex_automata::util::iter"],[1634,"regex_automata::util::lazy"],[1646,"regex_automata::util::look"],[1789,"regex_automata::util::pool"],[1812,"regex_automata::util::prefilter"],[1832,"regex_automata::util::primitives"],[1988,"regex_automata::util::start"],[2007,"regex_automata::util::syntax"],[2047,"regex_automata::util::wire"],[2080,"core::cmp"],[2081,"core::ops::range"],[2082,"core::fmt"],[2083,"core::fmt"],[2084,"core::convert"],[2085,"core::hash"],[2086,"core::convert"],[2087,"core::ops::range"],[2088,"core::result"],[2089,"core::any"],[2090,"core::error"],[2091,"regex_syntax::hir"],[2092,"core::borrow"],[2093,"regex_syntax::error"],[2094,"alloc::sync"],[2095,"alloc::vec"],[2096,"core::iter::traits::collect"],[2097,"core::ops::function"],[2098,"core::fmt"]],"d":["Report all possible matches.","The type of anchored search to perform.","The search, based on heuristics, determined that it would …","A representation of “half” of a match reported by a …","This error occurs if the haystack given to the regex …","The parameters for a regex search including the haystack …","Report only the leftmost matches. When multiple leftmost …","A representation of a match reported by a regex engine.","An error indicating that a search stopped before reporting …","The underlying kind of a MatchError.","The kind of match semantics to use for a regex pattern.","Run an unanchored search. This means a match may occur …","Run an anchored search for a specific pattern. This means …","The identifier of a regex pattern, represented by a …","A set of PatternIDs.","An error that occurs when a PatternID failed to insert …","An iterator over all pattern identifiers in a PatternSet.","The search saw a “quit” byte at which it was …","A representation of a span reported by a regex engine.","An error indicating that a particular type of anchored …","Run an anchored search. This means that a match must begin …","Sets the anchor mode of a search.","","","","","","","","","","","","","","","","","","","","","","","","","Returns the total number of pattern identifiers that may …","Clear this set such that it contains no pattern IDs.","","","","","","","","","","","","","","","","","","","","","","","","","","Returns true when the given offset is contained within …","Return true if and only if the given pattern identifier is …","","","A module for building and searching with deterministic …","Whether to execute an “earliest” search or not.","Return the end position of this search.","The ending position of the match.","The end offset of the span, exclusive.","","","","","","","","","","","","","","","","","","","","","","","","","","Returns the argument unchanged.","","Returns the argument unchanged.","","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Create a new “gave up” error. The given offset …","Return the anchored mode for this search configuration.","Return whether this search should execute in “earliest”…","Return the span as a range for this search configuration.","Return the span for this search configuration.","","","","","Return a borrow of the underlying haystack as a slice of …","Create a new “haystack too long” error. The given len …","A module for building and searching with lazy …","Insert the given pattern identifier into this set and …","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","","Returns true if and only if this anchor mode corresponds …","Returns true if and only if the given offset in this search…","Return true if and only if this search can never return …","Returns true when this span is empty. That is, when …","Returns true when the span in this match is empty.","Return true if and only if this set has no pattern …","Return true if and only if this set has the maximum number …","Returns an iterator over all pattern identifiers in this …","Returns a reference to the underlying error kind.","Returns the length of this span.","Returns the length of this match.","Returns the total number of pattern identifiers in this …","Provides a regex matcher that composes several other regex …","Create a new half match from a pattern ID and a byte …","Create a new match from a pattern ID and a byte offset …","Create a new search configuration for the given haystack.","Create a new half match from a pattern ID and a byte …","Create a new match from a pattern ID and a span.","Create a new set of pattern identifiers with the given …","Create a new error value with the given kind.","","","Provides non-deterministic finite automata (NFA) and regex …","Returns a new span with offset added to this span’s start…","The position of the match.","","Returns the ID of the pattern that matched.","Returns the ID of the pattern that matched.","Returns the pattern ID associated with this configuration …","Create a new “quit” error. The given byte corresponds …","Like Input::span, but accepts any range instead.","Returns this span as a range.","Returns the match span as a range.","Set the anchor mode of a search.","Set whether the search should execute in “earliest” …","Set the ending offset for the span for this search …","Set the span for this search configuration given any range.","Set the span for this search configuration.","Set the starting offset for the span for this search …","","Set the span for this search.","Returns the span for this match.","Return the start position of this search.","The starting position of the match.","The start offset of the span, inclusive.","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","Insert the given pattern identifier into this set and …","","","","","","","","","","","","","","","","","","","","","","","","","Create a new “unsupported anchored” error. This occurs …","A collection of modules that provide APIs that are useful …","The “quit” byte that was observed that caused the …","The length of the haystack that exceeded the limit.","The anchored mode given that is unsupported.","The offset at which the quit byte was observed.","The offset at which the search stopped. This corresponds …","A DFA that can return spans for matching capturing groups.","An error that occurred during the construction of a …","A builder for a one-pass DFA.","A cache represents mutable state that a one-pass DFA …","The configuration used for building a one-pass DFA.","A one-pass DFA for executing a subset of anchored regex …","Returns the total number of elements in the alphabet for …","Create a new one-pass DFA that matches every input.","","","","","","","","","","","Build a one-pass DFA from the given pattern.","Build a DFA from the given NFA.","Build a one-pass DFA from the given patterns.","Return a builder for configuring the construction of a DFA.","Whether to attempt to shrink the size of the DFA’s …","Executes an anchored leftmost forward search and writes …","","","","","","","","","","","Return a default configuration for a DFA.","Apply the given one-pass DFA configuration options to this …","Create a new cache for this DFA.","Create a new empty set of capturing groups that is …","","Executes an anchored leftmost forward search, and returns …","","","","","","","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns whether this configuration has enabled byte …","Return the config for this one-pass DFA.","Returns the match semantics set in this configuration.","Returns a reference to the underlying NFA.","Returns the DFA size limit of this configuration if one …","Returns whether this configuration has enabled anchored …","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Executes an anchored leftmost forward search, and returns …","Set the desired match semantics.","Returns the memory usage, in bytes, of this DFA.","Returns the heap memory usage, in bytes, of this cache.","Create a new one-pass DFA that never matches any input.","Return a new default one-pass DFA configuration.","Create a new one-pass DFA builder with the default …","Parse the given regular expression using the default …","Create a new onepass::DFA cache.","Like new, but builds a one-pass DFA directly from an NFA. …","Like new, but parses multiple patterns into a single “…","Returns the total number of patterns compiled into this …","Reset this cache such that it can be used for searching …","Reset the given cache such that it can be used for …","Set a size limit on the total heap used by a one-pass DFA.","","Whether to compile a separate start state for each pattern …","Returns the total number of states in this one-pass DFA.","Returns the total stride for every state in this DFA. This …","Returns the total stride for every state in this DFA, …","Set the syntax configuration for this builder using …","Set the Thompson NFA configuration for this builder using …","","","","","","","","","","","","","","","","","Executes an anchored leftmost forward search and writes …","Executes an anchored leftmost forward search and writes …","","","","","","An error that occurs when initial construction of a lazy …","An error that occurs when cache inefficiency has dropped …","An error that occurs when cache usage has become …","A state identifier specifically tailored for lazy DFAs.","An error that occurs when a starting configuration’s …","An error that can occur when computing the start state for …","An error that occurs when the caller requests an anchored …","","","","","","","","","","","","","","","","","","","Types and routines specific to lazy DFAs.","","","","","","","","","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).","Return true if and only if this represents a dead state. A …","Return true if and only if this lazy state ID has been …","Return true if and only if this represents a quit state. A …","Return true if and only if this lazy state ID has been …","Return true if and only if this lazy state ID is tagged.","Return true if and only if this represents a lazy state ID …","","A lazy DFA backed Regex.","","","","","","","","","","","","","","","","","","","","","","The quit byte that was found.","The underlying cache error that occurred.","The anchored mode given that is unsupported.","A builder for constructing a lazy deterministic finite …","A cache represents a partially computed DFA.","The configuration used for building a lazy DFA.","A hybrid NFA/DFA (also called a “lazy DFA”) for regex …","Represents the current state of an overlapping search.","Create a new lazy DFA that matches every input.","","","","","","","","","","","Build a lazy DFA from the given pattern.","Build a DFA from the given NFA.","Build a lazy DFA from the given patterns.","Return a builder for configuring the construction of a …","Returns the equivalence classes that make up the alphabet …","Whether to attempt to shrink the size of the lazy DFA’s …","Sets the maximum amount of heap memory, in bytes, to …","Returns the total number of times this cache has been …","","","","","","","","","","","Return a default configuration for a DFA.","Apply the given lazy DFA configuration options to this …","Create a new cache for this lazy DFA.","","","","","","","","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns whether this configuration has enabled byte …","Returns the cache capacity set on this configuration.","Returns this lazy DFA’s configuration.","Return the match result of the most recent search to …","Returns the match semantics set in this configuration.","Returns, if set, the minimum number of bytes per state …","Returns the minimum lazy DFA cache capacity required for …","Returns, if set, the minimum number of times the cache …","Returns a reference to the underlying NFA.","Returns the prefilter set in this configuration, if one at …","Returns whether this configuration will instruct the lazy …","Returns whether the cache capacity check should be skipped.","Returns whether this configuration will instruct the lazy …","Returns whether this configuration has enabled anchored …","Returns whether this configuration has enabled heuristic …","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Set the desired match semantics.","Returns the total number of patterns that match in this …","Returns the pattern ID corresponding to the given match …","Returns the memory usage, in bytes, of this lazy DFA.","Returns the heap memory usage, in bytes, of this cache.","Configure a lazy DFA search to quit only when its …","Configure a lazy DFA search to quit after a certain number …","Create a new lazy DFA that never matches any input.","Parse the given regular expression using a default …","Create a new cache for the given lazy DFA.","Return a new default lazy DFA builder configuration.","Create a new lazy DFA builder with the default …","Parse the given regular expressions using a default …","Transitions from the current state to the next state for …","Transitions from the current state to the next state, …","Transitions from the current state to the next state, …","Transitions from the current state to the next state, …","Returns the total number of patterns compiled into this …","Set a prefilter to be used whenever a start state is …","Add a “quit” byte to the lazy DFA.","Reset this cache such that it can be used for searching …","Reset the given cache such that it can be used for …","Indicates that a search has finished at the given position.","Initializes a new search starting at the given position.","Returns the total number of bytes that have been searched …","Updates the current search to indicate that it has search …","Configures construction of a lazy DFA to use the minimum …","Enable specializing start states in the lazy DFA.","Create a new overlapping state that begins at the start …","Return the ID of the start state for this lazy DFA for the …","Return the ID of the start state for this lazy DFA when …","Return the ID of the start state for this lazy DFA when …","Whether to compile a separate start state for each pattern …","Set the syntax configuration for this builder using …","Set the Thompson NFA configuration for this builder using …","","","","","","","","","","","","","","","","Executes a forward search and returns the end position of …","Executes an overlapping forward search and returns the end …","Executes a reverse overlapping search and returns the …","Executes a reverse search and returns the start of the …","Writes the set of patterns that match anywhere in the …","","","","","","Heuristically enable Unicode word boundaries.","A builder for a regex based on a hybrid NFA/DFA.","A cache represents a partially computed forward and …","An iterator over all non-overlapping matches for an …","A regular expression that uses hybrid NFA/DFAs (also …","Return references to the forward and reverse caches, …","Return mutable references to the forward and reverse …","","","","","","","","","Build a regex from the given pattern.","Build a regex from its component forward and reverse …","Build a regex from the given patterns.","Return a builder for configuring the construction of a …","","","","","Create a new cache for this Regex.","","Set the lazy DFA compilation configuration for this …","Returns the start and end offset of the leftmost match. If …","Returns an iterator over all non-overlapping leftmost …","","","","","Return the underlying lazy DFA responsible for forward …","Return a reference to the forward cache.","Return a mutable reference to the forward cache.","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).","","Returns true if and only if this regex matches the given …","Returns the heap memory usage, in bytes, as a sum of the …","Parse the given regular expression using the default …","Create a new cache for the given Regex.","Create a new regex builder with the default configuration.","Like new, but parses multiple patterns into a single “…","","Returns the total number of patterns matched by this regex.","Reset this cache such that it can be used for searching …","Reset the given cache such that it can be used for …","Return the underlying lazy DFA responsible for reverse …","Return a reference to the reverse cache.","Return a mutable reference to the reverse cache.","Set the syntax configuration for this builder using …","Set the Thompson NFA configuration for this builder using …","","","","","","","","","","","Returns the start and end offset of the leftmost match. If …","","","","","An error that occurs when construction of a Regex fails.","A builder for configuring and constructing a Regex.","Represents mutable scratch space used by regex engines …","An iterator over all non-overlapping leftmost matches with …","An object describing the configuration of a Regex.","An iterator over all non-overlapping matches.","A regex matcher that works by composing several other …","Yields all substrings delimited by a regular expression …","Yields at most N spans delimited by a regular expression …","Toggles whether automatic prefilter support is enabled.","Toggle whether a bounded backtracking regex engine should …","","","","","","","","","","","","","","","","","","","Builds a Regex from a single pattern string.","Builds a Regex directly from an Hir expression.","Builds a Regex from many pattern strings.","Builds a Regex directly from many Hir expressions.","Return a builder for configuring the construction of a …","Whether to attempt to shrink the size of the alphabet for …","Executes a leftmost forward search and writes the spans of …","Returns an iterator over all non-overlapping Captures …","Returns the total number of capturing groups.","","","","","","","","","","","Return a default configuration for a Regex.","Configure the behavior of a Regex.","","","Creates a new cache for use with lower level search APIs …","Creates a new object for recording capture group offsets. …","","Toggle whether a fully compiled DFA should be available …","Sets the size limit, in bytes, for heap memory used for a …","Sets a limit on the total number of NFA states, beyond …","Executes a leftmost search and returns the first match …","Returns an iterator over all non-overlapping leftmost …","","","","","","","","","","","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns whether automatic prefilters are enabled, as set by","Returns whether the bounded backtracking regex engine may …","Returns whether byte classes are enabled, as set by …","Returns the configuration object used to build this Regex.","Returns whether the DFA regex engine may be used, as set by","Returns DFA size limit, as set by Config::dfa_size_limit.","Returns DFA size limit in terms of the number of states in …","Returns whether the hybrid NFA/DFA regex engine may be …","Returns hybrid NFA/DFA cache capacity, as set by …","Returns the line terminator for this configuration, as set …","Returns the match kind on this configuration, as set by …","Returns NFA size limit, as set by Config::nfa_size_limit.","Returns whether the one-pass DFA regex engine may be used, …","Returns one-pass DFA size limit, as set by …","Returns a manually set prefilter, if one was set by …","Returns whether empty matches must fall on valid UTF-8 …","Returns the capture configuration, as set by …","Return information about the capture groups in this Regex.","Toggle whether the hybrid NFA/DFA (also known as the “…","Set the cache capacity, in bytes, for the lazy DFA.","Returns the current Input associated with this iterator.","Returns the current Input associated with this iterator.","Returns the current Input associated with this iterator.","Returns the current Input associated with this iterator.","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","","","","","Returns true if this regex has a high chance of being “…","Returns true if and only if this regex matches the given …","Set the line terminator to be used by the ^ and $ anchors …","Set the match semantics for a Regex.","Return the total approximate heap memory, in bytes, used …","Returns the heap memory usage, in bytes, of this cache.","Builds a Regex from a single pattern string using the …","Creates a new Cache for use with this regex.","Create a new configuration object for a Regex.","Creates a new builder for configuring and constructing a …","Builds a Regex from many pattern strings using the default …","","","","","Sets the size limit, in bytes, to enforce on the …","Toggle whether a one-pass DFA should be available for use …","Sets the size limit, in bytes, for the one-pass DFA.","If it is known which pattern ID caused this build error to …","Returns the total number of patterns in this regex.","Overrides and sets the prefilter to use inside a Regex.","Returns the Regex value that created this iterator.","Returns the Regex value that created this iterator.","Reset this cache such that it can be used for searching …","Returns the start and end offset of the leftmost match. If …","Executes a leftmost forward search and writes the spans of …","This is like Regex::search_captures, but requires the …","Returns the end offset of the leftmost match. If no match …","This is like Regex::search_half, but requires the caller to","Executes a leftmost forward search and writes the spans of …","This is like Regex::search_slots, but requires the caller …","This is like Regex::search, but requires the caller to …","","If this error occurred because the regex exceeded the …","","Returns an iterator of spans of the haystack given, …","Returns an iterator of at most limit spans of the haystack …","Returns the total number of capturing groups that appear …","Configure the syntax options when parsing a pattern string …","If this error corresponds to a syntax error, then a …","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","Toggles whether empty matches are permitted to occur …","Configures what kinds of groups are compiled as “…","Writes the set of patterns that match anywhere in the …","This is like Regex::which_overlapping_matches, but …","Defines a Thompson NFA and provides the PikeVM and …","All capture states, including those corresponding to both …","An alternation such that there exists precisely two …","An error that can occurred during the construction of a …","An abstraction for building Thompson NFAs by hand.","A state with a single transition that can only be taken if …","An empty state that records a capture location.","A builder for compiling an NFA from a regex’s high-level …","The configuration used for a Thompson NFA compiler.","A dense representation of a state with multiple …","A sequence of transitions used to represent a dense state.","A state that cannot be transitioned out of. This is useful …","Only capture states corresponding to implicit capture …","A conditional epsilon transition satisfied via some sort of","A match state. There is at least one such occurrence of …","A byte oriented Thompson non-deterministic finite …","No capture states are compiled into the Thompson NFA.","An iterator over all pattern IDs in an NFA.","A state with possibly many transitions represented in a …","A sequence of transitions used to represent a sparse state.","A state in an NFA.","A single transition to another state.","An alternation such that there exists an epsilon …","A configuration indicating which kinds of State::Capture …","Add a “end capture” NFA state.","Add a “start capture” NFA state.","Add an “empty” NFA state.","Adds a “fail” NFA state.","Add a “look” NFA state.","Adds a “match” NFA state.","Add a “range” NFA state.","Add a “sparse” NFA state.","Add a “union” NFA state.","Add a “reverse union” NFA state.","Returns an NFA with a single regex pattern that always …","An NFA backed bounded backtracker for executing regex …","","","","","","","","","","","","","","","","","","","","","","","Assemble a NFA from the states added so far.","Compile the given regular expression pattern into an NFA.","Compile the given high level intermediate representation …","Compile the given regular expression patterns into a …","Compile the given high level intermediate representations …","Get the byte classes for this NFA.","Whether to include ‘Capture’ states in the NFA.","Clear this builder.","","","","","","","","","","","","","","","","","","","","","Return a compiler for configuring the construction of an …","Return a default configuration for an NFA.","Apply the given NFA configuration options to this builder.","Returns the pattern identifier of the current pattern.","","","","The inclusive end of the byte range.","","","","","Finish the assembly of a pattern in this NFA.","","","","","","","","","","","","","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Return whether NFA compilation is configured to produce …","Returns the look-around matcher used for this builder.","Return the look-around matcher for this NFA.","Return the configured NFA size limit, if it exists, in the …","Returns whether reverse mode is enabled for this builder.","Returns whether this configuration has enabled reverse NFA …","Return whether NFA shrinking is enabled.","Return the currently configured size limit.","Returns whether UTF-8 mode is enabled for this builder.","Returns whether this configuration has enabled UTF-8 mode.","Return what kinds of capture states will be compiled into …","Returns the capturing group info for this NFA.","Returns true if and only if this NFA has at least one …","Returns true if and only if this NFA can match the empty …","","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","","Returns true if and only if all starting states for this …","Returns true if this configuration indicates that some …","Returns true if and only if this state contains one or …","Returns true if this configuration indicates that no …","Returns true when this NFA is meant to be matched in …","Whether UTF-8 mode is enabled for this NFA or not.","Sets the look-around matcher that should be used with this …","Returns the look-around matcher associated with this NFA.","Returns the union of all look-around assertions used …","Returns the union of all prefix look-around assertions for …","This follows the matching transition for a particular byte.","This follows the matching transition for a particular byte.","Returns true if the position at in haystack falls in this …","This follows the matching transition for a particular byte.","This follows the matching transition for a particular byte.","Returns true if the given byte falls in this transition’…","Returns true if the given alphabet unit falls in this …","Returns the heap memory usage, in bytes, used by the NFA …","Returns the memory usage, in bytes, of this NFA.","Returns an NFA that never matches at any position.","Create a new builder for hand-assembling NFAs.","Return a new default Thompson NFA compiler configuration.","Create a new NFA builder with its default configuration.","Parse the given regular expression using a default …","Parse the given regular expressions using a default …","","The identifier of the state to transition to.","Sets an approximate size limit on the total heap used by …","Add a transition from one state to another.","Returns the number of patterns added to this builder so …","Returns the total number of regex patterns in this NFA.","Returns an iterator over all pattern identifiers in this …","An NFA backed Pike VM for executing regex searches with …","Reverse the NFA.","Sets the look-around matcher that should be used for the …","Sets whether the NFA produced by this builder should be …","Set the size limit on this builder.","Set whether the NFA produced by this builder should only …","Apply best effort heuristics to shrink the NFA at the …","If this error occurred because the NFA exceeded the …","","The inclusive start of the byte range.","Return the state identifier of the initial anchored state …","Start the assembly of a pattern in this NFA.","Return the state identifier of the initial anchored state …","Return the state identifier of the initial unanchored …","Return a reference to the NFA state corresponding to the …","Returns a slice of all states in this NFA.","Set the syntax configuration for this builder using …","","","","","","","","","","","","The sorted sequence of non-overlapping transitions.","A dense representation of this state’s transitions on …","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","Whether to enable UTF-8 mode during search or not.","Configures what kinds of capture groups are compiled into …","An unconditional epsilon transition to another NFA state. …","An unconditional epsilon transition to another NFA state. …","An ordered sequence of unconditional epsilon transitions …","The capture group index that this capture belongs to. …","The look-around assertion that must be satisfied before …","The state to transition to if the look-around assertion is …","The state to transition to, unconditionally.","The pattern ID that this capture belongs to.","The matching pattern ID.","The slot index for this capture. Every capturing group has …","The transition from this state to the next.","A backtracking regex engine that bounds its execution to …","A builder for a bounded backtracker.","A cache represents mutable state that a BoundedBacktracker …","The configuration used for building a bounded backtracker.","An iterator over all non-overlapping leftmost matches, …","An iterator over all non-overlapping matches for a …","Create a new BoundedBacktracker that matches every input.","","","","","","","","","","","","","Build a BoundedBacktracker from the given pattern.","Build a BoundedBacktracker directly from its NFA.","Build a BoundedBacktracker from the given patterns.","Return a builder for configuring the construction of a …","","","","","","","","","Return a default configuration for a BoundedBacktracker.","Apply the given BoundedBacktracker configuration options …","Create a new cache for this regex.","Create a new empty set of capturing groups that is …","","","","","","","","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Return the config for this BoundedBacktracker.","Returns a reference to the underlying NFA.","Returns the prefilter set in this configuration, if one at …","Returns the configured visited capacity.","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","","","Returns the maximum haystack length supported by this …","Returns the heap memory usage, in bytes, of this cache.","Returns the minimum visited capacity for the given …","Create a new BoundedBacktracker that never matches any …","Return a new default regex configuration.","Create a new BoundedBacktracker builder with its default …","Parse the given regular expression using the default …","Create a new BoundedBacktracker cache.","Example","Like new, but parses multiple patterns into a single “…","","","Returns the total number of patterns compiled into this …","Set a prefilter to be used whenever a start state is …","Reset this cache such that it can be used for searching …","Reset the given cache such that it can be used for …","Set the syntax configuration for this builder using …","Set the Thompson NFA configuration for this builder using …","","","","","Executes a leftmost forward search and writes the spans of …","Returns an iterator over all non-overlapping Captures …","Executes a leftmost forward search and returns a Match if …","Returns an iterator over all non-overlapping leftmost …","","","","","","","","","","","","","Returns true if and only if this regex matches the given …","Executes a leftmost forward search and writes the spans of …","Executes a leftmost forward search and writes the spans of …","","","","","","","Set the visited capacity used to bound backtracking.","A builder for a PikeVM.","A cache represents mutable state that a PikeVM requires …","An iterator over all non-overlapping leftmost matches, …","The configuration used for building a PikeVM.","An iterator over all non-overlapping matches for a …","A virtual machine for executing regex searches with …","Create a new PikeVM that matches every input.","","","","","","","","","","","","","Build a PikeVM from the given pattern.","Build a PikeVM directly from its NFA.","Build a PikeVM from the given patterns.","Return a builder for configuring the construction of a …","Executes a leftmost forward search and writes the spans of …","Returns an iterator over all non-overlapping Captures …","","","","","","","","","Return a default configuration for a PikeVM.","Apply the given PikeVM configuration options to this …","Create a new cache for this PikeVM.","Create a new empty set of capturing groups that is …","","Executes a leftmost forward search and returns a Match if …","Returns an iterator over all non-overlapping leftmost …","","","","","","","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Return the config for this PikeVM.","Returns the match semantics set in this configuration.","Returns a reference to the underlying NFA.","Returns the prefilter set in this configuration, if one at …","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","","","Returns true if and only if this PikeVM matches the given …","Set the desired match semantics.","Returns the heap memory usage, in bytes, of this cache.","Create a new PikeVM that never matches any input.","Return a new default PikeVM configuration.","Create a new PikeVM builder with its default configuration.","Parse the given regular expression using the default …","Create a new PikeVM cache.","Like new, but builds a PikeVM directly from an NFA. This …","Like new, but parses multiple patterns into a single “…","","","Returns the total number of patterns compiled into this …","Set a prefilter to be used whenever a start state is …","Reset this cache such that it can be used for searching …","Reset the given cache such that it can be used for …","Executes a leftmost forward search and writes the spans of …","Executes a leftmost forward search and writes the spans of …","Set the syntax configuration for this builder using …","Set the Thompson NFA configuration for this builder using …","","","","","","","","","","","","","","","","","","","","","","","Writes the set of patterns that match anywhere in the …","This module provides APIs for dealing with the alphabets …","Provides types for dealing with capturing groups.","Provides convenience routines for escaping raw bytes.","Provides routines for interpolating capture group …","Generic helpers for iteration of matches from a regex …","A lazily initialized value for safe sharing between …","Types and routines for working with look-around assertions.","A thread safe memory pool.","Defines a prefilter for accelerating regex searches.","Lower level primitive types that are useful in a variety …","Provides helpers for dealing with start state …","Utilities for dealing with the syntax of a regular …","Types and routines that support the wire format of finite …","An iterator over all elements in an equivalence class.","An iterator over each equivalence class.","An iterator over representative bytes from each …","A representation of byte oriented equivalence classes.","Unit represents a single unit of haystack for DFA based …","Return the total number of elements in the alphabet …","If this unit is an “end of input” sentinel, then …","If this unit is not an “end of input” sentinel, then …","Return this unit as a usize, regardless of whether it is a …","","","","","","","","","","","","","","","","","Returns an iterator of the bytes in the given equivalence …","Creates a new set of equivalence classes where all bytes …","Create a new “end of input” haystack unit.","Create a unit that represents the “end of input” …","","","","","","","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Get the equivalence class for the given byte.","Get the equivalence class for the given haystack unit and …","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","","","","Returns true if and only of this unit is a byte value …","Returns true when this unit represents an “end of input…","Returns true if and only if every byte in this class maps …","Returns true when this unit corresponds to an ASCII word …","Returns an iterator over all equivalence classes in this …","","","","","Returns an iterator over a sequence of representative …","Set the equivalence class for the given byte.","Creates a new set of equivalence classes where each byte …","Returns the stride, as a base-2 exponent, required for …","","","","","","","","","","","","","","","","","","Create a new haystack unit from a byte value.","The span offsets of capturing groups after a match has …","An iterator over all capturing groups in a Captures value.","Represents information about capturing groups in a …","An iterator over capturing groups and their names for a …","An error that may occur when building a GroupInfo.","An iterator over capturing groups and their names for a …","Create new storage for the offsets of all matching …","Return the total number of capture groups across all …","Return an iterator of all capture groups for all patterns …","","","","","","","","","","","","","Clear this Captures value.","","","","","","","","","","","","","","Create new storage for only tracking which pattern …","This creates an empty GroupInfo.","Returns the total number of slots for explicit capturing …","This is a convenience routine for extracting the substrings","This is a convenience routine for extracting the substrings","","","","","","","","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the span of a capturing group match corresponding …","Returns the span of a capturing group match corresponding …","Returns the pattern ID and the span of the match, if one …","Returns a reference to the underlying group info on which …","Return the total number of capturing groups for the …","Return the number of capture groups in a pattern.","Returns the total number of slots for implicit capturing …","Interpolates the capture references in replacement with the","Interpolates the capture references in replacement with the","Interpolates the capture references in replacement with the","Interpolates the capture references in replacement with the","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","","","","Returns true if and only if this capturing group …","Returns an iterator of possible spans for every capturing …","Create new storage for only the full match spans of a …","Returns the memory usage, in bytes, of this GroupInfo.","Creates a new group info from a sequence of patterns, …","","","","Returns the identifier of the pattern that matched when …","Returns the total number of patterns in this GroupInfo.","Return an iterator of all capture groups and their names …","Set the pattern on this Captures value.","","","Returns the starting slot corresponding to the given …","Returns the total number of slots in this GroupInfo across …","Returns the underlying slots, where each slot stores a …","Returns the starting and ending slot corresponding to the …","Returns the underlying slots as a mutable slice, where …","","Return the capture group index corresponding to the given …","Return the capture name for the given index and given …","","","","","","","","","","","","","","","","","","","","","","","","","Provides a convenient Debug implementation for a u8.","Provides a convenient Debug implementation for &[u8].","","","","","","","","","Returns the argument unchanged.","Returns the argument unchanged.","Calls U::from(self).","Calls U::from(self).","","","","","","","","Accepts a replacement byte string and interpolates capture …","Accepts a replacement string and interpolates capture …","An iterator over all non-overlapping captures for an …","An iterator over all non-overlapping half matches for an …","An iterator over all non-overlapping matches for an …","A searcher for creating iterators and performing lower …","An iterator over all non-overlapping captures for a …","An iterator over all non-overlapping half matches for a …","An iterator over all non-overlapping matches for a …","Return the next match for an infallible search if one …","Return the next half match for an infallible search if one …","","","","","","","","","","","","","","","","","","","","","","","","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Return an infallible version of this iterator.","Return an infallible version of this iterator.","Return an infallible version of this iterator.","Returns the current Input used by this iterator.","Returns the current Input used by this iterator.","Returns the current Input used by this searcher.","Returns the current Input used by this iterator.","Returns the current Input used by this iterator.","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Given a closure that executes a single search, return an …","Given a closure that executes a single search, return an …","","","","","","","Given a closure that executes a single search, return an …","Create a new fallible non-overlapping matches iterator.","","","","","","","","Return the next match for a fallible search if one exists, …","Return the next half match for a fallible search if one …","","","","","","","","","","","","","","","","","","","","","","A lazily initialized value that implements Deref for T.","","","","","Returns the argument unchanged.","Return a reference to the lazily initialized value.","Calls U::from(self).","Create a new Lazy value that is initialized via the given …","","","","Match the end of text. Specifically, this matches at the …","Match the end of a line or the end of text. Specifically, …","Match the end of a line or the end of text. Specifically, …","A look-around assertion.","A matcher for look-around assertions.","LookSet is a memory-efficient set of look-around …","An iterator over all look-around assertions in a LookSet.","Match the beginning of text. Specifically, this matches at …","Match the beginning of a line or the beginning of text. …","Match the beginning of a line or the beginning of text. …","An error that occurs when the Unicode-aware \\\\w class is …","Match an ASCII-only word boundary. That is, this matches a …","Match an ASCII-only negation of a word boundary.","Match the end of an ASCII-only word boundary. That is, …","Match the end half of an ASCII-only word boundary. That …","Match the end half of a Unicode word boundary. That is, …","Match the end of a Unicode word boundary. That is, this …","Match the start of an ASCII-only word boundary. That is, …","Match the start half of an ASCII-only word boundary. That …","Match the start half of a Unicode word boundary. That is, …","Match the start of a Unicode word boundary. That is, this …","Match a Unicode-aware word boundary. That is, this matches …","Match a Unicode-aware negation of a word boundary.","Returns a convenient single codepoint representation of …","Return the underlying representation of this look-around …","Checks that all assertions in this set can be matched.","The underlying representation this set is exposed to make …","","","","","","","","","","","Returns an error if and only if Unicode word boundary data …","","","","","","","","","","","Returns true if and only if the given look-around …","Returns true if and only if this set contains any anchor …","Returns true if and only if this set contains any “…","Returns true if and only if this set contains any “…","Returns true if and only if this set contains any “…","Returns true if and only if this set contains any “…","Returns true if and only if this set contains any word …","Returns true if and only if this set contains any ASCII …","Returns true if and only if this set contains any Unicode …","","","Create an empty set of look-around assertions.","","","","","","","","","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Given the underlying representation of a Look value, …","Create a full set of look-around assertions.","Returns the line terminator that was configured for this …","Return a new set that is equivalent to the original, but …","Returns a new set that is the intersection of this and the …","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","","Returns true if and only if this set is empty.","Returns true when Look::End is satisfied at the given …","Returns true when Look::EndCRLF is satisfied at the given …","Returns true when Look::EndLF is satisfied at the given …","Returns true when Look::Start is satisfied at the given …","Returns true when Look::StartCRLF is satisfied at the given","Returns true when Look::StartLF is satisfied at the given …","Returns true when Look::WordAscii is satisfied at the given","Returns true when Look::WordAsciiNegate is satisfied at …","Returns true when Look::WordEndAscii is satisfied at the …","Returns true when Look::WordEndHalfAscii is satisfied at …","Returns true when Look::WordEndHalfUnicode is satisfied at …","Returns true when Look::WordEndUnicode is satisfied at the …","Returns true when Look::WordStartAscii is satisfied at the …","Returns true when Look::WordStartHalfAscii is satisfied at …","Returns true when Look::WordStartHalfUnicode is satisfied …","Returns true when Look::WordStartUnicode is satisfied at …","Returns true when Look::WordUnicode is satisfied at the …","Returns true when Look::WordUnicodeNegate is satisfied at …","Returns an iterator over all of the look-around assertions …","Returns the total number of look-around assertions in this …","Returns true when the position at in haystack satisfies …","Returns true when all of the assertions in the given set …","Creates a new default matcher for look-around assertions.","","Return a LookSet from the slice given as a native endian …","Return a new set that is equivalent to the original, but …","Flip the look-around assertion to its equivalent for …","Updates this set in place with the result of inserting the …","Updates this set in place with the result of intersecting …","Sets the line terminator for use with (?m:^) and (?m:$).","Updates this set in place with the result of removing the …","Updates this set in place with the result of subtracting …","Updates this set in place with the result of unioning it …","Create a look-around set containing the look-around …","Returns a new set that is the result of subtracting the …","","","","","","","","","","","","","","","","","","","","","","Returns a new set that is the union of this and the one …","Write a LookSet as a native endian 32-bit integer to the …","A thread safe pool that works in an alloc-only context.","A guard that is returned when a caller requests a value …","","","","","","","","","Returns the argument unchanged.","Returns the argument unchanged.","Get a value from the pool. The caller is guaranteed to have","Calls U::from(self).","Calls U::from(self).","Create a new pool. The given closure is used to create …","Consumes this guard and puts it back into the pool.","","","","","","","A prefilter for accelerating regex searches.","","","","","Run this prefilter on haystack[span.start..end] and return …","","Returns the argument unchanged.","This attempts to extract prefixes from the given Hir …","This attempts to extract prefixes from the given Hir …","Calls U::from(self).","Implementations might return true here if they believe …","Return the length of the longest needle in this Prefilter","Returns the heap memory, in bytes, used by the underlying …","Create a new prefilter from a sequence of needles and a …","Returns the span of a prefix of …","","","","","The total number of values that can be represented as a …","The total number of values that can be represented.","The total number of values that can be represented.","The maximum index value.","The maximum value.","The maximum value.","A usize that can never be usize::MAX.","The identifier of a regex pattern, represented by a …","This error occurs when a value could not be constructed.","The number of bytes that a single small index uses in …","The number of bytes that a single value uses in memory.","The number of bytes that a single value uses in memory.","A type that represents a “small” index.","This error occurs when a small index could not be …","The identifier of a finite automaton state, represented by …","This error occurs when a value could not be constructed.","The zero index value.","The zero value.","The zero value.","Return the internal u32 of this small index represented as …","Return the internal value as a i32…","Return the internal value as a i32…","Return the internal u32 of this small index. This is …","Return the internal value as a u32. This is guaranteed to …","Return the internal value as a u32. This is guaranteed to …","Return this small index as a u64. This is guaranteed to …","Return the internal value as a u64. This is guaranteed to …","Return the internal value as a u64. This is guaranteed to …","Return this small index as a usize. This is guaranteed to …","Return the internal value as a usize. This is guaranteed to","Return the internal value as a usize. This is guaranteed to","Returns the value that could not be converted to a small …","Returns the value that could not be converted to an ID.","Returns the value that could not be converted to an ID.","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","Returns the argument unchanged.","","Returns the argument unchanged.","Returns the argument unchanged.","","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Decode this small index from the bytes given using the …","Decode this value from the bytes given using the native …","Decode this value from the bytes given using the native …","Decode this small index from the bytes given using the …","Decode this value from the bytes given using the native …","Decode this value from the bytes given using the native …","Return the underlying usize value. The returned value is …","","","","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Like SmallIndex::new, but panics if the given index is not …","Like new, but panics if the given value is not valid.","Like new, but panics if the given value is not valid.","Create a new NonMaxUsize from the given value.","Create a new small index.","Create a new value that is represented by a “small index.…","Create a new value that is represented by a “small index.…","Create a new small index without checking whether the …","Create a new value without checking whether the given …","Create a new value without checking whether the given …","Returns one more than this small index as a usize.","Returns one more than this value as a usize.","Returns one more than this value as a usize.","","","","Return the underlying small index integer as raw bytes in …","Return the underlying integer as raw bytes in native endian","Return the underlying integer as raw bytes in native endian","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","The configuration used to determine a DFA’s start state …","Set the anchored mode of a search.","","","","","","Returns the argument unchanged.","A convenience routine for building a start configuration …","A convenience routine for building a start configuration …","Return the anchored mode in this configuration.","Return the look-behind byte in this configuration, if one …","Calls U::from(self).","Set the look-behind byte at the start of a search.","Create a new default start configuration.","","","","","A common set of configuration options that apply to the …","","","Enable or disable the case insensitive flag by default.","","","Enable or disable the “CRLF mode” flag by default.","","Enable or disable the “dot matches any character” flag …","","Returns the argument unchanged.","Returns whether “case insensitive” mode is enabled.","Returns whether “CRLF” mode is enabled.","Returns whether “dot matches new line” mode is enabled.","Returns whether “ignore whitespace” mode is enabled.","Returns the line terminator in this syntax configuration.","Returns whether “multi line” mode is enabled.","Returns the “nest limit” setting.","Returns whether “octal” mode is enabled.","Returns whether “swap greed” mode is enabled.","Returns whether “unicode” mode is enabled.","Returns whether UTF-8 mode is enabled.","Enable verbose mode in the regular expression.","Calls U::from(self).","Sets the line terminator for use with (?u-s:.) and (?-us:.)…","Enable or disable the multi-line matching flag by default.","Set the nesting limit used for the regular expression …","Return a new default syntax configuration.","Whether to support octal syntax or not.","A convenience routine for parsing a pattern into an HIR …","A convenience routine for parsing many patterns into HIR …","A convenience routine for parsing many patterns into HIR …","A convenience routine for parsing a pattern into an HIR …","Enable or disable the “swap greed” flag by default.","","","","","Enable or disable the Unicode flag (u) by default.","When disabled, the builder will permit the construction of …","A hack to align a smaller type B with a bigger type T.","An error that occurs when deserializing an object defined …","An error that occurs when serializing an object from this …","A zero-sized field indicating the alignment we want.","","","","","","","A possibly non-sized field containing a sequence of bytes.","","","","","","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","","","","","","","","","","",""],"i":[12,0,14,0,14,0,12,0,0,0,0,2,2,0,0,0,0,14,0,14,2,1,6,1,7,8,9,3,10,11,2,12,13,14,6,1,7,8,9,3,10,11,2,12,13,14,3,3,6,1,7,8,9,3,10,11,2,12,13,14,6,1,7,8,9,3,10,11,2,12,13,14,6,7,3,6,12,0,1,1,9,7,6,7,7,8,9,3,2,12,13,14,6,1,7,8,9,3,10,10,11,2,12,13,13,14,6,6,1,1,7,7,8,9,3,10,11,2,12,13,14,13,1,1,1,1,6,7,8,9,1,13,0,3,6,1,7,8,9,3,10,11,2,12,13,14,11,2,1,1,7,9,3,3,3,13,7,9,3,0,8,9,1,8,9,3,13,11,11,0,7,8,6,8,9,2,13,1,7,9,1,1,1,1,1,1,11,1,9,1,9,7,6,1,7,8,9,3,10,11,2,12,13,14,10,13,6,6,6,6,6,1,7,8,9,3,10,11,2,12,13,14,3,6,1,7,8,9,3,10,11,2,12,13,14,6,1,7,8,9,3,10,11,2,12,13,14,13,0,142,143,144,142,145,0,0,0,0,0,0,36,36,41,38,36,42,37,41,38,36,42,37,38,38,38,36,41,36,41,38,36,42,37,41,38,36,42,37,36,38,36,36,41,36,41,38,36,42,37,37,41,38,36,42,37,41,36,41,36,41,41,41,38,36,42,37,36,41,36,42,36,41,38,36,42,36,36,36,42,36,41,37,41,36,36,36,38,38,41,38,36,42,37,37,41,38,36,42,37,41,38,36,42,37,36,36,41,38,36,42,37,0,49,0,0,49,0,49,48,49,50,51,48,49,50,51,48,49,50,51,48,49,50,51,51,51,0,51,48,48,49,49,50,50,51,48,49,50,51,51,48,49,50,51,51,51,51,51,51,51,51,0,48,49,48,49,50,51,48,49,50,48,49,50,51,48,49,50,51,48,49,50,51,146,147,148,0,0,0,0,0,52,52,56,55,53,57,52,56,55,53,57,53,53,53,52,52,55,55,56,52,56,55,53,57,52,56,55,53,57,52,53,52,55,57,52,56,55,53,57,52,56,55,53,57,55,55,52,57,55,55,55,55,52,55,55,55,55,55,55,52,56,55,53,57,55,52,52,52,56,55,55,52,52,56,55,53,52,52,52,52,52,52,55,55,56,52,56,56,56,56,55,55,57,52,52,52,55,53,53,52,56,55,53,57,52,56,55,53,57,52,56,55,53,57,52,52,52,52,52,52,56,55,53,57,55,0,0,0,0,60,60,62,63,60,61,62,63,60,61,61,61,61,62,60,61,60,61,62,61,61,62,62,62,63,60,61,62,60,60,62,63,60,61,62,63,60,61,63,62,60,62,60,61,62,63,62,60,62,62,60,60,61,61,60,61,62,63,60,61,62,63,60,61,62,62,63,60,61,0,0,0,0,0,0,0,0,0,64,64,67,66,72,70,73,74,71,64,65,67,66,72,70,73,74,71,64,65,65,65,65,65,66,64,66,66,66,67,66,71,64,65,67,66,71,64,65,66,65,72,70,66,66,64,64,64,64,66,66,67,67,66,72,70,73,74,71,64,65,67,66,72,70,73,74,71,64,65,64,64,64,66,64,64,64,64,64,64,64,64,64,64,64,64,64,66,64,64,72,70,73,74,67,66,72,70,73,74,71,64,65,72,70,73,74,66,66,64,64,66,71,66,71,64,65,66,72,70,73,74,64,64,64,67,66,64,72,70,71,66,66,66,66,66,66,66,66,74,67,67,66,66,66,65,67,67,66,71,64,65,67,67,66,72,70,73,74,71,64,65,67,66,72,70,73,74,71,64,65,67,66,72,70,73,74,71,64,65,64,64,66,66,0,75,86,0,0,86,86,0,0,86,0,86,75,86,86,0,75,0,86,0,0,0,86,0,78,78,78,78,78,78,78,78,78,78,40,0,78,46,75,85,80,40,86,87,88,83,89,78,46,75,85,80,40,86,87,88,83,89,78,85,85,85,85,40,46,78,78,46,75,85,80,40,86,87,88,83,78,46,75,85,80,40,86,87,88,83,40,40,85,78,78,46,75,83,86,87,88,83,78,78,46,75,85,80,80,40,86,87,88,83,89,78,46,75,85,80,40,86,87,88,83,89,46,78,46,46,78,46,46,78,78,46,46,40,40,40,83,78,46,75,85,80,40,86,87,88,83,89,89,40,75,86,75,40,40,46,40,40,40,87,88,83,87,88,83,83,78,40,40,78,46,85,40,40,89,83,46,78,78,40,40,0,46,78,78,78,78,46,80,80,83,40,78,40,40,40,40,85,78,46,75,85,80,40,86,87,88,83,80,87,88,78,46,75,85,80,40,86,87,88,83,89,78,46,75,85,80,40,86,87,88,83,89,78,46,75,85,80,40,86,87,88,83,89,46,46,149,149,150,151,152,152,151,151,153,151,154,0,0,0,0,0,0,93,95,94,93,97,98,96,95,94,93,97,98,96,94,94,94,93,95,94,93,96,95,94,93,96,93,94,93,93,95,95,94,93,97,98,96,95,94,93,97,98,96,93,93,95,95,95,94,93,97,98,96,97,98,93,96,0,93,95,94,93,96,93,93,97,98,93,95,96,93,94,94,95,94,93,96,93,93,93,93,95,94,93,97,98,96,95,94,93,97,98,96,93,93,93,95,94,93,97,98,96,95,0,0,0,0,0,0,99,103,100,99,104,102,101,103,100,99,104,102,101,100,100,100,99,99,99,103,100,99,101,103,100,99,101,99,100,99,99,103,99,99,103,100,99,104,102,101,103,100,99,104,102,101,99,103,99,103,103,100,99,104,102,101,104,102,99,103,101,99,103,100,99,101,99,99,104,102,99,103,101,99,99,99,100,100,103,100,99,101,103,100,99,104,102,101,103,100,99,104,102,101,103,100,99,104,102,101,99,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,54,92,92,92,92,54,106,107,105,92,54,106,107,105,92,54,92,54,92,54,54,54,92,54,92,92,54,106,107,105,92,54,106,107,105,54,54,92,54,106,107,105,106,107,105,92,92,54,92,54,106,107,105,92,54,54,54,54,92,54,92,54,106,107,105,92,54,106,107,105,92,54,106,107,105,92,0,0,0,0,0,0,43,76,76,43,109,76,110,111,108,43,109,76,110,111,108,43,43,109,76,110,111,43,109,76,110,111,109,111,76,43,76,76,43,43,43,109,76,110,110,111,108,43,109,76,110,111,108,43,43,43,43,43,76,76,43,43,43,43,43,109,76,110,111,108,109,111,108,43,43,43,76,76,109,111,108,43,76,76,43,109,111,76,76,43,76,43,110,76,76,43,109,76,110,111,110,43,109,76,110,111,108,43,109,76,110,111,108,43,109,76,110,111,108,0,0,116,115,116,115,115,115,116,115,116,115,116,115,115,116,115,116,115,116,115,0,0,0,0,0,0,0,0,0,119,119,120,121,122,119,123,125,126,120,121,122,119,123,125,126,119,119,120,121,122,119,123,125,126,120,121,122,119,123,125,126,120,121,122,120,121,119,123,125,120,121,122,119,123,125,126,119,119,120,121,122,123,125,126,119,119,120,121,122,123,125,126,119,119,119,120,121,122,119,123,125,126,120,121,122,119,123,125,126,120,121,122,119,123,125,126,0,127,127,127,127,127,127,127,127,127,127,127,82,82,82,0,0,0,0,82,82,82,0,82,82,82,82,82,82,82,82,82,82,82,82,82,82,91,91,82,91,131,90,130,82,91,131,90,130,130,82,91,131,90,130,82,91,131,90,130,91,91,91,91,91,91,91,91,91,91,90,91,82,91,82,91,131,90,130,130,82,91,131,90,130,82,91,90,91,91,82,91,131,90,130,131,91,90,90,90,90,90,90,90,90,90,90,90,90,90,90,90,90,90,90,91,91,90,90,90,131,91,91,82,91,91,90,91,91,91,91,91,82,91,131,90,130,130,82,91,131,90,130,82,91,131,90,130,82,91,131,90,130,91,91,0,0,134,132,134,132,132,132,134,132,134,132,134,134,132,134,132,134,132,134,132,134,132,0,58,58,58,58,58,58,58,58,58,58,58,58,58,58,58,58,58,58,58,135,6,79,135,6,79,0,0,0,135,6,79,0,0,0,0,135,6,79,135,6,79,135,6,79,135,6,79,135,6,79,137,30,138,47,135,137,79,30,138,47,135,137,79,30,138,47,135,137,79,30,138,47,135,137,79,30,138,47,135,79,135,79,47,135,137,79,30,138,47,135,137,137,79,30,30,138,138,47,135,135,137,79,79,30,138,135,6,79,135,6,79,47,47,135,79,47,135,137,79,30,138,135,6,79,47,135,6,79,135,6,79,135,6,79,47,135,79,135,6,79,47,135,137,79,30,138,137,30,138,47,135,135,135,135,135,137,79,79,79,79,79,30,138,47,135,137,79,30,138,47,135,137,79,30,138,0,59,59,59,59,59,59,59,59,59,59,59,59,59,59,59,59,59,59,0,45,45,45,45,45,45,45,45,45,45,45,45,45,45,45,45,45,45,45,45,45,45,45,45,45,45,45,45,0,0,0,0,45,45,45,45,45,45,45,0,0,0,139,139,140,141,139,140,141,139,139,140,140,141,141,139,140,141,139,140,141,140,141,139,140,141,139,140,141,139,140,141],"f":"`````````````````````{{bd}b}{ce{}{}}00000000000000000000000{fh}{fj}{ll}{bb}{nn}{A`A`}{AbAb}{ff}{AdAd}{AfAf}{dd}{AhAh}{AjAj}{AlAl}{{ce}j{}{}}00000000000{{ll}An}{{nh}B`}{{fl}B`}{{}l}{{}Ah}`{{bB`}b}{bh}{Abh}`{{ll}B`}{{nn}B`}{{n{Bb{h}}}B`}{{A`A`}B`}{{AbAb}B`}{{ff}B`}{{dd}B`}{{AhAh}B`}{{AjAj}B`}{{AlAl}B`}{{lBd}Bf}{{bBd}Bf}{{nBd}Bf}{{A`Bd}Bf}{{AbBd}Bf}{{fBd}Bf}{{AdBd}Bf}0{{AfBd}Bf}{{dBd}Bf}{{AhBd}Bf}{{AjBd}Bf}0{{AlBd}Bf}{Bhl}{cc{}}{cb{Bj{Bn{{Bl{Bh}}}}}}1{{{Bb{h}}}n}2222222222{hAj}{bd}{bB`}{b{{Bb{h}}}}{bn}{{lc}jC`}{{nc}jC`}{{A`c}jC`}{{Abc}jC`}{b{{Bl{Bh}}}}9`{{fl}B`}{ce{}{}}000000000000{dB`}{{bh}B`};{nB`}{AbB`}{fB`}0{fAf}{AjAl}{nh}{Abh}{fh}`{{hh}A`}{{hc}Ab{{Cb{n}}}}{cb{Bj{Bn{{Bl{Bh}}}}}}{{lh}A`}{{lc}Ab{{Cb{n}}}}{hf}{AlAj}{Af{{Cd{l}}}}0`{{nh}n}{A`h}{{ll}{{Cd{An}}}}{A`l}{Abl}{d{{Cd{l}}}}{{Bhh}Aj}{{bc}b{{Cf{h}}}}{n{{Bb{h}}}}{Ab{{Bb{h}}}}{{bd}j}{{bB`}j}{{bh}j}{{bc}j{{Cf{h}}}}{{bc}j{{Cb{n}}}}2{Af{{Ch{h{Cd{h}}}}}}{{bc}b{{Cb{n}}}}{Abn}{bh}{Abh}`{ce{}{}}00000000000{cCj{}}0{h{{Cn{lCl}}}}{D`{{Cn{lCl}}}}{c{{Cn{e}}}{}{}}{Db{{Cn{lCl}}}}{Dd{{Cn{lCl}}}}22222222222{{fl}{{Cn{B`Ad}}}}333333333333{cDf{}}00000000000{dAj}````````````{Dhh}{{}{{Cn{DhDj}}}};;;;;;;;;;{{DlDn}{{Cn{DhDj}}}}{{DlE`}{{Cn{DhDj}}}}{{Dl{Bl{c}}}{{Cn{DhDj}}}{{Bn{Dn}}}}{{}Dl}{{EbB`}Eb}{{DhEdcEf}j{{Cb{b}}}}{EbEb}{DlDl}{DhDh}{EdEd}{DjDj}{{ce}j{}{}}0000{{}Eb}{{DlEb}Dl}{DhEd}{DhEf}3{{DhEdc}{{Cd{Ab}}}{{Cb{b}}}}{{EbBd}Bf}{{DlBd}Bf}{{DhBd}Bf}{{EdBd}Bf}{{DjBd}Bf}0{cc{}}0000{EbB`}{DhEb}{EbAh}{DhE`}{Eb{{Cd{h}}}}4{ce{}{}}0000{{DhEdc}B`{{Cb{b}}}}{{EbAh}Eb}{Dhh}{Edh}{{}{{Cn{DhDj}}}}{{}Eb}{{}Dl}{Dn{{Cn{DhDj}}}}{DhEd}{E`{{Cn{DhDj}}}}{{{Bl{c}}}{{Cn{DhDj}}}{{Bn{Dn}}}}8{{EdDh}j}{{DhEd}j}{{Eb{Cd{h}}}Eb}{Dj{{Cd{Eh}}}}{{EbB`}Eb}==={{DlEj}Dl}{{DlEl}Dl}{ce{}{}}0000{cCj{}}{c{{Cn{e}}}{}{}}000000000{{DhEdbEf}{{Cn{jAj}}}}{{DhEdb{Bl{{Cd{En}}}}}{{Cn{{Cd{l}}Aj}}}}{cDf{}}0000```````55555555{F`F`}{FbFb}{FdFd}{FfFf}{{ce}j{}{}}000{{FfFf}An}{{}Ff}`{{FfFf}B`}{{F`Bd}Bf}0{{FbBd}Bf}0{{FdBd}Bf}0{{FfBd}Bf}{cc{}}000{{Ffc}jC`}{ce{}{}}000{FfB`}00000{{FfFf}{{Cd{An}}}}`{F`{{Cd{Eh}}}}{Fb{{Cd{Eh}}}}4444{cCj{}}00{c{{Cn{e}}}{}{}}0000000{cDf{}}000````````{{}{{Cn{FhF`}}}}8888888888{{FjDn}{{Cn{FhF`}}}}{{FjE`}{{Cn{FhF`}}}}{{Fj{Bl{c}}}{{Cn{FhF`}}}{{Bn{Dn}}}}{{}Fj}{FhFl}{{FnB`}Fn}{{Fnh}Fn}{G`h}{FhFh}{G`G`}{FnFn}{FjFj}{GbGb}{{ce}j{}{}}0000{{}Fn}{{FjFn}Fj}{FhG`}2{{GbGb}B`}{{FhBd}Bf}{{G`Bd}Bf}{{FnBd}Bf}{{FjBd}Bf}{{GbBd}Bf}{cc{}}0000{FnB`}{Fnh}{FhFn}{Gb{{Cd{A`}}}}{FnAh}{Fn{{Cd{h}}}}{{FnE`}{{Cn{hF`}}}}1{FhE`}{Fn{{Cd{Gd}}}}{{FnBh}B`}9999{ce{}{}}0000{{FnAh}Fn}{{FhG`Ff}h}{{FhG`Ffh}l}{Fhh}{G`h}{{Fn{Cd{h}}}Fn}0{{}{{Cn{FhF`}}}}{Dn{{Cn{FhF`}}}}{FhG`}{{}Fn}{{}Fj}{{{Bl{c}}}{{Cn{FhF`}}}{{Bn{Dn}}}}{{FhG`Ff}{{Cn{FfFd}}}}{{FhG`FfBh}{{Cn{FfFd}}}}{{FhG`FfBh}Ff}0;{{Fn{Cd{Gd}}}Fn}{{FnBhB`}Fn}{{G`Fh}j}{{FhG`}j}{{G`h}j}0?0{{FnB`}Fn}0{{}Gb}{{FhG`Gf}{{Cn{FfFb}}}}{{FhG`b}{{Cn{FfAj}}}}03{{FjEj}Fj}{{FjEl}Fj}{ce{}{}}0000{c{{Cn{e}}}{}{}}000000000{{FhG`b}{{Cn{{Cd{A`}}Aj}}}}{{FhG`bGb}{{Cn{jAj}}}}01{{FhG`bf}{{Cn{jAj}}}}{cDf{}}0000;````{Gh{{Ch{G`G`}}}}066666666{{GjDn}{{Cn{GlF`}}}}{{GjFhFh}Gl}{{Gj{Bl{c}}}{{Cn{GlF`}}}{{Bn{Dn}}}}{{}Gj}{GhGh}{GjGj}{{ce}j{}{}}0{GlGh}4{{GjFn}Gj}{{GlGhc}{{Cd{Ab}}}{{Cb{b}}}}{{GlGhc}Gn{{Cb{b}}}}{{GlBd}Bf}{{GnBd}Bf}{{GhBd}Bf}{{GjBd}Bf}{GlFh}{GhG`}0{cc{}}000{ce{}{}}0000{{GlGhc}B`{{Cb{b}}}}{Ghh}{Dn{{Cn{GlF`}}}}>{{}Gj}{{{Bl{c}}}{{Cn{GlF`}}}{{Bn{Dn}}}}{Gn{{Cd{Ab}}}}{Glh}{{GhGl}j}{{GlGh}j}<;;{{GjEj}Gj}{{GjEl}Gj};;{c{{Cn{e}}}{}{}}0000000{{GlGhb}{{Cn{{Cd{Ab}}Aj}}}}{cDf{}}000`````````{{H`B`}H`}0??????????????????{{HbDn}{{Cn{HdHf}}}}{{HbHh}{{Cn{HdHf}}}}{{Hb{Bl{c}}}{{Cn{HdHf}}}{{Bn{Dn}}}}{{Hb{Bl{c}}}{{Cn{HdHf}}}{{Hj{Hh}}}}{{}Hb}5{{HdcEf}j{{Cb{b}}}}{{Hdc}Hl{{Cb{b}}}}{Hdh}{HfHf}{HdHd}{HnHn}{H`H`}{HbHb}{{ce}j{}{}}0000{{}H`}{{HbH`}Hb}{I`h}{Hlh}{HdHn}{HdEf}5{{H`B`}H`}{{H`{Cd{h}}}H`}0{{Hdc}{{Cd{Ab}}}{{Cb{b}}}}{{Hdc}I`{{Cb{b}}}}{{HfBd}Bf}0{{HdBd}Bf}{{I`Bd}Bf}{{HlBd}Bf}{{IbBd}Bf}{{IdBd}Bf}{{HnBd}Bf}{{H`Bd}Bf}{{HbBd}Bf}{cc{}}00000000{H`B`}00{HdH`}1{H`{{Cd{h}}}}02{H`h}{H`Bh}{H`Ah}353{H`{{Cd{Gd}}}}6{H`If}{HdIh}{{H`B`}H`}{{H`h}H`}{I`b}{Hlb}{Ibb}{Idb}{ce{}{}}000000000000{HdB`}{{Hdc}B`{{Cb{b}}}}{{H`Bh}H`}{{H`Ah}H`}{Hdh}{Hnh}{Dn{{Cn{HdHf}}}}{HdHn}{{}H`}{{}Hb}{{{Bl{c}}}{{Cn{HdHf}}}{{Bn{Dn}}}}{I`{{Cd{Ab}}}}{Hl{{Cd{Ef}}}}{Ib{{Cd{n}}}}{Id{{Cd{n}}}}{{H`{Cd{h}}}H`}{{H`B`}H`}1{Hf{{Cd{l}}}}={{H`{Cd{Gd}}}H`}{I`Hd}{HlHd}{{HnHd}j}{{Hdb}{{Cd{Ab}}}}{{HdbEf}j}{{HdHnbEf}j}{{Hdb}{{Cd{A`}}}}{{HdHnb}{{Cd{A`}}}}{{Hdb{Bl{{Cd{En}}}}}{{Cd{l}}}}{{HdHnb{Bl{{Cd{En}}}}}{{Cd{l}}}}{{HdHnb}{{Cd{Ab}}}}{Id{{Ch{h{Cd{h}}}}}}{Hf{{Cd{h}}}}{Hf{{Cd{Eh}}}}{{Hdc}Ib{{Cb{b}}}}{{Hdch}Id{{Cb{b}}}}{Hd{{Cd{h}}}}{{HbEj}Hb}{Hf{{Cd{Ij}}}}{ce{}{}}0000{cCj{}}{c{{Cn{e}}}{}{}}00000000000000000{cDf{}}00000000{{H`B`}H`}{{H`If}H`}{{Hdbf}j}{{HdHnbf}j}````````````````````````{{IlInD`}{{Cn{InJ`}}}}{{IlInD`{Cd{{Jb{Dn}}}}}{{Cn{InJ`}}}}{Il{{Cn{InJ`}}}}0{{IlInJd}{{Cn{InJ`}}}}1{{IlJf}{{Cn{InJ`}}}}{{Il{Jh{Jf}}}{{Cn{InJ`}}}}{{Il{Jh{In}}}{{Cn{InJ`}}}}0{{}E`}`??????????????????????{{IlInIn}{{Cn{E`J`}}}}{{JjDn}{{Cn{E`J`}}}}{{JjHh}{{Cn{E`J`}}}}{{Jj{Bl{c}}}{{Cn{E`J`}}}{{Bn{Dn}}}}{{Jj{Bl{c}}}{{Cn{E`J`}}}{{Hj{Hh}}}}{E`Fl}{{ElB`}El}{Ilj}{IlIl}{ElEl}{IfIf}{JjJj}{J`J`}{E`E`}{JlJl}{JnJn}{K`K`}{JfJf}{{ce}j{}{}}000000000{{}Jj}{{}El}{{JjEl}Jj}{Ill}{{}Il}3{{}If}`{{JlJl}B`}{{JnJn}B`}{{K`K`}B`}{{JfJf}B`}{{IlIn}{{Cn{lJ`}}}}{{IlBd}Bf}{{ElBd}Bf}{{IfBd}Bf}{{JjBd}Bf}{{J`Bd}Bf}0{{E`Bd}Bf}{{JlBd}Bf}{{JnBd}Bf}{{K`Bd}Bf}{{JfBd}Bf}{{KbBd}Bf}{cc{}}0000000000{ElB`}{IlKd}{ElKd}{El{{Cd{h}}}}{IlB`}44{Il{{Cd{h}}}}15{ElIf}{E`Ih}{E`B`}0{{Jfc}jC`}{ce{}{}}000000000002{IfB`}{JlB`}144{{ElKd}El}{E`Kd}{E`Kf}0{{Jn{Bl{Bh}}h}{{Cd{In}}}}{{K`{Bl{Bh}}h}{{Cd{In}}}}{{Jf{Bl{Bh}}h}B`}{{JnBh}{{Cd{In}}}}{{K`Bh}{{Cd{In}}}}{{JfBh}B`}{{JfKh}B`}{Ilh}{E`h}{{}E`}{{}Il}{{}El}{{}Jj}{Dn{{Cn{E`J`}}}}{{{Bl{c}}}{{Cn{E`J`}}}{{Bn{Dn}}}}{Kb{{Cd{l}}}}`{{El{Cd{h}}}El}{{IlInIn}{{Cn{jJ`}}}}:9{E`Kb}`{{ElB`}El}{{IlKd}j}{{IlB`}j}{{Il{Cd{h}}}{{Cn{jJ`}}}}13{J`{{Cd{h}}}}{J`{{Cd{Eh}}}}`{E`In}{Il{{Cn{lJ`}}}}{{E`l}{{Cd{In}}}}2{{E`In}Jl}{E`{{Bl{Jl}}}}{{JjEj}Jj}{ce{}{}}000000000{cCj{}}``{c{{Cn{e}}}{}{}}000000000000000000000{cDf{}}0000000000?{{ElIf}El}`````````````````{{}{{Cn{KjJ`}}}}555555555555{{KlDn}{{Cn{KjJ`}}}}{{KlE`}{{Cn{KjJ`}}}}{{Kl{Bl{c}}}{{Cn{KjJ`}}}{{Bn{Dn}}}}{{}Kl}{KnKn}{KlKl}{KjKj}{L`L`}{{ce}j{}{}}000{{}Kn}{{KlKn}Kl}{KjL`}{KjEf}3{{KnBd}Bf}{{KlBd}Bf}{{KjBd}Bf}{{LbBd}Bf}{{LdBd}Bf}{{L`Bd}Bf}{cc{}}00000{KjKn}{KjE`}{Kn{{Cd{Gd}}}}{Knh}{ce{}{}}0000000{Kjh}{L`h}{{E`b}h}{{}{{Cn{KjJ`}}}}{{}Kn}{{}Kl}{Dn{{Cn{KjJ`}}}}{KjL`}{E`{{Cn{KjJ`}}}}{{{Bl{c}}}{{Cn{KjJ`}}}{{Bn{Dn}}}}{Lb{{Cd{{Cn{AbAj}}}}}}{Ld{{Cd{{Cn{EfAj}}}}}};{{Kn{Cd{Gd}}}Kn}{{L`Kj}j}{{KjL`}j}{{KlEj}Kl}{{KlEl}Kl}{ce{}{}}000{{KjL`cEf}{{Cn{jAj}}}{{Cb{b}}}}{{KjL`c}Ld{{Cb{b}}}}{{KjL`c}{{Cn{{Cd{Ab}}Aj}}}{{Cb{b}}}}{{KjL`c}Lb{{Cb{b}}}}{c{{Cn{e}}}{}{}}00000000000{{KjL`c}{{Cn{B`Aj}}}{{Cb{b}}}}{{KjL`bEf}{{Cn{jAj}}}}{{KjL`b{Bl{{Cd{En}}}}}{{Cn{{Cd{l}}Aj}}}}{cDf{}}00000{{Knh}Kn}``````{{}{{Cn{LfJ`}}}};;;;;;;;;;;;{{LhDn}{{Cn{LfJ`}}}}{{LhE`}{{Cn{LfJ`}}}}{{Lh{Bl{c}}}{{Cn{LfJ`}}}{{Bn{Dn}}}}{{}Lh}{{LfLjcEf}j{{Cb{b}}}}{{LfLjc}Ll{{Cb{b}}}}{LnLn}{LhLh}{LfLf}{LjLj}{{ce}j{}{}}000{{}Ln}{{LhLn}Lh}{LfLj}{LfEf}3{{LfLjc}{{Cd{Ab}}}{{Cb{b}}}}{{LfLjc}M`{{Cb{b}}}}{{LnBd}Bf}{{LhBd}Bf}{{LfBd}Bf}{{M`Bd}Bf}{{LlBd}Bf}{{LjBd}Bf}{cc{}}00000{LfLn}{LnAh}{LfE`}{Ln{{Cd{Gd}}}}{ce{}{}}0000000{{LfLjc}B`{{Cb{b}}}}{{LnAh}Ln}{Ljh}{{}{{Cn{LfJ`}}}}{{}Ln}{{}Lh}{Dn{{Cn{LfJ`}}}}{LfLj}{E`{{Cn{LfJ`}}}}{{{Bl{c}}}{{Cn{LfJ`}}}{{Bn{Dn}}}}{M`{{Cd{Ab}}}}{Ll{{Cd{Ef}}}}{Lfh}{{Ln{Cd{Gd}}}Ln}{{LjLf}j}{{LfLj}j}{{LfLjbEf}j}{{LfLjb{Bl{{Cd{En}}}}}{{Cd{l}}}}{{LhEj}Lh}{{LhEl}Lh}{ce{}{}}000{c{{Cn{e}}}{}{}}00000000000{cDf{}}00000{{LfLjbf}j}``````````````````{Flh}{Kh{{Cd{Dd}}}}{Kh{{Cd{Bh}}}}{Khh}7777777777{KhKh}{FlFl}{{ce}j{}{}}0{{KhKh}An}{{}Fl}{{FlKh}Mb}1{hKh}{FlKh}{{KhKh}B`}{{KhBd}Bf}{{FlBd}Bf}{{MdBd}Bf}{{MfBd}Bf}{{MbBd}Bf}{cc{}}0000{{FlBh}Bh}{{FlKh}h}{ce{}{}}0000000{{KhBh}B`}{KhB`}{FlB`}1{FlMd}{Md{{Cd{Kh}}}}{Mf{{Cd{Kh}}}}{Mb{{Cd{Kh}}}}{{KhKh}{{Cd{An}}}}{{Flc}Mf{{Cf{Bh}}}}{{FlBhBh}j}{{}Fl}{Flh}<<{c{{Cn{e}}}{}{}}000000000{cDf{}}0000{BhKh}``````{IhEf}{Ihh}{IhMh}{ce{}{}}00000000000{Efj}{EfEf}{MjMj}{IhIh}{MlMl}{MnMn}{{ce}j{}{}}0000{Mjh}{Mnh}{{}Ih}=0<{{EfDn}{{Ch{Dn{N`{Dn}}}}}}{{Ef{Bl{Bh}}}{{Ch{{Bl{Bh}}{N`{{Bl{Bh}}}}}}}}{{EfBd}Bf}{{MjBd}Bf}{{IhBd}Bf}{{MlBd}Bf}0{{MnBd}Bf}{{MhBd}Bf}{cc{}}00000{{Efh}{{Cd{n}}}}{{EfDn}{{Cd{n}}}}{Ef{{Cd{Ab}}}}{EfIh}{Efh}{{Ihl}h}{Ihh}{{Ef{Bl{Bh}}{Bl{Bh}}}{{Jh{Bh}}}}{{Ef{Bl{Bh}}{Bl{Bh}}{Jh{Bh}}}j}{{EfDnDn}Cj}{{EfDnDnCj}j}{ce{}{}}00000000{EfB`}{EfMj}{IhEf}8{g{{Cn{IhMl}}}{{Bn{Dn}}}{{Nd{}{{Nb{{Cd{c}}}}}}}{{Nd{}{{Nb{e}}}}}}{Mj{{Cd{{Cd{n}}}}}}{Mn{{Cd{{Cd{Dn}}}}}}{Mh{{Cd{{Ch{lh{Cd{Dn}}}}}}}}{Ef{{Cd{l}}}}={{Ihl}Mn}{{Ef{Cd{l}}}j}{Mj{{Ch{h{Cd{h}}}}}}{Mn{{Ch{h{Cd{h}}}}}}{{Ihlh}{{Cd{h}}}}{Ihh}{Ef{{Bl{{Cd{En}}}}}}{{Ihlh}{{Cd{{Ch{hh}}}}}}1{Ml{{Cd{Eh}}}}{{IhlDn}{{Cd{h}}}}{{Ihlh}{{Cd{Dn}}}}{ce{}{}}0000{cCj{}}{c{{Cn{e}}}{}{}}00000000000{cDf{}}00000``3333{NfNf}{{ce}j{}{}}{{NhBd}Bf}{{NfBd}Bf}{cc{}}0888666655{{{Bl{Bh}}ce{Jh{Bh}}}j{{Nj{h{Jh{Bh}}}}}{{Nj{Dn}{{Nl{{Cd{h}}}}}}}}{{DnceCj}j{{Nj{hCj}}}{{Nj{Dn}{{Nl{{Cd{h}}}}}}}}```````{{Nnc}{{Cd{Ab}}}{{Nj{b}{{Nl{{Cn{{Cd{Ab}}Aj}}}}}}}}{{Nnc}{{Cd{A`}}}{{Nj{b}{{Nl{{Cn{{Cd{A`}}Aj}}}}}}}}<<<<<<<<<<<<<<{NnNn}8{{{O`{c}}Bd}Bf{}}{{{Ob{c}}Bd}Bf{}}{{{Od{c}}Bd}Bf{}}{{NnBd}Bf}{{{Of{c}}Bd}BfOh}{{{Oj{c}}Bd}BfOh}{{{Ol{c}}Bd}BfOh}<<<<<<<{{{O`{c}}}{{Of{c}}}{}}{{{Ob{c}}}{{Oj{c}}}{}}{{{Od{c}}}{{Ol{c}}}{}}{{{O`{c}}}b{}}{{{Ob{c}}}b{}}{Nnb}{{{Of{c}}}b{}}{{{Oj{c}}}b{}}{ce{}{}}000000{{NnEfc}{{Od{c}}}{{Nj{bEf}{{Nl{{Cn{jAj}}}}}}}}{{Nnc}{{O`{c}}}{{Nj{b}{{Nl{{Cn{{Cd{A`}}Aj}}}}}}}}222222{{Nnc}{{Ob{c}}}{{Nj{b}{{Nl{{Cn{{Cd{Ab}}Aj}}}}}}}}{bNn}{{{O`{c}}}{{Cd{{Cn{A`Aj}}}}}{{Nj{b}{{Nl{{Cn{{Cd{A`}}Aj}}}}}}}}{{{Ob{c}}}{{Cd{{Cn{AbAj}}}}}{{Nj{b}{{Nl{{Cn{{Cd{Ab}}Aj}}}}}}}}{{{Od{c}}}{{Cd{{Cn{EfAj}}}}}{{Nj{bEf}{{Nl{{Cn{jAj}}}}}}}}{{{Of{c}}}{{Cd{A`}}}{{Nj{b}{{Nl{{Cn{{Cd{A`}}Aj}}}}}}}}{{{Oj{c}}}{{Cd{Ab}}}{{Nj{b}{{Nl{{Cn{{Cd{Ab}}Aj}}}}}}}}{{{Ol{c}}}{{Cd{Ef}}}{{Nj{bEf}{{Nl{{Cn{jAj}}}}}}}}:{{Nnc}{{Cn{{Cd{Ab}}Aj}}}{{Nj{b}{{Nl{{Cn{{Cd{Ab}}Aj}}}}}}}}{{Nnc}{{Cn{{Cd{A`}}Aj}}}{{Nj{b}{{Nl{{Cn{{Cd{A`}}Aj}}}}}}}}{c{{Cn{e}}}{}{}}0000000000000{cDf{}}000000`>>{{{On{ce}}}c{}{{A`{}{{Nl{c}}}}}}{{{On{ce}}Bd}BfOh{{A`{}{{Nl{c}}}}}}{cc{}}2{ce{}{}}{c{{On{ec}}}{}{}}665```````````````````````{JdAb}{JdD`}{Kf{{Cn{jAd}}}}`4444444444{{}{{Cn{jAd}}}}{JdJd}{KfKf}{AfAf}{KdKd}{AdAd}{{ce}j{}{}}0000{{KfJd}B`}{KfB`}0000000{{}Kf}{{}Kd}1{{JdJd}B`}{{KfKf}B`}{{JdBd}Bf}{{KfBd}Bf}{{AfBd}Bf}{{KdBd}Bf}{{AdBd}Bf}0{cc{}}0000{D`{{Cd{Jd}}}}:{KdBh}{{KfJd}Kf}{{KfKf}Kf}{ce{}{}}00000?{{Kd{Bl{Bh}}h}B`}000000000{{Kd{Bl{Bh}}h}{{Cn{B`Ad}}}}0110000{KfAf}{Kfh}{{KdJd{Bl{Bh}}h}B`}{{KdKf{Bl{Bh}}h}B`}{{}Kd}{Af{{Cd{Jd}}}}{{{Bl{Bh}}}Kf};{JdJd}{{KfJd}j}{{KfKf}j}{{KdBh}Kd}211{JdKf}?>>>>>{cCj{}}{c{{Cn{e}}}{}{}}000000000{cDf{}}0000{{KfKf}Kf}{{Kf{Bl{Bh}}}j}``{ce{}{}}000{{{Ah{ce}}}cAj{{A`{}{{Nl{c}}}}}}0{{{Al{ce}}Bd}BfOh{}}{{{Ah{ce}}Bd}Bf{AjOh}{{A`{}{{Nl{c}}}}}}{cc{}}0{{{Al{ce}}}{{Ah{ce}}}Aj{{A`{}{{Nl{c}}}}}}55{c{{Al{ec}}}{}{}}{{{Ah{ce}}}jAj{{A`{}{{Nl{c}}}}}};;;;::`77{GdGd}{{ce}j{}{}}{{Gd{Bl{Bh}}n}{{Cd{n}}}}{{GdBd}Bf}7{{AhHh}{{Cd{Gd}}}}{{Ah{Bl{c}}}{{Cd{Gd}}}{{Hj{Hh}}}}={GdB`}{Gdh}0{{Ah{Bl{c}}}{{Cd{Gd}}}{{Bn{{Bl{Bh}}}}}}6{ce{}{}}{c{{Cn{e}}}{}{}}0{cDf{}}```````````````````{AnAA`}{lAA`}{InAA`}{AnD`}{lD`}{InD`}{AnDb}{lDb}{InDb}{Anh}{lh}{Inh}{AAbDb}{ClDb}{AAdDb}{ce{}{}}00000000000{EnEn}{AnAn}{AAbAAb}{InIn}{ClCl}{AAdAAd}{{ce}j{}{}}00000{{EnEn}An}{{AnAn}An}{{InIn}An}{{}An}{{}In}{{EnEn}B`}{{AnAn}B`}{{AAbAAb}B`}{{InIn}B`}{{ClCl}B`}{{AAdAAd}B`}{{EnBd}Bf}{{AnBd}Bf}{{AAbBd}Bf}0{{InBd}Bf}{{ClBd}Bf}0{{AAdBd}Bf}0{cc{}}{BhAn}11{BhIn}222{{{N`{Bh}}}{{Cn{AnAAb}}}}{{{N`{Bh}}}{{Cn{lCl}}}}{{{N`{Bh}}}{{Cn{InAAd}}}}{{{N`{Bh}}}An}{{{N`{Bh}}}l}{{{N`{Bh}}}In}{Enh}{{Enc}jC`}{{Anc}jC`}{{Inc}jC`}{ce{}{}}00000{hAn}{hl}{hIn}{h{{Cd{En}}}}{h{{Cn{AnAAb}}}}{h{{Cn{lCl}}}}{h{{Cn{InAAd}}}}654{Anh}{lh}{Inh}{{EnEn}{{Cd{An}}}}{{AnAn}{{Cd{An}}}}{{InIn}{{Cd{An}}}}{An{{N`{Bh}}}}{l{{N`{Bh}}}}{In{{N`{Bh}}}}{ce{}{}}00000{cCj{}}00{c{{Cn{e}}}{}{}}0{D`{{Cn{AnAAb}}}}{Dd{{Cn{AnAAb}}}}{h{{Cn{AnAAb}}}}{Db{{Cn{AnAAb}}}}4{D`{{Cn{InAAd}}}}{h{{Cn{InAAd}}}}6{Db{{Cn{InAAd}}}}{Dd{{Cn{InAAd}}}}88888888{cDf{}}00000`{{Gfd}Gf}<<{GfGf}{{ce}j{}{}}{{GfBd}Bf}{cc{}}{bGf}0{Gfd}{Gf{{Cd{Bh}}}}{ce{}{}}{{Gf{Cd{Bh}}}Gf}{{}Gf}2{c{{Cn{e}}}{}{}}0<`33{{EjB`}Ej}{EjEj};1{{}Ej}2{{EjBd}Bf};{EjB`}000{EjBh}1{EjD`}22226:{{EjBh}Ej}7{{EjD`}Ej}68{Dn{{Cn{HhIj}}}}{{{Bl{c}}}{{Cn{{Jh{Hh}}Ij}}}{{Bn{Dn}}}}{{{Bl{c}}Ej}{{Cn{{Jh{Hh}}Ij}}}{{Bn{Dn}}}}{{DnEj}{{Cn{HhIj}}}}<{ce{}{}}>>{cDf{}}>>````111111`{{{AAf{ce}}Bd}Bf{OhBj}Oh}{{AAhBd}Bf}0{{AAjBd}Bf}0{cc{}}00555{cCj{}}0{c{{Cn{e}}}{}{}}00000666","c":[896,954],"p":[[5,"Input",0],[6,"Anchored",0],[5,"PatternSet",0],[1,"usize"],[1,"unit"],[5,"PatternID",0],[5,"Span",0],[5,"HalfMatch",0],[5,"Match",0],[5,"PatternSetInsertError",0],[5,"PatternSetIter",0],[6,"MatchKind",0],[5,"MatchError",0],[6,"MatchErrorKind",0],[6,"Ordering",2080],[1,"bool"],[5,"Range",2081],[5,"Formatter",2082],[8,"Result",2082],[1,"u8"],[10,"Sized",2083],[1,"slice"],[10,"AsRef",2084],[10,"Hasher",2085],[10,"Into",2084],[6,"Option",2086],[10,"RangeBounds",2081],[1,"tuple"],[5,"String",2087],[5,"PatternIDError",1832],[6,"Result",2088],[1,"u32"],[1,"u64"],[1,"u16"],[5,"TypeId",2089],[5,"DFA",255],[5,"BuildError",255],[5,"Builder",255],[1,"str"],[5,"NFA",833],[5,"Config",255],[5,"Cache",255],[5,"Captures",1398],[10,"Error",2090],[5,"Config",2007],[5,"Config",833],[5,"NonMaxUsize",1832],[5,"BuildError",361],[6,"StartError",361],[5,"CacheError",361],[5,"LazyStateID",361],[5,"DFA",436],[5,"Builder",436],[5,"ByteClasses",1317],[5,"Config",436],[5,"Cache",436],[5,"OverlappingState",436],[5,"Prefilter",1812],[5,"Config",1988],[5,"Cache",566],[5,"Builder",566],[5,"Regex",566],[5,"FindMatches",566],[5,"Config",639],[5,"Builder",639],[5,"Regex",639],[5,"BuildError",639],[5,"Hir",2091],[10,"Borrow",2092],[5,"CapturesMatches",639],[5,"Cache",639],[5,"FindMatches",639],[5,"Split",639],[5,"SplitN",639],[6,"WhichCaptures",833],[5,"GroupInfo",1398],[6,"Error",2093],[5,"Builder",833],[5,"StateID",1832],[5,"BuildError",833],[5,"Arc",2094],[6,"Look",1646],[5,"Transition",833],[5,"Vec",2095],[5,"Compiler",833],[6,"State",833],[5,"SparseTransitions",833],[5,"DenseTransitions",833],[5,"PatternIter",833],[5,"LookMatcher",1646],[5,"LookSet",1646],[5,"Unit",1317],[5,"BoundedBacktracker",1089],[5,"Builder",1089],[5,"Config",1089],[5,"Cache",1089],[5,"TryFindMatches",1089],[5,"TryCapturesMatches",1089],[5,"PikeVM",1197],[5,"Builder",1197],[5,"Cache",1197],[5,"CapturesMatches",1197],[5,"Config",1197],[5,"FindMatches",1197],[5,"ByteClassElements",1317],[5,"ByteClassIter",1317],[5,"ByteClassRepresentatives",1317],[5,"GroupInfoAllNames",1398],[5,"CapturesPatternIter",1398],[5,"GroupInfoError",1398],[5,"GroupInfoPatternNames",1398],[1,"array"],[17,"Item"],[10,"IntoIterator",2096],[5,"DebugByte",1517],[5,"DebugHaystack",1517],[10,"FnMut",2097],[17,"Output"],[5,"Searcher",1540],[5,"TryHalfMatchesIter",1540],[5,"TryMatchesIter",1540],[5,"TryCapturesIter",1540],[5,"HalfMatchesIter",1540],[10,"Debug",2082],[5,"MatchesIter",1540],[5,"CapturesIter",1540],[5,"Lazy",1634],[10,"Fn",2097],[1,"char"],[5,"UnicodeWordBoundaryError",1646],[5,"LookSetIter",1646],[5,"PoolGuard",1789],[10,"Send",2083],[5,"Pool",1789],[5,"SmallIndex",1832],[1,"i32"],[5,"SmallIndexError",1832],[5,"StateIDError",1832],[5,"AlignAs",2047],[5,"SerializeError",2047],[5,"DeserializeError",2047],[15,"Quit",249],[15,"HaystackTooLong",249],[15,"UnsupportedAnchored",249],[15,"GaveUp",249],[15,"Quit",433],[15,"Cache",433],[15,"UnsupportedAnchored",433],[15,"BinaryUnion",1078],[15,"Union",1078],[15,"Capture",1078],[15,"Look",1078],[15,"Match",1078],[15,"ByteRange",1078]],"b":[[83,"impl-PartialEq-for-Span"],[84,"impl-PartialEq%3CRange%3Cusize%3E%3E-for-Span"],[98,"impl-Debug-for-PatternSetInsertError"],[99,"impl-Display-for-PatternSetInsertError"],[103,"impl-Debug-for-MatchError"],[104,"impl-Display-for-MatchError"],[206,"impl-TryFrom%3Cusize%3E-for-PatternID"],[207,"impl-TryFrom%3Cu32%3E-for-PatternID"],[209,"impl-TryFrom%3Cu64%3E-for-PatternID"],[210,"impl-TryFrom%3Cu16%3E-for-PatternID"],[298,"impl-Debug-for-BuildError"],[299,"impl-Display-for-BuildError"],[388,"impl-Debug-for-BuildError"],[389,"impl-Display-for-BuildError"],[390,"impl-Debug-for-StartError"],[391,"impl-Display-for-StartError"],[392,"impl-Display-for-CacheError"],[393,"impl-Debug-for-CacheError"],[699,"impl-Debug-for-BuildError"],[700,"impl-Display-for-BuildError"],[935,"impl-Display-for-BuildError"],[936,"impl-Debug-for-BuildError"],[1441,"impl-Display-for-GroupInfoError"],[1442,"impl-Debug-for-GroupInfoError"],[1712,"impl-Display-for-UnicodeWordBoundaryError"],[1713,"impl-Debug-for-UnicodeWordBoundaryError"],[1903,"impl-Debug-for-SmallIndexError"],[1904,"impl-Display-for-SmallIndexError"],[1906,"impl-Debug-for-PatternIDError"],[1907,"impl-Display-for-PatternIDError"],[1908,"impl-Debug-for-StateIDError"],[1909,"impl-Display-for-StateIDError"],[1964,"impl-TryFrom%3Cu32%3E-for-SmallIndex"],[1965,"impl-TryFrom%3Cu16%3E-for-SmallIndex"],[1966,"impl-TryFrom%3Cusize%3E-for-SmallIndex"],[1967,"impl-TryFrom%3Cu64%3E-for-SmallIndex"],[1969,"impl-TryFrom%3Cu32%3E-for-StateID"],[1970,"impl-TryFrom%3Cusize%3E-for-StateID"],[1972,"impl-TryFrom%3Cu64%3E-for-StateID"],[1973,"impl-TryFrom%3Cu16%3E-for-StateID"],[2059,"impl-Display-for-SerializeError"],[2060,"impl-Debug-for-SerializeError"],[2061,"impl-Debug-for-DeserializeError"],[2062,"impl-Display-for-DeserializeError"]]}],\ +["regex_syntax",{"doc":"This crate provides a robust regular expression parser.","t":"GPFFPFCNNNNNNNNNNNNNNNNNNNNHHNNNNNNNNNNNNCNNNNNHHHHNNNNNNHNNNNNNNNNNNNNNNHNNNNNCNPPFPPPFPGGPPPPPPPPPFPPPFGFPPFPGPPGFGGFFPFPGGPPFFPPPPPPPPPPPPPRFGPPPPPPGPPPPPPFPFGPPFPGPPPPPPPPGPPPPFPPGPPPPPPPPPPPPPRPFPPPPFPPPPGPFGFPPPFPGPPPPPPPPPPPPPPPPPPPPKFPPPPPPPPPPPPPNNNOOOOONNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNONNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNOOONNNNNNOONNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNMNNNONNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNONONNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNOONOOOOOOOOOOOONOOOOONNOOCNNNCNNONNNNOOOOOOOOOOOOOOOOOOONNNOONNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNHNNNNNNNNNNNNNNNNNNNNOOOOOOOOFFNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNFNNNNNNNNNNPPPPPPPPPPFPFGPFFFFFFPGPPPPRFGFGPPFPGPFFRFFPPPPPPPPPPKPPPPPPPPPPPPNNNONNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNMNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNOONNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNCNNNNNNNNNNONNNNNONNNNONNNNNNNNNNNNNCNNNNNNNNNNNNNNNNNNNNNOONNNNNNNNNNNNNNNNNNNNNNNNNNNCNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNHNNNNNNNNNNGFFPFPNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNHNNNNNNNNNNNNNNNNNNNNNNFNNNNNNNNNNFFNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNPPPPFGFNNNNNNNNNNNNNONNNNNNNNNNNNNNNNNNNNNONNNNNNNNNNN","n":["Error","Parse","Parser","ParserBuilder","Translate","UnicodeWordError","ast","borrow","borrow","borrow","borrow","borrow_mut","borrow_mut","borrow_mut","borrow_mut","build","case_insensitive","clone","clone","clone","clone_into","clone_into","clone_into","crlf","default","dot_matches_new_line","eq","escape","escape_into","fmt","fmt","fmt","fmt","fmt","fmt","from","from","from","from","from","from","hir","ignore_whitespace","into","into","into","into","is_escapeable_character","is_meta_character","is_word_byte","is_word_character","line_terminator","multi_line","nest_limit","new","new","octal","parse","parse","swap_greed","to_owned","to_owned","to_owned","to_string","to_string","try_from","try_from","try_from","try_from","try_into","try_into","try_into","try_into","try_is_word_character","type_id","type_id","type_id","type_id","unicode","utf8","utf8","Alnum","Alpha","Alternation","Alternation","Ascii","Ascii","Assertion","Assertion","AssertionKind","Ast","AtLeast","Bell","BinaryOp","Blank","Bounded","Bracketed","CRLF","CaptureIndex","CaptureLimitExceeded","CaptureName","CaptureName","CarriageReturn","CaseInsensitive","ClassAscii","ClassAsciiKind","ClassBracketed","ClassBracketed","ClassEscapeInvalid","ClassPerl","ClassPerl","ClassPerlKind","ClassRangeInvalid","ClassRangeLiteral","ClassSet","ClassSetBinaryOp","ClassSetBinaryOpKind","ClassSetItem","ClassSetRange","ClassSetUnion","ClassUnclosed","ClassUnicode","ClassUnicode","ClassUnicodeKind","ClassUnicodeOpKind","Cntrl","Colon","Comment","Concat","Concat","DecimalEmpty","DecimalInvalid","Difference","Digit","Digit","Dot","DotMatchesNewLine","Empty","Empty","EndLine","EndText","Equal","Err","Error","ErrorKind","EscapeHexEmpty","EscapeHexInvalid","EscapeHexInvalidDigit","EscapeUnexpectedEof","EscapeUnrecognized","Exactly","Flag","Flag","FlagDanglingNegation","FlagDuplicate","FlagRepeatedNegation","FlagUnexpectedEof","FlagUnrecognized","Flags","Flags","FlagsItem","FlagsItemKind","FormFeed","Graph","Group","Group","GroupKind","GroupNameDuplicate","GroupNameEmpty","GroupNameInvalid","GroupNameUnexpectedEof","GroupUnclosed","GroupUnopened","HexBrace","HexFixed","HexLiteralKind","IgnoreWhitespace","Intersection","Item","LineFeed","Literal","Literal","Literal","LiteralKind","Lower","Meta","MultiLine","Named","NamedValue","Negation","NestLimitExceeded","NonCapturing","NotEqual","NotWordBoundary","Octal","OneLetter","OneOrMore","Output","Perl","Position","Print","Punct","Range","Range","Repetition","Repetition","RepetitionCountDecimalEmpty","RepetitionCountInvalid","RepetitionCountUnclosed","RepetitionKind","RepetitionMissing","RepetitionOp","RepetitionRange","SetFlags","Space","Space","Space","Span","Special","SpecialLiteralKind","SpecialWordBoundaryUnclosed","SpecialWordBoundaryUnrecognized","SpecialWordOrRepetitionUnexpectedEof","StartLine","StartText","Superfluous","SwapGreed","SymmetricDifference","Tab","Unicode","Unicode","UnicodeClassInvalid","UnicodeLong","UnicodeShort","Union","UnsupportedBackreference","UnsupportedLookAround","Upper","Verbatim","VerticalTab","Visitor","WithComments","Word","Word","WordBoundary","WordBoundaryEnd","WordBoundaryEndAngle","WordBoundaryEndHalf","WordBoundaryStart","WordBoundaryStartAngle","WordBoundaryStartHalf","X","Xdigit","ZeroOrMore","ZeroOrOne","add_item","alternation","assertion","ast","ast","ast","asts","asts","auxiliary_span","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","byte","c","capture_index","class_bracketed","class_perl","class_unicode","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","cmp","cmp","column","comment","comments","concat","digits","dot","drop","drop","empty","end","end","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","finish","flag_state","flags","flags","flags","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from_name","greedy","group","index","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into_ast","into_ast","into_item","is_capturing","is_empty","is_empty","is_equal","is_negated","is_negation","is_one_line","is_valid","is_valid","items","items","kind","kind","kind","kind","kind","kind","kind","kind","kind","kind","kind","lhs","line","literal","name","negated","negated","negated","negated","new","new","offset","op","parse","partial_cmp","partial_cmp","pattern","print","push","repetition","rhs","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","splat","start","start","start","start","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_string","to_string","to_string","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","union","visit","visit_alternation_in","visit_alternation_in","visit_class_set_binary_op_in","visit_class_set_binary_op_in","visit_class_set_binary_op_post","visit_class_set_binary_op_post","visit_class_set_binary_op_pre","visit_class_set_binary_op_pre","visit_class_set_item_post","visit_class_set_item_post","visit_class_set_item_pre","visit_class_set_item_pre","visit_concat_in","visit_concat_in","visit_post","visit_post","visit_pre","visit_pre","with_end","with_start","name","op","value","original","original","original","name","starts_with_p","Parser","ParserBuilder","borrow","borrow","borrow_mut","borrow_mut","build","clone","clone","clone_into","clone_into","default","empty_min_range","fmt","fmt","from","from","ignore_whitespace","into","into","nest_limit","new","new","octal","parse","parse_with_comments","to_owned","to_owned","try_from","try_from","try_into","try_into","type_id","type_id","Printer","borrow","borrow_mut","fmt","from","into","new","print","try_from","try_into","type_id","Alternation","AnyByte","AnyByteExcept","AnyByteExceptCRLF","AnyByteExceptLF","AnyChar","AnyCharExcept","AnyCharExceptCRLF","AnyCharExceptLF","Bytes","Capture","Capture","CaseFoldError","Class","Class","ClassBytes","ClassBytesIter","ClassBytesRange","ClassUnicode","ClassUnicodeIter","ClassUnicodeRange","Concat","Dot","Empty","End","EndCRLF","EndLF","Err","Error","ErrorKind","Hir","HirKind","InvalidLineTerminator","InvalidUtf8","Literal","Literal","Look","Look","LookSet","LookSetIter","Output","Properties","Repetition","Repetition","Start","StartCRLF","StartLF","Unicode","UnicodeCaseUnavailable","UnicodeNotAllowed","UnicodePerlClassNotFound","UnicodePropertyNotFound","UnicodePropertyValueNotFound","Visitor","WordAscii","WordAsciiNegate","WordEndAscii","WordEndHalfAscii","WordEndHalfUnicode","WordEndUnicode","WordStartAscii","WordStartHalfAscii","WordStartHalfUnicode","WordStartUnicode","WordUnicode","WordUnicodeNegate","alternation","as_char","as_repr","bits","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","capture","case_fold_simple","case_fold_simple","case_fold_simple","class","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","cmp","cmp","concat","contains","contains_anchor","contains_anchor_crlf","contains_anchor_haystack","contains_anchor_lf","contains_anchor_line","contains_word","contains_word_ascii","contains_word_unicode","default","default","default","difference","difference","dot","drop","empty","empty","empty","empty","end","end","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","explicit_captures_len","fail","finish","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from_repr","full","greedy","index","insert","intersect","intersect","intersect","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into_iter","into_iter","into_iter","into_kind","is_alternation_literal","is_ascii","is_ascii","is_empty","is_empty","is_literal","is_utf8","is_utf8","iter","iter","iter","kind","kind","len","len","len","literal","literal","literal","literal","literal","look","look_set","look_set_prefix","look_set_prefix_any","look_set_suffix","look_set_suffix_any","max","maximum_len","maximum_len","maximum_len","maximum_len","memory_usage","min","minimum_len","minimum_len","minimum_len","minimum_len","name","negate","negate","negate","new","new","new","new","next","next","next","partial_cmp","partial_cmp","pattern","print","properties","push","push","ranges","ranges","read_repr","remove","repetition","reversed","set_insert","set_intersect","set_remove","set_subtract","set_union","singleton","span","start","start","start","start","static_explicit_captures_len","sub","sub","subs","subtract","symmetric_difference","symmetric_difference","to_byte_class","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_string","to_string","to_string","to_string","to_unicode_class","translate","try_case_fold_simple","try_case_fold_simple","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","union","union","union","union","visit","visit_alternation_in","visit_alternation_in","visit_concat_in","visit_concat_in","visit_post","visit_post","visit_pre","visit_pre","with","write_repr","ExtractKind","Extractor","Literal","Prefix","Seq","Suffix","as_bytes","as_ref","borrow","borrow","borrow","borrow","borrow_mut","borrow_mut","borrow_mut","borrow_mut","clone","clone","clone","clone","clone_into","clone_into","clone_into","clone_into","cmp","cross_forward","cross_reverse","dedup","default","default","empty","eq","eq","exact","extend","extract","fmt","fmt","fmt","fmt","from","from","from","from","from","from","from_iter","inexact","infinite","into","into","into","into","into_bytes","is_empty","is_empty","is_exact","is_exact","is_finite","is_inexact","is_prefix","is_suffix","keep_first_bytes","keep_first_bytes","keep_last_bytes","keep_last_bytes","kind","len","len","limit_class","limit_literal_len","limit_repeat","limit_total","literals","longest_common_prefix","longest_common_suffix","make_inexact","make_inexact","make_infinite","max_cross_len","max_literal_len","max_union_len","min_literal_len","minimize_by_preference","new","new","optimize_for_prefix_by_preference","optimize_for_suffix_by_preference","partial_cmp","push","rank","reverse","reverse_literals","singleton","sort","to_owned","to_owned","to_owned","to_owned","try_from","try_from","try_from","try_from","try_into","try_into","try_into","try_into","type_id","type_id","type_id","type_id","union","union_into_empty","Printer","borrow","borrow_mut","fmt","from","into","new","print","try_from","try_into","type_id","Translator","TranslatorBuilder","borrow","borrow","borrow_mut","borrow_mut","build","case_insensitive","clone","clone","clone_into","clone_into","crlf","default","dot_matches_new_line","fmt","fmt","from","from","into","into","line_terminator","multi_line","new","new","swap_greed","to_owned","to_owned","translate","try_from","try_from","try_into","try_into","type_id","type_id","unicode","utf8","Four","One","Three","Two","Utf8Range","Utf8Sequence","Utf8Sequences","as_slice","borrow","borrow","borrow","borrow_mut","borrow_mut","borrow_mut","clone","clone","clone_into","clone_into","cmp","cmp","end","eq","eq","fmt","fmt","fmt","from","from","from","into","into","into","into_iter","into_iter","len","matches","matches","new","next","partial_cmp","partial_cmp","reverse","start","to_owned","to_owned","try_from","try_from","try_from","try_into","try_into","try_into","type_id","type_id","type_id"],"q":[[0,"regex_syntax"],[81,"regex_syntax::ast"],[885,"regex_syntax::ast::ClassUnicodeKind"],[888,"regex_syntax::ast::ErrorKind"],[891,"regex_syntax::ast::GroupKind"],[893,"regex_syntax::ast::parse"],[927,"regex_syntax::ast::print"],[938,"regex_syntax::hir"],[1388,"regex_syntax::hir::literal"],[1501,"regex_syntax::hir::print"],[1512,"regex_syntax::hir::translate"],[1549,"regex_syntax::utf8"],[1603,"alloc::string"],[1604,"core::fmt"],[1605,"core::fmt"],[1606,"core::any"],[1607,"core::option"],[1608,"core::cmp"],[1609,"core::fmt"],[1610,"alloc::boxed"],[1611,"core::convert"],[1612,"core::iter::traits::collect"],[1613,"core::borrow"],[1614,"core::convert"]],"d":["This error type encompasses any error that can be returned …","An error that occurred while translating concrete syntax …","A convenience parser for regular expressions.","A builder for a regular expression parser.","An error that occurred while translating abstract syntax …","An error that occurs when the Unicode-aware \\\\w class is …","Defines an abstract syntax for regular expressions.","","","","","","","","","Build a parser from this configuration with the given …","Enable or disable the case insensitive flag by default.","","","","","","","Enable or disable the CRLF mode flag by default.","","Enable or disable the “dot matches any character” flag …","","Escapes all regular expression meta characters in text.","Escapes all meta characters in text and writes the result …","","","","","","","","Returns the argument unchanged.","","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Defines a high-level intermediate (HIR) representation for …","Enable verbose mode in the regular expression.","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Returns true if the given character can be escaped in a …","Returns true if the given character has significance in a …","Returns true if and only if the given character is an …","Returns true if and only if the given character is a …","Sets the line terminator for use with (?u-s:.) and (?-us:.)…","Enable or disable the multi-line matching flag by default.","Set the nesting limit for this parser.","Create a new parser builder with a default configuration.","Create a new parser with a default configuration.","Whether to support octal syntax or not.","A convenience routine for parsing a regex using default …","Parse the regular expression into a high level intermediate","Enable or disable the “swap greed” flag by default.","","","","","","","","","","","","","","Returns true if and only if the given character is a …","","","","","Enable or disable the Unicode flag (u) by default.","Converts ranges of Unicode scalar values to equivalent …","When disabled, translation will permit the construction of …","[0-9A-Za-z]","[A-Za-z]","An alternation of regular expressions.","An alternation of regular expressions.","[\\\\x00-\\\\x7F]","An ASCII character class, e.g., [:alnum:] or [:punct:].","A single zero-width assertion.","A single zero-width assertion.","An assertion kind.","An abstract syntax tree for a single regular expression.","{m,}","Bell, spelled \\\\a (\\\\x07).","A single binary operation (i.e., &&, – or ~~).","[ \\\\t]","{m,n}","A bracketed character class set, which may contain zero or …","R","(a)","The capturing group limit was exceeded.","A capture name.","(?<name>a) or (?P<name>a)","Carriage return, spelled \\\\r (\\\\x0D).","i","An ASCII character class.","The available ASCII character classes.","A bracketed character class, e.g., [a-z0-9].","A single bracketed character class set, which may contain …","An invalid escape sequence was found in a character class …","A Perl character class.","A single perl character class, e.g., \\\\d or \\\\W.","The available Perl character classes.","An invalid character class range was found. An invalid …","An invalid range boundary was found in a character class. …","A character class set.","A Unicode character class set operation.","The type of a Unicode character class set operation.","A single component of a character class set.","A single character class range in a set.","A union of items inside a character class set.","An opening [ was found with no corresponding closing ].","A Unicode character class.","A single Unicode character class, e.g., \\\\pL or \\\\p{Greek}.","The available forms of Unicode character classes.","The type of op used in a Unicode character class.","[\\\\x00-\\\\x1F\\\\x7F]","A property set to a specific value using a colon, e.g., …","A comment from a regular expression with an associated …","A concatenation of regular expressions.","A concatenation of regular expressions.","Note that this error variant is no longer used. Namely, a …","An invalid decimal number was given where one was expected.","The difference of two sets, e.g., \\\\pN--[0-9].","Decimal numbers.","[0-9]","The “any character” class.","s","An empty regex that matches everything.","An empty item.","$","\\\\z","A property set to a specific value, e.g., \\\\p{scx=Katakana}.","An error that visiting an AST might return.","An error that occurred while parsing a regular expression …","The type of an error that occurred while building an AST.","A bracketed hex literal was empty.","A bracketed hex literal did not correspond to a Unicode …","An invalid hexadecimal digit was found.","EOF was found before an escape sequence was completed.","An unrecognized escape sequence.","{m}","A single flag.","A single flag in a group.","A dangling negation was used when setting flags, e.g., i-.","A flag was used twice, e.g., i-i.","The negation operator was used twice, e.g., -i-s.","Expected a flag but got EOF, e.g., (?.","Unrecognized flag, e.g., a.","A group of flags.","A set of flags, e.g., (?is).","A single item in a group of flags.","The kind of an item in a group of flags.","Form feed, spelled \\\\f (\\\\x0C).","[!-~]","A grouped regular expression.","A grouped regular expression.","The kind of a group.","A duplicate capture name was found.","A capture group name is empty, e.g., (?P<>abc).","An invalid character was seen for a capture group name. …","A closing > could not be found for a capture group name.","An unclosed group, e.g., (ab.","An unopened group, e.g., ab).","The literal is written as a hex code with a bracketed …","The literal is written as a hex code with a fixed number …","The type of a Unicode hex literal.","x","The intersection of two sets, e.g., \\\\pN&&[a-z].","An item, which can be a single literal, range, nested …","Line feed, spelled \\\\n (\\\\x0A).","A single literal expression.","A single character literal, which includes escape …","A single literal.","The kind of a single literal expression.","[a-z]","The literal is written as an escape because it is …","m","A binary property, general category or script. The string …","A property name and an associated value.","A negation operator applied to all subsequent flags in the …","The nest limit was exceeded. The limit stored here is the …","(?:a) and (?i:a)","A property that isn’t a particular value, e.g., …","\\\\B","The literal is written as an octal escape, e.g., \\\\141.","A one letter abbreviated class, e.g., \\\\pN.","+","The result of visiting an AST.","A perl character class, e.g., \\\\d or \\\\W.","A single position in a regular expression.","[ -~]","[!-/:-@\\\\[-{-~]`","A range between two literals.","{m,n}","A repetition operation applied to a regular expression.","A repetition operator applied to an arbitrary regular …","An opening { was not followed by a valid decimal value. …","The range provided in a counted repetition operator is …","An opening { was found with no corresponding closing }.","The kind of a repetition operator.","A repetition operator was applied to a missing …","The repetition operator itself.","A range repetition operator.","A group of flags that is not applied to a particular …","Space, spelled \\\\ (\\\\x20). Note that this can only appear …","Whitespace.","[\\\\t\\\\n\\\\v\\\\f\\\\r ]","Span represents the position information of a single AST …","The literal is written as a specially recognized escape, …","The type of a special literal.","The special word boundary syntax, \\\\b{something}, was used, …","The special word boundary syntax, \\\\b{something}, was used, …","The syntax \\\\b{ was observed, but afterwards the end of the …","^","\\\\A","The literal is written as an escape despite the fact that …","U","The symmetric difference of two sets. The symmetric …","Tab, spelled \\\\t (\\\\x09).","A Unicode character class, e.g., \\\\pL or \\\\p{Greek}.","u","The Unicode class is not valid. This typically occurs when …","A \\\\U prefix. When used without brackets, this form is …","A \\\\u prefix. When used without brackets, this form is …","A union of items.","When octal support is disabled, this error is produced …","When syntax similar to PCRE’s look-around is used, this …","[A-Z]","The literal is written verbatim, e.g., a or ☃.","Vertical tab, spelled \\\\v (\\\\x0B).","A trait for visiting an abstract syntax tree (AST) in …","An abstract syntax tree for a singular expression along …","Word characters.","[0-9A-Za-z_]","\\\\b","\\\\b{end}","\\\\> (alias for \\\\b{end})","\\\\b{end-half}","\\\\b{start}","\\\\< (alias for \\\\b{start})","\\\\b{start-half}","A \\\\x prefix. When used without brackets, this form is …","[0-9A-Fa-f]","*","?","Add the given item to this sequence of flags.","Create a “alternation” AST item.","Create a “assertion” AST item.","The actual ast.","The regular expression under repetition.","The regular expression in this group.","The alternate regular expressions.","The concatenation regular expressions.","Return an auxiliary span. This span exists only for some …","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","If this literal was written as a \\\\x hex escape, then this …","The Unicode scalar value corresponding to this literal.","Returns the capture index of this group, if this is a …","Create a “bracketed class” AST item.","Create a “Perl class” AST item.","Create a “Unicode class” AST item.","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","The approximate column number, starting at 1.","The comment text, starting with the first character …","All comments found in the original regular expression.","Create a “concat” AST item.","The number of digits that must be used with this literal …","Create a “dot” AST item.","","","Create an “empty” AST item.","The end byte offset.","The end of this range.","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","All implementors of Visitor must provide a finish method, …","Returns the state of the given flag in this set.","Create a “flags” AST item.","If this group is non-capturing, then this returns the …","The actual sequence of flags.","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Return the corresponding ClassAsciiKind variant for the …","Whether this operation was applied greedily or not.","Create a “group” AST item.","The capture index.","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Return this alternation as an AST.","Return this concatenation as an AST.","Return this union as a character class set item.","Returns true if and only if this group is capturing.","Returns true if and only if this span is empty. That is, …","Return true if and only if this Ast is empty.","Whether the op is an equality op or not.","Returns true if this class has been negated.","Returns true if and only if this item is a negation …","Returns true if and only if this span occurs on a single …","Returns true if and only if this character class range is …","Returns true if and only if this repetition range is valid.","The sequence of items that make up this union.","A sequence of flag items. Each item is either a flag or a …","Return the type of this error.","The kind of this literal.","The kind of Perl class.","The kind of ASCII class.","The kind of Unicode class.","The type of this set. A set is either a normal union of …","The type of this set operation.","The assertion kind, e.g., \\\\b or ^.","The type of operation.","The kind of this group.","The kind of this item.","The left hand side of the operation.","The line number, starting at 1.","Create a “literal” AST item.","The capture name.","Whether the class is negated or not. e.g., \\\\d is not …","Whether the class is negated or not. e.g., [[:alpha:]] is …","Whether this class is negated or not.","Whether this class is negated or not. e.g., [a] is not …","Create a new span with the given positions.","Create a new position with the given information.","The absolute offset of this position, starting at 0 from …","The actual operation.","This module provides a regular expression parser.","","","The original pattern string in which this error occurred.","This module provides a regular expression printer for Ast.","Push a new item in this union.","Create a “repetition” AST item.","The right hand side of the operation.","Return the span at which this error occurred.","Return the span of this abstract syntax tree.","Return the span of this character class set.","Return the span of this character class set item.","The span of this comment, including the beginning # and …","The span of this alternation.","The span of this concatenation.","The span of this literal.","The span of this class.","The span of this class.","The span of this class.","The span of this class.","The span of this range.","The span of the items in this operation. e.g., the a-z0-9 …","The span of this operation. e.g., the a-z--[h-p] in …","The span of this assertion.","The span of this operation.","The span of this operator. This includes things like +, *? …","The span of this group.","The span of this capture name.","The span of these flags, including the grouping …","The span of this group of flags.","The span of this item.","Create a new span using the given position as the start …","This method is called before beginning traversal of the …","This method is called before beginning traversal of the …","The start byte offset.","The start of this range.","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","Build a set from a union.","Executes an implementation of Visitor in constant stack …","This method is called between child nodes of an Alternation…","This method is called between child nodes of an Alternation…","This method is called between the left hand and right hand …","This method is called between the left hand and right hand …","This method is called on every ClassSetBinaryOp after …","This method is called on every ClassSetBinaryOp after …","This method is called on every ClassSetBinaryOp before …","This method is called on every ClassSetBinaryOp before …","This method is called on every ClassSetItem after …","This method is called on every ClassSetItem after …","This method is called on every ClassSetItem before …","This method is called on every ClassSetItem before …","This method is called between child nodes of a …","This method is called between child nodes of a …","This method is called on an Ast after descending all of …","This method is called on an Ast after descending all of …","This method is called on an Ast before descending into …","This method is called on an Ast before descending into …","Create a new span by replacing the ending the position …","Create a new span by replacing the starting the position …","The property name (which may be empty).","The type of Unicode op used to associate name with value.","The property value (which may be empty).","The position of the original flag. The error position …","The position of the original negation operator. The error …","The position of the initial occurrence of the capture …","The capture name.","True if the ?P< syntax is used and false if the ?< syntax …","A regular expression parser.","A builder for a regular expression parser.","","","","","Build a parser from this configuration with the given …","","","","","","Allow using {,n} as an equivalent to {0,n}.","","","Returns the argument unchanged.","Returns the argument unchanged.","Enable verbose mode in the regular expression.","Calls U::from(self).","Calls U::from(self).","Set the nesting limit for this parser.","Create a new parser builder with a default configuration.","Create a new parser with a default configuration.","Whether to support octal syntax or not.","Parse the regular expression into an abstract syntax tree.","Parse the regular expression and return an abstract syntax …","","","","","","","","","A printer for a regular expression abstract syntax tree.","","","","Returns the argument unchanged.","Calls U::from(self).","Create a new printer.","Print the given Ast to the given writer. The writer must …","","","","An alternation of expressions.","Matches any byte value.","Matches any byte value except for the u8 given.","Matches any byte value except for \\\\r and \\\\n.","Matches any byte value except for \\\\n.","Matches the UTF-8 encoding of any Unicode scalar value.","Matches the UTF-8 encoding of any Unicode scalar value …","Matches the UTF-8 encoding of any Unicode scalar value …","Matches the UTF-8 encoding of any Unicode scalar value …","A set of characters represented by arbitrary bytes (one …","The high-level intermediate representation for a capturing …","A capturing group, which contains a sub-expression.","An error that occurs when Unicode-aware simple case …","The high-level intermediate representation of a character …","A single character class that matches any of the …","A set of characters represented by arbitrary bytes.","An iterator over all ranges in a byte character class.","A single range of characters represented by arbitrary …","A set of characters represented by Unicode scalar values.","An iterator over all ranges in a Unicode character class.","A single range of characters represented by Unicode scalar …","A concatenation of expressions.","A type describing the different flavors of ..","The empty regular expression, which matches everything, …","Match the end of text. Specifically, this matches at the …","Match the end of a line or the end of text. Specifically, …","Match the end of a line or the end of text. Specifically, …","An error that visiting an HIR might return.","An error that can occur while translating an Ast to a Hir.","The type of an error that occurred while building an Hir.","A high-level intermediate representation (HIR) for a …","The underlying kind of an arbitrary Hir expression.","This error occurs when one uses a non-ASCII byte for a …","This error occurs when translating a pattern that could …","The high-level intermediate representation of a literal.","A literalstring that matches exactly these bytes.","The high-level intermediate representation for a …","A look-around assertion. A look-around match always has …","A set of look-around assertions.","An iterator over all look-around assertions in a LookSet.","The result of visiting an HIR.","A type that collects various properties of an HIR value.","The high-level intermediate representation of a repetition …","A repetition operation applied to a sub-expression.","Match the beginning of text. Specifically, this matches at …","Match the beginning of a line or the beginning of text. …","Match the beginning of a line or the beginning of text. …","A set of characters represented by Unicode scalar values.","This occurs when the Unicode simple case mapping tables …","This error occurs when a Unicode feature is used when …","This occurs when a Unicode-aware Perl character class (\\\\w, …","This occurs when an unrecognized Unicode property name …","This occurs when an unrecognized Unicode property value …","A trait for visiting the high-level IR (HIR) in depth …","Match an ASCII-only word boundary. That is, this matches a …","Match an ASCII-only negation of a word boundary.","Match the end of an ASCII-only word boundary. That is, …","Match the end half of an ASCII-only word boundary. That …","Match the end half of a Unicode word boundary. That is, …","Match the end of a Unicode word boundary. That is, this …","Match the start of an ASCII-only word boundary. That is, …","Match the start half of an ASCII-only word boundary. That …","Match the start half of a Unicode word boundary. That is, …","Match the start of a Unicode word boundary. That is, this …","Match a Unicode-aware word boundary. That is, this matches …","Match a Unicode-aware negation of a word boundary.","Returns the alternation of the given expressions.","Returns a convenient single codepoint representation of …","Return the underlying representation of this look-around …","The underlying representation this set is exposed to make …","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","Creates a capture HIR expression.","Apply Unicode simple case folding to this character class, …","Expand this character class such that it contains all case …","Expand this character class such that it contains all case …","Creates a class HIR expression. The class may either be …","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","Returns the concatenation of the given expressions.","Returns true if and only if the given look-around …","Returns true if and only if this set contains any anchor …","Returns true if and only if this set contains any “…","Returns true if and only if this set contains any “…","Returns true if and only if this set contains any “…","Returns true if and only if this set contains any “…","Returns true if and only if this set contains any word …","Returns true if and only if this set contains any ASCII …","Returns true if and only if this set contains any Unicode …","","","","Subtract the given character class from this character …","Subtract the given byte class from this byte class, in …","Returns an HIR expression for ..","","Returns an empty HIR expression.","Create a new class with no ranges.","Create a new class with no ranges.","Create an empty set of look-around assertions.","Return the end of this range.","Return the end of this range.","","","","","","","","","","","","","","","","","Returns the total number of explicit capturing groups in …","Returns an HIR expression that can never match anything. …","All implementors of Visitor must provide a finish method, …","","","","","","","","","","","","","","","","","","","","","","","","","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Given the underlying representation of a Look value, …","Create a full set of look-around assertions.","Whether this repetition operator is greedy or not. A …","The capture index of the capture.","Return a new set that is equivalent to the original, but …","Intersect this character class with the given character …","Intersect this byte class with the given byte class, in …","Returns a new set that is the intersection of this and the …","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","","","","Consumes ownership of this HIR expression and returns its …","Return true if and only if this HIR is either a simple …","Returns true if and only if this character class will …","Returns true if and only if this character class will …","Returns true if and only if this character class is empty. …","Returns true if and only if this set is empty.","Return true if and only if this HIR is a simple literal. …","Returns true if and only if this character class will only …","Return true if and only if the corresponding HIR will …","Return an iterator over all ranges in this class.","Return an iterator over all ranges in this class.","Returns an iterator over all of the look-around assertions …","Return the type of this error.","Returns a reference to the underlying HIR kind.","Returns the number of codepoints in this range.","Returns the number of bytes in this range.","Returns the total number of look-around assertions in this …","Provides literal extraction from Hir expressions.","Creates a literal HIR expression.","If this class consists of exactly one element (whether a …","If this class consists of exactly one codepoint, then …","If this class consists of exactly one byte, then return it …","Creates a look-around assertion HIR expression.","Returns a set of all look-around assertions that appear at …","Returns a set of all look-around assertions that appear as …","Returns a set of all look-around assertions that appear as …","Returns a set of all look-around assertions that appear as …","Returns a set of all look-around assertions that appear as …","The maximum range of the repetition.","Returns the length, in bytes, of the longest string …","Returns the length, in bytes, of the longest string …","Returns the length, in bytes, of the longest string …","Returns the length (in bytes) of the longest string …","Returns the total amount of heap memory usage, in bytes, …","The minimum range of the repetition.","Returns the length, in bytes, of the smallest string …","Returns the length, in bytes, of the smallest string …","Returns the length, in bytes, of the smallest string …","Returns the length (in bytes) of the smallest string …","The name of the capture, if it exists.","Negate this character class in place.","Negate this character class.","Negate this byte class.","Create a new class from a sequence of ranges.","Create a new Unicode scalar value range for a character …","Create a new class from a sequence of ranges.","Create a new byte range for a character class.","","","","","","The original pattern string in which this error occurred.","This module provides a regular expression printer for Hir.","Returns the properties computed for this Hir.","Add a new range to this set.","Add a new range to this set.","Return the underlying ranges as a slice.","Return the underlying ranges as a slice.","Return a LookSet from the slice given as a native endian …","Return a new set that is equivalent to the original, but …","Creates a repetition HIR expression.","Flip the look-around assertion to its equivalent for …","Updates this set in place with the result of inserting the …","Updates this set in place with the result of intersecting …","Updates this set in place with the result of removing the …","Updates this set in place with the result of subtracting …","Updates this set in place with the result of unioning it …","Create a look-around set containing the look-around …","Return the span at which this error occurred.","This method is called before beginning traversal of the …","This method is called before beginning traversal of the …","Return the start of this range.","Return the start of this range.","Returns the total number of explicit capturing groups that …","The expression inside the capturing group, which may be …","The expression being repeated.","Returns a slice of this kind’s sub-expressions, if any.","Returns a new set that is the result of subtracting the …","Compute the symmetric difference of the given character …","Compute the symmetric difference of the given byte …","If this class consists of only ASCII ranges, then return …","","","","","","","","","","","","","","","","","","","","","","If this class consists of only ASCII ranges, then return …","Defines a translator that converts an Ast to an Hir.","Apply Unicode simple case folding to this character class, …","Expand this character class such that it contains all case …","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","Union this character class with the given character class, …","Union this byte class with the given byte class, in place.","Returns a new set of properties that corresponds to the …","Returns a new set that is the union of this and the one …","Executes an implementation of Visitor in constant stack …","This method is called between child nodes of an …","This method is called between child nodes of an …","This method is called between child nodes of a …","This method is called between child nodes of a …","This method is called on an Hir after descending all of …","This method is called on an Hir after descending all of …","This method is called on an Hir before descending into …","This method is called on an Hir before descending into …","Returns a new repetition with the same min, max and greedy …","Write a LookSet as a native endian 32-bit integer to the …","The kind of literals to extract from an Hir expression.","Extracts prefix or suffix literal sequences from Hir …","A single literal extracted from an Hir expression.","Extracts only prefix literals from a regex.","A sequence of literals.","Extracts only suffix literals from a regex.","Returns the bytes in this literal.","","","","","","","","","","","","","","","","","","","Modify this sequence to contain the cross product between …","Modify this sequence to contain the cross product between …","Deduplicate adjacent equivalent literals in this sequence.","","","Returns an empty sequence.","","","Returns a new exact literal containing the bytes given.","Extend this literal with the literal given.","Execute the extractor and return a sequence of literals.","","","","","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","","Returns the argument unchanged.","","","Returns a new inexact literal containing the bytes given.","Returns a sequence of literals without a finite size and …","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Yields ownership of the bytes inside this literal.","Returns true if and only if this sequence is finite and …","Returns true if and only if this literal has zero bytes.","Returns true if and only if all literals in this sequence …","Returns true if and only if this literal is exact.","Returns true if this sequence is finite.","Returns true if and only if all literals in this sequence …","Returns true if this kind is the Prefix variant.","Returns true if this kind is the Suffix variant.","Trims all literals in this seq such that only the first len…","Trims this literal such that only the first len bytes …","Trims all literals in this seq such that only the last len …","Trims this literal such that only the last len bytes …","Set the kind of literal sequence to extract from an Hir …","Returns the number of literals in this sequence if the …","Returns the length of this literal in bytes.","Configure a limit on the length of the sequence that is …","Configure a limit on the maximum length of any literal in …","Configure a limit on the total number of repetitions that …","Configure a limit on the total number of literals that …","If this is a finite sequence, return its members as a …","Returns the longest common prefix from this seq.","Returns the longest common suffix from this seq.","Make all of the literals in this sequence inexact.","Marks this literal as inexact.","Converts this sequence to an infinite sequence.","Return the maximum length of the sequence that would …","Returns the length of the longest literal in this sequence.","Return the maximum length of the sequence that would …","Returns the length of the shortest literal in this …","Shrinks this seq to its minimal size while respecting the …","Create a new extractor with a default configuration.","Returns a sequence of exact literals from the given byte …","Optimizes this seq while treating its literals as prefixes …","Optimizes this seq while treating its literals as suffixes …","","Push a literal to the end of this sequence.","Returns the “rank” of the given byte.","Reverse the bytes in this literal.","Reverses all of the literals in this sequence.","Returns a sequence containing a single literal.","Sorts this sequence of literals lexicographically.","","","","","","","","","","","","","","","","","Unions the other sequence into this one.","Unions the other sequence into this one by splice the other","A printer for a regular expression’s high-level …","","","","Returns the argument unchanged.","Calls U::from(self).","Create a new printer.","Print the given Ast to the given writer. The writer must …","","","","A translator maps abstract syntax to a high level …","A builder for constructing an AST->HIR translator.","","","","","Build a translator using the current configuration.","Enable or disable the case insensitive flag (i) by default.","","","","","Enable or disable the CRLF mode flag (R) by default.","","Enable or disable the “dot matches any character” flag …","","","Returns the argument unchanged.","Returns the argument unchanged.","Calls U::from(self).","Calls U::from(self).","Sets the line terminator for use with (?u-s:.) and (?-us:.)…","Enable or disable the multi-line matching flag (m) by …","Create a new translator builder with a default c …","Create a new translator using the default configuration.","Enable or disable the “swap greed” flag (U) by default.","","","Translate the given abstract syntax tree (AST) into a high …","","","","","","","Enable or disable the Unicode flag (u) by default.","When disabled, translation will permit the construction of …","Four successive byte ranges.","One byte range.","Three successive byte ranges.","Two successive byte ranges.","A single inclusive range of UTF-8 bytes.","Utf8Sequence represents a sequence of byte ranges.","An iterator over ranges of matching UTF-8 byte sequences.","Returns the underlying sequence of byte ranges as a slice.","","","","","","","","","","","","","End of byte range (inclusive).","","","","","","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 number of byte ranges in this sequence.","Returns true if and only if a prefix of bytes matches this …","Returns true if and only if the given byte is in this …","Create a new iterator over UTF-8 byte ranges for the …","","","","Reverses the ranges in this sequence.","Start of byte range (inclusive).","","","","","","","","","","",""],"i":[0,4,0,0,4,0,0,4,1,2,10,4,1,2,10,1,1,4,1,2,4,1,2,1,1,1,4,0,0,4,4,1,2,10,10,4,4,4,1,2,10,0,1,4,1,2,10,0,0,0,0,1,1,1,1,2,1,0,2,1,4,1,2,4,10,4,1,2,10,4,1,2,10,0,4,1,2,10,1,0,1,42,42,0,24,42,46,0,24,0,0,55,38,45,42,55,46,60,56,32,0,56,38,60,0,0,0,24,32,0,24,0,32,32,0,0,0,0,0,0,32,0,24,0,0,42,44,0,0,24,32,32,50,40,42,24,60,24,46,51,51,44,64,0,0,32,32,32,32,32,55,0,59,32,32,32,32,32,0,24,0,0,38,42,0,24,0,32,32,32,32,32,32,37,37,0,60,50,45,38,0,24,46,0,42,37,60,43,43,59,32,56,44,51,37,43,54,64,46,0,42,42,46,54,0,24,32,32,32,0,32,0,0,0,38,40,42,0,37,0,32,32,32,51,51,37,60,50,38,46,60,32,39,39,46,32,32,42,37,38,0,0,40,42,51,51,51,51,51,51,51,39,42,54,54,19,24,24,34,52,28,23,36,11,11,32,26,33,34,35,24,23,36,27,37,38,39,30,40,41,42,31,43,44,29,45,46,47,48,49,50,25,51,52,53,54,55,28,56,57,58,19,20,59,60,11,32,26,33,34,35,24,23,36,27,37,38,39,30,40,41,42,31,43,44,29,45,46,47,48,49,50,25,51,52,53,54,55,28,56,57,58,19,20,59,60,27,27,28,24,24,24,11,32,26,33,34,35,24,23,36,27,37,38,39,30,40,41,42,31,43,44,29,45,46,47,48,49,50,25,51,52,53,54,55,28,56,57,58,19,20,59,60,11,32,26,33,34,35,24,23,36,27,37,38,39,30,40,41,42,31,43,44,29,45,46,47,48,49,50,25,51,52,53,54,55,28,56,57,58,19,20,59,60,26,33,33,35,34,24,39,24,24,45,24,26,47,11,32,26,33,34,35,24,23,36,27,37,38,39,30,40,41,42,31,43,44,29,45,46,47,48,49,50,25,51,52,53,54,55,28,56,57,58,19,20,59,60,64,19,24,28,58,11,11,32,32,26,33,34,35,24,24,23,36,27,37,38,39,30,40,41,42,31,43,44,29,45,46,47,48,49,50,25,51,52,53,54,55,28,56,57,58,19,20,59,60,11,32,26,33,34,35,24,23,36,27,37,38,39,30,40,41,42,31,43,44,29,45,46,47,48,49,50,25,51,52,53,54,55,28,56,57,58,19,20,59,60,42,52,24,57,11,32,26,33,34,35,24,23,36,27,37,38,39,30,40,41,42,31,43,44,29,45,46,47,48,49,50,25,51,52,53,54,55,28,56,57,58,19,20,59,60,23,36,48,28,26,24,44,31,59,26,47,55,48,19,11,27,30,41,31,29,49,25,53,28,20,49,33,24,57,30,41,31,29,26,33,33,52,0,26,33,11,0,48,24,49,11,24,45,46,35,23,36,27,30,41,31,29,47,48,49,25,52,53,28,57,58,19,20,26,64,64,26,47,11,32,26,33,34,35,24,23,36,27,37,38,39,30,40,41,42,31,43,44,29,45,46,47,48,49,50,25,51,52,53,54,55,28,56,57,58,19,20,59,60,11,32,24,11,32,26,33,34,35,24,23,36,27,37,38,39,30,40,41,42,31,43,44,29,45,46,47,48,49,50,25,51,52,53,54,55,28,56,57,58,19,20,59,60,11,32,26,33,34,35,24,23,36,27,37,38,39,30,40,41,42,31,43,44,29,45,46,47,48,49,50,25,51,52,53,54,55,28,56,57,58,19,20,59,60,11,32,26,33,34,35,24,23,36,27,37,38,39,30,40,41,42,31,43,44,29,45,46,47,48,49,50,25,51,52,53,54,55,28,56,57,58,19,20,59,60,45,0,64,64,64,64,64,64,64,64,64,64,64,64,64,64,64,64,64,64,26,26,106,106,106,107,108,109,110,110,0,0,65,66,65,66,65,65,66,65,66,65,65,65,66,65,66,65,65,66,65,65,66,65,66,66,65,66,65,66,65,66,65,66,0,67,67,67,67,67,67,67,67,67,67,76,81,81,81,81,81,81,81,81,72,0,76,0,0,76,0,0,0,0,0,0,76,0,76,70,70,70,85,0,0,0,0,75,75,0,76,0,76,0,0,85,0,0,76,70,70,70,72,75,75,75,75,75,0,70,70,70,70,70,70,70,70,70,70,70,70,16,70,70,83,12,75,16,76,77,72,73,86,78,74,87,79,70,71,80,81,82,83,84,88,12,75,16,76,77,72,73,86,78,74,87,79,70,71,80,81,82,83,84,88,16,72,73,74,16,12,75,16,76,77,72,73,78,74,79,70,71,80,81,82,83,84,12,75,16,76,77,72,73,78,74,79,70,71,80,81,82,83,84,78,79,16,83,83,83,83,83,83,83,83,83,78,79,83,73,74,16,16,16,73,74,83,78,79,12,75,16,76,77,72,73,78,74,79,70,71,80,81,82,83,82,16,85,12,12,75,75,16,16,76,77,72,73,86,78,74,87,79,70,71,80,81,82,83,84,88,88,12,75,16,76,77,72,73,86,78,74,87,79,70,71,80,81,82,83,84,88,70,83,80,71,83,73,74,83,12,75,16,76,77,72,73,86,78,74,87,79,70,71,80,81,82,83,84,88,86,87,84,16,82,73,74,72,83,82,72,82,73,74,83,12,16,78,79,83,0,16,72,73,74,16,82,82,82,82,82,80,72,73,74,82,82,80,72,73,74,82,71,72,73,74,73,78,74,79,86,87,84,78,79,12,0,16,73,74,73,74,83,83,16,70,83,83,83,83,83,83,12,85,85,78,79,82,71,80,76,83,73,74,73,12,75,16,76,77,72,73,78,74,79,70,71,80,81,82,83,84,12,75,16,88,74,0,72,73,12,75,16,76,77,72,73,86,78,74,87,79,70,71,80,81,82,83,84,88,12,75,16,76,77,72,73,86,78,74,87,79,70,71,80,81,82,83,84,88,12,75,16,76,77,72,73,86,78,74,87,79,70,71,80,81,82,83,84,88,73,74,82,83,0,85,85,85,85,85,85,85,85,80,83,0,0,0,97,0,97,95,95,96,97,98,95,96,97,98,95,96,97,98,95,96,97,98,95,95,98,98,98,96,97,98,98,95,95,95,96,96,97,98,95,96,97,98,95,95,95,98,95,98,96,97,98,95,95,98,95,98,95,98,98,97,97,98,95,98,95,96,98,95,96,96,96,96,98,98,98,98,95,98,98,98,98,98,98,96,98,98,98,95,98,0,95,98,98,98,96,97,98,95,96,97,98,95,96,97,98,95,96,97,98,95,98,98,0,100,100,100,100,100,100,100,100,100,100,0,0,101,102,101,102,101,101,101,102,101,102,101,101,101,101,102,101,102,101,102,101,101,101,102,101,101,102,102,101,102,101,102,101,102,101,101,103,103,103,103,0,0,0,103,103,104,105,103,104,105,103,104,103,104,103,104,104,103,104,103,104,105,103,104,105,103,104,105,103,105,103,103,104,105,105,103,104,103,104,103,104,103,104,105,103,104,105,103,104,105],"f":"```````{ce{}{}}0000000{bd}{{bf}b}{hh}{bb}{dd}{{ce}j{}{}}004{{}b}5{{hh}f}{ln}{{ln}j}{{hA`}Ab}0{{bA`}Ab}{{dA`}Ab}{{AdA`}Ab}0{Afh}{cc{}}{Ahh}111`?{ce{}{}}000{Ajf}0{Alf}1{{bAl}b}{{bf}b}{{bAn}b}{{}b}{{}d}3{l{{Bb{B`h}}}}{{dl}{{Bb{B`h}}}}5999{cn{}}0{c{{Bb{e}}}{}{}}0000000{Aj{{Bb{fAd}}}}{cBd{}}0009`9``````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````{{BfBh}{{Bl{Bj}}}}{BnC`}{CbC`}`````{Af{{Bl{Cd}}}}{ce{}{}}000000000000000000000000000000000000000000000000000000000000000000000000000000000{Cf{{Bl{Al}}}}`{Ch{{Bl{An}}}}{CjC`}{ClC`}{CnC`}{AfAf}{D`D`}{CdCd}{DbDb}{DdDd}{DfDf}{C`C`}{BnBn}{DhDh}{CfCf}{DjDj}{DlDl}{DnDn}{ClCl}{E`E`}{EbEb}{EdEd}{CnCn}{EfEf}{EhEh}{CjCj}{EjEj}{ElEl}{EnEn}{F`F`}{FbFb}{FdFd}{CbCb}{FfFf}{FhFh}{FjFj}{FlFl}{FnFn}{ChCh}{G`G`}{GbGb}{GdGd}{BfBf}{BhBh}{GfGf}{GhGh}{{ce}j{}{}}0000000000000000000000000000000000000000{{CdCd}Gj}{{DbDb}Gj}```{DhC`}{DnAn}{CdC`}{C`j}{Ejj}2``{{AfAf}f}{{D`D`}f}{{CdCd}f}{{DbDb}f}{{DdDd}f}{{DfDf}f}{{C`C`}f}{{BnBn}f}{{DhDh}f}{{CfCf}f}{{DjDj}f}{{DlDl}f}{{DnDn}f}{{ClCl}f}{{E`E`}f}{{EbEb}f}{{EdEd}f}{{CnCn}f}{{EfEf}f}{{EhEh}f}{{CjCj}f}{{EjEj}f}{{ElEl}f}{{EnEn}f}{{F`F`}f}{{FbFb}f}{{FdFd}f}{{CbCb}f}{{FfFf}f}{{FhFh}f}{{FjFj}f}{{FlFl}f}{{FnFn}f}{{ChCh}f}{{G`G`}f}{{GbGb}f}{{GdGd}f}{{BfBf}f}{{BhBh}f}{{GfGf}f}{{GhGh}f}{{{H`{}{{Gl{c}}{Gn{e}}}}}{{Bb{ce}}}{}{}}{{BfGh}{{Bl{f}}}}{GdC`}{Ch{{Bl{Bf}}}}`{{AfA`}Ab}0{{D`A`}Ab}0{{CdA`}Ab}{{DbA`}Ab}{{DdA`}Ab}{{DfA`}Ab}{{C`A`}Ab}0{{BnA`}Ab}{{DhA`}Ab}{{CfA`}Ab}{{DjA`}Ab}{{DlA`}Ab}{{DnA`}Ab}{{ClA`}Ab}{{E`A`}Ab}{{EbA`}Ab}{{EdA`}Ab}{{CnA`}Ab}{{EfA`}Ab}{{EhA`}Ab}{{CjA`}Ab}{{EjA`}Ab}{{ElA`}Ab}{{EnA`}Ab}{{F`A`}Ab}{{FbA`}Ab}{{FdA`}Ab}{{CbA`}Ab}{{FfA`}Ab}{{FhA`}Ab}{{FjA`}Ab}{{FlA`}Ab}{{FnA`}Ab}{{ChA`}Ab}{{G`A`}Ab}{{GbA`}Ab}{{GdA`}Ab}{{BfA`}Ab}{{BhA`}Ab}{{GfA`}Ab}{{GhA`}Ab}{cc{}}0000000000000000000000000000000000000000{l{{Bl{Ed}}}}`{ChC`}`{ce{}{}}0000000000000000000000000000000000000000{BnC`}{DhC`}{F`El}{Chf}{Cdf}{C`f}{Ehf}{Cnf}{Gff}4{Enf}{Fnf}``{AfD`}````````````{CfC`}`````{{DbDb}Cd}{{BjBjBj}Db}```{{CdCd}{{Bl{Gj}}}}{{DbDb}{{Bl{Gj}}}}{Afl}`{{F`El}j}{FhC`}`{AfCd}{C`Cd}{EjCd}{ElCd}```````````````````{DbCd}{{{H`{}{{Gl{c}}{Gn{e}}}}}j{}{}}0``{ce{}{}}0000000000000000000000000000000000000000{cn{}}00{c{{Bb{e}}}{}{}}000000000000000000000000000000000000000000000000000000000000000000000000000000000{cBd{}}0000000000000000000000000000000000000000{F`Ej}{{C`c}BbH`}{{{H`{}{{Gl{c}}{Gn{e}}}}}{{Bb{je}}}{}{}}0{{{H`{}{{Gl{c}}{Gn{e}}}}Fb}{{Bb{je}}}{}{}}00000{{{H`{}{{Gl{c}}{Gn{e}}}}El}{{Bb{je}}}{}{}}00022{{{H`{}{{Gl{c}}{Gn{e}}}}C`}{{Bb{je}}}{}{}}000{{CdDb}Cd}0``````````::::{HbHd}{HbHb}{HdHd}{{ce}j{}{}}0{{}Hb}{{Hbf}Hb}{{HbA`}Ab}{{HdA`}Ab}{cc{}}03{ce{}{}}0{{HbAn}Hb}6{{}Hd}6{{Hdl}{{Bb{C`Af}}}}{{Hdl}{{Bb{DdAf}}}}44{c{{Bb{e}}}{}{}}000{cBd{}}0`66{{HfA`}Ab}87{{}Hf}{{HfC`c}AbHh}443``````````````````````````````````````````````````````````````````{{{Hj{B`}}}B`}{HlAj}{HlAn}`<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<{HnB`}{I`j}{Ibj}{Idj}{I`B`}{AhAh}{IfIf}{B`B`}{IhIh}{IjIj}{I`I`}{IbIb}{IlIl}{IdId}{InIn}{HlHl}{HnHn}{J`J`}{JbJb}{JdJd}{JfJf}{JhJh}{{ce}j{}{}}0000000000000000{{IlIl}Gj}{{InIn}Gj}{{{Hj{B`}}}B`}{{JfHl}f}{Jff}0000000{{}Il}{{}In}{{}Jf}{{IbIb}j}{{IdId}j}{JbB`}{B`j}{{}B`}{{}Ib}{{}Id}7{IlAj}{InAl}{{AhAh}f}{{IfIf}f}{{B`B`}f}{{IhIh}f}{{IjIj}f}{{I`I`}f}{{IbIb}f}{{IlIl}f}{{IdId}f}{{InIn}f}{{HlHl}f}{{HnHn}f}{{J`J`}f}{{JbJb}f}{{JdJd}f}{{JfJf}f}{JdBj}{{}B`}{{{Jj{}{{Gl{c}}{Gn{e}}}}}{{Bb{ce}}}{}{}}{{AhA`}Ab}0{{IfA`}Ab}0{{B`A`}Ab}0{{IhA`}Ab}{{IjA`}Ab}{{I`A`}Ab}{{IbA`}Ab}{{JlA`}Ab}{{IlA`}Ab}{{IdA`}Ab}{{JnA`}Ab}{{InA`}Ab}{{HlA`}Ab}{{HnA`}Ab}{{J`A`}Ab}{{JbA`}Ab}{{JdA`}Ab}{{JfA`}Ab}{{JhA`}Ab}{{K`A`}Ab}0{cc{}}0000000000000000000{An{{Bl{Hl}}}}{{}Jf}``{{JfHl}Jf}{{IbIb}j}{{IdId}j}{{JfJf}Jf}{ce{}{}}0000000000000000000000{B`Ih}{Jdf}{Ibf}{Idf}{I`f}{Jff}414{IbJl}{IdJn}{JfJh}{AhIf}9{IlBj}{InBj}{JfBj}`{cB`{{Kf{{Kd{{Kb{Al}}}}}}}}{I`{{Bl{{Hj{Al}}}}}}{Ib{{Bl{{Hj{Al}}}}}}{Id{{Bl{{Hj{Al}}}}}}{HlB`}{JdJf}0000`{I`{{Bl{Bj}}}}{Ib{{Bl{Bj}}}}{Id{{Bl{Bj}}}}{Jd{{Bl{Bj}}}}{JdBj}`4321`{I`j}{Ibj}{Idj}{cIb{{Kj{}{{Kh{Il}}}}}}{{AjAj}Il}{cId{{Kj{}{{Kh{In}}}}}}{{AlAl}In}{Jl{{Bl{Il}}}}{Jn{{Bl{In}}}}{Jh{{Bl{Hl}}}}{{IlIl}{{Bl{Gj}}}}{{InIn}{{Bl{Gj}}}}{Ahl}`{B`Jd}{{IbIl}j}{{IdIn}j}{Ib{{Kb{Il}}}}{Id{{Kb{In}}}}{{{Kb{Al}}}Jf}{{JfHl}Jf}{J`B`}{HlHl}{{JfHl}j}{{JfJf}j}100{HlJf}{AhCd}{{{Jj{}{{Gl{c}}{Gn{e}}}}}j{}{}}0{IlAj}{InAl}{Jd{{Bl{Bj}}}}``{Ih{{Kb{B`}}}}{{JfJf}Jf}{{IbIb}j}{{IdId}j}{Ib{{Bl{Id}}}}{ce{}{}}0000000000000000{cn{}}000{Id{{Bl{Ib}}}}`{I`{{Bb{jK`}}}}{Ib{{Bb{jK`}}}}{c{{Bb{e}}}{}{}}000000000000000000000000000000000000000{cBd{}}000000000000000000098{eJd{{Kl{Jd}}}{{Kj{}{{Kh{c}}}}}};{{B`c}BbJj}{{{Jj{}{{Gl{c}}{Gn{e}}}}}{{Bb{je}}}{}{}}000{{{Jj{}{{Gl{c}}{Gn{e}}}}B`}{{Bb{je}}}{}{}}000{{J`B`}J`}{{Jf{Kb{Al}}}j}``````{Kn{{Kb{Al}}}}0========{L`L`}{LbLb}{LdLd}{KnKn}{{ce}j{}{}}000{{KnKn}Gj}{{LdLd}j}0{Ldj}{{}L`}{{}Lb}{{}Ld}{{LdLd}f}{{KnKn}f}{cKn{{Kf{{Hj{Al}}}}}}{{KnKn}j}{{L`B`}Ld}{{L`A`}Ab}{{LbA`}Ab}{{LdA`}Ab}{{KnA`}Ab}{cc{}}00{AjKn}1{AlKn}{cLd{{Kj{}{{Kh{Kn}}}}}}:={ce{}{}}000{Kn{{Hj{Al}}}}{Ldf}{Knf}1011{Lbf}0{{LdBj}j}{{KnBj}j}10{{L`Lb}L`}{Ld{{Bl{Bj}}}}{KnBj}{{L`Bj}L`}000{Ld{{Bl{{Kb{Kn}}}}}}{Ld{{Bl{{Kb{Al}}}}}}0{Ldj}{Knj}1{{LdLd}{{Bl{Bj}}}}7072{{}L`}{eLd{{Lf{{Kb{Al}}}}}{{Kj{}{{Kh{c}}}}}}44{{KnKn}{{Bl{Gj}}}}{{LdKn}j}{AlAl}67{KnLd}8{ce{}{}}000{c{{Bb{e}}}{}{}}0000000{cBd{}}000{{LdLd}j}0`33{{LhA`}Ab}{cc{}}5{{}Lh}{{LhB`c}AbHh}665``7777{LjLl}{{Ljf}Lj}{LjLj}{LlLl}{{ce}j{}{}}03{{}Lj}4{{LjA`}Ab}{{LlA`}Ab}::??{{LjAl}Lj}73{{}Ll}8{ce{}{}}0{{LllC`}{{Bb{B`Ah}}}}{c{{Bb{e}}}{}{}}000{cBd{}}0<<```````{Ln{{Kb{M`}}}}444444{LnLn}{M`M`}<<{{LnLn}Gj}{{M`M`}Gj}`{{LnLn}f}{{M`M`}f}{{LnA`}Ab}{{M`A`}Ab}{{MbA`}Ab}{cc{}}00>>>{Lnc{}}?{LnBj}{{Ln{Kb{Al}}}f}{{M`Al}f}{{AjAj}Mb}{Mb{{Bl{c}}}{}}{{LnLn}{{Bl{Gj}}}}{{M`M`}{{Bl{Gj}}}}{Lnj}`{ce{}{}}0{c{{Bb{e}}}{}{}}00000{cBd{}}00","c":[],"p":[[5,"ParserBuilder",0],[5,"Parser",0],[1,"bool"],[6,"Error",0],[1,"unit"],[1,"str"],[5,"String",1603],[5,"Formatter",1604],[8,"Result",1604],[5,"UnicodeWordError",0],[5,"Error",81],[5,"Error",938],[1,"char"],[1,"u8"],[1,"u32"],[5,"Hir",938],[6,"Result",1605],[5,"TypeId",1606],[5,"Flags",81],[5,"FlagsItem",81],[1,"usize"],[6,"Option",1607],[5,"Alternation",81],[6,"Ast",81],[5,"Assertion",81],[5,"Span",81],[5,"Literal",81],[5,"Group",81],[5,"ClassBracketed",81],[5,"ClassPerl",81],[5,"ClassUnicode",81],[6,"ErrorKind",81],[5,"Position",81],[5,"WithComments",81],[5,"Comment",81],[5,"Concat",81],[6,"LiteralKind",81],[6,"SpecialLiteralKind",81],[6,"HexLiteralKind",81],[6,"ClassPerlKind",81],[5,"ClassAscii",81],[6,"ClassAsciiKind",81],[6,"ClassUnicodeKind",81],[6,"ClassUnicodeOpKind",81],[6,"ClassSet",81],[6,"ClassSetItem",81],[5,"ClassSetRange",81],[5,"ClassSetUnion",81],[5,"ClassSetBinaryOp",81],[6,"ClassSetBinaryOpKind",81],[6,"AssertionKind",81],[5,"Repetition",81],[5,"RepetitionOp",81],[6,"RepetitionKind",81],[6,"RepetitionRange",81],[6,"GroupKind",81],[5,"CaptureName",81],[5,"SetFlags",81],[6,"FlagsItemKind",81],[6,"Flag",81],[6,"Ordering",1608],[17,"Output"],[17,"Err"],[10,"Visitor",81],[5,"ParserBuilder",893],[5,"Parser",893],[5,"Printer",927],[10,"Write",1604],[5,"Vec",1609],[6,"Look",938],[5,"Capture",938],[6,"Class",938],[5,"ClassUnicode",938],[5,"ClassBytes",938],[6,"ErrorKind",938],[6,"HirKind",938],[5,"Literal",938],[5,"ClassUnicodeRange",938],[5,"ClassBytesRange",938],[5,"Repetition",938],[6,"Dot",938],[5,"Properties",938],[5,"LookSet",938],[5,"LookSetIter",938],[10,"Visitor",938],[5,"ClassUnicodeIter",938],[5,"ClassBytesIter",938],[5,"CaseFoldError",938],[1,"slice"],[5,"Box",1610],[10,"Into",1611],[17,"Item"],[10,"IntoIterator",1612],[10,"Borrow",1613],[5,"Literal",1388],[5,"Extractor",1388],[6,"ExtractKind",1388],[5,"Seq",1388],[10,"AsRef",1611],[5,"Printer",1501],[5,"TranslatorBuilder",1512],[5,"Translator",1512],[6,"Utf8Sequence",1549],[5,"Utf8Range",1549],[5,"Utf8Sequences",1549],[15,"NamedValue",885],[15,"FlagDuplicate",888],[15,"FlagRepeatedNegation",888],[15,"GroupNameDuplicate",888],[15,"CaptureName",891]],"b":[[29,"impl-Debug-for-Error"],[30,"impl-Display-for-Error"],[33,"impl-Display-for-UnicodeWordError"],[34,"impl-Debug-for-UnicodeWordError"],[35,"impl-From%3CError%3E-for-Error"],[37,"impl-From%3CError%3E-for-Error"],[493,"impl-Display-for-Error"],[494,"impl-Debug-for-Error"],[495,"impl-Display-for-ErrorKind"],[496,"impl-Debug-for-ErrorKind"],[501,"impl-Debug-for-Ast"],[502,"impl-Display-for-Ast"],[1131,"impl-Debug-for-Error"],[1132,"impl-Display-for-Error"],[1133,"impl-Debug-for-ErrorKind"],[1134,"impl-Display-for-ErrorKind"],[1135,"impl-Debug-for-Hir"],[1136,"impl-Display-for-Hir"],[1153,"impl-Display-for-CaseFoldError"],[1154,"impl-Debug-for-CaseFoldError"],[1431,"impl-From%3Cchar%3E-for-Literal"],[1433,"impl-From%3Cu8%3E-for-Literal"]]}],\ ["ryu",{"doc":"github crates-io docs-rs","t":"FKNNNNNNNNNCNNNHH","n":["Buffer","Float","borrow","borrow_mut","clone","default","format","format_finite","from","into","new","raw","try_from","try_into","type_id","format32","format64"],"q":[[0,"ryu"],[15,"ryu::raw"],[17,"core::result"],[18,"core::any"]],"d":["Safe API for formatting floating point numbers to text.","A floating point number, f32 or f64, that can be written …","","","","","Print a floating point number into this buffer and return …","Print a floating point number into this buffer and return …","Returns the argument unchanged.","Calls U::from(self).","This is a cheap operation; you don’t need to worry about …","Unsafe functions that mirror the API of the C …","","","","Print f32 to the given buffer and return number of bytes …","Print f64 to the given buffer and return number of bytes …"],"i":[0,0,1,1,1,1,1,1,1,1,1,0,1,1,1,0,0],"f":"``{ce{}{}}0{bb}{{}b}{{bc}df}0{cc{}}42`{c{{h{e}}}{}{}}0{cj{}}{{ln}A`}{{Abn}A`}","c":[],"p":[[5,"Buffer",0],[1,"str"],[10,"Float",0],[6,"Result",17],[5,"TypeId",18],[1,"f32"],[1,"u8"],[1,"usize"],[1,"f64"]],"b":[]}],\ -["serde",{"doc":"Serde","t":"KYKRRRKYRRRRRRRKNNNCMMMMMMMMMNMMMMMMMMMMMMMMMNMMMMMMQNNCMMMMMMNMMMMMMMMMMMMMMMMNMMMMMMMPPPKKKKRPKKRRRRRKPFKPKPPPPPKPEPPPGPPPRRRKKNNNNNNNNMNMMNMMMMMMMMNMMMMMMMMMMMMMMMNMMMMMMNNNMNMNNNNNNNNNMNNNNNNMNMNNNMNMNNMNNNNNNNMNNMNNCNMNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNFFFFFFFFFFFFFFFFFFFFFFFFFFFFFNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNKRRRRRRRRFRRRRRRRRKKRKRKRKRKRKRKRKENNNNNMMMMMMMMNNNNNNNNNNMMMMMMNNNMMMMMMNNNNNMMMMMNMMMMMMMMMMMMNMMMMMMMMNNNNNN","n":["Deserialize","Deserialize","Deserializer","Error","Error","Ok","Serialize","Serialize","SerializeMap","SerializeSeq","SerializeStruct","SerializeStructVariant","SerializeTuple","SerializeTupleStruct","SerializeTupleVariant","Serializer","collect_map","collect_seq","collect_str","de","deserialize","deserialize_any","deserialize_bool","deserialize_byte_buf","deserialize_bytes","deserialize_char","deserialize_enum","deserialize_f32","deserialize_f64","deserialize_i128","deserialize_i16","deserialize_i32","deserialize_i64","deserialize_i8","deserialize_identifier","deserialize_ignored_any","deserialize_map","deserialize_newtype_struct","deserialize_option","deserialize_seq","deserialize_str","deserialize_string","deserialize_struct","deserialize_tuple","deserialize_tuple_struct","deserialize_u128","deserialize_u16","deserialize_u32","deserialize_u64","deserialize_u8","deserialize_unit","deserialize_unit_struct","forward_to_deserialize_any","is_human_readable","is_human_readable","ser","serialize","serialize_bool","serialize_bytes","serialize_char","serialize_f32","serialize_f64","serialize_i128","serialize_i16","serialize_i32","serialize_i64","serialize_i8","serialize_map","serialize_newtype_struct","serialize_newtype_variant","serialize_none","serialize_seq","serialize_some","serialize_str","serialize_struct","serialize_struct_variant","serialize_tuple","serialize_tuple_struct","serialize_tuple_variant","serialize_u128","serialize_u16","serialize_u32","serialize_u64","serialize_u8","serialize_unit","serialize_unit_struct","serialize_unit_variant","Bool","Bytes","Char","Deserialize","DeserializeOwned","DeserializeSeed","Deserializer","Deserializer","Enum","EnumAccess","Error","Error","Error","Error","Error","Error","Expected","Float","IgnoredAny","IntoDeserializer","Map","MapAccess","NewtypeStruct","NewtypeVariant","Option","Other","Seq","SeqAccess","Signed","StdError","Str","StructVariant","TupleVariant","Unexpected","Unit","UnitVariant","Unsigned","Value","Value","Variant","VariantAccess","Visitor","borrow","borrow","borrow_mut","borrow_mut","clone","clone","clone_into","clone_into","custom","default","deserialize","deserialize","deserialize","deserialize_any","deserialize_bool","deserialize_byte_buf","deserialize_bytes","deserialize_char","deserialize_enum","deserialize_f32","deserialize_f64","deserialize_i128","deserialize_i16","deserialize_i32","deserialize_i64","deserialize_i8","deserialize_identifier","deserialize_ignored_any","deserialize_map","deserialize_newtype_struct","deserialize_option","deserialize_seq","deserialize_str","deserialize_string","deserialize_struct","deserialize_tuple","deserialize_tuple_struct","deserialize_u128","deserialize_u16","deserialize_u32","deserialize_u64","deserialize_u8","deserialize_unit","deserialize_unit_struct","duplicate_field","eq","eq","expecting","expecting","fmt","fmt","fmt","fmt","fmt","fmt","from","from","into","into","into_deserializer","invalid_length","invalid_type","invalid_value","is_human_readable","missing_field","newtype_variant","newtype_variant_seed","next_element","next_element_seed","next_entry","next_entry_seed","next_key","next_key_seed","next_value","next_value_seed","size_hint","size_hint","struct_variant","to_owned","to_owned","to_string","try_from","try_from","try_into","try_into","tuple_variant","type_id","type_id","unit_variant","unknown_field","unknown_variant","value","variant","variant_seed","visit_bool","visit_bool","visit_borrowed_bytes","visit_borrowed_str","visit_byte_buf","visit_bytes","visit_bytes","visit_char","visit_enum","visit_enum","visit_f32","visit_f64","visit_f64","visit_i128","visit_i128","visit_i16","visit_i32","visit_i64","visit_i64","visit_i8","visit_map","visit_map","visit_newtype_struct","visit_newtype_struct","visit_none","visit_none","visit_seq","visit_seq","visit_some","visit_some","visit_str","visit_str","visit_string","visit_u128","visit_u128","visit_u16","visit_u32","visit_u64","visit_u64","visit_u8","visit_unit","visit_unit","BoolDeserializer","BorrowedBytesDeserializer","BorrowedStrDeserializer","BytesDeserializer","CharDeserializer","CowStrDeserializer","EnumAccessDeserializer","Error","F32Deserializer","F64Deserializer","I128Deserializer","I16Deserializer","I32Deserializer","I64Deserializer","I8Deserializer","IsizeDeserializer","MapAccessDeserializer","MapDeserializer","SeqAccessDeserializer","SeqDeserializer","StrDeserializer","StringDeserializer","U128Deserializer","U16Deserializer","U32Deserializer","U64Deserializer","U8Deserializer","UnitDeserializer","UsizeDeserializer","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","custom","custom","description","deserialize_any","deserialize_any","deserialize_any","deserialize_any","deserialize_any","deserialize_any","deserialize_any","deserialize_any","deserialize_any","deserialize_any","deserialize_any","deserialize_any","deserialize_any","deserialize_any","deserialize_any","deserialize_any","deserialize_any","deserialize_any","deserialize_any","deserialize_any","deserialize_any","deserialize_any","deserialize_any","deserialize_any","deserialize_any","deserialize_any","deserialize_any","deserialize_any","deserialize_bool","deserialize_bool","deserialize_bool","deserialize_bool","deserialize_bool","deserialize_bool","deserialize_bool","deserialize_bool","deserialize_bool","deserialize_bool","deserialize_bool","deserialize_bool","deserialize_bool","deserialize_bool","deserialize_bool","deserialize_bool","deserialize_bool","deserialize_bool","deserialize_bool","deserialize_bool","deserialize_bool","deserialize_bool","deserialize_bool","deserialize_bool","deserialize_bool","deserialize_bool","deserialize_bool","deserialize_bool","deserialize_byte_buf","deserialize_byte_buf","deserialize_byte_buf","deserialize_byte_buf","deserialize_byte_buf","deserialize_byte_buf","deserialize_byte_buf","deserialize_byte_buf","deserialize_byte_buf","deserialize_byte_buf","deserialize_byte_buf","deserialize_byte_buf","deserialize_byte_buf","deserialize_byte_buf","deserialize_byte_buf","deserialize_byte_buf","deserialize_byte_buf","deserialize_byte_buf","deserialize_byte_buf","deserialize_byte_buf","deserialize_byte_buf","deserialize_byte_buf","deserialize_byte_buf","deserialize_byte_buf","deserialize_byte_buf","deserialize_byte_buf","deserialize_byte_buf","deserialize_byte_buf","deserialize_bytes","deserialize_bytes","deserialize_bytes","deserialize_bytes","deserialize_bytes","deserialize_bytes","deserialize_bytes","deserialize_bytes","deserialize_bytes","deserialize_bytes","deserialize_bytes","deserialize_bytes","deserialize_bytes","deserialize_bytes","deserialize_bytes","deserialize_bytes","deserialize_bytes","deserialize_bytes","deserialize_bytes","deserialize_bytes","deserialize_bytes","deserialize_bytes","deserialize_bytes","deserialize_bytes","deserialize_bytes","deserialize_bytes","deserialize_bytes","deserialize_bytes","deserialize_char","deserialize_char","deserialize_char","deserialize_char","deserialize_char","deserialize_char","deserialize_char","deserialize_char","deserialize_char","deserialize_char","deserialize_char","deserialize_char","deserialize_char","deserialize_char","deserialize_char","deserialize_char","deserialize_char","deserialize_char","deserialize_char","deserialize_char","deserialize_char","deserialize_char","deserialize_char","deserialize_char","deserialize_char","deserialize_char","deserialize_char","deserialize_char","deserialize_enum","deserialize_enum","deserialize_enum","deserialize_enum","deserialize_enum","deserialize_enum","deserialize_enum","deserialize_enum","deserialize_enum","deserialize_enum","deserialize_enum","deserialize_enum","deserialize_enum","deserialize_enum","deserialize_enum","deserialize_enum","deserialize_enum","deserialize_enum","deserialize_enum","deserialize_enum","deserialize_enum","deserialize_enum","deserialize_enum","deserialize_enum","deserialize_enum","deserialize_enum","deserialize_enum","deserialize_enum","deserialize_f32","deserialize_f32","deserialize_f32","deserialize_f32","deserialize_f32","deserialize_f32","deserialize_f32","deserialize_f32","deserialize_f32","deserialize_f32","deserialize_f32","deserialize_f32","deserialize_f32","deserialize_f32","deserialize_f32","deserialize_f32","deserialize_f32","deserialize_f32","deserialize_f32","deserialize_f32","deserialize_f32","deserialize_f32","deserialize_f32","deserialize_f32","deserialize_f32","deserialize_f32","deserialize_f32","deserialize_f32","deserialize_f64","deserialize_f64","deserialize_f64","deserialize_f64","deserialize_f64","deserialize_f64","deserialize_f64","deserialize_f64","deserialize_f64","deserialize_f64","deserialize_f64","deserialize_f64","deserialize_f64","deserialize_f64","deserialize_f64","deserialize_f64","deserialize_f64","deserialize_f64","deserialize_f64","deserialize_f64","deserialize_f64","deserialize_f64","deserialize_f64","deserialize_f64","deserialize_f64","deserialize_f64","deserialize_f64","deserialize_f64","deserialize_i128","deserialize_i128","deserialize_i128","deserialize_i128","deserialize_i128","deserialize_i128","deserialize_i128","deserialize_i128","deserialize_i128","deserialize_i128","deserialize_i128","deserialize_i128","deserialize_i128","deserialize_i128","deserialize_i128","deserialize_i128","deserialize_i128","deserialize_i128","deserialize_i128","deserialize_i128","deserialize_i128","deserialize_i128","deserialize_i128","deserialize_i128","deserialize_i128","deserialize_i128","deserialize_i128","deserialize_i128","deserialize_i16","deserialize_i16","deserialize_i16","deserialize_i16","deserialize_i16","deserialize_i16","deserialize_i16","deserialize_i16","deserialize_i16","deserialize_i16","deserialize_i16","deserialize_i16","deserialize_i16","deserialize_i16","deserialize_i16","deserialize_i16","deserialize_i16","deserialize_i16","deserialize_i16","deserialize_i16","deserialize_i16","deserialize_i16","deserialize_i16","deserialize_i16","deserialize_i16","deserialize_i16","deserialize_i16","deserialize_i16","deserialize_i32","deserialize_i32","deserialize_i32","deserialize_i32","deserialize_i32","deserialize_i32","deserialize_i32","deserialize_i32","deserialize_i32","deserialize_i32","deserialize_i32","deserialize_i32","deserialize_i32","deserialize_i32","deserialize_i32","deserialize_i32","deserialize_i32","deserialize_i32","deserialize_i32","deserialize_i32","deserialize_i32","deserialize_i32","deserialize_i32","deserialize_i32","deserialize_i32","deserialize_i32","deserialize_i32","deserialize_i32","deserialize_i64","deserialize_i64","deserialize_i64","deserialize_i64","deserialize_i64","deserialize_i64","deserialize_i64","deserialize_i64","deserialize_i64","deserialize_i64","deserialize_i64","deserialize_i64","deserialize_i64","deserialize_i64","deserialize_i64","deserialize_i64","deserialize_i64","deserialize_i64","deserialize_i64","deserialize_i64","deserialize_i64","deserialize_i64","deserialize_i64","deserialize_i64","deserialize_i64","deserialize_i64","deserialize_i64","deserialize_i64","deserialize_i8","deserialize_i8","deserialize_i8","deserialize_i8","deserialize_i8","deserialize_i8","deserialize_i8","deserialize_i8","deserialize_i8","deserialize_i8","deserialize_i8","deserialize_i8","deserialize_i8","deserialize_i8","deserialize_i8","deserialize_i8","deserialize_i8","deserialize_i8","deserialize_i8","deserialize_i8","deserialize_i8","deserialize_i8","deserialize_i8","deserialize_i8","deserialize_i8","deserialize_i8","deserialize_i8","deserialize_i8","deserialize_identifier","deserialize_identifier","deserialize_identifier","deserialize_identifier","deserialize_identifier","deserialize_identifier","deserialize_identifier","deserialize_identifier","deserialize_identifier","deserialize_identifier","deserialize_identifier","deserialize_identifier","deserialize_identifier","deserialize_identifier","deserialize_identifier","deserialize_identifier","deserialize_identifier","deserialize_identifier","deserialize_identifier","deserialize_identifier","deserialize_identifier","deserialize_identifier","deserialize_identifier","deserialize_identifier","deserialize_identifier","deserialize_identifier","deserialize_identifier","deserialize_identifier","deserialize_ignored_any","deserialize_ignored_any","deserialize_ignored_any","deserialize_ignored_any","deserialize_ignored_any","deserialize_ignored_any","deserialize_ignored_any","deserialize_ignored_any","deserialize_ignored_any","deserialize_ignored_any","deserialize_ignored_any","deserialize_ignored_any","deserialize_ignored_any","deserialize_ignored_any","deserialize_ignored_any","deserialize_ignored_any","deserialize_ignored_any","deserialize_ignored_any","deserialize_ignored_any","deserialize_ignored_any","deserialize_ignored_any","deserialize_ignored_any","deserialize_ignored_any","deserialize_ignored_any","deserialize_ignored_any","deserialize_ignored_any","deserialize_ignored_any","deserialize_ignored_any","deserialize_map","deserialize_map","deserialize_map","deserialize_map","deserialize_map","deserialize_map","deserialize_map","deserialize_map","deserialize_map","deserialize_map","deserialize_map","deserialize_map","deserialize_map","deserialize_map","deserialize_map","deserialize_map","deserialize_map","deserialize_map","deserialize_map","deserialize_map","deserialize_map","deserialize_map","deserialize_map","deserialize_map","deserialize_map","deserialize_map","deserialize_map","deserialize_map","deserialize_newtype_struct","deserialize_newtype_struct","deserialize_newtype_struct","deserialize_newtype_struct","deserialize_newtype_struct","deserialize_newtype_struct","deserialize_newtype_struct","deserialize_newtype_struct","deserialize_newtype_struct","deserialize_newtype_struct","deserialize_newtype_struct","deserialize_newtype_struct","deserialize_newtype_struct","deserialize_newtype_struct","deserialize_newtype_struct","deserialize_newtype_struct","deserialize_newtype_struct","deserialize_newtype_struct","deserialize_newtype_struct","deserialize_newtype_struct","deserialize_newtype_struct","deserialize_newtype_struct","deserialize_newtype_struct","deserialize_newtype_struct","deserialize_newtype_struct","deserialize_newtype_struct","deserialize_newtype_struct","deserialize_newtype_struct","deserialize_option","deserialize_option","deserialize_option","deserialize_option","deserialize_option","deserialize_option","deserialize_option","deserialize_option","deserialize_option","deserialize_option","deserialize_option","deserialize_option","deserialize_option","deserialize_option","deserialize_option","deserialize_option","deserialize_option","deserialize_option","deserialize_option","deserialize_option","deserialize_option","deserialize_option","deserialize_option","deserialize_option","deserialize_option","deserialize_option","deserialize_option","deserialize_option","deserialize_seq","deserialize_seq","deserialize_seq","deserialize_seq","deserialize_seq","deserialize_seq","deserialize_seq","deserialize_seq","deserialize_seq","deserialize_seq","deserialize_seq","deserialize_seq","deserialize_seq","deserialize_seq","deserialize_seq","deserialize_seq","deserialize_seq","deserialize_seq","deserialize_seq","deserialize_seq","deserialize_seq","deserialize_seq","deserialize_seq","deserialize_seq","deserialize_seq","deserialize_seq","deserialize_seq","deserialize_seq","deserialize_str","deserialize_str","deserialize_str","deserialize_str","deserialize_str","deserialize_str","deserialize_str","deserialize_str","deserialize_str","deserialize_str","deserialize_str","deserialize_str","deserialize_str","deserialize_str","deserialize_str","deserialize_str","deserialize_str","deserialize_str","deserialize_str","deserialize_str","deserialize_str","deserialize_str","deserialize_str","deserialize_str","deserialize_str","deserialize_str","deserialize_str","deserialize_str","deserialize_string","deserialize_string","deserialize_string","deserialize_string","deserialize_string","deserialize_string","deserialize_string","deserialize_string","deserialize_string","deserialize_string","deserialize_string","deserialize_string","deserialize_string","deserialize_string","deserialize_string","deserialize_string","deserialize_string","deserialize_string","deserialize_string","deserialize_string","deserialize_string","deserialize_string","deserialize_string","deserialize_string","deserialize_string","deserialize_string","deserialize_string","deserialize_string","deserialize_struct","deserialize_struct","deserialize_struct","deserialize_struct","deserialize_struct","deserialize_struct","deserialize_struct","deserialize_struct","deserialize_struct","deserialize_struct","deserialize_struct","deserialize_struct","deserialize_struct","deserialize_struct","deserialize_struct","deserialize_struct","deserialize_struct","deserialize_struct","deserialize_struct","deserialize_struct","deserialize_struct","deserialize_struct","deserialize_struct","deserialize_struct","deserialize_struct","deserialize_struct","deserialize_struct","deserialize_struct","deserialize_tuple","deserialize_tuple","deserialize_tuple","deserialize_tuple","deserialize_tuple","deserialize_tuple","deserialize_tuple","deserialize_tuple","deserialize_tuple","deserialize_tuple","deserialize_tuple","deserialize_tuple","deserialize_tuple","deserialize_tuple","deserialize_tuple","deserialize_tuple","deserialize_tuple","deserialize_tuple","deserialize_tuple","deserialize_tuple","deserialize_tuple","deserialize_tuple","deserialize_tuple","deserialize_tuple","deserialize_tuple","deserialize_tuple","deserialize_tuple","deserialize_tuple","deserialize_tuple_struct","deserialize_tuple_struct","deserialize_tuple_struct","deserialize_tuple_struct","deserialize_tuple_struct","deserialize_tuple_struct","deserialize_tuple_struct","deserialize_tuple_struct","deserialize_tuple_struct","deserialize_tuple_struct","deserialize_tuple_struct","deserialize_tuple_struct","deserialize_tuple_struct","deserialize_tuple_struct","deserialize_tuple_struct","deserialize_tuple_struct","deserialize_tuple_struct","deserialize_tuple_struct","deserialize_tuple_struct","deserialize_tuple_struct","deserialize_tuple_struct","deserialize_tuple_struct","deserialize_tuple_struct","deserialize_tuple_struct","deserialize_tuple_struct","deserialize_tuple_struct","deserialize_tuple_struct","deserialize_tuple_struct","deserialize_u128","deserialize_u128","deserialize_u128","deserialize_u128","deserialize_u128","deserialize_u128","deserialize_u128","deserialize_u128","deserialize_u128","deserialize_u128","deserialize_u128","deserialize_u128","deserialize_u128","deserialize_u128","deserialize_u128","deserialize_u128","deserialize_u128","deserialize_u128","deserialize_u128","deserialize_u128","deserialize_u128","deserialize_u128","deserialize_u128","deserialize_u128","deserialize_u128","deserialize_u128","deserialize_u128","deserialize_u128","deserialize_u16","deserialize_u16","deserialize_u16","deserialize_u16","deserialize_u16","deserialize_u16","deserialize_u16","deserialize_u16","deserialize_u16","deserialize_u16","deserialize_u16","deserialize_u16","deserialize_u16","deserialize_u16","deserialize_u16","deserialize_u16","deserialize_u16","deserialize_u16","deserialize_u16","deserialize_u16","deserialize_u16","deserialize_u16","deserialize_u16","deserialize_u16","deserialize_u16","deserialize_u16","deserialize_u16","deserialize_u16","deserialize_u32","deserialize_u32","deserialize_u32","deserialize_u32","deserialize_u32","deserialize_u32","deserialize_u32","deserialize_u32","deserialize_u32","deserialize_u32","deserialize_u32","deserialize_u32","deserialize_u32","deserialize_u32","deserialize_u32","deserialize_u32","deserialize_u32","deserialize_u32","deserialize_u32","deserialize_u32","deserialize_u32","deserialize_u32","deserialize_u32","deserialize_u32","deserialize_u32","deserialize_u32","deserialize_u32","deserialize_u32","deserialize_u64","deserialize_u64","deserialize_u64","deserialize_u64","deserialize_u64","deserialize_u64","deserialize_u64","deserialize_u64","deserialize_u64","deserialize_u64","deserialize_u64","deserialize_u64","deserialize_u64","deserialize_u64","deserialize_u64","deserialize_u64","deserialize_u64","deserialize_u64","deserialize_u64","deserialize_u64","deserialize_u64","deserialize_u64","deserialize_u64","deserialize_u64","deserialize_u64","deserialize_u64","deserialize_u64","deserialize_u64","deserialize_u8","deserialize_u8","deserialize_u8","deserialize_u8","deserialize_u8","deserialize_u8","deserialize_u8","deserialize_u8","deserialize_u8","deserialize_u8","deserialize_u8","deserialize_u8","deserialize_u8","deserialize_u8","deserialize_u8","deserialize_u8","deserialize_u8","deserialize_u8","deserialize_u8","deserialize_u8","deserialize_u8","deserialize_u8","deserialize_u8","deserialize_u8","deserialize_u8","deserialize_u8","deserialize_u8","deserialize_u8","deserialize_unit","deserialize_unit","deserialize_unit","deserialize_unit","deserialize_unit","deserialize_unit","deserialize_unit","deserialize_unit","deserialize_unit","deserialize_unit","deserialize_unit","deserialize_unit","deserialize_unit","deserialize_unit","deserialize_unit","deserialize_unit","deserialize_unit","deserialize_unit","deserialize_unit","deserialize_unit","deserialize_unit","deserialize_unit","deserialize_unit","deserialize_unit","deserialize_unit","deserialize_unit","deserialize_unit","deserialize_unit","deserialize_unit_struct","deserialize_unit_struct","deserialize_unit_struct","deserialize_unit_struct","deserialize_unit_struct","deserialize_unit_struct","deserialize_unit_struct","deserialize_unit_struct","deserialize_unit_struct","deserialize_unit_struct","deserialize_unit_struct","deserialize_unit_struct","deserialize_unit_struct","deserialize_unit_struct","deserialize_unit_struct","deserialize_unit_struct","deserialize_unit_struct","deserialize_unit_struct","deserialize_unit_struct","deserialize_unit_struct","deserialize_unit_struct","deserialize_unit_struct","deserialize_unit_struct","deserialize_unit_struct","deserialize_unit_struct","deserialize_unit_struct","deserialize_unit_struct","deserialize_unit_struct","end","end","eq","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","new","new","new","new","new","new","new","new","new","new","new","new","new","new","new","new","new","new","new","new","new","new","new","new","new","new","new","new","next_element_seed","next_element_seed","next_entry_seed","next_key_seed","next_value_seed","size_hint","size_hint","size_hint","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_string","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","variant_seed","variant_seed","variant_seed","variant_seed","variant_seed","variant_seed","Error","Error","Error","Error","Error","Error","Error","Error","Error","Impossible","Ok","Ok","Ok","Ok","Ok","Ok","Ok","Ok","Serialize","SerializeMap","SerializeMap","SerializeSeq","SerializeSeq","SerializeStruct","SerializeStruct","SerializeStructVariant","SerializeStructVariant","SerializeTuple","SerializeTuple","SerializeTupleStruct","SerializeTupleStruct","SerializeTupleVariant","SerializeTupleVariant","Serializer","StdError","borrow","borrow_mut","collect_map","collect_seq","collect_str","custom","end","end","end","end","end","end","end","end","end","end","end","end","end","end","from","into","is_human_readable","serialize","serialize_bool","serialize_bytes","serialize_char","serialize_element","serialize_element","serialize_element","serialize_element","serialize_entry","serialize_f32","serialize_f64","serialize_field","serialize_field","serialize_field","serialize_field","serialize_field","serialize_field","serialize_field","serialize_field","serialize_i128","serialize_i16","serialize_i32","serialize_i64","serialize_i8","serialize_key","serialize_key","serialize_map","serialize_newtype_struct","serialize_newtype_variant","serialize_none","serialize_seq","serialize_some","serialize_str","serialize_struct","serialize_struct_variant","serialize_tuple","serialize_tuple_struct","serialize_tuple_variant","serialize_u128","serialize_u16","serialize_u32","serialize_u64","serialize_u8","serialize_unit","serialize_unit_struct","serialize_unit_variant","serialize_value","serialize_value","skip_field","skip_field","try_from","try_into","type_id"],"q":[[0,"serde"],[87,"serde::de"],[265,"serde::de::value"],[1531,"serde::ser"],[1642,"core::result"],[1643,"core::iter::traits::collect"],[1644,"core::marker"],[1645,"core::fmt"],[1646,"core::option"],[1647,"core::fmt"],[1648,"core::any"],[1649,"alloc::vec"],[1650,"core::iter::traits::iterator"],[1651,"core::clone"],[1652,"core::fmt"]],"d":["A data structure that can be deserialized from any data …","Derive macro available if serde is built with …","A data format that can deserialize any data structure …","The error type that can be returned if some error occurs …","The error type when some error occurs during serialization.","The output type produced by this Serializer during …","A data structure that can be serialized into any data …","Derive macro available if serde is built with …","Type returned from serialize_map for serializing the …","Type returned from serialize_seq for serializing the …","Type returned from serialize_struct for serializing the …","Type returned from serialize_struct_variant for …","Type returned from serialize_tuple for serializing the …","Type returned from serialize_tuple_struct for serializing …","Type returned from serialize_tuple_variant for serializing …","A data format that can serialize any data structure …","Collect an iterator as a map.","Collect an iterator as a sequence.","Serialize a string produced by an implementation of Display…","Generic data structure deserialization framework.","Deserialize this value from the given Serde deserializer.","Require the Deserializer to figure out how to drive the …","Hint that the Deserialize type is expecting a bool value.","Hint that the Deserialize type is expecting a byte array …","Hint that the Deserialize type is expecting a byte array …","Hint that the Deserialize type is expecting a char value.","Hint that the Deserialize type is expecting an enum value …","Hint that the Deserialize type is expecting a f32 value.","Hint that the Deserialize type is expecting a f64 value.","Hint that the Deserialize type is expecting an i128 value.","Hint that the Deserialize type is expecting an i16 value.","Hint that the Deserialize type is expecting an i32 value.","Hint that the Deserialize type is expecting an i64 value.","Hint that the Deserialize type is expecting an i8 value.","Hint that the Deserialize type is expecting the name of a …","Hint that the Deserialize type needs to deserialize a …","Hint that the Deserialize type is expecting a map of …","Hint that the Deserialize type is expecting a newtype …","Hint that the Deserialize type is expecting an optional …","Hint that the Deserialize type is expecting a sequence of …","Hint that the Deserialize type is expecting a string value …","Hint that the Deserialize type is expecting a string value …","Hint that the Deserialize type is expecting a struct with …","Hint that the Deserialize type is expecting a sequence of …","Hint that the Deserialize type is expecting a tuple struct …","Hint that the Deserialize type is expecting an u128 value.","Hint that the Deserialize type is expecting a u16 value.","Hint that the Deserialize type is expecting a u32 value.","Hint that the Deserialize type is expecting a u64 value.","Hint that the Deserialize type is expecting a u8 value.","Hint that the Deserialize type is expecting a unit value.","Hint that the Deserialize type is expecting a unit struct …","Helper macro when implementing the Deserializer part of a …","Determine whether Deserialize implementations should …","Determine whether Serialize implementations should …","Generic data structure serialization framework.","Serialize this value into the given Serde serializer.","Serialize a bool value.","Serialize a chunk of raw byte data.","Serialize a character.","Serialize an f32 value.","Serialize an f64 value.","Serialize an i128 value.","Serialize an i16 value.","Serialize an i32 value.","Serialize an i64 value.","Serialize an i8 value.","Begin to serialize a map. This call must be followed by …","Serialize a newtype struct like struct Millimeters(u8).","Serialize a newtype variant like E::N in enum E { N(u8) }.","Serialize a None value.","Begin to serialize a variably sized sequence. This call …","Serialize a Some(T) value.","Serialize a &str.","Begin to serialize a struct like …","Begin to serialize a struct variant like E::S in …","Begin to serialize a statically sized sequence whose …","Begin to serialize a tuple struct like …","Begin to serialize a tuple variant like E::T in …","Serialize a u128 value.","Serialize a u16 value.","Serialize a u32 value.","Serialize a u64 value.","Serialize a u8 value.","Serialize a () value.","Serialize a unit struct like struct Unit or PhantomData<T>.","Serialize a unit variant like E::A in enum E { A, B }.","The input contained a boolean value that was not expected.","The input contained a &[u8] or Vec<u8> that was not …","The input contained a char that was not expected.","A data structure that can be deserialized from any data …","A data structure that can be deserialized without …","DeserializeSeed is the stateful form of the Deserialize …","A data format that can deserialize any data structure …","The type of the deserializer being converted into.","The input contained an enum that was not expected.","Provides a Visitor access to the data of an enum in the …","The Error trait allows Deserialize implementations to …","The error type that can be returned if some error occurs …","The error type that can be returned if some error occurs …","The error type that can be returned if some error occurs …","The error type that can be returned if some error occurs …","The error type that can be returned if some error occurs …","Expected represents an explanation of what data a Visitor …","The input contained a floating point f32 or f64 that was …","An efficient way of discarding data from a deserializer.","Converts an existing value into a Deserializer from which …","The input contained a map that was not expected.","Provides a Visitor access to each entry of a map in the …","The input contained a newtype struct that was not expected.","The input contained a newtype variant that was not …","The input contained an Option<T> that was not expected.","A message stating what uncategorized thing the input …","The input contained a sequence that was not expected.","Provides a Visitor access to each element of a sequence in …","The input contained a signed integer i8, i16, i32 or i64 …","","The input contained a &str or String that was not expected.","The input contained a struct variant that was not expected.","The input contained a tuple variant that was not expected.","Unexpected represents an unexpected invocation of any one …","The input contained a unit () that was not expected.","The input contained a unit variant that was not expected.","The input contained an unsigned integer u8, u16, u32 or u64…","The type produced by using this seed.","The value produced by this visitor.","The Visitor that will be used to deserialize the content …","VariantAccess is a visitor that is created by the …","This trait represents a visitor that walks through a …","","","","","","","","","Raised when there is general error when deserializing a …","","Deserialize this value from the given Serde deserializer.","Equivalent to the more common Deserialize::deserialize …","","Require the Deserializer to figure out how to drive the …","Hint that the Deserialize type is expecting a bool value.","Hint that the Deserialize type is expecting a byte array …","Hint that the Deserialize type is expecting a byte array …","Hint that the Deserialize type is expecting a char value.","Hint that the Deserialize type is expecting an enum value …","Hint that the Deserialize type is expecting a f32 value.","Hint that the Deserialize type is expecting a f64 value.","Hint that the Deserialize type is expecting an i128 value.","Hint that the Deserialize type is expecting an i16 value.","Hint that the Deserialize type is expecting an i32 value.","Hint that the Deserialize type is expecting an i64 value.","Hint that the Deserialize type is expecting an i8 value.","Hint that the Deserialize type is expecting the name of a …","Hint that the Deserialize type needs to deserialize a …","Hint that the Deserialize type is expecting a map of …","Hint that the Deserialize type is expecting a newtype …","Hint that the Deserialize type is expecting an optional …","Hint that the Deserialize type is expecting a sequence of …","Hint that the Deserialize type is expecting a string value …","Hint that the Deserialize type is expecting a string value …","Hint that the Deserialize type is expecting a struct with …","Hint that the Deserialize type is expecting a sequence of …","Hint that the Deserialize type is expecting a tuple struct …","Hint that the Deserialize type is expecting an u128 value.","Hint that the Deserialize type is expecting a u16 value.","Hint that the Deserialize type is expecting a u32 value.","Hint that the Deserialize type is expecting a u64 value.","Hint that the Deserialize type is expecting a u8 value.","Hint that the Deserialize type is expecting a unit value.","Hint that the Deserialize type is expecting a unit struct …","Raised when a Deserialize struct type received more than …","","","Format a message stating what data this Visitor expects to …","","Format an explanation of what data was being expected. …","","","","","","Returns the argument unchanged.","Returns the argument unchanged.","Calls U::from(self).","Calls U::from(self).","Convert this value into a deserializer.","Raised when deserializing a sequence or map and the input …","Raised when a Deserialize receives a type different from …","Raised when a Deserialize receives a value of the right …","Determine whether Deserialize implementations should …","Raised when a Deserialize struct type expected to receive …","Called when deserializing a variant with a single value.","Called when deserializing a variant with a single value.","This returns Ok(Some(value)) for the next value in the …","This returns Ok(Some(value)) for the next value in the …","This returns Ok(Some((key, value))) for the next …","This returns Ok(Some((key, value))) for the next …","This returns Ok(Some(key)) for the next key in the map, or …","This returns Ok(Some(key)) for the next key in the map, or …","This returns a Ok(value) for the next value in the map.","This returns a Ok(value) for the next value in the map.","Returns the number of elements remaining in the sequence, …","Returns the number of entries remaining in the map, if …","Called when deserializing a struct-like variant.","","","","","","","","Called when deserializing a tuple-like variant.","","","Called when deserializing a variant with no values.","Raised when a Deserialize struct type received a field …","Raised when a Deserialize enum type received a variant …","Building blocks for deserializing basic values using the …","variant is called to identify which variant to deserialize.","variant is called to identify which variant to deserialize.","The input contains a boolean.","","The input contains a byte array that lives at least as …","The input contains a string that lives at least as long as …","The input contains a byte array and ownership of the byte …","The input contains a byte array. The lifetime of the byte …","","The input contains a char.","The input contains an enum.","","The input contains an f32.","The input contains an f64.","","The input contains a i128.","","The input contains an i16.","The input contains an i32.","The input contains an i64.","","The input contains an i8.","The input contains a key-value map.","","The input contains a newtype struct.","","The input contains an optional that is absent.","","The input contains a sequence of elements.","","The input contains an optional that is present.","","The input contains a string. The lifetime of the string is …","","The input contains a string and ownership of the string is …","The input contains a u128.","","The input contains a u16.","The input contains a u32.","The input contains a u64.","","The input contains a u8.","The input contains a unit ().","","A deserializer holding a bool.","A deserializer holding a &[u8] with a lifetime tied to …","A deserializer holding a &str with a lifetime tied to …","A deserializer holding a &[u8]. Always calls …","A deserializer holding a char.","A deserializer holding a Cow<str>.","A deserializer holding an EnumAccess.","A minimal representation of all possible errors that can …","A deserializer holding an f32.","A deserializer holding an f64.","A deserializer holding an i128.","A deserializer holding an i16.","A deserializer holding an i32.","A deserializer holding an i64.","A deserializer holding an i8.","A deserializer holding an isize.","A deserializer holding a MapAccess.","A deserializer that iterates over a map.","A deserializer holding a SeqAccess.","A deserializer that iterates over a sequence.","A deserializer holding a &str.","A deserializer holding a String.","A deserializer holding a u128.","A deserializer holding a u16.","A deserializer holding a u32.","A deserializer holding a u64.","A deserializer holding a u8.","A deserializer holding a ().","A deserializer holding a usize.","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","Check for remaining elements after passing a …","Check for remaining elements after passing a …","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","","","","Create a new borrowed deserializer from the given string.","","","Create a new deserializer from the given bytes.","Create a new borrowed deserializer from the given borrowed …","Construct a new MapDeserializer<I, E>.","","","","","","","","","","","","","","","","Construct a new SeqDeserializer<I, E>.","Construct a new SeqAccessDeserializer<A>.","Construct a new MapAccessDeserializer<A>.","Construct a new EnumAccessDeserializer<A>.","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","Trait used by Serialize implementations to generically …","The error type when some error occurs during serialization.","Must match the Error type of our Serializer.","Must match the Error type of our Serializer.","Must match the Error type of our Serializer.","Must match the Error type of our Serializer.","Must match the Error type of our Serializer.","Must match the Error type of our Serializer.","Must match the Error type of our Serializer.","Helper type for implementing a Serializer that does not …","The output type produced by this Serializer during …","Must match the Ok type of our Serializer.","Must match the Ok type of our Serializer.","Must match the Ok type of our Serializer.","Must match the Ok type of our Serializer.","Must match the Ok type of our Serializer.","Must match the Ok type of our Serializer.","Must match the Ok type of our Serializer.","A data structure that can be serialized into any data …","Returned from Serializer::serialize_map.","Type returned from serialize_map for serializing the …","Returned from Serializer::serialize_seq.","Type returned from serialize_seq for serializing the …","Returned from Serializer::serialize_struct.","Type returned from serialize_struct for serializing the …","Returned from Serializer::serialize_struct_variant.","Type returned from serialize_struct_variant for …","Returned from Serializer::serialize_tuple.","Type returned from serialize_tuple for serializing the …","Returned from Serializer::serialize_tuple_struct.","Type returned from serialize_tuple_struct for serializing …","Returned from Serializer::serialize_tuple_variant.","Type returned from serialize_tuple_variant for serializing …","A data format that can serialize any data structure …","","","","Collect an iterator as a map.","Collect an iterator as a sequence.","Serialize a string produced by an implementation of Display…","Used when a Serialize implementation encounters any error …","Finish serializing a sequence.","Finish serializing a tuple.","Finish serializing a tuple struct.","Finish serializing a tuple variant.","Finish serializing a map.","Finish serializing a struct.","Finish serializing a struct variant.","","","","","","","","Returns the argument unchanged.","Calls U::from(self).","Determine whether Serialize implementations should …","Serialize this value into the given Serde serializer.","Serialize a bool value.","Serialize a chunk of raw byte data.","Serialize a character.","Serialize a sequence element.","Serialize a tuple element.","","","Serialize a map entry consisting of a key and a value.","Serialize an f32 value.","Serialize an f64 value.","Serialize a tuple struct field.","Serialize a tuple variant field.","Serialize a struct field.","Serialize a struct variant field.","","","","","Serialize an i128 value.","Serialize an i16 value.","Serialize an i32 value.","Serialize an i64 value.","Serialize an i8 value.","Serialize a map key.","","Begin to serialize a map. This call must be followed by …","Serialize a newtype struct like struct Millimeters(u8).","Serialize a newtype variant like E::N in enum E { N(u8) }.","Serialize a None value.","Begin to serialize a variably sized sequence. This call …","Serialize a Some(T) value.","Serialize a &str.","Begin to serialize a struct like …","Begin to serialize a struct variant like E::S in …","Begin to serialize a statically sized sequence whose …","Begin to serialize a tuple struct like …","Begin to serialize a tuple variant like E::T in …","Serialize a u128 value.","Serialize a u16 value.","Serialize a u32 value.","Serialize a u64 value.","Serialize a u8 value.","Serialize a () value.","Serialize a unit struct like struct Unit or PhantomData<T>.","Serialize a unit variant like E::A in enum E { A, B }.","Serialize a map value.","","Indicate that a struct field has been skipped.","Indicate that a struct variant field has been skipped.","","",""],"i":[0,0,0,27,10,10,0,0,10,10,10,10,10,10,10,0,10,10,10,0,26,27,27,27,27,27,27,27,27,27,27,27,27,27,27,27,27,27,27,27,27,27,27,27,27,27,27,27,27,27,27,27,0,27,10,0,20,10,10,10,10,10,10,10,10,10,10,10,10,10,10,10,10,10,10,10,10,10,10,10,10,10,10,10,10,10,10,49,49,49,0,0,0,0,58,49,0,0,27,60,61,65,59,0,49,0,0,49,0,49,49,49,49,49,0,49,0,49,49,49,0,49,49,49,52,29,65,0,0,48,49,48,49,48,49,48,49,28,48,26,52,48,27,27,27,27,27,27,27,27,27,27,27,27,27,27,27,27,27,27,27,27,27,27,27,27,27,27,27,27,27,27,27,28,48,49,29,48,55,55,48,48,49,49,48,49,48,49,58,28,28,28,27,28,59,59,60,60,61,61,61,61,61,61,60,61,59,48,49,49,48,49,48,49,59,48,49,59,28,28,0,65,65,29,48,29,29,29,29,48,29,29,48,29,29,48,29,48,29,29,29,48,29,29,48,29,48,29,48,29,48,29,48,29,48,29,29,48,29,29,29,48,29,29,48,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,67,68,69,70,71,72,73,74,75,78,79,80,81,82,83,84,85,86,87,88,89,90,91,92,93,94,95,96,97,67,68,69,70,71,72,73,74,75,78,79,80,81,82,83,84,85,86,87,88,89,90,91,92,93,94,95,96,97,67,68,69,70,71,72,73,74,75,78,79,80,81,82,83,84,85,86,87,88,89,90,91,92,93,94,95,96,97,67,68,69,70,71,72,73,74,75,78,79,80,81,82,83,84,85,86,87,88,89,90,91,92,93,94,95,96,97,78,78,78,67,68,69,70,71,72,73,74,75,79,80,81,82,83,84,85,86,87,88,89,90,91,92,93,94,95,96,97,67,68,69,70,71,72,73,74,75,79,80,81,82,83,84,85,86,87,88,89,90,91,92,93,94,95,96,97,67,68,69,70,71,72,73,74,75,79,80,81,82,83,84,85,86,87,88,89,90,91,92,93,94,95,96,97,67,68,69,70,71,72,73,74,75,79,80,81,82,83,84,85,86,87,88,89,90,91,92,93,94,95,96,97,67,68,69,70,71,72,73,74,75,79,80,81,82,83,84,85,86,87,88,89,90,91,92,93,94,95,96,97,67,68,69,70,71,72,73,74,75,79,80,81,82,83,84,85,86,87,88,89,90,91,92,93,94,95,96,97,67,68,69,70,71,72,73,74,75,79,80,81,82,83,84,85,86,87,88,89,90,91,92,93,94,95,96,97,67,68,69,70,71,72,73,74,75,79,80,81,82,83,84,85,86,87,88,89,90,91,92,93,94,95,96,97,67,68,69,70,71,72,73,74,75,79,80,81,82,83,84,85,86,87,88,89,90,91,92,93,94,95,96,97,67,68,69,70,71,72,73,74,75,79,80,81,82,83,84,85,86,87,88,89,90,91,92,93,94,95,96,97,67,68,69,70,71,72,73,74,75,79,80,81,82,83,84,85,86,87,88,89,90,91,92,93,94,95,96,97,67,68,69,70,71,72,73,74,75,79,80,81,82,83,84,85,86,87,88,89,90,91,92,93,94,95,96,97,67,68,69,70,71,72,73,74,75,79,80,81,82,83,84,85,86,87,88,89,90,91,92,93,94,95,96,97,67,68,69,70,71,72,73,74,75,79,80,81,82,83,84,85,86,87,88,89,90,91,92,93,94,95,96,97,67,68,69,70,71,72,73,74,75,79,80,81,82,83,84,85,86,87,88,89,90,91,92,93,94,95,96,97,67,68,69,70,71,72,73,74,75,79,80,81,82,83,84,85,86,87,88,89,90,91,92,93,94,95,96,97,67,68,69,70,71,72,73,74,75,79,80,81,82,83,84,85,86,87,88,89,90,91,92,93,94,95,96,97,67,68,69,70,71,72,73,74,75,79,80,81,82,83,84,85,86,87,88,89,90,91,92,93,94,95,96,97,67,68,69,70,71,72,73,74,75,79,80,81,82,83,84,85,86,87,88,89,90,91,92,93,94,95,96,97,67,68,69,70,71,72,73,74,75,79,80,81,82,83,84,85,86,87,88,89,90,91,92,93,94,95,96,97,67,68,69,70,71,72,73,74,75,79,80,81,82,83,84,85,86,87,88,89,90,91,92,93,94,95,96,97,67,68,69,70,71,72,73,74,75,79,80,81,82,83,84,85,86,87,88,89,90,91,92,93,94,95,96,97,67,68,69,70,71,72,73,74,75,79,80,81,82,83,84,85,86,87,88,89,90,91,92,93,94,95,96,97,67,68,69,70,71,72,73,74,75,79,80,81,82,83,84,85,86,87,88,89,90,91,92,93,94,95,96,97,67,68,69,70,71,72,73,74,75,79,80,81,82,83,84,85,86,87,88,89,90,91,92,93,94,95,96,97,67,68,69,70,71,72,73,74,75,79,80,81,82,83,84,85,86,87,88,89,90,91,92,93,94,95,96,97,67,68,69,70,71,72,73,74,75,79,80,81,82,83,84,85,86,87,88,89,90,91,92,93,94,95,96,97,67,68,69,70,71,72,73,74,75,79,80,81,82,83,84,85,86,87,88,89,90,91,92,93,94,95,96,97,67,68,69,70,71,72,73,74,75,79,80,81,82,83,84,85,86,87,88,89,90,91,92,93,94,95,96,97,67,68,69,70,71,72,73,74,75,79,80,81,82,83,84,85,86,87,88,89,90,91,92,93,94,95,96,97,67,68,69,70,71,72,73,74,75,79,80,81,82,83,84,85,86,87,88,89,90,91,92,93,94,95,96,97,75,94,78,67,68,69,70,71,72,73,74,75,78,78,79,80,81,82,83,84,85,86,87,88,89,90,91,92,93,94,95,96,97,67,68,69,70,71,72,73,74,75,78,79,80,81,82,83,84,85,86,87,88,89,90,91,92,93,94,95,96,97,67,68,69,70,71,72,73,74,75,78,79,80,81,82,83,84,85,86,87,88,89,90,91,92,93,94,95,96,97,67,68,69,70,71,72,73,74,75,79,80,81,82,83,84,85,86,87,88,89,90,91,92,93,94,95,96,97,75,94,75,75,75,75,75,94,67,68,69,70,71,72,73,74,75,78,79,80,81,82,83,84,85,86,87,88,89,90,91,92,93,94,95,96,97,78,67,68,69,70,71,72,73,74,75,78,79,80,81,82,83,84,85,86,87,88,89,90,91,92,93,94,95,96,97,67,68,69,70,71,72,73,74,75,78,79,80,81,82,83,84,85,86,87,88,89,90,91,92,93,94,95,96,97,67,68,69,70,71,72,73,74,75,78,79,80,81,82,83,84,85,86,87,88,89,90,91,92,93,94,95,96,97,68,69,70,71,72,96,0,10,13,14,15,16,17,18,19,0,10,13,14,15,16,17,18,19,0,0,10,0,10,0,10,0,10,0,10,0,10,0,10,0,0,101,101,10,10,10,12,13,14,15,16,17,18,19,101,101,101,101,101,101,101,101,101,10,20,10,10,10,13,14,101,101,17,10,10,15,16,18,19,101,101,101,101,10,10,10,10,10,17,101,10,10,10,10,10,10,10,10,10,10,10,10,10,10,10,10,10,10,10,10,17,101,18,19,101,101,101],"f":"````````````````{{{Ad{}{{b{c}}{d{e}}{f{g}}{h{i}}{j{k}}{l{m}}{n{o}}{A`{Aa}}{Ab{Ac}}}}Ai}{{Af{ce}}}{}Ah{{Aj{}{{b{c}}{d{e}}}}}{{Al{}{{b{c}}{d{e}}}}}{{An{}{{b{c}}{d{e}}}}}{{B`{}{{b{c}}{d{e}}}}}{{Bb{}{{b{c}}{d{e}}}}}{{Bd{}{{b{c}}{d{e}}}}}{{Bf{}{{b{c}}{d{e}}}}}BhBh{{Bn{}{{Bj{{Bl{AeAg}}}}}}}}{{{Ad{}{{b{c}}{d{e}}{f{g}}{h{i}}{j{k}}{l{m}}{n{o}}{A`{Aa}}{Ab{Ac}}}}Ae}{{Af{ce}}}{}Ah{{Aj{}{{b{c}}{d{e}}}}}{{Al{}{{b{c}}{d{e}}}}}{{An{}{{b{c}}{d{e}}}}}{{B`{}{{b{c}}{d{e}}}}}{{Bb{}{{b{c}}{d{e}}}}}{{Bd{}{{b{c}}{d{e}}}}}{{Bf{}{{b{c}}{d{e}}}}}Bn}{{{Ad{}{{b{c}}{d{e}}{f{g}}{h{i}}{j{k}}{l{m}}{n{o}}{A`{Aa}}{Ab{Ac}}}}Ae}{{Af{ce}}}{}Ah{{Aj{}{{b{c}}{d{e}}}}}{{Al{}{{b{c}}{d{e}}}}}{{An{}{{b{c}}{d{e}}}}}{{B`{}{{b{c}}{d{e}}}}}{{Bb{}{{b{c}}{d{e}}}}}{{Bd{}{{b{c}}{d{e}}}}}{{Bf{}{{b{c}}{d{e}}}}}{C`Cb}}`{c{{Af{Cd}}}Cf}{{{Cf{}{{d{c}}}}e}{{Af{c}}}ChCj}0000{{{Cf{}{{d{c}}}}Cl{Cn{Cl}}e}{{Af{c}}}ChCj}1111111111{{{Cf{}{{d{c}}}}Cle}{{Af{c}}}ChCj}22221{{{Cf{}{{d{c}}}}D`e}{{Af{c}}}ChCj}{{{Cf{}{{d{c}}}}ClD`e}{{Af{c}}}ChCj}4444442`{{{Cf{}{{d{c}}}}}DbCh}{{{Ad{}{{b{c}}{d{e}}{f{g}}{h{i}}{j{k}}{l{m}}{n{o}}{A`{Aa}}{Ab{Ac}}}}}Db{}Ah{{Aj{}{{b{c}}{d{e}}}}}{{Al{}{{b{c}}{d{e}}}}}{{An{}{{b{c}}{d{e}}}}}{{B`{}{{b{c}}{d{e}}}}}{{Bb{}{{b{c}}{d{e}}}}}{{Bd{}{{b{c}}{d{e}}}}}{{Bf{}{{b{c}}{d{e}}}}}}`{{Bhc}AfAd}{{{Ad{}{{b{c}}{d{e}}{f{g}}{h{i}}{j{k}}{l{m}}{n{o}}{A`{Aa}}{Ab{Ac}}}}Db}{{Af{ce}}}{}Ah{{Aj{}{{b{c}}{d{e}}}}}{{Al{}{{b{c}}{d{e}}}}}{{An{}{{b{c}}{d{e}}}}}{{B`{}{{b{c}}{d{e}}}}}{{Bb{}{{b{c}}{d{e}}}}}{{Bd{}{{b{c}}{d{e}}}}}{{Bf{}{{b{c}}{d{e}}}}}}{{{Ad{}{{b{c}}{d{e}}{f{g}}{h{i}}{j{k}}{l{m}}{n{o}}{A`{Aa}}{Ab{Ac}}}}{Cn{Dd}}}{{Af{ce}}}{}Ah{{Aj{}{{b{c}}{d{e}}}}}{{Al{}{{b{c}}{d{e}}}}}{{An{}{{b{c}}{d{e}}}}}{{B`{}{{b{c}}{d{e}}}}}{{Bb{}{{b{c}}{d{e}}}}}{{Bd{}{{b{c}}{d{e}}}}}{{Bf{}{{b{c}}{d{e}}}}}}{{{Ad{}{{b{c}}{d{e}}{f{g}}{h{i}}{j{k}}{l{m}}{n{o}}{A`{Aa}}{Ab{Ac}}}}Df}{{Af{ce}}}{}Ah{{Aj{}{{b{c}}{d{e}}}}}{{Al{}{{b{c}}{d{e}}}}}{{An{}{{b{c}}{d{e}}}}}{{B`{}{{b{c}}{d{e}}}}}{{Bb{}{{b{c}}{d{e}}}}}{{Bd{}{{b{c}}{d{e}}}}}{{Bf{}{{b{c}}{d{e}}}}}}{{{Ad{}{{b{c}}{d{e}}{f{g}}{h{i}}{j{k}}{l{m}}{n{o}}{A`{Aa}}{Ab{Ac}}}}Dh}{{Af{ce}}}{}Ah{{Aj{}{{b{c}}{d{e}}}}}{{Al{}{{b{c}}{d{e}}}}}{{An{}{{b{c}}{d{e}}}}}{{B`{}{{b{c}}{d{e}}}}}{{Bb{}{{b{c}}{d{e}}}}}{{Bd{}{{b{c}}{d{e}}}}}{{Bf{}{{b{c}}{d{e}}}}}}{{{Ad{}{{b{c}}{d{e}}{f{g}}{h{i}}{j{k}}{l{m}}{n{o}}{A`{Aa}}{Ab{Ac}}}}Dj}{{Af{ce}}}{}Ah{{Aj{}{{b{c}}{d{e}}}}}{{Al{}{{b{c}}{d{e}}}}}{{An{}{{b{c}}{d{e}}}}}{{B`{}{{b{c}}{d{e}}}}}{{Bb{}{{b{c}}{d{e}}}}}{{Bd{}{{b{c}}{d{e}}}}}{{Bf{}{{b{c}}{d{e}}}}}}{{{Ad{}{{b{c}}{d{e}}{f{g}}{h{i}}{j{k}}{l{m}}{n{o}}{A`{Aa}}{Ab{Ac}}}}Dl}{{Af{ce}}}{}Ah{{Aj{}{{b{c}}{d{e}}}}}{{Al{}{{b{c}}{d{e}}}}}{{An{}{{b{c}}{d{e}}}}}{{B`{}{{b{c}}{d{e}}}}}{{Bb{}{{b{c}}{d{e}}}}}{{Bd{}{{b{c}}{d{e}}}}}{{Bf{}{{b{c}}{d{e}}}}}}{{{Ad{}{{b{c}}{d{e}}{f{g}}{h{i}}{j{k}}{l{m}}{n{o}}{A`{Aa}}{Ab{Ac}}}}Dn}{{Af{ce}}}{}Ah{{Aj{}{{b{c}}{d{e}}}}}{{Al{}{{b{c}}{d{e}}}}}{{An{}{{b{c}}{d{e}}}}}{{B`{}{{b{c}}{d{e}}}}}{{Bb{}{{b{c}}{d{e}}}}}{{Bd{}{{b{c}}{d{e}}}}}{{Bf{}{{b{c}}{d{e}}}}}}{{{Ad{}{{b{c}}{d{e}}{f{g}}{h{i}}{j{k}}{l{m}}{n{o}}{A`{Aa}}{Ab{Ac}}}}E`}{{Af{ce}}}{}Ah{{Aj{}{{b{c}}{d{e}}}}}{{Al{}{{b{c}}{d{e}}}}}{{An{}{{b{c}}{d{e}}}}}{{B`{}{{b{c}}{d{e}}}}}{{Bb{}{{b{c}}{d{e}}}}}{{Bd{}{{b{c}}{d{e}}}}}{{Bf{}{{b{c}}{d{e}}}}}}{{{Ad{}{{b{c}}{d{e}}{f{g}}{h{i}}{j{k}}{l{m}}{n{o}}{A`{Aa}}{Ab{Ac}}}}Eb}{{Af{ce}}}{}Ah{{Aj{}{{b{c}}{d{e}}}}}{{Al{}{{b{c}}{d{e}}}}}{{An{}{{b{c}}{d{e}}}}}{{B`{}{{b{c}}{d{e}}}}}{{Bb{}{{b{c}}{d{e}}}}}{{Bd{}{{b{c}}{d{e}}}}}{{Bf{}{{b{c}}{d{e}}}}}}{{{Ad{}{{b{c}}{d{e}}{f{g}}{h{i}}{j{k}}{l{m}}{n{o}}{A`{Aa}}{Ab{Ac}}}}Ed}{{Af{ce}}}{}Ah{{Aj{}{{b{c}}{d{e}}}}}{{Al{}{{b{c}}{d{e}}}}}{{An{}{{b{c}}{d{e}}}}}{{B`{}{{b{c}}{d{e}}}}}{{Bb{}{{b{c}}{d{e}}}}}{{Bd{}{{b{c}}{d{e}}}}}{{Bf{}{{b{c}}{d{e}}}}}}{{{Ad{}{{b{c}}{d{e}}{f{g}}{h{i}}{j{k}}{l{m}}{n{o}}{A`{Aa}}{Ab{Ac}}}}{Ef{D`}}}{{Af{oe}}}{}Ah{{Aj{}{{b{c}}{d{e}}}}}{{Al{}{{b{c}}{d{e}}}}}{{An{}{{b{c}}{d{e}}}}}{{B`{}{{b{c}}{d{e}}}}}{{Bb{}{{b{c}}{d{e}}}}}{{Bd{}{{b{c}}{d{e}}}}}{{Bf{}{{b{c}}{d{e}}}}}}{{{Ad{}{{b{c}}{d{e}}{f{g}}{h{i}}{j{k}}{l{m}}{n{o}}{A`{Aa}}{Ab{Ac}}}}ClAe}{{Af{ce}}}{}Ah{{Aj{}{{b{c}}{d{e}}}}}{{Al{}{{b{c}}{d{e}}}}}{{An{}{{b{c}}{d{e}}}}}{{B`{}{{b{c}}{d{e}}}}}{{Bb{}{{b{c}}{d{e}}}}}{{Bd{}{{b{c}}{d{e}}}}}{{Bf{}{{b{c}}{d{e}}}}}{C`Bh}}{{{Ad{}{{b{c}}{d{e}}{f{g}}{h{i}}{j{k}}{l{m}}{n{o}}{A`{Aa}}{Ab{Ac}}}}ClEhClAe}{{Af{ce}}}{}Ah{{Aj{}{{b{c}}{d{e}}}}}{{Al{}{{b{c}}{d{e}}}}}{{An{}{{b{c}}{d{e}}}}}{{B`{}{{b{c}}{d{e}}}}}{{Bb{}{{b{c}}{d{e}}}}}{{Bd{}{{b{c}}{d{e}}}}}{{Bf{}{{b{c}}{d{e}}}}}{C`Bh}}{{{Ad{}{{b{c}}{d{e}}{f{g}}{h{i}}{j{k}}{l{m}}{n{o}}{A`{Aa}}{Ab{Ac}}}}}{{Af{ce}}}{}Ah{{Aj{}{{b{c}}{d{e}}}}}{{Al{}{{b{c}}{d{e}}}}}{{An{}{{b{c}}{d{e}}}}}{{B`{}{{b{c}}{d{e}}}}}{{Bb{}{{b{c}}{d{e}}}}}{{Bd{}{{b{c}}{d{e}}}}}{{Bf{}{{b{c}}{d{e}}}}}}{{{Ad{}{{b{c}}{d{e}}{f{g}}{h{i}}{j{k}}{l{m}}{n{o}}{A`{Aa}}{Ab{Ac}}}}{Ef{D`}}}{{Af{ge}}}{}Ah{{Aj{}{{b{c}}{d{e}}}}}{{Al{}{{b{c}}{d{e}}}}}{{An{}{{b{c}}{d{e}}}}}{{B`{}{{b{c}}{d{e}}}}}{{Bb{}{{b{c}}{d{e}}}}}{{Bd{}{{b{c}}{d{e}}}}}{{Bf{}{{b{c}}{d{e}}}}}}{{{Ad{}{{b{c}}{d{e}}{f{g}}{h{i}}{j{k}}{l{m}}{n{o}}{A`{Aa}}{Ab{Ac}}}}Ae}{{Af{ce}}}{}Ah{{Aj{}{{b{c}}{d{e}}}}}{{Al{}{{b{c}}{d{e}}}}}{{An{}{{b{c}}{d{e}}}}}{{B`{}{{b{c}}{d{e}}}}}{{Bb{}{{b{c}}{d{e}}}}}{{Bd{}{{b{c}}{d{e}}}}}{{Bf{}{{b{c}}{d{e}}}}}{C`Bh}}{{{Ad{}{{b{c}}{d{e}}{f{g}}{h{i}}{j{k}}{l{m}}{n{o}}{A`{Aa}}{Ab{Ac}}}}Cl}{{Af{ce}}}{}Ah{{Aj{}{{b{c}}{d{e}}}}}{{Al{}{{b{c}}{d{e}}}}}{{An{}{{b{c}}{d{e}}}}}{{B`{}{{b{c}}{d{e}}}}}{{Bb{}{{b{c}}{d{e}}}}}{{Bd{}{{b{c}}{d{e}}}}}{{Bf{}{{b{c}}{d{e}}}}}}{{{Ad{}{{b{c}}{d{e}}{f{g}}{h{i}}{j{k}}{l{m}}{n{o}}{A`{Aa}}{Ab{Ac}}}}ClD`}{{Af{Aae}}}{}Ah{{Aj{}{{b{c}}{d{e}}}}}{{Al{}{{b{c}}{d{e}}}}}{{An{}{{b{c}}{d{e}}}}}{{B`{}{{b{c}}{d{e}}}}}{{Bb{}{{b{c}}{d{e}}}}}{{Bd{}{{b{c}}{d{e}}}}}{{Bf{}{{b{c}}{d{e}}}}}}{{{Ad{}{{b{c}}{d{e}}{f{g}}{h{i}}{j{k}}{l{m}}{n{o}}{A`{Aa}}{Ab{Ac}}}}ClEhClD`}{{Af{Ace}}}{}Ah{{Aj{}{{b{c}}{d{e}}}}}{{Al{}{{b{c}}{d{e}}}}}{{An{}{{b{c}}{d{e}}}}}{{B`{}{{b{c}}{d{e}}}}}{{Bb{}{{b{c}}{d{e}}}}}{{Bd{}{{b{c}}{d{e}}}}}{{Bf{}{{b{c}}{d{e}}}}}}{{{Ad{}{{b{c}}{d{e}}{f{g}}{h{i}}{j{k}}{l{m}}{n{o}}{A`{Aa}}{Ab{Ac}}}}D`}{{Af{ie}}}{}Ah{{Aj{}{{b{c}}{d{e}}}}}{{Al{}{{b{c}}{d{e}}}}}{{An{}{{b{c}}{d{e}}}}}{{B`{}{{b{c}}{d{e}}}}}{{Bb{}{{b{c}}{d{e}}}}}{{Bd{}{{b{c}}{d{e}}}}}{{Bf{}{{b{c}}{d{e}}}}}}{{{Ad{}{{b{c}}{d{e}}{f{g}}{h{i}}{j{k}}{l{m}}{n{o}}{A`{Aa}}{Ab{Ac}}}}ClD`}{{Af{ke}}}{}Ah{{Aj{}{{b{c}}{d{e}}}}}{{Al{}{{b{c}}{d{e}}}}}{{An{}{{b{c}}{d{e}}}}}{{B`{}{{b{c}}{d{e}}}}}{{Bb{}{{b{c}}{d{e}}}}}{{Bd{}{{b{c}}{d{e}}}}}{{Bf{}{{b{c}}{d{e}}}}}}{{{Ad{}{{b{c}}{d{e}}{f{g}}{h{i}}{j{k}}{l{m}}{n{o}}{A`{Aa}}{Ab{Ac}}}}ClEhClD`}{{Af{me}}}{}Ah{{Aj{}{{b{c}}{d{e}}}}}{{Al{}{{b{c}}{d{e}}}}}{{An{}{{b{c}}{d{e}}}}}{{B`{}{{b{c}}{d{e}}}}}{{Bb{}{{b{c}}{d{e}}}}}{{Bd{}{{b{c}}{d{e}}}}}{{Bf{}{{b{c}}{d{e}}}}}}{{{Ad{}{{b{c}}{d{e}}{f{g}}{h{i}}{j{k}}{l{m}}{n{o}}{A`{Aa}}{Ab{Ac}}}}Ej}{{Af{ce}}}{}Ah{{Aj{}{{b{c}}{d{e}}}}}{{Al{}{{b{c}}{d{e}}}}}{{An{}{{b{c}}{d{e}}}}}{{B`{}{{b{c}}{d{e}}}}}{{Bb{}{{b{c}}{d{e}}}}}{{Bd{}{{b{c}}{d{e}}}}}{{Bf{}{{b{c}}{d{e}}}}}}{{{Ad{}{{b{c}}{d{e}}{f{g}}{h{i}}{j{k}}{l{m}}{n{o}}{A`{Aa}}{Ab{Ac}}}}El}{{Af{ce}}}{}Ah{{Aj{}{{b{c}}{d{e}}}}}{{Al{}{{b{c}}{d{e}}}}}{{An{}{{b{c}}{d{e}}}}}{{B`{}{{b{c}}{d{e}}}}}{{Bb{}{{b{c}}{d{e}}}}}{{Bd{}{{b{c}}{d{e}}}}}{{Bf{}{{b{c}}{d{e}}}}}}{{{Ad{}{{b{c}}{d{e}}{f{g}}{h{i}}{j{k}}{l{m}}{n{o}}{A`{Aa}}{Ab{Ac}}}}Eh}{{Af{ce}}}{}Ah{{Aj{}{{b{c}}{d{e}}}}}{{Al{}{{b{c}}{d{e}}}}}{{An{}{{b{c}}{d{e}}}}}{{B`{}{{b{c}}{d{e}}}}}{{Bb{}{{b{c}}{d{e}}}}}{{Bd{}{{b{c}}{d{e}}}}}{{Bf{}{{b{c}}{d{e}}}}}}{{{Ad{}{{b{c}}{d{e}}{f{g}}{h{i}}{j{k}}{l{m}}{n{o}}{A`{Aa}}{Ab{Ac}}}}En}{{Af{ce}}}{}Ah{{Aj{}{{b{c}}{d{e}}}}}{{Al{}{{b{c}}{d{e}}}}}{{An{}{{b{c}}{d{e}}}}}{{B`{}{{b{c}}{d{e}}}}}{{Bb{}{{b{c}}{d{e}}}}}{{Bd{}{{b{c}}{d{e}}}}}{{Bf{}{{b{c}}{d{e}}}}}}{{{Ad{}{{b{c}}{d{e}}{f{g}}{h{i}}{j{k}}{l{m}}{n{o}}{A`{Aa}}{Ab{Ac}}}}Dd}{{Af{ce}}}{}Ah{{Aj{}{{b{c}}{d{e}}}}}{{Al{}{{b{c}}{d{e}}}}}{{An{}{{b{c}}{d{e}}}}}{{B`{}{{b{c}}{d{e}}}}}{{Bb{}{{b{c}}{d{e}}}}}{{Bd{}{{b{c}}{d{e}}}}}{{Bf{}{{b{c}}{d{e}}}}}}=:{{{Ad{}{{b{c}}{d{e}}{f{g}}{h{i}}{j{k}}{l{m}}{n{o}}{A`{Aa}}{Ab{Ac}}}}ClEhCl}{{Af{ce}}}{}Ah{{Aj{}{{b{c}}{d{e}}}}}{{Al{}{{b{c}}{d{e}}}}}{{An{}{{b{c}}{d{e}}}}}{{B`{}{{b{c}}{d{e}}}}}{{Bb{}{{b{c}}{d{e}}}}}{{Bd{}{{b{c}}{d{e}}}}}{{Bf{}{{b{c}}{d{e}}}}}}``````````````````````````````````````````{ce{}{}}000{F`F`}{FbFb}{{ce}Fd{}{}}0{cChCb}{{}F`}{c{{Af{Cd}}}Cf}{{{Fh{}{{Ff{c}}}}e}{{Af{c}}}{}Cf}{c{{Af{F`}}}Cf}{{{Cf{}{{d{c}}}}e}{{Af{c}}}ChCj}0000{{{Cf{}{{d{c}}}}Cl{Cn{Cl}}e}{{Af{c}}}ChCj}1111111111{{{Cf{}{{d{c}}}}Cle}{{Af{c}}}ChCj}22221{{{Cf{}{{d{c}}}}D`e}{{Af{c}}}ChCj}{{{Cf{}{{d{c}}}}ClD`e}{{Af{c}}}ChCj}4444442{ClCh}{{F`F`}Db}{{FbFb}Db}{{{Cj{}{{Ff{c}}}}Fj}Fl{}}{{F`Fj}Fl}{{FnFj}Fl}01{{cFj}{{Af{FdG`}}}{}}{{FbFj}Fl}0{cc{}}0{ce{}{}}0{{{Gd{}{{Gb{c}}}}}c{{Cf{}{{d{e}}}}}Ch}{{D`Fn}Ch}{{FbFn}Ch}0{{{Cf{}{{d{c}}}}}DbCh}={{{Gf{}{{d{c}}}}}{{Af{ec}}}ChCd}{{{Gf{}{{d{c}}}}e}{{Af{c}}}ChFh}{{{Gh{}{{d{c}}}}}{{Af{{Ef{e}}c}}}ChCd}{{{Gh{}{{d{c}}}}e}{{Af{Efc}}}ChFh}{{{Gj{}{{d{c}}}}}{{Af{{Ef{{Bl{eg}}}}c}}}ChCdCd}{{{Gj{}{{d{c}}}}eg}{{Af{{Ef{Bl}}c}}}ChFhFh}{{{Gj{}{{d{c}}}}}{{Af{{Ef{e}}c}}}ChCd}{{{Gj{}{{d{c}}}}e}{{Af{Efc}}}ChFh}{{{Gj{}{{d{c}}}}}{{Af{ec}}}ChCd}{{{Gj{}{{d{c}}}}e}{{Af{c}}}ChFh}{{{Gh{}{{d{c}}}}}{{Ef{D`}}}Ch}{{{Gj{}{{d{c}}}}}{{Ef{D`}}}Ch}{{{Gf{}{{d{c}}}}{Cn{Cl}}e}{{Af{c}}}ChCj}{ce{}{}}0{cGl{}}{c{{Af{e}}}{}{}}000{{{Gf{}{{d{c}}}}D`e}{{Af{c}}}ChCj}{cGn{}}0{{{Gf{}{{d{c}}}}}{{Af{Fdc}}}Ch}{{Cl{Cn{Cl}}}Ch}0`{{{Hb{}{{d{c}}{H`{e}}}}}{{Af{{Bl{ge}}c}}}Ch{{Gf{}{{d{c}}}}}Cd}{{{Hb{}{{d{c}}{H`{e}}}}g}{{Af{{Bl{e}}c}}}Ch{{Gf{}{{d{c}}}}}Fh}{{{Cj{}{{Ff{c}}}}Db}{{Af{ce}}}{}Ch}{{F`Db}{{Af{ce}}}{}{}}{{{Cj{}{{Ff{c}}}}{Cn{Dd}}}{{Af{ce}}}{}Ch}{{{Cj{}{{Ff{c}}}}Cl}{{Af{ce}}}{}Ch}{{{Cj{}{{Ff{c}}}}{Hd{Dd}}}{{Af{ce}}}{}Ch}2{{F`{Cn{Dd}}}{{Af{ce}}}{}Ch}{{{Cj{}{{Ff{c}}}}Df}{{Af{ce}}}{}Ch}{{{Cj{}{{Ff{c}}}}e}{{Af{c}}}{}Hb}{{F`c}{{Af{e}}}Hb{}}{{{Cj{}{{Ff{c}}}}Dh}{{Af{ce}}}{}Ch}{{{Cj{}{{Ff{c}}}}Dj}{{Af{ce}}}{}Ch}{{F`Dj}{{Af{ce}}}{}{}}{{{Cj{}{{Ff{c}}}}Dl}{{Af{ce}}}{}Ch}{{F`Dl}{{Af{ce}}}{}{}}{{{Cj{}{{Ff{c}}}}Dn}{{Af{ce}}}{}Ch}{{{Cj{}{{Ff{c}}}}E`}{{Af{ce}}}{}Ch}{{{Cj{}{{Ff{c}}}}Eb}{{Af{ce}}}{}Ch}{{F`Eb}{{Af{ce}}}{}{}}{{{Cj{}{{Ff{c}}}}Ed}{{Af{ce}}}{}Ch}{{{Cj{}{{Ff{c}}}}e}{{Af{c}}}{}Gj}{{F`c}{{Af{e}}}Gj{}}{{{Cj{}{{Ff{c}}}}e}{{Af{c}}}{}Cf}{{F`c}{{Af{e}}}Cf{}}{{{Cj{}{{Ff{c}}}}}{{Af{ce}}}{}Ch}{F`{{Af{ce}}}{}{}}{{{Cj{}{{Ff{c}}}}e}{{Af{c}}}{}Gh}{{F`c}{{Af{e}}}Gh{}}54{{{Cj{}{{Ff{c}}}}Cl}{{Af{ce}}}{}Ch}{{F`Cl}{{Af{ce}}}{}Ch}{{{Cj{}{{Ff{c}}}}Gl}{{Af{ce}}}{}Ch}{{{Cj{}{{Ff{c}}}}Ej}{{Af{ce}}}{}Ch}{{F`Ej}{{Af{ce}}}{}{}}{{{Cj{}{{Ff{c}}}}El}{{Af{ce}}}{}Ch}{{{Cj{}{{Ff{c}}}}Eh}{{Af{ce}}}{}Ch}{{{Cj{}{{Ff{c}}}}En}{{Af{ce}}}{}Ch}{{F`En}{{Af{ce}}}{}{}}{{{Cj{}{{Ff{c}}}}Dd}{{Af{ce}}}{}Ch}=<`````````````````````````````{ce{}{}}000000000000000000000000000000000000000000000000000000000{{{Hf{c}}}{{Hf{c}}}{}}{{{Hh{c}}}{{Hh{c}}}{}}{{{Hj{c}}}{{Hj{c}}}{}}{{{Hl{c}}}{{Hl{c}}}{}}{{{Hn{c}}}{{Hn{c}}}{}}{{{I`{c}}}{{I`{c}}}{}}{{{Ib{c}}}{{Ib{c}}}{}}{{{Id{c}}}{{Id{c}}}{}}{{{If{ce}}}{{If{ce}}}{IhIj}{}}{IlIl}{{{In{c}}}{{In{c}}}{}}{{{J`{c}}}{{J`{c}}}{}}{{{Jb{c}}}{{Jb{c}}}{}}{{{Jd{c}}}{{Jd{c}}}{}}{{{Jf{c}}}{{Jf{c}}}{}}{{{Jh{c}}}{{Jh{c}}}{}}{{{Jj{c}}}{{Jj{c}}}{}}{{{Jl{c}}}{{Jl{c}}}{}}{{{Jn{c}}}{{Jn{c}}}{}}{{{K`{c}}}{{K`{c}}}{}}{{{Kb{c}}}{{Kb{c}}}{}}{{{Kd{c}}}{{Kd{c}}}{}}{{{Kf{c}}}{{Kf{c}}}{}}{{{Kh{c}}}{{Kh{c}}}{}}{{{Kj{c}}}{{Kj{c}}}{}}{{{Kl{ce}}}{{Kl{ce}}}IjIj}{{{Kn{c}}}{{Kn{c}}}Ij}{{{L`{c}}}{{L`{c}}}Ij}{{{Lb{c}}}{{Lb{c}}}Ij}{{ce}Fd{}{}}0000000000000000000000000000{cIlCb}0{IlCl}{{{Hf{c}}e}{{Af{g}}}ChCj{}}{{{Hh{c}}e}{{Af{g}}}ChCj{}}{{{Hj{c}}e}{{Af{g}}}ChCj{}}{{{Hl{c}}e}{{Af{g}}}ChCj{}}{{{Hn{c}}e}{{Af{g}}}ChCj{}}{{{I`{c}}e}{{Af{g}}}ChCj{}}{{{Ib{c}}e}{{Af{g}}}ChCj{}}{{{Id{c}}e}{{Af{g}}}ChCj{}}{{{If{ce}}g}{{Af{i}}}IhChCj{}}{{{In{c}}e}{{Af{g}}}ChCj{}}{{{J`{c}}e}{{Af{g}}}ChCj{}}{{{Jb{c}}e}{{Af{g}}}ChCj{}}{{{Jd{c}}e}{{Af{g}}}ChCj{}}{{{Jf{c}}e}{{Af{g}}}ChCj{}}{{{Jh{c}}e}{{Af{g}}}ChCj{}}{{{Jj{c}}e}{{Af{g}}}ChCj{}}{{{Jl{c}}e}{{Af{g}}}ChCj{}}{{{Jn{c}}e}{{Af{g}}}ChCj{}}{{{K`{c}}e}{{Af{g}}}ChCj{}}{{{Kb{c}}e}{{Af{g}}}ChCj{}}{{{Kd{c}}e}{{Af{g}}}ChCj{}}{{{Kf{c}}e}{{Af{g}}}ChCj{}}{{{Kh{c}}e}{{Af{g}}}ChCj{}}{{{Kj{c}}e}{{Af{g}}}ChCj{}}{{{Kl{gc}}i}{{Af{k}}}Ch{{Gd{c}}}{{Ih{}{{Bj{e}}}}}Cj{}}{{{Kn{c}}e}{{Af{g}}}GhCj{}}{{{L`{c}}e}{{Af{g}}}GjCj{}}{{{Lb{c}}e}{{Af{g}}}HbCj{}}{{{Hf{c}}e}{{Af{g}}}ChCj{}}{{{Hh{c}}e}{{Af{g}}}ChCj{}}{{{Hj{c}}e}{{Af{g}}}ChCj{}}{{{Hl{c}}e}{{Af{g}}}ChCj{}}{{{Hn{c}}e}{{Af{g}}}ChCj{}}{{{I`{c}}e}{{Af{g}}}ChCj{}}{{{Ib{c}}e}{{Af{g}}}ChCj{}}{{{Id{c}}e}{{Af{g}}}ChCj{}}{{{If{ce}}g}{{Af{i}}}IhChCj{}}{{{In{c}}e}{{Af{g}}}ChCj{}}{{{J`{c}}e}{{Af{g}}}ChCj{}}{{{Jb{c}}e}{{Af{g}}}ChCj{}}{{{Jd{c}}e}{{Af{g}}}ChCj{}}{{{Jf{c}}e}{{Af{g}}}ChCj{}}{{{Jh{c}}e}{{Af{g}}}ChCj{}}{{{Jj{c}}e}{{Af{g}}}ChCj{}}{{{Jl{c}}e}{{Af{g}}}ChCj{}}{{{Jn{c}}e}{{Af{g}}}ChCj{}}{{{K`{c}}e}{{Af{g}}}ChCj{}}{{{Kb{c}}e}{{Af{g}}}ChCj{}}{{{Kd{c}}e}{{Af{g}}}ChCj{}}{{{Kf{c}}e}{{Af{g}}}ChCj{}}{{{Kh{c}}e}{{Af{g}}}ChCj{}}{{{Kj{c}}e}{{Af{g}}}ChCj{}}{{{Kl{gc}}i}{{Af{k}}}Ch{{Gd{c}}}{{Ih{}{{Bj{e}}}}}Cj{}}{{{Kn{c}}e}{{Af{g}}}GhCj{}}{{{L`{c}}e}{{Af{g}}}GjCj{}}{{{Lb{c}}e}{{Af{g}}}HbCj{}}{{{Hf{c}}e}{{Af{g}}}ChCj{}}{{{Hh{c}}e}{{Af{g}}}ChCj{}}{{{Hj{c}}e}{{Af{g}}}ChCj{}}{{{Hl{c}}e}{{Af{g}}}ChCj{}}{{{Hn{c}}e}{{Af{g}}}ChCj{}}{{{I`{c}}e}{{Af{g}}}ChCj{}}{{{Ib{c}}e}{{Af{g}}}ChCj{}}{{{Id{c}}e}{{Af{g}}}ChCj{}}{{{If{ce}}g}{{Af{i}}}IhChCj{}}{{{In{c}}e}{{Af{g}}}ChCj{}}{{{J`{c}}e}{{Af{g}}}ChCj{}}{{{Jb{c}}e}{{Af{g}}}ChCj{}}{{{Jd{c}}e}{{Af{g}}}ChCj{}}{{{Jf{c}}e}{{Af{g}}}ChCj{}}{{{Jh{c}}e}{{Af{g}}}ChCj{}}{{{Jj{c}}e}{{Af{g}}}ChCj{}}{{{Jl{c}}e}{{Af{g}}}ChCj{}}{{{Jn{c}}e}{{Af{g}}}ChCj{}}{{{K`{c}}e}{{Af{g}}}ChCj{}}{{{Kb{c}}e}{{Af{g}}}ChCj{}}{{{Kd{c}}e}{{Af{g}}}ChCj{}}{{{Kf{c}}e}{{Af{g}}}ChCj{}}{{{Kh{c}}e}{{Af{g}}}ChCj{}}{{{Kj{c}}e}{{Af{g}}}ChCj{}}{{{Kl{gc}}i}{{Af{k}}}Ch{{Gd{c}}}{{Ih{}{{Bj{e}}}}}Cj{}}{{{Kn{c}}e}{{Af{g}}}GhCj{}}{{{L`{c}}e}{{Af{g}}}GjCj{}}{{{Lb{c}}e}{{Af{g}}}HbCj{}}{{{Hf{c}}e}{{Af{g}}}ChCj{}}{{{Hh{c}}e}{{Af{g}}}ChCj{}}{{{Hj{c}}e}{{Af{g}}}ChCj{}}{{{Hl{c}}e}{{Af{g}}}ChCj{}}{{{Hn{c}}e}{{Af{g}}}ChCj{}}{{{I`{c}}e}{{Af{g}}}ChCj{}}{{{Ib{c}}e}{{Af{g}}}ChCj{}}{{{Id{c}}e}{{Af{g}}}ChCj{}}{{{If{ce}}g}{{Af{i}}}IhChCj{}}{{{In{c}}e}{{Af{g}}}ChCj{}}{{{J`{c}}e}{{Af{g}}}ChCj{}}{{{Jb{c}}e}{{Af{g}}}ChCj{}}{{{Jd{c}}e}{{Af{g}}}ChCj{}}{{{Jf{c}}e}{{Af{g}}}ChCj{}}{{{Jh{c}}e}{{Af{g}}}ChCj{}}{{{Jj{c}}e}{{Af{g}}}ChCj{}}{{{Jl{c}}e}{{Af{g}}}ChCj{}}{{{Jn{c}}e}{{Af{g}}}ChCj{}}{{{K`{c}}e}{{Af{g}}}ChCj{}}{{{Kb{c}}e}{{Af{g}}}ChCj{}}{{{Kd{c}}e}{{Af{g}}}ChCj{}}{{{Kf{c}}e}{{Af{g}}}ChCj{}}{{{Kh{c}}e}{{Af{g}}}ChCj{}}{{{Kj{c}}e}{{Af{g}}}ChCj{}}{{{Kl{gc}}i}{{Af{k}}}Ch{{Gd{c}}}{{Ih{}{{Bj{e}}}}}Cj{}}{{{Kn{c}}e}{{Af{g}}}GhCj{}}{{{L`{c}}e}{{Af{g}}}GjCj{}}{{{Lb{c}}e}{{Af{g}}}HbCj{}}{{{Hf{c}}e}{{Af{g}}}ChCj{}}{{{Hh{c}}e}{{Af{g}}}ChCj{}}{{{Hj{c}}e}{{Af{g}}}ChCj{}}{{{Hl{c}}e}{{Af{g}}}ChCj{}}{{{Hn{c}}e}{{Af{g}}}ChCj{}}{{{I`{c}}e}{{Af{g}}}ChCj{}}{{{Ib{c}}e}{{Af{g}}}ChCj{}}{{{Id{c}}e}{{Af{g}}}ChCj{}}{{{If{ce}}g}{{Af{i}}}IhChCj{}}{{{In{c}}e}{{Af{g}}}ChCj{}}{{{J`{c}}e}{{Af{g}}}ChCj{}}{{{Jb{c}}e}{{Af{g}}}ChCj{}}{{{Jd{c}}e}{{Af{g}}}ChCj{}}{{{Jf{c}}e}{{Af{g}}}ChCj{}}{{{Jh{c}}e}{{Af{g}}}ChCj{}}{{{Jj{c}}e}{{Af{g}}}ChCj{}}{{{Jl{c}}e}{{Af{g}}}ChCj{}}{{{Jn{c}}e}{{Af{g}}}ChCj{}}{{{K`{c}}e}{{Af{g}}}ChCj{}}{{{Kb{c}}e}{{Af{g}}}ChCj{}}{{{Kd{c}}e}{{Af{g}}}ChCj{}}{{{Kf{c}}e}{{Af{g}}}ChCj{}}{{{Kh{c}}e}{{Af{g}}}ChCj{}}{{{Kj{c}}e}{{Af{g}}}ChCj{}}{{{Kl{gc}}i}{{Af{k}}}Ch{{Gd{c}}}{{Ih{}{{Bj{e}}}}}Cj{}}{{{Kn{c}}e}{{Af{g}}}GhCj{}}{{{L`{c}}e}{{Af{g}}}GjCj{}}{{{Lb{c}}e}{{Af{g}}}HbCj{}}{{{Hf{c}}Cl{Cn{Cl}}e}{{Af{g}}}ChCj{}}{{{Hh{c}}Cl{Cn{Cl}}e}{{Af{g}}}ChCj{}}{{{Hj{c}}Cl{Cn{Cl}}e}{{Af{g}}}ChCj{}}{{{Hl{c}}Cl{Cn{Cl}}e}{{Af{g}}}ChCj{}}{{{Hn{c}}Cl{Cn{Cl}}e}{{Af{g}}}ChCj{}}{{{I`{c}}Cl{Cn{Cl}}e}{{Af{g}}}ChCj{}}{{{Ib{c}}Cl{Cn{Cl}}e}{{Af{g}}}ChCj{}}{{{Id{c}}Cl{Cn{Cl}}e}{{Af{g}}}ChCj{}}{{{If{ce}}Cl{Cn{Cl}}g}{{Af{i}}}IhChCj{}}{{{In{c}}Cl{Cn{Cl}}e}{{Af{g}}}ChCj{}}{{{J`{c}}Cl{Cn{Cl}}e}{{Af{g}}}ChCj{}}{{{Jb{c}}Cl{Cn{Cl}}e}{{Af{g}}}ChCj{}}{{{Jd{c}}Cl{Cn{Cl}}e}{{Af{g}}}ChCj{}}{{{Jf{c}}Cl{Cn{Cl}}e}{{Af{g}}}ChCj{}}{{{Jh{c}}Cl{Cn{Cl}}e}{{Af{g}}}ChCj{}}{{{Jj{c}}Cl{Cn{Cl}}e}{{Af{g}}}ChCj{}}{{{Jl{c}}Cl{Cn{Cl}}e}{{Af{g}}}ChCj{}}{{{Jn{c}}Cl{Cn{Cl}}e}{{Af{g}}}ChCj{}}{{{K`{c}}Cl{Cn{Cl}}e}{{Af{g}}}ChCj{}}{{{Kb{c}}Cl{Cn{Cl}}e}{{Af{g}}}ChCj{}}{{{Kd{c}}Cl{Cn{Cl}}e}{{Af{g}}}ChCj{}}{{{Kf{c}}Cl{Cn{Cl}}e}{{Af{g}}}ChCj{}}{{{Kh{c}}Cl{Cn{Cl}}e}{{Af{g}}}ChCj{}}{{{Kj{c}}Cl{Cn{Cl}}e}{{Af{g}}}ChCj{}}{{{Kl{gc}}Cl{Cn{Cl}}i}{{Af{k}}}Ch{{Gd{c}}}{{Ih{}{{Bj{e}}}}}Cj{}}{{{Kn{c}}Cl{Cn{Cl}}e}{{Af{g}}}GhCj{}}{{{L`{c}}Cl{Cn{Cl}}e}{{Af{g}}}GjCj{}}{{{Lb{c}}Cl{Cn{Cl}}e}{{Af{g}}}HbCj{}}{{{Hf{c}}e}{{Af{g}}}ChCj{}}{{{Hh{c}}e}{{Af{g}}}ChCj{}}{{{Hj{c}}e}{{Af{g}}}ChCj{}}{{{Hl{c}}e}{{Af{g}}}ChCj{}}{{{Hn{c}}e}{{Af{g}}}ChCj{}}{{{I`{c}}e}{{Af{g}}}ChCj{}}{{{Ib{c}}e}{{Af{g}}}ChCj{}}{{{Id{c}}e}{{Af{g}}}ChCj{}}{{{If{ce}}g}{{Af{i}}}IhChCj{}}{{{In{c}}e}{{Af{g}}}ChCj{}}{{{J`{c}}e}{{Af{g}}}ChCj{}}{{{Jb{c}}e}{{Af{g}}}ChCj{}}{{{Jd{c}}e}{{Af{g}}}ChCj{}}{{{Jf{c}}e}{{Af{g}}}ChCj{}}{{{Jh{c}}e}{{Af{g}}}ChCj{}}{{{Jj{c}}e}{{Af{g}}}ChCj{}}{{{Jl{c}}e}{{Af{g}}}ChCj{}}{{{Jn{c}}e}{{Af{g}}}ChCj{}}{{{K`{c}}e}{{Af{g}}}ChCj{}}{{{Kb{c}}e}{{Af{g}}}ChCj{}}{{{Kd{c}}e}{{Af{g}}}ChCj{}}{{{Kf{c}}e}{{Af{g}}}ChCj{}}{{{Kh{c}}e}{{Af{g}}}ChCj{}}{{{Kj{c}}e}{{Af{g}}}ChCj{}}{{{Kl{gc}}i}{{Af{k}}}Ch{{Gd{c}}}{{Ih{}{{Bj{e}}}}}Cj{}}{{{Kn{c}}e}{{Af{g}}}GhCj{}}{{{L`{c}}e}{{Af{g}}}GjCj{}}{{{Lb{c}}e}{{Af{g}}}HbCj{}}{{{Hf{c}}e}{{Af{g}}}ChCj{}}{{{Hh{c}}e}{{Af{g}}}ChCj{}}{{{Hj{c}}e}{{Af{g}}}ChCj{}}{{{Hl{c}}e}{{Af{g}}}ChCj{}}{{{Hn{c}}e}{{Af{g}}}ChCj{}}{{{I`{c}}e}{{Af{g}}}ChCj{}}{{{Ib{c}}e}{{Af{g}}}ChCj{}}{{{Id{c}}e}{{Af{g}}}ChCj{}}{{{If{ce}}g}{{Af{i}}}IhChCj{}}{{{In{c}}e}{{Af{g}}}ChCj{}}{{{J`{c}}e}{{Af{g}}}ChCj{}}{{{Jb{c}}e}{{Af{g}}}ChCj{}}{{{Jd{c}}e}{{Af{g}}}ChCj{}}{{{Jf{c}}e}{{Af{g}}}ChCj{}}{{{Jh{c}}e}{{Af{g}}}ChCj{}}{{{Jj{c}}e}{{Af{g}}}ChCj{}}{{{Jl{c}}e}{{Af{g}}}ChCj{}}{{{Jn{c}}e}{{Af{g}}}ChCj{}}{{{K`{c}}e}{{Af{g}}}ChCj{}}{{{Kb{c}}e}{{Af{g}}}ChCj{}}{{{Kd{c}}e}{{Af{g}}}ChCj{}}{{{Kf{c}}e}{{Af{g}}}ChCj{}}{{{Kh{c}}e}{{Af{g}}}ChCj{}}{{{Kj{c}}e}{{Af{g}}}ChCj{}}{{{Kl{gc}}i}{{Af{k}}}Ch{{Gd{c}}}{{Ih{}{{Bj{e}}}}}Cj{}}{{{Kn{c}}e}{{Af{g}}}GhCj{}}{{{L`{c}}e}{{Af{g}}}GjCj{}}{{{Lb{c}}e}{{Af{g}}}HbCj{}}{{{Hf{c}}e}{{Af{g}}}ChCj{}}{{{Hh{c}}e}{{Af{g}}}ChCj{}}{{{Hj{c}}e}{{Af{g}}}ChCj{}}{{{Hl{c}}e}{{Af{g}}}ChCj{}}{{{Hn{c}}e}{{Af{g}}}ChCj{}}{{{I`{c}}e}{{Af{g}}}ChCj{}}{{{Ib{c}}e}{{Af{g}}}ChCj{}}{{{Id{c}}e}{{Af{g}}}ChCj{}}{{{If{ce}}g}{{Af{i}}}IhChCj{}}{{{In{c}}e}{{Af{g}}}ChCj{}}{{{J`{c}}e}{{Af{g}}}ChCj{}}{{{Jb{c}}e}{{Af{g}}}ChCj{}}{{{Jd{c}}e}{{Af{g}}}ChCj{}}{{{Jf{c}}e}{{Af{g}}}ChCj{}}{{{Jh{c}}e}{{Af{g}}}ChCj{}}{{{Jj{c}}e}{{Af{g}}}ChCj{}}{{{Jl{c}}e}{{Af{g}}}ChCj{}}{{{Jn{c}}e}{{Af{g}}}ChCj{}}{{{K`{c}}e}{{Af{g}}}ChCj{}}{{{Kb{c}}e}{{Af{g}}}ChCj{}}{{{Kd{c}}e}{{Af{g}}}ChCj{}}{{{Kf{c}}e}{{Af{g}}}ChCj{}}{{{Kh{c}}e}{{Af{g}}}ChCj{}}{{{Kj{c}}e}{{Af{g}}}ChCj{}}{{{Kl{gc}}i}{{Af{k}}}Ch{{Gd{c}}}{{Ih{}{{Bj{e}}}}}Cj{}}{{{Kn{c}}e}{{Af{g}}}GhCj{}}{{{L`{c}}e}{{Af{g}}}GjCj{}}{{{Lb{c}}e}{{Af{g}}}HbCj{}}{{{Hf{c}}e}{{Af{g}}}ChCj{}}{{{Hh{c}}e}{{Af{g}}}ChCj{}}{{{Hj{c}}e}{{Af{g}}}ChCj{}}{{{Hl{c}}e}{{Af{g}}}ChCj{}}{{{Hn{c}}e}{{Af{g}}}ChCj{}}{{{I`{c}}e}{{Af{g}}}ChCj{}}{{{Ib{c}}e}{{Af{g}}}ChCj{}}{{{Id{c}}e}{{Af{g}}}ChCj{}}{{{If{ce}}g}{{Af{i}}}IhChCj{}}{{{In{c}}e}{{Af{g}}}ChCj{}}{{{J`{c}}e}{{Af{g}}}ChCj{}}{{{Jb{c}}e}{{Af{g}}}ChCj{}}{{{Jd{c}}e}{{Af{g}}}ChCj{}}{{{Jf{c}}e}{{Af{g}}}ChCj{}}{{{Jh{c}}e}{{Af{g}}}ChCj{}}{{{Jj{c}}e}{{Af{g}}}ChCj{}}{{{Jl{c}}e}{{Af{g}}}ChCj{}}{{{Jn{c}}e}{{Af{g}}}ChCj{}}{{{K`{c}}e}{{Af{g}}}ChCj{}}{{{Kb{c}}e}{{Af{g}}}ChCj{}}{{{Kd{c}}e}{{Af{g}}}ChCj{}}{{{Kf{c}}e}{{Af{g}}}ChCj{}}{{{Kh{c}}e}{{Af{g}}}ChCj{}}{{{Kj{c}}e}{{Af{g}}}ChCj{}}{{{Kl{gc}}i}{{Af{k}}}Ch{{Gd{c}}}{{Ih{}{{Bj{e}}}}}Cj{}}{{{Kn{c}}e}{{Af{g}}}GhCj{}}{{{L`{c}}e}{{Af{g}}}GjCj{}}{{{Lb{c}}e}{{Af{g}}}HbCj{}}{{{Hf{c}}e}{{Af{g}}}ChCj{}}{{{Hh{c}}e}{{Af{g}}}ChCj{}}{{{Hj{c}}e}{{Af{g}}}ChCj{}}{{{Hl{c}}e}{{Af{g}}}ChCj{}}{{{Hn{c}}e}{{Af{g}}}ChCj{}}{{{I`{c}}e}{{Af{g}}}ChCj{}}{{{Ib{c}}e}{{Af{g}}}ChCj{}}{{{Id{c}}e}{{Af{g}}}ChCj{}}{{{If{ce}}g}{{Af{i}}}IhChCj{}}{{{In{c}}e}{{Af{g}}}ChCj{}}{{{J`{c}}e}{{Af{g}}}ChCj{}}{{{Jb{c}}e}{{Af{g}}}ChCj{}}{{{Jd{c}}e}{{Af{g}}}ChCj{}}{{{Jf{c}}e}{{Af{g}}}ChCj{}}{{{Jh{c}}e}{{Af{g}}}ChCj{}}{{{Jj{c}}e}{{Af{g}}}ChCj{}}{{{Jl{c}}e}{{Af{g}}}ChCj{}}{{{Jn{c}}e}{{Af{g}}}ChCj{}}{{{K`{c}}e}{{Af{g}}}ChCj{}}{{{Kb{c}}e}{{Af{g}}}ChCj{}}{{{Kd{c}}e}{{Af{g}}}ChCj{}}{{{Kf{c}}e}{{Af{g}}}ChCj{}}{{{Kh{c}}e}{{Af{g}}}ChCj{}}{{{Kj{c}}e}{{Af{g}}}ChCj{}}{{{Kl{gc}}i}{{Af{k}}}Ch{{Gd{c}}}{{Ih{}{{Bj{e}}}}}Cj{}}{{{Kn{c}}e}{{Af{g}}}GhCj{}}{{{L`{c}}e}{{Af{g}}}GjCj{}}{{{Lb{c}}e}{{Af{g}}}HbCj{}}{{{Hf{c}}e}{{Af{g}}}ChCj{}}{{{Hh{c}}e}{{Af{g}}}ChCj{}}{{{Hj{c}}e}{{Af{g}}}ChCj{}}{{{Hl{c}}e}{{Af{g}}}ChCj{}}{{{Hn{c}}e}{{Af{g}}}ChCj{}}{{{I`{c}}e}{{Af{g}}}ChCj{}}{{{Ib{c}}e}{{Af{g}}}ChCj{}}{{{Id{c}}e}{{Af{g}}}ChCj{}}{{{If{ce}}g}{{Af{i}}}IhChCj{}}{{{In{c}}e}{{Af{g}}}ChCj{}}{{{J`{c}}e}{{Af{g}}}ChCj{}}{{{Jb{c}}e}{{Af{g}}}ChCj{}}{{{Jd{c}}e}{{Af{g}}}ChCj{}}{{{Jf{c}}e}{{Af{g}}}ChCj{}}{{{Jh{c}}e}{{Af{g}}}ChCj{}}{{{Jj{c}}e}{{Af{g}}}ChCj{}}{{{Jl{c}}e}{{Af{g}}}ChCj{}}{{{Jn{c}}e}{{Af{g}}}ChCj{}}{{{K`{c}}e}{{Af{g}}}ChCj{}}{{{Kb{c}}e}{{Af{g}}}ChCj{}}{{{Kd{c}}e}{{Af{g}}}ChCj{}}{{{Kf{c}}e}{{Af{g}}}ChCj{}}{{{Kh{c}}e}{{Af{g}}}ChCj{}}{{{Kj{c}}e}{{Af{g}}}ChCj{}}{{{Kl{gc}}i}{{Af{k}}}Ch{{Gd{c}}}{{Ih{}{{Bj{e}}}}}Cj{}}{{{Kn{c}}e}{{Af{g}}}GhCj{}}{{{L`{c}}e}{{Af{g}}}GjCj{}}{{{Lb{c}}e}{{Af{g}}}HbCj{}}{{{Hf{c}}e}{{Af{g}}}ChCj{}}{{{Hh{c}}e}{{Af{g}}}ChCj{}}{{{Hj{c}}e}{{Af{g}}}ChCj{}}{{{Hl{c}}e}{{Af{g}}}ChCj{}}{{{Hn{c}}e}{{Af{g}}}ChCj{}}{{{I`{c}}e}{{Af{g}}}ChCj{}}{{{Ib{c}}e}{{Af{g}}}ChCj{}}{{{Id{c}}e}{{Af{g}}}ChCj{}}{{{If{ce}}g}{{Af{i}}}IhChCj{}}{{{In{c}}e}{{Af{g}}}ChCj{}}{{{J`{c}}e}{{Af{g}}}ChCj{}}{{{Jb{c}}e}{{Af{g}}}ChCj{}}{{{Jd{c}}e}{{Af{g}}}ChCj{}}{{{Jf{c}}e}{{Af{g}}}ChCj{}}{{{Jh{c}}e}{{Af{g}}}ChCj{}}{{{Jj{c}}e}{{Af{g}}}ChCj{}}{{{Jl{c}}e}{{Af{g}}}ChCj{}}{{{Jn{c}}e}{{Af{g}}}ChCj{}}{{{K`{c}}e}{{Af{g}}}ChCj{}}{{{Kb{c}}e}{{Af{g}}}ChCj{}}{{{Kd{c}}e}{{Af{g}}}ChCj{}}{{{Kf{c}}e}{{Af{g}}}ChCj{}}{{{Kh{c}}e}{{Af{g}}}ChCj{}}{{{Kj{c}}e}{{Af{g}}}ChCj{}}{{{Kl{gc}}i}{{Af{k}}}Ch{{Gd{c}}}{{Ih{}{{Bj{e}}}}}Cj{}}{{{Kn{c}}e}{{Af{g}}}GhCj{}}{{{L`{c}}e}{{Af{g}}}GjCj{}}{{{Lb{c}}e}{{Af{g}}}HbCj{}}{{{Hf{c}}e}{{Af{g}}}ChCj{}}{{{Hh{c}}e}{{Af{g}}}ChCj{}}{{{Hj{c}}e}{{Af{g}}}ChCj{}}{{{Hl{c}}e}{{Af{g}}}ChCj{}}{{{Hn{c}}e}{{Af{g}}}ChCj{}}{{{I`{c}}e}{{Af{g}}}ChCj{}}{{{Ib{c}}e}{{Af{g}}}ChCj{}}{{{Id{c}}e}{{Af{g}}}ChCj{}}{{{If{ce}}g}{{Af{i}}}IhChCj{}}{{{In{c}}e}{{Af{g}}}ChCj{}}{{{J`{c}}e}{{Af{g}}}ChCj{}}{{{Jb{c}}e}{{Af{g}}}ChCj{}}{{{Jd{c}}e}{{Af{g}}}ChCj{}}{{{Jf{c}}e}{{Af{g}}}ChCj{}}{{{Jh{c}}e}{{Af{g}}}ChCj{}}{{{Jj{c}}e}{{Af{g}}}ChCj{}}{{{Jl{c}}e}{{Af{g}}}ChCj{}}{{{Jn{c}}e}{{Af{g}}}ChCj{}}{{{K`{c}}e}{{Af{g}}}ChCj{}}{{{Kb{c}}e}{{Af{g}}}ChCj{}}{{{Kd{c}}e}{{Af{g}}}ChCj{}}{{{Kf{c}}e}{{Af{g}}}ChCj{}}{{{Kh{c}}e}{{Af{g}}}ChCj{}}{{{Kj{c}}e}{{Af{g}}}ChCj{}}{{{Kl{gc}}i}{{Af{k}}}Ch{{Gd{c}}}{{Ih{}{{Bj{e}}}}}Cj{}}{{{Kn{c}}e}{{Af{g}}}GhCj{}}{{{L`{c}}e}{{Af{g}}}GjCj{}}{{{Lb{c}}e}{{Af{g}}}HbCj{}}{{{Hf{c}}e}{{Af{g}}}ChCj{}}{{{Hh{c}}e}{{Af{g}}}ChCj{}}{{{Hj{c}}e}{{Af{g}}}ChCj{}}{{{Hl{c}}e}{{Af{g}}}ChCj{}}{{{Hn{c}}e}{{Af{g}}}ChCj{}}{{{I`{c}}e}{{Af{g}}}ChCj{}}{{{Ib{c}}e}{{Af{g}}}ChCj{}}{{{Id{c}}e}{{Af{g}}}ChCj{}}{{{If{ce}}g}{{Af{i}}}IhChCj{}}{{{In{c}}e}{{Af{g}}}ChCj{}}{{{J`{c}}e}{{Af{g}}}ChCj{}}{{{Jb{c}}e}{{Af{g}}}ChCj{}}{{{Jd{c}}e}{{Af{g}}}ChCj{}}{{{Jf{c}}e}{{Af{g}}}ChCj{}}{{{Jh{c}}e}{{Af{g}}}ChCj{}}{{{Jj{c}}e}{{Af{g}}}ChCj{}}{{{Jl{c}}e}{{Af{g}}}ChCj{}}{{{Jn{c}}e}{{Af{g}}}ChCj{}}{{{K`{c}}e}{{Af{g}}}ChCj{}}{{{Kb{c}}e}{{Af{g}}}ChCj{}}{{{Kd{c}}e}{{Af{g}}}ChCj{}}{{{Kf{c}}e}{{Af{g}}}ChCj{}}{{{Kh{c}}e}{{Af{g}}}ChCj{}}{{{Kj{c}}e}{{Af{g}}}ChCj{}}{{{Kl{gc}}i}{{Af{k}}}Ch{{Gd{c}}}{{Ih{}{{Bj{e}}}}}Cj{}}{{{Kn{c}}e}{{Af{g}}}GhCj{}}{{{L`{c}}e}{{Af{g}}}GjCj{}}{{{Lb{c}}e}{{Af{g}}}HbCj{}}{{{Hf{c}}e}{{Af{g}}}ChCj{}}{{{Hh{c}}e}{{Af{g}}}ChCj{}}{{{Hj{c}}e}{{Af{g}}}ChCj{}}{{{Hl{c}}e}{{Af{g}}}ChCj{}}{{{Hn{c}}e}{{Af{g}}}ChCj{}}{{{I`{c}}e}{{Af{g}}}ChCj{}}{{{Ib{c}}e}{{Af{g}}}ChCj{}}{{{Id{c}}e}{{Af{g}}}ChCj{}}{{{If{ce}}g}{{Af{i}}}IhChCj{}}{{{In{c}}e}{{Af{g}}}ChCj{}}{{{J`{c}}e}{{Af{g}}}ChCj{}}{{{Jb{c}}e}{{Af{g}}}ChCj{}}{{{Jd{c}}e}{{Af{g}}}ChCj{}}{{{Jf{c}}e}{{Af{g}}}ChCj{}}{{{Jh{c}}e}{{Af{g}}}ChCj{}}{{{Jj{c}}e}{{Af{g}}}ChCj{}}{{{Jl{c}}e}{{Af{g}}}ChCj{}}{{{Jn{c}}e}{{Af{g}}}ChCj{}}{{{K`{c}}e}{{Af{g}}}ChCj{}}{{{Kb{c}}e}{{Af{g}}}ChCj{}}{{{Kd{c}}e}{{Af{g}}}ChCj{}}{{{Kf{c}}e}{{Af{g}}}ChCj{}}{{{Kh{c}}e}{{Af{g}}}ChCj{}}{{{Kj{c}}e}{{Af{g}}}ChCj{}}{{{Kl{gc}}i}{{Af{k}}}Ch{{Gd{c}}}{{Ih{}{{Bj{e}}}}}Cj{}}{{{Kn{c}}e}{{Af{g}}}GhCj{}}{{{L`{c}}e}{{Af{g}}}GjCj{}}{{{Lb{c}}e}{{Af{g}}}HbCj{}}{{{Hf{c}}Cle}{{Af{g}}}ChCj{}}{{{Hh{c}}Cle}{{Af{g}}}ChCj{}}{{{Hj{c}}Cle}{{Af{g}}}ChCj{}}{{{Hl{c}}Cle}{{Af{g}}}ChCj{}}{{{Hn{c}}Cle}{{Af{g}}}ChCj{}}{{{I`{c}}Cle}{{Af{g}}}ChCj{}}{{{Ib{c}}Cle}{{Af{g}}}ChCj{}}{{{Id{c}}Cle}{{Af{g}}}ChCj{}}{{{If{ce}}Clg}{{Af{i}}}IhChCj{}}{{{In{c}}Cle}{{Af{g}}}ChCj{}}{{{J`{c}}Cle}{{Af{g}}}ChCj{}}{{{Jb{c}}Cle}{{Af{g}}}ChCj{}}{{{Jd{c}}Cle}{{Af{g}}}ChCj{}}{{{Jf{c}}Cle}{{Af{g}}}ChCj{}}{{{Jh{c}}Cle}{{Af{g}}}ChCj{}}{{{Jj{c}}Cle}{{Af{g}}}ChCj{}}{{{Jl{c}}Cle}{{Af{g}}}ChCj{}}{{{Jn{c}}Cle}{{Af{g}}}ChCj{}}{{{K`{c}}Cle}{{Af{g}}}ChCj{}}{{{Kb{c}}Cle}{{Af{g}}}ChCj{}}{{{Kd{c}}Cle}{{Af{g}}}ChCj{}}{{{Kf{c}}Cle}{{Af{g}}}ChCj{}}{{{Kh{c}}Cle}{{Af{g}}}ChCj{}}{{{Kj{c}}Cle}{{Af{g}}}ChCj{}}{{{Kl{gc}}Cli}{{Af{k}}}Ch{{Gd{c}}}{{Ih{}{{Bj{e}}}}}Cj{}}{{{Kn{c}}Cle}{{Af{g}}}GhCj{}}{{{L`{c}}Cle}{{Af{g}}}GjCj{}}{{{Lb{c}}Cle}{{Af{g}}}HbCj{}}{{{Hf{c}}e}{{Af{g}}}ChCj{}}{{{Hh{c}}e}{{Af{g}}}ChCj{}}{{{Hj{c}}e}{{Af{g}}}ChCj{}}{{{Hl{c}}e}{{Af{g}}}ChCj{}}{{{Hn{c}}e}{{Af{g}}}ChCj{}}{{{I`{c}}e}{{Af{g}}}ChCj{}}{{{Ib{c}}e}{{Af{g}}}ChCj{}}{{{Id{c}}e}{{Af{g}}}ChCj{}}{{{If{ce}}g}{{Af{i}}}IhChCj{}}{{{In{c}}e}{{Af{g}}}ChCj{}}{{{J`{c}}e}{{Af{g}}}ChCj{}}{{{Jb{c}}e}{{Af{g}}}ChCj{}}{{{Jd{c}}e}{{Af{g}}}ChCj{}}{{{Jf{c}}e}{{Af{g}}}ChCj{}}{{{Jh{c}}e}{{Af{g}}}ChCj{}}{{{Jj{c}}e}{{Af{g}}}ChCj{}}{{{Jl{c}}e}{{Af{g}}}ChCj{}}{{{Jn{c}}e}{{Af{g}}}ChCj{}}{{{K`{c}}e}{{Af{g}}}ChCj{}}{{{Kb{c}}e}{{Af{g}}}ChCj{}}{{{Kd{c}}e}{{Af{g}}}ChCj{}}{{{Kf{c}}e}{{Af{g}}}ChCj{}}{{{Kh{c}}e}{{Af{g}}}ChCj{}}{{{Kj{c}}e}{{Af{g}}}ChCj{}}{{{Kl{gc}}i}{{Af{k}}}Ch{{Gd{c}}}{{Ih{}{{Bj{e}}}}}Cj{}}{{{Kn{c}}e}{{Af{g}}}GhCj{}}{{{L`{c}}e}{{Af{g}}}GjCj{}}{{{Lb{c}}e}{{Af{g}}}HbCj{}}{{{Hf{c}}e}{{Af{g}}}ChCj{}}{{{Hh{c}}e}{{Af{g}}}ChCj{}}{{{Hj{c}}e}{{Af{g}}}ChCj{}}{{{Hl{c}}e}{{Af{g}}}ChCj{}}{{{Hn{c}}e}{{Af{g}}}ChCj{}}{{{I`{c}}e}{{Af{g}}}ChCj{}}{{{Ib{c}}e}{{Af{g}}}ChCj{}}{{{Id{c}}e}{{Af{g}}}ChCj{}}{{{If{ce}}g}{{Af{i}}}IhChCj{}}{{{In{c}}e}{{Af{g}}}ChCj{}}{{{J`{c}}e}{{Af{g}}}ChCj{}}{{{Jb{c}}e}{{Af{g}}}ChCj{}}{{{Jd{c}}e}{{Af{g}}}ChCj{}}{{{Jf{c}}e}{{Af{g}}}ChCj{}}{{{Jh{c}}e}{{Af{g}}}ChCj{}}{{{Jj{c}}e}{{Af{g}}}ChCj{}}{{{Jl{c}}e}{{Af{g}}}ChCj{}}{{{Jn{c}}e}{{Af{g}}}ChCj{}}{{{K`{c}}e}{{Af{g}}}ChCj{}}{{{Kb{c}}e}{{Af{g}}}ChCj{}}{{{Kd{c}}e}{{Af{g}}}ChCj{}}{{{Kf{c}}e}{{Af{g}}}ChCj{}}{{{Kh{c}}e}{{Af{g}}}ChCj{}}{{{Kj{c}}e}{{Af{g}}}ChCj{}}{{{Kl{gc}}i}{{Af{k}}}Ch{{Gd{c}}}{{Ih{}{{Bj{e}}}}}Cj{}}{{{Kn{c}}e}{{Af{g}}}GhCj{}}{{{L`{c}}e}{{Af{g}}}GjCj{}}{{{Lb{c}}e}{{Af{g}}}HbCj{}}{{{Hf{c}}e}{{Af{g}}}ChCj{}}{{{Hh{c}}e}{{Af{g}}}ChCj{}}{{{Hj{c}}e}{{Af{g}}}ChCj{}}{{{Hl{c}}e}{{Af{g}}}ChCj{}}{{{Hn{c}}e}{{Af{g}}}ChCj{}}{{{I`{c}}e}{{Af{g}}}ChCj{}}{{{Ib{c}}e}{{Af{g}}}ChCj{}}{{{Id{c}}e}{{Af{g}}}ChCj{}}{{{If{ce}}g}{{Af{i}}}IhChCj{}}{{{In{c}}e}{{Af{g}}}ChCj{}}{{{J`{c}}e}{{Af{g}}}ChCj{}}{{{Jb{c}}e}{{Af{g}}}ChCj{}}{{{Jd{c}}e}{{Af{g}}}ChCj{}}{{{Jf{c}}e}{{Af{g}}}ChCj{}}{{{Jh{c}}e}{{Af{g}}}ChCj{}}{{{Jj{c}}e}{{Af{g}}}ChCj{}}{{{Jl{c}}e}{{Af{g}}}ChCj{}}{{{Jn{c}}e}{{Af{g}}}ChCj{}}{{{K`{c}}e}{{Af{g}}}ChCj{}}{{{Kb{c}}e}{{Af{g}}}ChCj{}}{{{Kd{c}}e}{{Af{g}}}ChCj{}}{{{Kf{c}}e}{{Af{g}}}ChCj{}}{{{Kh{c}}e}{{Af{g}}}ChCj{}}{{{Kj{c}}e}{{Af{g}}}ChCj{}}{{{Kl{gc}}i}{{Af{k}}}Ch{{Gd{c}}}{{Ih{}{{Bj{e}}}}}Cj{}}{{{Kn{c}}e}{{Af{g}}}GhCj{}}{{{L`{c}}e}{{Af{g}}}GjCj{}}{{{Lb{c}}e}{{Af{g}}}HbCj{}}{{{Hf{c}}e}{{Af{g}}}ChCj{}}{{{Hh{c}}e}{{Af{g}}}ChCj{}}{{{Hj{c}}e}{{Af{g}}}ChCj{}}{{{Hl{c}}e}{{Af{g}}}ChCj{}}{{{Hn{c}}e}{{Af{g}}}ChCj{}}{{{I`{c}}e}{{Af{g}}}ChCj{}}{{{Ib{c}}e}{{Af{g}}}ChCj{}}{{{Id{c}}e}{{Af{g}}}ChCj{}}{{{If{ce}}g}{{Af{i}}}IhChCj{}}{{{In{c}}e}{{Af{g}}}ChCj{}}{{{J`{c}}e}{{Af{g}}}ChCj{}}{{{Jb{c}}e}{{Af{g}}}ChCj{}}{{{Jd{c}}e}{{Af{g}}}ChCj{}}{{{Jf{c}}e}{{Af{g}}}ChCj{}}{{{Jh{c}}e}{{Af{g}}}ChCj{}}{{{Jj{c}}e}{{Af{g}}}ChCj{}}{{{Jl{c}}e}{{Af{g}}}ChCj{}}{{{Jn{c}}e}{{Af{g}}}ChCj{}}{{{K`{c}}e}{{Af{g}}}ChCj{}}{{{Kb{c}}e}{{Af{g}}}ChCj{}}{{{Kd{c}}e}{{Af{g}}}ChCj{}}{{{Kf{c}}e}{{Af{g}}}ChCj{}}{{{Kh{c}}e}{{Af{g}}}ChCj{}}{{{Kj{c}}e}{{Af{g}}}ChCj{}}{{{Kl{gc}}i}{{Af{k}}}Ch{{Gd{c}}}{{Ih{}{{Bj{e}}}}}Cj{}}{{{Kn{c}}e}{{Af{g}}}GhCj{}}{{{L`{c}}e}{{Af{g}}}GjCj{}}{{{Lb{c}}e}{{Af{g}}}HbCj{}}{{{Hf{c}}Cl{Cn{Cl}}e}{{Af{g}}}ChCj{}}{{{Hh{c}}Cl{Cn{Cl}}e}{{Af{g}}}ChCj{}}{{{Hj{c}}Cl{Cn{Cl}}e}{{Af{g}}}ChCj{}}{{{Hl{c}}Cl{Cn{Cl}}e}{{Af{g}}}ChCj{}}{{{Hn{c}}Cl{Cn{Cl}}e}{{Af{g}}}ChCj{}}{{{I`{c}}Cl{Cn{Cl}}e}{{Af{g}}}ChCj{}}{{{Ib{c}}Cl{Cn{Cl}}e}{{Af{g}}}ChCj{}}{{{Id{c}}Cl{Cn{Cl}}e}{{Af{g}}}ChCj{}}{{{If{ce}}Cl{Cn{Cl}}g}{{Af{i}}}IhChCj{}}{{{In{c}}Cl{Cn{Cl}}e}{{Af{g}}}ChCj{}}{{{J`{c}}Cl{Cn{Cl}}e}{{Af{g}}}ChCj{}}{{{Jb{c}}Cl{Cn{Cl}}e}{{Af{g}}}ChCj{}}{{{Jd{c}}Cl{Cn{Cl}}e}{{Af{g}}}ChCj{}}{{{Jf{c}}Cl{Cn{Cl}}e}{{Af{g}}}ChCj{}}{{{Jh{c}}Cl{Cn{Cl}}e}{{Af{g}}}ChCj{}}{{{Jj{c}}Cl{Cn{Cl}}e}{{Af{g}}}ChCj{}}{{{Jl{c}}Cl{Cn{Cl}}e}{{Af{g}}}ChCj{}}{{{Jn{c}}Cl{Cn{Cl}}e}{{Af{g}}}ChCj{}}{{{K`{c}}Cl{Cn{Cl}}e}{{Af{g}}}ChCj{}}{{{Kb{c}}Cl{Cn{Cl}}e}{{Af{g}}}ChCj{}}{{{Kd{c}}Cl{Cn{Cl}}e}{{Af{g}}}ChCj{}}{{{Kf{c}}Cl{Cn{Cl}}e}{{Af{g}}}ChCj{}}{{{Kh{c}}Cl{Cn{Cl}}e}{{Af{g}}}ChCj{}}{{{Kj{c}}Cl{Cn{Cl}}e}{{Af{g}}}ChCj{}}{{{Kl{gc}}Cl{Cn{Cl}}i}{{Af{k}}}Ch{{Gd{c}}}{{Ih{}{{Bj{e}}}}}Cj{}}{{{Kn{c}}Cl{Cn{Cl}}e}{{Af{g}}}GhCj{}}{{{L`{c}}Cl{Cn{Cl}}e}{{Af{g}}}GjCj{}}{{{Lb{c}}Cl{Cn{Cl}}e}{{Af{g}}}HbCj{}}{{{Hf{c}}D`e}{{Af{g}}}ChCj{}}{{{Hh{c}}D`e}{{Af{g}}}ChCj{}}{{{Hj{c}}D`e}{{Af{g}}}ChCj{}}{{{Hl{c}}D`e}{{Af{g}}}ChCj{}}{{{Hn{c}}D`e}{{Af{g}}}ChCj{}}{{{I`{c}}D`e}{{Af{g}}}ChCj{}}{{{Ib{c}}D`e}{{Af{g}}}ChCj{}}{{{Id{c}}D`e}{{Af{g}}}ChCj{}}{{{If{ce}}D`g}{{Af{i}}}IhChCj{}}{{{In{c}}D`e}{{Af{g}}}ChCj{}}{{{J`{c}}D`e}{{Af{g}}}ChCj{}}{{{Jb{c}}D`e}{{Af{g}}}ChCj{}}{{{Jd{c}}D`e}{{Af{g}}}ChCj{}}{{{Jf{c}}D`e}{{Af{g}}}ChCj{}}{{{Jh{c}}D`e}{{Af{g}}}ChCj{}}{{{Jj{c}}D`e}{{Af{g}}}ChCj{}}{{{Jl{c}}D`e}{{Af{g}}}ChCj{}}{{{Jn{c}}D`e}{{Af{g}}}ChCj{}}{{{K`{c}}D`e}{{Af{g}}}ChCj{}}{{{Kb{c}}D`e}{{Af{g}}}ChCj{}}{{{Kd{c}}D`e}{{Af{g}}}ChCj{}}{{{Kf{c}}D`e}{{Af{g}}}ChCj{}}{{{Kh{c}}D`e}{{Af{g}}}ChCj{}}{{{Kj{c}}D`e}{{Af{g}}}ChCj{}}{{{Kl{gc}}D`i}{{Af{k}}}Ch{{Gd{c}}}{{Ih{}{{Bj{e}}}}}Cj{}}{{{Kn{c}}D`e}{{Af{g}}}GhCj{}}{{{L`{c}}D`e}{{Af{g}}}GjCj{}}{{{Lb{c}}D`e}{{Af{g}}}HbCj{}}{{{Hf{c}}ClD`e}{{Af{g}}}ChCj{}}{{{Hh{c}}ClD`e}{{Af{g}}}ChCj{}}{{{Hj{c}}ClD`e}{{Af{g}}}ChCj{}}{{{Hl{c}}ClD`e}{{Af{g}}}ChCj{}}{{{Hn{c}}ClD`e}{{Af{g}}}ChCj{}}{{{I`{c}}ClD`e}{{Af{g}}}ChCj{}}{{{Ib{c}}ClD`e}{{Af{g}}}ChCj{}}{{{Id{c}}ClD`e}{{Af{g}}}ChCj{}}{{{If{ce}}ClD`g}{{Af{i}}}IhChCj{}}{{{In{c}}ClD`e}{{Af{g}}}ChCj{}}{{{J`{c}}ClD`e}{{Af{g}}}ChCj{}}{{{Jb{c}}ClD`e}{{Af{g}}}ChCj{}}{{{Jd{c}}ClD`e}{{Af{g}}}ChCj{}}{{{Jf{c}}ClD`e}{{Af{g}}}ChCj{}}{{{Jh{c}}ClD`e}{{Af{g}}}ChCj{}}{{{Jj{c}}ClD`e}{{Af{g}}}ChCj{}}{{{Jl{c}}ClD`e}{{Af{g}}}ChCj{}}{{{Jn{c}}ClD`e}{{Af{g}}}ChCj{}}{{{K`{c}}ClD`e}{{Af{g}}}ChCj{}}{{{Kb{c}}ClD`e}{{Af{g}}}ChCj{}}{{{Kd{c}}ClD`e}{{Af{g}}}ChCj{}}{{{Kf{c}}ClD`e}{{Af{g}}}ChCj{}}{{{Kh{c}}ClD`e}{{Af{g}}}ChCj{}}{{{Kj{c}}ClD`e}{{Af{g}}}ChCj{}}{{{Kl{gc}}ClD`i}{{Af{k}}}Ch{{Gd{c}}}{{Ih{}{{Bj{e}}}}}Cj{}}{{{Kn{c}}ClD`e}{{Af{g}}}GhCj{}}{{{L`{c}}ClD`e}{{Af{g}}}GjCj{}}{{{Lb{c}}ClD`e}{{Af{g}}}HbCj{}}{{{Hf{c}}e}{{Af{g}}}ChCj{}}{{{Hh{c}}e}{{Af{g}}}ChCj{}}{{{Hj{c}}e}{{Af{g}}}ChCj{}}{{{Hl{c}}e}{{Af{g}}}ChCj{}}{{{Hn{c}}e}{{Af{g}}}ChCj{}}{{{I`{c}}e}{{Af{g}}}ChCj{}}{{{Ib{c}}e}{{Af{g}}}ChCj{}}{{{Id{c}}e}{{Af{g}}}ChCj{}}{{{If{ce}}g}{{Af{i}}}IhChCj{}}{{{In{c}}e}{{Af{g}}}ChCj{}}{{{J`{c}}e}{{Af{g}}}ChCj{}}{{{Jb{c}}e}{{Af{g}}}ChCj{}}{{{Jd{c}}e}{{Af{g}}}ChCj{}}{{{Jf{c}}e}{{Af{g}}}ChCj{}}{{{Jh{c}}e}{{Af{g}}}ChCj{}}{{{Jj{c}}e}{{Af{g}}}ChCj{}}{{{Jl{c}}e}{{Af{g}}}ChCj{}}{{{Jn{c}}e}{{Af{g}}}ChCj{}}{{{K`{c}}e}{{Af{g}}}ChCj{}}{{{Kb{c}}e}{{Af{g}}}ChCj{}}{{{Kd{c}}e}{{Af{g}}}ChCj{}}{{{Kf{c}}e}{{Af{g}}}ChCj{}}{{{Kh{c}}e}{{Af{g}}}ChCj{}}{{{Kj{c}}e}{{Af{g}}}ChCj{}}{{{Kl{gc}}i}{{Af{k}}}Ch{{Gd{c}}}{{Ih{}{{Bj{e}}}}}Cj{}}{{{Kn{c}}e}{{Af{g}}}GhCj{}}{{{L`{c}}e}{{Af{g}}}GjCj{}}{{{Lb{c}}e}{{Af{g}}}HbCj{}}{{{Hf{c}}e}{{Af{g}}}ChCj{}}{{{Hh{c}}e}{{Af{g}}}ChCj{}}{{{Hj{c}}e}{{Af{g}}}ChCj{}}{{{Hl{c}}e}{{Af{g}}}ChCj{}}{{{Hn{c}}e}{{Af{g}}}ChCj{}}{{{I`{c}}e}{{Af{g}}}ChCj{}}{{{Ib{c}}e}{{Af{g}}}ChCj{}}{{{Id{c}}e}{{Af{g}}}ChCj{}}{{{If{ce}}g}{{Af{i}}}IhChCj{}}{{{In{c}}e}{{Af{g}}}ChCj{}}{{{J`{c}}e}{{Af{g}}}ChCj{}}{{{Jb{c}}e}{{Af{g}}}ChCj{}}{{{Jd{c}}e}{{Af{g}}}ChCj{}}{{{Jf{c}}e}{{Af{g}}}ChCj{}}{{{Jh{c}}e}{{Af{g}}}ChCj{}}{{{Jj{c}}e}{{Af{g}}}ChCj{}}{{{Jl{c}}e}{{Af{g}}}ChCj{}}{{{Jn{c}}e}{{Af{g}}}ChCj{}}{{{K`{c}}e}{{Af{g}}}ChCj{}}{{{Kb{c}}e}{{Af{g}}}ChCj{}}{{{Kd{c}}e}{{Af{g}}}ChCj{}}{{{Kf{c}}e}{{Af{g}}}ChCj{}}{{{Kh{c}}e}{{Af{g}}}ChCj{}}{{{Kj{c}}e}{{Af{g}}}ChCj{}}{{{Kl{gc}}i}{{Af{k}}}Ch{{Gd{c}}}{{Ih{}{{Bj{e}}}}}Cj{}}{{{Kn{c}}e}{{Af{g}}}GhCj{}}{{{L`{c}}e}{{Af{g}}}GjCj{}}{{{Lb{c}}e}{{Af{g}}}HbCj{}}{{{Hf{c}}e}{{Af{g}}}ChCj{}}{{{Hh{c}}e}{{Af{g}}}ChCj{}}{{{Hj{c}}e}{{Af{g}}}ChCj{}}{{{Hl{c}}e}{{Af{g}}}ChCj{}}{{{Hn{c}}e}{{Af{g}}}ChCj{}}{{{I`{c}}e}{{Af{g}}}ChCj{}}{{{Ib{c}}e}{{Af{g}}}ChCj{}}{{{Id{c}}e}{{Af{g}}}ChCj{}}{{{If{ce}}g}{{Af{i}}}IhChCj{}}{{{In{c}}e}{{Af{g}}}ChCj{}}{{{J`{c}}e}{{Af{g}}}ChCj{}}{{{Jb{c}}e}{{Af{g}}}ChCj{}}{{{Jd{c}}e}{{Af{g}}}ChCj{}}{{{Jf{c}}e}{{Af{g}}}ChCj{}}{{{Jh{c}}e}{{Af{g}}}ChCj{}}{{{Jj{c}}e}{{Af{g}}}ChCj{}}{{{Jl{c}}e}{{Af{g}}}ChCj{}}{{{Jn{c}}e}{{Af{g}}}ChCj{}}{{{K`{c}}e}{{Af{g}}}ChCj{}}{{{Kb{c}}e}{{Af{g}}}ChCj{}}{{{Kd{c}}e}{{Af{g}}}ChCj{}}{{{Kf{c}}e}{{Af{g}}}ChCj{}}{{{Kh{c}}e}{{Af{g}}}ChCj{}}{{{Kj{c}}e}{{Af{g}}}ChCj{}}{{{Kl{gc}}i}{{Af{k}}}Ch{{Gd{c}}}{{Ih{}{{Bj{e}}}}}Cj{}}{{{Kn{c}}e}{{Af{g}}}GhCj{}}{{{L`{c}}e}{{Af{g}}}GjCj{}}{{{Lb{c}}e}{{Af{g}}}HbCj{}}{{{Hf{c}}e}{{Af{g}}}ChCj{}}{{{Hh{c}}e}{{Af{g}}}ChCj{}}{{{Hj{c}}e}{{Af{g}}}ChCj{}}{{{Hl{c}}e}{{Af{g}}}ChCj{}}{{{Hn{c}}e}{{Af{g}}}ChCj{}}{{{I`{c}}e}{{Af{g}}}ChCj{}}{{{Ib{c}}e}{{Af{g}}}ChCj{}}{{{Id{c}}e}{{Af{g}}}ChCj{}}{{{If{ce}}g}{{Af{i}}}IhChCj{}}{{{In{c}}e}{{Af{g}}}ChCj{}}{{{J`{c}}e}{{Af{g}}}ChCj{}}{{{Jb{c}}e}{{Af{g}}}ChCj{}}{{{Jd{c}}e}{{Af{g}}}ChCj{}}{{{Jf{c}}e}{{Af{g}}}ChCj{}}{{{Jh{c}}e}{{Af{g}}}ChCj{}}{{{Jj{c}}e}{{Af{g}}}ChCj{}}{{{Jl{c}}e}{{Af{g}}}ChCj{}}{{{Jn{c}}e}{{Af{g}}}ChCj{}}{{{K`{c}}e}{{Af{g}}}ChCj{}}{{{Kb{c}}e}{{Af{g}}}ChCj{}}{{{Kd{c}}e}{{Af{g}}}ChCj{}}{{{Kf{c}}e}{{Af{g}}}ChCj{}}{{{Kh{c}}e}{{Af{g}}}ChCj{}}{{{Kj{c}}e}{{Af{g}}}ChCj{}}{{{Kl{gc}}i}{{Af{k}}}Ch{{Gd{c}}}{{Ih{}{{Bj{e}}}}}Cj{}}{{{Kn{c}}e}{{Af{g}}}GhCj{}}{{{L`{c}}e}{{Af{g}}}GjCj{}}{{{Lb{c}}e}{{Af{g}}}HbCj{}}{{{Hf{c}}e}{{Af{g}}}ChCj{}}{{{Hh{c}}e}{{Af{g}}}ChCj{}}{{{Hj{c}}e}{{Af{g}}}ChCj{}}{{{Hl{c}}e}{{Af{g}}}ChCj{}}{{{Hn{c}}e}{{Af{g}}}ChCj{}}{{{I`{c}}e}{{Af{g}}}ChCj{}}{{{Ib{c}}e}{{Af{g}}}ChCj{}}{{{Id{c}}e}{{Af{g}}}ChCj{}}{{{If{ce}}g}{{Af{i}}}IhChCj{}}{{{In{c}}e}{{Af{g}}}ChCj{}}{{{J`{c}}e}{{Af{g}}}ChCj{}}{{{Jb{c}}e}{{Af{g}}}ChCj{}}{{{Jd{c}}e}{{Af{g}}}ChCj{}}{{{Jf{c}}e}{{Af{g}}}ChCj{}}{{{Jh{c}}e}{{Af{g}}}ChCj{}}{{{Jj{c}}e}{{Af{g}}}ChCj{}}{{{Jl{c}}e}{{Af{g}}}ChCj{}}{{{Jn{c}}e}{{Af{g}}}ChCj{}}{{{K`{c}}e}{{Af{g}}}ChCj{}}{{{Kb{c}}e}{{Af{g}}}ChCj{}}{{{Kd{c}}e}{{Af{g}}}ChCj{}}{{{Kf{c}}e}{{Af{g}}}ChCj{}}{{{Kh{c}}e}{{Af{g}}}ChCj{}}{{{Kj{c}}e}{{Af{g}}}ChCj{}}{{{Kl{gc}}i}{{Af{k}}}Ch{{Gd{c}}}{{Ih{}{{Bj{e}}}}}Cj{}}{{{Kn{c}}e}{{Af{g}}}GhCj{}}{{{L`{c}}e}{{Af{g}}}GjCj{}}{{{Lb{c}}e}{{Af{g}}}HbCj{}}{{{Hf{c}}e}{{Af{g}}}ChCj{}}{{{Hh{c}}e}{{Af{g}}}ChCj{}}{{{Hj{c}}e}{{Af{g}}}ChCj{}}{{{Hl{c}}e}{{Af{g}}}ChCj{}}{{{Hn{c}}e}{{Af{g}}}ChCj{}}{{{I`{c}}e}{{Af{g}}}ChCj{}}{{{Ib{c}}e}{{Af{g}}}ChCj{}}{{{Id{c}}e}{{Af{g}}}ChCj{}}{{{If{ce}}g}{{Af{i}}}IhChCj{}}{{{In{c}}e}{{Af{g}}}ChCj{}}{{{J`{c}}e}{{Af{g}}}ChCj{}}{{{Jb{c}}e}{{Af{g}}}ChCj{}}{{{Jd{c}}e}{{Af{g}}}ChCj{}}{{{Jf{c}}e}{{Af{g}}}ChCj{}}{{{Jh{c}}e}{{Af{g}}}ChCj{}}{{{Jj{c}}e}{{Af{g}}}ChCj{}}{{{Jl{c}}e}{{Af{g}}}ChCj{}}{{{Jn{c}}e}{{Af{g}}}ChCj{}}{{{K`{c}}e}{{Af{g}}}ChCj{}}{{{Kb{c}}e}{{Af{g}}}ChCj{}}{{{Kd{c}}e}{{Af{g}}}ChCj{}}{{{Kf{c}}e}{{Af{g}}}ChCj{}}{{{Kh{c}}e}{{Af{g}}}ChCj{}}{{{Kj{c}}e}{{Af{g}}}ChCj{}}{{{Kl{gc}}i}{{Af{k}}}Ch{{Gd{c}}}{{Ih{}{{Bj{e}}}}}Cj{}}{{{Kn{c}}e}{{Af{g}}}GhCj{}}{{{L`{c}}e}{{Af{g}}}GjCj{}}{{{Lb{c}}e}{{Af{g}}}HbCj{}}{{{Hf{c}}Cle}{{Af{g}}}ChCj{}}{{{Hh{c}}Cle}{{Af{g}}}ChCj{}}{{{Hj{c}}Cle}{{Af{g}}}ChCj{}}{{{Hl{c}}Cle}{{Af{g}}}ChCj{}}{{{Hn{c}}Cle}{{Af{g}}}ChCj{}}{{{I`{c}}Cle}{{Af{g}}}ChCj{}}{{{Ib{c}}Cle}{{Af{g}}}ChCj{}}{{{Id{c}}Cle}{{Af{g}}}ChCj{}}{{{If{ce}}Clg}{{Af{i}}}IhChCj{}}{{{In{c}}Cle}{{Af{g}}}ChCj{}}{{{J`{c}}Cle}{{Af{g}}}ChCj{}}{{{Jb{c}}Cle}{{Af{g}}}ChCj{}}{{{Jd{c}}Cle}{{Af{g}}}ChCj{}}{{{Jf{c}}Cle}{{Af{g}}}ChCj{}}{{{Jh{c}}Cle}{{Af{g}}}ChCj{}}{{{Jj{c}}Cle}{{Af{g}}}ChCj{}}{{{Jl{c}}Cle}{{Af{g}}}ChCj{}}{{{Jn{c}}Cle}{{Af{g}}}ChCj{}}{{{K`{c}}Cle}{{Af{g}}}ChCj{}}{{{Kb{c}}Cle}{{Af{g}}}ChCj{}}{{{Kd{c}}Cle}{{Af{g}}}ChCj{}}{{{Kf{c}}Cle}{{Af{g}}}ChCj{}}{{{Kh{c}}Cle}{{Af{g}}}ChCj{}}{{{Kj{c}}Cle}{{Af{g}}}ChCj{}}{{{Kl{gc}}Cli}{{Af{k}}}Ch{{Gd{c}}}{{Ih{}{{Bj{e}}}}}Cj{}}{{{Kn{c}}Cle}{{Af{g}}}GhCj{}}{{{L`{c}}Cle}{{Af{g}}}GjCj{}}{{{Lb{c}}Cle}{{Af{g}}}HbCj{}}{{{If{ce}}}{{Af{Fde}}}IhCh}{{{Kl{ce}}}{{Af{Fde}}}IhCh}{{IlIl}Db}{{{Hf{c}}Fj}Fl{}}{{{Hh{c}}Fj}Fl{}}{{{Hj{c}}Fj}Fl{}}{{{Hl{c}}Fj}Fl{}}{{{Hn{c}}Fj}Fl{}}{{{I`{c}}Fj}Fl{}}{{{Ib{c}}Fj}Fl{}}{{{Id{c}}Fj}Fl{}}{{{If{ce}}Fj}Fl{IhLd}{}}{{IlFj}Fl}0{{{In{c}}Fj}Fl{}}{{{J`{c}}Fj}Fl{}}{{{Jb{c}}Fj}Fl{}}{{{Jd{c}}Fj}Fl{}}{{{Jf{c}}Fj}Fl{}}{{{Jh{c}}Fj}Fl{}}{{{Jj{c}}Fj}Fl{}}{{{Jl{c}}Fj}Fl{}}{{{Jn{c}}Fj}Fl{}}{{{K`{c}}Fj}Fl{}}{{{Kb{c}}Fj}Fl{}}{{{Kd{c}}Fj}Fl{}}{{{Kf{c}}Fj}Fl{}}{{{Kh{c}}Fj}Fl{}}{{{Kj{c}}Fj}Fl{}}{{{Kl{ce}}Fj}FlLd{}}{{{Kn{c}}Fj}FlLd}{{{L`{c}}Fj}FlLd}{{{Lb{c}}Fj}FlLd}{cc{}}0000000000000000000000000000{ce{}{}}0000000000000000000000000000{{}{{Hf{c}}}{}}{Eh{{Hh{c}}}{}}{Cl{{Hj{c}}}{}}{Cl{{Hl{c}}}{}}{Gl{{Hn{c}}}{}}{{{Lf{Cl}}}{{I`{c}}}{}}{{{Cn{Dd}}}{{Ib{c}}}{}}{{{Cn{Dd}}}{{Id{c}}}{}}{c{{If{ce}}}Ih{}}{Db{{In{c}}}{}}{Ed{{J`{c}}}{}}{Dn{{Jb{c}}}{}}{E`{{Jd{c}}}{}}{Eb{{Jf{c}}}{}}{Dl{{Jh{c}}}{}}{Lh{{Jj{c}}}{}}{Dd{{Jl{c}}}{}}{El{{Jn{c}}}{}}{En{{K`{c}}}{}}{Ej{{Kb{c}}}{}}{D`{{Kd{c}}}{}}{Dh{{Kf{c}}}{}}{Dj{{Kh{c}}}{}}{Df{{Kj{c}}}{}}{c{{Kl{ce}}}Ih{}}{c{{Kn{c}}}{}}{c{{L`{c}}}{}}{c{{Lb{c}}}{}}{{{If{ce}}g}{{Af{Efi}}}IhChFh{}}{{{Kl{gc}}i}{{Af{Efk}}}Ch{{Gd{c}}}{{Ih{}{{Bj{e}}}}}Fh{}}{{{If{ce}}gi}{{Af{{Ef{Bl}}k}}}IhChFhFh{}}2{{{If{ce}}g}{{Af{i}}}IhChFh{}}{{{If{ce}}}{{Ef{D`}}}IhCh}0{{{Kl{gc}}}{{Ef{D`}}}Ch{{Gd{c}}}{{Ih{}{{Bj{e}}}}}}{ce{}{}}0000000000000000000000000000{cGl{}}{c{{Af{e}}}{}{}}000000000000000000000000000000000000000000000000000000000{cGn{}}0000000000000000000000000000{{{Hh{c}}e}{{Af{{Bl{g}}i}}}ChFh{}{}}{{{Hj{c}}e}{{Af{{Bl{g}}i}}}ChFh{}{}}{{{Hl{c}}e}{{Af{{Bl{g}}i}}}ChFh{}{}}{{{Hn{c}}e}{{Af{{Bl{g}}i}}}ChFh{}{}}{{{I`{c}}e}{{Af{{Bl{g}}i}}}ChFh{}{}}{{{L`{c}}e}{{Af{{Bl{g}}i}}}GjFh{}{}}```````````````````````````````````99{{{Ad{}{{b{c}}{d{e}}{f{g}}{h{i}}{j{k}}{l{m}}{n{o}}{A`{Aa}}{Ab{Ac}}}}Ai}{{Af{ce}}}{}Ah{{Aj{}{{b{c}}{d{e}}}}}{{Al{}{{b{c}}{d{e}}}}}{{An{}{{b{c}}{d{e}}}}}{{B`{}{{b{c}}{d{e}}}}}{{Bb{}{{b{c}}{d{e}}}}}{{Bd{}{{b{c}}{d{e}}}}}{{Bf{}{{b{c}}{d{e}}}}}BhBh{{Bn{}{{Bj{{Bl{AeAg}}}}}}}}{{{Ad{}{{b{c}}{d{e}}{f{g}}{h{i}}{j{k}}{l{m}}{n{o}}{A`{Aa}}{Ab{Ac}}}}Ae}{{Af{ce}}}{}Ah{{Aj{}{{b{c}}{d{e}}}}}{{Al{}{{b{c}}{d{e}}}}}{{An{}{{b{c}}{d{e}}}}}{{B`{}{{b{c}}{d{e}}}}}{{Bb{}{{b{c}}{d{e}}}}}{{Bd{}{{b{c}}{d{e}}}}}{{Bf{}{{b{c}}{d{e}}}}}Bn}{{{Ad{}{{b{c}}{d{e}}{f{g}}{h{i}}{j{k}}{l{m}}{n{o}}{A`{Aa}}{Ab{Ac}}}}Ae}{{Af{ce}}}{}Ah{{Aj{}{{b{c}}{d{e}}}}}{{Al{}{{b{c}}{d{e}}}}}{{An{}{{b{c}}{d{e}}}}}{{B`{}{{b{c}}{d{e}}}}}{{Bb{}{{b{c}}{d{e}}}}}{{Bd{}{{b{c}}{d{e}}}}}{{Bf{}{{b{c}}{d{e}}}}}{C`Cb}}{cAhCb}{{{Aj{}{{b{c}}{d{e}}}}}{{Af{ce}}}{}Ah}{{{Al{}{{b{c}}{d{e}}}}}{{Af{ce}}}{}Ah}{{{An{}{{b{c}}{d{e}}}}}{{Af{ce}}}{}Ah}{{{B`{}{{b{c}}{d{e}}}}}{{Af{ce}}}{}Ah}{{{Bb{}{{b{c}}{d{e}}}}}{{Af{ce}}}{}Ah}{{{Bd{}{{b{c}}{d{e}}}}}{{Af{ce}}}{}Ah}{{{Bf{}{{b{c}}{d{e}}}}}{{Af{ce}}}{}Ah}{{{Lj{ce}}}{{Af{ce}}}{}Ah}000000{cc{}}{ce{}{}}{{{Ad{}{{b{c}}{d{e}}{f{g}}{h{i}}{j{k}}{l{m}}{n{o}}{A`{Aa}}{Ab{Ac}}}}}Db{}Ah{{Aj{}{{b{c}}{d{e}}}}}{{Al{}{{b{c}}{d{e}}}}}{{An{}{{b{c}}{d{e}}}}}{{B`{}{{b{c}}{d{e}}}}}{{Bb{}{{b{c}}{d{e}}}}}{{Bd{}{{b{c}}{d{e}}}}}{{Bf{}{{b{c}}{d{e}}}}}}{{Bhc}AfAd}{{{Ad{}{{b{c}}{d{e}}{f{g}}{h{i}}{j{k}}{l{m}}{n{o}}{A`{Aa}}{Ab{Ac}}}}Db}{{Af{ce}}}{}Ah{{Aj{}{{b{c}}{d{e}}}}}{{Al{}{{b{c}}{d{e}}}}}{{An{}{{b{c}}{d{e}}}}}{{B`{}{{b{c}}{d{e}}}}}{{Bb{}{{b{c}}{d{e}}}}}{{Bd{}{{b{c}}{d{e}}}}}{{Bf{}{{b{c}}{d{e}}}}}}{{{Ad{}{{b{c}}{d{e}}{f{g}}{h{i}}{j{k}}{l{m}}{n{o}}{A`{Aa}}{Ab{Ac}}}}{Cn{Dd}}}{{Af{ce}}}{}Ah{{Aj{}{{b{c}}{d{e}}}}}{{Al{}{{b{c}}{d{e}}}}}{{An{}{{b{c}}{d{e}}}}}{{B`{}{{b{c}}{d{e}}}}}{{Bb{}{{b{c}}{d{e}}}}}{{Bd{}{{b{c}}{d{e}}}}}{{Bf{}{{b{c}}{d{e}}}}}}{{{Ad{}{{b{c}}{d{e}}{f{g}}{h{i}}{j{k}}{l{m}}{n{o}}{A`{Aa}}{Ab{Ac}}}}Df}{{Af{ce}}}{}Ah{{Aj{}{{b{c}}{d{e}}}}}{{Al{}{{b{c}}{d{e}}}}}{{An{}{{b{c}}{d{e}}}}}{{B`{}{{b{c}}{d{e}}}}}{{Bb{}{{b{c}}{d{e}}}}}{{Bd{}{{b{c}}{d{e}}}}}{{Bf{}{{b{c}}{d{e}}}}}}{{{Aj{}{{b{c}}{d{e}}}}g}{{Af{Fde}}}{}Ah{C`Bh}}{{{Al{}{{b{c}}{d{e}}}}g}{{Af{Fde}}}{}Ah{C`Bh}}{{{Lj{ce}}g}{{Af{Fde}}}{}Ah{C`Bh}}0{{{Bb{}{{b{c}}{d{e}}}}gi}{{Af{Fde}}}{}Ah{C`Bh}{C`Bh}}{{{Ad{}{{b{c}}{d{e}}{f{g}}{h{i}}{j{k}}{l{m}}{n{o}}{A`{Aa}}{Ab{Ac}}}}Dh}{{Af{ce}}}{}Ah{{Aj{}{{b{c}}{d{e}}}}}{{Al{}{{b{c}}{d{e}}}}}{{An{}{{b{c}}{d{e}}}}}{{B`{}{{b{c}}{d{e}}}}}{{Bb{}{{b{c}}{d{e}}}}}{{Bd{}{{b{c}}{d{e}}}}}{{Bf{}{{b{c}}{d{e}}}}}}{{{Ad{}{{b{c}}{d{e}}{f{g}}{h{i}}{j{k}}{l{m}}{n{o}}{A`{Aa}}{Ab{Ac}}}}Dj}{{Af{ce}}}{}Ah{{Aj{}{{b{c}}{d{e}}}}}{{Al{}{{b{c}}{d{e}}}}}{{An{}{{b{c}}{d{e}}}}}{{B`{}{{b{c}}{d{e}}}}}{{Bb{}{{b{c}}{d{e}}}}}{{Bd{}{{b{c}}{d{e}}}}}{{Bf{}{{b{c}}{d{e}}}}}}{{{An{}{{b{c}}{d{e}}}}g}{{Af{Fde}}}{}Ah{C`Bh}}{{{B`{}{{b{c}}{d{e}}}}g}{{Af{Fde}}}{}Ah{C`Bh}}{{{Bd{}{{b{c}}{d{e}}}}Clg}{{Af{Fde}}}{}Ah{C`Bh}}{{{Bf{}{{b{c}}{d{e}}}}Clg}{{Af{Fde}}}{}Ah{C`Bh}}77{{{Lj{ce}}Clg}{{Af{Fde}}}{}Ah{C`Bh}}0{{{Ad{}{{b{c}}{d{e}}{f{g}}{h{i}}{j{k}}{l{m}}{n{o}}{A`{Aa}}{Ab{Ac}}}}Dl}{{Af{ce}}}{}Ah{{Aj{}{{b{c}}{d{e}}}}}{{Al{}{{b{c}}{d{e}}}}}{{An{}{{b{c}}{d{e}}}}}{{B`{}{{b{c}}{d{e}}}}}{{Bb{}{{b{c}}{d{e}}}}}{{Bd{}{{b{c}}{d{e}}}}}{{Bf{}{{b{c}}{d{e}}}}}}{{{Ad{}{{b{c}}{d{e}}{f{g}}{h{i}}{j{k}}{l{m}}{n{o}}{A`{Aa}}{Ab{Ac}}}}Dn}{{Af{ce}}}{}Ah{{Aj{}{{b{c}}{d{e}}}}}{{Al{}{{b{c}}{d{e}}}}}{{An{}{{b{c}}{d{e}}}}}{{B`{}{{b{c}}{d{e}}}}}{{Bb{}{{b{c}}{d{e}}}}}{{Bd{}{{b{c}}{d{e}}}}}{{Bf{}{{b{c}}{d{e}}}}}}{{{Ad{}{{b{c}}{d{e}}{f{g}}{h{i}}{j{k}}{l{m}}{n{o}}{A`{Aa}}{Ab{Ac}}}}E`}{{Af{ce}}}{}Ah{{Aj{}{{b{c}}{d{e}}}}}{{Al{}{{b{c}}{d{e}}}}}{{An{}{{b{c}}{d{e}}}}}{{B`{}{{b{c}}{d{e}}}}}{{Bb{}{{b{c}}{d{e}}}}}{{Bd{}{{b{c}}{d{e}}}}}{{Bf{}{{b{c}}{d{e}}}}}}{{{Ad{}{{b{c}}{d{e}}{f{g}}{h{i}}{j{k}}{l{m}}{n{o}}{A`{Aa}}{Ab{Ac}}}}Eb}{{Af{ce}}}{}Ah{{Aj{}{{b{c}}{d{e}}}}}{{Al{}{{b{c}}{d{e}}}}}{{An{}{{b{c}}{d{e}}}}}{{B`{}{{b{c}}{d{e}}}}}{{Bb{}{{b{c}}{d{e}}}}}{{Bd{}{{b{c}}{d{e}}}}}{{Bf{}{{b{c}}{d{e}}}}}}{{{Ad{}{{b{c}}{d{e}}{f{g}}{h{i}}{j{k}}{l{m}}{n{o}}{A`{Aa}}{Ab{Ac}}}}Ed}{{Af{ce}}}{}Ah{{Aj{}{{b{c}}{d{e}}}}}{{Al{}{{b{c}}{d{e}}}}}{{An{}{{b{c}}{d{e}}}}}{{B`{}{{b{c}}{d{e}}}}}{{Bb{}{{b{c}}{d{e}}}}}{{Bd{}{{b{c}}{d{e}}}}}{{Bf{}{{b{c}}{d{e}}}}}}{{{Bb{}{{b{c}}{d{e}}}}g}{{Af{Fde}}}{}Ah{C`Bh}}>{{{Ad{}{{b{c}}{d{e}}{f{g}}{h{i}}{j{k}}{l{m}}{n{o}}{A`{Aa}}{Ab{Ac}}}}{Ef{D`}}}{{Af{oe}}}{}Ah{{Aj{}{{b{c}}{d{e}}}}}{{Al{}{{b{c}}{d{e}}}}}{{An{}{{b{c}}{d{e}}}}}{{B`{}{{b{c}}{d{e}}}}}{{Bb{}{{b{c}}{d{e}}}}}{{Bd{}{{b{c}}{d{e}}}}}{{Bf{}{{b{c}}{d{e}}}}}}{{{Ad{}{{b{c}}{d{e}}{f{g}}{h{i}}{j{k}}{l{m}}{n{o}}{A`{Aa}}{Ab{Ac}}}}ClAe}{{Af{ce}}}{}Ah{{Aj{}{{b{c}}{d{e}}}}}{{Al{}{{b{c}}{d{e}}}}}{{An{}{{b{c}}{d{e}}}}}{{B`{}{{b{c}}{d{e}}}}}{{Bb{}{{b{c}}{d{e}}}}}{{Bd{}{{b{c}}{d{e}}}}}{{Bf{}{{b{c}}{d{e}}}}}{C`Bh}}{{{Ad{}{{b{c}}{d{e}}{f{g}}{h{i}}{j{k}}{l{m}}{n{o}}{A`{Aa}}{Ab{Ac}}}}ClEhClAe}{{Af{ce}}}{}Ah{{Aj{}{{b{c}}{d{e}}}}}{{Al{}{{b{c}}{d{e}}}}}{{An{}{{b{c}}{d{e}}}}}{{B`{}{{b{c}}{d{e}}}}}{{Bb{}{{b{c}}{d{e}}}}}{{Bd{}{{b{c}}{d{e}}}}}{{Bf{}{{b{c}}{d{e}}}}}{C`Bh}}{{{Ad{}{{b{c}}{d{e}}{f{g}}{h{i}}{j{k}}{l{m}}{n{o}}{A`{Aa}}{Ab{Ac}}}}}{{Af{ce}}}{}Ah{{Aj{}{{b{c}}{d{e}}}}}{{Al{}{{b{c}}{d{e}}}}}{{An{}{{b{c}}{d{e}}}}}{{B`{}{{b{c}}{d{e}}}}}{{Bb{}{{b{c}}{d{e}}}}}{{Bd{}{{b{c}}{d{e}}}}}{{Bf{}{{b{c}}{d{e}}}}}}{{{Ad{}{{b{c}}{d{e}}{f{g}}{h{i}}{j{k}}{l{m}}{n{o}}{A`{Aa}}{Ab{Ac}}}}{Ef{D`}}}{{Af{ge}}}{}Ah{{Aj{}{{b{c}}{d{e}}}}}{{Al{}{{b{c}}{d{e}}}}}{{An{}{{b{c}}{d{e}}}}}{{B`{}{{b{c}}{d{e}}}}}{{Bb{}{{b{c}}{d{e}}}}}{{Bd{}{{b{c}}{d{e}}}}}{{Bf{}{{b{c}}{d{e}}}}}}{{{Ad{}{{b{c}}{d{e}}{f{g}}{h{i}}{j{k}}{l{m}}{n{o}}{A`{Aa}}{Ab{Ac}}}}Ae}{{Af{ce}}}{}Ah{{Aj{}{{b{c}}{d{e}}}}}{{Al{}{{b{c}}{d{e}}}}}{{An{}{{b{c}}{d{e}}}}}{{B`{}{{b{c}}{d{e}}}}}{{Bb{}{{b{c}}{d{e}}}}}{{Bd{}{{b{c}}{d{e}}}}}{{Bf{}{{b{c}}{d{e}}}}}{C`Bh}}{{{Ad{}{{b{c}}{d{e}}{f{g}}{h{i}}{j{k}}{l{m}}{n{o}}{A`{Aa}}{Ab{Ac}}}}Cl}{{Af{ce}}}{}Ah{{Aj{}{{b{c}}{d{e}}}}}{{Al{}{{b{c}}{d{e}}}}}{{An{}{{b{c}}{d{e}}}}}{{B`{}{{b{c}}{d{e}}}}}{{Bb{}{{b{c}}{d{e}}}}}{{Bd{}{{b{c}}{d{e}}}}}{{Bf{}{{b{c}}{d{e}}}}}}{{{Ad{}{{b{c}}{d{e}}{f{g}}{h{i}}{j{k}}{l{m}}{n{o}}{A`{Aa}}{Ab{Ac}}}}ClD`}{{Af{Aae}}}{}Ah{{Aj{}{{b{c}}{d{e}}}}}{{Al{}{{b{c}}{d{e}}}}}{{An{}{{b{c}}{d{e}}}}}{{B`{}{{b{c}}{d{e}}}}}{{Bb{}{{b{c}}{d{e}}}}}{{Bd{}{{b{c}}{d{e}}}}}{{Bf{}{{b{c}}{d{e}}}}}}{{{Ad{}{{b{c}}{d{e}}{f{g}}{h{i}}{j{k}}{l{m}}{n{o}}{A`{Aa}}{Ab{Ac}}}}ClEhClD`}{{Af{Ace}}}{}Ah{{Aj{}{{b{c}}{d{e}}}}}{{Al{}{{b{c}}{d{e}}}}}{{An{}{{b{c}}{d{e}}}}}{{B`{}{{b{c}}{d{e}}}}}{{Bb{}{{b{c}}{d{e}}}}}{{Bd{}{{b{c}}{d{e}}}}}{{Bf{}{{b{c}}{d{e}}}}}}{{{Ad{}{{b{c}}{d{e}}{f{g}}{h{i}}{j{k}}{l{m}}{n{o}}{A`{Aa}}{Ab{Ac}}}}D`}{{Af{ie}}}{}Ah{{Aj{}{{b{c}}{d{e}}}}}{{Al{}{{b{c}}{d{e}}}}}{{An{}{{b{c}}{d{e}}}}}{{B`{}{{b{c}}{d{e}}}}}{{Bb{}{{b{c}}{d{e}}}}}{{Bd{}{{b{c}}{d{e}}}}}{{Bf{}{{b{c}}{d{e}}}}}}{{{Ad{}{{b{c}}{d{e}}{f{g}}{h{i}}{j{k}}{l{m}}{n{o}}{A`{Aa}}{Ab{Ac}}}}ClD`}{{Af{ke}}}{}Ah{{Aj{}{{b{c}}{d{e}}}}}{{Al{}{{b{c}}{d{e}}}}}{{An{}{{b{c}}{d{e}}}}}{{B`{}{{b{c}}{d{e}}}}}{{Bb{}{{b{c}}{d{e}}}}}{{Bd{}{{b{c}}{d{e}}}}}{{Bf{}{{b{c}}{d{e}}}}}}{{{Ad{}{{b{c}}{d{e}}{f{g}}{h{i}}{j{k}}{l{m}}{n{o}}{A`{Aa}}{Ab{Ac}}}}ClEhClD`}{{Af{me}}}{}Ah{{Aj{}{{b{c}}{d{e}}}}}{{Al{}{{b{c}}{d{e}}}}}{{An{}{{b{c}}{d{e}}}}}{{B`{}{{b{c}}{d{e}}}}}{{Bb{}{{b{c}}{d{e}}}}}{{Bd{}{{b{c}}{d{e}}}}}{{Bf{}{{b{c}}{d{e}}}}}}{{{Ad{}{{b{c}}{d{e}}{f{g}}{h{i}}{j{k}}{l{m}}{n{o}}{A`{Aa}}{Ab{Ac}}}}Ej}{{Af{ce}}}{}Ah{{Aj{}{{b{c}}{d{e}}}}}{{Al{}{{b{c}}{d{e}}}}}{{An{}{{b{c}}{d{e}}}}}{{B`{}{{b{c}}{d{e}}}}}{{Bb{}{{b{c}}{d{e}}}}}{{Bd{}{{b{c}}{d{e}}}}}{{Bf{}{{b{c}}{d{e}}}}}}{{{Ad{}{{b{c}}{d{e}}{f{g}}{h{i}}{j{k}}{l{m}}{n{o}}{A`{Aa}}{Ab{Ac}}}}El}{{Af{ce}}}{}Ah{{Aj{}{{b{c}}{d{e}}}}}{{Al{}{{b{c}}{d{e}}}}}{{An{}{{b{c}}{d{e}}}}}{{B`{}{{b{c}}{d{e}}}}}{{Bb{}{{b{c}}{d{e}}}}}{{Bd{}{{b{c}}{d{e}}}}}{{Bf{}{{b{c}}{d{e}}}}}}{{{Ad{}{{b{c}}{d{e}}{f{g}}{h{i}}{j{k}}{l{m}}{n{o}}{A`{Aa}}{Ab{Ac}}}}Eh}{{Af{ce}}}{}Ah{{Aj{}{{b{c}}{d{e}}}}}{{Al{}{{b{c}}{d{e}}}}}{{An{}{{b{c}}{d{e}}}}}{{B`{}{{b{c}}{d{e}}}}}{{Bb{}{{b{c}}{d{e}}}}}{{Bd{}{{b{c}}{d{e}}}}}{{Bf{}{{b{c}}{d{e}}}}}}{{{Ad{}{{b{c}}{d{e}}{f{g}}{h{i}}{j{k}}{l{m}}{n{o}}{A`{Aa}}{Ab{Ac}}}}En}{{Af{ce}}}{}Ah{{Aj{}{{b{c}}{d{e}}}}}{{Al{}{{b{c}}{d{e}}}}}{{An{}{{b{c}}{d{e}}}}}{{B`{}{{b{c}}{d{e}}}}}{{Bb{}{{b{c}}{d{e}}}}}{{Bd{}{{b{c}}{d{e}}}}}{{Bf{}{{b{c}}{d{e}}}}}}{{{Ad{}{{b{c}}{d{e}}{f{g}}{h{i}}{j{k}}{l{m}}{n{o}}{A`{Aa}}{Ab{Ac}}}}Dd}{{Af{ce}}}{}Ah{{Aj{}{{b{c}}{d{e}}}}}{{Al{}{{b{c}}{d{e}}}}}{{An{}{{b{c}}{d{e}}}}}{{B`{}{{b{c}}{d{e}}}}}{{Bb{}{{b{c}}{d{e}}}}}{{Bd{}{{b{c}}{d{e}}}}}{{Bf{}{{b{c}}{d{e}}}}}}=:{{{Ad{}{{b{c}}{d{e}}{f{g}}{h{i}}{j{k}}{l{m}}{n{o}}{A`{Aa}}{Ab{Ac}}}}ClEhCl}{{Af{ce}}}{}Ah{{Aj{}{{b{c}}{d{e}}}}}{{Al{}{{b{c}}{d{e}}}}}{{An{}{{b{c}}{d{e}}}}}{{B`{}{{b{c}}{d{e}}}}}{{Bb{}{{b{c}}{d{e}}}}}{{Bd{}{{b{c}}{d{e}}}}}{{Bf{}{{b{c}}{d{e}}}}}}{{{Bb{}{{b{c}}{d{e}}}}g}{{Af{Fde}}}{}Ah{C`Bh}}{{{Lj{ce}}g}{{Af{Fde}}}{}Ah{C`Bh}}{{{Bd{}{{b{c}}{d{e}}}}Cl}{{Af{Fde}}}{}Ah}{{{Bf{}{{b{c}}{d{e}}}}Cl}{{Af{Fde}}}{}Ah}{c{{Af{e}}}{}{}}0{cGn{}}","c":[],"p":[[17,"Ok"],[17,"Error"],[17,"SerializeSeq"],[17,"SerializeTuple"],[17,"SerializeTupleStruct"],[17,"SerializeTupleVariant"],[17,"SerializeMap"],[17,"SerializeStruct"],[17,"SerializeStructVariant"],[10,"Serializer",0],[6,"Result",1642],[10,"Error",1531],[10,"SerializeSeq",1531],[10,"SerializeTuple",1531],[10,"SerializeTupleStruct",1531],[10,"SerializeTupleVariant",1531],[10,"SerializeMap",1531],[10,"SerializeStruct",1531],[10,"SerializeStructVariant",1531],[10,"Serialize",0],[17,"Item"],[1,"tuple"],[10,"IntoIterator",1643],[10,"Sized",1644],[10,"Display",1645],[10,"Deserialize",0],[10,"Deserializer",0],[10,"Error",87],[10,"Visitor",87],[1,"str"],[1,"slice"],[1,"usize"],[1,"bool"],[1,"u8"],[1,"char"],[1,"f32"],[1,"f64"],[1,"i128"],[1,"i16"],[1,"i32"],[1,"i64"],[1,"i8"],[6,"Option",1646],[1,"u32"],[1,"u128"],[1,"u16"],[1,"u64"],[5,"IgnoredAny",87],[6,"Unexpected",87],[1,"unit"],[17,"Value"],[10,"DeserializeSeed",87],[5,"Formatter",1645],[8,"Result",1645],[10,"Expected",87],[5,"Error",1645],[17,"Deserializer"],[10,"IntoDeserializer",87],[10,"VariantAccess",87],[10,"SeqAccess",87],[10,"MapAccess",87],[5,"String",1647],[5,"TypeId",1648],[17,"Variant"],[10,"EnumAccess",87],[5,"Vec",1649],[5,"UnitDeserializer",265],[5,"U32Deserializer",265],[5,"StrDeserializer",265],[5,"BorrowedStrDeserializer",265],[5,"StringDeserializer",265],[5,"CowStrDeserializer",265],[5,"BytesDeserializer",265],[5,"BorrowedBytesDeserializer",265],[5,"MapDeserializer",265],[10,"Iterator",1650],[10,"Clone",1651],[5,"Error",265],[5,"BoolDeserializer",265],[5,"I8Deserializer",265],[5,"I16Deserializer",265],[5,"I32Deserializer",265],[5,"I64Deserializer",265],[5,"I128Deserializer",265],[5,"IsizeDeserializer",265],[5,"U8Deserializer",265],[5,"U16Deserializer",265],[5,"U64Deserializer",265],[5,"U128Deserializer",265],[5,"UsizeDeserializer",265],[5,"F32Deserializer",265],[5,"F64Deserializer",265],[5,"CharDeserializer",265],[5,"SeqDeserializer",265],[5,"SeqAccessDeserializer",265],[5,"MapAccessDeserializer",265],[5,"EnumAccessDeserializer",265],[10,"Debug",1645],[6,"Cow",1652],[1,"isize"],[5,"Impossible",1531]],"b":[[182,"impl-Debug-for-Unexpected%3C\'a%3E"],[183,"impl-Display-for-Unexpected%3C\'a%3E"],[410,"impl-Error-for-Error"],[411,"impl-Error-for-Error"],[1293,"impl-Debug-for-Error"],[1294,"impl-Display-for-Error"],[1405,"impl-MapAccess%3C\'de%3E-for-MapDeserializer%3C\'de,+I,+E%3E"],[1406,"impl-SeqAccess%3C\'de%3E-for-MapDeserializer%3C\'de,+I,+E%3E"],[1579,"impl-SerializeSeq-for-Impossible%3COk,+Error%3E"],[1580,"impl-SerializeStruct-for-Impossible%3COk,+Error%3E"],[1581,"impl-SerializeMap-for-Impossible%3COk,+Error%3E"],[1582,"impl-SerializeStructVariant-for-Impossible%3COk,+Error%3E"],[1583,"impl-SerializeTupleStruct-for-Impossible%3COk,+Error%3E"],[1584,"impl-SerializeTuple-for-Impossible%3COk,+Error%3E"],[1585,"impl-SerializeTupleVariant-for-Impossible%3COk,+Error%3E"],[1595,"impl-SerializeSeq-for-Impossible%3COk,+Error%3E"],[1596,"impl-SerializeTuple-for-Impossible%3COk,+Error%3E"],[1604,"impl-SerializeTupleStruct-for-Impossible%3COk,+Error%3E"],[1605,"impl-SerializeTupleVariant-for-Impossible%3COk,+Error%3E"],[1606,"impl-SerializeStructVariant-for-Impossible%3COk,+Error%3E"],[1607,"impl-SerializeStruct-for-Impossible%3COk,+Error%3E"]]}],\ +["serde",{"doc":"Serde","t":"KYKRRRKYRRRRRRRKNNNCMMMMMMMMMNMMMMMMMMMMMMMMMNMMMMMMQNNCMMMMMMNMMMMMMMMMMMMMMMMNMMMMMMMPPPKKKKRPKKRRRRRKPFKPKPPPPPKPEPPPGPPPRRRKKNNNNNNNNMNMMNMMMMMMMMNMMMMMMMMMMMMMMMNMMMMMMNNNMNMNNNNNNNNNMNNNNNNMNMNNNMNMNNMNNNNNNNMNNMNNCNMNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNFFFFFFFFFFFFFFFFFFFFFFFFFFFFFNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNKRRRRRRRRFRRRRRRRRKKRKRKRKRKRKRKRKENNNNNMMMMMMMMNNNNNNNNNNMMMMMMNNNMMMMMMNNNNNMMMMMNMMMMMMMMMMMMNMMMMMMMMNNNNNN","n":["Deserialize","Deserialize","Deserializer","Error","Error","Ok","Serialize","Serialize","SerializeMap","SerializeSeq","SerializeStruct","SerializeStructVariant","SerializeTuple","SerializeTupleStruct","SerializeTupleVariant","Serializer","collect_map","collect_seq","collect_str","de","deserialize","deserialize_any","deserialize_bool","deserialize_byte_buf","deserialize_bytes","deserialize_char","deserialize_enum","deserialize_f32","deserialize_f64","deserialize_i128","deserialize_i16","deserialize_i32","deserialize_i64","deserialize_i8","deserialize_identifier","deserialize_ignored_any","deserialize_map","deserialize_newtype_struct","deserialize_option","deserialize_seq","deserialize_str","deserialize_string","deserialize_struct","deserialize_tuple","deserialize_tuple_struct","deserialize_u128","deserialize_u16","deserialize_u32","deserialize_u64","deserialize_u8","deserialize_unit","deserialize_unit_struct","forward_to_deserialize_any","is_human_readable","is_human_readable","ser","serialize","serialize_bool","serialize_bytes","serialize_char","serialize_f32","serialize_f64","serialize_i128","serialize_i16","serialize_i32","serialize_i64","serialize_i8","serialize_map","serialize_newtype_struct","serialize_newtype_variant","serialize_none","serialize_seq","serialize_some","serialize_str","serialize_struct","serialize_struct_variant","serialize_tuple","serialize_tuple_struct","serialize_tuple_variant","serialize_u128","serialize_u16","serialize_u32","serialize_u64","serialize_u8","serialize_unit","serialize_unit_struct","serialize_unit_variant","Bool","Bytes","Char","Deserialize","DeserializeOwned","DeserializeSeed","Deserializer","Deserializer","Enum","EnumAccess","Error","Error","Error","Error","Error","Error","Expected","Float","IgnoredAny","IntoDeserializer","Map","MapAccess","NewtypeStruct","NewtypeVariant","Option","Other","Seq","SeqAccess","Signed","StdError","Str","StructVariant","TupleVariant","Unexpected","Unit","UnitVariant","Unsigned","Value","Value","Variant","VariantAccess","Visitor","borrow","borrow","borrow_mut","borrow_mut","clone","clone","clone_into","clone_into","custom","default","deserialize","deserialize","deserialize","deserialize_any","deserialize_bool","deserialize_byte_buf","deserialize_bytes","deserialize_char","deserialize_enum","deserialize_f32","deserialize_f64","deserialize_i128","deserialize_i16","deserialize_i32","deserialize_i64","deserialize_i8","deserialize_identifier","deserialize_ignored_any","deserialize_map","deserialize_newtype_struct","deserialize_option","deserialize_seq","deserialize_str","deserialize_string","deserialize_struct","deserialize_tuple","deserialize_tuple_struct","deserialize_u128","deserialize_u16","deserialize_u32","deserialize_u64","deserialize_u8","deserialize_unit","deserialize_unit_struct","duplicate_field","eq","eq","expecting","expecting","fmt","fmt","fmt","fmt","fmt","fmt","from","from","into","into","into_deserializer","invalid_length","invalid_type","invalid_value","is_human_readable","missing_field","newtype_variant","newtype_variant_seed","next_element","next_element_seed","next_entry","next_entry_seed","next_key","next_key_seed","next_value","next_value_seed","size_hint","size_hint","struct_variant","to_owned","to_owned","to_string","try_from","try_from","try_into","try_into","tuple_variant","type_id","type_id","unit_variant","unknown_field","unknown_variant","value","variant","variant_seed","visit_bool","visit_bool","visit_borrowed_bytes","visit_borrowed_str","visit_byte_buf","visit_bytes","visit_bytes","visit_char","visit_enum","visit_enum","visit_f32","visit_f64","visit_f64","visit_i128","visit_i128","visit_i16","visit_i32","visit_i64","visit_i64","visit_i8","visit_map","visit_map","visit_newtype_struct","visit_newtype_struct","visit_none","visit_none","visit_seq","visit_seq","visit_some","visit_some","visit_str","visit_str","visit_string","visit_u128","visit_u128","visit_u16","visit_u32","visit_u64","visit_u64","visit_u8","visit_unit","visit_unit","BoolDeserializer","BorrowedBytesDeserializer","BorrowedStrDeserializer","BytesDeserializer","CharDeserializer","CowStrDeserializer","EnumAccessDeserializer","Error","F32Deserializer","F64Deserializer","I128Deserializer","I16Deserializer","I32Deserializer","I64Deserializer","I8Deserializer","IsizeDeserializer","MapAccessDeserializer","MapDeserializer","SeqAccessDeserializer","SeqDeserializer","StrDeserializer","StringDeserializer","U128Deserializer","U16Deserializer","U32Deserializer","U64Deserializer","U8Deserializer","UnitDeserializer","UsizeDeserializer","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","custom","custom","description","deserialize_any","deserialize_any","deserialize_any","deserialize_any","deserialize_any","deserialize_any","deserialize_any","deserialize_any","deserialize_any","deserialize_any","deserialize_any","deserialize_any","deserialize_any","deserialize_any","deserialize_any","deserialize_any","deserialize_any","deserialize_any","deserialize_any","deserialize_any","deserialize_any","deserialize_any","deserialize_any","deserialize_any","deserialize_any","deserialize_any","deserialize_any","deserialize_any","deserialize_bool","deserialize_bool","deserialize_bool","deserialize_bool","deserialize_bool","deserialize_bool","deserialize_bool","deserialize_bool","deserialize_bool","deserialize_bool","deserialize_bool","deserialize_bool","deserialize_bool","deserialize_bool","deserialize_bool","deserialize_bool","deserialize_bool","deserialize_bool","deserialize_bool","deserialize_bool","deserialize_bool","deserialize_bool","deserialize_bool","deserialize_bool","deserialize_bool","deserialize_bool","deserialize_bool","deserialize_bool","deserialize_byte_buf","deserialize_byte_buf","deserialize_byte_buf","deserialize_byte_buf","deserialize_byte_buf","deserialize_byte_buf","deserialize_byte_buf","deserialize_byte_buf","deserialize_byte_buf","deserialize_byte_buf","deserialize_byte_buf","deserialize_byte_buf","deserialize_byte_buf","deserialize_byte_buf","deserialize_byte_buf","deserialize_byte_buf","deserialize_byte_buf","deserialize_byte_buf","deserialize_byte_buf","deserialize_byte_buf","deserialize_byte_buf","deserialize_byte_buf","deserialize_byte_buf","deserialize_byte_buf","deserialize_byte_buf","deserialize_byte_buf","deserialize_byte_buf","deserialize_byte_buf","deserialize_bytes","deserialize_bytes","deserialize_bytes","deserialize_bytes","deserialize_bytes","deserialize_bytes","deserialize_bytes","deserialize_bytes","deserialize_bytes","deserialize_bytes","deserialize_bytes","deserialize_bytes","deserialize_bytes","deserialize_bytes","deserialize_bytes","deserialize_bytes","deserialize_bytes","deserialize_bytes","deserialize_bytes","deserialize_bytes","deserialize_bytes","deserialize_bytes","deserialize_bytes","deserialize_bytes","deserialize_bytes","deserialize_bytes","deserialize_bytes","deserialize_bytes","deserialize_char","deserialize_char","deserialize_char","deserialize_char","deserialize_char","deserialize_char","deserialize_char","deserialize_char","deserialize_char","deserialize_char","deserialize_char","deserialize_char","deserialize_char","deserialize_char","deserialize_char","deserialize_char","deserialize_char","deserialize_char","deserialize_char","deserialize_char","deserialize_char","deserialize_char","deserialize_char","deserialize_char","deserialize_char","deserialize_char","deserialize_char","deserialize_char","deserialize_enum","deserialize_enum","deserialize_enum","deserialize_enum","deserialize_enum","deserialize_enum","deserialize_enum","deserialize_enum","deserialize_enum","deserialize_enum","deserialize_enum","deserialize_enum","deserialize_enum","deserialize_enum","deserialize_enum","deserialize_enum","deserialize_enum","deserialize_enum","deserialize_enum","deserialize_enum","deserialize_enum","deserialize_enum","deserialize_enum","deserialize_enum","deserialize_enum","deserialize_enum","deserialize_enum","deserialize_enum","deserialize_f32","deserialize_f32","deserialize_f32","deserialize_f32","deserialize_f32","deserialize_f32","deserialize_f32","deserialize_f32","deserialize_f32","deserialize_f32","deserialize_f32","deserialize_f32","deserialize_f32","deserialize_f32","deserialize_f32","deserialize_f32","deserialize_f32","deserialize_f32","deserialize_f32","deserialize_f32","deserialize_f32","deserialize_f32","deserialize_f32","deserialize_f32","deserialize_f32","deserialize_f32","deserialize_f32","deserialize_f32","deserialize_f64","deserialize_f64","deserialize_f64","deserialize_f64","deserialize_f64","deserialize_f64","deserialize_f64","deserialize_f64","deserialize_f64","deserialize_f64","deserialize_f64","deserialize_f64","deserialize_f64","deserialize_f64","deserialize_f64","deserialize_f64","deserialize_f64","deserialize_f64","deserialize_f64","deserialize_f64","deserialize_f64","deserialize_f64","deserialize_f64","deserialize_f64","deserialize_f64","deserialize_f64","deserialize_f64","deserialize_f64","deserialize_i128","deserialize_i128","deserialize_i128","deserialize_i128","deserialize_i128","deserialize_i128","deserialize_i128","deserialize_i128","deserialize_i128","deserialize_i128","deserialize_i128","deserialize_i128","deserialize_i128","deserialize_i128","deserialize_i128","deserialize_i128","deserialize_i128","deserialize_i128","deserialize_i128","deserialize_i128","deserialize_i128","deserialize_i128","deserialize_i128","deserialize_i128","deserialize_i128","deserialize_i128","deserialize_i128","deserialize_i128","deserialize_i16","deserialize_i16","deserialize_i16","deserialize_i16","deserialize_i16","deserialize_i16","deserialize_i16","deserialize_i16","deserialize_i16","deserialize_i16","deserialize_i16","deserialize_i16","deserialize_i16","deserialize_i16","deserialize_i16","deserialize_i16","deserialize_i16","deserialize_i16","deserialize_i16","deserialize_i16","deserialize_i16","deserialize_i16","deserialize_i16","deserialize_i16","deserialize_i16","deserialize_i16","deserialize_i16","deserialize_i16","deserialize_i32","deserialize_i32","deserialize_i32","deserialize_i32","deserialize_i32","deserialize_i32","deserialize_i32","deserialize_i32","deserialize_i32","deserialize_i32","deserialize_i32","deserialize_i32","deserialize_i32","deserialize_i32","deserialize_i32","deserialize_i32","deserialize_i32","deserialize_i32","deserialize_i32","deserialize_i32","deserialize_i32","deserialize_i32","deserialize_i32","deserialize_i32","deserialize_i32","deserialize_i32","deserialize_i32","deserialize_i32","deserialize_i64","deserialize_i64","deserialize_i64","deserialize_i64","deserialize_i64","deserialize_i64","deserialize_i64","deserialize_i64","deserialize_i64","deserialize_i64","deserialize_i64","deserialize_i64","deserialize_i64","deserialize_i64","deserialize_i64","deserialize_i64","deserialize_i64","deserialize_i64","deserialize_i64","deserialize_i64","deserialize_i64","deserialize_i64","deserialize_i64","deserialize_i64","deserialize_i64","deserialize_i64","deserialize_i64","deserialize_i64","deserialize_i8","deserialize_i8","deserialize_i8","deserialize_i8","deserialize_i8","deserialize_i8","deserialize_i8","deserialize_i8","deserialize_i8","deserialize_i8","deserialize_i8","deserialize_i8","deserialize_i8","deserialize_i8","deserialize_i8","deserialize_i8","deserialize_i8","deserialize_i8","deserialize_i8","deserialize_i8","deserialize_i8","deserialize_i8","deserialize_i8","deserialize_i8","deserialize_i8","deserialize_i8","deserialize_i8","deserialize_i8","deserialize_identifier","deserialize_identifier","deserialize_identifier","deserialize_identifier","deserialize_identifier","deserialize_identifier","deserialize_identifier","deserialize_identifier","deserialize_identifier","deserialize_identifier","deserialize_identifier","deserialize_identifier","deserialize_identifier","deserialize_identifier","deserialize_identifier","deserialize_identifier","deserialize_identifier","deserialize_identifier","deserialize_identifier","deserialize_identifier","deserialize_identifier","deserialize_identifier","deserialize_identifier","deserialize_identifier","deserialize_identifier","deserialize_identifier","deserialize_identifier","deserialize_identifier","deserialize_ignored_any","deserialize_ignored_any","deserialize_ignored_any","deserialize_ignored_any","deserialize_ignored_any","deserialize_ignored_any","deserialize_ignored_any","deserialize_ignored_any","deserialize_ignored_any","deserialize_ignored_any","deserialize_ignored_any","deserialize_ignored_any","deserialize_ignored_any","deserialize_ignored_any","deserialize_ignored_any","deserialize_ignored_any","deserialize_ignored_any","deserialize_ignored_any","deserialize_ignored_any","deserialize_ignored_any","deserialize_ignored_any","deserialize_ignored_any","deserialize_ignored_any","deserialize_ignored_any","deserialize_ignored_any","deserialize_ignored_any","deserialize_ignored_any","deserialize_ignored_any","deserialize_map","deserialize_map","deserialize_map","deserialize_map","deserialize_map","deserialize_map","deserialize_map","deserialize_map","deserialize_map","deserialize_map","deserialize_map","deserialize_map","deserialize_map","deserialize_map","deserialize_map","deserialize_map","deserialize_map","deserialize_map","deserialize_map","deserialize_map","deserialize_map","deserialize_map","deserialize_map","deserialize_map","deserialize_map","deserialize_map","deserialize_map","deserialize_map","deserialize_newtype_struct","deserialize_newtype_struct","deserialize_newtype_struct","deserialize_newtype_struct","deserialize_newtype_struct","deserialize_newtype_struct","deserialize_newtype_struct","deserialize_newtype_struct","deserialize_newtype_struct","deserialize_newtype_struct","deserialize_newtype_struct","deserialize_newtype_struct","deserialize_newtype_struct","deserialize_newtype_struct","deserialize_newtype_struct","deserialize_newtype_struct","deserialize_newtype_struct","deserialize_newtype_struct","deserialize_newtype_struct","deserialize_newtype_struct","deserialize_newtype_struct","deserialize_newtype_struct","deserialize_newtype_struct","deserialize_newtype_struct","deserialize_newtype_struct","deserialize_newtype_struct","deserialize_newtype_struct","deserialize_newtype_struct","deserialize_option","deserialize_option","deserialize_option","deserialize_option","deserialize_option","deserialize_option","deserialize_option","deserialize_option","deserialize_option","deserialize_option","deserialize_option","deserialize_option","deserialize_option","deserialize_option","deserialize_option","deserialize_option","deserialize_option","deserialize_option","deserialize_option","deserialize_option","deserialize_option","deserialize_option","deserialize_option","deserialize_option","deserialize_option","deserialize_option","deserialize_option","deserialize_option","deserialize_seq","deserialize_seq","deserialize_seq","deserialize_seq","deserialize_seq","deserialize_seq","deserialize_seq","deserialize_seq","deserialize_seq","deserialize_seq","deserialize_seq","deserialize_seq","deserialize_seq","deserialize_seq","deserialize_seq","deserialize_seq","deserialize_seq","deserialize_seq","deserialize_seq","deserialize_seq","deserialize_seq","deserialize_seq","deserialize_seq","deserialize_seq","deserialize_seq","deserialize_seq","deserialize_seq","deserialize_seq","deserialize_str","deserialize_str","deserialize_str","deserialize_str","deserialize_str","deserialize_str","deserialize_str","deserialize_str","deserialize_str","deserialize_str","deserialize_str","deserialize_str","deserialize_str","deserialize_str","deserialize_str","deserialize_str","deserialize_str","deserialize_str","deserialize_str","deserialize_str","deserialize_str","deserialize_str","deserialize_str","deserialize_str","deserialize_str","deserialize_str","deserialize_str","deserialize_str","deserialize_string","deserialize_string","deserialize_string","deserialize_string","deserialize_string","deserialize_string","deserialize_string","deserialize_string","deserialize_string","deserialize_string","deserialize_string","deserialize_string","deserialize_string","deserialize_string","deserialize_string","deserialize_string","deserialize_string","deserialize_string","deserialize_string","deserialize_string","deserialize_string","deserialize_string","deserialize_string","deserialize_string","deserialize_string","deserialize_string","deserialize_string","deserialize_string","deserialize_struct","deserialize_struct","deserialize_struct","deserialize_struct","deserialize_struct","deserialize_struct","deserialize_struct","deserialize_struct","deserialize_struct","deserialize_struct","deserialize_struct","deserialize_struct","deserialize_struct","deserialize_struct","deserialize_struct","deserialize_struct","deserialize_struct","deserialize_struct","deserialize_struct","deserialize_struct","deserialize_struct","deserialize_struct","deserialize_struct","deserialize_struct","deserialize_struct","deserialize_struct","deserialize_struct","deserialize_struct","deserialize_tuple","deserialize_tuple","deserialize_tuple","deserialize_tuple","deserialize_tuple","deserialize_tuple","deserialize_tuple","deserialize_tuple","deserialize_tuple","deserialize_tuple","deserialize_tuple","deserialize_tuple","deserialize_tuple","deserialize_tuple","deserialize_tuple","deserialize_tuple","deserialize_tuple","deserialize_tuple","deserialize_tuple","deserialize_tuple","deserialize_tuple","deserialize_tuple","deserialize_tuple","deserialize_tuple","deserialize_tuple","deserialize_tuple","deserialize_tuple","deserialize_tuple","deserialize_tuple_struct","deserialize_tuple_struct","deserialize_tuple_struct","deserialize_tuple_struct","deserialize_tuple_struct","deserialize_tuple_struct","deserialize_tuple_struct","deserialize_tuple_struct","deserialize_tuple_struct","deserialize_tuple_struct","deserialize_tuple_struct","deserialize_tuple_struct","deserialize_tuple_struct","deserialize_tuple_struct","deserialize_tuple_struct","deserialize_tuple_struct","deserialize_tuple_struct","deserialize_tuple_struct","deserialize_tuple_struct","deserialize_tuple_struct","deserialize_tuple_struct","deserialize_tuple_struct","deserialize_tuple_struct","deserialize_tuple_struct","deserialize_tuple_struct","deserialize_tuple_struct","deserialize_tuple_struct","deserialize_tuple_struct","deserialize_u128","deserialize_u128","deserialize_u128","deserialize_u128","deserialize_u128","deserialize_u128","deserialize_u128","deserialize_u128","deserialize_u128","deserialize_u128","deserialize_u128","deserialize_u128","deserialize_u128","deserialize_u128","deserialize_u128","deserialize_u128","deserialize_u128","deserialize_u128","deserialize_u128","deserialize_u128","deserialize_u128","deserialize_u128","deserialize_u128","deserialize_u128","deserialize_u128","deserialize_u128","deserialize_u128","deserialize_u128","deserialize_u16","deserialize_u16","deserialize_u16","deserialize_u16","deserialize_u16","deserialize_u16","deserialize_u16","deserialize_u16","deserialize_u16","deserialize_u16","deserialize_u16","deserialize_u16","deserialize_u16","deserialize_u16","deserialize_u16","deserialize_u16","deserialize_u16","deserialize_u16","deserialize_u16","deserialize_u16","deserialize_u16","deserialize_u16","deserialize_u16","deserialize_u16","deserialize_u16","deserialize_u16","deserialize_u16","deserialize_u16","deserialize_u32","deserialize_u32","deserialize_u32","deserialize_u32","deserialize_u32","deserialize_u32","deserialize_u32","deserialize_u32","deserialize_u32","deserialize_u32","deserialize_u32","deserialize_u32","deserialize_u32","deserialize_u32","deserialize_u32","deserialize_u32","deserialize_u32","deserialize_u32","deserialize_u32","deserialize_u32","deserialize_u32","deserialize_u32","deserialize_u32","deserialize_u32","deserialize_u32","deserialize_u32","deserialize_u32","deserialize_u32","deserialize_u64","deserialize_u64","deserialize_u64","deserialize_u64","deserialize_u64","deserialize_u64","deserialize_u64","deserialize_u64","deserialize_u64","deserialize_u64","deserialize_u64","deserialize_u64","deserialize_u64","deserialize_u64","deserialize_u64","deserialize_u64","deserialize_u64","deserialize_u64","deserialize_u64","deserialize_u64","deserialize_u64","deserialize_u64","deserialize_u64","deserialize_u64","deserialize_u64","deserialize_u64","deserialize_u64","deserialize_u64","deserialize_u8","deserialize_u8","deserialize_u8","deserialize_u8","deserialize_u8","deserialize_u8","deserialize_u8","deserialize_u8","deserialize_u8","deserialize_u8","deserialize_u8","deserialize_u8","deserialize_u8","deserialize_u8","deserialize_u8","deserialize_u8","deserialize_u8","deserialize_u8","deserialize_u8","deserialize_u8","deserialize_u8","deserialize_u8","deserialize_u8","deserialize_u8","deserialize_u8","deserialize_u8","deserialize_u8","deserialize_u8","deserialize_unit","deserialize_unit","deserialize_unit","deserialize_unit","deserialize_unit","deserialize_unit","deserialize_unit","deserialize_unit","deserialize_unit","deserialize_unit","deserialize_unit","deserialize_unit","deserialize_unit","deserialize_unit","deserialize_unit","deserialize_unit","deserialize_unit","deserialize_unit","deserialize_unit","deserialize_unit","deserialize_unit","deserialize_unit","deserialize_unit","deserialize_unit","deserialize_unit","deserialize_unit","deserialize_unit","deserialize_unit","deserialize_unit_struct","deserialize_unit_struct","deserialize_unit_struct","deserialize_unit_struct","deserialize_unit_struct","deserialize_unit_struct","deserialize_unit_struct","deserialize_unit_struct","deserialize_unit_struct","deserialize_unit_struct","deserialize_unit_struct","deserialize_unit_struct","deserialize_unit_struct","deserialize_unit_struct","deserialize_unit_struct","deserialize_unit_struct","deserialize_unit_struct","deserialize_unit_struct","deserialize_unit_struct","deserialize_unit_struct","deserialize_unit_struct","deserialize_unit_struct","deserialize_unit_struct","deserialize_unit_struct","deserialize_unit_struct","deserialize_unit_struct","deserialize_unit_struct","deserialize_unit_struct","end","end","eq","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","new","new","new","new","new","new","new","new","new","new","new","new","new","new","new","new","new","new","new","new","new","new","new","new","new","new","new","new","next_element_seed","next_element_seed","next_entry_seed","next_key_seed","next_value_seed","size_hint","size_hint","size_hint","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_string","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","variant_seed","variant_seed","variant_seed","variant_seed","variant_seed","variant_seed","Error","Error","Error","Error","Error","Error","Error","Error","Error","Impossible","Ok","Ok","Ok","Ok","Ok","Ok","Ok","Ok","Serialize","SerializeMap","SerializeMap","SerializeSeq","SerializeSeq","SerializeStruct","SerializeStruct","SerializeStructVariant","SerializeStructVariant","SerializeTuple","SerializeTuple","SerializeTupleStruct","SerializeTupleStruct","SerializeTupleVariant","SerializeTupleVariant","Serializer","StdError","borrow","borrow_mut","collect_map","collect_seq","collect_str","custom","end","end","end","end","end","end","end","end","end","end","end","end","end","end","from","into","is_human_readable","serialize","serialize_bool","serialize_bytes","serialize_char","serialize_element","serialize_element","serialize_element","serialize_element","serialize_entry","serialize_f32","serialize_f64","serialize_field","serialize_field","serialize_field","serialize_field","serialize_field","serialize_field","serialize_field","serialize_field","serialize_i128","serialize_i16","serialize_i32","serialize_i64","serialize_i8","serialize_key","serialize_key","serialize_map","serialize_newtype_struct","serialize_newtype_variant","serialize_none","serialize_seq","serialize_some","serialize_str","serialize_struct","serialize_struct_variant","serialize_tuple","serialize_tuple_struct","serialize_tuple_variant","serialize_u128","serialize_u16","serialize_u32","serialize_u64","serialize_u8","serialize_unit","serialize_unit_struct","serialize_unit_variant","serialize_value","serialize_value","skip_field","skip_field","try_from","try_into","type_id"],"q":[[0,"serde"],[87,"serde::de"],[265,"serde::de::value"],[1531,"serde::ser"],[1642,"core::result"],[1643,"core::iter::traits::collect"],[1644,"core::marker"],[1645,"core::fmt"],[1646,"core::option"],[1647,"core::fmt"],[1648,"core::any"],[1649,"alloc::vec"],[1650,"core::iter::traits::iterator"],[1651,"core::clone"],[1652,"core::fmt"]],"d":["A data structure that can be deserialized from any data …","Derive macro available if serde is built with …","A data format that can deserialize any data structure …","The error type that can be returned if some error occurs …","The error type when some error occurs during serialization.","The output type produced by this Serializer during …","A data structure that can be serialized into any data …","Derive macro available if serde is built with …","Type returned from serialize_map for serializing the …","Type returned from serialize_seq for serializing the …","Type returned from serialize_struct for serializing the …","Type returned from serialize_struct_variant for …","Type returned from serialize_tuple for serializing the …","Type returned from serialize_tuple_struct for serializing …","Type returned from serialize_tuple_variant for serializing …","A data format that can serialize any data structure …","Collect an iterator as a map.","Collect an iterator as a sequence.","Serialize a string produced by an implementation of Display…","Generic data structure deserialization framework.","Deserialize this value from the given Serde deserializer.","Require the Deserializer to figure out how to drive the …","Hint that the Deserialize type is expecting a bool value.","Hint that the Deserialize type is expecting a byte array …","Hint that the Deserialize type is expecting a byte array …","Hint that the Deserialize type is expecting a char value.","Hint that the Deserialize type is expecting an enum value …","Hint that the Deserialize type is expecting a f32 value.","Hint that the Deserialize type is expecting a f64 value.","Hint that the Deserialize type is expecting an i128 value.","Hint that the Deserialize type is expecting an i16 value.","Hint that the Deserialize type is expecting an i32 value.","Hint that the Deserialize type is expecting an i64 value.","Hint that the Deserialize type is expecting an i8 value.","Hint that the Deserialize type is expecting the name of a …","Hint that the Deserialize type needs to deserialize a …","Hint that the Deserialize type is expecting a map of …","Hint that the Deserialize type is expecting a newtype …","Hint that the Deserialize type is expecting an optional …","Hint that the Deserialize type is expecting a sequence of …","Hint that the Deserialize type is expecting a string value …","Hint that the Deserialize type is expecting a string value …","Hint that the Deserialize type is expecting a struct with …","Hint that the Deserialize type is expecting a sequence of …","Hint that the Deserialize type is expecting a tuple struct …","Hint that the Deserialize type is expecting an u128 value.","Hint that the Deserialize type is expecting a u16 value.","Hint that the Deserialize type is expecting a u32 value.","Hint that the Deserialize type is expecting a u64 value.","Hint that the Deserialize type is expecting a u8 value.","Hint that the Deserialize type is expecting a unit value.","Hint that the Deserialize type is expecting a unit struct …","Helper macro when implementing the Deserializer part of a …","Determine whether Deserialize implementations should …","Determine whether Serialize implementations should …","Generic data structure serialization framework.","Serialize this value into the given Serde serializer.","Serialize a bool value.","Serialize a chunk of raw byte data.","Serialize a character.","Serialize an f32 value.","Serialize an f64 value.","Serialize an i128 value.","Serialize an i16 value.","Serialize an i32 value.","Serialize an i64 value.","Serialize an i8 value.","Begin to serialize a map. This call must be followed by …","Serialize a newtype struct like struct Millimeters(u8).","Serialize a newtype variant like E::N in enum E { N(u8) }.","Serialize a None value.","Begin to serialize a variably sized sequence. This call …","Serialize a Some(T) value.","Serialize a &str.","Begin to serialize a struct like …","Begin to serialize a struct variant like E::S in …","Begin to serialize a statically sized sequence whose …","Begin to serialize a tuple struct like …","Begin to serialize a tuple variant like E::T in …","Serialize a u128 value.","Serialize a u16 value.","Serialize a u32 value.","Serialize a u64 value.","Serialize a u8 value.","Serialize a () value.","Serialize a unit struct like struct Unit or PhantomData<T>.","Serialize a unit variant like E::A in enum E { A, B }.","The input contained a boolean value that was not expected.","The input contained a &[u8] or Vec<u8> that was not …","The input contained a char that was not expected.","A data structure that can be deserialized from any data …","A data structure that can be deserialized without …","DeserializeSeed is the stateful form of the Deserialize …","A data format that can deserialize any data structure …","The type of the deserializer being converted into.","The input contained an enum that was not expected.","Provides a Visitor access to the data of an enum in the …","The Error trait allows Deserialize implementations to …","The error type that can be returned if some error occurs …","The error type that can be returned if some error occurs …","The error type that can be returned if some error occurs …","The error type that can be returned if some error occurs …","The error type that can be returned if some error occurs …","Expected represents an explanation of what data a Visitor …","The input contained a floating point f32 or f64 that was …","An efficient way of discarding data from a deserializer.","Converts an existing value into a Deserializer from which …","The input contained a map that was not expected.","Provides a Visitor access to each entry of a map in the …","The input contained a newtype struct that was not expected.","The input contained a newtype variant that was not …","The input contained an Option<T> that was not expected.","A message stating what uncategorized thing the input …","The input contained a sequence that was not expected.","Provides a Visitor access to each element of a sequence in …","The input contained a signed integer i8, i16, i32 or i64 …","","The input contained a &str or String that was not expected.","The input contained a struct variant that was not expected.","The input contained a tuple variant that was not expected.","Unexpected represents an unexpected invocation of any one …","The input contained a unit () that was not expected.","The input contained a unit variant that was not expected.","The input contained an unsigned integer u8, u16, u32 or u64…","The type produced by using this seed.","The value produced by this visitor.","The Visitor that will be used to deserialize the content …","VariantAccess is a visitor that is created by the …","This trait represents a visitor that walks through a …","","","","","","","","","Raised when there is general error when deserializing a …","","Deserialize this value from the given Serde deserializer.","Equivalent to the more common Deserialize::deserialize …","","Require the Deserializer to figure out how to drive the …","Hint that the Deserialize type is expecting a bool value.","Hint that the Deserialize type is expecting a byte array …","Hint that the Deserialize type is expecting a byte array …","Hint that the Deserialize type is expecting a char value.","Hint that the Deserialize type is expecting an enum value …","Hint that the Deserialize type is expecting a f32 value.","Hint that the Deserialize type is expecting a f64 value.","Hint that the Deserialize type is expecting an i128 value.","Hint that the Deserialize type is expecting an i16 value.","Hint that the Deserialize type is expecting an i32 value.","Hint that the Deserialize type is expecting an i64 value.","Hint that the Deserialize type is expecting an i8 value.","Hint that the Deserialize type is expecting the name of a …","Hint that the Deserialize type needs to deserialize a …","Hint that the Deserialize type is expecting a map of …","Hint that the Deserialize type is expecting a newtype …","Hint that the Deserialize type is expecting an optional …","Hint that the Deserialize type is expecting a sequence of …","Hint that the Deserialize type is expecting a string value …","Hint that the Deserialize type is expecting a string value …","Hint that the Deserialize type is expecting a struct with …","Hint that the Deserialize type is expecting a sequence of …","Hint that the Deserialize type is expecting a tuple struct …","Hint that the Deserialize type is expecting an u128 value.","Hint that the Deserialize type is expecting a u16 value.","Hint that the Deserialize type is expecting a u32 value.","Hint that the Deserialize type is expecting a u64 value.","Hint that the Deserialize type is expecting a u8 value.","Hint that the Deserialize type is expecting a unit value.","Hint that the Deserialize type is expecting a unit struct …","Raised when a Deserialize struct type received more than …","","","Format a message stating what data this Visitor expects to …","","Format an explanation of what data was being expected. …","","","","","","Returns the argument unchanged.","Returns the argument unchanged.","Calls U::from(self).","Calls U::from(self).","Convert this value into a deserializer.","Raised when deserializing a sequence or map and the input …","Raised when a Deserialize receives a type different from …","Raised when a Deserialize receives a value of the right …","Determine whether Deserialize implementations should …","Raised when a Deserialize struct type expected to receive …","Called when deserializing a variant with a single value.","Called when deserializing a variant with a single value.","This returns Ok(Some(value)) for the next value in the …","This returns Ok(Some(value)) for the next value in the …","This returns Ok(Some((key, value))) for the next …","This returns Ok(Some((key, value))) for the next …","This returns Ok(Some(key)) for the next key in the map, or …","This returns Ok(Some(key)) for the next key in the map, or …","This returns a Ok(value) for the next value in the map.","This returns a Ok(value) for the next value in the map.","Returns the number of elements remaining in the sequence, …","Returns the number of entries remaining in the map, if …","Called when deserializing a struct-like variant.","","","","","","","","Called when deserializing a tuple-like variant.","","","Called when deserializing a variant with no values.","Raised when a Deserialize struct type received a field …","Raised when a Deserialize enum type received a variant …","Building blocks for deserializing basic values using the …","variant is called to identify which variant to deserialize.","variant is called to identify which variant to deserialize.","The input contains a boolean.","","The input contains a byte array that lives at least as …","The input contains a string that lives at least as long as …","The input contains a byte array and ownership of the byte …","The input contains a byte array. The lifetime of the byte …","","The input contains a char.","The input contains an enum.","","The input contains an f32.","The input contains an f64.","","The input contains a i128.","","The input contains an i16.","The input contains an i32.","The input contains an i64.","","The input contains an i8.","The input contains a key-value map.","","The input contains a newtype struct.","","The input contains an optional that is absent.","","The input contains a sequence of elements.","","The input contains an optional that is present.","","The input contains a string. The lifetime of the string is …","","The input contains a string and ownership of the string is …","The input contains a u128.","","The input contains a u16.","The input contains a u32.","The input contains a u64.","","The input contains a u8.","The input contains a unit ().","","A deserializer holding a bool.","A deserializer holding a &[u8] with a lifetime tied to …","A deserializer holding a &str with a lifetime tied to …","A deserializer holding a &[u8]. Always calls …","A deserializer holding a char.","A deserializer holding a Cow<str>.","A deserializer holding an EnumAccess.","A minimal representation of all possible errors that can …","A deserializer holding an f32.","A deserializer holding an f64.","A deserializer holding an i128.","A deserializer holding an i16.","A deserializer holding an i32.","A deserializer holding an i64.","A deserializer holding an i8.","A deserializer holding an isize.","A deserializer holding a MapAccess.","A deserializer that iterates over a map.","A deserializer holding a SeqAccess.","A deserializer that iterates over a sequence.","A deserializer holding a &str.","A deserializer holding a String.","A deserializer holding a u128.","A deserializer holding a u16.","A deserializer holding a u32.","A deserializer holding a u64.","A deserializer holding a u8.","A deserializer holding a ().","A deserializer holding a usize.","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","Check for remaining elements after passing a …","Check for remaining elements after passing a …","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","","","","Create a new borrowed deserializer from the given string.","","","Create a new deserializer from the given bytes.","Create a new borrowed deserializer from the given borrowed …","Construct a new MapDeserializer<I, E>.","","","","","","","","","","","","","","","","Construct a new SeqDeserializer<I, E>.","Construct a new SeqAccessDeserializer<A>.","Construct a new MapAccessDeserializer<A>.","Construct a new EnumAccessDeserializer<A>.","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","Trait used by Serialize implementations to generically …","The error type when some error occurs during serialization.","Must match the Error type of our Serializer.","Must match the Error type of our Serializer.","Must match the Error type of our Serializer.","Must match the Error type of our Serializer.","Must match the Error type of our Serializer.","Must match the Error type of our Serializer.","Must match the Error type of our Serializer.","Helper type for implementing a Serializer that does not …","The output type produced by this Serializer during …","Must match the Ok type of our Serializer.","Must match the Ok type of our Serializer.","Must match the Ok type of our Serializer.","Must match the Ok type of our Serializer.","Must match the Ok type of our Serializer.","Must match the Ok type of our Serializer.","Must match the Ok type of our Serializer.","A data structure that can be serialized into any data …","Returned from Serializer::serialize_map.","Type returned from serialize_map for serializing the …","Returned from Serializer::serialize_seq.","Type returned from serialize_seq for serializing the …","Returned from Serializer::serialize_struct.","Type returned from serialize_struct for serializing the …","Returned from Serializer::serialize_struct_variant.","Type returned from serialize_struct_variant for …","Returned from Serializer::serialize_tuple.","Type returned from serialize_tuple for serializing the …","Returned from Serializer::serialize_tuple_struct.","Type returned from serialize_tuple_struct for serializing …","Returned from Serializer::serialize_tuple_variant.","Type returned from serialize_tuple_variant for serializing …","A data format that can serialize any data structure …","","","","Collect an iterator as a map.","Collect an iterator as a sequence.","Serialize a string produced by an implementation of Display…","Used when a Serialize implementation encounters any error …","Finish serializing a sequence.","Finish serializing a tuple.","Finish serializing a tuple struct.","Finish serializing a tuple variant.","Finish serializing a map.","Finish serializing a struct.","Finish serializing a struct variant.","","","","","","","","Returns the argument unchanged.","Calls U::from(self).","Determine whether Serialize implementations should …","Serialize this value into the given Serde serializer.","Serialize a bool value.","Serialize a chunk of raw byte data.","Serialize a character.","Serialize a sequence element.","Serialize a tuple element.","","","Serialize a map entry consisting of a key and a value.","Serialize an f32 value.","Serialize an f64 value.","Serialize a tuple struct field.","Serialize a tuple variant field.","Serialize a struct field.","Serialize a struct variant field.","","","","","Serialize an i128 value.","Serialize an i16 value.","Serialize an i32 value.","Serialize an i64 value.","Serialize an i8 value.","Serialize a map key.","","Begin to serialize a map. This call must be followed by …","Serialize a newtype struct like struct Millimeters(u8).","Serialize a newtype variant like E::N in enum E { N(u8) }.","Serialize a None value.","Begin to serialize a variably sized sequence. This call …","Serialize a Some(T) value.","Serialize a &str.","Begin to serialize a struct like …","Begin to serialize a struct variant like E::S in …","Begin to serialize a statically sized sequence whose …","Begin to serialize a tuple struct like …","Begin to serialize a tuple variant like E::T in …","Serialize a u128 value.","Serialize a u16 value.","Serialize a u32 value.","Serialize a u64 value.","Serialize a u8 value.","Serialize a () value.","Serialize a unit struct like struct Unit or PhantomData<T>.","Serialize a unit variant like E::A in enum E { A, B }.","Serialize a map value.","","Indicate that a struct field has been skipped.","Indicate that a struct variant field has been skipped.","","",""],"i":[0,0,0,27,10,10,0,0,10,10,10,10,10,10,10,0,10,10,10,0,26,27,27,27,27,27,27,27,27,27,27,27,27,27,27,27,27,27,27,27,27,27,27,27,27,27,27,27,27,27,27,27,0,27,10,0,20,10,10,10,10,10,10,10,10,10,10,10,10,10,10,10,10,10,10,10,10,10,10,10,10,10,10,10,10,10,10,49,49,49,0,0,0,0,58,49,0,0,27,60,61,65,59,0,49,0,0,49,0,49,49,49,49,49,0,49,0,49,49,49,0,49,49,49,52,29,65,0,0,48,49,48,49,48,49,48,49,28,48,26,52,48,27,27,27,27,27,27,27,27,27,27,27,27,27,27,27,27,27,27,27,27,27,27,27,27,27,27,27,27,27,27,27,28,48,49,29,48,55,55,48,48,49,49,48,49,48,49,58,28,28,28,27,28,59,59,60,60,61,61,61,61,61,61,60,61,59,48,49,49,48,49,48,49,59,48,49,59,28,28,0,65,65,29,48,29,29,29,29,48,29,29,48,29,29,48,29,48,29,29,29,48,29,29,48,29,48,29,48,29,48,29,48,29,48,29,29,48,29,29,29,48,29,29,48,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,67,68,69,70,71,72,73,74,75,78,79,80,81,82,83,84,85,86,87,88,89,90,91,92,93,94,95,96,97,67,68,69,70,71,72,73,74,75,78,79,80,81,82,83,84,85,86,87,88,89,90,91,92,93,94,95,96,97,67,68,69,70,71,72,73,74,75,78,79,80,81,82,83,84,85,86,87,88,89,90,91,92,93,94,95,96,97,67,68,69,70,71,72,73,74,75,78,79,80,81,82,83,84,85,86,87,88,89,90,91,92,93,94,95,96,97,78,78,78,67,68,69,70,71,72,73,74,75,79,80,81,82,83,84,85,86,87,88,89,90,91,92,93,94,95,96,97,67,68,69,70,71,72,73,74,75,79,80,81,82,83,84,85,86,87,88,89,90,91,92,93,94,95,96,97,67,68,69,70,71,72,73,74,75,79,80,81,82,83,84,85,86,87,88,89,90,91,92,93,94,95,96,97,67,68,69,70,71,72,73,74,75,79,80,81,82,83,84,85,86,87,88,89,90,91,92,93,94,95,96,97,67,68,69,70,71,72,73,74,75,79,80,81,82,83,84,85,86,87,88,89,90,91,92,93,94,95,96,97,67,68,69,70,71,72,73,74,75,79,80,81,82,83,84,85,86,87,88,89,90,91,92,93,94,95,96,97,67,68,69,70,71,72,73,74,75,79,80,81,82,83,84,85,86,87,88,89,90,91,92,93,94,95,96,97,67,68,69,70,71,72,73,74,75,79,80,81,82,83,84,85,86,87,88,89,90,91,92,93,94,95,96,97,67,68,69,70,71,72,73,74,75,79,80,81,82,83,84,85,86,87,88,89,90,91,92,93,94,95,96,97,67,68,69,70,71,72,73,74,75,79,80,81,82,83,84,85,86,87,88,89,90,91,92,93,94,95,96,97,67,68,69,70,71,72,73,74,75,79,80,81,82,83,84,85,86,87,88,89,90,91,92,93,94,95,96,97,67,68,69,70,71,72,73,74,75,79,80,81,82,83,84,85,86,87,88,89,90,91,92,93,94,95,96,97,67,68,69,70,71,72,73,74,75,79,80,81,82,83,84,85,86,87,88,89,90,91,92,93,94,95,96,97,67,68,69,70,71,72,73,74,75,79,80,81,82,83,84,85,86,87,88,89,90,91,92,93,94,95,96,97,67,68,69,70,71,72,73,74,75,79,80,81,82,83,84,85,86,87,88,89,90,91,92,93,94,95,96,97,67,68,69,70,71,72,73,74,75,79,80,81,82,83,84,85,86,87,88,89,90,91,92,93,94,95,96,97,67,68,69,70,71,72,73,74,75,79,80,81,82,83,84,85,86,87,88,89,90,91,92,93,94,95,96,97,67,68,69,70,71,72,73,74,75,79,80,81,82,83,84,85,86,87,88,89,90,91,92,93,94,95,96,97,67,68,69,70,71,72,73,74,75,79,80,81,82,83,84,85,86,87,88,89,90,91,92,93,94,95,96,97,67,68,69,70,71,72,73,74,75,79,80,81,82,83,84,85,86,87,88,89,90,91,92,93,94,95,96,97,67,68,69,70,71,72,73,74,75,79,80,81,82,83,84,85,86,87,88,89,90,91,92,93,94,95,96,97,67,68,69,70,71,72,73,74,75,79,80,81,82,83,84,85,86,87,88,89,90,91,92,93,94,95,96,97,67,68,69,70,71,72,73,74,75,79,80,81,82,83,84,85,86,87,88,89,90,91,92,93,94,95,96,97,67,68,69,70,71,72,73,74,75,79,80,81,82,83,84,85,86,87,88,89,90,91,92,93,94,95,96,97,67,68,69,70,71,72,73,74,75,79,80,81,82,83,84,85,86,87,88,89,90,91,92,93,94,95,96,97,67,68,69,70,71,72,73,74,75,79,80,81,82,83,84,85,86,87,88,89,90,91,92,93,94,95,96,97,67,68,69,70,71,72,73,74,75,79,80,81,82,83,84,85,86,87,88,89,90,91,92,93,94,95,96,97,67,68,69,70,71,72,73,74,75,79,80,81,82,83,84,85,86,87,88,89,90,91,92,93,94,95,96,97,67,68,69,70,71,72,73,74,75,79,80,81,82,83,84,85,86,87,88,89,90,91,92,93,94,95,96,97,67,68,69,70,71,72,73,74,75,79,80,81,82,83,84,85,86,87,88,89,90,91,92,93,94,95,96,97,67,68,69,70,71,72,73,74,75,79,80,81,82,83,84,85,86,87,88,89,90,91,92,93,94,95,96,97,75,94,78,67,68,69,70,71,72,73,74,75,78,78,79,80,81,82,83,84,85,86,87,88,89,90,91,92,93,94,95,96,97,67,68,69,70,71,72,73,74,75,78,79,80,81,82,83,84,85,86,87,88,89,90,91,92,93,94,95,96,97,67,68,69,70,71,72,73,74,75,78,79,80,81,82,83,84,85,86,87,88,89,90,91,92,93,94,95,96,97,67,68,69,70,71,72,73,74,75,79,80,81,82,83,84,85,86,87,88,89,90,91,92,93,94,95,96,97,75,94,75,75,75,75,75,94,67,68,69,70,71,72,73,74,75,78,79,80,81,82,83,84,85,86,87,88,89,90,91,92,93,94,95,96,97,78,67,68,69,70,71,72,73,74,75,78,79,80,81,82,83,84,85,86,87,88,89,90,91,92,93,94,95,96,97,67,68,69,70,71,72,73,74,75,78,79,80,81,82,83,84,85,86,87,88,89,90,91,92,93,94,95,96,97,67,68,69,70,71,72,73,74,75,78,79,80,81,82,83,84,85,86,87,88,89,90,91,92,93,94,95,96,97,68,69,70,71,72,96,0,10,13,14,15,16,17,18,19,0,10,13,14,15,16,17,18,19,0,0,10,0,10,0,10,0,10,0,10,0,10,0,10,0,0,101,101,10,10,10,12,13,14,15,16,17,18,19,101,101,101,101,101,101,101,101,101,10,20,10,10,10,13,14,101,101,17,10,10,15,16,18,19,101,101,101,101,10,10,10,10,10,17,101,10,10,10,10,10,10,10,10,10,10,10,10,10,10,10,10,10,10,10,10,17,101,18,19,101,101,101],"f":"````````````````{{{Ad{}{{b{c}}{d{e}}{f{g}}{h{i}}{j{k}}{l{m}}{n{o}}{A`{Aa}}{Ab{Ac}}}}Ai}{{Af{ce}}}{}Ah{{Aj{}{{b{c}}{d{e}}}}}{{Al{}{{b{c}}{d{e}}}}}{{An{}{{b{c}}{d{e}}}}}{{B`{}{{b{c}}{d{e}}}}}{{Bb{}{{b{c}}{d{e}}}}}{{Bd{}{{b{c}}{d{e}}}}}{{Bf{}{{b{c}}{d{e}}}}}BhBh{{Bn{}{{Bj{{Bl{AeAg}}}}}}}}{{{Ad{}{{b{c}}{d{e}}{f{g}}{h{i}}{j{k}}{l{m}}{n{o}}{A`{Aa}}{Ab{Ac}}}}Ae}{{Af{ce}}}{}Ah{{Aj{}{{b{c}}{d{e}}}}}{{Al{}{{b{c}}{d{e}}}}}{{An{}{{b{c}}{d{e}}}}}{{B`{}{{b{c}}{d{e}}}}}{{Bb{}{{b{c}}{d{e}}}}}{{Bd{}{{b{c}}{d{e}}}}}{{Bf{}{{b{c}}{d{e}}}}}Bn}{{{Ad{}{{b{c}}{d{e}}{f{g}}{h{i}}{j{k}}{l{m}}{n{o}}{A`{Aa}}{Ab{Ac}}}}Ae}{{Af{ce}}}{}Ah{{Aj{}{{b{c}}{d{e}}}}}{{Al{}{{b{c}}{d{e}}}}}{{An{}{{b{c}}{d{e}}}}}{{B`{}{{b{c}}{d{e}}}}}{{Bb{}{{b{c}}{d{e}}}}}{{Bd{}{{b{c}}{d{e}}}}}{{Bf{}{{b{c}}{d{e}}}}}{C`Cb}}`{c{{Af{Cd}}}Cf}{{{Cf{}{{d{c}}}}e}{{Af{c}}}ChCj}0000{{{Cf{}{{d{c}}}}Cl{Cn{Cl}}e}{{Af{c}}}ChCj}1111111111{{{Cf{}{{d{c}}}}Cle}{{Af{c}}}ChCj}22221{{{Cf{}{{d{c}}}}D`e}{{Af{c}}}ChCj}{{{Cf{}{{d{c}}}}ClD`e}{{Af{c}}}ChCj}4444442`{{{Cf{}{{d{c}}}}}DbCh}{{{Ad{}{{b{c}}{d{e}}{f{g}}{h{i}}{j{k}}{l{m}}{n{o}}{A`{Aa}}{Ab{Ac}}}}}Db{}Ah{{Aj{}{{b{c}}{d{e}}}}}{{Al{}{{b{c}}{d{e}}}}}{{An{}{{b{c}}{d{e}}}}}{{B`{}{{b{c}}{d{e}}}}}{{Bb{}{{b{c}}{d{e}}}}}{{Bd{}{{b{c}}{d{e}}}}}{{Bf{}{{b{c}}{d{e}}}}}}`{{Bhc}AfAd}{{{Ad{}{{b{c}}{d{e}}{f{g}}{h{i}}{j{k}}{l{m}}{n{o}}{A`{Aa}}{Ab{Ac}}}}Db}{{Af{ce}}}{}Ah{{Aj{}{{b{c}}{d{e}}}}}{{Al{}{{b{c}}{d{e}}}}}{{An{}{{b{c}}{d{e}}}}}{{B`{}{{b{c}}{d{e}}}}}{{Bb{}{{b{c}}{d{e}}}}}{{Bd{}{{b{c}}{d{e}}}}}{{Bf{}{{b{c}}{d{e}}}}}}{{{Ad{}{{b{c}}{d{e}}{f{g}}{h{i}}{j{k}}{l{m}}{n{o}}{A`{Aa}}{Ab{Ac}}}}{Cn{Dd}}}{{Af{ce}}}{}Ah{{Aj{}{{b{c}}{d{e}}}}}{{Al{}{{b{c}}{d{e}}}}}{{An{}{{b{c}}{d{e}}}}}{{B`{}{{b{c}}{d{e}}}}}{{Bb{}{{b{c}}{d{e}}}}}{{Bd{}{{b{c}}{d{e}}}}}{{Bf{}{{b{c}}{d{e}}}}}}{{{Ad{}{{b{c}}{d{e}}{f{g}}{h{i}}{j{k}}{l{m}}{n{o}}{A`{Aa}}{Ab{Ac}}}}Df}{{Af{ce}}}{}Ah{{Aj{}{{b{c}}{d{e}}}}}{{Al{}{{b{c}}{d{e}}}}}{{An{}{{b{c}}{d{e}}}}}{{B`{}{{b{c}}{d{e}}}}}{{Bb{}{{b{c}}{d{e}}}}}{{Bd{}{{b{c}}{d{e}}}}}{{Bf{}{{b{c}}{d{e}}}}}}{{{Ad{}{{b{c}}{d{e}}{f{g}}{h{i}}{j{k}}{l{m}}{n{o}}{A`{Aa}}{Ab{Ac}}}}Dh}{{Af{ce}}}{}Ah{{Aj{}{{b{c}}{d{e}}}}}{{Al{}{{b{c}}{d{e}}}}}{{An{}{{b{c}}{d{e}}}}}{{B`{}{{b{c}}{d{e}}}}}{{Bb{}{{b{c}}{d{e}}}}}{{Bd{}{{b{c}}{d{e}}}}}{{Bf{}{{b{c}}{d{e}}}}}}{{{Ad{}{{b{c}}{d{e}}{f{g}}{h{i}}{j{k}}{l{m}}{n{o}}{A`{Aa}}{Ab{Ac}}}}Dj}{{Af{ce}}}{}Ah{{Aj{}{{b{c}}{d{e}}}}}{{Al{}{{b{c}}{d{e}}}}}{{An{}{{b{c}}{d{e}}}}}{{B`{}{{b{c}}{d{e}}}}}{{Bb{}{{b{c}}{d{e}}}}}{{Bd{}{{b{c}}{d{e}}}}}{{Bf{}{{b{c}}{d{e}}}}}}{{{Ad{}{{b{c}}{d{e}}{f{g}}{h{i}}{j{k}}{l{m}}{n{o}}{A`{Aa}}{Ab{Ac}}}}Dl}{{Af{ce}}}{}Ah{{Aj{}{{b{c}}{d{e}}}}}{{Al{}{{b{c}}{d{e}}}}}{{An{}{{b{c}}{d{e}}}}}{{B`{}{{b{c}}{d{e}}}}}{{Bb{}{{b{c}}{d{e}}}}}{{Bd{}{{b{c}}{d{e}}}}}{{Bf{}{{b{c}}{d{e}}}}}}{{{Ad{}{{b{c}}{d{e}}{f{g}}{h{i}}{j{k}}{l{m}}{n{o}}{A`{Aa}}{Ab{Ac}}}}Dn}{{Af{ce}}}{}Ah{{Aj{}{{b{c}}{d{e}}}}}{{Al{}{{b{c}}{d{e}}}}}{{An{}{{b{c}}{d{e}}}}}{{B`{}{{b{c}}{d{e}}}}}{{Bb{}{{b{c}}{d{e}}}}}{{Bd{}{{b{c}}{d{e}}}}}{{Bf{}{{b{c}}{d{e}}}}}}{{{Ad{}{{b{c}}{d{e}}{f{g}}{h{i}}{j{k}}{l{m}}{n{o}}{A`{Aa}}{Ab{Ac}}}}E`}{{Af{ce}}}{}Ah{{Aj{}{{b{c}}{d{e}}}}}{{Al{}{{b{c}}{d{e}}}}}{{An{}{{b{c}}{d{e}}}}}{{B`{}{{b{c}}{d{e}}}}}{{Bb{}{{b{c}}{d{e}}}}}{{Bd{}{{b{c}}{d{e}}}}}{{Bf{}{{b{c}}{d{e}}}}}}{{{Ad{}{{b{c}}{d{e}}{f{g}}{h{i}}{j{k}}{l{m}}{n{o}}{A`{Aa}}{Ab{Ac}}}}Eb}{{Af{ce}}}{}Ah{{Aj{}{{b{c}}{d{e}}}}}{{Al{}{{b{c}}{d{e}}}}}{{An{}{{b{c}}{d{e}}}}}{{B`{}{{b{c}}{d{e}}}}}{{Bb{}{{b{c}}{d{e}}}}}{{Bd{}{{b{c}}{d{e}}}}}{{Bf{}{{b{c}}{d{e}}}}}}{{{Ad{}{{b{c}}{d{e}}{f{g}}{h{i}}{j{k}}{l{m}}{n{o}}{A`{Aa}}{Ab{Ac}}}}Ed}{{Af{ce}}}{}Ah{{Aj{}{{b{c}}{d{e}}}}}{{Al{}{{b{c}}{d{e}}}}}{{An{}{{b{c}}{d{e}}}}}{{B`{}{{b{c}}{d{e}}}}}{{Bb{}{{b{c}}{d{e}}}}}{{Bd{}{{b{c}}{d{e}}}}}{{Bf{}{{b{c}}{d{e}}}}}}{{{Ad{}{{b{c}}{d{e}}{f{g}}{h{i}}{j{k}}{l{m}}{n{o}}{A`{Aa}}{Ab{Ac}}}}{Ef{D`}}}{{Af{oe}}}{}Ah{{Aj{}{{b{c}}{d{e}}}}}{{Al{}{{b{c}}{d{e}}}}}{{An{}{{b{c}}{d{e}}}}}{{B`{}{{b{c}}{d{e}}}}}{{Bb{}{{b{c}}{d{e}}}}}{{Bd{}{{b{c}}{d{e}}}}}{{Bf{}{{b{c}}{d{e}}}}}}{{{Ad{}{{b{c}}{d{e}}{f{g}}{h{i}}{j{k}}{l{m}}{n{o}}{A`{Aa}}{Ab{Ac}}}}ClAe}{{Af{ce}}}{}Ah{{Aj{}{{b{c}}{d{e}}}}}{{Al{}{{b{c}}{d{e}}}}}{{An{}{{b{c}}{d{e}}}}}{{B`{}{{b{c}}{d{e}}}}}{{Bb{}{{b{c}}{d{e}}}}}{{Bd{}{{b{c}}{d{e}}}}}{{Bf{}{{b{c}}{d{e}}}}}{C`Bh}}{{{Ad{}{{b{c}}{d{e}}{f{g}}{h{i}}{j{k}}{l{m}}{n{o}}{A`{Aa}}{Ab{Ac}}}}ClEhClAe}{{Af{ce}}}{}Ah{{Aj{}{{b{c}}{d{e}}}}}{{Al{}{{b{c}}{d{e}}}}}{{An{}{{b{c}}{d{e}}}}}{{B`{}{{b{c}}{d{e}}}}}{{Bb{}{{b{c}}{d{e}}}}}{{Bd{}{{b{c}}{d{e}}}}}{{Bf{}{{b{c}}{d{e}}}}}{C`Bh}}{{{Ad{}{{b{c}}{d{e}}{f{g}}{h{i}}{j{k}}{l{m}}{n{o}}{A`{Aa}}{Ab{Ac}}}}}{{Af{ce}}}{}Ah{{Aj{}{{b{c}}{d{e}}}}}{{Al{}{{b{c}}{d{e}}}}}{{An{}{{b{c}}{d{e}}}}}{{B`{}{{b{c}}{d{e}}}}}{{Bb{}{{b{c}}{d{e}}}}}{{Bd{}{{b{c}}{d{e}}}}}{{Bf{}{{b{c}}{d{e}}}}}}{{{Ad{}{{b{c}}{d{e}}{f{g}}{h{i}}{j{k}}{l{m}}{n{o}}{A`{Aa}}{Ab{Ac}}}}{Ef{D`}}}{{Af{ge}}}{}Ah{{Aj{}{{b{c}}{d{e}}}}}{{Al{}{{b{c}}{d{e}}}}}{{An{}{{b{c}}{d{e}}}}}{{B`{}{{b{c}}{d{e}}}}}{{Bb{}{{b{c}}{d{e}}}}}{{Bd{}{{b{c}}{d{e}}}}}{{Bf{}{{b{c}}{d{e}}}}}}{{{Ad{}{{b{c}}{d{e}}{f{g}}{h{i}}{j{k}}{l{m}}{n{o}}{A`{Aa}}{Ab{Ac}}}}Ae}{{Af{ce}}}{}Ah{{Aj{}{{b{c}}{d{e}}}}}{{Al{}{{b{c}}{d{e}}}}}{{An{}{{b{c}}{d{e}}}}}{{B`{}{{b{c}}{d{e}}}}}{{Bb{}{{b{c}}{d{e}}}}}{{Bd{}{{b{c}}{d{e}}}}}{{Bf{}{{b{c}}{d{e}}}}}{C`Bh}}{{{Ad{}{{b{c}}{d{e}}{f{g}}{h{i}}{j{k}}{l{m}}{n{o}}{A`{Aa}}{Ab{Ac}}}}Cl}{{Af{ce}}}{}Ah{{Aj{}{{b{c}}{d{e}}}}}{{Al{}{{b{c}}{d{e}}}}}{{An{}{{b{c}}{d{e}}}}}{{B`{}{{b{c}}{d{e}}}}}{{Bb{}{{b{c}}{d{e}}}}}{{Bd{}{{b{c}}{d{e}}}}}{{Bf{}{{b{c}}{d{e}}}}}}{{{Ad{}{{b{c}}{d{e}}{f{g}}{h{i}}{j{k}}{l{m}}{n{o}}{A`{Aa}}{Ab{Ac}}}}ClD`}{{Af{Aae}}}{}Ah{{Aj{}{{b{c}}{d{e}}}}}{{Al{}{{b{c}}{d{e}}}}}{{An{}{{b{c}}{d{e}}}}}{{B`{}{{b{c}}{d{e}}}}}{{Bb{}{{b{c}}{d{e}}}}}{{Bd{}{{b{c}}{d{e}}}}}{{Bf{}{{b{c}}{d{e}}}}}}{{{Ad{}{{b{c}}{d{e}}{f{g}}{h{i}}{j{k}}{l{m}}{n{o}}{A`{Aa}}{Ab{Ac}}}}ClEhClD`}{{Af{Ace}}}{}Ah{{Aj{}{{b{c}}{d{e}}}}}{{Al{}{{b{c}}{d{e}}}}}{{An{}{{b{c}}{d{e}}}}}{{B`{}{{b{c}}{d{e}}}}}{{Bb{}{{b{c}}{d{e}}}}}{{Bd{}{{b{c}}{d{e}}}}}{{Bf{}{{b{c}}{d{e}}}}}}{{{Ad{}{{b{c}}{d{e}}{f{g}}{h{i}}{j{k}}{l{m}}{n{o}}{A`{Aa}}{Ab{Ac}}}}D`}{{Af{ie}}}{}Ah{{Aj{}{{b{c}}{d{e}}}}}{{Al{}{{b{c}}{d{e}}}}}{{An{}{{b{c}}{d{e}}}}}{{B`{}{{b{c}}{d{e}}}}}{{Bb{}{{b{c}}{d{e}}}}}{{Bd{}{{b{c}}{d{e}}}}}{{Bf{}{{b{c}}{d{e}}}}}}{{{Ad{}{{b{c}}{d{e}}{f{g}}{h{i}}{j{k}}{l{m}}{n{o}}{A`{Aa}}{Ab{Ac}}}}ClD`}{{Af{ke}}}{}Ah{{Aj{}{{b{c}}{d{e}}}}}{{Al{}{{b{c}}{d{e}}}}}{{An{}{{b{c}}{d{e}}}}}{{B`{}{{b{c}}{d{e}}}}}{{Bb{}{{b{c}}{d{e}}}}}{{Bd{}{{b{c}}{d{e}}}}}{{Bf{}{{b{c}}{d{e}}}}}}{{{Ad{}{{b{c}}{d{e}}{f{g}}{h{i}}{j{k}}{l{m}}{n{o}}{A`{Aa}}{Ab{Ac}}}}ClEhClD`}{{Af{me}}}{}Ah{{Aj{}{{b{c}}{d{e}}}}}{{Al{}{{b{c}}{d{e}}}}}{{An{}{{b{c}}{d{e}}}}}{{B`{}{{b{c}}{d{e}}}}}{{Bb{}{{b{c}}{d{e}}}}}{{Bd{}{{b{c}}{d{e}}}}}{{Bf{}{{b{c}}{d{e}}}}}}{{{Ad{}{{b{c}}{d{e}}{f{g}}{h{i}}{j{k}}{l{m}}{n{o}}{A`{Aa}}{Ab{Ac}}}}Ej}{{Af{ce}}}{}Ah{{Aj{}{{b{c}}{d{e}}}}}{{Al{}{{b{c}}{d{e}}}}}{{An{}{{b{c}}{d{e}}}}}{{B`{}{{b{c}}{d{e}}}}}{{Bb{}{{b{c}}{d{e}}}}}{{Bd{}{{b{c}}{d{e}}}}}{{Bf{}{{b{c}}{d{e}}}}}}{{{Ad{}{{b{c}}{d{e}}{f{g}}{h{i}}{j{k}}{l{m}}{n{o}}{A`{Aa}}{Ab{Ac}}}}El}{{Af{ce}}}{}Ah{{Aj{}{{b{c}}{d{e}}}}}{{Al{}{{b{c}}{d{e}}}}}{{An{}{{b{c}}{d{e}}}}}{{B`{}{{b{c}}{d{e}}}}}{{Bb{}{{b{c}}{d{e}}}}}{{Bd{}{{b{c}}{d{e}}}}}{{Bf{}{{b{c}}{d{e}}}}}}{{{Ad{}{{b{c}}{d{e}}{f{g}}{h{i}}{j{k}}{l{m}}{n{o}}{A`{Aa}}{Ab{Ac}}}}Eh}{{Af{ce}}}{}Ah{{Aj{}{{b{c}}{d{e}}}}}{{Al{}{{b{c}}{d{e}}}}}{{An{}{{b{c}}{d{e}}}}}{{B`{}{{b{c}}{d{e}}}}}{{Bb{}{{b{c}}{d{e}}}}}{{Bd{}{{b{c}}{d{e}}}}}{{Bf{}{{b{c}}{d{e}}}}}}{{{Ad{}{{b{c}}{d{e}}{f{g}}{h{i}}{j{k}}{l{m}}{n{o}}{A`{Aa}}{Ab{Ac}}}}En}{{Af{ce}}}{}Ah{{Aj{}{{b{c}}{d{e}}}}}{{Al{}{{b{c}}{d{e}}}}}{{An{}{{b{c}}{d{e}}}}}{{B`{}{{b{c}}{d{e}}}}}{{Bb{}{{b{c}}{d{e}}}}}{{Bd{}{{b{c}}{d{e}}}}}{{Bf{}{{b{c}}{d{e}}}}}}{{{Ad{}{{b{c}}{d{e}}{f{g}}{h{i}}{j{k}}{l{m}}{n{o}}{A`{Aa}}{Ab{Ac}}}}Dd}{{Af{ce}}}{}Ah{{Aj{}{{b{c}}{d{e}}}}}{{Al{}{{b{c}}{d{e}}}}}{{An{}{{b{c}}{d{e}}}}}{{B`{}{{b{c}}{d{e}}}}}{{Bb{}{{b{c}}{d{e}}}}}{{Bd{}{{b{c}}{d{e}}}}}{{Bf{}{{b{c}}{d{e}}}}}}=:{{{Ad{}{{b{c}}{d{e}}{f{g}}{h{i}}{j{k}}{l{m}}{n{o}}{A`{Aa}}{Ab{Ac}}}}ClEhCl}{{Af{ce}}}{}Ah{{Aj{}{{b{c}}{d{e}}}}}{{Al{}{{b{c}}{d{e}}}}}{{An{}{{b{c}}{d{e}}}}}{{B`{}{{b{c}}{d{e}}}}}{{Bb{}{{b{c}}{d{e}}}}}{{Bd{}{{b{c}}{d{e}}}}}{{Bf{}{{b{c}}{d{e}}}}}}``````````````````````````````````````````{ce{}{}}000{F`F`}{FbFb}{{ce}Fd{}{}}0{cChCb}{{}F`}{c{{Af{Cd}}}Cf}{{{Fh{}{{Ff{c}}}}e}{{Af{c}}}{}Cf}{c{{Af{F`}}}Cf}{{{Cf{}{{d{c}}}}e}{{Af{c}}}ChCj}0000{{{Cf{}{{d{c}}}}Cl{Cn{Cl}}e}{{Af{c}}}ChCj}1111111111{{{Cf{}{{d{c}}}}Cle}{{Af{c}}}ChCj}22221{{{Cf{}{{d{c}}}}D`e}{{Af{c}}}ChCj}{{{Cf{}{{d{c}}}}ClD`e}{{Af{c}}}ChCj}4444442{ClCh}{{F`F`}Db}{{FbFb}Db}{{{Cj{}{{Ff{c}}}}Fj}Fl{}}{{F`Fj}Fl}{{FnFj}Fl}01{{cFj}{{Af{FdG`}}}{}}{{FbFj}Fl}0{cc{}}0{ce{}{}}0{{{Gd{}{{Gb{c}}}}}c{{Cf{}{{d{e}}}}}Ch}{{D`Fn}Ch}{{FbFn}Ch}0{{{Cf{}{{d{c}}}}}DbCh}={{{Gf{}{{d{c}}}}}{{Af{ec}}}ChCd}{{{Gf{}{{d{c}}}}e}{{Af{c}}}ChFh}{{{Gh{}{{d{c}}}}}{{Af{{Ef{e}}c}}}ChCd}{{{Gh{}{{d{c}}}}e}{{Af{Efc}}}ChFh}{{{Gj{}{{d{c}}}}}{{Af{{Ef{{Bl{eg}}}}c}}}ChCdCd}{{{Gj{}{{d{c}}}}eg}{{Af{{Ef{Bl}}c}}}ChFhFh}{{{Gj{}{{d{c}}}}}{{Af{{Ef{e}}c}}}ChCd}{{{Gj{}{{d{c}}}}e}{{Af{Efc}}}ChFh}{{{Gj{}{{d{c}}}}}{{Af{ec}}}ChCd}{{{Gj{}{{d{c}}}}e}{{Af{c}}}ChFh}{{{Gh{}{{d{c}}}}}{{Ef{D`}}}Ch}{{{Gj{}{{d{c}}}}}{{Ef{D`}}}Ch}{{{Gf{}{{d{c}}}}{Cn{Cl}}e}{{Af{c}}}ChCj}{ce{}{}}0{cGl{}}{c{{Af{e}}}{}{}}000{{{Gf{}{{d{c}}}}D`e}{{Af{c}}}ChCj}{cGn{}}0{{{Gf{}{{d{c}}}}}{{Af{Fdc}}}Ch}{{Cl{Cn{Cl}}}Ch}0`{{{Hb{}{{d{c}}{H`{e}}}}}{{Af{{Bl{ge}}c}}}Ch{{Gf{}{{d{c}}}}}Cd}{{{Hb{}{{d{c}}{H`{e}}}}g}{{Af{{Bl{e}}c}}}Ch{{Gf{}{{d{c}}}}}Fh}{{{Cj{}{{Ff{c}}}}Db}{{Af{ce}}}{}Ch}{{F`Db}{{Af{ce}}}{}{}}{{{Cj{}{{Ff{c}}}}{Cn{Dd}}}{{Af{ce}}}{}Ch}{{{Cj{}{{Ff{c}}}}Cl}{{Af{ce}}}{}Ch}{{{Cj{}{{Ff{c}}}}{Hd{Dd}}}{{Af{ce}}}{}Ch}2{{F`{Cn{Dd}}}{{Af{ce}}}{}Ch}{{{Cj{}{{Ff{c}}}}Df}{{Af{ce}}}{}Ch}{{{Cj{}{{Ff{c}}}}e}{{Af{c}}}{}Hb}{{F`c}{{Af{e}}}Hb{}}{{{Cj{}{{Ff{c}}}}Dh}{{Af{ce}}}{}Ch}{{{Cj{}{{Ff{c}}}}Dj}{{Af{ce}}}{}Ch}{{F`Dj}{{Af{ce}}}{}{}}{{{Cj{}{{Ff{c}}}}Dl}{{Af{ce}}}{}Ch}{{F`Dl}{{Af{ce}}}{}{}}{{{Cj{}{{Ff{c}}}}Dn}{{Af{ce}}}{}Ch}{{{Cj{}{{Ff{c}}}}E`}{{Af{ce}}}{}Ch}{{{Cj{}{{Ff{c}}}}Eb}{{Af{ce}}}{}Ch}{{F`Eb}{{Af{ce}}}{}{}}{{{Cj{}{{Ff{c}}}}Ed}{{Af{ce}}}{}Ch}{{{Cj{}{{Ff{c}}}}e}{{Af{c}}}{}Gj}{{F`c}{{Af{e}}}Gj{}}{{{Cj{}{{Ff{c}}}}e}{{Af{c}}}{}Cf}{{F`c}{{Af{e}}}Cf{}}{{{Cj{}{{Ff{c}}}}}{{Af{ce}}}{}Ch}{F`{{Af{ce}}}{}{}}{{{Cj{}{{Ff{c}}}}e}{{Af{c}}}{}Gh}{{F`c}{{Af{e}}}Gh{}}54{{{Cj{}{{Ff{c}}}}Cl}{{Af{ce}}}{}Ch}{{F`Cl}{{Af{ce}}}{}Ch}{{{Cj{}{{Ff{c}}}}Gl}{{Af{ce}}}{}Ch}{{{Cj{}{{Ff{c}}}}Ej}{{Af{ce}}}{}Ch}{{F`Ej}{{Af{ce}}}{}{}}{{{Cj{}{{Ff{c}}}}El}{{Af{ce}}}{}Ch}{{{Cj{}{{Ff{c}}}}Eh}{{Af{ce}}}{}Ch}{{{Cj{}{{Ff{c}}}}En}{{Af{ce}}}{}Ch}{{F`En}{{Af{ce}}}{}{}}{{{Cj{}{{Ff{c}}}}Dd}{{Af{ce}}}{}Ch}=<`````````````````````````````{ce{}{}}000000000000000000000000000000000000000000000000000000000{{{Hf{c}}}{{Hf{c}}}{}}{{{Hh{c}}}{{Hh{c}}}{}}{{{Hj{c}}}{{Hj{c}}}{}}{{{Hl{c}}}{{Hl{c}}}{}}{{{Hn{c}}}{{Hn{c}}}{}}{{{I`{c}}}{{I`{c}}}{}}{{{Ib{c}}}{{Ib{c}}}{}}{{{Id{c}}}{{Id{c}}}{}}{{{If{ce}}}{{If{ce}}}{IhIj}{}}{IlIl}{{{In{c}}}{{In{c}}}{}}{{{J`{c}}}{{J`{c}}}{}}{{{Jb{c}}}{{Jb{c}}}{}}{{{Jd{c}}}{{Jd{c}}}{}}{{{Jf{c}}}{{Jf{c}}}{}}{{{Jh{c}}}{{Jh{c}}}{}}{{{Jj{c}}}{{Jj{c}}}{}}{{{Jl{c}}}{{Jl{c}}}{}}{{{Jn{c}}}{{Jn{c}}}{}}{{{K`{c}}}{{K`{c}}}{}}{{{Kb{c}}}{{Kb{c}}}{}}{{{Kd{c}}}{{Kd{c}}}{}}{{{Kf{c}}}{{Kf{c}}}{}}{{{Kh{c}}}{{Kh{c}}}{}}{{{Kj{c}}}{{Kj{c}}}{}}{{{Kl{ce}}}{{Kl{ce}}}IjIj}{{{Kn{c}}}{{Kn{c}}}Ij}{{{L`{c}}}{{L`{c}}}Ij}{{{Lb{c}}}{{Lb{c}}}Ij}{{ce}Fd{}{}}0000000000000000000000000000{cIlCb}0{IlCl}{{{Hf{c}}e}{{Af{g}}}ChCj{}}{{{Hh{c}}e}{{Af{g}}}ChCj{}}{{{Hj{c}}e}{{Af{g}}}ChCj{}}{{{Hl{c}}e}{{Af{g}}}ChCj{}}{{{Hn{c}}e}{{Af{g}}}ChCj{}}{{{I`{c}}e}{{Af{g}}}ChCj{}}{{{Ib{c}}e}{{Af{g}}}ChCj{}}{{{Id{c}}e}{{Af{g}}}ChCj{}}{{{If{ce}}g}{{Af{i}}}IhChCj{}}{{{In{c}}e}{{Af{g}}}ChCj{}}{{{J`{c}}e}{{Af{g}}}ChCj{}}{{{Jb{c}}e}{{Af{g}}}ChCj{}}{{{Jd{c}}e}{{Af{g}}}ChCj{}}{{{Jf{c}}e}{{Af{g}}}ChCj{}}{{{Jh{c}}e}{{Af{g}}}ChCj{}}{{{Jj{c}}e}{{Af{g}}}ChCj{}}{{{Jl{c}}e}{{Af{g}}}ChCj{}}{{{Jn{c}}e}{{Af{g}}}ChCj{}}{{{K`{c}}e}{{Af{g}}}ChCj{}}{{{Kb{c}}e}{{Af{g}}}ChCj{}}{{{Kd{c}}e}{{Af{g}}}ChCj{}}{{{Kf{c}}e}{{Af{g}}}ChCj{}}{{{Kh{c}}e}{{Af{g}}}ChCj{}}{{{Kj{c}}e}{{Af{g}}}ChCj{}}{{{Kl{gc}}i}{{Af{k}}}Ch{{Gd{c}}}{{Ih{}{{Bj{e}}}}}Cj{}}{{{Kn{c}}e}{{Af{g}}}GhCj{}}{{{L`{c}}e}{{Af{g}}}GjCj{}}{{{Lb{c}}e}{{Af{g}}}HbCj{}}{{{Hf{c}}e}{{Af{g}}}ChCj{}}{{{Hh{c}}e}{{Af{g}}}ChCj{}}{{{Hj{c}}e}{{Af{g}}}ChCj{}}{{{Hl{c}}e}{{Af{g}}}ChCj{}}{{{Hn{c}}e}{{Af{g}}}ChCj{}}{{{I`{c}}e}{{Af{g}}}ChCj{}}{{{Ib{c}}e}{{Af{g}}}ChCj{}}{{{Id{c}}e}{{Af{g}}}ChCj{}}{{{If{ce}}g}{{Af{i}}}IhChCj{}}{{{In{c}}e}{{Af{g}}}ChCj{}}{{{J`{c}}e}{{Af{g}}}ChCj{}}{{{Jb{c}}e}{{Af{g}}}ChCj{}}{{{Jd{c}}e}{{Af{g}}}ChCj{}}{{{Jf{c}}e}{{Af{g}}}ChCj{}}{{{Jh{c}}e}{{Af{g}}}ChCj{}}{{{Jj{c}}e}{{Af{g}}}ChCj{}}{{{Jl{c}}e}{{Af{g}}}ChCj{}}{{{Jn{c}}e}{{Af{g}}}ChCj{}}{{{K`{c}}e}{{Af{g}}}ChCj{}}{{{Kb{c}}e}{{Af{g}}}ChCj{}}{{{Kd{c}}e}{{Af{g}}}ChCj{}}{{{Kf{c}}e}{{Af{g}}}ChCj{}}{{{Kh{c}}e}{{Af{g}}}ChCj{}}{{{Kj{c}}e}{{Af{g}}}ChCj{}}{{{Kl{gc}}i}{{Af{k}}}Ch{{Gd{c}}}{{Ih{}{{Bj{e}}}}}Cj{}}{{{Kn{c}}e}{{Af{g}}}GhCj{}}{{{L`{c}}e}{{Af{g}}}GjCj{}}{{{Lb{c}}e}{{Af{g}}}HbCj{}}{{{Hf{c}}e}{{Af{g}}}ChCj{}}{{{Hh{c}}e}{{Af{g}}}ChCj{}}{{{Hj{c}}e}{{Af{g}}}ChCj{}}{{{Hl{c}}e}{{Af{g}}}ChCj{}}{{{Hn{c}}e}{{Af{g}}}ChCj{}}{{{I`{c}}e}{{Af{g}}}ChCj{}}{{{Ib{c}}e}{{Af{g}}}ChCj{}}{{{Id{c}}e}{{Af{g}}}ChCj{}}{{{If{ce}}g}{{Af{i}}}IhChCj{}}{{{In{c}}e}{{Af{g}}}ChCj{}}{{{J`{c}}e}{{Af{g}}}ChCj{}}{{{Jb{c}}e}{{Af{g}}}ChCj{}}{{{Jd{c}}e}{{Af{g}}}ChCj{}}{{{Jf{c}}e}{{Af{g}}}ChCj{}}{{{Jh{c}}e}{{Af{g}}}ChCj{}}{{{Jj{c}}e}{{Af{g}}}ChCj{}}{{{Jl{c}}e}{{Af{g}}}ChCj{}}{{{Jn{c}}e}{{Af{g}}}ChCj{}}{{{K`{c}}e}{{Af{g}}}ChCj{}}{{{Kb{c}}e}{{Af{g}}}ChCj{}}{{{Kd{c}}e}{{Af{g}}}ChCj{}}{{{Kf{c}}e}{{Af{g}}}ChCj{}}{{{Kh{c}}e}{{Af{g}}}ChCj{}}{{{Kj{c}}e}{{Af{g}}}ChCj{}}{{{Kl{gc}}i}{{Af{k}}}Ch{{Gd{c}}}{{Ih{}{{Bj{e}}}}}Cj{}}{{{Kn{c}}e}{{Af{g}}}GhCj{}}{{{L`{c}}e}{{Af{g}}}GjCj{}}{{{Lb{c}}e}{{Af{g}}}HbCj{}}{{{Hf{c}}e}{{Af{g}}}ChCj{}}{{{Hh{c}}e}{{Af{g}}}ChCj{}}{{{Hj{c}}e}{{Af{g}}}ChCj{}}{{{Hl{c}}e}{{Af{g}}}ChCj{}}{{{Hn{c}}e}{{Af{g}}}ChCj{}}{{{I`{c}}e}{{Af{g}}}ChCj{}}{{{Ib{c}}e}{{Af{g}}}ChCj{}}{{{Id{c}}e}{{Af{g}}}ChCj{}}{{{If{ce}}g}{{Af{i}}}IhChCj{}}{{{In{c}}e}{{Af{g}}}ChCj{}}{{{J`{c}}e}{{Af{g}}}ChCj{}}{{{Jb{c}}e}{{Af{g}}}ChCj{}}{{{Jd{c}}e}{{Af{g}}}ChCj{}}{{{Jf{c}}e}{{Af{g}}}ChCj{}}{{{Jh{c}}e}{{Af{g}}}ChCj{}}{{{Jj{c}}e}{{Af{g}}}ChCj{}}{{{Jl{c}}e}{{Af{g}}}ChCj{}}{{{Jn{c}}e}{{Af{g}}}ChCj{}}{{{K`{c}}e}{{Af{g}}}ChCj{}}{{{Kb{c}}e}{{Af{g}}}ChCj{}}{{{Kd{c}}e}{{Af{g}}}ChCj{}}{{{Kf{c}}e}{{Af{g}}}ChCj{}}{{{Kh{c}}e}{{Af{g}}}ChCj{}}{{{Kj{c}}e}{{Af{g}}}ChCj{}}{{{Kl{gc}}i}{{Af{k}}}Ch{{Gd{c}}}{{Ih{}{{Bj{e}}}}}Cj{}}{{{Kn{c}}e}{{Af{g}}}GhCj{}}{{{L`{c}}e}{{Af{g}}}GjCj{}}{{{Lb{c}}e}{{Af{g}}}HbCj{}}{{{Hf{c}}e}{{Af{g}}}ChCj{}}{{{Hh{c}}e}{{Af{g}}}ChCj{}}{{{Hj{c}}e}{{Af{g}}}ChCj{}}{{{Hl{c}}e}{{Af{g}}}ChCj{}}{{{Hn{c}}e}{{Af{g}}}ChCj{}}{{{I`{c}}e}{{Af{g}}}ChCj{}}{{{Ib{c}}e}{{Af{g}}}ChCj{}}{{{Id{c}}e}{{Af{g}}}ChCj{}}{{{If{ce}}g}{{Af{i}}}IhChCj{}}{{{In{c}}e}{{Af{g}}}ChCj{}}{{{J`{c}}e}{{Af{g}}}ChCj{}}{{{Jb{c}}e}{{Af{g}}}ChCj{}}{{{Jd{c}}e}{{Af{g}}}ChCj{}}{{{Jf{c}}e}{{Af{g}}}ChCj{}}{{{Jh{c}}e}{{Af{g}}}ChCj{}}{{{Jj{c}}e}{{Af{g}}}ChCj{}}{{{Jl{c}}e}{{Af{g}}}ChCj{}}{{{Jn{c}}e}{{Af{g}}}ChCj{}}{{{K`{c}}e}{{Af{g}}}ChCj{}}{{{Kb{c}}e}{{Af{g}}}ChCj{}}{{{Kd{c}}e}{{Af{g}}}ChCj{}}{{{Kf{c}}e}{{Af{g}}}ChCj{}}{{{Kh{c}}e}{{Af{g}}}ChCj{}}{{{Kj{c}}e}{{Af{g}}}ChCj{}}{{{Kl{gc}}i}{{Af{k}}}Ch{{Gd{c}}}{{Ih{}{{Bj{e}}}}}Cj{}}{{{Kn{c}}e}{{Af{g}}}GhCj{}}{{{L`{c}}e}{{Af{g}}}GjCj{}}{{{Lb{c}}e}{{Af{g}}}HbCj{}}{{{Hf{c}}Cl{Cn{Cl}}e}{{Af{g}}}ChCj{}}{{{Hh{c}}Cl{Cn{Cl}}e}{{Af{g}}}ChCj{}}{{{Hj{c}}Cl{Cn{Cl}}e}{{Af{g}}}ChCj{}}{{{Hl{c}}Cl{Cn{Cl}}e}{{Af{g}}}ChCj{}}{{{Hn{c}}Cl{Cn{Cl}}e}{{Af{g}}}ChCj{}}{{{I`{c}}Cl{Cn{Cl}}e}{{Af{g}}}ChCj{}}{{{Ib{c}}Cl{Cn{Cl}}e}{{Af{g}}}ChCj{}}{{{Id{c}}Cl{Cn{Cl}}e}{{Af{g}}}ChCj{}}{{{If{ce}}Cl{Cn{Cl}}g}{{Af{i}}}IhChCj{}}{{{In{c}}Cl{Cn{Cl}}e}{{Af{g}}}ChCj{}}{{{J`{c}}Cl{Cn{Cl}}e}{{Af{g}}}ChCj{}}{{{Jb{c}}Cl{Cn{Cl}}e}{{Af{g}}}ChCj{}}{{{Jd{c}}Cl{Cn{Cl}}e}{{Af{g}}}ChCj{}}{{{Jf{c}}Cl{Cn{Cl}}e}{{Af{g}}}ChCj{}}{{{Jh{c}}Cl{Cn{Cl}}e}{{Af{g}}}ChCj{}}{{{Jj{c}}Cl{Cn{Cl}}e}{{Af{g}}}ChCj{}}{{{Jl{c}}Cl{Cn{Cl}}e}{{Af{g}}}ChCj{}}{{{Jn{c}}Cl{Cn{Cl}}e}{{Af{g}}}ChCj{}}{{{K`{c}}Cl{Cn{Cl}}e}{{Af{g}}}ChCj{}}{{{Kb{c}}Cl{Cn{Cl}}e}{{Af{g}}}ChCj{}}{{{Kd{c}}Cl{Cn{Cl}}e}{{Af{g}}}ChCj{}}{{{Kf{c}}Cl{Cn{Cl}}e}{{Af{g}}}ChCj{}}{{{Kh{c}}Cl{Cn{Cl}}e}{{Af{g}}}ChCj{}}{{{Kj{c}}Cl{Cn{Cl}}e}{{Af{g}}}ChCj{}}{{{Kl{gc}}Cl{Cn{Cl}}i}{{Af{k}}}Ch{{Gd{c}}}{{Ih{}{{Bj{e}}}}}Cj{}}{{{Kn{c}}Cl{Cn{Cl}}e}{{Af{g}}}GhCj{}}{{{L`{c}}Cl{Cn{Cl}}e}{{Af{g}}}GjCj{}}{{{Lb{c}}Cl{Cn{Cl}}e}{{Af{g}}}HbCj{}}{{{Hf{c}}e}{{Af{g}}}ChCj{}}{{{Hh{c}}e}{{Af{g}}}ChCj{}}{{{Hj{c}}e}{{Af{g}}}ChCj{}}{{{Hl{c}}e}{{Af{g}}}ChCj{}}{{{Hn{c}}e}{{Af{g}}}ChCj{}}{{{I`{c}}e}{{Af{g}}}ChCj{}}{{{Ib{c}}e}{{Af{g}}}ChCj{}}{{{Id{c}}e}{{Af{g}}}ChCj{}}{{{If{ce}}g}{{Af{i}}}IhChCj{}}{{{In{c}}e}{{Af{g}}}ChCj{}}{{{J`{c}}e}{{Af{g}}}ChCj{}}{{{Jb{c}}e}{{Af{g}}}ChCj{}}{{{Jd{c}}e}{{Af{g}}}ChCj{}}{{{Jf{c}}e}{{Af{g}}}ChCj{}}{{{Jh{c}}e}{{Af{g}}}ChCj{}}{{{Jj{c}}e}{{Af{g}}}ChCj{}}{{{Jl{c}}e}{{Af{g}}}ChCj{}}{{{Jn{c}}e}{{Af{g}}}ChCj{}}{{{K`{c}}e}{{Af{g}}}ChCj{}}{{{Kb{c}}e}{{Af{g}}}ChCj{}}{{{Kd{c}}e}{{Af{g}}}ChCj{}}{{{Kf{c}}e}{{Af{g}}}ChCj{}}{{{Kh{c}}e}{{Af{g}}}ChCj{}}{{{Kj{c}}e}{{Af{g}}}ChCj{}}{{{Kl{gc}}i}{{Af{k}}}Ch{{Gd{c}}}{{Ih{}{{Bj{e}}}}}Cj{}}{{{Kn{c}}e}{{Af{g}}}GhCj{}}{{{L`{c}}e}{{Af{g}}}GjCj{}}{{{Lb{c}}e}{{Af{g}}}HbCj{}}{{{Hf{c}}e}{{Af{g}}}ChCj{}}{{{Hh{c}}e}{{Af{g}}}ChCj{}}{{{Hj{c}}e}{{Af{g}}}ChCj{}}{{{Hl{c}}e}{{Af{g}}}ChCj{}}{{{Hn{c}}e}{{Af{g}}}ChCj{}}{{{I`{c}}e}{{Af{g}}}ChCj{}}{{{Ib{c}}e}{{Af{g}}}ChCj{}}{{{Id{c}}e}{{Af{g}}}ChCj{}}{{{If{ce}}g}{{Af{i}}}IhChCj{}}{{{In{c}}e}{{Af{g}}}ChCj{}}{{{J`{c}}e}{{Af{g}}}ChCj{}}{{{Jb{c}}e}{{Af{g}}}ChCj{}}{{{Jd{c}}e}{{Af{g}}}ChCj{}}{{{Jf{c}}e}{{Af{g}}}ChCj{}}{{{Jh{c}}e}{{Af{g}}}ChCj{}}{{{Jj{c}}e}{{Af{g}}}ChCj{}}{{{Jl{c}}e}{{Af{g}}}ChCj{}}{{{Jn{c}}e}{{Af{g}}}ChCj{}}{{{K`{c}}e}{{Af{g}}}ChCj{}}{{{Kb{c}}e}{{Af{g}}}ChCj{}}{{{Kd{c}}e}{{Af{g}}}ChCj{}}{{{Kf{c}}e}{{Af{g}}}ChCj{}}{{{Kh{c}}e}{{Af{g}}}ChCj{}}{{{Kj{c}}e}{{Af{g}}}ChCj{}}{{{Kl{gc}}i}{{Af{k}}}Ch{{Gd{c}}}{{Ih{}{{Bj{e}}}}}Cj{}}{{{Kn{c}}e}{{Af{g}}}GhCj{}}{{{L`{c}}e}{{Af{g}}}GjCj{}}{{{Lb{c}}e}{{Af{g}}}HbCj{}}{{{Hf{c}}e}{{Af{g}}}ChCj{}}{{{Hh{c}}e}{{Af{g}}}ChCj{}}{{{Hj{c}}e}{{Af{g}}}ChCj{}}{{{Hl{c}}e}{{Af{g}}}ChCj{}}{{{Hn{c}}e}{{Af{g}}}ChCj{}}{{{I`{c}}e}{{Af{g}}}ChCj{}}{{{Ib{c}}e}{{Af{g}}}ChCj{}}{{{Id{c}}e}{{Af{g}}}ChCj{}}{{{If{ce}}g}{{Af{i}}}IhChCj{}}{{{In{c}}e}{{Af{g}}}ChCj{}}{{{J`{c}}e}{{Af{g}}}ChCj{}}{{{Jb{c}}e}{{Af{g}}}ChCj{}}{{{Jd{c}}e}{{Af{g}}}ChCj{}}{{{Jf{c}}e}{{Af{g}}}ChCj{}}{{{Jh{c}}e}{{Af{g}}}ChCj{}}{{{Jj{c}}e}{{Af{g}}}ChCj{}}{{{Jl{c}}e}{{Af{g}}}ChCj{}}{{{Jn{c}}e}{{Af{g}}}ChCj{}}{{{K`{c}}e}{{Af{g}}}ChCj{}}{{{Kb{c}}e}{{Af{g}}}ChCj{}}{{{Kd{c}}e}{{Af{g}}}ChCj{}}{{{Kf{c}}e}{{Af{g}}}ChCj{}}{{{Kh{c}}e}{{Af{g}}}ChCj{}}{{{Kj{c}}e}{{Af{g}}}ChCj{}}{{{Kl{gc}}i}{{Af{k}}}Ch{{Gd{c}}}{{Ih{}{{Bj{e}}}}}Cj{}}{{{Kn{c}}e}{{Af{g}}}GhCj{}}{{{L`{c}}e}{{Af{g}}}GjCj{}}{{{Lb{c}}e}{{Af{g}}}HbCj{}}{{{Hf{c}}e}{{Af{g}}}ChCj{}}{{{Hh{c}}e}{{Af{g}}}ChCj{}}{{{Hj{c}}e}{{Af{g}}}ChCj{}}{{{Hl{c}}e}{{Af{g}}}ChCj{}}{{{Hn{c}}e}{{Af{g}}}ChCj{}}{{{I`{c}}e}{{Af{g}}}ChCj{}}{{{Ib{c}}e}{{Af{g}}}ChCj{}}{{{Id{c}}e}{{Af{g}}}ChCj{}}{{{If{ce}}g}{{Af{i}}}IhChCj{}}{{{In{c}}e}{{Af{g}}}ChCj{}}{{{J`{c}}e}{{Af{g}}}ChCj{}}{{{Jb{c}}e}{{Af{g}}}ChCj{}}{{{Jd{c}}e}{{Af{g}}}ChCj{}}{{{Jf{c}}e}{{Af{g}}}ChCj{}}{{{Jh{c}}e}{{Af{g}}}ChCj{}}{{{Jj{c}}e}{{Af{g}}}ChCj{}}{{{Jl{c}}e}{{Af{g}}}ChCj{}}{{{Jn{c}}e}{{Af{g}}}ChCj{}}{{{K`{c}}e}{{Af{g}}}ChCj{}}{{{Kb{c}}e}{{Af{g}}}ChCj{}}{{{Kd{c}}e}{{Af{g}}}ChCj{}}{{{Kf{c}}e}{{Af{g}}}ChCj{}}{{{Kh{c}}e}{{Af{g}}}ChCj{}}{{{Kj{c}}e}{{Af{g}}}ChCj{}}{{{Kl{gc}}i}{{Af{k}}}Ch{{Gd{c}}}{{Ih{}{{Bj{e}}}}}Cj{}}{{{Kn{c}}e}{{Af{g}}}GhCj{}}{{{L`{c}}e}{{Af{g}}}GjCj{}}{{{Lb{c}}e}{{Af{g}}}HbCj{}}{{{Hf{c}}e}{{Af{g}}}ChCj{}}{{{Hh{c}}e}{{Af{g}}}ChCj{}}{{{Hj{c}}e}{{Af{g}}}ChCj{}}{{{Hl{c}}e}{{Af{g}}}ChCj{}}{{{Hn{c}}e}{{Af{g}}}ChCj{}}{{{I`{c}}e}{{Af{g}}}ChCj{}}{{{Ib{c}}e}{{Af{g}}}ChCj{}}{{{Id{c}}e}{{Af{g}}}ChCj{}}{{{If{ce}}g}{{Af{i}}}IhChCj{}}{{{In{c}}e}{{Af{g}}}ChCj{}}{{{J`{c}}e}{{Af{g}}}ChCj{}}{{{Jb{c}}e}{{Af{g}}}ChCj{}}{{{Jd{c}}e}{{Af{g}}}ChCj{}}{{{Jf{c}}e}{{Af{g}}}ChCj{}}{{{Jh{c}}e}{{Af{g}}}ChCj{}}{{{Jj{c}}e}{{Af{g}}}ChCj{}}{{{Jl{c}}e}{{Af{g}}}ChCj{}}{{{Jn{c}}e}{{Af{g}}}ChCj{}}{{{K`{c}}e}{{Af{g}}}ChCj{}}{{{Kb{c}}e}{{Af{g}}}ChCj{}}{{{Kd{c}}e}{{Af{g}}}ChCj{}}{{{Kf{c}}e}{{Af{g}}}ChCj{}}{{{Kh{c}}e}{{Af{g}}}ChCj{}}{{{Kj{c}}e}{{Af{g}}}ChCj{}}{{{Kl{gc}}i}{{Af{k}}}Ch{{Gd{c}}}{{Ih{}{{Bj{e}}}}}Cj{}}{{{Kn{c}}e}{{Af{g}}}GhCj{}}{{{L`{c}}e}{{Af{g}}}GjCj{}}{{{Lb{c}}e}{{Af{g}}}HbCj{}}{{{Hf{c}}e}{{Af{g}}}ChCj{}}{{{Hh{c}}e}{{Af{g}}}ChCj{}}{{{Hj{c}}e}{{Af{g}}}ChCj{}}{{{Hl{c}}e}{{Af{g}}}ChCj{}}{{{Hn{c}}e}{{Af{g}}}ChCj{}}{{{I`{c}}e}{{Af{g}}}ChCj{}}{{{Ib{c}}e}{{Af{g}}}ChCj{}}{{{Id{c}}e}{{Af{g}}}ChCj{}}{{{If{ce}}g}{{Af{i}}}IhChCj{}}{{{In{c}}e}{{Af{g}}}ChCj{}}{{{J`{c}}e}{{Af{g}}}ChCj{}}{{{Jb{c}}e}{{Af{g}}}ChCj{}}{{{Jd{c}}e}{{Af{g}}}ChCj{}}{{{Jf{c}}e}{{Af{g}}}ChCj{}}{{{Jh{c}}e}{{Af{g}}}ChCj{}}{{{Jj{c}}e}{{Af{g}}}ChCj{}}{{{Jl{c}}e}{{Af{g}}}ChCj{}}{{{Jn{c}}e}{{Af{g}}}ChCj{}}{{{K`{c}}e}{{Af{g}}}ChCj{}}{{{Kb{c}}e}{{Af{g}}}ChCj{}}{{{Kd{c}}e}{{Af{g}}}ChCj{}}{{{Kf{c}}e}{{Af{g}}}ChCj{}}{{{Kh{c}}e}{{Af{g}}}ChCj{}}{{{Kj{c}}e}{{Af{g}}}ChCj{}}{{{Kl{gc}}i}{{Af{k}}}Ch{{Gd{c}}}{{Ih{}{{Bj{e}}}}}Cj{}}{{{Kn{c}}e}{{Af{g}}}GhCj{}}{{{L`{c}}e}{{Af{g}}}GjCj{}}{{{Lb{c}}e}{{Af{g}}}HbCj{}}{{{Hf{c}}e}{{Af{g}}}ChCj{}}{{{Hh{c}}e}{{Af{g}}}ChCj{}}{{{Hj{c}}e}{{Af{g}}}ChCj{}}{{{Hl{c}}e}{{Af{g}}}ChCj{}}{{{Hn{c}}e}{{Af{g}}}ChCj{}}{{{I`{c}}e}{{Af{g}}}ChCj{}}{{{Ib{c}}e}{{Af{g}}}ChCj{}}{{{Id{c}}e}{{Af{g}}}ChCj{}}{{{If{ce}}g}{{Af{i}}}IhChCj{}}{{{In{c}}e}{{Af{g}}}ChCj{}}{{{J`{c}}e}{{Af{g}}}ChCj{}}{{{Jb{c}}e}{{Af{g}}}ChCj{}}{{{Jd{c}}e}{{Af{g}}}ChCj{}}{{{Jf{c}}e}{{Af{g}}}ChCj{}}{{{Jh{c}}e}{{Af{g}}}ChCj{}}{{{Jj{c}}e}{{Af{g}}}ChCj{}}{{{Jl{c}}e}{{Af{g}}}ChCj{}}{{{Jn{c}}e}{{Af{g}}}ChCj{}}{{{K`{c}}e}{{Af{g}}}ChCj{}}{{{Kb{c}}e}{{Af{g}}}ChCj{}}{{{Kd{c}}e}{{Af{g}}}ChCj{}}{{{Kf{c}}e}{{Af{g}}}ChCj{}}{{{Kh{c}}e}{{Af{g}}}ChCj{}}{{{Kj{c}}e}{{Af{g}}}ChCj{}}{{{Kl{gc}}i}{{Af{k}}}Ch{{Gd{c}}}{{Ih{}{{Bj{e}}}}}Cj{}}{{{Kn{c}}e}{{Af{g}}}GhCj{}}{{{L`{c}}e}{{Af{g}}}GjCj{}}{{{Lb{c}}e}{{Af{g}}}HbCj{}}{{{Hf{c}}e}{{Af{g}}}ChCj{}}{{{Hh{c}}e}{{Af{g}}}ChCj{}}{{{Hj{c}}e}{{Af{g}}}ChCj{}}{{{Hl{c}}e}{{Af{g}}}ChCj{}}{{{Hn{c}}e}{{Af{g}}}ChCj{}}{{{I`{c}}e}{{Af{g}}}ChCj{}}{{{Ib{c}}e}{{Af{g}}}ChCj{}}{{{Id{c}}e}{{Af{g}}}ChCj{}}{{{If{ce}}g}{{Af{i}}}IhChCj{}}{{{In{c}}e}{{Af{g}}}ChCj{}}{{{J`{c}}e}{{Af{g}}}ChCj{}}{{{Jb{c}}e}{{Af{g}}}ChCj{}}{{{Jd{c}}e}{{Af{g}}}ChCj{}}{{{Jf{c}}e}{{Af{g}}}ChCj{}}{{{Jh{c}}e}{{Af{g}}}ChCj{}}{{{Jj{c}}e}{{Af{g}}}ChCj{}}{{{Jl{c}}e}{{Af{g}}}ChCj{}}{{{Jn{c}}e}{{Af{g}}}ChCj{}}{{{K`{c}}e}{{Af{g}}}ChCj{}}{{{Kb{c}}e}{{Af{g}}}ChCj{}}{{{Kd{c}}e}{{Af{g}}}ChCj{}}{{{Kf{c}}e}{{Af{g}}}ChCj{}}{{{Kh{c}}e}{{Af{g}}}ChCj{}}{{{Kj{c}}e}{{Af{g}}}ChCj{}}{{{Kl{gc}}i}{{Af{k}}}Ch{{Gd{c}}}{{Ih{}{{Bj{e}}}}}Cj{}}{{{Kn{c}}e}{{Af{g}}}GhCj{}}{{{L`{c}}e}{{Af{g}}}GjCj{}}{{{Lb{c}}e}{{Af{g}}}HbCj{}}{{{Hf{c}}e}{{Af{g}}}ChCj{}}{{{Hh{c}}e}{{Af{g}}}ChCj{}}{{{Hj{c}}e}{{Af{g}}}ChCj{}}{{{Hl{c}}e}{{Af{g}}}ChCj{}}{{{Hn{c}}e}{{Af{g}}}ChCj{}}{{{I`{c}}e}{{Af{g}}}ChCj{}}{{{Ib{c}}e}{{Af{g}}}ChCj{}}{{{Id{c}}e}{{Af{g}}}ChCj{}}{{{If{ce}}g}{{Af{i}}}IhChCj{}}{{{In{c}}e}{{Af{g}}}ChCj{}}{{{J`{c}}e}{{Af{g}}}ChCj{}}{{{Jb{c}}e}{{Af{g}}}ChCj{}}{{{Jd{c}}e}{{Af{g}}}ChCj{}}{{{Jf{c}}e}{{Af{g}}}ChCj{}}{{{Jh{c}}e}{{Af{g}}}ChCj{}}{{{Jj{c}}e}{{Af{g}}}ChCj{}}{{{Jl{c}}e}{{Af{g}}}ChCj{}}{{{Jn{c}}e}{{Af{g}}}ChCj{}}{{{K`{c}}e}{{Af{g}}}ChCj{}}{{{Kb{c}}e}{{Af{g}}}ChCj{}}{{{Kd{c}}e}{{Af{g}}}ChCj{}}{{{Kf{c}}e}{{Af{g}}}ChCj{}}{{{Kh{c}}e}{{Af{g}}}ChCj{}}{{{Kj{c}}e}{{Af{g}}}ChCj{}}{{{Kl{gc}}i}{{Af{k}}}Ch{{Gd{c}}}{{Ih{}{{Bj{e}}}}}Cj{}}{{{Kn{c}}e}{{Af{g}}}GhCj{}}{{{L`{c}}e}{{Af{g}}}GjCj{}}{{{Lb{c}}e}{{Af{g}}}HbCj{}}{{{Hf{c}}e}{{Af{g}}}ChCj{}}{{{Hh{c}}e}{{Af{g}}}ChCj{}}{{{Hj{c}}e}{{Af{g}}}ChCj{}}{{{Hl{c}}e}{{Af{g}}}ChCj{}}{{{Hn{c}}e}{{Af{g}}}ChCj{}}{{{I`{c}}e}{{Af{g}}}ChCj{}}{{{Ib{c}}e}{{Af{g}}}ChCj{}}{{{Id{c}}e}{{Af{g}}}ChCj{}}{{{If{ce}}g}{{Af{i}}}IhChCj{}}{{{In{c}}e}{{Af{g}}}ChCj{}}{{{J`{c}}e}{{Af{g}}}ChCj{}}{{{Jb{c}}e}{{Af{g}}}ChCj{}}{{{Jd{c}}e}{{Af{g}}}ChCj{}}{{{Jf{c}}e}{{Af{g}}}ChCj{}}{{{Jh{c}}e}{{Af{g}}}ChCj{}}{{{Jj{c}}e}{{Af{g}}}ChCj{}}{{{Jl{c}}e}{{Af{g}}}ChCj{}}{{{Jn{c}}e}{{Af{g}}}ChCj{}}{{{K`{c}}e}{{Af{g}}}ChCj{}}{{{Kb{c}}e}{{Af{g}}}ChCj{}}{{{Kd{c}}e}{{Af{g}}}ChCj{}}{{{Kf{c}}e}{{Af{g}}}ChCj{}}{{{Kh{c}}e}{{Af{g}}}ChCj{}}{{{Kj{c}}e}{{Af{g}}}ChCj{}}{{{Kl{gc}}i}{{Af{k}}}Ch{{Gd{c}}}{{Ih{}{{Bj{e}}}}}Cj{}}{{{Kn{c}}e}{{Af{g}}}GhCj{}}{{{L`{c}}e}{{Af{g}}}GjCj{}}{{{Lb{c}}e}{{Af{g}}}HbCj{}}{{{Hf{c}}Cle}{{Af{g}}}ChCj{}}{{{Hh{c}}Cle}{{Af{g}}}ChCj{}}{{{Hj{c}}Cle}{{Af{g}}}ChCj{}}{{{Hl{c}}Cle}{{Af{g}}}ChCj{}}{{{Hn{c}}Cle}{{Af{g}}}ChCj{}}{{{I`{c}}Cle}{{Af{g}}}ChCj{}}{{{Ib{c}}Cle}{{Af{g}}}ChCj{}}{{{Id{c}}Cle}{{Af{g}}}ChCj{}}{{{If{ce}}Clg}{{Af{i}}}IhChCj{}}{{{In{c}}Cle}{{Af{g}}}ChCj{}}{{{J`{c}}Cle}{{Af{g}}}ChCj{}}{{{Jb{c}}Cle}{{Af{g}}}ChCj{}}{{{Jd{c}}Cle}{{Af{g}}}ChCj{}}{{{Jf{c}}Cle}{{Af{g}}}ChCj{}}{{{Jh{c}}Cle}{{Af{g}}}ChCj{}}{{{Jj{c}}Cle}{{Af{g}}}ChCj{}}{{{Jl{c}}Cle}{{Af{g}}}ChCj{}}{{{Jn{c}}Cle}{{Af{g}}}ChCj{}}{{{K`{c}}Cle}{{Af{g}}}ChCj{}}{{{Kb{c}}Cle}{{Af{g}}}ChCj{}}{{{Kd{c}}Cle}{{Af{g}}}ChCj{}}{{{Kf{c}}Cle}{{Af{g}}}ChCj{}}{{{Kh{c}}Cle}{{Af{g}}}ChCj{}}{{{Kj{c}}Cle}{{Af{g}}}ChCj{}}{{{Kl{gc}}Cli}{{Af{k}}}Ch{{Gd{c}}}{{Ih{}{{Bj{e}}}}}Cj{}}{{{Kn{c}}Cle}{{Af{g}}}GhCj{}}{{{L`{c}}Cle}{{Af{g}}}GjCj{}}{{{Lb{c}}Cle}{{Af{g}}}HbCj{}}{{{Hf{c}}e}{{Af{g}}}ChCj{}}{{{Hh{c}}e}{{Af{g}}}ChCj{}}{{{Hj{c}}e}{{Af{g}}}ChCj{}}{{{Hl{c}}e}{{Af{g}}}ChCj{}}{{{Hn{c}}e}{{Af{g}}}ChCj{}}{{{I`{c}}e}{{Af{g}}}ChCj{}}{{{Ib{c}}e}{{Af{g}}}ChCj{}}{{{Id{c}}e}{{Af{g}}}ChCj{}}{{{If{ce}}g}{{Af{i}}}IhChCj{}}{{{In{c}}e}{{Af{g}}}ChCj{}}{{{J`{c}}e}{{Af{g}}}ChCj{}}{{{Jb{c}}e}{{Af{g}}}ChCj{}}{{{Jd{c}}e}{{Af{g}}}ChCj{}}{{{Jf{c}}e}{{Af{g}}}ChCj{}}{{{Jh{c}}e}{{Af{g}}}ChCj{}}{{{Jj{c}}e}{{Af{g}}}ChCj{}}{{{Jl{c}}e}{{Af{g}}}ChCj{}}{{{Jn{c}}e}{{Af{g}}}ChCj{}}{{{K`{c}}e}{{Af{g}}}ChCj{}}{{{Kb{c}}e}{{Af{g}}}ChCj{}}{{{Kd{c}}e}{{Af{g}}}ChCj{}}{{{Kf{c}}e}{{Af{g}}}ChCj{}}{{{Kh{c}}e}{{Af{g}}}ChCj{}}{{{Kj{c}}e}{{Af{g}}}ChCj{}}{{{Kl{gc}}i}{{Af{k}}}Ch{{Gd{c}}}{{Ih{}{{Bj{e}}}}}Cj{}}{{{Kn{c}}e}{{Af{g}}}GhCj{}}{{{L`{c}}e}{{Af{g}}}GjCj{}}{{{Lb{c}}e}{{Af{g}}}HbCj{}}{{{Hf{c}}e}{{Af{g}}}ChCj{}}{{{Hh{c}}e}{{Af{g}}}ChCj{}}{{{Hj{c}}e}{{Af{g}}}ChCj{}}{{{Hl{c}}e}{{Af{g}}}ChCj{}}{{{Hn{c}}e}{{Af{g}}}ChCj{}}{{{I`{c}}e}{{Af{g}}}ChCj{}}{{{Ib{c}}e}{{Af{g}}}ChCj{}}{{{Id{c}}e}{{Af{g}}}ChCj{}}{{{If{ce}}g}{{Af{i}}}IhChCj{}}{{{In{c}}e}{{Af{g}}}ChCj{}}{{{J`{c}}e}{{Af{g}}}ChCj{}}{{{Jb{c}}e}{{Af{g}}}ChCj{}}{{{Jd{c}}e}{{Af{g}}}ChCj{}}{{{Jf{c}}e}{{Af{g}}}ChCj{}}{{{Jh{c}}e}{{Af{g}}}ChCj{}}{{{Jj{c}}e}{{Af{g}}}ChCj{}}{{{Jl{c}}e}{{Af{g}}}ChCj{}}{{{Jn{c}}e}{{Af{g}}}ChCj{}}{{{K`{c}}e}{{Af{g}}}ChCj{}}{{{Kb{c}}e}{{Af{g}}}ChCj{}}{{{Kd{c}}e}{{Af{g}}}ChCj{}}{{{Kf{c}}e}{{Af{g}}}ChCj{}}{{{Kh{c}}e}{{Af{g}}}ChCj{}}{{{Kj{c}}e}{{Af{g}}}ChCj{}}{{{Kl{gc}}i}{{Af{k}}}Ch{{Gd{c}}}{{Ih{}{{Bj{e}}}}}Cj{}}{{{Kn{c}}e}{{Af{g}}}GhCj{}}{{{L`{c}}e}{{Af{g}}}GjCj{}}{{{Lb{c}}e}{{Af{g}}}HbCj{}}{{{Hf{c}}e}{{Af{g}}}ChCj{}}{{{Hh{c}}e}{{Af{g}}}ChCj{}}{{{Hj{c}}e}{{Af{g}}}ChCj{}}{{{Hl{c}}e}{{Af{g}}}ChCj{}}{{{Hn{c}}e}{{Af{g}}}ChCj{}}{{{I`{c}}e}{{Af{g}}}ChCj{}}{{{Ib{c}}e}{{Af{g}}}ChCj{}}{{{Id{c}}e}{{Af{g}}}ChCj{}}{{{If{ce}}g}{{Af{i}}}IhChCj{}}{{{In{c}}e}{{Af{g}}}ChCj{}}{{{J`{c}}e}{{Af{g}}}ChCj{}}{{{Jb{c}}e}{{Af{g}}}ChCj{}}{{{Jd{c}}e}{{Af{g}}}ChCj{}}{{{Jf{c}}e}{{Af{g}}}ChCj{}}{{{Jh{c}}e}{{Af{g}}}ChCj{}}{{{Jj{c}}e}{{Af{g}}}ChCj{}}{{{Jl{c}}e}{{Af{g}}}ChCj{}}{{{Jn{c}}e}{{Af{g}}}ChCj{}}{{{K`{c}}e}{{Af{g}}}ChCj{}}{{{Kb{c}}e}{{Af{g}}}ChCj{}}{{{Kd{c}}e}{{Af{g}}}ChCj{}}{{{Kf{c}}e}{{Af{g}}}ChCj{}}{{{Kh{c}}e}{{Af{g}}}ChCj{}}{{{Kj{c}}e}{{Af{g}}}ChCj{}}{{{Kl{gc}}i}{{Af{k}}}Ch{{Gd{c}}}{{Ih{}{{Bj{e}}}}}Cj{}}{{{Kn{c}}e}{{Af{g}}}GhCj{}}{{{L`{c}}e}{{Af{g}}}GjCj{}}{{{Lb{c}}e}{{Af{g}}}HbCj{}}{{{Hf{c}}e}{{Af{g}}}ChCj{}}{{{Hh{c}}e}{{Af{g}}}ChCj{}}{{{Hj{c}}e}{{Af{g}}}ChCj{}}{{{Hl{c}}e}{{Af{g}}}ChCj{}}{{{Hn{c}}e}{{Af{g}}}ChCj{}}{{{I`{c}}e}{{Af{g}}}ChCj{}}{{{Ib{c}}e}{{Af{g}}}ChCj{}}{{{Id{c}}e}{{Af{g}}}ChCj{}}{{{If{ce}}g}{{Af{i}}}IhChCj{}}{{{In{c}}e}{{Af{g}}}ChCj{}}{{{J`{c}}e}{{Af{g}}}ChCj{}}{{{Jb{c}}e}{{Af{g}}}ChCj{}}{{{Jd{c}}e}{{Af{g}}}ChCj{}}{{{Jf{c}}e}{{Af{g}}}ChCj{}}{{{Jh{c}}e}{{Af{g}}}ChCj{}}{{{Jj{c}}e}{{Af{g}}}ChCj{}}{{{Jl{c}}e}{{Af{g}}}ChCj{}}{{{Jn{c}}e}{{Af{g}}}ChCj{}}{{{K`{c}}e}{{Af{g}}}ChCj{}}{{{Kb{c}}e}{{Af{g}}}ChCj{}}{{{Kd{c}}e}{{Af{g}}}ChCj{}}{{{Kf{c}}e}{{Af{g}}}ChCj{}}{{{Kh{c}}e}{{Af{g}}}ChCj{}}{{{Kj{c}}e}{{Af{g}}}ChCj{}}{{{Kl{gc}}i}{{Af{k}}}Ch{{Gd{c}}}{{Ih{}{{Bj{e}}}}}Cj{}}{{{Kn{c}}e}{{Af{g}}}GhCj{}}{{{L`{c}}e}{{Af{g}}}GjCj{}}{{{Lb{c}}e}{{Af{g}}}HbCj{}}{{{Hf{c}}Cl{Cn{Cl}}e}{{Af{g}}}ChCj{}}{{{Hh{c}}Cl{Cn{Cl}}e}{{Af{g}}}ChCj{}}{{{Hj{c}}Cl{Cn{Cl}}e}{{Af{g}}}ChCj{}}{{{Hl{c}}Cl{Cn{Cl}}e}{{Af{g}}}ChCj{}}{{{Hn{c}}Cl{Cn{Cl}}e}{{Af{g}}}ChCj{}}{{{I`{c}}Cl{Cn{Cl}}e}{{Af{g}}}ChCj{}}{{{Ib{c}}Cl{Cn{Cl}}e}{{Af{g}}}ChCj{}}{{{Id{c}}Cl{Cn{Cl}}e}{{Af{g}}}ChCj{}}{{{If{ce}}Cl{Cn{Cl}}g}{{Af{i}}}IhChCj{}}{{{In{c}}Cl{Cn{Cl}}e}{{Af{g}}}ChCj{}}{{{J`{c}}Cl{Cn{Cl}}e}{{Af{g}}}ChCj{}}{{{Jb{c}}Cl{Cn{Cl}}e}{{Af{g}}}ChCj{}}{{{Jd{c}}Cl{Cn{Cl}}e}{{Af{g}}}ChCj{}}{{{Jf{c}}Cl{Cn{Cl}}e}{{Af{g}}}ChCj{}}{{{Jh{c}}Cl{Cn{Cl}}e}{{Af{g}}}ChCj{}}{{{Jj{c}}Cl{Cn{Cl}}e}{{Af{g}}}ChCj{}}{{{Jl{c}}Cl{Cn{Cl}}e}{{Af{g}}}ChCj{}}{{{Jn{c}}Cl{Cn{Cl}}e}{{Af{g}}}ChCj{}}{{{K`{c}}Cl{Cn{Cl}}e}{{Af{g}}}ChCj{}}{{{Kb{c}}Cl{Cn{Cl}}e}{{Af{g}}}ChCj{}}{{{Kd{c}}Cl{Cn{Cl}}e}{{Af{g}}}ChCj{}}{{{Kf{c}}Cl{Cn{Cl}}e}{{Af{g}}}ChCj{}}{{{Kh{c}}Cl{Cn{Cl}}e}{{Af{g}}}ChCj{}}{{{Kj{c}}Cl{Cn{Cl}}e}{{Af{g}}}ChCj{}}{{{Kl{gc}}Cl{Cn{Cl}}i}{{Af{k}}}Ch{{Gd{c}}}{{Ih{}{{Bj{e}}}}}Cj{}}{{{Kn{c}}Cl{Cn{Cl}}e}{{Af{g}}}GhCj{}}{{{L`{c}}Cl{Cn{Cl}}e}{{Af{g}}}GjCj{}}{{{Lb{c}}Cl{Cn{Cl}}e}{{Af{g}}}HbCj{}}{{{Hf{c}}D`e}{{Af{g}}}ChCj{}}{{{Hh{c}}D`e}{{Af{g}}}ChCj{}}{{{Hj{c}}D`e}{{Af{g}}}ChCj{}}{{{Hl{c}}D`e}{{Af{g}}}ChCj{}}{{{Hn{c}}D`e}{{Af{g}}}ChCj{}}{{{I`{c}}D`e}{{Af{g}}}ChCj{}}{{{Ib{c}}D`e}{{Af{g}}}ChCj{}}{{{Id{c}}D`e}{{Af{g}}}ChCj{}}{{{If{ce}}D`g}{{Af{i}}}IhChCj{}}{{{In{c}}D`e}{{Af{g}}}ChCj{}}{{{J`{c}}D`e}{{Af{g}}}ChCj{}}{{{Jb{c}}D`e}{{Af{g}}}ChCj{}}{{{Jd{c}}D`e}{{Af{g}}}ChCj{}}{{{Jf{c}}D`e}{{Af{g}}}ChCj{}}{{{Jh{c}}D`e}{{Af{g}}}ChCj{}}{{{Jj{c}}D`e}{{Af{g}}}ChCj{}}{{{Jl{c}}D`e}{{Af{g}}}ChCj{}}{{{Jn{c}}D`e}{{Af{g}}}ChCj{}}{{{K`{c}}D`e}{{Af{g}}}ChCj{}}{{{Kb{c}}D`e}{{Af{g}}}ChCj{}}{{{Kd{c}}D`e}{{Af{g}}}ChCj{}}{{{Kf{c}}D`e}{{Af{g}}}ChCj{}}{{{Kh{c}}D`e}{{Af{g}}}ChCj{}}{{{Kj{c}}D`e}{{Af{g}}}ChCj{}}{{{Kl{gc}}D`i}{{Af{k}}}Ch{{Gd{c}}}{{Ih{}{{Bj{e}}}}}Cj{}}{{{Kn{c}}D`e}{{Af{g}}}GhCj{}}{{{L`{c}}D`e}{{Af{g}}}GjCj{}}{{{Lb{c}}D`e}{{Af{g}}}HbCj{}}{{{Hf{c}}ClD`e}{{Af{g}}}ChCj{}}{{{Hh{c}}ClD`e}{{Af{g}}}ChCj{}}{{{Hj{c}}ClD`e}{{Af{g}}}ChCj{}}{{{Hl{c}}ClD`e}{{Af{g}}}ChCj{}}{{{Hn{c}}ClD`e}{{Af{g}}}ChCj{}}{{{I`{c}}ClD`e}{{Af{g}}}ChCj{}}{{{Ib{c}}ClD`e}{{Af{g}}}ChCj{}}{{{Id{c}}ClD`e}{{Af{g}}}ChCj{}}{{{If{ce}}ClD`g}{{Af{i}}}IhChCj{}}{{{In{c}}ClD`e}{{Af{g}}}ChCj{}}{{{J`{c}}ClD`e}{{Af{g}}}ChCj{}}{{{Jb{c}}ClD`e}{{Af{g}}}ChCj{}}{{{Jd{c}}ClD`e}{{Af{g}}}ChCj{}}{{{Jf{c}}ClD`e}{{Af{g}}}ChCj{}}{{{Jh{c}}ClD`e}{{Af{g}}}ChCj{}}{{{Jj{c}}ClD`e}{{Af{g}}}ChCj{}}{{{Jl{c}}ClD`e}{{Af{g}}}ChCj{}}{{{Jn{c}}ClD`e}{{Af{g}}}ChCj{}}{{{K`{c}}ClD`e}{{Af{g}}}ChCj{}}{{{Kb{c}}ClD`e}{{Af{g}}}ChCj{}}{{{Kd{c}}ClD`e}{{Af{g}}}ChCj{}}{{{Kf{c}}ClD`e}{{Af{g}}}ChCj{}}{{{Kh{c}}ClD`e}{{Af{g}}}ChCj{}}{{{Kj{c}}ClD`e}{{Af{g}}}ChCj{}}{{{Kl{gc}}ClD`i}{{Af{k}}}Ch{{Gd{c}}}{{Ih{}{{Bj{e}}}}}Cj{}}{{{Kn{c}}ClD`e}{{Af{g}}}GhCj{}}{{{L`{c}}ClD`e}{{Af{g}}}GjCj{}}{{{Lb{c}}ClD`e}{{Af{g}}}HbCj{}}{{{Hf{c}}e}{{Af{g}}}ChCj{}}{{{Hh{c}}e}{{Af{g}}}ChCj{}}{{{Hj{c}}e}{{Af{g}}}ChCj{}}{{{Hl{c}}e}{{Af{g}}}ChCj{}}{{{Hn{c}}e}{{Af{g}}}ChCj{}}{{{I`{c}}e}{{Af{g}}}ChCj{}}{{{Ib{c}}e}{{Af{g}}}ChCj{}}{{{Id{c}}e}{{Af{g}}}ChCj{}}{{{If{ce}}g}{{Af{i}}}IhChCj{}}{{{In{c}}e}{{Af{g}}}ChCj{}}{{{J`{c}}e}{{Af{g}}}ChCj{}}{{{Jb{c}}e}{{Af{g}}}ChCj{}}{{{Jd{c}}e}{{Af{g}}}ChCj{}}{{{Jf{c}}e}{{Af{g}}}ChCj{}}{{{Jh{c}}e}{{Af{g}}}ChCj{}}{{{Jj{c}}e}{{Af{g}}}ChCj{}}{{{Jl{c}}e}{{Af{g}}}ChCj{}}{{{Jn{c}}e}{{Af{g}}}ChCj{}}{{{K`{c}}e}{{Af{g}}}ChCj{}}{{{Kb{c}}e}{{Af{g}}}ChCj{}}{{{Kd{c}}e}{{Af{g}}}ChCj{}}{{{Kf{c}}e}{{Af{g}}}ChCj{}}{{{Kh{c}}e}{{Af{g}}}ChCj{}}{{{Kj{c}}e}{{Af{g}}}ChCj{}}{{{Kl{gc}}i}{{Af{k}}}Ch{{Gd{c}}}{{Ih{}{{Bj{e}}}}}Cj{}}{{{Kn{c}}e}{{Af{g}}}GhCj{}}{{{L`{c}}e}{{Af{g}}}GjCj{}}{{{Lb{c}}e}{{Af{g}}}HbCj{}}{{{Hf{c}}e}{{Af{g}}}ChCj{}}{{{Hh{c}}e}{{Af{g}}}ChCj{}}{{{Hj{c}}e}{{Af{g}}}ChCj{}}{{{Hl{c}}e}{{Af{g}}}ChCj{}}{{{Hn{c}}e}{{Af{g}}}ChCj{}}{{{I`{c}}e}{{Af{g}}}ChCj{}}{{{Ib{c}}e}{{Af{g}}}ChCj{}}{{{Id{c}}e}{{Af{g}}}ChCj{}}{{{If{ce}}g}{{Af{i}}}IhChCj{}}{{{In{c}}e}{{Af{g}}}ChCj{}}{{{J`{c}}e}{{Af{g}}}ChCj{}}{{{Jb{c}}e}{{Af{g}}}ChCj{}}{{{Jd{c}}e}{{Af{g}}}ChCj{}}{{{Jf{c}}e}{{Af{g}}}ChCj{}}{{{Jh{c}}e}{{Af{g}}}ChCj{}}{{{Jj{c}}e}{{Af{g}}}ChCj{}}{{{Jl{c}}e}{{Af{g}}}ChCj{}}{{{Jn{c}}e}{{Af{g}}}ChCj{}}{{{K`{c}}e}{{Af{g}}}ChCj{}}{{{Kb{c}}e}{{Af{g}}}ChCj{}}{{{Kd{c}}e}{{Af{g}}}ChCj{}}{{{Kf{c}}e}{{Af{g}}}ChCj{}}{{{Kh{c}}e}{{Af{g}}}ChCj{}}{{{Kj{c}}e}{{Af{g}}}ChCj{}}{{{Kl{gc}}i}{{Af{k}}}Ch{{Gd{c}}}{{Ih{}{{Bj{e}}}}}Cj{}}{{{Kn{c}}e}{{Af{g}}}GhCj{}}{{{L`{c}}e}{{Af{g}}}GjCj{}}{{{Lb{c}}e}{{Af{g}}}HbCj{}}{{{Hf{c}}e}{{Af{g}}}ChCj{}}{{{Hh{c}}e}{{Af{g}}}ChCj{}}{{{Hj{c}}e}{{Af{g}}}ChCj{}}{{{Hl{c}}e}{{Af{g}}}ChCj{}}{{{Hn{c}}e}{{Af{g}}}ChCj{}}{{{I`{c}}e}{{Af{g}}}ChCj{}}{{{Ib{c}}e}{{Af{g}}}ChCj{}}{{{Id{c}}e}{{Af{g}}}ChCj{}}{{{If{ce}}g}{{Af{i}}}IhChCj{}}{{{In{c}}e}{{Af{g}}}ChCj{}}{{{J`{c}}e}{{Af{g}}}ChCj{}}{{{Jb{c}}e}{{Af{g}}}ChCj{}}{{{Jd{c}}e}{{Af{g}}}ChCj{}}{{{Jf{c}}e}{{Af{g}}}ChCj{}}{{{Jh{c}}e}{{Af{g}}}ChCj{}}{{{Jj{c}}e}{{Af{g}}}ChCj{}}{{{Jl{c}}e}{{Af{g}}}ChCj{}}{{{Jn{c}}e}{{Af{g}}}ChCj{}}{{{K`{c}}e}{{Af{g}}}ChCj{}}{{{Kb{c}}e}{{Af{g}}}ChCj{}}{{{Kd{c}}e}{{Af{g}}}ChCj{}}{{{Kf{c}}e}{{Af{g}}}ChCj{}}{{{Kh{c}}e}{{Af{g}}}ChCj{}}{{{Kj{c}}e}{{Af{g}}}ChCj{}}{{{Kl{gc}}i}{{Af{k}}}Ch{{Gd{c}}}{{Ih{}{{Bj{e}}}}}Cj{}}{{{Kn{c}}e}{{Af{g}}}GhCj{}}{{{L`{c}}e}{{Af{g}}}GjCj{}}{{{Lb{c}}e}{{Af{g}}}HbCj{}}{{{Hf{c}}e}{{Af{g}}}ChCj{}}{{{Hh{c}}e}{{Af{g}}}ChCj{}}{{{Hj{c}}e}{{Af{g}}}ChCj{}}{{{Hl{c}}e}{{Af{g}}}ChCj{}}{{{Hn{c}}e}{{Af{g}}}ChCj{}}{{{I`{c}}e}{{Af{g}}}ChCj{}}{{{Ib{c}}e}{{Af{g}}}ChCj{}}{{{Id{c}}e}{{Af{g}}}ChCj{}}{{{If{ce}}g}{{Af{i}}}IhChCj{}}{{{In{c}}e}{{Af{g}}}ChCj{}}{{{J`{c}}e}{{Af{g}}}ChCj{}}{{{Jb{c}}e}{{Af{g}}}ChCj{}}{{{Jd{c}}e}{{Af{g}}}ChCj{}}{{{Jf{c}}e}{{Af{g}}}ChCj{}}{{{Jh{c}}e}{{Af{g}}}ChCj{}}{{{Jj{c}}e}{{Af{g}}}ChCj{}}{{{Jl{c}}e}{{Af{g}}}ChCj{}}{{{Jn{c}}e}{{Af{g}}}ChCj{}}{{{K`{c}}e}{{Af{g}}}ChCj{}}{{{Kb{c}}e}{{Af{g}}}ChCj{}}{{{Kd{c}}e}{{Af{g}}}ChCj{}}{{{Kf{c}}e}{{Af{g}}}ChCj{}}{{{Kh{c}}e}{{Af{g}}}ChCj{}}{{{Kj{c}}e}{{Af{g}}}ChCj{}}{{{Kl{gc}}i}{{Af{k}}}Ch{{Gd{c}}}{{Ih{}{{Bj{e}}}}}Cj{}}{{{Kn{c}}e}{{Af{g}}}GhCj{}}{{{L`{c}}e}{{Af{g}}}GjCj{}}{{{Lb{c}}e}{{Af{g}}}HbCj{}}{{{Hf{c}}e}{{Af{g}}}ChCj{}}{{{Hh{c}}e}{{Af{g}}}ChCj{}}{{{Hj{c}}e}{{Af{g}}}ChCj{}}{{{Hl{c}}e}{{Af{g}}}ChCj{}}{{{Hn{c}}e}{{Af{g}}}ChCj{}}{{{I`{c}}e}{{Af{g}}}ChCj{}}{{{Ib{c}}e}{{Af{g}}}ChCj{}}{{{Id{c}}e}{{Af{g}}}ChCj{}}{{{If{ce}}g}{{Af{i}}}IhChCj{}}{{{In{c}}e}{{Af{g}}}ChCj{}}{{{J`{c}}e}{{Af{g}}}ChCj{}}{{{Jb{c}}e}{{Af{g}}}ChCj{}}{{{Jd{c}}e}{{Af{g}}}ChCj{}}{{{Jf{c}}e}{{Af{g}}}ChCj{}}{{{Jh{c}}e}{{Af{g}}}ChCj{}}{{{Jj{c}}e}{{Af{g}}}ChCj{}}{{{Jl{c}}e}{{Af{g}}}ChCj{}}{{{Jn{c}}e}{{Af{g}}}ChCj{}}{{{K`{c}}e}{{Af{g}}}ChCj{}}{{{Kb{c}}e}{{Af{g}}}ChCj{}}{{{Kd{c}}e}{{Af{g}}}ChCj{}}{{{Kf{c}}e}{{Af{g}}}ChCj{}}{{{Kh{c}}e}{{Af{g}}}ChCj{}}{{{Kj{c}}e}{{Af{g}}}ChCj{}}{{{Kl{gc}}i}{{Af{k}}}Ch{{Gd{c}}}{{Ih{}{{Bj{e}}}}}Cj{}}{{{Kn{c}}e}{{Af{g}}}GhCj{}}{{{L`{c}}e}{{Af{g}}}GjCj{}}{{{Lb{c}}e}{{Af{g}}}HbCj{}}{{{Hf{c}}e}{{Af{g}}}ChCj{}}{{{Hh{c}}e}{{Af{g}}}ChCj{}}{{{Hj{c}}e}{{Af{g}}}ChCj{}}{{{Hl{c}}e}{{Af{g}}}ChCj{}}{{{Hn{c}}e}{{Af{g}}}ChCj{}}{{{I`{c}}e}{{Af{g}}}ChCj{}}{{{Ib{c}}e}{{Af{g}}}ChCj{}}{{{Id{c}}e}{{Af{g}}}ChCj{}}{{{If{ce}}g}{{Af{i}}}IhChCj{}}{{{In{c}}e}{{Af{g}}}ChCj{}}{{{J`{c}}e}{{Af{g}}}ChCj{}}{{{Jb{c}}e}{{Af{g}}}ChCj{}}{{{Jd{c}}e}{{Af{g}}}ChCj{}}{{{Jf{c}}e}{{Af{g}}}ChCj{}}{{{Jh{c}}e}{{Af{g}}}ChCj{}}{{{Jj{c}}e}{{Af{g}}}ChCj{}}{{{Jl{c}}e}{{Af{g}}}ChCj{}}{{{Jn{c}}e}{{Af{g}}}ChCj{}}{{{K`{c}}e}{{Af{g}}}ChCj{}}{{{Kb{c}}e}{{Af{g}}}ChCj{}}{{{Kd{c}}e}{{Af{g}}}ChCj{}}{{{Kf{c}}e}{{Af{g}}}ChCj{}}{{{Kh{c}}e}{{Af{g}}}ChCj{}}{{{Kj{c}}e}{{Af{g}}}ChCj{}}{{{Kl{gc}}i}{{Af{k}}}Ch{{Gd{c}}}{{Ih{}{{Bj{e}}}}}Cj{}}{{{Kn{c}}e}{{Af{g}}}GhCj{}}{{{L`{c}}e}{{Af{g}}}GjCj{}}{{{Lb{c}}e}{{Af{g}}}HbCj{}}{{{Hf{c}}Cle}{{Af{g}}}ChCj{}}{{{Hh{c}}Cle}{{Af{g}}}ChCj{}}{{{Hj{c}}Cle}{{Af{g}}}ChCj{}}{{{Hl{c}}Cle}{{Af{g}}}ChCj{}}{{{Hn{c}}Cle}{{Af{g}}}ChCj{}}{{{I`{c}}Cle}{{Af{g}}}ChCj{}}{{{Ib{c}}Cle}{{Af{g}}}ChCj{}}{{{Id{c}}Cle}{{Af{g}}}ChCj{}}{{{If{ce}}Clg}{{Af{i}}}IhChCj{}}{{{In{c}}Cle}{{Af{g}}}ChCj{}}{{{J`{c}}Cle}{{Af{g}}}ChCj{}}{{{Jb{c}}Cle}{{Af{g}}}ChCj{}}{{{Jd{c}}Cle}{{Af{g}}}ChCj{}}{{{Jf{c}}Cle}{{Af{g}}}ChCj{}}{{{Jh{c}}Cle}{{Af{g}}}ChCj{}}{{{Jj{c}}Cle}{{Af{g}}}ChCj{}}{{{Jl{c}}Cle}{{Af{g}}}ChCj{}}{{{Jn{c}}Cle}{{Af{g}}}ChCj{}}{{{K`{c}}Cle}{{Af{g}}}ChCj{}}{{{Kb{c}}Cle}{{Af{g}}}ChCj{}}{{{Kd{c}}Cle}{{Af{g}}}ChCj{}}{{{Kf{c}}Cle}{{Af{g}}}ChCj{}}{{{Kh{c}}Cle}{{Af{g}}}ChCj{}}{{{Kj{c}}Cle}{{Af{g}}}ChCj{}}{{{Kl{gc}}Cli}{{Af{k}}}Ch{{Gd{c}}}{{Ih{}{{Bj{e}}}}}Cj{}}{{{Kn{c}}Cle}{{Af{g}}}GhCj{}}{{{L`{c}}Cle}{{Af{g}}}GjCj{}}{{{Lb{c}}Cle}{{Af{g}}}HbCj{}}{{{If{ce}}}{{Af{Fde}}}IhCh}{{{Kl{ce}}}{{Af{Fde}}}IhCh}{{IlIl}Db}{{{Hf{c}}Fj}Fl{}}{{{Hh{c}}Fj}Fl{}}{{{Hj{c}}Fj}Fl{}}{{{Hl{c}}Fj}Fl{}}{{{Hn{c}}Fj}Fl{}}{{{I`{c}}Fj}Fl{}}{{{Ib{c}}Fj}Fl{}}{{{Id{c}}Fj}Fl{}}{{{If{ce}}Fj}Fl{IhLd}{}}{{IlFj}Fl}0{{{In{c}}Fj}Fl{}}{{{J`{c}}Fj}Fl{}}{{{Jb{c}}Fj}Fl{}}{{{Jd{c}}Fj}Fl{}}{{{Jf{c}}Fj}Fl{}}{{{Jh{c}}Fj}Fl{}}{{{Jj{c}}Fj}Fl{}}{{{Jl{c}}Fj}Fl{}}{{{Jn{c}}Fj}Fl{}}{{{K`{c}}Fj}Fl{}}{{{Kb{c}}Fj}Fl{}}{{{Kd{c}}Fj}Fl{}}{{{Kf{c}}Fj}Fl{}}{{{Kh{c}}Fj}Fl{}}{{{Kj{c}}Fj}Fl{}}{{{Kl{ce}}Fj}FlLd{}}{{{Kn{c}}Fj}FlLd}{{{L`{c}}Fj}FlLd}{{{Lb{c}}Fj}FlLd}{cc{}}0000000000000000000000000000{ce{}{}}0000000000000000000000000000{{}{{Hf{c}}}{}}{Eh{{Hh{c}}}{}}{Cl{{Hj{c}}}{}}{Cl{{Hl{c}}}{}}{Gl{{Hn{c}}}{}}{{{Lf{Cl}}}{{I`{c}}}{}}{{{Cn{Dd}}}{{Ib{c}}}{}}{{{Cn{Dd}}}{{Id{c}}}{}}{c{{If{ce}}}Ih{}}{Db{{In{c}}}{}}{Ed{{J`{c}}}{}}{Dn{{Jb{c}}}{}}{E`{{Jd{c}}}{}}{Eb{{Jf{c}}}{}}{Dl{{Jh{c}}}{}}{Lh{{Jj{c}}}{}}{Dd{{Jl{c}}}{}}{El{{Jn{c}}}{}}{En{{K`{c}}}{}}{Ej{{Kb{c}}}{}}{D`{{Kd{c}}}{}}{Dh{{Kf{c}}}{}}{Dj{{Kh{c}}}{}}{Df{{Kj{c}}}{}}{c{{Kl{ce}}}Ih{}}{c{{Kn{c}}}{}}{c{{L`{c}}}{}}{c{{Lb{c}}}{}}{{{If{ce}}g}{{Af{Efi}}}IhChFh{}}{{{Kl{gc}}i}{{Af{Efk}}}Ch{{Gd{c}}}{{Ih{}{{Bj{e}}}}}Fh{}}{{{If{ce}}gi}{{Af{{Ef{Bl}}k}}}IhChFhFh{}}2{{{If{ce}}g}{{Af{i}}}IhChFh{}}{{{If{ce}}}{{Ef{D`}}}IhCh}0{{{Kl{gc}}}{{Ef{D`}}}Ch{{Gd{c}}}{{Ih{}{{Bj{e}}}}}}{ce{}{}}0000000000000000000000000000{cGl{}}{c{{Af{e}}}{}{}}000000000000000000000000000000000000000000000000000000000{cGn{}}0000000000000000000000000000{{{Hh{c}}e}{{Af{{Bl{g}}i}}}ChFh{}{}}{{{Hj{c}}e}{{Af{{Bl{g}}i}}}ChFh{}{}}{{{Hl{c}}e}{{Af{{Bl{g}}i}}}ChFh{}{}}{{{Hn{c}}e}{{Af{{Bl{g}}i}}}ChFh{}{}}{{{I`{c}}e}{{Af{{Bl{g}}i}}}ChFh{}{}}{{{L`{c}}e}{{Af{{Bl{g}}i}}}GjFh{}{}}```````````````````````````````````99{{{Ad{}{{b{c}}{d{e}}{f{g}}{h{i}}{j{k}}{l{m}}{n{o}}{A`{Aa}}{Ab{Ac}}}}Ai}{{Af{ce}}}{}Ah{{Aj{}{{b{c}}{d{e}}}}}{{Al{}{{b{c}}{d{e}}}}}{{An{}{{b{c}}{d{e}}}}}{{B`{}{{b{c}}{d{e}}}}}{{Bb{}{{b{c}}{d{e}}}}}{{Bd{}{{b{c}}{d{e}}}}}{{Bf{}{{b{c}}{d{e}}}}}BhBh{{Bn{}{{Bj{{Bl{AeAg}}}}}}}}{{{Ad{}{{b{c}}{d{e}}{f{g}}{h{i}}{j{k}}{l{m}}{n{o}}{A`{Aa}}{Ab{Ac}}}}Ae}{{Af{ce}}}{}Ah{{Aj{}{{b{c}}{d{e}}}}}{{Al{}{{b{c}}{d{e}}}}}{{An{}{{b{c}}{d{e}}}}}{{B`{}{{b{c}}{d{e}}}}}{{Bb{}{{b{c}}{d{e}}}}}{{Bd{}{{b{c}}{d{e}}}}}{{Bf{}{{b{c}}{d{e}}}}}Bn}{{{Ad{}{{b{c}}{d{e}}{f{g}}{h{i}}{j{k}}{l{m}}{n{o}}{A`{Aa}}{Ab{Ac}}}}Ae}{{Af{ce}}}{}Ah{{Aj{}{{b{c}}{d{e}}}}}{{Al{}{{b{c}}{d{e}}}}}{{An{}{{b{c}}{d{e}}}}}{{B`{}{{b{c}}{d{e}}}}}{{Bb{}{{b{c}}{d{e}}}}}{{Bd{}{{b{c}}{d{e}}}}}{{Bf{}{{b{c}}{d{e}}}}}{C`Cb}}{cAhCb}{{{Aj{}{{b{c}}{d{e}}}}}{{Af{ce}}}{}Ah}{{{Al{}{{b{c}}{d{e}}}}}{{Af{ce}}}{}Ah}{{{An{}{{b{c}}{d{e}}}}}{{Af{ce}}}{}Ah}{{{B`{}{{b{c}}{d{e}}}}}{{Af{ce}}}{}Ah}{{{Bb{}{{b{c}}{d{e}}}}}{{Af{ce}}}{}Ah}{{{Bd{}{{b{c}}{d{e}}}}}{{Af{ce}}}{}Ah}{{{Bf{}{{b{c}}{d{e}}}}}{{Af{ce}}}{}Ah}{{{Lj{ce}}}{{Af{ce}}}{}Ah}000000{cc{}}{ce{}{}}{{{Ad{}{{b{c}}{d{e}}{f{g}}{h{i}}{j{k}}{l{m}}{n{o}}{A`{Aa}}{Ab{Ac}}}}}Db{}Ah{{Aj{}{{b{c}}{d{e}}}}}{{Al{}{{b{c}}{d{e}}}}}{{An{}{{b{c}}{d{e}}}}}{{B`{}{{b{c}}{d{e}}}}}{{Bb{}{{b{c}}{d{e}}}}}{{Bd{}{{b{c}}{d{e}}}}}{{Bf{}{{b{c}}{d{e}}}}}}{{Bhc}AfAd}{{{Ad{}{{b{c}}{d{e}}{f{g}}{h{i}}{j{k}}{l{m}}{n{o}}{A`{Aa}}{Ab{Ac}}}}Db}{{Af{ce}}}{}Ah{{Aj{}{{b{c}}{d{e}}}}}{{Al{}{{b{c}}{d{e}}}}}{{An{}{{b{c}}{d{e}}}}}{{B`{}{{b{c}}{d{e}}}}}{{Bb{}{{b{c}}{d{e}}}}}{{Bd{}{{b{c}}{d{e}}}}}{{Bf{}{{b{c}}{d{e}}}}}}{{{Ad{}{{b{c}}{d{e}}{f{g}}{h{i}}{j{k}}{l{m}}{n{o}}{A`{Aa}}{Ab{Ac}}}}{Cn{Dd}}}{{Af{ce}}}{}Ah{{Aj{}{{b{c}}{d{e}}}}}{{Al{}{{b{c}}{d{e}}}}}{{An{}{{b{c}}{d{e}}}}}{{B`{}{{b{c}}{d{e}}}}}{{Bb{}{{b{c}}{d{e}}}}}{{Bd{}{{b{c}}{d{e}}}}}{{Bf{}{{b{c}}{d{e}}}}}}{{{Ad{}{{b{c}}{d{e}}{f{g}}{h{i}}{j{k}}{l{m}}{n{o}}{A`{Aa}}{Ab{Ac}}}}Df}{{Af{ce}}}{}Ah{{Aj{}{{b{c}}{d{e}}}}}{{Al{}{{b{c}}{d{e}}}}}{{An{}{{b{c}}{d{e}}}}}{{B`{}{{b{c}}{d{e}}}}}{{Bb{}{{b{c}}{d{e}}}}}{{Bd{}{{b{c}}{d{e}}}}}{{Bf{}{{b{c}}{d{e}}}}}}{{{Aj{}{{b{c}}{d{e}}}}g}{{Af{Fde}}}{}Ah{C`Bh}}{{{Al{}{{b{c}}{d{e}}}}g}{{Af{Fde}}}{}Ah{C`Bh}}{{{Lj{ce}}g}{{Af{Fde}}}{}Ah{C`Bh}}0{{{Bb{}{{b{c}}{d{e}}}}gi}{{Af{Fde}}}{}Ah{C`Bh}{C`Bh}}{{{Ad{}{{b{c}}{d{e}}{f{g}}{h{i}}{j{k}}{l{m}}{n{o}}{A`{Aa}}{Ab{Ac}}}}Dh}{{Af{ce}}}{}Ah{{Aj{}{{b{c}}{d{e}}}}}{{Al{}{{b{c}}{d{e}}}}}{{An{}{{b{c}}{d{e}}}}}{{B`{}{{b{c}}{d{e}}}}}{{Bb{}{{b{c}}{d{e}}}}}{{Bd{}{{b{c}}{d{e}}}}}{{Bf{}{{b{c}}{d{e}}}}}}{{{Ad{}{{b{c}}{d{e}}{f{g}}{h{i}}{j{k}}{l{m}}{n{o}}{A`{Aa}}{Ab{Ac}}}}Dj}{{Af{ce}}}{}Ah{{Aj{}{{b{c}}{d{e}}}}}{{Al{}{{b{c}}{d{e}}}}}{{An{}{{b{c}}{d{e}}}}}{{B`{}{{b{c}}{d{e}}}}}{{Bb{}{{b{c}}{d{e}}}}}{{Bd{}{{b{c}}{d{e}}}}}{{Bf{}{{b{c}}{d{e}}}}}}{{{An{}{{b{c}}{d{e}}}}g}{{Af{Fde}}}{}Ah{C`Bh}}{{{B`{}{{b{c}}{d{e}}}}g}{{Af{Fde}}}{}Ah{C`Bh}}{{{Bd{}{{b{c}}{d{e}}}}Clg}{{Af{Fde}}}{}Ah{C`Bh}}{{{Bf{}{{b{c}}{d{e}}}}Clg}{{Af{Fde}}}{}Ah{C`Bh}}{{{Lj{ce}}Clg}{{Af{Fde}}}{}Ah{C`Bh}}880{{{Ad{}{{b{c}}{d{e}}{f{g}}{h{i}}{j{k}}{l{m}}{n{o}}{A`{Aa}}{Ab{Ac}}}}Dl}{{Af{ce}}}{}Ah{{Aj{}{{b{c}}{d{e}}}}}{{Al{}{{b{c}}{d{e}}}}}{{An{}{{b{c}}{d{e}}}}}{{B`{}{{b{c}}{d{e}}}}}{{Bb{}{{b{c}}{d{e}}}}}{{Bd{}{{b{c}}{d{e}}}}}{{Bf{}{{b{c}}{d{e}}}}}}{{{Ad{}{{b{c}}{d{e}}{f{g}}{h{i}}{j{k}}{l{m}}{n{o}}{A`{Aa}}{Ab{Ac}}}}Dn}{{Af{ce}}}{}Ah{{Aj{}{{b{c}}{d{e}}}}}{{Al{}{{b{c}}{d{e}}}}}{{An{}{{b{c}}{d{e}}}}}{{B`{}{{b{c}}{d{e}}}}}{{Bb{}{{b{c}}{d{e}}}}}{{Bd{}{{b{c}}{d{e}}}}}{{Bf{}{{b{c}}{d{e}}}}}}{{{Ad{}{{b{c}}{d{e}}{f{g}}{h{i}}{j{k}}{l{m}}{n{o}}{A`{Aa}}{Ab{Ac}}}}E`}{{Af{ce}}}{}Ah{{Aj{}{{b{c}}{d{e}}}}}{{Al{}{{b{c}}{d{e}}}}}{{An{}{{b{c}}{d{e}}}}}{{B`{}{{b{c}}{d{e}}}}}{{Bb{}{{b{c}}{d{e}}}}}{{Bd{}{{b{c}}{d{e}}}}}{{Bf{}{{b{c}}{d{e}}}}}}{{{Ad{}{{b{c}}{d{e}}{f{g}}{h{i}}{j{k}}{l{m}}{n{o}}{A`{Aa}}{Ab{Ac}}}}Eb}{{Af{ce}}}{}Ah{{Aj{}{{b{c}}{d{e}}}}}{{Al{}{{b{c}}{d{e}}}}}{{An{}{{b{c}}{d{e}}}}}{{B`{}{{b{c}}{d{e}}}}}{{Bb{}{{b{c}}{d{e}}}}}{{Bd{}{{b{c}}{d{e}}}}}{{Bf{}{{b{c}}{d{e}}}}}}{{{Ad{}{{b{c}}{d{e}}{f{g}}{h{i}}{j{k}}{l{m}}{n{o}}{A`{Aa}}{Ab{Ac}}}}Ed}{{Af{ce}}}{}Ah{{Aj{}{{b{c}}{d{e}}}}}{{Al{}{{b{c}}{d{e}}}}}{{An{}{{b{c}}{d{e}}}}}{{B`{}{{b{c}}{d{e}}}}}{{Bb{}{{b{c}}{d{e}}}}}{{Bd{}{{b{c}}{d{e}}}}}{{Bf{}{{b{c}}{d{e}}}}}}{{{Bb{}{{b{c}}{d{e}}}}g}{{Af{Fde}}}{}Ah{C`Bh}}>{{{Ad{}{{b{c}}{d{e}}{f{g}}{h{i}}{j{k}}{l{m}}{n{o}}{A`{Aa}}{Ab{Ac}}}}{Ef{D`}}}{{Af{oe}}}{}Ah{{Aj{}{{b{c}}{d{e}}}}}{{Al{}{{b{c}}{d{e}}}}}{{An{}{{b{c}}{d{e}}}}}{{B`{}{{b{c}}{d{e}}}}}{{Bb{}{{b{c}}{d{e}}}}}{{Bd{}{{b{c}}{d{e}}}}}{{Bf{}{{b{c}}{d{e}}}}}}{{{Ad{}{{b{c}}{d{e}}{f{g}}{h{i}}{j{k}}{l{m}}{n{o}}{A`{Aa}}{Ab{Ac}}}}ClAe}{{Af{ce}}}{}Ah{{Aj{}{{b{c}}{d{e}}}}}{{Al{}{{b{c}}{d{e}}}}}{{An{}{{b{c}}{d{e}}}}}{{B`{}{{b{c}}{d{e}}}}}{{Bb{}{{b{c}}{d{e}}}}}{{Bd{}{{b{c}}{d{e}}}}}{{Bf{}{{b{c}}{d{e}}}}}{C`Bh}}{{{Ad{}{{b{c}}{d{e}}{f{g}}{h{i}}{j{k}}{l{m}}{n{o}}{A`{Aa}}{Ab{Ac}}}}ClEhClAe}{{Af{ce}}}{}Ah{{Aj{}{{b{c}}{d{e}}}}}{{Al{}{{b{c}}{d{e}}}}}{{An{}{{b{c}}{d{e}}}}}{{B`{}{{b{c}}{d{e}}}}}{{Bb{}{{b{c}}{d{e}}}}}{{Bd{}{{b{c}}{d{e}}}}}{{Bf{}{{b{c}}{d{e}}}}}{C`Bh}}{{{Ad{}{{b{c}}{d{e}}{f{g}}{h{i}}{j{k}}{l{m}}{n{o}}{A`{Aa}}{Ab{Ac}}}}}{{Af{ce}}}{}Ah{{Aj{}{{b{c}}{d{e}}}}}{{Al{}{{b{c}}{d{e}}}}}{{An{}{{b{c}}{d{e}}}}}{{B`{}{{b{c}}{d{e}}}}}{{Bb{}{{b{c}}{d{e}}}}}{{Bd{}{{b{c}}{d{e}}}}}{{Bf{}{{b{c}}{d{e}}}}}}{{{Ad{}{{b{c}}{d{e}}{f{g}}{h{i}}{j{k}}{l{m}}{n{o}}{A`{Aa}}{Ab{Ac}}}}{Ef{D`}}}{{Af{ge}}}{}Ah{{Aj{}{{b{c}}{d{e}}}}}{{Al{}{{b{c}}{d{e}}}}}{{An{}{{b{c}}{d{e}}}}}{{B`{}{{b{c}}{d{e}}}}}{{Bb{}{{b{c}}{d{e}}}}}{{Bd{}{{b{c}}{d{e}}}}}{{Bf{}{{b{c}}{d{e}}}}}}{{{Ad{}{{b{c}}{d{e}}{f{g}}{h{i}}{j{k}}{l{m}}{n{o}}{A`{Aa}}{Ab{Ac}}}}Ae}{{Af{ce}}}{}Ah{{Aj{}{{b{c}}{d{e}}}}}{{Al{}{{b{c}}{d{e}}}}}{{An{}{{b{c}}{d{e}}}}}{{B`{}{{b{c}}{d{e}}}}}{{Bb{}{{b{c}}{d{e}}}}}{{Bd{}{{b{c}}{d{e}}}}}{{Bf{}{{b{c}}{d{e}}}}}{C`Bh}}{{{Ad{}{{b{c}}{d{e}}{f{g}}{h{i}}{j{k}}{l{m}}{n{o}}{A`{Aa}}{Ab{Ac}}}}Cl}{{Af{ce}}}{}Ah{{Aj{}{{b{c}}{d{e}}}}}{{Al{}{{b{c}}{d{e}}}}}{{An{}{{b{c}}{d{e}}}}}{{B`{}{{b{c}}{d{e}}}}}{{Bb{}{{b{c}}{d{e}}}}}{{Bd{}{{b{c}}{d{e}}}}}{{Bf{}{{b{c}}{d{e}}}}}}{{{Ad{}{{b{c}}{d{e}}{f{g}}{h{i}}{j{k}}{l{m}}{n{o}}{A`{Aa}}{Ab{Ac}}}}ClD`}{{Af{Aae}}}{}Ah{{Aj{}{{b{c}}{d{e}}}}}{{Al{}{{b{c}}{d{e}}}}}{{An{}{{b{c}}{d{e}}}}}{{B`{}{{b{c}}{d{e}}}}}{{Bb{}{{b{c}}{d{e}}}}}{{Bd{}{{b{c}}{d{e}}}}}{{Bf{}{{b{c}}{d{e}}}}}}{{{Ad{}{{b{c}}{d{e}}{f{g}}{h{i}}{j{k}}{l{m}}{n{o}}{A`{Aa}}{Ab{Ac}}}}ClEhClD`}{{Af{Ace}}}{}Ah{{Aj{}{{b{c}}{d{e}}}}}{{Al{}{{b{c}}{d{e}}}}}{{An{}{{b{c}}{d{e}}}}}{{B`{}{{b{c}}{d{e}}}}}{{Bb{}{{b{c}}{d{e}}}}}{{Bd{}{{b{c}}{d{e}}}}}{{Bf{}{{b{c}}{d{e}}}}}}{{{Ad{}{{b{c}}{d{e}}{f{g}}{h{i}}{j{k}}{l{m}}{n{o}}{A`{Aa}}{Ab{Ac}}}}D`}{{Af{ie}}}{}Ah{{Aj{}{{b{c}}{d{e}}}}}{{Al{}{{b{c}}{d{e}}}}}{{An{}{{b{c}}{d{e}}}}}{{B`{}{{b{c}}{d{e}}}}}{{Bb{}{{b{c}}{d{e}}}}}{{Bd{}{{b{c}}{d{e}}}}}{{Bf{}{{b{c}}{d{e}}}}}}{{{Ad{}{{b{c}}{d{e}}{f{g}}{h{i}}{j{k}}{l{m}}{n{o}}{A`{Aa}}{Ab{Ac}}}}ClD`}{{Af{ke}}}{}Ah{{Aj{}{{b{c}}{d{e}}}}}{{Al{}{{b{c}}{d{e}}}}}{{An{}{{b{c}}{d{e}}}}}{{B`{}{{b{c}}{d{e}}}}}{{Bb{}{{b{c}}{d{e}}}}}{{Bd{}{{b{c}}{d{e}}}}}{{Bf{}{{b{c}}{d{e}}}}}}{{{Ad{}{{b{c}}{d{e}}{f{g}}{h{i}}{j{k}}{l{m}}{n{o}}{A`{Aa}}{Ab{Ac}}}}ClEhClD`}{{Af{me}}}{}Ah{{Aj{}{{b{c}}{d{e}}}}}{{Al{}{{b{c}}{d{e}}}}}{{An{}{{b{c}}{d{e}}}}}{{B`{}{{b{c}}{d{e}}}}}{{Bb{}{{b{c}}{d{e}}}}}{{Bd{}{{b{c}}{d{e}}}}}{{Bf{}{{b{c}}{d{e}}}}}}{{{Ad{}{{b{c}}{d{e}}{f{g}}{h{i}}{j{k}}{l{m}}{n{o}}{A`{Aa}}{Ab{Ac}}}}Ej}{{Af{ce}}}{}Ah{{Aj{}{{b{c}}{d{e}}}}}{{Al{}{{b{c}}{d{e}}}}}{{An{}{{b{c}}{d{e}}}}}{{B`{}{{b{c}}{d{e}}}}}{{Bb{}{{b{c}}{d{e}}}}}{{Bd{}{{b{c}}{d{e}}}}}{{Bf{}{{b{c}}{d{e}}}}}}{{{Ad{}{{b{c}}{d{e}}{f{g}}{h{i}}{j{k}}{l{m}}{n{o}}{A`{Aa}}{Ab{Ac}}}}El}{{Af{ce}}}{}Ah{{Aj{}{{b{c}}{d{e}}}}}{{Al{}{{b{c}}{d{e}}}}}{{An{}{{b{c}}{d{e}}}}}{{B`{}{{b{c}}{d{e}}}}}{{Bb{}{{b{c}}{d{e}}}}}{{Bd{}{{b{c}}{d{e}}}}}{{Bf{}{{b{c}}{d{e}}}}}}{{{Ad{}{{b{c}}{d{e}}{f{g}}{h{i}}{j{k}}{l{m}}{n{o}}{A`{Aa}}{Ab{Ac}}}}Eh}{{Af{ce}}}{}Ah{{Aj{}{{b{c}}{d{e}}}}}{{Al{}{{b{c}}{d{e}}}}}{{An{}{{b{c}}{d{e}}}}}{{B`{}{{b{c}}{d{e}}}}}{{Bb{}{{b{c}}{d{e}}}}}{{Bd{}{{b{c}}{d{e}}}}}{{Bf{}{{b{c}}{d{e}}}}}}{{{Ad{}{{b{c}}{d{e}}{f{g}}{h{i}}{j{k}}{l{m}}{n{o}}{A`{Aa}}{Ab{Ac}}}}En}{{Af{ce}}}{}Ah{{Aj{}{{b{c}}{d{e}}}}}{{Al{}{{b{c}}{d{e}}}}}{{An{}{{b{c}}{d{e}}}}}{{B`{}{{b{c}}{d{e}}}}}{{Bb{}{{b{c}}{d{e}}}}}{{Bd{}{{b{c}}{d{e}}}}}{{Bf{}{{b{c}}{d{e}}}}}}{{{Ad{}{{b{c}}{d{e}}{f{g}}{h{i}}{j{k}}{l{m}}{n{o}}{A`{Aa}}{Ab{Ac}}}}Dd}{{Af{ce}}}{}Ah{{Aj{}{{b{c}}{d{e}}}}}{{Al{}{{b{c}}{d{e}}}}}{{An{}{{b{c}}{d{e}}}}}{{B`{}{{b{c}}{d{e}}}}}{{Bb{}{{b{c}}{d{e}}}}}{{Bd{}{{b{c}}{d{e}}}}}{{Bf{}{{b{c}}{d{e}}}}}}=:{{{Ad{}{{b{c}}{d{e}}{f{g}}{h{i}}{j{k}}{l{m}}{n{o}}{A`{Aa}}{Ab{Ac}}}}ClEhCl}{{Af{ce}}}{}Ah{{Aj{}{{b{c}}{d{e}}}}}{{Al{}{{b{c}}{d{e}}}}}{{An{}{{b{c}}{d{e}}}}}{{B`{}{{b{c}}{d{e}}}}}{{Bb{}{{b{c}}{d{e}}}}}{{Bd{}{{b{c}}{d{e}}}}}{{Bf{}{{b{c}}{d{e}}}}}}{{{Bb{}{{b{c}}{d{e}}}}g}{{Af{Fde}}}{}Ah{C`Bh}}{{{Lj{ce}}g}{{Af{Fde}}}{}Ah{C`Bh}}{{{Bd{}{{b{c}}{d{e}}}}Cl}{{Af{Fde}}}{}Ah}{{{Bf{}{{b{c}}{d{e}}}}Cl}{{Af{Fde}}}{}Ah}{c{{Af{e}}}{}{}}0{cGn{}}","c":[],"p":[[17,"Ok"],[17,"Error"],[17,"SerializeSeq"],[17,"SerializeTuple"],[17,"SerializeTupleStruct"],[17,"SerializeTupleVariant"],[17,"SerializeMap"],[17,"SerializeStruct"],[17,"SerializeStructVariant"],[10,"Serializer",0],[6,"Result",1642],[10,"Error",1531],[10,"SerializeSeq",1531],[10,"SerializeTuple",1531],[10,"SerializeTupleStruct",1531],[10,"SerializeTupleVariant",1531],[10,"SerializeMap",1531],[10,"SerializeStruct",1531],[10,"SerializeStructVariant",1531],[10,"Serialize",0],[17,"Item"],[1,"tuple"],[10,"IntoIterator",1643],[10,"Sized",1644],[10,"Display",1645],[10,"Deserialize",0],[10,"Deserializer",0],[10,"Error",87],[10,"Visitor",87],[1,"str"],[1,"slice"],[1,"usize"],[1,"bool"],[1,"u8"],[1,"char"],[1,"f32"],[1,"f64"],[1,"i128"],[1,"i16"],[1,"i32"],[1,"i64"],[1,"i8"],[6,"Option",1646],[1,"u32"],[1,"u128"],[1,"u16"],[1,"u64"],[5,"IgnoredAny",87],[6,"Unexpected",87],[1,"unit"],[17,"Value"],[10,"DeserializeSeed",87],[5,"Formatter",1645],[8,"Result",1645],[10,"Expected",87],[5,"Error",1645],[17,"Deserializer"],[10,"IntoDeserializer",87],[10,"VariantAccess",87],[10,"SeqAccess",87],[10,"MapAccess",87],[5,"String",1647],[5,"TypeId",1648],[17,"Variant"],[10,"EnumAccess",87],[5,"Vec",1649],[5,"UnitDeserializer",265],[5,"U32Deserializer",265],[5,"StrDeserializer",265],[5,"BorrowedStrDeserializer",265],[5,"StringDeserializer",265],[5,"CowStrDeserializer",265],[5,"BytesDeserializer",265],[5,"BorrowedBytesDeserializer",265],[5,"MapDeserializer",265],[10,"Iterator",1650],[10,"Clone",1651],[5,"Error",265],[5,"BoolDeserializer",265],[5,"I8Deserializer",265],[5,"I16Deserializer",265],[5,"I32Deserializer",265],[5,"I64Deserializer",265],[5,"I128Deserializer",265],[5,"IsizeDeserializer",265],[5,"U8Deserializer",265],[5,"U16Deserializer",265],[5,"U64Deserializer",265],[5,"U128Deserializer",265],[5,"UsizeDeserializer",265],[5,"F32Deserializer",265],[5,"F64Deserializer",265],[5,"CharDeserializer",265],[5,"SeqDeserializer",265],[5,"SeqAccessDeserializer",265],[5,"MapAccessDeserializer",265],[5,"EnumAccessDeserializer",265],[10,"Debug",1645],[6,"Cow",1652],[1,"isize"],[5,"Impossible",1531]],"b":[[182,"impl-Debug-for-Unexpected%3C\'a%3E"],[183,"impl-Display-for-Unexpected%3C\'a%3E"],[410,"impl-Error-for-Error"],[411,"impl-Error-for-Error"],[1293,"impl-Display-for-Error"],[1294,"impl-Debug-for-Error"],[1405,"impl-MapAccess%3C\'de%3E-for-MapDeserializer%3C\'de,+I,+E%3E"],[1406,"impl-SeqAccess%3C\'de%3E-for-MapDeserializer%3C\'de,+I,+E%3E"],[1579,"impl-SerializeTupleStruct-for-Impossible%3COk,+Error%3E"],[1580,"impl-SerializeTupleVariant-for-Impossible%3COk,+Error%3E"],[1581,"impl-SerializeMap-for-Impossible%3COk,+Error%3E"],[1582,"impl-SerializeStructVariant-for-Impossible%3COk,+Error%3E"],[1583,"impl-SerializeSeq-for-Impossible%3COk,+Error%3E"],[1584,"impl-SerializeStruct-for-Impossible%3COk,+Error%3E"],[1585,"impl-SerializeTuple-for-Impossible%3COk,+Error%3E"],[1595,"impl-SerializeTuple-for-Impossible%3COk,+Error%3E"],[1596,"impl-SerializeSeq-for-Impossible%3COk,+Error%3E"],[1604,"impl-SerializeStruct-for-Impossible%3COk,+Error%3E"],[1605,"impl-SerializeTupleStruct-for-Impossible%3COk,+Error%3E"],[1606,"impl-SerializeTupleVariant-for-Impossible%3COk,+Error%3E"],[1607,"impl-SerializeStructVariant-for-Impossible%3COk,+Error%3E"]]}],\ ["serde_derive",{"doc":"This crate provides Serde’s two derive macros.","t":"YY","n":["Deserialize","Serialize"],"q":[[0,"serde_derive"]],"d":["",""],"i":[0,0],"f":"``","c":[],"p":[],"b":[]}],\ -["serde_json",{"doc":"Serde JSON","t":"PPFPFFPFPPPIFFPGNNNNNNNNNNNNNNNNNNNNCNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNCNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNHHHNHNNNNNNNNNNNNNNNNNNQCNCNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNHNNHHHHHHNNNNNNNNNNNNNNNNNNCFFKFFFNNNNNNNNNNNHNHNHNNNNNNNNNNNNNNNNNNNGPPPFPPIPNNNNNNNNNNNNNNNNNNNNGFFFFFPFPFFFNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNPPPGFPKPFPPFPPNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNHHHHHHNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNPPKEPFPPFPGNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNHNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNHNNNNNN","n":["Array","Bool","Deserializer","Err","Error","Map","Null","Number","Number","Object","Ok","Result","Serializer","StreamDeserializer","String","Value","borrow","borrow","borrow","borrow","borrow","borrow","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","clone","clone","clone_from","clone_into","clone_into","collect_str","custom","custom","de","default","default","deserialize","deserialize","deserialize_any","deserialize_any","deserialize_any","deserialize_bool","deserialize_bool","deserialize_bool","deserialize_byte_buf","deserialize_byte_buf","deserialize_byte_buf","deserialize_bytes","deserialize_bytes","deserialize_bytes","deserialize_char","deserialize_char","deserialize_char","deserialize_enum","deserialize_enum","deserialize_enum","deserialize_f32","deserialize_f32","deserialize_f32","deserialize_f64","deserialize_f64","deserialize_f64","deserialize_i128","deserialize_i128","deserialize_i128","deserialize_i16","deserialize_i16","deserialize_i16","deserialize_i32","deserialize_i32","deserialize_i32","deserialize_i64","deserialize_i64","deserialize_i64","deserialize_i8","deserialize_i8","deserialize_i8","deserialize_identifier","deserialize_identifier","deserialize_identifier","deserialize_ignored_any","deserialize_ignored_any","deserialize_ignored_any","deserialize_map","deserialize_map","deserialize_map","deserialize_newtype_struct","deserialize_newtype_struct","deserialize_newtype_struct","deserialize_option","deserialize_option","deserialize_option","deserialize_seq","deserialize_seq","deserialize_seq","deserialize_str","deserialize_str","deserialize_str","deserialize_string","deserialize_string","deserialize_string","deserialize_struct","deserialize_struct","deserialize_struct","deserialize_tuple","deserialize_tuple","deserialize_tuple","deserialize_tuple_struct","deserialize_tuple_struct","deserialize_tuple_struct","deserialize_u128","deserialize_u128","deserialize_u128","deserialize_u16","deserialize_u16","deserialize_u16","deserialize_u32","deserialize_u32","deserialize_u32","deserialize_u64","deserialize_u64","deserialize_u64","deserialize_u8","deserialize_u8","deserialize_u8","deserialize_unit","deserialize_unit","deserialize_unit","deserialize_unit_struct","deserialize_unit_struct","deserialize_unit_struct","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","error","extend","fmt","fmt","fmt","fmt","fmt","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from_iter","from_iter","from_iter","from_reader","from_slice","from_str","from_str","from_value","index","index","index_mut","index_mut","into","into","into","into","into","into","into_deserializer","into_deserializer","into_iter","into_iter","into_iter","into_iter","invalid_type","invalid_value","json","map","next","ser","serialize","serialize","serialize_bool","serialize_bytes","serialize_char","serialize_f32","serialize_f64","serialize_i128","serialize_i16","serialize_i32","serialize_i64","serialize_i8","serialize_map","serialize_newtype_struct","serialize_newtype_variant","serialize_none","serialize_seq","serialize_some","serialize_str","serialize_struct","serialize_struct_variant","serialize_tuple","serialize_tuple_struct","serialize_tuple_variant","serialize_u128","serialize_u16","serialize_u32","serialize_u64","serialize_u8","serialize_unit","serialize_unit_struct","serialize_unit_variant","source","to_owned","to_owned","to_string","to_string","to_string","to_string_pretty","to_value","to_vec","to_vec_pretty","to_writer","to_writer_pretty","try_from","try_from","try_from","try_from","try_from","try_from","try_into","try_into","try_into","try_into","try_into","try_into","type_id","type_id","type_id","type_id","type_id","type_id","value","Deserializer","IoRead","Read","SliceRead","StrRead","StreamDeserializer","borrow","borrow","borrow","borrow_mut","borrow_mut","borrow_mut","byte_offset","end","from","from","from","from_reader","from_reader","from_slice","from_slice","from_str","from_str","into","into","into","into_iter","new","new","new","new","new","try_from","try_from","try_from","try_into","try_into","try_into","type_id","type_id","type_id","Category","Data","Eof","Err","Error","Io","Ok","Result","Syntax","borrow","borrow_mut","classify","clone","clone_into","column","eq","fmt","from","into","io_error_kind","is_data","is_eof","is_io","is_syntax","line","to_owned","try_from","try_into","type_id","Entry","IntoIter","Iter","IterMut","Keys","Map","Occupied","OccupiedEntry","Vacant","VacantEntry","Values","ValuesMut","and_modify","append","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","clear","contains_key","entry","from","from","from","from","from","from","from","from","from","get","get","get_key_value","get_mut","get_mut","insert","insert","insert","into","into","into","into","into","into","into","into","into","into_iter","into_iter","into_iter","into_iter","into_iter","into_iter","into_mut","is_empty","iter","iter_mut","key","key","key","keys","len","len","len","len","len","len","len","new","next","next","next","next","next","next","next_back","next_back","next_back","next_back","next_back","next_back","or_insert","or_insert_with","remove","remove","remove_entry","retain","size_hint","size_hint","size_hint","size_hint","size_hint","size_hint","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","values","values_mut","with_capacity","AsciiControl","Backspace","CarriageReturn","CharEscape","CompactFormatter","FormFeed","Formatter","LineFeed","PrettyFormatter","Quote","ReverseSolidus","Serializer","Solidus","Tab","begin_array","begin_array","begin_array_value","begin_array_value","begin_object","begin_object","begin_object_key","begin_object_key","begin_object_value","begin_object_value","begin_string","borrow","borrow","borrow","borrow_mut","borrow_mut","borrow_mut","clone","clone","clone_into","clone_into","default","end_array","end_array","end_array_value","end_array_value","end_object","end_object","end_object_key","end_object_value","end_object_value","end_string","fmt","fmt","from","from","from","into","into","into","into_inner","new","new","pretty","to_owned","to_owned","to_string","to_string_pretty","to_vec","to_vec_pretty","to_writer","to_writer_pretty","try_from","try_from","try_from","try_into","try_into","try_into","type_id","type_id","type_id","with_formatter","with_indent","write_bool","write_byte_array","write_char_escape","write_f32","write_f64","write_i128","write_i16","write_i32","write_i64","write_i8","write_null","write_number_str","write_raw_fragment","write_string_fragment","write_u128","write_u16","write_u32","write_u64","write_u8","Array","Bool","Index","Map","Null","Number","Number","Object","Serializer","String","Value","as_array","as_array_mut","as_bool","as_f64","as_f64","as_i64","as_i64","as_null","as_number","as_object","as_object_mut","as_str","as_u64","as_u64","borrow","borrow","borrow_mut","borrow_mut","clone","clone_into","collect_str","deserialize","deserialize_any","deserialize_any","deserialize_bool","deserialize_bool","deserialize_byte_buf","deserialize_byte_buf","deserialize_bytes","deserialize_bytes","deserialize_char","deserialize_char","deserialize_enum","deserialize_enum","deserialize_f32","deserialize_f32","deserialize_f64","deserialize_f64","deserialize_i128","deserialize_i128","deserialize_i16","deserialize_i16","deserialize_i32","deserialize_i32","deserialize_i64","deserialize_i64","deserialize_i8","deserialize_i8","deserialize_identifier","deserialize_identifier","deserialize_ignored_any","deserialize_ignored_any","deserialize_map","deserialize_map","deserialize_newtype_struct","deserialize_newtype_struct","deserialize_option","deserialize_option","deserialize_seq","deserialize_seq","deserialize_str","deserialize_str","deserialize_string","deserialize_string","deserialize_struct","deserialize_struct","deserialize_tuple","deserialize_tuple","deserialize_tuple_struct","deserialize_tuple_struct","deserialize_u128","deserialize_u128","deserialize_u16","deserialize_u16","deserialize_u32","deserialize_u32","deserialize_u64","deserialize_u64","deserialize_u8","deserialize_u8","deserialize_unit","deserialize_unit","deserialize_unit_struct","deserialize_unit_struct","eq","fmt","fmt","from","from","from","from","from","from","from","from","from","from","from","from","from_f64","from_str","from_value","get","get_mut","hash","into","into","is_array","is_boolean","is_f64","is_f64","is_i64","is_i64","is_null","is_number","is_object","is_string","is_u64","is_u64","pointer","pointer_mut","serialize","serialize_bool","serialize_bytes","serialize_char","serialize_f32","serialize_f64","serialize_i128","serialize_i16","serialize_i32","serialize_i64","serialize_i8","serialize_map","serialize_newtype_struct","serialize_newtype_variant","serialize_none","serialize_seq","serialize_some","serialize_str","serialize_struct","serialize_struct_variant","serialize_tuple","serialize_tuple_struct","serialize_tuple_variant","serialize_u128","serialize_u16","serialize_u32","serialize_u64","serialize_u8","serialize_unit","serialize_unit_struct","serialize_unit_variant","take","to_owned","to_string","to_value","try_from","try_from","try_into","try_into","type_id","type_id"],"q":[[0,"serde_json"],[306,"serde_json::de"],[347,"serde_json::error"],[376,"serde_json::map"],[513,"serde_json::ser"],[609,"serde_json::value"],[782,"alloc::string"],[783,"std::io"],[784,"core::marker"],[785,"core::fmt"],[786,"core::result"],[787,"serde::de"],[788,"serde::de"],[789,"core::fmt"],[790,"core::clone"],[791,"core::convert"],[792,"core::option"],[793,"alloc::vec"],[794,"std::io"],[795,"core::cmp"],[796,"serde::de"],[797,"serde::ser"],[798,"core::any"],[799,"std::io::error"],[800,"core::ops::function"],[801,"core::ops::function"]],"d":["Represents a JSON array.","Represents a JSON boolean.","A structure that deserializes JSON into Rust values.","Contains the error value","This type represents all possible errors that can occur …","Represents a JSON key/value type.","Represents a JSON null value.","Represents a JSON number, whether integer or floating …","Represents a JSON number, whether integer or floating …","Represents a JSON object.","Contains the success value","Alias for a Result with the error type serde_json::Error.","A structure for serializing Rust values into JSON.","Iterator that deserializes a stream into multiple JSON …","Represents a JSON string.","Represents any valid JSON value.","","","","","","","","","","","","","","","","","","","","","Deserialize JSON data to a Rust data structure.","","","","","","","","","","","","","","Parses a JSON string as bytes. Note that this function …","","","","","","Parses an enum as an object like {"$KEY":$VALUE}, where …","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","Parses a newtype struct as the underlying value.","","","Parses a null as a None, and any other values as a …","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","When serializing or deserializing JSON goes wrong.","","","","","Display a JSON value as a string.","","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Convert () to Value::Null.","","Convert map (with string keys) to Value::Object.","","","Convert string slice to Value::String.","","","Convert copy-on-write string to Value::String.","Convert Number to Value::Number.","Returns the argument unchanged.","","Convert 32-bit floating point number to Value::Number, or …","Convert String to Value::String.","","","Convert a slice to Value::Array.","Convert 64-bit floating point number to Value::Number, or …","","","Convert a Vec to Value::Array.","Convert boolean to Value::Bool.","","","Create a Value::Array by collecting an iterator of array …","Create a Value::Object by collecting an iterator of …","Deserialize an instance of type T from an I/O stream of …","Deserialize an instance of type T from bytes of JSON text.","Deserialize an instance of type T from a string of JSON …","","Interpret a serde_json::Value as an instance of type T.","","Index into a serde_json::Value using the syntax value[0] or","","Write into a serde_json::Value using the syntax …","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","","","","","","","","","Construct a serde_json::Value from a JSON literal.","A map of String to serde_json::Value.","","Serialize a Rust data structure into JSON data.","","","","","","","","","","","","","","Serialize newtypes without an object wrapper.","","","","","","","","","","","","","","","","","","","","","","Serialize the given data structure as a String of JSON.","","","Serialize the given data structure as a pretty-printed …","Convert a T into serde_json::Value which is an enum that …","Serialize the given data structure as a JSON byte vector.","Serialize the given data structure as a pretty-printed …","Serialize the given data structure as JSON into the I/O …","Serialize the given data structure as pretty-printed JSON …","","","","","","","","","","","","","","","","","","","The Value enum, a loosely typed way of representing any …","A structure that deserializes JSON into Rust values.","JSON input source that reads from a std::io input stream.","Trait used by the deserializer for iterating over input. …","JSON input source that reads from a slice of bytes.","JSON input source that reads from a UTF-8 string.","Iterator that deserializes a stream into multiple JSON …","","","","","","","Returns the number of bytes so far deserialized into a …","The Deserializer::end method should be called after a …","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Deserialize an instance of type T from an I/O stream of …","Creates a JSON deserializer from an io::Read.","Deserialize an instance of type T from bytes of JSON text.","Creates a JSON deserializer from a &[u8].","Deserialize an instance of type T from a string of JSON …","Creates a JSON deserializer from a &str.","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Turn a JSON deserializer into an iterator over values of …","Create a JSON deserializer from one of the possible …","Create a JSON stream deserializer from one of the possible …","Create a JSON input source to read from a std::io input …","Create a JSON input source to read from a slice of bytes.","Create a JSON input source to read from a UTF-8 string.","","","","","","","","","","Categorizes the cause of a serde_json::Error.","The error was caused by input data that was semantically …","The error was caused by prematurely reaching the end of …","Contains the error value","This type represents all possible errors that can occur …","The error was caused by a failure to read or write bytes …","Contains the success value","Alias for a Result with the error type serde_json::Error.","The error was caused by input that was not syntactically …","","","Categorizes the cause of this error.","","","One-based column number at which the error was detected.","","","Returns the argument unchanged.","Calls U::from(self).","The kind reported by the underlying standard library I/O …","Returns true if this error was caused by input data that …","Returns true if this error was caused by prematurely …","Returns true if this error was caused by a failure to read …","Returns true if this error was caused by input that was not","One-based line number at which the error was detected.","","","","","A view into a single entry in a map, which may either be …","An owning iterator over a serde_json::Map’s entries.","An iterator over a serde_json::Map’s entries.","A mutable iterator over a serde_json::Map’s entries.","An iterator over a serde_json::Map’s keys.","Represents a JSON key/value type.","An occupied Entry.","An occupied Entry. It is part of the Entry enum.","A vacant Entry.","A vacant Entry. It is part of the Entry enum.","An iterator over a serde_json::Map’s values.","A mutable iterator over a serde_json::Map’s values.","Provides in-place mutable access to an occupied entry …","Moves all elements from other into self, leaving other …","","","","","","","","","","","","","","","","","","","Clears the map, removing all values.","Returns true if the map contains a value for the specified …","Gets the given key’s corresponding entry in the map for …","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns a reference to the value corresponding to the key.","Gets a reference to the value in the entry.","Returns the key-value pair matching the given key.","Returns a mutable reference to the value corresponding to …","Gets a mutable reference to the value in the entry.","Inserts a key-value pair into the map.","Sets the value of the entry with the VacantEntry’s key, …","Sets the value of the entry with the OccupiedEntry’s …","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","","","","","","","Converts the entry into a mutable reference to its value.","Returns true if the map contains no elements.","Gets an iterator over the entries of the map.","Gets a mutable iterator over the entries of the map.","Returns a reference to this entry’s key.","Gets a reference to the key that would be used when …","Gets a reference to the key in the entry.","Gets an iterator over the keys of the map.","Returns the number of elements in the map.","","","","","","","Makes a new empty Map.","","","","","","","","","","","","","Ensures a value is in the entry by inserting the default …","Ensures a value is in the entry by inserting the result of …","Removes a key from the map, returning the value at the key …","Takes the value of the entry out of the map, and returns …","Removes a key from the map, returning the stored key and …","Retains only the elements specified by the predicate.","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","Gets an iterator over the values of the map.","Gets an iterator over mutable values of the map.","Makes a new empty Map with the given initial capacity.","An escaped ASCII plane control character (usually escaped …","An escaped backspace character (usually escaped as \\\\b)","An escaped carriage return character (usually escaped as \\\\r…","Represents a character escape code in a type-safe manner.","This structure compacts a JSON value with no extra …","An escaped form feed character (usually escaped as \\\\f)","This trait abstracts away serializing the JSON control …","An escaped line feed character (usually escaped as \\\\n)","This structure pretty prints a JSON value to make it human …","An escaped quote "","An escaped reverse solidus \\\\","A structure for serializing Rust values into JSON.","An escaped solidus /","An escaped tab character (usually escaped as \\\\t)","Called before every array. Writes a [ to the specified …","","Called before every array value. Writes a , if needed to …","","Called before every object. Writes a { to the specified …","","Called before every object key.","","Called before every object value. A : should be written to","","Called before each series of write_string_fragment and …","","","","","","","","","","","","Called after every array. Writes a ] to the specified …","","Called after every array value.","","Called after every object. Writes a } to the specified …","","Called after every object key. A : should be written to …","Called after every object value.","","Called after each series of write_string_fragment and …","","","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Unwrap the Writer from the Serializer.","Creates a new JSON serializer.","Construct a pretty printer formatter that defaults to …","Creates a new JSON pretty print serializer.","","","Serialize the given data structure as a String of JSON.","Serialize the given data structure as a pretty-printed …","Serialize the given data structure as a JSON byte vector.","Serialize the given data structure as a pretty-printed …","Serialize the given data structure as JSON into the I/O …","Serialize the given data structure as pretty-printed JSON …","","","","","","","","","","Creates a new JSON visitor whose output will be written to …","Construct a pretty printer formatter that uses the indent …","Writes a true or false value to the specified writer.","Writes the representation of a byte array. Formatters can …","Writes a character escape code to the specified writer.","Writes a floating point value like -31.26e+12 to the …","Writes a floating point value like -31.26e+12 to the …","Writes an integer value like -123 to the specified writer.","Writes an integer value like -123 to the specified writer.","Writes an integer value like -123 to the specified writer.","Writes an integer value like -123 to the specified writer.","Writes an integer value like -123 to the specified writer.","Writes a null value to the specified writer.","Writes a number that has already been rendered to a string.","Writes a raw JSON fragment that doesn’t need any …","Writes a string fragment that doesn’t need any escaping …","Writes an integer value like 123 to the specified writer.","Writes an integer value like 123 to the specified writer.","Writes an integer value like 123 to the specified writer.","Writes an integer value like 123 to the specified writer.","Writes an integer value like 123 to the specified writer.","Represents a JSON array.","Represents a JSON boolean.","A type that can be used to index into a serde_json::Value.","","Represents a JSON null value.","Represents a JSON number, whether integer or floating …","Represents a JSON number, whether integer or floating …","Represents a JSON object.","Serializer whose output is a Value.","Represents a JSON string.","Represents any valid JSON value.","If the Value is an Array, returns the associated vector. …","If the Value is an Array, returns the associated mutable …","If the Value is a Boolean, returns the associated bool. …","If the Value is a number, represent it as f64 if possible. …","Represents the number as f64 if possible. Returns None …","If the Value is an integer, represent it as i64 if …","If the Number is an integer, represent it as i64 if …","If the Value is a Null, returns (). Returns None otherwise.","If the Value is a Number, returns the associated Number. …","If the Value is an Object, returns the associated Map. …","If the Value is an Object, returns the associated mutable …","If the Value is a String, returns the associated str. …","If the Value is an integer, represent it as u64 if …","If the Number is an integer, represent it as u64 if …","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","Returns the argument unchanged.","","","","","","Returns the argument unchanged.","","","","","","Converts a finite f64 to a Number. Infinite or NaN values …","","Interpret a serde_json::Value as an instance of type T.","Index into a JSON array or map. A string index can be used …","Mutably index into a JSON array or map. A string index can …","","Calls U::from(self).","Calls U::from(self).","Returns true if the Value is an Array. Returns false …","Returns true if the Value is a Boolean. Returns false …","Returns true if the Value is a number that can be …","Returns true if the Number can be represented by f64.","Returns true if the Value is an integer between i64::MIN …","Returns true if the Number is an integer between i64::MIN …","Returns true if the Value is a Null. Returns false …","Returns true if the Value is a Number. Returns false …","Returns true if the Value is an Object. Returns false …","Returns true if the Value is a String. Returns false …","Returns true if the Value is an integer between zero and …","Returns true if the Number is an integer between zero and …","Looks up a value by a JSON Pointer.","Looks up a value by a JSON Pointer and returns a mutable …","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","Takes the value out of the Value, leaving a Null in its …","","","Convert a T into serde_json::Value which is an enum that …","","","","","",""],"i":[2,2,0,6,0,0,2,0,2,2,6,0,0,0,2,0,14,53,11,3,5,2,14,53,11,3,5,2,3,2,3,3,2,5,11,11,0,3,2,3,2,14,2,2,14,2,2,14,2,2,14,2,2,14,2,2,14,2,2,14,2,2,14,2,2,14,2,2,14,2,2,14,2,2,14,2,2,14,2,2,14,2,2,14,2,2,14,2,2,14,2,2,14,2,2,14,2,2,14,2,2,14,2,2,14,2,2,14,2,2,14,2,2,14,2,2,14,2,2,14,2,2,14,2,2,14,2,2,14,2,2,14,2,2,3,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,0,3,11,11,3,2,2,14,53,11,3,5,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,3,2,2,0,0,0,2,0,3,2,3,2,14,53,11,3,5,2,2,2,53,3,3,3,11,11,0,0,53,0,3,2,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,11,3,2,0,11,2,0,0,0,0,0,0,14,53,11,3,5,2,14,53,11,3,5,2,14,53,11,3,5,2,0,0,0,0,0,0,0,61,62,63,61,62,63,53,14,61,62,63,0,14,0,14,0,14,61,62,63,14,14,53,61,62,63,61,62,63,61,62,63,61,62,63,0,64,64,6,0,64,6,0,64,64,64,11,64,64,11,64,64,64,64,11,11,11,11,11,11,64,64,64,64,0,0,0,0,0,0,66,0,66,0,0,0,66,3,66,69,68,70,71,73,72,74,75,66,69,68,70,71,73,72,74,75,3,3,3,66,69,68,70,71,73,72,74,75,3,68,3,3,68,3,69,68,66,69,68,70,71,73,72,74,75,70,71,73,72,74,75,68,3,3,3,66,69,68,3,3,70,71,73,72,74,75,3,70,71,73,72,74,75,70,71,73,72,74,75,66,66,3,68,3,3,70,71,73,72,74,75,66,69,68,70,71,73,72,74,75,66,69,68,70,71,73,72,74,75,66,69,68,70,71,73,72,74,75,3,3,3,81,81,81,0,0,81,0,81,0,81,81,0,81,81,8,79,8,79,8,79,8,79,8,79,8,81,80,79,81,80,79,80,79,80,79,79,8,79,8,79,8,79,8,8,79,8,80,79,81,80,79,81,80,79,5,5,79,5,80,79,0,0,0,0,0,0,81,80,79,81,80,79,81,80,79,5,79,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,2,2,0,0,2,0,2,2,0,2,0,2,2,2,2,39,2,39,2,2,2,2,2,2,39,82,39,82,39,39,39,82,39,39,39,39,39,39,39,39,39,39,39,39,39,39,39,39,39,39,39,39,39,39,39,39,39,39,39,39,39,39,39,39,39,39,39,39,39,39,39,39,39,39,39,39,39,39,39,39,39,39,39,39,39,39,39,39,39,39,39,39,39,39,39,39,39,39,82,39,39,39,39,39,39,39,39,39,39,39,39,39,0,2,2,39,82,39,2,2,2,39,2,39,2,2,2,2,2,39,2,2,39,82,82,82,82,82,82,82,82,82,82,82,82,82,82,82,82,82,82,82,82,82,82,82,82,82,82,82,82,82,82,2,39,39,0,82,39,82,39,82,39],"f":"````````````````{ce{}{}}00000000000{{{f{bd}}}{{f{bd}}}}{dd}{{{f{bd}}{f{bd}}}h}{{ce}h{}{}}0{{{j{ce}}g}{{l{h}}}nA`{AbAd}}{cAfAd}0`{{}{{f{bd}}}}{{}d}{c{{Ah{{f{bd}}}}}Aj}{c{{Ah{d}}}Aj}{{{Al{c}}e}lAnB`}{{dc}{{Ah{Af}}}B`}0100100100100{{{Al{c}}Bb{Bd{Bb}}e}lAnB`}{{dBb{Bd{Bb}}c}{{Ah{Af}}}B`}0322322322322322322322322322322{{{Al{c}}Bbe}lAnB`}{{dBbc}{{Ah{Af}}}B`}0544544544544322{{{Al{c}}Bfe}lAnB`}{{dBfc}{{Ah{Af}}}B`}0{{{Al{c}}BbBfe}lAnB`}{{dBbBfc}{{Ah{Af}}}B`}0988988988988988988544{{{f{bd}}{f{bd}}}Bh}{{dBj}Bh}{{dBf}Bh}{{dBl}Bh}{{dBn}Bh}{{dBh}Bh}{{dC`}Bh}{{dCb}Bh}{{dCd}Bh}{{db}Bh}{{dCf}Bh}{{dCh}Bh}3{{dCj}Bh}:72{{dd}Bh}{{dCl}Bh}2{{dCn}Bh}1{{dBb}Bh}=4;?25519=8:<96?:01><`{{{f{bd}}c}h{{Dd{}{{D`{{Db{bd}}}}}}}}{{AfDf}Dh}0{{{f{bd}}Df}{{Ah{hDj}}}}{{dDf}Dh}0{cc{}}0000{hd}{Cld}{{{f{bd}}}d}{Cnd}{Chd}{Bbd}{Bld}{Cbd}{{{Dl{Bb}}}d}{Dnd}:{Bnd}{C`d}{bd}{Bfd}{Cjd}{{{Bd{c}}}d{E`{Eb{d}}}}{Bjd}{Cdd}{{{Ed{c}}}d{{Eb{d}}}}{{{Ef{c}}}d{{Eb{d}}}}{Bhd}{Cfd}{c{{f{bd}}}{{Dd{}{{D`{{Db{bd}}}}}}}}{ed{{Eb{d}}}{{Dd{}{{D`{c}}}}}}{gd{{Eb{b}}}{{Eb{d}}}{{Dd{}{{D`{{Db{ce}}}}}}}}{c{{l{e}}}EhEj}{{{Bd{Cf}}}{{l{c}}}El}{Bb{{l{c}}}El}{Bb{{Ah{dAf}}}}{d{{Ah{cAf}}}Ej}{{{f{bd}}c}d{AbEnF`Fb}}{{dc}dFd}10{ce{}{}}00000{dc{}}01{{{f{bd}}}c{}}00{{FfFh}Af}0``{{{Fj{ce}}}{{Ed{{l{e}}}}}AnEl}`{{{f{bd}}c}AhFl}{{dc}AhFl}{{{j{ce}}Bh}{{l{h}}}nA`}{{{j{ce}}{Bd{Cf}}}{{l{h}}}nA`}{{{j{ce}}Fn}{{l{h}}}nA`}{{{j{ce}}C`}{{l{h}}}nA`}{{{j{ce}}Bj}{{l{h}}}nA`}{{{j{ce}}G`}{{l{h}}}nA`}{{{j{ce}}Ch}{{l{h}}}nA`}{{{j{ce}}Cj}{{l{h}}}nA`}{{{j{ce}}Cb}{{l{h}}}nA`}{{{j{ce}}Cl}{{l{h}}}nA`}{{{j{ce}}{Ed{Bf}}}{{l{g}}}nA`{}}{{{j{ce}}Bbg}{{l{h}}}nA`{AbGb}}{{{j{ce}}BbCnBbg}{{l{h}}}nA`{AbGb}}{{{j{ce}}}{{l{h}}}nA`}3{{{j{ce}}g}{{l{h}}}nA`{AbGb}}{{{j{ce}}Bb}{{l{h}}}nA`}{{{j{ce}}BbBf}{{l{g}}}nA`{}}{{{j{ce}}BbCnBbBf}{{l{g}}}nA`{}}{{{j{ce}}Bf}{{l{g}}}nA`{}}21{{{j{ce}}Gd}{{l{h}}}nA`}{{{j{ce}}Bl}{{l{h}}}nA`}{{{j{ce}}Cn}{{l{h}}}nA`}{{{j{ce}}Cd}{{l{h}}}nA`}{{{j{ce}}Cf}{{l{h}}}nA`}:8{{{j{ce}}BbCnBb}{{l{h}}}nA`}{Af{{Ed{Gf}}}}{ce{}{}}0{c{{l{b}}}{AbGb}}{cb{}}01{c{{Ah{dAf}}}Gb}{c{{l{{Ef{Cf}}}}}{AbGb}}0{{ce}{{l{h}}}n{AbGb}}0{c{{Ah{e}}}{}{}}00000000000{cGh{}}00000```````777777{{{Fj{ce}}}BfAnEl}{{{Al{c}}}{{l{h}}}An}{cc{}}00{c{{l{e}}}EhEj}{c{{Al{{Gj{c}}}}}Eh}{{{Bd{Cf}}}{{l{c}}}El}{{{Bd{Cf}}}{{Al{Gl}}}}{Bb{{l{c}}}El}{Bb{{Al{Gn}}}}{ce{}{}}00{{{Al{c}}}{{Fj{ce}}}AnEl}{c{{Al{c}}}An}{c{{Fj{ce}}}AnEl}{c{{Gj{c}}}Eh}{{{Bd{Cf}}}Gl}{BbGn}{c{{Ah{e}}}{}{}}00000{cGh{}}00`````````88{AfH`}{H`H`}{{ce}h{}{}}{AfBf}{{H`H`}Bh}{{H`Df}Dh}{cc{}}?{Af{{Ed{Hb}}}}{AfBh}0005{ce{}{}};;:````````````{{Hdc}Hd{{Hf{d}}}}{{{f{bd}}{f{bd}}}h}222222222222222222{{{f{bd}}}h}{{{f{bd}}c}Bh{AbEnF`Fb}}{{{f{bd}}c}Hd{{Eb{b}}}}888888888{{{f{bd}}c}{{Ed{d}}}{AbEnF`Fb}}{Hhd}{{{f{bd}}c}{{Ed{{Db{bd}}}}}{AbEnF`Fb}}21{{{f{bd}}bd}{{Ed{d}}}}{{Hjd}d}{{Hhd}d};;;;;;;;;;;;;;;4{{{f{bd}}}Bh}{{{f{bd}}}Hl}{{{f{bd}}}Hn}{Hdb}{Hjb}{Hhb}{{{f{bd}}}I`}{{{f{bd}}}Bf}{HlBf}{HnBf}{IbBf}{I`Bf}{IdBf}{IfBf}{{}{{f{bd}}}}{Hl{{Ed{c}}}{}}{Hn{{Ed{c}}}{}}{Ib{{Ed{c}}}{}}{I`{{Ed{c}}}{}}{Id{{Ed{c}}}{}}{If{{Ed{c}}}{}}543210{{Hdd}d}{{Hdc}d{{Hf{}{{Ih{d}}}}}}{{{f{bd}}c}{{Ed{d}}}{AbEnF`Fb}}{Hhd}{{{f{bd}}c}{{Ed{{Db{bd}}}}}{AbEnF`Fb}}{{{f{bd}}c}h{{Ij{bd}{{Ih{Bh}}}}}}{Hl{{Db{Bf{Ed{Bf}}}}}}{Hn{{Db{Bf{Ed{Bf}}}}}}{Ib{{Db{Bf{Ed{Bf}}}}}}{I`{{Db{Bf{Ed{Bf}}}}}}{Id{{Db{Bf{Ed{Bf}}}}}}{If{{Db{Bf{Ed{Bf}}}}}}{c{{Ah{e}}}{}{}}00000000000000000{cGh{}}00000000{{{f{bd}}}Id}{{{f{bd}}}If}{Bf{{f{bd}}}}``````````````{{A`c}{{Il{h}}}{Abn}}{{Inc}{{Il{h}}}{Abn}}{{A`cBh}{{Il{h}}}{Abn}}{{IncBh}{{Il{h}}}{Abn}}3210323{ce{}{}}00000{J`J`}{InIn}{{ce}h{}{}}0{{}In}8787878878{{J`Df}Dh}{{InDf}Dh}{cc{}}00777{{{j{ce}}}cnA`}{c{{j{c}}}n}5{c{{j{cIn}}}n}::{c{{l{b}}}{AbGb}}0{c{{l{{Ef{Cf}}}}}{AbGb}}0{{ce}{{l{h}}}n{AbGb}}0{c{{Ah{e}}}{}{}}00000{cGh{}}00{{ce}{{j{ce}}}nA`}{{{Bd{Cf}}}In}{{A`cBh}{{Il{h}}}{Abn}}{{A`c{Bd{Cf}}}{{Il{h}}}{Abn}}{{A`cJb}{{Il{h}}}{Abn}}{{A`cC`}{{Il{h}}}{Abn}}{{A`cBj}{{Il{h}}}{Abn}}{{A`cG`}{{Il{h}}}{Abn}}{{A`cCh}{{Il{h}}}{Abn}}{{A`cCj}{{Il{h}}}{Abn}}{{A`cCb}{{Il{h}}}{Abn}}{{A`cCl}{{Il{h}}}{Abn}}{{A`c}{{Il{h}}}{Abn}}{{A`cBb}{{Il{h}}}{Abn}}00{{A`cGd}{{Il{h}}}{Abn}}{{A`cBl}{{Il{h}}}{Abn}}{{A`cCn}{{Il{h}}}{Abn}}{{A`cCd}{{Il{h}}}{Abn}}{{A`cCf}{{Il{h}}}{Abn}}```````````{d{{Ed{{Ef{d}}}}}}0{d{{Ed{Bh}}}}{d{{Ed{Bj}}}}{Dn{{Ed{Bj}}}}{d{{Ed{Cb}}}}{Dn{{Ed{Cb}}}}{d{{Ed{h}}}}{d{{Ed{Dn}}}}{d{{Ed{{f{bd}}}}}}0{d{{Ed{Bb}}}}{d{{Ed{Cd}}}}{Dn{{Ed{Cd}}}}{ce{}{}}000{DnDn}{{ce}h{}{}}{{Jdc}{{l{d}}}{AbAd}}{c{{Ah{Dn}}}Aj}{{Dnc}{{Ah{Af}}}B`}0{{Dnc}{{Ah{e}}}B`{}}0000000{{DnBb{Bd{Bb}}c}{{Ah{e}}}B`{}}022222222222222111111{{DnBbc}{{Ah{e}}}B`{}}02222222211{{DnBfc}{{Ah{e}}}B`{}}0{{DnBbBfc}{{Ah{e}}}B`{}}055555555554422{{DnDn}Bh}{{DnDf}Dh}0{cc{}}{BlDn}{CjDn}{ClDn}{CnDn}{BfDn}5{CdDn}{BnDn}{CbDn}{CfDn}{ChDn}{Bj{{Ed{Dn}}}}{Bb{{Ah{Dnc}}}{}}{d{{Ah{cAf}}}Ej}{{dc}{{Ed{d}}}Fd}0{{Dnc}hJf}{ce{}{}}0{dBh}00{DnBh}10111110{{dBb}{{Ed{d}}}}0{{Dnc}AhFl}{{JdBh}{{l{d}}}}{{Jd{Bd{Cf}}}{{l{d}}}}{{JdFn}{{l{d}}}}{{JdC`}{{l{d}}}}{{JdBj}{{l{d}}}}{{JdG`}{{l{d}}}}{{JdCh}{{l{d}}}}{{JdCj}{{l{d}}}}{{JdCb}{{l{d}}}}{{JdCl}{{l{d}}}}{{Jd{Ed{Bf}}}{{l{c}}}{}}{{JdBbc}{{l{d}}}{AbGb}}{{JdBbCnBbc}{{l{d}}}{AbGb}}{Jd{{l{d}}}}3{{Jdc}{{l{d}}}{AbGb}}{{JdBb}{{l{d}}}}{{JdBbBf}{{l{c}}}{}}{{JdBbCnBbBf}{{l{c}}}{}}{{JdBf}{{l{c}}}{}}21{{JdGd}{{l{d}}}}{{JdBl}{{l{d}}}}{{JdCn}{{l{d}}}}{{JdCd}{{l{d}}}}{{JdCf}{{l{d}}}}:8{{JdBbCnBb}{{l{d}}}}{dd}{ce{}{}}{cb{}}{c{{Ah{dAf}}}Gb}{c{{Ah{e}}}{}{}}000{cGh{}}0","c":[],"p":[[5,"String",782],[6,"Value",0],[5,"Map",0],[1,"unit"],[5,"Serializer",0],[8,"Result",0],[10,"Write",783],[10,"Formatter",513],[10,"Sized",784],[10,"Display",785],[5,"Error",0],[6,"Result",786],[10,"Deserializer",787],[5,"Deserializer",0],[10,"Read",306],[10,"Visitor",787],[1,"str"],[1,"slice"],[1,"usize"],[1,"bool"],[1,"f64"],[1,"u16"],[1,"isize"],[1,"f32"],[1,"i64"],[1,"u64"],[1,"u8"],[1,"i16"],[1,"i32"],[1,"i8"],[1,"u32"],[17,"Item"],[1,"tuple"],[10,"IntoIterator",788],[5,"Formatter",785],[8,"Result",785],[5,"Error",785],[6,"Cow",789],[5,"Number",609],[10,"Clone",790],[10,"Into",791],[6,"Option",792],[5,"Vec",793],[10,"Read",783],[10,"DeserializeOwned",787],[10,"Deserialize",787],[10,"Ord",794],[10,"Eq",794],[10,"Hash",795],[10,"Index",609],[6,"Unexpected",787],[10,"Expected",787],[5,"StreamDeserializer",0],[10,"Serializer",796],[1,"char"],[1,"i128"],[10,"Serialize",796],[1,"u128"],[10,"Error",797],[5,"TypeId",798],[5,"IoRead",306],[5,"SliceRead",306],[5,"StrRead",306],[6,"Category",347],[6,"ErrorKind",799],[6,"Entry",376],[10,"FnOnce",800],[5,"OccupiedEntry",376],[5,"VacantEntry",376],[5,"Iter",376],[5,"IterMut",376],[5,"Keys",376],[5,"IntoIter",376],[5,"Values",376],[5,"ValuesMut",376],[17,"Output"],[10,"FnMut",800],[8,"Result",799],[5,"PrettyFormatter",513],[5,"CompactFormatter",513],[6,"CharEscape",513],[5,"Serializer",609],[10,"Hasher",795]],"b":[[34,"impl-Error-for-Error"],[35,"impl-Error-for-Error"],[42,"impl-Deserializer%3C\'de%3E-for-%26Value"],[43,"impl-Deserializer%3C\'de%3E-for-Value"],[45,"impl-Deserializer%3C\'de%3E-for-Value"],[46,"impl-Deserializer%3C\'de%3E-for-%26Value"],[48,"impl-Deserializer%3C\'de%3E-for-Value"],[49,"impl-Deserializer%3C\'de%3E-for-%26Value"],[51,"impl-Deserializer%3C\'de%3E-for-Value"],[52,"impl-Deserializer%3C\'de%3E-for-%26Value"],[54,"impl-Deserializer%3C\'de%3E-for-%26Value"],[55,"impl-Deserializer%3C\'de%3E-for-Value"],[57,"impl-Deserializer%3C\'de%3E-for-%26Value"],[58,"impl-Deserializer%3C\'de%3E-for-Value"],[60,"impl-Deserializer%3C\'de%3E-for-Value"],[61,"impl-Deserializer%3C\'de%3E-for-%26Value"],[63,"impl-Deserializer%3C\'de%3E-for-%26Value"],[64,"impl-Deserializer%3C\'de%3E-for-Value"],[66,"impl-Deserializer%3C\'de%3E-for-%26Value"],[67,"impl-Deserializer%3C\'de%3E-for-Value"],[69,"impl-Deserializer%3C\'de%3E-for-%26Value"],[70,"impl-Deserializer%3C\'de%3E-for-Value"],[72,"impl-Deserializer%3C\'de%3E-for-Value"],[73,"impl-Deserializer%3C\'de%3E-for-%26Value"],[75,"impl-Deserializer%3C\'de%3E-for-%26Value"],[76,"impl-Deserializer%3C\'de%3E-for-Value"],[78,"impl-Deserializer%3C\'de%3E-for-Value"],[79,"impl-Deserializer%3C\'de%3E-for-%26Value"],[81,"impl-Deserializer%3C\'de%3E-for-%26Value"],[82,"impl-Deserializer%3C\'de%3E-for-Value"],[84,"impl-Deserializer%3C\'de%3E-for-Value"],[85,"impl-Deserializer%3C\'de%3E-for-%26Value"],[87,"impl-Deserializer%3C\'de%3E-for-Value"],[88,"impl-Deserializer%3C\'de%3E-for-%26Value"],[90,"impl-Deserializer%3C\'de%3E-for-%26Value"],[91,"impl-Deserializer%3C\'de%3E-for-Value"],[93,"impl-Deserializer%3C\'de%3E-for-Value"],[94,"impl-Deserializer%3C\'de%3E-for-%26Value"],[96,"impl-Deserializer%3C\'de%3E-for-Value"],[97,"impl-Deserializer%3C\'de%3E-for-%26Value"],[99,"impl-Deserializer%3C\'de%3E-for-%26Value"],[100,"impl-Deserializer%3C\'de%3E-for-Value"],[102,"impl-Deserializer%3C\'de%3E-for-Value"],[103,"impl-Deserializer%3C\'de%3E-for-%26Value"],[105,"impl-Deserializer%3C\'de%3E-for-%26Value"],[106,"impl-Deserializer%3C\'de%3E-for-Value"],[108,"impl-Deserializer%3C\'de%3E-for-%26Value"],[109,"impl-Deserializer%3C\'de%3E-for-Value"],[111,"impl-Deserializer%3C\'de%3E-for-%26Value"],[112,"impl-Deserializer%3C\'de%3E-for-Value"],[114,"impl-Deserializer%3C\'de%3E-for-%26Value"],[115,"impl-Deserializer%3C\'de%3E-for-Value"],[117,"impl-Deserializer%3C\'de%3E-for-%26Value"],[118,"impl-Deserializer%3C\'de%3E-for-Value"],[120,"impl-Deserializer%3C\'de%3E-for-Value"],[121,"impl-Deserializer%3C\'de%3E-for-%26Value"],[123,"impl-Deserializer%3C\'de%3E-for-Value"],[124,"impl-Deserializer%3C\'de%3E-for-%26Value"],[126,"impl-Deserializer%3C\'de%3E-for-Value"],[127,"impl-Deserializer%3C\'de%3E-for-%26Value"],[129,"impl-Deserializer%3C\'de%3E-for-Value"],[130,"impl-Deserializer%3C\'de%3E-for-%26Value"],[132,"impl-Deserializer%3C\'de%3E-for-Value"],[133,"impl-Deserializer%3C\'de%3E-for-%26Value"],[135,"impl-PartialEq%3Cf64%3E-for-%26Value"],[136,"impl-PartialEq%3Cusize%3E-for-%26Value"],[137,"impl-PartialEq%3Cu16%3E-for-%26mut+Value"],[138,"impl-PartialEq%3Cisize%3E-for-%26mut+Value"],[139,"impl-PartialEq%3Cbool%3E-for-Value"],[140,"impl-PartialEq%3Cf32%3E-for-%26mut+Value"],[141,"impl-PartialEq%3Ci64%3E-for-%26mut+Value"],[142,"impl-PartialEq%3Cu64%3E-for-%26mut+Value"],[143,"impl-PartialEq%3CString%3E-for-Value"],[144,"impl-PartialEq%3Cu8%3E-for-Value"],[145,"impl-PartialEq%3Ci16%3E-for-Value"],[146,"impl-PartialEq%3Cu64%3E-for-%26Value"],[147,"impl-PartialEq%3Ci32%3E-for-Value"],[148,"impl-PartialEq%3Cusize%3E-for-%26mut+Value"],[149,"impl-PartialEq%3Cbool%3E-for-%26mut+Value"],[150,"impl-PartialEq%3Cu8%3E-for-%26mut+Value"],[151,"impl-PartialEq-for-Value"],[152,"impl-PartialEq%3Ci8%3E-for-Value"],[153,"impl-PartialEq%3Ci32%3E-for-%26Value"],[154,"impl-PartialEq%3Cu32%3E-for-Value"],[155,"impl-PartialEq%3Ci8%3E-for-%26Value"],[156,"impl-PartialEq%3C%26str%3E-for-Value"],[157,"impl-PartialEq%3Cu16%3E-for-%26Value"],[158,"impl-PartialEq%3Ci32%3E-for-%26mut+Value"],[159,"impl-PartialEq%3Cbool%3E-for-%26Value"],[160,"impl-PartialEq%3Cf64%3E-for-%26mut+Value"],[161,"impl-PartialEq%3Ci8%3E-for-%26mut+Value"],[162,"impl-PartialEq%3Ci16%3E-for-%26mut+Value"],[163,"impl-PartialEq%3Ci16%3E-for-%26Value"],[164,"impl-PartialEq%3Cu32%3E-for-%26mut+Value"],[165,"impl-PartialEq%3Ci64%3E-for-Value"],[166,"impl-PartialEq%3Cu16%3E-for-Value"],[167,"impl-PartialEq%3Cu64%3E-for-Value"],[168,"impl-PartialEq%3Cf32%3E-for-Value"],[169,"impl-PartialEq%3Cisize%3E-for-%26Value"],[170,"impl-PartialEq%3Ci64%3E-for-%26Value"],[171,"impl-PartialEq%3Cu8%3E-for-%26Value"],[172,"impl-PartialEq%3Cf64%3E-for-Value"],[173,"impl-PartialEq%3Cf32%3E-for-%26Value"],[174,"impl-PartialEq%3Cstr%3E-for-Value"],[175,"impl-PartialEq%3Cu32%3E-for-%26Value"],[176,"impl-PartialEq%3Cusize%3E-for-Value"],[177,"impl-PartialEq%3Cisize%3E-for-Value"],[180,"impl-Display-for-Error"],[181,"impl-Debug-for-Error"],[183,"impl-Display-for-Value"],[184,"impl-Debug-for-Value"],[190,"impl-From%3C()%3E-for-Value"],[191,"impl-From%3Ci8%3E-for-Value"],[192,"impl-From%3CMap%3CString,+Value%3E%3E-for-Value"],[193,"impl-From%3Cu32%3E-for-Value"],[194,"impl-From%3Ci16%3E-for-Value"],[195,"impl-From%3C%26str%3E-for-Value"],[196,"impl-From%3Cu16%3E-for-Value"],[197,"impl-From%3Ci64%3E-for-Value"],[198,"impl-From%3CCow%3C\'a,+str%3E%3E-for-Value"],[199,"impl-From%3CNumber%3E-for-Value"],[201,"impl-From%3Cisize%3E-for-Value"],[202,"impl-From%3Cf32%3E-for-Value"],[203,"impl-From%3CString%3E-for-Value"],[204,"impl-From%3Cusize%3E-for-Value"],[205,"impl-From%3Ci32%3E-for-Value"],[206,"impl-From%3C%26%5BT%5D%3E-for-Value"],[207,"impl-From%3Cf64%3E-for-Value"],[208,"impl-From%3Cu64%3E-for-Value"],[209,"impl-From%3COption%3CT%3E%3E-for-Value"],[210,"impl-From%3CVec%3CT%3E%3E-for-Value"],[211,"impl-From%3Cbool%3E-for-Value"],[212,"impl-From%3Cu8%3E-for-Value"],[214,"impl-FromIterator%3CT%3E-for-Value"],[215,"impl-FromIterator%3C(K,+V)%3E-for-Value"],[231,"impl-IntoDeserializer%3C\'de,+Error%3E-for-Value"],[232,"impl-IntoDeserializer%3C\'de,+Error%3E-for-%26Value"],[234,"impl-IntoIterator-for-%26mut+Map%3CString,+Value%3E"],[235,"impl-IntoIterator-for-%26Map%3CString,+Value%3E"],[236,"impl-IntoIterator-for-Map%3CString,+Value%3E"],[642,"impl-Deserializer%3C\'de%3E-for-%26Number"],[643,"impl-Deserializer%3C\'de%3E-for-Number"],[644,"impl-Deserializer%3C\'de%3E-for-%26Number"],[645,"impl-Deserializer%3C\'de%3E-for-Number"],[646,"impl-Deserializer%3C\'de%3E-for-%26Number"],[647,"impl-Deserializer%3C\'de%3E-for-Number"],[648,"impl-Deserializer%3C\'de%3E-for-%26Number"],[649,"impl-Deserializer%3C\'de%3E-for-Number"],[650,"impl-Deserializer%3C\'de%3E-for-%26Number"],[651,"impl-Deserializer%3C\'de%3E-for-Number"],[652,"impl-Deserializer%3C\'de%3E-for-%26Number"],[653,"impl-Deserializer%3C\'de%3E-for-Number"],[654,"impl-Deserializer%3C\'de%3E-for-Number"],[655,"impl-Deserializer%3C\'de%3E-for-%26Number"],[656,"impl-Deserializer%3C\'de%3E-for-%26Number"],[657,"impl-Deserializer%3C\'de%3E-for-Number"],[658,"impl-Deserializer%3C\'de%3E-for-%26Number"],[659,"impl-Deserializer%3C\'de%3E-for-Number"],[660,"impl-Deserializer%3C\'de%3E-for-%26Number"],[661,"impl-Deserializer%3C\'de%3E-for-Number"],[662,"impl-Deserializer%3C\'de%3E-for-Number"],[663,"impl-Deserializer%3C\'de%3E-for-%26Number"],[664,"impl-Deserializer%3C\'de%3E-for-%26Number"],[665,"impl-Deserializer%3C\'de%3E-for-Number"],[666,"impl-Deserializer%3C\'de%3E-for-Number"],[667,"impl-Deserializer%3C\'de%3E-for-%26Number"],[668,"impl-Deserializer%3C\'de%3E-for-%26Number"],[669,"impl-Deserializer%3C\'de%3E-for-Number"],[670,"impl-Deserializer%3C\'de%3E-for-Number"],[671,"impl-Deserializer%3C\'de%3E-for-%26Number"],[672,"impl-Deserializer%3C\'de%3E-for-%26Number"],[673,"impl-Deserializer%3C\'de%3E-for-Number"],[674,"impl-Deserializer%3C\'de%3E-for-%26Number"],[675,"impl-Deserializer%3C\'de%3E-for-Number"],[676,"impl-Deserializer%3C\'de%3E-for-%26Number"],[677,"impl-Deserializer%3C\'de%3E-for-Number"],[678,"impl-Deserializer%3C\'de%3E-for-Number"],[679,"impl-Deserializer%3C\'de%3E-for-%26Number"],[680,"impl-Deserializer%3C\'de%3E-for-Number"],[681,"impl-Deserializer%3C\'de%3E-for-%26Number"],[682,"impl-Deserializer%3C\'de%3E-for-Number"],[683,"impl-Deserializer%3C\'de%3E-for-%26Number"],[684,"impl-Deserializer%3C\'de%3E-for-Number"],[685,"impl-Deserializer%3C\'de%3E-for-%26Number"],[686,"impl-Deserializer%3C\'de%3E-for-Number"],[687,"impl-Deserializer%3C\'de%3E-for-%26Number"],[688,"impl-Deserializer%3C\'de%3E-for-Number"],[689,"impl-Deserializer%3C\'de%3E-for-%26Number"],[690,"impl-Deserializer%3C\'de%3E-for-%26Number"],[691,"impl-Deserializer%3C\'de%3E-for-Number"],[692,"impl-Deserializer%3C\'de%3E-for-Number"],[693,"impl-Deserializer%3C\'de%3E-for-%26Number"],[694,"impl-Deserializer%3C\'de%3E-for-Number"],[695,"impl-Deserializer%3C\'de%3E-for-%26Number"],[696,"impl-Deserializer%3C\'de%3E-for-%26Number"],[697,"impl-Deserializer%3C\'de%3E-for-Number"],[698,"impl-Deserializer%3C\'de%3E-for-%26Number"],[699,"impl-Deserializer%3C\'de%3E-for-Number"],[700,"impl-Deserializer%3C\'de%3E-for-%26Number"],[701,"impl-Deserializer%3C\'de%3E-for-Number"],[702,"impl-Deserializer%3C\'de%3E-for-Number"],[703,"impl-Deserializer%3C\'de%3E-for-%26Number"],[705,"impl-Debug-for-Number"],[706,"impl-Display-for-Number"],[708,"impl-From%3Cu16%3E-for-Number"],[709,"impl-From%3Ci32%3E-for-Number"],[710,"impl-From%3Ci8%3E-for-Number"],[711,"impl-From%3Cu32%3E-for-Number"],[712,"impl-From%3Cusize%3E-for-Number"],[714,"impl-From%3Cu64%3E-for-Number"],[715,"impl-From%3Cisize%3E-for-Number"],[716,"impl-From%3Ci64%3E-for-Number"],[717,"impl-From%3Cu8%3E-for-Number"],[718,"impl-From%3Ci16%3E-for-Number"]]}],\ -["syn",{"doc":"github crates-io docs-rs","t":"FPPPPFFPPPFPFPPGFPPFFGPPPPPPPFPPFPPPPPPPPPPPPPPPPPPFFPPGFFFPPFPPPPPPFGPFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFPFPGFFGFFFPPPPPGPGFFFFPPGGFPPPPPPFPPPFGFFFFGPFPPPPPPGPFFFFFFFFFFFFFFFFPPFPPPPFPGPPFFFFFFFFFPFPPFPPPPPPPPGPPGGFFPPPPPPPPPPPPPPPPPPPPPTPPPPPFGFFFFFFFFFFFFFFFFFPPPPPGFFFPPFPPGFPPPPPPPPPPIPGPPPPFPPPPGGFPPPPPPPQPPPFGGFFFFPPPPPPPFGPPPPPPPPPFFFFFFFFFGFFFFFFFPGPPPPPPPPFFFFFGFFPPPPPPPPPFGFGPPPOOOOOOOOOOOOOOONOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOONNNNOOOOOOOOOOOOONNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNOOOOOOOOOOOOOOOOOOOOOQOOOOOOOQOCOOOONNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNOOOOOOOOOOOOOOOOOOOOOOOOOONNOOOOOOOOOOOOQQONNNOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOONNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOCOOOOOOOOOONNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNOOOONNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNOOOOOOOOOOOOOOOOOOONOOOOOOONNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOONNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNOOOOONNOOOOOOOOOOONOOOONOOONOOOOONOOOOOOOOOOOOOOOOONOOOOCOOOOOOOOOOOOOOOOOOONNNNNNNNNNNNNOOOOOOOOOOOOOOOOOOOOOOOOQCHNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNHNNNNNNNHNQNNNNNNNQQNHNNNNNNNNOOOOOOOOONNOOOOOOOOOOOOOOOCOOOOOOONOOOONNNNOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOONNNNNNNNNNNOOOOONNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNOOCNOOOOOOOOOOONNNNNNNNOONNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNCNNNNNNNNOOOOOOONNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNOOOOOOOOOOOOOOOOONNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNOOOOOOOOOONOOOOOOOONNNNNNOOOOOOOOOOOOOOOOOOOOOOOOOOOCOOONNNNOFFNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNKMTMFNNNNONNHONNNNPFFFPRKFIKKIFNNNNNNNNNNNNNNNNNNNNNCNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNMNNNMNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNKKMMPFFFFGFFFPNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNKMFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFKFFFFFFFFFFFFFNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOONNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNKHNNHNNHNNHNNHNNHNNHNNHNNHNNHNNHNNHNNHNNHNNHNNHNNHNNHNNHNNHNNHNNHNNHNNHNNHNNHNNHNNHNNHNNHNNHNNHNNHNNHNNHNNHNNHNNHNNHNNHNNHNNHNNHNNHNNHNNHNNHNNHNNHNNHNNHNNHNNHNNHNNHNNHNNHNNHNNHNNHNNHNNHNNHNNHNNHNNHNNHNNHNNHNNHNNHNNHNNHNNHNNHNNHNNHNNHNNHNNHNNHNNHNNHNNHNNHNNHNNHNNHNNHNNHNNHNNHNNHNNHNNHNNHNNHNNHNNHNNHNNHNNHNNHNNHNNHNNHNNHNNHNNHNNHNNHNNHNNHNNHNNHNNHNNHNNHNNHNNHNNHNNHNNHNNHNNHNNHNNHNNHNNHNNHNNHNNHNNHNNHNNHNNHNNHNNHNNHNNHNNHNNHNNHNNHNNHNNHNNHNNHNNHNNHNNHNNHNNHNNHNNHNNHNNHNNHNNHNNHNNHNNHNNHNNHNNHNNHNNHNNHNNHNNHNNHNNHNNHNNHNNHNNHNNHNNHNNHNNHNNHNNHNNHNN","n":["Abi","Add","AddAssign","And","AngleBracketed","AngleBracketedGenericArguments","Arm","Array","Array","Assign","AssocConst","AssocConst","AssocType","AssocType","Async","AttrStyle","Attribute","Await","BareFn","BareFnArg","BareVariadic","BinOp","Binary","BitAnd","BitAndAssign","BitOr","BitOrAssign","BitXor","BitXorAssign","Block","Block","Bool","BoundLifetimes","Brace","Bracket","Break","Byte","ByteStr","CStr","Call","Cast","Char","Closed","Closure","Const","Const","Const","Const","Const","Const","Const","ConstParam","Constraint","Constraint","Continue","Data","DataEnum","DataStruct","DataUnion","Default","Deref","DeriveInput","Div","DivAssign","Enum","Enum","Eq","Err","Error","Expr","Expr","ExprArray","ExprAssign","ExprAsync","ExprAwait","ExprBinary","ExprBlock","ExprBreak","ExprCall","ExprCast","ExprClosure","ExprConst","ExprContinue","ExprField","ExprForLoop","ExprGroup","ExprIf","ExprIndex","ExprInfer","ExprLet","ExprLit","ExprLoop","ExprMacro","ExprMatch","ExprMethodCall","ExprParen","ExprPath","ExprRange","ExprReference","ExprRepeat","ExprReturn","ExprStruct","ExprTry","ExprTryBlock","ExprTuple","ExprUnary","ExprUnsafe","ExprWhile","ExprYield","ExternCrate","Field","Field","FieldMutability","FieldPat","FieldValue","Fields","FieldsNamed","FieldsUnnamed","File","Float","Fn","Fn","Fn","Fn","FnArg","ForLoop","ForeignItem","ForeignItemFn","ForeignItemMacro","ForeignItemStatic","ForeignItemType","ForeignMod","Ge","GenericArgument","GenericParam","Generics","Glob","Group","Group","Group","Gt","HalfOpen","Ident","Ident","If","Impl","ImplGenerics","ImplItem","ImplItemConst","ImplItemFn","ImplItemMacro","ImplItemType","ImplRestriction","ImplTrait","Index","Index","Infer","Infer","Inherited","Inner","Int","Item","Item","ItemConst","ItemEnum","ItemExternCrate","ItemFn","ItemForeignMod","ItemImpl","ItemMacro","ItemMod","ItemStatic","ItemStruct","ItemTrait","ItemTraitAlias","ItemType","ItemUnion","ItemUse","Label","Le","Let","Lifetime","Lifetime","Lifetime","Lifetime","Lifetime","LifetimeParam","List","Lit","Lit","Lit","LitBool","LitByte","LitByteStr","LitCStr","LitChar","LitFloat","LitInt","LitStr","Local","Local","LocalInit","Loop","Lt","Macro","Macro","Macro","Macro","Macro","Macro","Macro","Macro","Macro","MacroDelimiter","Match","Maybe","Member","Meta","MetaList","MetaNameValue","MethodCall","Mod","Mul","MulAssign","Mut","Name","NameValue","Named","Named","Ne","Neg","Never","None","None","None","None","Not","Ok","Or","Or","Outer","PLACEHOLDER","Paren","Paren","Paren","Paren","Parenthesized","ParenthesizedGenericArguments","Pat","PatConst","PatIdent","PatLit","PatMacro","PatOr","PatParen","PatPath","PatRange","PatReference","PatRest","PatSlice","PatStruct","PatTuple","PatTupleStruct","PatType","PatWild","Path","Path","Path","Path","Path","Path","PathArguments","PathSegment","PredicateLifetime","PredicateType","Ptr","Public","QSelf","Range","Range","RangeLimits","Receiver","Receiver","Reference","Reference","Reference","Rem","RemAssign","Rename","Repeat","Rest","Restricted","Result","Return","ReturnType","Shl","ShlAssign","Shr","ShrAssign","Signature","Slice","Slice","Static","Static","StaticMutability","Stmt","StmtMacro","Str","Struct","Struct","Struct","Struct","Sub","SubAssign","Token","Trait","Trait","TraitAlias","TraitBound","TraitBoundModifier","TraitItem","TraitItemConst","TraitItemFn","TraitItemMacro","TraitItemType","TraitObject","Try","TryBlock","Tuple","Tuple","Tuple","TupleStruct","Turbofish","Type","Type","Type","Type","Type","Type","Type","Type","Type","Type","TypeArray","TypeBareFn","TypeGenerics","TypeGroup","TypeImplTrait","TypeInfer","TypeMacro","TypeNever","TypeParam","TypeParamBound","TypeParen","TypePath","TypePtr","TypeReference","TypeSlice","TypeTraitObject","TypeTuple","Typed","UnOp","Unary","Union","Union","Unit","Unnamed","Unnamed","Unsafe","Use","UseGlob","UseGroup","UseName","UsePath","UseRename","UseTree","Variadic","Variant","Verbatim","Verbatim","Verbatim","Verbatim","Verbatim","Verbatim","Verbatim","Verbatim","Verbatim","VisRestricted","Visibility","WhereClause","WherePredicate","While","Wild","Yield","abi","abi","abi","and_token","and_token","and_token","apostrophe","args","args","args","arguments","arms","as_token","as_token","as_token","as_turbofish","async_token","asyncness","asyncness","attrs","attrs","attrs","attrs","attrs","attrs","attrs","attrs","attrs","attrs","attrs","attrs","attrs","attrs","attrs","attrs","attrs","attrs","attrs","attrs","attrs","attrs","attrs","attrs","attrs","attrs","attrs","attrs","attrs","attrs","attrs","attrs","attrs","attrs","attrs","attrs","attrs","attrs","attrs","attrs","attrs","attrs","attrs","attrs","attrs","attrs","attrs","attrs","attrs","attrs","attrs","attrs","attrs","attrs","attrs","attrs","attrs","attrs","attrs","attrs","attrs","attrs","attrs","attrs","attrs","attrs","attrs","attrs","attrs","attrs","attrs","attrs","attrs","attrs","attrs","attrs","attrs","attrs","attrs","attrs","attrs","attrs","attrs","attrs","attrs","attrs","attrs","attrs","attrs","attrs","attrs","attrs","attrs","attrs","attrs","attrs","attrs","auto_token","await_token","bang_token","bang_token","base","base","base10_digits","base10_digits","base10_parse","base10_parse","block","block","block","block","block","block","block","block","body","body","body","body","body","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","bounded_ty","bounds","bounds","bounds","bounds","bounds","bounds","bounds","bounds","bounds","brace_token","brace_token","brace_token","brace_token","brace_token","brace_token","brace_token","brace_token","brace_token","brace_token","brace_token","braced","bracket_token","bracket_token","bracket_token","bracket_token","bracket_token","bracket_token","bracket_token","bracketed","break_token","buffer","by_ref","capture","capture","cases","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","cmp","cmp","colon2_token","colon2_token","colon_token","colon_token","colon_token","colon_token","colon_token","colon_token","colon_token","colon_token","colon_token","colon_token","colon_token","colon_token","colon_token","colon_token","colon_token","colon_token","colon_token","colon_token","colon_token","comma","comma","comma","cond","cond","const_params","const_params_mut","const_token","const_token","const_token","const_token","const_token","const_token","const_token","constness","constness","content","continue_token","crate_token","custom_keyword","custom_punctuation","data","default","default","default","default","default","default","default","default","defaultness","defaultness","defaultness","defaultness","delimiter","delimiter","discriminant","diverge","dot2_token","dot2_token","dot_token","dot_token","dot_token","dots","dots","dyn_token","elem","elem","elem","elem","elem","elem","elems","elems","elems","elems","elems","elems","else_branch","end","end","enum_token","enum_token","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq_token","eq_token","eq_token","eq_token","eq_token","eq_token","eq_token","eq_token","eq_token","eq_token","eq_token","eq_token","eq_token","eq_token","expr","expr","expr","expr","expr","expr","expr","expr","expr","expr","expr","expr","expr","expr","expr","expr","expr","expr","expr","ext","extern_token","extern_token","fat_arrow_token","fields","fields","fields","fields","fields","fields","fields","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fn_token","fn_token","for_token","for_token","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","func","generics","generics","generics","generics","generics","generics","generics","generics","generics","generics","generics","generics","generics","generics","generics","generics","generics","generics","get_ident","group_token","group_token","gt_token","gt_token","gt_token","gt_token","guard","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","ident","ident","ident","ident","ident","ident","ident","ident","ident","ident","ident","ident","ident","ident","ident","ident","ident","ident","ident","ident","ident","ident","ident","ident","ident","ident","ident","ident","ident","ident","ident","ident","if_token","impl_token","impl_token","in_token","in_token","index","index","init","inputs","inputs","inputs","inputs","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into_iter","into_iter","into_iter","is_empty","is_empty","is_ident","is_none","items","items","items","items","items","iter","iter_mut","label","label","label","label","label","label","leading_colon","leading_colon","leading_vert","left","left","len","len","len","let_token","let_token","lifetime","lifetime","lifetime","lifetime","lifetimes","lifetimes","lifetimes","lifetimes","lifetimes","lifetimes","lifetimes_mut","limits","limits","lit","lit","loop_token","lt_token","lt_token","lt_token","lt_token","mac","mac","mac","mac","mac","mac","mac","mac","make_where_clause","match_token","member","member","member","meta","meta","method","mod_token","modifier","movability","mutability","mutability","mutability","mutability","mutability","mutability","mutability","mutability","mutability","name","name","name","name","named","new","new","new","new","new","new","new","new","new","new","new","new","new_raw","op","op","or1_token","or2_token","output","output","output","output","params","paren_token","paren_token","paren_token","paren_token","paren_token","paren_token","paren_token","paren_token","paren_token","paren_token","paren_token","paren_token","paren_token","paren_token","paren_token","parenthesized","parse","parse","parse","parse","parse","parse","parse","parse","parse","parse","parse","parse","parse","parse","parse","parse","parse","parse","parse","parse","parse","parse","parse","parse","parse","parse","parse","parse","parse","parse","parse","parse","parse","parse","parse","parse","parse","parse","parse","parse","parse","parse","parse","parse","parse","parse","parse","parse","parse","parse","parse","parse","parse","parse","parse","parse","parse","parse","parse","parse","parse","parse","parse","parse","parse","parse","parse","parse","parse","parse","parse","parse","parse","parse","parse","parse","parse","parse","parse","parse","parse","parse","parse","parse","parse","parse","parse","parse","parse","parse","parse","parse","parse","parse","parse","parse","parse","parse","parse","parse","parse","parse","parse","parse","parse","parse","parse","parse","parse","parse","parse","parse","parse","parse","parse","parse","parse","parse","parse","parse","parse","parse","parse","parse","parse","parse","parse","parse","parse","parse","parse","parse","parse","parse","parse","parse","parse","parse","parse","parse","parse","parse","parse","parse2","parse_any","parse_args","parse_args","parse_args_with","parse_args_with","parse_body","parse_body_with","parse_file","parse_inner","parse_macro_input","parse_mod_style","parse_multi","parse_multi_with_leading_vert","parse_named","parse_nested_meta","parse_nested_meta","parse_outer","parse_quote","parse_quote_spanned","parse_single","parse_str","parse_turbofish","parse_unnamed","parse_with","parse_with_earlier_boundary_rule","parse_within","parse_without_eager_brace","partial_cmp","partial_cmp","pat","pat","pat","pat","pat","pat","pat","pat","pat","path","path","path","path","path","path","path","path","path","path","path","path","path","position","pound_token","predicates","pub_token","punctuated","qself","qself","qself","qself","qself","qself","question_token","receiver","receiver","reference","rename","rename","require_ident","require_list","require_name_value","require_path_only","rest","rest","restriction","return_token","right","right","segments","self_token","self_ty","semi","semi_token","semi_token","semi_token","semi_token","semi_token","semi_token","semi_token","semi_token","semi_token","semi_token","semi_token","semi_token","semi_token","semi_token","semi_token","semi_token","semi_token","semi_token","semi_token","semi_token","semi_token","semi_token","semi_token","semi_token","set_span","set_span","set_span","set_span","set_span","set_span","set_span","set_span","set_span","set_span","set_span","shebang","sig","sig","sig","sig","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","spanned","split_for_impl","star_token","star_token","start","start","static_token","static_token","stmts","struct_token","struct_token","style","subpat","suffix","suffix","suffix","suffix","suffix","suffix","suffix","suffix","supertraits","then_branch","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_string","to_string","to_string","to_string","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","token","token","token","token","token","token","token","token","token","tokens","tokens","trait_","trait_token","trait_token","tree","tree","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_token","turbofish","ty","ty","ty","ty","ty","ty","ty","ty","ty","ty","ty","ty","ty","ty","ty","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_params","type_params_mut","type_token","type_token","type_token","type_token","underscore_token","underscore_token","underscore_token","union_token","union_token","unnamed","unraw","unsafe_token","unsafety","unsafety","unsafety","unsafety","unsafety","unsafety","use_token","value","value","value","value","value","value","value","value","value","variadic","variadic","variants","variants","vis","vis","vis","vis","vis","vis","vis","vis","vis","vis","vis","vis","vis","vis","vis","vis","vis","vis","vis","vis","visit_mut","where_clause","where_token","while_token","without_plus","without_plus","without_plus","without_plus","yield_token","Cursor","TokenBuffer","begin","borrow","borrow","borrow_mut","borrow_mut","clone","clone_into","empty","eof","eq","from","from","group","ident","into","into","lifetime","literal","new","new2","partial_cmp","punct","span","to_owned","token_stream","token_tree","try_from","try_from","try_into","try_into","type_id","type_id","IdentExt","parse_any","peek_any","unraw","ParseNestedMeta","borrow","borrow_mut","error","from","input","into","parse_nested_meta","parser","path","try_from","try_into","type_id","value","Err","Error","Lookahead1","Nothing","Ok","Output","Parse","ParseBuffer","ParseStream","Parser","Peek","Result","StepCursor","advance_to","borrow","borrow","borrow","borrow","borrow","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","call","clone","clone","clone","clone_into","clone_into","clone_into","combine","cursor","deref","discouraged","drop","eq","error","error","error","extend","fmt","fmt","fmt","fmt","fmt","fork","from","from","from","from","from","from","hash","into","into","into","into","into","into_compile_error","into_iter","into_iter","is_empty","lookahead1","new","new_spanned","parse","parse","parse","parse","parse2","parse_any_delimiter","parse_str","parse_terminated","peek","peek","peek2","peek3","span","span","span","step","to_compile_error","to_owned","to_owned","to_owned","to_string","to_string","to_tokens","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","AnyDelimiter","Speculative","advance_to","parse_any_delimiter","End","IntoIter","IntoPairs","Iter","IterMut","Pair","Pairs","PairsMut","Punctuated","Punctuated","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","clear","clone","clone","clone","clone","clone","clone","clone_from","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","cloned","default","empty_or_trailing","eq","extend","extend","first","first_mut","fmt","from","from","from","from","from","from","from","from","from_iter","from_iter","hash","index","index_mut","insert","into","into","into","into","into","into","into","into","into_iter","into_iter","into_iter","into_iter","into_iter","into_iter","into_iter","into_iter","into_iter","into_pairs","into_tuple","into_value","is_empty","iter","iter_mut","last","last_mut","len","len","len","len","len","len","len","new","new","next","next","next","next","next","next","next_back","next_back","next_back","next_back","next_back","next_back","pairs","pairs_mut","parse_separated_nonempty","parse_separated_nonempty_with","parse_terminated","parse_terminated_with","pop","pop_punct","punct","punct_mut","push","push_punct","push_value","size_hint","size_hint","size_hint","size_hint","size_hint","size_hint","span","span","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_tokens","to_tokens","trailing_punct","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","value","value_mut","Spanned","span","Abstract","And","AndAnd","AndEq","As","Async","At","Auto","Await","Become","Box","Brace","Bracket","Break","Caret","CaretEq","Colon","Comma","Const","Continue","Crate","Default","Do","Dollar","Dot","DotDot","DotDotDot","DotDotEq","Dyn","Else","Enum","Eq","EqEq","Extern","FatArrow","Final","Fn","For","Ge","Group","Gt","If","Impl","In","LArrow","Le","Let","Loop","Lt","Macro","Match","Minus","MinusEq","Mod","Move","Mut","Ne","Not","Or","OrEq","OrOr","Override","Paren","PathSep","Percent","PercentEq","Plus","PlusEq","Pound","Priv","Pub","Question","RArrow","Ref","Return","SelfType","SelfValue","Semi","Shl","ShlEq","Shr","ShrEq","Slash","SlashEq","Star","StarEq","Static","Struct","Super","Tilde","Token","Trait","Try","Type","Typeof","Underscore","Union","Unsafe","Unsized","Use","Virtual","Where","While","Yield","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","default","default","default","default","default","default","default","default","default","default","default","default","default","default","default","default","default","default","default","default","default","default","default","default","default","default","default","default","default","default","default","default","default","default","default","default","default","default","default","default","default","default","default","default","default","default","default","default","default","default","default","default","default","default","default","default","default","default","default","default","default","default","default","default","default","default","default","default","default","default","default","default","default","default","default","default","default","default","default","default","default","default","default","default","default","default","default","default","default","default","default","default","default","default","default","default","default","default","default","default","default","default","default","deref","deref","deref","deref","deref","deref","deref","deref","deref","deref","deref","deref","deref","deref","deref","deref","deref","deref","deref","deref","deref","deref","deref_mut","deref_mut","deref_mut","deref_mut","deref_mut","deref_mut","deref_mut","deref_mut","deref_mut","deref_mut","deref_mut","deref_mut","deref_mut","deref_mut","deref_mut","deref_mut","deref_mut","deref_mut","deref_mut","deref_mut","deref_mut","deref_mut","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","parse","parse","parse","parse","parse","parse","parse","parse","parse","parse","parse","parse","parse","parse","parse","parse","parse","parse","parse","parse","parse","parse","parse","parse","parse","parse","parse","parse","parse","parse","parse","parse","parse","parse","parse","parse","parse","parse","parse","parse","parse","parse","parse","parse","parse","parse","parse","parse","parse","parse","parse","parse","parse","parse","parse","parse","parse","parse","parse","parse","parse","parse","parse","parse","parse","parse","parse","parse","parse","parse","parse","parse","parse","parse","parse","parse","parse","parse","parse","parse","parse","parse","parse","parse","parse","parse","parse","parse","parse","parse","parse","parse","parse","parse","parse","parse","parse","parse","parse","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","spans","spans","spans","spans","spans","spans","spans","spans","spans","spans","spans","spans","spans","spans","spans","spans","spans","spans","spans","spans","spans","spans","spans","spans","spans","spans","spans","spans","spans","spans","spans","spans","spans","spans","spans","spans","spans","spans","spans","spans","spans","spans","spans","spans","spans","spans","spans","surround","surround","surround","surround","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","VisitMut","visit_abi_mut","visit_abi_mut","visit_abi_mut","visit_angle_bracketed_generic_arguments_mut","visit_angle_bracketed_generic_arguments_mut","visit_angle_bracketed_generic_arguments_mut","visit_arm_mut","visit_arm_mut","visit_arm_mut","visit_assoc_const_mut","visit_assoc_const_mut","visit_assoc_const_mut","visit_assoc_type_mut","visit_assoc_type_mut","visit_assoc_type_mut","visit_attr_style_mut","visit_attr_style_mut","visit_attr_style_mut","visit_attribute_mut","visit_attribute_mut","visit_attribute_mut","visit_bare_fn_arg_mut","visit_bare_fn_arg_mut","visit_bare_fn_arg_mut","visit_bare_variadic_mut","visit_bare_variadic_mut","visit_bare_variadic_mut","visit_bin_op_mut","visit_bin_op_mut","visit_bin_op_mut","visit_block_mut","visit_block_mut","visit_block_mut","visit_bound_lifetimes_mut","visit_bound_lifetimes_mut","visit_bound_lifetimes_mut","visit_const_param_mut","visit_const_param_mut","visit_const_param_mut","visit_constraint_mut","visit_constraint_mut","visit_constraint_mut","visit_data_enum_mut","visit_data_enum_mut","visit_data_enum_mut","visit_data_mut","visit_data_mut","visit_data_mut","visit_data_struct_mut","visit_data_struct_mut","visit_data_struct_mut","visit_data_union_mut","visit_data_union_mut","visit_data_union_mut","visit_derive_input_mut","visit_derive_input_mut","visit_derive_input_mut","visit_expr_array_mut","visit_expr_array_mut","visit_expr_array_mut","visit_expr_assign_mut","visit_expr_assign_mut","visit_expr_assign_mut","visit_expr_async_mut","visit_expr_async_mut","visit_expr_async_mut","visit_expr_await_mut","visit_expr_await_mut","visit_expr_await_mut","visit_expr_binary_mut","visit_expr_binary_mut","visit_expr_binary_mut","visit_expr_block_mut","visit_expr_block_mut","visit_expr_block_mut","visit_expr_break_mut","visit_expr_break_mut","visit_expr_break_mut","visit_expr_call_mut","visit_expr_call_mut","visit_expr_call_mut","visit_expr_cast_mut","visit_expr_cast_mut","visit_expr_cast_mut","visit_expr_closure_mut","visit_expr_closure_mut","visit_expr_closure_mut","visit_expr_const_mut","visit_expr_const_mut","visit_expr_const_mut","visit_expr_continue_mut","visit_expr_continue_mut","visit_expr_continue_mut","visit_expr_field_mut","visit_expr_field_mut","visit_expr_field_mut","visit_expr_for_loop_mut","visit_expr_for_loop_mut","visit_expr_for_loop_mut","visit_expr_group_mut","visit_expr_group_mut","visit_expr_group_mut","visit_expr_if_mut","visit_expr_if_mut","visit_expr_if_mut","visit_expr_index_mut","visit_expr_index_mut","visit_expr_index_mut","visit_expr_infer_mut","visit_expr_infer_mut","visit_expr_infer_mut","visit_expr_let_mut","visit_expr_let_mut","visit_expr_let_mut","visit_expr_lit_mut","visit_expr_lit_mut","visit_expr_lit_mut","visit_expr_loop_mut","visit_expr_loop_mut","visit_expr_loop_mut","visit_expr_macro_mut","visit_expr_macro_mut","visit_expr_macro_mut","visit_expr_match_mut","visit_expr_match_mut","visit_expr_match_mut","visit_expr_method_call_mut","visit_expr_method_call_mut","visit_expr_method_call_mut","visit_expr_mut","visit_expr_mut","visit_expr_mut","visit_expr_paren_mut","visit_expr_paren_mut","visit_expr_paren_mut","visit_expr_path_mut","visit_expr_path_mut","visit_expr_path_mut","visit_expr_range_mut","visit_expr_range_mut","visit_expr_range_mut","visit_expr_reference_mut","visit_expr_reference_mut","visit_expr_reference_mut","visit_expr_repeat_mut","visit_expr_repeat_mut","visit_expr_repeat_mut","visit_expr_return_mut","visit_expr_return_mut","visit_expr_return_mut","visit_expr_struct_mut","visit_expr_struct_mut","visit_expr_struct_mut","visit_expr_try_block_mut","visit_expr_try_block_mut","visit_expr_try_block_mut","visit_expr_try_mut","visit_expr_try_mut","visit_expr_try_mut","visit_expr_tuple_mut","visit_expr_tuple_mut","visit_expr_tuple_mut","visit_expr_unary_mut","visit_expr_unary_mut","visit_expr_unary_mut","visit_expr_unsafe_mut","visit_expr_unsafe_mut","visit_expr_unsafe_mut","visit_expr_while_mut","visit_expr_while_mut","visit_expr_while_mut","visit_expr_yield_mut","visit_expr_yield_mut","visit_expr_yield_mut","visit_field_mut","visit_field_mut","visit_field_mut","visit_field_mutability_mut","visit_field_mutability_mut","visit_field_mutability_mut","visit_field_pat_mut","visit_field_pat_mut","visit_field_pat_mut","visit_field_value_mut","visit_field_value_mut","visit_field_value_mut","visit_fields_mut","visit_fields_mut","visit_fields_mut","visit_fields_named_mut","visit_fields_named_mut","visit_fields_named_mut","visit_fields_unnamed_mut","visit_fields_unnamed_mut","visit_fields_unnamed_mut","visit_file_mut","visit_file_mut","visit_file_mut","visit_fn_arg_mut","visit_fn_arg_mut","visit_fn_arg_mut","visit_foreign_item_fn_mut","visit_foreign_item_fn_mut","visit_foreign_item_fn_mut","visit_foreign_item_macro_mut","visit_foreign_item_macro_mut","visit_foreign_item_macro_mut","visit_foreign_item_mut","visit_foreign_item_mut","visit_foreign_item_mut","visit_foreign_item_static_mut","visit_foreign_item_static_mut","visit_foreign_item_static_mut","visit_foreign_item_type_mut","visit_foreign_item_type_mut","visit_foreign_item_type_mut","visit_generic_argument_mut","visit_generic_argument_mut","visit_generic_argument_mut","visit_generic_param_mut","visit_generic_param_mut","visit_generic_param_mut","visit_generics_mut","visit_generics_mut","visit_generics_mut","visit_ident_mut","visit_ident_mut","visit_ident_mut","visit_impl_item_const_mut","visit_impl_item_const_mut","visit_impl_item_const_mut","visit_impl_item_fn_mut","visit_impl_item_fn_mut","visit_impl_item_fn_mut","visit_impl_item_macro_mut","visit_impl_item_macro_mut","visit_impl_item_macro_mut","visit_impl_item_mut","visit_impl_item_mut","visit_impl_item_mut","visit_impl_item_type_mut","visit_impl_item_type_mut","visit_impl_item_type_mut","visit_impl_restriction_mut","visit_impl_restriction_mut","visit_impl_restriction_mut","visit_index_mut","visit_index_mut","visit_index_mut","visit_item_const_mut","visit_item_const_mut","visit_item_const_mut","visit_item_enum_mut","visit_item_enum_mut","visit_item_enum_mut","visit_item_extern_crate_mut","visit_item_extern_crate_mut","visit_item_extern_crate_mut","visit_item_fn_mut","visit_item_fn_mut","visit_item_fn_mut","visit_item_foreign_mod_mut","visit_item_foreign_mod_mut","visit_item_foreign_mod_mut","visit_item_impl_mut","visit_item_impl_mut","visit_item_impl_mut","visit_item_macro_mut","visit_item_macro_mut","visit_item_macro_mut","visit_item_mod_mut","visit_item_mod_mut","visit_item_mod_mut","visit_item_mut","visit_item_mut","visit_item_mut","visit_item_static_mut","visit_item_static_mut","visit_item_static_mut","visit_item_struct_mut","visit_item_struct_mut","visit_item_struct_mut","visit_item_trait_alias_mut","visit_item_trait_alias_mut","visit_item_trait_alias_mut","visit_item_trait_mut","visit_item_trait_mut","visit_item_trait_mut","visit_item_type_mut","visit_item_type_mut","visit_item_type_mut","visit_item_union_mut","visit_item_union_mut","visit_item_union_mut","visit_item_use_mut","visit_item_use_mut","visit_item_use_mut","visit_label_mut","visit_label_mut","visit_label_mut","visit_lifetime_mut","visit_lifetime_mut","visit_lifetime_mut","visit_lifetime_param_mut","visit_lifetime_param_mut","visit_lifetime_param_mut","visit_lit_bool_mut","visit_lit_bool_mut","visit_lit_bool_mut","visit_lit_byte_mut","visit_lit_byte_mut","visit_lit_byte_mut","visit_lit_byte_str_mut","visit_lit_byte_str_mut","visit_lit_byte_str_mut","visit_lit_char_mut","visit_lit_char_mut","visit_lit_char_mut","visit_lit_cstr_mut","visit_lit_cstr_mut","visit_lit_cstr_mut","visit_lit_float_mut","visit_lit_float_mut","visit_lit_float_mut","visit_lit_int_mut","visit_lit_int_mut","visit_lit_int_mut","visit_lit_mut","visit_lit_mut","visit_lit_mut","visit_lit_str_mut","visit_lit_str_mut","visit_lit_str_mut","visit_local_init_mut","visit_local_init_mut","visit_local_init_mut","visit_local_mut","visit_local_mut","visit_local_mut","visit_macro_delimiter_mut","visit_macro_delimiter_mut","visit_macro_delimiter_mut","visit_macro_mut","visit_macro_mut","visit_macro_mut","visit_member_mut","visit_member_mut","visit_member_mut","visit_meta_list_mut","visit_meta_list_mut","visit_meta_list_mut","visit_meta_mut","visit_meta_mut","visit_meta_mut","visit_meta_name_value_mut","visit_meta_name_value_mut","visit_meta_name_value_mut","visit_parenthesized_generic_arguments_mut","visit_parenthesized_generic_arguments_mut","visit_parenthesized_generic_arguments_mut","visit_pat_ident_mut","visit_pat_ident_mut","visit_pat_ident_mut","visit_pat_mut","visit_pat_mut","visit_pat_mut","visit_pat_or_mut","visit_pat_or_mut","visit_pat_or_mut","visit_pat_paren_mut","visit_pat_paren_mut","visit_pat_paren_mut","visit_pat_reference_mut","visit_pat_reference_mut","visit_pat_reference_mut","visit_pat_rest_mut","visit_pat_rest_mut","visit_pat_rest_mut","visit_pat_slice_mut","visit_pat_slice_mut","visit_pat_slice_mut","visit_pat_struct_mut","visit_pat_struct_mut","visit_pat_struct_mut","visit_pat_tuple_mut","visit_pat_tuple_mut","visit_pat_tuple_mut","visit_pat_tuple_struct_mut","visit_pat_tuple_struct_mut","visit_pat_tuple_struct_mut","visit_pat_type_mut","visit_pat_type_mut","visit_pat_type_mut","visit_pat_wild_mut","visit_pat_wild_mut","visit_pat_wild_mut","visit_path_arguments_mut","visit_path_arguments_mut","visit_path_arguments_mut","visit_path_mut","visit_path_mut","visit_path_mut","visit_path_segment_mut","visit_path_segment_mut","visit_path_segment_mut","visit_predicate_lifetime_mut","visit_predicate_lifetime_mut","visit_predicate_lifetime_mut","visit_predicate_type_mut","visit_predicate_type_mut","visit_predicate_type_mut","visit_qself_mut","visit_qself_mut","visit_qself_mut","visit_range_limits_mut","visit_range_limits_mut","visit_range_limits_mut","visit_receiver_mut","visit_receiver_mut","visit_receiver_mut","visit_return_type_mut","visit_return_type_mut","visit_return_type_mut","visit_signature_mut","visit_signature_mut","visit_signature_mut","visit_span_mut","visit_span_mut","visit_span_mut","visit_static_mutability_mut","visit_static_mutability_mut","visit_static_mutability_mut","visit_stmt_macro_mut","visit_stmt_macro_mut","visit_stmt_macro_mut","visit_stmt_mut","visit_stmt_mut","visit_stmt_mut","visit_trait_bound_modifier_mut","visit_trait_bound_modifier_mut","visit_trait_bound_modifier_mut","visit_trait_bound_mut","visit_trait_bound_mut","visit_trait_bound_mut","visit_trait_item_const_mut","visit_trait_item_const_mut","visit_trait_item_const_mut","visit_trait_item_fn_mut","visit_trait_item_fn_mut","visit_trait_item_fn_mut","visit_trait_item_macro_mut","visit_trait_item_macro_mut","visit_trait_item_macro_mut","visit_trait_item_mut","visit_trait_item_mut","visit_trait_item_mut","visit_trait_item_type_mut","visit_trait_item_type_mut","visit_trait_item_type_mut","visit_type_array_mut","visit_type_array_mut","visit_type_array_mut","visit_type_bare_fn_mut","visit_type_bare_fn_mut","visit_type_bare_fn_mut","visit_type_group_mut","visit_type_group_mut","visit_type_group_mut","visit_type_impl_trait_mut","visit_type_impl_trait_mut","visit_type_impl_trait_mut","visit_type_infer_mut","visit_type_infer_mut","visit_type_infer_mut","visit_type_macro_mut","visit_type_macro_mut","visit_type_macro_mut","visit_type_mut","visit_type_mut","visit_type_mut","visit_type_never_mut","visit_type_never_mut","visit_type_never_mut","visit_type_param_bound_mut","visit_type_param_bound_mut","visit_type_param_bound_mut","visit_type_param_mut","visit_type_param_mut","visit_type_param_mut","visit_type_paren_mut","visit_type_paren_mut","visit_type_paren_mut","visit_type_path_mut","visit_type_path_mut","visit_type_path_mut","visit_type_ptr_mut","visit_type_ptr_mut","visit_type_ptr_mut","visit_type_reference_mut","visit_type_reference_mut","visit_type_reference_mut","visit_type_slice_mut","visit_type_slice_mut","visit_type_slice_mut","visit_type_trait_object_mut","visit_type_trait_object_mut","visit_type_trait_object_mut","visit_type_tuple_mut","visit_type_tuple_mut","visit_type_tuple_mut","visit_un_op_mut","visit_un_op_mut","visit_un_op_mut","visit_use_glob_mut","visit_use_glob_mut","visit_use_glob_mut","visit_use_group_mut","visit_use_group_mut","visit_use_group_mut","visit_use_name_mut","visit_use_name_mut","visit_use_name_mut","visit_use_path_mut","visit_use_path_mut","visit_use_path_mut","visit_use_rename_mut","visit_use_rename_mut","visit_use_rename_mut","visit_use_tree_mut","visit_use_tree_mut","visit_use_tree_mut","visit_variadic_mut","visit_variadic_mut","visit_variadic_mut","visit_variant_mut","visit_variant_mut","visit_variant_mut","visit_vis_restricted_mut","visit_vis_restricted_mut","visit_vis_restricted_mut","visit_visibility_mut","visit_visibility_mut","visit_visibility_mut","visit_where_clause_mut","visit_where_clause_mut","visit_where_clause_mut","visit_where_predicate_mut","visit_where_predicate_mut","visit_where_predicate_mut"],"q":[[0,"syn"],[4206,"syn::buffer"],[4240,"syn::ext"],[4244,"syn::meta"],[4258,"syn::parse"],[4362,"syn::parse::discouraged"],[4366,"syn::punctuated"],[4531,"syn::spanned"],[4533,"syn::token"],[6527,"syn::visit_mut"],[7077,"core::str::traits"],[7078,"core::cmp"],[7079,"core::convert"],[7080,"core::marker"],[7081,"core::fmt"],[7082,"core::fmt"],[7083,"core::fmt"],[7084,"core::convert"],[7085,"core::hash"],[7086,"proc_macro2"],[7087,"proc_macro"],[7088,"proc_macro2"],[7089,"core::ops::function"],[7090,"proc_macro2::extra"],[7091,"alloc::string"],[7092,"core::any"],[7093,"alloc::ffi::c_str"],[7094,"proc_macro2"],[7095,"proc_macro2"],[7096,"core::ops::function"],[7097,"core::cmp"],[7098,"core::fmt"]],"d":["The binary interface of a function: extern "C".","The + operator (addition)","The += operator","The && operator (logical and)","The <'a, T> in std::slice::iter<'a, T>.","Angle bracketed arguments of a path segment: the <K, V> in …","One arm of a match expression: 0..=10 => { return true; }.","A slice literal expression: [a, b, c, d].","A fixed size array type: [T; n].","An assignment expression: a = compute().","An equality constraint on an associated constant: the …","An equality constraint on an associated constant: the …","A binding (equality constraint) on an associated type: the …","A binding (equality constraint) on an associated type: the …","An async block: async { ... }.","Distinguishes between attributes that decorate an item and …","An attribute, like #[repr(transparent)].","An await expression: fut.await.","A bare function type: fn(usize) -> bool.","An argument in a function type: the usize in …","The variadic argument of a function pointer like …","A binary operator: +, +=, &.","A binary operation: a + b, a += b.","The & operator (bitwise and)","The &= operator","The | operator (bitwise or)","The |= operator","The ^ operator (bitwise xor)","The ^= operator","A braced block containing Rust statements.","A blocked scope: { ... }.","A boolean literal: true or false.","A set of bound lifetimes: for<'a, 'b, 'c>.","","","A break, with an optional label to break and an optional …","A byte literal: b'f'.","A byte string literal: b"foo".","A nul-terminated C-string literal: c"foo".","A function call expression: invoke(a, b).","A cast expression: foo as f64.","A character literal: 'a'.","Inclusive at the beginning and end.","A closure expression: |a, b| a + b.","A const block: const { ... }.","A const generic parameter: const LENGTH: usize.","A constant item: const MAX: u16 = 65535.","An associated constant within the definition of a trait.","An associated constant within an impl block.","A const block: const { ... }.","A const expression. Must be inside of a block.","A const generic parameter: const LENGTH: usize.","An associated type bound: Iterator<Item: Display>.","An associated type bound: Iterator<Item: Display>.","A continue, with an optional label.","The storage of a struct, enum or union data structure.","An enum input to a proc_macro_derive macro.","A struct input to a proc_macro_derive macro.","An untagged union input to a proc_macro_derive macro.","Return type is not specified.","The * operator for dereferencing","Data structure sent to a proc_macro_derive macro.","The / operator (division)","The /= operator","","An enum definition: enum Foo<A, B> { A(A), B(B) }.","The == operator (equality)","Contains the error value","Error returned when a Syn parser cannot parse the input …","A Rust expression.","Expression, with or without trailing semicolon.","A slice literal expression: [a, b, c, d].","An assignment expression: a = compute().","An async block: async { ... }.","An await expression: fut.await.","A binary operation: a + b, a += b.","A blocked scope: { ... }.","A break, with an optional label to break and an optional …","A function call expression: invoke(a, b).","A cast expression: foo as f64.","A closure expression: |a, b| a + b.","A const block: const { ... }.","A continue, with an optional label.","Access of a named struct field (obj.k) or unnamed tuple …","A for loop: for pat in expr { ... }.","An expression contained within invisible delimiters.","An if expression with an optional else block: …","A square bracketed indexing expression: vector[2].","The inferred value of a const generic argument, denoted _.","A let guard: let Some(x) = opt.","A literal in place of an expression: 1, "foo".","Conditionless loop: loop { ... }.","A macro invocation expression: format!("{}", q).","A match expression: match n { Some(n) => {}, None => {} }.","A method call expression: x.foo::<T>(a, b).","A parenthesized expression: (a + b).","A path like std::mem::replace possibly containing generic …","A range expression: 1..2, 1.., ..2, 1..=2, ..=2.","A referencing operation: &a or &mut a.","An array literal constructed from one repeated element: …","A return, with an optional value to be returned.","A struct literal expression: Point { x: 1, y: 1 }.","A try-expression: expr?.","A try block: try { ... }.","A tuple expression: (a, b, c, d).","A unary operation: !x, *x.","An unsafe block: unsafe { ... }.","A while loop: while expr { ... }.","A yield expression: yield expr.","An extern crate item: extern crate serde.","A field of a struct or enum variant.","Access of a named struct field (obj.k) or unnamed tuple …","Unused, but reserved for RFC 3323 restrictions.","A single field in a struct pattern.","A field-value pair in a struct literal.","Data stored within an enum variant or struct.","Named fields of a struct or struct variant such as …","Unnamed fields of a tuple struct or tuple variant such as …","A complete file of Rust source code.","A floating point literal: 1f64 or 1.0e10f64.","A free-standing function: …","A foreign function in an extern block.","An associated function within the definition of a trait.","An associated function within an impl block.","An argument in a function signature: the n: usize in …","A for loop: for pat in expr { ... }.","An item within an extern block.","A foreign function in an extern block.","A macro invocation within an extern block.","A foreign static item in an extern block: static ext: u8.","A foreign type in an extern block: type void.","A block of foreign items: extern "C" { ... }.","The >= operator (greater than or equal to)","An individual generic argument, like 'a, T, or Item = T.","A generic type parameter, lifetime, or const generic: …","Lifetimes and type parameters attached to a declaration of …","A glob import in a use item: *.","An expression contained within invisible delimiters.","A braced group of imports in a use item: {A, B, C}.","A type contained within invisible delimiters.","The > operator (greater than)","Inclusive at the beginning, exclusive at the end.","A word of Rust code, which may be a keyword or legal …","A pattern that binds a new variable: …","An if expression with an optional else block: …","An impl block providing trait or associated items: …","Returned by Generics::split_for_impl.","An item within an impl block.","An associated constant within an impl block.","An associated function within an impl block.","A macro invocation within an impl block.","An associated type within an impl block.","Unused, but reserved for RFC 3323 restrictions.","An impl Bound1 + Bound2 + Bound3 type where Bound is a …","The index of an unnamed tuple struct field.","A square bracketed indexing expression: vector[2].","The inferred value of a const generic argument, denoted _.","Indication that a type should be inferred by the compiler: …","An inherited visibility, which usually means private.","","An integer literal: 1 or 1u16.","Things that can appear directly inside of a module or …","An item definition.","A constant item: const MAX: u16 = 65535.","An enum definition: enum Foo<A, B> { A(A), B(B) }.","An extern crate item: extern crate serde.","A free-standing function: …","A block of foreign items: extern "C" { ... }.","An impl block providing trait or associated items: …","A macro invocation, which includes macro_rules! …","A module or module declaration: mod m or mod m { ... }.","A static item: static BIKE: Shed = Shed(42).","A struct definition: struct Foo<A> { x: A }.","A trait definition: pub trait Iterator { ... }.","A trait alias: pub trait SharableIterator = Iterator + Sync…","A type alias: …","A union definition: union Foo<A, B> { x: A, y: B }.","A use declaration: use std::collections::HashMap.","A lifetime labeling a for, while, or loop.","The <= operator (less than or equal to)","A let guard: let Some(x) = opt.","A Rust lifetime: 'a.","A lifetime parameter: 'a: 'b + 'c + 'd.","","A lifetime predicate in a where clause: 'a: 'b + 'c.","A lifetime argument.","A lifetime definition: 'a: 'b + 'c + 'd.","A structured list within an attribute, like …","A Rust literal such as a string or integer or boolean.","A literal in place of an expression: 1, "foo".","A literal pattern: 0.","A boolean literal: true or false.","A byte literal: b'f'.","A byte string literal: b"foo".","A nul-terminated C-string literal: c"foo".","A character literal: 'a'.","A floating point literal: 1f64 or 1.0e10f64.","An integer literal: 1 or 1u16.","A UTF-8 string literal: "foo".","A local let binding: let x: u64 = s.parse()?.","A local (let) binding.","The expression assigned in a local let binding, including …","Conditionless loop: loop { ... }.","The < operator (less than)","A macro invocation: println!("{}", mac).","A macro invocation expression: format!("{}", q).","A macro invocation, which includes macro_rules! …","A macro invocation within an extern block.","A macro invocation within the definition of a trait.","A macro invocation within an impl block.","A macro in pattern position.","A macro invocation in statement position.","A macro in the type position.","A grouping token that surrounds a macro body: m!(...) or …","A match expression: match n { Some(n) => {}, None => {} }.","","A struct or tuple struct field accessed in a struct …","Content of a compile-time structured attribute.","A structured list within an attribute, like …","A name-value pair within an attribute, like …","A method call expression: x.foo::<T>(a, b).","A module or module declaration: mod m or mod m { ... }.","The * operator (multiplication)","The *= operator","","An identifier imported by a use item: HashMap.","A name-value pair within an attribute, like …","Named fields of a struct or struct variant such as …","A named field like self.x.","The != operator (not equal to)","The - operator for negation","The never type: !.","","","","","The ! operator for logical inversion","Contains the success value","The || operator (logical or)","A pattern that matches any one of a set of cases.","","An unspecified invalid expression.","A parenthesized expression: (a + b).","","A parenthesized pattern: (A | B).","A parenthesized type equivalent to the inner type.","The (A, B) -> C in Fn(A, B) -> C.","Arguments of a function path segment: the (A, B) -> C in …","A pattern in a local binding, function signature, match …","A const block: const { ... }.","A pattern that binds a new variable: …","A literal in place of an expression: 1, "foo".","A macro invocation expression: format!("{}", q).","A pattern that matches any one of a set of cases.","A parenthesized pattern: (A | B).","A path like std::mem::replace possibly containing generic …","A range expression: 1..2, 1.., ..2, 1..=2, ..=2.","A reference pattern: &mut var.","The dots in a tuple or slice pattern: [0, 1, ..].","A dynamically sized slice pattern: [a, b, ref i @ .., y, z]…","A struct or struct variant pattern: Variant { x, y, .. }.","A tuple pattern: (a, b).","A tuple struct or tuple variant pattern: …","A type ascription pattern: foo: f64.","A pattern that matches any value: _.","A path at which a named item is exported (e.g. …","","A path like std::mem::replace possibly containing generic …","A path prefix of imports in a use item: std::....","A path pattern like Color::Red, optionally qualified with a","A path like std::slice::Iter, optionally qualified with a …","Angle bracketed or parenthesized arguments of a path …","A segment of a path together with any path arguments on …","A lifetime predicate in a where clause: 'a: 'b + 'c.","A type predicate in a where clause: …","A raw pointer type: *const T or *mut T.","A public visibility level: pub.","The explicit Self type in a qualified path: the T in …","A range expression: 1..2, 1.., ..2, 1..=2, ..=2.","A range pattern: 1..=2.","Limit types of a range, inclusive or exclusive.","The self argument of an associated method.","The self argument of an associated method.","A referencing operation: &a or &mut a.","A reference pattern: &mut var.","A reference type: &'a T or &'a mut T.","The % operator (modulus)","The %= operator","An renamed identifier imported by a use item: …","An array literal constructed from one repeated element: …","The dots in a tuple or slice pattern: [0, 1, ..].","A visibility level restricted to some path: pub(self) or …","The result of a Syn parser.","A return, with an optional value to be returned.","Return type of a function signature.","The << operator (shift left)","The <<= operator","The >> operator (shift right)","The >>= operator","A function signature in a trait or implementation: …","A dynamically sized slice pattern: [a, b, ref i @ .., y, z]…","A dynamically sized slice type: [T].","A static item: static BIKE: Shed = Shed(42).","A foreign static item in an extern block: static ext: u8.","The mutability of an Item::Static or ForeignItem::Static.","A statement, usually ending in a semicolon.","A macro invocation in statement position.","A UTF-8 string literal: "foo".","","A struct literal expression: Point { x: 1, y: 1 }.","A struct definition: struct Foo<A> { x: A }.","A struct or struct variant pattern: Variant { x, y, .. }.","The - operator (subtraction)","The -= operator","A type-macro that expands to the name of the Rust type …","","A trait definition: pub trait Iterator { ... }.","A trait alias: pub trait SharableIterator = Iterator + Sync…","A trait used as a bound on a type parameter.","A modifier on a trait bound, currently only used for the ? …","An item declaration within the definition of a trait.","An associated constant within the definition of a trait.","An associated function within the definition of a trait.","A macro invocation within the definition of a trait.","An associated type within the definition of a trait.","A trait object type dyn Bound1 + Bound2 + Bound3 where …","A try-expression: expr?.","A try block: try { ... }.","A tuple expression: (a, b, c, d).","A tuple pattern: (a, b).","A tuple type: (A, B, C, String).","A tuple struct or tuple variant pattern: …","Returned by TypeGenerics::as_turbofish.","The possible types that a Rust value could have.","A generic type parameter: T: Into<String>.","A type predicate in a where clause: …","A type alias: …","A foreign type in an extern block: type void.","An associated type within the definition of a trait.","An associated type within an impl block.","A type ascription pattern: foo: f64.","A type argument.","A particular type is returned.","A fixed size array type: [T; n].","A bare function type: fn(usize) -> bool.","Returned by Generics::split_for_impl.","A type contained within invisible delimiters.","An impl Bound1 + Bound2 + Bound3 type where Bound is a …","Indication that a type should be inferred by the compiler: …","A macro in the type position.","The never type: !.","A generic type parameter: T: Into<String>.","A trait or lifetime used as a bound on a type parameter.","A parenthesized type equivalent to the inner type.","A path like std::slice::Iter, optionally qualified with a …","A raw pointer type: *const T or *mut T.","A reference type: &'a T or &'a mut T.","A dynamically sized slice type: [T].","A trait object type dyn Bound1 + Bound2 + Bound3 where …","A tuple type: (A, B, C, String).","A function argument accepted by pattern and type.","A unary operator: *, !, -.","A unary operation: !x, *x.","","A union definition: union Foo<A, B> { x: A, y: B }.","Unit struct or unit variant such as None.","Unnamed fields of a tuple struct or tuple variant such as …","An unnamed field like self.0.","An unsafe block: unsafe { ... }.","A use declaration: use std::collections::HashMap.","A glob import in a use item: *.","A braced group of imports in a use item: {A, B, C}.","An identifier imported by a use item: HashMap.","A path prefix of imports in a use item: std::....","An renamed identifier imported by a use item: …","A suffix of an import tree in a use item: Type as Renamed …","The variadic argument of a foreign function.","An enum variant.","Tokens in expression position not interpreted by Syn.","","Tokens forming an item not interpreted by Syn.","Tokens in an extern block not interpreted by Syn.","Tokens within the definition of a trait not interpreted by …","Tokens within an impl block not interpreted by Syn.","A raw token literal not interpreted by Syn.","Tokens in pattern position not interpreted by Syn.","Tokens in type position not interpreted by Syn.","A visibility level restricted to some path: pub(self) or …","The visibility level of an item: inherited or pub or …","A where clause in a definition: …","A single predicate in a where clause: T: Deserialize<'de>.","A while loop: while expr { ... }.","A pattern that matches any value: _.","A yield expression: yield expr.","","","","","","","","","","","","","","","","Turn a type’s generics like <X, Y> into a turbofish like …","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","Parses the literal into a selected number type.","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","The type being bounded","","","","Trait and lifetime bounds (Clone+Send+'static)","","","","","","","","","","","","","","","","","Parse a set of curly braces and expose their content to …","","","","","","","","Parse a set of square brackets and expose their content to …","","A stably addressed token buffer supporting efficient …","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","The colon in Struct { x: x }. If written in shorthand like …","","","","","","","","","","","","","","","","","","","","","","","Returns an Iterator<Item = &ConstParam> over the constant …","Returns an Iterator<Item = &mut ConstParam> over the …","","","","","","","","","","","","","Define a type that supports parsing and printing a given …","Define a type that supports parsing and printing a …","","","","","","","","","","","","","","","","Explicit discriminant: Variant = 1","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","Extension traits to provide parsing methods on foreign …","","","","Content stored in the variant.","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","Returns the argument unchanged.","","","","","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","","","","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","","","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","","","Returns the argument unchanged.","","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","","","","Returns the argument unchanged.","Returns the argument unchanged.","","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","","","","Returns the argument unchanged.","Returns the argument unchanged.","","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","","","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","","Returns the argument unchanged.","","Returns the argument unchanged.","Returns the argument unchanged.","","","Returns the argument unchanged.","","","","","","","","","","","","","","","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","","","","","Returns the argument unchanged.","","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","","Returns the argument unchanged.","","","","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","","","","","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","","","","","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","","","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","","Returns the argument unchanged.","","","","","","","","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","","","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","","","","","","","","","","","","Returns the argument unchanged.","","","","","","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","","","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","","","","","","","","","","","","","Returns the argument unchanged.","","","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","","","","","","","","","","","","","","","","","","","","If this path consists of a single ident, returns the ident.","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","Name of the variant.","Name of the field, if any.","","","","","","","The example in macro_rules! example { ... }.","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","(A, B)","","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","","","","Returns true if there are zero fields.","","Determines whether this is a path of length 1 equal to the …","","","","","","","Get an iterator over the borrowed Field items in this …","Get an iterator over the mutably borrowed Field items in …","","","","","","","","","","","","Returns the number of fields.","","","","","","","","","Returns an Iterator<Item = &LifetimeParam> over the …","","","The for<'a> in for<'a> Foo<&'a T>","Any lifetimes from a for binding","","Returns an Iterator<Item = &mut LifetimeParam> over the …","","","","","","","","","","","","","","","","","","Initializes an empty where-clause if there is not one …","","","","","Facility for interpreting structured content inside of an …","","","","","","","","","","","","","","","","","","","","Creates a new Ident with the given string as well as the …","Panics","","Interpret a Syn literal from a proc-macro2 literal.","","","","","","","","","Same as Ident::new, but creates a raw identifier (r#ident…","","","","","","","C","","","","","","","","","","","","","","","","","","Parse a set of parentheses and expose their content to …","Parsing interface for parsing a token stream into a syntax …","Parse tokens of source code into the chosen syntax tree …","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","Parse a syntax tree node from the content of this string …","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","Parse a proc-macro2 token stream into the chosen syntax …","","Parse the arguments to the attribute as a syntax tree.","See Attribute::parse_args.","Parse the arguments to the attribute using the given …","See Attribute::parse_args_with.","Parse the tokens within the macro invocation’s …","Parse the tokens within the macro invocation’s …","Parse the content of a file of Rust code.","Parses zero or more inner attributes from the stream.","Parse the input TokenStream of a macro, triggering a …","Parse a Path containing no path arguments on any of its …","Parse a pattern, possibly involving |, but not a leading |.","Parse a pattern, possibly involving |, possibly including a","Parses a named (braced struct) field.","Parse the arguments to the attribute, expecting it to …","See Attribute::parse_nested_meta.","Parses zero or more outer attributes from the stream.","Quasi-quotation macro that accepts input like the quote! …","This macro is parse_quote! + quote_spanned!.","Parse a pattern that does not involve | at the top level.","Parse a string of Rust code into the chosen syntax tree …","Parse ::<…> with mandatory leading ::.","Parses an unnamed (tuple struct) field.","Invoke parser on the content of this string literal.","An alternative to the primary Expr::parse parser (from the …","Parse the body of a block as zero or more statements, …","An alternative to the primary Expr::parse parser (from the …","","","","","","","","","","","","Returns the path that identifies the interpretation of …","Returns the path that begins this structured meta item.","","","","","","The Foo<&'a T> in for<'a> Foo<&'a T>","","","","","","","","","","A punctuated sequence of syntax tree nodes separated by …","","","","","","","","A method’s self receiver, such as &self or …","","","","","An error if this path is not a single ident, as defined in …","Error if this is a Meta::Path or Meta::NameValue.","Error if this is a Meta::Path or Meta::List.","Error if this is a Meta::List or Meta::NameValue.","","","","","","","","","The Self type of the impl.","","","","","","","","","","","","","","","","","","","","","","","","","","Configures the span of this Ident, possibly changing its …","","","","","","","","","","","","","","","","","","Returns the span of this Ident.","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","A trait that can provide the Span of the complete contents …","Split a type’s generics into the pieces required for impl…","","","","","","","Statements in a block","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","Tokens representing Rust punctuation, keywords, and …","","","","","","","","","","","Trait this impl implements.","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","Returns an Iterator<Item = &TypeParam> over the type …","Returns an Iterator<Item = &mut TypeParam> over the type …","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","Syntax tree traversal to mutate an exclusive borrow of a …","","","","In some positions, types may not contain the + character, …","","","","","A cheaply copyable cursor into a TokenBuffer.","A buffer that can be efficiently traversed multiple times, …","Creates a cursor referencing the first token in the buffer …","","","","","","","Creates a cursor referencing a static empty TokenStream.","Checks whether the cursor is currently pointing at the end …","","Returns the argument unchanged.","Returns the argument unchanged.","If the cursor is pointing at a Group with the given …","If the cursor is pointing at a Ident, returns it along …","Calls U::from(self).","Calls U::from(self).","If the cursor is pointing at a Lifetime, returns it along …","If the cursor is pointing at a Literal, return it along …","Creates a TokenBuffer containing all the tokens from the …","Creates a TokenBuffer containing all the tokens from the …","","If the cursor is pointing at a Punct, returns it along …","Returns the Span of the current token, or Span::call_site()…","","Copies all remaining tokens visible from this cursor into a","If the cursor is pointing at a TokenTree, returns it along …","","","","","","","Additional methods for Ident not provided by proc-macro2 …","Parses any identifier including keywords.","Peeks any identifier including keywords. Usage: …","Strips the raw marker r#, if any, from the beginning of an …","Context for parsing a single property in the conventional …","","","Report that the attribute’s content did not conform to …","Returns the argument unchanged.","","Calls U::from(self).","Used when parsing list(...) syntax if the content inside …","Make a parser that is usable with parse_macro_input! in a …","","","","","Used when parsing key = "value" syntax.","Contains the error value","Error returned when a Syn parser cannot parse the input …","Support for checking the next token in a stream to decide …","An empty syntax tree node that consumes no tokens when …","Contains the success value","","Parsing interface implemented by all types that can be …","Cursor position within a buffered token stream.","Input to a Syn parser function.","Parser that can parse Rust tokens into a particular syntax …","Types that can be parsed by looking at just one token.","The result of a Syn parser.","Cursor state associated with speculative parsing.","","","","","","","","","","","","Calls the given parser function to parse a syntax tree …","","","","","","","Add another error message to self such that when …","Provides low-level access to the token representation …","","Extensions to the parsing API with niche applicability.","","","Triggers an error at the current position of the parse …","Triggers an error at the current position of the parse …","Triggers an error at the current position of the parse …","","","","","","","Forks a parse stream so that parsing tokens out of either …","Returns the argument unchanged.","","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Render the error as an invocation of compile_error!.","","","Returns whether there are tokens remaining in this stream.","Constructs a helper for peeking at the next token in this …","Usually the ParseStream::error method will be used …","Creates an error with the specified message spanning the …","","Parses a syntax tree node of type T, advancing the …","Parse tokens of source code into the chosen syntax tree …","","Parse a proc-macro2 token stream into the chosen syntax …","","Parse a string of Rust code into the chosen syntax tree …","Parses zero or more occurrences of T separated by …","Looks at the next token in the parse stream to determine …","Looks at the next token in the parse stream to determine …","Looks at the second-next token in the parse stream.","Looks at the third-next token in the parse stream.","The source location of the error.","Returns the Span of the next token in the parse stream, or …","","Speculatively parses tokens from this parse stream, …","Render the error as an invocation of compile_error!.","","","","","","","","","","","","","","","","","","","","","","Extensions to the ParseStream API to support manipulating …","Extensions to the ParseStream API to support speculative …","Advance this parse stream to the position of a forked …","Returns the delimiter, the span of the delimiter token, …","","An iterator over owned values of type T.","An iterator over owned pairs of type Pair<T, P>.","An iterator over borrowed values of type &T.","An iterator over mutably borrowed values of type &mut T.","A single syntax tree node of type T followed by its …","An iterator over borrowed pairs of type Pair<&T, &P>.","An iterator over mutably borrowed pairs of type …","A punctuated sequence of syntax tree nodes of type T …","","","","","","","","","","","","","","","","","","Clears the sequence of all values and punctuation, making …","","","","","","","","","","","","","","","","Returns true if either this Punctuated is empty, or it has …","","","","Borrows the first element in this sequence.","Mutably borrows the first element in this sequence.","","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","","","","","","Inserts an element at position index.","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","","","","","","","","","","Returns an iterator over the contents of this sequence as …","Produces this punctuated pair as a tuple of syntax tree …","Extracts the syntax tree node from this punctuated pair, …","Determines whether this punctuated sequence is empty, …","Returns an iterator over borrowed syntax tree nodes of …","Returns an iterator over mutably borrowed syntax tree …","Borrows the last element in this sequence.","Mutably borrows the last element in this sequence.","Returns the number of syntax tree nodes in this punctuated …","","","","","","","Creates an empty punctuated sequence.","Creates a punctuated pair out of a syntax tree node and an …","","","","","","","","","","","","","Returns an iterator over the contents of this sequence as …","Returns an iterator over the contents of this sequence as …","Parses one or more occurrences of T separated by …","Parses one or more occurrences of T using the given parse …","Parses zero or more occurrences of T separated by …","Parses zero or more occurrences of T using the given parse …","Removes the last punctuated pair from this sequence, or …","Removes the trailing punctuation from this punctuated …","Borrows the punctuation from this punctuated pair, unless …","Mutably borrows the punctuation from this punctuated pair, …","Appends a syntax tree node onto the end of this punctuated …","Appends a trailing punctuation onto the end of this …","Appends a syntax tree node onto the end of this punctuated …","","","","","","","","","","","","","","","","","Determines whether this punctuated sequence ends with a …","","","","","","","","","","","","","","","","","","","","","","","","","Borrows the syntax tree node from this punctuated pair.","Mutably borrows the syntax tree node from this punctuated …","A trait that can provide the Span of the complete contents …","Returns a Span covering the complete contents of this …","abstract","&","&&","&=","as","async","@","auto","await","become","box","{…}","[…]","break","^","^=",":",",","const","continue","crate","default","do","$",".","..","...","..=","dyn","else","enum","=","==","extern","=>","final","fn","for",">=","None-delimited group",">","if","impl","in","<-","<=","let","loop","<","macro","match","-","-=","mod","move","mut","!=","!","|","|=","||","override","(…)","::","%","%=","+","+=","#","priv","pub","?","->","ref","return","Self","self",";","<<","<<=",">>",">>=","/","/=","*","*=","static","struct","super","~","Marker trait for types that represent single tokens.","trait","try","type","typeof","_","union","unsafe","unsized","use","virtual","where","while","yield","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","Syntax tree traversal to mutate an exclusive borrow of a …","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","",""],"i":[0,137,137,137,154,0,0,26,170,26,0,155,0,155,26,0,0,26,170,0,0,0,26,137,137,137,137,137,137,0,26,128,0,136,136,26,128,128,128,26,26,128,70,26,26,73,85,112,117,139,155,0,0,155,26,0,0,0,0,188,138,0,137,137,22,85,137,6,0,0,166,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,85,0,26,0,0,0,0,0,0,0,128,85,107,112,117,0,26,0,0,0,0,0,85,137,0,0,0,101,26,101,170,137,70,0,139,26,85,0,0,0,0,0,0,0,170,0,26,26,170,162,12,128,0,166,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,137,26,0,73,78,82,155,0,13,0,26,139,0,0,0,0,0,0,0,0,0,166,0,26,137,0,26,85,107,112,117,139,166,170,0,26,80,0,0,0,0,26,85,137,137,126,101,13,17,65,137,138,170,80,126,154,164,138,6,137,139,12,26,26,136,139,170,154,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,13,26,101,139,170,0,0,0,0,170,162,0,26,139,0,0,123,26,139,170,137,137,101,26,139,162,0,26,0,137,137,137,137,0,139,170,85,107,0,0,0,128,22,26,85,139,137,137,0,78,85,85,0,0,0,0,0,0,0,170,26,26,26,139,170,139,0,0,73,82,85,107,112,117,139,155,188,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,123,0,26,22,85,17,17,65,26,85,0,0,0,0,0,0,0,0,26,78,85,107,112,117,128,139,170,0,0,0,0,26,139,26,90,122,172,54,143,181,10,34,50,156,153,49,35,104,161,1,29,36,122,16,20,21,27,28,29,30,31,32,33,34,35,36,37,37,38,39,40,41,42,43,44,45,46,46,47,48,48,49,50,51,52,52,53,53,54,55,56,57,58,59,60,61,62,63,64,67,69,71,74,75,76,86,87,88,89,90,91,92,93,94,95,96,97,98,99,100,108,109,110,111,113,114,115,116,118,119,120,121,124,125,140,141,142,143,144,145,146,147,148,149,150,151,167,169,186,187,96,30,135,177,30,39,3,5,3,5,29,32,37,37,59,62,89,119,36,40,47,63,69,8,9,1,2,10,11,12,13,14,15,16,17,18,19,20,21,22,23,24,25,26,27,28,29,30,31,32,33,34,35,36,37,38,39,40,41,42,43,44,45,46,47,48,49,50,51,52,53,54,55,56,57,58,59,60,61,62,63,64,65,66,67,68,69,70,71,72,73,74,75,76,77,78,79,80,81,82,83,84,85,86,87,88,89,90,91,92,93,94,95,96,97,98,99,100,101,102,103,104,105,106,107,108,109,110,111,112,113,114,115,116,117,118,119,120,121,122,123,124,125,126,127,128,129,130,131,132,133,3,5,134,135,136,137,138,139,140,141,142,143,144,145,146,147,148,149,150,151,152,153,154,155,156,157,158,159,160,161,162,163,164,165,166,167,168,169,170,171,172,173,174,175,176,177,178,179,180,181,182,183,184,185,186,187,188,8,9,1,2,10,11,12,13,14,15,16,17,18,19,20,21,22,23,24,25,26,27,28,29,30,31,32,33,34,35,36,37,38,39,40,41,42,43,44,45,46,47,48,49,50,51,52,53,54,55,56,57,58,59,60,61,62,63,64,65,66,67,68,69,70,71,72,73,74,75,76,77,78,79,80,81,82,83,84,85,86,87,88,89,90,91,92,93,94,95,96,97,98,99,100,101,102,103,104,105,106,107,108,109,110,111,112,113,114,115,116,117,118,119,120,121,122,123,124,125,126,127,128,129,130,131,132,133,3,5,134,135,136,137,138,139,140,141,142,143,144,145,146,147,148,149,150,151,152,153,154,155,156,157,158,159,160,161,162,163,164,165,166,167,168,169,170,171,172,173,174,175,176,177,178,179,180,181,182,183,184,185,186,187,188,84,74,75,83,84,97,115,159,174,183,18,24,49,57,87,90,91,96,106,146,165,0,11,27,43,55,145,171,182,0,33,0,140,29,36,141,8,9,1,2,10,11,12,13,14,15,16,17,18,19,20,21,22,23,24,25,26,27,28,29,30,31,32,33,34,35,36,37,38,39,40,41,42,43,44,45,46,47,48,49,50,51,52,53,54,55,56,57,58,59,60,61,62,63,64,65,66,67,68,69,70,71,72,73,74,75,76,77,78,79,80,81,82,83,84,85,86,87,88,89,90,91,92,93,94,95,96,97,98,99,100,101,102,103,104,105,106,107,108,109,110,111,112,113,114,115,116,117,118,119,120,121,122,123,124,125,126,127,128,129,130,131,132,133,3,5,134,135,136,137,138,139,140,141,142,143,144,145,146,147,148,149,150,151,152,153,154,155,156,157,158,159,160,161,162,163,164,165,166,167,168,169,170,171,172,173,174,175,176,177,178,179,180,181,182,183,184,185,186,187,188,8,9,1,2,10,11,12,13,14,15,16,17,18,19,20,21,22,23,24,25,26,27,28,29,30,31,32,33,34,35,36,37,38,39,40,41,42,43,44,45,46,47,48,49,50,51,52,53,54,55,56,57,58,59,60,61,62,63,64,65,66,67,68,69,70,71,72,73,74,75,76,77,78,79,80,81,82,83,84,85,86,87,88,89,90,91,92,93,94,95,96,97,98,99,100,101,102,103,104,105,106,107,108,109,110,111,112,113,114,115,116,117,118,119,120,121,122,123,124,125,126,127,128,129,130,131,132,133,3,5,134,135,136,137,138,139,140,141,142,143,144,145,146,147,148,149,150,151,152,153,154,155,156,157,158,159,160,161,162,163,164,165,166,167,168,169,170,171,172,173,174,175,176,177,178,179,180,181,182,183,184,185,186,187,188,8,10,102,156,20,67,68,74,75,76,83,84,86,94,96,109,113,115,118,124,149,151,159,69,125,187,42,63,72,72,37,37,76,86,113,118,180,36,122,93,38,88,0,0,21,72,77,154,75,76,113,114,115,91,118,119,120,14,135,16,168,57,144,30,39,50,125,187,183,171,173,178,180,181,182,27,60,145,147,148,184,42,53,53,24,87,8,8,9,1,2,10,11,12,13,14,15,16,17,18,19,20,21,22,23,24,25,26,27,28,29,30,31,32,33,34,35,36,37,38,39,40,41,42,43,44,45,46,47,48,49,50,51,52,53,54,55,56,57,58,59,60,61,62,63,64,65,66,67,68,69,70,71,72,73,74,75,76,77,78,79,80,81,82,83,84,85,86,87,88,89,90,91,92,93,94,95,96,97,98,99,100,101,102,103,104,105,106,107,108,109,110,111,112,113,114,115,116,117,118,119,120,121,122,123,124,125,126,127,128,129,130,131,132,133,3,5,134,135,136,137,138,139,140,141,142,143,144,145,146,147,148,149,150,151,152,153,154,155,156,157,158,159,160,161,162,163,164,165,166,167,168,169,170,171,172,173,174,175,176,177,178,179,180,181,182,183,184,185,186,187,188,15,28,45,75,76,86,94,97,98,118,120,157,158,168,33,35,40,41,43,45,49,51,54,55,56,58,61,64,67,86,94,118,168,0,88,185,69,16,23,25,57,95,99,146,8,8,8,9,1,2,10,10,11,12,13,14,15,16,17,18,19,20,21,22,23,24,25,26,27,28,29,30,31,32,33,34,35,36,37,38,39,40,41,42,43,44,45,46,47,48,49,50,51,52,53,54,55,56,57,58,59,60,61,62,63,64,65,65,66,66,67,68,69,70,71,72,73,74,75,76,77,78,79,80,81,82,83,84,85,86,87,88,89,90,91,92,93,94,95,96,97,98,99,100,101,102,103,104,105,106,107,108,109,110,111,112,113,114,115,116,117,118,119,120,121,122,123,124,125,126,127,128,129,130,131,132,133,3,3,5,5,134,135,136,137,138,139,140,141,142,143,144,145,146,147,148,149,150,151,152,153,154,155,156,157,158,159,160,161,162,163,164,165,166,167,168,169,170,171,172,173,174,175,176,177,178,179,180,181,182,183,184,185,186,187,188,122,172,40,77,8,8,8,8,8,8,8,9,1,2,10,11,12,13,13,13,13,14,15,16,17,17,17,18,19,20,21,21,21,21,22,23,24,25,26,26,26,26,26,26,26,26,26,26,26,26,26,26,26,26,26,26,26,26,26,26,26,26,26,26,26,26,26,26,26,26,26,26,26,26,26,26,26,27,28,29,30,31,32,33,34,35,36,37,38,39,40,41,42,43,44,45,46,47,48,49,50,51,52,53,54,55,56,57,58,59,60,61,62,63,64,65,65,65,65,66,66,67,68,69,70,71,72,73,73,73,73,74,75,75,76,77,78,78,78,79,80,81,82,82,82,83,84,85,85,85,85,85,85,85,85,85,85,85,85,85,85,85,85,85,86,87,88,89,90,91,92,93,94,95,96,97,98,99,100,101,101,101,101,101,101,102,103,104,105,106,107,107,107,107,107,108,109,110,111,112,112,112,112,112,113,114,115,116,117,117,117,117,117,118,119,120,121,122,123,123,123,124,125,126,127,128,128,128,128,128,128,128,128,128,129,130,131,132,133,3,3,5,5,134,135,136,137,138,139,139,139,139,139,139,139,139,139,139,139,139,139,139,139,139,139,140,141,142,143,144,145,146,147,148,149,150,151,152,152,153,153,154,155,156,157,158,159,160,161,162,163,164,165,166,167,168,169,170,170,170,170,170,170,170,170,170,170,170,170,170,170,170,171,172,173,174,175,176,177,178,179,180,181,182,183,184,185,186,187,188,34,21,86,87,91,95,96,97,98,99,110,113,115,118,120,122,157,158,159,152,41,173,72,77,156,161,69,8,9,1,2,10,11,12,13,14,15,16,17,18,19,20,21,22,23,24,25,26,27,28,29,30,31,32,33,34,35,36,37,38,39,40,41,42,43,44,45,46,47,48,49,50,51,52,53,54,55,56,57,58,59,60,61,62,63,64,65,66,67,68,69,70,71,72,73,74,75,76,77,78,79,80,81,82,83,84,85,86,87,88,89,90,91,92,93,94,95,96,97,98,99,100,101,102,103,104,105,106,107,108,109,110,111,112,113,114,115,116,117,118,119,120,121,122,123,124,125,126,127,128,129,130,131,132,133,3,5,134,135,136,137,138,139,140,141,142,143,144,145,146,147,148,149,150,151,152,153,154,155,156,157,158,159,160,161,162,163,164,165,166,167,168,169,170,171,172,173,174,175,176,177,178,179,180,181,182,183,184,185,186,187,188,10,16,20,21,75,76,86,87,88,92,93,94,95,96,97,98,99,102,103,104,109,110,113,115,118,120,122,140,153,157,158,159,42,91,174,40,163,43,66,167,36,122,160,172,8,9,1,2,10,11,12,13,14,15,16,17,18,19,20,21,22,23,24,25,26,27,28,29,30,31,32,33,34,35,36,37,38,39,40,41,42,43,44,45,46,47,48,49,50,51,52,53,54,55,56,57,58,59,60,61,62,63,64,65,66,67,68,69,70,71,72,73,74,75,76,77,78,79,80,81,82,83,84,85,86,87,88,89,90,91,92,93,94,95,96,97,98,99,100,101,102,103,104,105,106,107,108,109,110,111,112,113,114,115,116,117,118,119,120,121,122,123,124,125,126,127,128,129,130,131,132,133,3,5,134,135,136,137,138,139,140,141,142,143,144,145,146,147,148,149,150,151,152,153,154,155,156,157,158,159,160,161,162,163,164,165,166,167,168,169,170,171,172,173,174,175,176,177,178,179,180,181,182,183,184,185,186,187,188,17,17,17,17,154,152,154,71,90,91,96,106,17,17,32,33,38,40,47,63,100,152,141,28,31,17,55,171,45,167,124,74,83,181,72,36,77,79,84,172,72,53,53,46,46,47,72,77,156,161,48,48,92,111,116,121,169,176,72,49,39,67,151,0,11,50,93,79,36,20,54,94,109,124,140,143,180,181,68,185,186,187,18,8,10,74,128,129,130,131,132,133,3,5,134,8,31,61,36,36,36,122,160,172,72,19,34,50,51,60,79,122,142,147,148,160,163,172,178,184,0,0,0,8,10,13,14,15,16,18,19,21,26,27,28,29,30,31,32,33,34,35,36,37,38,39,40,42,43,44,45,46,47,48,49,50,51,52,53,54,55,56,57,58,59,60,61,62,63,64,65,66,67,68,69,70,71,72,73,74,75,76,77,78,79,80,81,82,85,86,87,88,89,90,91,92,93,94,95,96,97,98,99,100,101,107,108,109,110,111,112,113,114,115,116,117,118,119,120,121,122,123,124,126,128,129,129,130,131,132,133,3,5,134,135,137,138,149,152,153,155,156,160,162,165,166,170,171,172,173,174,175,176,177,178,179,180,181,182,183,184,185,186,188,0,8,11,14,11,14,135,135,0,11,0,152,139,139,20,11,14,11,0,0,139,0,156,20,129,26,165,26,8,10,40,45,69,125,142,143,149,151,167,11,13,14,15,52,52,57,79,135,146,148,163,179,161,11,81,163,0,52,52,57,146,148,179,58,122,50,124,88,104,152,13,13,13,57,146,96,56,28,31,152,124,91,93,23,55,86,88,92,94,95,97,98,100,108,109,110,111,113,114,115,116,118,120,121,167,169,171,8,10,128,129,130,131,132,133,3,5,134,71,89,108,114,119,8,8,8,9,1,2,10,10,11,13,14,15,16,17,18,19,20,21,26,27,28,29,30,31,32,33,34,35,36,37,38,39,40,41,42,43,44,45,46,47,48,49,50,51,52,53,54,55,56,57,58,59,60,61,62,63,64,65,65,66,66,67,68,69,70,71,72,73,74,75,76,77,78,79,80,81,82,83,84,85,86,87,88,89,90,91,92,93,94,95,96,97,98,99,100,101,102,103,104,105,106,107,108,109,110,111,112,113,114,115,116,117,118,119,120,121,122,123,124,125,126,128,128,129,129,130,130,131,131,132,132,133,133,3,3,5,5,134,134,135,136,137,138,139,140,141,142,143,144,145,146,147,148,149,150,151,152,153,154,155,156,157,158,159,160,161,162,163,165,166,167,169,170,171,172,173,174,175,176,177,178,179,180,181,182,183,184,185,186,187,188,66,134,0,72,105,180,53,53,94,109,165,23,95,11,140,128,129,130,131,132,133,3,5,96,42,8,9,1,2,10,11,12,13,14,15,16,17,18,19,20,21,22,23,24,25,26,27,28,29,30,31,32,33,34,35,36,37,38,39,40,41,42,43,44,45,46,47,48,49,50,51,52,53,54,55,56,57,58,59,60,61,62,63,64,65,66,67,68,69,70,71,72,73,74,75,76,77,78,79,80,81,82,83,84,85,86,87,88,89,90,91,92,93,94,95,96,97,98,99,100,101,102,103,104,105,106,107,108,109,110,111,112,113,114,115,116,117,118,119,120,121,122,123,124,125,126,127,128,129,130,131,132,133,3,5,134,135,136,137,138,139,140,141,142,143,144,145,146,147,148,149,150,151,152,153,154,155,156,157,158,159,160,161,162,163,164,165,166,167,168,169,170,171,172,173,174,175,176,177,178,179,180,181,182,183,184,185,186,187,188,8,10,3,5,8,9,1,2,10,11,13,14,15,16,17,18,19,20,21,26,27,28,29,30,31,32,33,34,35,36,37,38,39,40,41,42,43,44,45,46,47,48,49,50,51,52,53,54,55,56,57,58,59,60,61,62,63,64,65,66,67,68,69,70,71,72,73,74,75,76,77,78,79,80,81,82,83,84,85,86,87,88,89,90,91,92,93,94,95,96,97,98,99,100,101,102,103,104,105,106,107,108,109,110,111,112,113,114,115,116,117,118,119,120,121,122,123,124,125,126,128,129,130,131,132,133,3,5,134,135,137,138,139,140,141,142,143,144,145,146,147,148,149,150,151,152,153,154,155,156,157,158,159,160,162,163,165,166,167,169,170,171,172,173,174,175,176,177,178,179,180,181,182,183,184,185,186,187,188,0,129,130,131,132,133,3,5,134,14,135,91,96,97,100,102,8,9,1,2,10,11,12,13,14,15,16,17,18,19,20,21,22,23,24,25,26,27,28,29,30,31,32,33,34,35,36,37,38,39,40,41,42,43,44,45,46,47,48,49,50,51,52,53,54,55,56,57,58,59,60,61,62,63,64,65,66,67,68,69,70,71,72,73,74,75,76,77,78,79,80,81,82,83,84,85,86,87,88,89,90,91,92,93,94,95,96,97,98,99,100,101,102,103,104,105,106,107,108,109,110,111,112,113,114,115,116,117,118,119,120,121,122,123,124,125,126,127,128,129,130,131,132,133,3,5,134,135,136,137,138,139,140,141,142,143,144,145,146,147,148,149,150,151,152,153,154,155,156,157,158,159,160,161,162,163,164,165,166,167,168,169,170,171,172,173,174,175,176,177,178,179,180,181,182,183,184,185,186,187,188,8,9,1,2,10,11,12,13,14,15,16,17,18,19,20,21,22,23,24,25,26,27,28,29,30,31,32,33,34,35,36,37,38,39,40,41,42,43,44,45,46,47,48,49,50,51,52,53,54,55,56,57,58,59,60,61,62,63,64,65,66,67,68,69,70,71,72,73,74,75,76,77,78,79,80,81,82,83,84,85,86,87,88,89,90,91,92,93,94,95,96,97,98,99,100,101,102,103,104,105,106,107,108,109,110,111,112,113,114,115,116,117,118,119,120,121,122,123,124,125,126,127,128,129,130,131,132,133,3,5,134,135,136,137,138,139,140,141,142,143,144,145,146,147,148,149,150,151,152,153,154,155,156,157,158,159,160,161,162,163,164,165,166,167,168,169,170,171,172,173,174,175,176,177,178,179,180,181,182,183,184,185,186,187,188,59,50,20,35,76,86,94,98,109,113,118,120,124,149,157,161,186,8,9,1,2,10,11,12,13,14,15,16,17,18,19,20,21,22,23,24,25,26,27,28,29,30,31,32,33,34,35,36,37,38,39,40,41,42,43,44,45,46,47,48,49,50,51,52,53,54,55,56,57,58,59,60,61,62,63,64,65,66,67,68,69,70,71,72,73,74,75,76,77,78,79,80,81,82,83,84,85,86,87,88,89,90,91,92,93,94,95,96,97,98,99,100,101,102,103,104,105,106,107,108,109,110,111,112,113,114,115,116,117,118,119,120,121,122,123,124,125,126,127,128,129,130,131,132,133,3,5,134,135,136,137,138,139,140,141,142,143,144,145,146,147,148,149,150,151,152,153,154,155,156,157,158,159,160,161,162,163,164,165,166,167,168,169,170,171,172,173,174,175,176,177,178,179,180,181,182,183,184,185,186,187,188,72,72,98,110,115,120,44,150,175,25,99,19,8,62,90,91,93,96,122,172,100,129,130,131,132,133,134,15,134,158,122,172,24,87,20,21,86,87,88,89,93,94,95,96,97,98,99,100,108,109,110,118,119,120,0,72,81,63,170,174,183,188,64,0,0,230,230,231,230,231,231,231,231,231,231,230,231,231,231,230,231,231,231,230,230,231,231,231,231,231,231,230,231,230,231,230,231,0,235,235,235,0,222,222,222,222,222,222,222,0,222,222,222,222,222,6,0,0,0,6,220,0,0,0,0,0,0,0,238,236,242,238,240,241,236,242,238,240,241,238,236,240,241,236,240,241,236,238,240,0,238,241,242,238,240,236,236,236,238,238,241,238,236,236,242,238,240,241,241,236,242,238,240,241,236,236,236,238,238,236,236,217,238,220,241,220,238,220,238,242,238,238,238,236,238,241,238,236,236,240,241,236,238,241,236,242,238,240,241,236,242,238,240,241,236,242,238,240,241,0,0,250,251,256,0,0,0,0,0,0,0,0,256,247,253,261,254,255,209,210,256,247,253,261,254,255,209,210,256,247,247,253,254,255,209,256,247,247,253,254,255,209,256,256,247,247,247,247,247,247,247,247,247,253,261,254,255,209,210,256,247,247,247,247,247,247,247,253,261,254,255,209,210,256,247,247,247,253,261,254,255,209,210,247,256,256,247,247,247,247,247,247,253,261,254,255,209,210,247,256,253,261,254,255,209,210,253,261,254,255,209,210,247,247,247,247,247,247,247,247,256,256,247,247,247,253,261,254,255,209,210,247,256,247,253,254,255,209,256,247,256,247,247,253,261,254,255,209,210,256,247,253,261,254,255,209,210,256,247,253,261,254,255,209,210,256,256,256,0,263,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,264,203,265,266,267,268,269,270,271,272,273,274,199,275,276,277,278,279,202,280,281,282,283,284,285,286,287,288,289,290,291,292,293,294,295,296,297,200,198,298,299,201,300,301,302,303,304,305,306,307,308,309,310,311,312,313,314,315,316,317,318,319,320,321,322,323,324,325,326,327,328,329,330,331,332,333,334,335,336,337,338,339,340,341,342,343,344,345,346,347,348,349,350,351,352,353,354,355,356,357,358,359,360,264,203,265,266,267,268,269,270,271,272,273,274,199,275,276,277,278,279,202,280,281,282,283,284,285,286,287,288,289,290,291,292,293,294,295,296,297,200,198,298,299,201,300,301,302,303,304,305,306,307,308,309,310,311,312,313,314,315,316,317,318,319,320,321,322,323,324,325,326,327,328,329,330,331,332,333,334,335,336,337,338,339,340,341,342,343,344,345,346,347,348,349,350,351,352,353,354,355,356,357,358,359,360,264,203,265,266,267,268,269,270,271,272,273,274,199,275,276,277,278,279,202,280,281,282,283,284,285,286,287,288,289,290,291,292,293,294,295,296,297,200,198,298,299,201,300,301,302,303,304,305,306,307,308,309,310,311,312,313,314,315,316,317,318,319,320,321,322,323,324,325,326,327,328,329,330,331,332,333,334,335,336,337,338,339,340,341,342,343,344,345,346,347,348,349,350,351,352,353,354,355,356,357,358,359,360,264,203,265,266,267,268,269,270,271,272,273,274,199,275,276,277,278,279,202,280,281,282,283,284,285,286,287,288,289,290,291,292,293,294,295,296,297,200,198,298,299,201,300,301,302,303,304,305,306,307,308,309,310,311,312,313,314,315,316,317,318,319,320,321,322,323,324,325,326,327,328,329,330,331,332,333,334,335,336,337,338,339,340,341,342,343,344,345,346,347,348,349,350,351,352,353,354,355,356,357,358,359,360,264,203,265,266,267,268,269,270,271,272,273,274,199,275,276,277,278,279,202,280,281,282,283,284,285,286,287,288,289,290,291,292,293,294,295,296,297,200,198,298,299,201,300,301,302,303,304,305,306,307,308,309,310,311,312,313,314,315,316,317,318,319,320,321,322,323,324,325,326,327,328,329,330,331,332,333,334,335,336,337,338,339,340,341,342,343,344,345,346,347,348,349,350,351,352,353,354,355,356,357,358,359,360,203,312,315,316,318,319,320,321,325,329,332,333,336,337,341,343,345,346,348,353,355,357,203,312,315,316,318,319,320,321,325,329,332,333,336,337,341,343,345,346,348,353,355,357,264,203,265,266,267,268,269,270,271,272,273,274,199,275,276,277,278,279,202,280,281,282,283,284,285,286,287,288,289,290,291,292,293,294,295,296,297,200,198,298,299,201,300,301,302,303,304,305,306,307,308,309,310,311,312,313,314,315,316,317,318,319,320,321,322,323,324,325,326,327,328,329,330,331,332,333,334,335,336,337,338,339,340,341,342,343,344,345,346,347,348,349,350,351,352,353,354,355,356,357,358,359,360,264,203,265,266,267,268,269,270,271,272,273,274,199,275,276,277,278,279,202,280,281,282,283,284,285,286,287,288,289,290,291,292,293,294,295,296,297,200,198,298,299,201,300,301,302,303,304,305,306,307,308,309,310,311,312,313,314,315,316,317,318,319,320,321,322,323,324,325,326,327,328,329,330,331,332,333,334,335,336,337,338,339,340,341,342,343,344,345,346,347,348,349,350,351,352,353,354,355,356,357,358,359,360,264,203,265,266,267,268,269,270,271,272,273,274,199,275,276,277,278,279,202,280,281,282,283,284,285,286,287,288,289,290,291,292,293,294,295,296,297,200,198,298,299,201,300,301,302,303,304,305,306,307,308,309,310,311,312,313,314,315,316,317,318,319,320,321,322,323,324,325,326,327,328,329,330,331,332,333,334,335,336,337,338,339,340,341,342,343,344,345,346,347,348,349,350,351,352,353,354,355,356,357,358,359,360,264,203,265,266,267,268,269,270,271,272,273,274,199,275,276,277,278,279,202,280,281,282,283,284,285,286,287,288,289,290,291,292,293,294,295,296,297,200,198,298,299,201,300,301,302,303,304,305,306,307,308,309,310,311,312,313,314,315,316,317,318,319,320,321,322,323,324,325,326,327,328,329,330,331,332,333,334,335,336,337,338,339,340,341,342,343,344,345,346,347,348,349,350,351,352,353,354,355,356,357,358,359,360,264,203,265,266,267,268,269,270,271,272,273,274,199,275,276,277,278,279,202,280,281,282,283,284,285,286,287,288,289,290,291,292,293,294,295,296,297,200,198,298,299,201,300,301,302,303,304,305,306,307,308,309,310,311,312,313,314,315,316,317,318,319,320,321,322,323,324,325,326,327,328,329,330,331,332,333,334,335,336,337,338,339,340,341,342,343,344,345,346,347,348,349,350,351,352,353,354,355,356,357,358,359,360,203,265,266,267,268,269,270,271,272,273,274,199,275,276,277,278,279,202,280,281,282,283,284,285,286,287,288,289,290,291,292,293,294,295,296,297,200,198,298,299,201,300,301,302,303,304,305,306,307,308,309,310,311,312,313,314,315,316,317,318,319,320,321,322,323,324,325,326,327,328,329,330,331,332,333,334,335,336,337,338,339,340,341,342,343,344,345,346,347,348,349,350,351,352,353,354,355,356,357,203,265,266,267,268,269,270,271,272,273,274,199,275,276,277,278,279,202,280,281,282,283,284,285,286,287,288,289,290,291,292,293,294,295,296,297,200,198,298,299,201,300,301,302,303,304,305,306,307,308,309,310,311,312,313,314,315,316,317,318,319,320,321,322,323,324,325,326,327,328,329,330,331,332,333,334,335,336,337,338,339,340,341,342,343,344,345,346,347,348,349,350,351,352,353,354,355,356,357,264,265,266,267,268,269,270,271,272,273,274,199,275,276,277,278,279,202,280,281,282,283,284,285,286,287,288,289,290,291,292,293,294,295,296,297,200,198,298,299,201,300,301,302,303,304,305,306,307,308,309,310,311,358,359,360,203,312,313,314,315,316,317,318,319,320,321,322,323,324,325,326,327,328,329,330,331,332,333,334,335,336,337,338,339,340,341,342,343,344,345,346,347,348,349,350,351,352,353,354,355,356,357,264,358,359,360,264,203,265,266,267,268,269,270,271,272,273,274,199,275,276,277,278,279,202,280,281,282,283,284,285,286,287,288,289,290,291,292,293,294,295,296,297,200,198,298,299,201,300,301,302,303,304,305,306,307,308,309,310,311,312,313,314,315,316,317,318,319,320,321,322,323,324,325,326,327,328,329,330,331,332,333,334,335,336,337,338,339,340,341,342,343,344,345,346,347,348,349,350,351,352,353,354,355,356,357,358,359,360,203,265,266,267,268,269,270,271,272,273,274,199,275,276,277,278,279,202,280,281,282,283,284,285,286,287,288,289,290,291,292,293,294,295,296,297,200,198,298,299,201,300,301,302,303,304,305,306,307,308,309,310,311,312,313,314,315,316,317,318,319,320,321,322,323,324,325,326,327,328,329,330,331,332,333,334,335,336,337,338,339,340,341,342,343,344,345,346,347,348,349,350,351,352,353,354,355,356,357,264,203,265,266,267,268,269,270,271,272,273,274,199,275,276,277,278,279,202,280,281,282,283,284,285,286,287,288,289,290,291,292,293,294,295,296,297,200,198,298,299,201,300,301,302,303,304,305,306,307,308,309,310,311,312,313,314,315,316,317,318,319,320,321,322,323,324,325,326,327,328,329,330,331,332,333,334,335,336,337,338,339,340,341,342,343,344,345,346,347,348,349,350,351,352,353,354,355,356,357,358,359,360,264,203,265,266,267,268,269,270,271,272,273,274,199,275,276,277,278,279,202,280,281,282,283,284,285,286,287,288,289,290,291,292,293,294,295,296,297,200,198,298,299,201,300,301,302,303,304,305,306,307,308,309,310,311,312,313,314,315,316,317,318,319,320,321,322,323,324,325,326,327,328,329,330,331,332,333,334,335,336,337,338,339,340,341,342,343,344,345,346,347,348,349,350,351,352,353,354,355,356,357,358,359,360,264,203,265,266,267,268,269,270,271,272,273,274,199,275,276,277,278,279,202,280,281,282,283,284,285,286,287,288,289,290,291,292,293,294,295,296,297,200,198,298,299,201,300,301,302,303,304,305,306,307,308,309,310,311,312,313,314,315,316,317,318,319,320,321,322,323,324,325,326,327,328,329,330,331,332,333,334,335,336,337,338,339,340,341,342,343,344,345,346,347,348,349,350,351,352,353,354,355,356,357,358,359,360,0,0,361,361,0,361,361,0,361,361,0,361,361,0,361,361,0,361,361,0,361,361,0,361,361,0,361,361,0,361,361,0,361,361,0,361,361,0,361,361,0,361,361,0,361,361,0,361,361,0,361,361,0,361,361,0,361,361,0,361,361,0,361,361,0,361,361,0,361,361,0,361,361,0,361,361,0,361,361,0,361,361,0,361,361,0,361,361,0,361,361,0,361,361,0,361,361,0,361,361,0,361,361,0,361,361,0,361,361,0,361,361,0,361,361,0,361,361,0,361,361,0,361,361,0,361,361,0,361,361,0,361,361,0,361,361,0,361,361,0,361,361,0,361,361,0,361,361,0,361,361,0,361,361,0,361,361,0,361,361,0,361,361,0,361,361,0,361,361,0,361,361,0,361,361,0,361,361,0,361,361,0,361,361,0,361,361,0,361,361,0,361,361,0,361,361,0,361,361,0,361,361,0,361,361,0,361,361,0,361,361,0,361,361,0,361,361,0,361,361,0,361,361,0,361,361,0,361,361,0,361,361,0,361,361,0,361,361,0,361,361,0,361,361,0,361,361,0,361,361,0,361,361,0,361,361,0,361,361,0,361,361,0,361,361,0,361,361,0,361,361,0,361,361,0,361,361,0,361,361,0,361,361,0,361,361,0,361,361,0,361,361,0,361,361,0,361,361,0,361,361,0,361,361,0,361,361,0,361,361,0,361,361,0,361,361,0,361,361,0,361,361,0,361,361,0,361,361,0,361,361,0,361,361,0,361,361,0,361,361,0,361,361,0,361,361,0,361,361,0,361,361,0,361,361,0,361,361,0,361,361,0,361,361,0,361,361,0,361,361,0,361,361,0,361,361,0,361,361,0,361,361,0,361,361,0,361,361,0,361,361,0,361,361,0,361,361,0,361,361,0,361,361,0,361,361,0,361,361,0,361,361,0,361,361,0,361,361,0,361,361,0,361,361,0,361,361,0,361,361,0,361,361,0,361,361,0,361,361,0,361,361,0,361,361,0,361,361,0,361,361,0,361,361,0,361,361,0,361,361,0,361,361,0,361,361,0,361,361,0,361,361,0,361,361,0,361,361,0,361,361,0,361,361,0,361,361,0,361,361,0,361,361,0,361,361,0,361,361,0,361,361,0,361,361,0,361,361,0,361,361,0,361,361,0,361,361,0,361,361,0,361,361,0,361,361,0,361,361,0,361,361,0,361,361,0,361,361,0,361,361,0,361,361,0,361,361,0,361,361],"f":"`````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````{bd}``````````````````````````````````````````````````````````````````````````````````````````````````````````{fh}{jh}{f{{l{c}}}n}{j{{l{c}}}n}`````````````{ce{}{}}000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000````````````````````````````````````{A`A`}{AbAb}{bb}{dd}{AdAd}{AfAf}{AhAh}{AjAj}{AlAl}{AnAn}{B`B`}{BbBb}{BdBd}{BfBf}{BhBh}{BjBj}{BlBl}{BnBn}{C`C`}{CbCb}{CdCd}{CfCf}{ChCh}{CjCj}{ClCl}{CnCn}{D`D`}{DbDb}{DdDd}{DfDf}{DhDh}{DjDj}{DlDl}{DnDn}{E`E`}{EbEb}{EdEd}{EfEf}{EhEh}{EjEj}{ElEl}{EnEn}{F`F`}{FbFb}{FdFd}{FfFf}{FhFh}{FjFj}{FlFl}{FnFn}{G`G`}{GbGb}{GdGd}{GfGf}{GhGh}{GjGj}{GlGl}{GnGn}{H`H`}{HbHb}{HdHd}{HfHf}{HhHh}{HjHj}{HlHl}{HnHn}{I`I`}{IbIb}{IdId}{IfIf}{IhIh}{IjIj}{IlIl}{InIn}{J`J`}{JbJb}{JdJd}{JfJf}{JhJh}{JjJj}{JlJl}{JnJn}{K`K`}{KbKb}{KdKd}{KfKf}{KhKh}{KjKj}{KlKl}{KnKn}{L`L`}{LbLb}{LdLd}{LfLf}{LhLh}{LjLj}{LlLl}{LnLn}{M`M`}{MbMb}{MdMd}{MfMf}{MhMh}{MjMj}{MlMl}{MnMn}{N`N`}{NbNb}{NdNd}{NfNf}{NhNh}{NjNj}{NlNl}{NnNn}{O`O`}{ObOb}{OdOd}{OfOf}{OhOh}{OjOj}{OlOl}{OnOn}{A`A`}{AbAb}{AdAd}{AfAf}{AhAh}{AjAj}{ff}{jj}{AlAl}{AnAn}{AA`AA`}{AAbAAb}{AAdAAd}{AAfAAf}{AAhAAh}{AAjAAj}{AAlAAl}{AAnAAn}{AB`AB`}{ABbABb}{ABdABd}{ABfABf}{ABhABh}{ABjABj}{ABlABl}{ABnABn}{AC`AC`}{ACbACb}{ACdACd}{ACfACf}{AChACh}{ACjACj}{AClACl}{ACnACn}{AD`AD`}{ADbADb}{ADdADd}{ADfADf}{ADhADh}{ADjADj}{ADlADl}{ADnADn}{AE`AE`}{AEbAEb}{AEdAEd}{AEfAEf}{AEhAEh}{AEjAEj}{AElAEl}{AEnAEn}{AF`AF`}{AFbAFb}{AFdAFd}{AFfAFf}{AFhAFh}{AFjAFj}{AFlAFl}{AFnAFn}{AG`AG`}{AGbAGb}{AGdAGd}{AGfAGf}{AGhAGh}{{ce}AGj{}{}}0000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000{{A`A`}AGl}{{AdAd}AGl}```````````````````````````````````````````{{}I`}{{}Ij}{{}ACd}``````````````````````````````````````{{A`A`}AGn}{{A`c}AGn{{AH`{h}}AHb}}{{AbAb}AGn}{{bb}AGn}{{dd}AGn}{{AdAd}AGn}{{AfAf}AGn}{{AhAh}AGn}{{AjAj}AGn}{{AlAl}AGn}{{AnAn}AGn}{{B`B`}AGn}{{BbBb}AGn}{{BdBd}AGn}{{BfBf}AGn}{{BhBh}AGn}{{BjBj}AGn}{{BlBl}AGn}{{BnBn}AGn}{{C`C`}AGn}{{CbCb}AGn}{{CdCd}AGn}{{CfCf}AGn}{{ChCh}AGn}{{CjCj}AGn}{{ClCl}AGn}{{CnCn}AGn}{{D`D`}AGn}{{DbDb}AGn}{{DdDd}AGn}{{DfDf}AGn}{{DhDh}AGn}{{DjDj}AGn}{{DlDl}AGn}{{DnDn}AGn}{{E`E`}AGn}{{EbEb}AGn}{{EdEd}AGn}{{EfEf}AGn}{{EhEh}AGn}{{EjEj}AGn}{{ElEl}AGn}{{EnEn}AGn}{{F`F`}AGn}{{FbFb}AGn}{{FdFd}AGn}{{FfFf}AGn}{{FhFh}AGn}{{FjFj}AGn}{{FlFl}AGn}{{FnFn}AGn}{{G`G`}AGn}{{GbGb}AGn}{{GdGd}AGn}{{GfGf}AGn}{{GhGh}AGn}{{GjGj}AGn}{{GlGl}AGn}{{GnGn}AGn}{{H`H`}AGn}{{HbHb}AGn}{{HdHd}AGn}{{HfHf}AGn}{{HhHh}AGn}{{HjHj}AGn}{{HlHl}AGn}{{HnHn}AGn}{{I`I`}AGn}{{IbIb}AGn}{{IdId}AGn}{{IfIf}AGn}{{IhIh}AGn}{{IjIj}AGn}{{IlIl}AGn}{{InIn}AGn}{{J`J`}AGn}{{JbJb}AGn}{{JdJd}AGn}{{JfJf}AGn}{{JhJh}AGn}{{JjJj}AGn}{{JlJl}AGn}{{JnJn}AGn}{{K`K`}AGn}{{KbKb}AGn}{{KdKd}AGn}{{KfKf}AGn}{{KhKh}AGn}{{KjKj}AGn}{{KlKl}AGn}{{KnKn}AGn}{{L`L`}AGn}{{LbLb}AGn}{{LdLd}AGn}{{LfLf}AGn}{{LhLh}AGn}{{LjLj}AGn}{{LlLl}AGn}{{LnLn}AGn}{{M`M`}AGn}{{MbMb}AGn}{{MdMd}AGn}{{MfMf}AGn}{{MhMh}AGn}{{MjMj}AGn}{{MlMl}AGn}{{MnMn}AGn}{{N`N`}AGn}{{NbNb}AGn}{{NdNd}AGn}{{NfNf}AGn}{{NhNh}AGn}{{NjNj}AGn}{{NlNl}AGn}{{NnNn}AGn}{{O`O`}AGn}{{ObOb}AGn}{{OdOd}AGn}{{OfOf}AGn}{{OhOh}AGn}{{OjOj}AGn}{{OlOl}AGn}{{OnOn}AGn}{{A`A`}AGn}{{AbAb}AGn}{{AdAd}AGn}{{AfAf}AGn}{{AhAh}AGn}{{AjAj}AGn}{{ff}AGn}{{jj}AGn}{{AlAl}AGn}{{AnAn}AGn}{{AA`AA`}AGn}{{AAbAAb}AGn}{{AAdAAd}AGn}{{AAfAAf}AGn}{{AAhAAh}AGn}{{AAjAAj}AGn}{{AAlAAl}AGn}{{AAnAAn}AGn}{{AB`AB`}AGn}{{ABbABb}AGn}{{ABdABd}AGn}{{ABfABf}AGn}{{ABhABh}AGn}{{ABjABj}AGn}{{ABlABl}AGn}{{ABnABn}AGn}{{AC`AC`}AGn}{{ACbACb}AGn}{{ACdACd}AGn}{{ACfACf}AGn}{{AChACh}AGn}{{ACjACj}AGn}{{AClACl}AGn}{{ACnACn}AGn}{{AD`AD`}AGn}{{ADbADb}AGn}{{ADdADd}AGn}{{ADfADf}AGn}{{ADhADh}AGn}{{ADjADj}AGn}{{ADlADl}AGn}{{ADnADn}AGn}{{AE`AE`}AGn}{{AEbAEb}AGn}{{AEdAEd}AGn}{{AEfAEf}AGn}{{AEhAEh}AGn}{{AEjAEj}AGn}{{AElAEl}AGn}{{AEnAEn}AGn}{{AF`AF`}AGn}{{AFbAFb}AGn}{{AFdAFd}AGn}{{AFfAFf}AGn}{{AFhAFh}AGn}{{AFjAFj}AGn}{{AFlAFl}AGn}{{AFnAFn}AGn}{{AG`AG`}AGn}{{AGbAGb}AGn}{{AGdAGd}AGn}{{AGfAGf}AGn}{{AGhAGh}AGn}````````````````````````````````````````````{{A`AHd}{{AHh{AGjAHf}}}}00{{AbAHd}AHj}{{bAHd}AHj}{{dAHd}AHj}{{AdAHd}AHj}0{{AfAHd}AHj}{{AhAHd}AHj}{{AjAHd}AHj}{{AlAHd}AHj}{{AnAHd}AHj}{{B`AHd}AHj}{{BbAHd}AHj}{{BdAHd}AHj}{{BfAHd}AHj}{{BhAHd}AHj}{{BjAHd}AHj}{{BlAHd}AHj}{{BnAHd}AHj}{{C`AHd}AHj}{{CbAHd}AHj}{{CdAHd}AHj}{{CfAHd}AHj}{{ChAHd}AHj}{{CjAHd}AHj}{{ClAHd}AHj}{{CnAHd}AHj}{{D`AHd}AHj}{{DbAHd}AHj}{{DdAHd}AHj}{{DfAHd}AHj}{{DhAHd}AHj}{{DjAHd}AHj}{{DlAHd}AHj}{{DnAHd}AHj}{{E`AHd}AHj}{{EbAHd}AHj}{{EdAHd}AHj}{{EfAHd}AHj}{{EhAHd}AHj}{{EjAHd}AHj}{{ElAHd}AHj}{{EnAHd}AHj}{{F`AHd}AHj}{{FbAHd}AHj}{{FdAHd}AHj}{{FfAHd}AHj}{{FhAHd}AHj}{{FjAHd}AHj}{{FlAHd}AHj}{{FnAHd}AHj}{{G`AHd}AHj}{{GbAHd}AHj}{{GdAHd}AHj}{{GfAHd}AHj}{{GhAHd}AHj}{{GjAHd}AHj}{{GlAHd}AHj}{{GnAHd}AHj}{{H`AHd}AHj}{{HbAHd}AHj}0{{HdAHd}AHj}0{{HfAHd}AHj}{{HhAHd}AHj}{{HjAHd}AHj}{{HlAHd}AHj}{{HnAHd}AHj}{{I`AHd}AHj}{{IbAHd}AHj}{{IdAHd}AHj}{{IfAHd}AHj}{{IhAHd}AHj}{{IjAHd}AHj}{{IlAHd}AHj}{{InAHd}AHj}{{J`AHd}AHj}{{JbAHd}AHj}{{JdAHd}AHj}{{JfAHd}AHj}{{JhAHd}AHj}{{JjAHd}AHj}{{JlAHd}AHj}{{JnAHd}AHj}{{K`AHd}AHj}{{KbAHd}AHj}{{KdAHd}AHj}{{KfAHd}AHj}{{KhAHd}AHj}{{KjAHd}AHj}{{KlAHd}AHj}{{KnAHd}AHj}{{L`AHd}AHj}{{LbAHd}AHj}{{LdAHd}AHj}{{LfAHd}AHj}{{LhAHd}AHj}{{LjAHd}AHj}{{LlAHd}AHj}{{LnAHd}AHj}{{M`AHd}AHj}{{MbAHd}AHj}{{MdAHd}AHj}{{MfAHd}AHj}{{MhAHd}AHj}{{MjAHd}AHj}{{MlAHd}AHj}{{MnAHd}AHj}{{N`AHd}AHj}{{NbAHd}AHj}{{NdAHd}AHj}{{NfAHd}AHj}{{NhAHd}AHj}{{NjAHd}AHj}{{NlAHd}AHj}{{NnAHd}AHj}{{O`AHd}AHj}{{ObAHd}AHj}{{OdAHd}AHj}{{OfAHd}AHj}{{OhAHd}AHj}{{OjAHd}AHj}{{OlAHd}AHj}{{OnAHd}AHj}{{A`AHd}AHj}{{AbAHd}AHj}{{AdAHd}AHj}{{AfAHd}AHj}{{AhAHd}AHj}{{AjAHd}AHj}{{fAHd}AHj}0{{jAHd}AHj}0{{AlAHd}AHj}{{AnAHd}AHj}{{AA`AHd}AHj}{{AAbAHd}AHj}{{AAdAHd}AHj}{{AAfAHd}AHj}{{AAhAHd}AHj}{{AAjAHd}AHj}{{AAlAHd}AHj}{{AAnAHd}AHj}{{AB`AHd}AHj}{{ABbAHd}AHj}{{ABdAHd}AHj}{{ABfAHd}AHj}{{ABhAHd}AHj}{{ABjAHd}AHj}{{ABlAHd}AHj}{{ABnAHd}AHj}{{AC`AHd}AHj}{{ACbAHd}AHj}{{ACdAHd}AHj}{{ACfAHd}AHj}{{AChAHd}AHj}{{ACjAHd}AHj}{{AClAHd}AHj}{{ACnAHd}AHj}{{AD`AHd}AHj}{{ADbAHd}AHj}{{ADdAHd}AHj}{{ADfAHd}AHj}{{ADhAHd}AHj}{{ADjAHd}AHj}{{ADlAHd}AHj}{{ADnAHd}AHj}{{AE`AHd}AHj}{{AEbAHd}AHj}{{AEdAHd}AHj}{{AEfAHd}AHj}{{AEhAHd}AHj}{{AEjAHd}AHj}{{AElAHd}AHj}{{AEnAHd}AHj}{{AF`AHd}AHj}{{AFbAHd}AHj}{{AFdAHd}AHj}{{AFfAHd}AHj}{{AFhAHd}AHj}{{AFjAHd}AHj}{{AFlAHd}AHj}{{AFnAHd}AHj}{{AG`AHd}AHj}{{AGbAHd}AHj}{{AGdAHd}AHj}{{AGfAHd}AHj}{{AGhAHd}AHj}````{AHlA`}{AHnA`}{cc{}}{AI`A`}{AIbA`}{AIdA`}{AIfA`}4444444{AnAj}{AlAj}{AC`Aj}777{BdBb}{BfBb}9999{JnBj}{LfBj};{KnBj}<<<<{EnCd}{CnCd}{GjCd}{FjCd}{G`Cd}{FnCd}{CfCd}{EjCd}{GnCd}{FdCd}{ChCd}{GbCd}{EbCd}{DjCd}{GhCd}{GlCd}{E`Cd}{CjCd}{DhCd}{GdCd}{EhCd}{EdCd}{DfCd}{FlCd}{F`Cd}{FbCd}{ClCd}{GfCd}{D`Cd}{DnCd}{FfCd}{FhCd}{H`Cd}{DdCd}{ElCd}{DlCd}{DbCd}{EfCd}{cc{}}00000000000000000000000000000000000000{AIhHb}{HdHb}{A`Hb}33{AIhHd}444444{IfIb}{IdIb}{IhIb}77{A`If}8888{AdIl}{InIl}:::{JhJd};{JfJd}<<{JlJj}{KbJj}>{KlJj}{L`Jj}{JnJj}{LfJj}{KfJj}{LdJj}{KhJj}{LhJj}{KjJj}{BjJj}{LbJj}{K`Jj}{KdJj}{KnJj}{cc{}}00000000000000{MbLj}{M`Lj}{MdLj}{LnLj}4{LlLj}55555{MhMf}6{MjMf}{MlMf}{MnMf}9999{NhN`}{NdN`}{NbN`}{NfN`}====={NlNj}{ObNj}{NnNj}{O`Nj}{cc{}}000000{ABjOf}{OhOf}2222{AbA`}3{AfA`}{AhA`}{jA`}{AlA`}{AjA`}{fA`}{AdA`}::::::{AIjf}{AIjj}<<<<<<{ABjAAf}{ABdAAf}{ABhAAf}{ABlAAf}{DjAAf}{F`AAf}{ABfAAf}{FjAAf}{ABbAAf}{FhAAf}{ElAAf}{cc{}}{AB`AAf}{AAjAAf}{AAlAAf}{AAhAAf}{AAnAAf}5555555555555{cAC`{{AIl{ACb}}}}{cACb{{AIl{A`}}}}77777777777777777{AEjAEd}{AF`AEd}{AFlAEd}{AFbAEd}{AFdAEd}{AFfAEd}{AFhAEd}{AEnAEd}{AEhAEd}{AG`AEd}{AFnAEd}{AElAEd}{cc{}}{AFjAEd}{AEfAEd}222222222222222222```````````````````{AC`{{AIn{A`}}}}```````{{A`c}AGjAJ`}{{Abc}AGjAJ`}{{bc}AGjAJ`}{{dc}AGjAJ`}{{Adc}AGjAJ`}{{Afc}AGjAJ`}{{Ahc}AGjAJ`}{{Ajc}AGjAJ`}{{Alc}AGjAJ`}{{Anc}AGjAJ`}{{B`c}AGjAJ`}{{Bbc}AGjAJ`}{{Bdc}AGjAJ`}{{Bfc}AGjAJ`}{{Bhc}AGjAJ`}{{Bjc}AGjAJ`}{{Blc}AGjAJ`}{{Bnc}AGjAJ`}{{C`c}AGjAJ`}{{Cbc}AGjAJ`}{{Cdc}AGjAJ`}{{Cfc}AGjAJ`}{{Chc}AGjAJ`}{{Cjc}AGjAJ`}{{Clc}AGjAJ`}{{Cnc}AGjAJ`}{{D`c}AGjAJ`}{{Dbc}AGjAJ`}{{Ddc}AGjAJ`}{{Dfc}AGjAJ`}{{Dhc}AGjAJ`}{{Djc}AGjAJ`}{{Dlc}AGjAJ`}{{Dnc}AGjAJ`}{{E`c}AGjAJ`}{{Ebc}AGjAJ`}{{Edc}AGjAJ`}{{Efc}AGjAJ`}{{Ehc}AGjAJ`}{{Ejc}AGjAJ`}{{Elc}AGjAJ`}{{Enc}AGjAJ`}{{F`c}AGjAJ`}{{Fbc}AGjAJ`}{{Fdc}AGjAJ`}{{Ffc}AGjAJ`}{{Fhc}AGjAJ`}{{Fjc}AGjAJ`}{{Flc}AGjAJ`}{{Fnc}AGjAJ`}{{G`c}AGjAJ`}{{Gbc}AGjAJ`}{{Gdc}AGjAJ`}{{Gfc}AGjAJ`}{{Ghc}AGjAJ`}{{Gjc}AGjAJ`}{{Glc}AGjAJ`}{{Gnc}AGjAJ`}{{H`c}AGjAJ`}{{Hbc}AGjAJ`}{{Hdc}AGjAJ`}{{Hfc}AGjAJ`}{{Hhc}AGjAJ`}{{Hjc}AGjAJ`}{{Hlc}AGjAJ`}{{Hnc}AGjAJ`}{{I`c}AGjAJ`}{{Ibc}AGjAJ`}{{Idc}AGjAJ`}{{Ifc}AGjAJ`}{{Ihc}AGjAJ`}{{Ijc}AGjAJ`}{{Ilc}AGjAJ`}{{Inc}AGjAJ`}{{J`c}AGjAJ`}{{Jbc}AGjAJ`}{{Jdc}AGjAJ`}{{Jfc}AGjAJ`}{{Jhc}AGjAJ`}{{Jjc}AGjAJ`}{{Jlc}AGjAJ`}{{Jnc}AGjAJ`}{{K`c}AGjAJ`}{{Kbc}AGjAJ`}{{Kdc}AGjAJ`}{{Kfc}AGjAJ`}{{Khc}AGjAJ`}{{Kjc}AGjAJ`}{{Klc}AGjAJ`}{{Knc}AGjAJ`}{{L`c}AGjAJ`}{{Lbc}AGjAJ`}{{Ldc}AGjAJ`}{{Lfc}AGjAJ`}{{Lhc}AGjAJ`}{{Ljc}AGjAJ`}{{Llc}AGjAJ`}{{Lnc}AGjAJ`}{{M`c}AGjAJ`}{{Mbc}AGjAJ`}{{Mdc}AGjAJ`}{{Mfc}AGjAJ`}{{Mhc}AGjAJ`}{{Mjc}AGjAJ`}{{Mlc}AGjAJ`}{{Mnc}AGjAJ`}{{N`c}AGjAJ`}{{Nbc}AGjAJ`}{{Ndc}AGjAJ`}{{Nfc}AGjAJ`}{{Nhc}AGjAJ`}{{Njc}AGjAJ`}{{Nlc}AGjAJ`}{{Nnc}AGjAJ`}{{O`c}AGjAJ`}{{Obc}AGjAJ`}{{Odc}AGjAJ`}{{Ofc}AGjAJ`}{{Ohc}AGjAJ`}{{Ojc}AGjAJ`}{{Olc}AGjAJ`}{{Onc}AGjAJ`}{{A`c}AGjAJ`}{{Abc}AGjAJ`}{{Adc}AGjAJ`}{{Afc}AGjAJ`}{{Ahc}AGjAJ`}{{Ajc}AGjAJ`}{{fc}AGjAJ`}{{jc}AGjAJ`}{{Alc}AGjAJ`}{{Anc}AGjAJ`}{{AA`c}AGjAJ`}{{AAbc}AGjAJ`}{{AAdc}AGjAJ`}{{AAfc}AGjAJ`}{{AAhc}AGjAJ`}{{AAjc}AGjAJ`}{{AAlc}AGjAJ`}{{AAnc}AGjAJ`}{{AB`c}AGjAJ`}{{ABbc}AGjAJ`}{{ABdc}AGjAJ`}{{ABfc}AGjAJ`}{{ABhc}AGjAJ`}{{ABjc}AGjAJ`}{{ABlc}AGjAJ`}{{ABnc}AGjAJ`}{{AC`c}AGjAJ`}{{ACbc}AGjAJ`}{{ACdc}AGjAJ`}{{ACfc}AGjAJ`}{{AChc}AGjAJ`}{{ACjc}AGjAJ`}{{AClc}AGjAJ`}{{ACnc}AGjAJ`}{{AD`c}AGjAJ`}{{ADbc}AGjAJ`}{{ADdc}AGjAJ`}{{ADfc}AGjAJ`}{{ADhc}AGjAJ`}{{ADjc}AGjAJ`}{{ADlc}AGjAJ`}{{ADnc}AGjAJ`}{{AE`c}AGjAJ`}{{AEbc}AGjAJ`}{{AEdc}AGjAJ`}{{AEfc}AGjAJ`}{{AEhc}AGjAJ`}{{AEjc}AGjAJ`}{{AElc}AGjAJ`}{{AEnc}AGjAJ`}{{AF`c}AGjAJ`}{{AFbc}AGjAJ`}{{AFdc}AGjAJ`}{{AFfc}AGjAJ`}{{AFhc}AGjAJ`}{{AFjc}AGjAJ`}{{AFlc}AGjAJ`}{{AFnc}AGjAJ`}{{AG`c}AGjAJ`}{{AGbc}AGjAJ`}{{AGdc}AGjAJ`}{{AGfc}AGjAJ`}{{AGhc}AGjAJ`}````````````````````````````````````````````{ce{}{}}0000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000{Bbc{}}00{BbAGn}{ACdAGn}{{AC`c}AGnAHb}1`````{Bb{{AJb{Bh}}}}{Bb{{AJd{Bh}}}}```````````{BbAIh}````{Oh{{AIn{Ad}}}}```````````````````````````{I`Jb}````````````````````````{{hAJf}A`}{{hAJf}Ad}{AdId}{AIjA`}{{hAJf}Ab}{{{AJj{AJh}}AJf}Ad}{{AJlAJf}Af}{{AJhAJf}Ah}{{AJnAJf}Aj}{{hAJf}f}{{hAJf}j}{{AGnAJf}Al};``````````````````````````{AK`{{l{c}}}AKb}{AKd{{l{A`}}}}{AKd{{l{Ad}}}}{AKd{{l{Aj}}}}{AKd{{l{Al}}}}{AKd{{l{An}}}}{AKd{{l{B`}}}}{AKd{{l{Bd}}}}{AKd{{l{Bf}}}}{AKd{{l{Bj}}}}{AKd{{l{Cd}}}}{AKd{{l{Cf}}}}{AKd{{l{Ch}}}}{AKd{{l{Cj}}}}{AKd{{l{Cl}}}}{AKd{{l{Cn}}}}{AKd{{l{D`}}}}{AKd{{l{Db}}}}{AKd{{l{Dd}}}}{AKd{{l{Df}}}}{AKd{{l{Dh}}}}{AKd{{l{Dj}}}}{AKd{{l{Dl}}}}{AKd{{l{Dn}}}}{AKd{{l{E`}}}}{AKd{{l{Ed}}}}{AKd{{l{Ef}}}}{AKd{{l{Eh}}}}{AKd{{l{Ej}}}}{AKd{{l{El}}}}{AKd{{l{En}}}}{AKd{{l{F`}}}}{AKd{{l{Fb}}}}{AKd{{l{Fd}}}}{AKd{{l{Ff}}}}{AKd{{l{Fh}}}}{AKd{{l{Fj}}}}{AKd{{l{Fl}}}}{AKd{{l{Fn}}}}{AKd{{l{G`}}}}{AKd{{l{Gb}}}}{AKd{{l{Gd}}}}{AKd{{l{Gf}}}}{AKd{{l{Gh}}}}{AKd{{l{Gj}}}}{AKd{{l{Gl}}}}{AKd{{l{Gn}}}}{AKd{{l{H`}}}}{AKd{{l{Hb}}}}{AKd{{l{Hd}}}}{AKd{{l{Hf}}}}{AKd{{l{Hh}}}}{AKd{{l{Hj}}}}{AKd{{l{Hl}}}}{AKd{{l{Hn}}}}{AKd{{l{I`}}}}{AKd{{l{Ib}}}}{AKd{{l{Id}}}}{AKd{{l{If}}}}{AKd{{l{Ih}}}}{AKd{{l{Ij}}}}{AKd{{l{Il}}}}{AKd{{l{In}}}}{AKd{{l{J`}}}}{AKd{{l{Jb}}}}{AKd{{l{Jd}}}}{AKd{{l{Jj}}}}{AKd{{l{Jl}}}}{AKd{{l{Jn}}}}{AKd{{l{K`}}}}{AKd{{l{Kb}}}}{AKd{{l{Kd}}}}{AKd{{l{Kf}}}}{AKd{{l{Kh}}}}{AKd{{l{Kj}}}}{AKd{{l{Kl}}}}{AKd{{l{Kn}}}}{AKd{{l{L`}}}}{AKd{{l{Lb}}}}{AKd{{l{Ld}}}}{AKd{{l{Lf}}}}{AKd{{l{Lh}}}}{AKd{{l{Lj}}}}{AKd{{l{Mf}}}}{AKd{{l{Mh}}}}{AKd{{l{Mj}}}}{AKd{{l{Ml}}}}{AKd{{l{Mn}}}}{AKd{{l{N`}}}}{AKd{{l{Nb}}}}{AKd{{l{Nd}}}}{AKd{{l{Nf}}}}{AKd{{l{Nh}}}}{AKd{{l{Nj}}}}{AKd{{l{Nl}}}}{AKd{{l{Nn}}}}{AKd{{l{O`}}}}{AKd{{l{Ob}}}}{AKd{{l{Od}}}}{AKd{{l{Of}}}}{AKd{{l{Oh}}}}{AKd{{l{Ol}}}}{AKd{{l{A`}}}}{Ab{{l{c}}}AKb}{AKd{{l{Ab}}}}{AKd{{l{Ad}}}}{AKd{{l{Af}}}}{AKd{{l{Ah}}}}{AKd{{l{Aj}}}}{AKd{{l{f}}}}{AKd{{l{j}}}}{AKd{{l{Al}}}}{AKd{{l{An}}}}{AKd{{l{AAb}}}}{AKd{{l{AAd}}}}{AKd{{l{ABj}}}}{AKd{{l{AC`}}}}{AKd{{l{ACb}}}}{AKd{{l{ACf}}}}{AKd{{l{ACh}}}}{AKd{{l{AD`}}}}{AKd{{l{ADd}}}}{AKd{{l{ADj}}}}{AKd{{l{ADl}}}}{AKd{{l{AEd}}}}{AKd{{l{AEf}}}}{AKd{{l{AEh}}}}{AKd{{l{AEj}}}}{AKd{{l{AEl}}}}{AKd{{l{AEn}}}}{AKd{{l{AF`}}}}{AKd{{l{AFb}}}}{AKd{{l{AFd}}}}{AKd{{l{AFf}}}}{AKd{{l{AFh}}}}{AKd{{l{AFj}}}}{AKd{{l{AFl}}}}{AKd{{l{AFn}}}}{AKd{{l{AG`}}}}{AKd{{l{AGb}}}}{AKd{{l{AGd}}}}{AKd{{l{AGh}}}}{AKf{{l{c}}}AKb}{AKd{{l{A`}}}}{Af{{l{c}}}AKb}{Al{{l{c}}}AKb}{{Afc}lAKh}{{Alc}lAKh}{An{{l{c}}}AKb}{{Anc}lAKh}{h{{l{Hn}}}}{AKd{{l{{AKj{Af}}}}}}`{AKd{{l{AC`}}}}{AKd{{l{AAf}}}}0{AKd{{l{Bh}}}}{{Afc}{{l{AGj}}}{{AL`{AKl}{{AKn{{l{AGj}}}}}}}}{{Alc}{{l{AGj}}}{{AL`{AKl}{{AKn{{l{AGj}}}}}}}}5``3{h{{l{c}}}AKb}{AKd{{l{ACh}}}}4{{Abc}lAKh}{AKd{{l{Cd}}}}{AKd{{l{{AKj{ADl}}}}}}1{{A`A`}{{AIn{AGl}}}}{{AdAd}{{AIn{AGl}}}}`````````{AfAC`}{AjAC`}```````````````````````{Od{{AIn{Oh}}}}````{AC`{{l{A`}}}}{Aj{{l{Al}}}}{Aj{{l{An}}}}{Aj{{l{AC`}}}}``````````````````````````````````{{A`AJf}AGj}{{AdAJf}AGj}{{A`AJf}AGj}{{AbAJf}AGj}{{AdAJf}AGj}{{AfAJf}AGj}{{AhAJf}AGj}{{AjAJf}AGj}{{fAJf}AGj}{{jAJf}AGj}{{AlAJf}AGj}`````{cAJf{}}{A`{{AIn{AJf}}}}{A`AJf}2222{AdAJf}3333333333333333333333333333333333333333333333333{Hb{{AIn{AJf}}}}4{Hd{{AIn{AJf}}}}55555555555555555555555555555555555555555555555555555555555555{A`AJf}{AbAJf}77{AdAJf}{AfAJf}9{AhAJf}:{AjAJf};{fAJf}<{jAJf}=={AlAJf}>{AA`ALb}????????????????????????{ADbAJf}{cAJf{}}000000000000000000000000```{I`{{ALd{Abb{AIn{Jb}}}}}}```````````{A`h}{Abh}{Adh}{Afh}{Ahh}{Ajh}{fh}{jh}``{ce{}{}}0000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000{cALf{}}000{{A`AKf}AGj}{{AbAKf}AGj}{{bAKf}AGj}{{dAKf}AGj}{{AdAKf}AGj}{{AfAKf}AGj}{{AjAKf}AGj}{{AlAKf}AGj}{{AnAKf}AGj}{{B`AKf}AGj}{{BbAKf}AGj}{{BdAKf}AGj}{{BfAKf}AGj}{{BhAKf}AGj}{{BjAKf}AGj}{{CdAKf}AGj}{{CfAKf}AGj}{{ChAKf}AGj}{{CjAKf}AGj}{{ClAKf}AGj}{{CnAKf}AGj}{{D`AKf}AGj}{{DbAKf}AGj}{{DdAKf}AGj}{{DfAKf}AGj}{{DhAKf}AGj}{{DjAKf}AGj}{{DlAKf}AGj}{{DnAKf}AGj}{{E`AKf}AGj}{{EbAKf}AGj}{{EdAKf}AGj}{{EfAKf}AGj}{{EhAKf}AGj}{{EjAKf}AGj}{{ElAKf}AGj}{{EnAKf}AGj}{{F`AKf}AGj}{{FbAKf}AGj}{{FdAKf}AGj}{{FfAKf}AGj}{{FhAKf}AGj}{{FjAKf}AGj}{{FlAKf}AGj}{{FnAKf}AGj}{{G`AKf}AGj}{{GbAKf}AGj}{{GdAKf}AGj}{{GfAKf}AGj}{{GhAKf}AGj}{{GjAKf}AGj}{{GlAKf}AGj}{{GnAKf}AGj}{{H`AKf}AGj}{{HbAKf}AGj}{{HdAKf}AGj}{{HfAKf}AGj}{{HhAKf}AGj}{{HjAKf}AGj}{{HlAKf}AGj}{{HnAKf}AGj}{{I`AKf}AGj}{{IbAKf}AGj}{{IdAKf}AGj}{{IfAKf}AGj}{{IhAKf}AGj}{{IjAKf}AGj}{{IlAKf}AGj}{{InAKf}AGj}{{J`AKf}AGj}{{JbAKf}AGj}{{JdAKf}AGj}{{JfAKf}AGj}{{JhAKf}AGj}{{JjAKf}AGj}{{JlAKf}AGj}{{JnAKf}AGj}{{K`AKf}AGj}{{KbAKf}AGj}{{KdAKf}AGj}{{KfAKf}AGj}{{KhAKf}AGj}{{KjAKf}AGj}{{KlAKf}AGj}{{KnAKf}AGj}{{L`AKf}AGj}{{LbAKf}AGj}{{LdAKf}AGj}{{LfAKf}AGj}{{LhAKf}AGj}{{LjAKf}AGj}{{LlAKf}AGj}{{LnAKf}AGj}{{M`AKf}AGj}{{MbAKf}AGj}{{MdAKf}AGj}{{MfAKf}AGj}{{MhAKf}AGj}{{MjAKf}AGj}{{MlAKf}AGj}{{MnAKf}AGj}{{N`AKf}AGj}{{NbAKf}AGj}{{NdAKf}AGj}{{NfAKf}AGj}{{NhAKf}AGj}{{NjAKf}AGj}{{NlAKf}AGj}{{NnAKf}AGj}{{O`AKf}AGj}{{ObAKf}AGj}{{OdAKf}AGj}{{OfAKf}AGj}{{OhAKf}AGj}{{OjAKf}AGj}{{OlAKf}AGj}{{A`AKf}AGj}{{AbAKf}AGj}{{AdAKf}AGj}{{AfAKf}AGj}{{AhAKf}AGj}{{AjAKf}AGj}{{fAKf}AGj}{{jAKf}AGj}{{AlAKf}AGj}{{AnAKf}AGj}{{AAbAKf}AGj}{{AAdAKf}AGj}{{AAfAKf}AGj}{{AAhAKf}AGj}{{AAjAKf}AGj}{{AAlAKf}AGj}{{AAnAKf}AGj}{{AB`AKf}AGj}{{ABbAKf}AGj}{{ABdAKf}AGj}{{ABfAKf}AGj}{{ABhAKf}AGj}{{ABjAKf}AGj}{{ABlAKf}AGj}{{ABnAKf}AGj}{{AC`AKf}AGj}{{ACbAKf}AGj}{{ACdAKf}AGj}{{ACfAKf}AGj}{{AChAKf}AGj}{{ACjAKf}AGj}{{AClAKf}AGj}{{ACnAKf}AGj}{{AD`AKf}AGj}{{ADdAKf}AGj}{{ADfAKf}AGj}{{ADjAKf}AGj}{{ADlAKf}AGj}{{ADnAKf}AGj}{{AEbAKf}AGj}{{AEdAKf}AGj}{{AEfAKf}AGj}{{AEhAKf}AGj}{{AEjAKf}AGj}{{AElAKf}AGj}{{AEnAKf}AGj}{{AF`AKf}AGj}{{AFbAKf}AGj}{{AFdAKf}AGj}{{AFfAKf}AGj}{{AFhAKf}AGj}{{AFjAKf}AGj}{{AFlAKf}AGj}{{AFnAKf}AGj}{{AG`AKf}AGj}{{AGbAKf}AGj}{{AGdAKf}AGj}{{AGfAKf}AGj}{{AGhAKf}AGj}`{AbAIj}{AdAIj}{AfAIj}{AhAIj}{AjAIj}{fAIj}{jAIj}{AlA`}```````{c{{AHh{e}}}{}{}}000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000`````````````````{cALh{}}0000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000````````````{A`A`}````````{AbALf}{Ad{{AKj{AJh}}}}{AfALj}{AhAJh}{AjAJn}{AlAGn}```````````````````````````````{AKd{{l{AEd}}}}{AKd{{l{AEl}}}}{AKd{{l{AFn}}}}{AKd{{l{AGh}}}}```{ALlALn}{ce{}{}}000{ALnALn}{{ce}AGj{}{}}{{}ALn}{ALnAGn}{{ALnALn}AGn}{cc{}}0{{ALnAM`}{{AIn{{ALd{ALnALbALn}}}}}}{ALn{{AIn{{ALd{A`ALn}}}}}}88{ALn{{AIn{{ALd{AdALn}}}}}}{ALn{{AIn{{ALd{AIjALn}}}}}}{AK`ALl}{AKfALl}{{ALnALn}{{AIn{AGl}}}}{ALn{{AIn{{ALd{AMbALn}}}}}}{ALnAJf}?{ALnAKf}{ALn{{AIn{{ALd{AMdALn}}}}}}{c{{AHh{e}}}{}{}}000{cALh{}}0`{AKd{{l{AMf}}}}`{AMfA`}`{ce{}{}}0{{AKlc}AMhAMj}{cc{}}`2{{AKlc}{{l{AGj}}}{{AL`{AKl}{{AKn{{l{AGj}}}}}}}}{c{{`{{AKh{}{{AKn{AGj}}}}}}}{{AL`{AKl}{{AKn{{l{AGj}}}}}}}}`887{AKl{{l{AKd}}}}`````````````{{AMlAMl}AGj}6666666666{{AMl{AMn{AKd}{{AKn{{l{c}}}}}}}{{l{c}}}{}}{AMhAMh}{AN`AN`}{ANbANb}{{ce}AGj{}{}}00{{AMhAMh}AGj}{AMlALn}{AN`c{}}`{AMlAGj}{{ANbANb}AGn}{ANdAMh}{{AMlc}AMhAMj}{{AN`c}AMhAMj}{{AMhc}AGj{{ANh{}{{ANf{AMh}}}}}}{{AMhAHd}AHj}0{{AMlAHd}AHj}0{{ANbAHd}AHj}{AMlAMl}{cc{}}{ANjAMh}1111{{ANbc}AGjAJ`}{ce{}{}}0000{AMhAKf}{AMhc{}}0{AMlAGn}{AMlANd}{{AJfc}AMhAMj}{{ce}AMhANlAMj}{AKd{{l{AKb}}}}{AMl{{l{c}}}AKb}{{{AKh{}{{AKn{c}}}}AK`}{{l{c}}}{}}{AKd{{l{ANb}}}}{{{AKh{}{{AKn{c}}}}AKf}{{l{c}}}{}}{AMl{{l{{ALd{AM`ALbAMl}}}}}}{{{AKh{}{{AKn{c}}}}h}{{l{c}}}{}}{{AMl{AMn{AKd}{{AKn{{l{c}}}}}}e}{{l{{ANn{c}}}}}{}AO`}{{ANdc}AGnAO`}{{AMlc}AGnAO`}00{AMhAJf}{AMlAJf}{cAJf{}}{{AMle}{{l{c}}}{}{{AOb{AN`}{{AKn{{l{{ALd{cALn}}}}}}}}}}{AMhAKf}{ce{}{}}00{cALf{}}0{{ANbAKf}AGj}{c{{AHh{e}}}{}{}}000000000{cALh{}}0000``{{AOdAOd}AGj}{AOf{{l{{ALd{AM`ALbAMl}}}}}}``````````6666666666666666{{{ANn{ce}}}AGj{}{}}{{{ANn{ce}}}{{ANn{ce}}}AOhAOh}{{{AOj{ce}}}{{AOj{ce}}}{}{}}{{{AOl{ce}}}{{AOl{ce}}}AOhAOh}{{{AOn{c}}}{{AOn{c}}}AOh}{{{AJb{c}}}{{AJb{c}}}{}}{{{B`{ce}}}{{B`{ce}}}AOhAOh}{{{ANn{ce}}{ANn{ce}}}AGjAOhAOh}{{ce}AGj{}{}}000002{{}{{ANn{ce}}}{}{}}{{{ANn{ce}}}AGn{}{}}{{{ANn{ce}}{ANn{ce}}}AGnBbBb}{{{ANn{ce}}g}AGj{}Bd{{ANh{}{{ANf{{B`{ce}}}}}}}}{{{ANn{ce}}g}AGj{}Bd{{ANh{}{{ANf{c}}}}}}{{{ANn{ce}}}{{AIn{c}}}{}{}}0{{{ANn{ce}}AHd}AHjBfBf}{cc{}}0000000{e{{ANn{cg}}}{}{{ANh{}{{ANf{c}}}}}Bd}{g{{ANn{ce}}}{}{}{{ANh{}{{ANf{{B`{ce}}}}}}}}{{{ANn{ce}}g}AGjBhBhAJ`}{{{ANn{ce}}AIh}g{}{}{}}0{{{ANn{ce}}AIhc}AGj{}Bd}{ce{}{}}0000000{{{ANn{ce}}}g{}{}{}}00111111{{{ANn{ce}}}{{AOl{ce}}}{}{}}{{{B`{ce}}}{{ALd{c{AIn{e}}}}}{}{}}{{{B`{ce}}}c{}{}}{{{ANn{ce}}}AGn{}{}}{{{ANn{ce}}}{{AJb{c}}}{}{}}{{{ANn{ce}}}{{AJd{c}}}{}{}}??{{{ANn{ce}}}AIh{}{}}{{{AOj{ce}}}AIh{}{}}{{{Bj{ce}}}AIh{}{}}{{{AOl{ce}}}AIh{}{}}{{{AOn{c}}}AIh{}}{{{AJb{c}}}AIh{}}{{{AJd{c}}}AIh{}}{{}{{ANn{ce}}}{}{}}{{c{AIn{e}}}{{B`{ce}}}{}{}}{{{AOj{ce}}}{{AIn{g}}}{}{}{}}{{{Bj{ce}}}{{AIn{g}}}{}{}{}}{{{AOl{ce}}}{{AIn{g}}}{}{}{}}{{{AOn{c}}}{{AIn{e}}}{}{}}{{{AJb{c}}}{{AIn{e}}}{}{}}{{{AJd{c}}}{{AIn{e}}}{}{}}543210{{{ANn{ce}}}{{AOj{ce}}}{}{}}{{{ANn{ce}}}{{Bj{ce}}}{}{}}{AKd{{l{{ANn{ce}}}}}AKb{BlAKb}}{{AKd{AMn{AKd}{{AKn{{l{c}}}}}}}{{l{{ANn{ce}}}}}{}{BlAKb}}{AKd{{l{{ANn{ce}}}}}AKbAKb}{{AKd{AMn{AKd}{{AKn{{l{c}}}}}}}{{l{{ANn{ce}}}}}{}AKb}{{{ANn{ce}}}{{AIn{{B`{ce}}}}}{}{}}{{{ANn{ce}}}{{AIn{e}}}{}{}}{{{B`{ce}}}{{AIn{e}}}{}{}}0{{{ANn{ce}}c}AGj{}Bd}{{{ANn{ce}}e}AGj{}{}}{{{ANn{ce}}c}AGj{}{}}{{{AOj{ce}}}{{ALd{AIh{AIn{AIh}}}}}{}{}}{{{Bj{ce}}}{{ALd{AIh{AIn{AIh}}}}}{}{}}{{{AOl{ce}}}{{ALd{AIh{AIn{AIh}}}}}{}{}}{{{AOn{c}}}{{ALd{AIh{AIn{AIh}}}}}{}}{{{AJb{c}}}{{ALd{AIh{AIn{AIh}}}}}{}}{{{AJd{c}}}{{ALd{AIh{AIn{AIh}}}}}{}}{cAJf{}}0{ce{}{}}00000{{{ANn{ce}}AKf}AGjANlANl}{{{B`{ce}}AKf}AGjANlANl}{{{ANn{ce}}}AGn{}{}}{c{{AHh{e}}}{}{}}000000000000000{cALh{}}0000000{{{B`{ce}}}c{}{}}0`{BnAJf}````````````````````````````````````````````````````````````````````````````````````````````````````````77777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777{BA`BA`}{AIfAIf}{BAbBAb}{BAdBAd}{BAfBAf}{BAhBAh}{BAjBAj}{BAlBAl}{BAnBAn}{BB`BB`}{BBbBBb}{BBdBBd}{AHnAHn}{BBfBBf}{BBhBBh}{BBjBBj}{BBlBBl}{BBnBBn}{AIdAId}{BC`BC`}{BCbBCb}{BCdBCd}{BCfBCf}{BChBCh}{BCjBCj}{BClBCl}{BCnBCn}{BD`BD`}{BDbBDb}{BDdBDd}{BDfBDf}{BDhBDh}{BDjBDj}{BDlBDl}{BDnBDn}{BE`BE`}{BEbBEb}{AI`AI`}{AHlAHl}{BEdBEd}{BEfBEf}{AIbAIb}{BEhBEh}{BEjBEj}{BElBEl}{BEnBEn}{BF`BF`}{BFbBFb}{BFdBFd}{BFfBFf}{BFhBFh}{BFjBFj}{BFlBFl}{BFnBFn}{BG`BG`}{BGbBGb}{BGdBGd}{BGfBGf}{BGhBGh}{BGjBGj}{BGlBGl}{BGnBGn}{BH`BH`}{BHbBHb}{BHdBHd}{BHfBHf}{BHhBHh}{BHjBHj}{BHlBHl}{BHnBHn}{BI`BI`}{BIbBIb}{BIdBId}{BIfBIf}{BIhBIh}{BIjBIj}{BIlBIl}{BInBIn}{BJ`BJ`}{BJbBJb}{BJdBJd}{BJfBJf}{BJhBJh}{BJjBJj}{BJlBJl}{BJnBJn}{BK`BK`}{BKbBKb}{BKdBKd}{BKfBKf}{BKhBKh}{BKjBKj}{BKlBKl}{BKnBKn}{BL`BL`}{BLbBLb}{BLdBLd}{BLfBLf}{BLhBLh}{BLjBLj}{BLlBLl}{BLnBLn}{BM`BM`}{{ce}AGj{}{}}000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000{{}BA`}{{}AIf}{{}BAb}{{}BAd}{{}BAf}{{}BAh}{{}BAj}{{}BAl}{{}BAn}{{}BB`}{{}BBb}{{}BBd}{{}AHn}{{}BBf}{{}BBh}{{}BBj}{{}BBl}{{}BBn}{{}AId}{{}BC`}{{}BCb}{{}BCd}{{}BCf}{{}BCh}{{}BCj}{{}BCl}{{}BCn}{{}BD`}{{}BDb}{{}BDd}{{}BDf}{{}BDh}{{}BDj}{{}BDl}{{}BDn}{{}BE`}{{}BEb}{{}AI`}{{}AHl}{{}BEd}{{}BEf}{{}AIb}{{}BEh}{{}BEj}{{}BEl}{{}BEn}{{}BF`}{{}BFb}{{}BFd}{{}BFf}{{}BFh}{{}BFj}{{}BFl}{{}BFn}{{}BG`}{{}BGb}{{}BGd}{{}BGf}{{}BGh}{{}BGj}{{}BGl}{{}BGn}{{}BH`}{{}BHb}{{}BHd}{{}BHf}{{}BHh}{{}BHj}{{}BHl}{{}BHn}{{}BI`}{{}BIb}{{}BId}{{}BIf}{{}BIh}{{}BIj}{{}BIl}{{}BIn}{{}BJ`}{{}BJb}{{}BJd}{{}BJf}{{}BJh}{{}BJj}{{}BJl}{{}BJn}{{}BK`}{{}BKb}{{}BKd}{{}BKf}{{}BKh}{{}BKj}{{}BKl}{{}BKn}{{}BL`}{{}BLb}{{}BLd}{{}BLf}{{}BLh}{{}BLj}{{}BLl}{{}BLn}{{}BM`}{AIfc{}}{BG`c{}}{BGfc{}}{BGhc{}}{BGlc{}}{BGnc{}}{BH`c{}}{BHbc{}}{BHjc{}}{BIbc{}}{BIhc{}}{BIjc{}}{BJ`c{}}{BJbc{}}{BJjc{}}{BJnc{}}{BKbc{}}{BKdc{}}{BKhc{}}{BLbc{}}{BLfc{}}{BLjc{}}{AIfc{}}{BG`c{}}{BGfc{}}{BGhc{}}{BGlc{}}{BGnc{}}{BH`c{}}{BHbc{}}{BHjc{}}{BIbc{}}{BIhc{}}{BIjc{}}{BJ`c{}}{BJbc{}}{BJjc{}}{BJnc{}}{BKbc{}}{BKdc{}}{BKhc{}}{BLbc{}}{BLfc{}}{BLjc{}}{{BA`BA`}AGn}{{AIfAIf}AGn}{{BAbBAb}AGn}{{BAdBAd}AGn}{{BAfBAf}AGn}{{BAhBAh}AGn}{{BAjBAj}AGn}{{BAlBAl}AGn}{{BAnBAn}AGn}{{BB`BB`}AGn}{{BBbBBb}AGn}{{BBdBBd}AGn}{{AHnAHn}AGn}{{BBfBBf}AGn}{{BBhBBh}AGn}{{BBjBBj}AGn}{{BBlBBl}AGn}{{BBnBBn}AGn}{{AIdAId}AGn}{{BC`BC`}AGn}{{BCbBCb}AGn}{{BCdBCd}AGn}{{BCfBCf}AGn}{{BChBCh}AGn}{{BCjBCj}AGn}{{BClBCl}AGn}{{BCnBCn}AGn}{{BD`BD`}AGn}{{BDbBDb}AGn}{{BDdBDd}AGn}{{BDfBDf}AGn}{{BDhBDh}AGn}{{BDjBDj}AGn}{{BDlBDl}AGn}{{BDnBDn}AGn}{{BE`BE`}AGn}{{BEbBEb}AGn}{{AI`AI`}AGn}{{AHlAHl}AGn}{{BEdBEd}AGn}{{BEfBEf}AGn}{{AIbAIb}AGn}{{BEhBEh}AGn}{{BEjBEj}AGn}{{BElBEl}AGn}{{BEnBEn}AGn}{{BF`BF`}AGn}{{BFbBFb}AGn}{{BFdBFd}AGn}{{BFfBFf}AGn}{{BFhBFh}AGn}{{BFjBFj}AGn}{{BFlBFl}AGn}{{BFnBFn}AGn}{{BG`BG`}AGn}{{BGbBGb}AGn}{{BGdBGd}AGn}{{BGfBGf}AGn}{{BGhBGh}AGn}{{BGjBGj}AGn}{{BGlBGl}AGn}{{BGnBGn}AGn}{{BH`BH`}AGn}{{BHbBHb}AGn}{{BHdBHd}AGn}{{BHfBHf}AGn}{{BHhBHh}AGn}{{BHjBHj}AGn}{{BHlBHl}AGn}{{BHnBHn}AGn}{{BI`BI`}AGn}{{BIbBIb}AGn}{{BIdBId}AGn}{{BIfBIf}AGn}{{BIhBIh}AGn}{{BIjBIj}AGn}{{BIlBIl}AGn}{{BInBIn}AGn}{{BJ`BJ`}AGn}{{BJbBJb}AGn}{{BJdBJd}AGn}{{BJfBJf}AGn}{{BJhBJh}AGn}{{BJjBJj}AGn}{{BJlBJl}AGn}{{BJnBJn}AGn}{{BK`BK`}AGn}{{BKbBKb}AGn}{{BKdBKd}AGn}{{BKfBKf}AGn}{{BKhBKh}AGn}{{BKjBKj}AGn}{{BKlBKl}AGn}{{BKnBKn}AGn}{{BL`BL`}AGn}{{BLbBLb}AGn}{{BLdBLd}AGn}{{BLfBLf}AGn}{{BLhBLh}AGn}{{BLjBLj}AGn}{{BLlBLl}AGn}{{BLnBLn}AGn}{{BM`BM`}AGn}{{BA`AHd}AHj}{{AIfAHd}AHj}{{BAbAHd}AHj}{{BAdAHd}AHj}{{BAfAHd}AHj}{{BAhAHd}AHj}{{BAjAHd}AHj}{{BAlAHd}AHj}{{BAnAHd}AHj}{{BB`AHd}AHj}{{BBbAHd}AHj}{{BBdAHd}AHj}{{AHnAHd}AHj}{{BBfAHd}AHj}{{BBhAHd}AHj}{{BBjAHd}AHj}{{BBlAHd}AHj}{{BBnAHd}AHj}{{AIdAHd}AHj}{{BC`AHd}AHj}{{BCbAHd}AHj}{{BCdAHd}AHj}{{BCfAHd}AHj}{{BChAHd}AHj}{{BCjAHd}AHj}{{BClAHd}AHj}{{BCnAHd}AHj}{{BD`AHd}AHj}{{BDbAHd}AHj}{{BDdAHd}AHj}{{BDfAHd}AHj}{{BDhAHd}AHj}{{BDjAHd}AHj}{{BDlAHd}AHj}{{BDnAHd}AHj}{{BE`AHd}AHj}{{BEbAHd}AHj}{{AI`AHd}AHj}{{AHlAHd}AHj}{{BEdAHd}AHj}{{BEfAHd}AHj}{{AIbAHd}AHj}{{BEhAHd}AHj}{{BEjAHd}AHj}{{BElAHd}AHj}{{BEnAHd}AHj}{{BF`AHd}AHj}{{BFbAHd}AHj}{{BFdAHd}AHj}{{BFfAHd}AHj}{{BFhAHd}AHj}{{BFjAHd}AHj}{{BFlAHd}AHj}{{BFnAHd}AHj}{{BG`AHd}AHj}{{BGbAHd}AHj}{{BGdAHd}AHj}{{BGfAHd}AHj}{{BGhAHd}AHj}{{BGjAHd}AHj}{{BGlAHd}AHj}{{BGnAHd}AHj}{{BH`AHd}AHj}{{BHbAHd}AHj}{{BHdAHd}AHj}{{BHfAHd}AHj}{{BHhAHd}AHj}{{BHjAHd}AHj}{{BHlAHd}AHj}{{BHnAHd}AHj}{{BI`AHd}AHj}{{BIbAHd}AHj}{{BIdAHd}AHj}{{BIfAHd}AHj}{{BIhAHd}AHj}{{BIjAHd}AHj}{{BIlAHd}AHj}{{BInAHd}AHj}{{BJ`AHd}AHj}{{BJbAHd}AHj}{{BJdAHd}AHj}{{BJfAHd}AHj}{{BJhAHd}AHj}{{BJjAHd}AHj}{{BJlAHd}AHj}{{BJnAHd}AHj}{{BK`AHd}AHj}{{BKbAHd}AHj}{{BKdAHd}AHj}{{BKfAHd}AHj}{{BKhAHd}AHj}{{BKjAHd}AHj}{{BKlAHd}AHj}{{BKnAHd}AHj}{{BL`AHd}AHj}{{BLbAHd}AHj}{{BLdAHd}AHj}{{BLfAHd}AHj}{{BLhAHd}AHj}{{BLjAHd}AHj}{{BLlAHd}AHj}{{BLnAHd}AHj}{{BM`AHd}AHj}{cc{}}000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000{{BA`c}AGjAJ`}{{AIfc}AGjAJ`}{{BAbc}AGjAJ`}{{BAdc}AGjAJ`}{{BAfc}AGjAJ`}{{BAhc}AGjAJ`}{{BAjc}AGjAJ`}{{BAlc}AGjAJ`}{{BAnc}AGjAJ`}{{BB`c}AGjAJ`}{{BBbc}AGjAJ`}{{BBdc}AGjAJ`}{{AHnc}AGjAJ`}{{BBfc}AGjAJ`}{{BBhc}AGjAJ`}{{BBjc}AGjAJ`}{{BBlc}AGjAJ`}{{BBnc}AGjAJ`}{{AIdc}AGjAJ`}{{BC`c}AGjAJ`}{{BCbc}AGjAJ`}{{BCdc}AGjAJ`}{{BCfc}AGjAJ`}{{BChc}AGjAJ`}{{BCjc}AGjAJ`}{{BClc}AGjAJ`}{{BCnc}AGjAJ`}{{BD`c}AGjAJ`}{{BDbc}AGjAJ`}{{BDdc}AGjAJ`}{{BDfc}AGjAJ`}{{BDhc}AGjAJ`}{{BDjc}AGjAJ`}{{BDlc}AGjAJ`}{{BDnc}AGjAJ`}{{BE`c}AGjAJ`}{{BEbc}AGjAJ`}{{AI`c}AGjAJ`}{{AHlc}AGjAJ`}{{BEdc}AGjAJ`}{{BEfc}AGjAJ`}{{AIbc}AGjAJ`}{{BEhc}AGjAJ`}{{BEjc}AGjAJ`}{{BElc}AGjAJ`}{{BEnc}AGjAJ`}{{BF`c}AGjAJ`}{{BFbc}AGjAJ`}{{BFdc}AGjAJ`}{{BFfc}AGjAJ`}{{BFhc}AGjAJ`}{{BFjc}AGjAJ`}{{BFlc}AGjAJ`}{{BFnc}AGjAJ`}{{BG`c}AGjAJ`}{{BGbc}AGjAJ`}{{BGdc}AGjAJ`}{{BGfc}AGjAJ`}{{BGhc}AGjAJ`}{{BGjc}AGjAJ`}{{BGlc}AGjAJ`}{{BGnc}AGjAJ`}{{BH`c}AGjAJ`}{{BHbc}AGjAJ`}{{BHdc}AGjAJ`}{{BHfc}AGjAJ`}{{BHhc}AGjAJ`}{{BHjc}AGjAJ`}{{BHlc}AGjAJ`}{{BHnc}AGjAJ`}{{BI`c}AGjAJ`}{{BIbc}AGjAJ`}{{BIdc}AGjAJ`}{{BIfc}AGjAJ`}{{BIhc}AGjAJ`}{{BIjc}AGjAJ`}{{BIlc}AGjAJ`}{{BInc}AGjAJ`}{{BJ`c}AGjAJ`}{{BJbc}AGjAJ`}{{BJdc}AGjAJ`}{{BJfc}AGjAJ`}{{BJhc}AGjAJ`}{{BJjc}AGjAJ`}{{BJlc}AGjAJ`}{{BJnc}AGjAJ`}{{BK`c}AGjAJ`}{{BKbc}AGjAJ`}{{BKdc}AGjAJ`}{{BKfc}AGjAJ`}{{BKhc}AGjAJ`}{{BKjc}AGjAJ`}{{BKlc}AGjAJ`}{{BKnc}AGjAJ`}{{BL`c}AGjAJ`}{{BLbc}AGjAJ`}{{BLdc}AGjAJ`}{{BLfc}AGjAJ`}{{BLhc}AGjAJ`}{{BLjc}AGjAJ`}{{BLlc}AGjAJ`}{{BLnc}AGjAJ`}{{BM`c}AGjAJ`}{ce{}{}}000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000{AKd{{l{AIf}}}}{AKd{{l{BAb}}}}{AKd{{l{BAd}}}}{AKd{{l{BAf}}}}{AKd{{l{BAh}}}}{AKd{{l{BAj}}}}{AKd{{l{BAl}}}}{AKd{{l{BAn}}}}{AKd{{l{BB`}}}}{AKd{{l{BBb}}}}{AKd{{l{BBd}}}}{AKd{{l{AHn}}}}{AKd{{l{BBf}}}}{AKd{{l{BBh}}}}{AKd{{l{BBj}}}}{AKd{{l{BBl}}}}{AKd{{l{BBn}}}}{AKd{{l{AId}}}}{AKd{{l{BC`}}}}{AKd{{l{BCb}}}}{AKd{{l{BCd}}}}{AKd{{l{BCf}}}}{AKd{{l{BCh}}}}{AKd{{l{BCj}}}}{AKd{{l{BCl}}}}{AKd{{l{BCn}}}}{AKd{{l{BD`}}}}{AKd{{l{BDb}}}}{AKd{{l{BDd}}}}{AKd{{l{BDf}}}}{AKd{{l{BDh}}}}{AKd{{l{BDj}}}}{AKd{{l{BDl}}}}{AKd{{l{BDn}}}}{AKd{{l{BE`}}}}{AKd{{l{BEb}}}}{AKd{{l{AI`}}}}{AKd{{l{AHl}}}}{AKd{{l{BEd}}}}{AKd{{l{BEf}}}}{AKd{{l{AIb}}}}{AKd{{l{BEh}}}}{AKd{{l{BEj}}}}{AKd{{l{BEl}}}}{AKd{{l{BEn}}}}{AKd{{l{BF`}}}}{AKd{{l{BFb}}}}{AKd{{l{BFd}}}}{AKd{{l{BFf}}}}{AKd{{l{BFh}}}}{AKd{{l{BFj}}}}{AKd{{l{BFl}}}}{AKd{{l{BFn}}}}{AKd{{l{BG`}}}}{AKd{{l{BGb}}}}{AKd{{l{BGd}}}}{AKd{{l{BGf}}}}{AKd{{l{BGh}}}}{AKd{{l{BGj}}}}{AKd{{l{BGl}}}}{AKd{{l{BGn}}}}{AKd{{l{BH`}}}}{AKd{{l{BHb}}}}{AKd{{l{BHd}}}}{AKd{{l{BHf}}}}{AKd{{l{BHh}}}}{AKd{{l{BHj}}}}{AKd{{l{BHl}}}}{AKd{{l{BHn}}}}{AKd{{l{BI`}}}}{AKd{{l{BIb}}}}{AKd{{l{BId}}}}{AKd{{l{BIf}}}}{AKd{{l{BIh}}}}{AKd{{l{BIj}}}}{AKd{{l{BIl}}}}{AKd{{l{BIn}}}}{AKd{{l{BJ`}}}}{AKd{{l{BJb}}}}{AKd{{l{BJd}}}}{AKd{{l{BJf}}}}{AKd{{l{BJh}}}}{AKd{{l{BJj}}}}{AKd{{l{BJl}}}}{AKd{{l{BJn}}}}{AKd{{l{BK`}}}}{AKd{{l{BKb}}}}{AKd{{l{BKd}}}}{AKd{{l{BKf}}}}{AKd{{l{BKh}}}}{AKd{{l{BKj}}}}{AKd{{l{BKl}}}}{AKd{{l{BKn}}}}{AKd{{l{BL`}}}}{AKd{{l{BLb}}}}{AKd{{l{BLd}}}}{AKd{{l{BLf}}}}{AKd{{l{BLh}}}}{AKd{{l{BLj}}}}{cAJf{}}00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000```````````````````````````````````````````````````````````````````````````````````````````````````````{{BA`AKfc}AGj{{AOb{AKf}}}}{{BLlAKfc}AGj{{AOb{AKf}}}}{{BLnAKfc}AGj{{AOb{AKf}}}}{{BM`AKfc}AGj{{AOb{AKf}}}}{ce{}{}}000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000{{AIfAKf}AGj}{{BAbAKf}AGj}{{BAdAKf}AGj}{{BAfAKf}AGj}{{BAhAKf}AGj}{{BAjAKf}AGj}{{BAlAKf}AGj}{{BAnAKf}AGj}{{BB`AKf}AGj}{{BBbAKf}AGj}{{BBdAKf}AGj}{{AHnAKf}AGj}{{BBfAKf}AGj}{{BBhAKf}AGj}{{BBjAKf}AGj}{{BBlAKf}AGj}{{BBnAKf}AGj}{{AIdAKf}AGj}{{BC`AKf}AGj}{{BCbAKf}AGj}{{BCdAKf}AGj}{{BCfAKf}AGj}{{BChAKf}AGj}{{BCjAKf}AGj}{{BClAKf}AGj}{{BCnAKf}AGj}{{BD`AKf}AGj}{{BDbAKf}AGj}{{BDdAKf}AGj}{{BDfAKf}AGj}{{BDhAKf}AGj}{{BDjAKf}AGj}{{BDlAKf}AGj}{{BDnAKf}AGj}{{BE`AKf}AGj}{{BEbAKf}AGj}{{AI`AKf}AGj}{{AHlAKf}AGj}{{BEdAKf}AGj}{{BEfAKf}AGj}{{AIbAKf}AGj}{{BEhAKf}AGj}{{BEjAKf}AGj}{{BElAKf}AGj}{{BEnAKf}AGj}{{BF`AKf}AGj}{{BFbAKf}AGj}{{BFdAKf}AGj}{{BFfAKf}AGj}{{BFhAKf}AGj}{{BFjAKf}AGj}{{BFlAKf}AGj}{{BFnAKf}AGj}{{BG`AKf}AGj}{{BGbAKf}AGj}{{BGdAKf}AGj}{{BGfAKf}AGj}{{BGhAKf}AGj}{{BGjAKf}AGj}{{BGlAKf}AGj}{{BGnAKf}AGj}{{BH`AKf}AGj}{{BHbAKf}AGj}{{BHdAKf}AGj}{{BHfAKf}AGj}{{BHhAKf}AGj}{{BHjAKf}AGj}{{BHlAKf}AGj}{{BHnAKf}AGj}{{BI`AKf}AGj}{{BIbAKf}AGj}{{BIdAKf}AGj}{{BIfAKf}AGj}{{BIhAKf}AGj}{{BIjAKf}AGj}{{BIlAKf}AGj}{{BInAKf}AGj}{{BJ`AKf}AGj}{{BJbAKf}AGj}{{BJdAKf}AGj}{{BJfAKf}AGj}{{BJhAKf}AGj}{{BJjAKf}AGj}{{BJlAKf}AGj}{{BJnAKf}AGj}{{BK`AKf}AGj}{{BKbAKf}AGj}{{BKdAKf}AGj}{{BKfAKf}AGj}{{BKhAKf}AGj}{{BKjAKf}AGj}{{BKlAKf}AGj}{{BKnAKf}AGj}{{BL`AKf}AGj}{{BLbAKf}AGj}{{BLdAKf}AGj}{{BLfAKf}AGj}{{BLhAKf}AGj}{{BLjAKf}AGj}{c{{AHh{e}}}{}{}}0000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000{cALh{}}000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000`{{cAGb}AGj{BMbAHb}}{{BMbAGb}AGj}0{{cACh}AGj{BMbAHb}}{{BMbACh}AGj}0{{cHj}AGj{BMbAHb}}{{BMbHj}AGj}0{{cACl}AGj{BMbAHb}}{{BMbACl}AGj}0{{cACj}AGj{BMbAHb}}{{BMbACj}AGj}0{{cAh}AGj{BMbAHb}}{{BMbAh}AGj}0{{cAf}AGj{BMbAHb}}{{BMbAf}AGj}0{{cAGd}AGj{BMbAHb}}{{BMbAGd}AGj}0{{cAGf}AGj{BMbAHb}}{{BMbAGf}AGj}0{{cAAb}AGj{BMbAHb}}{{BMbAAb}AGj}0{{cADj}AGj{BMbAHb}}{{BMbADj}AGj}0{{cIj}AGj{BMbAHb}}{{BMbIj}AGj}0{{cIh}AGj{BMbAHb}}{{BMbIh}AGj}0{{cACn}AGj{BMbAHb}}{{BMbACn}AGj}0{{cC`}AGj{BMbAHb}}{{BMbC`}AGj}0{{cBl}AGj{BMbAHb}}{{BMbBl}AGj}0{{cBn}AGj{BMbAHb}}{{BMbBn}AGj}0{{cCb}AGj{BMbAHb}}{{BMbCb}AGj}0{{cBj}AGj{BMbAHb}}{{BMbBj}AGj}0{{cCf}AGj{BMbAHb}}{{BMbCf}AGj}0{{cCh}AGj{BMbAHb}}{{BMbCh}AGj}0{{cCj}AGj{BMbAHb}}{{BMbCj}AGj}0{{cCl}AGj{BMbAHb}}{{BMbCl}AGj}0{{cCn}AGj{BMbAHb}}{{BMbCn}AGj}0{{cD`}AGj{BMbAHb}}{{BMbD`}AGj}0{{cDb}AGj{BMbAHb}}{{BMbDb}AGj}0{{cDd}AGj{BMbAHb}}{{BMbDd}AGj}0{{cDf}AGj{BMbAHb}}{{BMbDf}AGj}0{{cDh}AGj{BMbAHb}}{{BMbDh}AGj}0{{cDj}AGj{BMbAHb}}{{BMbDj}AGj}0{{cDl}AGj{BMbAHb}}{{BMbDl}AGj}0{{cDn}AGj{BMbAHb}}{{BMbDn}AGj}0{{cE`}AGj{BMbAHb}}{{BMbE`}AGj}0{{cEb}AGj{BMbAHb}}{{BMbEb}AGj}0{{cEd}AGj{BMbAHb}}{{BMbEd}AGj}0{{cEf}AGj{BMbAHb}}{{BMbEf}AGj}0{{cEh}AGj{BMbAHb}}{{BMbEh}AGj}0{{cEj}AGj{BMbAHb}}{{BMbEj}AGj}0{{cEl}AGj{BMbAHb}}{{BMbEl}AGj}0{{cEn}AGj{BMbAHb}}{{BMbEn}AGj}0{{cF`}AGj{BMbAHb}}{{BMbF`}AGj}0{{cFb}AGj{BMbAHb}}{{BMbFb}AGj}0{{cFd}AGj{BMbAHb}}{{BMbFd}AGj}0{{cCd}AGj{BMbAHb}}{{BMbCd}AGj}0{{cFf}AGj{BMbAHb}}{{BMbFf}AGj}0{{cFh}AGj{BMbAHb}}{{BMbFh}AGj}0{{cFj}AGj{BMbAHb}}{{BMbFj}AGj}0{{cFl}AGj{BMbAHb}}{{BMbFl}AGj}0{{cFn}AGj{BMbAHb}}{{BMbFn}AGj}0{{cG`}AGj{BMbAHb}}{{BMbG`}AGj}0{{cGb}AGj{BMbAHb}}{{BMbGb}AGj}0{{cGf}AGj{BMbAHb}}{{BMbGf}AGj}0{{cGd}AGj{BMbAHb}}{{BMbGd}AGj}0{{cGh}AGj{BMbAHb}}{{BMbGh}AGj}0{{cGj}AGj{BMbAHb}}{{BMbGj}AGj}0{{cGl}AGj{BMbAHb}}{{BMbGl}AGj}0{{cGn}AGj{BMbAHb}}{{BMbGn}AGj}0{{cH`}AGj{BMbAHb}}{{BMbH`}AGj}0{{cBh}AGj{BMbAHb}}{{BMbBh}AGj}0{{cADh}AGj{BMbAHb}}{{BMbADh}AGj}0{{cABn}AGj{BMbAHb}}{{BMbABn}AGj}0{{cHf}AGj{BMbAHb}}{{BMbHf}AGj}0{{cBb}AGj{BMbAHb}}{{BMbBb}AGj}0{{cBd}AGj{BMbAHb}}{{BMbBd}AGj}0{{cBf}AGj{BMbAHb}}{{BMbBf}AGj}0{{cHn}AGj{BMbAHb}}{{BMbHn}AGj}0{{cOf}AGj{BMbAHb}}{{BMbOf}AGj}0{{cMh}AGj{BMbAHb}}{{BMbMh}AGj}0{{cMn}AGj{BMbAHb}}{{BMbMn}AGj}0{{cMf}AGj{BMbAHb}}{{BMbMf}AGj}0{{cMj}AGj{BMbAHb}}{{BMbMj}AGj}0{{cMl}AGj{BMbAHb}}{{BMbMl}AGj}0{{cACf}AGj{BMbAHb}}{{BMbACf}AGj}0{{cIb}AGj{BMbAHb}}{{BMbIb}AGj}0{{cI`}AGj{BMbAHb}}{{BMbI`}AGj}0{{cA`}AGj{BMbAHb}}{{BMbA`}AGj}0{{cNl}AGj{BMbAHb}}{{BMbNl}AGj}0{{cNn}AGj{BMbAHb}}{{BMbNn}AGj}0{{cOb}AGj{BMbAHb}}{{BMbOb}AGj}0{{cNj}AGj{BMbAHb}}{{BMbNj}AGj}0{{cO`}AGj{BMbAHb}}{{BMbO`}AGj}0{{cOn}AGj{BMbAHb}}{{BMbOn}AGj}0{{cHd}AGj{BMbAHb}}{{BMbHd}AGj}0{{cJl}AGj{BMbAHb}}{{BMbJl}AGj}0{{cJn}AGj{BMbAHb}}{{BMbJn}AGj}0{{cK`}AGj{BMbAHb}}{{BMbK`}AGj}0{{cKb}AGj{BMbAHb}}{{BMbKb}AGj}0{{cKd}AGj{BMbAHb}}{{BMbKd}AGj}0{{cKf}AGj{BMbAHb}}{{BMbKf}AGj}0{{cKh}AGj{BMbAHb}}{{BMbKh}AGj}0{{cKj}AGj{BMbAHb}}{{BMbKj}AGj}0{{cJj}AGj{BMbAHb}}{{BMbJj}AGj}0{{cKl}AGj{BMbAHb}}{{BMbKl}AGj}0{{cKn}AGj{BMbAHb}}{{BMbKn}AGj}0{{cLb}AGj{BMbAHb}}{{BMbLb}AGj}0{{cL`}AGj{BMbAHb}}{{BMbL`}AGj}0{{cLd}AGj{BMbAHb}}{{BMbLd}AGj}0{{cLf}AGj{BMbAHb}}{{BMbLf}AGj}0{{cLh}AGj{BMbAHb}}{{BMbLh}AGj}0{{cHh}AGj{BMbAHb}}{{BMbHh}AGj}0{{cAd}AGj{BMbAHb}}{{BMbAd}AGj}0{{cId}AGj{BMbAHb}}{{BMbId}AGj}0{{cAl}AGj{BMbAHb}}{{BMbAl}AGj}0{{cAh}AGj{BMbAHb}}{{BMbAh}AGj}0{{cAd}AGj{BMbAHb}}{{BMbAd}AGj}0{{cAj}AGj{BMbAHb}}{{BMbAj}AGj}0{{cAf}AGj{BMbAHb}}{{BMbAf}AGj}0{{cj}AGj{BMbAHb}}{{BMbj}AGj}0{{cf}AGj{BMbAHb}}{{BMbf}AGj}0{{cA`}AGj{BMbAHb}}{{BMbA`}AGj}0{{cAb}AGj{BMbAHb}}{{BMbAb}AGj}0{{cAE`}AGj{BMbAHb}}{{BMbAE`}AGj}0{{cADn}AGj{BMbAHb}}{{BMbADn}AGj}0{{cAA`}AGj{BMbAHb}}{{BMbAA`}AGj}0{{cAn}AGj{BMbAHb}}{{BMbAn}AGj}0{{cHb}AGj{BMbAHb}}{{BMbHb}AGj}0{{cAl}AGj{BMbAHb}}{{BMbAl}AGj}0{{cAj}AGj{BMbAHb}}{{BMbAj}AGj}0{{cAn}AGj{BMbAHb}}{{BMbAn}AGj}0{{cAD`}AGj{BMbAHb}}{{BMbAD`}AGj}0{{cAAh}AGj{BMbAHb}}{{BMbAAh}AGj}0{{cAAf}AGj{BMbAHb}}{{BMbAAf}AGj}0{{cAAj}AGj{BMbAHb}}{{BMbAAj}AGj}0{{cAAl}AGj{BMbAHb}}{{BMbAAl}AGj}0{{cAAn}AGj{BMbAHb}}{{BMbAAn}AGj}0{{cAB`}AGj{BMbAHb}}{{BMbAB`}AGj}0{{cABb}AGj{BMbAHb}}{{BMbABb}AGj}0{{cABd}AGj{BMbAHb}}{{BMbABd}AGj}0{{cABf}AGj{BMbAHb}}{{BMbABf}AGj}0{{cABh}AGj{BMbAHb}}{{BMbABh}AGj}0{{cABj}AGj{BMbAHb}}{{BMbABj}AGj}0{{cABl}AGj{BMbAHb}}{{BMbABl}AGj}0{{cACd}AGj{BMbAHb}}{{BMbACd}AGj}0{{cAC`}AGj{BMbAHb}}{{BMbAC`}AGj}0{{cACb}AGj{BMbAHb}}{{BMbACb}AGj}0{{cJf}AGj{BMbAHb}}{{BMbJf}AGj}0{{cJh}AGj{BMbAHb}}{{BMbJh}AGj}0{{cADb}AGj{BMbAHb}}{{BMbADb}AGj}0{{cHl}AGj{BMbAHb}}{{BMbHl}AGj}0{{cOh}AGj{BMbAHb}}{{BMbOh}AGj}0{{cAGh}AGj{BMbAHb}}{{BMbAGh}AGj}0{{cOd}AGj{BMbAHb}}{{BMbOd}AGj}0{{cAJf}AGj{BMbAHb}}{{BMbAJf}AGj}0{{cOl}AGj{BMbAHb}}{{BMbOl}AGj}0{{cAEb}AGj{BMbAHb}}{{BMbAEb}AGj}0{{cADl}AGj{BMbAHb}}{{BMbADl}AGj}0{{cJ`}AGj{BMbAHb}}{{BMbJ`}AGj}0{{cIn}AGj{BMbAHb}}{{BMbIn}AGj}0{{cNb}AGj{BMbAHb}}{{BMbNb}AGj}0{{cNd}AGj{BMbAHb}}{{BMbNd}AGj}0{{cNh}AGj{BMbAHb}}{{BMbNh}AGj}0{{cN`}AGj{BMbAHb}}{{BMbN`}AGj}0{{cNf}AGj{BMbAHb}}{{BMbNf}AGj}0{{cAEf}AGj{BMbAHb}}{{BMbAEf}AGj}0{{cAEh}AGj{BMbAHb}}{{BMbAEh}AGj}0{{cAEj}AGj{BMbAHb}}{{BMbAEj}AGj}0{{cAEl}AGj{BMbAHb}}{{BMbAEl}AGj}0{{cAEn}AGj{BMbAHb}}{{BMbAEn}AGj}0{{cAF`}AGj{BMbAHb}}{{BMbAF`}AGj}0{{cAEd}AGj{BMbAHb}}{{BMbAEd}AGj}0{{cAFb}AGj{BMbAHb}}{{BMbAFb}AGj}0{{cIl}AGj{BMbAHb}}{{BMbIl}AGj}0{{cIf}AGj{BMbAHb}}{{BMbIf}AGj}0{{cAFd}AGj{BMbAHb}}{{BMbAFd}AGj}0{{cAFf}AGj{BMbAHb}}{{BMbAFf}AGj}0{{cAFh}AGj{BMbAHb}}{{BMbAFh}AGj}0{{cAFj}AGj{BMbAHb}}{{BMbAFj}AGj}0{{cAFl}AGj{BMbAHb}}{{BMbAFl}AGj}0{{cAFn}AGj{BMbAHb}}{{BMbAFn}AGj}0{{cAG`}AGj{BMbAHb}}{{BMbAG`}AGj}0{{cAAd}AGj{BMbAHb}}{{BMbAAd}AGj}0{{cMb}AGj{BMbAHb}}{{BMbMb}AGj}0{{cMd}AGj{BMbAHb}}{{BMbMd}AGj}0{{cLn}AGj{BMbAHb}}{{BMbLn}AGj}0{{cLl}AGj{BMbAHb}}{{BMbLl}AGj}0{{cM`}AGj{BMbAHb}}{{BMbM`}AGj}0{{cLj}AGj{BMbAHb}}{{BMbLj}AGj}0{{cOj}AGj{BMbAHb}}{{BMbOj}AGj}0{{cB`}AGj{BMbAHb}}{{BMbB`}AGj}0{{cADf}AGj{BMbAHb}}{{BMbADf}AGj}0{{cADd}AGj{BMbAHb}}{{BMbADd}AGj}0{{cJb}AGj{BMbAHb}}{{BMbJb}AGj}0{{cJd}AGj{BMbAHb}}{{BMbJd}AGj}0","c":[],"p":[[5,"TypeGenerics",0],[5,"Turbofish",0],[5,"LitInt",0],[1,"str"],[5,"LitFloat",0],[8,"Result",4258],[10,"FromStr",7077],[5,"Ident",0],[5,"ImplGenerics",0],[5,"Lifetime",0],[5,"Attribute",0],[6,"AttrStyle",0],[6,"Meta",0],[5,"MetaList",0],[5,"MetaNameValue",0],[5,"Variant",0],[6,"Fields",0],[5,"FieldsNamed",0],[5,"FieldsUnnamed",0],[5,"Field",0],[5,"DeriveInput",0],[6,"Data",0],[5,"DataStruct",0],[5,"DataEnum",0],[5,"DataUnion",0],[6,"Expr",0],[5,"ExprArray",0],[5,"ExprAssign",0],[5,"ExprAsync",0],[5,"ExprAwait",0],[5,"ExprBinary",0],[5,"ExprBlock",0],[5,"ExprBreak",0],[5,"ExprCall",0],[5,"ExprCast",0],[5,"ExprClosure",0],[5,"ExprConst",0],[5,"ExprContinue",0],[5,"ExprField",0],[5,"ExprForLoop",0],[5,"ExprGroup",0],[5,"ExprIf",0],[5,"ExprIndex",0],[5,"ExprInfer",0],[5,"ExprLet",0],[5,"ExprLit",0],[5,"ExprLoop",0],[5,"ExprMacro",0],[5,"ExprMatch",0],[5,"ExprMethodCall",0],[5,"ExprParen",0],[5,"ExprPath",0],[5,"ExprRange",0],[5,"ExprReference",0],[5,"ExprRepeat",0],[5,"ExprReturn",0],[5,"ExprStruct",0],[5,"ExprTry",0],[5,"ExprTryBlock",0],[5,"ExprTuple",0],[5,"ExprUnary",0],[5,"ExprUnsafe",0],[5,"ExprWhile",0],[5,"ExprYield",0],[6,"Member",0],[5,"Index",0],[5,"FieldValue",0],[5,"Label",0],[5,"Arm",0],[6,"RangeLimits",0],[5,"File",0],[5,"Generics",0],[6,"GenericParam",0],[5,"LifetimeParam",0],[5,"TypeParam",0],[5,"ConstParam",0],[5,"BoundLifetimes",0],[6,"TypeParamBound",0],[5,"TraitBound",0],[6,"TraitBoundModifier",0],[5,"WhereClause",0],[6,"WherePredicate",0],[5,"PredicateLifetime",0],[5,"PredicateType",0],[6,"Item",0],[5,"ItemConst",0],[5,"ItemEnum",0],[5,"ItemExternCrate",0],[5,"ItemFn",0],[5,"ItemForeignMod",0],[5,"ItemImpl",0],[5,"ItemMacro",0],[5,"ItemMod",0],[5,"ItemStatic",0],[5,"ItemStruct",0],[5,"ItemTrait",0],[5,"ItemTraitAlias",0],[5,"ItemType",0],[5,"ItemUnion",0],[5,"ItemUse",0],[6,"UseTree",0],[5,"UsePath",0],[5,"UseName",0],[5,"UseRename",0],[5,"UseGlob",0],[5,"UseGroup",0],[6,"ForeignItem",0],[5,"ForeignItemFn",0],[5,"ForeignItemStatic",0],[5,"ForeignItemType",0],[5,"ForeignItemMacro",0],[6,"TraitItem",0],[5,"TraitItemConst",0],[5,"TraitItemFn",0],[5,"TraitItemType",0],[5,"TraitItemMacro",0],[6,"ImplItem",0],[5,"ImplItemConst",0],[5,"ImplItemFn",0],[5,"ImplItemType",0],[5,"ImplItemMacro",0],[5,"Signature",0],[6,"FnArg",0],[5,"Receiver",0],[5,"Variadic",0],[6,"StaticMutability",0],[6,"ImplRestriction",0],[6,"Lit",0],[5,"LitStr",0],[5,"LitByteStr",0],[5,"LitCStr",0],[5,"LitByte",0],[5,"LitChar",0],[5,"LitBool",0],[5,"Macro",0],[6,"MacroDelimiter",0],[6,"BinOp",0],[6,"UnOp",0],[6,"Pat",0],[5,"PatIdent",0],[5,"PatOr",0],[5,"PatParen",0],[5,"PatReference",0],[5,"PatRest",0],[5,"PatSlice",0],[5,"PatStruct",0],[5,"PatTuple",0],[5,"PatTupleStruct",0],[5,"PatType",0],[5,"PatWild",0],[5,"FieldPat",0],[5,"Path",0],[5,"PathSegment",0],[6,"PathArguments",0],[6,"GenericArgument",0],[5,"AngleBracketedGenericArguments",0],[5,"AssocType",0],[5,"AssocConst",0],[5,"Constraint",0],[5,"ParenthesizedGenericArguments",0],[5,"QSelf",0],[6,"Visibility",0],[5,"VisRestricted",0],[6,"FieldMutability",0],[5,"Block",0],[6,"Stmt",0],[5,"Local",0],[5,"LocalInit",0],[5,"StmtMacro",0],[6,"Type",0],[5,"TypeArray",0],[5,"TypeBareFn",0],[5,"TypeGroup",0],[5,"TypeImplTrait",0],[5,"TypeInfer",0],[5,"TypeMacro",0],[5,"TypeNever",0],[5,"TypeParen",0],[5,"TypePath",0],[5,"TypePtr",0],[5,"TypeReference",0],[5,"TypeSlice",0],[5,"TypeTraitObject",0],[5,"TypeTuple",0],[5,"Abi",0],[5,"BareFnArg",0],[5,"BareVariadic",0],[6,"ReturnType",0],[1,"unit"],[6,"Ordering",7078],[1,"bool"],[10,"AsRef",7079],[10,"Sized",7080],[5,"Formatter",7081],[5,"Error",7081],[6,"Result",7082],[8,"Result",7081],[5,"SelfValue",4533],[5,"Crate",4533],[5,"SelfType",4533],[5,"Super",4533],[5,"Extern",4533],[5,"Underscore",4533],[1,"usize"],[5,"Literal",7083],[10,"Into",7079],[6,"Option",7084],[10,"Hasher",7085],[5,"Iter",4366],[5,"IterMut",4366],[5,"Span",7083],[1,"u8"],[1,"slice"],[5,"CStr",7086],[1,"char"],[5,"TokenStream",7087],[10,"Parse",4258],[8,"ParseStream",4258],[5,"TokenStream",7083],[10,"Parser",4258],[5,"Vec",7088],[5,"ParseNestedMeta",4244],[17,"Output"],[10,"FnMut",7089],[5,"DelimSpan",7090],[1,"tuple"],[5,"String",7091],[5,"TypeId",7092],[5,"CString",7093],[5,"TokenBuffer",4206],[5,"Cursor",4206],[6,"Delimiter",7083],[5,"Punct",7083],[6,"TokenTree",7083],[10,"IdentExt",4240],[5,"Error",4258],[10,"Display",7081],[5,"ParseBuffer",4258],[1,"fn"],[5,"StepCursor",4258],[5,"Nothing",4258],[5,"Lookahead1",4258],[17,"Item"],[10,"IntoIterator",7094],[5,"LexError",7083],[10,"ToTokens",7095],[5,"Punctuated",4366],[10,"Peek",4258],[10,"FnOnce",7089],[10,"Speculative",4362],[10,"AnyDelimiter",4362],[10,"Clone",7096],[5,"Pairs",4366],[5,"IntoPairs",4366],[5,"IntoIter",4366],[6,"Pair",4366],[10,"PartialEq",7078],[10,"Default",7097],[10,"Debug",7081],[10,"Hash",7085],[5,"PairsMut",4366],[10,"Token",4533],[10,"Spanned",4531],[5,"Group",4533],[5,"Abstract",4533],[5,"As",4533],[5,"Async",4533],[5,"Auto",4533],[5,"Await",4533],[5,"Become",4533],[5,"Box",4533],[5,"Break",4533],[5,"Const",4533],[5,"Continue",4533],[5,"Default",4533],[5,"Do",4533],[5,"Dyn",4533],[5,"Else",4533],[5,"Enum",4533],[5,"Final",4533],[5,"Fn",4533],[5,"For",4533],[5,"If",4533],[5,"Impl",4533],[5,"In",4533],[5,"Let",4533],[5,"Loop",4533],[5,"Macro",4533],[5,"Match",4533],[5,"Mod",4533],[5,"Move",4533],[5,"Mut",4533],[5,"Override",4533],[5,"Priv",4533],[5,"Pub",4533],[5,"Ref",4533],[5,"Return",4533],[5,"Static",4533],[5,"Struct",4533],[5,"Trait",4533],[5,"Try",4533],[5,"Type",4533],[5,"Typeof",4533],[5,"Union",4533],[5,"Unsafe",4533],[5,"Unsized",4533],[5,"Use",4533],[5,"Virtual",4533],[5,"Where",4533],[5,"While",4533],[5,"Yield",4533],[5,"And",4533],[5,"AndAnd",4533],[5,"AndEq",4533],[5,"At",4533],[5,"Caret",4533],[5,"CaretEq",4533],[5,"Colon",4533],[5,"Comma",4533],[5,"Dollar",4533],[5,"Dot",4533],[5,"DotDot",4533],[5,"DotDotDot",4533],[5,"DotDotEq",4533],[5,"Eq",4533],[5,"EqEq",4533],[5,"FatArrow",4533],[5,"Ge",4533],[5,"Gt",4533],[5,"LArrow",4533],[5,"Le",4533],[5,"Lt",4533],[5,"Minus",4533],[5,"MinusEq",4533],[5,"Ne",4533],[5,"Not",4533],[5,"Or",4533],[5,"OrEq",4533],[5,"OrOr",4533],[5,"PathSep",4533],[5,"Percent",4533],[5,"PercentEq",4533],[5,"Plus",4533],[5,"PlusEq",4533],[5,"Pound",4533],[5,"Question",4533],[5,"RArrow",4533],[5,"Semi",4533],[5,"Shl",4533],[5,"ShlEq",4533],[5,"Shr",4533],[5,"ShrEq",4533],[5,"Slash",4533],[5,"SlashEq",4533],[5,"Star",4533],[5,"StarEq",4533],[5,"Tilde",4533],[5,"Brace",4533],[5,"Bracket",4533],[5,"Paren",4533],[10,"VisitMut",6527]],"b":[[1395,"impl-PartialEq-for-Ident"],[1396,"impl-PartialEq%3CT%3E-for-Ident"],[1625,"impl-Display-for-Ident"],[1626,"impl-IdentFragment-for-Ident"],[1627,"impl-Debug-for-Ident"],[1631,"impl-Debug-for-Lifetime"],[1632,"impl-Display-for-Lifetime"],[1687,"impl-IdentFragment-for-Member"],[1688,"impl-Debug-for-Member"],[1689,"impl-IdentFragment-for-Index"],[1690,"impl-Debug-for-Index"],[1758,"impl-Debug-for-LitInt"],[1759,"impl-Display-for-LitInt"],[1760,"impl-Debug-for-LitFloat"],[1761,"impl-Display-for-LitFloat"],[1821,"impl-From%3CSelfValue%3E-for-Ident"],[1822,"impl-From%3CCrate%3E-for-Ident"],[1824,"impl-From%3CSelfType%3E-for-Ident"],[1825,"impl-From%3CSuper%3E-for-Ident"],[1826,"impl-From%3CExtern%3E-for-Ident"],[1827,"impl-From%3CUnderscore%3E-for-Ident"],[1835,"impl-From%3CMetaNameValue%3E-for-Meta"],[1836,"impl-From%3CMetaList%3E-for-Meta"],[1837,"impl-From%3CPath%3E-for-Meta"],[1841,"impl-From%3CFieldsNamed%3E-for-Fields"],[1842,"impl-From%3CFieldsUnnamed%3E-for-Fields"],[1847,"impl-From%3CItemEnum%3E-for-DeriveInput"],[1848,"impl-From%3CItemUnion%3E-for-DeriveInput"],[1850,"impl-From%3CItemStruct%3E-for-DeriveInput"],[1855,"impl-From%3CExprLoop%3E-for-Expr"],[1856,"impl-From%3CExprBinary%3E-for-Expr"],[1857,"impl-From%3CExprUnary%3E-for-Expr"],[1858,"impl-From%3CExprRange%3E-for-Expr"],[1859,"impl-From%3CExprReturn%3E-for-Expr"],[1860,"impl-From%3CExprRepeat%3E-for-Expr"],[1861,"impl-From%3CExprArray%3E-for-Expr"],[1862,"impl-From%3CExprLet%3E-for-Expr"],[1863,"impl-From%3CExprWhile%3E-for-Expr"],[1864,"impl-From%3CExprMethodCall%3E-for-Expr"],[1865,"impl-From%3CExprAssign%3E-for-Expr"],[1866,"impl-From%3CExprStruct%3E-for-Expr"],[1867,"impl-From%3CExprGroup%3E-for-Expr"],[1868,"impl-From%3CExprConst%3E-for-Expr"],[1869,"impl-From%3CExprTuple%3E-for-Expr"],[1870,"impl-From%3CExprUnsafe%3E-for-Expr"],[1871,"impl-From%3CExprForLoop%3E-for-Expr"],[1872,"impl-From%3CExprAsync%3E-for-Expr"],[1873,"impl-From%3CExprClosure%3E-for-Expr"],[1874,"impl-From%3CExprTry%3E-for-Expr"],[1875,"impl-From%3CExprInfer%3E-for-Expr"],[1876,"impl-From%3CExprIf%3E-for-Expr"],[1877,"impl-From%3CExprCast%3E-for-Expr"],[1878,"impl-From%3CExprReference%3E-for-Expr"],[1879,"impl-From%3CExprMacro%3E-for-Expr"],[1880,"impl-From%3CExprMatch%3E-for-Expr"],[1881,"impl-From%3CExprAwait%3E-for-Expr"],[1882,"impl-From%3CExprTryBlock%3E-for-Expr"],[1883,"impl-From%3CExprBlock%3E-for-Expr"],[1884,"impl-From%3CExprField%3E-for-Expr"],[1885,"impl-From%3CExprParen%3E-for-Expr"],[1886,"impl-From%3CExprPath%3E-for-Expr"],[1887,"impl-From%3CExprYield%3E-for-Expr"],[1888,"impl-From%3CExprCall%3E-for-Expr"],[1889,"impl-From%3CExprLit%3E-for-Expr"],[1890,"impl-From%3CExprContinue%3E-for-Expr"],[1891,"impl-From%3CExprBreak%3E-for-Expr"],[1892,"impl-From%3CExprIndex%3E-for-Expr"],[1932,"impl-From%3Cusize%3E-for-Member"],[1933,"impl-From%3CIndex%3E-for-Member"],[1934,"impl-From%3CIdent%3E-for-Member"],[1944,"impl-From%3CTypeParam%3E-for-GenericParam"],[1945,"impl-From%3CLifetimeParam%3E-for-GenericParam"],[1946,"impl-From%3CConstParam%3E-for-GenericParam"],[1954,"impl-From%3CLifetime%3E-for-TypeParamBound"],[1955,"impl-From%3CTraitBound%3E-for-TypeParamBound"],[1959,"impl-From%3CPredicateType%3E-for-WherePredicate"],[1961,"impl-From%3CPredicateLifetime%3E-for-WherePredicate"],[1964,"impl-From%3CItemConst%3E-for-Item"],[1965,"impl-From%3CItemFn%3E-for-Item"],[1967,"impl-From%3CItemStatic%3E-for-Item"],[1968,"impl-From%3CItemTrait%3E-for-Item"],[1969,"impl-From%3CItemEnum%3E-for-Item"],[1970,"impl-From%3CItemUnion%3E-for-Item"],[1971,"impl-From%3CItemImpl%3E-for-Item"],[1972,"impl-From%3CItemType%3E-for-Item"],[1973,"impl-From%3CItemMacro%3E-for-Item"],[1974,"impl-From%3CItemUse%3E-for-Item"],[1975,"impl-From%3CItemMod%3E-for-Item"],[1976,"impl-From%3CDeriveInput%3E-for-Item"],[1977,"impl-From%3CItemTraitAlias%3E-for-Item"],[1978,"impl-From%3CItemExternCrate%3E-for-Item"],[1979,"impl-From%3CItemForeignMod%3E-for-Item"],[1980,"impl-From%3CItemStruct%3E-for-Item"],[1996,"impl-From%3CUseGlob%3E-for-UseTree"],[1997,"impl-From%3CUseRename%3E-for-UseTree"],[1998,"impl-From%3CUseGroup%3E-for-UseTree"],[1999,"impl-From%3CUseName%3E-for-UseTree"],[2001,"impl-From%3CUsePath%3E-for-UseTree"],[2007,"impl-From%3CForeignItemFn%3E-for-ForeignItem"],[2009,"impl-From%3CForeignItemStatic%3E-for-ForeignItem"],[2010,"impl-From%3CForeignItemType%3E-for-ForeignItem"],[2011,"impl-From%3CForeignItemMacro%3E-for-ForeignItem"],[2016,"impl-From%3CTraitItemMacro%3E-for-TraitItem"],[2017,"impl-From%3CTraitItemFn%3E-for-TraitItem"],[2018,"impl-From%3CTraitItemConst%3E-for-TraitItem"],[2019,"impl-From%3CTraitItemType%3E-for-TraitItem"],[2025,"impl-From%3CImplItemConst%3E-for-ImplItem"],[2026,"impl-From%3CImplItemMacro%3E-for-ImplItem"],[2027,"impl-From%3CImplItemFn%3E-for-ImplItem"],[2028,"impl-From%3CImplItemType%3E-for-ImplItem"],[2036,"impl-From%3CPatType%3E-for-FnArg"],[2037,"impl-From%3CReceiver%3E-for-FnArg"],[2042,"impl-From%3CLitStr%3E-for-Lit"],[2044,"impl-From%3CLitCStr%3E-for-Lit"],[2045,"impl-From%3CLitByte%3E-for-Lit"],[2046,"impl-From%3CLitFloat%3E-for-Lit"],[2047,"impl-From%3CLitBool%3E-for-Lit"],[2048,"impl-From%3CLitChar%3E-for-Lit"],[2049,"impl-From%3CLitInt%3E-for-Lit"],[2050,"impl-From%3CLitByteStr%3E-for-Lit"],[2065,"impl-From%3CPatType%3E-for-Pat"],[2066,"impl-From%3CPatStruct%3E-for-Pat"],[2067,"impl-From%3CPatTupleStruct%3E-for-Pat"],[2068,"impl-From%3CPatWild%3E-for-Pat"],[2069,"impl-From%3CExprConst%3E-for-Pat"],[2070,"impl-From%3CExprMacro%3E-for-Pat"],[2071,"impl-From%3CPatTuple%3E-for-Pat"],[2072,"impl-From%3CExprRange%3E-for-Pat"],[2073,"impl-From%3CPatSlice%3E-for-Pat"],[2074,"impl-From%3CExprPath%3E-for-Pat"],[2075,"impl-From%3CExprLit%3E-for-Pat"],[2077,"impl-From%3CPatRest%3E-for-Pat"],[2078,"impl-From%3CPatOr%3E-for-Pat"],[2079,"impl-From%3CPatParen%3E-for-Pat"],[2080,"impl-From%3CPatIdent%3E-for-Pat"],[2081,"impl-From%3CPatReference%3E-for-Pat"],[2114,"impl-From%3CTypeGroup%3E-for-Type"],[2115,"impl-From%3CTypeMacro%3E-for-Type"],[2116,"impl-From%3CTypeSlice%3E-for-Type"],[2117,"impl-From%3CTypeNever%3E-for-Type"],[2118,"impl-From%3CTypeParen%3E-for-Type"],[2119,"impl-From%3CTypePath%3E-for-Type"],[2120,"impl-From%3CTypePtr%3E-for-Type"],[2121,"impl-From%3CTypeInfer%3E-for-Type"],[2122,"impl-From%3CTypeBareFn%3E-for-Type"],[2123,"impl-From%3CTypeTuple%3E-for-Type"],[2124,"impl-From%3CTypeTraitObject%3E-for-Type"],[2125,"impl-From%3CTypeImplTrait%3E-for-Type"],[2127,"impl-From%3CTypeReference%3E-for-Type"],[2128,"impl-From%3CTypeArray%3E-for-Type"],[2588,"impl-IntoIterator-for-%26mut+Fields"],[2589,"impl-IntoIterator-for-Fields"],[2590,"impl-IntoIterator-for-%26Fields"],[2813,"impl-LitStr"],[2814,"impl-Parse-for-LitStr"],[2976,"impl-IdentFragment-for-Ident"],[2977,"impl-Ident"],[4299,"impl-Display-for-Error"],[4300,"impl-Debug-for-Error"],[4301,"impl-Display-for-ParseBuffer%3C\'a%3E"],[4302,"impl-Debug-for-ParseBuffer%3C\'a%3E"],[4318,"impl-IntoIterator-for-%26Error"],[4319,"impl-IntoIterator-for-Error"],[4410,"impl-Extend%3CPair%3CT,+P%3E%3E-for-Punctuated%3CT,+P%3E"],[4411,"impl-Extend%3CT%3E-for-Punctuated%3CT,+P%3E"],[4423,"impl-FromIterator%3CT%3E-for-Punctuated%3CT,+P%3E"],[4424,"impl-FromIterator%3CPair%3CT,+P%3E%3E-for-Punctuated%3CT,+P%3E"],[4437,"impl-IntoIterator-for-Punctuated%3CT,+P%3E"],[4438,"impl-IntoIterator-for-%26Punctuated%3CT,+P%3E"],[4439,"impl-IntoIterator-for-%26mut+Punctuated%3CT,+P%3E"]]}],\ +["serde_json",{"doc":"Serde JSON","t":"PPFPFFPFPPPIFFPGNNNNNNNNNNNNNNNNNNNNCNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNCNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNHHHNHNNNNNNNNNNNNNNNNNNQCNCNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNHNNHHHHHHNNNNNNNNNNNNNNNNNNCFFKFFFNNNNNNNNNNNHNHNHNNNNNNNNNNNNNNNNNNNGPPPFPPIPNNNNNNNNNNNNNNNNNNNNNNNGFFFFFPFPFFFNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNPPPGFPKPFPPFPPNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNHHHHHHNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNPPKEPFPPFPGNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNHNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNHNNNNNN","n":["Array","Bool","Deserializer","Err","Error","Map","Null","Number","Number","Object","Ok","Result","Serializer","StreamDeserializer","String","Value","borrow","borrow","borrow","borrow","borrow","borrow","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","clone","clone","clone_from","clone_into","clone_into","collect_str","custom","custom","de","default","default","deserialize","deserialize","deserialize_any","deserialize_any","deserialize_any","deserialize_bool","deserialize_bool","deserialize_bool","deserialize_byte_buf","deserialize_byte_buf","deserialize_byte_buf","deserialize_bytes","deserialize_bytes","deserialize_bytes","deserialize_char","deserialize_char","deserialize_char","deserialize_enum","deserialize_enum","deserialize_enum","deserialize_f32","deserialize_f32","deserialize_f32","deserialize_f64","deserialize_f64","deserialize_f64","deserialize_i128","deserialize_i128","deserialize_i128","deserialize_i16","deserialize_i16","deserialize_i16","deserialize_i32","deserialize_i32","deserialize_i32","deserialize_i64","deserialize_i64","deserialize_i64","deserialize_i8","deserialize_i8","deserialize_i8","deserialize_identifier","deserialize_identifier","deserialize_identifier","deserialize_ignored_any","deserialize_ignored_any","deserialize_ignored_any","deserialize_map","deserialize_map","deserialize_map","deserialize_newtype_struct","deserialize_newtype_struct","deserialize_newtype_struct","deserialize_option","deserialize_option","deserialize_option","deserialize_seq","deserialize_seq","deserialize_seq","deserialize_str","deserialize_str","deserialize_str","deserialize_string","deserialize_string","deserialize_string","deserialize_struct","deserialize_struct","deserialize_struct","deserialize_tuple","deserialize_tuple","deserialize_tuple","deserialize_tuple_struct","deserialize_tuple_struct","deserialize_tuple_struct","deserialize_u128","deserialize_u128","deserialize_u128","deserialize_u16","deserialize_u16","deserialize_u16","deserialize_u32","deserialize_u32","deserialize_u32","deserialize_u64","deserialize_u64","deserialize_u64","deserialize_u8","deserialize_u8","deserialize_u8","deserialize_unit","deserialize_unit","deserialize_unit","deserialize_unit_struct","deserialize_unit_struct","deserialize_unit_struct","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","equivalent","equivalent","equivalent","equivalent","equivalent","equivalent","error","extend","fmt","fmt","fmt","fmt","fmt","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from_iter","from_iter","from_iter","from_reader","from_slice","from_str","from_str","from_value","index","index","index_mut","index_mut","into","into","into","into","into","into","into_deserializer","into_deserializer","into_iter","into_iter","into_iter","into_iter","invalid_type","invalid_value","json","map","next","ser","serialize","serialize","serialize_bool","serialize_bytes","serialize_char","serialize_f32","serialize_f64","serialize_i128","serialize_i16","serialize_i32","serialize_i64","serialize_i8","serialize_map","serialize_newtype_struct","serialize_newtype_variant","serialize_none","serialize_seq","serialize_some","serialize_str","serialize_struct","serialize_struct_variant","serialize_tuple","serialize_tuple_struct","serialize_tuple_variant","serialize_u128","serialize_u16","serialize_u32","serialize_u64","serialize_u8","serialize_unit","serialize_unit_struct","serialize_unit_variant","source","to_owned","to_owned","to_string","to_string","to_string","to_string_pretty","to_value","to_vec","to_vec_pretty","to_writer","to_writer_pretty","try_from","try_from","try_from","try_from","try_from","try_from","try_into","try_into","try_into","try_into","try_into","try_into","type_id","type_id","type_id","type_id","type_id","type_id","value","Deserializer","IoRead","Read","SliceRead","StrRead","StreamDeserializer","borrow","borrow","borrow","borrow_mut","borrow_mut","borrow_mut","byte_offset","end","from","from","from","from_reader","from_reader","from_slice","from_slice","from_str","from_str","into","into","into","into_iter","new","new","new","new","new","try_from","try_from","try_from","try_into","try_into","try_into","type_id","type_id","type_id","Category","Data","Eof","Err","Error","Io","Ok","Result","Syntax","borrow","borrow_mut","classify","clone","clone_into","column","eq","equivalent","equivalent","equivalent","fmt","from","into","io_error_kind","is_data","is_eof","is_io","is_syntax","line","to_owned","try_from","try_into","type_id","Entry","IntoIter","Iter","IterMut","Keys","Map","Occupied","OccupiedEntry","Vacant","VacantEntry","Values","ValuesMut","and_modify","append","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","clear","contains_key","entry","from","from","from","from","from","from","from","from","from","get","get","get_key_value","get_mut","get_mut","insert","insert","insert","into","into","into","into","into","into","into","into","into","into_iter","into_iter","into_iter","into_iter","into_iter","into_iter","into_mut","is_empty","iter","iter_mut","key","key","key","keys","len","len","len","len","len","len","len","new","next","next","next","next","next","next","next_back","next_back","next_back","next_back","next_back","next_back","or_insert","or_insert_with","remove","remove","remove_entry","retain","shift_remove","shift_remove_entry","size_hint","size_hint","size_hint","size_hint","size_hint","size_hint","swap_remove","swap_remove_entry","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","values","values_mut","with_capacity","AsciiControl","Backspace","CarriageReturn","CharEscape","CompactFormatter","FormFeed","Formatter","LineFeed","PrettyFormatter","Quote","ReverseSolidus","Serializer","Solidus","Tab","begin_array","begin_array","begin_array_value","begin_array_value","begin_object","begin_object","begin_object_key","begin_object_key","begin_object_value","begin_object_value","begin_string","borrow","borrow","borrow","borrow_mut","borrow_mut","borrow_mut","clone","clone","clone_into","clone_into","default","end_array","end_array","end_array_value","end_array_value","end_object","end_object","end_object_key","end_object_value","end_object_value","end_string","fmt","fmt","from","from","from","into","into","into","into_inner","new","new","pretty","to_owned","to_owned","to_string","to_string_pretty","to_vec","to_vec_pretty","to_writer","to_writer_pretty","try_from","try_from","try_from","try_into","try_into","try_into","type_id","type_id","type_id","with_formatter","with_indent","write_bool","write_byte_array","write_char_escape","write_f32","write_f64","write_i128","write_i16","write_i32","write_i64","write_i8","write_null","write_number_str","write_raw_fragment","write_string_fragment","write_u128","write_u16","write_u32","write_u64","write_u8","Array","Bool","Index","Map","Null","Number","Number","Object","Serializer","String","Value","as_array","as_array_mut","as_bool","as_f64","as_f64","as_i64","as_i64","as_null","as_number","as_object","as_object_mut","as_str","as_u64","as_u64","borrow","borrow","borrow_mut","borrow_mut","clone","clone_into","collect_str","deserialize","deserialize_any","deserialize_any","deserialize_bool","deserialize_bool","deserialize_byte_buf","deserialize_byte_buf","deserialize_bytes","deserialize_bytes","deserialize_char","deserialize_char","deserialize_enum","deserialize_enum","deserialize_f32","deserialize_f32","deserialize_f64","deserialize_f64","deserialize_i128","deserialize_i128","deserialize_i16","deserialize_i16","deserialize_i32","deserialize_i32","deserialize_i64","deserialize_i64","deserialize_i8","deserialize_i8","deserialize_identifier","deserialize_identifier","deserialize_ignored_any","deserialize_ignored_any","deserialize_map","deserialize_map","deserialize_newtype_struct","deserialize_newtype_struct","deserialize_option","deserialize_option","deserialize_seq","deserialize_seq","deserialize_str","deserialize_str","deserialize_string","deserialize_string","deserialize_struct","deserialize_struct","deserialize_tuple","deserialize_tuple","deserialize_tuple_struct","deserialize_tuple_struct","deserialize_u128","deserialize_u128","deserialize_u16","deserialize_u16","deserialize_u32","deserialize_u32","deserialize_u64","deserialize_u64","deserialize_u8","deserialize_u8","deserialize_unit","deserialize_unit","deserialize_unit_struct","deserialize_unit_struct","eq","equivalent","equivalent","equivalent","fmt","fmt","from","from","from","from","from","from","from","from","from","from","from","from","from_f64","from_str","from_value","get","get_mut","hash","into","into","is_array","is_boolean","is_f64","is_f64","is_i64","is_i64","is_null","is_number","is_object","is_string","is_u64","is_u64","pointer","pointer_mut","serialize","serialize_bool","serialize_bytes","serialize_char","serialize_f32","serialize_f64","serialize_i128","serialize_i16","serialize_i32","serialize_i64","serialize_i8","serialize_map","serialize_newtype_struct","serialize_newtype_variant","serialize_none","serialize_seq","serialize_some","serialize_str","serialize_struct","serialize_struct_variant","serialize_tuple","serialize_tuple_struct","serialize_tuple_variant","serialize_u128","serialize_u16","serialize_u32","serialize_u64","serialize_u8","serialize_unit","serialize_unit_struct","serialize_unit_variant","take","to_owned","to_string","to_value","try_from","try_from","try_into","try_into","type_id","type_id"],"q":[[0,"serde_json"],[312,"serde_json::de"],[353,"serde_json::error"],[385,"serde_json::map"],[526,"serde_json::ser"],[622,"serde_json::value"],[798,"alloc::string"],[799,"std::io"],[800,"core::marker"],[801,"core::fmt"],[802,"core::result"],[803,"serde::de"],[804,"serde::de"],[805,"core::fmt"],[806,"core::clone"],[807,"core::convert"],[808,"alloc::vec"],[809,"core::option"],[810,"std::io"],[811,"core::cmp"],[812,"serde::de"],[813,"serde::ser"],[814,"core::any"],[815,"std::io::error"],[816,"core::ops::function"],[817,"core::ops::function"]],"d":["Represents a JSON array.","Represents a JSON boolean.","A structure that deserializes JSON into Rust values.","Contains the error value","This type represents all possible errors that can occur …","Represents a JSON key/value type.","Represents a JSON null value.","Represents a JSON number, whether integer or floating …","Represents a JSON number, whether integer or floating …","Represents a JSON object.","Contains the success value","Alias for a Result with the error type serde_json::Error.","A structure for serializing Rust values into JSON.","Iterator that deserializes a stream into multiple JSON …","Represents a JSON string.","Represents any valid JSON value.","","","","","","","","","","","","","","","","","","","","","Deserialize JSON data to a Rust data structure.","","","","","","","","","","","","","","Parses a JSON string as bytes. Note that this function …","","","","","","Parses an enum as an object like {"$KEY":$VALUE}, where …","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","Parses a newtype struct as the underlying value.","","","Parses a null as a None, and any other values as a …","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","When serializing or deserializing JSON goes wrong.","","","","","Display a JSON value as a string.","","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","","Returns the argument unchanged.","Convert copy-on-write string to Value::String.","Convert () to Value::Null.","Convert 64-bit floating point number to Value::Number, or …","","","Convert a slice to Value::Array.","Convert map (with string keys) to Value::Object.","Convert Number to Value::Number.","Convert boolean to Value::Bool.","","","","Convert a Vec to Value::Array.","","Convert string slice to Value::String.","Convert String to Value::String.","","","","Convert 32-bit floating point number to Value::Number, or …","","","Create a Value::Array by collecting an iterator of array …","Create a Value::Object by collecting an iterator of …","Deserialize an instance of type T from an I/O stream of …","Deserialize an instance of type T from bytes of JSON text.","Deserialize an instance of type T from a string of JSON …","","Interpret a serde_json::Value as an instance of type T.","","Index into a serde_json::Value using the syntax value[0] or","","Write into a serde_json::Value using the syntax …","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","","","","","","","","","Construct a serde_json::Value from a JSON literal.","A map of String to serde_json::Value.","","Serialize a Rust data structure into JSON data.","","","","","","","","","","","","","","Serialize newtypes without an object wrapper.","","","","","","","","","","","","","","","","","","","","","","Serialize the given data structure as a String of JSON.","","","Serialize the given data structure as a pretty-printed …","Convert a T into serde_json::Value which is an enum that …","Serialize the given data structure as a JSON byte vector.","Serialize the given data structure as a pretty-printed …","Serialize the given data structure as JSON into the I/O …","Serialize the given data structure as pretty-printed JSON …","","","","","","","","","","","","","","","","","","","The Value enum, a loosely typed way of representing any …","A structure that deserializes JSON into Rust values.","JSON input source that reads from a std::io input stream.","Trait used by the deserializer for iterating over input. …","JSON input source that reads from a slice of bytes.","JSON input source that reads from a UTF-8 string.","Iterator that deserializes a stream into multiple JSON …","","","","","","","Returns the number of bytes so far deserialized into a …","The Deserializer::end method should be called after a …","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Deserialize an instance of type T from an I/O stream of …","Creates a JSON deserializer from an io::Read.","Deserialize an instance of type T from bytes of JSON text.","Creates a JSON deserializer from a &[u8].","Deserialize an instance of type T from a string of JSON …","Creates a JSON deserializer from a &str.","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Turn a JSON deserializer into an iterator over values of …","Create a JSON deserializer from one of the possible …","Create a JSON stream deserializer from one of the possible …","Create a JSON input source to read from a std::io input …","Create a JSON input source to read from a slice of bytes.","Create a JSON input source to read from a UTF-8 string.","","","","","","","","","","Categorizes the cause of a serde_json::Error.","The error was caused by input data that was semantically …","The error was caused by prematurely reaching the end of …","Contains the error value","This type represents all possible errors that can occur …","The error was caused by a failure to read or write bytes …","Contains the success value","Alias for a Result with the error type serde_json::Error.","The error was caused by input that was not syntactically …","","","Categorizes the cause of this error.","","","One-based column number at which the error was detected.","","","","","","Returns the argument unchanged.","Calls U::from(self).","The kind reported by the underlying standard library I/O …","Returns true if this error was caused by input data that …","Returns true if this error was caused by prematurely …","Returns true if this error was caused by a failure to read …","Returns true if this error was caused by input that was not","One-based line number at which the error was detected.","","","","","A view into a single entry in a map, which may either be …","An owning iterator over a serde_json::Map’s entries.","An iterator over a serde_json::Map’s entries.","A mutable iterator over a serde_json::Map’s entries.","An iterator over a serde_json::Map’s keys.","Represents a JSON key/value type.","An occupied Entry.","An occupied Entry. It is part of the Entry enum.","A vacant Entry.","A vacant Entry. It is part of the Entry enum.","An iterator over a serde_json::Map’s values.","A mutable iterator over a serde_json::Map’s values.","Provides in-place mutable access to an occupied entry …","Moves all elements from other into self, leaving other …","","","","","","","","","","","","","","","","","","","Clears the map, removing all values.","Returns true if the map contains a value for the specified …","Gets the given key’s corresponding entry in the map for …","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns a reference to the value corresponding to the key.","Gets a reference to the value in the entry.","Returns the key-value pair matching the given key.","Returns a mutable reference to the value corresponding to …","Gets a mutable reference to the value in the entry.","Inserts a key-value pair into the map.","Sets the value of the entry with the VacantEntry’s key, …","Sets the value of the entry with the OccupiedEntry’s …","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","","","","","","","Converts the entry into a mutable reference to its value.","Returns true if the map contains no elements.","Gets an iterator over the entries of the map.","Gets a mutable iterator over the entries of the map.","Returns a reference to this entry’s key.","Gets a reference to the key that would be used when …","Gets a reference to the key in the entry.","Gets an iterator over the keys of the map.","Returns the number of elements in the map.","","","","","","","Makes a new empty Map.","","","","","","","","","","","","","Ensures a value is in the entry by inserting the default …","Ensures a value is in the entry by inserting the result of …","Removes a key from the map, returning the value at the key …","Takes the value of the entry out of the map, and returns …","Removes a key from the map, returning the stored key and …","Retains only the elements specified by the predicate.","Removes and returns the value corresponding to the key …","Remove and return the key-value pair.","","","","","","","Removes and returns the value corresponding to the key …","Remove and return the key-value pair.","","","","","","","","","","","","","","","","","","","","","","","","","","","","Gets an iterator over the values of the map.","Gets an iterator over mutable values of the map.","Makes a new empty Map with the given initial capacity.","An escaped ASCII plane control character (usually escaped …","An escaped backspace character (usually escaped as \\\\b)","An escaped carriage return character (usually escaped as \\\\r…","Represents a character escape code in a type-safe manner.","This structure compacts a JSON value with no extra …","An escaped form feed character (usually escaped as \\\\f)","This trait abstracts away serializing the JSON control …","An escaped line feed character (usually escaped as \\\\n)","This structure pretty prints a JSON value to make it human …","An escaped quote "","An escaped reverse solidus \\\\","A structure for serializing Rust values into JSON.","An escaped solidus /","An escaped tab character (usually escaped as \\\\t)","Called before every array. Writes a [ to the specified …","","Called before every array value. Writes a , if needed to …","","Called before every object. Writes a { to the specified …","","Called before every object key.","","Called before every object value. A : should be written to","","Called before each series of write_string_fragment and …","","","","","","","","","","","","Called after every array. Writes a ] to the specified …","","Called after every array value.","","Called after every object. Writes a } to the specified …","","Called after every object key. A : should be written to …","Called after every object value.","","Called after each series of write_string_fragment and …","","","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Unwrap the Writer from the Serializer.","Creates a new JSON serializer.","Construct a pretty printer formatter that defaults to …","Creates a new JSON pretty print serializer.","","","Serialize the given data structure as a String of JSON.","Serialize the given data structure as a pretty-printed …","Serialize the given data structure as a JSON byte vector.","Serialize the given data structure as a pretty-printed …","Serialize the given data structure as JSON into the I/O …","Serialize the given data structure as pretty-printed JSON …","","","","","","","","","","Creates a new JSON visitor whose output will be written to …","Construct a pretty printer formatter that uses the indent …","Writes a true or false value to the specified writer.","Writes the representation of a byte array. Formatters can …","Writes a character escape code to the specified writer.","Writes a floating point value like -31.26e+12 to the …","Writes a floating point value like -31.26e+12 to the …","Writes an integer value like -123 to the specified writer.","Writes an integer value like -123 to the specified writer.","Writes an integer value like -123 to the specified writer.","Writes an integer value like -123 to the specified writer.","Writes an integer value like -123 to the specified writer.","Writes a null value to the specified writer.","Writes a number that has already been rendered to a string.","Writes a raw JSON fragment that doesn’t need any …","Writes a string fragment that doesn’t need any escaping …","Writes an integer value like 123 to the specified writer.","Writes an integer value like 123 to the specified writer.","Writes an integer value like 123 to the specified writer.","Writes an integer value like 123 to the specified writer.","Writes an integer value like 123 to the specified writer.","Represents a JSON array.","Represents a JSON boolean.","A type that can be used to index into a serde_json::Value.","","Represents a JSON null value.","Represents a JSON number, whether integer or floating …","Represents a JSON number, whether integer or floating …","Represents a JSON object.","Serializer whose output is a Value.","Represents a JSON string.","Represents any valid JSON value.","If the Value is an Array, returns the associated vector. …","If the Value is an Array, returns the associated mutable …","If the Value is a Boolean, returns the associated bool. …","If the Value is a number, represent it as f64 if possible. …","Represents the number as f64 if possible. Returns None …","If the Value is an integer, represent it as i64 if …","If the Number is an integer, represent it as i64 if …","If the Value is a Null, returns (). Returns None otherwise.","If the Value is a Number, returns the associated Number. …","If the Value is an Object, returns the associated Map. …","If the Value is an Object, returns the associated mutable …","If the Value is a String, returns the associated str. …","If the Value is an integer, represent it as u64 if …","If the Number is an integer, represent it as u64 if …","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","Returns the argument unchanged.","","","","Returns the argument unchanged.","","","","","","","","Converts a finite f64 to a Number. Infinite or NaN values …","","Interpret a serde_json::Value as an instance of type T.","Index into a JSON array or map. A string index can be used …","Mutably index into a JSON array or map. A string index can …","","Calls U::from(self).","Calls U::from(self).","Returns true if the Value is an Array. Returns false …","Returns true if the Value is a Boolean. Returns false …","Returns true if the Value is a number that can be …","Returns true if the Number can be represented by f64.","Returns true if the Value is an integer between i64::MIN …","Returns true if the Number is an integer between i64::MIN …","Returns true if the Value is a Null. Returns false …","Returns true if the Value is a Number. Returns false …","Returns true if the Value is an Object. Returns false …","Returns true if the Value is a String. Returns false …","Returns true if the Value is an integer between zero and …","Returns true if the Number is an integer between zero and …","Looks up a value by a JSON Pointer.","Looks up a value by a JSON Pointer and returns a mutable …","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","Takes the value out of the Value, leaving a Null in its …","","","Convert a T into serde_json::Value which is an enum that …","","","","","",""],"i":[2,2,0,6,0,0,2,0,2,2,6,0,0,0,2,0,14,53,11,3,5,2,14,53,11,3,5,2,3,2,3,3,2,5,11,11,0,3,2,3,2,14,2,2,14,2,2,14,2,2,14,2,2,14,2,2,14,2,2,14,2,2,14,2,2,14,2,2,14,2,2,14,2,2,14,2,2,14,2,2,14,2,2,14,2,2,14,2,2,14,2,2,14,2,2,14,2,2,14,2,2,14,2,2,14,2,2,14,2,2,14,2,2,14,2,2,14,2,2,14,2,2,14,2,2,14,2,2,14,2,2,14,2,2,3,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,3,3,3,2,2,2,0,3,11,11,3,2,2,14,53,11,3,5,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,3,2,2,0,0,0,2,0,3,2,3,2,14,53,11,3,5,2,2,2,53,3,3,3,11,11,0,0,53,0,3,2,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,11,3,2,0,11,2,0,0,0,0,0,0,14,53,11,3,5,2,14,53,11,3,5,2,14,53,11,3,5,2,0,0,0,0,0,0,0,61,62,63,61,62,63,53,14,61,62,63,0,14,0,14,0,14,61,62,63,14,14,53,61,62,63,61,62,63,61,62,63,61,62,63,0,64,64,6,0,64,6,0,64,64,64,11,64,64,11,64,64,64,64,64,64,64,11,11,11,11,11,11,64,64,64,64,0,0,0,0,0,0,66,0,66,0,0,0,66,3,66,69,68,70,71,73,72,74,75,66,69,68,70,71,73,72,74,75,3,3,3,66,69,68,70,71,73,72,74,75,3,68,3,3,68,3,69,68,66,69,68,70,71,73,72,74,75,70,71,73,72,74,75,68,3,3,3,66,69,68,3,3,70,71,73,72,74,75,3,70,71,73,72,74,75,70,71,73,72,74,75,66,66,3,68,3,3,3,3,70,71,73,72,74,75,3,3,66,69,68,70,71,73,72,74,75,66,69,68,70,71,73,72,74,75,66,69,68,70,71,73,72,74,75,3,3,3,81,81,81,0,0,81,0,81,0,81,81,0,81,81,8,79,8,79,8,79,8,79,8,79,8,81,80,79,81,80,79,80,79,80,79,79,8,79,8,79,8,79,8,8,79,8,80,79,81,80,79,81,80,79,5,5,79,5,80,79,0,0,0,0,0,0,81,80,79,81,80,79,81,80,79,5,79,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,2,2,0,0,2,0,2,2,0,2,0,2,2,2,2,41,2,41,2,2,2,2,2,2,41,82,41,82,41,41,41,82,41,41,41,41,41,41,41,41,41,41,41,41,41,41,41,41,41,41,41,41,41,41,41,41,41,41,41,41,41,41,41,41,41,41,41,41,41,41,41,41,41,41,41,41,41,41,41,41,41,41,41,41,41,41,41,41,41,41,41,41,41,41,41,41,41,41,41,41,41,82,41,41,41,41,41,41,41,41,41,41,41,41,41,0,2,2,41,82,41,2,2,2,41,2,41,2,2,2,2,2,41,2,2,41,82,82,82,82,82,82,82,82,82,82,82,82,82,82,82,82,82,82,82,82,82,82,82,82,82,82,82,82,82,82,2,41,41,0,82,41,82,41,82,41],"f":"````````````````{ce{}{}}00000000000{{{f{bd}}}{{f{bd}}}}{dd}{{{f{bd}}{f{bd}}}h}{{ce}h{}{}}0{{{j{ce}}g}{{l{h}}}nA`{AbAd}}{cAfAd}0`{{}{{f{bd}}}}{{}d}{c{{Ah{{f{bd}}}}}Aj}{c{{Ah{d}}}Aj}{{{Al{c}}e}lAnB`}{{dc}{{Ah{Af}}}B`}0100100100100{{{Al{c}}Bb{Bd{Bb}}e}lAnB`}{{dBb{Bd{Bb}}c}{{Ah{Af}}}B`}0322322322322322322322322322322{{{Al{c}}Bbe}lAnB`}{{dBbc}{{Ah{Af}}}B`}0544544544544322{{{Al{c}}Bfe}lAnB`}{{dBfc}{{Ah{Af}}}B`}0{{{Al{c}}BbBfe}lAnB`}{{dBbBfc}{{Ah{Af}}}B`}0988988988988988988544{{{f{bd}}{f{bd}}}Bh}{{dBh}Bh}{{dBj}Bh}{{dBl}Bh}{{dBn}Bh}{{dC`}Bh}4{{dBb}Bh}0{{dCb}Bh}4{{dCd}Bh}{{dCf}Bh}47{{dCh}Bh}{{dBf}Bh}01{{dCj}Bh};:5{{dCl}Bh}99{{dCn}Bh}7{{db}Bh}365711{{dd}Bh}458733=;{{ce}Bh{}{}}00000`{{{f{bd}}c}h{{Dd{}{{D`{{Db{bd}}}}}}}}{{AfDf}Dh}0{{{f{bd}}Df}{{Ah{hDj}}}}{{dDf}Dh}0{cc{}}0000{Cdd}1{{{Dl{Bb}}}d}{hd}{Cld}{Bjd}{Bfd}{{{Bd{c}}}d{Dn{E`{d}}}}{{{f{bd}}}d}{Ebd}{Bhd}{Cfd}{Chd}{Bld}{{{Ed{c}}}d{{E`{d}}}}{Cjd}{Bbd}{bd}{{{Ef{c}}}d{{E`{d}}}}{Cbd}{Bnd}{Cnd}{C`d}{c{{f{bd}}}{{Dd{}{{D`{{Db{bd}}}}}}}}{ed{{E`{d}}}{{Dd{}{{D`{c}}}}}}{gd{{E`{b}}}{{E`{d}}}{{Dd{}{{D`{{Db{ce}}}}}}}}{c{{l{e}}}EhEj}{{{Bd{C`}}}{{l{c}}}El}{Bb{{l{c}}}El}{Bb{{Ah{dAf}}}}{d{{Ah{cAf}}}Ej}{{{f{bd}}c}d{AbEnF`Fb}}{{dc}dFd}10{ce{}{}}00000{dc{}}01{{{f{bd}}}c{}}00{{FfFh}Af}0``{{{Fj{ce}}}{{Ef{{l{e}}}}}AnEl}`{{{f{bd}}c}AhFl}{{dc}AhFl}{{{j{ce}}Bh}{{l{h}}}nA`}{{{j{ce}}{Bd{C`}}}{{l{h}}}nA`}{{{j{ce}}Fn}{{l{h}}}nA`}{{{j{ce}}Cn}{{l{h}}}nA`}{{{j{ce}}Cl}{{l{h}}}nA`}{{{j{ce}}G`}{{l{h}}}nA`}{{{j{ce}}Bn}{{l{h}}}nA`}{{{j{ce}}Cb}{{l{h}}}nA`}{{{j{ce}}Cf}{{l{h}}}nA`}{{{j{ce}}Cd}{{l{h}}}nA`}{{{j{ce}}{Ef{Bf}}}{{l{g}}}nA`{}}{{{j{ce}}Bbg}{{l{h}}}nA`{AbGb}}{{{j{ce}}BbCjBbg}{{l{h}}}nA`{AbGb}}{{{j{ce}}}{{l{h}}}nA`}3{{{j{ce}}g}{{l{h}}}nA`{AbGb}}{{{j{ce}}Bb}{{l{h}}}nA`}{{{j{ce}}BbBf}{{l{g}}}nA`{}}{{{j{ce}}BbCjBbBf}{{l{g}}}nA`{}}{{{j{ce}}Bf}{{l{g}}}nA`{}}21{{{j{ce}}Gd}{{l{h}}}nA`}{{{j{ce}}Bl}{{l{h}}}nA`}{{{j{ce}}Cj}{{l{h}}}nA`}{{{j{ce}}Ch}{{l{h}}}nA`}{{{j{ce}}C`}{{l{h}}}nA`}:8{{{j{ce}}BbCjBb}{{l{h}}}nA`}{Af{{Ef{Gf}}}}{ce{}{}}0{c{{l{b}}}{AbGb}}{cb{}}01{c{{Ah{dAf}}}Gb}{c{{l{{Ed{C`}}}}}{AbGb}}0{{ce}{{l{h}}}n{AbGb}}0{c{{Ah{e}}}{}{}}00000000000{cGh{}}00000```````777777{{{Fj{ce}}}BfAnEl}{{{Al{c}}}{{l{h}}}An}{cc{}}00{c{{l{e}}}EhEj}{c{{Al{{Gj{c}}}}}Eh}{{{Bd{C`}}}{{l{c}}}El}{{{Bd{C`}}}{{Al{Gl}}}}{Bb{{l{c}}}El}{Bb{{Al{Gn}}}}{ce{}{}}00{{{Al{c}}}{{Fj{ce}}}AnEl}{c{{Al{c}}}An}{c{{Fj{ce}}}AnEl}{c{{Gj{c}}}Eh}{{{Bd{C`}}}Gl}{BbGn}{c{{Ah{e}}}{}{}}00000{cGh{}}00`````````88{AfH`}{H`H`}{{ce}h{}{}}{AfBf}{{H`H`}Bh}{{ce}Bh{}{}}00{{H`Df}Dh}{cc{}}{ce{}{}}{Af{{Ef{Hb}}}}{AfBh}00072<<;````````````{{Hdc}Hd{{Hf{d}}}}{{{f{bd}}{f{bd}}}h}444444444444444444{{{f{bd}}}h}{{{f{bd}}c}Bh{AbEnF`Fb}}{{{f{bd}}c}Hd{{E`{b}}}}888888888{{{f{bd}}c}{{Ef{d}}}{AbEnF`Fb}}{Hhd}{{{f{bd}}c}{{Ef{{Db{bd}}}}}{AbEnF`Fb}}21{{{f{bd}}bd}{{Ef{d}}}}{{Hjd}d}{{Hhd}d}===============4{{{f{bd}}}Bh}{{{f{bd}}}Hl}{{{f{bd}}}Hn}{Hdb}{Hjb}{Hhb}{{{f{bd}}}I`}{{{f{bd}}}Bf}{HlBf}{HnBf}{IbBf}{I`Bf}{IdBf}{IfBf}{{}{{f{bd}}}}{Hl{{Ef{c}}}{}}{Hn{{Ef{c}}}{}}{Ib{{Ef{c}}}{}}{I`{{Ef{c}}}{}}{Id{{Ef{c}}}{}}{If{{Ef{c}}}{}}543210{{Hdd}d}{{Hdc}d{{Hf{}{{Ih{d}}}}}}{{{f{bd}}c}{{Ef{d}}}{AbEnF`Fb}}{Hhd}{{{f{bd}}c}{{Ef{{Db{bd}}}}}{AbEnF`Fb}}{{{f{bd}}c}h{{Ij{bd}{{Ih{Bh}}}}}}31{Hl{{Db{Bf{Ef{Bf}}}}}}{Hn{{Db{Bf{Ef{Bf}}}}}}{Ib{{Db{Bf{Ef{Bf}}}}}}{I`{{Db{Bf{Ef{Bf}}}}}}{Id{{Db{Bf{Ef{Bf}}}}}}{If{{Db{Bf{Ef{Bf}}}}}}97{c{{Ah{e}}}{}{}}00000000000000000{cGh{}}00000000{{{f{bd}}}Id}{{{f{bd}}}If}{Bf{{f{bd}}}}``````````````{{A`c}{{Il{h}}}{Abn}}{{Inc}{{Il{h}}}{Abn}}{{A`cBh}{{Il{h}}}{Abn}}{{IncBh}{{Il{h}}}{Abn}}3210323{ce{}{}}00000{J`J`}{InIn}{{ce}h{}{}}0{{}In}8787878878{{J`Df}Dh}{{InDf}Dh}{cc{}}00777{{{j{ce}}}cnA`}{c{{j{c}}}n}5{c{{j{cIn}}}n}::{c{{l{b}}}{AbGb}}0{c{{l{{Ed{C`}}}}}{AbGb}}0{{ce}{{l{h}}}n{AbGb}}0{c{{Ah{e}}}{}{}}00000{cGh{}}00{{ce}{{j{ce}}}nA`}{{{Bd{C`}}}In}{{A`cBh}{{Il{h}}}{Abn}}{{A`c{Bd{C`}}}{{Il{h}}}{Abn}}{{A`cJb}{{Il{h}}}{Abn}}{{A`cCn}{{Il{h}}}{Abn}}{{A`cCl}{{Il{h}}}{Abn}}{{A`cG`}{{Il{h}}}{Abn}}{{A`cBn}{{Il{h}}}{Abn}}{{A`cCb}{{Il{h}}}{Abn}}{{A`cCf}{{Il{h}}}{Abn}}{{A`cCd}{{Il{h}}}{Abn}}{{A`c}{{Il{h}}}{Abn}}{{A`cBb}{{Il{h}}}{Abn}}00{{A`cGd}{{Il{h}}}{Abn}}{{A`cBl}{{Il{h}}}{Abn}}{{A`cCj}{{Il{h}}}{Abn}}{{A`cCh}{{Il{h}}}{Abn}}{{A`cC`}{{Il{h}}}{Abn}}```````````{d{{Ef{{Ed{d}}}}}}0{d{{Ef{Bh}}}}{d{{Ef{Cl}}}}{Eb{{Ef{Cl}}}}{d{{Ef{Cf}}}}{Eb{{Ef{Cf}}}}{d{{Ef{h}}}}{d{{Ef{Eb}}}}{d{{Ef{{f{bd}}}}}}0{d{{Ef{Bb}}}}{d{{Ef{Ch}}}}{Eb{{Ef{Ch}}}}{ce{}{}}000{EbEb}{{ce}h{}{}}{{Jdc}{{l{d}}}{AbAd}}{c{{Ah{Eb}}}Aj}{{Ebc}{{Ah{Af}}}B`}0{{Ebc}{{Ah{e}}}B`{}}0000000{{EbBb{Bd{Bb}}c}{{Ah{e}}}B`{}}022222222222222111111{{EbBbc}{{Ah{e}}}B`{}}02222222211{{EbBfc}{{Ah{e}}}B`{}}0{{EbBbBfc}{{Ah{e}}}B`{}}055555555554422{{EbEb}Bh}{{ce}Bh{}{}}00{{EbDf}Dh}0{cc{}}{CfEb}{ChEb}{BfEb}3{BlEb}{CbEb}{BnEb}{CjEb}{C`Eb}{BjEb}{CdEb}{Cl{{Ef{Eb}}}}{Bb{{Ah{Ebc}}}{}}{d{{Ah{cAf}}}Ej}{{dc}{{Ef{d}}}Fd}0{{Ebc}hJf}{ce{}{}}0{dBh}00{EbBh}10111110{{dBb}{{Ef{d}}}}0{{Ebc}AhFl}{{JdBh}{{l{d}}}}{{Jd{Bd{C`}}}{{l{d}}}}{{JdFn}{{l{d}}}}{{JdCn}{{l{d}}}}{{JdCl}{{l{d}}}}{{JdG`}{{l{d}}}}{{JdBn}{{l{d}}}}{{JdCb}{{l{d}}}}{{JdCf}{{l{d}}}}{{JdCd}{{l{d}}}}{{Jd{Ef{Bf}}}{{l{c}}}{}}{{JdBbc}{{l{d}}}{AbGb}}{{JdBbCjBbc}{{l{d}}}{AbGb}}{Jd{{l{d}}}}3{{Jdc}{{l{d}}}{AbGb}}{{JdBb}{{l{d}}}}{{JdBbBf}{{l{c}}}{}}{{JdBbCjBbBf}{{l{c}}}{}}{{JdBf}{{l{c}}}{}}21{{JdGd}{{l{d}}}}{{JdBl}{{l{d}}}}{{JdCj}{{l{d}}}}{{JdCh}{{l{d}}}}{{JdC`}{{l{d}}}}:8{{JdBbCjBb}{{l{d}}}}{dd}{ce{}{}}{cb{}}{c{{Ah{dAf}}}Gb}{c{{Ah{e}}}{}{}}000{cGh{}}0","c":[],"p":[[5,"String",798],[6,"Value",0],[5,"Map",0],[1,"unit"],[5,"Serializer",0],[8,"Result",0],[10,"Write",799],[10,"Formatter",526],[10,"Sized",800],[10,"Display",801],[5,"Error",0],[6,"Result",802],[10,"Deserializer",803],[5,"Deserializer",0],[10,"Read",312],[10,"Visitor",803],[1,"str"],[1,"slice"],[1,"usize"],[1,"bool"],[1,"isize"],[1,"u16"],[1,"i16"],[1,"u8"],[1,"i32"],[1,"i8"],[1,"i64"],[1,"u64"],[1,"u32"],[1,"f64"],[1,"f32"],[17,"Item"],[1,"tuple"],[10,"IntoIterator",804],[5,"Formatter",801],[8,"Result",801],[5,"Error",801],[6,"Cow",805],[10,"Clone",806],[10,"Into",807],[5,"Number",622],[5,"Vec",808],[6,"Option",809],[10,"Read",799],[10,"DeserializeOwned",803],[10,"Deserialize",803],[10,"Ord",810],[10,"Eq",810],[10,"Hash",811],[10,"Index",622],[6,"Unexpected",803],[10,"Expected",803],[5,"StreamDeserializer",0],[10,"Serializer",812],[1,"char"],[1,"i128"],[10,"Serialize",812],[1,"u128"],[10,"Error",813],[5,"TypeId",814],[5,"IoRead",312],[5,"SliceRead",312],[5,"StrRead",312],[6,"Category",353],[6,"ErrorKind",815],[6,"Entry",385],[10,"FnOnce",816],[5,"OccupiedEntry",385],[5,"VacantEntry",385],[5,"Iter",385],[5,"IterMut",385],[5,"Keys",385],[5,"IntoIter",385],[5,"Values",385],[5,"ValuesMut",385],[17,"Output"],[10,"FnMut",816],[8,"Result",815],[5,"PrettyFormatter",526],[5,"CompactFormatter",526],[6,"CharEscape",526],[5,"Serializer",622],[10,"Hasher",811]],"b":[[34,"impl-Error-for-Error"],[35,"impl-Error-for-Error"],[42,"impl-Deserializer%3C\'de%3E-for-%26Value"],[43,"impl-Deserializer%3C\'de%3E-for-Value"],[45,"impl-Deserializer%3C\'de%3E-for-Value"],[46,"impl-Deserializer%3C\'de%3E-for-%26Value"],[48,"impl-Deserializer%3C\'de%3E-for-%26Value"],[49,"impl-Deserializer%3C\'de%3E-for-Value"],[51,"impl-Deserializer%3C\'de%3E-for-%26Value"],[52,"impl-Deserializer%3C\'de%3E-for-Value"],[54,"impl-Deserializer%3C\'de%3E-for-%26Value"],[55,"impl-Deserializer%3C\'de%3E-for-Value"],[57,"impl-Deserializer%3C\'de%3E-for-%26Value"],[58,"impl-Deserializer%3C\'de%3E-for-Value"],[60,"impl-Deserializer%3C\'de%3E-for-Value"],[61,"impl-Deserializer%3C\'de%3E-for-%26Value"],[63,"impl-Deserializer%3C\'de%3E-for-%26Value"],[64,"impl-Deserializer%3C\'de%3E-for-Value"],[66,"impl-Deserializer%3C\'de%3E-for-%26Value"],[67,"impl-Deserializer%3C\'de%3E-for-Value"],[69,"impl-Deserializer%3C\'de%3E-for-Value"],[70,"impl-Deserializer%3C\'de%3E-for-%26Value"],[72,"impl-Deserializer%3C\'de%3E-for-%26Value"],[73,"impl-Deserializer%3C\'de%3E-for-Value"],[75,"impl-Deserializer%3C\'de%3E-for-%26Value"],[76,"impl-Deserializer%3C\'de%3E-for-Value"],[78,"impl-Deserializer%3C\'de%3E-for-%26Value"],[79,"impl-Deserializer%3C\'de%3E-for-Value"],[81,"impl-Deserializer%3C\'de%3E-for-%26Value"],[82,"impl-Deserializer%3C\'de%3E-for-Value"],[84,"impl-Deserializer%3C\'de%3E-for-%26Value"],[85,"impl-Deserializer%3C\'de%3E-for-Value"],[87,"impl-Deserializer%3C\'de%3E-for-%26Value"],[88,"impl-Deserializer%3C\'de%3E-for-Value"],[90,"impl-Deserializer%3C\'de%3E-for-%26Value"],[91,"impl-Deserializer%3C\'de%3E-for-Value"],[93,"impl-Deserializer%3C\'de%3E-for-%26Value"],[94,"impl-Deserializer%3C\'de%3E-for-Value"],[96,"impl-Deserializer%3C\'de%3E-for-Value"],[97,"impl-Deserializer%3C\'de%3E-for-%26Value"],[99,"impl-Deserializer%3C\'de%3E-for-Value"],[100,"impl-Deserializer%3C\'de%3E-for-%26Value"],[102,"impl-Deserializer%3C\'de%3E-for-%26Value"],[103,"impl-Deserializer%3C\'de%3E-for-Value"],[105,"impl-Deserializer%3C\'de%3E-for-Value"],[106,"impl-Deserializer%3C\'de%3E-for-%26Value"],[108,"impl-Deserializer%3C\'de%3E-for-%26Value"],[109,"impl-Deserializer%3C\'de%3E-for-Value"],[111,"impl-Deserializer%3C\'de%3E-for-%26Value"],[112,"impl-Deserializer%3C\'de%3E-for-Value"],[114,"impl-Deserializer%3C\'de%3E-for-Value"],[115,"impl-Deserializer%3C\'de%3E-for-%26Value"],[117,"impl-Deserializer%3C\'de%3E-for-Value"],[118,"impl-Deserializer%3C\'de%3E-for-%26Value"],[120,"impl-Deserializer%3C\'de%3E-for-Value"],[121,"impl-Deserializer%3C\'de%3E-for-%26Value"],[123,"impl-Deserializer%3C\'de%3E-for-%26Value"],[124,"impl-Deserializer%3C\'de%3E-for-Value"],[126,"impl-Deserializer%3C\'de%3E-for-%26Value"],[127,"impl-Deserializer%3C\'de%3E-for-Value"],[129,"impl-Deserializer%3C\'de%3E-for-%26Value"],[130,"impl-Deserializer%3C\'de%3E-for-Value"],[132,"impl-Deserializer%3C\'de%3E-for-%26Value"],[133,"impl-Deserializer%3C\'de%3E-for-Value"],[135,"impl-PartialEq%3Cbool%3E-for-%26Value"],[136,"impl-PartialEq%3Cisize%3E-for-%26Value"],[137,"impl-PartialEq%3Cu16%3E-for-Value"],[138,"impl-PartialEq%3Ci16%3E-for-Value"],[139,"impl-PartialEq%3Cu8%3E-for-%26Value"],[140,"impl-PartialEq%3Cbool%3E-for-Value"],[141,"impl-PartialEq%3C%26str%3E-for-Value"],[142,"impl-PartialEq%3Cstr%3E-for-Value"],[143,"impl-PartialEq%3Ci32%3E-for-%26Value"],[144,"impl-PartialEq%3Cu16%3E-for-%26Value"],[145,"impl-PartialEq%3Ci8%3E-for-Value"],[146,"impl-PartialEq%3Ci64%3E-for-%26mut+Value"],[147,"impl-PartialEq%3Cu8%3E-for-%26mut+Value"],[148,"impl-PartialEq%3Cisize%3E-for-Value"],[149,"impl-PartialEq%3Cu64%3E-for-%26Value"],[150,"impl-PartialEq%3Cusize%3E-for-Value"],[151,"impl-PartialEq%3Cusize%3E-for-%26mut+Value"],[152,"impl-PartialEq%3Cu64%3E-for-Value"],[153,"impl-PartialEq%3Cu32%3E-for-%26mut+Value"],[154,"impl-PartialEq%3Cbool%3E-for-%26mut+Value"],[155,"impl-PartialEq%3Cisize%3E-for-%26mut+Value"],[156,"impl-PartialEq%3Ci32%3E-for-Value"],[157,"impl-PartialEq%3Cf64%3E-for-Value"],[158,"impl-PartialEq%3Ci16%3E-for-%26mut+Value"],[159,"impl-PartialEq%3Ci16%3E-for-%26Value"],[160,"impl-PartialEq%3Cf32%3E-for-Value"],[161,"impl-PartialEq%3Ci32%3E-for-%26mut+Value"],[162,"impl-PartialEq%3CString%3E-for-Value"],[163,"impl-PartialEq%3Cu32%3E-for-Value"],[164,"impl-PartialEq%3Ci64%3E-for-%26Value"],[165,"impl-PartialEq%3Cu64%3E-for-%26mut+Value"],[166,"impl-PartialEq%3Ci8%3E-for-%26Value"],[167,"impl-PartialEq%3Cf32%3E-for-%26mut+Value"],[168,"impl-PartialEq%3Cf32%3E-for-%26Value"],[169,"impl-PartialEq-for-Value"],[170,"impl-PartialEq%3Cu32%3E-for-%26Value"],[171,"impl-PartialEq%3Cusize%3E-for-%26Value"],[172,"impl-PartialEq%3Ci8%3E-for-%26mut+Value"],[173,"impl-PartialEq%3Ci64%3E-for-Value"],[174,"impl-PartialEq%3Cf64%3E-for-%26mut+Value"],[175,"impl-PartialEq%3Cf64%3E-for-%26Value"],[176,"impl-PartialEq%3Cu16%3E-for-%26mut+Value"],[177,"impl-PartialEq%3Cu8%3E-for-Value"],[186,"impl-Debug-for-Error"],[187,"impl-Display-for-Error"],[189,"impl-Display-for-Value"],[190,"impl-Debug-for-Value"],[196,"impl-From%3Ci8%3E-for-Value"],[198,"impl-From%3CCow%3C\'a,+str%3E%3E-for-Value"],[199,"impl-From%3C()%3E-for-Value"],[200,"impl-From%3Cf64%3E-for-Value"],[201,"impl-From%3Cisize%3E-for-Value"],[202,"impl-From%3Cusize%3E-for-Value"],[203,"impl-From%3C%26%5BT%5D%3E-for-Value"],[204,"impl-From%3CMap%3CString,+Value%3E%3E-for-Value"],[205,"impl-From%3CNumber%3E-for-Value"],[206,"impl-From%3Cbool%3E-for-Value"],[207,"impl-From%3Ci64%3E-for-Value"],[208,"impl-From%3Cu64%3E-for-Value"],[209,"impl-From%3Cu16%3E-for-Value"],[210,"impl-From%3CVec%3CT%3E%3E-for-Value"],[211,"impl-From%3Cu32%3E-for-Value"],[212,"impl-From%3C%26str%3E-for-Value"],[213,"impl-From%3CString%3E-for-Value"],[214,"impl-From%3COption%3CT%3E%3E-for-Value"],[215,"impl-From%3Ci32%3E-for-Value"],[216,"impl-From%3Ci16%3E-for-Value"],[217,"impl-From%3Cf32%3E-for-Value"],[218,"impl-From%3Cu8%3E-for-Value"],[220,"impl-FromIterator%3CT%3E-for-Value"],[221,"impl-FromIterator%3C(K,+V)%3E-for-Value"],[237,"impl-IntoDeserializer%3C\'de,+Error%3E-for-Value"],[238,"impl-IntoDeserializer%3C\'de,+Error%3E-for-%26Value"],[240,"impl-IntoIterator-for-Map%3CString,+Value%3E"],[241,"impl-IntoIterator-for-%26Map%3CString,+Value%3E"],[242,"impl-IntoIterator-for-%26mut+Map%3CString,+Value%3E"],[655,"impl-Deserializer%3C\'de%3E-for-%26Number"],[656,"impl-Deserializer%3C\'de%3E-for-Number"],[657,"impl-Deserializer%3C\'de%3E-for-Number"],[658,"impl-Deserializer%3C\'de%3E-for-%26Number"],[659,"impl-Deserializer%3C\'de%3E-for-%26Number"],[660,"impl-Deserializer%3C\'de%3E-for-Number"],[661,"impl-Deserializer%3C\'de%3E-for-%26Number"],[662,"impl-Deserializer%3C\'de%3E-for-Number"],[663,"impl-Deserializer%3C\'de%3E-for-Number"],[664,"impl-Deserializer%3C\'de%3E-for-%26Number"],[665,"impl-Deserializer%3C\'de%3E-for-Number"],[666,"impl-Deserializer%3C\'de%3E-for-%26Number"],[667,"impl-Deserializer%3C\'de%3E-for-Number"],[668,"impl-Deserializer%3C\'de%3E-for-%26Number"],[669,"impl-Deserializer%3C\'de%3E-for-Number"],[670,"impl-Deserializer%3C\'de%3E-for-%26Number"],[671,"impl-Deserializer%3C\'de%3E-for-%26Number"],[672,"impl-Deserializer%3C\'de%3E-for-Number"],[673,"impl-Deserializer%3C\'de%3E-for-%26Number"],[674,"impl-Deserializer%3C\'de%3E-for-Number"],[675,"impl-Deserializer%3C\'de%3E-for-Number"],[676,"impl-Deserializer%3C\'de%3E-for-%26Number"],[677,"impl-Deserializer%3C\'de%3E-for-%26Number"],[678,"impl-Deserializer%3C\'de%3E-for-Number"],[679,"impl-Deserializer%3C\'de%3E-for-%26Number"],[680,"impl-Deserializer%3C\'de%3E-for-Number"],[681,"impl-Deserializer%3C\'de%3E-for-Number"],[682,"impl-Deserializer%3C\'de%3E-for-%26Number"],[683,"impl-Deserializer%3C\'de%3E-for-Number"],[684,"impl-Deserializer%3C\'de%3E-for-%26Number"],[685,"impl-Deserializer%3C\'de%3E-for-Number"],[686,"impl-Deserializer%3C\'de%3E-for-%26Number"],[687,"impl-Deserializer%3C\'de%3E-for-%26Number"],[688,"impl-Deserializer%3C\'de%3E-for-Number"],[689,"impl-Deserializer%3C\'de%3E-for-Number"],[690,"impl-Deserializer%3C\'de%3E-for-%26Number"],[691,"impl-Deserializer%3C\'de%3E-for-%26Number"],[692,"impl-Deserializer%3C\'de%3E-for-Number"],[693,"impl-Deserializer%3C\'de%3E-for-Number"],[694,"impl-Deserializer%3C\'de%3E-for-%26Number"],[695,"impl-Deserializer%3C\'de%3E-for-Number"],[696,"impl-Deserializer%3C\'de%3E-for-%26Number"],[697,"impl-Deserializer%3C\'de%3E-for-%26Number"],[698,"impl-Deserializer%3C\'de%3E-for-Number"],[699,"impl-Deserializer%3C\'de%3E-for-Number"],[700,"impl-Deserializer%3C\'de%3E-for-%26Number"],[701,"impl-Deserializer%3C\'de%3E-for-%26Number"],[702,"impl-Deserializer%3C\'de%3E-for-Number"],[703,"impl-Deserializer%3C\'de%3E-for-Number"],[704,"impl-Deserializer%3C\'de%3E-for-%26Number"],[705,"impl-Deserializer%3C\'de%3E-for-%26Number"],[706,"impl-Deserializer%3C\'de%3E-for-Number"],[707,"impl-Deserializer%3C\'de%3E-for-%26Number"],[708,"impl-Deserializer%3C\'de%3E-for-Number"],[709,"impl-Deserializer%3C\'de%3E-for-%26Number"],[710,"impl-Deserializer%3C\'de%3E-for-Number"],[711,"impl-Deserializer%3C\'de%3E-for-%26Number"],[712,"impl-Deserializer%3C\'de%3E-for-Number"],[713,"impl-Deserializer%3C\'de%3E-for-Number"],[714,"impl-Deserializer%3C\'de%3E-for-%26Number"],[715,"impl-Deserializer%3C\'de%3E-for-%26Number"],[716,"impl-Deserializer%3C\'de%3E-for-Number"],[721,"impl-Debug-for-Number"],[722,"impl-Display-for-Number"],[724,"impl-From%3Ci64%3E-for-Number"],[725,"impl-From%3Cu64%3E-for-Number"],[726,"impl-From%3Cusize%3E-for-Number"],[728,"impl-From%3Cu16%3E-for-Number"],[729,"impl-From%3Ci32%3E-for-Number"],[730,"impl-From%3Ci16%3E-for-Number"],[731,"impl-From%3Cu32%3E-for-Number"],[732,"impl-From%3Cu8%3E-for-Number"],[733,"impl-From%3Cisize%3E-for-Number"],[734,"impl-From%3Ci8%3E-for-Number"]]}],\ +["syn",{"doc":"github crates-io docs-rs","t":"FPPPPFFPPPFPFPPGFPPFFGPPPPPPPFPPFPPPPPPPPPPPPPPPPPPFFPPGFFFPPFPPPPPPFGPFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFPFPGFFGFFFPPPPPGPGFFFFPPGGFPPPPPPFPPPFGFFFFGPFPPPPPPGPFFFFFFFFFFFFFFFFPPFPPPPFPGPPFFFFFFFFFPFPPFPPPPPPPPGPPGGFFPPPPPPPPPPPPPPPPPPPPPTPPPPPFGFFFFFFFFFFFFFFFFFPPPPPGFFFPPFPPGFPPPPPPPPPPIPGPPPPFPPPPGGFPPPPPPPQPPPFGGFFFFPPPPPPPFGPPPPPPPPPFFFFFFFFFGFFFFFFFPGPPPPPPPPFFFFFGFFPPPPPPPPPFGFGPPPOOOOOOOOOOOOOOONOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOONNNNOOOOOOOOOOOOONNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNOOOOOOOOOOOOOOOOOOOOOQOOOOOOOQOCOOOONNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNOOOOOOOOOOOOOOOOOOOOOOOOOONNOOOOOOOOOOOOQQONNNOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOONNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOCOOOOOOOOOONNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNOOOONNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNOOOOOOOOOOOOOOOOOOONOOOOOOONNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOONNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNOOOOONNOOOOOOOOOOONOOOONOOONOOOOONOOOOOOOOOOOOOOOOONOOOOCOOOOOOOOOOOOOOOOOOONNNNNNNNNNNNNOOOOOOOOOOOOOOOOOOOOOOOOQCHNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNHNNNNNNNHNQNNNNNNNQQNHNNNNNNNNOOOOOOOOONNOOOOOOOOOOOOOOOCOOOOOOONOOOONNNNOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOONNNNNNNNNNNOOOOONNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNOOCNOOOOOOOOOOONNNNNNNNOONNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNCNNNNNNNNOOOOOOONNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNOOOOOOOOOOOOOOOOONNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNOOOOOOOOOONOOOOOOOONNNNNNOOOOOOOOOOOOOOOOOOOOOOOOOOOCOOONNNNOFFNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNKMTMFNNNNONNHONNNNPFFFPRKFIKKIFNNNNNNNNNNNNNNNNNNNNNCNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNMNNNMNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNKKMMPFFFFGFFFPNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNKMFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFKFFFFFFFFFFFFFNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOONNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNKHNNHNNHNNHNNHNNHNNHNNHNNHNNHNNHNNHNNHNNHNNHNNHNNHNNHNNHNNHNNHNNHNNHNNHNNHNNHNNHNNHNNHNNHNNHNNHNNHNNHNNHNNHNNHNNHNNHNNHNNHNNHNNHNNHNNHNNHNNHNNHNNHNNHNNHNNHNNHNNHNNHNNHNNHNNHNNHNNHNNHNNHNNHNNHNNHNNHNNHNNHNNHNNHNNHNNHNNHNNHNNHNNHNNHNNHNNHNNHNNHNNHNNHNNHNNHNNHNNHNNHNNHNNHNNHNNHNNHNNHNNHNNHNNHNNHNNHNNHNNHNNHNNHNNHNNHNNHNNHNNHNNHNNHNNHNNHNNHNNHNNHNNHNNHNNHNNHNNHNNHNNHNNHNNHNNHNNHNNHNNHNNHNNHNNHNNHNNHNNHNNHNNHNNHNNHNNHNNHNNHNNHNNHNNHNNHNNHNNHNNHNNHNNHNNHNNHNNHNNHNNHNNHNNHNNHNNHNNHNNHNNHNNHNNHNNHNNHNNHNNHNNHNNHNNHNNHNNHNNHNNHNNHNNHNNHNNHNNHNNHNNHNNHNN","n":["Abi","Add","AddAssign","And","AngleBracketed","AngleBracketedGenericArguments","Arm","Array","Array","Assign","AssocConst","AssocConst","AssocType","AssocType","Async","AttrStyle","Attribute","Await","BareFn","BareFnArg","BareVariadic","BinOp","Binary","BitAnd","BitAndAssign","BitOr","BitOrAssign","BitXor","BitXorAssign","Block","Block","Bool","BoundLifetimes","Brace","Bracket","Break","Byte","ByteStr","CStr","Call","Cast","Char","Closed","Closure","Const","Const","Const","Const","Const","Const","Const","ConstParam","Constraint","Constraint","Continue","Data","DataEnum","DataStruct","DataUnion","Default","Deref","DeriveInput","Div","DivAssign","Enum","Enum","Eq","Err","Error","Expr","Expr","ExprArray","ExprAssign","ExprAsync","ExprAwait","ExprBinary","ExprBlock","ExprBreak","ExprCall","ExprCast","ExprClosure","ExprConst","ExprContinue","ExprField","ExprForLoop","ExprGroup","ExprIf","ExprIndex","ExprInfer","ExprLet","ExprLit","ExprLoop","ExprMacro","ExprMatch","ExprMethodCall","ExprParen","ExprPath","ExprRange","ExprReference","ExprRepeat","ExprReturn","ExprStruct","ExprTry","ExprTryBlock","ExprTuple","ExprUnary","ExprUnsafe","ExprWhile","ExprYield","ExternCrate","Field","Field","FieldMutability","FieldPat","FieldValue","Fields","FieldsNamed","FieldsUnnamed","File","Float","Fn","Fn","Fn","Fn","FnArg","ForLoop","ForeignItem","ForeignItemFn","ForeignItemMacro","ForeignItemStatic","ForeignItemType","ForeignMod","Ge","GenericArgument","GenericParam","Generics","Glob","Group","Group","Group","Gt","HalfOpen","Ident","Ident","If","Impl","ImplGenerics","ImplItem","ImplItemConst","ImplItemFn","ImplItemMacro","ImplItemType","ImplRestriction","ImplTrait","Index","Index","Infer","Infer","Inherited","Inner","Int","Item","Item","ItemConst","ItemEnum","ItemExternCrate","ItemFn","ItemForeignMod","ItemImpl","ItemMacro","ItemMod","ItemStatic","ItemStruct","ItemTrait","ItemTraitAlias","ItemType","ItemUnion","ItemUse","Label","Le","Let","Lifetime","Lifetime","Lifetime","Lifetime","Lifetime","LifetimeParam","List","Lit","Lit","Lit","LitBool","LitByte","LitByteStr","LitCStr","LitChar","LitFloat","LitInt","LitStr","Local","Local","LocalInit","Loop","Lt","Macro","Macro","Macro","Macro","Macro","Macro","Macro","Macro","Macro","MacroDelimiter","Match","Maybe","Member","Meta","MetaList","MetaNameValue","MethodCall","Mod","Mul","MulAssign","Mut","Name","NameValue","Named","Named","Ne","Neg","Never","None","None","None","None","Not","Ok","Or","Or","Outer","PLACEHOLDER","Paren","Paren","Paren","Paren","Parenthesized","ParenthesizedGenericArguments","Pat","PatConst","PatIdent","PatLit","PatMacro","PatOr","PatParen","PatPath","PatRange","PatReference","PatRest","PatSlice","PatStruct","PatTuple","PatTupleStruct","PatType","PatWild","Path","Path","Path","Path","Path","Path","PathArguments","PathSegment","PredicateLifetime","PredicateType","Ptr","Public","QSelf","Range","Range","RangeLimits","Receiver","Receiver","Reference","Reference","Reference","Rem","RemAssign","Rename","Repeat","Rest","Restricted","Result","Return","ReturnType","Shl","ShlAssign","Shr","ShrAssign","Signature","Slice","Slice","Static","Static","StaticMutability","Stmt","StmtMacro","Str","Struct","Struct","Struct","Struct","Sub","SubAssign","Token","Trait","Trait","TraitAlias","TraitBound","TraitBoundModifier","TraitItem","TraitItemConst","TraitItemFn","TraitItemMacro","TraitItemType","TraitObject","Try","TryBlock","Tuple","Tuple","Tuple","TupleStruct","Turbofish","Type","Type","Type","Type","Type","Type","Type","Type","Type","Type","TypeArray","TypeBareFn","TypeGenerics","TypeGroup","TypeImplTrait","TypeInfer","TypeMacro","TypeNever","TypeParam","TypeParamBound","TypeParen","TypePath","TypePtr","TypeReference","TypeSlice","TypeTraitObject","TypeTuple","Typed","UnOp","Unary","Union","Union","Unit","Unnamed","Unnamed","Unsafe","Use","UseGlob","UseGroup","UseName","UsePath","UseRename","UseTree","Variadic","Variant","Verbatim","Verbatim","Verbatim","Verbatim","Verbatim","Verbatim","Verbatim","Verbatim","Verbatim","VisRestricted","Visibility","WhereClause","WherePredicate","While","Wild","Yield","abi","abi","abi","and_token","and_token","and_token","apostrophe","args","args","args","arguments","arms","as_token","as_token","as_token","as_turbofish","async_token","asyncness","asyncness","attrs","attrs","attrs","attrs","attrs","attrs","attrs","attrs","attrs","attrs","attrs","attrs","attrs","attrs","attrs","attrs","attrs","attrs","attrs","attrs","attrs","attrs","attrs","attrs","attrs","attrs","attrs","attrs","attrs","attrs","attrs","attrs","attrs","attrs","attrs","attrs","attrs","attrs","attrs","attrs","attrs","attrs","attrs","attrs","attrs","attrs","attrs","attrs","attrs","attrs","attrs","attrs","attrs","attrs","attrs","attrs","attrs","attrs","attrs","attrs","attrs","attrs","attrs","attrs","attrs","attrs","attrs","attrs","attrs","attrs","attrs","attrs","attrs","attrs","attrs","attrs","attrs","attrs","attrs","attrs","attrs","attrs","attrs","attrs","attrs","attrs","attrs","attrs","attrs","attrs","attrs","attrs","attrs","attrs","attrs","attrs","attrs","auto_token","await_token","bang_token","bang_token","base","base","base10_digits","base10_digits","base10_parse","base10_parse","block","block","block","block","block","block","block","block","body","body","body","body","body","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","bounded_ty","bounds","bounds","bounds","bounds","bounds","bounds","bounds","bounds","bounds","brace_token","brace_token","brace_token","brace_token","brace_token","brace_token","brace_token","brace_token","brace_token","brace_token","brace_token","braced","bracket_token","bracket_token","bracket_token","bracket_token","bracket_token","bracket_token","bracket_token","bracketed","break_token","buffer","by_ref","capture","capture","cases","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","cmp","cmp","colon2_token","colon2_token","colon_token","colon_token","colon_token","colon_token","colon_token","colon_token","colon_token","colon_token","colon_token","colon_token","colon_token","colon_token","colon_token","colon_token","colon_token","colon_token","colon_token","colon_token","colon_token","comma","comma","comma","cond","cond","const_params","const_params_mut","const_token","const_token","const_token","const_token","const_token","const_token","const_token","constness","constness","content","continue_token","crate_token","custom_keyword","custom_punctuation","data","default","default","default","default","default","default","default","default","defaultness","defaultness","defaultness","defaultness","delimiter","delimiter","discriminant","diverge","dot2_token","dot2_token","dot_token","dot_token","dot_token","dots","dots","dyn_token","elem","elem","elem","elem","elem","elem","elems","elems","elems","elems","elems","elems","else_branch","end","end","enum_token","enum_token","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq_token","eq_token","eq_token","eq_token","eq_token","eq_token","eq_token","eq_token","eq_token","eq_token","eq_token","eq_token","eq_token","eq_token","expr","expr","expr","expr","expr","expr","expr","expr","expr","expr","expr","expr","expr","expr","expr","expr","expr","expr","expr","ext","extern_token","extern_token","fat_arrow_token","fields","fields","fields","fields","fields","fields","fields","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fn_token","fn_token","for_token","for_token","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","func","generics","generics","generics","generics","generics","generics","generics","generics","generics","generics","generics","generics","generics","generics","generics","generics","generics","generics","get_ident","group_token","group_token","gt_token","gt_token","gt_token","gt_token","guard","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","ident","ident","ident","ident","ident","ident","ident","ident","ident","ident","ident","ident","ident","ident","ident","ident","ident","ident","ident","ident","ident","ident","ident","ident","ident","ident","ident","ident","ident","ident","ident","ident","if_token","impl_token","impl_token","in_token","in_token","index","index","init","inputs","inputs","inputs","inputs","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into_iter","into_iter","into_iter","is_empty","is_empty","is_ident","is_none","items","items","items","items","items","iter","iter_mut","label","label","label","label","label","label","leading_colon","leading_colon","leading_vert","left","left","len","len","len","let_token","let_token","lifetime","lifetime","lifetime","lifetime","lifetimes","lifetimes","lifetimes","lifetimes","lifetimes","lifetimes","lifetimes_mut","limits","limits","lit","lit","loop_token","lt_token","lt_token","lt_token","lt_token","mac","mac","mac","mac","mac","mac","mac","mac","make_where_clause","match_token","member","member","member","meta","meta","method","mod_token","modifier","movability","mutability","mutability","mutability","mutability","mutability","mutability","mutability","mutability","mutability","name","name","name","name","named","new","new","new","new","new","new","new","new","new","new","new","new","new_raw","op","op","or1_token","or2_token","output","output","output","output","params","paren_token","paren_token","paren_token","paren_token","paren_token","paren_token","paren_token","paren_token","paren_token","paren_token","paren_token","paren_token","paren_token","paren_token","paren_token","parenthesized","parse","parse","parse","parse","parse","parse","parse","parse","parse","parse","parse","parse","parse","parse","parse","parse","parse","parse","parse","parse","parse","parse","parse","parse","parse","parse","parse","parse","parse","parse","parse","parse","parse","parse","parse","parse","parse","parse","parse","parse","parse","parse","parse","parse","parse","parse","parse","parse","parse","parse","parse","parse","parse","parse","parse","parse","parse","parse","parse","parse","parse","parse","parse","parse","parse","parse","parse","parse","parse","parse","parse","parse","parse","parse","parse","parse","parse","parse","parse","parse","parse","parse","parse","parse","parse","parse","parse","parse","parse","parse","parse","parse","parse","parse","parse","parse","parse","parse","parse","parse","parse","parse","parse","parse","parse","parse","parse","parse","parse","parse","parse","parse","parse","parse","parse","parse","parse","parse","parse","parse","parse","parse","parse","parse","parse","parse","parse","parse","parse","parse","parse","parse","parse","parse","parse","parse","parse","parse","parse","parse","parse","parse","parse","parse2","parse_any","parse_args","parse_args","parse_args_with","parse_args_with","parse_body","parse_body_with","parse_file","parse_inner","parse_macro_input","parse_mod_style","parse_multi","parse_multi_with_leading_vert","parse_named","parse_nested_meta","parse_nested_meta","parse_outer","parse_quote","parse_quote_spanned","parse_single","parse_str","parse_turbofish","parse_unnamed","parse_with","parse_with_earlier_boundary_rule","parse_within","parse_without_eager_brace","partial_cmp","partial_cmp","pat","pat","pat","pat","pat","pat","pat","pat","pat","path","path","path","path","path","path","path","path","path","path","path","path","path","position","pound_token","predicates","pub_token","punctuated","qself","qself","qself","qself","qself","qself","question_token","receiver","receiver","reference","rename","rename","require_ident","require_list","require_name_value","require_path_only","rest","rest","restriction","return_token","right","right","segments","self_token","self_ty","semi","semi_token","semi_token","semi_token","semi_token","semi_token","semi_token","semi_token","semi_token","semi_token","semi_token","semi_token","semi_token","semi_token","semi_token","semi_token","semi_token","semi_token","semi_token","semi_token","semi_token","semi_token","semi_token","semi_token","semi_token","set_span","set_span","set_span","set_span","set_span","set_span","set_span","set_span","set_span","set_span","set_span","shebang","sig","sig","sig","sig","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","spanned","split_for_impl","star_token","star_token","start","start","static_token","static_token","stmts","struct_token","struct_token","style","subpat","suffix","suffix","suffix","suffix","suffix","suffix","suffix","suffix","supertraits","then_branch","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_string","to_string","to_string","to_string","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","token","token","token","token","token","token","token","token","token","tokens","tokens","trait_","trait_token","trait_token","tree","tree","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_token","turbofish","ty","ty","ty","ty","ty","ty","ty","ty","ty","ty","ty","ty","ty","ty","ty","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_params","type_params_mut","type_token","type_token","type_token","type_token","underscore_token","underscore_token","underscore_token","union_token","union_token","unnamed","unraw","unsafe_token","unsafety","unsafety","unsafety","unsafety","unsafety","unsafety","use_token","value","value","value","value","value","value","value","value","value","variadic","variadic","variants","variants","vis","vis","vis","vis","vis","vis","vis","vis","vis","vis","vis","vis","vis","vis","vis","vis","vis","vis","vis","vis","visit_mut","where_clause","where_token","while_token","without_plus","without_plus","without_plus","without_plus","yield_token","Cursor","TokenBuffer","begin","borrow","borrow","borrow_mut","borrow_mut","clone","clone_into","empty","eof","eq","from","from","group","ident","into","into","lifetime","literal","new","new2","partial_cmp","punct","span","to_owned","token_stream","token_tree","try_from","try_from","try_into","try_into","type_id","type_id","IdentExt","parse_any","peek_any","unraw","ParseNestedMeta","borrow","borrow_mut","error","from","input","into","parse_nested_meta","parser","path","try_from","try_into","type_id","value","Err","Error","Lookahead1","Nothing","Ok","Output","Parse","ParseBuffer","ParseStream","Parser","Peek","Result","StepCursor","advance_to","borrow","borrow","borrow","borrow","borrow","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","call","clone","clone","clone","clone_into","clone_into","clone_into","combine","cursor","deref","discouraged","drop","eq","error","error","error","extend","fmt","fmt","fmt","fmt","fmt","fork","from","from","from","from","from","from","hash","into","into","into","into","into","into_compile_error","into_iter","into_iter","is_empty","lookahead1","new","new_spanned","parse","parse","parse","parse","parse2","parse_any_delimiter","parse_str","parse_terminated","peek","peek","peek2","peek3","span","span","span","step","to_compile_error","to_owned","to_owned","to_owned","to_string","to_string","to_tokens","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","AnyDelimiter","Speculative","advance_to","parse_any_delimiter","End","IntoIter","IntoPairs","Iter","IterMut","Pair","Pairs","PairsMut","Punctuated","Punctuated","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","clear","clone","clone","clone","clone","clone","clone","clone_from","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","cloned","default","empty_or_trailing","eq","extend","extend","first","first_mut","fmt","from","from","from","from","from","from","from","from","from_iter","from_iter","hash","index","index_mut","insert","into","into","into","into","into","into","into","into","into_iter","into_iter","into_iter","into_iter","into_iter","into_iter","into_iter","into_iter","into_iter","into_pairs","into_tuple","into_value","is_empty","iter","iter_mut","last","last_mut","len","len","len","len","len","len","len","new","new","next","next","next","next","next","next","next_back","next_back","next_back","next_back","next_back","next_back","pairs","pairs_mut","parse_separated_nonempty","parse_separated_nonempty_with","parse_terminated","parse_terminated_with","pop","pop_punct","punct","punct_mut","push","push_punct","push_value","size_hint","size_hint","size_hint","size_hint","size_hint","size_hint","span","span","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_tokens","to_tokens","trailing_punct","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","value","value_mut","Spanned","span","Abstract","And","AndAnd","AndEq","As","Async","At","Auto","Await","Become","Box","Brace","Bracket","Break","Caret","CaretEq","Colon","Comma","Const","Continue","Crate","Default","Do","Dollar","Dot","DotDot","DotDotDot","DotDotEq","Dyn","Else","Enum","Eq","EqEq","Extern","FatArrow","Final","Fn","For","Ge","Group","Gt","If","Impl","In","LArrow","Le","Let","Loop","Lt","Macro","Match","Minus","MinusEq","Mod","Move","Mut","Ne","Not","Or","OrEq","OrOr","Override","Paren","PathSep","Percent","PercentEq","Plus","PlusEq","Pound","Priv","Pub","Question","RArrow","Ref","Return","SelfType","SelfValue","Semi","Shl","ShlEq","Shr","ShrEq","Slash","SlashEq","Star","StarEq","Static","Struct","Super","Tilde","Token","Trait","Try","Type","Typeof","Underscore","Union","Unsafe","Unsized","Use","Virtual","Where","While","Yield","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","default","default","default","default","default","default","default","default","default","default","default","default","default","default","default","default","default","default","default","default","default","default","default","default","default","default","default","default","default","default","default","default","default","default","default","default","default","default","default","default","default","default","default","default","default","default","default","default","default","default","default","default","default","default","default","default","default","default","default","default","default","default","default","default","default","default","default","default","default","default","default","default","default","default","default","default","default","default","default","default","default","default","default","default","default","default","default","default","default","default","default","default","default","default","default","default","default","default","default","default","default","default","default","deref","deref","deref","deref","deref","deref","deref","deref","deref","deref","deref","deref","deref","deref","deref","deref","deref","deref","deref","deref","deref","deref","deref_mut","deref_mut","deref_mut","deref_mut","deref_mut","deref_mut","deref_mut","deref_mut","deref_mut","deref_mut","deref_mut","deref_mut","deref_mut","deref_mut","deref_mut","deref_mut","deref_mut","deref_mut","deref_mut","deref_mut","deref_mut","deref_mut","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","parse","parse","parse","parse","parse","parse","parse","parse","parse","parse","parse","parse","parse","parse","parse","parse","parse","parse","parse","parse","parse","parse","parse","parse","parse","parse","parse","parse","parse","parse","parse","parse","parse","parse","parse","parse","parse","parse","parse","parse","parse","parse","parse","parse","parse","parse","parse","parse","parse","parse","parse","parse","parse","parse","parse","parse","parse","parse","parse","parse","parse","parse","parse","parse","parse","parse","parse","parse","parse","parse","parse","parse","parse","parse","parse","parse","parse","parse","parse","parse","parse","parse","parse","parse","parse","parse","parse","parse","parse","parse","parse","parse","parse","parse","parse","parse","parse","parse","parse","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","span","spans","spans","spans","spans","spans","spans","spans","spans","spans","spans","spans","spans","spans","spans","spans","spans","spans","spans","spans","spans","spans","spans","spans","spans","spans","spans","spans","spans","spans","spans","spans","spans","spans","spans","spans","spans","spans","spans","spans","spans","spans","spans","spans","spans","spans","spans","spans","surround","surround","surround","surround","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","to_tokens","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","VisitMut","visit_abi_mut","visit_abi_mut","visit_abi_mut","visit_angle_bracketed_generic_arguments_mut","visit_angle_bracketed_generic_arguments_mut","visit_angle_bracketed_generic_arguments_mut","visit_arm_mut","visit_arm_mut","visit_arm_mut","visit_assoc_const_mut","visit_assoc_const_mut","visit_assoc_const_mut","visit_assoc_type_mut","visit_assoc_type_mut","visit_assoc_type_mut","visit_attr_style_mut","visit_attr_style_mut","visit_attr_style_mut","visit_attribute_mut","visit_attribute_mut","visit_attribute_mut","visit_bare_fn_arg_mut","visit_bare_fn_arg_mut","visit_bare_fn_arg_mut","visit_bare_variadic_mut","visit_bare_variadic_mut","visit_bare_variadic_mut","visit_bin_op_mut","visit_bin_op_mut","visit_bin_op_mut","visit_block_mut","visit_block_mut","visit_block_mut","visit_bound_lifetimes_mut","visit_bound_lifetimes_mut","visit_bound_lifetimes_mut","visit_const_param_mut","visit_const_param_mut","visit_const_param_mut","visit_constraint_mut","visit_constraint_mut","visit_constraint_mut","visit_data_enum_mut","visit_data_enum_mut","visit_data_enum_mut","visit_data_mut","visit_data_mut","visit_data_mut","visit_data_struct_mut","visit_data_struct_mut","visit_data_struct_mut","visit_data_union_mut","visit_data_union_mut","visit_data_union_mut","visit_derive_input_mut","visit_derive_input_mut","visit_derive_input_mut","visit_expr_array_mut","visit_expr_array_mut","visit_expr_array_mut","visit_expr_assign_mut","visit_expr_assign_mut","visit_expr_assign_mut","visit_expr_async_mut","visit_expr_async_mut","visit_expr_async_mut","visit_expr_await_mut","visit_expr_await_mut","visit_expr_await_mut","visit_expr_binary_mut","visit_expr_binary_mut","visit_expr_binary_mut","visit_expr_block_mut","visit_expr_block_mut","visit_expr_block_mut","visit_expr_break_mut","visit_expr_break_mut","visit_expr_break_mut","visit_expr_call_mut","visit_expr_call_mut","visit_expr_call_mut","visit_expr_cast_mut","visit_expr_cast_mut","visit_expr_cast_mut","visit_expr_closure_mut","visit_expr_closure_mut","visit_expr_closure_mut","visit_expr_const_mut","visit_expr_const_mut","visit_expr_const_mut","visit_expr_continue_mut","visit_expr_continue_mut","visit_expr_continue_mut","visit_expr_field_mut","visit_expr_field_mut","visit_expr_field_mut","visit_expr_for_loop_mut","visit_expr_for_loop_mut","visit_expr_for_loop_mut","visit_expr_group_mut","visit_expr_group_mut","visit_expr_group_mut","visit_expr_if_mut","visit_expr_if_mut","visit_expr_if_mut","visit_expr_index_mut","visit_expr_index_mut","visit_expr_index_mut","visit_expr_infer_mut","visit_expr_infer_mut","visit_expr_infer_mut","visit_expr_let_mut","visit_expr_let_mut","visit_expr_let_mut","visit_expr_lit_mut","visit_expr_lit_mut","visit_expr_lit_mut","visit_expr_loop_mut","visit_expr_loop_mut","visit_expr_loop_mut","visit_expr_macro_mut","visit_expr_macro_mut","visit_expr_macro_mut","visit_expr_match_mut","visit_expr_match_mut","visit_expr_match_mut","visit_expr_method_call_mut","visit_expr_method_call_mut","visit_expr_method_call_mut","visit_expr_mut","visit_expr_mut","visit_expr_mut","visit_expr_paren_mut","visit_expr_paren_mut","visit_expr_paren_mut","visit_expr_path_mut","visit_expr_path_mut","visit_expr_path_mut","visit_expr_range_mut","visit_expr_range_mut","visit_expr_range_mut","visit_expr_reference_mut","visit_expr_reference_mut","visit_expr_reference_mut","visit_expr_repeat_mut","visit_expr_repeat_mut","visit_expr_repeat_mut","visit_expr_return_mut","visit_expr_return_mut","visit_expr_return_mut","visit_expr_struct_mut","visit_expr_struct_mut","visit_expr_struct_mut","visit_expr_try_block_mut","visit_expr_try_block_mut","visit_expr_try_block_mut","visit_expr_try_mut","visit_expr_try_mut","visit_expr_try_mut","visit_expr_tuple_mut","visit_expr_tuple_mut","visit_expr_tuple_mut","visit_expr_unary_mut","visit_expr_unary_mut","visit_expr_unary_mut","visit_expr_unsafe_mut","visit_expr_unsafe_mut","visit_expr_unsafe_mut","visit_expr_while_mut","visit_expr_while_mut","visit_expr_while_mut","visit_expr_yield_mut","visit_expr_yield_mut","visit_expr_yield_mut","visit_field_mut","visit_field_mut","visit_field_mut","visit_field_mutability_mut","visit_field_mutability_mut","visit_field_mutability_mut","visit_field_pat_mut","visit_field_pat_mut","visit_field_pat_mut","visit_field_value_mut","visit_field_value_mut","visit_field_value_mut","visit_fields_mut","visit_fields_mut","visit_fields_mut","visit_fields_named_mut","visit_fields_named_mut","visit_fields_named_mut","visit_fields_unnamed_mut","visit_fields_unnamed_mut","visit_fields_unnamed_mut","visit_file_mut","visit_file_mut","visit_file_mut","visit_fn_arg_mut","visit_fn_arg_mut","visit_fn_arg_mut","visit_foreign_item_fn_mut","visit_foreign_item_fn_mut","visit_foreign_item_fn_mut","visit_foreign_item_macro_mut","visit_foreign_item_macro_mut","visit_foreign_item_macro_mut","visit_foreign_item_mut","visit_foreign_item_mut","visit_foreign_item_mut","visit_foreign_item_static_mut","visit_foreign_item_static_mut","visit_foreign_item_static_mut","visit_foreign_item_type_mut","visit_foreign_item_type_mut","visit_foreign_item_type_mut","visit_generic_argument_mut","visit_generic_argument_mut","visit_generic_argument_mut","visit_generic_param_mut","visit_generic_param_mut","visit_generic_param_mut","visit_generics_mut","visit_generics_mut","visit_generics_mut","visit_ident_mut","visit_ident_mut","visit_ident_mut","visit_impl_item_const_mut","visit_impl_item_const_mut","visit_impl_item_const_mut","visit_impl_item_fn_mut","visit_impl_item_fn_mut","visit_impl_item_fn_mut","visit_impl_item_macro_mut","visit_impl_item_macro_mut","visit_impl_item_macro_mut","visit_impl_item_mut","visit_impl_item_mut","visit_impl_item_mut","visit_impl_item_type_mut","visit_impl_item_type_mut","visit_impl_item_type_mut","visit_impl_restriction_mut","visit_impl_restriction_mut","visit_impl_restriction_mut","visit_index_mut","visit_index_mut","visit_index_mut","visit_item_const_mut","visit_item_const_mut","visit_item_const_mut","visit_item_enum_mut","visit_item_enum_mut","visit_item_enum_mut","visit_item_extern_crate_mut","visit_item_extern_crate_mut","visit_item_extern_crate_mut","visit_item_fn_mut","visit_item_fn_mut","visit_item_fn_mut","visit_item_foreign_mod_mut","visit_item_foreign_mod_mut","visit_item_foreign_mod_mut","visit_item_impl_mut","visit_item_impl_mut","visit_item_impl_mut","visit_item_macro_mut","visit_item_macro_mut","visit_item_macro_mut","visit_item_mod_mut","visit_item_mod_mut","visit_item_mod_mut","visit_item_mut","visit_item_mut","visit_item_mut","visit_item_static_mut","visit_item_static_mut","visit_item_static_mut","visit_item_struct_mut","visit_item_struct_mut","visit_item_struct_mut","visit_item_trait_alias_mut","visit_item_trait_alias_mut","visit_item_trait_alias_mut","visit_item_trait_mut","visit_item_trait_mut","visit_item_trait_mut","visit_item_type_mut","visit_item_type_mut","visit_item_type_mut","visit_item_union_mut","visit_item_union_mut","visit_item_union_mut","visit_item_use_mut","visit_item_use_mut","visit_item_use_mut","visit_label_mut","visit_label_mut","visit_label_mut","visit_lifetime_mut","visit_lifetime_mut","visit_lifetime_mut","visit_lifetime_param_mut","visit_lifetime_param_mut","visit_lifetime_param_mut","visit_lit_bool_mut","visit_lit_bool_mut","visit_lit_bool_mut","visit_lit_byte_mut","visit_lit_byte_mut","visit_lit_byte_mut","visit_lit_byte_str_mut","visit_lit_byte_str_mut","visit_lit_byte_str_mut","visit_lit_char_mut","visit_lit_char_mut","visit_lit_char_mut","visit_lit_cstr_mut","visit_lit_cstr_mut","visit_lit_cstr_mut","visit_lit_float_mut","visit_lit_float_mut","visit_lit_float_mut","visit_lit_int_mut","visit_lit_int_mut","visit_lit_int_mut","visit_lit_mut","visit_lit_mut","visit_lit_mut","visit_lit_str_mut","visit_lit_str_mut","visit_lit_str_mut","visit_local_init_mut","visit_local_init_mut","visit_local_init_mut","visit_local_mut","visit_local_mut","visit_local_mut","visit_macro_delimiter_mut","visit_macro_delimiter_mut","visit_macro_delimiter_mut","visit_macro_mut","visit_macro_mut","visit_macro_mut","visit_member_mut","visit_member_mut","visit_member_mut","visit_meta_list_mut","visit_meta_list_mut","visit_meta_list_mut","visit_meta_mut","visit_meta_mut","visit_meta_mut","visit_meta_name_value_mut","visit_meta_name_value_mut","visit_meta_name_value_mut","visit_parenthesized_generic_arguments_mut","visit_parenthesized_generic_arguments_mut","visit_parenthesized_generic_arguments_mut","visit_pat_ident_mut","visit_pat_ident_mut","visit_pat_ident_mut","visit_pat_mut","visit_pat_mut","visit_pat_mut","visit_pat_or_mut","visit_pat_or_mut","visit_pat_or_mut","visit_pat_paren_mut","visit_pat_paren_mut","visit_pat_paren_mut","visit_pat_reference_mut","visit_pat_reference_mut","visit_pat_reference_mut","visit_pat_rest_mut","visit_pat_rest_mut","visit_pat_rest_mut","visit_pat_slice_mut","visit_pat_slice_mut","visit_pat_slice_mut","visit_pat_struct_mut","visit_pat_struct_mut","visit_pat_struct_mut","visit_pat_tuple_mut","visit_pat_tuple_mut","visit_pat_tuple_mut","visit_pat_tuple_struct_mut","visit_pat_tuple_struct_mut","visit_pat_tuple_struct_mut","visit_pat_type_mut","visit_pat_type_mut","visit_pat_type_mut","visit_pat_wild_mut","visit_pat_wild_mut","visit_pat_wild_mut","visit_path_arguments_mut","visit_path_arguments_mut","visit_path_arguments_mut","visit_path_mut","visit_path_mut","visit_path_mut","visit_path_segment_mut","visit_path_segment_mut","visit_path_segment_mut","visit_predicate_lifetime_mut","visit_predicate_lifetime_mut","visit_predicate_lifetime_mut","visit_predicate_type_mut","visit_predicate_type_mut","visit_predicate_type_mut","visit_qself_mut","visit_qself_mut","visit_qself_mut","visit_range_limits_mut","visit_range_limits_mut","visit_range_limits_mut","visit_receiver_mut","visit_receiver_mut","visit_receiver_mut","visit_return_type_mut","visit_return_type_mut","visit_return_type_mut","visit_signature_mut","visit_signature_mut","visit_signature_mut","visit_span_mut","visit_span_mut","visit_span_mut","visit_static_mutability_mut","visit_static_mutability_mut","visit_static_mutability_mut","visit_stmt_macro_mut","visit_stmt_macro_mut","visit_stmt_macro_mut","visit_stmt_mut","visit_stmt_mut","visit_stmt_mut","visit_trait_bound_modifier_mut","visit_trait_bound_modifier_mut","visit_trait_bound_modifier_mut","visit_trait_bound_mut","visit_trait_bound_mut","visit_trait_bound_mut","visit_trait_item_const_mut","visit_trait_item_const_mut","visit_trait_item_const_mut","visit_trait_item_fn_mut","visit_trait_item_fn_mut","visit_trait_item_fn_mut","visit_trait_item_macro_mut","visit_trait_item_macro_mut","visit_trait_item_macro_mut","visit_trait_item_mut","visit_trait_item_mut","visit_trait_item_mut","visit_trait_item_type_mut","visit_trait_item_type_mut","visit_trait_item_type_mut","visit_type_array_mut","visit_type_array_mut","visit_type_array_mut","visit_type_bare_fn_mut","visit_type_bare_fn_mut","visit_type_bare_fn_mut","visit_type_group_mut","visit_type_group_mut","visit_type_group_mut","visit_type_impl_trait_mut","visit_type_impl_trait_mut","visit_type_impl_trait_mut","visit_type_infer_mut","visit_type_infer_mut","visit_type_infer_mut","visit_type_macro_mut","visit_type_macro_mut","visit_type_macro_mut","visit_type_mut","visit_type_mut","visit_type_mut","visit_type_never_mut","visit_type_never_mut","visit_type_never_mut","visit_type_param_bound_mut","visit_type_param_bound_mut","visit_type_param_bound_mut","visit_type_param_mut","visit_type_param_mut","visit_type_param_mut","visit_type_paren_mut","visit_type_paren_mut","visit_type_paren_mut","visit_type_path_mut","visit_type_path_mut","visit_type_path_mut","visit_type_ptr_mut","visit_type_ptr_mut","visit_type_ptr_mut","visit_type_reference_mut","visit_type_reference_mut","visit_type_reference_mut","visit_type_slice_mut","visit_type_slice_mut","visit_type_slice_mut","visit_type_trait_object_mut","visit_type_trait_object_mut","visit_type_trait_object_mut","visit_type_tuple_mut","visit_type_tuple_mut","visit_type_tuple_mut","visit_un_op_mut","visit_un_op_mut","visit_un_op_mut","visit_use_glob_mut","visit_use_glob_mut","visit_use_glob_mut","visit_use_group_mut","visit_use_group_mut","visit_use_group_mut","visit_use_name_mut","visit_use_name_mut","visit_use_name_mut","visit_use_path_mut","visit_use_path_mut","visit_use_path_mut","visit_use_rename_mut","visit_use_rename_mut","visit_use_rename_mut","visit_use_tree_mut","visit_use_tree_mut","visit_use_tree_mut","visit_variadic_mut","visit_variadic_mut","visit_variadic_mut","visit_variant_mut","visit_variant_mut","visit_variant_mut","visit_vis_restricted_mut","visit_vis_restricted_mut","visit_vis_restricted_mut","visit_visibility_mut","visit_visibility_mut","visit_visibility_mut","visit_where_clause_mut","visit_where_clause_mut","visit_where_clause_mut","visit_where_predicate_mut","visit_where_predicate_mut","visit_where_predicate_mut"],"q":[[0,"syn"],[4206,"syn::buffer"],[4240,"syn::ext"],[4244,"syn::meta"],[4258,"syn::parse"],[4362,"syn::parse::discouraged"],[4366,"syn::punctuated"],[4531,"syn::spanned"],[4533,"syn::token"],[6527,"syn::visit_mut"],[7077,"core::str::traits"],[7078,"core::cmp"],[7079,"core::convert"],[7080,"core::marker"],[7081,"core::fmt"],[7082,"core::fmt"],[7083,"core::fmt"],[7084,"core::convert"],[7085,"core::hash"],[7086,"proc_macro2"],[7087,"proc_macro"],[7088,"proc_macro2"],[7089,"core::ops::function"],[7090,"proc_macro2::extra"],[7091,"alloc::string"],[7092,"core::any"],[7093,"alloc::ffi::c_str"],[7094,"proc_macro2"],[7095,"proc_macro2"],[7096,"core::ops::function"],[7097,"core::cmp"],[7098,"core::fmt"]],"d":["The binary interface of a function: extern "C".","The + operator (addition)","The += operator","The && operator (logical and)","The <'a, T> in std::slice::iter<'a, T>.","Angle bracketed arguments of a path segment: the <K, V> in …","One arm of a match expression: 0..=10 => { return true; }.","A slice literal expression: [a, b, c, d].","A fixed size array type: [T; n].","An assignment expression: a = compute().","An equality constraint on an associated constant: the …","An equality constraint on an associated constant: the …","A binding (equality constraint) on an associated type: the …","A binding (equality constraint) on an associated type: the …","An async block: async { ... }.","Distinguishes between attributes that decorate an item and …","An attribute, like #[repr(transparent)].","An await expression: fut.await.","A bare function type: fn(usize) -> bool.","An argument in a function type: the usize in …","The variadic argument of a function pointer like …","A binary operator: +, +=, &.","A binary operation: a + b, a += b.","The & operator (bitwise and)","The &= operator","The | operator (bitwise or)","The |= operator","The ^ operator (bitwise xor)","The ^= operator","A braced block containing Rust statements.","A blocked scope: { ... }.","A boolean literal: true or false.","A set of bound lifetimes: for<'a, 'b, 'c>.","","","A break, with an optional label to break and an optional …","A byte literal: b'f'.","A byte string literal: b"foo".","A nul-terminated C-string literal: c"foo".","A function call expression: invoke(a, b).","A cast expression: foo as f64.","A character literal: 'a'.","Inclusive at the beginning and end.","A closure expression: |a, b| a + b.","A const block: const { ... }.","A const generic parameter: const LENGTH: usize.","A constant item: const MAX: u16 = 65535.","An associated constant within the definition of a trait.","An associated constant within an impl block.","A const block: const { ... }.","A const expression. Must be inside of a block.","A const generic parameter: const LENGTH: usize.","An associated type bound: Iterator<Item: Display>.","An associated type bound: Iterator<Item: Display>.","A continue, with an optional label.","The storage of a struct, enum or union data structure.","An enum input to a proc_macro_derive macro.","A struct input to a proc_macro_derive macro.","An untagged union input to a proc_macro_derive macro.","Return type is not specified.","The * operator for dereferencing","Data structure sent to a proc_macro_derive macro.","The / operator (division)","The /= operator","","An enum definition: enum Foo<A, B> { A(A), B(B) }.","The == operator (equality)","Contains the error value","Error returned when a Syn parser cannot parse the input …","A Rust expression.","Expression, with or without trailing semicolon.","A slice literal expression: [a, b, c, d].","An assignment expression: a = compute().","An async block: async { ... }.","An await expression: fut.await.","A binary operation: a + b, a += b.","A blocked scope: { ... }.","A break, with an optional label to break and an optional …","A function call expression: invoke(a, b).","A cast expression: foo as f64.","A closure expression: |a, b| a + b.","A const block: const { ... }.","A continue, with an optional label.","Access of a named struct field (obj.k) or unnamed tuple …","A for loop: for pat in expr { ... }.","An expression contained within invisible delimiters.","An if expression with an optional else block: …","A square bracketed indexing expression: vector[2].","The inferred value of a const generic argument, denoted _.","A let guard: let Some(x) = opt.","A literal in place of an expression: 1, "foo".","Conditionless loop: loop { ... }.","A macro invocation expression: format!("{}", q).","A match expression: match n { Some(n) => {}, None => {} }.","A method call expression: x.foo::<T>(a, b).","A parenthesized expression: (a + b).","A path like std::mem::replace possibly containing generic …","A range expression: 1..2, 1.., ..2, 1..=2, ..=2.","A referencing operation: &a or &mut a.","An array literal constructed from one repeated element: …","A return, with an optional value to be returned.","A struct literal expression: Point { x: 1, y: 1 }.","A try-expression: expr?.","A try block: try { ... }.","A tuple expression: (a, b, c, d).","A unary operation: !x, *x.","An unsafe block: unsafe { ... }.","A while loop: while expr { ... }.","A yield expression: yield expr.","An extern crate item: extern crate serde.","A field of a struct or enum variant.","Access of a named struct field (obj.k) or unnamed tuple …","Unused, but reserved for RFC 3323 restrictions.","A single field in a struct pattern.","A field-value pair in a struct literal.","Data stored within an enum variant or struct.","Named fields of a struct or struct variant such as …","Unnamed fields of a tuple struct or tuple variant such as …","A complete file of Rust source code.","A floating point literal: 1f64 or 1.0e10f64.","A free-standing function: …","A foreign function in an extern block.","An associated function within the definition of a trait.","An associated function within an impl block.","An argument in a function signature: the n: usize in …","A for loop: for pat in expr { ... }.","An item within an extern block.","A foreign function in an extern block.","A macro invocation within an extern block.","A foreign static item in an extern block: static ext: u8.","A foreign type in an extern block: type void.","A block of foreign items: extern "C" { ... }.","The >= operator (greater than or equal to)","An individual generic argument, like 'a, T, or Item = T.","A generic type parameter, lifetime, or const generic: …","Lifetimes and type parameters attached to a declaration of …","A glob import in a use item: *.","An expression contained within invisible delimiters.","A braced group of imports in a use item: {A, B, C}.","A type contained within invisible delimiters.","The > operator (greater than)","Inclusive at the beginning, exclusive at the end.","A word of Rust code, which may be a keyword or legal …","A pattern that binds a new variable: …","An if expression with an optional else block: …","An impl block providing trait or associated items: …","Returned by Generics::split_for_impl.","An item within an impl block.","An associated constant within an impl block.","An associated function within an impl block.","A macro invocation within an impl block.","An associated type within an impl block.","Unused, but reserved for RFC 3323 restrictions.","An impl Bound1 + Bound2 + Bound3 type where Bound is a …","The index of an unnamed tuple struct field.","A square bracketed indexing expression: vector[2].","The inferred value of a const generic argument, denoted _.","Indication that a type should be inferred by the compiler: …","An inherited visibility, which usually means private.","","An integer literal: 1 or 1u16.","Things that can appear directly inside of a module or …","An item definition.","A constant item: const MAX: u16 = 65535.","An enum definition: enum Foo<A, B> { A(A), B(B) }.","An extern crate item: extern crate serde.","A free-standing function: …","A block of foreign items: extern "C" { ... }.","An impl block providing trait or associated items: …","A macro invocation, which includes macro_rules! …","A module or module declaration: mod m or mod m { ... }.","A static item: static BIKE: Shed = Shed(42).","A struct definition: struct Foo<A> { x: A }.","A trait definition: pub trait Iterator { ... }.","A trait alias: pub trait SharableIterator = Iterator + Sync…","A type alias: …","A union definition: union Foo<A, B> { x: A, y: B }.","A use declaration: use std::collections::HashMap.","A lifetime labeling a for, while, or loop.","The <= operator (less than or equal to)","A let guard: let Some(x) = opt.","A Rust lifetime: 'a.","A lifetime parameter: 'a: 'b + 'c + 'd.","","A lifetime predicate in a where clause: 'a: 'b + 'c.","A lifetime argument.","A lifetime definition: 'a: 'b + 'c + 'd.","A structured list within an attribute, like …","A Rust literal such as a string or integer or boolean.","A literal in place of an expression: 1, "foo".","A literal pattern: 0.","A boolean literal: true or false.","A byte literal: b'f'.","A byte string literal: b"foo".","A nul-terminated C-string literal: c"foo".","A character literal: 'a'.","A floating point literal: 1f64 or 1.0e10f64.","An integer literal: 1 or 1u16.","A UTF-8 string literal: "foo".","A local let binding: let x: u64 = s.parse()?.","A local (let) binding.","The expression assigned in a local let binding, including …","Conditionless loop: loop { ... }.","The < operator (less than)","A macro invocation: println!("{}", mac).","A macro invocation expression: format!("{}", q).","A macro invocation, which includes macro_rules! …","A macro invocation within an extern block.","A macro invocation within the definition of a trait.","A macro invocation within an impl block.","A macro in pattern position.","A macro invocation in statement position.","A macro in the type position.","A grouping token that surrounds a macro body: m!(...) or …","A match expression: match n { Some(n) => {}, None => {} }.","","A struct or tuple struct field accessed in a struct …","Content of a compile-time structured attribute.","A structured list within an attribute, like …","A name-value pair within an attribute, like …","A method call expression: x.foo::<T>(a, b).","A module or module declaration: mod m or mod m { ... }.","The * operator (multiplication)","The *= operator","","An identifier imported by a use item: HashMap.","A name-value pair within an attribute, like …","Named fields of a struct or struct variant such as …","A named field like self.x.","The != operator (not equal to)","The - operator for negation","The never type: !.","","","","","The ! operator for logical inversion","Contains the success value","The || operator (logical or)","A pattern that matches any one of a set of cases.","","An unspecified invalid expression.","A parenthesized expression: (a + b).","","A parenthesized pattern: (A | B).","A parenthesized type equivalent to the inner type.","The (A, B) -> C in Fn(A, B) -> C.","Arguments of a function path segment: the (A, B) -> C in …","A pattern in a local binding, function signature, match …","A const block: const { ... }.","A pattern that binds a new variable: …","A literal in place of an expression: 1, "foo".","A macro invocation expression: format!("{}", q).","A pattern that matches any one of a set of cases.","A parenthesized pattern: (A | B).","A path like std::mem::replace possibly containing generic …","A range expression: 1..2, 1.., ..2, 1..=2, ..=2.","A reference pattern: &mut var.","The dots in a tuple or slice pattern: [0, 1, ..].","A dynamically sized slice pattern: [a, b, ref i @ .., y, z]…","A struct or struct variant pattern: Variant { x, y, .. }.","A tuple pattern: (a, b).","A tuple struct or tuple variant pattern: …","A type ascription pattern: foo: f64.","A pattern that matches any value: _.","A path at which a named item is exported (e.g. …","","A path like std::mem::replace possibly containing generic …","A path prefix of imports in a use item: std::....","A path pattern like Color::Red, optionally qualified with a","A path like std::slice::Iter, optionally qualified with a …","Angle bracketed or parenthesized arguments of a path …","A segment of a path together with any path arguments on …","A lifetime predicate in a where clause: 'a: 'b + 'c.","A type predicate in a where clause: …","A raw pointer type: *const T or *mut T.","A public visibility level: pub.","The explicit Self type in a qualified path: the T in …","A range expression: 1..2, 1.., ..2, 1..=2, ..=2.","A range pattern: 1..=2.","Limit types of a range, inclusive or exclusive.","The self argument of an associated method.","The self argument of an associated method.","A referencing operation: &a or &mut a.","A reference pattern: &mut var.","A reference type: &'a T or &'a mut T.","The % operator (modulus)","The %= operator","An renamed identifier imported by a use item: …","An array literal constructed from one repeated element: …","The dots in a tuple or slice pattern: [0, 1, ..].","A visibility level restricted to some path: pub(self) or …","The result of a Syn parser.","A return, with an optional value to be returned.","Return type of a function signature.","The << operator (shift left)","The <<= operator","The >> operator (shift right)","The >>= operator","A function signature in a trait or implementation: …","A dynamically sized slice pattern: [a, b, ref i @ .., y, z]…","A dynamically sized slice type: [T].","A static item: static BIKE: Shed = Shed(42).","A foreign static item in an extern block: static ext: u8.","The mutability of an Item::Static or ForeignItem::Static.","A statement, usually ending in a semicolon.","A macro invocation in statement position.","A UTF-8 string literal: "foo".","","A struct literal expression: Point { x: 1, y: 1 }.","A struct definition: struct Foo<A> { x: A }.","A struct or struct variant pattern: Variant { x, y, .. }.","The - operator (subtraction)","The -= operator","A type-macro that expands to the name of the Rust type …","","A trait definition: pub trait Iterator { ... }.","A trait alias: pub trait SharableIterator = Iterator + Sync…","A trait used as a bound on a type parameter.","A modifier on a trait bound, currently only used for the ? …","An item declaration within the definition of a trait.","An associated constant within the definition of a trait.","An associated function within the definition of a trait.","A macro invocation within the definition of a trait.","An associated type within the definition of a trait.","A trait object type dyn Bound1 + Bound2 + Bound3 where …","A try-expression: expr?.","A try block: try { ... }.","A tuple expression: (a, b, c, d).","A tuple pattern: (a, b).","A tuple type: (A, B, C, String).","A tuple struct or tuple variant pattern: …","Returned by TypeGenerics::as_turbofish.","The possible types that a Rust value could have.","A generic type parameter: T: Into<String>.","A type predicate in a where clause: …","A type alias: …","A foreign type in an extern block: type void.","An associated type within the definition of a trait.","An associated type within an impl block.","A type ascription pattern: foo: f64.","A type argument.","A particular type is returned.","A fixed size array type: [T; n].","A bare function type: fn(usize) -> bool.","Returned by Generics::split_for_impl.","A type contained within invisible delimiters.","An impl Bound1 + Bound2 + Bound3 type where Bound is a …","Indication that a type should be inferred by the compiler: …","A macro in the type position.","The never type: !.","A generic type parameter: T: Into<String>.","A trait or lifetime used as a bound on a type parameter.","A parenthesized type equivalent to the inner type.","A path like std::slice::Iter, optionally qualified with a …","A raw pointer type: *const T or *mut T.","A reference type: &'a T or &'a mut T.","A dynamically sized slice type: [T].","A trait object type dyn Bound1 + Bound2 + Bound3 where …","A tuple type: (A, B, C, String).","A function argument accepted by pattern and type.","A unary operator: *, !, -.","A unary operation: !x, *x.","","A union definition: union Foo<A, B> { x: A, y: B }.","Unit struct or unit variant such as None.","Unnamed fields of a tuple struct or tuple variant such as …","An unnamed field like self.0.","An unsafe block: unsafe { ... }.","A use declaration: use std::collections::HashMap.","A glob import in a use item: *.","A braced group of imports in a use item: {A, B, C}.","An identifier imported by a use item: HashMap.","A path prefix of imports in a use item: std::....","An renamed identifier imported by a use item: …","A suffix of an import tree in a use item: Type as Renamed …","The variadic argument of a foreign function.","An enum variant.","Tokens in expression position not interpreted by Syn.","","Tokens forming an item not interpreted by Syn.","Tokens in an extern block not interpreted by Syn.","Tokens within the definition of a trait not interpreted by …","Tokens within an impl block not interpreted by Syn.","A raw token literal not interpreted by Syn.","Tokens in pattern position not interpreted by Syn.","Tokens in type position not interpreted by Syn.","A visibility level restricted to some path: pub(self) or …","The visibility level of an item: inherited or pub or …","A where clause in a definition: …","A single predicate in a where clause: T: Deserialize<'de>.","A while loop: while expr { ... }.","A pattern that matches any value: _.","A yield expression: yield expr.","","","","","","","","","","","","","","","","Turn a type’s generics like <X, Y> into a turbofish like …","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","Parses the literal into a selected number type.","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","The type being bounded","","","","Trait and lifetime bounds (Clone+Send+'static)","","","","","","","","","","","","","","","","","Parse a set of curly braces and expose their content to …","","","","","","","","Parse a set of square brackets and expose their content to …","","A stably addressed token buffer supporting efficient …","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","The colon in Struct { x: x }. If written in shorthand like …","","","","","","","","","","","","","","","","","","","","","","","Returns an Iterator<Item = &ConstParam> over the constant …","Returns an Iterator<Item = &mut ConstParam> over the …","","","","","","","","","","","","","Define a type that supports parsing and printing a given …","Define a type that supports parsing and printing a …","","","","","","","","","","","","","","","","Explicit discriminant: Variant = 1","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","Extension traits to provide parsing methods on foreign …","","","","Content stored in the variant.","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","Returns the argument unchanged.","","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","","","Returns the argument unchanged.","","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","","","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","","","Returns the argument unchanged.","","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","","","","","","","","","","","Returns the argument unchanged.","","","","","","","","","","","","","","","","","","","","","","","","","","","","","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","","Returns the argument unchanged.","","","Returns the argument unchanged.","","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","","","","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","","Returns the argument unchanged.","Returns the argument unchanged.","","","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","","Returns the argument unchanged.","","Returns the argument unchanged.","Returns the argument unchanged.","","","","","","","Returns the argument unchanged.","","","","","","","","","","","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","","","Returns the argument unchanged.","","","","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","","","","","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","","","","","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","","","","","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","","","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","","","","","","","","","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","","Returns the argument unchanged.","Returns the argument unchanged.","","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","","","","","","","Returns the argument unchanged.","","","","","","","","","","","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","","Returns the argument unchanged.","","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","","","","","","","","","","","","","","","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","","","","","","","","","","","","","","","","","","","","If this path consists of a single ident, returns the ident.","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","Name of the variant.","Name of the field, if any.","","","","","","","The example in macro_rules! example { ... }.","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","(A, B)","","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","","","","Returns true if there are zero fields.","","Determines whether this is a path of length 1 equal to the …","","","","","","","Get an iterator over the borrowed Field items in this …","Get an iterator over the mutably borrowed Field items in …","","","","","","","","","","","","Returns the number of fields.","","","","","","","","","Returns an Iterator<Item = &LifetimeParam> over the …","","","The for<'a> in for<'a> Foo<&'a T>","Any lifetimes from a for binding","","Returns an Iterator<Item = &mut LifetimeParam> over the …","","","","","","","","","","","","","","","","","","Initializes an empty where-clause if there is not one …","","","","","Facility for interpreting structured content inside of an …","","","","","","","","","","","","","","","","","","","","Creates a new Ident with the given string as well as the …","Panics","","Interpret a Syn literal from a proc-macro2 literal.","","","","","","","","","Same as Ident::new, but creates a raw identifier (r#ident…","","","","","","","C","","","","","","","","","","","","","","","","","","Parse a set of parentheses and expose their content to …","Parsing interface for parsing a token stream into a syntax …","Parse tokens of source code into the chosen syntax tree …","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","Parse a syntax tree node from the content of this string …","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","Parse a proc-macro2 token stream into the chosen syntax …","","Parse the arguments to the attribute as a syntax tree.","See Attribute::parse_args.","Parse the arguments to the attribute using the given …","See Attribute::parse_args_with.","Parse the tokens within the macro invocation’s …","Parse the tokens within the macro invocation’s …","Parse the content of a file of Rust code.","Parses zero or more inner attributes from the stream.","Parse the input TokenStream of a macro, triggering a …","Parse a Path containing no path arguments on any of its …","Parse a pattern, possibly involving |, but not a leading |.","Parse a pattern, possibly involving |, possibly including a","Parses a named (braced struct) field.","Parse the arguments to the attribute, expecting it to …","See Attribute::parse_nested_meta.","Parses zero or more outer attributes from the stream.","Quasi-quotation macro that accepts input like the quote! …","This macro is parse_quote! + quote_spanned!.","Parse a pattern that does not involve | at the top level.","Parse a string of Rust code into the chosen syntax tree …","Parse ::<…> with mandatory leading ::.","Parses an unnamed (tuple struct) field.","Invoke parser on the content of this string literal.","An alternative to the primary Expr::parse parser (from the …","Parse the body of a block as zero or more statements, …","An alternative to the primary Expr::parse parser (from the …","","","","","","","","","","","","Returns the path that identifies the interpretation of …","Returns the path that begins this structured meta item.","","","","","","The Foo<&'a T> in for<'a> Foo<&'a T>","","","","","","","","","","A punctuated sequence of syntax tree nodes separated by …","","","","","","","","A method’s self receiver, such as &self or …","","","","","An error if this path is not a single ident, as defined in …","Error if this is a Meta::Path or Meta::NameValue.","Error if this is a Meta::Path or Meta::List.","Error if this is a Meta::List or Meta::NameValue.","","","","","","","","","The Self type of the impl.","","","","","","","","","","","","","","","","","","","","","","","","","","Configures the span of this Ident, possibly changing its …","","","","","","","","","","","","","","","","Returns the span of this Ident.","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","A trait that can provide the Span of the complete contents …","Split a type’s generics into the pieces required for impl…","","","","","","","Statements in a block","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","Tokens representing Rust punctuation, keywords, and …","","","","","","","","","","","Trait this impl implements.","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","Returns an Iterator<Item = &TypeParam> over the type …","Returns an Iterator<Item = &mut TypeParam> over the type …","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","Syntax tree traversal to mutate an exclusive borrow of a …","","","","In some positions, types may not contain the + character, …","","","","","A cheaply copyable cursor into a TokenBuffer.","A buffer that can be efficiently traversed multiple times, …","Creates a cursor referencing the first token in the buffer …","","","","","","","Creates a cursor referencing a static empty TokenStream.","Checks whether the cursor is currently pointing at the end …","","Returns the argument unchanged.","Returns the argument unchanged.","If the cursor is pointing at a Group with the given …","If the cursor is pointing at a Ident, returns it along …","Calls U::from(self).","Calls U::from(self).","If the cursor is pointing at a Lifetime, returns it along …","If the cursor is pointing at a Literal, return it along …","Creates a TokenBuffer containing all the tokens from the …","Creates a TokenBuffer containing all the tokens from the …","","If the cursor is pointing at a Punct, returns it along …","Returns the Span of the current token, or Span::call_site()…","","Copies all remaining tokens visible from this cursor into a","If the cursor is pointing at a TokenTree, returns it along …","","","","","","","Additional methods for Ident not provided by proc-macro2 …","Parses any identifier including keywords.","Peeks any identifier including keywords. Usage: …","Strips the raw marker r#, if any, from the beginning of an …","Context for parsing a single property in the conventional …","","","Report that the attribute’s content did not conform to …","Returns the argument unchanged.","","Calls U::from(self).","Used when parsing list(...) syntax if the content inside …","Make a parser that is usable with parse_macro_input! in a …","","","","","Used when parsing key = "value" syntax.","Contains the error value","Error returned when a Syn parser cannot parse the input …","Support for checking the next token in a stream to decide …","An empty syntax tree node that consumes no tokens when …","Contains the success value","","Parsing interface implemented by all types that can be …","Cursor position within a buffered token stream.","Input to a Syn parser function.","Parser that can parse Rust tokens into a particular syntax …","Types that can be parsed by looking at just one token.","The result of a Syn parser.","Cursor state associated with speculative parsing.","","","","","","","","","","","","Calls the given parser function to parse a syntax tree …","","","","","","","Add another error message to self such that when …","Provides low-level access to the token representation …","","Extensions to the parsing API with niche applicability.","","","Triggers an error at the current position of the parse …","Triggers an error at the current position of the parse …","Triggers an error at the current position of the parse …","","","","","","","Forks a parse stream so that parsing tokens out of either …","","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Render the error as an invocation of compile_error!.","","","Returns whether there are tokens remaining in this stream.","Constructs a helper for peeking at the next token in this …","Usually the ParseStream::error method will be used …","Creates an error with the specified message spanning the …","","Parses a syntax tree node of type T, advancing the …","Parse tokens of source code into the chosen syntax tree …","","Parse a proc-macro2 token stream into the chosen syntax …","","Parse a string of Rust code into the chosen syntax tree …","Parses zero or more occurrences of T separated by …","Looks at the next token in the parse stream to determine …","Looks at the next token in the parse stream to determine …","Looks at the second-next token in the parse stream.","Looks at the third-next token in the parse stream.","The source location of the error.","Returns the Span of the next token in the parse stream, or …","","Speculatively parses tokens from this parse stream, …","Render the error as an invocation of compile_error!.","","","","","","","","","","","","","","","","","","","","","","Extensions to the ParseStream API to support manipulating …","Extensions to the ParseStream API to support speculative …","Advance this parse stream to the position of a forked …","Returns the delimiter, the span of the delimiter token, …","","An iterator over owned values of type T.","An iterator over owned pairs of type Pair<T, P>.","An iterator over borrowed values of type &T.","An iterator over mutably borrowed values of type &mut T.","A single syntax tree node of type T followed by its …","An iterator over borrowed pairs of type Pair<&T, &P>.","An iterator over mutably borrowed pairs of type …","A punctuated sequence of syntax tree nodes of type T …","","","","","","","","","","","","","","","","","","Clears the sequence of all values and punctuation, making …","","","","","","","","","","","","","","","","Returns true if either this Punctuated is empty, or it has …","","","","Borrows the first element in this sequence.","Mutably borrows the first element in this sequence.","","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","","","","","","Inserts an element at position index.","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","","","","","","","","","","Returns an iterator over the contents of this sequence as …","Produces this punctuated pair as a tuple of syntax tree …","Extracts the syntax tree node from this punctuated pair, …","Determines whether this punctuated sequence is empty, …","Returns an iterator over borrowed syntax tree nodes of …","Returns an iterator over mutably borrowed syntax tree …","Borrows the last element in this sequence.","Mutably borrows the last element in this sequence.","Returns the number of syntax tree nodes in this punctuated …","","","","","","","Creates an empty punctuated sequence.","Creates a punctuated pair out of a syntax tree node and an …","","","","","","","","","","","","","Returns an iterator over the contents of this sequence as …","Returns an iterator over the contents of this sequence as …","Parses one or more occurrences of T separated by …","Parses one or more occurrences of T using the given parse …","Parses zero or more occurrences of T separated by …","Parses zero or more occurrences of T using the given parse …","Removes the last punctuated pair from this sequence, or …","Removes the trailing punctuation from this punctuated …","Borrows the punctuation from this punctuated pair, unless …","Mutably borrows the punctuation from this punctuated pair, …","Appends a syntax tree node onto the end of this punctuated …","Appends a trailing punctuation onto the end of this …","Appends a syntax tree node onto the end of this punctuated …","","","","","","","","","","","","","","","","","Determines whether this punctuated sequence ends with a …","","","","","","","","","","","","","","","","","","","","","","","","","Borrows the syntax tree node from this punctuated pair.","Mutably borrows the syntax tree node from this punctuated …","A trait that can provide the Span of the complete contents …","Returns a Span covering the complete contents of this …","abstract","&","&&","&=","as","async","@","auto","await","become","box","{…}","[…]","break","^","^=",":",",","const","continue","crate","default","do","$",".","..","...","..=","dyn","else","enum","=","==","extern","=>","final","fn","for",">=","None-delimited group",">","if","impl","in","<-","<=","let","loop","<","macro","match","-","-=","mod","move","mut","!=","!","|","|=","||","override","(…)","::","%","%=","+","+=","#","priv","pub","?","->","ref","return","Self","self",";","<<","<<=",">>",">>=","/","/=","*","*=","static","struct","super","~","Marker trait for types that represent single tokens.","trait","try","type","typeof","_","union","unsafe","unsized","use","virtual","where","while","yield","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","Syntax tree traversal to mutate an exclusive borrow of a …","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","",""],"i":[0,137,137,137,154,0,0,26,170,26,0,155,0,155,26,0,0,26,170,0,0,0,26,137,137,137,137,137,137,0,26,128,0,136,136,26,128,128,128,26,26,128,70,26,26,73,85,112,117,139,155,0,0,155,26,0,0,0,0,188,138,0,137,137,22,85,137,6,0,0,166,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,85,0,26,0,0,0,0,0,0,0,128,85,107,112,117,0,26,0,0,0,0,0,85,137,0,0,0,101,26,101,170,137,70,0,139,26,85,0,0,0,0,0,0,0,170,0,26,26,170,162,12,128,0,166,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,137,26,0,73,78,82,155,0,13,0,26,139,0,0,0,0,0,0,0,0,0,166,0,26,137,0,26,85,107,112,117,139,166,170,0,26,80,0,0,0,0,26,85,137,137,126,101,13,17,65,137,138,170,80,126,154,164,138,6,137,139,12,26,26,136,139,170,154,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,13,26,101,139,170,0,0,0,0,170,162,0,26,139,0,0,123,26,139,170,137,137,101,26,139,162,0,26,0,137,137,137,137,0,139,170,85,107,0,0,0,128,22,26,85,139,137,137,0,78,85,85,0,0,0,0,0,0,0,170,26,26,26,139,170,139,0,0,73,82,85,107,112,117,139,155,188,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,123,0,26,22,85,17,17,65,26,85,0,0,0,0,0,0,0,0,26,78,85,107,112,117,128,139,170,0,0,0,0,26,139,26,90,122,172,54,143,181,10,34,50,156,153,49,35,104,161,1,29,36,122,16,20,21,27,28,29,30,31,32,33,34,35,36,37,37,38,39,40,41,42,43,44,45,46,46,47,48,48,49,50,51,52,52,53,53,54,55,56,57,58,59,60,61,62,63,64,67,69,71,74,75,76,86,87,88,89,90,91,92,93,94,95,96,97,98,99,100,108,109,110,111,113,114,115,116,118,119,120,121,124,125,140,141,142,143,144,145,146,147,148,149,150,151,167,169,186,187,96,30,135,177,30,39,3,5,3,5,29,32,37,37,59,62,89,119,36,40,47,63,69,8,9,1,2,10,11,12,13,14,15,16,17,18,19,20,21,22,23,24,25,26,27,28,29,30,31,32,33,34,35,36,37,38,39,40,41,42,43,44,45,46,47,48,49,50,51,52,53,54,55,56,57,58,59,60,61,62,63,64,65,66,67,68,69,70,71,72,73,74,75,76,77,78,79,80,81,82,83,84,85,86,87,88,89,90,91,92,93,94,95,96,97,98,99,100,101,102,103,104,105,106,107,108,109,110,111,112,113,114,115,116,117,118,119,120,121,122,123,124,125,126,127,128,129,130,131,132,133,3,5,134,135,136,137,138,139,140,141,142,143,144,145,146,147,148,149,150,151,152,153,154,155,156,157,158,159,160,161,162,163,164,165,166,167,168,169,170,171,172,173,174,175,176,177,178,179,180,181,182,183,184,185,186,187,188,8,9,1,2,10,11,12,13,14,15,16,17,18,19,20,21,22,23,24,25,26,27,28,29,30,31,32,33,34,35,36,37,38,39,40,41,42,43,44,45,46,47,48,49,50,51,52,53,54,55,56,57,58,59,60,61,62,63,64,65,66,67,68,69,70,71,72,73,74,75,76,77,78,79,80,81,82,83,84,85,86,87,88,89,90,91,92,93,94,95,96,97,98,99,100,101,102,103,104,105,106,107,108,109,110,111,112,113,114,115,116,117,118,119,120,121,122,123,124,125,126,127,128,129,130,131,132,133,3,5,134,135,136,137,138,139,140,141,142,143,144,145,146,147,148,149,150,151,152,153,154,155,156,157,158,159,160,161,162,163,164,165,166,167,168,169,170,171,172,173,174,175,176,177,178,179,180,181,182,183,184,185,186,187,188,84,74,75,83,84,97,115,159,174,183,18,24,49,57,87,90,91,96,106,146,165,0,11,27,43,55,145,171,182,0,33,0,140,29,36,141,8,9,1,2,10,11,12,13,14,15,16,17,18,19,20,21,22,23,24,25,26,27,28,29,30,31,32,33,34,35,36,37,38,39,40,41,42,43,44,45,46,47,48,49,50,51,52,53,54,55,56,57,58,59,60,61,62,63,64,65,66,67,68,69,70,71,72,73,74,75,76,77,78,79,80,81,82,83,84,85,86,87,88,89,90,91,92,93,94,95,96,97,98,99,100,101,102,103,104,105,106,107,108,109,110,111,112,113,114,115,116,117,118,119,120,121,122,123,124,125,126,127,128,129,130,131,132,133,3,5,134,135,136,137,138,139,140,141,142,143,144,145,146,147,148,149,150,151,152,153,154,155,156,157,158,159,160,161,162,163,164,165,166,167,168,169,170,171,172,173,174,175,176,177,178,179,180,181,182,183,184,185,186,187,188,8,9,1,2,10,11,12,13,14,15,16,17,18,19,20,21,22,23,24,25,26,27,28,29,30,31,32,33,34,35,36,37,38,39,40,41,42,43,44,45,46,47,48,49,50,51,52,53,54,55,56,57,58,59,60,61,62,63,64,65,66,67,68,69,70,71,72,73,74,75,76,77,78,79,80,81,82,83,84,85,86,87,88,89,90,91,92,93,94,95,96,97,98,99,100,101,102,103,104,105,106,107,108,109,110,111,112,113,114,115,116,117,118,119,120,121,122,123,124,125,126,127,128,129,130,131,132,133,3,5,134,135,136,137,138,139,140,141,142,143,144,145,146,147,148,149,150,151,152,153,154,155,156,157,158,159,160,161,162,163,164,165,166,167,168,169,170,171,172,173,174,175,176,177,178,179,180,181,182,183,184,185,186,187,188,8,10,102,156,20,67,68,74,75,76,83,84,86,94,96,109,113,115,118,124,149,151,159,69,125,187,42,63,72,72,37,37,76,86,113,118,180,36,122,93,38,88,0,0,21,72,77,154,75,76,113,114,115,91,118,119,120,14,135,16,168,57,144,30,39,50,125,187,183,171,173,178,180,181,182,27,60,145,147,148,184,42,53,53,24,87,8,8,9,1,2,10,11,12,13,14,15,16,17,18,19,20,21,22,23,24,25,26,27,28,29,30,31,32,33,34,35,36,37,38,39,40,41,42,43,44,45,46,47,48,49,50,51,52,53,54,55,56,57,58,59,60,61,62,63,64,65,66,67,68,69,70,71,72,73,74,75,76,77,78,79,80,81,82,83,84,85,86,87,88,89,90,91,92,93,94,95,96,97,98,99,100,101,102,103,104,105,106,107,108,109,110,111,112,113,114,115,116,117,118,119,120,121,122,123,124,125,126,127,128,129,130,131,132,133,3,5,134,135,136,137,138,139,140,141,142,143,144,145,146,147,148,149,150,151,152,153,154,155,156,157,158,159,160,161,162,163,164,165,166,167,168,169,170,171,172,173,174,175,176,177,178,179,180,181,182,183,184,185,186,187,188,15,28,45,75,76,86,94,97,98,118,120,157,158,168,33,35,40,41,43,45,49,51,54,55,56,58,61,64,67,86,94,118,168,0,88,185,69,16,23,25,57,95,99,146,8,8,8,9,1,2,10,10,11,12,13,14,15,16,17,18,19,20,21,22,23,24,25,26,27,28,29,30,31,32,33,34,35,36,37,38,39,40,41,42,43,44,45,46,47,48,49,50,51,52,53,54,55,56,57,58,59,60,61,62,63,64,65,65,66,66,67,68,69,70,71,72,73,74,75,76,77,78,79,80,81,82,83,84,85,86,87,88,89,90,91,92,93,94,95,96,97,98,99,100,101,102,103,104,105,106,107,108,109,110,111,112,113,114,115,116,117,118,119,120,121,122,123,124,125,126,127,128,129,130,131,132,133,3,3,5,5,134,135,136,137,138,139,140,141,142,143,144,145,146,147,148,149,150,151,152,153,154,155,156,157,158,159,160,161,162,163,164,165,166,167,168,169,170,171,172,173,174,175,176,177,178,179,180,181,182,183,184,185,186,187,188,122,172,40,77,8,8,8,8,8,8,8,9,1,2,10,11,12,13,13,13,13,14,15,16,17,17,17,18,19,20,21,21,21,21,22,23,24,25,26,26,26,26,26,26,26,26,26,26,26,26,26,26,26,26,26,26,26,26,26,26,26,26,26,26,26,26,26,26,26,26,26,26,26,26,26,26,26,27,28,29,30,31,32,33,34,35,36,37,38,39,40,41,42,43,44,45,46,47,48,49,50,51,52,53,54,55,56,57,58,59,60,61,62,63,64,65,65,65,65,66,66,67,68,69,70,71,72,73,73,73,73,74,75,75,76,77,78,78,78,79,80,81,82,82,82,83,84,85,85,85,85,85,85,85,85,85,85,85,85,85,85,85,85,85,86,87,88,89,90,91,92,93,94,95,96,97,98,99,100,101,101,101,101,101,101,102,103,104,105,106,107,107,107,107,107,108,109,110,111,112,112,112,112,112,113,114,115,116,117,117,117,117,117,118,119,120,121,122,123,123,123,124,125,126,127,128,128,128,128,128,128,128,128,128,129,130,131,132,133,3,3,5,5,134,135,136,137,138,139,139,139,139,139,139,139,139,139,139,139,139,139,139,139,139,139,140,141,142,143,144,145,146,147,148,149,150,151,152,152,153,153,154,155,156,157,158,159,160,161,162,163,164,165,166,167,168,169,170,170,170,170,170,170,170,170,170,170,170,170,170,170,170,171,172,173,174,175,176,177,178,179,180,181,182,183,184,185,186,187,188,34,21,86,87,91,95,96,97,98,99,110,113,115,118,120,122,157,158,159,152,41,173,72,77,156,161,69,8,9,1,2,10,11,12,13,14,15,16,17,18,19,20,21,22,23,24,25,26,27,28,29,30,31,32,33,34,35,36,37,38,39,40,41,42,43,44,45,46,47,48,49,50,51,52,53,54,55,56,57,58,59,60,61,62,63,64,65,66,67,68,69,70,71,72,73,74,75,76,77,78,79,80,81,82,83,84,85,86,87,88,89,90,91,92,93,94,95,96,97,98,99,100,101,102,103,104,105,106,107,108,109,110,111,112,113,114,115,116,117,118,119,120,121,122,123,124,125,126,127,128,129,130,131,132,133,3,5,134,135,136,137,138,139,140,141,142,143,144,145,146,147,148,149,150,151,152,153,154,155,156,157,158,159,160,161,162,163,164,165,166,167,168,169,170,171,172,173,174,175,176,177,178,179,180,181,182,183,184,185,186,187,188,10,16,20,21,75,76,86,87,88,92,93,94,95,96,97,98,99,102,103,104,109,110,113,115,118,120,122,140,153,157,158,159,42,91,174,40,163,43,66,167,36,122,160,172,8,9,1,2,10,11,12,13,14,15,16,17,18,19,20,21,22,23,24,25,26,27,28,29,30,31,32,33,34,35,36,37,38,39,40,41,42,43,44,45,46,47,48,49,50,51,52,53,54,55,56,57,58,59,60,61,62,63,64,65,66,67,68,69,70,71,72,73,74,75,76,77,78,79,80,81,82,83,84,85,86,87,88,89,90,91,92,93,94,95,96,97,98,99,100,101,102,103,104,105,106,107,108,109,110,111,112,113,114,115,116,117,118,119,120,121,122,123,124,125,126,127,128,129,130,131,132,133,3,5,134,135,136,137,138,139,140,141,142,143,144,145,146,147,148,149,150,151,152,153,154,155,156,157,158,159,160,161,162,163,164,165,166,167,168,169,170,171,172,173,174,175,176,177,178,179,180,181,182,183,184,185,186,187,188,17,17,17,17,154,152,154,71,90,91,96,106,17,17,32,33,38,40,47,63,100,152,141,28,31,17,55,171,45,167,124,74,83,181,72,36,77,79,84,172,72,53,53,46,46,47,72,77,156,161,48,48,92,111,116,121,169,176,72,49,39,67,151,0,11,50,93,79,36,20,54,94,109,124,140,143,180,181,68,185,186,187,18,8,10,74,128,129,130,131,132,133,3,5,134,8,31,61,36,36,36,122,160,172,72,19,34,50,51,60,79,122,142,147,148,160,163,172,178,184,0,0,0,8,10,13,14,15,16,18,19,21,26,27,28,29,30,31,32,33,34,35,36,37,38,39,40,42,43,44,45,46,47,48,49,50,51,52,53,54,55,56,57,58,59,60,61,62,63,64,65,66,67,68,69,70,71,72,73,74,75,76,77,78,79,80,81,82,85,86,87,88,89,90,91,92,93,94,95,96,97,98,99,100,101,107,108,109,110,111,112,113,114,115,116,117,118,119,120,121,122,123,124,126,128,129,129,130,131,132,133,3,5,134,135,137,138,149,152,153,155,156,160,162,165,166,170,171,172,173,174,175,176,177,178,179,180,181,182,183,184,185,186,188,0,8,11,14,11,14,135,135,0,11,0,152,139,139,20,11,14,11,0,0,139,0,156,20,129,26,165,26,8,10,40,45,69,125,142,143,149,151,167,11,13,14,15,52,52,57,79,135,146,148,163,179,161,11,81,163,0,52,52,57,146,148,179,58,122,50,124,88,104,152,13,13,13,57,146,96,56,28,31,152,124,91,93,23,55,86,88,92,94,95,97,98,100,108,109,110,111,113,114,115,116,118,120,121,167,169,171,8,10,128,129,130,131,132,133,3,5,134,71,89,108,114,119,8,8,8,9,1,2,10,10,11,13,14,15,16,17,18,19,20,21,26,27,28,29,30,31,32,33,34,35,36,37,38,39,40,41,42,43,44,45,46,47,48,49,50,51,52,53,54,55,56,57,58,59,60,61,62,63,64,65,65,66,66,67,68,69,70,71,72,73,74,75,76,77,78,79,80,81,82,83,84,85,86,87,88,89,90,91,92,93,94,95,96,97,98,99,100,101,102,103,104,105,106,107,108,109,110,111,112,113,114,115,116,117,118,119,120,121,122,123,124,125,126,128,128,129,129,130,130,131,131,132,132,133,133,3,3,5,5,134,134,135,136,137,138,139,140,141,142,143,144,145,146,147,148,149,150,151,152,153,154,155,156,157,158,159,160,161,162,163,165,166,167,169,170,171,172,173,174,175,176,177,178,179,180,181,182,183,184,185,186,187,188,66,134,0,72,105,180,53,53,94,109,165,23,95,11,140,128,129,130,131,132,133,3,5,96,42,8,9,1,2,10,11,12,13,14,15,16,17,18,19,20,21,22,23,24,25,26,27,28,29,30,31,32,33,34,35,36,37,38,39,40,41,42,43,44,45,46,47,48,49,50,51,52,53,54,55,56,57,58,59,60,61,62,63,64,65,66,67,68,69,70,71,72,73,74,75,76,77,78,79,80,81,82,83,84,85,86,87,88,89,90,91,92,93,94,95,96,97,98,99,100,101,102,103,104,105,106,107,108,109,110,111,112,113,114,115,116,117,118,119,120,121,122,123,124,125,126,127,128,129,130,131,132,133,3,5,134,135,136,137,138,139,140,141,142,143,144,145,146,147,148,149,150,151,152,153,154,155,156,157,158,159,160,161,162,163,164,165,166,167,168,169,170,171,172,173,174,175,176,177,178,179,180,181,182,183,184,185,186,187,188,8,10,3,5,8,9,1,2,10,11,13,14,15,16,17,18,19,20,21,26,27,28,29,30,31,32,33,34,35,36,37,38,39,40,41,42,43,44,45,46,47,48,49,50,51,52,53,54,55,56,57,58,59,60,61,62,63,64,65,66,67,68,69,70,71,72,73,74,75,76,77,78,79,80,81,82,83,84,85,86,87,88,89,90,91,92,93,94,95,96,97,98,99,100,101,102,103,104,105,106,107,108,109,110,111,112,113,114,115,116,117,118,119,120,121,122,123,124,125,126,128,129,130,131,132,133,3,5,134,135,137,138,139,140,141,142,143,144,145,146,147,148,149,150,151,152,153,154,155,156,157,158,159,160,162,163,165,166,167,169,170,171,172,173,174,175,176,177,178,179,180,181,182,183,184,185,186,187,188,0,129,130,131,132,133,3,5,134,14,135,91,96,97,100,102,8,9,1,2,10,11,12,13,14,15,16,17,18,19,20,21,22,23,24,25,26,27,28,29,30,31,32,33,34,35,36,37,38,39,40,41,42,43,44,45,46,47,48,49,50,51,52,53,54,55,56,57,58,59,60,61,62,63,64,65,66,67,68,69,70,71,72,73,74,75,76,77,78,79,80,81,82,83,84,85,86,87,88,89,90,91,92,93,94,95,96,97,98,99,100,101,102,103,104,105,106,107,108,109,110,111,112,113,114,115,116,117,118,119,120,121,122,123,124,125,126,127,128,129,130,131,132,133,3,5,134,135,136,137,138,139,140,141,142,143,144,145,146,147,148,149,150,151,152,153,154,155,156,157,158,159,160,161,162,163,164,165,166,167,168,169,170,171,172,173,174,175,176,177,178,179,180,181,182,183,184,185,186,187,188,8,9,1,2,10,11,12,13,14,15,16,17,18,19,20,21,22,23,24,25,26,27,28,29,30,31,32,33,34,35,36,37,38,39,40,41,42,43,44,45,46,47,48,49,50,51,52,53,54,55,56,57,58,59,60,61,62,63,64,65,66,67,68,69,70,71,72,73,74,75,76,77,78,79,80,81,82,83,84,85,86,87,88,89,90,91,92,93,94,95,96,97,98,99,100,101,102,103,104,105,106,107,108,109,110,111,112,113,114,115,116,117,118,119,120,121,122,123,124,125,126,127,128,129,130,131,132,133,3,5,134,135,136,137,138,139,140,141,142,143,144,145,146,147,148,149,150,151,152,153,154,155,156,157,158,159,160,161,162,163,164,165,166,167,168,169,170,171,172,173,174,175,176,177,178,179,180,181,182,183,184,185,186,187,188,59,50,20,35,76,86,94,98,109,113,118,120,124,149,157,161,186,8,9,1,2,10,11,12,13,14,15,16,17,18,19,20,21,22,23,24,25,26,27,28,29,30,31,32,33,34,35,36,37,38,39,40,41,42,43,44,45,46,47,48,49,50,51,52,53,54,55,56,57,58,59,60,61,62,63,64,65,66,67,68,69,70,71,72,73,74,75,76,77,78,79,80,81,82,83,84,85,86,87,88,89,90,91,92,93,94,95,96,97,98,99,100,101,102,103,104,105,106,107,108,109,110,111,112,113,114,115,116,117,118,119,120,121,122,123,124,125,126,127,128,129,130,131,132,133,3,5,134,135,136,137,138,139,140,141,142,143,144,145,146,147,148,149,150,151,152,153,154,155,156,157,158,159,160,161,162,163,164,165,166,167,168,169,170,171,172,173,174,175,176,177,178,179,180,181,182,183,184,185,186,187,188,72,72,98,110,115,120,44,150,175,25,99,19,8,62,90,91,93,96,122,172,100,129,130,131,132,133,134,15,134,158,122,172,24,87,20,21,86,87,88,89,93,94,95,96,97,98,99,100,108,109,110,118,119,120,0,72,81,63,170,174,183,188,64,0,0,230,230,231,230,231,231,231,231,231,231,230,231,231,231,230,231,231,231,230,230,231,231,231,231,231,231,230,231,230,231,230,231,0,235,235,235,0,222,222,222,222,222,222,222,0,222,222,222,222,222,6,0,0,0,6,220,0,0,0,0,0,0,0,238,236,242,238,240,241,236,242,238,240,241,238,236,240,241,236,240,241,236,238,240,0,238,241,242,238,240,236,236,236,238,238,241,238,236,236,242,238,240,241,241,236,242,238,240,241,236,236,236,238,238,236,236,217,238,220,241,220,238,220,238,242,238,238,238,236,238,241,238,236,236,240,241,236,238,241,236,242,238,240,241,236,242,238,240,241,236,242,238,240,241,0,0,250,251,256,0,0,0,0,0,0,0,0,256,247,253,261,254,255,209,210,256,247,253,261,254,255,209,210,256,247,247,253,254,255,209,256,247,247,253,254,255,209,256,256,247,247,247,247,247,247,247,247,247,253,261,254,255,209,210,256,247,247,247,247,247,247,247,253,261,254,255,209,210,256,247,247,247,253,261,254,255,209,210,247,256,256,247,247,247,247,247,247,253,261,254,255,209,210,247,256,253,261,254,255,209,210,253,261,254,255,209,210,247,247,247,247,247,247,247,247,256,256,247,247,247,253,261,254,255,209,210,247,256,247,253,254,255,209,256,247,256,247,247,253,261,254,255,209,210,256,247,253,261,254,255,209,210,256,247,253,261,254,255,209,210,256,256,256,0,263,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,264,201,265,266,267,268,269,270,271,272,273,274,200,275,276,277,278,279,198,280,281,282,283,284,285,286,287,288,289,290,291,292,293,294,295,296,297,203,199,298,299,202,300,301,302,303,304,305,306,307,308,309,310,311,312,313,314,315,316,317,318,319,320,321,322,323,324,325,326,327,328,329,330,331,332,333,334,335,336,337,338,339,340,341,342,343,344,345,346,347,348,349,350,351,352,353,354,355,356,357,358,359,360,264,201,265,266,267,268,269,270,271,272,273,274,200,275,276,277,278,279,198,280,281,282,283,284,285,286,287,288,289,290,291,292,293,294,295,296,297,203,199,298,299,202,300,301,302,303,304,305,306,307,308,309,310,311,312,313,314,315,316,317,318,319,320,321,322,323,324,325,326,327,328,329,330,331,332,333,334,335,336,337,338,339,340,341,342,343,344,345,346,347,348,349,350,351,352,353,354,355,356,357,358,359,360,264,201,265,266,267,268,269,270,271,272,273,274,200,275,276,277,278,279,198,280,281,282,283,284,285,286,287,288,289,290,291,292,293,294,295,296,297,203,199,298,299,202,300,301,302,303,304,305,306,307,308,309,310,311,312,313,314,315,316,317,318,319,320,321,322,323,324,325,326,327,328,329,330,331,332,333,334,335,336,337,338,339,340,341,342,343,344,345,346,347,348,349,350,351,352,353,354,355,356,357,358,359,360,264,201,265,266,267,268,269,270,271,272,273,274,200,275,276,277,278,279,198,280,281,282,283,284,285,286,287,288,289,290,291,292,293,294,295,296,297,203,199,298,299,202,300,301,302,303,304,305,306,307,308,309,310,311,312,313,314,315,316,317,318,319,320,321,322,323,324,325,326,327,328,329,330,331,332,333,334,335,336,337,338,339,340,341,342,343,344,345,346,347,348,349,350,351,352,353,354,355,356,357,358,359,360,264,201,265,266,267,268,269,270,271,272,273,274,200,275,276,277,278,279,198,280,281,282,283,284,285,286,287,288,289,290,291,292,293,294,295,296,297,203,199,298,299,202,300,301,302,303,304,305,306,307,308,309,310,311,312,313,314,315,316,317,318,319,320,321,322,323,324,325,326,327,328,329,330,331,332,333,334,335,336,337,338,339,340,341,342,343,344,345,346,347,348,349,350,351,352,353,354,355,356,357,358,359,360,201,312,315,316,318,319,320,321,325,329,332,333,336,337,341,343,345,346,348,353,355,357,201,312,315,316,318,319,320,321,325,329,332,333,336,337,341,343,345,346,348,353,355,357,264,201,265,266,267,268,269,270,271,272,273,274,200,275,276,277,278,279,198,280,281,282,283,284,285,286,287,288,289,290,291,292,293,294,295,296,297,203,199,298,299,202,300,301,302,303,304,305,306,307,308,309,310,311,312,313,314,315,316,317,318,319,320,321,322,323,324,325,326,327,328,329,330,331,332,333,334,335,336,337,338,339,340,341,342,343,344,345,346,347,348,349,350,351,352,353,354,355,356,357,358,359,360,264,201,265,266,267,268,269,270,271,272,273,274,200,275,276,277,278,279,198,280,281,282,283,284,285,286,287,288,289,290,291,292,293,294,295,296,297,203,199,298,299,202,300,301,302,303,304,305,306,307,308,309,310,311,312,313,314,315,316,317,318,319,320,321,322,323,324,325,326,327,328,329,330,331,332,333,334,335,336,337,338,339,340,341,342,343,344,345,346,347,348,349,350,351,352,353,354,355,356,357,358,359,360,264,201,265,266,267,268,269,270,271,272,273,274,200,275,276,277,278,279,198,280,281,282,283,284,285,286,287,288,289,290,291,292,293,294,295,296,297,203,199,298,299,202,300,301,302,303,304,305,306,307,308,309,310,311,312,313,314,315,316,317,318,319,320,321,322,323,324,325,326,327,328,329,330,331,332,333,334,335,336,337,338,339,340,341,342,343,344,345,346,347,348,349,350,351,352,353,354,355,356,357,358,359,360,264,201,265,266,267,268,269,270,271,272,273,274,200,275,276,277,278,279,198,280,281,282,283,284,285,286,287,288,289,290,291,292,293,294,295,296,297,203,199,298,299,202,300,301,302,303,304,305,306,307,308,309,310,311,312,313,314,315,316,317,318,319,320,321,322,323,324,325,326,327,328,329,330,331,332,333,334,335,336,337,338,339,340,341,342,343,344,345,346,347,348,349,350,351,352,353,354,355,356,357,358,359,360,264,201,265,266,267,268,269,270,271,272,273,274,200,275,276,277,278,279,198,280,281,282,283,284,285,286,287,288,289,290,291,292,293,294,295,296,297,203,199,298,299,202,300,301,302,303,304,305,306,307,308,309,310,311,312,313,314,315,316,317,318,319,320,321,322,323,324,325,326,327,328,329,330,331,332,333,334,335,336,337,338,339,340,341,342,343,344,345,346,347,348,349,350,351,352,353,354,355,356,357,358,359,360,201,265,266,267,268,269,270,271,272,273,274,200,275,276,277,278,279,198,280,281,282,283,284,285,286,287,288,289,290,291,292,293,294,295,296,297,203,199,298,299,202,300,301,302,303,304,305,306,307,308,309,310,311,312,313,314,315,316,317,318,319,320,321,322,323,324,325,326,327,328,329,330,331,332,333,334,335,336,337,338,339,340,341,342,343,344,345,346,347,348,349,350,351,352,353,354,355,356,357,201,265,266,267,268,269,270,271,272,273,274,200,275,276,277,278,279,198,280,281,282,283,284,285,286,287,288,289,290,291,292,293,294,295,296,297,203,199,298,299,202,300,301,302,303,304,305,306,307,308,309,310,311,312,313,314,315,316,317,318,319,320,321,322,323,324,325,326,327,328,329,330,331,332,333,334,335,336,337,338,339,340,341,342,343,344,345,346,347,348,349,350,351,352,353,354,355,356,357,264,265,266,267,268,269,270,271,272,273,274,200,275,276,277,278,279,198,280,281,282,283,284,285,286,287,288,289,290,291,292,293,294,295,296,297,203,199,298,299,202,300,301,302,303,304,305,306,307,308,309,310,311,358,359,360,201,312,313,314,315,316,317,318,319,320,321,322,323,324,325,326,327,328,329,330,331,332,333,334,335,336,337,338,339,340,341,342,343,344,345,346,347,348,349,350,351,352,353,354,355,356,357,264,358,359,360,264,201,265,266,267,268,269,270,271,272,273,274,200,275,276,277,278,279,198,280,281,282,283,284,285,286,287,288,289,290,291,292,293,294,295,296,297,203,199,298,299,202,300,301,302,303,304,305,306,307,308,309,310,311,312,313,314,315,316,317,318,319,320,321,322,323,324,325,326,327,328,329,330,331,332,333,334,335,336,337,338,339,340,341,342,343,344,345,346,347,348,349,350,351,352,353,354,355,356,357,358,359,360,201,265,266,267,268,269,270,271,272,273,274,200,275,276,277,278,279,198,280,281,282,283,284,285,286,287,288,289,290,291,292,293,294,295,296,297,203,199,298,299,202,300,301,302,303,304,305,306,307,308,309,310,311,312,313,314,315,316,317,318,319,320,321,322,323,324,325,326,327,328,329,330,331,332,333,334,335,336,337,338,339,340,341,342,343,344,345,346,347,348,349,350,351,352,353,354,355,356,357,264,201,265,266,267,268,269,270,271,272,273,274,200,275,276,277,278,279,198,280,281,282,283,284,285,286,287,288,289,290,291,292,293,294,295,296,297,203,199,298,299,202,300,301,302,303,304,305,306,307,308,309,310,311,312,313,314,315,316,317,318,319,320,321,322,323,324,325,326,327,328,329,330,331,332,333,334,335,336,337,338,339,340,341,342,343,344,345,346,347,348,349,350,351,352,353,354,355,356,357,358,359,360,264,201,265,266,267,268,269,270,271,272,273,274,200,275,276,277,278,279,198,280,281,282,283,284,285,286,287,288,289,290,291,292,293,294,295,296,297,203,199,298,299,202,300,301,302,303,304,305,306,307,308,309,310,311,312,313,314,315,316,317,318,319,320,321,322,323,324,325,326,327,328,329,330,331,332,333,334,335,336,337,338,339,340,341,342,343,344,345,346,347,348,349,350,351,352,353,354,355,356,357,358,359,360,264,201,265,266,267,268,269,270,271,272,273,274,200,275,276,277,278,279,198,280,281,282,283,284,285,286,287,288,289,290,291,292,293,294,295,296,297,203,199,298,299,202,300,301,302,303,304,305,306,307,308,309,310,311,312,313,314,315,316,317,318,319,320,321,322,323,324,325,326,327,328,329,330,331,332,333,334,335,336,337,338,339,340,341,342,343,344,345,346,347,348,349,350,351,352,353,354,355,356,357,358,359,360,0,0,361,361,0,361,361,0,361,361,0,361,361,0,361,361,0,361,361,0,361,361,0,361,361,0,361,361,0,361,361,0,361,361,0,361,361,0,361,361,0,361,361,0,361,361,0,361,361,0,361,361,0,361,361,0,361,361,0,361,361,0,361,361,0,361,361,0,361,361,0,361,361,0,361,361,0,361,361,0,361,361,0,361,361,0,361,361,0,361,361,0,361,361,0,361,361,0,361,361,0,361,361,0,361,361,0,361,361,0,361,361,0,361,361,0,361,361,0,361,361,0,361,361,0,361,361,0,361,361,0,361,361,0,361,361,0,361,361,0,361,361,0,361,361,0,361,361,0,361,361,0,361,361,0,361,361,0,361,361,0,361,361,0,361,361,0,361,361,0,361,361,0,361,361,0,361,361,0,361,361,0,361,361,0,361,361,0,361,361,0,361,361,0,361,361,0,361,361,0,361,361,0,361,361,0,361,361,0,361,361,0,361,361,0,361,361,0,361,361,0,361,361,0,361,361,0,361,361,0,361,361,0,361,361,0,361,361,0,361,361,0,361,361,0,361,361,0,361,361,0,361,361,0,361,361,0,361,361,0,361,361,0,361,361,0,361,361,0,361,361,0,361,361,0,361,361,0,361,361,0,361,361,0,361,361,0,361,361,0,361,361,0,361,361,0,361,361,0,361,361,0,361,361,0,361,361,0,361,361,0,361,361,0,361,361,0,361,361,0,361,361,0,361,361,0,361,361,0,361,361,0,361,361,0,361,361,0,361,361,0,361,361,0,361,361,0,361,361,0,361,361,0,361,361,0,361,361,0,361,361,0,361,361,0,361,361,0,361,361,0,361,361,0,361,361,0,361,361,0,361,361,0,361,361,0,361,361,0,361,361,0,361,361,0,361,361,0,361,361,0,361,361,0,361,361,0,361,361,0,361,361,0,361,361,0,361,361,0,361,361,0,361,361,0,361,361,0,361,361,0,361,361,0,361,361,0,361,361,0,361,361,0,361,361,0,361,361,0,361,361,0,361,361,0,361,361,0,361,361,0,361,361,0,361,361,0,361,361,0,361,361,0,361,361,0,361,361,0,361,361,0,361,361,0,361,361,0,361,361,0,361,361,0,361,361,0,361,361,0,361,361,0,361,361,0,361,361,0,361,361,0,361,361,0,361,361,0,361,361,0,361,361,0,361,361,0,361,361,0,361,361,0,361,361,0,361,361,0,361,361,0,361,361,0,361,361,0,361,361],"f":"`````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````{bd}``````````````````````````````````````````````````````````````````````````````````````````````````````````{fh}{jh}{f{{l{c}}}n}{j{{l{c}}}n}`````````````{ce{}{}}000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000````````````````````````````````````{A`A`}{AbAb}{bb}{dd}{AdAd}{AfAf}{AhAh}{AjAj}{AlAl}{AnAn}{B`B`}{BbBb}{BdBd}{BfBf}{BhBh}{BjBj}{BlBl}{BnBn}{C`C`}{CbCb}{CdCd}{CfCf}{ChCh}{CjCj}{ClCl}{CnCn}{D`D`}{DbDb}{DdDd}{DfDf}{DhDh}{DjDj}{DlDl}{DnDn}{E`E`}{EbEb}{EdEd}{EfEf}{EhEh}{EjEj}{ElEl}{EnEn}{F`F`}{FbFb}{FdFd}{FfFf}{FhFh}{FjFj}{FlFl}{FnFn}{G`G`}{GbGb}{GdGd}{GfGf}{GhGh}{GjGj}{GlGl}{GnGn}{H`H`}{HbHb}{HdHd}{HfHf}{HhHh}{HjHj}{HlHl}{HnHn}{I`I`}{IbIb}{IdId}{IfIf}{IhIh}{IjIj}{IlIl}{InIn}{J`J`}{JbJb}{JdJd}{JfJf}{JhJh}{JjJj}{JlJl}{JnJn}{K`K`}{KbKb}{KdKd}{KfKf}{KhKh}{KjKj}{KlKl}{KnKn}{L`L`}{LbLb}{LdLd}{LfLf}{LhLh}{LjLj}{LlLl}{LnLn}{M`M`}{MbMb}{MdMd}{MfMf}{MhMh}{MjMj}{MlMl}{MnMn}{N`N`}{NbNb}{NdNd}{NfNf}{NhNh}{NjNj}{NlNl}{NnNn}{O`O`}{ObOb}{OdOd}{OfOf}{OhOh}{OjOj}{OlOl}{OnOn}{A`A`}{AbAb}{AdAd}{AfAf}{AhAh}{AjAj}{ff}{jj}{AlAl}{AnAn}{AA`AA`}{AAbAAb}{AAdAAd}{AAfAAf}{AAhAAh}{AAjAAj}{AAlAAl}{AAnAAn}{AB`AB`}{ABbABb}{ABdABd}{ABfABf}{ABhABh}{ABjABj}{ABlABl}{ABnABn}{AC`AC`}{ACbACb}{ACdACd}{ACfACf}{AChACh}{ACjACj}{AClACl}{ACnACn}{AD`AD`}{ADbADb}{ADdADd}{ADfADf}{ADhADh}{ADjADj}{ADlADl}{ADnADn}{AE`AE`}{AEbAEb}{AEdAEd}{AEfAEf}{AEhAEh}{AEjAEj}{AElAEl}{AEnAEn}{AF`AF`}{AFbAFb}{AFdAFd}{AFfAFf}{AFhAFh}{AFjAFj}{AFlAFl}{AFnAFn}{AG`AG`}{AGbAGb}{AGdAGd}{AGfAGf}{AGhAGh}{{ce}AGj{}{}}0000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000{{A`A`}AGl}{{AdAd}AGl}```````````````````````````````````````````{{}I`}{{}Ij}{{}ACd}``````````````````````````````````````{{A`A`}AGn}{{A`c}AGn{{AH`{h}}AHb}}{{AbAb}AGn}{{bb}AGn}{{dd}AGn}{{AdAd}AGn}{{AfAf}AGn}{{AhAh}AGn}{{AjAj}AGn}{{AlAl}AGn}{{AnAn}AGn}{{B`B`}AGn}{{BbBb}AGn}{{BdBd}AGn}{{BfBf}AGn}{{BhBh}AGn}{{BjBj}AGn}{{BlBl}AGn}{{BnBn}AGn}{{C`C`}AGn}{{CbCb}AGn}{{CdCd}AGn}{{CfCf}AGn}{{ChCh}AGn}{{CjCj}AGn}{{ClCl}AGn}{{CnCn}AGn}{{D`D`}AGn}{{DbDb}AGn}{{DdDd}AGn}{{DfDf}AGn}{{DhDh}AGn}{{DjDj}AGn}{{DlDl}AGn}{{DnDn}AGn}{{E`E`}AGn}{{EbEb}AGn}{{EdEd}AGn}{{EfEf}AGn}{{EhEh}AGn}{{EjEj}AGn}{{ElEl}AGn}{{EnEn}AGn}{{F`F`}AGn}{{FbFb}AGn}{{FdFd}AGn}{{FfFf}AGn}{{FhFh}AGn}{{FjFj}AGn}{{FlFl}AGn}{{FnFn}AGn}{{G`G`}AGn}{{GbGb}AGn}{{GdGd}AGn}{{GfGf}AGn}{{GhGh}AGn}{{GjGj}AGn}{{GlGl}AGn}{{GnGn}AGn}{{H`H`}AGn}{{HbHb}AGn}{{HdHd}AGn}{{HfHf}AGn}{{HhHh}AGn}{{HjHj}AGn}{{HlHl}AGn}{{HnHn}AGn}{{I`I`}AGn}{{IbIb}AGn}{{IdId}AGn}{{IfIf}AGn}{{IhIh}AGn}{{IjIj}AGn}{{IlIl}AGn}{{InIn}AGn}{{J`J`}AGn}{{JbJb}AGn}{{JdJd}AGn}{{JfJf}AGn}{{JhJh}AGn}{{JjJj}AGn}{{JlJl}AGn}{{JnJn}AGn}{{K`K`}AGn}{{KbKb}AGn}{{KdKd}AGn}{{KfKf}AGn}{{KhKh}AGn}{{KjKj}AGn}{{KlKl}AGn}{{KnKn}AGn}{{L`L`}AGn}{{LbLb}AGn}{{LdLd}AGn}{{LfLf}AGn}{{LhLh}AGn}{{LjLj}AGn}{{LlLl}AGn}{{LnLn}AGn}{{M`M`}AGn}{{MbMb}AGn}{{MdMd}AGn}{{MfMf}AGn}{{MhMh}AGn}{{MjMj}AGn}{{MlMl}AGn}{{MnMn}AGn}{{N`N`}AGn}{{NbNb}AGn}{{NdNd}AGn}{{NfNf}AGn}{{NhNh}AGn}{{NjNj}AGn}{{NlNl}AGn}{{NnNn}AGn}{{O`O`}AGn}{{ObOb}AGn}{{OdOd}AGn}{{OfOf}AGn}{{OhOh}AGn}{{OjOj}AGn}{{OlOl}AGn}{{OnOn}AGn}{{A`A`}AGn}{{AbAb}AGn}{{AdAd}AGn}{{AfAf}AGn}{{AhAh}AGn}{{AjAj}AGn}{{ff}AGn}{{jj}AGn}{{AlAl}AGn}{{AnAn}AGn}{{AA`AA`}AGn}{{AAbAAb}AGn}{{AAdAAd}AGn}{{AAfAAf}AGn}{{AAhAAh}AGn}{{AAjAAj}AGn}{{AAlAAl}AGn}{{AAnAAn}AGn}{{AB`AB`}AGn}{{ABbABb}AGn}{{ABdABd}AGn}{{ABfABf}AGn}{{ABhABh}AGn}{{ABjABj}AGn}{{ABlABl}AGn}{{ABnABn}AGn}{{AC`AC`}AGn}{{ACbACb}AGn}{{ACdACd}AGn}{{ACfACf}AGn}{{AChACh}AGn}{{ACjACj}AGn}{{AClACl}AGn}{{ACnACn}AGn}{{AD`AD`}AGn}{{ADbADb}AGn}{{ADdADd}AGn}{{ADfADf}AGn}{{ADhADh}AGn}{{ADjADj}AGn}{{ADlADl}AGn}{{ADnADn}AGn}{{AE`AE`}AGn}{{AEbAEb}AGn}{{AEdAEd}AGn}{{AEfAEf}AGn}{{AEhAEh}AGn}{{AEjAEj}AGn}{{AElAEl}AGn}{{AEnAEn}AGn}{{AF`AF`}AGn}{{AFbAFb}AGn}{{AFdAFd}AGn}{{AFfAFf}AGn}{{AFhAFh}AGn}{{AFjAFj}AGn}{{AFlAFl}AGn}{{AFnAFn}AGn}{{AG`AG`}AGn}{{AGbAGb}AGn}{{AGdAGd}AGn}{{AGfAGf}AGn}{{AGhAGh}AGn}````````````````````````````````````````````{{A`AHd}{{AHh{AGjAHf}}}}00{{AbAHd}AHj}{{bAHd}AHj}{{dAHd}AHj}{{AdAHd}AHj}0{{AfAHd}AHj}{{AhAHd}AHj}{{AjAHd}AHj}{{AlAHd}AHj}{{AnAHd}AHj}{{B`AHd}AHj}{{BbAHd}AHj}{{BdAHd}AHj}{{BfAHd}AHj}{{BhAHd}AHj}{{BjAHd}AHj}{{BlAHd}AHj}{{BnAHd}AHj}{{C`AHd}AHj}{{CbAHd}AHj}{{CdAHd}AHj}{{CfAHd}AHj}{{ChAHd}AHj}{{CjAHd}AHj}{{ClAHd}AHj}{{CnAHd}AHj}{{D`AHd}AHj}{{DbAHd}AHj}{{DdAHd}AHj}{{DfAHd}AHj}{{DhAHd}AHj}{{DjAHd}AHj}{{DlAHd}AHj}{{DnAHd}AHj}{{E`AHd}AHj}{{EbAHd}AHj}{{EdAHd}AHj}{{EfAHd}AHj}{{EhAHd}AHj}{{EjAHd}AHj}{{ElAHd}AHj}{{EnAHd}AHj}{{F`AHd}AHj}{{FbAHd}AHj}{{FdAHd}AHj}{{FfAHd}AHj}{{FhAHd}AHj}{{FjAHd}AHj}{{FlAHd}AHj}{{FnAHd}AHj}{{G`AHd}AHj}{{GbAHd}AHj}{{GdAHd}AHj}{{GfAHd}AHj}{{GhAHd}AHj}{{GjAHd}AHj}{{GlAHd}AHj}{{GnAHd}AHj}{{H`AHd}AHj}{{HbAHd}AHj}0{{HdAHd}AHj}0{{HfAHd}AHj}{{HhAHd}AHj}{{HjAHd}AHj}{{HlAHd}AHj}{{HnAHd}AHj}{{I`AHd}AHj}{{IbAHd}AHj}{{IdAHd}AHj}{{IfAHd}AHj}{{IhAHd}AHj}{{IjAHd}AHj}{{IlAHd}AHj}{{InAHd}AHj}{{J`AHd}AHj}{{JbAHd}AHj}{{JdAHd}AHj}{{JfAHd}AHj}{{JhAHd}AHj}{{JjAHd}AHj}{{JlAHd}AHj}{{JnAHd}AHj}{{K`AHd}AHj}{{KbAHd}AHj}{{KdAHd}AHj}{{KfAHd}AHj}{{KhAHd}AHj}{{KjAHd}AHj}{{KlAHd}AHj}{{KnAHd}AHj}{{L`AHd}AHj}{{LbAHd}AHj}{{LdAHd}AHj}{{LfAHd}AHj}{{LhAHd}AHj}{{LjAHd}AHj}{{LlAHd}AHj}{{LnAHd}AHj}{{M`AHd}AHj}{{MbAHd}AHj}{{MdAHd}AHj}{{MfAHd}AHj}{{MhAHd}AHj}{{MjAHd}AHj}{{MlAHd}AHj}{{MnAHd}AHj}{{N`AHd}AHj}{{NbAHd}AHj}{{NdAHd}AHj}{{NfAHd}AHj}{{NhAHd}AHj}{{NjAHd}AHj}{{NlAHd}AHj}{{NnAHd}AHj}{{O`AHd}AHj}{{ObAHd}AHj}{{OdAHd}AHj}{{OfAHd}AHj}{{OhAHd}AHj}{{OjAHd}AHj}{{OlAHd}AHj}{{OnAHd}AHj}{{A`AHd}AHj}{{AbAHd}AHj}{{AdAHd}AHj}{{AfAHd}AHj}{{AhAHd}AHj}{{AjAHd}AHj}{{fAHd}AHj}0{{jAHd}AHj}0{{AlAHd}AHj}{{AnAHd}AHj}{{AA`AHd}AHj}{{AAbAHd}AHj}{{AAdAHd}AHj}{{AAfAHd}AHj}{{AAhAHd}AHj}{{AAjAHd}AHj}{{AAlAHd}AHj}{{AAnAHd}AHj}{{AB`AHd}AHj}{{ABbAHd}AHj}{{ABdAHd}AHj}{{ABfAHd}AHj}{{ABhAHd}AHj}{{ABjAHd}AHj}{{ABlAHd}AHj}{{ABnAHd}AHj}{{AC`AHd}AHj}{{ACbAHd}AHj}{{ACdAHd}AHj}{{ACfAHd}AHj}{{AChAHd}AHj}{{ACjAHd}AHj}{{AClAHd}AHj}{{ACnAHd}AHj}{{AD`AHd}AHj}{{ADbAHd}AHj}{{ADdAHd}AHj}{{ADfAHd}AHj}{{ADhAHd}AHj}{{ADjAHd}AHj}{{ADlAHd}AHj}{{ADnAHd}AHj}{{AE`AHd}AHj}{{AEbAHd}AHj}{{AEdAHd}AHj}{{AEfAHd}AHj}{{AEhAHd}AHj}{{AEjAHd}AHj}{{AElAHd}AHj}{{AEnAHd}AHj}{{AF`AHd}AHj}{{AFbAHd}AHj}{{AFdAHd}AHj}{{AFfAHd}AHj}{{AFhAHd}AHj}{{AFjAHd}AHj}{{AFlAHd}AHj}{{AFnAHd}AHj}{{AG`AHd}AHj}{{AGbAHd}AHj}{{AGdAHd}AHj}{{AGfAHd}AHj}{{AGhAHd}AHj}````{AHlA`}{AHnA`}{AI`A`}{AIbA`}{AIdA`}{cc{}}{AIfA`}111111{AlAj}{AnAj}3{AC`Aj}4444{BfBb}{BdBb}666{LfBj}{JnBj}8{KnBj}9999{ClCd}{FfCd}{DfCd}{DhCd}{G`Cd}{CfCd}{D`Cd}{DjCd}{GhCd}{H`Cd}{cc{}}{GdCd}{FlCd}{ChCd}{GjCd}{FbCd}{ElCd}{EhCd}{DlCd}{F`Cd}{EjCd}{GlCd}{EbCd}{GbCd}{E`Cd}{FhCd}{FjCd}{FdCd}{DdCd}{EdCd}{FnCd}{CjCd}{GnCd}{GfCd}{DnCd}{EfCd}{CnCd}{DbCd}{EnCd}{cc{}}0000000000000000000000000000000000000{AIhHb}1{A`Hb}{HdHb}3{AIhHd}444444{IfIb}{IhIb}{IdIb}777{A`If}88{AdIl}{InIl}::::{JfJd};{JhJd}<<{LbJj}{LdJj}{KlJj}{KfJj}{BjJj}{KhJj}{cc{}}{LhJj}{JlJj}{KdJj}{KjJj}{KnJj}{LfJj}{L`Jj}{K`Jj}{JnJj}{KbJj}:::::::::::::::{LlLj}{M`Lj}<{MdLj}{LnLj}{MbLj}?????{MnMf}{MjMf}{MlMf}{MhMf}{cc{}}0000{NfN`}{NhN`}{NdN`}{NbN`}444444{NlNj}{NnNj}{ObNj}{O`Nj}888888{ABjOf}{OhOf}::::{fA`}{AdA`}{AjA`}{jA`}{AlA`}{AfA`}{AhA`}{AbA`}{cc{}}00000{AIjf}11{AIjj}22222{ABjAAf}{DjAAf}{ABlAAf}{F`AAf}{FhAAf}{ElAAf}8{AAhAAf}{AAlAAf}{AAnAAf}{ABfAAf}{AAjAAf}{FjAAf}{AB`AAf}{ABdAAf}{ABbAAf}{ABhAAf}{cc{}}000000000000{cAC`{{AIl{ACb}}}}1{cACb{{AIl{A`}}}}2222222222222222{AEfAEd}{AElAEd}{AFfAEd}{AFnAEd}{AFjAEd}{AFlAEd}{AFdAEd}{AEhAEd}{AFhAEd}{AG`AEd}{AEnAEd}{AEjAEd}{AFbAEd}{AF`AEd}{cc{}}000000000000000000```````````````````{AC`{{AIn{A`}}}}```````{{A`c}AGjAJ`}{{Abc}AGjAJ`}{{bc}AGjAJ`}{{dc}AGjAJ`}{{Adc}AGjAJ`}{{Afc}AGjAJ`}{{Ahc}AGjAJ`}{{Ajc}AGjAJ`}{{Alc}AGjAJ`}{{Anc}AGjAJ`}{{B`c}AGjAJ`}{{Bbc}AGjAJ`}{{Bdc}AGjAJ`}{{Bfc}AGjAJ`}{{Bhc}AGjAJ`}{{Bjc}AGjAJ`}{{Blc}AGjAJ`}{{Bnc}AGjAJ`}{{C`c}AGjAJ`}{{Cbc}AGjAJ`}{{Cdc}AGjAJ`}{{Cfc}AGjAJ`}{{Chc}AGjAJ`}{{Cjc}AGjAJ`}{{Clc}AGjAJ`}{{Cnc}AGjAJ`}{{D`c}AGjAJ`}{{Dbc}AGjAJ`}{{Ddc}AGjAJ`}{{Dfc}AGjAJ`}{{Dhc}AGjAJ`}{{Djc}AGjAJ`}{{Dlc}AGjAJ`}{{Dnc}AGjAJ`}{{E`c}AGjAJ`}{{Ebc}AGjAJ`}{{Edc}AGjAJ`}{{Efc}AGjAJ`}{{Ehc}AGjAJ`}{{Ejc}AGjAJ`}{{Elc}AGjAJ`}{{Enc}AGjAJ`}{{F`c}AGjAJ`}{{Fbc}AGjAJ`}{{Fdc}AGjAJ`}{{Ffc}AGjAJ`}{{Fhc}AGjAJ`}{{Fjc}AGjAJ`}{{Flc}AGjAJ`}{{Fnc}AGjAJ`}{{G`c}AGjAJ`}{{Gbc}AGjAJ`}{{Gdc}AGjAJ`}{{Gfc}AGjAJ`}{{Ghc}AGjAJ`}{{Gjc}AGjAJ`}{{Glc}AGjAJ`}{{Gnc}AGjAJ`}{{H`c}AGjAJ`}{{Hbc}AGjAJ`}{{Hdc}AGjAJ`}{{Hfc}AGjAJ`}{{Hhc}AGjAJ`}{{Hjc}AGjAJ`}{{Hlc}AGjAJ`}{{Hnc}AGjAJ`}{{I`c}AGjAJ`}{{Ibc}AGjAJ`}{{Idc}AGjAJ`}{{Ifc}AGjAJ`}{{Ihc}AGjAJ`}{{Ijc}AGjAJ`}{{Ilc}AGjAJ`}{{Inc}AGjAJ`}{{J`c}AGjAJ`}{{Jbc}AGjAJ`}{{Jdc}AGjAJ`}{{Jfc}AGjAJ`}{{Jhc}AGjAJ`}{{Jjc}AGjAJ`}{{Jlc}AGjAJ`}{{Jnc}AGjAJ`}{{K`c}AGjAJ`}{{Kbc}AGjAJ`}{{Kdc}AGjAJ`}{{Kfc}AGjAJ`}{{Khc}AGjAJ`}{{Kjc}AGjAJ`}{{Klc}AGjAJ`}{{Knc}AGjAJ`}{{L`c}AGjAJ`}{{Lbc}AGjAJ`}{{Ldc}AGjAJ`}{{Lfc}AGjAJ`}{{Lhc}AGjAJ`}{{Ljc}AGjAJ`}{{Llc}AGjAJ`}{{Lnc}AGjAJ`}{{M`c}AGjAJ`}{{Mbc}AGjAJ`}{{Mdc}AGjAJ`}{{Mfc}AGjAJ`}{{Mhc}AGjAJ`}{{Mjc}AGjAJ`}{{Mlc}AGjAJ`}{{Mnc}AGjAJ`}{{N`c}AGjAJ`}{{Nbc}AGjAJ`}{{Ndc}AGjAJ`}{{Nfc}AGjAJ`}{{Nhc}AGjAJ`}{{Njc}AGjAJ`}{{Nlc}AGjAJ`}{{Nnc}AGjAJ`}{{O`c}AGjAJ`}{{Obc}AGjAJ`}{{Odc}AGjAJ`}{{Ofc}AGjAJ`}{{Ohc}AGjAJ`}{{Ojc}AGjAJ`}{{Olc}AGjAJ`}{{Onc}AGjAJ`}{{A`c}AGjAJ`}{{Abc}AGjAJ`}{{Adc}AGjAJ`}{{Afc}AGjAJ`}{{Ahc}AGjAJ`}{{Ajc}AGjAJ`}{{fc}AGjAJ`}{{jc}AGjAJ`}{{Alc}AGjAJ`}{{Anc}AGjAJ`}{{AA`c}AGjAJ`}{{AAbc}AGjAJ`}{{AAdc}AGjAJ`}{{AAfc}AGjAJ`}{{AAhc}AGjAJ`}{{AAjc}AGjAJ`}{{AAlc}AGjAJ`}{{AAnc}AGjAJ`}{{AB`c}AGjAJ`}{{ABbc}AGjAJ`}{{ABdc}AGjAJ`}{{ABfc}AGjAJ`}{{ABhc}AGjAJ`}{{ABjc}AGjAJ`}{{ABlc}AGjAJ`}{{ABnc}AGjAJ`}{{AC`c}AGjAJ`}{{ACbc}AGjAJ`}{{ACdc}AGjAJ`}{{ACfc}AGjAJ`}{{AChc}AGjAJ`}{{ACjc}AGjAJ`}{{AClc}AGjAJ`}{{ACnc}AGjAJ`}{{AD`c}AGjAJ`}{{ADbc}AGjAJ`}{{ADdc}AGjAJ`}{{ADfc}AGjAJ`}{{ADhc}AGjAJ`}{{ADjc}AGjAJ`}{{ADlc}AGjAJ`}{{ADnc}AGjAJ`}{{AE`c}AGjAJ`}{{AEbc}AGjAJ`}{{AEdc}AGjAJ`}{{AEfc}AGjAJ`}{{AEhc}AGjAJ`}{{AEjc}AGjAJ`}{{AElc}AGjAJ`}{{AEnc}AGjAJ`}{{AF`c}AGjAJ`}{{AFbc}AGjAJ`}{{AFdc}AGjAJ`}{{AFfc}AGjAJ`}{{AFhc}AGjAJ`}{{AFjc}AGjAJ`}{{AFlc}AGjAJ`}{{AFnc}AGjAJ`}{{AG`c}AGjAJ`}{{AGbc}AGjAJ`}{{AGdc}AGjAJ`}{{AGfc}AGjAJ`}{{AGhc}AGjAJ`}````````````````````````````````````````````{ce{}{}}0000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000{Bbc{}}00{BbAGn}{ACdAGn}{{AC`c}AGnAHb}1`````{Bb{{AJb{Bh}}}}{Bb{{AJd{Bh}}}}```````````{BbAIh}````{Oh{{AIn{Ad}}}}```````````````````````````{I`Jb}````````````````````````{{hAJf}A`}{{hAJf}Ad}{AdId}{AIjA`}{{hAJf}Ab}{{{AJj{AJh}}AJf}Ad}{{AJlAJf}Af}{{AJhAJf}Ah}{{AJnAJf}Aj}{{hAJf}f}{{hAJf}j}{{AGnAJf}Al};``````````````````````````{AK`{{l{c}}}AKb}{AKd{{l{A`}}}}{AKd{{l{Ad}}}}{AKd{{l{Aj}}}}{AKd{{l{Al}}}}{AKd{{l{An}}}}{AKd{{l{B`}}}}{AKd{{l{Bd}}}}{AKd{{l{Bf}}}}{AKd{{l{Bj}}}}{AKd{{l{Cd}}}}{AKd{{l{Cf}}}}{AKd{{l{Ch}}}}{AKd{{l{Cj}}}}{AKd{{l{Cl}}}}{AKd{{l{Cn}}}}{AKd{{l{D`}}}}{AKd{{l{Db}}}}{AKd{{l{Dd}}}}{AKd{{l{Df}}}}{AKd{{l{Dh}}}}{AKd{{l{Dj}}}}{AKd{{l{Dl}}}}{AKd{{l{Dn}}}}{AKd{{l{E`}}}}{AKd{{l{Ed}}}}{AKd{{l{Ef}}}}{AKd{{l{Eh}}}}{AKd{{l{Ej}}}}{AKd{{l{El}}}}{AKd{{l{En}}}}{AKd{{l{F`}}}}{AKd{{l{Fb}}}}{AKd{{l{Fd}}}}{AKd{{l{Ff}}}}{AKd{{l{Fh}}}}{AKd{{l{Fj}}}}{AKd{{l{Fl}}}}{AKd{{l{Fn}}}}{AKd{{l{G`}}}}{AKd{{l{Gb}}}}{AKd{{l{Gd}}}}{AKd{{l{Gf}}}}{AKd{{l{Gh}}}}{AKd{{l{Gj}}}}{AKd{{l{Gl}}}}{AKd{{l{Gn}}}}{AKd{{l{H`}}}}{AKd{{l{Hb}}}}{AKd{{l{Hd}}}}{AKd{{l{Hf}}}}{AKd{{l{Hh}}}}{AKd{{l{Hj}}}}{AKd{{l{Hl}}}}{AKd{{l{Hn}}}}{AKd{{l{I`}}}}{AKd{{l{Ib}}}}{AKd{{l{Id}}}}{AKd{{l{If}}}}{AKd{{l{Ih}}}}{AKd{{l{Ij}}}}{AKd{{l{Il}}}}{AKd{{l{In}}}}{AKd{{l{J`}}}}{AKd{{l{Jb}}}}{AKd{{l{Jd}}}}{AKd{{l{Jj}}}}{AKd{{l{Jl}}}}{AKd{{l{Jn}}}}{AKd{{l{K`}}}}{AKd{{l{Kb}}}}{AKd{{l{Kd}}}}{AKd{{l{Kf}}}}{AKd{{l{Kh}}}}{AKd{{l{Kj}}}}{AKd{{l{Kl}}}}{AKd{{l{Kn}}}}{AKd{{l{L`}}}}{AKd{{l{Lb}}}}{AKd{{l{Ld}}}}{AKd{{l{Lf}}}}{AKd{{l{Lh}}}}{AKd{{l{Lj}}}}{AKd{{l{Mf}}}}{AKd{{l{Mh}}}}{AKd{{l{Mj}}}}{AKd{{l{Ml}}}}{AKd{{l{Mn}}}}{AKd{{l{N`}}}}{AKd{{l{Nb}}}}{AKd{{l{Nd}}}}{AKd{{l{Nf}}}}{AKd{{l{Nh}}}}{AKd{{l{Nj}}}}{AKd{{l{Nl}}}}{AKd{{l{Nn}}}}{AKd{{l{O`}}}}{AKd{{l{Ob}}}}{AKd{{l{Od}}}}{AKd{{l{Of}}}}{AKd{{l{Oh}}}}{AKd{{l{Ol}}}}{AKd{{l{A`}}}}{Ab{{l{c}}}AKb}{AKd{{l{Ab}}}}{AKd{{l{Ad}}}}{AKd{{l{Af}}}}{AKd{{l{Ah}}}}{AKd{{l{Aj}}}}{AKd{{l{f}}}}{AKd{{l{j}}}}{AKd{{l{Al}}}}{AKd{{l{An}}}}{AKd{{l{AAb}}}}{AKd{{l{AAd}}}}{AKd{{l{ABj}}}}{AKd{{l{AC`}}}}{AKd{{l{ACb}}}}{AKd{{l{ACf}}}}{AKd{{l{ACh}}}}{AKd{{l{AD`}}}}{AKd{{l{ADd}}}}{AKd{{l{ADj}}}}{AKd{{l{ADl}}}}{AKd{{l{AEd}}}}{AKd{{l{AEf}}}}{AKd{{l{AEh}}}}{AKd{{l{AEj}}}}{AKd{{l{AEl}}}}{AKd{{l{AEn}}}}{AKd{{l{AF`}}}}{AKd{{l{AFb}}}}{AKd{{l{AFd}}}}{AKd{{l{AFf}}}}{AKd{{l{AFh}}}}{AKd{{l{AFj}}}}{AKd{{l{AFl}}}}{AKd{{l{AFn}}}}{AKd{{l{AG`}}}}{AKd{{l{AGb}}}}{AKd{{l{AGd}}}}{AKd{{l{AGh}}}}{AKf{{l{c}}}AKb}{AKd{{l{A`}}}}{Af{{l{c}}}AKb}{Al{{l{c}}}AKb}{{Afc}lAKh}{{Alc}lAKh}{An{{l{c}}}AKb}{{Anc}lAKh}{h{{l{Hn}}}}{AKd{{l{{AKj{Af}}}}}}`{AKd{{l{AC`}}}}{AKd{{l{AAf}}}}0{AKd{{l{Bh}}}}{{Afc}{{l{AGj}}}{{AL`{AKl}{{AKn{{l{AGj}}}}}}}}{{Alc}{{l{AGj}}}{{AL`{AKl}{{AKn{{l{AGj}}}}}}}}5``3{h{{l{c}}}AKb}{AKd{{l{ACh}}}}4{{Abc}lAKh}{AKd{{l{Cd}}}}{AKd{{l{{AKj{ADl}}}}}}1{{A`A`}{{AIn{AGl}}}}{{AdAd}{{AIn{AGl}}}}`````````{AfAC`}{AjAC`}```````````````````````{Od{{AIn{Oh}}}}````{AC`{{l{A`}}}}{Aj{{l{Al}}}}{Aj{{l{An}}}}{Aj{{l{AC`}}}}``````````````````````````````````{{A`AJf}AGj}{{AdAJf}AGj}{{A`AJf}AGj}{{AbAJf}AGj}{{AdAJf}AGj}{{AfAJf}AGj}{{AhAJf}AGj}{{AjAJf}AGj}{{fAJf}AGj}{{jAJf}AGj}{{AlAJf}AGj}`````{A`AJf}{cAJf{}}{A`{{AIn{AJf}}}}111{AdAJf}22222222222222222222222222222222222222222222222222{Hb{{AIn{AJf}}}}3{Hd{{AIn{AJf}}}}4444444444444444444444444444444444444444444444444444444444444{A`AJf}5{AbAJf}6{AdAJf}7{AfAJf}88{AhAJf}9{AjAJf}:{fAJf}{jAJf}<{AlAJf}=={AA`ALb}>>>>>>>>>>>>>>>>>>>>>>>>{ADbAJf}?????????????????????????```{I`{{ALd{Abb{AIn{Jb}}}}}}```````````{A`h}{Abh}{Adh}{Afh}{Ahh}{Ajh}{fh}{jh}``{ce{}{}}0000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000{cALf{}}000{{A`AKf}AGj}{{AbAKf}AGj}{{bAKf}AGj}{{dAKf}AGj}{{AdAKf}AGj}{{AfAKf}AGj}{{AjAKf}AGj}{{AlAKf}AGj}{{AnAKf}AGj}{{B`AKf}AGj}{{BbAKf}AGj}{{BdAKf}AGj}{{BfAKf}AGj}{{BhAKf}AGj}{{BjAKf}AGj}{{CdAKf}AGj}{{CfAKf}AGj}{{ChAKf}AGj}{{CjAKf}AGj}{{ClAKf}AGj}{{CnAKf}AGj}{{D`AKf}AGj}{{DbAKf}AGj}{{DdAKf}AGj}{{DfAKf}AGj}{{DhAKf}AGj}{{DjAKf}AGj}{{DlAKf}AGj}{{DnAKf}AGj}{{E`AKf}AGj}{{EbAKf}AGj}{{EdAKf}AGj}{{EfAKf}AGj}{{EhAKf}AGj}{{EjAKf}AGj}{{ElAKf}AGj}{{EnAKf}AGj}{{F`AKf}AGj}{{FbAKf}AGj}{{FdAKf}AGj}{{FfAKf}AGj}{{FhAKf}AGj}{{FjAKf}AGj}{{FlAKf}AGj}{{FnAKf}AGj}{{G`AKf}AGj}{{GbAKf}AGj}{{GdAKf}AGj}{{GfAKf}AGj}{{GhAKf}AGj}{{GjAKf}AGj}{{GlAKf}AGj}{{GnAKf}AGj}{{H`AKf}AGj}{{HbAKf}AGj}{{HdAKf}AGj}{{HfAKf}AGj}{{HhAKf}AGj}{{HjAKf}AGj}{{HlAKf}AGj}{{HnAKf}AGj}{{I`AKf}AGj}{{IbAKf}AGj}{{IdAKf}AGj}{{IfAKf}AGj}{{IhAKf}AGj}{{IjAKf}AGj}{{IlAKf}AGj}{{InAKf}AGj}{{J`AKf}AGj}{{JbAKf}AGj}{{JdAKf}AGj}{{JfAKf}AGj}{{JhAKf}AGj}{{JjAKf}AGj}{{JlAKf}AGj}{{JnAKf}AGj}{{K`AKf}AGj}{{KbAKf}AGj}{{KdAKf}AGj}{{KfAKf}AGj}{{KhAKf}AGj}{{KjAKf}AGj}{{KlAKf}AGj}{{KnAKf}AGj}{{L`AKf}AGj}{{LbAKf}AGj}{{LdAKf}AGj}{{LfAKf}AGj}{{LhAKf}AGj}{{LjAKf}AGj}{{LlAKf}AGj}{{LnAKf}AGj}{{M`AKf}AGj}{{MbAKf}AGj}{{MdAKf}AGj}{{MfAKf}AGj}{{MhAKf}AGj}{{MjAKf}AGj}{{MlAKf}AGj}{{MnAKf}AGj}{{N`AKf}AGj}{{NbAKf}AGj}{{NdAKf}AGj}{{NfAKf}AGj}{{NhAKf}AGj}{{NjAKf}AGj}{{NlAKf}AGj}{{NnAKf}AGj}{{O`AKf}AGj}{{ObAKf}AGj}{{OdAKf}AGj}{{OfAKf}AGj}{{OhAKf}AGj}{{OjAKf}AGj}{{OlAKf}AGj}{{A`AKf}AGj}{{AbAKf}AGj}{{AdAKf}AGj}{{AfAKf}AGj}{{AhAKf}AGj}{{AjAKf}AGj}{{fAKf}AGj}{{jAKf}AGj}{{AlAKf}AGj}{{AnAKf}AGj}{{AAbAKf}AGj}{{AAdAKf}AGj}{{AAfAKf}AGj}{{AAhAKf}AGj}{{AAjAKf}AGj}{{AAlAKf}AGj}{{AAnAKf}AGj}{{AB`AKf}AGj}{{ABbAKf}AGj}{{ABdAKf}AGj}{{ABfAKf}AGj}{{ABhAKf}AGj}{{ABjAKf}AGj}{{ABlAKf}AGj}{{ABnAKf}AGj}{{AC`AKf}AGj}{{ACbAKf}AGj}{{ACdAKf}AGj}{{ACfAKf}AGj}{{AChAKf}AGj}{{ACjAKf}AGj}{{AClAKf}AGj}{{ACnAKf}AGj}{{AD`AKf}AGj}{{ADdAKf}AGj}{{ADfAKf}AGj}{{ADjAKf}AGj}{{ADlAKf}AGj}{{ADnAKf}AGj}{{AEbAKf}AGj}{{AEdAKf}AGj}{{AEfAKf}AGj}{{AEhAKf}AGj}{{AEjAKf}AGj}{{AElAKf}AGj}{{AEnAKf}AGj}{{AF`AKf}AGj}{{AFbAKf}AGj}{{AFdAKf}AGj}{{AFfAKf}AGj}{{AFhAKf}AGj}{{AFjAKf}AGj}{{AFlAKf}AGj}{{AFnAKf}AGj}{{AG`AKf}AGj}{{AGbAKf}AGj}{{AGdAKf}AGj}{{AGfAKf}AGj}{{AGhAKf}AGj}`{AbAIj}{AdAIj}{AfAIj}{AhAIj}{AjAIj}{fAIj}{jAIj}{AlA`}```````{c{{AHh{e}}}{}{}}000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000`````````````````{cALh{}}0000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000````````````{A`A`}````````{AbALf}{Ad{{AKj{AJh}}}}{AfALj}{AhAJh}{AjAJn}{AlAGn}```````````````````````````````{AKd{{l{AEd}}}}{AKd{{l{AEl}}}}{AKd{{l{AFn}}}}{AKd{{l{AGh}}}}```{ALlALn}{ce{}{}}000{ALnALn}{{ce}AGj{}{}}{{}ALn}{ALnAGn}{{ALnALn}AGn}{cc{}}0{{ALnAM`}{{AIn{{ALd{ALnALbALn}}}}}}{ALn{{AIn{{ALd{A`ALn}}}}}}88{ALn{{AIn{{ALd{AdALn}}}}}}{ALn{{AIn{{ALd{AIjALn}}}}}}{AK`ALl}{AKfALl}{{ALnALn}{{AIn{AGl}}}}{ALn{{AIn{{ALd{AMbALn}}}}}}{ALnAJf}?{ALnAKf}{ALn{{AIn{{ALd{AMdALn}}}}}}{c{{AHh{e}}}{}{}}000{cALh{}}0`{AKd{{l{AMf}}}}`{AMfA`}`{ce{}{}}0{{AKlc}AMhAMj}{cc{}}`2{{AKlc}{{l{AGj}}}{{AL`{AKl}{{AKn{{l{AGj}}}}}}}}{c{{`{{AKh{}{{AKn{AGj}}}}}}}{{AL`{AKl}{{AKn{{l{AGj}}}}}}}}`887{AKl{{l{AKd}}}}`````````````{{AMlAMl}AGj}6666666666{{AMl{AMn{AKd}{{AKn{{l{c}}}}}}}{{l{c}}}{}}{AMhAMh}{AN`AN`}{ANbANb}{{ce}AGj{}{}}00{{AMhAMh}AGj}{AMlALn}{AN`c{}}`{AMlAGj}{{ANbANb}AGn}{ANdAMh}{{AMlc}AMhAMj}{{AN`c}AMhAMj}{{AMhc}AGj{{ANh{}{{ANf{AMh}}}}}}{{AMhAHd}AHj}0{{AMlAHd}AHj}0{{ANbAHd}AHj}{AMlAMl}{ANjAMh}{cc{}}0000{{ANbc}AGjAJ`}{ce{}{}}0000{AMhAKf}{AMhc{}}0{AMlAGn}{AMlANd}{{AJfc}AMhAMj}{{ce}AMhANlAMj}{AKd{{l{AKb}}}}{AMl{{l{c}}}AKb}{{{AKh{}{{AKn{c}}}}AK`}{{l{c}}}{}}{AKd{{l{ANb}}}}{{{AKh{}{{AKn{c}}}}AKf}{{l{c}}}{}}{AMl{{l{{ALd{AM`ALbAMl}}}}}}{{{AKh{}{{AKn{c}}}}h}{{l{c}}}{}}{{AMl{AMn{AKd}{{AKn{{l{c}}}}}}e}{{l{{ANn{c}}}}}{}AO`}{{ANdc}AGnAO`}{{AMlc}AGnAO`}00{AMhAJf}{AMlAJf}{cAJf{}}{{AMle}{{l{c}}}{}{{AOb{AN`}{{AKn{{l{{ALd{cALn}}}}}}}}}}{AMhAKf}{ce{}{}}00{cALf{}}0{{ANbAKf}AGj}{c{{AHh{e}}}{}{}}000000000{cALh{}}0000``{{AOdAOd}AGj}{AOf{{l{{ALd{AM`ALbAMl}}}}}}``````````6666666666666666{{{ANn{ce}}}AGj{}{}}{{{ANn{ce}}}{{ANn{ce}}}AOhAOh}{{{AOj{ce}}}{{AOj{ce}}}{}{}}{{{AOl{ce}}}{{AOl{ce}}}AOhAOh}{{{AOn{c}}}{{AOn{c}}}AOh}{{{AJb{c}}}{{AJb{c}}}{}}{{{B`{ce}}}{{B`{ce}}}AOhAOh}{{{ANn{ce}}{ANn{ce}}}AGjAOhAOh}{{ce}AGj{}{}}000002{{}{{ANn{ce}}}{}{}}{{{ANn{ce}}}AGn{}{}}{{{ANn{ce}}{ANn{ce}}}AGnBbBb}{{{ANn{ce}}g}AGj{}Bd{{ANh{}{{ANf{{B`{ce}}}}}}}}{{{ANn{ce}}g}AGj{}Bd{{ANh{}{{ANf{c}}}}}}{{{ANn{ce}}}{{AIn{c}}}{}{}}0{{{ANn{ce}}AHd}AHjBfBf}{cc{}}0000000{g{{ANn{ce}}}{}{}{{ANh{}{{ANf{{B`{ce}}}}}}}}{e{{ANn{cg}}}{}{{ANh{}{{ANf{c}}}}}Bd}{{{ANn{ce}}g}AGjBhBhAJ`}{{{ANn{ce}}AIh}g{}{}{}}0{{{ANn{ce}}AIhc}AGj{}Bd}{ce{}{}}0000000{{{ANn{ce}}}g{}{}{}}00111111{{{ANn{ce}}}{{AOl{ce}}}{}{}}{{{B`{ce}}}{{ALd{c{AIn{e}}}}}{}{}}{{{B`{ce}}}c{}{}}{{{ANn{ce}}}AGn{}{}}{{{ANn{ce}}}{{AJb{c}}}{}{}}{{{ANn{ce}}}{{AJd{c}}}{}{}}??{{{ANn{ce}}}AIh{}{}}{{{AOj{ce}}}AIh{}{}}{{{Bj{ce}}}AIh{}{}}{{{AOl{ce}}}AIh{}{}}{{{AOn{c}}}AIh{}}{{{AJb{c}}}AIh{}}{{{AJd{c}}}AIh{}}{{}{{ANn{ce}}}{}{}}{{c{AIn{e}}}{{B`{ce}}}{}{}}{{{AOj{ce}}}{{AIn{g}}}{}{}{}}{{{Bj{ce}}}{{AIn{g}}}{}{}{}}{{{AOl{ce}}}{{AIn{g}}}{}{}{}}{{{AOn{c}}}{{AIn{e}}}{}{}}{{{AJb{c}}}{{AIn{e}}}{}{}}{{{AJd{c}}}{{AIn{e}}}{}{}}543210{{{ANn{ce}}}{{AOj{ce}}}{}{}}{{{ANn{ce}}}{{Bj{ce}}}{}{}}{AKd{{l{{ANn{ce}}}}}AKb{BlAKb}}{{AKd{AMn{AKd}{{AKn{{l{c}}}}}}}{{l{{ANn{ce}}}}}{}{BlAKb}}{AKd{{l{{ANn{ce}}}}}AKbAKb}{{AKd{AMn{AKd}{{AKn{{l{c}}}}}}}{{l{{ANn{ce}}}}}{}AKb}{{{ANn{ce}}}{{AIn{{B`{ce}}}}}{}{}}{{{ANn{ce}}}{{AIn{e}}}{}{}}{{{B`{ce}}}{{AIn{e}}}{}{}}0{{{ANn{ce}}c}AGj{}Bd}{{{ANn{ce}}e}AGj{}{}}{{{ANn{ce}}c}AGj{}{}}{{{AOj{ce}}}{{ALd{AIh{AIn{AIh}}}}}{}{}}{{{Bj{ce}}}{{ALd{AIh{AIn{AIh}}}}}{}{}}{{{AOl{ce}}}{{ALd{AIh{AIn{AIh}}}}}{}{}}{{{AOn{c}}}{{ALd{AIh{AIn{AIh}}}}}{}}{{{AJb{c}}}{{ALd{AIh{AIn{AIh}}}}}{}}{{{AJd{c}}}{{ALd{AIh{AIn{AIh}}}}}{}}{cAJf{}}0{ce{}{}}00000{{{ANn{ce}}AKf}AGjANlANl}{{{B`{ce}}AKf}AGjANlANl}{{{ANn{ce}}}AGn{}{}}{c{{AHh{e}}}{}{}}000000000000000{cALh{}}0000000{{{B`{ce}}}c{}{}}0`{BnAJf}````````````````````````````````````````````````````````````````````````````````````````````````````````77777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777{BA`BA`}{AIbAIb}{BAbBAb}{BAdBAd}{BAfBAf}{BAhBAh}{BAjBAj}{BAlBAl}{BAnBAn}{BB`BB`}{BBbBBb}{BBdBBd}{AI`AI`}{BBfBBf}{BBhBBh}{BBjBBj}{BBlBBl}{BBnBBn}{AHlAHl}{BC`BC`}{BCbBCb}{BCdBCd}{BCfBCf}{BChBCh}{BCjBCj}{BClBCl}{BCnBCn}{BD`BD`}{BDbBDb}{BDdBDd}{BDfBDf}{BDhBDh}{BDjBDj}{BDlBDl}{BDnBDn}{BE`BE`}{BEbBEb}{AIfAIf}{AHnAHn}{BEdBEd}{BEfBEf}{AIdAId}{BEhBEh}{BEjBEj}{BElBEl}{BEnBEn}{BF`BF`}{BFbBFb}{BFdBFd}{BFfBFf}{BFhBFh}{BFjBFj}{BFlBFl}{BFnBFn}{BG`BG`}{BGbBGb}{BGdBGd}{BGfBGf}{BGhBGh}{BGjBGj}{BGlBGl}{BGnBGn}{BH`BH`}{BHbBHb}{BHdBHd}{BHfBHf}{BHhBHh}{BHjBHj}{BHlBHl}{BHnBHn}{BI`BI`}{BIbBIb}{BIdBId}{BIfBIf}{BIhBIh}{BIjBIj}{BIlBIl}{BInBIn}{BJ`BJ`}{BJbBJb}{BJdBJd}{BJfBJf}{BJhBJh}{BJjBJj}{BJlBJl}{BJnBJn}{BK`BK`}{BKbBKb}{BKdBKd}{BKfBKf}{BKhBKh}{BKjBKj}{BKlBKl}{BKnBKn}{BL`BL`}{BLbBLb}{BLdBLd}{BLfBLf}{BLhBLh}{BLjBLj}{BLlBLl}{BLnBLn}{BM`BM`}{{ce}AGj{}{}}000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000{{}BA`}{{}AIb}{{}BAb}{{}BAd}{{}BAf}{{}BAh}{{}BAj}{{}BAl}{{}BAn}{{}BB`}{{}BBb}{{}BBd}{{}AI`}{{}BBf}{{}BBh}{{}BBj}{{}BBl}{{}BBn}{{}AHl}{{}BC`}{{}BCb}{{}BCd}{{}BCf}{{}BCh}{{}BCj}{{}BCl}{{}BCn}{{}BD`}{{}BDb}{{}BDd}{{}BDf}{{}BDh}{{}BDj}{{}BDl}{{}BDn}{{}BE`}{{}BEb}{{}AIf}{{}AHn}{{}BEd}{{}BEf}{{}AId}{{}BEh}{{}BEj}{{}BEl}{{}BEn}{{}BF`}{{}BFb}{{}BFd}{{}BFf}{{}BFh}{{}BFj}{{}BFl}{{}BFn}{{}BG`}{{}BGb}{{}BGd}{{}BGf}{{}BGh}{{}BGj}{{}BGl}{{}BGn}{{}BH`}{{}BHb}{{}BHd}{{}BHf}{{}BHh}{{}BHj}{{}BHl}{{}BHn}{{}BI`}{{}BIb}{{}BId}{{}BIf}{{}BIh}{{}BIj}{{}BIl}{{}BIn}{{}BJ`}{{}BJb}{{}BJd}{{}BJf}{{}BJh}{{}BJj}{{}BJl}{{}BJn}{{}BK`}{{}BKb}{{}BKd}{{}BKf}{{}BKh}{{}BKj}{{}BKl}{{}BKn}{{}BL`}{{}BLb}{{}BLd}{{}BLf}{{}BLh}{{}BLj}{{}BLl}{{}BLn}{{}BM`}{AIbc{}}{BG`c{}}{BGfc{}}{BGhc{}}{BGlc{}}{BGnc{}}{BH`c{}}{BHbc{}}{BHjc{}}{BIbc{}}{BIhc{}}{BIjc{}}{BJ`c{}}{BJbc{}}{BJjc{}}{BJnc{}}{BKbc{}}{BKdc{}}{BKhc{}}{BLbc{}}{BLfc{}}{BLjc{}}{AIbc{}}{BG`c{}}{BGfc{}}{BGhc{}}{BGlc{}}{BGnc{}}{BH`c{}}{BHbc{}}{BHjc{}}{BIbc{}}{BIhc{}}{BIjc{}}{BJ`c{}}{BJbc{}}{BJjc{}}{BJnc{}}{BKbc{}}{BKdc{}}{BKhc{}}{BLbc{}}{BLfc{}}{BLjc{}}{{BA`BA`}AGn}{{AIbAIb}AGn}{{BAbBAb}AGn}{{BAdBAd}AGn}{{BAfBAf}AGn}{{BAhBAh}AGn}{{BAjBAj}AGn}{{BAlBAl}AGn}{{BAnBAn}AGn}{{BB`BB`}AGn}{{BBbBBb}AGn}{{BBdBBd}AGn}{{AI`AI`}AGn}{{BBfBBf}AGn}{{BBhBBh}AGn}{{BBjBBj}AGn}{{BBlBBl}AGn}{{BBnBBn}AGn}{{AHlAHl}AGn}{{BC`BC`}AGn}{{BCbBCb}AGn}{{BCdBCd}AGn}{{BCfBCf}AGn}{{BChBCh}AGn}{{BCjBCj}AGn}{{BClBCl}AGn}{{BCnBCn}AGn}{{BD`BD`}AGn}{{BDbBDb}AGn}{{BDdBDd}AGn}{{BDfBDf}AGn}{{BDhBDh}AGn}{{BDjBDj}AGn}{{BDlBDl}AGn}{{BDnBDn}AGn}{{BE`BE`}AGn}{{BEbBEb}AGn}{{AIfAIf}AGn}{{AHnAHn}AGn}{{BEdBEd}AGn}{{BEfBEf}AGn}{{AIdAId}AGn}{{BEhBEh}AGn}{{BEjBEj}AGn}{{BElBEl}AGn}{{BEnBEn}AGn}{{BF`BF`}AGn}{{BFbBFb}AGn}{{BFdBFd}AGn}{{BFfBFf}AGn}{{BFhBFh}AGn}{{BFjBFj}AGn}{{BFlBFl}AGn}{{BFnBFn}AGn}{{BG`BG`}AGn}{{BGbBGb}AGn}{{BGdBGd}AGn}{{BGfBGf}AGn}{{BGhBGh}AGn}{{BGjBGj}AGn}{{BGlBGl}AGn}{{BGnBGn}AGn}{{BH`BH`}AGn}{{BHbBHb}AGn}{{BHdBHd}AGn}{{BHfBHf}AGn}{{BHhBHh}AGn}{{BHjBHj}AGn}{{BHlBHl}AGn}{{BHnBHn}AGn}{{BI`BI`}AGn}{{BIbBIb}AGn}{{BIdBId}AGn}{{BIfBIf}AGn}{{BIhBIh}AGn}{{BIjBIj}AGn}{{BIlBIl}AGn}{{BInBIn}AGn}{{BJ`BJ`}AGn}{{BJbBJb}AGn}{{BJdBJd}AGn}{{BJfBJf}AGn}{{BJhBJh}AGn}{{BJjBJj}AGn}{{BJlBJl}AGn}{{BJnBJn}AGn}{{BK`BK`}AGn}{{BKbBKb}AGn}{{BKdBKd}AGn}{{BKfBKf}AGn}{{BKhBKh}AGn}{{BKjBKj}AGn}{{BKlBKl}AGn}{{BKnBKn}AGn}{{BL`BL`}AGn}{{BLbBLb}AGn}{{BLdBLd}AGn}{{BLfBLf}AGn}{{BLhBLh}AGn}{{BLjBLj}AGn}{{BLlBLl}AGn}{{BLnBLn}AGn}{{BM`BM`}AGn}{{BA`AHd}AHj}{{AIbAHd}AHj}{{BAbAHd}AHj}{{BAdAHd}AHj}{{BAfAHd}AHj}{{BAhAHd}AHj}{{BAjAHd}AHj}{{BAlAHd}AHj}{{BAnAHd}AHj}{{BB`AHd}AHj}{{BBbAHd}AHj}{{BBdAHd}AHj}{{AI`AHd}AHj}{{BBfAHd}AHj}{{BBhAHd}AHj}{{BBjAHd}AHj}{{BBlAHd}AHj}{{BBnAHd}AHj}{{AHlAHd}AHj}{{BC`AHd}AHj}{{BCbAHd}AHj}{{BCdAHd}AHj}{{BCfAHd}AHj}{{BChAHd}AHj}{{BCjAHd}AHj}{{BClAHd}AHj}{{BCnAHd}AHj}{{BD`AHd}AHj}{{BDbAHd}AHj}{{BDdAHd}AHj}{{BDfAHd}AHj}{{BDhAHd}AHj}{{BDjAHd}AHj}{{BDlAHd}AHj}{{BDnAHd}AHj}{{BE`AHd}AHj}{{BEbAHd}AHj}{{AIfAHd}AHj}{{AHnAHd}AHj}{{BEdAHd}AHj}{{BEfAHd}AHj}{{AIdAHd}AHj}{{BEhAHd}AHj}{{BEjAHd}AHj}{{BElAHd}AHj}{{BEnAHd}AHj}{{BF`AHd}AHj}{{BFbAHd}AHj}{{BFdAHd}AHj}{{BFfAHd}AHj}{{BFhAHd}AHj}{{BFjAHd}AHj}{{BFlAHd}AHj}{{BFnAHd}AHj}{{BG`AHd}AHj}{{BGbAHd}AHj}{{BGdAHd}AHj}{{BGfAHd}AHj}{{BGhAHd}AHj}{{BGjAHd}AHj}{{BGlAHd}AHj}{{BGnAHd}AHj}{{BH`AHd}AHj}{{BHbAHd}AHj}{{BHdAHd}AHj}{{BHfAHd}AHj}{{BHhAHd}AHj}{{BHjAHd}AHj}{{BHlAHd}AHj}{{BHnAHd}AHj}{{BI`AHd}AHj}{{BIbAHd}AHj}{{BIdAHd}AHj}{{BIfAHd}AHj}{{BIhAHd}AHj}{{BIjAHd}AHj}{{BIlAHd}AHj}{{BInAHd}AHj}{{BJ`AHd}AHj}{{BJbAHd}AHj}{{BJdAHd}AHj}{{BJfAHd}AHj}{{BJhAHd}AHj}{{BJjAHd}AHj}{{BJlAHd}AHj}{{BJnAHd}AHj}{{BK`AHd}AHj}{{BKbAHd}AHj}{{BKdAHd}AHj}{{BKfAHd}AHj}{{BKhAHd}AHj}{{BKjAHd}AHj}{{BKlAHd}AHj}{{BKnAHd}AHj}{{BL`AHd}AHj}{{BLbAHd}AHj}{{BLdAHd}AHj}{{BLfAHd}AHj}{{BLhAHd}AHj}{{BLjAHd}AHj}{{BLlAHd}AHj}{{BLnAHd}AHj}{{BM`AHd}AHj}{cc{}}000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000{{BA`c}AGjAJ`}{{AIbc}AGjAJ`}{{BAbc}AGjAJ`}{{BAdc}AGjAJ`}{{BAfc}AGjAJ`}{{BAhc}AGjAJ`}{{BAjc}AGjAJ`}{{BAlc}AGjAJ`}{{BAnc}AGjAJ`}{{BB`c}AGjAJ`}{{BBbc}AGjAJ`}{{BBdc}AGjAJ`}{{AI`c}AGjAJ`}{{BBfc}AGjAJ`}{{BBhc}AGjAJ`}{{BBjc}AGjAJ`}{{BBlc}AGjAJ`}{{BBnc}AGjAJ`}{{AHlc}AGjAJ`}{{BC`c}AGjAJ`}{{BCbc}AGjAJ`}{{BCdc}AGjAJ`}{{BCfc}AGjAJ`}{{BChc}AGjAJ`}{{BCjc}AGjAJ`}{{BClc}AGjAJ`}{{BCnc}AGjAJ`}{{BD`c}AGjAJ`}{{BDbc}AGjAJ`}{{BDdc}AGjAJ`}{{BDfc}AGjAJ`}{{BDhc}AGjAJ`}{{BDjc}AGjAJ`}{{BDlc}AGjAJ`}{{BDnc}AGjAJ`}{{BE`c}AGjAJ`}{{BEbc}AGjAJ`}{{AIfc}AGjAJ`}{{AHnc}AGjAJ`}{{BEdc}AGjAJ`}{{BEfc}AGjAJ`}{{AIdc}AGjAJ`}{{BEhc}AGjAJ`}{{BEjc}AGjAJ`}{{BElc}AGjAJ`}{{BEnc}AGjAJ`}{{BF`c}AGjAJ`}{{BFbc}AGjAJ`}{{BFdc}AGjAJ`}{{BFfc}AGjAJ`}{{BFhc}AGjAJ`}{{BFjc}AGjAJ`}{{BFlc}AGjAJ`}{{BFnc}AGjAJ`}{{BG`c}AGjAJ`}{{BGbc}AGjAJ`}{{BGdc}AGjAJ`}{{BGfc}AGjAJ`}{{BGhc}AGjAJ`}{{BGjc}AGjAJ`}{{BGlc}AGjAJ`}{{BGnc}AGjAJ`}{{BH`c}AGjAJ`}{{BHbc}AGjAJ`}{{BHdc}AGjAJ`}{{BHfc}AGjAJ`}{{BHhc}AGjAJ`}{{BHjc}AGjAJ`}{{BHlc}AGjAJ`}{{BHnc}AGjAJ`}{{BI`c}AGjAJ`}{{BIbc}AGjAJ`}{{BIdc}AGjAJ`}{{BIfc}AGjAJ`}{{BIhc}AGjAJ`}{{BIjc}AGjAJ`}{{BIlc}AGjAJ`}{{BInc}AGjAJ`}{{BJ`c}AGjAJ`}{{BJbc}AGjAJ`}{{BJdc}AGjAJ`}{{BJfc}AGjAJ`}{{BJhc}AGjAJ`}{{BJjc}AGjAJ`}{{BJlc}AGjAJ`}{{BJnc}AGjAJ`}{{BK`c}AGjAJ`}{{BKbc}AGjAJ`}{{BKdc}AGjAJ`}{{BKfc}AGjAJ`}{{BKhc}AGjAJ`}{{BKjc}AGjAJ`}{{BKlc}AGjAJ`}{{BKnc}AGjAJ`}{{BL`c}AGjAJ`}{{BLbc}AGjAJ`}{{BLdc}AGjAJ`}{{BLfc}AGjAJ`}{{BLhc}AGjAJ`}{{BLjc}AGjAJ`}{{BLlc}AGjAJ`}{{BLnc}AGjAJ`}{{BM`c}AGjAJ`}{ce{}{}}000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000{AKd{{l{AIb}}}}{AKd{{l{BAb}}}}{AKd{{l{BAd}}}}{AKd{{l{BAf}}}}{AKd{{l{BAh}}}}{AKd{{l{BAj}}}}{AKd{{l{BAl}}}}{AKd{{l{BAn}}}}{AKd{{l{BB`}}}}{AKd{{l{BBb}}}}{AKd{{l{BBd}}}}{AKd{{l{AI`}}}}{AKd{{l{BBf}}}}{AKd{{l{BBh}}}}{AKd{{l{BBj}}}}{AKd{{l{BBl}}}}{AKd{{l{BBn}}}}{AKd{{l{AHl}}}}{AKd{{l{BC`}}}}{AKd{{l{BCb}}}}{AKd{{l{BCd}}}}{AKd{{l{BCf}}}}{AKd{{l{BCh}}}}{AKd{{l{BCj}}}}{AKd{{l{BCl}}}}{AKd{{l{BCn}}}}{AKd{{l{BD`}}}}{AKd{{l{BDb}}}}{AKd{{l{BDd}}}}{AKd{{l{BDf}}}}{AKd{{l{BDh}}}}{AKd{{l{BDj}}}}{AKd{{l{BDl}}}}{AKd{{l{BDn}}}}{AKd{{l{BE`}}}}{AKd{{l{BEb}}}}{AKd{{l{AIf}}}}{AKd{{l{AHn}}}}{AKd{{l{BEd}}}}{AKd{{l{BEf}}}}{AKd{{l{AId}}}}{AKd{{l{BEh}}}}{AKd{{l{BEj}}}}{AKd{{l{BEl}}}}{AKd{{l{BEn}}}}{AKd{{l{BF`}}}}{AKd{{l{BFb}}}}{AKd{{l{BFd}}}}{AKd{{l{BFf}}}}{AKd{{l{BFh}}}}{AKd{{l{BFj}}}}{AKd{{l{BFl}}}}{AKd{{l{BFn}}}}{AKd{{l{BG`}}}}{AKd{{l{BGb}}}}{AKd{{l{BGd}}}}{AKd{{l{BGf}}}}{AKd{{l{BGh}}}}{AKd{{l{BGj}}}}{AKd{{l{BGl}}}}{AKd{{l{BGn}}}}{AKd{{l{BH`}}}}{AKd{{l{BHb}}}}{AKd{{l{BHd}}}}{AKd{{l{BHf}}}}{AKd{{l{BHh}}}}{AKd{{l{BHj}}}}{AKd{{l{BHl}}}}{AKd{{l{BHn}}}}{AKd{{l{BI`}}}}{AKd{{l{BIb}}}}{AKd{{l{BId}}}}{AKd{{l{BIf}}}}{AKd{{l{BIh}}}}{AKd{{l{BIj}}}}{AKd{{l{BIl}}}}{AKd{{l{BIn}}}}{AKd{{l{BJ`}}}}{AKd{{l{BJb}}}}{AKd{{l{BJd}}}}{AKd{{l{BJf}}}}{AKd{{l{BJh}}}}{AKd{{l{BJj}}}}{AKd{{l{BJl}}}}{AKd{{l{BJn}}}}{AKd{{l{BK`}}}}{AKd{{l{BKb}}}}{AKd{{l{BKd}}}}{AKd{{l{BKf}}}}{AKd{{l{BKh}}}}{AKd{{l{BKj}}}}{AKd{{l{BKl}}}}{AKd{{l{BKn}}}}{AKd{{l{BL`}}}}{AKd{{l{BLb}}}}{AKd{{l{BLd}}}}{AKd{{l{BLf}}}}{AKd{{l{BLh}}}}{AKd{{l{BLj}}}}{cAJf{}}00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000```````````````````````````````````````````````````````````````````````````````````````````````````````{{BA`AKfc}AGj{{AOb{AKf}}}}{{BLlAKfc}AGj{{AOb{AKf}}}}{{BLnAKfc}AGj{{AOb{AKf}}}}{{BM`AKfc}AGj{{AOb{AKf}}}}{ce{}{}}000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000{{AIbAKf}AGj}{{BAbAKf}AGj}{{BAdAKf}AGj}{{BAfAKf}AGj}{{BAhAKf}AGj}{{BAjAKf}AGj}{{BAlAKf}AGj}{{BAnAKf}AGj}{{BB`AKf}AGj}{{BBbAKf}AGj}{{BBdAKf}AGj}{{AI`AKf}AGj}{{BBfAKf}AGj}{{BBhAKf}AGj}{{BBjAKf}AGj}{{BBlAKf}AGj}{{BBnAKf}AGj}{{AHlAKf}AGj}{{BC`AKf}AGj}{{BCbAKf}AGj}{{BCdAKf}AGj}{{BCfAKf}AGj}{{BChAKf}AGj}{{BCjAKf}AGj}{{BClAKf}AGj}{{BCnAKf}AGj}{{BD`AKf}AGj}{{BDbAKf}AGj}{{BDdAKf}AGj}{{BDfAKf}AGj}{{BDhAKf}AGj}{{BDjAKf}AGj}{{BDlAKf}AGj}{{BDnAKf}AGj}{{BE`AKf}AGj}{{BEbAKf}AGj}{{AIfAKf}AGj}{{AHnAKf}AGj}{{BEdAKf}AGj}{{BEfAKf}AGj}{{AIdAKf}AGj}{{BEhAKf}AGj}{{BEjAKf}AGj}{{BElAKf}AGj}{{BEnAKf}AGj}{{BF`AKf}AGj}{{BFbAKf}AGj}{{BFdAKf}AGj}{{BFfAKf}AGj}{{BFhAKf}AGj}{{BFjAKf}AGj}{{BFlAKf}AGj}{{BFnAKf}AGj}{{BG`AKf}AGj}{{BGbAKf}AGj}{{BGdAKf}AGj}{{BGfAKf}AGj}{{BGhAKf}AGj}{{BGjAKf}AGj}{{BGlAKf}AGj}{{BGnAKf}AGj}{{BH`AKf}AGj}{{BHbAKf}AGj}{{BHdAKf}AGj}{{BHfAKf}AGj}{{BHhAKf}AGj}{{BHjAKf}AGj}{{BHlAKf}AGj}{{BHnAKf}AGj}{{BI`AKf}AGj}{{BIbAKf}AGj}{{BIdAKf}AGj}{{BIfAKf}AGj}{{BIhAKf}AGj}{{BIjAKf}AGj}{{BIlAKf}AGj}{{BInAKf}AGj}{{BJ`AKf}AGj}{{BJbAKf}AGj}{{BJdAKf}AGj}{{BJfAKf}AGj}{{BJhAKf}AGj}{{BJjAKf}AGj}{{BJlAKf}AGj}{{BJnAKf}AGj}{{BK`AKf}AGj}{{BKbAKf}AGj}{{BKdAKf}AGj}{{BKfAKf}AGj}{{BKhAKf}AGj}{{BKjAKf}AGj}{{BKlAKf}AGj}{{BKnAKf}AGj}{{BL`AKf}AGj}{{BLbAKf}AGj}{{BLdAKf}AGj}{{BLfAKf}AGj}{{BLhAKf}AGj}{{BLjAKf}AGj}{c{{AHh{e}}}{}{}}0000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000{cALh{}}000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000`{{cAGb}AGj{BMbAHb}}{{BMbAGb}AGj}0{{cACh}AGj{BMbAHb}}{{BMbACh}AGj}0{{cHj}AGj{BMbAHb}}{{BMbHj}AGj}0{{cACl}AGj{BMbAHb}}{{BMbACl}AGj}0{{cACj}AGj{BMbAHb}}{{BMbACj}AGj}0{{cAh}AGj{BMbAHb}}{{BMbAh}AGj}0{{cAf}AGj{BMbAHb}}{{BMbAf}AGj}0{{cAGd}AGj{BMbAHb}}{{BMbAGd}AGj}0{{cAGf}AGj{BMbAHb}}{{BMbAGf}AGj}0{{cAAb}AGj{BMbAHb}}{{BMbAAb}AGj}0{{cADj}AGj{BMbAHb}}{{BMbADj}AGj}0{{cIj}AGj{BMbAHb}}{{BMbIj}AGj}0{{cIh}AGj{BMbAHb}}{{BMbIh}AGj}0{{cACn}AGj{BMbAHb}}{{BMbACn}AGj}0{{cC`}AGj{BMbAHb}}{{BMbC`}AGj}0{{cBl}AGj{BMbAHb}}{{BMbBl}AGj}0{{cBn}AGj{BMbAHb}}{{BMbBn}AGj}0{{cCb}AGj{BMbAHb}}{{BMbCb}AGj}0{{cBj}AGj{BMbAHb}}{{BMbBj}AGj}0{{cCf}AGj{BMbAHb}}{{BMbCf}AGj}0{{cCh}AGj{BMbAHb}}{{BMbCh}AGj}0{{cCj}AGj{BMbAHb}}{{BMbCj}AGj}0{{cCl}AGj{BMbAHb}}{{BMbCl}AGj}0{{cCn}AGj{BMbAHb}}{{BMbCn}AGj}0{{cD`}AGj{BMbAHb}}{{BMbD`}AGj}0{{cDb}AGj{BMbAHb}}{{BMbDb}AGj}0{{cDd}AGj{BMbAHb}}{{BMbDd}AGj}0{{cDf}AGj{BMbAHb}}{{BMbDf}AGj}0{{cDh}AGj{BMbAHb}}{{BMbDh}AGj}0{{cDj}AGj{BMbAHb}}{{BMbDj}AGj}0{{cDl}AGj{BMbAHb}}{{BMbDl}AGj}0{{cDn}AGj{BMbAHb}}{{BMbDn}AGj}0{{cE`}AGj{BMbAHb}}{{BMbE`}AGj}0{{cEb}AGj{BMbAHb}}{{BMbEb}AGj}0{{cEd}AGj{BMbAHb}}{{BMbEd}AGj}0{{cEf}AGj{BMbAHb}}{{BMbEf}AGj}0{{cEh}AGj{BMbAHb}}{{BMbEh}AGj}0{{cEj}AGj{BMbAHb}}{{BMbEj}AGj}0{{cEl}AGj{BMbAHb}}{{BMbEl}AGj}0{{cEn}AGj{BMbAHb}}{{BMbEn}AGj}0{{cF`}AGj{BMbAHb}}{{BMbF`}AGj}0{{cFb}AGj{BMbAHb}}{{BMbFb}AGj}0{{cFd}AGj{BMbAHb}}{{BMbFd}AGj}0{{cCd}AGj{BMbAHb}}{{BMbCd}AGj}0{{cFf}AGj{BMbAHb}}{{BMbFf}AGj}0{{cFh}AGj{BMbAHb}}{{BMbFh}AGj}0{{cFj}AGj{BMbAHb}}{{BMbFj}AGj}0{{cFl}AGj{BMbAHb}}{{BMbFl}AGj}0{{cFn}AGj{BMbAHb}}{{BMbFn}AGj}0{{cG`}AGj{BMbAHb}}{{BMbG`}AGj}0{{cGb}AGj{BMbAHb}}{{BMbGb}AGj}0{{cGf}AGj{BMbAHb}}{{BMbGf}AGj}0{{cGd}AGj{BMbAHb}}{{BMbGd}AGj}0{{cGh}AGj{BMbAHb}}{{BMbGh}AGj}0{{cGj}AGj{BMbAHb}}{{BMbGj}AGj}0{{cGl}AGj{BMbAHb}}{{BMbGl}AGj}0{{cGn}AGj{BMbAHb}}{{BMbGn}AGj}0{{cH`}AGj{BMbAHb}}{{BMbH`}AGj}0{{cBh}AGj{BMbAHb}}{{BMbBh}AGj}0{{cADh}AGj{BMbAHb}}{{BMbADh}AGj}0{{cABn}AGj{BMbAHb}}{{BMbABn}AGj}0{{cHf}AGj{BMbAHb}}{{BMbHf}AGj}0{{cBb}AGj{BMbAHb}}{{BMbBb}AGj}0{{cBd}AGj{BMbAHb}}{{BMbBd}AGj}0{{cBf}AGj{BMbAHb}}{{BMbBf}AGj}0{{cHn}AGj{BMbAHb}}{{BMbHn}AGj}0{{cOf}AGj{BMbAHb}}{{BMbOf}AGj}0{{cMh}AGj{BMbAHb}}{{BMbMh}AGj}0{{cMn}AGj{BMbAHb}}{{BMbMn}AGj}0{{cMf}AGj{BMbAHb}}{{BMbMf}AGj}0{{cMj}AGj{BMbAHb}}{{BMbMj}AGj}0{{cMl}AGj{BMbAHb}}{{BMbMl}AGj}0{{cACf}AGj{BMbAHb}}{{BMbACf}AGj}0{{cIb}AGj{BMbAHb}}{{BMbIb}AGj}0{{cI`}AGj{BMbAHb}}{{BMbI`}AGj}0{{cA`}AGj{BMbAHb}}{{BMbA`}AGj}0{{cNl}AGj{BMbAHb}}{{BMbNl}AGj}0{{cNn}AGj{BMbAHb}}{{BMbNn}AGj}0{{cOb}AGj{BMbAHb}}{{BMbOb}AGj}0{{cNj}AGj{BMbAHb}}{{BMbNj}AGj}0{{cO`}AGj{BMbAHb}}{{BMbO`}AGj}0{{cOn}AGj{BMbAHb}}{{BMbOn}AGj}0{{cHd}AGj{BMbAHb}}{{BMbHd}AGj}0{{cJl}AGj{BMbAHb}}{{BMbJl}AGj}0{{cJn}AGj{BMbAHb}}{{BMbJn}AGj}0{{cK`}AGj{BMbAHb}}{{BMbK`}AGj}0{{cKb}AGj{BMbAHb}}{{BMbKb}AGj}0{{cKd}AGj{BMbAHb}}{{BMbKd}AGj}0{{cKf}AGj{BMbAHb}}{{BMbKf}AGj}0{{cKh}AGj{BMbAHb}}{{BMbKh}AGj}0{{cKj}AGj{BMbAHb}}{{BMbKj}AGj}0{{cJj}AGj{BMbAHb}}{{BMbJj}AGj}0{{cKl}AGj{BMbAHb}}{{BMbKl}AGj}0{{cKn}AGj{BMbAHb}}{{BMbKn}AGj}0{{cLb}AGj{BMbAHb}}{{BMbLb}AGj}0{{cL`}AGj{BMbAHb}}{{BMbL`}AGj}0{{cLd}AGj{BMbAHb}}{{BMbLd}AGj}0{{cLf}AGj{BMbAHb}}{{BMbLf}AGj}0{{cLh}AGj{BMbAHb}}{{BMbLh}AGj}0{{cHh}AGj{BMbAHb}}{{BMbHh}AGj}0{{cAd}AGj{BMbAHb}}{{BMbAd}AGj}0{{cId}AGj{BMbAHb}}{{BMbId}AGj}0{{cAl}AGj{BMbAHb}}{{BMbAl}AGj}0{{cAh}AGj{BMbAHb}}{{BMbAh}AGj}0{{cAd}AGj{BMbAHb}}{{BMbAd}AGj}0{{cAj}AGj{BMbAHb}}{{BMbAj}AGj}0{{cAf}AGj{BMbAHb}}{{BMbAf}AGj}0{{cj}AGj{BMbAHb}}{{BMbj}AGj}0{{cf}AGj{BMbAHb}}{{BMbf}AGj}0{{cA`}AGj{BMbAHb}}{{BMbA`}AGj}0{{cAb}AGj{BMbAHb}}{{BMbAb}AGj}0{{cAE`}AGj{BMbAHb}}{{BMbAE`}AGj}0{{cADn}AGj{BMbAHb}}{{BMbADn}AGj}0{{cAA`}AGj{BMbAHb}}{{BMbAA`}AGj}0{{cAn}AGj{BMbAHb}}{{BMbAn}AGj}0{{cHb}AGj{BMbAHb}}{{BMbHb}AGj}0{{cAl}AGj{BMbAHb}}{{BMbAl}AGj}0{{cAj}AGj{BMbAHb}}{{BMbAj}AGj}0{{cAn}AGj{BMbAHb}}{{BMbAn}AGj}0{{cAD`}AGj{BMbAHb}}{{BMbAD`}AGj}0{{cAAh}AGj{BMbAHb}}{{BMbAAh}AGj}0{{cAAf}AGj{BMbAHb}}{{BMbAAf}AGj}0{{cAAj}AGj{BMbAHb}}{{BMbAAj}AGj}0{{cAAl}AGj{BMbAHb}}{{BMbAAl}AGj}0{{cAAn}AGj{BMbAHb}}{{BMbAAn}AGj}0{{cAB`}AGj{BMbAHb}}{{BMbAB`}AGj}0{{cABb}AGj{BMbAHb}}{{BMbABb}AGj}0{{cABd}AGj{BMbAHb}}{{BMbABd}AGj}0{{cABf}AGj{BMbAHb}}{{BMbABf}AGj}0{{cABh}AGj{BMbAHb}}{{BMbABh}AGj}0{{cABj}AGj{BMbAHb}}{{BMbABj}AGj}0{{cABl}AGj{BMbAHb}}{{BMbABl}AGj}0{{cACd}AGj{BMbAHb}}{{BMbACd}AGj}0{{cAC`}AGj{BMbAHb}}{{BMbAC`}AGj}0{{cACb}AGj{BMbAHb}}{{BMbACb}AGj}0{{cJf}AGj{BMbAHb}}{{BMbJf}AGj}0{{cJh}AGj{BMbAHb}}{{BMbJh}AGj}0{{cADb}AGj{BMbAHb}}{{BMbADb}AGj}0{{cHl}AGj{BMbAHb}}{{BMbHl}AGj}0{{cOh}AGj{BMbAHb}}{{BMbOh}AGj}0{{cAGh}AGj{BMbAHb}}{{BMbAGh}AGj}0{{cOd}AGj{BMbAHb}}{{BMbOd}AGj}0{{cAJf}AGj{BMbAHb}}{{BMbAJf}AGj}0{{cOl}AGj{BMbAHb}}{{BMbOl}AGj}0{{cAEb}AGj{BMbAHb}}{{BMbAEb}AGj}0{{cADl}AGj{BMbAHb}}{{BMbADl}AGj}0{{cJ`}AGj{BMbAHb}}{{BMbJ`}AGj}0{{cIn}AGj{BMbAHb}}{{BMbIn}AGj}0{{cNb}AGj{BMbAHb}}{{BMbNb}AGj}0{{cNd}AGj{BMbAHb}}{{BMbNd}AGj}0{{cNh}AGj{BMbAHb}}{{BMbNh}AGj}0{{cN`}AGj{BMbAHb}}{{BMbN`}AGj}0{{cNf}AGj{BMbAHb}}{{BMbNf}AGj}0{{cAEf}AGj{BMbAHb}}{{BMbAEf}AGj}0{{cAEh}AGj{BMbAHb}}{{BMbAEh}AGj}0{{cAEj}AGj{BMbAHb}}{{BMbAEj}AGj}0{{cAEl}AGj{BMbAHb}}{{BMbAEl}AGj}0{{cAEn}AGj{BMbAHb}}{{BMbAEn}AGj}0{{cAF`}AGj{BMbAHb}}{{BMbAF`}AGj}0{{cAEd}AGj{BMbAHb}}{{BMbAEd}AGj}0{{cAFb}AGj{BMbAHb}}{{BMbAFb}AGj}0{{cIl}AGj{BMbAHb}}{{BMbIl}AGj}0{{cIf}AGj{BMbAHb}}{{BMbIf}AGj}0{{cAFd}AGj{BMbAHb}}{{BMbAFd}AGj}0{{cAFf}AGj{BMbAHb}}{{BMbAFf}AGj}0{{cAFh}AGj{BMbAHb}}{{BMbAFh}AGj}0{{cAFj}AGj{BMbAHb}}{{BMbAFj}AGj}0{{cAFl}AGj{BMbAHb}}{{BMbAFl}AGj}0{{cAFn}AGj{BMbAHb}}{{BMbAFn}AGj}0{{cAG`}AGj{BMbAHb}}{{BMbAG`}AGj}0{{cAAd}AGj{BMbAHb}}{{BMbAAd}AGj}0{{cMb}AGj{BMbAHb}}{{BMbMb}AGj}0{{cMd}AGj{BMbAHb}}{{BMbMd}AGj}0{{cLn}AGj{BMbAHb}}{{BMbLn}AGj}0{{cLl}AGj{BMbAHb}}{{BMbLl}AGj}0{{cM`}AGj{BMbAHb}}{{BMbM`}AGj}0{{cLj}AGj{BMbAHb}}{{BMbLj}AGj}0{{cOj}AGj{BMbAHb}}{{BMbOj}AGj}0{{cB`}AGj{BMbAHb}}{{BMbB`}AGj}0{{cADf}AGj{BMbAHb}}{{BMbADf}AGj}0{{cADd}AGj{BMbAHb}}{{BMbADd}AGj}0{{cJb}AGj{BMbAHb}}{{BMbJb}AGj}0{{cJd}AGj{BMbAHb}}{{BMbJd}AGj}0","c":[],"p":[[5,"TypeGenerics",0],[5,"Turbofish",0],[5,"LitInt",0],[1,"str"],[5,"LitFloat",0],[8,"Result",4258],[10,"FromStr",7077],[5,"Ident",0],[5,"ImplGenerics",0],[5,"Lifetime",0],[5,"Attribute",0],[6,"AttrStyle",0],[6,"Meta",0],[5,"MetaList",0],[5,"MetaNameValue",0],[5,"Variant",0],[6,"Fields",0],[5,"FieldsNamed",0],[5,"FieldsUnnamed",0],[5,"Field",0],[5,"DeriveInput",0],[6,"Data",0],[5,"DataStruct",0],[5,"DataEnum",0],[5,"DataUnion",0],[6,"Expr",0],[5,"ExprArray",0],[5,"ExprAssign",0],[5,"ExprAsync",0],[5,"ExprAwait",0],[5,"ExprBinary",0],[5,"ExprBlock",0],[5,"ExprBreak",0],[5,"ExprCall",0],[5,"ExprCast",0],[5,"ExprClosure",0],[5,"ExprConst",0],[5,"ExprContinue",0],[5,"ExprField",0],[5,"ExprForLoop",0],[5,"ExprGroup",0],[5,"ExprIf",0],[5,"ExprIndex",0],[5,"ExprInfer",0],[5,"ExprLet",0],[5,"ExprLit",0],[5,"ExprLoop",0],[5,"ExprMacro",0],[5,"ExprMatch",0],[5,"ExprMethodCall",0],[5,"ExprParen",0],[5,"ExprPath",0],[5,"ExprRange",0],[5,"ExprReference",0],[5,"ExprRepeat",0],[5,"ExprReturn",0],[5,"ExprStruct",0],[5,"ExprTry",0],[5,"ExprTryBlock",0],[5,"ExprTuple",0],[5,"ExprUnary",0],[5,"ExprUnsafe",0],[5,"ExprWhile",0],[5,"ExprYield",0],[6,"Member",0],[5,"Index",0],[5,"FieldValue",0],[5,"Label",0],[5,"Arm",0],[6,"RangeLimits",0],[5,"File",0],[5,"Generics",0],[6,"GenericParam",0],[5,"LifetimeParam",0],[5,"TypeParam",0],[5,"ConstParam",0],[5,"BoundLifetimes",0],[6,"TypeParamBound",0],[5,"TraitBound",0],[6,"TraitBoundModifier",0],[5,"WhereClause",0],[6,"WherePredicate",0],[5,"PredicateLifetime",0],[5,"PredicateType",0],[6,"Item",0],[5,"ItemConst",0],[5,"ItemEnum",0],[5,"ItemExternCrate",0],[5,"ItemFn",0],[5,"ItemForeignMod",0],[5,"ItemImpl",0],[5,"ItemMacro",0],[5,"ItemMod",0],[5,"ItemStatic",0],[5,"ItemStruct",0],[5,"ItemTrait",0],[5,"ItemTraitAlias",0],[5,"ItemType",0],[5,"ItemUnion",0],[5,"ItemUse",0],[6,"UseTree",0],[5,"UsePath",0],[5,"UseName",0],[5,"UseRename",0],[5,"UseGlob",0],[5,"UseGroup",0],[6,"ForeignItem",0],[5,"ForeignItemFn",0],[5,"ForeignItemStatic",0],[5,"ForeignItemType",0],[5,"ForeignItemMacro",0],[6,"TraitItem",0],[5,"TraitItemConst",0],[5,"TraitItemFn",0],[5,"TraitItemType",0],[5,"TraitItemMacro",0],[6,"ImplItem",0],[5,"ImplItemConst",0],[5,"ImplItemFn",0],[5,"ImplItemType",0],[5,"ImplItemMacro",0],[5,"Signature",0],[6,"FnArg",0],[5,"Receiver",0],[5,"Variadic",0],[6,"StaticMutability",0],[6,"ImplRestriction",0],[6,"Lit",0],[5,"LitStr",0],[5,"LitByteStr",0],[5,"LitCStr",0],[5,"LitByte",0],[5,"LitChar",0],[5,"LitBool",0],[5,"Macro",0],[6,"MacroDelimiter",0],[6,"BinOp",0],[6,"UnOp",0],[6,"Pat",0],[5,"PatIdent",0],[5,"PatOr",0],[5,"PatParen",0],[5,"PatReference",0],[5,"PatRest",0],[5,"PatSlice",0],[5,"PatStruct",0],[5,"PatTuple",0],[5,"PatTupleStruct",0],[5,"PatType",0],[5,"PatWild",0],[5,"FieldPat",0],[5,"Path",0],[5,"PathSegment",0],[6,"PathArguments",0],[6,"GenericArgument",0],[5,"AngleBracketedGenericArguments",0],[5,"AssocType",0],[5,"AssocConst",0],[5,"Constraint",0],[5,"ParenthesizedGenericArguments",0],[5,"QSelf",0],[6,"Visibility",0],[5,"VisRestricted",0],[6,"FieldMutability",0],[5,"Block",0],[6,"Stmt",0],[5,"Local",0],[5,"LocalInit",0],[5,"StmtMacro",0],[6,"Type",0],[5,"TypeArray",0],[5,"TypeBareFn",0],[5,"TypeGroup",0],[5,"TypeImplTrait",0],[5,"TypeInfer",0],[5,"TypeMacro",0],[5,"TypeNever",0],[5,"TypeParen",0],[5,"TypePath",0],[5,"TypePtr",0],[5,"TypeReference",0],[5,"TypeSlice",0],[5,"TypeTraitObject",0],[5,"TypeTuple",0],[5,"Abi",0],[5,"BareFnArg",0],[5,"BareVariadic",0],[6,"ReturnType",0],[1,"unit"],[6,"Ordering",7078],[1,"bool"],[10,"AsRef",7079],[10,"Sized",7080],[5,"Formatter",7081],[5,"Error",7081],[6,"Result",7082],[8,"Result",7081],[5,"Extern",4533],[5,"SelfValue",4533],[5,"Crate",4533],[5,"Underscore",4533],[5,"Super",4533],[5,"SelfType",4533],[1,"usize"],[5,"Literal",7083],[10,"Into",7079],[6,"Option",7084],[10,"Hasher",7085],[5,"Iter",4366],[5,"IterMut",4366],[5,"Span",7083],[1,"u8"],[1,"slice"],[5,"CStr",7086],[1,"char"],[5,"TokenStream",7087],[10,"Parse",4258],[8,"ParseStream",4258],[5,"TokenStream",7083],[10,"Parser",4258],[5,"Vec",7088],[5,"ParseNestedMeta",4244],[17,"Output"],[10,"FnMut",7089],[5,"DelimSpan",7090],[1,"tuple"],[5,"String",7091],[5,"TypeId",7092],[5,"CString",7093],[5,"TokenBuffer",4206],[5,"Cursor",4206],[6,"Delimiter",7083],[5,"Punct",7083],[6,"TokenTree",7083],[10,"IdentExt",4240],[5,"Error",4258],[10,"Display",7081],[5,"ParseBuffer",4258],[1,"fn"],[5,"StepCursor",4258],[5,"Nothing",4258],[5,"Lookahead1",4258],[17,"Item"],[10,"IntoIterator",7094],[5,"LexError",7083],[10,"ToTokens",7095],[5,"Punctuated",4366],[10,"Peek",4258],[10,"FnOnce",7089],[10,"Speculative",4362],[10,"AnyDelimiter",4362],[10,"Clone",7096],[5,"Pairs",4366],[5,"IntoPairs",4366],[5,"IntoIter",4366],[6,"Pair",4366],[10,"PartialEq",7078],[10,"Default",7097],[10,"Debug",7081],[10,"Hash",7085],[5,"PairsMut",4366],[10,"Token",4533],[10,"Spanned",4531],[5,"Group",4533],[5,"Abstract",4533],[5,"As",4533],[5,"Async",4533],[5,"Auto",4533],[5,"Await",4533],[5,"Become",4533],[5,"Box",4533],[5,"Break",4533],[5,"Const",4533],[5,"Continue",4533],[5,"Default",4533],[5,"Do",4533],[5,"Dyn",4533],[5,"Else",4533],[5,"Enum",4533],[5,"Final",4533],[5,"Fn",4533],[5,"For",4533],[5,"If",4533],[5,"Impl",4533],[5,"In",4533],[5,"Let",4533],[5,"Loop",4533],[5,"Macro",4533],[5,"Match",4533],[5,"Mod",4533],[5,"Move",4533],[5,"Mut",4533],[5,"Override",4533],[5,"Priv",4533],[5,"Pub",4533],[5,"Ref",4533],[5,"Return",4533],[5,"Static",4533],[5,"Struct",4533],[5,"Trait",4533],[5,"Try",4533],[5,"Type",4533],[5,"Typeof",4533],[5,"Union",4533],[5,"Unsafe",4533],[5,"Unsized",4533],[5,"Use",4533],[5,"Virtual",4533],[5,"Where",4533],[5,"While",4533],[5,"Yield",4533],[5,"And",4533],[5,"AndAnd",4533],[5,"AndEq",4533],[5,"At",4533],[5,"Caret",4533],[5,"CaretEq",4533],[5,"Colon",4533],[5,"Comma",4533],[5,"Dollar",4533],[5,"Dot",4533],[5,"DotDot",4533],[5,"DotDotDot",4533],[5,"DotDotEq",4533],[5,"Eq",4533],[5,"EqEq",4533],[5,"FatArrow",4533],[5,"Ge",4533],[5,"Gt",4533],[5,"LArrow",4533],[5,"Le",4533],[5,"Lt",4533],[5,"Minus",4533],[5,"MinusEq",4533],[5,"Ne",4533],[5,"Not",4533],[5,"Or",4533],[5,"OrEq",4533],[5,"OrOr",4533],[5,"PathSep",4533],[5,"Percent",4533],[5,"PercentEq",4533],[5,"Plus",4533],[5,"PlusEq",4533],[5,"Pound",4533],[5,"Question",4533],[5,"RArrow",4533],[5,"Semi",4533],[5,"Shl",4533],[5,"ShlEq",4533],[5,"Shr",4533],[5,"ShrEq",4533],[5,"Slash",4533],[5,"SlashEq",4533],[5,"Star",4533],[5,"StarEq",4533],[5,"Tilde",4533],[5,"Brace",4533],[5,"Bracket",4533],[5,"Paren",4533],[10,"VisitMut",6527]],"b":[[1395,"impl-PartialEq-for-Ident"],[1396,"impl-PartialEq%3CT%3E-for-Ident"],[1625,"impl-Debug-for-Ident"],[1626,"impl-Display-for-Ident"],[1627,"impl-IdentFragment-for-Ident"],[1631,"impl-Debug-for-Lifetime"],[1632,"impl-Display-for-Lifetime"],[1687,"impl-Debug-for-Member"],[1688,"impl-IdentFragment-for-Member"],[1689,"impl-Debug-for-Index"],[1690,"impl-IdentFragment-for-Index"],[1758,"impl-Display-for-LitInt"],[1759,"impl-Debug-for-LitInt"],[1760,"impl-Display-for-LitFloat"],[1761,"impl-Debug-for-LitFloat"],[1821,"impl-From%3CExtern%3E-for-Ident"],[1822,"impl-From%3CSelfValue%3E-for-Ident"],[1823,"impl-From%3CCrate%3E-for-Ident"],[1824,"impl-From%3CUnderscore%3E-for-Ident"],[1825,"impl-From%3CSuper%3E-for-Ident"],[1827,"impl-From%3CSelfType%3E-for-Ident"],[1834,"impl-From%3CMetaList%3E-for-Meta"],[1835,"impl-From%3CMetaNameValue%3E-for-Meta"],[1837,"impl-From%3CPath%3E-for-Meta"],[1842,"impl-From%3CFieldsUnnamed%3E-for-Fields"],[1843,"impl-From%3CFieldsNamed%3E-for-Fields"],[1847,"impl-From%3CItemUnion%3E-for-DeriveInput"],[1848,"impl-From%3CItemEnum%3E-for-DeriveInput"],[1850,"impl-From%3CItemStruct%3E-for-DeriveInput"],[1855,"impl-From%3CExprAwait%3E-for-Expr"],[1856,"impl-From%3CExprParen%3E-for-Expr"],[1857,"impl-From%3CExprCast%3E-for-Expr"],[1858,"impl-From%3CExprClosure%3E-for-Expr"],[1859,"impl-From%3CExprReturn%3E-for-Expr"],[1860,"impl-From%3CExprArray%3E-for-Expr"],[1861,"impl-From%3CExprBlock%3E-for-Expr"],[1862,"impl-From%3CExprConst%3E-for-Expr"],[1863,"impl-From%3CExprTuple%3E-for-Expr"],[1864,"impl-From%3CExprYield%3E-for-Expr"],[1866,"impl-From%3CExprTry%3E-for-Expr"],[1867,"impl-From%3CExprReference%3E-for-Expr"],[1868,"impl-From%3CExprAssign%3E-for-Expr"],[1869,"impl-From%3CExprUnary%3E-for-Expr"],[1870,"impl-From%3CExprMatch%3E-for-Expr"],[1871,"impl-From%3CExprLit%3E-for-Expr"],[1872,"impl-From%3CExprInfer%3E-for-Expr"],[1873,"impl-From%3CExprContinue%3E-for-Expr"],[1874,"impl-From%3CExprMacro%3E-for-Expr"],[1875,"impl-From%3CExprLet%3E-for-Expr"],[1876,"impl-From%3CExprUnsafe%3E-for-Expr"],[1877,"impl-From%3CExprGroup%3E-for-Expr"],[1878,"impl-From%3CExprStruct%3E-for-Expr"],[1879,"impl-From%3CExprForLoop%3E-for-Expr"],[1880,"impl-From%3CExprPath%3E-for-Expr"],[1881,"impl-From%3CExprRange%3E-for-Expr"],[1882,"impl-From%3CExprMethodCall%3E-for-Expr"],[1883,"impl-From%3CExprCall%3E-for-Expr"],[1884,"impl-From%3CExprIf%3E-for-Expr"],[1885,"impl-From%3CExprRepeat%3E-for-Expr"],[1886,"impl-From%3CExprAsync%3E-for-Expr"],[1887,"impl-From%3CExprWhile%3E-for-Expr"],[1888,"impl-From%3CExprTryBlock%3E-for-Expr"],[1889,"impl-From%3CExprField%3E-for-Expr"],[1890,"impl-From%3CExprIndex%3E-for-Expr"],[1891,"impl-From%3CExprBinary%3E-for-Expr"],[1892,"impl-From%3CExprBreak%3E-for-Expr"],[1893,"impl-From%3CExprLoop%3E-for-Expr"],[1932,"impl-From%3Cusize%3E-for-Member"],[1934,"impl-From%3CIdent%3E-for-Member"],[1935,"impl-From%3CIndex%3E-for-Member"],[1944,"impl-From%3CTypeParam%3E-for-GenericParam"],[1945,"impl-From%3CConstParam%3E-for-GenericParam"],[1946,"impl-From%3CLifetimeParam%3E-for-GenericParam"],[1953,"impl-From%3CLifetime%3E-for-TypeParamBound"],[1954,"impl-From%3CTraitBound%3E-for-TypeParamBound"],[1959,"impl-From%3CPredicateLifetime%3E-for-WherePredicate"],[1961,"impl-From%3CPredicateType%3E-for-WherePredicate"],[1964,"impl-From%3CItemTraitAlias%3E-for-Item"],[1965,"impl-From%3CItemType%3E-for-Item"],[1966,"impl-From%3CItemStatic%3E-for-Item"],[1967,"impl-From%3CItemImpl%3E-for-Item"],[1968,"impl-From%3CDeriveInput%3E-for-Item"],[1969,"impl-From%3CItemMacro%3E-for-Item"],[1971,"impl-From%3CItemUse%3E-for-Item"],[1972,"impl-From%3CItemConst%3E-for-Item"],[1973,"impl-From%3CItemForeignMod%3E-for-Item"],[1974,"impl-From%3CItemMod%3E-for-Item"],[1975,"impl-From%3CItemStruct%3E-for-Item"],[1976,"impl-From%3CItemUnion%3E-for-Item"],[1977,"impl-From%3CItemTrait%3E-for-Item"],[1978,"impl-From%3CItemExternCrate%3E-for-Item"],[1979,"impl-From%3CItemEnum%3E-for-Item"],[1980,"impl-From%3CItemFn%3E-for-Item"],[1996,"impl-From%3CUsePath%3E-for-UseTree"],[1997,"impl-From%3CUseRename%3E-for-UseTree"],[1999,"impl-From%3CUseGroup%3E-for-UseTree"],[2000,"impl-From%3CUseName%3E-for-UseTree"],[2001,"impl-From%3CUseGlob%3E-for-UseTree"],[2007,"impl-From%3CForeignItemMacro%3E-for-ForeignItem"],[2008,"impl-From%3CForeignItemStatic%3E-for-ForeignItem"],[2009,"impl-From%3CForeignItemType%3E-for-ForeignItem"],[2010,"impl-From%3CForeignItemFn%3E-for-ForeignItem"],[2016,"impl-From%3CTraitItemType%3E-for-TraitItem"],[2017,"impl-From%3CTraitItemMacro%3E-for-TraitItem"],[2018,"impl-From%3CTraitItemFn%3E-for-TraitItem"],[2019,"impl-From%3CTraitItemConst%3E-for-TraitItem"],[2026,"impl-From%3CImplItemConst%3E-for-ImplItem"],[2027,"impl-From%3CImplItemFn%3E-for-ImplItem"],[2028,"impl-From%3CImplItemMacro%3E-for-ImplItem"],[2029,"impl-From%3CImplItemType%3E-for-ImplItem"],[2036,"impl-From%3CPatType%3E-for-FnArg"],[2037,"impl-From%3CReceiver%3E-for-FnArg"],[2042,"impl-From%3CLitInt%3E-for-Lit"],[2043,"impl-From%3CLitByteStr%3E-for-Lit"],[2044,"impl-From%3CLitChar%3E-for-Lit"],[2045,"impl-From%3CLitFloat%3E-for-Lit"],[2046,"impl-From%3CLitBool%3E-for-Lit"],[2047,"impl-From%3CLitCStr%3E-for-Lit"],[2048,"impl-From%3CLitByte%3E-for-Lit"],[2049,"impl-From%3CLitStr%3E-for-Lit"],[2065,"impl-From%3CPatType%3E-for-Pat"],[2066,"impl-From%3CExprConst%3E-for-Pat"],[2067,"impl-From%3CPatWild%3E-for-Pat"],[2068,"impl-From%3CExprMacro%3E-for-Pat"],[2069,"impl-From%3CExprPath%3E-for-Pat"],[2070,"impl-From%3CExprLit%3E-for-Pat"],[2072,"impl-From%3CPatIdent%3E-for-Pat"],[2073,"impl-From%3CPatParen%3E-for-Pat"],[2074,"impl-From%3CPatReference%3E-for-Pat"],[2075,"impl-From%3CPatTuple%3E-for-Pat"],[2076,"impl-From%3CPatOr%3E-for-Pat"],[2077,"impl-From%3CExprRange%3E-for-Pat"],[2078,"impl-From%3CPatRest%3E-for-Pat"],[2079,"impl-From%3CPatStruct%3E-for-Pat"],[2080,"impl-From%3CPatSlice%3E-for-Pat"],[2081,"impl-From%3CPatTupleStruct%3E-for-Pat"],[2114,"impl-From%3CTypeArray%3E-for-Type"],[2115,"impl-From%3CTypeImplTrait%3E-for-Type"],[2116,"impl-From%3CTypePath%3E-for-Type"],[2117,"impl-From%3CTypeTraitObject%3E-for-Type"],[2118,"impl-From%3CTypeReference%3E-for-Type"],[2119,"impl-From%3CTypeSlice%3E-for-Type"],[2120,"impl-From%3CTypeParen%3E-for-Type"],[2121,"impl-From%3CTypeBareFn%3E-for-Type"],[2122,"impl-From%3CTypePtr%3E-for-Type"],[2123,"impl-From%3CTypeTuple%3E-for-Type"],[2124,"impl-From%3CTypeInfer%3E-for-Type"],[2125,"impl-From%3CTypeGroup%3E-for-Type"],[2126,"impl-From%3CTypeNever%3E-for-Type"],[2127,"impl-From%3CTypeMacro%3E-for-Type"],[2588,"impl-IntoIterator-for-Fields"],[2589,"impl-IntoIterator-for-%26mut+Fields"],[2590,"impl-IntoIterator-for-%26Fields"],[2813,"impl-LitStr"],[2814,"impl-Parse-for-LitStr"],[2975,"impl-Ident"],[2977,"impl-IdentFragment-for-Ident"],[4299,"impl-Debug-for-Error"],[4300,"impl-Display-for-Error"],[4301,"impl-Debug-for-ParseBuffer%3C\'a%3E"],[4302,"impl-Display-for-ParseBuffer%3C\'a%3E"],[4318,"impl-IntoIterator-for-%26Error"],[4319,"impl-IntoIterator-for-Error"],[4410,"impl-Extend%3CPair%3CT,+P%3E%3E-for-Punctuated%3CT,+P%3E"],[4411,"impl-Extend%3CT%3E-for-Punctuated%3CT,+P%3E"],[4423,"impl-FromIterator%3CPair%3CT,+P%3E%3E-for-Punctuated%3CT,+P%3E"],[4424,"impl-FromIterator%3CT%3E-for-Punctuated%3CT,+P%3E"],[4437,"impl-IntoIterator-for-%26Punctuated%3CT,+P%3E"],[4438,"impl-IntoIterator-for-Punctuated%3CT,+P%3E"],[4439,"impl-IntoIterator-for-%26mut+Punctuated%3CT,+P%3E"]]}],\ ["thiserror",{"doc":"github crates-io docs-rs","t":"Y","n":["Error"],"q":[[0,"thiserror"]],"d":[""],"i":[0],"f":"`","c":[],"p":[],"b":[]}],\ ["thiserror_impl",{"doc":"","t":"Y","n":["Error"],"q":[[0,"thiserror_impl"]],"d":[""],"i":[0],"f":"`","c":[],"p":[],"b":[]}],\ -["tracing",{"doc":"A scoped, structured logging and diagnostics system.","t":"TFTFTKFFFKTKTNNNNNNNNNNNNNNNNNNNNNQQNCNNNNNNNNNNMNQMNNNNNQQCMNQNQMNCNNNNNNNNNNNNNNNNNNNNNNQQCNXNNNNNNNNNNNNNNCNNNNNNNNMNNNNNMMNMNNNCQQCNNNNNQQNNNNNNNNNNNNNNQQFFFFNNNNNNHNHHNNNNNHFNNNNNNNNNNNNNNNNNNKFFFFFFKFKMNNNNNNNNNNNNNNNNNNNNNNNNNNHHNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNMNNNNNMNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNKFFKNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNTTTFTFSTTNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNKFFFFFFMNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNFFFFKNNNNNNNNNNNNNNNNNNNMNMNMNNMNNNNNNNNNNNNNNNNNNNNMNNMNMNNNHHNNNNNNNNNNNNNNNNNH","n":["DEBUG","Dispatch","ERROR","Event","INFO","Instrument","Level","Metadata","Span","Subscriber","TRACE","Value","WARN","as_str","borrow","borrow","borrow","borrow","borrow_mut","borrow_mut","borrow_mut","borrow_mut","callsite","clone","clone","clone","clone_into","clone_into","clone_into","clone_span","clone_span","cmp","current_span","current_span","debug","debug_span","default","dispatcher","downcast_raw","downcast_ref","downcast_ref","downcast_ref","downcast_ref","downcast_ref","downgrade","drop","drop_span","drop_span","enabled","enabled","enabled","enter","enter","eq","eq","eq","eq","error","error_span","event","event","event","event","event_enabled","event_enabled","exit","exit","field","fields","file","fmt","fmt","fmt","fmt","fmt","fmt","fmt","from","from","from","from","from","from_str","ge","ge","gt","gt","hash","hash","in_current_span","info","info_span","instrument","instrument","instrument","into","into","into","into","is","is","is","is","is","is_event","is_span","le","le","level","level_filters","line","lt","lt","max_level_hint","module_path","name","new","new","new_span","new_span","none","on_register_dispatch","partial_cmp","partial_cmp","record","record","record","record_follows_from","record_follows_from","register_callsite","register_callsite","span","span","span_enabled","subscriber","target","to_owned","to_owned","to_owned","to_string","trace","trace_span","try_close","try_close","try_from","try_from","try_from","try_from","try_into","try_into","try_into","try_into","type_id","type_id","type_id","type_id","warn","warn_span","DefaultGuard","Dispatch","SetGlobalDefaultError","WeakDispatch","borrow","borrow_mut","clone","clone_into","fmt","from","get_default","into","set_default","set_global_default","to_owned","try_from","try_into","type_id","upgrade","with_default","Event","borrow","borrow_mut","child_of","dispatch","fields","fmt","from","into","is_contextual","is_root","metadata","new","new_child_of","parent","record","try_from","try_into","type_id","AsField","DebugValue","DisplayValue","Empty","Field","FieldSet","Iter","Value","ValueSet","Visit","as_field","as_field","as_field","as_ref","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","callsite","callsite","clone","clone","clone","clone_into","clone_into","clone_into","contains","debug","display","eq","eq","eq","field","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","from","from","from","from","from","from","from","hash","into","into","into","into","into","into","into","into_iter","into_iter","is_empty","is_empty","iter","len","len","name","new","next","record","record","record","record","record","record_bool","record_debug","record_error","record_f64","record_i128","record_i64","record_str","record_u128","record_u64","to_owned","to_owned","to_owned","to_string","to_string","to_string","to_string","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_into","try_into","try_into","try_into","try_into","try_into","try_into","type_id","type_id","type_id","type_id","type_id","type_id","type_id","Instrument","Instrumented","WithDispatch","WithSubscriber","borrow","borrow","borrow_mut","borrow_mut","clone","clone","clone_into","clone_into","dispatcher","drop","fmt","fmt","from","from","in_current_span","inner","inner","inner_mut","inner_mut","inner_pin_mut","inner_pin_mut","inner_pin_ref","inner_pin_ref","instrument","into","into","into_future","into_future","into_inner","into_inner","poll","poll","span","span_mut","to_owned","to_owned","try_from","try_from","try_into","try_into","type_id","type_id","with_current_subscriber","with_subscriber","DEBUG","ERROR","INFO","LevelFilter","OFF","ParseLevelFilterError","STATIC_MAX_LEVEL","TRACE","WARN","borrow","borrow","borrow_mut","borrow_mut","clone","clone","clone_into","clone_into","cmp","current","eq","eq","fmt","fmt","fmt","fmt","from","from","from","from","from_level","from_str","ge","ge","gt","gt","hash","into","into","into_level","le","le","lt","lt","partial_cmp","partial_cmp","to_owned","to_owned","to_string","to_string","try_from","try_from","try_into","try_into","type_id","type_id","AsId","Attributes","Entered","EnteredSpan","Id","Record","Span","as_id","borrow","borrow","borrow","borrow","borrow","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","child_of","child_of","clone","clone_into","contains","contains","current","deref","drop","drop","enter","entered","eq","exit","field","fields","fmt","fmt","fmt","fmt","fmt","follows_from","from","from","from","from","from","from_non_zero_u64","from_u64","has_field","hash","id","id","in_scope","into","into","into","into","into","into_non_zero_u64","into_u64","is_contextual","is_disabled","is_empty","is_empty","is_none","is_root","len","metadata","metadata","new","new","new","new_disabled","new_root","new_root","none","or_current","parent","record","record","record","record_all","to_owned","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","values","with_subscriber","DefaultGuard","Interest","NoSubscriber","SetGlobalDefaultError","Subscriber","always","borrow","borrow","borrow","borrow","borrow_mut","borrow_mut","borrow_mut","borrow_mut","clone","clone","clone_into","clone_into","clone_span","current_span","default","downcast_raw","drop","drop_span","enabled","enabled","enter","enter","event","event","event_enabled","exit","exit","fmt","fmt","fmt","fmt","fmt","from","from","from","from","into","into","into","into","is_always","is_never","is_sometimes","max_level_hint","never","new","new_span","new_span","on_register_dispatch","record","record","record_follows_from","record_follows_from","register_callsite","register_callsite","set_default","set_global_default","sometimes","to_owned","to_owned","to_string","try_close","try_from","try_from","try_from","try_from","try_into","try_into","try_into","try_into","type_id","type_id","type_id","type_id","with_default"],"q":[[0,"tracing"],[158,"tracing::dispatcher"],[178,"tracing::event"],[197,"tracing::field"],[318,"tracing::instrument"],[366,"tracing::level_filters"],[421,"tracing::span"],[520,"tracing::subscriber"],[601,"tracing_core::callsite"],[602,"core::cmp"],[603,"tracing_core::span"],[604,"core::any"],[605,"core::option"],[606,"core::any"],[607,"core::fmt"],[608,"core::fmt"],[609,"core::marker"],[610,"core::hash"],[611,"tracing_core::metadata"],[612,"core::ops::function"],[613,"core::ops::function"],[614,"core::clone"],[615,"core::fmt"],[616,"core::marker"],[617,"core::pin"],[618,"core::task::wake"],[619,"core::task::poll"],[620,"core::future::future"],[621,"core::num::nonzero"]],"d":["The “debug” level.","Dispatch trace data to a Subscriber.","The “error” level.","Events represent single points in time where something …","The “info” level.","Attaches spans to a std::future::Future.","Describes the level of verbosity of a span or event.","Metadata describing a span or event.","A handle representing a span, with the capability to enter …","Trait representing the functions required to collect trace …","The “trace” level.","A field value of an erased type.","The “warn” level.","Returns the string representation of the Level.","","","","","","","","","Returns an opaque Identifier that uniquely identifies the …","","","","","","","Notifies the subscriber that a span ID has been cloned.","Notifies the subscriber that a span ID has been cloned.","","Returns a type representing this subscriber’s view of …","Returns a type representing this subscriber’s view of …","Constructs an event at the debug level.","Constructs a span at the debug level.","Returns the current default dispatcher","Dispatches trace events to Subscribers.","If self is the same type as the provided TypeId, returns …","Returns some reference to this Subscriber value if it is …","Returns some reference to this Subscriber value if it is …","Returns some reference to this [Subscriber…","Returns some reference to this Subscriber value if it is …","Returns some reference to the Subscriber this Dispatch …","Creates a WeakDispatch from this Dispatch.","","This method is deprecated.","Notifies the subscriber that a span ID has been dropped.","Returns true if a span or event with the specified metadata…","Returns true if a span with the specified metadata would be","Checks whether a span or event is enabled based on the …","Records that a span has been entered.","Records that a span has been can_enter.","","","","","Constructs an event at the error level.","Constructs a span at the error level.","Events represent single points in time during the …","Records that an Event has occurred.","Records that an Event has occurred.","Constructs a new Event.","Determine if an Event should be recorded.","Tests whether an event with the specified level and target …","Records that a span has been exited.","Records that a span has been exited.","Span and Event key-value data.","Returns the names of the fields on the described span or …","Returns the name of the source code file where the span …","","","","","","","","Returns the argument unchanged.","Returns the argument unchanged.","","Returns the argument unchanged.","Returns the argument unchanged.","","","","","","","","Instruments this type with the current Span, returning an …","Constructs an event at the info level.","Constructs a span at the info level.","Attach a span to a std::future::Future.","Instruments this type with the provided Span, returning an …","Instruments a function to create and enter a tracing span …","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Returns true if this Subscriber is the same type as T.","Returns true if this Subscriber is the same type as T.","Returns true if this Subscriber is the same type as T.","Returns true if this Subscriber is the same type as T.","Returns true if this Dispatch forwards to a Subscriber of …","Returns true if the callsite kind is Event.","Return true if the callsite kind is Span.","","","Returns the level of verbosity of the described span or …","Trace verbosity level filtering.","Returns the line number in the source code file where the …","","","Returns the highest verbosity level that this Subscriber …","Returns the path to the Rust module where the span …","Returns the name of the span.","Construct new metadata for a span or event, with a name, …","Returns a Dispatch that forwards to the given Subscriber.","Visit the construction of a new span, returning a new span …","Record the construction of a new span, returning a new ID …","Returns a new Dispatch that discards events and spans.","Invoked when this subscriber becomes a Dispatch.","","","Visits this value with the given Visitor.","Record a set of values on a span.","Record a set of values on a span.","Adds an indication that span follows from the span with …","Adds an indication that span follows from the span with …","Registers a new callsite with this subscriber, returning …","Registers a new callsite with this subscriber, returning …","Spans represent periods of time in which a program was …","Constructs a new span.","Tests whether a span with the specified level and target …","Collects and records trace data.","Returns a string describing the part of the system where …","","","","","Constructs an event at the trace level.","Constructs a span at the trace level.","Notifies the subscriber that a span ID has been dropped, …","Notifies the subscriber that a span ID has been dropped, …","","","","","","","","","","","","","Constructs an event at the warn level.","Constructs a span at the warn level.","A guard that resets the current default dispatcher to the …","Dispatch trace data to a Subscriber.","Returned if setting the global dispatcher fails.","WeakDispatch is a version of Dispatch that holds a …","","","","","","Returns the argument unchanged.","Executes a closure with a reference to this thread’s …","Calls U::from(self).","Sets the dispatch as the default dispatch for the duration …","Sets this dispatch as the global default for the duration …","","","","","Attempts to upgrade this WeakDispatch to a Dispatch.","Sets this dispatch as the default for the duration of a …","Events represent single points in time where something …","","","Constructs a new Event with the specified metadata and set …","Constructs a new Event with the specified metadata and set …","Returns an iterator over the set of values on this Event.","","Returns the argument unchanged.","Calls U::from(self).","Returns true if the new event’s parent should be …","Returns true if the new event should be a root.","Returns metadata describing this Event.","Returns a new Event in the current span, with the …","Returns a new Event as a child of the specified span, with …","Returns the new event’s explicitly-specified parent, if …","Visits all the fields on this Event with the specified …","","","","Trait implemented to allow a type to be used as a field …","A Value which serializes as a string using fmt::Debug.","A Value which serializes using fmt::Display.","An empty field.","An opaque key allowing O(1) access to a field in a Span’…","Describes the fields present on a span.","An iterator over a set of fields.","A field value of an erased type.","A set of fields and values for a span.","Visits typed values.","Attempts to convert &self into a Field with the specified …","","","","","","","","","","","","","","","","","","Returns an Identifier that uniquely identifies the Callsite","Returns an Identifier that uniquely identifies the Callsite","","","","","","","Returns true if self contains the given field.","Wraps a type implementing fmt::Debug as a Value that can be","Wraps a type implementing fmt::Display as a Value that can …","","","","Returns the Field named name, or None if no such field …","","","","","","","","","","","","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","","","Returns whether or not this FieldSet has fields.","Returns true if this ValueSet contains no values.","Returns an iterator over the Fields in this FieldSet.","Returns the number of fields in this FieldSet.","Returns the number of fields in this ValueSet that would …","Returns a string representing the name of the field.","Constructs a new FieldSet with the given array of field …","","Visits this value with the given Visitor.","Visits all the fields in this ValueSet with the provided …","","","","Visit a boolean value.","Visit a value implementing fmt::Debug.","Records a type implementing Error.","Visit a double-precision floating point value.","Visit a signed 128-bit integer value.","Visit a signed 64-bit integer value.","Visit a string value.","Visit an unsigned 128-bit integer value.","Visit an unsigned 64-bit integer value.","","","","","","","","","","","","","","","","","","","","","","","","","","","","","Attaches spans to a std::future::Future.","A Future that has been instrumented with a tracing Span.","A Future that has been instrumented with a tracing …","Extension trait allowing futures to be instrumented with a …","","","","","","","","","Borrows the Dispatch that is entered when this type is …","","","","Returns the argument unchanged.","Returns the argument unchanged.","Instruments this type with the current Span, returning an …","Borrows the wrapped type.","Borrows the wrapped type.","Mutably borrows the wrapped type.","Mutably borrows the wrapped type.","Get a pinned mutable reference to the wrapped type.","Get a pinned mutable reference to the wrapped type.","Get a pinned reference to the wrapped type.","Get a pinned reference to the wrapped type.","Instruments this type with the provided Span, returning an …","Calls U::from(self).","Calls U::from(self).","","","Consumes the Instrumented, returning the wrapped type.","Consumes the Instrumented, returning the wrapped type.","","","Borrows the Span that this type is instrumented by.","Mutably borrows the Span that this type is instrumented by.","","","","","","","","","Attaches the current default Subscriber to this type, …","Attaches the provided Subscriber to this type, returning a …","The “debug” level.","The “error” level.","The “info” level.","A filter comparable to a verbosity Level.","The “off” level.","Indicates that a string could not be parsed to a valid …","The statically configured maximum trace level.","The “trace” level.","The “warn” level.","","","","","","","","","","Returns a LevelFilter that matches the most verbose Level …","","","","","","","","","Returns the argument unchanged.","Returns the argument unchanged.","Returns a LevelFilter that enables spans and events with …","","","","","","","Calls U::from(self).","Calls U::from(self).","Returns the most verbose Level that this filter accepts, …","","","","","","","","","","","","","","","","","Trait implemented by types which have a span Id.","Attributes provided to a Subscriber describing a new span …","A guard representing a span which has been entered and is …","An owned version of Entered, a guard representing a span …","Identifies a span within the context of a subscriber.","A set of fields recorded by a span.","A handle representing a span, with the capability to enter …","Returns the Id of the span that self corresponds to, or …","","","","","","","","","","","Constructs a new Span as child of the given parent span, …","Returns Attributes describing a new child span of the …","","","Returns true if this set of Attributes contains a value …","Returns true if this Record contains a value for the given …","Returns a handle to the span considered by the Subscriber …","","","","Enters this span, returning a guard that will exit the …","Enters this span, consuming it and returning a guard that …","","Exits this span, returning the underlying Span.","Returns a Field for the field with the given name, if one …","Returns the set of all fields defined by this span’s …","","","","","","Indicates that the span with the given ID has an indirect …","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Constructs a new span ID from the given NonZeroU64.","Constructs a new span ID from the given u64.","Returns true if this Span has a field for the given Field …","","Returns this span’s Id, if it is enabled.","Returns this span’s Id, if it is enabled.","Executes the given function in the context of this span.","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Returns the span’s ID as a NonZeroU64.","Returns the span’s ID as a u64.","Returns true if the new span’s parent should be …","Returns true if this span was disabled by the subscriber …","Returns true if this set of Attributes contains no values.","Returns true if this Record contains no values.","Returns true if this span was constructed by Span::none …","Returns true if the new span should be a root.","Returns the number of fields that would be visited from …","Returns this span’s Metadata, if it is enabled.","Returns a reference to the new span’s metadata.","Constructs a new Span with the given metadata and set of …","Returns Attributes describing a new child span of the …","Constructs a new Record from a ValueSet.","Constructs a new disabled span with the given Metadata.","Constructs a new Span as the root of its own trace tree, …","Returns Attributes describing a new span at the root of …","Constructs a new span that is completely disabled.","Returns this span, if it was enabled by the current …","Returns the new span’s explicitly-specified parent, if …","Records that the field described by field has the value …","Records all the fields in this set of Attributes with the …","Records all the fields in this Record with the provided …","Records all the fields in the provided ValueSet.","","","","","","","","","","","","","","","","","Returns a reference to a ValueSet containing any values …","Invokes a function with a reference to this span’s ID …","A guard that resets the current default dispatcher to the …","Indicates a Subscriber’s interest in a particular …","A no-op Subscriber.","Returned if setting the global dispatcher fails.","Trait representing the functions required to collect trace …","Returns an Interest indicating the subscriber is always …","","","","","","","","","","","","","Notifies the subscriber that a span ID has been cloned.","Returns a type representing this subscriber’s view of …","","If self is the same type as the provided TypeId, returns …","","This method is deprecated.","Returns true if a span or event with the specified metadata…","","Records that a span has been entered.","","Records that an Event has occurred.","","Determine if an Event should be recorded.","Records that a span has been exited.","","","","","","","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).","Returns true if the subscriber is always interested in …","Returns true if the subscriber is never interested in …","Returns true if the subscriber is sometimes interested in …","Returns the highest verbosity level that this Subscriber …","Returns an Interest indicating that the subscriber is …","Returns a new NoSubscriber.","Visit the construction of a new span, returning a new span …","","Invoked when this subscriber becomes a Dispatch.","Record a set of values on a span.","","Adds an indication that span follows from the span with …","","Registers a new callsite with this subscriber, returning …","","Sets the Subscriber as the default for the current thread …","Sets this subscriber as the global default for the …","Returns an Interest indicating the subscriber is sometimes …","","","","Notifies the subscriber that a span ID has been dropped, …","","","","","","","","","","","","","Sets this Subscriber as the default for the current thread …"],"i":[1,0,1,0,1,0,0,0,0,0,1,0,1,1,5,3,6,1,5,3,6,1,3,5,6,1,5,6,1,8,6,1,8,6,0,0,6,0,8,8,8,8,8,6,6,5,8,6,8,6,0,8,6,5,3,1,1,0,0,0,8,6,0,8,0,8,6,0,3,3,20,20,5,3,6,1,1,5,3,6,6,1,1,1,1,1,1,5,1,29,0,0,0,29,0,5,3,6,1,8,8,8,8,6,3,3,1,1,3,0,3,1,1,8,3,3,3,6,8,6,6,8,1,1,20,8,6,8,6,8,6,0,0,0,0,3,5,6,1,1,0,0,8,6,5,3,6,1,5,3,6,1,5,3,6,1,0,0,0,0,0,0,15,15,15,15,15,15,0,15,0,0,15,15,15,15,15,0,0,18,18,18,18,18,18,18,18,18,18,18,18,18,18,18,18,18,18,0,0,0,0,0,0,0,0,0,0,47,34,34,34,19,44,34,53,46,48,51,19,44,34,53,46,48,51,44,34,34,48,51,34,48,51,19,0,0,19,34,53,19,19,19,44,44,34,34,53,46,48,48,51,19,44,34,53,46,48,51,34,19,44,34,53,46,48,51,19,46,19,44,19,19,44,34,19,46,20,44,53,48,51,35,35,35,35,35,35,35,35,35,34,48,51,19,44,34,48,19,44,34,53,46,48,51,19,44,34,53,46,48,51,19,44,34,53,46,48,51,0,0,0,0,64,30,64,30,64,30,64,30,64,30,64,30,64,30,29,64,30,64,30,64,30,64,30,29,64,30,64,30,64,30,64,30,30,30,64,30,64,30,64,30,64,30,69,69,17,17,17,0,17,0,0,17,17,17,70,17,70,17,70,17,70,17,17,17,17,17,17,70,70,17,17,17,70,17,17,17,17,17,17,17,17,70,17,17,17,17,17,17,17,17,70,17,70,17,70,17,70,17,70,0,0,0,0,0,0,0,71,73,72,9,33,36,73,72,9,33,36,5,33,9,9,33,36,5,72,73,72,5,5,9,72,5,33,73,72,9,33,36,5,73,72,9,33,36,9,9,5,9,5,72,5,73,72,9,33,36,9,9,33,5,33,36,5,33,36,5,33,5,33,36,5,5,33,5,5,33,5,33,36,5,9,73,72,9,33,36,73,72,9,33,36,73,72,9,33,36,33,5,0,0,0,0,0,37,42,41,37,76,42,41,37,76,37,76,37,76,8,8,76,8,41,8,8,76,8,76,8,76,8,8,76,42,42,41,37,76,42,41,37,76,42,41,37,76,37,37,37,8,37,76,8,76,8,8,76,8,76,8,76,0,0,37,37,76,42,8,42,41,37,76,42,41,37,76,42,41,37,76,0],"f":"`````````````{bd}{ce{}{}}0000000{fh}{jj}{ll}{bb}{{ce}n{}{}}00{{A`Ab}Ab}{{lAb}Ab}{{bb}Ad}{A`Af}{lAf}``{{}l}`{{A`Ah}{{Aj{n}}}}{A`{{Aj{c}}}Al}000{l{{Aj{c}}}Al}{lAn}{jn}{{A`Ab}n}{{lAb}n}{{A`f}B`}{{lf}B`}`32{{jj}B`}{{ff}B`}{{bb}B`}{{bBb}B`}```{{A`Bd}n}{{lBd}n}`{{A`Bd}B`}`:9`{fBf}{f{{Aj{d}}}}{{BhBj}{{Bn{nBl}}}}0{{jBj}C`}{{fBj}{{Bn{nBl}}}}{{lBj}{{Bn{nBl}}}}{{bBj}{{Bn{nBl}}}}0{cc{}}0{cl{A`CbCd}}11{d{{Bn{bCf}}}}>=>={{jc}nCh}{{bc}nCh}{Cj{{Cl{Cj}}}}```{{Cjj}{{Cl{Cj}}}}`{ce{}{}}000{A`B`}000{lB`}{fB`}0{{bb}B`}{{bBb}B`}{fb}`{f{{Aj{Cn}}}}32{A`{{Aj{Bb}}}}{f{{Aj{d}}}}{fd}{{ddb{Aj{d}}{Aj{Cn}}{Aj{d}}BfD`}f}{cl{A`CbCd}}{{A`Db}Ab}{{lDb}Ab}{{}l}{{A`l}n}{{bBb}{{Aj{Ad}}}}{{bb}{{Aj{Ad}}}}{{BhDdDf}n}{{A`AbDh}n}{{lAbDh}n}{{A`AbAb}n}{{lAbAb}n}{{A`f}Dj}{{lf}Dj}````?{ce{}{}}00{cDl{}}``{{A`Ab}B`}{{lAb}B`}{c{{Bn{e}}}{}{}}0000000{cAh{}}000``````55{AnAn}{{ce}n{}{}}{{AnBj}{{Bn{nBl}}}}{cc{}}{ec{}{{E`{l}{{Dn{c}}}}}}:{lEb}{l{{Bn{nEd}}}}<887{An{{Aj{l}}}}{{le}c{}{{Ef{}{{Dn{c}}}}}}`>>{{cfEh}n{{Ej{{Aj{Ab}}}}}}{{fEh}n}{BdEl}{{BdBj}{{Bn{nBl}}}}9{ce{}{}}{BdB`}0{Bdf}{{fEh}Bd}{{cfEh}Bd{{Ej{{Aj{Ab}}}}}}{Bd{{Aj{Ab}}}}{{BdDf}n}{c{{Bn{e}}}{}{}}0{cAh{}}``````````{{Enf}{{Aj{Dd}}}}{{Ddf}{{Aj{Dd}}}}0{Ddd};;;;;;;;;;;;;;{Ehh}{Ddh}{DdDd}{{{F`{c}}}{{F`{c}}}{FbFd}}{{{Ff{c}}}{{Ff{c}}}{FbFh}}{{ce}n{}{}}00{{BfDd}B`}{c{{Ff{c}}}Fh}{c{{F`{c}}}Fd}{{BfBf}B`}{{DdDd}B`}{{FjFj}B`}{{Bfc}{{Aj{Dd}}}{{Fl{d}}Fn}}{{BfBj}{{Bn{nBl}}}}0{{EhBj}{{Bn{nBl}}}}0{{DdBj}{{Bn{nBl}}}}0{{FjBj}{{Bn{nBl}}}}{{ElBj}{{Bn{nBl}}}}{{{F`{c}}Bj}{{Bn{nBl}}}Fd}0{{{Ff{c}}Bj}{{Bn{nBl}}}Fh}{cc{}}000000{{Ddc}nCh}{ce{}{}}000000{Bf}1{BfB`}{EhB`}{BfEl}{BfG`}{EhG`}{Ddd}{{{Gb{d}}h}Bf}{El{{Aj{Dd}}}}{{BhDdDf}n}{{EhDf}n}{{FjDdDf}n}{{{F`{c}}DdDf}nFd}{{{Ff{c}}DdDf}nFh}{{DfDdB`}n}{{DfDdFh}n}{{DfDdGd}n}{{DfDdGf}n}{{DfDdGh}n}{{DfDdGj}n}{{DfDdd}n}{{DfDdGl}n}{{DfDdGn}n}{ce{}{}}00{cDl{}}000{c{{Bn{e}}}{}{}}0000000000000{cAh{}}000000````3333{{{H`{c}}}{{H`{c}}}Fb}{{{Cl{c}}}{{Cl{c}}}Fb}{{ce}n{}{}}0{{{H`{c}}}l{}}{{{Cl{c}}}n{}}{{{H`{c}}Bj}C`Fh}{{{Cl{c}}Bj}C`Fh}{cc{}}0{Cj{{Cl{Cj}}}}{{{H`{c}}}c{}}{{{Cl{c}}}c{}}10{{{Hb{{H`{c}}}}}{{Hb{c}}}{}}{{{Hb{{Cl{c}}}}}{{Hb{c}}}{}}10{{Cjj}{{Cl{Cj}}}}{ce{}{}}0{c{}{}}065{{{Hb{{H`{c}}}}Hd}{{Hf{e}}}Hh{}}{{{Hb{{Cl{c}}}}Hd}{{Hf{e}}}Hh{}}{{{Cl{c}}}j{}}044{c{{Bn{e}}}{}{}}000{cAh{}}0{Hj{{H`{Hj}}}}{{Hjc}{{H`{Hj}}}{{Ej{l}}}}`````````8888{BbBb}{HlHl}{{ce}n{}{}}0{{BbBb}Ad}{{}Bb}{{BbBb}B`}{{Bbb}B`}{{BbBj}{{Bn{nBl}}}}0{{HlBj}{{Bn{nBl}}}}0{{{Aj{b}}}Bb}{bBb}{cc{}}01{d{{Bn{Bb}}}}7676{{Bbc}nCh}{ce{}{}}0{Bb{{Aj{b}}}}9:9:{{Bbb}{{Aj{Ad}}}}{{BbBb}{{Aj{Ad}}}}33{cDl{}}0{c{{Bn{e}}}{}{}}000{cAh{}}0```````{Hn{{Aj{Ab}}}}7777777777{{cfEh}j{{Ej{{Aj{Ab}}}}}}{{AbfEh}Db}{AbAb}{{ce}n{}{}}{{DbDd}B`}{{DhDd}B`}{{}j}{I`j}{Ibn}{I`n}{jIb}{jI`}{{AbAb}B`}5{{jc}{{Aj{Dd}}}{EnFn}}{DbBf}{{IbBj}C`}{{I`Bj}C`}{{AbBj}{{Bn{nBl}}}}{{DbBj}{{Bn{nBl}}}}{{DhBj}{{Bn{nBl}}}}{{jc}j{{Ej{{Aj{Ab}}}}}}{cc{}}0000{{{Id{Gn}}}Ab}{GnAb}{{jc}B`{EnFn}}{{Abc}nCh}{j{{Aj{Ab}}}}{I`{{Aj{Ab}}}}{{je}c{}{{Ef{}{{Dn{c}}}}}}{ce{}{}}0000{Ab{{Id{Gn}}}}{AbGn}{DbB`}{jB`}1{DhB`}12{DhG`}{j{{Aj{f}}}}{Dbf}{{fEh}j}{{fEh}Db}{EhDh}{fj}32{{}j}{jj}{Db{{Aj{Ab}}}}{{jce}j{EnFn}Bh}{{DbDf}n}{{DhDf}n}{{jEh}j}{ce{}{}}{c{{Bn{e}}}{}{}}000000000{cAh{}}0000{DbEh}{{je}{{Aj{c}}}{}{{Ef{{If{Abl}}}{{Dn{c}}}}}}`````{{}Dj}55555555{DjDj}{IhIh}{{ce}n{}{}}0{{A`Ab}Ab}{A`Af}{{}Ih}{{A`Ah}{{Aj{n}}}}{Ebn}{{A`Ab}n}{{A`f}B`}{{Ihf}B`}2{{IhAb}n}{{A`Bd}n}{{IhBd}n}{{A`Bd}B`}63{{EdBj}{{Bn{nBl}}}}0{{EbBj}{{Bn{nBl}}}}{{DjBj}{{Bn{nBl}}}}{{IhBj}{{Bn{nBl}}}}{cc{}}000{ce{}{}}000{DjB`}00{A`{{Aj{Bb}}}}{{}Dj}{{}Ih}{{A`Db}Ab}{{IhDb}Ab}{{A`l}n}{{A`AbDh}n}{{IhAbDh}n}{{A`AbAb}n}{{IhAbAb}n}{{A`f}Dj}{{Ihf}Dj}{cEb{A`CbCd}}{c{{Bn{nEd}}}{A`CbCd}}Dispatch trace data to a Subscriber.","The “error” level.","Events represent single points in time where something …","The “info” level.","Attaches spans to a std::future::Future.","Describes the level of verbosity of a span or event.","Metadata describing a span or event.","A handle representing a span, with the capability to enter …","Trait representing the functions required to collect trace …","The “trace” level.","A field value of an erased type.","The “warn” level.","Returns the string representation of the Level.","","","","","","","","","Returns an opaque Identifier that uniquely identifies the …","","","","","","","Notifies the subscriber that a span ID has been cloned.","Notifies the subscriber that a span ID has been cloned.","","Returns a type representing this subscriber’s view of …","Returns a type representing this subscriber’s view of …","Constructs an event at the debug level.","Constructs a span at the debug level.","Returns the current default dispatcher","Dispatches trace events to Subscribers.","If self is the same type as the provided TypeId, returns …","Returns some reference to this Subscriber value if it is …","Returns some reference to this Subscriber value if it is …","Returns some reference to this [Subscriber…","Returns some reference to this Subscriber value if it is …","Returns some reference to the Subscriber this Dispatch …","Creates a WeakDispatch from this Dispatch.","","This method is deprecated.","Notifies the subscriber that a span ID has been dropped.","Returns true if a span or event with the specified metadata…","Returns true if a span with the specified metadata would be","Checks whether a span or event is enabled based on the …","Records that a span has been entered.","Records that a span has been can_enter.","","","","","Constructs an event at the error level.","Constructs a span at the error level.","Events represent single points in time during the …","Records that an Event has occurred.","Records that an Event has occurred.","Constructs a new Event.","Determine if an Event should be recorded.","Tests whether an event with the specified level and target …","Records that a span has been exited.","Records that a span has been exited.","Span and Event key-value data.","Returns the names of the fields on the described span or …","Returns the name of the source code file where the span …","","","","","","","","Returns the argument unchanged.","Returns the argument unchanged.","","Returns the argument unchanged.","Returns the argument unchanged.","","","","","","","","Instruments this type with the current Span, returning an …","Constructs an event at the info level.","Constructs a span at the info level.","Attach a span to a std::future::Future.","Instruments this type with the provided Span, returning an …","Instruments a function to create and enter a tracing span …","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Returns true if this Subscriber is the same type as T.","Returns true if this Subscriber is the same type as T.","Returns true if this Subscriber is the same type as T.","Returns true if this Subscriber is the same type as T.","Returns true if this Dispatch forwards to a Subscriber of …","Returns true if the callsite kind is Event.","Return true if the callsite kind is Span.","","","Returns the level of verbosity of the described span or …","Trace verbosity level filtering.","Returns the line number in the source code file where the …","","","Returns the highest verbosity level that this Subscriber …","Returns the path to the Rust module where the span …","Returns the name of the span.","Construct new metadata for a span or event, with a name, …","Returns a Dispatch that forwards to the given Subscriber.","Visit the construction of a new span, returning a new span …","Record the construction of a new span, returning a new ID …","Returns a new Dispatch that discards events and spans.","Invoked when this subscriber becomes a Dispatch.","","","Visits this value with the given Visitor.","Record a set of values on a span.","Record a set of values on a span.","Adds an indication that span follows from the span with …","Adds an indication that span follows from the span with …","Registers a new callsite with this subscriber, returning …","Registers a new callsite with this subscriber, returning …","Spans represent periods of time in which a program was …","Constructs a new span.","Tests whether a span with the specified level and target …","Collects and records trace data.","Returns a string describing the part of the system where …","","","","","Constructs an event at the trace level.","Constructs a span at the trace level.","Notifies the subscriber that a span ID has been dropped, …","Notifies the subscriber that a span ID has been dropped, …","","","","","","","","","","","","","Constructs an event at the warn level.","Constructs a span at the warn level.","A guard that resets the current default dispatcher to the …","Dispatch trace data to a Subscriber.","Returned if setting the global dispatcher fails.","WeakDispatch is a version of Dispatch that holds a …","","","","","","Returns the argument unchanged.","Executes a closure with a reference to this thread’s …","Calls U::from(self).","Sets the dispatch as the default dispatch for the duration …","Sets this dispatch as the global default for the duration …","","","","","Attempts to upgrade this WeakDispatch to a Dispatch.","Sets this dispatch as the default for the duration of a …","Events represent single points in time where something …","","","Constructs a new Event with the specified metadata and set …","Constructs a new Event with the specified metadata and set …","Returns an iterator over the set of values on this Event.","","Returns the argument unchanged.","Calls U::from(self).","Returns true if the new event’s parent should be …","Returns true if the new event should be a root.","Returns metadata describing this Event.","Returns a new Event in the current span, with the …","Returns a new Event as a child of the specified span, with …","Returns the new event’s explicitly-specified parent, if …","Visits all the fields on this Event with the specified …","","","","Trait implemented to allow a type to be used as a field …","A Value which serializes as a string using fmt::Debug.","A Value which serializes using fmt::Display.","An empty field.","An opaque key allowing O(1) access to a field in a Span’…","Describes the fields present on a span.","An iterator over a set of fields.","A field value of an erased type.","A set of fields and values for a span.","Visits typed values.","Attempts to convert &self into a Field with the specified …","","","","","","","","","","","","","","","","","","Returns an Identifier that uniquely identifies the Callsite","Returns an Identifier that uniquely identifies the Callsite","","","","","","","Returns true if self contains the given field.","Wraps a type implementing fmt::Debug as a Value that can be","Wraps a type implementing fmt::Display as a Value that can …","","","","Returns the Field named name, or None if no such field …","","","","","","","","","","","","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","","","Returns whether or not this FieldSet has fields.","Returns true if this ValueSet contains no values.","Returns an iterator over the Fields in this FieldSet.","Returns the number of fields in this FieldSet.","Returns the number of fields in this ValueSet that would …","Returns a string representing the name of the field.","Constructs a new FieldSet with the given array of field …","","Visits this value with the given Visitor.","Visits all the fields in this ValueSet with the provided …","","","","Visit a boolean value.","Visit a value implementing fmt::Debug.","Records a type implementing Error.","Visit a double-precision floating point value.","Visit a signed 128-bit integer value.","Visit a signed 64-bit integer value.","Visit a string value.","Visit an unsigned 128-bit integer value.","Visit an unsigned 64-bit integer value.","","","","","","","","","","","","","","","","","","","","","","","","","","","","","Attaches spans to a std::future::Future.","A Future that has been instrumented with a tracing Span.","A Future that has been instrumented with a tracing …","Extension trait allowing futures to be instrumented with a …","","","","","","","","","Borrows the Dispatch that is entered when this type is …","","","","Returns the argument unchanged.","Returns the argument unchanged.","Instruments this type with the current Span, returning an …","Borrows the wrapped type.","Borrows the wrapped type.","Mutably borrows the wrapped type.","Mutably borrows the wrapped type.","Get a pinned mutable reference to the wrapped type.","Get a pinned mutable reference to the wrapped type.","Get a pinned reference to the wrapped type.","Get a pinned reference to the wrapped type.","Instruments this type with the provided Span, returning an …","Calls U::from(self).","Calls U::from(self).","","","Consumes the Instrumented, returning the wrapped type.","Consumes the Instrumented, returning the wrapped type.","","","Borrows the Span that this type is instrumented by.","Mutably borrows the Span that this type is instrumented by.","","","","","","","","","Attaches the current default Subscriber to this type, …","Attaches the provided Subscriber to this type, returning a …","The “debug” level.","The “error” level.","The “info” level.","A filter comparable to a verbosity Level.","The “off” level.","Indicates that a string could not be parsed to a valid …","The statically configured maximum trace level.","The “trace” level.","The “warn” level.","","","","","","","","","","Returns a LevelFilter that matches the most verbose Level …","","","","","","","","Returns the argument unchanged.","","Returns the argument unchanged.","Returns a LevelFilter that enables spans and events with …","","","","","","","Calls U::from(self).","Calls U::from(self).","Returns the most verbose Level that this filter accepts, …","","","","","","","","","","","","","","","","","Trait implemented by types which have a span Id.","Attributes provided to a Subscriber describing a new span …","A guard representing a span which has been entered and is …","An owned version of Entered, a guard representing a span …","Identifies a span within the context of a subscriber.","A set of fields recorded by a span.","A handle representing a span, with the capability to enter …","Returns the Id of the span that self corresponds to, or …","","","","","","","","","","","Constructs a new Span as child of the given parent span, …","Returns Attributes describing a new child span of the …","","","Returns true if this set of Attributes contains a value …","Returns true if this Record contains a value for the given …","Returns a handle to the span considered by the Subscriber …","","","","Enters this span, returning a guard that will exit the …","Enters this span, consuming it and returning a guard that …","","Exits this span, returning the underlying Span.","Returns a Field for the field with the given name, if one …","Returns the set of all fields defined by this span’s …","","","","","","Indicates that the span with the given ID has an indirect …","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Constructs a new span ID from the given NonZeroU64.","Constructs a new span ID from the given u64.","Returns true if this Span has a field for the given Field …","","Returns this span’s Id, if it is enabled.","Returns this span’s Id, if it is enabled.","Executes the given function in the context of this span.","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Returns the span’s ID as a NonZeroU64.","Returns the span’s ID as a u64.","Returns true if the new span’s parent should be …","Returns true if this span was disabled by the subscriber …","Returns true if this set of Attributes contains no values.","Returns true if this Record contains no values.","Returns true if this span was constructed by Span::none …","Returns true if the new span should be a root.","Returns the number of fields that would be visited from …","Returns this span’s Metadata, if it is enabled.","Returns a reference to the new span’s metadata.","Constructs a new Span with the given metadata and set of …","Returns Attributes describing a new child span of the …","Constructs a new Record from a ValueSet.","Constructs a new disabled span with the given Metadata.","Constructs a new Span as the root of its own trace tree, …","Returns Attributes describing a new span at the root of …","Constructs a new span that is completely disabled.","Returns this span, if it was enabled by the current …","Returns the new span’s explicitly-specified parent, if …","Records that the field described by field has the value …","Records all the fields in this set of Attributes with the …","Records all the fields in this Record with the provided …","Records all the fields in the provided ValueSet.","","","","","","","","","","","","","","","","","Returns a reference to a ValueSet containing any values …","Invokes a function with a reference to this span’s ID …","A guard that resets the current default dispatcher to the …","Indicates a Subscriber’s interest in a particular …","A no-op Subscriber.","Returned if setting the global dispatcher fails.","Trait representing the functions required to collect trace …","Returns an Interest indicating the subscriber is always …","","","","","","","","","","","","","Notifies the subscriber that a span ID has been cloned.","Returns a type representing this subscriber’s view of …","","If self is the same type as the provided TypeId, returns …","","This method is deprecated.","Returns true if a span or event with the specified metadata…","","Records that a span has been entered.","","Records that an Event has occurred.","","Determine if an Event should be recorded.","Records that a span has been exited.","","","","","","","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).","Returns true if the subscriber is always interested in …","Returns true if the subscriber is never interested in …","Returns true if the subscriber is sometimes interested in …","Returns the highest verbosity level that this Subscriber …","Returns an Interest indicating that the subscriber is …","Returns a new NoSubscriber.","Visit the construction of a new span, returning a new span …","","Invoked when this subscriber becomes a Dispatch.","Record a set of values on a span.","","Adds an indication that span follows from the span with …","","Registers a new callsite with this subscriber, returning …","","Sets the Subscriber as the default for the current thread …","Sets this subscriber as the global default for the …","Returns an Interest indicating the subscriber is sometimes …","","","","Notifies the subscriber that a span ID has been dropped, …","","","","","","","","","","","","","Sets this Subscriber as the default for the current thread …"],"i":[1,0,1,0,1,0,0,0,0,0,1,0,1,1,5,3,6,1,5,3,6,1,3,5,6,1,5,6,1,8,6,1,8,6,0,0,6,0,8,8,8,8,8,6,6,5,8,6,8,6,0,8,6,5,3,1,1,0,0,0,8,6,0,8,0,8,6,0,3,3,20,20,5,3,6,1,1,5,3,6,6,1,1,1,1,1,1,5,1,29,0,0,0,29,0,5,3,6,1,8,8,8,8,6,3,3,1,1,3,0,3,1,1,8,3,3,3,6,8,6,6,8,1,1,20,8,6,8,6,8,6,0,0,0,0,3,5,6,1,1,0,0,8,6,5,3,6,1,5,3,6,1,5,3,6,1,0,0,0,0,0,0,15,15,15,15,15,15,0,15,0,0,15,15,15,15,15,0,0,18,18,18,18,18,18,18,18,18,18,18,18,18,18,18,18,18,18,0,0,0,0,0,0,0,0,0,0,47,34,34,34,19,44,34,53,46,48,51,19,44,34,53,46,48,51,44,34,34,48,51,34,48,51,19,0,0,19,34,53,19,19,19,44,44,34,34,53,46,48,48,51,19,44,34,53,46,48,51,34,19,44,34,53,46,48,51,19,46,19,44,19,19,44,34,19,46,20,44,53,48,51,35,35,35,35,35,35,35,35,35,34,48,51,19,44,34,48,19,44,34,53,46,48,51,19,44,34,53,46,48,51,19,44,34,53,46,48,51,0,0,0,0,64,30,64,30,64,30,64,30,64,30,64,30,64,30,29,64,30,64,30,64,30,64,30,29,64,30,64,30,64,30,64,30,30,30,64,30,64,30,64,30,64,30,69,69,17,17,17,0,17,0,0,17,17,17,70,17,70,17,70,17,70,17,17,17,17,17,17,70,70,17,17,17,70,17,17,17,17,17,17,17,17,70,17,17,17,17,17,17,17,17,70,17,70,17,70,17,70,17,70,0,0,0,0,0,0,0,71,73,72,9,33,36,73,72,9,33,36,5,33,9,9,33,36,5,72,73,72,5,5,9,72,5,33,73,72,9,33,36,5,73,72,9,33,36,9,9,5,9,5,72,5,73,72,9,33,36,9,9,33,5,33,36,5,33,36,5,33,5,33,36,5,5,33,5,5,33,5,33,36,5,9,73,72,9,33,36,73,72,9,33,36,73,72,9,33,36,33,5,0,0,0,0,0,37,42,41,37,76,42,41,37,76,37,76,37,76,8,8,76,8,41,8,8,76,8,76,8,76,8,8,76,42,42,41,37,76,42,41,37,76,42,41,37,76,37,37,37,8,37,76,8,76,8,8,76,8,76,8,76,0,0,37,37,76,42,8,42,41,37,76,42,41,37,76,42,41,37,76,0],"f":"`````````````{bd}{ce{}{}}0000000{fh}{jj}{ll}{bb}{{ce}n{}{}}00{{A`Ab}Ab}{{lAb}Ab}{{bb}Ad}{A`Af}{lAf}``{{}l}`{{A`Ah}{{Aj{n}}}}{A`{{Aj{c}}}Al}000{l{{Aj{c}}}Al}{lAn}{jn}{{A`Ab}n}{{lAb}n}{{A`f}B`}{{lf}B`}`32{{jj}B`}{{ff}B`}{{bb}B`}{{bBb}B`}```{{A`Bd}n}{{lBd}n}`{{A`Bd}B`}`:9`{fBf}{f{{Aj{d}}}}{{BhBj}{{Bn{nBl}}}}0{{jBj}C`}{{fBj}{{Bn{nBl}}}}{{lBj}{{Bn{nBl}}}}{{bBj}{{Bn{nBl}}}}0{cc{}}0{cl{A`CbCd}}11{d{{Bn{bCf}}}}>=>={{jc}nCh}{{bc}nCh}{Cj{{Cl{Cj}}}}```{{Cjj}{{Cl{Cj}}}}`{ce{}{}}000{A`B`}000{lB`}{fB`}0{{bb}B`}{{bBb}B`}{fb}`{f{{Aj{Cn}}}}32{A`{{Aj{Bb}}}}{f{{Aj{d}}}}{fd}{{ddb{Aj{d}}{Aj{Cn}}{Aj{d}}BfD`}f}{cl{A`CbCd}}{{A`Db}Ab}{{lDb}Ab}{{}l}{{A`l}n}{{bBb}{{Aj{Ad}}}}{{bb}{{Aj{Ad}}}}{{BhDdDf}n}{{A`AbDh}n}{{lAbDh}n}{{A`AbAb}n}{{lAbAb}n}{{A`f}Dj}{{lf}Dj}````?{ce{}{}}00{cDl{}}``{{A`Ab}B`}{{lAb}B`}{c{{Bn{e}}}{}{}}0000000{cAh{}}000``````55{AnAn}{{ce}n{}{}}{{AnBj}{{Bn{nBl}}}}{cc{}}{ec{}{{E`{l}{{Dn{c}}}}}}:{lEb}{l{{Bn{nEd}}}}<887{An{{Aj{l}}}}{{le}c{}{{Ef{}{{Dn{c}}}}}}`>>{{cfEh}n{{Ej{{Aj{Ab}}}}}}{{fEh}n}{BdEl}{{BdBj}{{Bn{nBl}}}}9{ce{}{}}{BdB`}0{Bdf}{{fEh}Bd}{{cfEh}Bd{{Ej{{Aj{Ab}}}}}}{Bd{{Aj{Ab}}}}{{BdDf}n}{c{{Bn{e}}}{}{}}0{cAh{}}``````````{{Enf}{{Aj{Dd}}}}{{Ddf}{{Aj{Dd}}}}0{Ddd};;;;;;;;;;;;;;{Ehh}{Ddh}{DdDd}{{{F`{c}}}{{F`{c}}}{FbFd}}{{{Ff{c}}}{{Ff{c}}}{FbFh}}{{ce}n{}{}}00{{BfDd}B`}{c{{Ff{c}}}Fh}{c{{F`{c}}}Fd}{{BfBf}B`}{{DdDd}B`}{{FjFj}B`}{{Bfc}{{Aj{Dd}}}{{Fl{d}}Fn}}{{BfBj}{{Bn{nBl}}}}0{{EhBj}{{Bn{nBl}}}}0{{DdBj}{{Bn{nBl}}}}0{{FjBj}{{Bn{nBl}}}}{{ElBj}{{Bn{nBl}}}}{{{F`{c}}Bj}{{Bn{nBl}}}Fd}0{{{Ff{c}}Bj}{{Bn{nBl}}}Fh}{cc{}}000000{{Ddc}nCh}{ce{}{}}000000{Bf}1{BfB`}{EhB`}{BfEl}{BfG`}{EhG`}{Ddd}{{{Gb{d}}h}Bf}{El{{Aj{Dd}}}}{{BhDdDf}n}{{EhDf}n}{{FjDdDf}n}{{{F`{c}}DdDf}nFd}{{{Ff{c}}DdDf}nFh}{{DfDdB`}n}{{DfDdFh}n}{{DfDdGd}n}{{DfDdGf}n}{{DfDdGh}n}{{DfDdGj}n}{{DfDdd}n}{{DfDdGl}n}{{DfDdGn}n}{ce{}{}}00{cDl{}}000{c{{Bn{e}}}{}{}}0000000000000{cAh{}}000000````3333{{{H`{c}}}{{H`{c}}}Fb}{{{Cl{c}}}{{Cl{c}}}Fb}{{ce}n{}{}}0{{{H`{c}}}l{}}{{{Cl{c}}}n{}}{{{H`{c}}Bj}C`Fh}{{{Cl{c}}Bj}C`Fh}{cc{}}0{Cj{{Cl{Cj}}}}{{{H`{c}}}c{}}{{{Cl{c}}}c{}}10{{{Hb{{H`{c}}}}}{{Hb{c}}}{}}{{{Hb{{Cl{c}}}}}{{Hb{c}}}{}}10{{Cjj}{{Cl{Cj}}}}{ce{}{}}0{c{}{}}065{{{Hb{{H`{c}}}}Hd}{{Hf{e}}}Hh{}}{{{Hb{{Cl{c}}}}Hd}{{Hf{e}}}Hh{}}{{{Cl{c}}}j{}}044{c{{Bn{e}}}{}{}}000{cAh{}}0{Hj{{H`{Hj}}}}{{Hjc}{{H`{Hj}}}{{Ej{l}}}}`````````8888{BbBb}{HlHl}{{ce}n{}{}}0{{BbBb}Ad}{{}Bb}{{BbBb}B`}{{Bbb}B`}{{BbBj}{{Bn{nBl}}}}0{{HlBj}{{Bn{nBl}}}}0{bBb}{cc{}}{{{Aj{b}}}Bb}12{d{{Bn{Bb}}}}6776{{Bbc}nCh}{ce{}{}}0{Bb{{Aj{b}}}}:9:9{{BbBb}{{Aj{Ad}}}}{{Bbb}{{Aj{Ad}}}}33{cDl{}}0{c{{Bn{e}}}{}{}}000{cAh{}}0```````{Hn{{Aj{Ab}}}}7777777777{{cfEh}j{{Ej{{Aj{Ab}}}}}}{{AbfEh}Db}{AbAb}{{ce}n{}{}}{{DbDd}B`}{{DhDd}B`}{{}j}{I`j}{Ibn}{I`n}{jIb}{jI`}{{AbAb}B`}5{{jc}{{Aj{Dd}}}{EnFn}}{DbBf}{{IbBj}C`}{{I`Bj}C`}{{AbBj}{{Bn{nBl}}}}{{DbBj}{{Bn{nBl}}}}{{DhBj}{{Bn{nBl}}}}{{jc}j{{Ej{{Aj{Ab}}}}}}{cc{}}0000{{{Id{Gn}}}Ab}{GnAb}{{jc}B`{EnFn}}{{Abc}nCh}{j{{Aj{Ab}}}}{I`{{Aj{Ab}}}}{{je}c{}{{Ef{}{{Dn{c}}}}}}{ce{}{}}0000{Ab{{Id{Gn}}}}{AbGn}{DbB`}{jB`}1{DhB`}12{DhG`}{j{{Aj{f}}}}{Dbf}{{fEh}j}{{fEh}Db}{EhDh}{fj}32{{}j}{jj}{Db{{Aj{Ab}}}}{{jce}j{EnFn}Bh}{{DbDf}n}{{DhDf}n}{{jEh}j}{ce{}{}}{c{{Bn{e}}}{}{}}000000000{cAh{}}0000{DbEh}{{je}{{Aj{c}}}{}{{Ef{{If{Abl}}}{{Dn{c}}}}}}`````{{}Dj}55555555{DjDj}{IhIh}{{ce}n{}{}}0{{A`Ab}Ab}{A`Af}{{}Ih}{{A`Ah}{{Aj{n}}}}{Ebn}{{A`Ab}n}{{A`f}B`}{{Ihf}B`}2{{IhAb}n}{{A`Bd}n}{{IhBd}n}{{A`Bd}B`}63{{EdBj}{{Bn{nBl}}}}0{{EbBj}{{Bn{nBl}}}}{{DjBj}{{Bn{nBl}}}}{{IhBj}{{Bn{nBl}}}}{cc{}}000{ce{}{}}000{DjB`}00{A`{{Aj{Bb}}}}{{}Dj}{{}Ih}{{A`Db}Ab}{{IhDb}Ab}{{A`l}n}{{A`AbDh}n}{{IhAbDh}n}{{A`AbAb}n}{{IhAbAb}n}{{A`f}Dj}{{Ihf}Dj}{cEb{A`CbCd}}{c{{Bn{nEd}}}{A`CbCd}}tracing span …"],"i":[0],"f":"`","c":[],"p":[],"b":[]}],\ ["tracing_core",{"doc":"Core primitives for tracing.","t":"KFFFEEFFFFKNNNNNNNNNNNNNNNNNCNNNNNNNNNNNNNCNNMMNNNNNNCMNMCNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNQNNNNNNNNNNNNNNNNNCMQNMNNNNNMMNMCCNNNNNNNNNNNNNNNNNNNNNNNNNNNNNKFFNNNNNNNNNNNNNNNMNNHHNMNNNNNNNNFFFFNNNNNNNNNNNNNNNNNNNNNNNNNHNNNNNNNNNNHHNNNNNNNNNNNNNHFNNNNNNNNNNFFFFFFKFKNNNNNNNNNNNNNNNNNNNHHNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNMNNNNNMNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNTTTTTTTTFFFFTFFTTTTTNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNFFFFNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNFFKNNNNNNNNNNNNNNNNNNMNMNMNNMNNNNNNNNNNNNNNNNNMNNMNMNNNNNNNNNNNNN","n":["Callsite","Dispatch","Event","Field","Interest","Kind","Level","LevelFilter","Metadata","Once","Subscriber","as_ref","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","call_once","call_once_force","callsite","clone","clone","clone","clone","clone_into","clone_into","clone_into","clone_into","clone_span","cmp","cmp","current_span","default","dispatcher","downcast_raw","drop_span","enabled","enter","eq","eq","eq","eq","eq","eq","event","event","event_enabled","exit","field","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","from","from","from","from","from","from","from","from","from","from","from_str","from_str","ge","ge","ge","ge","gt","gt","gt","gt","hash","hash","hash","identify_callsite","into","into","into","into","into","into","into","is_completed","le","le","le","le","lt","lt","lt","lt","max_level_hint","metadata","metadata","metadata","new","new_span","on_register_dispatch","partial_cmp","partial_cmp","partial_cmp","partial_cmp","record","record_follows_from","register_callsite","set_interest","span","subscriber","to_owned","to_owned","to_owned","to_owned","to_string","to_string","to_string","try_close","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_into","try_into","try_into","try_into","try_into","try_into","try_into","type_id","type_id","type_id","type_id","type_id","type_id","type_id","Callsite","DefaultCallsite","Identifier","borrow","borrow","borrow_mut","borrow_mut","clone","clone_into","eq","fmt","fmt","from","from","hash","interest","into","into","metadata","metadata","new","rebuild_interest_cache","register","register","set_interest","set_interest","to_owned","try_from","try_from","try_into","try_into","type_id","type_id","DefaultGuard","Dispatch","SetGlobalDefaultError","WeakDispatch","borrow","borrow","borrow","borrow_mut","borrow_mut","borrow_mut","clone","clone_into","clone_span","current_span","downcast_ref","downgrade","drop","drop_span","enabled","enter","event","exit","fmt","fmt","fmt","fmt","from","from","from","get_default","into","into","into","is","new","new_span","none","record","record_follows_from","register_callsite","set_default","set_global_default","to_owned","to_string","try_close","try_from","try_from","try_from","try_into","try_into","try_into","type_id","type_id","type_id","upgrade","with_default","Event","child_of","dispatch","fields","is_contextual","is_root","metadata","new","new_child_of","parent","record","DebugValue","DisplayValue","Empty","Field","FieldSet","Iter","Value","ValueSet","Visit","borrow","borrow","borrow","borrow","borrow","borrow","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","callsite","callsite","clone","clone","clone_into","clone_into","contains","debug","display","eq","eq","field","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","from","from","from","from","from","from","into","into","into","into","into","into","into_iter","into_iter","is_empty","is_empty","iter","len","len","name","new","next","record","record","record","record","record","record_bool","record_debug","record_error","record_f64","record_i128","record_i64","record_str","record_u128","record_u64","to_owned","to_owned","to_string","to_string","to_string","try_from","try_from","try_from","try_from","try_from","try_from","try_into","try_into","try_into","try_into","try_into","try_into","type_id","type_id","type_id","type_id","type_id","type_id","DEBUG","DEBUG","ERROR","ERROR","EVENT","HINT","INFO","INFO","Kind","Level","LevelFilter","Metadata","OFF","ParseLevelError","ParseLevelFilterError","SPAN","TRACE","TRACE","WARN","WARN","as_str","borrow","borrow","borrow","borrow_mut","borrow_mut","borrow_mut","callsite","clone","clone","clone_into","clone_into","current","eq","fields","file","fmt","fmt","fmt","fmt","fmt","from","from","from","from_level","hint","into","into","into","into_level","is_event","is_event","is_hint","is_span","is_span","level","line","module_path","name","new","target","to_owned","to_owned","to_string","to_string","try_from","try_from","try_from","try_into","try_into","try_into","type_id","type_id","type_id","Attributes","Current","Id","Record","borrow","borrow","borrow","borrow","borrow_mut","borrow_mut","borrow_mut","borrow_mut","child_of","clone","clone_into","contains","contains","eq","fields","fmt","fmt","fmt","fmt","from","from","from","from","from_non_zero_u64","from_u64","hash","id","into","into","into","into","into_inner","into_non_zero_u64","into_u64","is_contextual","is_empty","is_empty","is_known","is_root","len","metadata","metadata","new","new","new","new_root","none","parent","record","record","to_owned","try_from","try_from","try_from","try_from","try_into","try_into","try_into","try_into","type_id","type_id","type_id","type_id","values","Interest","NoSubscriber","Subscriber","always","borrow","borrow","borrow_mut","borrow_mut","clone","clone","clone_into","clone_into","clone_span","current_span","default","downcast_raw","downcast_ref","downcast_ref","downcast_ref","downcast_ref","drop_span","enabled","enabled","enter","enter","event","event","event_enabled","exit","exit","fmt","fmt","from","from","into","into","is","is","is","is","is_always","is_never","is_sometimes","max_level_hint","never","new","new_span","new_span","on_register_dispatch","record","record","record_follows_from","record_follows_from","register_callsite","register_callsite","sometimes","to_owned","to_owned","try_close","try_from","try_from","try_into","try_into","type_id","type_id"],"q":[[0,"tracing_core"],[154,"tracing_core::callsite"],[187,"tracing_core::dispatcher"],[243,"tracing_core::event"],[254,"tracing_core::field"],[357,"tracing_core::metadata"],[431,"tracing_core::span"],[499,"tracing_core::subscriber"],[564,"core::ops::function"],[565,"std::sync::once"],[566,"core::cmp"],[567,"core::any"],[568,"core::option"],[569,"core::fmt"],[570,"core::fmt"],[571,"core::marker"],[572,"core::marker"],[573,"alloc::string"],[574,"core::any"],[575,"core::clone"],[576,"core::fmt"],[577,"core::marker"],[578,"core::num::nonzero"]],"d":["Trait implemented by callsites.","Dispatch trace data to a Subscriber.","Events represent single points in time where something …","An opaque key allowing O(1) access to a field in a Span’…","","","Describes the level of verbosity of a span or event.","A filter comparable to a verbosity Level.","Metadata describing a span or event.","A synchronization primitive which can be used to run a …","Trait representing the functions required to collect trace …","","","","","","","","","","","","","","","","Performs an initialization routine once and only once. The …","Performs the same function as call_once() except ignores …","Callsites represent the source locations from which spans …","","","","","","","","","Notifies the subscriber that a span ID has been cloned.","","","Returns a type representing this subscriber’s view of …","Returns the current default dispatcher","Dispatches trace events to Subscribers.","If self is the same type as the provided TypeId, returns …","This method is deprecated.","Returns true if a span or event with the specified metadata…","Records that a span has been entered.","","","","","","","Events represent single points in time during the …","Records that an Event has occurred.","Determine if an Event should be recorded.","Records that a span has been exited.","Span and Event key-value data.","","","","","","","","","","","Returns the argument unchanged.","","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","","","Returns the argument unchanged.","","","","","","","","","","","","","","Statically constructs an Identifier for the provided …","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Returns true if some call_once() call has completed …","","","","","","","","","Returns the highest verbosity level that this Subscriber …","Metadata describing trace data.","Returns the metadata associated with the callsite.","Statically constructs new span metadata.","Creates a new Once value.","Visit the construction of a new span, returning a new span …","Invoked when this subscriber becomes a Dispatch.","","","","","Record a set of values on a span.","Adds an indication that span follows from the span with …","Registers a new callsite with this subscriber, returning …","Sets the Interest for this callsite.","Spans represent periods of time in the execution of a …","Collectors collect and record trace data.","","","","","","","","Notifies the subscriber that a span ID has been dropped, …","","","","","","","","","","","","","","","","","","","","","","Trait implemented by callsites.","A default Callsite implementation.","Uniquely identifies a Callsite","","","","","","","","","","Returns the argument unchanged.","Returns the argument unchanged.","","Returns the callsite’s cached Interest, or registers it …","Calls U::from(self).","Calls U::from(self).","Returns the metadata associated with the callsite.","","Returns a new DefaultCallsite with the specified Metadata.","Clear and reregister interest on every Callsite","Register a new Callsite with the global registry.","Registers this callsite with the global callsite registry.","Sets the Interest for this callsite.","","","","","","","","","A guard that resets the current default dispatcher to the …","Dispatch trace data to a Subscriber.","Returned if setting the global dispatcher fails.","WeakDispatch is a version of Dispatch that holds a …","","","","","","","","","Notifies the subscriber that a span ID has been cloned.","Returns a type representing this subscriber’s view of …","Returns some reference to the Subscriber this Dispatch …","Creates a WeakDispatch from this Dispatch.","","Notifies the subscriber that a span ID has been dropped.","Returns true if a span with the specified metadata would be","Records that a span has been can_enter.","Records that an Event has occurred.","Records that a span has been exited.","","","","","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Executes a closure with a reference to this thread’s …","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Returns true if this Dispatch forwards to a Subscriber of …","Returns a Dispatch that forwards to the given Subscriber.","Record the construction of a new span, returning a new ID …","Returns a new Dispatch that discards events and spans.","Record a set of values on a span.","Adds an indication that span follows from the span with …","Registers a new callsite with this subscriber, returning …","Sets the dispatch as the default dispatch for the duration …","Sets this dispatch as the global default for the duration …","","","Notifies the subscriber that a span ID has been dropped, …","","","","","","","","","","Attempts to upgrade this WeakDispatch to a Dispatch.","Sets this dispatch as the default for the duration of a …","Events represent single points in time where something …","Constructs a new Event with the specified metadata and set …","Constructs a new Event with the specified metadata and set …","Returns an iterator over the set of values on this Event.","Returns true if the new event’s parent should be …","Returns true if the new event should be a root.","Returns metadata describing this Event.","Returns a new Event in the current span, with the …","Returns a new Event as a child of the specified span, with …","Returns the new event’s explicitly-specified parent, if …","Visits all the fields on this Event with the specified …","A Value which serializes as a string using fmt::Debug.","A Value which serializes using fmt::Display.","An empty field.","An opaque key allowing O(1) access to a field in a Span’…","Describes the fields present on a span.","An iterator over a set of fields.","A field value of an erased type.","A set of fields and values for a span.","Visits typed values.","","","","","","","","","","","","","Returns an Identifier that uniquely identifies the Callsite","Returns an Identifier that uniquely identifies the Callsite","","","","","Returns true if self contains the given field.","Wraps a type implementing fmt::Debug as a Value that can be","Wraps a type implementing fmt::Display as a Value that can …","","","Returns the Field named name, or None if no such field …","","","","","","","","","","","","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","","","Returns whether or not this FieldSet has fields.","Returns true if this ValueSet contains no values.","Returns an iterator over the Fields in this FieldSet.","Returns the number of fields in this FieldSet.","Returns the number of fields in this ValueSet that would …","Returns a string representing the name of the field.","Constructs a new FieldSet with the given array of field …","","Visits this value with the given Visitor.","Visits all the fields in this ValueSet with the provided …","","","","Visit a boolean value.","Visit a value implementing fmt::Debug.","Records a type implementing Error.","Visit a double-precision floating point value.","Visit a signed 128-bit integer value.","Visit a signed 64-bit integer value.","Visit a string value.","Visit an unsigned 128-bit integer value.","Visit an unsigned 64-bit integer value.","","","","","","","","","","","","","","","","","","","","","","","","The “debug” level.","The “debug” level.","The “error” level.","The “error” level.","Event callsite","enabled! callsite. Subscribers can assume this Kind means …","The “info” level.","The “info” level.","Indicates whether the callsite is a span or event.","Describes the level of verbosity of a span or event.","A filter comparable to a verbosity Level.","Metadata describing a span or event.","The “off” level.","Returned if parsing a Level fails.","Indicates that a string could not be parsed to a valid …","Span callsite","The “trace” level.","The “trace” level.","The “warn” level.","The “warn” level.","Returns the string representation of the Level.","","","","","","","Returns an opaque Identifier that uniquely identifies the …","","","","","Returns a LevelFilter that matches the most verbose Level …","","Returns the names of the fields on the described span or …","Returns the name of the source code file where the span …","","","","","","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns a LevelFilter that enables spans and events with …","Sets that this Kind is a hint.","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Returns the most verbose Level that this filter accepts, …","Returns true if the callsite kind is Event.","Return true if the callsite kind is Event","Return true if the callsite kind is Hint","Return true if the callsite kind is Span.","Return true if the callsite kind is Span","Returns the level of verbosity of the described span or …","Returns the line number in the source code file where the …","Returns the path to the Rust module where the span …","Returns the name of the span.","Construct new metadata for a span or event, with a name, …","Returns a string describing the part of the system where …","","","","","","","","","","","","","","Attributes provided to a Subscriber describing a new span …","Indicates what the Subscriber considers the “current” …","Identifies a span within the context of a subscriber.","A set of fields recorded by a span.","","","","","","","","","Returns Attributes describing a new child span of the …","","","Returns true if this set of Attributes contains a value …","Returns true if this Record contains a value for the given …","","Returns the set of all fields defined by this span’s …","","","","","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Constructs a new span ID from the given NonZeroU64.","Constructs a new span ID from the given u64.","","Borrows the Id of the current span, if one exists and is …","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Consumes self and returns the span Id and Metadata of the …","Returns the span’s ID as a NonZeroU64.","Returns the span’s ID as a u64.","Returns true if the new span’s parent should be …","Returns true if this set of Attributes contains no values.","Returns true if this Record contains no values.","Returns true if the Subscriber that constructed this …","Returns true if the new span should be a root.","Returns the number of fields that would be visited from …","Returns a reference to the new span’s metadata.","Borrows the Metadata of the current span, if one exists …","Returns Attributes describing a new child span of the …","Constructs a new Record from a ValueSet.","Constructs a new Current that indicates the current …","Returns Attributes describing a new span at the root of …","Constructs a new Current that indicates the current …","Returns the new span’s explicitly-specified parent, if …","Records all the fields in this set of Attributes with the …","Records all the fields in this Record with the provided …","","","","","","","","","","","","","","Returns a reference to a ValueSet containing any values …","Indicates a Subscriber’s interest in a particular …","A no-op Subscriber.","Trait representing the functions required to collect trace …","Returns an Interest indicating the subscriber is always …","","","","","","","","","Notifies the subscriber that a span ID has been cloned.","Returns a type representing this subscriber’s view of …","","If self is the same type as the provided TypeId, returns …","Returns some reference to this Subscriber value if it is …","Returns some reference to this Subscriber value if it is …","Returns some reference to this [Subscriber…","Returns some reference to this Subscriber value if it is …","This method is deprecated.","Returns true if a span or event with the specified metadata…","","Records that a span has been entered.","","Records that an Event has occurred.","","Determine if an Event should be recorded.","Records that a span has been exited.","","","","Returns the argument unchanged.","Returns the argument unchanged.","Calls U::from(self).","Calls U::from(self).","Returns true if this Subscriber is the same type as T.","Returns true if this Subscriber is the same type as T.","Returns true if this Subscriber is the same type as T.","Returns true if this Subscriber is the same type as T.","Returns true if the subscriber is always interested in …","Returns true if the subscriber is never interested in …","Returns true if the subscriber is sometimes interested in …","Returns the highest verbosity level that this Subscriber …","Returns an Interest indicating that the subscriber is …","Returns a new NoSubscriber.","Visit the construction of a new span, returning a new span …","","Invoked when this subscriber becomes a Dispatch.","Record a set of values on a span.","","Adds an indication that span follows from the span with …","","Registers a new callsite with this subscriber, returning …","","Returns an Interest indicating the subscriber is sometimes …","","","Notifies the subscriber that a span ID has been dropped, …","","","","","",""],"i":[0,0,0,0,0,0,0,0,0,0,0,1,16,7,18,1,8,9,3,16,7,18,1,8,9,3,3,3,0,7,1,8,9,7,1,8,9,10,8,9,10,7,0,10,10,10,10,16,1,8,8,9,9,0,10,10,10,0,16,7,18,1,1,8,8,9,9,3,16,7,7,18,1,8,9,9,9,3,8,9,8,8,9,9,8,8,9,9,1,8,9,0,16,7,18,1,8,9,3,3,8,8,9,9,8,8,9,9,10,0,27,0,3,10,10,8,8,9,9,10,10,10,27,0,0,7,1,8,9,1,8,9,10,16,7,18,1,8,9,3,16,7,18,1,8,9,3,16,7,18,1,8,9,3,0,0,0,32,33,32,33,32,32,32,32,33,32,33,32,33,32,33,27,33,33,0,0,33,27,33,32,32,33,32,33,32,33,0,0,0,0,37,34,36,37,34,36,34,34,7,7,7,7,36,7,7,7,7,7,37,37,34,36,37,34,36,0,37,34,36,7,7,7,7,7,7,7,0,0,34,37,7,37,34,36,37,34,36,37,34,36,34,0,0,18,18,18,18,18,18,18,18,18,18,0,0,0,0,0,0,0,0,0,49,40,50,42,44,47,49,40,50,42,44,47,40,1,44,47,44,47,49,0,0,49,50,49,49,49,40,40,53,53,50,42,44,44,47,49,40,50,42,44,47,49,40,50,42,44,47,49,42,49,40,49,49,40,1,49,42,53,40,50,44,47,43,43,43,43,43,43,43,43,43,44,47,49,40,44,49,40,50,42,44,47,49,40,50,42,44,47,49,40,50,42,44,47,8,9,8,9,62,62,8,9,0,0,0,0,9,0,0,62,8,9,8,9,8,62,63,25,62,63,25,16,62,63,62,63,9,62,16,16,62,63,63,25,25,62,63,25,9,62,62,63,25,9,16,62,62,16,62,16,16,16,16,16,16,62,63,63,25,62,63,25,62,63,25,62,63,25,0,0,0,0,11,28,29,13,11,28,29,13,28,11,11,28,29,11,28,11,28,29,13,11,28,29,13,11,11,11,13,11,28,29,13,13,11,11,28,28,29,13,28,29,28,13,28,29,13,28,13,28,28,29,11,11,28,29,13,11,28,29,13,11,28,29,13,28,0,0,0,30,30,67,30,67,30,67,30,67,10,10,67,10,10,10,10,10,10,10,67,10,67,10,67,10,10,67,30,67,30,67,30,67,10,10,10,10,30,30,30,10,30,67,10,67,10,10,67,10,67,10,67,30,30,67,10,30,67,30,67,30,67],"f":"```````````{bd}{ce{}{}}0000000000000{{fc}hj}{{fc}h{{j{l}}}}`{nn}{bb}{A`A`}{AbAb}{{ce}h{}{}}000{{AdAf}Af}{{A`A`}Ah}{{AbAb}Ah}{AdAj}{{}n}`{{AdAl}{{An{h}}}}{{AdAf}h}{{AdB`}Bb}1{{B`B`}Bb}{{bb}Bb}{{A`A`}Bb}{{A`Ab}Bb}{{AbA`}Bb}{{AbAb}Bb}`{{AdBd}h}{{AdBd}Bb}9`{{B`Bf}Bh}{{nBf}Bh}{{BdBf}Bh}{{bBf}Bh}0{{A`Bf}Bh}0{{AbBf}Bh}0{{fBf}{{Bl{hBj}}}}{cc{}}{cn{AdBnC`}}11111{{{An{A`}}}Ab}{A`Ab}3{d{{Bl{A`Cb}}}}{d{{Bl{Abc}}}{}}{{A`Ab}Bb}{{A`A`}Bb}{{AbA`}Bb}{{AbAb}Bb}2301{{bc}hCd}{{A`c}hCd}{{Abc}hCd}`{ce{}{}}000000{fBb}87658765{Ad{{An{Ab}}}}`{CfB`}`{{}f}{{AdCh}Af}{{Adn}h}{{A`A`}{{An{Ah}}}}{{A`Ab}{{An{Ah}}}}{{AbAb}{{An{Ah}}}}{{AbA`}{{An{Ah}}}}{{AdAfCj}h}{{AdAfAf}h}{{AdB`}Cl}{{CfCl}h}``>>>>{cCn{}}00{{AdAf}Bb}{c{{Bl{e}}}{}{}}0000000000000{cAl{}}000000```{ce{}{}}000{D`D`}{{ce}h{}{}}{{D`D`}Bb}{{D`Bf}Bh}{{DbBf}Bh}{cc{}}0{{D`c}hCd}{DbCl}88{CfB`}{DbB`}{B`Db}{{}h}{Cfh}5{{CfCl}h}{{DbCl}h}?{c{{Bl{e}}}{}{}}000{cAl{}}0````{ce{}{}}00000{DdDd}{{ce}h{}{}}{{nAf}Af}{nAj}{n{{An{c}}}Df}{nDd}{Dhh}{{nAf}h}{{nB`}Bb}1{{nBd}h}2{{DjBf}Bh}0{{DdBf}Bh}{{DhBf}Bh}{cc{}}00{ec{}{{Dn{n}{{Dl{c}}}}}}???{nBb}{cn{AdBnC`}}{{nCh}Af}{{}n}{{nAfCj}h}{{nAfAf}h}{{nB`}Cl}{nDh}{n{{Bl{hDj}}}}{ce{}{}}{cCn{}}{{nAf}Bb}{c{{Bl{e}}}{}{}}00000{cAl{}}00{Dd{{An{n}}}}{{ne}c{}{{j{}{{Dl{c}}}}}}`{{cB`E`}h{{Eb{{An{Af}}}}}}{{B`E`}h}{BdEd}{BdBb}0{BdB`}{{B`E`}Bd}{{cB`E`}Bd{{Eb{{An{Af}}}}}}{Bd{{An{Af}}}}{{BdEf}h}`````````????????????{E`D`}{bD`}{{{Eh{c}}}{{Eh{c}}}{EjEl}}{{{En{c}}}{{En{c}}}{EjF`}}{{ce}h{}{}}0{{Fbb}Bb}{c{{En{c}}}F`}{c{{Eh{c}}}El}{{FbFb}Bb}{{FdFd}Bb}{{Fbc}{{An{b}}}{{Ff{d}}Fh}}{{FbBf}Bh}0{{E`Bf}Bh}0{{FjBf}Bh}0{{FdBf}Bh}{{EdBf}Bh}{{{Eh{c}}Bf}BhEl}0{{{En{c}}Bf}BhF`}{cc{}}00000{ce{}{}}00000{Fbc{}}1{FbBb}{E`Bb}{FbEd}{FbFl}{E`Fl}{bd}{{{Fn{d}}D`}Fb}{Ed{{An{b}}}}{{FjbEf}h}{{E`Ef}h}{{FdbEf}h}{{{Eh{c}}bEf}hEl}{{{En{c}}bEf}hF`}{{EfbBb}h}{{EfbF`}h}{{EfbG`}h}{{EfbGb}h}{{EfbGd}h}{{EfbGf}h}{{Efbd}h}{{EfbGh}h}{{EfbGj}h}{ce{}{}}0{cCn{}}00{c{{Bl{e}}}{}{}}00000000000{cAl{}}00000````````````````````{A`d}444444{B`D`}{GlGl}{GnGn}{{ce}h{}{}}0{{}Ab}{{GlGl}Bb}{B`Fb}{B`{{An{d}}}}{{GlBf}Bh}{{GnBf}Bh}0{{CbBf}Bh}0{cc{}}00{A`Ab};{ce{}{}}00{Ab{{An{A`}}}}{B`Bb}{GlBb}010{B`A`}{B`{{An{H`}}}};{B`d}{{ddA`{An{d}}{An{H`}}{An{d}}FbGl}B`}177{cCn{}}0{c{{Bl{e}}}{}{}}00000{cAl{}}00````::::::::{{AfB`E`}Ch}{AfAf}{{ce}h{}{}}{{Chb}Bb}{{Cjb}Bb}{{AfAf}Bb}{ChFb}{{AfBf}Bh}{{ChBf}Bh}{{CjBf}Bh}{{AjBf}Bh}{cc{}}000{HbAf}{GjAf}{{Afc}hCd}{Aj{{An{Af}}}}{ce{}{}}000{Aj{{An{{Hd{AfB`}}}}}}{AfHb}{AfGj}{ChBb}0{CjBb}{AjBb}2{CjFl}{ChB`}{Aj{{An{B`}}}}{{B`E`}Ch}{E`Cj}{{AfB`}Aj}2{{}Aj}{Ch{{An{Af}}}}{{ChEf}h}{{CjEf}h}{ce{}{}}{c{{Bl{e}}}{}{}}0000000{cAl{}}000{ChE`}```{{}Cl}4444{ClCl}{HfHf}{{ce}h{}{}}0{{AdAf}Af}{AdAj}{{}Hf}{{AdAl}{{An{h}}}}{Ad{{An{c}}}Df}000{{AdAf}h}{{AdB`}Bb}{{HfB`}Bb}2{{HfAf}h}{{AdBd}h}{{HfBd}h}{{AdBd}Bb}63{{ClBf}Bh}{{HfBf}Bh}{cc{}}0{ce{}{}}0{AdBb}000{ClBb}00{Ad{{An{Ab}}}}{{}Cl}{{}Hf}{{AdCh}Af}{{HfCh}Af}{{Adn}h}{{AdAfCj}h}{{HfAfCj}h}{{AdAfAf}h}{{HfAfAf}h}{{AdB`}Cl}{{HfB`}Cl}:>>{{AdAf}Bb}{c{{Bl{e}}}{}{}}000{cAl{}}0","c":[44,204,519],"p":[[5,"Field",0],[1,"str"],[5,"Once",0],[1,"unit"],[10,"FnOnce",564],[5,"OnceState",565],[5,"Dispatch",0],[5,"Level",0],[5,"LevelFilter",0],[10,"Subscriber",0],[5,"Id",431],[6,"Ordering",566],[5,"Current",431],[5,"TypeId",567],[6,"Option",568],[5,"Metadata",0],[1,"bool"],[5,"Event",0],[5,"Formatter",569],[8,"Result",569],[5,"Error",569],[6,"Result",570],[10,"Send",571],[10,"Sync",571],[5,"ParseLevelError",357],[10,"Hasher",572],[10,"Callsite",0],[5,"Attributes",431],[5,"Record",431],[5,"Interest",499],[5,"String",573],[5,"Identifier",154],[5,"DefaultCallsite",154],[5,"WeakDispatch",187],[10,"Any",567],[5,"DefaultGuard",187],[5,"SetGlobalDefaultError",187],[17,"Output"],[10,"FnMut",564],[5,"ValueSet",254],[10,"Into",574],[5,"Iter",254],[10,"Visit",254],[5,"DisplayValue",254],[10,"Clone",575],[10,"Display",569],[5,"DebugValue",254],[10,"Debug",569],[5,"FieldSet",254],[5,"Empty",254],[10,"Borrow",576],[10,"Sized",571],[10,"Value",254],[1,"usize"],[1,"slice"],[10,"Error",577],[1,"f64"],[1,"i128"],[1,"i64"],[1,"u128"],[1,"u64"],[5,"Kind",357],[5,"ParseLevelFilterError",357],[1,"u32"],[8,"NonZeroU64",578],[1,"tuple"],[5,"NoSubscriber",499]],"b":[[49,"impl-PartialEq-for-Level"],[50,"impl-PartialEq%3CLevelFilter%3E-for-Level"],[51,"impl-PartialEq%3CLevel%3E-for-LevelFilter"],[52,"impl-PartialEq-for-LevelFilter"],[61,"impl-Debug-for-Field"],[62,"impl-Display-for-Field"],[63,"impl-Display-for-Level"],[64,"impl-Debug-for-Level"],[65,"impl-Debug-for-LevelFilter"],[66,"impl-Display-for-LevelFilter"],[75,"impl-From%3COption%3CLevel%3E%3E-for-LevelFilter"],[76,"impl-From%3CLevel%3E-for-LevelFilter"],[80,"impl-PartialOrd%3CLevelFilter%3E-for-Level"],[81,"impl-PartialOrd-for-Level"],[82,"impl-PartialOrd%3CLevel%3E-for-LevelFilter"],[83,"impl-PartialOrd-for-LevelFilter"],[84,"impl-PartialOrd-for-Level"],[85,"impl-PartialOrd%3CLevelFilter%3E-for-Level"],[86,"impl-PartialOrd-for-LevelFilter"],[87,"impl-PartialOrd%3CLevel%3E-for-LevelFilter"],[100,"impl-PartialOrd%3CLevelFilter%3E-for-Level"],[101,"impl-PartialOrd-for-Level"],[102,"impl-PartialOrd%3CLevel%3E-for-LevelFilter"],[103,"impl-PartialOrd-for-LevelFilter"],[104,"impl-PartialOrd%3CLevelFilter%3E-for-Level"],[105,"impl-PartialOrd-for-Level"],[106,"impl-PartialOrd%3CLevel%3E-for-LevelFilter"],[107,"impl-PartialOrd-for-LevelFilter"],[115,"impl-PartialOrd-for-Level"],[116,"impl-PartialOrd%3CLevelFilter%3E-for-Level"],[117,"impl-PartialOrd-for-LevelFilter"],[118,"impl-PartialOrd%3CLevel%3E-for-LevelFilter"],[209,"impl-Debug-for-SetGlobalDefaultError"],[210,"impl-Display-for-SetGlobalDefaultError"],[287,"impl-Debug-for-FieldSet"],[288,"impl-Display-for-FieldSet"],[289,"impl-Debug-for-ValueSet%3C\'a%3E"],[290,"impl-Display-for-ValueSet%3C\'a%3E"],[291,"impl-Debug-for-dyn+Value"],[292,"impl-Display-for-dyn+Value"],[295,"impl-Debug-for-DisplayValue%3CT%3E"],[296,"impl-Display-for-DisplayValue%3CT%3E"],[394,"impl-Debug-for-ParseLevelFilterError"],[395,"impl-Display-for-ParseLevelFilterError"],[396,"impl-Display-for-ParseLevelError"],[397,"impl-Debug-for-ParseLevelError"],[515,"impl-dyn+Subscriber"],[516,"impl-dyn+Subscriber+%2B+Send"],[517,"impl-dyn+Subscriber+%2B+Sync"],[518,"impl-dyn+Subscriber+%2B+Send+%2B+Sync"],[535,"impl-dyn+Subscriber"],[536,"impl-dyn+Subscriber+%2B+Sync"],[537,"impl-dyn+Subscriber+%2B+Send"],[538,"impl-dyn+Subscriber+%2B+Send+%2B+Sync"]]}],\ ["unicode_ident",{"doc":"github crates-io docs-rs","t":"HH","n":["is_xid_continue","is_xid_start"],"q":[[0,"unicode_ident"]],"d":["",""],"i":[0,0],"f":"{bd}0","c":[],"p":[[1,"char"],[1,"bool"]],"b":[]}],\ diff --git a/serde/all.html b/serde/all.html index 2b36cb8b52..cd0b880276 100644 --- a/serde/all.html +++ b/serde/all.html @@ -1,2 +1,2 @@ -List of all items in this crate
+List of all items in this crate

List of all items

Structs

Enums

Traits

Macros

Derive Macros

\ No newline at end of file diff --git a/serde/de/enum.Unexpected.html b/serde/de/enum.Unexpected.html index 5d487a2ad8..e0f8226fda 100644 --- a/serde/de/enum.Unexpected.html +++ b/serde/de/enum.Unexpected.html @@ -1,4 +1,4 @@ -Unexpected in serde::de - Rust
+Unexpected in serde::de - Rust

Enum serde::de::Unexpected

source · 
pub enum Unexpected<'a> {
 
Show 18 variants    Bool(bool),
     Unsigned(u64),
@@ -53,7 +53,7 @@
 not expected.

 
The message should be a noun or noun phrase, not capitalized and without
 a period. An example message is “unoriginal superhero”.

-

Trait Implementations§

source§

impl<'a> Clone for Unexpected<'a>

source§

fn clone(&self) -> Unexpected<'a>

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<'a> Debug for Unexpected<'a>

source§

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter. Read more
source§

impl<'a> Display for Unexpected<'a>

source§

fn fmt(&self, formatter: &mut Formatter<'_>) -> Result

Formats the value using the given formatter. Read more
source§

impl<'a> PartialEq for Unexpected<'a>

source§

fn eq(&self, other: &Unexpected<'a>) -> bool

This method tests for self and other values to be equal, and is used +

Trait Implementations§

source§

impl<'a> Clone for Unexpected<'a>

source§

fn clone(&self) -> Unexpected<'a>

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<'a> Debug for Unexpected<'a>

source§

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter. Read more
source§

impl<'a> Display for Unexpected<'a>

source§

fn fmt(&self, formatter: &mut Formatter<'_>) -> Result

Formats the value using the given formatter. Read more
source§

impl<'a> PartialEq for Unexpected<'a>

source§

fn eq(&self, other: &Unexpected<'a>) -> 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<'a> Copy for Unexpected<'a>

source§

impl<'a> StructuralPartialEq for Unexpected<'a>

Auto Trait Implementations§

§

impl<'a> Freeze for Unexpected<'a>

§

impl<'a> RefUnwindSafe for Unexpected<'a>

§

impl<'a> Send for Unexpected<'a>

§

impl<'a> Sync for Unexpected<'a>

§

impl<'a> Unpin for Unexpected<'a>

§

impl<'a> UnwindSafe for Unexpected<'a>

Blanket Implementations§

source§

impl<T> Any for T
where T: 'static + ?Sized,

source§

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more
source§

impl<T> Borrow<T> for T
where diff --git a/serde/de/index.html b/serde/de/index.html index afe72dd98d..6bf0c0e5db 100644 --- a/serde/de/index.html +++ b/serde/de/index.html @@ -1,4 +1,4 @@ -serde::de - Rust
+serde::de - Rust

Module serde::de

source ·
Expand description

Generic data structure deserialization framework.

The two most important traits in this module are Deserialize and Deserializer.

diff --git a/serde/de/struct.IgnoredAny.html b/serde/de/struct.IgnoredAny.html index 02f6ac9f44..0d5c416129 100644 --- a/serde/de/struct.IgnoredAny.html +++ b/serde/de/struct.IgnoredAny.html @@ -1,4 +1,4 @@ -IgnoredAny in serde::de - Rust
+IgnoredAny in serde::de - Rust

Struct serde::de::IgnoredAny

source · 
pub struct IgnoredAny;
Expand description

An efficient way of discarding data from a deserializer.

Think of this like serde_json::Value in that it can be deserialized from any type, except that it does not store any information about the data that diff --git a/serde/de/trait.Deserialize.html b/serde/de/trait.Deserialize.html index c9b269a7f4..8f6e8c5dfb 100644 --- a/serde/de/trait.Deserialize.html +++ b/serde/de/trait.Deserialize.html @@ -1,4 +1,4 @@ -Deserialize in serde::de - Rust

+Deserialize in serde::de - Rust

Trait serde::de::Deserialize

source · 
pub trait Deserialize<'de>: Sized {
     // Required method
     fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>
@@ -27,8 +27,8 @@ 
§Lifetime

     D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer.

See the Implementing Deserialize section of the manual for more information about how to implement this method.

-

Object Safety§

This trait is not object safe.

Implementations on Foreign Types§

source§

impl<'de> Deserialize<'de> for IpAddr

source§

fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>
where - D: Deserializer<'de>,

source§

impl<'de> Deserialize<'de> for SocketAddr

source§

fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>
where +

Object Safety§

This trait is not object safe.

Implementations on Foreign Types§

source§

impl<'de> Deserialize<'de> for IpAddr

source§

fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>
where + D: Deserializer<'de>,

source§

impl<'de> Deserialize<'de> for SocketAddr

source§

fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>
where D: Deserializer<'de>,

source§

impl<'de> Deserialize<'de> for bool

source§

fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>
where D: Deserializer<'de>,

source§

impl<'de> Deserialize<'de> for char

source§

fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>
where D: Deserializer<'de>,

source§

impl<'de> Deserialize<'de> for f32

source§

fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>
where @@ -46,16 +46,16 @@

§Lifetime

D: Deserializer<'de>,

source§

impl<'de> Deserialize<'de> for u128

source§

fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>
where D: Deserializer<'de>,

source§

impl<'de> Deserialize<'de> for ()

source§

fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>
where D: Deserializer<'de>,

source§

impl<'de> Deserialize<'de> for usize

source§

fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>
where - D: Deserializer<'de>,

source§

impl<'de> Deserialize<'de> for Box<str>

source§

fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>
where + D: Deserializer<'de>,

source§

impl<'de> Deserialize<'de> for Box<str>

source§

fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>
where D: Deserializer<'de>,

source§

impl<'de> Deserialize<'de> for Box<CStr>

source§

fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>
where - D: Deserializer<'de>,

source§

impl<'de> Deserialize<'de> for Box<OsStr>

source§

fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>
where - D: Deserializer<'de>,

source§

impl<'de> Deserialize<'de> for Box<Path>

source§

fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>
where + D: Deserializer<'de>,

source§

impl<'de> Deserialize<'de> for Box<OsStr>

source§

fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>
where + D: Deserializer<'de>,

source§

impl<'de> Deserialize<'de> for Box<Path>

source§

fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>
where D: Deserializer<'de>,

source§

impl<'de> Deserialize<'de> for CString

source§

fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>
where D: Deserializer<'de>,

source§

impl<'de> Deserialize<'de> for String

source§

fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>
where - D: Deserializer<'de>,

source§

impl<'de> Deserialize<'de> for Ipv4Addr

source§

fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>
where - D: Deserializer<'de>,

source§

impl<'de> Deserialize<'de> for Ipv6Addr

source§

fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>
where - D: Deserializer<'de>,

source§

impl<'de> Deserialize<'de> for SocketAddrV4

source§

fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>
where - D: Deserializer<'de>,

source§

impl<'de> Deserialize<'de> for SocketAddrV6

source§

fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>
where + D: Deserializer<'de>,

source§

impl<'de> Deserialize<'de> for Ipv4Addr

source§

fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>
where + D: Deserializer<'de>,

source§

impl<'de> Deserialize<'de> for Ipv6Addr

source§

fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>
where + D: Deserializer<'de>,

source§

impl<'de> Deserialize<'de> for SocketAddrV4

source§

fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>
where + D: Deserializer<'de>,

source§

impl<'de> Deserialize<'de> for SocketAddrV6

source§

fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>
where D: Deserializer<'de>,

source§

impl<'de> Deserialize<'de> for Saturating<i8>

source§

fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>
where D: Deserializer<'de>,

source§

impl<'de> Deserialize<'de> for Saturating<i16>

source§

fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>
where D: Deserializer<'de>,

source§

impl<'de> Deserialize<'de> for Saturating<i32>

source§

fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>
where @@ -68,21 +68,21 @@

§Lifetime

D: Deserializer<'de>,

source§

impl<'de> Deserialize<'de> for Saturating<u64>

source§

fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>
where D: Deserializer<'de>,

source§

impl<'de> Deserialize<'de> for Saturating<u128>

source§

fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>
where D: Deserializer<'de>,

source§

impl<'de> Deserialize<'de> for Saturating<usize>

source§

fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>
where - D: Deserializer<'de>,

source§

impl<'de> Deserialize<'de> for AtomicBool

source§

fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>
where - D: Deserializer<'de>,

source§

impl<'de> Deserialize<'de> for AtomicI8

source§

fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>
where - D: Deserializer<'de>,

source§

impl<'de> Deserialize<'de> for AtomicI16

source§

fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>
where - D: Deserializer<'de>,

source§

impl<'de> Deserialize<'de> for AtomicI32

source§

fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>
where - D: Deserializer<'de>,

source§

impl<'de> Deserialize<'de> for AtomicI64

source§

fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>
where - D: Deserializer<'de>,

source§

impl<'de> Deserialize<'de> for AtomicIsize

source§

fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>
where - D: Deserializer<'de>,

source§

impl<'de> Deserialize<'de> for AtomicU8

source§

fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>
where - D: Deserializer<'de>,

source§

impl<'de> Deserialize<'de> for AtomicU16

source§

fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>
where - D: Deserializer<'de>,

source§

impl<'de> Deserialize<'de> for AtomicU32

source§

fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>
where - D: Deserializer<'de>,

source§

impl<'de> Deserialize<'de> for AtomicU64

source§

fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>
where - D: Deserializer<'de>,

source§

impl<'de> Deserialize<'de> for AtomicUsize

source§

fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>
where - D: Deserializer<'de>,

source§

impl<'de> Deserialize<'de> for Duration

source§

fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>
where - D: Deserializer<'de>,

source§

impl<'de> Deserialize<'de> for OsString

source§

fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>
where - D: Deserializer<'de>,

source§

impl<'de> Deserialize<'de> for PathBuf

source§

fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>
where - D: Deserializer<'de>,

source§

impl<'de> Deserialize<'de> for SystemTime

source§

fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>
where + D: Deserializer<'de>,

source§

impl<'de> Deserialize<'de> for AtomicBool

source§

fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>
where + D: Deserializer<'de>,

source§

impl<'de> Deserialize<'de> for AtomicI8

source§

fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>
where + D: Deserializer<'de>,

source§

impl<'de> Deserialize<'de> for AtomicI16

source§

fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>
where + D: Deserializer<'de>,

source§

impl<'de> Deserialize<'de> for AtomicI32

source§

fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>
where + D: Deserializer<'de>,

source§

impl<'de> Deserialize<'de> for AtomicI64

source§

fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>
where + D: Deserializer<'de>,

source§

impl<'de> Deserialize<'de> for AtomicIsize

source§

fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>
where + D: Deserializer<'de>,

source§

impl<'de> Deserialize<'de> for AtomicU8

source§

fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>
where + D: Deserializer<'de>,

source§

impl<'de> Deserialize<'de> for AtomicU16

source§

fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>
where + D: Deserializer<'de>,

source§

impl<'de> Deserialize<'de> for AtomicU32

source§

fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>
where + D: Deserializer<'de>,

source§

impl<'de> Deserialize<'de> for AtomicU64

source§

fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>
where + D: Deserializer<'de>,

source§

impl<'de> Deserialize<'de> for AtomicUsize

source§

fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>
where + D: Deserializer<'de>,

source§

impl<'de> Deserialize<'de> for Duration

source§

fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>
where + D: Deserializer<'de>,

source§

impl<'de> Deserialize<'de> for OsString

source§

fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>
where + D: Deserializer<'de>,

source§

impl<'de> Deserialize<'de> for PathBuf

source§

fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>
where + D: Deserializer<'de>,

source§

impl<'de> Deserialize<'de> for SystemTime

source§

fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>
where D: Deserializer<'de>,

source§

impl<'de> Deserialize<'de> for NonZeroI8

source§

fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>
where D: Deserializer<'de>,

source§

impl<'de> Deserialize<'de> for NonZeroI16

source§

fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>
where D: Deserializer<'de>,

source§

impl<'de> Deserialize<'de> for NonZeroI32

source§

fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>
where @@ -95,109 +95,245 @@

§Lifetime

D: Deserializer<'de>,

source§

impl<'de> Deserialize<'de> for NonZeroU64

source§

fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>
where D: Deserializer<'de>,

source§

impl<'de> Deserialize<'de> for NonZeroU128

source§

fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>
where D: Deserializer<'de>,

source§

impl<'de> Deserialize<'de> for NonZeroUsize

source§

fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>
where - D: Deserializer<'de>,

source§

impl<'de, 'a, T> Deserialize<'de> for Cow<'a, T>
where + D: Deserializer<'de>,

source§

impl<'de, 'a, T> Deserialize<'de> for Cow<'a, T>
where T: ?Sized + ToOwned, - T::Owned: Deserialize<'de>,

source§

fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>
where - D: Deserializer<'de>,

source§

impl<'de, Idx> Deserialize<'de> for Range<Idx>
where - Idx: Deserialize<'de>,

source§

fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>
where - D: Deserializer<'de>,

source§

impl<'de, Idx> Deserialize<'de> for RangeFrom<Idx>
where - Idx: Deserialize<'de>,

source§

fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>
where - D: Deserializer<'de>,

source§

impl<'de, Idx> Deserialize<'de> for RangeInclusive<Idx>
where - Idx: Deserialize<'de>,

source§

fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>
where - D: Deserializer<'de>,

source§

impl<'de, Idx> Deserialize<'de> for RangeTo<Idx>
where - Idx: Deserialize<'de>,

source§

fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>
where - D: Deserializer<'de>,

source§

impl<'de, K, V> Deserialize<'de> for BTreeMap<K, V>
where + T::Owned: Deserialize<'de>,

source§

fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>
where + D: Deserializer<'de>,

source§

impl<'de, Idx> Deserialize<'de> for Range<Idx>
where + Idx: Deserialize<'de>,

source§

fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>
where + D: Deserializer<'de>,

source§

impl<'de, Idx> Deserialize<'de> for RangeFrom<Idx>
where + Idx: Deserialize<'de>,

source§

fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>
where + D: Deserializer<'de>,

source§

impl<'de, Idx> Deserialize<'de> for RangeInclusive<Idx>
where + Idx: Deserialize<'de>,

source§

fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>
where + D: Deserializer<'de>,

source§

impl<'de, Idx> Deserialize<'de> for RangeTo<Idx>
where + Idx: Deserialize<'de>,

source§

fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>
where + D: Deserializer<'de>,

source§

impl<'de, K, V> Deserialize<'de> for BTreeMap<K, V>
where K: Deserialize<'de> + Ord, - V: Deserialize<'de>,

source§

fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>
where - D: Deserializer<'de>,

source§

impl<'de, K, V, S> Deserialize<'de> for HashMap<K, V, S>
where + V: Deserialize<'de>,

source§

fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>
where + D: Deserializer<'de>,

source§

impl<'de, K, V, S> Deserialize<'de> for HashMap<K, V, S>
where K: Deserialize<'de> + Eq + Hash, V: Deserialize<'de>, - S: BuildHasher + Default,

source§

fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>
where - D: Deserializer<'de>,

source§

impl<'de, T0: Deserialize<'de>> Deserialize<'de> for (T0,)

source§

fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>
where - D: Deserializer<'de>,

source§

impl<'de, T0: Deserialize<'de>, T1: Deserialize<'de>> Deserialize<'de> for (T0, T1)

source§

fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>
where - D: Deserializer<'de>,

source§

impl<'de, T0: Deserialize<'de>, T1: Deserialize<'de>, T2: Deserialize<'de>> Deserialize<'de> for (T0, T1, T2)

source§

fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>
where - D: Deserializer<'de>,

source§

impl<'de, T0: Deserialize<'de>, T1: Deserialize<'de>, T2: Deserialize<'de>, T3: Deserialize<'de>> Deserialize<'de> for (T0, T1, T2, T3)

source§

fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>
where - D: Deserializer<'de>,

source§

impl<'de, T0: Deserialize<'de>, T1: Deserialize<'de>, T2: Deserialize<'de>, T3: Deserialize<'de>, T4: Deserialize<'de>> Deserialize<'de> for (T0, T1, T2, T3, T4)

source§

fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>
where - D: Deserializer<'de>,

source§

impl<'de, T0: Deserialize<'de>, T1: Deserialize<'de>, T2: Deserialize<'de>, T3: Deserialize<'de>, T4: Deserialize<'de>, T5: Deserialize<'de>> Deserialize<'de> for (T0, T1, T2, T3, T4, T5)

source§

fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>
where - D: Deserializer<'de>,

source§

impl<'de, T0: Deserialize<'de>, T1: Deserialize<'de>, T2: Deserialize<'de>, T3: Deserialize<'de>, T4: Deserialize<'de>, T5: Deserialize<'de>, T6: Deserialize<'de>> Deserialize<'de> for (T0, T1, T2, T3, T4, T5, T6)

source§

fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>
where - D: Deserializer<'de>,

source§

impl<'de, T0: Deserialize<'de>, T1: Deserialize<'de>, T2: Deserialize<'de>, T3: Deserialize<'de>, T4: Deserialize<'de>, T5: Deserialize<'de>, T6: Deserialize<'de>, T7: Deserialize<'de>> Deserialize<'de> for (T0, T1, T2, T3, T4, T5, T6, T7)

source§

fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>
where - D: Deserializer<'de>,

source§

impl<'de, T0: Deserialize<'de>, T1: Deserialize<'de>, T2: Deserialize<'de>, T3: Deserialize<'de>, T4: Deserialize<'de>, T5: Deserialize<'de>, T6: Deserialize<'de>, T7: Deserialize<'de>, T8: Deserialize<'de>> Deserialize<'de> for (T0, T1, T2, T3, T4, T5, T6, T7, T8)

source§

fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>
where - D: Deserializer<'de>,

source§

impl<'de, T0: Deserialize<'de>, T1: Deserialize<'de>, T2: Deserialize<'de>, T3: Deserialize<'de>, T4: Deserialize<'de>, T5: Deserialize<'de>, T6: Deserialize<'de>, T7: Deserialize<'de>, T8: Deserialize<'de>, T9: Deserialize<'de>> Deserialize<'de> for (T0, T1, T2, T3, T4, T5, T6, T7, T8, T9)

source§

fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>
where - D: Deserializer<'de>,

source§

impl<'de, T0: Deserialize<'de>, T1: Deserialize<'de>, T2: Deserialize<'de>, T3: Deserialize<'de>, T4: Deserialize<'de>, T5: Deserialize<'de>, T6: Deserialize<'de>, T7: Deserialize<'de>, T8: Deserialize<'de>, T9: Deserialize<'de>, T10: Deserialize<'de>> Deserialize<'de> for (T0, T1, T2, T3, T4, T5, T6, T7, T8, T9, T10)

source§

fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>
where - D: Deserializer<'de>,

source§

impl<'de, T0: Deserialize<'de>, T1: Deserialize<'de>, T2: Deserialize<'de>, T3: Deserialize<'de>, T4: Deserialize<'de>, T5: Deserialize<'de>, T6: Deserialize<'de>, T7: Deserialize<'de>, T8: Deserialize<'de>, T9: Deserialize<'de>, T10: Deserialize<'de>, T11: Deserialize<'de>> Deserialize<'de> for (T0, T1, T2, T3, T4, T5, T6, T7, T8, T9, T10, T11)

source§

fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>
where - D: Deserializer<'de>,

source§

impl<'de, T0: Deserialize<'de>, T1: Deserialize<'de>, T2: Deserialize<'de>, T3: Deserialize<'de>, T4: Deserialize<'de>, T5: Deserialize<'de>, T6: Deserialize<'de>, T7: Deserialize<'de>, T8: Deserialize<'de>, T9: Deserialize<'de>, T10: Deserialize<'de>, T11: Deserialize<'de>, T12: Deserialize<'de>> Deserialize<'de> for (T0, T1, T2, T3, T4, T5, T6, T7, T8, T9, T10, T11, T12)

source§

fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>
where - D: Deserializer<'de>,

source§

impl<'de, T0: Deserialize<'de>, T1: Deserialize<'de>, T2: Deserialize<'de>, T3: Deserialize<'de>, T4: Deserialize<'de>, T5: Deserialize<'de>, T6: Deserialize<'de>, T7: Deserialize<'de>, T8: Deserialize<'de>, T9: Deserialize<'de>, T10: Deserialize<'de>, T11: Deserialize<'de>, T12: Deserialize<'de>, T13: Deserialize<'de>> Deserialize<'de> for (T0, T1, T2, T3, T4, T5, T6, T7, T8, T9, T10, T11, T12, T13)

source§

fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>
where - D: Deserializer<'de>,

source§

impl<'de, T0: Deserialize<'de>, T1: Deserialize<'de>, T2: Deserialize<'de>, T3: Deserialize<'de>, T4: Deserialize<'de>, T5: Deserialize<'de>, T6: Deserialize<'de>, T7: Deserialize<'de>, T8: Deserialize<'de>, T9: Deserialize<'de>, T10: Deserialize<'de>, T11: Deserialize<'de>, T12: Deserialize<'de>, T13: Deserialize<'de>, T14: Deserialize<'de>> Deserialize<'de> for (T0, T1, T2, T3, T4, T5, T6, T7, T8, T9, T10, T11, T12, T13, T14)

source§

fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>
where - D: Deserializer<'de>,

source§

impl<'de, T0: Deserialize<'de>, T1: Deserialize<'de>, T2: Deserialize<'de>, T3: Deserialize<'de>, T4: Deserialize<'de>, T5: Deserialize<'de>, T6: Deserialize<'de>, T7: Deserialize<'de>, T8: Deserialize<'de>, T9: Deserialize<'de>, T10: Deserialize<'de>, T11: Deserialize<'de>, T12: Deserialize<'de>, T13: Deserialize<'de>, T14: Deserialize<'de>, T15: Deserialize<'de>> Deserialize<'de> for (T0, T1, T2, T3, T4, T5, T6, T7, T8, T9, T10, T11, T12, T13, T14, T15)

source§

fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>
where - D: Deserializer<'de>,

source§

impl<'de, T> Deserialize<'de> for Bound<T>
where - T: Deserialize<'de>,

source§

fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>
where + S: BuildHasher + Default,

source§

fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>
where + D: Deserializer<'de>,

source§

impl<'de, T0, T1> Deserialize<'de> for (T0, T1)
where + T0: Deserialize<'de>, + T1: Deserialize<'de>,

source§

fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>
where + D: Deserializer<'de>,

source§

impl<'de, T0, T1, T2> Deserialize<'de> for (T0, T1, T2)
where + T0: Deserialize<'de>, + T1: Deserialize<'de>, + T2: Deserialize<'de>,

source§

fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>
where + D: Deserializer<'de>,

source§

impl<'de, T0, T1, T2, T3> Deserialize<'de> for (T0, T1, T2, T3)
where + T0: Deserialize<'de>, + T1: Deserialize<'de>, + T2: Deserialize<'de>, + T3: Deserialize<'de>,

source§

fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>
where + D: Deserializer<'de>,

source§

impl<'de, T0, T1, T2, T3, T4> Deserialize<'de> for (T0, T1, T2, T3, T4)
where + T0: Deserialize<'de>, + T1: Deserialize<'de>, + T2: Deserialize<'de>, + T3: Deserialize<'de>, + T4: Deserialize<'de>,

source§

fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>
where + D: Deserializer<'de>,

source§

impl<'de, T0, T1, T2, T3, T4, T5> Deserialize<'de> for (T0, T1, T2, T3, T4, T5)
where + T0: Deserialize<'de>, + T1: Deserialize<'de>, + T2: Deserialize<'de>, + T3: Deserialize<'de>, + T4: Deserialize<'de>, + T5: Deserialize<'de>,

source§

fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>
where + D: Deserializer<'de>,

source§

impl<'de, T0, T1, T2, T3, T4, T5, T6> Deserialize<'de> for (T0, T1, T2, T3, T4, T5, T6)
where + T0: Deserialize<'de>, + T1: Deserialize<'de>, + T2: Deserialize<'de>, + T3: Deserialize<'de>, + T4: Deserialize<'de>, + T5: Deserialize<'de>, + T6: Deserialize<'de>,

source§

fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>
where + D: Deserializer<'de>,

source§

impl<'de, T0, T1, T2, T3, T4, T5, T6, T7> Deserialize<'de> for (T0, T1, T2, T3, T4, T5, T6, T7)
where + T0: Deserialize<'de>, + T1: Deserialize<'de>, + T2: Deserialize<'de>, + T3: Deserialize<'de>, + T4: Deserialize<'de>, + T5: Deserialize<'de>, + T6: Deserialize<'de>, + T7: Deserialize<'de>,

source§

fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>
where + D: Deserializer<'de>,

source§

impl<'de, T0, T1, T2, T3, T4, T5, T6, T7, T8> Deserialize<'de> for (T0, T1, T2, T3, T4, T5, T6, T7, T8)
where + T0: Deserialize<'de>, + T1: Deserialize<'de>, + T2: Deserialize<'de>, + T3: Deserialize<'de>, + T4: Deserialize<'de>, + T5: Deserialize<'de>, + T6: Deserialize<'de>, + T7: Deserialize<'de>, + T8: Deserialize<'de>,

source§

fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>
where + D: Deserializer<'de>,

source§

impl<'de, T0, T1, T2, T3, T4, T5, T6, T7, T8, T9> Deserialize<'de> for (T0, T1, T2, T3, T4, T5, T6, T7, T8, T9)
where + T0: Deserialize<'de>, + T1: Deserialize<'de>, + T2: Deserialize<'de>, + T3: Deserialize<'de>, + T4: Deserialize<'de>, + T5: Deserialize<'de>, + T6: Deserialize<'de>, + T7: Deserialize<'de>, + T8: Deserialize<'de>, + T9: Deserialize<'de>,

source§

fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>
where + D: Deserializer<'de>,

source§

impl<'de, T0, T1, T2, T3, T4, T5, T6, T7, T8, T9, T10> Deserialize<'de> for (T0, T1, T2, T3, T4, T5, T6, T7, T8, T9, T10)
where + T0: Deserialize<'de>, + T1: Deserialize<'de>, + T2: Deserialize<'de>, + T3: Deserialize<'de>, + T4: Deserialize<'de>, + T5: Deserialize<'de>, + T6: Deserialize<'de>, + T7: Deserialize<'de>, + T8: Deserialize<'de>, + T9: Deserialize<'de>, + T10: Deserialize<'de>,

source§

fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>
where + D: Deserializer<'de>,

source§

impl<'de, T0, T1, T2, T3, T4, T5, T6, T7, T8, T9, T10, T11> Deserialize<'de> for (T0, T1, T2, T3, T4, T5, T6, T7, T8, T9, T10, T11)
where + T0: Deserialize<'de>, + T1: Deserialize<'de>, + T2: Deserialize<'de>, + T3: Deserialize<'de>, + T4: Deserialize<'de>, + T5: Deserialize<'de>, + T6: Deserialize<'de>, + T7: Deserialize<'de>, + T8: Deserialize<'de>, + T9: Deserialize<'de>, + T10: Deserialize<'de>, + T11: Deserialize<'de>,

source§

fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>
where + D: Deserializer<'de>,

source§

impl<'de, T0, T1, T2, T3, T4, T5, T6, T7, T8, T9, T10, T11, T12> Deserialize<'de> for (T0, T1, T2, T3, T4, T5, T6, T7, T8, T9, T10, T11, T12)
where + T0: Deserialize<'de>, + T1: Deserialize<'de>, + T2: Deserialize<'de>, + T3: Deserialize<'de>, + T4: Deserialize<'de>, + T5: Deserialize<'de>, + T6: Deserialize<'de>, + T7: Deserialize<'de>, + T8: Deserialize<'de>, + T9: Deserialize<'de>, + T10: Deserialize<'de>, + T11: Deserialize<'de>, + T12: Deserialize<'de>,

source§

fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>
where + D: Deserializer<'de>,

source§

impl<'de, T0, T1, T2, T3, T4, T5, T6, T7, T8, T9, T10, T11, T12, T13> Deserialize<'de> for (T0, T1, T2, T3, T4, T5, T6, T7, T8, T9, T10, T11, T12, T13)
where + T0: Deserialize<'de>, + T1: Deserialize<'de>, + T2: Deserialize<'de>, + T3: Deserialize<'de>, + T4: Deserialize<'de>, + T5: Deserialize<'de>, + T6: Deserialize<'de>, + T7: Deserialize<'de>, + T8: Deserialize<'de>, + T9: Deserialize<'de>, + T10: Deserialize<'de>, + T11: Deserialize<'de>, + T12: Deserialize<'de>, + T13: Deserialize<'de>,

source§

fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>
where + D: Deserializer<'de>,

source§

impl<'de, T0, T1, T2, T3, T4, T5, T6, T7, T8, T9, T10, T11, T12, T13, T14> Deserialize<'de> for (T0, T1, T2, T3, T4, T5, T6, T7, T8, T9, T10, T11, T12, T13, T14)
where + T0: Deserialize<'de>, + T1: Deserialize<'de>, + T2: Deserialize<'de>, + T3: Deserialize<'de>, + T4: Deserialize<'de>, + T5: Deserialize<'de>, + T6: Deserialize<'de>, + T7: Deserialize<'de>, + T8: Deserialize<'de>, + T9: Deserialize<'de>, + T10: Deserialize<'de>, + T11: Deserialize<'de>, + T12: Deserialize<'de>, + T13: Deserialize<'de>, + T14: Deserialize<'de>,

source§

fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>
where + D: Deserializer<'de>,

source§

impl<'de, T0, T1, T2, T3, T4, T5, T6, T7, T8, T9, T10, T11, T12, T13, T14, T15> Deserialize<'de> for (T0, T1, T2, T3, T4, T5, T6, T7, T8, T9, T10, T11, T12, T13, T14, T15)
where + T0: Deserialize<'de>, + T1: Deserialize<'de>, + T2: Deserialize<'de>, + T3: Deserialize<'de>, + T4: Deserialize<'de>, + T5: Deserialize<'de>, + T6: Deserialize<'de>, + T7: Deserialize<'de>, + T8: Deserialize<'de>, + T9: Deserialize<'de>, + T10: Deserialize<'de>, + T11: Deserialize<'de>, + T12: Deserialize<'de>, + T13: Deserialize<'de>, + T14: Deserialize<'de>, + T15: Deserialize<'de>,

source§

fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>
where + D: Deserializer<'de>,

source§

impl<'de, T> Deserialize<'de> for Bound<T>
where + T: Deserialize<'de>,

source§

fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>
where D: Deserializer<'de>,

source§

impl<'de, T> Deserialize<'de> for Option<T>
where - T: Deserialize<'de>,

source§

fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>
where - D: Deserializer<'de>,

source§

impl<'de, T> Deserialize<'de> for [T; 0]

source§

fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>
where + T: Deserialize<'de>,

source§

fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>
where + D: Deserializer<'de>,

source§

impl<'de, T> Deserialize<'de> for [T; 0]

source§

fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>
where D: Deserializer<'de>,

source§

impl<'de, T> Deserialize<'de> for [T; 1]
where - T: Deserialize<'de>,

source§

fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>
where + T: Deserialize<'de>,

source§

fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>
where D: Deserializer<'de>,

source§

impl<'de, T> Deserialize<'de> for [T; 2]
where - T: Deserialize<'de>,

source§

fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>
where + T: Deserialize<'de>,

source§

fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>
where D: Deserializer<'de>,

source§

impl<'de, T> Deserialize<'de> for [T; 3]
where - T: Deserialize<'de>,

source§

fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>
where + T: Deserialize<'de>,

source§

fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>
where D: Deserializer<'de>,

source§

impl<'de, T> Deserialize<'de> for [T; 4]
where - T: Deserialize<'de>,

source§

fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>
where + T: Deserialize<'de>,

source§

fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>
where D: Deserializer<'de>,

source§

impl<'de, T> Deserialize<'de> for [T; 5]
where - T: Deserialize<'de>,

source§

fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>
where + T: Deserialize<'de>,

source§

fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>
where D: Deserializer<'de>,

source§

impl<'de, T> Deserialize<'de> for [T; 6]
where - T: Deserialize<'de>,

source§

fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>
where + T: Deserialize<'de>,

source§

fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>
where D: Deserializer<'de>,

source§

impl<'de, T> Deserialize<'de> for [T; 7]
where - T: Deserialize<'de>,

source§

fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>
where + T: Deserialize<'de>,

source§

fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>
where D: Deserializer<'de>,

source§

impl<'de, T> Deserialize<'de> for [T; 8]
where - T: Deserialize<'de>,

source§

fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>
where + T: Deserialize<'de>,

source§

fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>
where D: Deserializer<'de>,

source§

impl<'de, T> Deserialize<'de> for [T; 9]
where - T: Deserialize<'de>,

source§

fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>
where + T: Deserialize<'de>,

source§

fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>
where D: Deserializer<'de>,

source§

impl<'de, T> Deserialize<'de> for [T; 10]
where - T: Deserialize<'de>,

source§

fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>
where + T: Deserialize<'de>,

source§

fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>
where D: Deserializer<'de>,

source§

impl<'de, T> Deserialize<'de> for [T; 11]
where - T: Deserialize<'de>,

source§

fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>
where + T: Deserialize<'de>,

source§

fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>
where D: Deserializer<'de>,

source§

impl<'de, T> Deserialize<'de> for [T; 12]
where - T: Deserialize<'de>,

source§

fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>
where + T: Deserialize<'de>,

source§

fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>
where D: Deserializer<'de>,

source§

impl<'de, T> Deserialize<'de> for [T; 13]
where - T: Deserialize<'de>,

source§

fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>
where + T: Deserialize<'de>,

source§

fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>
where D: Deserializer<'de>,

source§

impl<'de, T> Deserialize<'de> for [T; 14]
where - T: Deserialize<'de>,

source§

fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>
where + T: Deserialize<'de>,

source§

fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>
where D: Deserializer<'de>,

source§

impl<'de, T> Deserialize<'de> for [T; 15]
where - T: Deserialize<'de>,

source§

fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>
where + T: Deserialize<'de>,

source§

fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>
where D: Deserializer<'de>,

source§

impl<'de, T> Deserialize<'de> for [T; 16]
where - T: Deserialize<'de>,

source§

fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>
where + T: Deserialize<'de>,

source§

fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>
where D: Deserializer<'de>,

source§

impl<'de, T> Deserialize<'de> for [T; 17]
where - T: Deserialize<'de>,

source§

fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>
where + T: Deserialize<'de>,

source§

fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>
where D: Deserializer<'de>,

source§

impl<'de, T> Deserialize<'de> for [T; 18]
where - T: Deserialize<'de>,

source§

fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>
where + T: Deserialize<'de>,

source§

fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>
where D: Deserializer<'de>,

source§

impl<'de, T> Deserialize<'de> for [T; 19]
where - T: Deserialize<'de>,

source§

fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>
where + T: Deserialize<'de>,

source§

fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>
where D: Deserializer<'de>,

source§

impl<'de, T> Deserialize<'de> for [T; 20]
where - T: Deserialize<'de>,

source§

fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>
where + T: Deserialize<'de>,

source§

fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>
where D: Deserializer<'de>,

source§

impl<'de, T> Deserialize<'de> for [T; 21]
where - T: Deserialize<'de>,

source§

fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>
where + T: Deserialize<'de>,

source§

fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>
where D: Deserializer<'de>,

source§

impl<'de, T> Deserialize<'de> for [T; 22]
where - T: Deserialize<'de>,

source§

fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>
where + T: Deserialize<'de>,

source§

fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>
where D: Deserializer<'de>,

source§

impl<'de, T> Deserialize<'de> for [T; 23]
where - T: Deserialize<'de>,

source§

fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>
where + T: Deserialize<'de>,

source§

fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>
where D: Deserializer<'de>,

source§

impl<'de, T> Deserialize<'de> for [T; 24]
where - T: Deserialize<'de>,

source§

fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>
where + T: Deserialize<'de>,

source§

fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>
where D: Deserializer<'de>,

source§

impl<'de, T> Deserialize<'de> for [T; 25]
where - T: Deserialize<'de>,

source§

fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>
where + T: Deserialize<'de>,

source§

fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>
where D: Deserializer<'de>,

source§

impl<'de, T> Deserialize<'de> for [T; 26]
where - T: Deserialize<'de>,

source§

fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>
where + T: Deserialize<'de>,

source§

fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>
where D: Deserializer<'de>,

source§

impl<'de, T> Deserialize<'de> for [T; 27]
where - T: Deserialize<'de>,

source§

fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>
where + T: Deserialize<'de>,

source§

fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>
where D: Deserializer<'de>,

source§

impl<'de, T> Deserialize<'de> for [T; 28]
where - T: Deserialize<'de>,

source§

fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>
where + T: Deserialize<'de>,

source§

fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>
where D: Deserializer<'de>,

source§

impl<'de, T> Deserialize<'de> for [T; 29]
where - T: Deserialize<'de>,

source§

fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>
where + T: Deserialize<'de>,

source§

fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>
where D: Deserializer<'de>,

source§

impl<'de, T> Deserialize<'de> for [T; 30]
where - T: Deserialize<'de>,

source§

fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>
where + T: Deserialize<'de>,

source§

fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>
where D: Deserializer<'de>,

source§

impl<'de, T> Deserialize<'de> for [T; 31]
where - T: Deserialize<'de>,

source§

fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>
where + T: Deserialize<'de>,

source§

fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>
where D: Deserializer<'de>,

source§

impl<'de, T> Deserialize<'de> for [T; 32]
where - T: Deserialize<'de>,

source§

fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>
where + T: Deserialize<'de>,

source§

fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>
where + D: Deserializer<'de>,

source§

impl<'de, T> Deserialize<'de> for (T,)
where + T: Deserialize<'de>,

source§

fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>
where D: Deserializer<'de>,

source§

impl<'de, T> Deserialize<'de> for BinaryHeap<T>
where T: Deserialize<'de> + Ord,

source§

fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>
where D: Deserializer<'de>,

source§

impl<'de, T> Deserialize<'de> for BTreeSet<T>
where @@ -208,25 +344,25 @@

§Lifetime

T: Deserialize<'de>,

source§

fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>
where D: Deserializer<'de>,

source§

impl<'de, T> Deserialize<'de> for Vec<T>
where T: Deserialize<'de>,

source§

fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>
where - D: Deserializer<'de>,

source§

impl<'de, T> Deserialize<'de> for Cell<T>
where - T: Deserialize<'de> + Copy,

source§

fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>
where + D: Deserializer<'de>,

source§

impl<'de, T> Deserialize<'de> for Cell<T>
where + T: Deserialize<'de> + Copy,

source§

fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>
where D: Deserializer<'de>,

source§

impl<'de, T> Deserialize<'de> for PhantomData<T>
where T: ?Sized,

source§

fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>
where - D: Deserializer<'de>,

source§

impl<'de, T> Deserialize<'de> for Wrapping<T>
where - T: Deserialize<'de>,

source§

fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>
where - D: Deserializer<'de>,

source§

impl<'de, T, E> Deserialize<'de> for Result<T, E>
where + D: Deserializer<'de>,

source§

impl<'de, T> Deserialize<'de> for Wrapping<T>
where + T: Deserialize<'de>,

source§

fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>
where + D: Deserializer<'de>,

source§

impl<'de, T, E> Deserialize<'de> for Result<T, E>
where T: Deserialize<'de>, - E: Deserialize<'de>,

source§

fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>
where + E: Deserialize<'de>,

source§

fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>
where D: Deserializer<'de>,

source§

impl<'de, T, S> Deserialize<'de> for HashSet<T, S>
where T: Deserialize<'de> + Eq + Hash, S: BuildHasher + Default,

source§

fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>
where - D: Deserializer<'de>,

source§

impl<'de, T: Deserialize<'de>> Deserialize<'de> for Box<[T]>

source§

fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>
where - D: Deserializer<'de>,

source§

impl<'de, T: Deserialize<'de>> Deserialize<'de> for Box<T>

source§

fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>
where - D: Deserializer<'de>,

source§

impl<'de, T: Deserialize<'de>> Deserialize<'de> for RefCell<T>

source§

fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>
where + D: Deserializer<'de>,

source§

impl<'de, T: Deserialize<'de>> Deserialize<'de> for Box<[T]>

source§

fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>
where + D: Deserializer<'de>,

source§

impl<'de, T: Deserialize<'de>> Deserialize<'de> for Box<T>

source§

fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>
where + D: Deserializer<'de>,

source§

impl<'de, T: Deserialize<'de>> Deserialize<'de> for RefCell<T>

source§

fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>
where D: Deserializer<'de>,

source§

impl<'de, T: Deserialize<'de>> Deserialize<'de> for Reverse<T>

source§

fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>
where - D: Deserializer<'de>,

source§

impl<'de, T: Deserialize<'de>> Deserialize<'de> for Mutex<T>

source§

fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>
where - D: Deserializer<'de>,

source§

impl<'de, T: Deserialize<'de>> Deserialize<'de> for RwLock<T>

source§

fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>
where + D: Deserializer<'de>,

source§

impl<'de, T: Deserialize<'de>> Deserialize<'de> for Mutex<T>

source§

fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>
where + D: Deserializer<'de>,

source§

impl<'de, T: Deserialize<'de>> Deserialize<'de> for RwLock<T>

source§

fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>
where D: Deserializer<'de>,

source§

impl<'de: 'a, 'a> Deserialize<'de> for &'a str

source§

fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>
where - D: Deserializer<'de>,

source§

impl<'de: 'a, 'a> Deserialize<'de> for &'a Path

source§

fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>
where + D: Deserializer<'de>,

source§

impl<'de: 'a, 'a> Deserialize<'de> for &'a Path

source§

fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>
where D: Deserializer<'de>,

source§

impl<'de: 'a, 'a> Deserialize<'de> for &'a [u8]

source§

fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>
where D: Deserializer<'de>,

Implementors§

source§

impl<'de> Deserialize<'de> for IgnoredAny

\ No newline at end of file diff --git a/serde/de/trait.DeserializeOwned.html b/serde/de/trait.DeserializeOwned.html index 8bebd290c7..b36014d6ef 100644 --- a/serde/de/trait.DeserializeOwned.html +++ b/serde/de/trait.DeserializeOwned.html @@ -1,4 +1,4 @@ -DeserializeOwned in serde::de - Rust
+DeserializeOwned in serde::de - Rust

Trait serde::de::DeserializeOwned

source · 
pub trait DeserializeOwned: for<'de> Deserialize<'de> { }
Expand description

A data structure that can be deserialized without borrowing any data from the deserializer.

This is primarily useful for trait bounds on functions. For example a diff --git a/serde/de/trait.DeserializeSeed.html b/serde/de/trait.DeserializeSeed.html index 4101c3b07a..3b8a0b91f7 100644 --- a/serde/de/trait.DeserializeSeed.html +++ b/serde/de/trait.DeserializeSeed.html @@ -1,4 +1,4 @@ -DeserializeSeed in serde::de - Rust

+DeserializeSeed in serde::de - Rust

Trait serde::de::DeserializeSeed

source · 
pub trait DeserializeSeed<'de>: Sized {
     type Value;
 
diff --git a/serde/de/trait.Deserializer.html b/serde/de/trait.Deserializer.html
index 7374633a39..d695502b9d 100644
--- a/serde/de/trait.Deserializer.html
+++ b/serde/de/trait.Deserializer.html
@@ -1,4 +1,4 @@
-Deserializer in serde::de - Rust

+Deserializer in serde::de - Rust

     
Trait serde::de::Deserializer
source · 
pub trait Deserializer<'de>: Sized {
     type Error: Error;
 
diff --git a/serde/de/trait.EnumAccess.html b/serde/de/trait.EnumAccess.html
index c2342e2dce..c881ea4e01 100644
--- a/serde/de/trait.EnumAccess.html
+++ b/serde/de/trait.EnumAccess.html
@@ -1,4 +1,4 @@
-EnumAccess in serde::de - Rust

+EnumAccess in serde::de - Rust

     
Trait serde::de::EnumAccess
source · 
pub trait EnumAccess<'de>: Sized {
     type Error: Error;
     type Variant: VariantAccess<'de, Error = Self::Error>;
diff --git a/serde/de/trait.Error.html b/serde/de/trait.Error.html
index 9066ef88cf..17a7be0077 100644
--- a/serde/de/trait.Error.html
+++ b/serde/de/trait.Error.html
@@ -1,4 +1,4 @@
-Error in serde::de - Rust

+Error in serde::de - Rust

     
Trait serde::de::Error
source · 
pub trait Error: Sized + StdError {
     // Required method
     fn custom<T>(msg: T) -> Self
diff --git a/serde/de/trait.Expected.html b/serde/de/trait.Expected.html
index 7db3c76148..9166cc01dc 100644
--- a/serde/de/trait.Expected.html
+++ b/serde/de/trait.Expected.html
@@ -1,4 +1,4 @@
-Expected in serde::de - Rust

+Expected in serde::de - Rust

     
Trait serde::de::Expected
source · 
pub trait Expected {
     // Required method
     fn fmt(&self, formatter: &mut Formatter<'_>) -> Result;
diff --git a/serde/de/trait.IntoDeserializer.html b/serde/de/trait.IntoDeserializer.html
index a14a94bae9..d6d8dac456 100644
--- a/serde/de/trait.IntoDeserializer.html
+++ b/serde/de/trait.IntoDeserializer.html
@@ -1,4 +1,4 @@
-IntoDeserializer in serde::de - Rust

+IntoDeserializer in serde::de - Rust

     
Trait serde::de::IntoDeserializer
source · 
pub trait IntoDeserializer<'de, E: Error = Error> {
     type Deserializer: Deserializer<'de, Error = E>;
 
@@ -65,4 +65,4 @@ 
§Example

     E: Error,
§
type Deserializer = SeqDeserializer<<Vec<T> as IntoIterator>::IntoIter, E>
source§
fn into_deserializer(self) -> Self::Deserializer
source§

impl<'de, T, S, E> IntoDeserializer<'de, E> for HashSet<T, S>
where T: IntoDeserializer<'de, E> + Eq + Hash, S: BuildHasher, - E: Error,

§

type Deserializer = SeqDeserializer<<HashSet<T, S> as IntoIterator>::IntoIter, E>

source§

fn into_deserializer(self) -> Self::Deserializer

Implementors§

\ No newline at end of file + E: Error,
§

type Deserializer = SeqDeserializer<<HashSet<T, S> as IntoIterator>::IntoIter, E>

source§

fn into_deserializer(self) -> Self::Deserializer

Implementors§

\ No newline at end of file diff --git a/serde/de/trait.MapAccess.html b/serde/de/trait.MapAccess.html index 4b03a776f3..53770bb2f8 100644 --- a/serde/de/trait.MapAccess.html +++ b/serde/de/trait.MapAccess.html @@ -1,4 +1,4 @@ -MapAccess in serde::de - Rust
+MapAccess in serde::de - Rust

Trait serde::de::MapAccess

source · 
pub trait MapAccess<'de> {
     type Error: Error;
 
diff --git a/serde/de/trait.SeqAccess.html b/serde/de/trait.SeqAccess.html
index 370dd3c816..57791aebd4 100644
--- a/serde/de/trait.SeqAccess.html
+++ b/serde/de/trait.SeqAccess.html
@@ -1,4 +1,4 @@
-SeqAccess in serde::de - Rust

+SeqAccess in serde::de - Rust

     
Trait serde::de::SeqAccess
source · 
pub trait SeqAccess<'de> {
     type Error: Error;
 
diff --git a/serde/de/trait.VariantAccess.html b/serde/de/trait.VariantAccess.html
index d5948d99cc..7b90ea4dd9 100644
--- a/serde/de/trait.VariantAccess.html
+++ b/serde/de/trait.VariantAccess.html
@@ -1,4 +1,4 @@
-VariantAccess in serde::de - Rust

+VariantAccess in serde::de - Rust

     
Trait serde::de::VariantAccess
source · 
pub trait VariantAccess<'de>: Sized {
     type Error: Error;
 
diff --git a/serde/de/trait.Visitor.html b/serde/de/trait.Visitor.html
index 613f7ef992..445ffd6586 100644
--- a/serde/de/trait.Visitor.html
+++ b/serde/de/trait.Visitor.html
@@ -1,4 +1,4 @@
-Visitor in serde::de - Rust

+Visitor in serde::de - Rust

     
Trait serde::de::Visitor
source · 
pub trait Visitor<'de>: Sized {
     type Value;
 
diff --git a/serde/de/value/index.html b/serde/de/value/index.html
index 99084cb7d2..a5b3fa6ca8 100644
--- a/serde/de/value/index.html
+++ b/serde/de/value/index.html
@@ -1,4 +1,4 @@
-serde::de::value - Rust

+serde::de::value - Rust

     
Module serde::de::value
source · 
Expand description
Building blocks for deserializing basic values using the IntoDeserializer
 trait.

 
diff --git a/serde/de/value/struct.BoolDeserializer.html b/serde/de/value/struct.BoolDeserializer.html
index 10b114d903..79616ae717 100644
--- a/serde/de/value/struct.BoolDeserializer.html
+++ b/serde/de/value/struct.BoolDeserializer.html
@@ -1,4 +1,4 @@
-BoolDeserializer in serde::de::value - Rust

+BoolDeserializer in serde::de::value - Rust

     
Struct serde::de::value::BoolDeserializer
source · 
pub struct BoolDeserializer<E> { /* private fields */ }
Expand description
A deserializer holding
 a bool.

 
Implementations§
source§
impl<E> BoolDeserializer<E>
source
pub fn new(value: bool) -> Self
Trait Implementations§
source§
impl<E> Clone for BoolDeserializer<E>
source§
fn clone(&self) -> Self
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<E> Debug for BoolDeserializer<E>
source§
fn fmt(&self, formatter: &mut Formatter<'_>) -> Result
Formats the value using the given formatter. Read more
source§
impl<'de, E> Deserializer<'de> for BoolDeserializer<E>
where
diff --git a/serde/de/value/struct.BorrowedBytesDeserializer.html b/serde/de/value/struct.BorrowedBytesDeserializer.html
index c982d57331..c4f8416c9e 100644
--- a/serde/de/value/struct.BorrowedBytesDeserializer.html
+++ b/serde/de/value/struct.BorrowedBytesDeserializer.html
@@ -1,4 +1,4 @@
-BorrowedBytesDeserializer in serde::de::value - Rust

+BorrowedBytesDeserializer in serde::de::value - Rust

     
Struct serde::de::value::BorrowedBytesDeserializer
source · 
pub struct BorrowedBytesDeserializer<'de, E> { /* private fields */ }
Expand description
A deserializer holding a &[u8] with a lifetime tied to another
 deserializer. Always calls Visitor::visit_borrowed_bytes.

 
Implementations§
source§
impl<'de, E> BorrowedBytesDeserializer<'de, E>
source
pub fn new(value: &'de [u8]) -> Self
Create a new borrowed deserializer from the given borrowed bytes.

diff --git a/serde/de/value/struct.BorrowedStrDeserializer.html b/serde/de/value/struct.BorrowedStrDeserializer.html
index 021c82610f..ba8e2faf17 100644
--- a/serde/de/value/struct.BorrowedStrDeserializer.html
+++ b/serde/de/value/struct.BorrowedStrDeserializer.html
@@ -1,4 +1,4 @@
-BorrowedStrDeserializer in serde::de::value - Rust

+BorrowedStrDeserializer in serde::de::value - Rust

     
Struct serde::de::value::BorrowedStrDeserializer
source · 
pub struct BorrowedStrDeserializer<'de, E> { /* private fields */ }
Expand description
A deserializer holding a &str with a lifetime tied to another
 deserializer.

 
Implementations§
source§
impl<'de, E> BorrowedStrDeserializer<'de, E>
source
pub fn new(value: &'de str) -> BorrowedStrDeserializer<'de, E>
Create a new borrowed deserializer from the given string.

diff --git a/serde/de/value/struct.BytesDeserializer.html b/serde/de/value/struct.BytesDeserializer.html
index 7a072f55e5..6f6142fd82 100644
--- a/serde/de/value/struct.BytesDeserializer.html
+++ b/serde/de/value/struct.BytesDeserializer.html
@@ -1,4 +1,4 @@
-BytesDeserializer in serde::de::value - Rust

+BytesDeserializer in serde::de::value - Rust

     
Struct serde::de::value::BytesDeserializer
source · 
pub struct BytesDeserializer<'a, E> { /* private fields */ }
Expand description
A deserializer holding a &[u8]. Always calls Visitor::visit_bytes.

 
Implementations§
source§
impl<'a, E> BytesDeserializer<'a, E>
source
pub fn new(value: &'a [u8]) -> Self
Create a new deserializer from the given bytes.

 
Trait Implementations§
source§
impl<'a, E> Clone for BytesDeserializer<'a, E>
source§
fn clone(&self) -> Self
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<'a, E> Debug for BytesDeserializer<'a, E>
source§
fn fmt(&self, formatter: &mut Formatter<'_>) -> Result
Formats the value using the given formatter. Read more
source§
impl<'de, 'a, E> Deserializer<'de> for BytesDeserializer<'a, E>
where
diff --git a/serde/de/value/struct.CharDeserializer.html b/serde/de/value/struct.CharDeserializer.html
index 387ea15953..ba10e3b010 100644
--- a/serde/de/value/struct.CharDeserializer.html
+++ b/serde/de/value/struct.CharDeserializer.html
@@ -1,4 +1,4 @@
-CharDeserializer in serde::de::value - Rust

+CharDeserializer in serde::de::value - Rust

     
Struct serde::de::value::CharDeserializer
source · 
pub struct CharDeserializer<E> { /* private fields */ }
Expand description
A deserializer holding
 a char.

 
Implementations§
source§
impl<E> CharDeserializer<E>
source
pub fn new(value: char) -> Self
Trait Implementations§
source§
impl<E> Clone for CharDeserializer<E>
source§
fn clone(&self) -> Self
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<E> Debug for CharDeserializer<E>
source§
fn fmt(&self, formatter: &mut Formatter<'_>) -> Result
Formats the value using the given formatter. Read more
source§
impl<'de, E> Deserializer<'de> for CharDeserializer<E>
where
diff --git a/serde/de/value/struct.CowStrDeserializer.html b/serde/de/value/struct.CowStrDeserializer.html
index 0b903050f2..28fc2b6262 100644
--- a/serde/de/value/struct.CowStrDeserializer.html
+++ b/serde/de/value/struct.CowStrDeserializer.html
@@ -1,7 +1,7 @@
-CowStrDeserializer in serde::de::value - Rust

+CowStrDeserializer in serde::de::value - Rust

     
Struct serde::de::value::CowStrDeserializer
source · 
pub struct CowStrDeserializer<'a, E> { /* private fields */ }
Expand description
A deserializer holding a Cow<str>.

 
Implementations§
source§
impl<'a, E> CowStrDeserializer<'a, E>
source
pub fn new(value: Cow<'a, str>) -> Self
Trait Implementations§
source§
impl<'a, E> Clone for CowStrDeserializer<'a, E>
source§
fn clone(&self) -> Self
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<'a, E> Debug for CowStrDeserializer<'a, E>
source§
fn fmt(&self, formatter: &mut Formatter<'_>) -> Result
Formats the value using the given formatter. Read more
source§
impl<'de, 'a, E> Deserializer<'de> for CowStrDeserializer<'a, E>
where
-    E: Error,
§
type Error = E
The error type that can be returned if some error occurs during
+    E: Error,
§
type Error = E
The error type that can be returned if some error occurs during
 deserialization.
source§
fn deserialize_any<V>(self, visitor: V) -> Result<V::Value, Self::Error>
where
     V: Visitor<'de>,
Require the Deserializer to figure out how to drive the visitor based
 on what data type is in the input. Read more
source§
fn deserialize_enum<V>(
@@ -151,7 +151,7 @@
     V: Visitor<'de>,
Hint that the Deserialize type needs to deserialize a value whose type
 doesn’t matter because it is ignored. Read more
source§
fn is_human_readable(&self) -> bool
Determine whether Deserialize implementations should expect to
 deserialize their human-readable form. Read more
source§
impl<'de, 'a, E> EnumAccess<'de> for CowStrDeserializer<'a, E>
where
-    E: Error,
§
type Error = E
The error type that can be returned if some error occurs during
+    E: Error,
§
type Error = E
The error type that can be returned if some error occurs during
 deserialization.
§
type Variant = UnitOnly<E>
The Visitor that will be used to deserialize the content of the enum
 variant.
source§
fn variant_seed<T>(
     self,
diff --git a/serde/de/value/struct.EnumAccessDeserializer.html b/serde/de/value/struct.EnumAccessDeserializer.html
index b3fa406849..6f0b31372e 100644
--- a/serde/de/value/struct.EnumAccessDeserializer.html
+++ b/serde/de/value/struct.EnumAccessDeserializer.html
@@ -1,4 +1,4 @@
-EnumAccessDeserializer in serde::de::value - Rust

+EnumAccessDeserializer in serde::de::value - Rust

     
Struct serde::de::value::EnumAccessDeserializer
source · 
pub struct EnumAccessDeserializer<A> { /* private fields */ }
Expand description
A deserializer holding an EnumAccess.

 
Implementations§
source§
impl<A> EnumAccessDeserializer<A>
source
pub fn new(access: A) -> Self
Construct a new EnumAccessDeserializer<A>.

 
Trait Implementations§
source§
impl<A: Clone> Clone for EnumAccessDeserializer<A>
source§
fn clone(&self) -> EnumAccessDeserializer<A>
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<A: Debug> Debug for EnumAccessDeserializer<A>
source§
fn fmt(&self, f: &mut Formatter<'_>) -> Result
Formats the value using the given formatter. Read more
source§
impl<'de, A> Deserializer<'de> for EnumAccessDeserializer<A>
where
diff --git a/serde/de/value/struct.Error.html b/serde/de/value/struct.Error.html
index 2b879c3d8b..d4e88ef2a2 100644
--- a/serde/de/value/struct.Error.html
+++ b/serde/de/value/struct.Error.html
@@ -1,7 +1,9 @@
-Error in serde::de::value - Rust

+Error in serde::de::value - Rust

     
Struct serde::de::value::Error
source · 
pub struct Error { /* private fields */ }
Expand description
A minimal representation of all possible errors that can occur using the
 IntoDeserializer trait.

-
Trait Implementations§
source§
impl Clone for Error
source§
fn clone(&self) -> Error
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 Error
source§
fn fmt(&self, formatter: &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
source§
fn custom<T>(msg: T) -> Self
where
+
Trait Implementations§
source§
impl Clone for Error
source§
fn clone(&self) -> Error
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 Error
source§
fn fmt(&self, formatter: &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
source§
fn custom<T>(msg: T) -> Self
where
+    T: Display,
Used when a Serialize implementation encounters any error
+while serializing a type. Read more
source§
impl Error for Error
source§
fn description(&self) -> &str
👎Deprecated since 1.42.0: use the Display impl or to_string()
 Read more
1.30.0 · source§
fn source(&self) -> Option<&(dyn Error + 'static)>
The lower-level source of this error, if any. Read more
1.0.0 · source§
fn cause(&self) -> Option<&dyn Error>
👎Deprecated since 1.33.0: replaced by Error::source, which can support downcasting
source§
fn provide<'a>(&'a self, 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 Error for Error
source§
fn custom<T>(msg: T) -> Self
where
     T: Display,
Raised when there is general error when deserializing a type. Read more
source§
fn invalid_type(unexp: Unexpected<'_>, exp: &dyn Expected) -> Self
Raised when a Deserialize receives a type different from what it was
 expecting. Read more
source§
fn invalid_value(unexp: Unexpected<'_>, exp: &dyn Expected) -> Self
Raised when a Deserialize receives a value of the right type but that
 is wrong for some other reason. Read more
source§
fn invalid_length(len: usize, exp: &dyn Expected) -> Self
Raised when deserializing a sequence or map and the input data contains
@@ -10,9 +12,7 @@
 unrecognized name.
source§
fn missing_field(field: &'static str) -> Self
Raised when a Deserialize struct type expected to receive a required
 field with a particular name but that field was not present in the
 input.
source§
fn duplicate_field(field: &'static str) -> Self
Raised when a Deserialize struct type received more than one of the
-same field.
source§
impl Error for Error
source§
fn custom<T>(msg: T) -> Self
where
-    T: Display,
Used when a Serialize implementation encounters any error
-while serializing a type. Read more
source§
impl Error for Error
source§
fn description(&self) -> &str
👎Deprecated since 1.42.0: use the Display impl or to_string()
 Read more
1.30.0 · source§
fn source(&self) -> Option<&(dyn Error + 'static)>
The lower-level source of this error, if any. Read more
1.0.0 · source§
fn cause(&self) -> Option<&dyn Error>
👎Deprecated since 1.33.0: replaced by Error::source, which can support downcasting
source§
fn provide<'a>(&'a self, 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 PartialEq for Error
source§
fn eq(&self, other: &Error) -> bool
This method tests for self and other values to be equal, and is used
+same field.
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 StructuralPartialEq for Error
Auto Trait Implementations§
§
impl Freeze for Error
§
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 T
where
     T: 'static + ?Sized,
source§
fn type_id(&self) -> TypeId
Gets the TypeId of self. Read more
source§
impl<T> Borrow<T> for T
where
diff --git a/serde/de/value/struct.F32Deserializer.html b/serde/de/value/struct.F32Deserializer.html
index 48c486835b..e59566a416 100644
--- a/serde/de/value/struct.F32Deserializer.html
+++ b/serde/de/value/struct.F32Deserializer.html
@@ -1,4 +1,4 @@
-F32Deserializer in serde::de::value - Rust

+F32Deserializer in serde::de::value - Rust

     
Struct serde::de::value::F32Deserializer
source · 
pub struct F32Deserializer<E> { /* private fields */ }
Expand description
A deserializer holding
 an f32.

 
Implementations§
source§
impl<E> F32Deserializer<E>
source
pub fn new(value: f32) -> Self
Trait Implementations§
source§
impl<E> Clone for F32Deserializer<E>
source§
fn clone(&self) -> Self
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<E> Debug for F32Deserializer<E>
source§
fn fmt(&self, formatter: &mut Formatter<'_>) -> Result
Formats the value using the given formatter. Read more
source§
impl<'de, E> Deserializer<'de> for F32Deserializer<E>
where
diff --git a/serde/de/value/struct.F64Deserializer.html b/serde/de/value/struct.F64Deserializer.html
index 4ab6181a17..f64ea1439d 100644
--- a/serde/de/value/struct.F64Deserializer.html
+++ b/serde/de/value/struct.F64Deserializer.html
@@ -1,4 +1,4 @@
-F64Deserializer in serde::de::value - Rust

+F64Deserializer in serde::de::value - Rust

     
Struct serde::de::value::F64Deserializer
source · 
pub struct F64Deserializer<E> { /* private fields */ }
Expand description
A deserializer holding
 an f64.

 
Implementations§
source§
impl<E> F64Deserializer<E>
source
pub fn new(value: f64) -> Self
Trait Implementations§
source§
impl<E> Clone for F64Deserializer<E>
source§
fn clone(&self) -> Self
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<E> Debug for F64Deserializer<E>
source§
fn fmt(&self, formatter: &mut Formatter<'_>) -> Result
Formats the value using the given formatter. Read more
source§
impl<'de, E> Deserializer<'de> for F64Deserializer<E>
where
diff --git a/serde/de/value/struct.I128Deserializer.html b/serde/de/value/struct.I128Deserializer.html
index 5f153958d7..e0a9d2cd24 100644
--- a/serde/de/value/struct.I128Deserializer.html
+++ b/serde/de/value/struct.I128Deserializer.html
@@ -1,4 +1,4 @@
-I128Deserializer in serde::de::value - Rust

+I128Deserializer in serde::de::value - Rust

     
Struct serde::de::value::I128Deserializer
source · 
pub struct I128Deserializer<E> { /* private fields */ }
Expand description
A deserializer holding
 an i128.

 
Implementations§
source§
impl<E> I128Deserializer<E>
source
pub fn new(value: i128) -> Self
Trait Implementations§
source§
impl<E> Clone for I128Deserializer<E>
source§
fn clone(&self) -> Self
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<E> Debug for I128Deserializer<E>
source§
fn fmt(&self, formatter: &mut Formatter<'_>) -> Result
Formats the value using the given formatter. Read more
source§
impl<'de, E> Deserializer<'de> for I128Deserializer<E>
where
diff --git a/serde/de/value/struct.I16Deserializer.html b/serde/de/value/struct.I16Deserializer.html
index d97ff117a5..cb0e2eebc6 100644
--- a/serde/de/value/struct.I16Deserializer.html
+++ b/serde/de/value/struct.I16Deserializer.html
@@ -1,4 +1,4 @@
-I16Deserializer in serde::de::value - Rust

+I16Deserializer in serde::de::value - Rust

     
Struct serde::de::value::I16Deserializer
source · 
pub struct I16Deserializer<E> { /* private fields */ }
Expand description
A deserializer holding
 an i16.

 
Implementations§
source§
impl<E> I16Deserializer<E>
source
pub fn new(value: i16) -> Self
Trait Implementations§
source§
impl<E> Clone for I16Deserializer<E>
source§
fn clone(&self) -> Self
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<E> Debug for I16Deserializer<E>
source§
fn fmt(&self, formatter: &mut Formatter<'_>) -> Result
Formats the value using the given formatter. Read more
source§
impl<'de, E> Deserializer<'de> for I16Deserializer<E>
where
diff --git a/serde/de/value/struct.I32Deserializer.html b/serde/de/value/struct.I32Deserializer.html
index b41414f684..e223be10ec 100644
--- a/serde/de/value/struct.I32Deserializer.html
+++ b/serde/de/value/struct.I32Deserializer.html
@@ -1,4 +1,4 @@
-I32Deserializer in serde::de::value - Rust

+I32Deserializer in serde::de::value - Rust

     
Struct serde::de::value::I32Deserializer
source · 
pub struct I32Deserializer<E> { /* private fields */ }
Expand description
A deserializer holding
 an i32.

 
Implementations§
source§
impl<E> I32Deserializer<E>
source
pub fn new(value: i32) -> Self
Trait Implementations§
source§
impl<E> Clone for I32Deserializer<E>
source§
fn clone(&self) -> Self
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<E> Debug for I32Deserializer<E>
source§
fn fmt(&self, formatter: &mut Formatter<'_>) -> Result
Formats the value using the given formatter. Read more
source§
impl<'de, E> Deserializer<'de> for I32Deserializer<E>
where
diff --git a/serde/de/value/struct.I64Deserializer.html b/serde/de/value/struct.I64Deserializer.html
index ae0611e4ee..a60ff175d3 100644
--- a/serde/de/value/struct.I64Deserializer.html
+++ b/serde/de/value/struct.I64Deserializer.html
@@ -1,4 +1,4 @@
-I64Deserializer in serde::de::value - Rust

+I64Deserializer in serde::de::value - Rust

     
Struct serde::de::value::I64Deserializer
source · 
pub struct I64Deserializer<E> { /* private fields */ }
Expand description
A deserializer holding
 an i64.

 
Implementations§
source§
impl<E> I64Deserializer<E>
source
pub fn new(value: i64) -> Self
Trait Implementations§
source§
impl<E> Clone for I64Deserializer<E>
source§
fn clone(&self) -> Self
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<E> Debug for I64Deserializer<E>
source§
fn fmt(&self, formatter: &mut Formatter<'_>) -> Result
Formats the value using the given formatter. Read more
source§
impl<'de, E> Deserializer<'de> for I64Deserializer<E>
where
diff --git a/serde/de/value/struct.I8Deserializer.html b/serde/de/value/struct.I8Deserializer.html
index 7ecd18c164..47782a222d 100644
--- a/serde/de/value/struct.I8Deserializer.html
+++ b/serde/de/value/struct.I8Deserializer.html
@@ -1,4 +1,4 @@
-I8Deserializer in serde::de::value - Rust

+I8Deserializer in serde::de::value - Rust

     
Struct serde::de::value::I8Deserializer
source · 
pub struct I8Deserializer<E> { /* private fields */ }
Expand description
A deserializer holding
 an i8.

 
Implementations§
source§
impl<E> I8Deserializer<E>
source
pub fn new(value: i8) -> Self
Trait Implementations§
source§
impl<E> Clone for I8Deserializer<E>
source§
fn clone(&self) -> Self
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<E> Debug for I8Deserializer<E>
source§
fn fmt(&self, formatter: &mut Formatter<'_>) -> Result
Formats the value using the given formatter. Read more
source§
impl<'de, E> Deserializer<'de> for I8Deserializer<E>
where
diff --git a/serde/de/value/struct.IsizeDeserializer.html b/serde/de/value/struct.IsizeDeserializer.html
index b9041063bc..89a970582e 100644
--- a/serde/de/value/struct.IsizeDeserializer.html
+++ b/serde/de/value/struct.IsizeDeserializer.html
@@ -1,4 +1,4 @@
-IsizeDeserializer in serde::de::value - Rust

+IsizeDeserializer in serde::de::value - Rust

     
Struct serde::de::value::IsizeDeserializer
source · 
pub struct IsizeDeserializer<E> { /* private fields */ }
Expand description
A deserializer holding
 an isize.

 
Implementations§
source§
impl<E> IsizeDeserializer<E>
source
pub fn new(value: isize) -> Self
Trait Implementations§
source§
impl<E> Clone for IsizeDeserializer<E>
source§
fn clone(&self) -> Self
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<E> Debug for IsizeDeserializer<E>
source§
fn fmt(&self, formatter: &mut Formatter<'_>) -> Result
Formats the value using the given formatter. Read more
source§
impl<'de, E> Deserializer<'de> for IsizeDeserializer<E>
where
diff --git a/serde/de/value/struct.MapAccessDeserializer.html b/serde/de/value/struct.MapAccessDeserializer.html
index e12643e77a..41d68e7986 100644
--- a/serde/de/value/struct.MapAccessDeserializer.html
+++ b/serde/de/value/struct.MapAccessDeserializer.html
@@ -1,4 +1,4 @@
-MapAccessDeserializer in serde::de::value - Rust

+MapAccessDeserializer in serde::de::value - Rust

     
Struct serde::de::value::MapAccessDeserializer
source · 
pub struct MapAccessDeserializer<A> { /* private fields */ }
Expand description
A deserializer holding a MapAccess.

 
Implementations§
source§
impl<A> MapAccessDeserializer<A>
source
pub fn new(map: A) -> Self
Construct a new MapAccessDeserializer<A>.

 
Trait Implementations§
source§
impl<A: Clone> Clone for MapAccessDeserializer<A>
source§
fn clone(&self) -> MapAccessDeserializer<A>
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<A: Debug> Debug for MapAccessDeserializer<A>
source§
fn fmt(&self, f: &mut Formatter<'_>) -> Result
Formats the value using the given formatter. Read more
source§
impl<'de, A> Deserializer<'de> for MapAccessDeserializer<A>
where
diff --git a/serde/de/value/struct.MapDeserializer.html b/serde/de/value/struct.MapDeserializer.html
index a4feb86e9b..790e809100 100644
--- a/serde/de/value/struct.MapDeserializer.html
+++ b/serde/de/value/struct.MapDeserializer.html
@@ -1,4 +1,4 @@
-MapDeserializer in serde::de::value - Rust

+MapDeserializer in serde::de::value - Rust

     
Struct serde::de::value::MapDeserializer
source · 
pub struct MapDeserializer<'de, I, E>
where
     I: Iterator,
     I::Item: Pair,
{ /* private fields */ }
Expand description
A deserializer that iterates over a map.

@@ -21,7 +21,7 @@
     I::Item: Pair,
     <I::Item as Pair>::First: IntoDeserializer<'de, E>,
     <I::Item as Pair>::Second: IntoDeserializer<'de, E>,
-    E: Error,
§
type Error = E
The error type that can be returned if some error occurs during
+    E: Error,
§
type Error = E
The error type that can be returned if some error occurs during
 deserialization.
source§
fn deserialize_any<V>(self, visitor: V) -> Result<V::Value, Self::Error>
where
     V: Visitor<'de>,
Require the Deserializer to figure out how to drive the visitor based
 on what data type is in the input. Read more
source§
fn deserialize_seq<V>(self, visitor: V) -> Result<V::Value, Self::Error>
where
@@ -194,7 +194,7 @@
     I::Item: Pair,
     <I::Item as Pair>::First: IntoDeserializer<'de, E>,
     <I::Item as Pair>::Second: IntoDeserializer<'de, E>,
-    E: Error,
§
type Error = E
The error type that can be returned if some error occurs during
+    E: Error,
§
type Error = E
The error type that can be returned if some error occurs during
 deserialization.
source§
fn next_element_seed<T>(
     &mut self,
     seed: T
diff --git a/serde/de/value/struct.SeqAccessDeserializer.html b/serde/de/value/struct.SeqAccessDeserializer.html
index ab0b8b09a7..e65a596b09 100644
--- a/serde/de/value/struct.SeqAccessDeserializer.html
+++ b/serde/de/value/struct.SeqAccessDeserializer.html
@@ -1,4 +1,4 @@
-SeqAccessDeserializer in serde::de::value - Rust

+SeqAccessDeserializer in serde::de::value - Rust

     
Struct serde::de::value::SeqAccessDeserializer
source · 
pub struct SeqAccessDeserializer<A> { /* private fields */ }
Expand description
A deserializer holding a SeqAccess.

 
Implementations§
source§
impl<A> SeqAccessDeserializer<A>
source
pub fn new(seq: A) -> Self
Construct a new SeqAccessDeserializer<A>.

 
Trait Implementations§
source§
impl<A: Clone> Clone for SeqAccessDeserializer<A>
source§
fn clone(&self) -> SeqAccessDeserializer<A>
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<A: Debug> Debug for SeqAccessDeserializer<A>
source§
fn fmt(&self, f: &mut Formatter<'_>) -> Result
Formats the value using the given formatter. Read more
source§
impl<'de, A> Deserializer<'de> for SeqAccessDeserializer<A>
where
diff --git a/serde/de/value/struct.SeqDeserializer.html b/serde/de/value/struct.SeqDeserializer.html
index 097572b65b..e2458d3ce2 100644
--- a/serde/de/value/struct.SeqDeserializer.html
+++ b/serde/de/value/struct.SeqDeserializer.html
@@ -1,4 +1,4 @@
-SeqDeserializer in serde::de::value - Rust

+SeqDeserializer in serde::de::value - Rust

     
Struct serde::de::value::SeqDeserializer
source · 
pub struct SeqDeserializer<I, E> { /* private fields */ }
Expand description
A deserializer that iterates over a sequence.

 
Implementations§
source§
impl<I, E> SeqDeserializer<I, E>
where
     I: Iterator,
source
pub fn new(iter: I) -> Self
Construct a new SeqDeserializer<I, E>.

@@ -10,7 +10,7 @@
     I: Debug,
source§
fn fmt(&self, formatter: &mut Formatter<'_>) -> Result
Formats the value using the given formatter. Read more
source§
impl<'de, I, T, E> Deserializer<'de> for SeqDeserializer<I, E>
where
     I: Iterator<Item = T>,
     T: IntoDeserializer<'de, E>,
-    E: Error,
§
type Error = E
The error type that can be returned if some error occurs during
+    E: Error,
§
type Error = E
The error type that can be returned if some error occurs during
 deserialization.
source§
fn deserialize_any<V>(self, visitor: V) -> Result<V::Value, Self::Error>
where
     V: Visitor<'de>,
Require the Deserializer to figure out how to drive the visitor based
 on what data type is in the input. Read more
source§
fn deserialize_bool<V>(
@@ -162,7 +162,7 @@
 deserialize their human-readable form. Read more
source§
impl<'de, I, T, E> SeqAccess<'de> for SeqDeserializer<I, E>
where
     I: Iterator<Item = T>,
     T: IntoDeserializer<'de, E>,
-    E: Error,
§
type Error = E
The error type that can be returned if some error occurs during
+    E: Error,
§
type Error = E
The error type that can be returned if some error occurs during
 deserialization.
source§
fn next_element_seed<V>(
     &mut self,
     seed: V
diff --git a/serde/de/value/struct.StrDeserializer.html b/serde/de/value/struct.StrDeserializer.html
index 318373c5f8..e2e9416f37 100644
--- a/serde/de/value/struct.StrDeserializer.html
+++ b/serde/de/value/struct.StrDeserializer.html
@@ -1,4 +1,4 @@
-StrDeserializer in serde::de::value - Rust

+StrDeserializer in serde::de::value - Rust

     
Struct serde::de::value::StrDeserializer
source · 
pub struct StrDeserializer<'a, E> { /* private fields */ }
Expand description
A deserializer holding a &str.

 
Implementations§
source§
impl<'a, E> StrDeserializer<'a, E>
source
pub fn new(value: &'a str) -> Self
Trait Implementations§
source§
impl<'de, E> Clone for StrDeserializer<'de, E>
source§
fn clone(&self) -> Self
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<'a, E> Debug for StrDeserializer<'a, E>
source§
fn fmt(&self, formatter: &mut Formatter<'_>) -> Result
Formats the value using the given formatter. Read more
source§
impl<'de, 'a, E> Deserializer<'de> for StrDeserializer<'a, E>
where
     E: Error,
§
type Error = E
The error type that can be returned if some error occurs during
diff --git a/serde/de/value/struct.StringDeserializer.html b/serde/de/value/struct.StringDeserializer.html
index 7c3e5a6cde..0ffd3298d9 100644
--- a/serde/de/value/struct.StringDeserializer.html
+++ b/serde/de/value/struct.StringDeserializer.html
@@ -1,4 +1,4 @@
-StringDeserializer in serde::de::value - Rust

+StringDeserializer in serde::de::value - Rust

     
Struct serde::de::value::StringDeserializer
source · 
pub struct StringDeserializer<E> { /* private fields */ }
Expand description
A deserializer holding a String.

 
Implementations§
source§
impl<E> StringDeserializer<E>
source
pub fn new(value: String) -> Self
Trait Implementations§
source§
impl<E> Clone for StringDeserializer<E>
source§
fn clone(&self) -> Self
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<E> Debug for StringDeserializer<E>
source§
fn fmt(&self, formatter: &mut Formatter<'_>) -> Result
Formats the value using the given formatter. Read more
source§
impl<'de, E> Deserializer<'de> for StringDeserializer<E>
where
     E: Error,
§
type Error = E
The error type that can be returned if some error occurs during
diff --git a/serde/de/value/struct.U128Deserializer.html b/serde/de/value/struct.U128Deserializer.html
index 3cd4c57d74..5d190ec038 100644
--- a/serde/de/value/struct.U128Deserializer.html
+++ b/serde/de/value/struct.U128Deserializer.html
@@ -1,4 +1,4 @@
-U128Deserializer in serde::de::value - Rust

+U128Deserializer in serde::de::value - Rust

     
Struct serde::de::value::U128Deserializer
source · 
pub struct U128Deserializer<E> { /* private fields */ }
Expand description
A deserializer holding
 a u128.

 
Implementations§
source§
impl<E> U128Deserializer<E>
source
pub fn new(value: u128) -> Self
Trait Implementations§
source§
impl<E> Clone for U128Deserializer<E>
source§
fn clone(&self) -> Self
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<E> Debug for U128Deserializer<E>
source§
fn fmt(&self, formatter: &mut Formatter<'_>) -> Result
Formats the value using the given formatter. Read more
source§
impl<'de, E> Deserializer<'de> for U128Deserializer<E>
where
diff --git a/serde/de/value/struct.U16Deserializer.html b/serde/de/value/struct.U16Deserializer.html
index 65e161e600..9828b76a6a 100644
--- a/serde/de/value/struct.U16Deserializer.html
+++ b/serde/de/value/struct.U16Deserializer.html
@@ -1,4 +1,4 @@
-U16Deserializer in serde::de::value - Rust

+U16Deserializer in serde::de::value - Rust

     
Struct serde::de::value::U16Deserializer
source · 
pub struct U16Deserializer<E> { /* private fields */ }
Expand description
A deserializer holding
 a u16.

 
Implementations§
source§
impl<E> U16Deserializer<E>
source
pub fn new(value: u16) -> Self
Trait Implementations§
source§
impl<E> Clone for U16Deserializer<E>
source§
fn clone(&self) -> Self
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<E> Debug for U16Deserializer<E>
source§
fn fmt(&self, formatter: &mut Formatter<'_>) -> Result
Formats the value using the given formatter. Read more
source§
impl<'de, E> Deserializer<'de> for U16Deserializer<E>
where
diff --git a/serde/de/value/struct.U32Deserializer.html b/serde/de/value/struct.U32Deserializer.html
index bb0d8e3aff..07fbb56b3a 100644
--- a/serde/de/value/struct.U32Deserializer.html
+++ b/serde/de/value/struct.U32Deserializer.html
@@ -1,7 +1,7 @@
-U32Deserializer in serde::de::value - Rust

+U32Deserializer in serde::de::value - Rust

     
Struct serde::de::value::U32Deserializer
source · 
pub struct U32Deserializer<E> { /* private fields */ }
Expand description
A deserializer holding a u32.

 
Implementations§
source§
impl<E> U32Deserializer<E>
source
pub fn new(value: u32) -> Self
Trait Implementations§
source§
impl<E> Clone for U32Deserializer<E>
source§
fn clone(&self) -> Self
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<E> Debug for U32Deserializer<E>
source§
fn fmt(&self, formatter: &mut Formatter<'_>) -> Result
Formats the value using the given formatter. Read more
source§
impl<'de, E> Deserializer<'de> for U32Deserializer<E>
where
-    E: Error,
§
type Error = E
The error type that can be returned if some error occurs during
+    E: Error,
§
type Error = E
The error type that can be returned if some error occurs during
 deserialization.
source§
fn deserialize_bool<V>(
     self,
     visitor: V
@@ -151,7 +151,7 @@
     V: Visitor<'de>,
Hint that the Deserialize type is expecting an enum value with a
 particular name and possible variants.
source§
fn is_human_readable(&self) -> bool
Determine whether Deserialize implementations should expect to
 deserialize their human-readable form. Read more
source§
impl<'de, E> EnumAccess<'de> for U32Deserializer<E>
where
-    E: Error,
§
type Error = E
The error type that can be returned if some error occurs during
+    E: Error,
§
type Error = E
The error type that can be returned if some error occurs during
 deserialization.
§
type Variant = UnitOnly<E>
The Visitor that will be used to deserialize the content of the enum
 variant.
source§
fn variant_seed<T>(
     self,
diff --git a/serde/de/value/struct.U64Deserializer.html b/serde/de/value/struct.U64Deserializer.html
index 9d50d83e8e..7da01c7bdc 100644
--- a/serde/de/value/struct.U64Deserializer.html
+++ b/serde/de/value/struct.U64Deserializer.html
@@ -1,4 +1,4 @@
-U64Deserializer in serde::de::value - Rust

+U64Deserializer in serde::de::value - Rust

     
Struct serde::de::value::U64Deserializer
source · 
pub struct U64Deserializer<E> { /* private fields */ }
Expand description
A deserializer holding
 a u64.

 
Implementations§
source§
impl<E> U64Deserializer<E>
source
pub fn new(value: u64) -> Self
Trait Implementations§
source§
impl<E> Clone for U64Deserializer<E>
source§
fn clone(&self) -> Self
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<E> Debug for U64Deserializer<E>
source§
fn fmt(&self, formatter: &mut Formatter<'_>) -> Result
Formats the value using the given formatter. Read more
source§
impl<'de, E> Deserializer<'de> for U64Deserializer<E>
where
diff --git a/serde/de/value/struct.U8Deserializer.html b/serde/de/value/struct.U8Deserializer.html
index dc9aa15c20..8d18297d0a 100644
--- a/serde/de/value/struct.U8Deserializer.html
+++ b/serde/de/value/struct.U8Deserializer.html
@@ -1,4 +1,4 @@
-U8Deserializer in serde::de::value - Rust

+U8Deserializer in serde::de::value - Rust

     
Struct serde::de::value::U8Deserializer
source · 
pub struct U8Deserializer<E> { /* private fields */ }
Expand description
A deserializer holding
 a u8.

 
Implementations§
source§
impl<E> U8Deserializer<E>
source
pub fn new(value: u8) -> Self
Trait Implementations§
source§
impl<E> Clone for U8Deserializer<E>
source§
fn clone(&self) -> Self
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<E> Debug for U8Deserializer<E>
source§
fn fmt(&self, formatter: &mut Formatter<'_>) -> Result
Formats the value using the given formatter. Read more
source§
impl<'de, E> Deserializer<'de> for U8Deserializer<E>
where
diff --git a/serde/de/value/struct.UnitDeserializer.html b/serde/de/value/struct.UnitDeserializer.html
index 58463b2812..aa67c934c3 100644
--- a/serde/de/value/struct.UnitDeserializer.html
+++ b/serde/de/value/struct.UnitDeserializer.html
@@ -1,4 +1,4 @@
-UnitDeserializer in serde::de::value - Rust

+UnitDeserializer in serde::de::value - Rust

     
Struct serde::de::value::UnitDeserializer
source · 
pub struct UnitDeserializer<E> { /* private fields */ }
Expand description
A deserializer holding a ().

 
Implementations§
source§
impl<E> UnitDeserializer<E>
source
pub fn new() -> Self
Trait Implementations§
source§
impl<E> Clone for UnitDeserializer<E>
source§
fn clone(&self) -> Self
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<E> Debug for UnitDeserializer<E>
source§
fn fmt(&self, formatter: &mut Formatter<'_>) -> Result
Formats the value using the given formatter. Read more
source§
impl<'de, E> Deserializer<'de> for UnitDeserializer<E>
where
     E: Error,
§
type Error = E
The error type that can be returned if some error occurs during
diff --git a/serde/de/value/struct.UsizeDeserializer.html b/serde/de/value/struct.UsizeDeserializer.html
index 4a79073520..dacc2cfdad 100644
--- a/serde/de/value/struct.UsizeDeserializer.html
+++ b/serde/de/value/struct.UsizeDeserializer.html
@@ -1,4 +1,4 @@
-UsizeDeserializer in serde::de::value - Rust

+UsizeDeserializer in serde::de::value - Rust

     
Struct serde::de::value::UsizeDeserializer
source · 
pub struct UsizeDeserializer<E> { /* private fields */ }
Expand description
A deserializer holding
 a usize.

 
Implementations§
source§
impl<E> UsizeDeserializer<E>
source
pub fn new(value: usize) -> Self
Trait Implementations§
source§
impl<E> Clone for UsizeDeserializer<E>
source§
fn clone(&self) -> Self
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<E> Debug for UsizeDeserializer<E>
source§
fn fmt(&self, formatter: &mut Formatter<'_>) -> Result
Formats the value using the given formatter. Read more
source§
impl<'de, E> Deserializer<'de> for UsizeDeserializer<E>
where
diff --git a/serde/derive.Deserialize.html b/serde/derive.Deserialize.html
index 94721572b1..5cc410e377 100644
--- a/serde/derive.Deserialize.html
+++ b/serde/derive.Deserialize.html
@@ -1,4 +1,4 @@
-Deserialize in serde - Rust

+Deserialize in serde - Rust

     
Derive Macro serde::Deserialize
source · 
#[derive(Deserialize)]
 {
     // Attributes available to this derive:
diff --git a/serde/derive.Serialize.html b/serde/derive.Serialize.html
index caeb1776eb..1a5589fbb4 100644
--- a/serde/derive.Serialize.html
+++ b/serde/derive.Serialize.html
@@ -1,4 +1,4 @@
-Serialize in serde - Rust

+Serialize in serde - Rust

     
Derive Macro serde::Serialize
source · 
#[derive(Serialize)]
 {
     // Attributes available to this derive:
diff --git a/serde/index.html b/serde/index.html
index 89487dca94..630a98d1cf 100644
--- a/serde/index.html
+++ b/serde/index.html
@@ -1,6 +1,6 @@
-serde - Rust
Serialize a map value. Read more
source§
fn end(self) -> Result<Ok, Error>
Finish serializing a map.
source§
fn serialize_entry<K, V>(
     &mut self,
     key: &K,
     value: &V
 ) -> Result<(), Self::Error>
where
     K: ?Sized + Serialize,
     V: ?Sized + Serialize,
Serialize a map entry consisting of a key and a value. Read more
source§
impl<Ok, Error> SerializeSeq for Impossible<Ok, Error>
where
-    Error: Error,
§
type Ok = Ok
Must match the Ok type of our Serializer.
§
type Error = Error
Must match the Error type of our Serializer.
source§
fn serialize_element<T>(&mut self, value: &T) -> Result<(), Error>
where
-    T: ?Sized + Serialize,
Serialize a sequence element.
source§
fn end(self) -> Result<Ok, Error>
Finish serializing a sequence.
source§
impl<Ok, Error> SerializeStruct for Impossible<Ok, Error>
where
+    Error: Error,
§
type Ok = Ok
Must match the Ok type of our Serializer.
§
type Error = Error
Must match the Error type of our Serializer.
source§
fn serialize_element<T>(&mut self, value: &T) -> Result<(), Error>
where
+    T: ?Sized + Serialize,
Serialize a sequence element.
source§
fn end(self) -> Result<Ok, Error>
Finish serializing a sequence.
source§
impl<Ok, Error> SerializeStruct for Impossible<Ok, Error>
where
     Error: Error,
§
type Ok = Ok
Must match the Ok type of our Serializer.
§
type Error = Error
Must match the Error type of our Serializer.
source§
fn serialize_field<T>(
     &mut self,
     key: &'static str,
@@ -48,10 +48,10 @@
     value: &T
 ) -> Result<(), Error>
where
     T: ?Sized + Serialize,
Serialize a struct variant field.
source§
fn end(self) -> Result<Ok, Error>
Finish serializing a struct variant.
source§
fn skip_field(&mut self, key: &'static str) -> Result<(), Self::Error>
Indicate that a struct variant field has been skipped. Read more
source§
impl<Ok, Error> SerializeTuple for Impossible<Ok, Error>
where
-    Error: Error,
§
type Ok = Ok
Must match the Ok type of our Serializer.
§
type Error = Error
Must match the Error type of our Serializer.
source§
fn serialize_element<T>(&mut self, value: &T) -> Result<(), Error>
where
+    Error: Error,
§
type Ok = Ok
Must match the Ok type of our Serializer.
§
type Error = Error
Must match the Error type of our Serializer.
source§
fn serialize_element<T>(&mut self, value: &T) -> Result<(), Error>
where
     T: ?Sized + Serialize,
Serialize a tuple element.
source§
fn end(self) -> Result<Ok, Error>
Finish serializing a tuple.
source§
impl<Ok, Error> SerializeTupleStruct for Impossible<Ok, Error>
where
-    Error: Error,
§
type Ok = Ok
Must match the Ok type of our Serializer.
§
type Error = Error
Must match the Error type of our Serializer.
source§
fn serialize_field<T>(&mut self, value: &T) -> Result<(), Error>
where
-    T: ?Sized + Serialize,
Serialize a tuple struct field.
source§
fn end(self) -> Result<Ok, Error>
Finish serializing a tuple struct.
source§
impl<Ok, Error> SerializeTupleVariant for Impossible<Ok, Error>
where
+    Error: Error,
§
type Ok = Ok
Must match the Ok type of our Serializer.
§
type Error = Error
Must match the Error type of our Serializer.
source§
fn serialize_field<T>(&mut self, value: &T) -> Result<(), Error>
where
+    T: ?Sized + Serialize,
Serialize a tuple struct field.
source§
fn end(self) -> Result<Ok, Error>
Finish serializing a tuple struct.
source§
impl<Ok, Error> SerializeTupleVariant for Impossible<Ok, Error>
where
     Error: Error,
§
type Ok = Ok
Must match the Ok type of our Serializer.
§
type Error = Error
Must match the Error type of our Serializer.
source§
fn serialize_field<T>(&mut self, value: &T) -> Result<(), Error>
where
     T: ?Sized + Serialize,
Serialize a tuple variant field.
source§
fn end(self) -> Result<Ok, Error>
Finish serializing a tuple variant.
Auto Trait Implementations§
§
impl<Ok, Error> Freeze for Impossible<Ok, Error>
§
impl<Ok, Error> RefUnwindSafe for Impossible<Ok, Error>
where
     Error: RefUnwindSafe,
diff --git a/serde/ser/trait.Error.html b/serde/ser/trait.Error.html
index 8d0977fd71..10b1642f31 100644
--- a/serde/ser/trait.Error.html
+++ b/serde/ser/trait.Error.html
@@ -1,4 +1,4 @@
-Error in serde::ser - Rust

+Error in serde::ser - Rust

     
Trait serde::ser::Error
source · 
pub trait Error: Sized + StdError {
     // Required method
     fn custom<T>(msg: T) -> Self
diff --git a/serde/ser/trait.Serialize.html b/serde/ser/trait.Serialize.html
index afc8149bf9..d895189fed 100644
--- a/serde/ser/trait.Serialize.html
+++ b/serde/ser/trait.Serialize.html
@@ -1,4 +1,4 @@
-Serialize in serde::ser - Rust

+Serialize in serde::ser - Rust

     
Trait serde::ser::Serialize
source · 
pub trait Serialize {
     // Required method
     fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>
@@ -44,8 +44,8 @@
         s.end()
     }
 }

-
Object Safety§
This trait is not object safe.
Implementations on Foreign Types§
source§
impl Serialize for IpAddr
source§
fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>
where
-    S: Serializer,
source§
impl Serialize for SocketAddr
source§
fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>
where
+
Object Safety§
This trait is not object safe.
Implementations on Foreign Types§
source§
impl Serialize for IpAddr
source§
fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>
where
+    S: Serializer,
source§
impl Serialize for SocketAddr
source§
fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>
where
     S: Serializer,
source§
impl Serialize for bool
source§
fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>
where
     S: Serializer,
source§
impl Serialize for char
source§
fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>
where
     S: Serializer,
source§
impl Serialize for f32
source§
fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>
where
@@ -67,46 +67,46 @@
     S: Serializer,
source§
impl Serialize for CString
source§
fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>
where
     S: Serializer,
source§
impl Serialize for String
source§
fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>
where
     S: Serializer,
source§
impl Serialize for CStr
source§
fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>
where
-    S: Serializer,
source§
impl Serialize for Ipv4Addr
source§
fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>
where
-    S: Serializer,
source§
impl Serialize for Ipv6Addr
source§
fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>
where
-    S: Serializer,
source§
impl Serialize for SocketAddrV4
source§
fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>
where
-    S: Serializer,
source§
impl Serialize for SocketAddrV6
source§
fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>
where
-    S: Serializer,
source§
impl Serialize for AtomicBool
source§
fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>
where
-    S: Serializer,
source§
impl Serialize for AtomicI8
source§
fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>
where
-    S: Serializer,
source§
impl Serialize for AtomicI16
source§
fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>
where
-    S: Serializer,
source§
impl Serialize for AtomicI32
source§
fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>
where
-    S: Serializer,
source§
impl Serialize for AtomicI64
source§
fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>
where
-    S: Serializer,
source§
impl Serialize for AtomicIsize
source§
fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>
where
-    S: Serializer,
source§
impl Serialize for AtomicU8
source§
fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>
where
-    S: Serializer,
source§
impl Serialize for AtomicU16
source§
fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>
where
-    S: Serializer,
source§
impl Serialize for AtomicU32
source§
fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>
where
-    S: Serializer,
source§
impl Serialize for AtomicU64
source§
fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>
where
-    S: Serializer,
source§
impl Serialize for AtomicUsize
source§
fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>
where
-    S: Serializer,
source§
impl Serialize for Duration
source§
fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>
where
-    S: Serializer,
source§
impl Serialize for OsStr
source§
fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>
where
-    S: Serializer,
source§
impl Serialize for OsString
source§
fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>
where
-    S: Serializer,
source§
impl Serialize for Path
source§
fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>
where
-    S: Serializer,
source§
impl Serialize for PathBuf
source§
fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>
where
-    S: Serializer,
source§
impl Serialize for SystemTime
source§
fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>
where
-    S: Serializer,
source§
impl Serialize for NonZeroI8
source§
fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>
where
-    S: Serializer,
source§
impl Serialize for NonZeroI16
source§
fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>
where
-    S: Serializer,
source§
impl Serialize for NonZeroI32
source§
fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>
where
-    S: Serializer,
source§
impl Serialize for NonZeroI64
source§
fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>
where
-    S: Serializer,
source§
impl Serialize for NonZeroI128
source§
fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>
where
-    S: Serializer,
source§
impl Serialize for NonZeroIsize
source§
fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>
where
-    S: Serializer,
source§
impl Serialize for NonZeroU8
source§
fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>
where
-    S: Serializer,
source§
impl Serialize for NonZeroU16
source§
fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>
where
-    S: Serializer,
source§
impl Serialize for NonZeroU32
source§
fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>
where
-    S: Serializer,
source§
impl Serialize for NonZeroU64
source§
fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>
where
-    S: Serializer,
source§
impl Serialize for NonZeroU128
source§
fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>
where
-    S: Serializer,
source§
impl Serialize for NonZeroUsize
source§
fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>
where
+    S: Serializer,
source§
impl Serialize for Ipv4Addr
source§
fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>
where
+    S: Serializer,
source§
impl Serialize for Ipv6Addr
source§
fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>
where
+    S: Serializer,
source§
impl Serialize for SocketAddrV4
source§
fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>
where
+    S: Serializer,
source§
impl Serialize for SocketAddrV6
source§
fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>
where
+    S: Serializer,
source§
impl Serialize for AtomicBool
source§
fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>
where
+    S: Serializer,
source§
impl Serialize for AtomicI8
source§
fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>
where
+    S: Serializer,
source§
impl Serialize for AtomicI16
source§
fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>
where
+    S: Serializer,
source§
impl Serialize for AtomicI32
source§
fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>
where
+    S: Serializer,
source§
impl Serialize for AtomicI64
source§
fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>
where
+    S: Serializer,
source§
impl Serialize for AtomicIsize
source§
fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>
where
+    S: Serializer,
source§
impl Serialize for AtomicU8
source§
fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>
where
+    S: Serializer,
source§
impl Serialize for AtomicU16
source§
fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>
where
+    S: Serializer,
source§
impl Serialize for AtomicU32
source§
fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>
where
+    S: Serializer,
source§
impl Serialize for AtomicU64
source§
fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>
where
+    S: Serializer,
source§
impl Serialize for AtomicUsize
source§
fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>
where
+    S: Serializer,
source§
impl Serialize for Duration
source§
fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>
where
+    S: Serializer,
source§
impl Serialize for OsStr
source§
fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>
where
+    S: Serializer,
source§
impl Serialize for OsString
source§
fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>
where
+    S: Serializer,
source§
impl Serialize for Path
source§
fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>
where
+    S: Serializer,
source§
impl Serialize for PathBuf
source§
fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>
where
+    S: Serializer,
source§
impl Serialize for SystemTime
source§
fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>
where
+    S: Serializer,
source§
impl Serialize for NonZeroI8
source§
fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>
where
+    S: Serializer,
source§
impl Serialize for NonZeroI16
source§
fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>
where
+    S: Serializer,
source§
impl Serialize for NonZeroI32
source§
fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>
where
+    S: Serializer,
source§
impl Serialize for NonZeroI64
source§
fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>
where
+    S: Serializer,
source§
impl Serialize for NonZeroI128
source§
fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>
where
+    S: Serializer,
source§
impl Serialize for NonZeroIsize
source§
fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>
where
+    S: Serializer,
source§
impl Serialize for NonZeroU8
source§
fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>
where
+    S: Serializer,
source§
impl Serialize for NonZeroU16
source§
fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>
where
+    S: Serializer,
source§
impl Serialize for NonZeroU32
source§
fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>
where
+    S: Serializer,
source§
impl Serialize for NonZeroU64
source§
fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>
where
+    S: Serializer,
source§
impl Serialize for NonZeroU128
source§
fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>
where
+    S: Serializer,
source§
impl Serialize for NonZeroUsize
source§
fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>
where
     S: Serializer,
source§
impl<'a> Serialize for Arguments<'a>
source§
fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>
where
-    S: Serializer,
source§
impl<'a, T> Serialize for Cow<'a, T>
where
-    T: ?Sized + Serialize + ToOwned,
source§
fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>
where
-    S: Serializer,
source§
impl<'a, T> Serialize for &'a T
where
-    T: ?Sized + Serialize,
source§
fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>
where
-    S: Serializer,
source§
impl<'a, T> Serialize for &'a mut T
where
-    T: ?Sized + Serialize,
source§
fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>
where
+    S: Serializer,
source§
impl<'a, T> Serialize for Cow<'a, T>
where
+    T: ?Sized + Serialize + ToOwned,
source§
fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>
where
+    S: Serializer,
source§
impl<'a, T> Serialize for &'a T
where
+    T: ?Sized + Serialize,
source§
fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>
where
+    S: Serializer,
source§
impl<'a, T> Serialize for &'a mut T
where
+    T: ?Sized + Serialize,
source§
fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>
where
     S: Serializer,
source§
impl<Idx> Serialize for Range<Idx>
where
     Idx: Serialize,
source§
fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>
where
     S: Serializer,
source§
impl<Idx> Serialize for RangeFrom<Idx>
where
@@ -115,48 +115,46 @@
     Idx: Serialize,
source§
fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>
where
     S: Serializer,
source§
impl<Idx> Serialize for RangeTo<Idx>
where
     Idx: Serialize,
source§
fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>
where
-    S: Serializer,
source§
impl<K, V> Serialize for BTreeMap<K, V>
where
+    S: Serializer,
source§
impl<K, V> Serialize for BTreeMap<K, V>
where
     K: Serialize,
-    V: Serialize,
source§
fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>
where
-    S: Serializer,
source§
impl<K, V, H> Serialize for HashMap<K, V, H>
where
+    V: Serialize,
source§
fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>
where
+    S: Serializer,
source§
impl<K, V, H> Serialize for HashMap<K, V, H>
where
     K: Serialize,
-    V: Serialize,
source§
fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>
where
-    S: Serializer,
source§
impl<T0> Serialize for (T0,)
where
-    T0: Serialize,
source§
fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>
where
-    S: Serializer,
source§
impl<T0, T1> Serialize for (T0, T1)
where
+    V: Serialize,
source§
fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>
where
+    S: Serializer,
source§
impl<T0, T1> Serialize for (T0, T1)
where
     T0: Serialize,
-    T1: Serialize,
source§
fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>
where
-    S: Serializer,
source§
impl<T0, T1, T2> Serialize for (T0, T1, T2)
where
+    T1: Serialize,
source§
fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>
where
+    S: Serializer,
source§
impl<T0, T1, T2> Serialize for (T0, T1, T2)
where
     T0: Serialize,
     T1: Serialize,
-    T2: Serialize,
source§
fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>
where
-    S: Serializer,
source§
impl<T0, T1, T2, T3> Serialize for (T0, T1, T2, T3)
where
+    T2: Serialize,
source§
fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>
where
+    S: Serializer,
source§
impl<T0, T1, T2, T3> Serialize for (T0, T1, T2, T3)
where
     T0: Serialize,
     T1: Serialize,
     T2: Serialize,
-    T3: Serialize,
source§
fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>
where
-    S: Serializer,
source§
impl<T0, T1, T2, T3, T4> Serialize for (T0, T1, T2, T3, T4)
where
+    T3: Serialize,
source§
fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>
where
+    S: Serializer,
source§
impl<T0, T1, T2, T3, T4> Serialize for (T0, T1, T2, T3, T4)
where
     T0: Serialize,
     T1: Serialize,
     T2: Serialize,
     T3: Serialize,
-    T4: Serialize,
source§
fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>
where
-    S: Serializer,
source§
impl<T0, T1, T2, T3, T4, T5> Serialize for (T0, T1, T2, T3, T4, T5)
where
+    T4: Serialize,
source§
fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>
where
+    S: Serializer,
source§
impl<T0, T1, T2, T3, T4, T5> Serialize for (T0, T1, T2, T3, T4, T5)
where
     T0: Serialize,
     T1: Serialize,
     T2: Serialize,
     T3: Serialize,
     T4: Serialize,
-    T5: Serialize,
source§
fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>
where
-    S: Serializer,
source§
impl<T0, T1, T2, T3, T4, T5, T6> Serialize for (T0, T1, T2, T3, T4, T5, T6)
where
+    T5: Serialize,
source§
fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>
where
+    S: Serializer,
source§
impl<T0, T1, T2, T3, T4, T5, T6> Serialize for (T0, T1, T2, T3, T4, T5, T6)
where
     T0: Serialize,
     T1: Serialize,
     T2: Serialize,
     T3: Serialize,
     T4: Serialize,
     T5: Serialize,
-    T6: Serialize,
source§
fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>
where
-    S: Serializer,
source§
impl<T0, T1, T2, T3, T4, T5, T6, T7> Serialize for (T0, T1, T2, T3, T4, T5, T6, T7)
where
+    T6: Serialize,
source§
fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>
where
+    S: Serializer,
source§
impl<T0, T1, T2, T3, T4, T5, T6, T7> Serialize for (T0, T1, T2, T3, T4, T5, T6, T7)
where
     T0: Serialize,
     T1: Serialize,
     T2: Serialize,
@@ -164,8 +162,8 @@
     T4: Serialize,
     T5: Serialize,
     T6: Serialize,
-    T7: Serialize,
source§
fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>
where
-    S: Serializer,
source§
impl<T0, T1, T2, T3, T4, T5, T6, T7, T8> Serialize for (T0, T1, T2, T3, T4, T5, T6, T7, T8)
where
+    T7: Serialize,
source§
fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>
where
+    S: Serializer,
source§
impl<T0, T1, T2, T3, T4, T5, T6, T7, T8> Serialize for (T0, T1, T2, T3, T4, T5, T6, T7, T8)
where
     T0: Serialize,
     T1: Serialize,
     T2: Serialize,
@@ -174,8 +172,8 @@
     T5: Serialize,
     T6: Serialize,
     T7: Serialize,
-    T8: Serialize,
source§
fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>
where
-    S: Serializer,
source§
impl<T0, T1, T2, T3, T4, T5, T6, T7, T8, T9> Serialize for (T0, T1, T2, T3, T4, T5, T6, T7, T8, T9)
where
+    T8: Serialize,
source§
fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>
where
+    S: Serializer,
source§
impl<T0, T1, T2, T3, T4, T5, T6, T7, T8, T9> Serialize for (T0, T1, T2, T3, T4, T5, T6, T7, T8, T9)
where
     T0: Serialize,
     T1: Serialize,
     T2: Serialize,
@@ -185,8 +183,8 @@
     T6: Serialize,
     T7: Serialize,
     T8: Serialize,
-    T9: Serialize,
source§
fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>
where
-    S: Serializer,
source§
impl<T0, T1, T2, T3, T4, T5, T6, T7, T8, T9, T10> Serialize for (T0, T1, T2, T3, T4, T5, T6, T7, T8, T9, T10)
where
+    T9: Serialize,
source§
fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>
where
+    S: Serializer,
source§
impl<T0, T1, T2, T3, T4, T5, T6, T7, T8, T9, T10> Serialize for (T0, T1, T2, T3, T4, T5, T6, T7, T8, T9, T10)
where
     T0: Serialize,
     T1: Serialize,
     T2: Serialize,
@@ -197,8 +195,8 @@
     T7: Serialize,
     T8: Serialize,
     T9: Serialize,
-    T10: Serialize,
source§
fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>
where
-    S: Serializer,
source§
impl<T0, T1, T2, T3, T4, T5, T6, T7, T8, T9, T10, T11> Serialize for (T0, T1, T2, T3, T4, T5, T6, T7, T8, T9, T10, T11)
where
+    T10: Serialize,
source§
fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>
where
+    S: Serializer,
source§
impl<T0, T1, T2, T3, T4, T5, T6, T7, T8, T9, T10, T11> Serialize for (T0, T1, T2, T3, T4, T5, T6, T7, T8, T9, T10, T11)
where
     T0: Serialize,
     T1: Serialize,
     T2: Serialize,
@@ -210,8 +208,8 @@
     T8: Serialize,
     T9: Serialize,
     T10: Serialize,
-    T11: Serialize,
source§
fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>
where
-    S: Serializer,
source§
impl<T0, T1, T2, T3, T4, T5, T6, T7, T8, T9, T10, T11, T12> Serialize for (T0, T1, T2, T3, T4, T5, T6, T7, T8, T9, T10, T11, T12)
where
+    T11: Serialize,
source§
fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>
where
+    S: Serializer,
source§
impl<T0, T1, T2, T3, T4, T5, T6, T7, T8, T9, T10, T11, T12> Serialize for (T0, T1, T2, T3, T4, T5, T6, T7, T8, T9, T10, T11, T12)
where
     T0: Serialize,
     T1: Serialize,
     T2: Serialize,
@@ -224,8 +222,8 @@
     T9: Serialize,
     T10: Serialize,
     T11: Serialize,
-    T12: Serialize,
source§
fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>
where
-    S: Serializer,
source§
impl<T0, T1, T2, T3, T4, T5, T6, T7, T8, T9, T10, T11, T12, T13> Serialize for (T0, T1, T2, T3, T4, T5, T6, T7, T8, T9, T10, T11, T12, T13)
where
+    T12: Serialize,
source§
fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>
where
+    S: Serializer,
source§
impl<T0, T1, T2, T3, T4, T5, T6, T7, T8, T9, T10, T11, T12, T13> Serialize for (T0, T1, T2, T3, T4, T5, T6, T7, T8, T9, T10, T11, T12, T13)
where
     T0: Serialize,
     T1: Serialize,
     T2: Serialize,
@@ -239,8 +237,8 @@
     T10: Serialize,
     T11: Serialize,
     T12: Serialize,
-    T13: Serialize,
source§
fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>
where
-    S: Serializer,
source§
impl<T0, T1, T2, T3, T4, T5, T6, T7, T8, T9, T10, T11, T12, T13, T14> Serialize for (T0, T1, T2, T3, T4, T5, T6, T7, T8, T9, T10, T11, T12, T13, T14)
where
+    T13: Serialize,
source§
fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>
where
+    S: Serializer,
source§
impl<T0, T1, T2, T3, T4, T5, T6, T7, T8, T9, T10, T11, T12, T13, T14> Serialize for (T0, T1, T2, T3, T4, T5, T6, T7, T8, T9, T10, T11, T12, T13, T14)
where
     T0: Serialize,
     T1: Serialize,
     T2: Serialize,
@@ -255,8 +253,8 @@
     T11: Serialize,
     T12: Serialize,
     T13: Serialize,
-    T14: Serialize,
source§
fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>
where
-    S: Serializer,
source§
impl<T0, T1, T2, T3, T4, T5, T6, T7, T8, T9, T10, T11, T12, T13, T14, T15> Serialize for (T0, T1, T2, T3, T4, T5, T6, T7, T8, T9, T10, T11, T12, T13, T14, T15)
where
+    T14: Serialize,
source§
fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>
where
+    S: Serializer,
source§
impl<T0, T1, T2, T3, T4, T5, T6, T7, T8, T9, T10, T11, T12, T13, T14, T15> Serialize for (T0, T1, T2, T3, T4, T5, T6, T7, T8, T9, T10, T11, T12, T13, T14, T15)
where
     T0: Serialize,
     T1: Serialize,
     T2: Serialize,
@@ -272,80 +270,82 @@
     T12: Serialize,
     T13: Serialize,
     T14: Serialize,
-    T15: Serialize,
source§
fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>
where
+    T15: Serialize,
source§
fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>
where
     S: Serializer,
source§
impl<T> Serialize for Bound<T>
where
-    T: Serialize,
source§
fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>
where
+    T: Serialize,
source§
fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>
where
     S: Serializer,
source§
impl<T> Serialize for Option<T>
where
-    T: Serialize,
source§
fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>
where
-    S: Serializer,
source§
impl<T> Serialize for [T; 0]
source§
fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>
where
+    T: Serialize,
source§
fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>
where
+    S: Serializer,
source§
impl<T> Serialize for [T; 0]
source§
fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>
where
     S: Serializer,
source§
impl<T> Serialize for [T; 1]
where
-    T: Serialize,
source§
fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>
where
+    T: Serialize,
source§
fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>
where
     S: Serializer,
source§
impl<T> Serialize for [T; 2]
where
-    T: Serialize,
source§
fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>
where
+    T: Serialize,
source§
fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>
where
     S: Serializer,
source§
impl<T> Serialize for [T; 3]
where
-    T: Serialize,
source§
fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>
where
+    T: Serialize,
source§
fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>
where
     S: Serializer,
source§
impl<T> Serialize for [T; 4]
where
-    T: Serialize,
source§
fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>
where
+    T: Serialize,
source§
fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>
where
     S: Serializer,
source§
impl<T> Serialize for [T; 5]
where
-    T: Serialize,
source§
fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>
where
+    T: Serialize,
source§
fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>
where
     S: Serializer,
source§
impl<T> Serialize for [T; 6]
where
-    T: Serialize,
source§
fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>
where
+    T: Serialize,
source§
fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>
where
     S: Serializer,
source§
impl<T> Serialize for [T; 7]
where
-    T: Serialize,
source§
fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>
where
+    T: Serialize,
source§
fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>
where
     S: Serializer,
source§
impl<T> Serialize for [T; 8]
where
-    T: Serialize,
source§
fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>
where
+    T: Serialize,
source§
fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>
where
     S: Serializer,
source§
impl<T> Serialize for [T; 9]
where
-    T: Serialize,
source§
fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>
where
+    T: Serialize,
source§
fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>
where
     S: Serializer,
source§
impl<T> Serialize for [T; 10]
where
-    T: Serialize,
source§
fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>
where
+    T: Serialize,
source§
fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>
where
     S: Serializer,
source§
impl<T> Serialize for [T; 11]
where
-    T: Serialize,
source§
fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>
where
+    T: Serialize,
source§
fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>
where
     S: Serializer,
source§
impl<T> Serialize for [T; 12]
where
-    T: Serialize,
source§
fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>
where
+    T: Serialize,
source§
fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>
where
     S: Serializer,
source§
impl<T> Serialize for [T; 13]
where
-    T: Serialize,
source§
fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>
where
+    T: Serialize,
source§
fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>
where
     S: Serializer,
source§
impl<T> Serialize for [T; 14]
where
-    T: Serialize,
source§
fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>
where
+    T: Serialize,
source§
fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>
where
     S: Serializer,
source§
impl<T> Serialize for [T; 15]
where
-    T: Serialize,
source§
fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>
where
+    T: Serialize,
source§
fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>
where
     S: Serializer,
source§
impl<T> Serialize for [T; 16]
where
-    T: Serialize,
source§
fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>
where
+    T: Serialize,
source§
fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>
where
     S: Serializer,
source§
impl<T> Serialize for [T; 17]
where
-    T: Serialize,
source§
fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>
where
+    T: Serialize,
source§
fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>
where
     S: Serializer,
source§
impl<T> Serialize for [T; 18]
where
-    T: Serialize,
source§
fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>
where
+    T: Serialize,
source§
fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>
where
     S: Serializer,
source§
impl<T> Serialize for [T; 19]
where
-    T: Serialize,
source§
fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>
where
+    T: Serialize,
source§
fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>
where
     S: Serializer,
source§
impl<T> Serialize for [T; 20]
where
-    T: Serialize,
source§
fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>
where
+    T: Serialize,
source§
fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>
where
     S: Serializer,
source§
impl<T> Serialize for [T; 21]
where
-    T: Serialize,
source§
fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>
where
+    T: Serialize,
source§
fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>
where
     S: Serializer,
source§
impl<T> Serialize for [T; 22]
where
-    T: Serialize,
source§
fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>
where
+    T: Serialize,
source§
fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>
where
     S: Serializer,
source§
impl<T> Serialize for [T; 23]
where
-    T: Serialize,
source§
fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>
where
+    T: Serialize,
source§
fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>
where
     S: Serializer,
source§
impl<T> Serialize for [T; 24]
where
-    T: Serialize,
source§
fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>
where
+    T: Serialize,
source§
fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>
where
     S: Serializer,
source§
impl<T> Serialize for [T; 25]
where
-    T: Serialize,
source§
fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>
where
+    T: Serialize,
source§
fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>
where
     S: Serializer,
source§
impl<T> Serialize for [T; 26]
where
-    T: Serialize,
source§
fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>
where
+    T: Serialize,
source§
fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>
where
     S: Serializer,
source§
impl<T> Serialize for [T; 27]
where
-    T: Serialize,
source§
fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>
where
+    T: Serialize,
source§
fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>
where
     S: Serializer,
source§
impl<T> Serialize for [T; 28]
where
-    T: Serialize,
source§
fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>
where
+    T: Serialize,
source§
fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>
where
     S: Serializer,
source§
impl<T> Serialize for [T; 29]
where
-    T: Serialize,
source§
fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>
where
+    T: Serialize,
source§
fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>
where
     S: Serializer,
source§
impl<T> Serialize for [T; 30]
where
-    T: Serialize,
source§
fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>
where
+    T: Serialize,
source§
fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>
where
     S: Serializer,
source§
impl<T> Serialize for [T; 31]
where
-    T: Serialize,
source§
fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>
where
+    T: Serialize,
source§
fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>
where
     S: Serializer,
source§
impl<T> Serialize for [T; 32]
where
-    T: Serialize,
source§
fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>
where
+    T: Serialize,
source§
fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>
where
     S: Serializer,
source§
impl<T> Serialize for [T]
where
-    T: Serialize,
source§
fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>
where
-    S: Serializer,
source§
impl<T> Serialize for Box<T>
where
-    T: ?Sized + Serialize,
source§
fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>
where
+    T: Serialize,
source§
fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>
where
+    S: Serializer,
source§
impl<T> Serialize for (T,)
where
+    T: Serialize,
source§
fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>
where
+    S: Serializer,
source§
impl<T> Serialize for Box<T>
where
+    T: ?Sized + Serialize,
source§
fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>
where
     S: Serializer,
source§
impl<T> Serialize for BinaryHeap<T>
where
     T: Serialize,
source§
fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>
where
     S: Serializer,
source§
impl<T> Serialize for BTreeSet<T>
where
@@ -356,25 +356,25 @@
     T: Serialize,
source§
fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>
where
     S: Serializer,
source§
impl<T> Serialize for Vec<T>
where
     T: Serialize,
source§
fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>
where
-    S: Serializer,
source§
impl<T> Serialize for Cell<T>
where
-    T: Serialize + Copy,
source§
fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>
where
-    S: Serializer,
source§
impl<T> Serialize for RefCell<T>
where
-    T: ?Sized + Serialize,
source§
fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>
where
-    S: Serializer,
source§
impl<T> Serialize for Reverse<T>
where
-    T: Serialize,
source§
fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>
where
+    S: Serializer,
source§
impl<T> Serialize for Cell<T>
where
+    T: Serialize + Copy,
source§
fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>
where
+    S: Serializer,
source§
impl<T> Serialize for RefCell<T>
where
+    T: ?Sized + Serialize,
source§
fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>
where
+    S: Serializer,
source§
impl<T> Serialize for Reverse<T>
where
+    T: Serialize,
source§
fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>
where
     S: Serializer,
source§
impl<T> Serialize for PhantomData<T>
where
     T: ?Sized,
source§
fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>
where
-    S: Serializer,
source§
impl<T> Serialize for Saturating<T>
where
-    T: Serialize,
source§
fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>
where
-    S: Serializer,
source§
impl<T> Serialize for Wrapping<T>
where
-    T: Serialize,
source§
fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>
where
-    S: Serializer,
source§
impl<T> Serialize for Mutex<T>
where
-    T: ?Sized + Serialize,
source§
fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>
where
-    S: Serializer,
source§
impl<T> Serialize for RwLock<T>
where
-    T: ?Sized + Serialize,
source§
fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>
where
-    S: Serializer,
source§
impl<T, E> Serialize for Result<T, E>
where
+    S: Serializer,
source§
impl<T> Serialize for Saturating<T>
where
+    T: Serialize,
source§
fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>
where
+    S: Serializer,
source§
impl<T> Serialize for Wrapping<T>
where
+    T: Serialize,
source§
fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>
where
+    S: Serializer,
source§
impl<T> Serialize for Mutex<T>
where
+    T: ?Sized + Serialize,
source§
fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>
where
+    S: Serializer,
source§
impl<T> Serialize for RwLock<T>
where
+    T: ?Sized + Serialize,
source§
fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>
where
+    S: Serializer,
source§
impl<T, E> Serialize for Result<T, E>
where
     T: Serialize,
-    E: Serialize,
source§
fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>
where
+    E: Serialize,
source§
fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>
where
     S: Serializer,
source§
impl<T, H> Serialize for HashSet<T, H>
where
     T: Serialize,
source§
fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>
where
     S: Serializer,
Implementors§

\ No newline at end of file
diff --git a/serde/ser/trait.SerializeMap.html b/serde/ser/trait.SerializeMap.html
index 24ab00e756..f20bfa8d0f 100644
--- a/serde/ser/trait.SerializeMap.html
+++ b/serde/ser/trait.SerializeMap.html
@@ -1,4 +1,4 @@
-SerializeMap in serde::ser - Rust

+SerializeMap in serde::ser - Rust

     
Trait serde::ser::SerializeMap
source · 
pub trait SerializeMap {
     type Ok;
     type Error: Error;
diff --git a/serde/ser/trait.SerializeSeq.html b/serde/ser/trait.SerializeSeq.html
index 74ca86f8bb..19fba2aea0 100644
--- a/serde/ser/trait.SerializeSeq.html
+++ b/serde/ser/trait.SerializeSeq.html
@@ -1,4 +1,4 @@
-SerializeSeq in serde::ser - Rust

+SerializeSeq in serde::ser - Rust

     
Trait serde::ser::SerializeSeq
source · 
pub trait SerializeSeq {
     type Ok;
     type Error: Error;
diff --git a/serde/ser/trait.SerializeStruct.html b/serde/ser/trait.SerializeStruct.html
index 1359c235fb..832ced274b 100644
--- a/serde/ser/trait.SerializeStruct.html
+++ b/serde/ser/trait.SerializeStruct.html
@@ -1,4 +1,4 @@
-SerializeStruct in serde::ser - Rust

+SerializeStruct in serde::ser - Rust

     
Trait serde::ser::SerializeStruct
source · 
pub trait SerializeStruct {
     type Ok;
     type Error: Error;
diff --git a/serde/ser/trait.SerializeStructVariant.html b/serde/ser/trait.SerializeStructVariant.html
index d84cec6c45..098d0ac4a3 100644
--- a/serde/ser/trait.SerializeStructVariant.html
+++ b/serde/ser/trait.SerializeStructVariant.html
@@ -1,4 +1,4 @@
-SerializeStructVariant in serde::ser - Rust

+SerializeStructVariant in serde::ser - Rust

     
Trait serde::ser::SerializeStructVariant
source · 
pub trait SerializeStructVariant {
     type Ok;
     type Error: Error;
diff --git a/serde/ser/trait.SerializeTuple.html b/serde/ser/trait.SerializeTuple.html
index e3705360f1..7263a8455f 100644
--- a/serde/ser/trait.SerializeTuple.html
+++ b/serde/ser/trait.SerializeTuple.html
@@ -1,4 +1,4 @@
-SerializeTuple in serde::ser - Rust

+SerializeTuple in serde::ser - Rust

     
Trait serde::ser::SerializeTuple
source · 
pub trait SerializeTuple {
     type Ok;
     type Error: Error;
diff --git a/serde/ser/trait.SerializeTupleStruct.html b/serde/ser/trait.SerializeTupleStruct.html
index 997e44b6da..42d2493eaa 100644
--- a/serde/ser/trait.SerializeTupleStruct.html
+++ b/serde/ser/trait.SerializeTupleStruct.html
@@ -1,4 +1,4 @@
-SerializeTupleStruct in serde::ser - Rust

+SerializeTupleStruct in serde::ser - Rust

     
Trait serde::ser::SerializeTupleStruct
source · 
pub trait SerializeTupleStruct {
     type Ok;
     type Error: Error;
diff --git a/serde/ser/trait.SerializeTupleVariant.html b/serde/ser/trait.SerializeTupleVariant.html
index 3c8c2b5251..4333f98d43 100644
--- a/serde/ser/trait.SerializeTupleVariant.html
+++ b/serde/ser/trait.SerializeTupleVariant.html
@@ -1,4 +1,4 @@
-SerializeTupleVariant in serde::ser - Rust

+SerializeTupleVariant in serde::ser - Rust

     
Trait serde::ser::SerializeTupleVariant
source · 
pub trait SerializeTupleVariant {
     type Ok;
     type Error: Error;
diff --git a/serde/ser/trait.Serializer.html b/serde/ser/trait.Serializer.html
index bf17643372..7fad6d8d0d 100644
--- a/serde/ser/trait.Serializer.html
+++ b/serde/ser/trait.Serializer.html
@@ -1,4 +1,4 @@
-Serializer in serde::ser - Rust

+Serializer in serde::ser - Rust

     
Trait serde::ser::Serializer
source · 
pub trait Serializer: Sized {
     type Ok;
     type Error: Error;
diff --git a/serde/trait.Deserialize.html b/serde/trait.Deserialize.html
index 1814235a01..a57b294d84 100644
--- a/serde/trait.Deserialize.html
+++ b/serde/trait.Deserialize.html
@@ -1,4 +1,4 @@
-Deserialize in serde - Rust

+Deserialize in serde - Rust

     
Trait serde::Deserialize
source · 
pub trait Deserialize<'de>: Sized {
     // Required method
     fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>
@@ -27,8 +27,8 @@ 
§Lifetime

     D: Deserializer<'de>,
Deserialize this value from the given Serde deserializer.

 
See the Implementing Deserialize section of the
 manual for more information about how to implement this method.

-
Object Safety§
This trait is not object safe.
Implementations on Foreign Types§
source§
impl<'de> Deserialize<'de> for IpAddr
source§
fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>
where
-    D: Deserializer<'de>,
source§
impl<'de> Deserialize<'de> for SocketAddr
source§
fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>
where
+
Object Safety§
This trait is not object safe.
Implementations on Foreign Types§
source§
impl<'de> Deserialize<'de> for IpAddr
source§
fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>
where
+    D: Deserializer<'de>,
source§
impl<'de> Deserialize<'de> for SocketAddr
source§
fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>
where
     D: Deserializer<'de>,
source§
impl<'de> Deserialize<'de> for bool
source§
fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>
where
     D: Deserializer<'de>,
source§
impl<'de> Deserialize<'de> for char
source§
fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>
where
     D: Deserializer<'de>,
source§
impl<'de> Deserialize<'de> for f32
source§
fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>
where
@@ -46,16 +46,16 @@ 
§Lifetime

     D: Deserializer<'de>,
source§
impl<'de> Deserialize<'de> for u128
source§
fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>
where
     D: Deserializer<'de>,
source§
impl<'de> Deserialize<'de> for ()
source§
fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>
where
     D: Deserializer<'de>,
source§
impl<'de> Deserialize<'de> for usize
source§
fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>
where
-    D: Deserializer<'de>,
source§
impl<'de> Deserialize<'de> for Box<str>
source§
fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>
where
+    D: Deserializer<'de>,
source§
impl<'de> Deserialize<'de> for Box<str>
source§
fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>
where
     D: Deserializer<'de>,
source§
impl<'de> Deserialize<'de> for Box<CStr>
source§
fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>
where
-    D: Deserializer<'de>,
source§
impl<'de> Deserialize<'de> for Box<OsStr>
source§
fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>
where
-    D: Deserializer<'de>,
source§
impl<'de> Deserialize<'de> for Box<Path>
source§
fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>
where
+    D: Deserializer<'de>,
source§
impl<'de> Deserialize<'de> for Box<OsStr>
source§
fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>
where
+    D: Deserializer<'de>,
source§
impl<'de> Deserialize<'de> for Box<Path>
source§
fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>
where
     D: Deserializer<'de>,
source§
impl<'de> Deserialize<'de> for CString
source§
fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>
where
     D: Deserializer<'de>,
source§
impl<'de> Deserialize<'de> for String
source§
fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>
where
-    D: Deserializer<'de>,
source§
impl<'de> Deserialize<'de> for Ipv4Addr
source§
fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>
where
-    D: Deserializer<'de>,
source§
impl<'de> Deserialize<'de> for Ipv6Addr
source§
fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>
where
-    D: Deserializer<'de>,
source§
impl<'de> Deserialize<'de> for SocketAddrV4
source§
fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>
where
-    D: Deserializer<'de>,
source§
impl<'de> Deserialize<'de> for SocketAddrV6
source§
fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>
where
+    D: Deserializer<'de>,
source§
impl<'de> Deserialize<'de> for Ipv4Addr
source§
fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>
where
+    D: Deserializer<'de>,
source§
impl<'de> Deserialize<'de> for Ipv6Addr
source§
fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>
where
+    D: Deserializer<'de>,
source§
impl<'de> Deserialize<'de> for SocketAddrV4
source§
fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>
where
+    D: Deserializer<'de>,
source§
impl<'de> Deserialize<'de> for SocketAddrV6
source§
fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>
where
     D: Deserializer<'de>,
source§
impl<'de> Deserialize<'de> for Saturating<i8>
source§
fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>
where
     D: Deserializer<'de>,
source§
impl<'de> Deserialize<'de> for Saturating<i16>
source§
fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>
where
     D: Deserializer<'de>,
source§
impl<'de> Deserialize<'de> for Saturating<i32>
source§
fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>
where
@@ -68,21 +68,21 @@ 
§Lifetime

     D: Deserializer<'de>,
source§
impl<'de> Deserialize<'de> for Saturating<u64>
source§
fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>
where
     D: Deserializer<'de>,
source§
impl<'de> Deserialize<'de> for Saturating<u128>
source§
fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>
where
     D: Deserializer<'de>,
source§
impl<'de> Deserialize<'de> for Saturating<usize>
source§
fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>
where
-    D: Deserializer<'de>,
source§
impl<'de> Deserialize<'de> for AtomicBool
source§
fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>
where
-    D: Deserializer<'de>,
source§
impl<'de> Deserialize<'de> for AtomicI8
source§
fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>
where
-    D: Deserializer<'de>,
source§
impl<'de> Deserialize<'de> for AtomicI16
source§
fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>
where
-    D: Deserializer<'de>,
source§
impl<'de> Deserialize<'de> for AtomicI32
source§
fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>
where
-    D: Deserializer<'de>,
source§
impl<'de> Deserialize<'de> for AtomicI64
source§
fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>
where
-    D: Deserializer<'de>,
source§
impl<'de> Deserialize<'de> for AtomicIsize
source§
fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>
where
-    D: Deserializer<'de>,
source§
impl<'de> Deserialize<'de> for AtomicU8
source§
fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>
where
-    D: Deserializer<'de>,
source§
impl<'de> Deserialize<'de> for AtomicU16
source§
fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>
where
-    D: Deserializer<'de>,
source§
impl<'de> Deserialize<'de> for AtomicU32
source§
fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>
where
-    D: Deserializer<'de>,
source§
impl<'de> Deserialize<'de> for AtomicU64
source§
fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>
where
-    D: Deserializer<'de>,
source§
impl<'de> Deserialize<'de> for AtomicUsize
source§
fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>
where
-    D: Deserializer<'de>,
source§
impl<'de> Deserialize<'de> for Duration
source§
fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>
where
-    D: Deserializer<'de>,
source§
impl<'de> Deserialize<'de> for OsString
source§
fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>
where
-    D: Deserializer<'de>,
source§
impl<'de> Deserialize<'de> for PathBuf
source§
fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>
where
-    D: Deserializer<'de>,
source§
impl<'de> Deserialize<'de> for SystemTime
source§
fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>
where
+    D: Deserializer<'de>,
source§
impl<'de> Deserialize<'de> for AtomicBool
source§
fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>
where
+    D: Deserializer<'de>,
source§
impl<'de> Deserialize<'de> for AtomicI8
source§
fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>
where
+    D: Deserializer<'de>,
source§
impl<'de> Deserialize<'de> for AtomicI16
source§
fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>
where
+    D: Deserializer<'de>,
source§
impl<'de> Deserialize<'de> for AtomicI32
source§
fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>
where
+    D: Deserializer<'de>,
source§
impl<'de> Deserialize<'de> for AtomicI64
source§
fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>
where
+    D: Deserializer<'de>,
source§
impl<'de> Deserialize<'de> for AtomicIsize
source§
fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>
where
+    D: Deserializer<'de>,
source§
impl<'de> Deserialize<'de> for AtomicU8
source§
fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>
where
+    D: Deserializer<'de>,
source§
impl<'de> Deserialize<'de> for AtomicU16
source§
fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>
where
+    D: Deserializer<'de>,
source§
impl<'de> Deserialize<'de> for AtomicU32
source§
fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>
where
+    D: Deserializer<'de>,
source§
impl<'de> Deserialize<'de> for AtomicU64
source§
fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>
where
+    D: Deserializer<'de>,
source§
impl<'de> Deserialize<'de> for AtomicUsize
source§
fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>
where
+    D: Deserializer<'de>,
source§
impl<'de> Deserialize<'de> for Duration
source§
fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>
where
+    D: Deserializer<'de>,
source§
impl<'de> Deserialize<'de> for OsString
source§
fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>
where
+    D: Deserializer<'de>,
source§
impl<'de> Deserialize<'de> for PathBuf
source§
fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>
where
+    D: Deserializer<'de>,
source§
impl<'de> Deserialize<'de> for SystemTime
source§
fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>
where
     D: Deserializer<'de>,
source§
impl<'de> Deserialize<'de> for NonZeroI8
source§
fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>
where
     D: Deserializer<'de>,
source§
impl<'de> Deserialize<'de> for NonZeroI16
source§
fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>
where
     D: Deserializer<'de>,
source§
impl<'de> Deserialize<'de> for NonZeroI32
source§
fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>
where
@@ -95,109 +95,245 @@ 
§Lifetime

     D: Deserializer<'de>,
source§
impl<'de> Deserialize<'de> for NonZeroU64
source§
fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>
where
     D: Deserializer<'de>,
source§
impl<'de> Deserialize<'de> for NonZeroU128
source§
fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>
where
     D: Deserializer<'de>,
source§
impl<'de> Deserialize<'de> for NonZeroUsize
source§
fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>
where
-    D: Deserializer<'de>,
source§
impl<'de, 'a, T> Deserialize<'de> for Cow<'a, T>
where
+    D: Deserializer<'de>,
source§

impl<'de, 'a, T> Deserialize<'de> for Cow<'a, T>
where T: ?Sized + ToOwned, - T::Owned: Deserialize<'de>,

source§

fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>
where - D: Deserializer<'de>,

source§

impl<'de, Idx> Deserialize<'de> for Range<Idx>
where - Idx: Deserialize<'de>,

source§

fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>
where - D: Deserializer<'de>,

source§

impl<'de, Idx> Deserialize<'de> for RangeFrom<Idx>
where - Idx: Deserialize<'de>,

source§

fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>
where - D: Deserializer<'de>,

source§

impl<'de, Idx> Deserialize<'de> for RangeInclusive<Idx>
where - Idx: Deserialize<'de>,

source§

fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>
where - D: Deserializer<'de>,

source§

impl<'de, Idx> Deserialize<'de> for RangeTo<Idx>
where - Idx: Deserialize<'de>,

source§

fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>
where - D: Deserializer<'de>,

source§

impl<'de, K, V> Deserialize<'de> for BTreeMap<K, V>
where + T::Owned: Deserialize<'de>,

source§

fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>
where + D: Deserializer<'de>,

source§

impl<'de, Idx> Deserialize<'de> for Range<Idx>
where + Idx: Deserialize<'de>,

source§

fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>
where + D: Deserializer<'de>,

source§

impl<'de, Idx> Deserialize<'de> for RangeFrom<Idx>
where + Idx: Deserialize<'de>,

source§

fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>
where + D: Deserializer<'de>,

source§

impl<'de, Idx> Deserialize<'de> for RangeInclusive<Idx>
where + Idx: Deserialize<'de>,

source§

fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>
where + D: Deserializer<'de>,

source§

impl<'de, Idx> Deserialize<'de> for RangeTo<Idx>
where + Idx: Deserialize<'de>,

source§

fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>
where + D: Deserializer<'de>,

source§

impl<'de, K, V> Deserialize<'de> for BTreeMap<K, V>
where K: Deserialize<'de> + Ord, - V: Deserialize<'de>,

source§

fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>
where - D: Deserializer<'de>,

source§

impl<'de, K, V, S> Deserialize<'de> for HashMap<K, V, S>
where + V: Deserialize<'de>,

source§

fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>
where + D: Deserializer<'de>,

source§

impl<'de, K, V, S> Deserialize<'de> for HashMap<K, V, S>
where K: Deserialize<'de> + Eq + Hash, V: Deserialize<'de>, - S: BuildHasher + Default,

source§

fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>
where - D: Deserializer<'de>,

source§

impl<'de, T0: Deserialize<'de>> Deserialize<'de> for (T0,)

source§

fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>
where - D: Deserializer<'de>,

source§

impl<'de, T0: Deserialize<'de>, T1: Deserialize<'de>> Deserialize<'de> for (T0, T1)

source§

fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>
where - D: Deserializer<'de>,

source§

impl<'de, T0: Deserialize<'de>, T1: Deserialize<'de>, T2: Deserialize<'de>> Deserialize<'de> for (T0, T1, T2)

source§

fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>
where - D: Deserializer<'de>,

source§

impl<'de, T0: Deserialize<'de>, T1: Deserialize<'de>, T2: Deserialize<'de>, T3: Deserialize<'de>> Deserialize<'de> for (T0, T1, T2, T3)

source§

fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>
where - D: Deserializer<'de>,

source§

impl<'de, T0: Deserialize<'de>, T1: Deserialize<'de>, T2: Deserialize<'de>, T3: Deserialize<'de>, T4: Deserialize<'de>> Deserialize<'de> for (T0, T1, T2, T3, T4)

source§

fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>
where - D: Deserializer<'de>,

source§

impl<'de, T0: Deserialize<'de>, T1: Deserialize<'de>, T2: Deserialize<'de>, T3: Deserialize<'de>, T4: Deserialize<'de>, T5: Deserialize<'de>> Deserialize<'de> for (T0, T1, T2, T3, T4, T5)

source§

fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>
where - D: Deserializer<'de>,

source§

impl<'de, T0: Deserialize<'de>, T1: Deserialize<'de>, T2: Deserialize<'de>, T3: Deserialize<'de>, T4: Deserialize<'de>, T5: Deserialize<'de>, T6: Deserialize<'de>> Deserialize<'de> for (T0, T1, T2, T3, T4, T5, T6)

source§

fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>
where - D: Deserializer<'de>,

source§

impl<'de, T0: Deserialize<'de>, T1: Deserialize<'de>, T2: Deserialize<'de>, T3: Deserialize<'de>, T4: Deserialize<'de>, T5: Deserialize<'de>, T6: Deserialize<'de>, T7: Deserialize<'de>> Deserialize<'de> for (T0, T1, T2, T3, T4, T5, T6, T7)

source§

fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>
where - D: Deserializer<'de>,

source§

impl<'de, T0: Deserialize<'de>, T1: Deserialize<'de>, T2: Deserialize<'de>, T3: Deserialize<'de>, T4: Deserialize<'de>, T5: Deserialize<'de>, T6: Deserialize<'de>, T7: Deserialize<'de>, T8: Deserialize<'de>> Deserialize<'de> for (T0, T1, T2, T3, T4, T5, T6, T7, T8)

source§

fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>
where - D: Deserializer<'de>,

source§

impl<'de, T0: Deserialize<'de>, T1: Deserialize<'de>, T2: Deserialize<'de>, T3: Deserialize<'de>, T4: Deserialize<'de>, T5: Deserialize<'de>, T6: Deserialize<'de>, T7: Deserialize<'de>, T8: Deserialize<'de>, T9: Deserialize<'de>> Deserialize<'de> for (T0, T1, T2, T3, T4, T5, T6, T7, T8, T9)

source§

fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>
where - D: Deserializer<'de>,

source§

impl<'de, T0: Deserialize<'de>, T1: Deserialize<'de>, T2: Deserialize<'de>, T3: Deserialize<'de>, T4: Deserialize<'de>, T5: Deserialize<'de>, T6: Deserialize<'de>, T7: Deserialize<'de>, T8: Deserialize<'de>, T9: Deserialize<'de>, T10: Deserialize<'de>> Deserialize<'de> for (T0, T1, T2, T3, T4, T5, T6, T7, T8, T9, T10)

source§

fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>
where - D: Deserializer<'de>,

source§

impl<'de, T0: Deserialize<'de>, T1: Deserialize<'de>, T2: Deserialize<'de>, T3: Deserialize<'de>, T4: Deserialize<'de>, T5: Deserialize<'de>, T6: Deserialize<'de>, T7: Deserialize<'de>, T8: Deserialize<'de>, T9: Deserialize<'de>, T10: Deserialize<'de>, T11: Deserialize<'de>> Deserialize<'de> for (T0, T1, T2, T3, T4, T5, T6, T7, T8, T9, T10, T11)

source§

fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>
where - D: Deserializer<'de>,

source§

impl<'de, T0: Deserialize<'de>, T1: Deserialize<'de>, T2: Deserialize<'de>, T3: Deserialize<'de>, T4: Deserialize<'de>, T5: Deserialize<'de>, T6: Deserialize<'de>, T7: Deserialize<'de>, T8: Deserialize<'de>, T9: Deserialize<'de>, T10: Deserialize<'de>, T11: Deserialize<'de>, T12: Deserialize<'de>> Deserialize<'de> for (T0, T1, T2, T3, T4, T5, T6, T7, T8, T9, T10, T11, T12)

source§

fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>
where - D: Deserializer<'de>,

source§

impl<'de, T0: Deserialize<'de>, T1: Deserialize<'de>, T2: Deserialize<'de>, T3: Deserialize<'de>, T4: Deserialize<'de>, T5: Deserialize<'de>, T6: Deserialize<'de>, T7: Deserialize<'de>, T8: Deserialize<'de>, T9: Deserialize<'de>, T10: Deserialize<'de>, T11: Deserialize<'de>, T12: Deserialize<'de>, T13: Deserialize<'de>> Deserialize<'de> for (T0, T1, T2, T3, T4, T5, T6, T7, T8, T9, T10, T11, T12, T13)

source§

fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>
where - D: Deserializer<'de>,

source§

impl<'de, T0: Deserialize<'de>, T1: Deserialize<'de>, T2: Deserialize<'de>, T3: Deserialize<'de>, T4: Deserialize<'de>, T5: Deserialize<'de>, T6: Deserialize<'de>, T7: Deserialize<'de>, T8: Deserialize<'de>, T9: Deserialize<'de>, T10: Deserialize<'de>, T11: Deserialize<'de>, T12: Deserialize<'de>, T13: Deserialize<'de>, T14: Deserialize<'de>> Deserialize<'de> for (T0, T1, T2, T3, T4, T5, T6, T7, T8, T9, T10, T11, T12, T13, T14)

source§

fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>
where - D: Deserializer<'de>,

source§

impl<'de, T0: Deserialize<'de>, T1: Deserialize<'de>, T2: Deserialize<'de>, T3: Deserialize<'de>, T4: Deserialize<'de>, T5: Deserialize<'de>, T6: Deserialize<'de>, T7: Deserialize<'de>, T8: Deserialize<'de>, T9: Deserialize<'de>, T10: Deserialize<'de>, T11: Deserialize<'de>, T12: Deserialize<'de>, T13: Deserialize<'de>, T14: Deserialize<'de>, T15: Deserialize<'de>> Deserialize<'de> for (T0, T1, T2, T3, T4, T5, T6, T7, T8, T9, T10, T11, T12, T13, T14, T15)

source§

fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>
where - D: Deserializer<'de>,

source§

impl<'de, T> Deserialize<'de> for Bound<T>
where - T: Deserialize<'de>,

source§

fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>
where + S: BuildHasher + Default,

source§

fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>
where + D: Deserializer<'de>,

source§

impl<'de, T0, T1> Deserialize<'de> for (T0, T1)
where + T0: Deserialize<'de>, + T1: Deserialize<'de>,

source§

fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>
where + D: Deserializer<'de>,

source§

impl<'de, T0, T1, T2> Deserialize<'de> for (T0, T1, T2)
where + T0: Deserialize<'de>, + T1: Deserialize<'de>, + T2: Deserialize<'de>,

source§

fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>
where + D: Deserializer<'de>,

source§

impl<'de, T0, T1, T2, T3> Deserialize<'de> for (T0, T1, T2, T3)
where + T0: Deserialize<'de>, + T1: Deserialize<'de>, + T2: Deserialize<'de>, + T3: Deserialize<'de>,

source§

fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>
where + D: Deserializer<'de>,

source§

impl<'de, T0, T1, T2, T3, T4> Deserialize<'de> for (T0, T1, T2, T3, T4)
where + T0: Deserialize<'de>, + T1: Deserialize<'de>, + T2: Deserialize<'de>, + T3: Deserialize<'de>, + T4: Deserialize<'de>,

source§

fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>
where + D: Deserializer<'de>,

source§

impl<'de, T0, T1, T2, T3, T4, T5> Deserialize<'de> for (T0, T1, T2, T3, T4, T5)
where + T0: Deserialize<'de>, + T1: Deserialize<'de>, + T2: Deserialize<'de>, + T3: Deserialize<'de>, + T4: Deserialize<'de>, + T5: Deserialize<'de>,

source§

fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>
where + D: Deserializer<'de>,

source§

impl<'de, T0, T1, T2, T3, T4, T5, T6> Deserialize<'de> for (T0, T1, T2, T3, T4, T5, T6)
where + T0: Deserialize<'de>, + T1: Deserialize<'de>, + T2: Deserialize<'de>, + T3: Deserialize<'de>, + T4: Deserialize<'de>, + T5: Deserialize<'de>, + T6: Deserialize<'de>,

source§

fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>
where + D: Deserializer<'de>,

source§

impl<'de, T0, T1, T2, T3, T4, T5, T6, T7> Deserialize<'de> for (T0, T1, T2, T3, T4, T5, T6, T7)
where + T0: Deserialize<'de>, + T1: Deserialize<'de>, + T2: Deserialize<'de>, + T3: Deserialize<'de>, + T4: Deserialize<'de>, + T5: Deserialize<'de>, + T6: Deserialize<'de>, + T7: Deserialize<'de>,

source§

fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>
where + D: Deserializer<'de>,

source§

impl<'de, T0, T1, T2, T3, T4, T5, T6, T7, T8> Deserialize<'de> for (T0, T1, T2, T3, T4, T5, T6, T7, T8)
where + T0: Deserialize<'de>, + T1: Deserialize<'de>, + T2: Deserialize<'de>, + T3: Deserialize<'de>, + T4: Deserialize<'de>, + T5: Deserialize<'de>, + T6: Deserialize<'de>, + T7: Deserialize<'de>, + T8: Deserialize<'de>,

source§

fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>
where + D: Deserializer<'de>,

source§

impl<'de, T0, T1, T2, T3, T4, T5, T6, T7, T8, T9> Deserialize<'de> for (T0, T1, T2, T3, T4, T5, T6, T7, T8, T9)
where + T0: Deserialize<'de>, + T1: Deserialize<'de>, + T2: Deserialize<'de>, + T3: Deserialize<'de>, + T4: Deserialize<'de>, + T5: Deserialize<'de>, + T6: Deserialize<'de>, + T7: Deserialize<'de>, + T8: Deserialize<'de>, + T9: Deserialize<'de>,

source§

fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>
where + D: Deserializer<'de>,

source§

impl<'de, T0, T1, T2, T3, T4, T5, T6, T7, T8, T9, T10> Deserialize<'de> for (T0, T1, T2, T3, T4, T5, T6, T7, T8, T9, T10)
where + T0: Deserialize<'de>, + T1: Deserialize<'de>, + T2: Deserialize<'de>, + T3: Deserialize<'de>, + T4: Deserialize<'de>, + T5: Deserialize<'de>, + T6: Deserialize<'de>, + T7: Deserialize<'de>, + T8: Deserialize<'de>, + T9: Deserialize<'de>, + T10: Deserialize<'de>,

source§

fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>
where + D: Deserializer<'de>,

source§

impl<'de, T0, T1, T2, T3, T4, T5, T6, T7, T8, T9, T10, T11> Deserialize<'de> for (T0, T1, T2, T3, T4, T5, T6, T7, T8, T9, T10, T11)
where + T0: Deserialize<'de>, + T1: Deserialize<'de>, + T2: Deserialize<'de>, + T3: Deserialize<'de>, + T4: Deserialize<'de>, + T5: Deserialize<'de>, + T6: Deserialize<'de>, + T7: Deserialize<'de>, + T8: Deserialize<'de>, + T9: Deserialize<'de>, + T10: Deserialize<'de>, + T11: Deserialize<'de>,

source§

fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>
where + D: Deserializer<'de>,

source§

impl<'de, T0, T1, T2, T3, T4, T5, T6, T7, T8, T9, T10, T11, T12> Deserialize<'de> for (T0, T1, T2, T3, T4, T5, T6, T7, T8, T9, T10, T11, T12)
where + T0: Deserialize<'de>, + T1: Deserialize<'de>, + T2: Deserialize<'de>, + T3: Deserialize<'de>, + T4: Deserialize<'de>, + T5: Deserialize<'de>, + T6: Deserialize<'de>, + T7: Deserialize<'de>, + T8: Deserialize<'de>, + T9: Deserialize<'de>, + T10: Deserialize<'de>, + T11: Deserialize<'de>, + T12: Deserialize<'de>,

source§

fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>
where + D: Deserializer<'de>,

source§

impl<'de, T0, T1, T2, T3, T4, T5, T6, T7, T8, T9, T10, T11, T12, T13> Deserialize<'de> for (T0, T1, T2, T3, T4, T5, T6, T7, T8, T9, T10, T11, T12, T13)
where + T0: Deserialize<'de>, + T1: Deserialize<'de>, + T2: Deserialize<'de>, + T3: Deserialize<'de>, + T4: Deserialize<'de>, + T5: Deserialize<'de>, + T6: Deserialize<'de>, + T7: Deserialize<'de>, + T8: Deserialize<'de>, + T9: Deserialize<'de>, + T10: Deserialize<'de>, + T11: Deserialize<'de>, + T12: Deserialize<'de>, + T13: Deserialize<'de>,

source§

fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>
where + D: Deserializer<'de>,

source§

impl<'de, T0, T1, T2, T3, T4, T5, T6, T7, T8, T9, T10, T11, T12, T13, T14> Deserialize<'de> for (T0, T1, T2, T3, T4, T5, T6, T7, T8, T9, T10, T11, T12, T13, T14)
where + T0: Deserialize<'de>, + T1: Deserialize<'de>, + T2: Deserialize<'de>, + T3: Deserialize<'de>, + T4: Deserialize<'de>, + T5: Deserialize<'de>, + T6: Deserialize<'de>, + T7: Deserialize<'de>, + T8: Deserialize<'de>, + T9: Deserialize<'de>, + T10: Deserialize<'de>, + T11: Deserialize<'de>, + T12: Deserialize<'de>, + T13: Deserialize<'de>, + T14: Deserialize<'de>,

source§

fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>
where + D: Deserializer<'de>,

source§

impl<'de, T0, T1, T2, T3, T4, T5, T6, T7, T8, T9, T10, T11, T12, T13, T14, T15> Deserialize<'de> for (T0, T1, T2, T3, T4, T5, T6, T7, T8, T9, T10, T11, T12, T13, T14, T15)
where + T0: Deserialize<'de>, + T1: Deserialize<'de>, + T2: Deserialize<'de>, + T3: Deserialize<'de>, + T4: Deserialize<'de>, + T5: Deserialize<'de>, + T6: Deserialize<'de>, + T7: Deserialize<'de>, + T8: Deserialize<'de>, + T9: Deserialize<'de>, + T10: Deserialize<'de>, + T11: Deserialize<'de>, + T12: Deserialize<'de>, + T13: Deserialize<'de>, + T14: Deserialize<'de>, + T15: Deserialize<'de>,

source§

fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>
where + D: Deserializer<'de>,

source§

impl<'de, T> Deserialize<'de> for Bound<T>
where + T: Deserialize<'de>,

source§

fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>
where D: Deserializer<'de>,

source§

impl<'de, T> Deserialize<'de> for Option<T>
where - T: Deserialize<'de>,

source§

fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>
where - D: Deserializer<'de>,

source§

impl<'de, T> Deserialize<'de> for [T; 0]

source§

fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>
where + T: Deserialize<'de>,

source§

fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>
where + D: Deserializer<'de>,

source§

impl<'de, T> Deserialize<'de> for [T; 0]

source§

fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>
where D: Deserializer<'de>,

source§

impl<'de, T> Deserialize<'de> for [T; 1]
where - T: Deserialize<'de>,

source§

fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>
where + T: Deserialize<'de>,

source§

fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>
where D: Deserializer<'de>,

source§

impl<'de, T> Deserialize<'de> for [T; 2]
where - T: Deserialize<'de>,

source§

fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>
where + T: Deserialize<'de>,

source§

fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>
where D: Deserializer<'de>,

source§

impl<'de, T> Deserialize<'de> for [T; 3]
where - T: Deserialize<'de>,

source§

fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>
where + T: Deserialize<'de>,

source§

fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>
where D: Deserializer<'de>,

source§

impl<'de, T> Deserialize<'de> for [T; 4]
where - T: Deserialize<'de>,

source§

fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>
where + T: Deserialize<'de>,

source§

fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>
where D: Deserializer<'de>,

source§

impl<'de, T> Deserialize<'de> for [T; 5]
where - T: Deserialize<'de>,

source§

fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>
where + T: Deserialize<'de>,

source§

fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>
where D: Deserializer<'de>,

source§

impl<'de, T> Deserialize<'de> for [T; 6]
where - T: Deserialize<'de>,

source§

fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>
where + T: Deserialize<'de>,

source§

fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>
where D: Deserializer<'de>,

source§

impl<'de, T> Deserialize<'de> for [T; 7]
where - T: Deserialize<'de>,

source§

fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>
where + T: Deserialize<'de>,

source§

fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>
where D: Deserializer<'de>,

source§

impl<'de, T> Deserialize<'de> for [T; 8]
where - T: Deserialize<'de>,

source§

fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>
where + T: Deserialize<'de>,

source§

fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>
where D: Deserializer<'de>,

source§

impl<'de, T> Deserialize<'de> for [T; 9]
where - T: Deserialize<'de>,

source§

fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>
where + T: Deserialize<'de>,

source§

fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>
where D: Deserializer<'de>,

source§

impl<'de, T> Deserialize<'de> for [T; 10]
where - T: Deserialize<'de>,

source§

fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>
where + T: Deserialize<'de>,

source§

fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>
where D: Deserializer<'de>,

source§

impl<'de, T> Deserialize<'de> for [T; 11]
where - T: Deserialize<'de>,

source§

fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>
where + T: Deserialize<'de>,

source§

fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>
where D: Deserializer<'de>,

source§

impl<'de, T> Deserialize<'de> for [T; 12]
where - T: Deserialize<'de>,

source§

fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>
where + T: Deserialize<'de>,

source§

fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>
where D: Deserializer<'de>,

source§

impl<'de, T> Deserialize<'de> for [T; 13]
where - T: Deserialize<'de>,

source§

fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>
where + T: Deserialize<'de>,

source§

fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>
where D: Deserializer<'de>,

source§

impl<'de, T> Deserialize<'de> for [T; 14]
where - T: Deserialize<'de>,

source§

fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>
where + T: Deserialize<'de>,

source§

fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>
where D: Deserializer<'de>,

source§

impl<'de, T> Deserialize<'de> for [T; 15]
where - T: Deserialize<'de>,

source§

fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>
where + T: Deserialize<'de>,

source§

fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>
where D: Deserializer<'de>,

source§

impl<'de, T> Deserialize<'de> for [T; 16]
where - T: Deserialize<'de>,

source§

fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>
where + T: Deserialize<'de>,

source§

fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>
where D: Deserializer<'de>,

source§

impl<'de, T> Deserialize<'de> for [T; 17]
where - T: Deserialize<'de>,

source§

fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>
where + T: Deserialize<'de>,

source§

fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>
where D: Deserializer<'de>,

source§

impl<'de, T> Deserialize<'de> for [T; 18]
where - T: Deserialize<'de>,

source§

fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>
where + T: Deserialize<'de>,

source§

fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>
where D: Deserializer<'de>,

source§

impl<'de, T> Deserialize<'de> for [T; 19]
where - T: Deserialize<'de>,

source§

fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>
where + T: Deserialize<'de>,

source§

fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>
where D: Deserializer<'de>,

source§

impl<'de, T> Deserialize<'de> for [T; 20]
where - T: Deserialize<'de>,

source§

fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>
where + T: Deserialize<'de>,

source§

fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>
where D: Deserializer<'de>,

source§

impl<'de, T> Deserialize<'de> for [T; 21]
where - T: Deserialize<'de>,

source§

fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>
where + T: Deserialize<'de>,

source§

fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>
where D: Deserializer<'de>,

source§

impl<'de, T> Deserialize<'de> for [T; 22]
where - T: Deserialize<'de>,

source§

fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>
where + T: Deserialize<'de>,

source§

fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>
where D: Deserializer<'de>,

source§

impl<'de, T> Deserialize<'de> for [T; 23]
where - T: Deserialize<'de>,

source§

fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>
where + T: Deserialize<'de>,

source§

fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>
where D: Deserializer<'de>,

source§

impl<'de, T> Deserialize<'de> for [T; 24]
where - T: Deserialize<'de>,

source§

fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>
where + T: Deserialize<'de>,

source§

fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>
where D: Deserializer<'de>,

source§

impl<'de, T> Deserialize<'de> for [T; 25]
where - T: Deserialize<'de>,

source§

fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>
where + T: Deserialize<'de>,

source§

fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>
where D: Deserializer<'de>,

source§

impl<'de, T> Deserialize<'de> for [T; 26]
where - T: Deserialize<'de>,

source§

fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>
where + T: Deserialize<'de>,

source§

fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>
where D: Deserializer<'de>,

source§

impl<'de, T> Deserialize<'de> for [T; 27]
where - T: Deserialize<'de>,

source§

fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>
where + T: Deserialize<'de>,

source§

fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>
where D: Deserializer<'de>,

source§

impl<'de, T> Deserialize<'de> for [T; 28]
where - T: Deserialize<'de>,

source§

fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>
where + T: Deserialize<'de>,

source§

fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>
where D: Deserializer<'de>,

source§

impl<'de, T> Deserialize<'de> for [T; 29]
where - T: Deserialize<'de>,

source§

fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>
where + T: Deserialize<'de>,

source§

fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>
where D: Deserializer<'de>,

source§

impl<'de, T> Deserialize<'de> for [T; 30]
where - T: Deserialize<'de>,

source§

fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>
where + T: Deserialize<'de>,

source§

fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>
where D: Deserializer<'de>,

source§

impl<'de, T> Deserialize<'de> for [T; 31]
where - T: Deserialize<'de>,

source§

fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>
where + T: Deserialize<'de>,

source§

fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>
where D: Deserializer<'de>,

source§

impl<'de, T> Deserialize<'de> for [T; 32]
where - T: Deserialize<'de>,

source§

fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>
where + T: Deserialize<'de>,

source§

fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>
where + D: Deserializer<'de>,

source§

impl<'de, T> Deserialize<'de> for (T,)
where + T: Deserialize<'de>,

source§

fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>
where D: Deserializer<'de>,

source§

impl<'de, T> Deserialize<'de> for BinaryHeap<T>
where T: Deserialize<'de> + Ord,

source§

fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>
where D: Deserializer<'de>,

source§

impl<'de, T> Deserialize<'de> for BTreeSet<T>
where @@ -208,25 +344,25 @@

§Lifetime

T: Deserialize<'de>,

source§

fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>
where D: Deserializer<'de>,

source§

impl<'de, T> Deserialize<'de> for Vec<T>
where T: Deserialize<'de>,

source§

fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>
where - D: Deserializer<'de>,

source§

impl<'de, T> Deserialize<'de> for Cell<T>
where - T: Deserialize<'de> + Copy,

source§

fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>
where + D: Deserializer<'de>,

source§

impl<'de, T> Deserialize<'de> for Cell<T>
where + T: Deserialize<'de> + Copy,

source§

fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>
where D: Deserializer<'de>,

source§

impl<'de, T> Deserialize<'de> for PhantomData<T>
where T: ?Sized,

source§

fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>
where - D: Deserializer<'de>,

source§

impl<'de, T> Deserialize<'de> for Wrapping<T>
where - T: Deserialize<'de>,

source§

fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>
where - D: Deserializer<'de>,

source§

impl<'de, T, E> Deserialize<'de> for Result<T, E>
where + D: Deserializer<'de>,

source§

impl<'de, T> Deserialize<'de> for Wrapping<T>
where + T: Deserialize<'de>,

source§

fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>
where + D: Deserializer<'de>,

source§

impl<'de, T, E> Deserialize<'de> for Result<T, E>
where T: Deserialize<'de>, - E: Deserialize<'de>,

source§

fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>
where + E: Deserialize<'de>,

source§

fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>
where D: Deserializer<'de>,

source§

impl<'de, T, S> Deserialize<'de> for HashSet<T, S>
where T: Deserialize<'de> + Eq + Hash, S: BuildHasher + Default,

source§

fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>
where - D: Deserializer<'de>,

source§

impl<'de, T: Deserialize<'de>> Deserialize<'de> for Box<[T]>

source§

fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>
where - D: Deserializer<'de>,

source§

impl<'de, T: Deserialize<'de>> Deserialize<'de> for Box<T>

source§

fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>
where - D: Deserializer<'de>,

source§

impl<'de, T: Deserialize<'de>> Deserialize<'de> for RefCell<T>

source§

fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>
where + D: Deserializer<'de>,

source§

impl<'de, T: Deserialize<'de>> Deserialize<'de> for Box<[T]>

source§

fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>
where + D: Deserializer<'de>,

source§

impl<'de, T: Deserialize<'de>> Deserialize<'de> for Box<T>

source§

fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>
where + D: Deserializer<'de>,

source§

impl<'de, T: Deserialize<'de>> Deserialize<'de> for RefCell<T>

source§

fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>
where D: Deserializer<'de>,

source§

impl<'de, T: Deserialize<'de>> Deserialize<'de> for Reverse<T>

source§

fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>
where - D: Deserializer<'de>,

source§

impl<'de, T: Deserialize<'de>> Deserialize<'de> for Mutex<T>

source§

fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>
where - D: Deserializer<'de>,

source§

impl<'de, T: Deserialize<'de>> Deserialize<'de> for RwLock<T>

source§

fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>
where + D: Deserializer<'de>,

source§

impl<'de, T: Deserialize<'de>> Deserialize<'de> for Mutex<T>

source§

fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>
where + D: Deserializer<'de>,

source§

impl<'de, T: Deserialize<'de>> Deserialize<'de> for RwLock<T>

source§

fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>
where D: Deserializer<'de>,

source§

impl<'de: 'a, 'a> Deserialize<'de> for &'a str

source§

fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>
where - D: Deserializer<'de>,

source§

impl<'de: 'a, 'a> Deserialize<'de> for &'a Path

source§

fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>
where + D: Deserializer<'de>,

source§

impl<'de: 'a, 'a> Deserialize<'de> for &'a Path

source§

fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>
where D: Deserializer<'de>,

source§

impl<'de: 'a, 'a> Deserialize<'de> for &'a [u8]

source§

fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>
where D: Deserializer<'de>,

Implementors§

source§

impl<'de> Deserialize<'de> for IgnoredAny

\ No newline at end of file diff --git a/serde/trait.Deserializer.html b/serde/trait.Deserializer.html index d2bcf177e5..a0904e052a 100644 --- a/serde/trait.Deserializer.html +++ b/serde/trait.Deserializer.html @@ -1,4 +1,4 @@ -Deserializer in serde - Rust
+Deserializer in serde - Rust

Trait serde::Deserializer

source · 
pub trait Deserializer<'de>: Sized {
     type Error: Error;
 
diff --git a/serde/trait.Serialize.html b/serde/trait.Serialize.html
index 75fc1a60d1..2e11327d6e 100644
--- a/serde/trait.Serialize.html
+++ b/serde/trait.Serialize.html
@@ -1,4 +1,4 @@
-Serialize in serde - Rust

+Serialize in serde - Rust

     
Trait serde::Serialize
source · 
pub trait Serialize {
     // Required method
     fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>
@@ -44,8 +44,8 @@
         s.end()
     }
 }

-

Object Safety§

This trait is not object safe.

Implementations on Foreign Types§

source§

impl Serialize for IpAddr

source§

fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>
where - S: Serializer,

source§

impl Serialize for SocketAddr

source§

fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>
where +

Object Safety§

This trait is not object safe.

Implementations on Foreign Types§

source§

impl Serialize for IpAddr

source§

fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>
where + S: Serializer,

source§

impl Serialize for SocketAddr

source§

fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>
where S: Serializer,

source§

impl Serialize for bool

source§

fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>
where S: Serializer,

source§

impl Serialize for char

source§

fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>
where S: Serializer,

source§

impl Serialize for f32

source§

fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>
where @@ -67,46 +67,46 @@ S: Serializer,

source§

impl Serialize for CString

source§

fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>
where S: Serializer,

source§

impl Serialize for String

source§

fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>
where S: Serializer,

source§

impl Serialize for CStr

source§

fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>
where - S: Serializer,

source§

impl Serialize for Ipv4Addr

source§

fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>
where - S: Serializer,

source§

impl Serialize for Ipv6Addr

source§

fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>
where - S: Serializer,

source§

impl Serialize for SocketAddrV4

source§

fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>
where - S: Serializer,

source§

impl Serialize for SocketAddrV6

source§

fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>
where - S: Serializer,

source§

impl Serialize for AtomicBool

source§

fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>
where - S: Serializer,

source§

impl Serialize for AtomicI8

source§

fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>
where - S: Serializer,

source§

impl Serialize for AtomicI16

source§

fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>
where - S: Serializer,

source§

impl Serialize for AtomicI32

source§

fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>
where - S: Serializer,

source§

impl Serialize for AtomicI64

source§

fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>
where - S: Serializer,

source§

impl Serialize for AtomicIsize

source§

fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>
where - S: Serializer,

source§

impl Serialize for AtomicU8

source§

fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>
where - S: Serializer,

source§

impl Serialize for AtomicU16

source§

fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>
where - S: Serializer,

source§

impl Serialize for AtomicU32

source§

fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>
where - S: Serializer,

source§

impl Serialize for AtomicU64

source§

fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>
where - S: Serializer,

source§

impl Serialize for AtomicUsize

source§

fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>
where - S: Serializer,

source§

impl Serialize for Duration

source§

fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>
where - S: Serializer,

source§

impl Serialize for OsStr

source§

fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>
where - S: Serializer,

source§

impl Serialize for OsString

source§

fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>
where - S: Serializer,

source§

impl Serialize for Path

source§

fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>
where - S: Serializer,

source§

impl Serialize for PathBuf

source§

fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>
where - S: Serializer,

source§

impl Serialize for SystemTime

source§

fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>
where - S: Serializer,

source§

impl Serialize for NonZeroI8

source§

fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>
where - S: Serializer,

source§

impl Serialize for NonZeroI16

source§

fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>
where - S: Serializer,

source§

impl Serialize for NonZeroI32

source§

fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>
where - S: Serializer,

source§

impl Serialize for NonZeroI64

source§

fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>
where - S: Serializer,

source§

impl Serialize for NonZeroI128

source§

fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>
where - S: Serializer,

source§

impl Serialize for NonZeroIsize

source§

fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>
where - S: Serializer,

source§

impl Serialize for NonZeroU8

source§

fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>
where - S: Serializer,

source§

impl Serialize for NonZeroU16

source§

fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>
where - S: Serializer,

source§

impl Serialize for NonZeroU32

source§

fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>
where - S: Serializer,

source§

impl Serialize for NonZeroU64

source§

fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>
where - S: Serializer,

source§

impl Serialize for NonZeroU128

source§

fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>
where - S: Serializer,

source§

impl Serialize for NonZeroUsize

source§

fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>
where + S: Serializer,

source§

impl Serialize for Ipv4Addr

source§

fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>
where + S: Serializer,

source§

impl Serialize for Ipv6Addr

source§

fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>
where + S: Serializer,

source§

impl Serialize for SocketAddrV4

source§

fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>
where + S: Serializer,

source§

impl Serialize for SocketAddrV6

source§

fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>
where + S: Serializer,

source§

impl Serialize for AtomicBool

source§

fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>
where + S: Serializer,

source§

impl Serialize for AtomicI8

source§

fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>
where + S: Serializer,

source§

impl Serialize for AtomicI16

source§

fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>
where + S: Serializer,

source§

impl Serialize for AtomicI32

source§

fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>
where + S: Serializer,

source§

impl Serialize for AtomicI64

source§

fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>
where + S: Serializer,

source§

impl Serialize for AtomicIsize

source§

fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>
where + S: Serializer,

source§

impl Serialize for AtomicU8

source§

fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>
where + S: Serializer,

source§

impl Serialize for AtomicU16

source§

fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>
where + S: Serializer,

source§

impl Serialize for AtomicU32

source§

fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>
where + S: Serializer,

source§

impl Serialize for AtomicU64

source§

fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>
where + S: Serializer,

source§

impl Serialize for AtomicUsize

source§

fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>
where + S: Serializer,

source§

impl Serialize for Duration

source§

fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>
where + S: Serializer,

source§

impl Serialize for OsStr

source§

fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>
where + S: Serializer,

source§

impl Serialize for OsString

source§

fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>
where + S: Serializer,

source§

impl Serialize for Path

source§

fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>
where + S: Serializer,

source§

impl Serialize for PathBuf

source§

fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>
where + S: Serializer,

source§

impl Serialize for SystemTime

source§

fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>
where + S: Serializer,

source§

impl Serialize for NonZeroI8

source§

fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>
where + S: Serializer,

source§

impl Serialize for NonZeroI16

source§

fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>
where + S: Serializer,

source§

impl Serialize for NonZeroI32

source§

fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>
where + S: Serializer,

source§

impl Serialize for NonZeroI64

source§

fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>
where + S: Serializer,

source§

impl Serialize for NonZeroI128

source§

fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>
where + S: Serializer,

source§

impl Serialize for NonZeroIsize

source§

fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>
where + S: Serializer,

source§

impl Serialize for NonZeroU8

source§

fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>
where + S: Serializer,

source§

impl Serialize for NonZeroU16

source§

fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>
where + S: Serializer,

source§

impl Serialize for NonZeroU32

source§

fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>
where + S: Serializer,

source§

impl Serialize for NonZeroU64

source§

fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>
where + S: Serializer,

source§

impl Serialize for NonZeroU128

source§

fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>
where + S: Serializer,

source§

impl Serialize for NonZeroUsize

source§

fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>
where S: Serializer,

source§

impl<'a> Serialize for Arguments<'a>

source§

fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>
where - S: Serializer,

source§

impl<'a, T> Serialize for Cow<'a, T>
where - T: ?Sized + Serialize + ToOwned,

source§

fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>
where - S: Serializer,

source§

impl<'a, T> Serialize for &'a T
where - T: ?Sized + Serialize,

source§

fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>
where - S: Serializer,

source§

impl<'a, T> Serialize for &'a mut T
where - T: ?Sized + Serialize,

source§

fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>
where + S: Serializer,

source§

impl<'a, T> Serialize for Cow<'a, T>
where + T: ?Sized + Serialize + ToOwned,

source§

fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>
where + S: Serializer,

source§

impl<'a, T> Serialize for &'a T
where + T: ?Sized + Serialize,

source§

fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>
where + S: Serializer,

source§

impl<'a, T> Serialize for &'a mut T
where + T: ?Sized + Serialize,

source§

fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>
where S: Serializer,

source§

impl<Idx> Serialize for Range<Idx>
where Idx: Serialize,

source§

fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>
where S: Serializer,

source§

impl<Idx> Serialize for RangeFrom<Idx>
where @@ -115,48 +115,46 @@ Idx: Serialize,

source§

fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>
where S: Serializer,

source§

impl<Idx> Serialize for RangeTo<Idx>
where Idx: Serialize,

source§

fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>
where - S: Serializer,

source§

impl<K, V> Serialize for BTreeMap<K, V>
where + S: Serializer,

source§

impl<K, V> Serialize for BTreeMap<K, V>
where K: Serialize, - V: Serialize,

source§

fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>
where - S: Serializer,

source§

impl<K, V, H> Serialize for HashMap<K, V, H>
where + V: Serialize,

source§

fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>
where + S: Serializer,

source§

impl<K, V, H> Serialize for HashMap<K, V, H>
where K: Serialize, - V: Serialize,

source§

fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>
where - S: Serializer,

source§

impl<T0> Serialize for (T0,)
where - T0: Serialize,

source§

fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>
where - S: Serializer,

source§

impl<T0, T1> Serialize for (T0, T1)
where + V: Serialize,

source§

fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>
where + S: Serializer,

source§

impl<T0, T1> Serialize for (T0, T1)
where T0: Serialize, - T1: Serialize,

source§

fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>
where - S: Serializer,

source§

impl<T0, T1, T2> Serialize for (T0, T1, T2)
where + T1: Serialize,

source§

fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>
where + S: Serializer,

source§

impl<T0, T1, T2> Serialize for (T0, T1, T2)
where T0: Serialize, T1: Serialize, - T2: Serialize,

source§

fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>
where - S: Serializer,

source§

impl<T0, T1, T2, T3> Serialize for (T0, T1, T2, T3)
where + T2: Serialize,

source§

fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>
where + S: Serializer,

source§

impl<T0, T1, T2, T3> Serialize for (T0, T1, T2, T3)
where T0: Serialize, T1: Serialize, T2: Serialize, - T3: Serialize,

source§

fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>
where - S: Serializer,

source§

impl<T0, T1, T2, T3, T4> Serialize for (T0, T1, T2, T3, T4)
where + T3: Serialize,

source§

fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>
where + S: Serializer,

source§

impl<T0, T1, T2, T3, T4> Serialize for (T0, T1, T2, T3, T4)
where T0: Serialize, T1: Serialize, T2: Serialize, T3: Serialize, - T4: Serialize,

source§

fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>
where - S: Serializer,

source§

impl<T0, T1, T2, T3, T4, T5> Serialize for (T0, T1, T2, T3, T4, T5)
where + T4: Serialize,

source§

fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>
where + S: Serializer,

source§

impl<T0, T1, T2, T3, T4, T5> Serialize for (T0, T1, T2, T3, T4, T5)
where T0: Serialize, T1: Serialize, T2: Serialize, T3: Serialize, T4: Serialize, - T5: Serialize,

source§

fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>
where - S: Serializer,

source§

impl<T0, T1, T2, T3, T4, T5, T6> Serialize for (T0, T1, T2, T3, T4, T5, T6)
where + T5: Serialize,

source§

fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>
where + S: Serializer,

source§

impl<T0, T1, T2, T3, T4, T5, T6> Serialize for (T0, T1, T2, T3, T4, T5, T6)
where T0: Serialize, T1: Serialize, T2: Serialize, T3: Serialize, T4: Serialize, T5: Serialize, - T6: Serialize,

source§

fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>
where - S: Serializer,

source§

impl<T0, T1, T2, T3, T4, T5, T6, T7> Serialize for (T0, T1, T2, T3, T4, T5, T6, T7)
where + T6: Serialize,

source§

fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>
where + S: Serializer,

source§

impl<T0, T1, T2, T3, T4, T5, T6, T7> Serialize for (T0, T1, T2, T3, T4, T5, T6, T7)
where T0: Serialize, T1: Serialize, T2: Serialize, @@ -164,8 +162,8 @@ T4: Serialize, T5: Serialize, T6: Serialize, - T7: Serialize,

source§

fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>
where - S: Serializer,

source§

impl<T0, T1, T2, T3, T4, T5, T6, T7, T8> Serialize for (T0, T1, T2, T3, T4, T5, T6, T7, T8)
where + T7: Serialize,

source§

fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>
where + S: Serializer,

source§

impl<T0, T1, T2, T3, T4, T5, T6, T7, T8> Serialize for (T0, T1, T2, T3, T4, T5, T6, T7, T8)
where T0: Serialize, T1: Serialize, T2: Serialize, @@ -174,8 +172,8 @@ T5: Serialize, T6: Serialize, T7: Serialize, - T8: Serialize,

source§

fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>
where - S: Serializer,

source§

impl<T0, T1, T2, T3, T4, T5, T6, T7, T8, T9> Serialize for (T0, T1, T2, T3, T4, T5, T6, T7, T8, T9)
where + T8: Serialize,

source§

fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>
where + S: Serializer,

source§

impl<T0, T1, T2, T3, T4, T5, T6, T7, T8, T9> Serialize for (T0, T1, T2, T3, T4, T5, T6, T7, T8, T9)
where T0: Serialize, T1: Serialize, T2: Serialize, @@ -185,8 +183,8 @@ T6: Serialize, T7: Serialize, T8: Serialize, - T9: Serialize,

source§

fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>
where - S: Serializer,

source§

impl<T0, T1, T2, T3, T4, T5, T6, T7, T8, T9, T10> Serialize for (T0, T1, T2, T3, T4, T5, T6, T7, T8, T9, T10)
where + T9: Serialize,

source§

fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>
where + S: Serializer,

source§

impl<T0, T1, T2, T3, T4, T5, T6, T7, T8, T9, T10> Serialize for (T0, T1, T2, T3, T4, T5, T6, T7, T8, T9, T10)
where T0: Serialize, T1: Serialize, T2: Serialize, @@ -197,8 +195,8 @@ T7: Serialize, T8: Serialize, T9: Serialize, - T10: Serialize,

source§

fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>
where - S: Serializer,

source§

impl<T0, T1, T2, T3, T4, T5, T6, T7, T8, T9, T10, T11> Serialize for (T0, T1, T2, T3, T4, T5, T6, T7, T8, T9, T10, T11)
where + T10: Serialize,

source§

fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>
where + S: Serializer,

source§

impl<T0, T1, T2, T3, T4, T5, T6, T7, T8, T9, T10, T11> Serialize for (T0, T1, T2, T3, T4, T5, T6, T7, T8, T9, T10, T11)
where T0: Serialize, T1: Serialize, T2: Serialize, @@ -210,8 +208,8 @@ T8: Serialize, T9: Serialize, T10: Serialize, - T11: Serialize,

source§

fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>
where - S: Serializer,

source§

impl<T0, T1, T2, T3, T4, T5, T6, T7, T8, T9, T10, T11, T12> Serialize for (T0, T1, T2, T3, T4, T5, T6, T7, T8, T9, T10, T11, T12)
where + T11: Serialize,

source§

fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>
where + S: Serializer,

source§

impl<T0, T1, T2, T3, T4, T5, T6, T7, T8, T9, T10, T11, T12> Serialize for (T0, T1, T2, T3, T4, T5, T6, T7, T8, T9, T10, T11, T12)
where T0: Serialize, T1: Serialize, T2: Serialize, @@ -224,8 +222,8 @@ T9: Serialize, T10: Serialize, T11: Serialize, - T12: Serialize,

source§

fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>
where - S: Serializer,

source§

impl<T0, T1, T2, T3, T4, T5, T6, T7, T8, T9, T10, T11, T12, T13> Serialize for (T0, T1, T2, T3, T4, T5, T6, T7, T8, T9, T10, T11, T12, T13)
where + T12: Serialize,

source§

fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>
where + S: Serializer,

source§

impl<T0, T1, T2, T3, T4, T5, T6, T7, T8, T9, T10, T11, T12, T13> Serialize for (T0, T1, T2, T3, T4, T5, T6, T7, T8, T9, T10, T11, T12, T13)
where T0: Serialize, T1: Serialize, T2: Serialize, @@ -239,8 +237,8 @@ T10: Serialize, T11: Serialize, T12: Serialize, - T13: Serialize,

source§

fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>
where - S: Serializer,

source§

impl<T0, T1, T2, T3, T4, T5, T6, T7, T8, T9, T10, T11, T12, T13, T14> Serialize for (T0, T1, T2, T3, T4, T5, T6, T7, T8, T9, T10, T11, T12, T13, T14)
where + T13: Serialize,

source§

fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>
where + S: Serializer,

source§

impl<T0, T1, T2, T3, T4, T5, T6, T7, T8, T9, T10, T11, T12, T13, T14> Serialize for (T0, T1, T2, T3, T4, T5, T6, T7, T8, T9, T10, T11, T12, T13, T14)
where T0: Serialize, T1: Serialize, T2: Serialize, @@ -255,8 +253,8 @@ T11: Serialize, T12: Serialize, T13: Serialize, - T14: Serialize,

source§

fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>
where - S: Serializer,

source§

impl<T0, T1, T2, T3, T4, T5, T6, T7, T8, T9, T10, T11, T12, T13, T14, T15> Serialize for (T0, T1, T2, T3, T4, T5, T6, T7, T8, T9, T10, T11, T12, T13, T14, T15)
where + T14: Serialize,

source§

fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>
where + S: Serializer,

source§

impl<T0, T1, T2, T3, T4, T5, T6, T7, T8, T9, T10, T11, T12, T13, T14, T15> Serialize for (T0, T1, T2, T3, T4, T5, T6, T7, T8, T9, T10, T11, T12, T13, T14, T15)
where T0: Serialize, T1: Serialize, T2: Serialize, @@ -272,80 +270,82 @@ T12: Serialize, T13: Serialize, T14: Serialize, - T15: Serialize,

source§

fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>
where + T15: Serialize,

source§

fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>
where S: Serializer,

source§

impl<T> Serialize for Bound<T>
where - T: Serialize,

source§

fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>
where + T: Serialize,

source§

fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>
where S: Serializer,

source§

impl<T> Serialize for Option<T>
where - T: Serialize,

source§

fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>
where - S: Serializer,

source§

impl<T> Serialize for [T; 0]

source§

fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>
where + T: Serialize,

source§

fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>
where + S: Serializer,

source§

impl<T> Serialize for [T; 0]

source§

fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>
where S: Serializer,

source§

impl<T> Serialize for [T; 1]
where - T: Serialize,

source§

fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>
where + T: Serialize,

source§

fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>
where S: Serializer,

source§

impl<T> Serialize for [T; 2]
where - T: Serialize,

source§

fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>
where + T: Serialize,

source§

fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>
where S: Serializer,

source§

impl<T> Serialize for [T; 3]
where - T: Serialize,

source§

fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>
where + T: Serialize,

source§

fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>
where S: Serializer,

source§

impl<T> Serialize for [T; 4]
where - T: Serialize,

source§

fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>
where + T: Serialize,

source§

fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>
where S: Serializer,

source§

impl<T> Serialize for [T; 5]
where - T: Serialize,

source§

fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>
where + T: Serialize,

source§

fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>
where S: Serializer,

source§

impl<T> Serialize for [T; 6]
where - T: Serialize,

source§

fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>
where + T: Serialize,

source§

fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>
where S: Serializer,

source§

impl<T> Serialize for [T; 7]
where - T: Serialize,

source§

fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>
where + T: Serialize,

source§

fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>
where S: Serializer,

source§

impl<T> Serialize for [T; 8]
where - T: Serialize,

source§

fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>
where + T: Serialize,

source§

fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>
where S: Serializer,

source§

impl<T> Serialize for [T; 9]
where - T: Serialize,

source§

fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>
where + T: Serialize,

source§

fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>
where S: Serializer,

source§

impl<T> Serialize for [T; 10]
where - T: Serialize,

source§

fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>
where + T: Serialize,

source§

fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>
where S: Serializer,

source§

impl<T> Serialize for [T; 11]
where - T: Serialize,

source§

fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>
where + T: Serialize,

source§

fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>
where S: Serializer,

source§

impl<T> Serialize for [T; 12]
where - T: Serialize,

source§

fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>
where + T: Serialize,

source§

fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>
where S: Serializer,

source§

impl<T> Serialize for [T; 13]
where - T: Serialize,

source§

fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>
where + T: Serialize,

source§

fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>
where S: Serializer,

source§

impl<T> Serialize for [T; 14]
where - T: Serialize,

source§

fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>
where + T: Serialize,

source§

fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>
where S: Serializer,

source§

impl<T> Serialize for [T; 15]
where - T: Serialize,

source§

fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>
where + T: Serialize,

source§

fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>
where S: Serializer,

source§

impl<T> Serialize for [T; 16]
where - T: Serialize,

source§

fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>
where + T: Serialize,

source§

fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>
where S: Serializer,

source§

impl<T> Serialize for [T; 17]
where - T: Serialize,

source§

fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>
where + T: Serialize,

source§

fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>
where S: Serializer,

source§

impl<T> Serialize for [T; 18]
where - T: Serialize,

source§

fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>
where + T: Serialize,

source§

fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>
where S: Serializer,

source§

impl<T> Serialize for [T; 19]
where - T: Serialize,

source§

fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>
where + T: Serialize,

source§

fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>
where S: Serializer,

source§

impl<T> Serialize for [T; 20]
where - T: Serialize,

source§

fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>
where + T: Serialize,

source§

fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>
where S: Serializer,

source§

impl<T> Serialize for [T; 21]
where - T: Serialize,

source§

fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>
where + T: Serialize,

source§

fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>
where S: Serializer,

source§

impl<T> Serialize for [T; 22]
where - T: Serialize,

source§

fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>
where + T: Serialize,

source§

fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>
where S: Serializer,

source§

impl<T> Serialize for [T; 23]
where - T: Serialize,

source§

fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>
where + T: Serialize,

source§

fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>
where S: Serializer,

source§

impl<T> Serialize for [T; 24]
where - T: Serialize,

source§

fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>
where + T: Serialize,

source§

fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>
where S: Serializer,

source§

impl<T> Serialize for [T; 25]
where - T: Serialize,

source§

fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>
where + T: Serialize,

source§

fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>
where S: Serializer,

source§

impl<T> Serialize for [T; 26]
where - T: Serialize,

source§

fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>
where + T: Serialize,

source§

fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>
where S: Serializer,

source§

impl<T> Serialize for [T; 27]
where - T: Serialize,

source§

fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>
where + T: Serialize,

source§

fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>
where S: Serializer,

source§

impl<T> Serialize for [T; 28]
where - T: Serialize,

source§

fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>
where + T: Serialize,

source§

fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>
where S: Serializer,

source§

impl<T> Serialize for [T; 29]
where - T: Serialize,

source§

fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>
where + T: Serialize,

source§

fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>
where S: Serializer,

source§

impl<T> Serialize for [T; 30]
where - T: Serialize,

source§

fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>
where + T: Serialize,

source§

fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>
where S: Serializer,

source§

impl<T> Serialize for [T; 31]
where - T: Serialize,

source§

fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>
where + T: Serialize,

source§

fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>
where S: Serializer,

source§

impl<T> Serialize for [T; 32]
where - T: Serialize,

source§

fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>
where + T: Serialize,

source§

fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>
where S: Serializer,

source§

impl<T> Serialize for [T]
where - T: Serialize,

source§

fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>
where - S: Serializer,

source§

impl<T> Serialize for Box<T>
where - T: ?Sized + Serialize,

source§

fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>
where + T: Serialize,

source§

fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>
where + S: Serializer,

source§

impl<T> Serialize for (T,)
where + T: Serialize,

source§

fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>
where + S: Serializer,

source§

impl<T> Serialize for Box<T>
where + T: ?Sized + Serialize,

source§

fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>
where S: Serializer,

source§

impl<T> Serialize for BinaryHeap<T>
where T: Serialize,

source§

fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>
where S: Serializer,

source§

impl<T> Serialize for BTreeSet<T>
where @@ -356,25 +356,25 @@ T: Serialize,

source§

fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>
where S: Serializer,

source§

impl<T> Serialize for Vec<T>
where T: Serialize,

source§

fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>
where - S: Serializer,

source§

impl<T> Serialize for Cell<T>
where - T: Serialize + Copy,

source§

fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>
where - S: Serializer,

source§

impl<T> Serialize for RefCell<T>
where - T: ?Sized + Serialize,

source§

fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>
where - S: Serializer,

source§

impl<T> Serialize for Reverse<T>
where - T: Serialize,

source§

fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>
where + S: Serializer,

source§

impl<T> Serialize for Cell<T>
where + T: Serialize + Copy,

source§

fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>
where + S: Serializer,

source§

impl<T> Serialize for RefCell<T>
where + T: ?Sized + Serialize,

source§

fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>
where + S: Serializer,

source§

impl<T> Serialize for Reverse<T>
where + T: Serialize,

source§

fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>
where S: Serializer,

source§

impl<T> Serialize for PhantomData<T>
where T: ?Sized,

source§

fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>
where - S: Serializer,

source§

impl<T> Serialize for Saturating<T>
where - T: Serialize,

source§

fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>
where - S: Serializer,

source§

impl<T> Serialize for Wrapping<T>
where - T: Serialize,

source§

fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>
where - S: Serializer,

source§

impl<T> Serialize for Mutex<T>
where - T: ?Sized + Serialize,

source§

fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>
where - S: Serializer,

source§

impl<T> Serialize for RwLock<T>
where - T: ?Sized + Serialize,

source§

fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>
where - S: Serializer,

source§

impl<T, E> Serialize for Result<T, E>
where + S: Serializer,

source§

impl<T> Serialize for Saturating<T>
where + T: Serialize,

source§

fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>
where + S: Serializer,

source§

impl<T> Serialize for Wrapping<T>
where + T: Serialize,

source§

fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>
where + S: Serializer,

source§

impl<T> Serialize for Mutex<T>
where + T: ?Sized + Serialize,

source§

fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>
where + S: Serializer,

source§

impl<T> Serialize for RwLock<T>
where + T: ?Sized + Serialize,

source§

fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>
where + S: Serializer,

source§

impl<T, E> Serialize for Result<T, E>
where T: Serialize, - E: Serialize,

source§

fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>
where + E: Serialize,

source§

fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>
where S: Serializer,

source§

impl<T, H> Serialize for HashSet<T, H>
where T: Serialize,

source§

fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>
where S: Serializer,

Implementors§

\ No newline at end of file diff --git a/serde/trait.Serializer.html b/serde/trait.Serializer.html index 75826d1aab..f38093c48b 100644 --- a/serde/trait.Serializer.html +++ b/serde/trait.Serializer.html @@ -1,4 +1,4 @@ -Serializer in serde - Rust
+Serializer in serde - Rust

Trait serde::Serializer

source · 
pub trait Serializer: Sized {
     type Ok;
     type Error: Error;
diff --git a/serde_derive/all.html b/serde_derive/all.html
index 973b7bd4bd..57aa6d5ac5 100644
--- a/serde_derive/all.html
+++ b/serde_derive/all.html
@@ -1,2 +1,2 @@
-List of all items in this crate

+List of all items in this crate

     
List of all items
Derive Macros

\ No newline at end of file
diff --git a/serde_derive/derive.Deserialize.html b/serde_derive/derive.Deserialize.html
index b19dd9ef44..7dc1960d01 100644
--- a/serde_derive/derive.Deserialize.html
+++ b/serde_derive/derive.Deserialize.html
@@ -1,4 +1,4 @@
-Deserialize in serde_derive - Rust

+Deserialize in serde_derive - Rust

     
Derive Macro serde_derive::Deserialize
source · 
#[derive(Deserialize)]
 {
     // Attributes available to this derive:
diff --git a/serde_derive/derive.Serialize.html b/serde_derive/derive.Serialize.html
index d320ac710d..c6a27f3ff4 100644
--- a/serde_derive/derive.Serialize.html
+++ b/serde_derive/derive.Serialize.html
@@ -1,4 +1,4 @@
-Serialize in serde_derive - Rust

+Serialize in serde_derive - Rust

     
Derive Macro serde_derive::Serialize
source · 
#[derive(Serialize)]
 {
     // Attributes available to this derive:
diff --git a/serde_derive/index.html b/serde_derive/index.html
index af312e0bd1..04a43be173 100644
--- a/serde_derive/index.html
+++ b/serde_derive/index.html
@@ -1,4 +1,4 @@
-serde_derive - Rust
source§
fn deserialize_unit<V>(self, visitor: V) -> Result<V::Value, Error>
where
+    V: Visitor<'de>,
Hint that the Deserialize type is expecting a unit value.
source§
fn deserialize_unit_struct<V>(
     self,
     _name: &'static str,
     visitor: V
 ) -> Result<V::Value, Error>
where
     V: Visitor<'de>,
Hint that the Deserialize type is expecting a unit struct with a
-particular name.
source§
fn deserialize_seq<V>(self, visitor: V) -> Result<V::Value, Error>
where
-    V: Visitor<'de>,
Hint that the Deserialize type is expecting a sequence of values.
source§
fn deserialize_tuple<V>(
+particular name.
source§
fn deserialize_seq<V>(self, visitor: V) -> Result<V::Value, Error>
where
+    V: Visitor<'de>,
Hint that the Deserialize type is expecting a sequence of values.
source§
fn deserialize_tuple<V>(
     self,
     _len: usize,
     visitor: V
 ) -> Result<V::Value, Error>
where
     V: Visitor<'de>,
Hint that the Deserialize type is expecting a sequence of values and
-knows how many values there are without looking at the serialized data.
source§
fn deserialize_tuple_struct<V>(
+knows how many values there are without looking at the serialized data.
source§

fn deserialize_tuple_struct<V>( self, _name: &'static str, _len: usize, visitor: V ) -> Result<V::Value, Error>
where V: Visitor<'de>,

Hint that the Deserialize type is expecting a tuple struct with a -particular name and number of fields.
source§

fn deserialize_map<V>(self, visitor: V) -> Result<V::Value, Error>
where - V: Visitor<'de>,

Hint that the Deserialize type is expecting a map of key-value pairs.
source§

fn deserialize_struct<V>( +particular name and number of fields.

source§

fn deserialize_map<V>(self, visitor: V) -> Result<V::Value, Error>
where + V: Visitor<'de>,

Hint that the Deserialize type is expecting a map of key-value pairs.
source§

fn deserialize_struct<V>( self, _name: &'static str, _fields: &'static [&'static str], visitor: V ) -> Result<V::Value, Error>
where V: Visitor<'de>,

Hint that the Deserialize type is expecting a struct with a particular -name and fields.
source§

fn deserialize_identifier<V>(self, visitor: V) -> Result<V::Value, Error>
where +name and fields.

source§

fn deserialize_identifier<V>(self, visitor: V) -> Result<V::Value, Error>
where V: Visitor<'de>,

Hint that the Deserialize type is expecting the name of a struct -field or the discriminant of an enum variant.
source§

fn deserialize_ignored_any<V>(self, visitor: V) -> Result<V::Value, Error>
where +field or the discriminant of an enum variant.

source§

fn deserialize_ignored_any<V>(self, visitor: V) -> Result<V::Value, Error>
where V: Visitor<'de>,

Hint that the Deserialize type needs to deserialize a value whose type -doesn’t matter because it is ignored. Read more
source§

fn is_human_readable(&self) -> bool

Determine whether Deserialize implementations should expect to -deserialize their human-readable form. Read more
source§

impl<'de> Deserializer<'de> for Value

§

type Error = Error

The error type that can be returned if some error occurs during -deserialization.
source§

fn deserialize_any<V>(self, visitor: V) -> Result<V::Value, Error>
where +doesn’t matter because it is ignored. Read more

source§

fn is_human_readable(&self) -> bool

Determine whether Deserialize implementations should expect to +deserialize their human-readable form. Read more
source§

impl<'de> Deserializer<'de> for Value

§

type Error = Error

The error type that can be returned if some error occurs during +deserialization.
source§

fn deserialize_any<V>(self, visitor: V) -> Result<V::Value, Error>
where V: Visitor<'de>,

Require the Deserializer to figure out how to drive the visitor based -on what data type is in the input. Read more
source§

fn deserialize_i8<V>(self, visitor: V) -> Result<V::Value, Error>
where - V: Visitor<'de>,

Hint that the Deserialize type is expecting an i8 value.
source§

fn deserialize_i16<V>(self, visitor: V) -> Result<V::Value, Error>
where - V: Visitor<'de>,

Hint that the Deserialize type is expecting an i16 value.
source§

fn deserialize_i32<V>(self, visitor: V) -> Result<V::Value, Error>
where - V: Visitor<'de>,

Hint that the Deserialize type is expecting an i32 value.
source§

fn deserialize_i64<V>(self, visitor: V) -> Result<V::Value, Error>
where - V: Visitor<'de>,

Hint that the Deserialize type is expecting an i64 value.
source§

fn deserialize_i128<V>(self, visitor: V) -> Result<V::Value, Error>
where - V: Visitor<'de>,

Hint that the Deserialize type is expecting an i128 value. Read more
source§

fn deserialize_u8<V>(self, visitor: V) -> Result<V::Value, Error>
where - V: Visitor<'de>,

Hint that the Deserialize type is expecting a u8 value.
source§

fn deserialize_u16<V>(self, visitor: V) -> Result<V::Value, Error>
where - V: Visitor<'de>,

Hint that the Deserialize type is expecting a u16 value.
source§

fn deserialize_u32<V>(self, visitor: V) -> Result<V::Value, Error>
where - V: Visitor<'de>,

Hint that the Deserialize type is expecting a u32 value.
source§

fn deserialize_u64<V>(self, visitor: V) -> Result<V::Value, Error>
where - V: Visitor<'de>,

Hint that the Deserialize type is expecting a u64 value.
source§

fn deserialize_u128<V>(self, visitor: V) -> Result<V::Value, Error>
where - V: Visitor<'de>,

Hint that the Deserialize type is expecting an u128 value. Read more
source§

fn deserialize_f32<V>(self, visitor: V) -> Result<V::Value, Error>
where - V: Visitor<'de>,

Hint that the Deserialize type is expecting a f32 value.
source§

fn deserialize_f64<V>(self, visitor: V) -> Result<V::Value, Error>
where - V: Visitor<'de>,

Hint that the Deserialize type is expecting a f64 value.
source§

fn deserialize_option<V>(self, visitor: V) -> Result<V::Value, Error>
where - V: Visitor<'de>,

Hint that the Deserialize type is expecting an optional value. Read more
source§

fn deserialize_enum<V>( +on what data type is in the input. Read more

source§

fn deserialize_i8<V>(self, visitor: V) -> Result<V::Value, Error>
where + V: Visitor<'de>,

Hint that the Deserialize type is expecting an i8 value.
source§

fn deserialize_i16<V>(self, visitor: V) -> Result<V::Value, Error>
where + V: Visitor<'de>,

Hint that the Deserialize type is expecting an i16 value.
source§

fn deserialize_i32<V>(self, visitor: V) -> Result<V::Value, Error>
where + V: Visitor<'de>,

Hint that the Deserialize type is expecting an i32 value.
source§

fn deserialize_i64<V>(self, visitor: V) -> Result<V::Value, Error>
where + V: Visitor<'de>,

Hint that the Deserialize type is expecting an i64 value.
source§

fn deserialize_i128<V>(self, visitor: V) -> Result<V::Value, Error>
where + V: Visitor<'de>,

Hint that the Deserialize type is expecting an i128 value. Read more
source§

fn deserialize_u8<V>(self, visitor: V) -> Result<V::Value, Error>
where + V: Visitor<'de>,

Hint that the Deserialize type is expecting a u8 value.
source§

fn deserialize_u16<V>(self, visitor: V) -> Result<V::Value, Error>
where + V: Visitor<'de>,

Hint that the Deserialize type is expecting a u16 value.
source§

fn deserialize_u32<V>(self, visitor: V) -> Result<V::Value, Error>
where + V: Visitor<'de>,

Hint that the Deserialize type is expecting a u32 value.
source§

fn deserialize_u64<V>(self, visitor: V) -> Result<V::Value, Error>
where + V: Visitor<'de>,

Hint that the Deserialize type is expecting a u64 value.
source§

fn deserialize_u128<V>(self, visitor: V) -> Result<V::Value, Error>
where + V: Visitor<'de>,

Hint that the Deserialize type is expecting an u128 value. Read more
source§

fn deserialize_f32<V>(self, visitor: V) -> Result<V::Value, Error>
where + V: Visitor<'de>,

Hint that the Deserialize type is expecting a f32 value.
source§

fn deserialize_f64<V>(self, visitor: V) -> Result<V::Value, Error>
where + V: Visitor<'de>,

Hint that the Deserialize type is expecting a f64 value.
source§

fn deserialize_option<V>(self, visitor: V) -> Result<V::Value, Error>
where + V: Visitor<'de>,

Hint that the Deserialize type is expecting an optional value. Read more
source§

fn deserialize_enum<V>( self, _name: &str, _variants: &'static [&'static str], visitor: V ) -> Result<V::Value, Error>
where V: Visitor<'de>,

Hint that the Deserialize type is expecting an enum value with a -particular name and possible variants.
source§

fn deserialize_newtype_struct<V>( +particular name and possible variants.

source§

fn deserialize_newtype_struct<V>( self, name: &'static str, visitor: V ) -> Result<V::Value, Error>
where V: Visitor<'de>,

Hint that the Deserialize type is expecting a newtype struct with a -particular name.
source§

fn deserialize_bool<V>(self, visitor: V) -> Result<V::Value, Error>
where - V: Visitor<'de>,

Hint that the Deserialize type is expecting a bool value.
source§

fn deserialize_char<V>(self, visitor: V) -> Result<V::Value, Error>
where - V: Visitor<'de>,

Hint that the Deserialize type is expecting a char value.
source§

fn deserialize_str<V>(self, visitor: V) -> Result<V::Value, Error>
where +particular name.

source§

fn deserialize_bool<V>(self, visitor: V) -> Result<V::Value, Error>
where + V: Visitor<'de>,

Hint that the Deserialize type is expecting a bool value.
source§

fn deserialize_char<V>(self, visitor: V) -> Result<V::Value, Error>
where + V: Visitor<'de>,

Hint that the Deserialize type is expecting a char value.
source§

fn deserialize_str<V>(self, visitor: V) -> Result<V::Value, Error>
where V: Visitor<'de>,

Hint that the Deserialize type is expecting a string value and does not benefit from taking ownership of buffered data owned by the -Deserializer. Read more
source§

fn deserialize_string<V>(self, visitor: V) -> Result<V::Value, Error>
where +Deserializer. Read more

source§

fn deserialize_string<V>(self, visitor: V) -> Result<V::Value, Error>
where V: Visitor<'de>,

Hint that the Deserialize type is expecting a string value and would benefit from taking ownership of buffered data owned by the -Deserializer. Read more
source§

fn deserialize_bytes<V>(self, visitor: V) -> Result<V::Value, Error>
where +Deserializer. Read more

source§

fn deserialize_bytes<V>(self, visitor: V) -> Result<V::Value, Error>
where V: Visitor<'de>,

Hint that the Deserialize type is expecting a byte array and does not benefit from taking ownership of buffered data owned by the -Deserializer. Read more
source§

fn deserialize_byte_buf<V>(self, visitor: V) -> Result<V::Value, Error>
where +Deserializer. Read more

source§

fn deserialize_byte_buf<V>(self, visitor: V) -> Result<V::Value, Error>
where V: Visitor<'de>,

Hint that the Deserialize type is expecting a byte array and would benefit from taking ownership of buffered data owned by the -Deserializer. Read more
source§

fn deserialize_unit<V>(self, visitor: V) -> Result<V::Value, Error>
where - V: Visitor<'de>,

Hint that the Deserialize type is expecting a unit value.
source§

fn deserialize_unit_struct<V>( +Deserializer. Read more

source§

fn deserialize_unit<V>(self, visitor: V) -> Result<V::Value, Error>
where + V: Visitor<'de>,

Hint that the Deserialize type is expecting a unit value.
source§

fn deserialize_unit_struct<V>( self, _name: &'static str, visitor: V ) -> Result<V::Value, Error>
where V: Visitor<'de>,

Hint that the Deserialize type is expecting a unit struct with a -particular name.
source§

fn deserialize_seq<V>(self, visitor: V) -> Result<V::Value, Error>
where - V: Visitor<'de>,

Hint that the Deserialize type is expecting a sequence of values.
source§

fn deserialize_tuple<V>( +particular name.

source§

fn deserialize_seq<V>(self, visitor: V) -> Result<V::Value, Error>
where + V: Visitor<'de>,

Hint that the Deserialize type is expecting a sequence of values.
source§

fn deserialize_tuple<V>( self, _len: usize, visitor: V ) -> Result<V::Value, Error>
where V: Visitor<'de>,

Hint that the Deserialize type is expecting a sequence of values and -knows how many values there are without looking at the serialized data.
source§

fn deserialize_tuple_struct<V>( +knows how many values there are without looking at the serialized data.

source§

fn deserialize_tuple_struct<V>( self, _name: &'static str, _len: usize, visitor: V ) -> Result<V::Value, Error>
where V: Visitor<'de>,

Hint that the Deserialize type is expecting a tuple struct with a -particular name and number of fields.
source§

fn deserialize_map<V>(self, visitor: V) -> Result<V::Value, Error>
where - V: Visitor<'de>,

Hint that the Deserialize type is expecting a map of key-value pairs.
source§

fn deserialize_struct<V>( +particular name and number of fields.

source§

fn deserialize_map<V>(self, visitor: V) -> Result<V::Value, Error>
where + V: Visitor<'de>,

Hint that the Deserialize type is expecting a map of key-value pairs.
source§

fn deserialize_struct<V>( self, _name: &'static str, _fields: &'static [&'static str], visitor: V ) -> Result<V::Value, Error>
where V: Visitor<'de>,

Hint that the Deserialize type is expecting a struct with a particular -name and fields.
source§

fn deserialize_identifier<V>(self, visitor: V) -> Result<V::Value, Error>
where +name and fields.

source§

fn deserialize_identifier<V>(self, visitor: V) -> Result<V::Value, Error>
where V: Visitor<'de>,

Hint that the Deserialize type is expecting the name of a struct -field or the discriminant of an enum variant.
source§

fn deserialize_ignored_any<V>(self, visitor: V) -> Result<V::Value, Error>
where +field or the discriminant of an enum variant.

source§

fn deserialize_ignored_any<V>(self, visitor: V) -> Result<V::Value, Error>
where V: Visitor<'de>,

Hint that the Deserialize type needs to deserialize a value whose type -doesn’t matter because it is ignored. Read more
source§

fn is_human_readable(&self) -> bool

Determine whether Deserialize implementations should expect to +doesn’t matter because it is ignored. Read more
source§

fn is_human_readable(&self) -> bool

Determine whether Deserialize implementations should expect to deserialize their human-readable form. Read more
source§

impl Display for Value

source§

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Display a JSON value as a string.

let json = json!({ "city": "London", "street": "10 Downing Street" });
@@ -524,26 +524,26 @@ 
§Examples

 let pretty = format!("{:#}", json);
 assert_eq!(pretty,
     "{\n  \"city\": \"London\",\n  \"street\": \"10 Downing Street\"\n}");
-
source§

impl<T: Clone + Into<Value>> From<&[T]> for Value

source§

fn from(f: &[T]) -> Self

Convert a slice to Value::Array.

-
§Examples
+
source§

impl<T: Clone + Into<Value>> From<&[T]> for Value

source§

fn from(f: &[T]) -> Self

Convert a slice to Value::Array.

+
§Examples
use serde_json::Value;
 
 let v: &[&str] = &["lorem", "ipsum", "dolor"];
 let x: Value = v.into();
source§

impl From<&str> for Value

source§

fn from(f: &str) -> Self

Convert string slice to Value::String.

-
§Examples
+
§Examples
use serde_json::Value;
 
 let s: &str = "lorem";
 let x: Value = s.into();
-
source§

impl From<()> for Value

source§

fn from((): ()) -> Self

Convert () to Value::Null.

-
§Examples
+
source§

impl From<()> for Value

source§

fn from((): ()) -> Self

Convert () to Value::Null.

+
§Examples
use serde_json::Value;
 
 let u = ();
 let x: Value = u.into();
-
source§

impl<'a> From<Cow<'a, str>> for Value

source§

fn from(f: Cow<'a, str>) -> Self

Convert copy-on-write string to Value::String.

-
§Examples
+
source§

impl<'a> From<Cow<'a, str>> for Value

source§

fn from(f: Cow<'a, str>) -> Self

Convert copy-on-write string to Value::String.

+
§Examples
use serde_json::Value;
 use std::borrow::Cow;
 
@@ -555,60 +555,60 @@ 
§Exampleslet s: Cow<str> = Cow::Owned("lorem".to_string());
 let x: Value = s.into();
-
source§

impl From<Map<String, Value>> for Value

source§

fn from(f: Map<String, Value>) -> Self

Convert map (with string keys) to Value::Object.

-
§Examples
+
source§

impl From<Map<String, Value>> for Value

source§

fn from(f: Map<String, Value>) -> Self

Convert map (with string keys) to Value::Object.

+
§Examples
use serde_json::{Map, Value};
 
 let mut m = Map::new();
 m.insert("Lorem".to_string(), "ipsum".into());
 let x: Value = m.into();
-
source§

impl From<Number> for Value

source§

fn from(f: Number) -> Self

Convert Number to Value::Number.

-
§Examples
+
source§

impl From<Number> for Value

source§

fn from(f: Number) -> Self

Convert Number to Value::Number.

+
§Examples
use serde_json::{Number, Value};
 
 let n = Number::from(7);
 let x: Value = n.into();
source§

impl<T> From<Option<T>> for Value
where - T: Into<Value>,

source§

fn from(opt: Option<T>) -> Self

Converts to this type from the input type.
source§

impl From<String> for Value

source§

fn from(f: String) -> Self

Convert String to Value::String.

+ T: Into<Value>,
source§

fn from(opt: Option<T>) -> Self

Converts to this type from the input type.
source§

impl From<String> for Value

source§

fn from(f: String) -> Self

Convert String to Value::String.

§Examples
use serde_json::Value;
 
 let s: String = "lorem".to_string();
 let x: Value = s.into();
-
source§

impl<T: Into<Value>> From<Vec<T>> for Value

source§

fn from(f: Vec<T>) -> Self

Convert a Vec to Value::Array.

-
§Examples
+
source§

impl<T: Into<Value>> From<Vec<T>> for Value

source§

fn from(f: Vec<T>) -> Self

Convert a Vec to Value::Array.

+
§Examples
use serde_json::Value;
 
 let v = vec!["lorem", "ipsum", "dolor"];
 let x: Value = v.into();
-
source§

impl From<bool> for Value

source§

fn from(f: bool) -> Self

Convert boolean to Value::Bool.

+
source§

impl From<bool> for Value

source§

fn from(f: bool) -> Self

Convert boolean to Value::Bool.

§Examples
use serde_json::Value;
 
 let b = false;
 let x: Value = b.into();
-
source§

impl From<f32> for Value

source§

fn from(f: f32) -> Self

Convert 32-bit floating point number to Value::Number, or +

source§

impl From<f32> for Value

source§

fn from(f: f32) -> Self

Convert 32-bit floating point number to Value::Number, or Value::Null if infinite or NaN.

-
§Examples
+
§Examples
use serde_json::Value;
 
 let f: f32 = 13.37;
 let x: Value = f.into();
-
source§

impl From<f64> for Value

source§

fn from(f: f64) -> Self

Convert 64-bit floating point number to Value::Number, or +

source§

impl From<f64> for Value

source§

fn from(f: f64) -> Self

Convert 64-bit floating point number to Value::Number, or Value::Null if infinite or NaN.

-
§Examples
+
§Examples
use serde_json::Value;
 
 let f: f64 = 13.37;
 let x: Value = f.into();
-
source§

impl From<i16> for Value

source§

fn from(n: i16) -> Self

Converts to this type from the input type.
source§

impl From<i32> for Value

source§

fn from(n: i32) -> Self

Converts to this type from the input type.
source§

impl From<i64> for Value

source§

fn from(n: i64) -> Self

Converts to this type from the input type.
source§

impl From<i8> for Value

source§

fn from(n: i8) -> Self

Converts to this type from the input type.
source§

impl From<isize> for Value

source§

fn from(n: isize) -> Self

Converts to this type from the input type.
source§

impl From<u16> for Value

source§

fn from(n: u16) -> Self

Converts to this type from the input type.
source§

impl From<u32> for Value

source§

fn from(n: u32) -> Self

Converts to this type from the input type.
source§

impl From<u64> for Value

source§

fn from(n: u64) -> Self

Converts to this type from the input type.
source§

impl From<u8> for Value

source§

fn from(n: u8) -> Self

Converts to this type from the input type.
source§

impl From<usize> for Value

source§

fn from(n: usize) -> Self

Converts to this type from the input type.
source§

impl<K: Into<String>, V: Into<Value>> FromIterator<(K, V)> for Value

source§

fn from_iter<I: IntoIterator<Item = (K, V)>>(iter: I) -> Self

Create a Value::Object by collecting an iterator of key-value pairs.

-
§Examples
+
source§

impl From<i16> for Value

source§

fn from(n: i16) -> Self

Converts to this type from the input type.
source§

impl From<i32> for Value

source§

fn from(n: i32) -> Self

Converts to this type from the input type.
source§

impl From<i64> for Value

source§

fn from(n: i64) -> Self

Converts to this type from the input type.
source§

impl From<i8> for Value

source§

fn from(n: i8) -> Self

Converts to this type from the input type.
source§

impl From<isize> for Value

source§

fn from(n: isize) -> Self

Converts to this type from the input type.
source§

impl From<u16> for Value

source§

fn from(n: u16) -> Self

Converts to this type from the input type.
source§

impl From<u32> for Value

source§

fn from(n: u32) -> Self

Converts to this type from the input type.
source§

impl From<u64> for Value

source§

fn from(n: u64) -> Self

Converts to this type from the input type.
source§

impl From<u8> for Value

source§

fn from(n: u8) -> Self

Converts to this type from the input type.
source§

impl From<usize> for Value

source§

fn from(n: usize) -> Self

Converts to this type from the input type.
source§

impl<K: Into<String>, V: Into<Value>> FromIterator<(K, V)> for Value

source§

fn from_iter<I: IntoIterator<Item = (K, V)>>(iter: I) -> Self

Create a Value::Object by collecting an iterator of key-value pairs.

+
§Examples
use serde_json::Value;
 
 let v: Vec<_> = vec![("lorem", 40), ("ipsum", 2)];
 let x: Value = v.into_iter().collect();
source§

impl<T: Into<Value>> FromIterator<T> for Value

source§

fn from_iter<I: IntoIterator<Item = T>>(iter: I) -> Self

Create a Value::Array by collecting an iterator of array elements.

-
§Examples
+
§Examples
use serde_json::Value;
 
 let v = std::iter::repeat(42).take(5);
@@ -632,7 +632,7 @@ 
§Examples

 in the map or the given index is not within the bounds of the array.

 
For retrieving deeply nested values, you should have a look at the
 Value::pointer method.

-
§Examples

+
§Examples

 
let data = json!({
     "x": {
         "y": ["z", "zz"]
@@ -654,7 +654,7 @@ 
§Examples

 treated like an empty object. If the key is not already present in the
 object, it will be inserted with a value of null. Indexing into a value
 that is neither an object nor null will panic.

-
§Examples

+
§Examples

 
let mut data = json!({ "x": 0 });
 
 // replace an existing key
@@ -670,129 +670,133 @@ 
§Examples

 data["a"]["b"]["c"]["d"] = json!(true);
 
 println!("{}", data);

-
source§

impl<'de> IntoDeserializer<'de, Error> for &'de Value

§

type Deserializer = &'de Value

The type of the deserializer being converted into.
source§

fn into_deserializer(self) -> Self::Deserializer

Convert this value into a deserializer.
source§

impl<'de> IntoDeserializer<'de, Error> for Value

§

type Deserializer = Value

The type of the deserializer being converted into.
source§

fn into_deserializer(self) -> Self::Deserializer

Convert this value into a deserializer.
source§

impl PartialEq<&str> for Value

source§

fn eq(&self, other: &&str) -> 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 PartialEq<String> for Value

source§

fn eq(&self, other: &String) -> 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 PartialEq<Value> for &str

source§

fn eq(&self, other: &Value) -> 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 PartialEq<Value> for String

source§

fn eq(&self, other: &Value) -> 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 PartialEq<Value> for bool

source§

fn eq(&self, other: &Value) -> 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 PartialEq<Value> for f32

source§

fn eq(&self, other: &Value) -> 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 PartialEq<Value> for f64

source§

fn eq(&self, other: &Value) -> 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 PartialEq<Value> for i16

source§

fn eq(&self, other: &Value) -> 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 PartialEq<Value> for i32

source§

fn eq(&self, other: &Value) -> 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 PartialEq<Value> for i64

source§

fn eq(&self, other: &Value) -> 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 PartialEq<Value> for i8

source§

fn eq(&self, other: &Value) -> 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 PartialEq<Value> for isize

source§

fn eq(&self, other: &Value) -> 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 PartialEq<Value> for str

source§

fn eq(&self, other: &Value) -> bool

This method tests for self and other values to be equal, and is used +
source§

impl<'de> IntoDeserializer<'de, Error> for &'de Value

§

type Deserializer = &'de Value

The type of the deserializer being converted into.
source§

fn into_deserializer(self) -> Self::Deserializer

Convert this value into a deserializer.
source§

impl<'de> IntoDeserializer<'de, Error> for Value

§

type Deserializer = Value

The type of the deserializer being converted into.
source§

fn into_deserializer(self) -> Self::Deserializer

Convert this value into a deserializer.
source§

impl PartialEq<&str> for Value

source§

fn eq(&self, other: &&str) -> 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 PartialEq<String> for Value

source§

fn eq(&self, other: &String) -> 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 PartialEq<Value> for &str

source§

fn eq(&self, other: &Value) -> 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 PartialEq<Value> for u16

source§

fn eq(&self, other: &Value) -> 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 PartialEq<Value> for u32

source§

fn eq(&self, other: &Value) -> bool

This method tests for self and other values to be equal, and is used +sufficient, and should not be overridden without very good reason.
source§

impl PartialEq<Value> for String

source§

fn eq(&self, other: &Value) -> 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 PartialEq<Value> for bool

source§

fn eq(&self, other: &Value) -> 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 PartialEq<Value> for u64

source§

fn eq(&self, other: &Value) -> 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 PartialEq<Value> for u8

source§

fn eq(&self, other: &Value) -> 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 PartialEq<Value> for usize

source§

fn eq(&self, other: &Value) -> 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<'a> PartialEq<bool> for &'a Value

source§

fn eq(&self, other: &bool) -> 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<'a> PartialEq<bool> for &'a mut Value

source§

fn eq(&self, other: &bool) -> 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 PartialEq<bool> for Value

source§

fn eq(&self, other: &bool) -> 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<'a> PartialEq<f32> for &'a Value

source§

fn eq(&self, other: &f32) -> 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<'a> PartialEq<f32> for &'a mut Value

source§

fn eq(&self, other: &f32) -> bool

This method tests for self and other values to be equal, and is used +sufficient, and should not be overridden without very good reason.
source§

impl PartialEq<Value> for f32

source§

fn eq(&self, other: &Value) -> 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 PartialEq<Value> for f64

source§

fn eq(&self, other: &Value) -> 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 PartialEq<f32> for Value

source§

fn eq(&self, other: &f32) -> 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<'a> PartialEq<f64> for &'a Value

source§

fn eq(&self, other: &f64) -> 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<'a> PartialEq<f64> for &'a mut Value

source§

fn eq(&self, other: &f64) -> 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 PartialEq<f64> for Value

source§

fn eq(&self, other: &f64) -> bool

This method tests for self and other values to be equal, and is used +sufficient, and should not be overridden without very good reason.
source§

impl PartialEq<Value> for i16

source§

fn eq(&self, other: &Value) -> 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<'a> PartialEq<i16> for &'a Value

source§

fn eq(&self, other: &i16) -> 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<'a> PartialEq<i16> for &'a mut Value

source§

fn eq(&self, other: &i16) -> 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 PartialEq<i16> for Value

source§

fn eq(&self, other: &i16) -> 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<'a> PartialEq<i32> for &'a Value

source§

fn eq(&self, other: &i32) -> 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<'a> PartialEq<i32> for &'a mut Value

source§

fn eq(&self, other: &i32) -> bool

This method tests for self and other values to be equal, and is used +sufficient, and should not be overridden without very good reason.
source§

impl PartialEq<Value> for i32

source§

fn eq(&self, other: &Value) -> 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 PartialEq<i32> for Value

source§

fn eq(&self, other: &i32) -> 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<'a> PartialEq<i64> for &'a Value

source§

fn eq(&self, other: &i64) -> 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<'a> PartialEq<i64> for &'a mut Value

source§

fn eq(&self, other: &i64) -> 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 PartialEq<i64> for Value

source§

fn eq(&self, other: &i64) -> 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<'a> PartialEq<i8> for &'a Value

source§

fn eq(&self, other: &i8) -> bool

This method tests for self and other values to be equal, and is used +sufficient, and should not be overridden without very good reason.
source§

impl PartialEq<Value> for i64

source§

fn eq(&self, other: &Value) -> 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 PartialEq<Value> for i8

source§

fn eq(&self, other: &Value) -> 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 PartialEq<Value> for isize

source§

fn eq(&self, other: &Value) -> 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<'a> PartialEq<i8> for &'a mut Value

source§

fn eq(&self, other: &i8) -> 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 PartialEq<i8> for Value

source§

fn eq(&self, other: &i8) -> bool

This method tests for self and other values to be equal, and is used +sufficient, and should not be overridden without very good reason.
source§

impl PartialEq<Value> for str

source§

fn eq(&self, other: &Value) -> 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 PartialEq<Value> for u16

source§

fn eq(&self, other: &Value) -> 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 PartialEq<Value> for u32

source§

fn eq(&self, other: &Value) -> 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<'a> PartialEq<isize> for &'a Value

source§

fn eq(&self, other: &isize) -> 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<'a> PartialEq<isize> for &'a mut Value

source§

fn eq(&self, other: &isize) -> 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 PartialEq<isize> for Value

source§

fn eq(&self, other: &isize) -> 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 PartialEq<str> for Value

source§

fn eq(&self, other: &str) -> 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<'a> PartialEq<u16> for &'a Value

source§

fn eq(&self, other: &u16) -> bool

This method tests for self and other values to be equal, and is used +sufficient, and should not be overridden without very good reason.
source§

impl PartialEq<Value> for u64

source§

fn eq(&self, other: &Value) -> 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 PartialEq<Value> for u8

source§

fn eq(&self, other: &Value) -> 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<'a> PartialEq<u16> for &'a mut Value

source§

fn eq(&self, other: &u16) -> 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 PartialEq<u16> for Value

source§

fn eq(&self, other: &u16) -> 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<'a> PartialEq<u32> for &'a Value

source§

fn eq(&self, other: &u32) -> 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<'a> PartialEq<u32> for &'a mut Value

source§

fn eq(&self, other: &u32) -> 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 PartialEq<u32> for Value

source§

fn eq(&self, other: &u32) -> 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<'a> PartialEq<u64> for &'a Value

source§

fn eq(&self, other: &u64) -> bool

This method tests for self and other values to be equal, and is used +sufficient, and should not be overridden without very good reason.
source§

impl PartialEq<Value> for usize

source§

fn eq(&self, other: &Value) -> 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<'a> PartialEq<bool> for &'a Value

source§

fn eq(&self, other: &bool) -> 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<'a> PartialEq<bool> for &'a mut Value

source§

fn eq(&self, other: &bool) -> 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 PartialEq<bool> for Value

source§

fn eq(&self, other: &bool) -> 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<'a> PartialEq<f32> for &'a Value

source§

fn eq(&self, other: &f32) -> 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<'a> PartialEq<u64> for &'a mut Value

source§

fn eq(&self, other: &u64) -> 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 PartialEq<u64> for Value

source§

fn eq(&self, other: &u64) -> 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<'a> PartialEq<u8> for &'a Value

source§

fn eq(&self, other: &u8) -> 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<'a> PartialEq<u8> for &'a mut Value

source§

fn eq(&self, other: &u8) -> bool

This method tests for self and other values to be equal, and is used +sufficient, and should not be overridden without very good reason.
source§

impl<'a> PartialEq<f32> for &'a mut Value

source§

fn eq(&self, other: &f32) -> 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 PartialEq<f32> for Value

source§

fn eq(&self, other: &f32) -> 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<'a> PartialEq<f64> for &'a Value

source§

fn eq(&self, other: &f64) -> 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<'a> PartialEq<f64> for &'a mut Value

source§

fn eq(&self, other: &f64) -> 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 PartialEq<u8> for Value

source§

fn eq(&self, other: &u8) -> bool

This method tests for self and other values to be equal, and is used +sufficient, and should not be overridden without very good reason.
source§

impl PartialEq<f64> for Value

source§

fn eq(&self, other: &f64) -> 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<'a> PartialEq<usize> for &'a Value

source§

fn eq(&self, other: &usize) -> 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<'a> PartialEq<usize> for &'a mut Value

source§

fn eq(&self, other: &usize) -> 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 PartialEq<usize> for Value

source§

fn eq(&self, other: &usize) -> 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 PartialEq for Value

source§

fn eq(&self, other: &Value) -> bool

This method tests for self and other values to be equal, and is used +sufficient, and should not be overridden without very good reason.
source§

impl<'a> PartialEq<i16> for &'a Value

source§

fn eq(&self, other: &i16) -> 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<'a> PartialEq<i16> for &'a mut Value

source§

fn eq(&self, other: &i16) -> 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 PartialEq<i16> for Value

source§

fn eq(&self, other: &i16) -> 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<'a> PartialEq<i32> for &'a Value

source§

fn eq(&self, other: &i32) -> 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<'a> PartialEq<i32> for &'a mut Value

source§

fn eq(&self, other: &i32) -> 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 PartialEq<i32> for Value

source§

fn eq(&self, other: &i32) -> 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<'a> PartialEq<i64> for &'a Value

source§

fn eq(&self, other: &i64) -> 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<'a> PartialEq<i64> for &'a mut Value

source§

fn eq(&self, other: &i64) -> 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 PartialEq<i64> for Value

source§

fn eq(&self, other: &i64) -> 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<'a> PartialEq<i8> for &'a Value

source§

fn eq(&self, other: &i8) -> 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<'a> PartialEq<i8> for &'a mut Value

source§

fn eq(&self, other: &i8) -> 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 PartialEq<i8> for Value

source§

fn eq(&self, other: &i8) -> 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<'a> PartialEq<isize> for &'a Value

source§

fn eq(&self, other: &isize) -> 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<'a> PartialEq<isize> for &'a mut Value

source§

fn eq(&self, other: &isize) -> 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 PartialEq<isize> for Value

source§

fn eq(&self, other: &isize) -> 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 PartialEq<str> for Value

source§

fn eq(&self, other: &str) -> 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<'a> PartialEq<u16> for &'a Value

source§

fn eq(&self, other: &u16) -> 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<'a> PartialEq<u16> for &'a mut Value

source§

fn eq(&self, other: &u16) -> 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 PartialEq<u16> for Value

source§

fn eq(&self, other: &u16) -> 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<'a> PartialEq<u32> for &'a Value

source§

fn eq(&self, other: &u32) -> 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<'a> PartialEq<u32> for &'a mut Value

source§

fn eq(&self, other: &u32) -> 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 PartialEq<u32> for Value

source§

fn eq(&self, other: &u32) -> 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<'a> PartialEq<u64> for &'a Value

source§

fn eq(&self, other: &u64) -> 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<'a> PartialEq<u64> for &'a mut Value

source§

fn eq(&self, other: &u64) -> 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 PartialEq<u64> for Value

source§

fn eq(&self, other: &u64) -> 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<'a> PartialEq<u8> for &'a Value

source§

fn eq(&self, other: &u8) -> 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<'a> PartialEq<u8> for &'a mut Value

source§

fn eq(&self, other: &u8) -> 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 PartialEq<u8> for Value

source§

fn eq(&self, other: &u8) -> 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<'a> PartialEq<usize> for &'a Value

source§

fn eq(&self, other: &usize) -> 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<'a> PartialEq<usize> for &'a mut Value

source§

fn eq(&self, other: &usize) -> 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 PartialEq<usize> for Value

source§

fn eq(&self, other: &usize) -> 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 PartialEq for Value

source§

fn eq(&self, other: &Value) -> 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 Serialize for Value

source§

fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>
where S: Serializer,

Serialize this value into the given Serde serializer. Read more
source§

impl Eq for Value

source§

impl StructuralPartialEq for Value

Auto Trait Implementations§

§

impl Freeze for Value

§

impl RefUnwindSafe for Value

§

impl Send for Value

§

impl Sync for Value

§

impl Unpin for Value

§

impl UnwindSafe for Value

Blanket Implementations§

source§

impl<T> Any for T
where T: 'static + ?Sized,

source§

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more
source§

impl<T> Borrow<T> for T
where T: ?Sized,

source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
source§

impl<T> BorrowMut<T> for T
where - 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.

+ T: ?Sized,
source§

fn borrow_mut(&mut self) -> &mut T

Mutably borrows from an owned value. Read more
source§

impl<Q, K> Equivalent<K> for Q
where + Q: Eq + ?Sized, + K: Borrow<Q> + ?Sized,

source§

fn equivalent(&self, key: &K) -> bool

Checks if this value is equivalent to the given key. Read more
source§

impl<Q, K> Equivalent<K> for Q
where + Q: Eq + ?Sized, + K: Borrow<Q> + ?Sized,

source§

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 T
where U: From<T>,

source§

fn into(self) -> U

Calls U::from(self).

That is, this conversion is whatever the implementation of diff --git a/serde_json/error/enum.Category.html b/serde_json/error/enum.Category.html index 480e0f3511..bafc070061 100644 --- a/serde_json/error/enum.Category.html +++ b/serde_json/error/enum.Category.html @@ -1,4 +1,4 @@ -Category in serde_json::error - Rust

+Category in serde_json::error - Rust

Enum serde_json::error::Category

source · 
pub enum Category {
     Io,
     Syntax,
@@ -19,7 +19,11 @@
 sufficient, and should not be overridden without very good reason.
source§

impl Copy for Category

source§

impl Eq for Category

source§

impl StructuralPartialEq for Category

Auto Trait Implementations§

Blanket Implementations§

source§

impl<T> Any for T
where T: 'static + ?Sized,

source§

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more
source§

impl<T> Borrow<T> for T
where T: ?Sized,

source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
source§

impl<T> BorrowMut<T> for T
where - 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.

+ T: ?Sized,
source§

fn borrow_mut(&mut self) -> &mut T

Mutably borrows from an owned value. Read more
source§

impl<Q, K> Equivalent<K> for Q
where + Q: Eq + ?Sized, + K: Borrow<Q> + ?Sized,

source§

fn equivalent(&self, key: &K) -> bool

Checks if this value is equivalent to the given key. Read more
source§

impl<Q, K> Equivalent<K> for Q
where + Q: Eq + ?Sized, + K: Borrow<Q> + ?Sized,

source§

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 T
where U: From<T>,

source§

fn into(self) -> U

Calls U::from(self).

That is, this conversion is whatever the implementation of diff --git a/serde_json/error/struct.Error.html b/serde_json/error/struct.Error.html index d95f3d7fc4..de414300ec 100644 --- a/serde_json/error/struct.Error.html +++ b/serde_json/error/struct.Error.html @@ -64,8 +64,8 @@

§Example
} }; }
-

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, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter. Read more
source§

impl Error for Error

source§

fn custom<T: Display>(msg: T) -> Error

Used when a Serialize implementation encounters any error -while serializing a type. Read more
source§

impl Error for Error

source§

fn custom<T: Display>(msg: T) -> Error

Raised when there is general error when deserializing a type. Read more
source§

fn invalid_type(unexp: Unexpected<'_>, exp: &dyn Expected) -> Self

Raised when a Deserialize receives a type different from what it was +

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, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter. Read more
source§

impl Error for Error

source§

fn custom<T: Display>(msg: T) -> Error

Used when a Serialize implementation encounters any error +while serializing a type. Read more
source§

impl Error for Error

source§

fn source(&self) -> Option<&(dyn Error + 'static)>

The lower-level source of this error, if any. Read more
1.0.0 · source§

fn description(&self) -> &str

👎Deprecated since 1.42.0: use the Display impl or to_string()
Read more
1.0.0 · source§

fn cause(&self) -> Option<&dyn Error>

👎Deprecated since 1.33.0: replaced by Error::source, which can support downcasting
source§

fn provide<'a>(&'a self, 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 Error for Error

source§

fn custom<T: Display>(msg: T) -> Error

Raised when there is general error when deserializing a type. Read more
source§

fn invalid_type(unexp: Unexpected<'_>, exp: &dyn Expected) -> Self

Raised when a Deserialize receives a type different from what it was expecting. Read more
source§

fn invalid_value(unexp: Unexpected<'_>, exp: &dyn Expected) -> Self

Raised when a Deserialize receives a value of the right type but that is wrong for some other reason. Read more
source§

fn invalid_length(len: usize, exp: &dyn Expected) -> Self

Raised when deserializing a sequence or map and the input data contains too many or too few elements. Read more
source§

fn unknown_variant(variant: &str, expected: &'static [&'static str]) -> Self

Raised when a Deserialize enum type received a variant with an @@ -73,7 +73,7 @@
§Example
unrecognized name.
source§

fn missing_field(field: &'static str) -> Self

Raised when a Deserialize struct type expected to receive a required field with a particular name but that field was not present in the input.
source§

fn duplicate_field(field: &'static str) -> Self

Raised when a Deserialize struct type received more than one of the -same field.
source§

impl Error for Error

source§

fn source(&self) -> Option<&(dyn Error + 'static)>

The lower-level source of this error, if any. Read more
1.0.0 · source§

fn description(&self) -> &str

👎Deprecated since 1.42.0: use the Display impl or to_string()
Read more
1.0.0 · source§

fn cause(&self) -> Option<&dyn Error>

👎Deprecated since 1.33.0: replaced by Error::source, which can support downcasting
source§

fn provide<'a>(&'a self, 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 Error

source§

fn from(j: Error) -> Self

Convert a serde_json::Error into an io::Error.

+same field.
source§

impl From<Error> for Error

source§

fn from(j: Error) -> Self

Convert a serde_json::Error into an io::Error.

JSON syntax and data errors are turned into InvalidData I/O errors. EOF errors are turned into UnexpectedEof I/O errors.

diff --git a/serde_json/map/struct.Map.html b/serde_json/map/struct.Map.html index 4b78adf34a..a92b90befe 100644 --- a/serde_json/map/struct.Map.html +++ b/serde_json/map/struct.Map.html @@ -1,4 +1,4 @@ -Map in serde_json::map - Rust
+Map in serde_json::map - Rust

Struct serde_json::map::Map

source · 
pub struct Map<K, V> { /* private fields */ }
Expand description

Represents a JSON key/value type.

Implementations§

source§

impl Map<String, Value>

source

pub fn new() -> Self

Makes a new empty Map.

source

pub fn with_capacity(capacity: usize) -> Self

Makes a new empty Map with the given initial capacity.

@@ -34,10 +34,10 @@

The key may be any borrowed form of the map’s key type, but the ordering on the borrowed form must match the ordering on the key type.

If serde_json’s “preserve_order” is enabled, .remove(key) is -equivalent to [.swap_remove(key)][Self::swap_remove], replacing this +equivalent to .swap_remove(key), replacing this entry’s position with the last element. If you need to preserve the relative order of the keys in the map, use -[.shift_remove(key)][Self::shift_remove] instead.

+.shift_remove(key) instead.

source

pub fn remove_entry<Q>(&mut self, key: &Q) -> Option<(String, Value)>
where String: Borrow<Q>, Q: ?Sized + Ord + Eq + Hash,

Removes a key from the map, returning the stored key and value if the @@ -45,10 +45,34 @@

The key may be any borrowed form of the map’s key type, but the ordering on the borrowed form must match the ordering on the key type.

If serde_json’s “preserve_order” is enabled, .remove_entry(key) is -equivalent to [.swap_remove_entry(key)][Self::swap_remove_entry], +equivalent to .swap_remove_entry(key), replacing this entry’s position with the last element. If you need to preserve the relative order of the keys in the map, use -[.shift_remove_entry(key)][Self::shift_remove_entry] instead.

+.shift_remove_entry(key) instead.

+
source

pub fn swap_remove<Q>(&mut self, key: &Q) -> Option<Value>
where + String: Borrow<Q>, + Q: ?Sized + Ord + Eq + Hash,

Removes and returns the value corresponding to the key from the map.

+

Like Vec::swap_remove, the entry is removed by swapping it with the +last element of the map and popping it off. This perturbs the position +of what used to be the last element!

+
source

pub fn swap_remove_entry<Q>(&mut self, key: &Q) -> Option<(String, Value)>
where + String: Borrow<Q>, + Q: ?Sized + Ord + Eq + Hash,

Remove and return the key-value pair.

+

Like Vec::swap_remove, the entry is removed by swapping it with the +last element of the map and popping it off. This perturbs the position +of what used to be the last element!

+
source

pub fn shift_remove<Q>(&mut self, key: &Q) -> Option<Value>
where + String: Borrow<Q>, + Q: ?Sized + Ord + Eq + Hash,

Removes and returns the value corresponding to the key from the map.

+

Like Vec::remove, the entry is removed by shifting all of the +elements that follow it, preserving their relative order. This perturbs +the index of all of those elements!

+
source

pub fn shift_remove_entry<Q>(&mut self, key: &Q) -> Option<(String, Value)>
where + String: Borrow<Q>, + Q: ?Sized + Ord + Eq + Hash,

Remove and return the key-value pair.

+

Like Vec::remove, the entry is removed by shifting all of the +elements that follow it, preserving their relative order. This perturbs +the index of all of those elements!

source

pub fn append(&mut self, other: &mut Self)

Moves all elements from other into self, leaving other empty.

source

pub fn entry<S>(&mut self, key: S) -> Entry<'_>
where S: Into<String>,

Gets the given key’s corresponding entry in the map for in-place @@ -91,7 +115,7 @@

§Examples
present in the map.

map["key"] = json!("value");
-
source§

fn index_mut(&mut self, index: &Q) -> &mut Value

Performs the mutable indexing (container[index]) operation. Read more
source§

impl<'a> IntoIterator for &'a Map<String, Value>

§

type Item = (&'a String, &'a Value)

The type of the elements being iterated over.
§

type IntoIter = Iter<'a>

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<'a> IntoIterator for &'a mut Map<String, Value>

§

type Item = (&'a String, &'a mut Value)

The type of the elements being iterated over.
§

type IntoIter = IterMut<'a>

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 IntoIterator for Map<String, Value>

§

type Item = (String, Value)

The type of the elements being iterated over.
§

type IntoIter = IntoIter

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 PartialEq for Map<String, Value>

source§

fn eq(&self, other: &Self) -> bool

This method tests for self and other values to be equal, and is used +
source§

fn index_mut(&mut self, index: &Q) -> &mut Value

Performs the mutable indexing (container[index]) operation. Read more
source§

impl<'a> IntoIterator for &'a Map<String, Value>

§

type Item = (&'a String, &'a Value)

The type of the elements being iterated over.
§

type IntoIter = Iter<'a>

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<'a> IntoIterator for &'a mut Map<String, Value>

§

type Item = (&'a String, &'a mut Value)

The type of the elements being iterated over.
§

type IntoIter = IterMut<'a>

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 IntoIterator for Map<String, Value>

§

type Item = (String, Value)

The type of the elements being iterated over.
§

type IntoIter = IntoIter

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 PartialEq for Map<String, Value>

source§

fn eq(&self, other: &Self) -> 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 Serialize for Map<String, Value>

source§

fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>
where S: Serializer,

Serialize this value into the given Serde serializer. Read more
source§

impl Eq for Map<String, Value>

Auto Trait Implementations§

§

impl<K, V> Freeze for Map<K, V>

§

impl<K, V> RefUnwindSafe for Map<K, V>
where @@ -100,12 +124,18 @@
§Examples
K: Send, V: Send,

§

impl<K, V> Sync for Map<K, V>
where K: Sync, - V: Sync,

§

impl<K, V> Unpin for Map<K, V>

§

impl<K, V> UnwindSafe for Map<K, V>
where - K: RefUnwindSafe, - V: RefUnwindSafe,

Blanket Implementations§

source§

impl<T> Any for T
where + V: Sync,

§

impl<K, V> Unpin for Map<K, V>
where + K: Unpin, + V: Unpin,

§

impl<K, V> UnwindSafe for Map<K, V>
where + K: UnwindSafe, + V: UnwindSafe,

Blanket Implementations§

source§

impl<T> Any for T
where T: 'static + ?Sized,

source§

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more
source§

impl<T> Borrow<T> for T
where T: ?Sized,

source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
source§

impl<T> BorrowMut<T> for T
where - 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.

+ T: ?Sized,
source§

fn borrow_mut(&mut self) -> &mut T

Mutably borrows from an owned value. Read more
source§

impl<Q, K> Equivalent<K> for Q
where + Q: Eq + ?Sized, + K: Borrow<Q> + ?Sized,

source§

fn equivalent(&self, key: &K) -> bool

Checks if this value is equivalent to the given key. Read more
source§

impl<Q, K> Equivalent<K> for Q
where + Q: Eq + ?Sized, + K: Borrow<Q> + ?Sized,

source§

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 T
where U: From<T>,

source§

fn into(self) -> U

Calls U::from(self).

That is, this conversion is whatever the implementation of diff --git a/serde_json/struct.Error.html b/serde_json/struct.Error.html index 138c5f14b2..90c6f78e09 100644 --- a/serde_json/struct.Error.html +++ b/serde_json/struct.Error.html @@ -64,8 +64,8 @@

§Example
} }; }
-

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, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter. Read more
source§

impl Error for Error

source§

fn custom<T: Display>(msg: T) -> Error

Used when a Serialize implementation encounters any error -while serializing a type. Read more
source§

impl Error for Error

source§

fn custom<T: Display>(msg: T) -> Error

Raised when there is general error when deserializing a type. Read more
source§

fn invalid_type(unexp: Unexpected<'_>, exp: &dyn Expected) -> Self

Raised when a Deserialize receives a type different from what it was +

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, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter. Read more
source§

impl Error for Error

source§

fn custom<T: Display>(msg: T) -> Error

Used when a Serialize implementation encounters any error +while serializing a type. Read more
source§

impl Error for Error

source§

fn source(&self) -> Option<&(dyn Error + 'static)>

The lower-level source of this error, if any. Read more
1.0.0 · source§

fn description(&self) -> &str

👎Deprecated since 1.42.0: use the Display impl or to_string()
Read more
1.0.0 · source§

fn cause(&self) -> Option<&dyn Error>

👎Deprecated since 1.33.0: replaced by Error::source, which can support downcasting
source§

fn provide<'a>(&'a self, 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 Error for Error

source§

fn custom<T: Display>(msg: T) -> Error

Raised when there is general error when deserializing a type. Read more
source§

fn invalid_type(unexp: Unexpected<'_>, exp: &dyn Expected) -> Self

Raised when a Deserialize receives a type different from what it was expecting. Read more
source§

fn invalid_value(unexp: Unexpected<'_>, exp: &dyn Expected) -> Self

Raised when a Deserialize receives a value of the right type but that is wrong for some other reason. Read more
source§

fn invalid_length(len: usize, exp: &dyn Expected) -> Self

Raised when deserializing a sequence or map and the input data contains too many or too few elements. Read more
source§

fn unknown_variant(variant: &str, expected: &'static [&'static str]) -> Self

Raised when a Deserialize enum type received a variant with an @@ -73,7 +73,7 @@
§Example
unrecognized name.
source§

fn missing_field(field: &'static str) -> Self

Raised when a Deserialize struct type expected to receive a required field with a particular name but that field was not present in the input.
source§

fn duplicate_field(field: &'static str) -> Self

Raised when a Deserialize struct type received more than one of the -same field.
source§

impl Error for Error

source§

fn source(&self) -> Option<&(dyn Error + 'static)>

The lower-level source of this error, if any. Read more
1.0.0 · source§

fn description(&self) -> &str

👎Deprecated since 1.42.0: use the Display impl or to_string()
Read more
1.0.0 · source§

fn cause(&self) -> Option<&dyn Error>

👎Deprecated since 1.33.0: replaced by Error::source, which can support downcasting
source§

fn provide<'a>(&'a self, 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 Error

source§

fn from(j: Error) -> Self

Convert a serde_json::Error into an io::Error.

+same field.
source§

impl From<Error> for Error

source§

fn from(j: Error) -> Self

Convert a serde_json::Error into an io::Error.

JSON syntax and data errors are turned into InvalidData I/O errors. EOF errors are turned into UnexpectedEof I/O errors.

diff --git a/serde_json/struct.Map.html b/serde_json/struct.Map.html index 5c27e8ef05..5925f88596 100644 --- a/serde_json/struct.Map.html +++ b/serde_json/struct.Map.html @@ -1,4 +1,4 @@ -Map in serde_json - Rust
+Map in serde_json - Rust

Struct serde_json::Map

source · 
pub struct Map<K, V> { /* private fields */ }
Expand description

Represents a JSON key/value type.

Implementations§

source§

impl Map<String, Value>

source

pub fn new() -> Self

Makes a new empty Map.

source

pub fn with_capacity(capacity: usize) -> Self

Makes a new empty Map with the given initial capacity.

@@ -34,10 +34,10 @@

The key may be any borrowed form of the map’s key type, but the ordering on the borrowed form must match the ordering on the key type.

If serde_json’s “preserve_order” is enabled, .remove(key) is -equivalent to [.swap_remove(key)][Self::swap_remove], replacing this +equivalent to .swap_remove(key), replacing this entry’s position with the last element. If you need to preserve the relative order of the keys in the map, use -[.shift_remove(key)][Self::shift_remove] instead.

+.shift_remove(key) instead.

source

pub fn remove_entry<Q>(&mut self, key: &Q) -> Option<(String, Value)>
where String: Borrow<Q>, Q: ?Sized + Ord + Eq + Hash,

Removes a key from the map, returning the stored key and value if the @@ -45,10 +45,34 @@

The key may be any borrowed form of the map’s key type, but the ordering on the borrowed form must match the ordering on the key type.

If serde_json’s “preserve_order” is enabled, .remove_entry(key) is -equivalent to [.swap_remove_entry(key)][Self::swap_remove_entry], +equivalent to .swap_remove_entry(key), replacing this entry’s position with the last element. If you need to preserve the relative order of the keys in the map, use -[.shift_remove_entry(key)][Self::shift_remove_entry] instead.

+.shift_remove_entry(key) instead.

+
source

pub fn swap_remove<Q>(&mut self, key: &Q) -> Option<Value>
where + String: Borrow<Q>, + Q: ?Sized + Ord + Eq + Hash,

Removes and returns the value corresponding to the key from the map.

+

Like Vec::swap_remove, the entry is removed by swapping it with the +last element of the map and popping it off. This perturbs the position +of what used to be the last element!

+
source

pub fn swap_remove_entry<Q>(&mut self, key: &Q) -> Option<(String, Value)>
where + String: Borrow<Q>, + Q: ?Sized + Ord + Eq + Hash,

Remove and return the key-value pair.

+

Like Vec::swap_remove, the entry is removed by swapping it with the +last element of the map and popping it off. This perturbs the position +of what used to be the last element!

+
source

pub fn shift_remove<Q>(&mut self, key: &Q) -> Option<Value>
where + String: Borrow<Q>, + Q: ?Sized + Ord + Eq + Hash,

Removes and returns the value corresponding to the key from the map.

+

Like Vec::remove, the entry is removed by shifting all of the +elements that follow it, preserving their relative order. This perturbs +the index of all of those elements!

+
source

pub fn shift_remove_entry<Q>(&mut self, key: &Q) -> Option<(String, Value)>
where + String: Borrow<Q>, + Q: ?Sized + Ord + Eq + Hash,

Remove and return the key-value pair.

+

Like Vec::remove, the entry is removed by shifting all of the +elements that follow it, preserving their relative order. This perturbs +the index of all of those elements!

source

pub fn append(&mut self, other: &mut Self)

Moves all elements from other into self, leaving other empty.

source

pub fn entry<S>(&mut self, key: S) -> Entry<'_>
where S: Into<String>,

Gets the given key’s corresponding entry in the map for in-place @@ -91,7 +115,7 @@

§Examples
present in the map.

map["key"] = json!("value");
-
source§

fn index_mut(&mut self, index: &Q) -> &mut Value

Performs the mutable indexing (container[index]) operation. Read more
source§

impl<'a> IntoIterator for &'a Map<String, Value>

§

type Item = (&'a String, &'a Value)

The type of the elements being iterated over.
§

type IntoIter = Iter<'a>

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<'a> IntoIterator for &'a mut Map<String, Value>

§

type Item = (&'a String, &'a mut Value)

The type of the elements being iterated over.
§

type IntoIter = IterMut<'a>

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 IntoIterator for Map<String, Value>

§

type Item = (String, Value)

The type of the elements being iterated over.
§

type IntoIter = IntoIter

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 PartialEq for Map<String, Value>

source§

fn eq(&self, other: &Self) -> bool

This method tests for self and other values to be equal, and is used +
source§

fn index_mut(&mut self, index: &Q) -> &mut Value

Performs the mutable indexing (container[index]) operation. Read more
source§

impl<'a> IntoIterator for &'a Map<String, Value>

§

type Item = (&'a String, &'a Value)

The type of the elements being iterated over.
§

type IntoIter = Iter<'a>

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<'a> IntoIterator for &'a mut Map<String, Value>

§

type Item = (&'a String, &'a mut Value)

The type of the elements being iterated over.
§

type IntoIter = IterMut<'a>

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 IntoIterator for Map<String, Value>

§

type Item = (String, Value)

The type of the elements being iterated over.
§

type IntoIter = IntoIter

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 PartialEq for Map<String, Value>

source§

fn eq(&self, other: &Self) -> 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 Serialize for Map<String, Value>

source§

fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>
where S: Serializer,

Serialize this value into the given Serde serializer. Read more
source§

impl Eq for Map<String, Value>

Auto Trait Implementations§

§

impl<K, V> Freeze for Map<K, V>

§

impl<K, V> RefUnwindSafe for Map<K, V>
where @@ -100,12 +124,18 @@
§Examples
K: Send, V: Send,

§

impl<K, V> Sync for Map<K, V>
where K: Sync, - V: Sync,

§

impl<K, V> Unpin for Map<K, V>

§

impl<K, V> UnwindSafe for Map<K, V>
where - K: RefUnwindSafe, - V: RefUnwindSafe,

Blanket Implementations§

source§

impl<T> Any for T
where + V: Sync,

§

impl<K, V> Unpin for Map<K, V>
where + K: Unpin, + V: Unpin,

§

impl<K, V> UnwindSafe for Map<K, V>
where + K: UnwindSafe, + V: UnwindSafe,

Blanket Implementations§

source§

impl<T> Any for T
where T: 'static + ?Sized,

source§

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more
source§

impl<T> Borrow<T> for T
where T: ?Sized,

source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
source§

impl<T> BorrowMut<T> for T
where - 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.

+ T: ?Sized,
source§

fn borrow_mut(&mut self) -> &mut T

Mutably borrows from an owned value. Read more
source§

impl<Q, K> Equivalent<K> for Q
where + Q: Eq + ?Sized, + K: Borrow<Q> + ?Sized,

source§

fn equivalent(&self, key: &K) -> bool

Checks if this value is equivalent to the given key. Read more
source§

impl<Q, K> Equivalent<K> for Q
where + Q: Eq + ?Sized, + K: Borrow<Q> + ?Sized,

source§

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 T
where U: From<T>,

source§

fn into(self) -> U

Calls U::from(self).

That is, this conversion is whatever the implementation of diff --git a/serde_json/struct.Number.html b/serde_json/struct.Number.html index 25d70012f0..0a93609d1f 100644 --- a/serde_json/struct.Number.html +++ b/serde_json/struct.Number.html @@ -1,4 +1,4 @@ -Number in serde_json - Rust

+Number in serde_json - Rust

Struct serde_json::Number

source · 
pub struct Number { /* private fields */ }
Expand description

Represents a JSON number, whether integer or floating point.

Implementations§

source§

impl Number

source

pub fn is_i64(&self) -> bool

Returns true if the Number is an integer between i64::MIN and i64::MAX.

@@ -71,240 +71,240 @@ 
assert!(Number::from_f64(256.0).is_some());
 
 assert!(Number::from_f64(f64::NAN).is_none());
-

Trait Implementations§

source§

impl Clone for Number

source§

fn clone(&self) -> Number

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 Number

source§

fn fmt(&self, formatter: &mut Formatter<'_>) -> Result

Formats the value using the given formatter. Read more
source§

impl<'de> Deserialize<'de> for Number

source§

fn deserialize<D>(deserializer: D) -> Result<Number, D::Error>
where - D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer. Read more
source§

impl<'de, 'a> Deserializer<'de> for &'a Number

§

type Error = Error

The error type that can be returned if some error occurs during -deserialization.
source§

fn deserialize_any<V>(self, visitor: V) -> Result<V::Value, Error>
where +

Trait Implementations§

source§

impl Clone for Number

source§

fn clone(&self) -> Number

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 Number

source§

fn fmt(&self, formatter: &mut Formatter<'_>) -> Result

Formats the value using the given formatter. Read more
source§

impl<'de> Deserialize<'de> for Number

source§

fn deserialize<D>(deserializer: D) -> Result<Number, D::Error>
where + D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer. Read more
source§

impl<'de, 'a> Deserializer<'de> for &'a Number

§

type Error = Error

The error type that can be returned if some error occurs during +deserialization.
source§

fn deserialize_any<V>(self, visitor: V) -> Result<V::Value, Error>
where V: Visitor<'de>,

Require the Deserializer to figure out how to drive the visitor based -on what data type is in the input. Read more
source§

fn deserialize_i8<V>(self, visitor: V) -> Result<V::Value, Error>
where - V: Visitor<'de>,

Hint that the Deserialize type is expecting an i8 value.
source§

fn deserialize_i16<V>(self, visitor: V) -> Result<V::Value, Error>
where - V: Visitor<'de>,

Hint that the Deserialize type is expecting an i16 value.
source§

fn deserialize_i32<V>(self, visitor: V) -> Result<V::Value, Error>
where - V: Visitor<'de>,

Hint that the Deserialize type is expecting an i32 value.
source§

fn deserialize_i64<V>(self, visitor: V) -> Result<V::Value, Error>
where - V: Visitor<'de>,

Hint that the Deserialize type is expecting an i64 value.
source§

fn deserialize_i128<V>(self, visitor: V) -> Result<V::Value, Error>
where - V: Visitor<'de>,

Hint that the Deserialize type is expecting an i128 value. Read more
source§

fn deserialize_u8<V>(self, visitor: V) -> Result<V::Value, Error>
where - V: Visitor<'de>,

Hint that the Deserialize type is expecting a u8 value.
source§

fn deserialize_u16<V>(self, visitor: V) -> Result<V::Value, Error>
where - V: Visitor<'de>,

Hint that the Deserialize type is expecting a u16 value.
source§

fn deserialize_u32<V>(self, visitor: V) -> Result<V::Value, Error>
where - V: Visitor<'de>,

Hint that the Deserialize type is expecting a u32 value.
source§

fn deserialize_u64<V>(self, visitor: V) -> Result<V::Value, Error>
where - V: Visitor<'de>,

Hint that the Deserialize type is expecting a u64 value.
source§

fn deserialize_u128<V>(self, visitor: V) -> Result<V::Value, Error>
where - V: Visitor<'de>,

Hint that the Deserialize type is expecting an u128 value. Read more
source§

fn deserialize_f32<V>(self, visitor: V) -> Result<V::Value, Error>
where - V: Visitor<'de>,

Hint that the Deserialize type is expecting a f32 value.
source§

fn deserialize_f64<V>(self, visitor: V) -> Result<V::Value, Error>
where - V: Visitor<'de>,

Hint that the Deserialize type is expecting a f64 value.
source§

fn deserialize_bool<V>( +on what data type is in the input. Read more

source§

fn deserialize_i8<V>(self, visitor: V) -> Result<V::Value, Error>
where + V: Visitor<'de>,

Hint that the Deserialize type is expecting an i8 value.
source§

fn deserialize_i16<V>(self, visitor: V) -> Result<V::Value, Error>
where + V: Visitor<'de>,

Hint that the Deserialize type is expecting an i16 value.
source§

fn deserialize_i32<V>(self, visitor: V) -> Result<V::Value, Error>
where + V: Visitor<'de>,

Hint that the Deserialize type is expecting an i32 value.
source§

fn deserialize_i64<V>(self, visitor: V) -> Result<V::Value, Error>
where + V: Visitor<'de>,

Hint that the Deserialize type is expecting an i64 value.
source§

fn deserialize_i128<V>(self, visitor: V) -> Result<V::Value, Error>
where + V: Visitor<'de>,

Hint that the Deserialize type is expecting an i128 value. Read more
source§

fn deserialize_u8<V>(self, visitor: V) -> Result<V::Value, Error>
where + V: Visitor<'de>,

Hint that the Deserialize type is expecting a u8 value.
source§

fn deserialize_u16<V>(self, visitor: V) -> Result<V::Value, Error>
where + V: Visitor<'de>,

Hint that the Deserialize type is expecting a u16 value.
source§

fn deserialize_u32<V>(self, visitor: V) -> Result<V::Value, Error>
where + V: Visitor<'de>,

Hint that the Deserialize type is expecting a u32 value.
source§

fn deserialize_u64<V>(self, visitor: V) -> Result<V::Value, Error>
where + V: Visitor<'de>,

Hint that the Deserialize type is expecting a u64 value.
source§

fn deserialize_u128<V>(self, visitor: V) -> Result<V::Value, Error>
where + V: Visitor<'de>,

Hint that the Deserialize type is expecting an u128 value. Read more
source§

fn deserialize_f32<V>(self, visitor: V) -> Result<V::Value, Error>
where + V: Visitor<'de>,

Hint that the Deserialize type is expecting a f32 value.
source§

fn deserialize_f64<V>(self, visitor: V) -> Result<V::Value, Error>
where + V: Visitor<'de>,

Hint that the Deserialize type is expecting a f64 value.
source§

fn deserialize_bool<V>( self, visitor: V ) -> Result<V::Value, <Self as Deserializer<'de>>::Error>
where - V: Visitor<'de>,

Hint that the Deserialize type is expecting a bool value.
source§

fn deserialize_char<V>( + V: Visitor<'de>,

Hint that the Deserialize type is expecting a bool value.
source§

fn deserialize_char<V>( self, visitor: V ) -> Result<V::Value, <Self as Deserializer<'de>>::Error>
where - V: Visitor<'de>,

Hint that the Deserialize type is expecting a char value.
source§

fn deserialize_str<V>( + V: Visitor<'de>,

Hint that the Deserialize type is expecting a char value.
source§

fn deserialize_str<V>( self, visitor: V ) -> Result<V::Value, <Self as Deserializer<'de>>::Error>
where V: Visitor<'de>,

Hint that the Deserialize type is expecting a string value and does not benefit from taking ownership of buffered data owned by the -Deserializer. Read more
source§

fn deserialize_string<V>( +Deserializer. Read more

source§

fn deserialize_string<V>( self, visitor: V ) -> Result<V::Value, <Self as Deserializer<'de>>::Error>
where V: Visitor<'de>,

Hint that the Deserialize type is expecting a string value and would benefit from taking ownership of buffered data owned by the -Deserializer. Read more
source§

fn deserialize_bytes<V>( +Deserializer. Read more

source§

fn deserialize_bytes<V>( self, visitor: V ) -> Result<V::Value, <Self as Deserializer<'de>>::Error>
where V: Visitor<'de>,

Hint that the Deserialize type is expecting a byte array and does not benefit from taking ownership of buffered data owned by the -Deserializer. Read more
source§

fn deserialize_byte_buf<V>( +Deserializer. Read more

source§

fn deserialize_byte_buf<V>( self, visitor: V ) -> Result<V::Value, <Self as Deserializer<'de>>::Error>
where V: Visitor<'de>,

Hint that the Deserialize type is expecting a byte array and would benefit from taking ownership of buffered data owned by the -Deserializer. Read more
source§

fn deserialize_option<V>( +Deserializer. Read more

source§

fn deserialize_option<V>( self, visitor: V ) -> Result<V::Value, <Self as Deserializer<'de>>::Error>
where - V: Visitor<'de>,

Hint that the Deserialize type is expecting an optional value. Read more
source§

fn deserialize_unit<V>( + V: Visitor<'de>,

Hint that the Deserialize type is expecting an optional value. Read more
source§

fn deserialize_unit<V>( self, visitor: V ) -> Result<V::Value, <Self as Deserializer<'de>>::Error>
where - V: Visitor<'de>,

Hint that the Deserialize type is expecting a unit value.
source§

fn deserialize_unit_struct<V>( + V: Visitor<'de>,

Hint that the Deserialize type is expecting a unit value.
source§

fn deserialize_unit_struct<V>( self, name: &'static str, visitor: V ) -> Result<V::Value, <Self as Deserializer<'de>>::Error>
where V: Visitor<'de>,

Hint that the Deserialize type is expecting a unit struct with a -particular name.
source§

fn deserialize_newtype_struct<V>( +particular name.

source§

fn deserialize_newtype_struct<V>( self, name: &'static str, visitor: V ) -> Result<V::Value, <Self as Deserializer<'de>>::Error>
where V: Visitor<'de>,

Hint that the Deserialize type is expecting a newtype struct with a -particular name.
source§

fn deserialize_seq<V>( +particular name.

source§

fn deserialize_seq<V>( self, visitor: V ) -> Result<V::Value, <Self as Deserializer<'de>>::Error>
where - V: Visitor<'de>,

Hint that the Deserialize type is expecting a sequence of values.
source§

fn deserialize_tuple<V>( + V: Visitor<'de>,

Hint that the Deserialize type is expecting a sequence of values.
source§

fn deserialize_tuple<V>( self, len: usize, visitor: V ) -> Result<V::Value, <Self as Deserializer<'de>>::Error>
where V: Visitor<'de>,

Hint that the Deserialize type is expecting a sequence of values and -knows how many values there are without looking at the serialized data.
source§

fn deserialize_tuple_struct<V>( +knows how many values there are without looking at the serialized data.

source§

fn deserialize_tuple_struct<V>( self, name: &'static str, len: usize, visitor: V ) -> Result<V::Value, <Self as Deserializer<'de>>::Error>
where V: Visitor<'de>,

Hint that the Deserialize type is expecting a tuple struct with a -particular name and number of fields.
source§

fn deserialize_map<V>( +particular name and number of fields.

source§

fn deserialize_map<V>( self, visitor: V ) -> Result<V::Value, <Self as Deserializer<'de>>::Error>
where - V: Visitor<'de>,

Hint that the Deserialize type is expecting a map of key-value pairs.
source§

fn deserialize_struct<V>( + V: Visitor<'de>,

Hint that the Deserialize type is expecting a map of key-value pairs.
source§

fn deserialize_struct<V>( self, name: &'static str, fields: &'static [&'static str], visitor: V ) -> Result<V::Value, <Self as Deserializer<'de>>::Error>
where V: Visitor<'de>,

Hint that the Deserialize type is expecting a struct with a particular -name and fields.
source§

fn deserialize_enum<V>( +name and fields.

source§

fn deserialize_enum<V>( self, name: &'static str, variants: &'static [&'static str], visitor: V ) -> Result<V::Value, <Self as Deserializer<'de>>::Error>
where V: Visitor<'de>,

Hint that the Deserialize type is expecting an enum value with a -particular name and possible variants.
source§

fn deserialize_identifier<V>( +particular name and possible variants.

source§

fn deserialize_identifier<V>( self, visitor: V ) -> Result<V::Value, <Self as Deserializer<'de>>::Error>
where V: Visitor<'de>,

Hint that the Deserialize type is expecting the name of a struct -field or the discriminant of an enum variant.
source§

fn deserialize_ignored_any<V>( +field or the discriminant of an enum variant.

source§

fn deserialize_ignored_any<V>( self, visitor: V ) -> Result<V::Value, <Self as Deserializer<'de>>::Error>
where V: Visitor<'de>,

Hint that the Deserialize type needs to deserialize a value whose type -doesn’t matter because it is ignored. Read more
source§

fn is_human_readable(&self) -> bool

Determine whether Deserialize implementations should expect to -deserialize their human-readable form. Read more
source§

impl<'de> Deserializer<'de> for Number

§

type Error = Error

The error type that can be returned if some error occurs during -deserialization.
source§

fn deserialize_any<V>(self, visitor: V) -> Result<V::Value, Error>
where +doesn’t matter because it is ignored. Read more

source§

fn is_human_readable(&self) -> bool

Determine whether Deserialize implementations should expect to +deserialize their human-readable form. Read more
source§

impl<'de> Deserializer<'de> for Number

§

type Error = Error

The error type that can be returned if some error occurs during +deserialization.
source§

fn deserialize_any<V>(self, visitor: V) -> Result<V::Value, Error>
where V: Visitor<'de>,

Require the Deserializer to figure out how to drive the visitor based -on what data type is in the input. Read more
source§

fn deserialize_i8<V>(self, visitor: V) -> Result<V::Value, Error>
where - V: Visitor<'de>,

Hint that the Deserialize type is expecting an i8 value.
source§

fn deserialize_i16<V>(self, visitor: V) -> Result<V::Value, Error>
where - V: Visitor<'de>,

Hint that the Deserialize type is expecting an i16 value.
source§

fn deserialize_i32<V>(self, visitor: V) -> Result<V::Value, Error>
where - V: Visitor<'de>,

Hint that the Deserialize type is expecting an i32 value.
source§

fn deserialize_i64<V>(self, visitor: V) -> Result<V::Value, Error>
where - V: Visitor<'de>,

Hint that the Deserialize type is expecting an i64 value.
source§

fn deserialize_i128<V>(self, visitor: V) -> Result<V::Value, Error>
where - V: Visitor<'de>,

Hint that the Deserialize type is expecting an i128 value. Read more
source§

fn deserialize_u8<V>(self, visitor: V) -> Result<V::Value, Error>
where - V: Visitor<'de>,

Hint that the Deserialize type is expecting a u8 value.
source§

fn deserialize_u16<V>(self, visitor: V) -> Result<V::Value, Error>
where - V: Visitor<'de>,

Hint that the Deserialize type is expecting a u16 value.
source§

fn deserialize_u32<V>(self, visitor: V) -> Result<V::Value, Error>
where - V: Visitor<'de>,

Hint that the Deserialize type is expecting a u32 value.
source§

fn deserialize_u64<V>(self, visitor: V) -> Result<V::Value, Error>
where - V: Visitor<'de>,

Hint that the Deserialize type is expecting a u64 value.
source§

fn deserialize_u128<V>(self, visitor: V) -> Result<V::Value, Error>
where - V: Visitor<'de>,

Hint that the Deserialize type is expecting an u128 value. Read more
source§

fn deserialize_f32<V>(self, visitor: V) -> Result<V::Value, Error>
where - V: Visitor<'de>,

Hint that the Deserialize type is expecting a f32 value.
source§

fn deserialize_f64<V>(self, visitor: V) -> Result<V::Value, Error>
where - V: Visitor<'de>,

Hint that the Deserialize type is expecting a f64 value.
source§

fn deserialize_bool<V>( +on what data type is in the input. Read more

source§

fn deserialize_i8<V>(self, visitor: V) -> Result<V::Value, Error>
where + V: Visitor<'de>,

Hint that the Deserialize type is expecting an i8 value.
source§

fn deserialize_i16<V>(self, visitor: V) -> Result<V::Value, Error>
where + V: Visitor<'de>,

Hint that the Deserialize type is expecting an i16 value.
source§

fn deserialize_i32<V>(self, visitor: V) -> Result<V::Value, Error>
where + V: Visitor<'de>,

Hint that the Deserialize type is expecting an i32 value.
source§

fn deserialize_i64<V>(self, visitor: V) -> Result<V::Value, Error>
where + V: Visitor<'de>,

Hint that the Deserialize type is expecting an i64 value.
source§

fn deserialize_i128<V>(self, visitor: V) -> Result<V::Value, Error>
where + V: Visitor<'de>,

Hint that the Deserialize type is expecting an i128 value. Read more
source§

fn deserialize_u8<V>(self, visitor: V) -> Result<V::Value, Error>
where + V: Visitor<'de>,

Hint that the Deserialize type is expecting a u8 value.
source§

fn deserialize_u16<V>(self, visitor: V) -> Result<V::Value, Error>
where + V: Visitor<'de>,

Hint that the Deserialize type is expecting a u16 value.
source§

fn deserialize_u32<V>(self, visitor: V) -> Result<V::Value, Error>
where + V: Visitor<'de>,

Hint that the Deserialize type is expecting a u32 value.
source§

fn deserialize_u64<V>(self, visitor: V) -> Result<V::Value, Error>
where + V: Visitor<'de>,

Hint that the Deserialize type is expecting a u64 value.
source§

fn deserialize_u128<V>(self, visitor: V) -> Result<V::Value, Error>
where + V: Visitor<'de>,

Hint that the Deserialize type is expecting an u128 value. Read more
source§

fn deserialize_f32<V>(self, visitor: V) -> Result<V::Value, Error>
where + V: Visitor<'de>,

Hint that the Deserialize type is expecting a f32 value.
source§

fn deserialize_f64<V>(self, visitor: V) -> Result<V::Value, Error>
where + V: Visitor<'de>,

Hint that the Deserialize type is expecting a f64 value.
source§

fn deserialize_bool<V>( self, visitor: V ) -> Result<V::Value, <Self as Deserializer<'de>>::Error>
where - V: Visitor<'de>,

Hint that the Deserialize type is expecting a bool value.
source§

fn deserialize_char<V>( + V: Visitor<'de>,

Hint that the Deserialize type is expecting a bool value.
source§

fn deserialize_char<V>( self, visitor: V ) -> Result<V::Value, <Self as Deserializer<'de>>::Error>
where - V: Visitor<'de>,

Hint that the Deserialize type is expecting a char value.
source§

fn deserialize_str<V>( + V: Visitor<'de>,

Hint that the Deserialize type is expecting a char value.
source§

fn deserialize_str<V>( self, visitor: V ) -> Result<V::Value, <Self as Deserializer<'de>>::Error>
where V: Visitor<'de>,

Hint that the Deserialize type is expecting a string value and does not benefit from taking ownership of buffered data owned by the -Deserializer. Read more
source§

fn deserialize_string<V>( +Deserializer. Read more

source§

fn deserialize_string<V>( self, visitor: V ) -> Result<V::Value, <Self as Deserializer<'de>>::Error>
where V: Visitor<'de>,

Hint that the Deserialize type is expecting a string value and would benefit from taking ownership of buffered data owned by the -Deserializer. Read more
source§

fn deserialize_bytes<V>( +Deserializer. Read more

source§

fn deserialize_bytes<V>( self, visitor: V ) -> Result<V::Value, <Self as Deserializer<'de>>::Error>
where V: Visitor<'de>,

Hint that the Deserialize type is expecting a byte array and does not benefit from taking ownership of buffered data owned by the -Deserializer. Read more
source§

fn deserialize_byte_buf<V>( +Deserializer. Read more

source§

fn deserialize_byte_buf<V>( self, visitor: V ) -> Result<V::Value, <Self as Deserializer<'de>>::Error>
where V: Visitor<'de>,

Hint that the Deserialize type is expecting a byte array and would benefit from taking ownership of buffered data owned by the -Deserializer. Read more
source§

fn deserialize_option<V>( +Deserializer. Read more

source§

fn deserialize_option<V>( self, visitor: V ) -> Result<V::Value, <Self as Deserializer<'de>>::Error>
where - V: Visitor<'de>,

Hint that the Deserialize type is expecting an optional value. Read more
source§

fn deserialize_unit<V>( + V: Visitor<'de>,

Hint that the Deserialize type is expecting an optional value. Read more
source§

fn deserialize_unit<V>( self, visitor: V ) -> Result<V::Value, <Self as Deserializer<'de>>::Error>
where - V: Visitor<'de>,

Hint that the Deserialize type is expecting a unit value.
source§

fn deserialize_unit_struct<V>( + V: Visitor<'de>,

Hint that the Deserialize type is expecting a unit value.
source§

fn deserialize_unit_struct<V>( self, name: &'static str, visitor: V ) -> Result<V::Value, <Self as Deserializer<'de>>::Error>
where V: Visitor<'de>,

Hint that the Deserialize type is expecting a unit struct with a -particular name.
source§

fn deserialize_newtype_struct<V>( +particular name.

source§

fn deserialize_newtype_struct<V>( self, name: &'static str, visitor: V ) -> Result<V::Value, <Self as Deserializer<'de>>::Error>
where V: Visitor<'de>,

Hint that the Deserialize type is expecting a newtype struct with a -particular name.
source§

fn deserialize_seq<V>( +particular name.

source§

fn deserialize_seq<V>( self, visitor: V ) -> Result<V::Value, <Self as Deserializer<'de>>::Error>
where - V: Visitor<'de>,

Hint that the Deserialize type is expecting a sequence of values.
source§

fn deserialize_tuple<V>( + V: Visitor<'de>,

Hint that the Deserialize type is expecting a sequence of values.
source§

fn deserialize_tuple<V>( self, len: usize, visitor: V ) -> Result<V::Value, <Self as Deserializer<'de>>::Error>
where V: Visitor<'de>,

Hint that the Deserialize type is expecting a sequence of values and -knows how many values there are without looking at the serialized data.
source§

fn deserialize_tuple_struct<V>( +knows how many values there are without looking at the serialized data.

source§

fn deserialize_tuple_struct<V>( self, name: &'static str, len: usize, visitor: V ) -> Result<V::Value, <Self as Deserializer<'de>>::Error>
where V: Visitor<'de>,

Hint that the Deserialize type is expecting a tuple struct with a -particular name and number of fields.
source§

fn deserialize_map<V>( +particular name and number of fields.

source§

fn deserialize_map<V>( self, visitor: V ) -> Result<V::Value, <Self as Deserializer<'de>>::Error>
where - V: Visitor<'de>,

Hint that the Deserialize type is expecting a map of key-value pairs.
source§

fn deserialize_struct<V>( + V: Visitor<'de>,

Hint that the Deserialize type is expecting a map of key-value pairs.
source§

fn deserialize_struct<V>( self, name: &'static str, fields: &'static [&'static str], visitor: V ) -> Result<V::Value, <Self as Deserializer<'de>>::Error>
where V: Visitor<'de>,

Hint that the Deserialize type is expecting a struct with a particular -name and fields.
source§

fn deserialize_enum<V>( +name and fields.

source§

fn deserialize_enum<V>( self, name: &'static str, variants: &'static [&'static str], visitor: V ) -> Result<V::Value, <Self as Deserializer<'de>>::Error>
where V: Visitor<'de>,

Hint that the Deserialize type is expecting an enum value with a -particular name and possible variants.
source§

fn deserialize_identifier<V>( +particular name and possible variants.

source§

fn deserialize_identifier<V>( self, visitor: V ) -> Result<V::Value, <Self as Deserializer<'de>>::Error>
where V: Visitor<'de>,

Hint that the Deserialize type is expecting the name of a struct -field or the discriminant of an enum variant.
source§

fn deserialize_ignored_any<V>( +field or the discriminant of an enum variant.

source§

fn deserialize_ignored_any<V>( self, visitor: V ) -> Result<V::Value, <Self as Deserializer<'de>>::Error>
where V: Visitor<'de>,

Hint that the Deserialize type needs to deserialize a value whose type -doesn’t matter because it is ignored. Read more
source§

fn is_human_readable(&self) -> bool

Determine whether Deserialize implementations should expect to -deserialize their human-readable form. Read more
source§

impl Display for Number

source§

fn fmt(&self, formatter: &mut Formatter<'_>) -> Result

Formats the value using the given formatter. Read more
source§

impl From<Number> for Value

source§

fn from(f: Number) -> Self

Convert Number to Value::Number.

+doesn’t matter because it is ignored. Read more
source§

fn is_human_readable(&self) -> bool

Determine whether Deserialize implementations should expect to +deserialize their human-readable form. Read more
source§

impl Display for Number

source§

fn fmt(&self, formatter: &mut Formatter<'_>) -> Result

Formats the value using the given formatter. Read more
source§

impl From<Number> for Value

source§

fn from(f: Number) -> Self

Convert Number to Value::Number.

§Examples
use serde_json::{Number, Value};
 
 let n = Number::from(7);
 let x: Value = n.into();
-
source§

impl From<i16> for Number

source§

fn from(i: i16) -> Self

Converts to this type from the input type.
source§

impl From<i32> for Number

source§

fn from(i: i32) -> Self

Converts to this type from the input type.
source§

impl From<i64> for Number

source§

fn from(i: i64) -> Self

Converts to this type from the input type.
source§

impl From<i8> for Number

source§

fn from(i: i8) -> Self

Converts to this type from the input type.
source§

impl From<isize> for Number

source§

fn from(i: isize) -> Self

Converts to this type from the input type.
source§

impl From<u16> for Number

source§

fn from(u: u16) -> Self

Converts to this type from the input type.
source§

impl From<u32> for Number

source§

fn from(u: u32) -> Self

Converts to this type from the input type.
source§

impl From<u64> for Number

source§

fn from(u: u64) -> Self

Converts to this type from the input type.
source§

impl From<u8> for Number

source§

fn from(u: u8) -> Self

Converts to this type from the input type.
source§

impl From<usize> for Number

source§

fn from(u: usize) -> Self

Converts to this type from the input type.
source§

impl FromStr for Number

§

type Err = Error

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 Number

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 +

source§

impl From<i16> for Number

source§

fn from(i: i16) -> Self

Converts to this type from the input type.
source§

impl From<i32> for Number

source§

fn from(i: i32) -> Self

Converts to this type from the input type.
source§

impl From<i64> for Number

source§

fn from(i: i64) -> Self

Converts to this type from the input type.
source§

impl From<i8> for Number

source§

fn from(i: i8) -> Self

Converts to this type from the input type.
source§

impl From<isize> for Number

source§

fn from(i: isize) -> Self

Converts to this type from the input type.
source§

impl From<u16> for Number

source§

fn from(u: u16) -> Self

Converts to this type from the input type.
source§

impl From<u32> for Number

source§

fn from(u: u32) -> Self

Converts to this type from the input type.
source§

impl From<u64> for Number

source§

fn from(u: u64) -> Self

Converts to this type from the input type.
source§

impl From<u8> for Number

source§

fn from(u: u8) -> Self

Converts to this type from the input type.
source§

impl From<usize> for Number

source§

fn from(u: usize) -> Self

Converts to this type from the input type.
source§

impl FromStr for Number

§

type Err = Error

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 Number

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 PartialEq for Number

source§

fn eq(&self, other: &Number) -> 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 @@ -312,7 +312,11 @@
§Examples
S: Serializer,
Serialize this value into the given Serde serializer. Read more
source§

impl Eq for Number

source§

impl StructuralPartialEq for Number

Auto Trait Implementations§

§

impl Freeze for Number

§

impl RefUnwindSafe for Number

§

impl Send for Number

§

impl Sync for Number

§

impl Unpin for Number

§

impl UnwindSafe for Number

Blanket Implementations§

source§

impl<T> Any for T
where T: 'static + ?Sized,

source§

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more
source§

impl<T> Borrow<T> for T
where T: ?Sized,

source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
source§

impl<T> BorrowMut<T> for T
where - 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.

+ T: ?Sized,
source§

fn borrow_mut(&mut self) -> &mut T

Mutably borrows from an owned value. Read more
source§

impl<Q, K> Equivalent<K> for Q
where + Q: Eq + ?Sized, + K: Borrow<Q> + ?Sized,

source§

fn equivalent(&self, key: &K) -> bool

Checks if this value is equivalent to the given key. Read more
source§

impl<Q, K> Equivalent<K> for Q
where + Q: Eq + ?Sized, + K: Borrow<Q> + ?Sized,

source§

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 T
where U: From<T>,

source§

fn into(self) -> U

Calls U::from(self).

That is, this conversion is whatever the implementation of diff --git a/serde_json/value/enum.Value.html b/serde_json/value/enum.Value.html index c696fabae9..f0be23816f 100644 --- a/serde_json/value/enum.Value.html +++ b/serde_json/value/enum.Value.html @@ -1,4 +1,4 @@ -Value in serde_json::value - Rust

+Value in serde_json::value - Rust

Enum serde_json::value::Value

source · 
pub enum Value {
     Null,
     Bool(bool),
@@ -334,7 +334,7 @@ 
§Examp
 assert_eq!(v, json!({ "x": null }));

Trait Implementations§

source§

impl Clone for Value

source§

fn clone(&self) -> Value

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 Value

source§

fn fmt(&self, formatter: &mut Formatter<'_>) -> Result

Formats the value using the given formatter. Read more
source§

impl Default for Value

The default value is Value::Null.

This is useful for handling omitted Value fields when deserializing.

-

§Examples

+

§Examples

use serde_json::Value;
 
 #[derive(Deserialize)]
@@ -350,160 +350,160 @@ 
§Examples

 assert_eq!(s.level, 42);
 assert_eq!(s.extras, Value::Null);
source§

fn default() -> Value

Returns the “default value” for a type. Read more
source§

impl<'de> Deserialize<'de> for Value

source§

fn deserialize<D>(deserializer: D) -> Result<Value, D::Error>
where - D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer. Read more
source§

impl<'de> Deserializer<'de> for &'de Value

§

type Error = Error

The error type that can be returned if some error occurs during -deserialization.
source§

fn deserialize_any<V>(self, visitor: V) -> Result<V::Value, Error>
where + D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer. Read more
source§

impl<'de> Deserializer<'de> for &'de Value

§

type Error = Error

The error type that can be returned if some error occurs during +deserialization.
source§

fn deserialize_any<V>(self, visitor: V) -> Result<V::Value, Error>
where V: Visitor<'de>,

Require the Deserializer to figure out how to drive the visitor based -on what data type is in the input. Read more
source§

fn deserialize_i8<V>(self, visitor: V) -> Result<V::Value, Error>
where - V: Visitor<'de>,

Hint that the Deserialize type is expecting an i8 value.
source§

fn deserialize_i16<V>(self, visitor: V) -> Result<V::Value, Error>
where - V: Visitor<'de>,

Hint that the Deserialize type is expecting an i16 value.
source§

fn deserialize_i32<V>(self, visitor: V) -> Result<V::Value, Error>
where - V: Visitor<'de>,

Hint that the Deserialize type is expecting an i32 value.
source§

fn deserialize_i64<V>(self, visitor: V) -> Result<V::Value, Error>
where - V: Visitor<'de>,

Hint that the Deserialize type is expecting an i64 value.
source§

fn deserialize_i128<V>(self, visitor: V) -> Result<V::Value, Error>
where - V: Visitor<'de>,

Hint that the Deserialize type is expecting an i128 value. Read more
source§

fn deserialize_u8<V>(self, visitor: V) -> Result<V::Value, Error>
where - V: Visitor<'de>,

Hint that the Deserialize type is expecting a u8 value.
source§

fn deserialize_u16<V>(self, visitor: V) -> Result<V::Value, Error>
where - V: Visitor<'de>,

Hint that the Deserialize type is expecting a u16 value.
source§

fn deserialize_u32<V>(self, visitor: V) -> Result<V::Value, Error>
where - V: Visitor<'de>,

Hint that the Deserialize type is expecting a u32 value.
source§

fn deserialize_u64<V>(self, visitor: V) -> Result<V::Value, Error>
where - V: Visitor<'de>,

Hint that the Deserialize type is expecting a u64 value.
source§

fn deserialize_u128<V>(self, visitor: V) -> Result<V::Value, Error>
where - V: Visitor<'de>,

Hint that the Deserialize type is expecting an u128 value. Read more
source§

fn deserialize_f32<V>(self, visitor: V) -> Result<V::Value, Error>
where - V: Visitor<'de>,

Hint that the Deserialize type is expecting a f32 value.
source§

fn deserialize_f64<V>(self, visitor: V) -> Result<V::Value, Error>
where - V: Visitor<'de>,

Hint that the Deserialize type is expecting a f64 value.
source§

fn deserialize_option<V>(self, visitor: V) -> Result<V::Value, Error>
where - V: Visitor<'de>,

Hint that the Deserialize type is expecting an optional value. Read more
source§

fn deserialize_enum<V>( +on what data type is in the input. Read more

source§

fn deserialize_i8<V>(self, visitor: V) -> Result<V::Value, Error>
where + V: Visitor<'de>,

Hint that the Deserialize type is expecting an i8 value.
source§

fn deserialize_i16<V>(self, visitor: V) -> Result<V::Value, Error>
where + V: Visitor<'de>,

Hint that the Deserialize type is expecting an i16 value.
source§

fn deserialize_i32<V>(self, visitor: V) -> Result<V::Value, Error>
where + V: Visitor<'de>,

Hint that the Deserialize type is expecting an i32 value.
source§

fn deserialize_i64<V>(self, visitor: V) -> Result<V::Value, Error>
where + V: Visitor<'de>,

Hint that the Deserialize type is expecting an i64 value.
source§

fn deserialize_i128<V>(self, visitor: V) -> Result<V::Value, Error>
where + V: Visitor<'de>,

Hint that the Deserialize type is expecting an i128 value. Read more
source§

fn deserialize_u8<V>(self, visitor: V) -> Result<V::Value, Error>
where + V: Visitor<'de>,

Hint that the Deserialize type is expecting a u8 value.
source§

fn deserialize_u16<V>(self, visitor: V) -> Result<V::Value, Error>
where + V: Visitor<'de>,

Hint that the Deserialize type is expecting a u16 value.
source§

fn deserialize_u32<V>(self, visitor: V) -> Result<V::Value, Error>
where + V: Visitor<'de>,

Hint that the Deserialize type is expecting a u32 value.
source§

fn deserialize_u64<V>(self, visitor: V) -> Result<V::Value, Error>
where + V: Visitor<'de>,

Hint that the Deserialize type is expecting a u64 value.
source§

fn deserialize_u128<V>(self, visitor: V) -> Result<V::Value, Error>
where + V: Visitor<'de>,

Hint that the Deserialize type is expecting an u128 value. Read more
source§

fn deserialize_f32<V>(self, visitor: V) -> Result<V::Value, Error>
where + V: Visitor<'de>,

Hint that the Deserialize type is expecting a f32 value.
source§

fn deserialize_f64<V>(self, visitor: V) -> Result<V::Value, Error>
where + V: Visitor<'de>,

Hint that the Deserialize type is expecting a f64 value.
source§

fn deserialize_option<V>(self, visitor: V) -> Result<V::Value, Error>
where + V: Visitor<'de>,

Hint that the Deserialize type is expecting an optional value. Read more
source§

fn deserialize_enum<V>( self, _name: &str, _variants: &'static [&'static str], visitor: V ) -> Result<V::Value, Error>
where V: Visitor<'de>,

Hint that the Deserialize type is expecting an enum value with a -particular name and possible variants.
source§

fn deserialize_newtype_struct<V>( +particular name and possible variants.

source§

fn deserialize_newtype_struct<V>( self, name: &'static str, visitor: V ) -> Result<V::Value, Error>
where V: Visitor<'de>,

Hint that the Deserialize type is expecting a newtype struct with a -particular name.
source§

fn deserialize_bool<V>(self, visitor: V) -> Result<V::Value, Error>
where - V: Visitor<'de>,

Hint that the Deserialize type is expecting a bool value.
source§

fn deserialize_char<V>(self, visitor: V) -> Result<V::Value, Error>
where - V: Visitor<'de>,

Hint that the Deserialize type is expecting a char value.
source§

fn deserialize_str<V>(self, visitor: V) -> Result<V::Value, Error>
where +particular name.

source§

fn deserialize_bool<V>(self, visitor: V) -> Result<V::Value, Error>
where + V: Visitor<'de>,

Hint that the Deserialize type is expecting a bool value.
source§

fn deserialize_char<V>(self, visitor: V) -> Result<V::Value, Error>
where + V: Visitor<'de>,

Hint that the Deserialize type is expecting a char value.
source§

fn deserialize_str<V>(self, visitor: V) -> Result<V::Value, Error>
where V: Visitor<'de>,

Hint that the Deserialize type is expecting a string value and does not benefit from taking ownership of buffered data owned by the -Deserializer. Read more
source§

fn deserialize_string<V>(self, visitor: V) -> Result<V::Value, Error>
where +Deserializer. Read more

source§

fn deserialize_string<V>(self, visitor: V) -> Result<V::Value, Error>
where V: Visitor<'de>,

Hint that the Deserialize type is expecting a string value and would benefit from taking ownership of buffered data owned by the -Deserializer. Read more
source§

fn deserialize_bytes<V>(self, visitor: V) -> Result<V::Value, Error>
where +Deserializer. Read more

source§

fn deserialize_bytes<V>(self, visitor: V) -> Result<V::Value, Error>
where V: Visitor<'de>,

Hint that the Deserialize type is expecting a byte array and does not benefit from taking ownership of buffered data owned by the -Deserializer. Read more
source§

fn deserialize_byte_buf<V>(self, visitor: V) -> Result<V::Value, Error>
where +Deserializer. Read more

source§

fn deserialize_byte_buf<V>(self, visitor: V) -> Result<V::Value, Error>
where V: Visitor<'de>,

Hint that the Deserialize type is expecting a byte array and would benefit from taking ownership of buffered data owned by the -Deserializer. Read more
source§

fn deserialize_unit<V>(self, visitor: V) -> Result<V::Value, Error>
where - V: Visitor<'de>,

Hint that the Deserialize type is expecting a unit value.
source§

fn deserialize_unit_struct<V>( +Deserializer. Read more

source§

fn deserialize_unit<V>(self, visitor: V) -> Result<V::Value, Error>
where + V: Visitor<'de>,

Hint that the Deserialize type is expecting a unit value.
source§

fn deserialize_unit_struct<V>( self, _name: &'static str, visitor: V ) -> Result<V::Value, Error>
where V: Visitor<'de>,

Hint that the Deserialize type is expecting a unit struct with a -particular name.
source§

fn deserialize_seq<V>(self, visitor: V) -> Result<V::Value, Error>
where - V: Visitor<'de>,

Hint that the Deserialize type is expecting a sequence of values.
source§

fn deserialize_tuple<V>( +particular name.

source§

fn deserialize_seq<V>(self, visitor: V) -> Result<V::Value, Error>
where + V: Visitor<'de>,

Hint that the Deserialize type is expecting a sequence of values.
source§

fn deserialize_tuple<V>( self, _len: usize, visitor: V ) -> Result<V::Value, Error>
where V: Visitor<'de>,

Hint that the Deserialize type is expecting a sequence of values and -knows how many values there are without looking at the serialized data.
source§

fn deserialize_tuple_struct<V>( +knows how many values there are without looking at the serialized data.

source§

fn deserialize_tuple_struct<V>( self, _name: &'static str, _len: usize, visitor: V ) -> Result<V::Value, Error>
where V: Visitor<'de>,

Hint that the Deserialize type is expecting a tuple struct with a -particular name and number of fields.
source§

fn deserialize_map<V>(self, visitor: V) -> Result<V::Value, Error>
where - V: Visitor<'de>,

Hint that the Deserialize type is expecting a map of key-value pairs.
source§

fn deserialize_struct<V>( +particular name and number of fields.

source§

fn deserialize_map<V>(self, visitor: V) -> Result<V::Value, Error>
where + V: Visitor<'de>,

Hint that the Deserialize type is expecting a map of key-value pairs.
source§

fn deserialize_struct<V>( self, _name: &'static str, _fields: &'static [&'static str], visitor: V ) -> Result<V::Value, Error>
where V: Visitor<'de>,

Hint that the Deserialize type is expecting a struct with a particular -name and fields.
source§

fn deserialize_identifier<V>(self, visitor: V) -> Result<V::Value, Error>
where +name and fields.

source§

fn deserialize_identifier<V>(self, visitor: V) -> Result<V::Value, Error>
where V: Visitor<'de>,

Hint that the Deserialize type is expecting the name of a struct -field or the discriminant of an enum variant.
source§

fn deserialize_ignored_any<V>(self, visitor: V) -> Result<V::Value, Error>
where +field or the discriminant of an enum variant.

source§

fn deserialize_ignored_any<V>(self, visitor: V) -> Result<V::Value, Error>
where V: Visitor<'de>,

Hint that the Deserialize type needs to deserialize a value whose type -doesn’t matter because it is ignored. Read more
source§

fn is_human_readable(&self) -> bool

Determine whether Deserialize implementations should expect to -deserialize their human-readable form. Read more
source§

impl<'de> Deserializer<'de> for Value

§

type Error = Error

The error type that can be returned if some error occurs during -deserialization.
source§

fn deserialize_any<V>(self, visitor: V) -> Result<V::Value, Error>
where +doesn’t matter because it is ignored. Read more

source§

fn is_human_readable(&self) -> bool

Determine whether Deserialize implementations should expect to +deserialize their human-readable form. Read more
source§

impl<'de> Deserializer<'de> for Value

§

type Error = Error

The error type that can be returned if some error occurs during +deserialization.
source§

fn deserialize_any<V>(self, visitor: V) -> Result<V::Value, Error>
where V: Visitor<'de>,

Require the Deserializer to figure out how to drive the visitor based -on what data type is in the input. Read more
source§

fn deserialize_i8<V>(self, visitor: V) -> Result<V::Value, Error>
where - V: Visitor<'de>,

Hint that the Deserialize type is expecting an i8 value.
source§

fn deserialize_i16<V>(self, visitor: V) -> Result<V::Value, Error>
where - V: Visitor<'de>,

Hint that the Deserialize type is expecting an i16 value.
source§

fn deserialize_i32<V>(self, visitor: V) -> Result<V::Value, Error>
where - V: Visitor<'de>,

Hint that the Deserialize type is expecting an i32 value.
source§

fn deserialize_i64<V>(self, visitor: V) -> Result<V::Value, Error>
where - V: Visitor<'de>,

Hint that the Deserialize type is expecting an i64 value.
source§

fn deserialize_i128<V>(self, visitor: V) -> Result<V::Value, Error>
where - V: Visitor<'de>,

Hint that the Deserialize type is expecting an i128 value. Read more
source§

fn deserialize_u8<V>(self, visitor: V) -> Result<V::Value, Error>
where - V: Visitor<'de>,

Hint that the Deserialize type is expecting a u8 value.
source§

fn deserialize_u16<V>(self, visitor: V) -> Result<V::Value, Error>
where - V: Visitor<'de>,

Hint that the Deserialize type is expecting a u16 value.
source§

fn deserialize_u32<V>(self, visitor: V) -> Result<V::Value, Error>
where - V: Visitor<'de>,

Hint that the Deserialize type is expecting a u32 value.
source§

fn deserialize_u64<V>(self, visitor: V) -> Result<V::Value, Error>
where - V: Visitor<'de>,

Hint that the Deserialize type is expecting a u64 value.
source§

fn deserialize_u128<V>(self, visitor: V) -> Result<V::Value, Error>
where - V: Visitor<'de>,

Hint that the Deserialize type is expecting an u128 value. Read more
source§

fn deserialize_f32<V>(self, visitor: V) -> Result<V::Value, Error>
where - V: Visitor<'de>,

Hint that the Deserialize type is expecting a f32 value.
source§

fn deserialize_f64<V>(self, visitor: V) -> Result<V::Value, Error>
where - V: Visitor<'de>,

Hint that the Deserialize type is expecting a f64 value.
source§

fn deserialize_option<V>(self, visitor: V) -> Result<V::Value, Error>
where - V: Visitor<'de>,

Hint that the Deserialize type is expecting an optional value. Read more
source§

fn deserialize_enum<V>( +on what data type is in the input. Read more

source§

fn deserialize_i8<V>(self, visitor: V) -> Result<V::Value, Error>
where + V: Visitor<'de>,

Hint that the Deserialize type is expecting an i8 value.
source§

fn deserialize_i16<V>(self, visitor: V) -> Result<V::Value, Error>
where + V: Visitor<'de>,

Hint that the Deserialize type is expecting an i16 value.
source§

fn deserialize_i32<V>(self, visitor: V) -> Result<V::Value, Error>
where + V: Visitor<'de>,

Hint that the Deserialize type is expecting an i32 value.
source§

fn deserialize_i64<V>(self, visitor: V) -> Result<V::Value, Error>
where + V: Visitor<'de>,

Hint that the Deserialize type is expecting an i64 value.
source§

fn deserialize_i128<V>(self, visitor: V) -> Result<V::Value, Error>
where + V: Visitor<'de>,

Hint that the Deserialize type is expecting an i128 value. Read more
source§

fn deserialize_u8<V>(self, visitor: V) -> Result<V::Value, Error>
where + V: Visitor<'de>,

Hint that the Deserialize type is expecting a u8 value.
source§

fn deserialize_u16<V>(self, visitor: V) -> Result<V::Value, Error>
where + V: Visitor<'de>,

Hint that the Deserialize type is expecting a u16 value.
source§

fn deserialize_u32<V>(self, visitor: V) -> Result<V::Value, Error>
where + V: Visitor<'de>,

Hint that the Deserialize type is expecting a u32 value.
source§

fn deserialize_u64<V>(self, visitor: V) -> Result<V::Value, Error>
where + V: Visitor<'de>,

Hint that the Deserialize type is expecting a u64 value.
source§

fn deserialize_u128<V>(self, visitor: V) -> Result<V::Value, Error>
where + V: Visitor<'de>,

Hint that the Deserialize type is expecting an u128 value. Read more
source§

fn deserialize_f32<V>(self, visitor: V) -> Result<V::Value, Error>
where + V: Visitor<'de>,

Hint that the Deserialize type is expecting a f32 value.
source§

fn deserialize_f64<V>(self, visitor: V) -> Result<V::Value, Error>
where + V: Visitor<'de>,

Hint that the Deserialize type is expecting a f64 value.
source§

fn deserialize_option<V>(self, visitor: V) -> Result<V::Value, Error>
where + V: Visitor<'de>,

Hint that the Deserialize type is expecting an optional value. Read more
source§

fn deserialize_enum<V>( self, _name: &str, _variants: &'static [&'static str], visitor: V ) -> Result<V::Value, Error>
where V: Visitor<'de>,

Hint that the Deserialize type is expecting an enum value with a -particular name and possible variants.
source§

fn deserialize_newtype_struct<V>( +particular name and possible variants.

source§

fn deserialize_newtype_struct<V>( self, name: &'static str, visitor: V ) -> Result<V::Value, Error>
where V: Visitor<'de>,

Hint that the Deserialize type is expecting a newtype struct with a -particular name.
source§

fn deserialize_bool<V>(self, visitor: V) -> Result<V::Value, Error>
where - V: Visitor<'de>,

Hint that the Deserialize type is expecting a bool value.
source§

fn deserialize_char<V>(self, visitor: V) -> Result<V::Value, Error>
where - V: Visitor<'de>,

Hint that the Deserialize type is expecting a char value.
source§

fn deserialize_str<V>(self, visitor: V) -> Result<V::Value, Error>
where +particular name.

source§

fn deserialize_bool<V>(self, visitor: V) -> Result<V::Value, Error>
where + V: Visitor<'de>,

Hint that the Deserialize type is expecting a bool value.
source§

fn deserialize_char<V>(self, visitor: V) -> Result<V::Value, Error>
where + V: Visitor<'de>,

Hint that the Deserialize type is expecting a char value.
source§

fn deserialize_str<V>(self, visitor: V) -> Result<V::Value, Error>
where V: Visitor<'de>,

Hint that the Deserialize type is expecting a string value and does not benefit from taking ownership of buffered data owned by the -Deserializer. Read more
source§

fn deserialize_string<V>(self, visitor: V) -> Result<V::Value, Error>
where +Deserializer. Read more

source§

fn deserialize_string<V>(self, visitor: V) -> Result<V::Value, Error>
where V: Visitor<'de>,

Hint that the Deserialize type is expecting a string value and would benefit from taking ownership of buffered data owned by the -Deserializer. Read more
source§

fn deserialize_bytes<V>(self, visitor: V) -> Result<V::Value, Error>
where +Deserializer. Read more

source§

fn deserialize_bytes<V>(self, visitor: V) -> Result<V::Value, Error>
where V: Visitor<'de>,

Hint that the Deserialize type is expecting a byte array and does not benefit from taking ownership of buffered data owned by the -Deserializer. Read more
source§

fn deserialize_byte_buf<V>(self, visitor: V) -> Result<V::Value, Error>
where +Deserializer. Read more

source§

fn deserialize_byte_buf<V>(self, visitor: V) -> Result<V::Value, Error>
where V: Visitor<'de>,

Hint that the Deserialize type is expecting a byte array and would benefit from taking ownership of buffered data owned by the -Deserializer. Read more
source§

fn deserialize_unit<V>(self, visitor: V) -> Result<V::Value, Error>
where - V: Visitor<'de>,

Hint that the Deserialize type is expecting a unit value.
source§

fn deserialize_unit_struct<V>( +Deserializer. Read more

source§

fn deserialize_unit<V>(self, visitor: V) -> Result<V::Value, Error>
where + V: Visitor<'de>,

Hint that the Deserialize type is expecting a unit value.
source§

fn deserialize_unit_struct<V>( self, _name: &'static str, visitor: V ) -> Result<V::Value, Error>
where V: Visitor<'de>,

Hint that the Deserialize type is expecting a unit struct with a -particular name.
source§

fn deserialize_seq<V>(self, visitor: V) -> Result<V::Value, Error>
where - V: Visitor<'de>,

Hint that the Deserialize type is expecting a sequence of values.
source§

fn deserialize_tuple<V>( +particular name.

source§

fn deserialize_seq<V>(self, visitor: V) -> Result<V::Value, Error>
where + V: Visitor<'de>,

Hint that the Deserialize type is expecting a sequence of values.
source§

fn deserialize_tuple<V>( self, _len: usize, visitor: V ) -> Result<V::Value, Error>
where V: Visitor<'de>,

Hint that the Deserialize type is expecting a sequence of values and -knows how many values there are without looking at the serialized data.
source§

fn deserialize_tuple_struct<V>( +knows how many values there are without looking at the serialized data.

source§

fn deserialize_tuple_struct<V>( self, _name: &'static str, _len: usize, visitor: V ) -> Result<V::Value, Error>
where V: Visitor<'de>,

Hint that the Deserialize type is expecting a tuple struct with a -particular name and number of fields.
source§

fn deserialize_map<V>(self, visitor: V) -> Result<V::Value, Error>
where - V: Visitor<'de>,

Hint that the Deserialize type is expecting a map of key-value pairs.
source§

fn deserialize_struct<V>( +particular name and number of fields.

source§

fn deserialize_map<V>(self, visitor: V) -> Result<V::Value, Error>
where + V: Visitor<'de>,

Hint that the Deserialize type is expecting a map of key-value pairs.
source§

fn deserialize_struct<V>( self, _name: &'static str, _fields: &'static [&'static str], visitor: V ) -> Result<V::Value, Error>
where V: Visitor<'de>,

Hint that the Deserialize type is expecting a struct with a particular -name and fields.
source§

fn deserialize_identifier<V>(self, visitor: V) -> Result<V::Value, Error>
where +name and fields.

source§

fn deserialize_identifier<V>(self, visitor: V) -> Result<V::Value, Error>
where V: Visitor<'de>,

Hint that the Deserialize type is expecting the name of a struct -field or the discriminant of an enum variant.
source§

fn deserialize_ignored_any<V>(self, visitor: V) -> Result<V::Value, Error>
where +field or the discriminant of an enum variant.

source§

fn deserialize_ignored_any<V>(self, visitor: V) -> Result<V::Value, Error>
where V: Visitor<'de>,

Hint that the Deserialize type needs to deserialize a value whose type -doesn’t matter because it is ignored. Read more
source§

fn is_human_readable(&self) -> bool

Determine whether Deserialize implementations should expect to +doesn’t matter because it is ignored. Read more
source§

fn is_human_readable(&self) -> bool

Determine whether Deserialize implementations should expect to deserialize their human-readable form. Read more
source§

impl Display for Value

source§

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Display a JSON value as a string.

let json = json!({ "city": "London", "street": "10 Downing Street" });
@@ -524,26 +524,26 @@ 
§Examples

 let pretty = format!("{:#}", json);
 assert_eq!(pretty,
     "{\n  \"city\": \"London\",\n  \"street\": \"10 Downing Street\"\n}");
-
source§

impl<T: Clone + Into<Value>> From<&[T]> for Value

source§

fn from(f: &[T]) -> Self

Convert a slice to Value::Array.

-
§Examples
+
source§

impl<T: Clone + Into<Value>> From<&[T]> for Value

source§

fn from(f: &[T]) -> Self

Convert a slice to Value::Array.

+
§Examples
use serde_json::Value;
 
 let v: &[&str] = &["lorem", "ipsum", "dolor"];
 let x: Value = v.into();
source§

impl From<&str> for Value

source§

fn from(f: &str) -> Self

Convert string slice to Value::String.

-
§Examples
+
§Examples
use serde_json::Value;
 
 let s: &str = "lorem";
 let x: Value = s.into();
-
source§

impl From<()> for Value

source§

fn from((): ()) -> Self

Convert () to Value::Null.

-
§Examples
+
source§

impl From<()> for Value

source§

fn from((): ()) -> Self

Convert () to Value::Null.

+
§Examples
use serde_json::Value;
 
 let u = ();
 let x: Value = u.into();
-
source§

impl<'a> From<Cow<'a, str>> for Value

source§

fn from(f: Cow<'a, str>) -> Self

Convert copy-on-write string to Value::String.

-
§Examples
+
source§

impl<'a> From<Cow<'a, str>> for Value

source§

fn from(f: Cow<'a, str>) -> Self

Convert copy-on-write string to Value::String.

+
§Examples
use serde_json::Value;
 use std::borrow::Cow;
 
@@ -555,60 +555,60 @@ 
§Exampleslet s: Cow<str> = Cow::Owned("lorem".to_string());
 let x: Value = s.into();
-
source§

impl From<Map<String, Value>> for Value

source§

fn from(f: Map<String, Value>) -> Self

Convert map (with string keys) to Value::Object.

-
§Examples
+
source§

impl From<Map<String, Value>> for Value

source§

fn from(f: Map<String, Value>) -> Self

Convert map (with string keys) to Value::Object.

+
§Examples
use serde_json::{Map, Value};
 
 let mut m = Map::new();
 m.insert("Lorem".to_string(), "ipsum".into());
 let x: Value = m.into();
-
source§

impl From<Number> for Value

source§

fn from(f: Number) -> Self

Convert Number to Value::Number.

-
§Examples
+
source§

impl From<Number> for Value

source§

fn from(f: Number) -> Self

Convert Number to Value::Number.

+
§Examples
use serde_json::{Number, Value};
 
 let n = Number::from(7);
 let x: Value = n.into();
source§

impl<T> From<Option<T>> for Value
where - T: Into<Value>,

source§

fn from(opt: Option<T>) -> Self

Converts to this type from the input type.
source§

impl From<String> for Value

source§

fn from(f: String) -> Self

Convert String to Value::String.

+ T: Into<Value>,
source§

fn from(opt: Option<T>) -> Self

Converts to this type from the input type.
source§

impl From<String> for Value

source§

fn from(f: String) -> Self

Convert String to Value::String.

§Examples
use serde_json::Value;
 
 let s: String = "lorem".to_string();
 let x: Value = s.into();
-
source§

impl<T: Into<Value>> From<Vec<T>> for Value

source§

fn from(f: Vec<T>) -> Self

Convert a Vec to Value::Array.

-
§Examples
+
source§

impl<T: Into<Value>> From<Vec<T>> for Value

source§

fn from(f: Vec<T>) -> Self

Convert a Vec to Value::Array.

+
§Examples
use serde_json::Value;
 
 let v = vec!["lorem", "ipsum", "dolor"];
 let x: Value = v.into();
-
source§

impl From<bool> for Value

source§

fn from(f: bool) -> Self

Convert boolean to Value::Bool.

+
source§

impl From<bool> for Value

source§

fn from(f: bool) -> Self

Convert boolean to Value::Bool.

§Examples
use serde_json::Value;
 
 let b = false;
 let x: Value = b.into();
-
source§

impl From<f32> for Value

source§

fn from(f: f32) -> Self

Convert 32-bit floating point number to Value::Number, or +

source§

impl From<f32> for Value

source§

fn from(f: f32) -> Self

Convert 32-bit floating point number to Value::Number, or Value::Null if infinite or NaN.

-
§Examples
+
§Examples
use serde_json::Value;
 
 let f: f32 = 13.37;
 let x: Value = f.into();
-
source§

impl From<f64> for Value

source§

fn from(f: f64) -> Self

Convert 64-bit floating point number to Value::Number, or +

source§

impl From<f64> for Value

source§

fn from(f: f64) -> Self

Convert 64-bit floating point number to Value::Number, or Value::Null if infinite or NaN.

-
§Examples
+
§Examples
use serde_json::Value;
 
 let f: f64 = 13.37;
 let x: Value = f.into();
-
source§

impl From<i16> for Value

source§

fn from(n: i16) -> Self

Converts to this type from the input type.
source§

impl From<i32> for Value

source§

fn from(n: i32) -> Self

Converts to this type from the input type.
source§

impl From<i64> for Value

source§

fn from(n: i64) -> Self

Converts to this type from the input type.
source§

impl From<i8> for Value

source§

fn from(n: i8) -> Self

Converts to this type from the input type.
source§

impl From<isize> for Value

source§

fn from(n: isize) -> Self

Converts to this type from the input type.
source§

impl From<u16> for Value

source§

fn from(n: u16) -> Self

Converts to this type from the input type.
source§

impl From<u32> for Value

source§

fn from(n: u32) -> Self

Converts to this type from the input type.
source§

impl From<u64> for Value

source§

fn from(n: u64) -> Self

Converts to this type from the input type.
source§

impl From<u8> for Value

source§

fn from(n: u8) -> Self

Converts to this type from the input type.
source§

impl From<usize> for Value

source§

fn from(n: usize) -> Self

Converts to this type from the input type.
source§

impl<K: Into<String>, V: Into<Value>> FromIterator<(K, V)> for Value

source§

fn from_iter<I: IntoIterator<Item = (K, V)>>(iter: I) -> Self

Create a Value::Object by collecting an iterator of key-value pairs.

-
§Examples
+
source§

impl From<i16> for Value

source§

fn from(n: i16) -> Self

Converts to this type from the input type.
source§

impl From<i32> for Value

source§

fn from(n: i32) -> Self

Converts to this type from the input type.
source§

impl From<i64> for Value

source§

fn from(n: i64) -> Self

Converts to this type from the input type.
source§

impl From<i8> for Value

source§

fn from(n: i8) -> Self

Converts to this type from the input type.
source§

impl From<isize> for Value

source§

fn from(n: isize) -> Self

Converts to this type from the input type.
source§

impl From<u16> for Value

source§

fn from(n: u16) -> Self

Converts to this type from the input type.
source§

impl From<u32> for Value

source§

fn from(n: u32) -> Self

Converts to this type from the input type.
source§

impl From<u64> for Value

source§

fn from(n: u64) -> Self

Converts to this type from the input type.
source§

impl From<u8> for Value

source§

fn from(n: u8) -> Self

Converts to this type from the input type.
source§

impl From<usize> for Value

source§

fn from(n: usize) -> Self

Converts to this type from the input type.
source§

impl<K: Into<String>, V: Into<Value>> FromIterator<(K, V)> for Value

source§

fn from_iter<I: IntoIterator<Item = (K, V)>>(iter: I) -> Self

Create a Value::Object by collecting an iterator of key-value pairs.

+
§Examples
use serde_json::Value;
 
 let v: Vec<_> = vec![("lorem", 40), ("ipsum", 2)];
 let x: Value = v.into_iter().collect();
source§

impl<T: Into<Value>> FromIterator<T> for Value

source§

fn from_iter<I: IntoIterator<Item = T>>(iter: I) -> Self

Create a Value::Array by collecting an iterator of array elements.

-
§Examples
+
§Examples
use serde_json::Value;
 
 let v = std::iter::repeat(42).take(5);
@@ -632,7 +632,7 @@ 
§Examples

 in the map or the given index is not within the bounds of the array.

 
For retrieving deeply nested values, you should have a look at the
 Value::pointer method.

-
§Examples

+
§Examples

 
let data = json!({
     "x": {
         "y": ["z", "zz"]
@@ -654,7 +654,7 @@ 
§Examples

 treated like an empty object. If the key is not already present in the
 object, it will be inserted with a value of null. Indexing into a value
 that is neither an object nor null will panic.

-
§Examples

+
§Examples

 
let mut data = json!({ "x": 0 });
 
 // replace an existing key
@@ -670,129 +670,133 @@ 
§Examples

 data["a"]["b"]["c"]["d"] = json!(true);
 
 println!("{}", data);

-
source§

impl<'de> IntoDeserializer<'de, Error> for &'de Value

§

type Deserializer = &'de Value

The type of the deserializer being converted into.
source§

fn into_deserializer(self) -> Self::Deserializer

Convert this value into a deserializer.
source§

impl<'de> IntoDeserializer<'de, Error> for Value

§

type Deserializer = Value

The type of the deserializer being converted into.
source§

fn into_deserializer(self) -> Self::Deserializer

Convert this value into a deserializer.
source§

impl PartialEq<&str> for Value

source§

fn eq(&self, other: &&str) -> 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 PartialEq<String> for Value

source§

fn eq(&self, other: &String) -> 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 PartialEq<Value> for &str

source§

fn eq(&self, other: &Value) -> 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 PartialEq<Value> for String

source§

fn eq(&self, other: &Value) -> 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 PartialEq<Value> for bool

source§

fn eq(&self, other: &Value) -> 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 PartialEq<Value> for f32

source§

fn eq(&self, other: &Value) -> 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 PartialEq<Value> for f64

source§

fn eq(&self, other: &Value) -> 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 PartialEq<Value> for i16

source§

fn eq(&self, other: &Value) -> 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 PartialEq<Value> for i32

source§

fn eq(&self, other: &Value) -> 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 PartialEq<Value> for i64

source§

fn eq(&self, other: &Value) -> 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 PartialEq<Value> for i8

source§

fn eq(&self, other: &Value) -> 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 PartialEq<Value> for isize

source§

fn eq(&self, other: &Value) -> 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 PartialEq<Value> for str

source§

fn eq(&self, other: &Value) -> bool

This method tests for self and other values to be equal, and is used +
source§

impl<'de> IntoDeserializer<'de, Error> for &'de Value

§

type Deserializer = &'de Value

The type of the deserializer being converted into.
source§

fn into_deserializer(self) -> Self::Deserializer

Convert this value into a deserializer.
source§

impl<'de> IntoDeserializer<'de, Error> for Value

§

type Deserializer = Value

The type of the deserializer being converted into.
source§

fn into_deserializer(self) -> Self::Deserializer

Convert this value into a deserializer.
source§

impl PartialEq<&str> for Value

source§

fn eq(&self, other: &&str) -> 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 PartialEq<String> for Value

source§

fn eq(&self, other: &String) -> 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 PartialEq<Value> for &str

source§

fn eq(&self, other: &Value) -> 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 PartialEq<Value> for u16

source§

fn eq(&self, other: &Value) -> 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 PartialEq<Value> for u32

source§

fn eq(&self, other: &Value) -> bool

This method tests for self and other values to be equal, and is used +sufficient, and should not be overridden without very good reason.
source§

impl PartialEq<Value> for String

source§

fn eq(&self, other: &Value) -> 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 PartialEq<Value> for bool

source§

fn eq(&self, other: &Value) -> 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 PartialEq<Value> for u64

source§

fn eq(&self, other: &Value) -> 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 PartialEq<Value> for u8

source§

fn eq(&self, other: &Value) -> 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 PartialEq<Value> for usize

source§

fn eq(&self, other: &Value) -> 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<'a> PartialEq<bool> for &'a Value

source§

fn eq(&self, other: &bool) -> 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<'a> PartialEq<bool> for &'a mut Value

source§

fn eq(&self, other: &bool) -> 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 PartialEq<bool> for Value

source§

fn eq(&self, other: &bool) -> 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<'a> PartialEq<f32> for &'a Value

source§

fn eq(&self, other: &f32) -> 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<'a> PartialEq<f32> for &'a mut Value

source§

fn eq(&self, other: &f32) -> bool

This method tests for self and other values to be equal, and is used +sufficient, and should not be overridden without very good reason.
source§

impl PartialEq<Value> for f32

source§

fn eq(&self, other: &Value) -> 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 PartialEq<Value> for f64

source§

fn eq(&self, other: &Value) -> 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 PartialEq<f32> for Value

source§

fn eq(&self, other: &f32) -> 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<'a> PartialEq<f64> for &'a Value

source§

fn eq(&self, other: &f64) -> 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<'a> PartialEq<f64> for &'a mut Value

source§

fn eq(&self, other: &f64) -> 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 PartialEq<f64> for Value

source§

fn eq(&self, other: &f64) -> bool

This method tests for self and other values to be equal, and is used +sufficient, and should not be overridden without very good reason.
source§

impl PartialEq<Value> for i16

source§

fn eq(&self, other: &Value) -> 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<'a> PartialEq<i16> for &'a Value

source§

fn eq(&self, other: &i16) -> 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<'a> PartialEq<i16> for &'a mut Value

source§

fn eq(&self, other: &i16) -> 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 PartialEq<i16> for Value

source§

fn eq(&self, other: &i16) -> 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<'a> PartialEq<i32> for &'a Value

source§

fn eq(&self, other: &i32) -> 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<'a> PartialEq<i32> for &'a mut Value

source§

fn eq(&self, other: &i32) -> bool

This method tests for self and other values to be equal, and is used +sufficient, and should not be overridden without very good reason.
source§

impl PartialEq<Value> for i32

source§

fn eq(&self, other: &Value) -> 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 PartialEq<i32> for Value

source§

fn eq(&self, other: &i32) -> 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<'a> PartialEq<i64> for &'a Value

source§

fn eq(&self, other: &i64) -> 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<'a> PartialEq<i64> for &'a mut Value

source§

fn eq(&self, other: &i64) -> 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 PartialEq<i64> for Value

source§

fn eq(&self, other: &i64) -> 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<'a> PartialEq<i8> for &'a Value

source§

fn eq(&self, other: &i8) -> bool

This method tests for self and other values to be equal, and is used +sufficient, and should not be overridden without very good reason.
source§

impl PartialEq<Value> for i64

source§

fn eq(&self, other: &Value) -> 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 PartialEq<Value> for i8

source§

fn eq(&self, other: &Value) -> 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 PartialEq<Value> for isize

source§

fn eq(&self, other: &Value) -> 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<'a> PartialEq<i8> for &'a mut Value

source§

fn eq(&self, other: &i8) -> 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 PartialEq<i8> for Value

source§

fn eq(&self, other: &i8) -> bool

This method tests for self and other values to be equal, and is used +sufficient, and should not be overridden without very good reason.
source§

impl PartialEq<Value> for str

source§

fn eq(&self, other: &Value) -> 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 PartialEq<Value> for u16

source§

fn eq(&self, other: &Value) -> 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 PartialEq<Value> for u32

source§

fn eq(&self, other: &Value) -> 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<'a> PartialEq<isize> for &'a Value

source§

fn eq(&self, other: &isize) -> 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<'a> PartialEq<isize> for &'a mut Value

source§

fn eq(&self, other: &isize) -> 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 PartialEq<isize> for Value

source§

fn eq(&self, other: &isize) -> 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 PartialEq<str> for Value

source§

fn eq(&self, other: &str) -> 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<'a> PartialEq<u16> for &'a Value

source§

fn eq(&self, other: &u16) -> bool

This method tests for self and other values to be equal, and is used +sufficient, and should not be overridden without very good reason.
source§

impl PartialEq<Value> for u64

source§

fn eq(&self, other: &Value) -> 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 PartialEq<Value> for u8

source§

fn eq(&self, other: &Value) -> 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<'a> PartialEq<u16> for &'a mut Value

source§

fn eq(&self, other: &u16) -> 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 PartialEq<u16> for Value

source§

fn eq(&self, other: &u16) -> 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<'a> PartialEq<u32> for &'a Value

source§

fn eq(&self, other: &u32) -> 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<'a> PartialEq<u32> for &'a mut Value

source§

fn eq(&self, other: &u32) -> 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 PartialEq<u32> for Value

source§

fn eq(&self, other: &u32) -> 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<'a> PartialEq<u64> for &'a Value

source§

fn eq(&self, other: &u64) -> bool

This method tests for self and other values to be equal, and is used +sufficient, and should not be overridden without very good reason.
source§

impl PartialEq<Value> for usize

source§

fn eq(&self, other: &Value) -> 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<'a> PartialEq<bool> for &'a Value

source§

fn eq(&self, other: &bool) -> 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<'a> PartialEq<bool> for &'a mut Value

source§

fn eq(&self, other: &bool) -> 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 PartialEq<bool> for Value

source§

fn eq(&self, other: &bool) -> 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<'a> PartialEq<f32> for &'a Value

source§

fn eq(&self, other: &f32) -> 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<'a> PartialEq<u64> for &'a mut Value

source§

fn eq(&self, other: &u64) -> 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 PartialEq<u64> for Value

source§

fn eq(&self, other: &u64) -> 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<'a> PartialEq<u8> for &'a Value

source§

fn eq(&self, other: &u8) -> 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<'a> PartialEq<u8> for &'a mut Value

source§

fn eq(&self, other: &u8) -> bool

This method tests for self and other values to be equal, and is used +sufficient, and should not be overridden without very good reason.
source§

impl<'a> PartialEq<f32> for &'a mut Value

source§

fn eq(&self, other: &f32) -> 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 PartialEq<f32> for Value

source§

fn eq(&self, other: &f32) -> 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<'a> PartialEq<f64> for &'a Value

source§

fn eq(&self, other: &f64) -> 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<'a> PartialEq<f64> for &'a mut Value

source§

fn eq(&self, other: &f64) -> 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 PartialEq<u8> for Value

source§

fn eq(&self, other: &u8) -> bool

This method tests for self and other values to be equal, and is used +sufficient, and should not be overridden without very good reason.
source§

impl PartialEq<f64> for Value

source§

fn eq(&self, other: &f64) -> 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<'a> PartialEq<usize> for &'a Value

source§

fn eq(&self, other: &usize) -> 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<'a> PartialEq<usize> for &'a mut Value

source§

fn eq(&self, other: &usize) -> 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 PartialEq<usize> for Value

source§

fn eq(&self, other: &usize) -> 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 PartialEq for Value

source§

fn eq(&self, other: &Value) -> bool

This method tests for self and other values to be equal, and is used +sufficient, and should not be overridden without very good reason.
source§

impl<'a> PartialEq<i16> for &'a Value

source§

fn eq(&self, other: &i16) -> 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<'a> PartialEq<i16> for &'a mut Value

source§

fn eq(&self, other: &i16) -> 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 PartialEq<i16> for Value

source§

fn eq(&self, other: &i16) -> 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<'a> PartialEq<i32> for &'a Value

source§

fn eq(&self, other: &i32) -> 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<'a> PartialEq<i32> for &'a mut Value

source§

fn eq(&self, other: &i32) -> 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 PartialEq<i32> for Value

source§

fn eq(&self, other: &i32) -> 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<'a> PartialEq<i64> for &'a Value

source§

fn eq(&self, other: &i64) -> 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<'a> PartialEq<i64> for &'a mut Value

source§

fn eq(&self, other: &i64) -> 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 PartialEq<i64> for Value

source§

fn eq(&self, other: &i64) -> 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<'a> PartialEq<i8> for &'a Value

source§

fn eq(&self, other: &i8) -> 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<'a> PartialEq<i8> for &'a mut Value

source§

fn eq(&self, other: &i8) -> 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 PartialEq<i8> for Value

source§

fn eq(&self, other: &i8) -> 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<'a> PartialEq<isize> for &'a Value

source§

fn eq(&self, other: &isize) -> 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<'a> PartialEq<isize> for &'a mut Value

source§

fn eq(&self, other: &isize) -> 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 PartialEq<isize> for Value

source§

fn eq(&self, other: &isize) -> 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 PartialEq<str> for Value

source§

fn eq(&self, other: &str) -> 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<'a> PartialEq<u16> for &'a Value

source§

fn eq(&self, other: &u16) -> 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<'a> PartialEq<u16> for &'a mut Value

source§

fn eq(&self, other: &u16) -> 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 PartialEq<u16> for Value

source§

fn eq(&self, other: &u16) -> 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<'a> PartialEq<u32> for &'a Value

source§

fn eq(&self, other: &u32) -> 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<'a> PartialEq<u32> for &'a mut Value

source§

fn eq(&self, other: &u32) -> 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 PartialEq<u32> for Value

source§

fn eq(&self, other: &u32) -> 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<'a> PartialEq<u64> for &'a Value

source§

fn eq(&self, other: &u64) -> 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<'a> PartialEq<u64> for &'a mut Value

source§

fn eq(&self, other: &u64) -> 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 PartialEq<u64> for Value

source§

fn eq(&self, other: &u64) -> 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<'a> PartialEq<u8> for &'a Value

source§

fn eq(&self, other: &u8) -> 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<'a> PartialEq<u8> for &'a mut Value

source§

fn eq(&self, other: &u8) -> 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 PartialEq<u8> for Value

source§

fn eq(&self, other: &u8) -> 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<'a> PartialEq<usize> for &'a Value

source§

fn eq(&self, other: &usize) -> 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<'a> PartialEq<usize> for &'a mut Value

source§

fn eq(&self, other: &usize) -> 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 PartialEq<usize> for Value

source§

fn eq(&self, other: &usize) -> 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 PartialEq for Value

source§

fn eq(&self, other: &Value) -> 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 Serialize for Value

source§

fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>
where S: Serializer,

Serialize this value into the given Serde serializer. Read more
source§

impl Eq for Value

source§

impl StructuralPartialEq for Value

Auto Trait Implementations§

§

impl Freeze for Value

§

impl RefUnwindSafe for Value

§

impl Send for Value

§

impl Sync for Value

§

impl Unpin for Value

§

impl UnwindSafe for Value

Blanket Implementations§

source§

impl<T> Any for T
where T: 'static + ?Sized,

source§

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more
source§

impl<T> Borrow<T> for T
where T: ?Sized,

source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
source§

impl<T> BorrowMut<T> for T
where - 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.

+ T: ?Sized,
source§

fn borrow_mut(&mut self) -> &mut T

Mutably borrows from an owned value. Read more
source§

impl<Q, K> Equivalent<K> for Q
where + Q: Eq + ?Sized, + K: Borrow<Q> + ?Sized,

source§

fn equivalent(&self, key: &K) -> bool

Checks if this value is equivalent to the given key. Read more
source§

impl<Q, K> Equivalent<K> for Q
where + Q: Eq + ?Sized, + K: Borrow<Q> + ?Sized,

source§

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 T
where U: From<T>,

source§

fn into(self) -> U

Calls U::from(self).

That is, this conversion is whatever the implementation of diff --git a/serde_json/value/struct.Number.html b/serde_json/value/struct.Number.html index 4202bf6f8e..48ba48a427 100644 --- a/serde_json/value/struct.Number.html +++ b/serde_json/value/struct.Number.html @@ -1,4 +1,4 @@ -Number in serde_json::value - Rust

+Number in serde_json::value - Rust

Struct serde_json::value::Number

source · 
pub struct Number { /* private fields */ }
Expand description

Represents a JSON number, whether integer or floating point.

Implementations§

source§

impl Number

source

pub fn is_i64(&self) -> bool

Returns true if the Number is an integer between i64::MIN and i64::MAX.

@@ -71,240 +71,240 @@ 
assert!(Number::from_f64(256.0).is_some());
 
 assert!(Number::from_f64(f64::NAN).is_none());
-

Trait Implementations§

source§

impl Clone for Number

source§

fn clone(&self) -> Number

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 Number

source§

fn fmt(&self, formatter: &mut Formatter<'_>) -> Result

Formats the value using the given formatter. Read more
source§

impl<'de> Deserialize<'de> for Number

source§

fn deserialize<D>(deserializer: D) -> Result<Number, D::Error>
where - D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer. Read more
source§

impl<'de, 'a> Deserializer<'de> for &'a Number

§

type Error = Error

The error type that can be returned if some error occurs during -deserialization.
source§

fn deserialize_any<V>(self, visitor: V) -> Result<V::Value, Error>
where +

Trait Implementations§

source§

impl Clone for Number

source§

fn clone(&self) -> Number

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 Number

source§

fn fmt(&self, formatter: &mut Formatter<'_>) -> Result

Formats the value using the given formatter. Read more
source§

impl<'de> Deserialize<'de> for Number

source§

fn deserialize<D>(deserializer: D) -> Result<Number, D::Error>
where + D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer. Read more
source§

impl<'de, 'a> Deserializer<'de> for &'a Number

§

type Error = Error

The error type that can be returned if some error occurs during +deserialization.
source§

fn deserialize_any<V>(self, visitor: V) -> Result<V::Value, Error>
where V: Visitor<'de>,

Require the Deserializer to figure out how to drive the visitor based -on what data type is in the input. Read more
source§

fn deserialize_i8<V>(self, visitor: V) -> Result<V::Value, Error>
where - V: Visitor<'de>,

Hint that the Deserialize type is expecting an i8 value.
source§

fn deserialize_i16<V>(self, visitor: V) -> Result<V::Value, Error>
where - V: Visitor<'de>,

Hint that the Deserialize type is expecting an i16 value.
source§

fn deserialize_i32<V>(self, visitor: V) -> Result<V::Value, Error>
where - V: Visitor<'de>,

Hint that the Deserialize type is expecting an i32 value.
source§

fn deserialize_i64<V>(self, visitor: V) -> Result<V::Value, Error>
where - V: Visitor<'de>,

Hint that the Deserialize type is expecting an i64 value.
source§

fn deserialize_i128<V>(self, visitor: V) -> Result<V::Value, Error>
where - V: Visitor<'de>,

Hint that the Deserialize type is expecting an i128 value. Read more
source§

fn deserialize_u8<V>(self, visitor: V) -> Result<V::Value, Error>
where - V: Visitor<'de>,

Hint that the Deserialize type is expecting a u8 value.
source§

fn deserialize_u16<V>(self, visitor: V) -> Result<V::Value, Error>
where - V: Visitor<'de>,

Hint that the Deserialize type is expecting a u16 value.
source§

fn deserialize_u32<V>(self, visitor: V) -> Result<V::Value, Error>
where - V: Visitor<'de>,

Hint that the Deserialize type is expecting a u32 value.
source§

fn deserialize_u64<V>(self, visitor: V) -> Result<V::Value, Error>
where - V: Visitor<'de>,

Hint that the Deserialize type is expecting a u64 value.
source§

fn deserialize_u128<V>(self, visitor: V) -> Result<V::Value, Error>
where - V: Visitor<'de>,

Hint that the Deserialize type is expecting an u128 value. Read more
source§

fn deserialize_f32<V>(self, visitor: V) -> Result<V::Value, Error>
where - V: Visitor<'de>,

Hint that the Deserialize type is expecting a f32 value.
source§

fn deserialize_f64<V>(self, visitor: V) -> Result<V::Value, Error>
where - V: Visitor<'de>,

Hint that the Deserialize type is expecting a f64 value.
source§

fn deserialize_bool<V>( +on what data type is in the input. Read more

source§

fn deserialize_i8<V>(self, visitor: V) -> Result<V::Value, Error>
where + V: Visitor<'de>,

Hint that the Deserialize type is expecting an i8 value.
source§

fn deserialize_i16<V>(self, visitor: V) -> Result<V::Value, Error>
where + V: Visitor<'de>,

Hint that the Deserialize type is expecting an i16 value.
source§

fn deserialize_i32<V>(self, visitor: V) -> Result<V::Value, Error>
where + V: Visitor<'de>,

Hint that the Deserialize type is expecting an i32 value.
source§

fn deserialize_i64<V>(self, visitor: V) -> Result<V::Value, Error>
where + V: Visitor<'de>,

Hint that the Deserialize type is expecting an i64 value.
source§

fn deserialize_i128<V>(self, visitor: V) -> Result<V::Value, Error>
where + V: Visitor<'de>,

Hint that the Deserialize type is expecting an i128 value. Read more
source§

fn deserialize_u8<V>(self, visitor: V) -> Result<V::Value, Error>
where + V: Visitor<'de>,

Hint that the Deserialize type is expecting a u8 value.
source§

fn deserialize_u16<V>(self, visitor: V) -> Result<V::Value, Error>
where + V: Visitor<'de>,

Hint that the Deserialize type is expecting a u16 value.
source§

fn deserialize_u32<V>(self, visitor: V) -> Result<V::Value, Error>
where + V: Visitor<'de>,

Hint that the Deserialize type is expecting a u32 value.
source§

fn deserialize_u64<V>(self, visitor: V) -> Result<V::Value, Error>
where + V: Visitor<'de>,

Hint that the Deserialize type is expecting a u64 value.
source§

fn deserialize_u128<V>(self, visitor: V) -> Result<V::Value, Error>
where + V: Visitor<'de>,

Hint that the Deserialize type is expecting an u128 value. Read more
source§

fn deserialize_f32<V>(self, visitor: V) -> Result<V::Value, Error>
where + V: Visitor<'de>,

Hint that the Deserialize type is expecting a f32 value.
source§

fn deserialize_f64<V>(self, visitor: V) -> Result<V::Value, Error>
where + V: Visitor<'de>,

Hint that the Deserialize type is expecting a f64 value.
source§

fn deserialize_bool<V>( self, visitor: V ) -> Result<V::Value, <Self as Deserializer<'de>>::Error>
where - V: Visitor<'de>,

Hint that the Deserialize type is expecting a bool value.
source§

fn deserialize_char<V>( + V: Visitor<'de>,

Hint that the Deserialize type is expecting a bool value.
source§

fn deserialize_char<V>( self, visitor: V ) -> Result<V::Value, <Self as Deserializer<'de>>::Error>
where - V: Visitor<'de>,

Hint that the Deserialize type is expecting a char value.
source§

fn deserialize_str<V>( + V: Visitor<'de>,

Hint that the Deserialize type is expecting a char value.
source§

fn deserialize_str<V>( self, visitor: V ) -> Result<V::Value, <Self as Deserializer<'de>>::Error>
where V: Visitor<'de>,

Hint that the Deserialize type is expecting a string value and does not benefit from taking ownership of buffered data owned by the -Deserializer. Read more
source§

fn deserialize_string<V>( +Deserializer. Read more

source§

fn deserialize_string<V>( self, visitor: V ) -> Result<V::Value, <Self as Deserializer<'de>>::Error>
where V: Visitor<'de>,

Hint that the Deserialize type is expecting a string value and would benefit from taking ownership of buffered data owned by the -Deserializer. Read more
source§

fn deserialize_bytes<V>( +Deserializer. Read more

source§

fn deserialize_bytes<V>( self, visitor: V ) -> Result<V::Value, <Self as Deserializer<'de>>::Error>
where V: Visitor<'de>,

Hint that the Deserialize type is expecting a byte array and does not benefit from taking ownership of buffered data owned by the -Deserializer. Read more
source§

fn deserialize_byte_buf<V>( +Deserializer. Read more

source§

fn deserialize_byte_buf<V>( self, visitor: V ) -> Result<V::Value, <Self as Deserializer<'de>>::Error>
where V: Visitor<'de>,

Hint that the Deserialize type is expecting a byte array and would benefit from taking ownership of buffered data owned by the -Deserializer. Read more
source§

fn deserialize_option<V>( +Deserializer. Read more

source§

fn deserialize_option<V>( self, visitor: V ) -> Result<V::Value, <Self as Deserializer<'de>>::Error>
where - V: Visitor<'de>,

Hint that the Deserialize type is expecting an optional value. Read more
source§

fn deserialize_unit<V>( + V: Visitor<'de>,

Hint that the Deserialize type is expecting an optional value. Read more
source§

fn deserialize_unit<V>( self, visitor: V ) -> Result<V::Value, <Self as Deserializer<'de>>::Error>
where - V: Visitor<'de>,

Hint that the Deserialize type is expecting a unit value.
source§

fn deserialize_unit_struct<V>( + V: Visitor<'de>,

Hint that the Deserialize type is expecting a unit value.
source§

fn deserialize_unit_struct<V>( self, name: &'static str, visitor: V ) -> Result<V::Value, <Self as Deserializer<'de>>::Error>
where V: Visitor<'de>,

Hint that the Deserialize type is expecting a unit struct with a -particular name.
source§

fn deserialize_newtype_struct<V>( +particular name.

source§

fn deserialize_newtype_struct<V>( self, name: &'static str, visitor: V ) -> Result<V::Value, <Self as Deserializer<'de>>::Error>
where V: Visitor<'de>,

Hint that the Deserialize type is expecting a newtype struct with a -particular name.
source§

fn deserialize_seq<V>( +particular name.

source§

fn deserialize_seq<V>( self, visitor: V ) -> Result<V::Value, <Self as Deserializer<'de>>::Error>
where - V: Visitor<'de>,

Hint that the Deserialize type is expecting a sequence of values.
source§

fn deserialize_tuple<V>( + V: Visitor<'de>,

Hint that the Deserialize type is expecting a sequence of values.
source§

fn deserialize_tuple<V>( self, len: usize, visitor: V ) -> Result<V::Value, <Self as Deserializer<'de>>::Error>
where V: Visitor<'de>,

Hint that the Deserialize type is expecting a sequence of values and -knows how many values there are without looking at the serialized data.
source§

fn deserialize_tuple_struct<V>( +knows how many values there are without looking at the serialized data.

source§

fn deserialize_tuple_struct<V>( self, name: &'static str, len: usize, visitor: V ) -> Result<V::Value, <Self as Deserializer<'de>>::Error>
where V: Visitor<'de>,

Hint that the Deserialize type is expecting a tuple struct with a -particular name and number of fields.
source§

fn deserialize_map<V>( +particular name and number of fields.

source§

fn deserialize_map<V>( self, visitor: V ) -> Result<V::Value, <Self as Deserializer<'de>>::Error>
where - V: Visitor<'de>,

Hint that the Deserialize type is expecting a map of key-value pairs.
source§

fn deserialize_struct<V>( + V: Visitor<'de>,

Hint that the Deserialize type is expecting a map of key-value pairs.
source§

fn deserialize_struct<V>( self, name: &'static str, fields: &'static [&'static str], visitor: V ) -> Result<V::Value, <Self as Deserializer<'de>>::Error>
where V: Visitor<'de>,

Hint that the Deserialize type is expecting a struct with a particular -name and fields.
source§

fn deserialize_enum<V>( +name and fields.

source§

fn deserialize_enum<V>( self, name: &'static str, variants: &'static [&'static str], visitor: V ) -> Result<V::Value, <Self as Deserializer<'de>>::Error>
where V: Visitor<'de>,

Hint that the Deserialize type is expecting an enum value with a -particular name and possible variants.
source§

fn deserialize_identifier<V>( +particular name and possible variants.

source§

fn deserialize_identifier<V>( self, visitor: V ) -> Result<V::Value, <Self as Deserializer<'de>>::Error>
where V: Visitor<'de>,

Hint that the Deserialize type is expecting the name of a struct -field or the discriminant of an enum variant.
source§

fn deserialize_ignored_any<V>( +field or the discriminant of an enum variant.

source§

fn deserialize_ignored_any<V>( self, visitor: V ) -> Result<V::Value, <Self as Deserializer<'de>>::Error>
where V: Visitor<'de>,

Hint that the Deserialize type needs to deserialize a value whose type -doesn’t matter because it is ignored. Read more
source§

fn is_human_readable(&self) -> bool

Determine whether Deserialize implementations should expect to -deserialize their human-readable form. Read more
source§

impl<'de> Deserializer<'de> for Number

§

type Error = Error

The error type that can be returned if some error occurs during -deserialization.
source§

fn deserialize_any<V>(self, visitor: V) -> Result<V::Value, Error>
where +doesn’t matter because it is ignored. Read more

source§

fn is_human_readable(&self) -> bool

Determine whether Deserialize implementations should expect to +deserialize their human-readable form. Read more
source§

impl<'de> Deserializer<'de> for Number

§

type Error = Error

The error type that can be returned if some error occurs during +deserialization.
source§

fn deserialize_any<V>(self, visitor: V) -> Result<V::Value, Error>
where V: Visitor<'de>,

Require the Deserializer to figure out how to drive the visitor based -on what data type is in the input. Read more
source§

fn deserialize_i8<V>(self, visitor: V) -> Result<V::Value, Error>
where - V: Visitor<'de>,

Hint that the Deserialize type is expecting an i8 value.
source§

fn deserialize_i16<V>(self, visitor: V) -> Result<V::Value, Error>
where - V: Visitor<'de>,

Hint that the Deserialize type is expecting an i16 value.
source§

fn deserialize_i32<V>(self, visitor: V) -> Result<V::Value, Error>
where - V: Visitor<'de>,

Hint that the Deserialize type is expecting an i32 value.
source§

fn deserialize_i64<V>(self, visitor: V) -> Result<V::Value, Error>
where - V: Visitor<'de>,

Hint that the Deserialize type is expecting an i64 value.
source§

fn deserialize_i128<V>(self, visitor: V) -> Result<V::Value, Error>
where - V: Visitor<'de>,

Hint that the Deserialize type is expecting an i128 value. Read more
source§

fn deserialize_u8<V>(self, visitor: V) -> Result<V::Value, Error>
where - V: Visitor<'de>,

Hint that the Deserialize type is expecting a u8 value.
source§

fn deserialize_u16<V>(self, visitor: V) -> Result<V::Value, Error>
where - V: Visitor<'de>,

Hint that the Deserialize type is expecting a u16 value.
source§

fn deserialize_u32<V>(self, visitor: V) -> Result<V::Value, Error>
where - V: Visitor<'de>,

Hint that the Deserialize type is expecting a u32 value.
source§

fn deserialize_u64<V>(self, visitor: V) -> Result<V::Value, Error>
where - V: Visitor<'de>,

Hint that the Deserialize type is expecting a u64 value.
source§

fn deserialize_u128<V>(self, visitor: V) -> Result<V::Value, Error>
where - V: Visitor<'de>,

Hint that the Deserialize type is expecting an u128 value. Read more
source§

fn deserialize_f32<V>(self, visitor: V) -> Result<V::Value, Error>
where - V: Visitor<'de>,

Hint that the Deserialize type is expecting a f32 value.
source§

fn deserialize_f64<V>(self, visitor: V) -> Result<V::Value, Error>
where - V: Visitor<'de>,

Hint that the Deserialize type is expecting a f64 value.
source§

fn deserialize_bool<V>( +on what data type is in the input. Read more

source§

fn deserialize_i8<V>(self, visitor: V) -> Result<V::Value, Error>
where + V: Visitor<'de>,

Hint that the Deserialize type is expecting an i8 value.
source§

fn deserialize_i16<V>(self, visitor: V) -> Result<V::Value, Error>
where + V: Visitor<'de>,

Hint that the Deserialize type is expecting an i16 value.
source§

fn deserialize_i32<V>(self, visitor: V) -> Result<V::Value, Error>
where + V: Visitor<'de>,

Hint that the Deserialize type is expecting an i32 value.
source§

fn deserialize_i64<V>(self, visitor: V) -> Result<V::Value, Error>
where + V: Visitor<'de>,

Hint that the Deserialize type is expecting an i64 value.
source§

fn deserialize_i128<V>(self, visitor: V) -> Result<V::Value, Error>
where + V: Visitor<'de>,

Hint that the Deserialize type is expecting an i128 value. Read more
source§

fn deserialize_u8<V>(self, visitor: V) -> Result<V::Value, Error>
where + V: Visitor<'de>,

Hint that the Deserialize type is expecting a u8 value.
source§

fn deserialize_u16<V>(self, visitor: V) -> Result<V::Value, Error>
where + V: Visitor<'de>,

Hint that the Deserialize type is expecting a u16 value.
source§

fn deserialize_u32<V>(self, visitor: V) -> Result<V::Value, Error>
where + V: Visitor<'de>,

Hint that the Deserialize type is expecting a u32 value.
source§

fn deserialize_u64<V>(self, visitor: V) -> Result<V::Value, Error>
where + V: Visitor<'de>,

Hint that the Deserialize type is expecting a u64 value.
source§

fn deserialize_u128<V>(self, visitor: V) -> Result<V::Value, Error>
where + V: Visitor<'de>,

Hint that the Deserialize type is expecting an u128 value. Read more
source§

fn deserialize_f32<V>(self, visitor: V) -> Result<V::Value, Error>
where + V: Visitor<'de>,

Hint that the Deserialize type is expecting a f32 value.
source§

fn deserialize_f64<V>(self, visitor: V) -> Result<V::Value, Error>
where + V: Visitor<'de>,

Hint that the Deserialize type is expecting a f64 value.
source§

fn deserialize_bool<V>( self, visitor: V ) -> Result<V::Value, <Self as Deserializer<'de>>::Error>
where - V: Visitor<'de>,

Hint that the Deserialize type is expecting a bool value.
source§

fn deserialize_char<V>( + V: Visitor<'de>,

Hint that the Deserialize type is expecting a bool value.
source§

fn deserialize_char<V>( self, visitor: V ) -> Result<V::Value, <Self as Deserializer<'de>>::Error>
where - V: Visitor<'de>,

Hint that the Deserialize type is expecting a char value.
source§

fn deserialize_str<V>( + V: Visitor<'de>,

Hint that the Deserialize type is expecting a char value.
source§

fn deserialize_str<V>( self, visitor: V ) -> Result<V::Value, <Self as Deserializer<'de>>::Error>
where V: Visitor<'de>,

Hint that the Deserialize type is expecting a string value and does not benefit from taking ownership of buffered data owned by the -Deserializer. Read more
source§

fn deserialize_string<V>( +Deserializer. Read more

source§

fn deserialize_string<V>( self, visitor: V ) -> Result<V::Value, <Self as Deserializer<'de>>::Error>
where V: Visitor<'de>,

Hint that the Deserialize type is expecting a string value and would benefit from taking ownership of buffered data owned by the -Deserializer. Read more
source§

fn deserialize_bytes<V>( +Deserializer. Read more

source§

fn deserialize_bytes<V>( self, visitor: V ) -> Result<V::Value, <Self as Deserializer<'de>>::Error>
where V: Visitor<'de>,

Hint that the Deserialize type is expecting a byte array and does not benefit from taking ownership of buffered data owned by the -Deserializer. Read more
source§

fn deserialize_byte_buf<V>( +Deserializer. Read more

source§

fn deserialize_byte_buf<V>( self, visitor: V ) -> Result<V::Value, <Self as Deserializer<'de>>::Error>
where V: Visitor<'de>,

Hint that the Deserialize type is expecting a byte array and would benefit from taking ownership of buffered data owned by the -Deserializer. Read more
source§

fn deserialize_option<V>( +Deserializer. Read more

source§

fn deserialize_option<V>( self, visitor: V ) -> Result<V::Value, <Self as Deserializer<'de>>::Error>
where - V: Visitor<'de>,

Hint that the Deserialize type is expecting an optional value. Read more
source§

fn deserialize_unit<V>( + V: Visitor<'de>,

Hint that the Deserialize type is expecting an optional value. Read more
source§

fn deserialize_unit<V>( self, visitor: V ) -> Result<V::Value, <Self as Deserializer<'de>>::Error>
where - V: Visitor<'de>,

Hint that the Deserialize type is expecting a unit value.
source§

fn deserialize_unit_struct<V>( + V: Visitor<'de>,

Hint that the Deserialize type is expecting a unit value.
source§

fn deserialize_unit_struct<V>( self, name: &'static str, visitor: V ) -> Result<V::Value, <Self as Deserializer<'de>>::Error>
where V: Visitor<'de>,

Hint that the Deserialize type is expecting a unit struct with a -particular name.
source§

fn deserialize_newtype_struct<V>( +particular name.

source§

fn deserialize_newtype_struct<V>( self, name: &'static str, visitor: V ) -> Result<V::Value, <Self as Deserializer<'de>>::Error>
where V: Visitor<'de>,

Hint that the Deserialize type is expecting a newtype struct with a -particular name.
source§

fn deserialize_seq<V>( +particular name.

source§

fn deserialize_seq<V>( self, visitor: V ) -> Result<V::Value, <Self as Deserializer<'de>>::Error>
where - V: Visitor<'de>,

Hint that the Deserialize type is expecting a sequence of values.
source§

fn deserialize_tuple<V>( + V: Visitor<'de>,

Hint that the Deserialize type is expecting a sequence of values.
source§

fn deserialize_tuple<V>( self, len: usize, visitor: V ) -> Result<V::Value, <Self as Deserializer<'de>>::Error>
where V: Visitor<'de>,

Hint that the Deserialize type is expecting a sequence of values and -knows how many values there are without looking at the serialized data.
source§

fn deserialize_tuple_struct<V>( +knows how many values there are without looking at the serialized data.

source§

fn deserialize_tuple_struct<V>( self, name: &'static str, len: usize, visitor: V ) -> Result<V::Value, <Self as Deserializer<'de>>::Error>
where V: Visitor<'de>,

Hint that the Deserialize type is expecting a tuple struct with a -particular name and number of fields.
source§

fn deserialize_map<V>( +particular name and number of fields.

source§

fn deserialize_map<V>( self, visitor: V ) -> Result<V::Value, <Self as Deserializer<'de>>::Error>
where - V: Visitor<'de>,

Hint that the Deserialize type is expecting a map of key-value pairs.
source§

fn deserialize_struct<V>( + V: Visitor<'de>,

Hint that the Deserialize type is expecting a map of key-value pairs.
source§

fn deserialize_struct<V>( self, name: &'static str, fields: &'static [&'static str], visitor: V ) -> Result<V::Value, <Self as Deserializer<'de>>::Error>
where V: Visitor<'de>,

Hint that the Deserialize type is expecting a struct with a particular -name and fields.
source§

fn deserialize_enum<V>( +name and fields.

source§

fn deserialize_enum<V>( self, name: &'static str, variants: &'static [&'static str], visitor: V ) -> Result<V::Value, <Self as Deserializer<'de>>::Error>
where V: Visitor<'de>,

Hint that the Deserialize type is expecting an enum value with a -particular name and possible variants.
source§

fn deserialize_identifier<V>( +particular name and possible variants.

source§

fn deserialize_identifier<V>( self, visitor: V ) -> Result<V::Value, <Self as Deserializer<'de>>::Error>
where V: Visitor<'de>,

Hint that the Deserialize type is expecting the name of a struct -field or the discriminant of an enum variant.
source§

fn deserialize_ignored_any<V>( +field or the discriminant of an enum variant.

source§

fn deserialize_ignored_any<V>( self, visitor: V ) -> Result<V::Value, <Self as Deserializer<'de>>::Error>
where V: Visitor<'de>,

Hint that the Deserialize type needs to deserialize a value whose type -doesn’t matter because it is ignored. Read more
source§

fn is_human_readable(&self) -> bool

Determine whether Deserialize implementations should expect to -deserialize their human-readable form. Read more
source§

impl Display for Number

source§

fn fmt(&self, formatter: &mut Formatter<'_>) -> Result

Formats the value using the given formatter. Read more
source§

impl From<Number> for Value

source§

fn from(f: Number) -> Self

Convert Number to Value::Number.

+doesn’t matter because it is ignored. Read more
source§

fn is_human_readable(&self) -> bool

Determine whether Deserialize implementations should expect to +deserialize their human-readable form. Read more
source§

impl Display for Number

source§

fn fmt(&self, formatter: &mut Formatter<'_>) -> Result

Formats the value using the given formatter. Read more
source§

impl From<Number> for Value

source§

fn from(f: Number) -> Self

Convert Number to Value::Number.

§Examples
use serde_json::{Number, Value};
 
 let n = Number::from(7);
 let x: Value = n.into();
-
source§

impl From<i16> for Number

source§

fn from(i: i16) -> Self

Converts to this type from the input type.
source§

impl From<i32> for Number

source§

fn from(i: i32) -> Self

Converts to this type from the input type.
source§

impl From<i64> for Number

source§

fn from(i: i64) -> Self

Converts to this type from the input type.
source§

impl From<i8> for Number

source§

fn from(i: i8) -> Self

Converts to this type from the input type.
source§

impl From<isize> for Number

source§

fn from(i: isize) -> Self

Converts to this type from the input type.
source§

impl From<u16> for Number

source§

fn from(u: u16) -> Self

Converts to this type from the input type.
source§

impl From<u32> for Number

source§

fn from(u: u32) -> Self

Converts to this type from the input type.
source§

impl From<u64> for Number

source§

fn from(u: u64) -> Self

Converts to this type from the input type.
source§

impl From<u8> for Number

source§

fn from(u: u8) -> Self

Converts to this type from the input type.
source§

impl From<usize> for Number

source§

fn from(u: usize) -> Self

Converts to this type from the input type.
source§

impl FromStr for Number

§

type Err = Error

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 Number

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 +

source§

impl From<i16> for Number

source§

fn from(i: i16) -> Self

Converts to this type from the input type.
source§

impl From<i32> for Number

source§

fn from(i: i32) -> Self

Converts to this type from the input type.
source§

impl From<i64> for Number

source§

fn from(i: i64) -> Self

Converts to this type from the input type.
source§

impl From<i8> for Number

source§

fn from(i: i8) -> Self

Converts to this type from the input type.
source§

impl From<isize> for Number

source§

fn from(i: isize) -> Self

Converts to this type from the input type.
source§

impl From<u16> for Number

source§

fn from(u: u16) -> Self

Converts to this type from the input type.
source§

impl From<u32> for Number

source§

fn from(u: u32) -> Self

Converts to this type from the input type.
source§

impl From<u64> for Number

source§

fn from(u: u64) -> Self

Converts to this type from the input type.
source§

impl From<u8> for Number

source§

fn from(u: u8) -> Self

Converts to this type from the input type.
source§

impl From<usize> for Number

source§

fn from(u: usize) -> Self

Converts to this type from the input type.
source§

impl FromStr for Number

§

type Err = Error

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 Number

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 PartialEq for Number

source§

fn eq(&self, other: &Number) -> 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 @@ -312,7 +312,11 @@
§Examples
S: Serializer,
Serialize this value into the given Serde serializer. Read more
source§

impl Eq for Number

source§

impl StructuralPartialEq for Number

Auto Trait Implementations§

§

impl Freeze for Number

§

impl RefUnwindSafe for Number

§

impl Send for Number

§

impl Sync for Number

§

impl Unpin for Number

§

impl UnwindSafe for Number

Blanket Implementations§

source§

impl<T> Any for T
where T: 'static + ?Sized,

source§

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more
source§

impl<T> Borrow<T> for T
where T: ?Sized,

source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
source§

impl<T> BorrowMut<T> for T
where - 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.

+ T: ?Sized,
source§

fn borrow_mut(&mut self) -> &mut T

Mutably borrows from an owned value. Read more
source§

impl<Q, K> Equivalent<K> for Q
where + Q: Eq + ?Sized, + K: Borrow<Q> + ?Sized,

source§

fn equivalent(&self, key: &K) -> bool

Checks if this value is equivalent to the given key. Read more
source§

impl<Q, K> Equivalent<K> for Q
where + Q: Eq + ?Sized, + K: Borrow<Q> + ?Sized,

source§

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 T
where U: From<T>,

source§

fn into(self) -> U

Calls U::from(self).

That is, this conversion is whatever the implementation of diff --git a/src-files.js b/src-files.js index 24cc25dbff..a219364105 100644 --- a/src-files.js +++ b/src-files.js @@ -9,10 +9,14 @@ var srcIndex = new Map(JSON.parse('[\ ["diff",["",[],["lib.rs"]]],\ ["env_filter",["",[],["directive.rs","filter.rs","filtered_log.rs","lib.rs","op.rs","parser.rs"]]],\ ["env_logger",["",[["fmt",[["writer",[],["buffer.rs","mod.rs","target.rs"]]],["humantime.rs","mod.rs"]]],["lib.rs","logger.rs"]]],\ +["equivalent",["",[],["lib.rs"]]],\ ["flatten_json_object",["",[],["error.rs","lib.rs"]]],\ +["hashbrown",["",[["external_trait_impls",[],["mod.rs"]],["raw",[],["alloc.rs","bitmask.rs","mod.rs","sse2.rs"]]],["lib.rs","macros.rs","map.rs","scopeguard.rs","set.rs","table.rs"]]],\ ["humantime",["",[],["date.rs","duration.rs","lib.rs","wrapper.rs"]]],\ +["indexmap",["",[["map",[["core",[],["entry.rs","raw.rs","raw_entry_v1.rs"]]],["core.rs","iter.rs","mutable.rs","slice.rs"]],["set",[],["iter.rs","mutable.rs","slice.rs"]]],["arbitrary.rs","lib.rs","macros.rs","map.rs","set.rs","util.rs"]]],\ ["is_terminal_polyfill",["",[],["lib.rs"]]],\ ["itoa",["",[],["lib.rs","udiv128.rs"]]],\ +["json_unflattening",["",[],["errors.rs","flattening.rs","lib.rs","unflattening.rs"]]],\ ["lil_broker",["",[["buckets",[],["mod.rs","querying.rs"]],["database",[["query",[],["get_latest.rs","lookup.rs","lookup_range.rs","mod.rs","tag_filter.rs","write.rs"]]],["mod.rs"]],["datapoint",[],["mod.rs","primatives.rs"]],["types",[],["mod.rs","tag.rs","timestamp.rs"]],["utils",[],["mod.rs"]]],["lib.rs"]]],\ ["lil_helper",["",[],["lib.rs"]]],\ ["lil_quad",["",[["uav",[["hardware",[["act",[],["mod.rs"]],["sense",[],["mod.rs"]]],["mod.rs"]],["quads",[],["mod.rs","test_quad.rs"]],["tasks",[["task_utils",[],["mod.rs","task_echo.rs","task_math.rs"]]],["manager.rs","mod.rs"]]],["mod.rs"]]],["lib.rs"]]],\ @@ -26,12 +30,12 @@ var srcIndex = new Map(JSON.parse('[\ ["quote",["",[],["ext.rs","format.rs","ident_fragment.rs","lib.rs","runtime.rs","spanned.rs","to_tokens.rs"]]],\ ["regex",["",[["regex",[],["bytes.rs","mod.rs","string.rs"]],["regexset",[],["bytes.rs","mod.rs","string.rs"]]],["builders.rs","bytes.rs","error.rs","find_byte.rs","lib.rs"]]],\ ["regex_automata",["",[["dfa",[],["mod.rs","onepass.rs","remapper.rs"]],["hybrid",[],["dfa.rs","error.rs","id.rs","mod.rs","regex.rs","search.rs"]],["meta",[],["error.rs","limited.rs","literal.rs","mod.rs","regex.rs","reverse_inner.rs","stopat.rs","strategy.rs","wrappers.rs"]],["nfa",[["thompson",[],["backtrack.rs","builder.rs","compiler.rs","error.rs","literal_trie.rs","map.rs","mod.rs","nfa.rs","pikevm.rs","range_trie.rs"]]],["mod.rs"]],["util",[["determinize",[],["mod.rs","state.rs"]],["prefilter",[],["aho_corasick.rs","byteset.rs","memchr.rs","memmem.rs","mod.rs","teddy.rs"]],["unicode_data",[],["mod.rs"]]],["alphabet.rs","captures.rs","empty.rs","escape.rs","int.rs","interpolate.rs","iter.rs","lazy.rs","look.rs","memchr.rs","mod.rs","pool.rs","primitives.rs","search.rs","sparse_set.rs","start.rs","syntax.rs","utf8.rs","wire.rs"]]],["lib.rs","macros.rs"]]],\ -["regex_syntax",["",[["ast",[],["mod.rs","parse.rs","print.rs","visitor.rs"]],["hir",[],["interval.rs","literal.rs","mod.rs","print.rs","translate.rs","visitor.rs"]],["unicode_tables",[],["mod.rs"]]],["debug.rs","either.rs","error.rs","lib.rs","parser.rs","rank.rs","unicode.rs","utf8.rs"]]],\ +["regex_syntax",["",[["ast",[],["mod.rs","parse.rs","print.rs","visitor.rs"]],["hir",[],["interval.rs","literal.rs","mod.rs","print.rs","translate.rs","visitor.rs"]],["unicode_tables",[],["age.rs","case_folding_simple.rs","general_category.rs","grapheme_cluster_break.rs","mod.rs","perl_word.rs","property_bool.rs","property_names.rs","property_values.rs","script.rs","script_extension.rs","sentence_break.rs","word_break.rs"]]],["debug.rs","either.rs","error.rs","lib.rs","parser.rs","rank.rs","unicode.rs","utf8.rs"]]],\ ["ryu",["",[["buffer",[],["mod.rs"]],["pretty",[],["exponent.rs","mantissa.rs","mod.rs"]]],["common.rs","d2s.rs","d2s_full_table.rs","d2s_intrinsics.rs","digit_table.rs","f2s.rs","f2s_intrinsics.rs","lib.rs"]]],\ ["serde",["",[["de",[],["format.rs","ignored_any.rs","impls.rs","mod.rs","seed.rs","size_hint.rs","value.rs"]],["private",[],["de.rs","doc.rs","mod.rs","ser.rs"]],["ser",[],["fmt.rs","impls.rs","impossible.rs","mod.rs"]]],["integer128.rs","lib.rs","macros.rs"]]],\ ["serde_derive",["",[["internals",[],["ast.rs","attr.rs","case.rs","check.rs","ctxt.rs","mod.rs","receiver.rs","respan.rs","symbol.rs"]]],["bound.rs","de.rs","dummy.rs","fragment.rs","lib.rs","pretend.rs","ser.rs","this.rs"]]],\ ["serde_json",["",[["io",[],["mod.rs"]],["value",[],["de.rs","from.rs","index.rs","mod.rs","partial_eq.rs","ser.rs"]]],["de.rs","error.rs","iter.rs","lib.rs","macros.rs","map.rs","number.rs","read.rs","ser.rs"]]],\ -["syn",["",[["gen",[],["clone.rs","debug.rs","eq.rs","hash.rs","visit_mut.rs"]]],["attr.rs","bigint.rs","buffer.rs","classify.rs","custom_keyword.rs","custom_punctuation.rs","data.rs","derive.rs","discouraged.rs","drops.rs","error.rs","export.rs","expr.rs","ext.rs","file.rs","fixup.rs","gen_helper.rs","generics.rs","group.rs","ident.rs","item.rs","lib.rs","lifetime.rs","lit.rs","lookahead.rs","mac.rs","macros.rs","meta.rs","op.rs","parse.rs","parse_macro_input.rs","parse_quote.rs","pat.rs","path.rs","precedence.rs","print.rs","punctuated.rs","restriction.rs","sealed.rs","span.rs","spanned.rs","stmt.rs","thread.rs","token.rs","tt.rs","ty.rs","verbatim.rs","whitespace.rs"]]],\ +["syn",["",[["gen",[],["clone.rs","debug.rs","eq.rs","hash.rs","visit_mut.rs"]]],["attr.rs","bigint.rs","buffer.rs","classify.rs","custom_keyword.rs","custom_punctuation.rs","data.rs","derive.rs","discouraged.rs","drops.rs","error.rs","export.rs","expr.rs","ext.rs","file.rs","fixup.rs","generics.rs","group.rs","ident.rs","item.rs","lib.rs","lifetime.rs","lit.rs","lookahead.rs","mac.rs","macros.rs","meta.rs","op.rs","parse.rs","parse_macro_input.rs","parse_quote.rs","pat.rs","path.rs","precedence.rs","print.rs","punctuated.rs","restriction.rs","sealed.rs","span.rs","spanned.rs","stmt.rs","thread.rs","token.rs","tt.rs","ty.rs","verbatim.rs","whitespace.rs"]]],\ ["thiserror",["",[],["aserror.rs","display.rs","lib.rs"]]],\ ["thiserror_impl",["",[],["ast.rs","attr.rs","expand.rs","fmt.rs","generics.rs","lib.rs","prop.rs","span.rs","valid.rs"]]],\ ["tracing",["",[],["dispatcher.rs","field.rs","instrument.rs","level_filters.rs","lib.rs","macros.rs","span.rs","stdlib.rs","subscriber.rs"]]],\ diff --git a/src/anyhow/backtrace.rs.html b/src/anyhow/backtrace.rs.html index 1205bf68a3..f1711601a6 100644 --- a/src/anyhow/backtrace.rs.html +++ b/src/anyhow/backtrace.rs.html @@ -1,4 +1,4 @@ -backtrace.rs - source

$crate::__parse_ensure!(type $stack $bail ($($fuel)*) {($($buf)* $and) $($parse)*} ($($rest)*) $($rest)*) }; + (type $stack:tt ($($bail:tt)*) (~$($fuel:tt)*) {($($buf:tt)*) $($parse:tt)*} $dup:tt unsafe extern - $($rest:tt)*) => { + $crate::__fallback_ensure!($($bail)*) + }; + (type $stack:tt $bail:tt (~$($fuel:tt)*) {($($buf:tt)*) $($parse:tt)*} ($unsafe:tt $(extern $($abi:literal)?)? fn $($dup:tt)*) unsafe $($rest:tt)*) => { $crate::__parse_ensure!(type $stack $bail ($($fuel)*) {($($buf)* $unsafe) $($parse)*} ($($rest)*) $($rest)*) }; - (type $stack:tt ($($bail:tt)*) (~$($fuel:tt)*) {($($buf:tt)*) $($parse:tt)*} $dup:tt extern - $lit:literal $($rest:tt)*) => { + (type $stack:tt ($($bail:tt)*) (~$($fuel:tt)*) {($($buf:tt)*) $($parse:tt)*} $dup:tt extern - $($rest:tt)*) => { $crate::__fallback_ensure!($($bail)*) }; @@ -1337,8 +1385,12 @@

Files

$crate::__parse_ensure!(type (qpath (tpath (arglist (tpath $stack)))) $bail ($($fuel)*) {($($buf)* $langle) $($parse)*} ($($rest)*) $($rest)*) }; - (tpath $stack:tt $bail:tt (~$($fuel:tt)*) {($($buf:tt)*) $($parse:tt)*} ($larrow:tt $lit:literal $($dup:tt)*) <- $($rest:tt)*) => { - $crate::__parse_ensure!(generic (tpath $stack) $bail ($($fuel)*) {($($buf)* $larrow) $($parse)*} ($($rest)*) $($rest)*) + (tpath $stack:tt ($($bail:tt)*) (~$($fuel:tt)*) {($($buf:tt)*) $($parse:tt)*} $dup:tt <- - $($rest:tt)*) => { + $crate::__fallback_ensure!($($bail)*) + }; + + (tpath $stack:tt $bail:tt (~$($fuel:tt)*) {($($buf:tt)*) $($parse:tt)*} ($larrow:tt $($dup:tt)*) <- $lit:literal $($rest:tt)*) => { + $crate::__parse_ensure!(generic (tpath $stack) $bail ($($fuel)*) {($($buf)* $larrow) $($parse)*} ($($dup)*) $($dup)*) }; (tpath $stack:tt $bail:tt (~$($fuel:tt)*) {($($buf:tt)*) $($parse:tt)*} ($colons:tt $langle:tt $($dup:tt)*) :: < $($rest:tt)*) => { @@ -1349,8 +1401,12 @@

Files

$crate::__parse_ensure!(type (qpath (tpath (arglist (tpath $stack)))) $bail ($($fuel)*) {($($buf)* $colons $langle) $($parse)*} ($($rest)*) $($rest)*) }; - (tpath $stack:tt $bail:tt (~$($fuel:tt)*) {($($buf:tt)*) $($parse:tt)*} ($colons:tt $larrow:tt $lit:literal $($dup:tt)*) :: <- $($rest:tt)*) => { - $crate::__parse_ensure!(generic (tpath $stack) $bail ($($fuel)*) {($($buf)* $colons $larrow) $($parse)*} ($($rest)*) $($rest)*) + (tpath $stack:tt ($($bail:tt)*) (~$($fuel:tt)*) {($($buf:tt)*) $($parse:tt)*} $dup:tt :: <- - $($rest:tt)*) => { + $crate::__fallback_ensure!($($bail)*) + }; + + (tpath $stack:tt $bail:tt (~$($fuel:tt)*) {($($buf:tt)*) $($parse:tt)*} ($colons:tt $larrow:tt $($dup:tt)*) :: <- $lit:literal $($rest:tt)*) => { + $crate::__parse_ensure!(generic (tpath $stack) $bail ($($fuel)*) {($($buf)* $colons $larrow) $($parse)*} ($($dup)*) $($dup)*) }; (tpath $stack:tt $bail:tt (~$($fuel:tt)*) {($($buf:tt)*) $($parse:tt)*} ($colons:tt $ident:tt $($dup:tt)*) :: $i:ident $($rest:tt)*) => { @@ -1435,8 +1491,16 @@

Files

$crate::__parse_ensure!($pop (split $stack) $bail ($($fuel)*) {($($buf)*) $($parse)*} ($rangle $($rest)*) $rangle $($rest)*) }; - (generic $stack:tt $bail:tt (~$($fuel:tt)*) {($($buf:tt)*) $($parse:tt)*} ($neg:tt $lit:literal $($dup:tt)*) - $($rest:tt)*) => { - $crate::__parse_ensure!(generic $stack $bail ($($fuel)*) {($($buf)* $neg) $($parse)*} ($($rest)*) $($rest)*) + (generic $stack:tt ($($bail:tt)*) (~$($fuel:tt)*) {($($buf:tt)*) $($parse:tt)*} $dup:tt - - $($rest:tt)*) => { + $crate::__fallback_ensure!($($bail)*) + }; + + (generic $stack:tt $bail:tt (~$($fuel:tt)*) {($($buf:tt)*) $($parse:tt)*} ($neg:tt $($dup:tt)*) - $lit:literal $($rest:tt)*) => { + $crate::__parse_ensure!(generic $stack $bail ($($fuel)*) {($($buf)* $neg) $($parse)*} ($($dup)*) $($dup)*) + }; + + (generic $stack:tt ($($bail:tt)*) (~$($fuel:tt)*) {($($buf:tt)*) $($parse:tt)*} $dup:tt - $($rest:tt)*) => { + $crate::__fallback_ensure!($($bail)*) }; (generic $stack:tt $bail:tt (~$($fuel:tt)*) {($($buf:tt)*) $($parse:tt)*} ($literal:tt $($dup:tt)*) $lit:literal $($rest:tt)*) => { @@ -1501,8 +1565,16 @@

Files

$crate::__parse_ensure!(pat $stack $bail ($($fuel)*) {($($buf)* $at) $($parse)*} ($($rest)*) $($rest)*) }; - (pat $stack:tt $bail:tt (~$($fuel:tt)*) {($($buf:tt)*) $($parse:tt)*} ($neg:tt $lit:literal $($dup:tt)*) - $($rest:tt)*) => { - $crate::__parse_ensure!(pat $stack $bail ($($fuel)*) {($($buf)* $neg) $($parse)*} ($($rest)*) $($rest)*) + (pat $stack:tt ($($bail:tt)*) (~$($fuel:tt)*) {($($buf:tt)*) $($parse:tt)*} $dup:tt - - $($rest:tt)*) => { + $crate::__fallback_ensure!($($bail)*) + }; + + (pat $stack:tt $bail:tt (~$($fuel:tt)*) {($($buf:tt)*) $($parse:tt)*} ($neg:tt $($dup:tt)*) - $lit:literal $($rest:tt)*) => { + $crate::__parse_ensure!(pat $stack $bail ($($fuel)*) {($($buf)* $neg) $($parse)*} ($($dup)*) $($dup)*) + }; + + (pat $stack:tt ($($bail:tt)*) (~$($fuel:tt)*) {($($buf:tt)*) $($parse:tt)*} $dup:tt - $($rest:tt)*) => { + $crate::__fallback_ensure!($($bail)*) }; (pat $stack:tt $bail:tt (~$($fuel:tt)*) {($($buf:tt)*) $($parse:tt)*} ($literal:tt $($dup:tt)*) $lit:literal $($rest:tt)*) => { diff --git a/src/anyhow/error.rs.html b/src/anyhow/error.rs.html index bb99e1f9ca..be4ffdba49 100644 --- a/src/anyhow/error.rs.html +++ b/src/anyhow/error.rs.html @@ -1,4 +1,4 @@ -error.rs - source
let latest_value = bucket.get_earliest(); assert_eq!(latest_value, None); - for i in 0..11{ + for i in 0..11 { timestamp = Timestamp::from_seconds(i as f32); bucket.add_primative(timestamp, (i as f64).into()); } @@ -311,7 +327,7 @@

Files

} #[test] - fn test_bucket_lookup(){ + fn test_bucket_lookup() { let mut bucket = Bucket::new("test_topic"); let mut timestamp = Timestamp::zero(); @@ -319,7 +335,7 @@

Files

let latest_value = bucket.lookup(Timestamp::from_seconds(0.0), false); assert_eq!(latest_value, None); - for i in 0..11{ + for i in 0..11 { timestamp = Timestamp::from_seconds(i as f32); bucket.add_primative(timestamp, (i as f64).into()); } @@ -344,25 +360,28 @@

Files

} #[test] - fn test_bucket_range(){ + fn test_bucket_range() { let mut bucket = Bucket::new("test_topic"); let mut timestamp = Timestamp::zero(); // Verify latest is none at start - let latest_value = bucket.range(Timestamp::from_seconds(0.0), Timestamp::from_seconds(10.0)); + let latest_value = + bucket.range(Timestamp::from_seconds(0.0), Timestamp::from_seconds(10.0)); assert_eq!(latest_value.len(), 0); - for i in 0..11{ + for i in 0..11 { timestamp = Timestamp::from_seconds(i as f32); bucket.add_primative(timestamp, (i as f64).into()); } - let latest_value = bucket.range(Timestamp::from_seconds(0.0), Timestamp::from_seconds(10.0)); + let latest_value = + bucket.range(Timestamp::from_seconds(0.0), Timestamp::from_seconds(10.0)); // Check that latest value is now populated assert_eq!(latest_value.len(), 10); - for (i, dp) in latest_value.iter().enumerate(){ + for (i, dp) in latest_value.iter().enumerate() { assert_eq!(dp.timestamp, Timestamp::from_seconds(i as f32)); assert_eq!(dp.data, Primatives::Number(i as f64)); } } -}
\ No newline at end of file +} + \ No newline at end of file diff --git a/src/lil_broker/database/mod.rs.html b/src/lil_broker/database/mod.rs.html index 2338b0a452..434a576506 100644 --- a/src/lil_broker/database/mod.rs.html +++ b/src/lil_broker/database/mod.rs.html @@ -58,63 +58,62 @@

Files

56 57 58 -59 
mod query;
-use std::collections::BTreeMap;
-use tracing::{info, error, debug};
 pub use query::*;
+use std::collections::BTreeMap;
+use tracing::{debug, error, info};
 
 use crate::{Bucket, Tag};
 
-
-pub struct Database{
-    pub buckets: BTreeMap<String, Bucket>
+pub struct Database {
+    pub buckets: BTreeMap<String, Bucket>,
 }
 
-
-impl Database{
-    pub fn new() -> Database{
-        Database{
-            buckets: BTreeMap::new()
+impl Database {
+    pub fn new() -> Database {
+        Database {
+            buckets: BTreeMap::new(),
         }
     }
-    pub fn get_keys(&self) -> Vec<String>{
+    pub fn get_keys(&self) -> Vec<String> {
         self.buckets.keys().cloned().collect()
     }
-    pub fn query(&mut self, query: QueryCommand) -> Result<QueryResponse, String>{
-       match query{
-           QueryCommand::GetLatest(query) => self.query_get_latest(query),
-           QueryCommand::Write(query) => self.query_write(query),
-              QueryCommand::LookupRange(query) => self.query_lookup_range(query),
-           _ => Err("Query not implemented".to_string())
-       }
-
+    pub fn query(&mut self, query: QueryCommand) -> Result<QueryResponse, String> {
+        match query {
+            QueryCommand::GetLatest(query) => self.query_get_latest(query),
+            QueryCommand::Write(query) => self.query_write(query),
+            QueryCommand::LookupRange(query) => self.query_lookup_range(query),
+            _ => Err("Query not implemented".to_string()),
+        }
     }
 
-    pub fn add_tag_to_bucket(&mut self, bucket_name: &str, tag: Tag){
-
+    pub fn add_tag_to_bucket(&mut self, bucket_name: &str, tag: Tag) {
         //Create a new bucket if it doesn't exist
-        if !self.buckets.contains_key(bucket_name){
+        if !self.buckets.contains_key(bucket_name) {
             info!("Bucket: {} not found, creating new bucket", bucket_name);
             self.new_bucket(bucket_name);
         }
 
-        if let Some(bucket) = self.buckets.get_mut(bucket_name){
+        if let Some(bucket) = self.buckets.get_mut(bucket_name) {
             bucket.add_tag(tag);
-        }else{
+        } else {
             error!("Bucket: {} not found", bucket_name);
         }
     }
 
-    pub fn query_batch(&mut self, queries: Vec<QueryCommand>) -> Result<Vec<QueryResponse>, String>{
+    pub fn query_batch(
+        &mut self,
+        queries: Vec<QueryCommand>,
+    ) -> Result<Vec<QueryResponse>, String> {
         let mut responses = Vec::new();
-        for query in queries{
+        for query in queries {
             responses.push(self.query(query)?);
         }
         Ok(responses)
     }
 
-    pub fn new_bucket(&mut self, name: &str){
+    pub fn new_bucket(&mut self, name: &str) {
         self.buckets.insert(name.to_string(), Bucket::new(name));
     }
-}
\ No newline at end of file +} + \ No newline at end of file diff --git a/src/lil_broker/database/query/get_latest.rs.html b/src/lil_broker/database/query/get_latest.rs.html index 320cb253f7..7d826d0674 100644 --- a/src/lil_broker/database/query/get_latest.rs.html +++ b/src/lil_broker/database/query/get_latest.rs.html @@ -300,6 +300,62 @@

Files

298 299 300 +301 +302 +303 +304 +305 +306 +307 +308 +309 +310 +311 +312 +313 +314 +315 +316 +317 +318 +319 +320 +321 +322 +323 +324 +325 +326 +327 +328 +329 +330 +331 +332 +333 +334 +335 +336 +337 +338 +339 +340 +341 +342 +343 +344 +345 +346 +347 +348 +349 +350 +351 +352 +353 +354 +355 +356 
use crate::{Database, QueryCommand, QueryResponse};
 
 use super::tag_filter::TagFilter;
@@ -328,7 +384,6 @@ 
Files

     }
 }
 
-
 impl From<QueryCommand> for GetLatestQuery {
     fn from(command: QueryCommand) -> GetLatestQuery {
         match command {
@@ -428,6 +483,7 @@ 
Files

 mod tests {
     use crate::{Primatives, Tag, Timestamp, WriteQuery};
     use pretty_assertions::{assert_eq, assert_ne};
+    use serde_json::json;
 
     use super::*;
 
@@ -454,6 +510,58 @@ 
Files

         assert_eq!(data.unwrap().data, Primatives::Number(7.0));
     }
 
+    #[test]
+    fn test_get_latest_json_struct() {
+        env_logger::init();
+        let mut db = Database::new();
+
+        #[derive(Debug, Clone, PartialEq, serde::Deserialize, serde::Serialize)]
+        struct TestData2 {
+            d: f64,
+            e: bool,
+            f: String,
+        }
+        #[derive(Debug, Clone, PartialEq, serde::Deserialize, serde::Serialize)]
+        struct TestData {
+            a: f64,
+            b: bool,
+            c: String,
+            //#[serde(flatten)]
+            d: TestData2,
+        }
+
+        let data = TestData {
+            a: 7.0,
+            b: true,
+            c: "test".to_string(),
+            d: TestData2 {
+                d: 7.0,
+                e: true,
+                f: "test".to_string(),
+            },
+        };
+
+        let queries =
+            WriteQuery::from_json_batch(json!(data), Timestamp::new(0), "test".to_string());
+
+        let _write_res = db.query_batch(queries).unwrap();
+
+        let read_query = GetLatestQuery {
+            topics: vec!["test".into()],
+            ack_topics: Vec::new(),
+            tag_filters: Vec::new(),
+        };
+        let read_res = db.query(read_query.into()).unwrap();
+
+        let json_out = read_res.to_json("test/");
+        info!(
+            "Json Out: {}",
+            serde_json::to_string_pretty(&json_out).unwrap()
+        );
+        let struct_out = serde_json::from_value::<TestData>(json_out).unwrap();
+        assert_eq!(struct_out, data);
+    }
+
     #[test]
     fn test_get_latest_wildcard() {
         let mut db = Database::new();
@@ -551,22 +659,26 @@ 
Files

                 "test/a/element_1".into(),
                 1.0.into(),
                 Timestamp::from_seconds(1.0),
-            ).into(),
+            )
+            .into(),
             WriteQuery::new(
                 "test/a/element_2".into(),
                 2.0.into(),
                 Timestamp::from_seconds(1.0),
-            ).into(),
+            )
+            .into(),
             WriteQuery::new(
                 "test/a/element_3".into(),
                 3.0.into(),
                 Timestamp::from_seconds(1.0),
-            ).into(),
+            )
+            .into(),
             WriteQuery::new(
                 "test/a/element_4".into(),
                 4.0.into(),
                 Timestamp::from_seconds(1.0),
-            ).into(),
+            )
+            .into(),
             WriteQuery::new(
                 "test/a/parent".into(),
                 Primatives::ArrayRef(vec![
@@ -587,8 +699,8 @@ 
Files

         };
         let read_res = db.query(read_query.into()).unwrap();
         debug!("Read Response 1: {:#?}", read_res);
-       // assert_eq!(read_res.metadata.n_results, 4);
-       // assert_eq!(read_res.data.len(), 4);
+        // assert_eq!(read_res.metadata.n_results, 4);
+        // assert_eq!(read_res.data.len(), 4);
         assert_eq!(
             vec![
                 "test/a/element_1",
diff --git a/src/lil_broker/database/query/lookup.rs.html b/src/lil_broker/database/query/lookup.rs.html
index 05bc1dd99a..cbd8b8d815 100644
--- a/src/lil_broker/database/query/lookup.rs.html
+++ b/src/lil_broker/database/query/lookup.rs.html
@@ -29,7 +29,7 @@ 
Files

 use super::tag_filter::TagFilter;
 
 #[derive(Debug, Clone)]
-pub struct LookupQuery{
+pub struct LookupQuery {
     pub topics: Vec<String>,
     pub timestamp: Timestamp,
     pub ack_topics: Vec<String>,
@@ -37,9 +37,9 @@ 
Files

     pub direction_before: bool,
 }
 
-impl Default for LookupQuery{
-    fn default() -> Self{
-        LookupQuery{
+impl Default for LookupQuery {
+    fn default() -> Self {
+        LookupQuery {
             topics: Vec::new(),
             timestamp: Timestamp::zero(),
             ack_topics: Vec::new(),
@@ -47,4 +47,5 @@ 
Files

             direction_before: true,
         }
     }
-}
\ No newline at end of file +} + \ No newline at end of file diff --git a/src/lil_broker/database/query/lookup_range.rs.html b/src/lil_broker/database/query/lookup_range.rs.html index 1570dec231..c2e974fe55 100644 --- a/src/lil_broker/database/query/lookup_range.rs.html +++ b/src/lil_broker/database/query/lookup_range.rs.html @@ -163,6 +163,79 @@

Files

161 162 163 +164 +165 +166 +167 +168 +169 +170 +171 +172 +173 +174 +175 +176 +177 +178 +179 +180 +181 +182 +183 +184 +185 +186 +187 +188 +189 +190 +191 +192 +193 +194 +195 +196 +197 +198 +199 +200 +201 +202 +203 +204 +205 +206 +207 +208 +209 +210 +211 +212 +213 +214 +215 +216 +217 +218 +219 +220 +221 +222 +223 +224 +225 +226 +227 +228 +229 +230 +231 +232 +233 +234 +235 +236 
use super::tag_filter::TagFilter;
 use crate::{Database, QueryCommand, QueryResponse, Timestamp};
 use tracing::debug;
@@ -240,9 +313,15 @@ 
Files

                     if passed_filters {
                         // Insert if not found else add to the existing data
                         if response.data.contains_key(&bucket_key) {
-                            response.data.get_mut(&bucket_key).unwrap().push(data_point.clone());
+                            response
+                                .data
+                                .get_mut(&bucket_key)
+                                .unwrap()
+                                .push(data_point.clone());
                         } else {
-                            response.data.insert(bucket_key.clone(), vec![data_point.clone()]);
+                            response
+                                .data
+                                .insert(bucket_key.clone(), vec![data_point.clone()]);
                         }
                         response.metadata.n_results += 1;
                     }
@@ -255,6 +334,9 @@ 
Files

 
 #[cfg(test)]
 mod tests {
+    use serde_json::json;
+    use tracing::info;
+
     use crate::{Primatives, Tag, Timestamp, WriteQuery};
 
     use super::*;
@@ -262,7 +344,11 @@ 
Files

     pub fn generate_time_data(name: &str) -> Vec<QueryCommand> {
         let mut queries = Vec::new();
         for i in 0..50 {
-            let query = WriteQuery::new(name.into(), (i as f64).into(), Timestamp::from_seconds(i as f32));
+            let query = WriteQuery::new(
+                name.into(),
+                (i as f64).into(),
+                Timestamp::from_seconds(i as f32),
+            );
             queries.push(query.into());
         }
         queries
@@ -275,8 +361,7 @@ 
Files

 
         let all = vec![topic_a_queries, topic_b_queries].concat();
 
-        db.query_batch(all)
-            .unwrap();
+        db.query_batch(all).unwrap();
 
         db
     }
@@ -298,8 +383,70 @@ 
Files

         assert_eq!(read_res.metadata.n_results, 4);
         let topic_a = read_res.data.get("test/a").unwrap();
         assert_eq!(topic_a.len(), 4);
-        
+    }
+
+    #[test]
+    fn test_get_latest_json_struct() {
+        env_logger::init();
+        let mut db = Database::new();
+
+        #[derive(Debug, Clone, PartialEq, serde::Deserialize, serde::Serialize)]
+        struct TestData2 {
+            d: f64,
+            e: bool,
+            f: String,
+        }
+        #[derive(Debug, Clone, PartialEq, serde::Deserialize, serde::Serialize)]
+        struct TestData {
+            a: f64,
+            b: bool,
+            c: String,
+            //#[serde(flatten)]
+            d: TestData2,
+        }
+
+        let mut data = TestData {
+            a: 7.0,
+            b: true,
+            c: "test".to_string(),
+            d: TestData2 {
+                d: 7.0,
+                e: true,
+                f: "test".to_string(),
+            },
+        };
+
+        let queries = WriteQuery::from_json_batch(
+            json!(data),
+            Timestamp::from_seconds(5.0),
+            "test".to_string(),
+        );
+
+        let _write_res = db.query_batch(queries).unwrap();
+        data.a = 8.0;
+        let queries = WriteQuery::from_json_batch(
+            json!(data),
+            Timestamp::from_seconds(6.0),
+            "test".to_string(),
+        );
 
+        let _write_res = db.query_batch(queries).unwrap();
+
+        let read_query = LookupRangeQuery {
+            topics: vec!["test".into()],
+            ack_topics: Vec::new(),
+            tag_filters: Vec::new(),
+            timestamp_start: Timestamp::from_seconds(3.0),
+            timestamp_end: Timestamp::from_seconds(7.0),
+            direction_before: true,
+        };
+        let read_res = db.query(read_query.into()).unwrap();
+
+        let json_out = read_res.to_json_timestamped("test/");
+        info!(
+            "Json Out: {}",
+            serde_json::to_string_pretty(&json_out).unwrap()
+        );
     }
 
     #[test]
@@ -322,8 +469,7 @@ 
Files

         let topic_a = read_res.data.get("test/a").unwrap();
         assert_eq!(topic_a.len(), 4);
         let topic_b = read_res.data.get("test/b").unwrap();
-        assert_eq!(topic_b.len(), 4);        
-
+        assert_eq!(topic_b.len(), 4);
     }
 }
\ No newline at end of file diff --git a/src/lil_broker/database/query/mod.rs.html b/src/lil_broker/database/query/mod.rs.html index 921334c286..fe1507e306 100644 --- a/src/lil_broker/database/query/mod.rs.html +++ b/src/lil_broker/database/query/mod.rs.html @@ -53,56 +53,139 @@

Files

51 52 53 +54 +55 +56 +57 +58 +59 +60 +61 +62 +63 +64 +65 +66 +67 +68 +69 +70 +71 +72 +73 +74 +75 +76 +77 +78 +79 +80 +81 +82 +83 +84 +85 +86 +87 +88 +89 +90 +91 +92 +93 +94 
use std::collections::BTreeMap;
 
 use crate::DataPoint;
 
-
-
-mod tag_filter;
+mod get_latest;
 mod lookup;
 mod lookup_range;
-mod get_latest;
+mod tag_filter;
 mod write;
 
-pub use tag_filter::*;
+pub use get_latest::*;
+use json_unflattening::unflattening::unflatten;
 pub use lookup::*;
 pub use lookup_range::*;
-pub use get_latest::*;
+use serde_json::{json, Value};
+pub use tag_filter::*;
 
 pub use write::*;
 #[derive(Debug, Clone)]
-pub enum QueryCommand{
+pub enum QueryCommand {
     GetLatest(GetLatestQuery),
     Lookup(LookupQuery),
     LookupRange(LookupRangeQuery),
     Write(WriteQuery),
 }
 #[derive(Debug, Clone)]
-pub struct QueryResponseMetadata{
+pub struct QueryResponseMetadata {
     pub n_results: usize,
     pub was_successful: bool,
 }
 #[derive(Debug, Clone)]
-pub struct QueryResponse{
+pub struct QueryResponse {
     pub data: BTreeMap<String, Vec<DataPoint>>,
     pub metadata: QueryResponseMetadata,
 }
 
-impl QueryResponse{
-    pub fn new() -> QueryResponse{
-        QueryResponse{
+impl QueryResponse {
+    pub fn new() -> QueryResponse {
+        QueryResponse {
             data: BTreeMap::new(),
-            metadata: QueryResponseMetadata{
+            metadata: QueryResponseMetadata {
                 n_results: 0,
                 was_successful: false,
+            },
+        }
+    }
+
+    pub fn to_json(&self, prefix: &str) -> Value {
+        let mut values: serde_json::Map<String, Value> = serde_json::Map::new();
+        for (key, data) in self.data.iter() {
+            let mut data_points = Vec::new();
+            for point in data.iter() {
+                data_points.push(point.data.to_value());
             }
+            // strip prefix
+            let key = key.strip_prefix(prefix).unwrap_or(key);
+            values.insert(key.to_string(), json!(data_points.last()));
         }
+        // Strip Prefix
+
+        let unflattened_json = unflatten(&values).unwrap();
+        unflattened_json
+    }
+
+    pub fn to_json_timestamped(&self, prefix: &str) -> Value {
+        let mut values: serde_json::Map<String, Value> = serde_json::Map::new();
+        for (key, data) in self.data.iter() {
+            let mut data_points = Vec::new();
+            for point in data.iter() {
+                data_points.push(point.data.to_value());
+            }
+            // strip prefix
+            let key = key.strip_prefix(prefix).unwrap_or(key);
+
+            let mut data_points = Vec::new();
+            for point in data.iter() {
+                data_points.push(json!({
+                    point.timestamp.tick_ms.to_string(): point.data.to_value()
+                }));
+            }
+            values.insert(key.to_string(), json!(data_points));
+        }
+        // Strip Prefix
+
+        let unflattened_json = unflatten(&values).unwrap();
+        unflattened_json
     }
 }
 
-impl Default for QueryResponse{
-    fn default() -> Self{
+impl Default for QueryResponse {
+    fn default() -> Self {
         QueryResponse::new()
     }
-}
\ No newline at end of file +} + \ No newline at end of file diff --git a/src/lil_broker/database/query/tag_filter.rs.html b/src/lil_broker/database/query/tag_filter.rs.html index 03e8482032..9252017340 100644 --- a/src/lil_broker/database/query/tag_filter.rs.html +++ b/src/lil_broker/database/query/tag_filter.rs.html @@ -53,49 +53,49 @@

Files

51 52 
use crate::{DataPoint, Tag};
-#[derive(Debug,Clone)]
-pub enum TagFilterMode{
+#[derive(Debug, Clone)]
+pub enum TagFilterMode {
     Include,
     Exclude,
     ExcludeWithValue,
-    IncludeWithValue
+    IncludeWithValue,
 }
 #[derive(Debug, Clone)]
-pub struct TagFilter{
+pub struct TagFilter {
     pub tag: Tag,
-    pub mode: TagFilterMode
+    pub mode: TagFilterMode,
 }
 
-impl TagFilter{
-    pub fn new(tag: Tag) -> TagFilter{
-        TagFilter{
+impl TagFilter {
+    pub fn new(tag: Tag) -> TagFilter {
+        TagFilter {
             tag,
-            mode: TagFilterMode::Include
+            mode: TagFilterMode::Include,
         }
     }
 
-    pub fn exclude(mut self) -> Self{
+    pub fn exclude(mut self) -> Self {
         self.mode = TagFilterMode::Exclude;
         self
     }
 
-    pub fn exclude_with_value(mut self) -> Self{
+    pub fn exclude_with_value(mut self) -> Self {
         self.mode = TagFilterMode::ExcludeWithValue;
         self
     }
 
-    pub fn include(mut self) -> Self{
+    pub fn include(mut self) -> Self {
         self.mode = TagFilterMode::Include;
         self
     }
 
-    pub fn include_with_value(mut self) -> Self{
+    pub fn include_with_value(mut self) -> Self {
         self.mode = TagFilterMode::IncludeWithValue;
         self
     }
 
-    pub fn is_valid(&self, datapoint: &DataPoint) -> bool{
-        match self.mode{
+    pub fn is_valid(&self, datapoint: &DataPoint) -> bool {
+        match self.mode {
             TagFilterMode::Include => datapoint.tags.contains(&self.tag),
             TagFilterMode::Exclude => !datapoint.tags.contains(&self.tag),
             // TODO: Implement value checking [vfp//2021-09-29]
@@ -103,4 +103,5 @@ 
Files

             TagFilterMode::ExcludeWithValue => !datapoint.tags.contains(&self.tag),
         }
     }
-}
\ No newline at end of file +} + \ No newline at end of file diff --git a/src/lil_broker/database/query/write.rs.html b/src/lil_broker/database/query/write.rs.html index 6c1096b1ca..4688c61f97 100644 --- a/src/lil_broker/database/query/write.rs.html +++ b/src/lil_broker/database/query/write.rs.html @@ -142,9 +142,15 @@

Files

140 141 142 +143 +144 +145 +146 
use crate::{Bucket, DataPoint, Database, Primatives, QueryCommand, QueryResponse, Tag, Timestamp};
 
 use flatten_json_object::{ArrayFormatting, Flattener};
+use json_unflattening::flattening::flatten;
+use serde::de::value;
 use serde_json::Value;
 use tracing::{error, info};
 #[derive(Debug, Clone)]
@@ -165,31 +171,18 @@ 
Files

         }
     }
 
-    pub fn from_json_batch(
-        json_str: String,
-        timestamp: Timestamp,
-        prefix: String,
-    ) -> Vec<WriteQuery> {
+    pub fn from_json_batch(json: Value, timestamp: Timestamp, prefix: String) -> Vec<QueryCommand> {
         let mut queries = Vec::new();
-        let v: Value = serde_json::from_str(json_str.as_str()).unwrap();
-        let out = Flattener::new()
-            .set_key_separator("/")
-            .set_preserve_empty_arrays(false)
-            .set_preserve_empty_objects(false)
-            .flatten(&v)
-            .unwrap();
 
-        if let serde_json::Value::Object(out) = out {
-            for (key, val) in out.iter() {
-                if let Some(supported_type) = Primatives::from_value(val.clone()) {
-                    // can only be 1 unique item per mapped value.
-                    let write_query =
-                        WriteQuery::new(format!("{}/{}", prefix, key), supported_type, timestamp);
-                    queries.push(write_query);
-                }
+        let out = flatten(&json).unwrap();
+
+        for (key, val) in out.iter() {
+            if let Some(supported_type) = Primatives::from_value(val.clone()) {
+                // can only be 1 unique item per mapped value.
+                let write_query =
+                    WriteQuery::new(format!("{}/{}", prefix, key), supported_type, timestamp);
+                queries.push(write_query.into());
             }
-        } else {
-            error!("Failed to parse JSON");
         }
         queries
     }
@@ -241,6 +234,7 @@ 
Files

 mod tests {
     use super::*;
     use pretty_assertions::assert_eq;
+    use serde_json::json;
     #[test]
     fn test_write_query_basic() {
         let mut db = Database::new();
@@ -258,30 +252,44 @@ 
Files

 
     #[test]
     fn test_write_query_from_json_simple() {
-        let json = r#"{"test": 7.0}"#.to_string();
+        let json = json!({
+            "test": 7.0
+        });
         let queries = WriteQuery::from_json_batch(json, Timestamp::new(0), "test".to_string());
         assert_eq!(queries.len(), 1);
-        assert_eq!(queries[0].topic, "test/test");
-        assert_eq!(queries[0].data, Primatives::Number(7.0));
+        match &queries[0] {
+            QueryCommand::Write(query) => {
+                assert_eq!(query.topic, "test/test");
+                assert_eq!(query.data, Primatives::Number(7.0));
+            }
+            _ => panic!("Not a WriteQuery"),
+        }
     }
 
     #[test]
     fn test_write_query_from_json_complex() {
         env_logger::init();
-        let json = r#"
-        {"test": 7.0, 
-        "test2": "test", 
-        "test3": [1,2,3], 
-        "test4": [1.0, 2.0, 3.0], 
-        "test5": [true, false, true],
-        "test_nested": {"test6": 7.0, "test7": "test"}
-    }"#.to_string();
+
+        let json = json!(
+        {
+            "test": 7.0,
+            "test2": "test",
+            "test3": [1,2,3],
+            "test4": [1.0, 2.0, 3.0],
+            "test5": [true, false, true],
+            "test_nested": {"test6": 7.0, "test7": "test"}
+        });
         let queries = WriteQuery::from_json_batch(json, Timestamp::new(0), "test".to_string());
         info!("{:#?}", queries);
         assert_eq!(queries.len(), 13);
-     
-        assert_eq!(queries[0].topic, "test/test");
-        assert_eq!(queries[0].data, Primatives::Number(7.0));
+
+        match &queries[0] {
+            QueryCommand::Write(query) => {
+                assert_eq!(query.topic, "test/test");
+                assert_eq!(query.data, Primatives::Number(7.0));
+            }
+            _ => panic!("Not a WriteQuery"),
+        }
     }
 }
\ No newline at end of file diff --git a/src/lil_broker/datapoint/mod.rs.html b/src/lil_broker/datapoint/mod.rs.html index df24b300f2..54a743d6ef 100644 --- a/src/lil_broker/datapoint/mod.rs.html +++ b/src/lil_broker/datapoint/mod.rs.html @@ -66,7 +66,6 @@

Files

64 65 66 -67 
mod primatives;
 use std::collections::BTreeSet;
 
@@ -79,38 +78,38 @@ 
Files

 /// - timestamp: The time the data point was recorded
 /// - data: The data point itself
 /// - tags: A set of tags associated with the data point
-pub struct DataPoint{
+pub struct DataPoint {
     pub timestamp: Timestamp,
     pub data: Primatives,
-    pub tags: BTreeSet<Tag> // Set of tags hashed by name (value is not checked and should only be read from the tag)
+    pub tags: BTreeSet<Tag>, // Set of tags hashed by name (value is not checked and should only be read from the tag)
 }
 
-impl DataPoint{
-    pub fn new(timestamp: Timestamp, data: Primatives) -> DataPoint{
-        DataPoint{
+impl DataPoint {
+    pub fn new(timestamp: Timestamp, data: Primatives) -> DataPoint {
+        DataPoint {
             timestamp,
             data,
-            tags: BTreeSet::new()
+            tags: BTreeSet::new(),
         }
     }
     ///Builder function to add a tag to the DataPoint
-    pub fn tag(mut self, tag: Tag) -> Self{
+    pub fn tag(mut self, tag: Tag) -> Self {
         self.tags.insert(tag);
         self
     }
 
-    pub fn add_tag(&mut self, tag: Tag){
+    pub fn add_tag(&mut self, tag: Tag) {
         self.tags.insert(tag);
     }
 }
 
 #[cfg(test)]
-mod tests{
+mod tests {
     use super::*;
     use crate::types::Tag;
 
     #[test]
-    fn test_datapoint_new(){
+    fn test_datapoint_new() {
         let timestamp = Timestamp::new(0);
         let data = Primatives::Number(0.0);
         let dp = DataPoint::new(timestamp, data.clone());
@@ -121,7 +120,7 @@ 
Files

     }
 
     #[test]
-    fn test_datapoint_new_with_tags(){
+    fn test_datapoint_new_with_tags() {
         let timestamp = Timestamp::new(0);
         let data = Primatives::Number(0.0);
         let dp = DataPoint::new(timestamp, data.clone()).tag("test".into());
@@ -132,5 +131,5 @@ 
Files

         assert_eq!(dp.tags.iter().next().unwrap().name, "test");
         assert_eq!(dp.tags.iter().next().unwrap().value, None);
     }
-    
-}
\ No newline at end of file +} + \ No newline at end of file diff --git a/src/lil_broker/datapoint/primatives.rs.html b/src/lil_broker/datapoint/primatives.rs.html index 6fa5869ee8..a57624a4ea 100644 --- a/src/lil_broker/datapoint/primatives.rs.html +++ b/src/lil_broker/datapoint/primatives.rs.html @@ -142,19 +142,48 @@

Files

140 141 142 -
use serde_json::Value;
+143
+144
+145
+146
+147
+148
+149
+150
+151
+152
+153
+154
+155
+156
+157
+158
+159
+160
+161
+162
+163
+164
+165
+166
+167
+168
+169
+170
+
use serde::{Deserialize, Serialize};
+use serde_json::{json, Value};
 
-#[derive(Debug, PartialEq,Clone)]
-pub enum Primatives{
+#[derive(Debug, PartialEq, Clone, Serialize, Deserialize)]
+pub enum Primatives {
     Number(f64),
     String(String),
     Boolean(bool),
     StringArray(Vec<String>),
     NumberArray(Vec<f64>),
     BooleanArray(Vec<bool>),
-    ArrayRef(Vec<String>)
+    ArrayRef(Vec<String>),
 }
-impl Primatives{
+impl Primatives {
     pub(crate) fn from_value(val: Value) -> Option<Primatives> {
         match val {
             Value::String(s) => Some(Primatives::String(s)),
@@ -163,14 +192,23 @@ 
Files

             Value::Array(arr) => {
                 // Here we check the first element to guess the array type
                 if let Some(first) = arr.first() {
-                    if first.is_string() {
-                        let maybe_string_array: Option<Vec<String>> = arr.into_iter().map(|v| v.as_str().map(String::from)).collect();
+                    // Check if first can be a float
+
+                    if first.is_string() {
+                        let maybe_string_array: Option<Vec<String>> = arr
+                            .into_iter()
+                            .map(|v| v.as_str().map(String::from))
+                            .collect();
                         maybe_string_array.map(Primatives::StringArray)
                     } else if first.is_number() {
-                        let maybe_number_array: Option<Vec<f64>> = arr.into_iter().map(|v| v.as_f64().map(|n| n as f64)).collect();
+                        let maybe_number_array: Option<Vec<f64>> = arr
+                            .into_iter()
+                            .map(|v| v.as_f64().map(|n| n as f64))
+                            .collect();
                         maybe_number_array.map(Primatives::NumberArray)
                     } else if first.is_boolean() {
-                        let maybe_boolean_array: Option<Vec<bool>> = arr.into_iter().map(|v| v.as_bool()).collect();
+                        let maybe_boolean_array: Option<Vec<bool>> =
+                            arr.into_iter().map(|v| v.as_bool()).collect();
                         maybe_boolean_array.map(Primatives::BooleanArray)
                     } else {
                         None
@@ -178,11 +216,29 @@ 
Files

                 } else {
                     None // Empty array case or mixed types case
                 }
-            },
+            }
             Value::Null => None,
             _ => None, // Covers other cases such as Object, which you might want to handle differently
         }
     }
+
+    pub(crate) fn to_value(&self) -> Value {
+        match self {
+            Primatives::Number(n) => json!(*n),
+            Primatives::String(s) => Value::String(s.clone()),
+            Primatives::Boolean(b) => Value::Bool(*b),
+            Primatives::StringArray(arr) => {
+                Value::Array(arr.iter().map(|s| Value::String(s.clone())).collect())
+            }
+            Primatives::NumberArray(arr) => Value::Array(arr.iter().map(|n| json!(n)).collect()),
+            Primatives::BooleanArray(arr) => {
+                Value::Array(arr.iter().map(|b| Value::Bool(*b)).collect())
+            }
+            Primatives::ArrayRef(arr) => {
+                Value::Array(arr.iter().map(|s| Value::String(s.clone())).collect())
+            }
+        }
+    }
 }
 ///Concversion Function from Primative to f64
 impl From<Primatives> for f64 {
@@ -193,7 +249,7 @@ 
Files

         }
     }
 }
-/// Conversion Function from Primative to String 
+/// Conversion Function from Primative to String
 impl From<Primatives> for String {
     fn from(p: Primatives) -> String {
         match p {
@@ -283,4 +339,5 @@ 
Files

     fn from(b: Vec<bool>) -> Primatives {
         Primatives::BooleanArray(b)
     }
-}
\ No newline at end of file +} + \ No newline at end of file diff --git a/src/lil_broker/lib.rs.html b/src/lil_broker/lib.rs.html index ca7df6dda3..efa65ffd79 100644 --- a/src/lil_broker/lib.rs.html +++ b/src/lil_broker/lib.rs.html @@ -21,4 +21,5 @@

Files

pub use database::*; pub use datapoint::*; pub use types::*; -pub use utils::*; \ No newline at end of file +pub use utils::*; + \ No newline at end of file diff --git a/src/lil_broker/types/mod.rs.html b/src/lil_broker/types/mod.rs.html index fbd20c8781..dc41120d83 100644 --- a/src/lil_broker/types/mod.rs.html +++ b/src/lil_broker/types/mod.rs.html @@ -4,7 +4,8 @@

Files

2 3 4 -
mod timestamp;
-mod tag;
+
mod tag;
+mod timestamp;
+pub use tag::*;
 pub use timestamp::*;
-pub use tag::*;
\ No newline at end of file + \ No newline at end of file diff --git a/src/lil_broker/types/tag.rs.html b/src/lil_broker/types/tag.rs.html index 97a2d8a28e..44df889668 100644 --- a/src/lil_broker/types/tag.rs.html +++ b/src/lil_broker/types/tag.rs.html @@ -143,126 +143,116 @@

Files

141 142 143 -144 -145 -146 -147 -148 
use std::hash::Hash;
 
-
-#[derive(Debug, Clone ,PartialOrd)]
-pub struct Tag{
+#[derive(Debug, Clone, PartialOrd)]
+pub struct Tag {
     pub name: String,
-    pub value: Option<String>
+    pub value: Option<String>,
 }
-impl Hash for Tag{
+impl Hash for Tag {
     /// We only hash for the name
-    fn hash<H: std::hash::Hasher>(&self, state: &mut H){
+    fn hash<H: std::hash::Hasher>(&self, state: &mut H) {
         self.name.hash(state);
     }
-    
 }
 
-impl PartialEq for Tag{
-    fn eq(&self, other: &Self) -> bool{
+impl PartialEq for Tag {
+    fn eq(&self, other: &Self) -> bool {
         self.name == other.name
     }
 }
 
-impl Eq for Tag{
-
-}
+impl Eq for Tag {}
 
-impl Ord for Tag{
-    fn cmp(&self, other: &Self) -> std::cmp::Ordering{
+impl Ord for Tag {
+    fn cmp(&self, other: &Self) -> std::cmp::Ordering {
         self.name.cmp(&other.name)
     }
 }
 
 /// Conversion function from &str to Tag
-impl From<&str> for Tag{
-    fn from(name: &str) -> Self{
+impl From<&str> for Tag {
+    fn from(name: &str) -> Self {
         Tag::new(name)
     }
 }
 
 /// Conversion function from String to Tag
-impl From<String> for Tag{
-    fn from(name: String) -> Self{
+impl From<String> for Tag {
+    fn from(name: String) -> Self {
         Tag::new(&name)
     }
 }
 
 /// Conversion function from (String, String) to Tag
-impl From<(String, String)> for Tag{
-    fn from((name, value): (String, String)) -> Self{
+impl From<(String, String)> for Tag {
+    fn from((name, value): (String, String)) -> Self {
         Tag::new_with_value(&name, &value)
     }
 }
 
 /// Conversion function from (&str, &str) to Tag
-impl From<(&str, &str)> for Tag{
-    fn from((name, value): (&str, &str)) -> Self{
+impl From<(&str, &str)> for Tag {
+    fn from((name, value): (&str, &str)) -> Self {
         Tag::new_with_value(name, value)
     }
 }
 
-impl Tag{
+impl Tag {
     /// Create a new tag with no value set
     /// - `name`: The name of the tag
-    pub fn new(name: &str) -> Tag{
-        Tag{
+    pub fn new(name: &str) -> Tag {
+        Tag {
             name: name.to_string(),
-            value: None
-        }
+            value: None,
+        }
     }
     /// Create a new tag with a value set
     /// - `name`: The name of the tag
     /// - `value`: The value of the tag
-    pub fn new_with_value(name: &str, value: &str) -> Tag{
-        Tag{
+    pub fn new_with_value(name: &str, value: &str) -> Tag {
+        Tag {
             name: name.to_string(),
-            value: Some(value.to_string())
+            value: Some(value.to_string()),
         }
     }
 
     /// Builder function to add a value to the tag
     /// - `value`: The value of the tag
-    pub fn value(mut self, value: &str) -> Self{
+    pub fn value(mut self, value: &str) -> Self {
         self.value = Some(value.to_string());
         self
     }
 }
 
-
 #[cfg(test)]
-mod tests{
+mod tests {
     use super::*;
 
     #[test]
-    fn test_tag_new(){
+    fn test_tag_new() {
         let tag = Tag::new("test");
         assert_eq!(tag.name, "test");
         assert_eq!(tag.value, None);
     }
 
     #[test]
-    fn test_tag_new_with_value(){
+    fn test_tag_new_with_value() {
         let tag = Tag::new_with_value("test", "value");
         assert_eq!(tag.name, "test");
         assert_eq!(tag.value, Some("value".to_string()));
     }
 
     #[test]
-    fn test_tag_value(){
+    fn test_tag_value() {
         let tag = Tag::new("test").value("value");
         assert_eq!(tag.name, "test");
         assert_eq!(tag.value, Some("value".to_string()));
     }
 
     #[test]
-    fn test_tag_cmp(){
+    fn test_tag_cmp() {
         let tag1 = Tag::new("test1");
         let tag2 = Tag::new("test2");
         assert_eq!(tag1.cmp(&tag2), std::cmp::Ordering::Less);
@@ -271,14 +261,14 @@ 
Files

     }
 
     #[test]
-    fn test_tag_eq(){
+    fn test_tag_eq() {
         let tag1 = Tag::new("test1");
         let tag2 = Tag::new("test1").value("value"); // Value should not matter
         assert_eq!(tag1, tag2);
     }
 
     #[test]
-    fn test_tag_string_conversion(){
+    fn test_tag_string_conversion() {
         let tag: Tag = "test".into();
         assert_eq!(tag.name, "test");
         assert_eq!(tag.value, None);
@@ -295,4 +285,5 @@ 
Files

         assert_eq!(tag.name, "test");
         assert_eq!(tag.value, Some("value".to_string()));
     }
-}
\ No newline at end of file +} + \ No newline at end of file diff --git a/src/lil_broker/types/timestamp.rs.html b/src/lil_broker/types/timestamp.rs.html index 2e9d099a45..5e3adcca07 100644 --- a/src/lil_broker/types/timestamp.rs.html +++ b/src/lil_broker/types/timestamp.rs.html @@ -287,7 +287,7 @@

Files

}; use serde::{Deserialize, Serialize}; -#[derive(Clone, Copy, Debug, Serialize, Deserialize, Hash, Eq, Ord )] +#[derive(Clone, Copy, Debug, Serialize, Deserialize, Hash, Eq, Ord)] pub struct Timestamp { pub tick_ms: u32, } diff --git a/src/lil_broker/utils/mod.rs.html b/src/lil_broker/utils/mod.rs.html index e5d06fc6f0..52d1bcf013 100644 --- a/src/lil_broker/utils/mod.rs.html +++ b/src/lil_broker/utils/mod.rs.html @@ -1,3 +1,5 @@ mod.rs - source
- 

\ No newline at end of file
+    
1
+

+

\ No newline at end of file
diff --git a/src/proc_macro2/detection.rs.html b/src/proc_macro2/detection.rs.html
index d0e420a2b1..b8db2b2288 100644
--- a/src/proc_macro2/detection.rs.html
+++ b/src/proc_macro2/detection.rs.html
@@ -1,4 +1,4 @@
-detection.rs - source

 
     pub fn new_unchecked(string: &str, span: Span) -> Self {
         Ident {
-            sym: string.to_owned(),
+            sym: Box::from(string),
             span,
             raw: false,
         }
@@ -2037,7 +2037,7 @@ 
Files

 
     pub fn new_raw_unchecked(string: &str, span: Span) -> Self {
         Ident {
-            sym: string.to_owned(),
+            sym: Box::from(string),
             span,
             raw: true,
         }
@@ -2114,9 +2114,9 @@ 
Files

     fn eq(&self, other: &T) -> bool {
         let other = other.as_ref();
         if self.raw {
-            other.starts_with("r#") && self.sym == other[2..]
+            other.starts_with("r#") && *self.sym == other[2..]
         } else {
-            self.sym == other
+            *self.sym == *other
         }
     }
 }
diff --git a/src/proc_macro2/lib.rs.html b/src/proc_macro2/lib.rs.html
index 09b0a37f56..780ec66126 100644
--- a/src/proc_macro2/lib.rs.html
+++ b/src/proc_macro2/lib.rs.html
@@ -1,4 +1,4 @@
-lib.rs - source

 1355
 1356
 1357
+1358
+1359
+1360
+1361
+1362
+1363
+1364
+1365
+1366
+1367
+1368
+1369
 
//! [![github]](https://github.com/dtolnay/proc-macro2)&ensp;[![crates-io]](https://crates.io/crates/proc-macro2)&ensp;[![docs-rs]](crate)
 //!
 //! [github]: https://img.shields.io/badge/github-8da0cb?style=for-the-badge&labelColor=555555&logo=github
@@ -1445,10 +1457,10 @@ 
Files

 //! a different thread.
 
 // Proc-macro2 types in rustdoc of other crates get linked to here.
-#![doc(html_root_url = "https://docs.rs/proc-macro2/1.0.82")]
+#![doc(html_root_url = "https://docs.rs/proc-macro2/1.0.85")]
 #![cfg_attr(any(proc_macro_span, super_unstable), feature(proc_macro_span))]
 #![cfg_attr(super_unstable, feature(proc_macro_def_site))]
-#![cfg_attr(doc_cfg, feature(doc_cfg))]
+#![cfg_attr(docsrs, feature(doc_cfg))]
 #![deny(unsafe_op_in_unsafe_fn)]
 #![allow(
     clippy::cast_lossless,
@@ -1534,7 +1546,7 @@ 
Files

 use std::path::PathBuf;
 
 #[cfg(span_locations)]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "span-locations")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "span-locations")))]
 pub use crate::location::LineColumn;
 
 /// An abstract stream of tokens, or more concretely a sequence of token trees.
@@ -1611,7 +1623,7 @@ 
Files

 }
 
 #[cfg(feature = "proc-macro")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "proc-macro")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "proc-macro")))]
 impl From<proc_macro::TokenStream> for TokenStream {
     fn from(inner: proc_macro::TokenStream) -> Self {
         TokenStream::_new(inner.into())
@@ -1619,7 +1631,7 @@ 
Files

 }
 
 #[cfg(feature = "proc-macro")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "proc-macro")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "proc-macro")))]
 impl From<TokenStream> for proc_macro::TokenStream {
     fn from(inner: TokenStream) -> Self {
         inner.inner.into()
@@ -1698,7 +1710,7 @@ 
Files

 ///
 /// This type is semver exempt and not exposed by default.
 #[cfg(all(procmacro2_semver_exempt, any(not(wrap_proc_macro), super_unstable)))]
-#[cfg_attr(doc_cfg, doc(cfg(procmacro2_semver_exempt)))]
+#[cfg_attr(docsrs, doc(cfg(procmacro2_semver_exempt)))]
 #[derive(Clone, PartialEq, Eq)]
 pub struct SourceFile {
     inner: imp::SourceFile,
@@ -1787,7 +1799,7 @@ 
Files

     ///
     /// This method is semver exempt and not exposed by default.
     #[cfg(procmacro2_semver_exempt)]
-    #[cfg_attr(doc_cfg, doc(cfg(procmacro2_semver_exempt)))]
+    #[cfg_attr(docsrs, doc(cfg(procmacro2_semver_exempt)))]
     pub fn def_site() -> Self {
         Span::_new(imp::Span::def_site())
     }
@@ -1830,7 +1842,7 @@ 
Files

     ///
     /// This method is semver exempt and not exposed by default.
     #[cfg(all(procmacro2_semver_exempt, any(not(wrap_proc_macro), super_unstable)))]
-    #[cfg_attr(doc_cfg, doc(cfg(procmacro2_semver_exempt)))]
+    #[cfg_attr(docsrs, doc(cfg(procmacro2_semver_exempt)))]
     pub fn source_file(&self) -> SourceFile {
         SourceFile::_new(self.inner.source_file())
     }
@@ -1845,7 +1857,7 @@ 
Files

     /// procedural macro, such as main.rs or build.rs, the byte range is always
     /// accurate regardless of toolchain.
     #[cfg(span_locations)]
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "span-locations")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "span-locations")))]
     pub fn byte_range(&self) -> Range<usize> {
         self.inner.byte_range()
     }
@@ -1860,7 +1872,7 @@ 
Files

     /// outside of a procedural macro, such as main.rs or build.rs, the
     /// line/column are always meaningful regardless of toolchain.
     #[cfg(span_locations)]
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "span-locations")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "span-locations")))]
     pub fn start(&self) -> LineColumn {
         self.inner.start()
     }
@@ -1875,7 +1887,7 @@ 
Files

     /// outside of a procedural macro, such as main.rs or build.rs, the
     /// line/column are always meaningful regardless of toolchain.
     #[cfg(span_locations)]
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "span-locations")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "span-locations")))]
     pub fn end(&self) -> LineColumn {
         self.inner.end()
     }
@@ -1897,7 +1909,7 @@ 
Files

     ///
     /// This method is semver exempt and not exposed by default.
     #[cfg(procmacro2_semver_exempt)]
-    #[cfg_attr(doc_cfg, doc(cfg(procmacro2_semver_exempt)))]
+    #[cfg_attr(docsrs, doc(cfg(procmacro2_semver_exempt)))]
     pub fn eq(&self, other: &Span) -> bool {
         self.inner.eq(&other.inner)
     }
@@ -2044,6 +2056,18 @@ 
Files

     /// operator priorities in cases like `$var * 3` where `$var` is `1 + 2`.
     /// Invisible delimiters may not survive roundtrip of a token stream through
     /// a string.
+    ///
+    /// <div class="warning">
+    ///
+    /// Note: rustc currently can ignore the grouping of tokens delimited by `None` in the output
+    /// of a proc_macro. Only `None`-delimited groups created by a macro_rules macro in the input
+    /// of a proc_macro macro are preserved, and only in very specific circumstances.
+    /// Any `None`-delimited groups (re)created by a proc_macro will therefore not preserve
+    /// operator priorities as indicated above. The other `Delimiter` variants should be used
+    /// instead in this context. This is a rustc bug. For details, see
+    /// [rust-lang/rust#67062](https://github.com/rust-lang/rust/issues/67062).
+    ///
+    /// </div>
     None,
 }
 
diff --git a/src/proc_macro2/marker.rs.html b/src/proc_macro2/marker.rs.html
index c3c752e192..c865fe3580 100644
--- a/src/proc_macro2/marker.rs.html
+++ b/src/proc_macro2/marker.rs.html
@@ -1,4 +1,4 @@
-marker.rs - source

 
 seq_impl!(
     #[cfg(any(feature = "std", feature = "alloc"))]
-    #[cfg_attr(doc_cfg, doc(cfg(any(feature = "std", feature = "alloc"))))]
+    #[cfg_attr(docsrs, doc(cfg(any(feature = "std", feature = "alloc"))))]
     BTreeSet<T: Eq + Ord>,
     seq,
     BTreeSet::clear,
@@ -4286,7 +4307,7 @@ 
Files

 
 seq_impl!(
     #[cfg(any(feature = "std", feature = "alloc"))]
-    #[cfg_attr(doc_cfg, doc(cfg(any(feature = "std", feature = "alloc"))))]
+    #[cfg_attr(docsrs, doc(cfg(any(feature = "std", feature = "alloc"))))]
     LinkedList<T>,
     seq,
     LinkedList::clear,
@@ -4297,7 +4318,7 @@ 
Files

 
 seq_impl!(
     #[cfg(feature = "std")]
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "std")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "std")))]
     HashSet<T: Eq + Hash, S: BuildHasher + Default>,
     seq,
     HashSet::clear,
@@ -4308,7 +4329,7 @@ 
Files

 
 seq_impl!(
     #[cfg(any(feature = "std", feature = "alloc"))]
-    #[cfg_attr(doc_cfg, doc(cfg(any(feature = "std", feature = "alloc"))))]
+    #[cfg_attr(docsrs, doc(cfg(any(feature = "std", feature = "alloc"))))]
     VecDeque<T>,
     seq,
     VecDeque::clear,
@@ -4320,7 +4341,7 @@ 
Files

 ////////////////////////////////////////////////////////////////////////////////
 
 #[cfg(any(feature = "std", feature = "alloc"))]
-#[cfg_attr(doc_cfg, doc(cfg(any(feature = "std", feature = "alloc"))))]
+#[cfg_attr(docsrs, doc(cfg(any(feature = "std", feature = "alloc"))))]
 impl<'de, T> Deserialize<'de> for Vec<T>
 where
     T: Deserialize<'de>,
@@ -4571,82 +4592,103 @@ 
Files

 macro_rules! tuple_impls {
     ($($len:tt => ($($n:tt $name:ident)+))+) => {
         $(
-            impl<'de, $($name: Deserialize<'de>),+> Deserialize<'de> for ($($name,)+) {
+            #[cfg_attr(docsrs, doc(hidden))]
+            impl<'de, $($name),+> Deserialize<'de> for ($($name,)+)
+            where
+                $($name: Deserialize<'de>,)+
+            {
+                tuple_impl_body!($len => ($($n $name)+));
+            }
+        )+
+    };
+}
+
+macro_rules! tuple_impl_body {
+    ($len:tt => ($($n:tt $name:ident)+)) => {
+        #[inline]
+        fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>
+        where
+            D: Deserializer<'de>,
+        {
+            struct TupleVisitor<$($name,)+> {
+                marker: PhantomData<($($name,)+)>,
+            }
+
+            impl<'de, $($name: Deserialize<'de>),+> Visitor<'de> for TupleVisitor<$($name,)+> {
+                type Value = ($($name,)+);
+
+                fn expecting(&self, formatter: &mut fmt::Formatter) -> fmt::Result {
+                    formatter.write_str(concat!("a tuple of size ", $len))
+                }
+
                 #[inline]
-                fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>
+                #[allow(non_snake_case)]
+                fn visit_seq<A>(self, mut seq: A) -> Result<Self::Value, A::Error>
                 where
-                    D: Deserializer<'de>,
+                    A: SeqAccess<'de>,
                 {
-                    struct TupleVisitor<$($name,)+> {
-                        marker: PhantomData<($($name,)+)>,
-                    }
+                    $(
+                        let $name = match tri!(seq.next_element()) {
+                            Some(value) => value,
+                            None => return Err(Error::invalid_length($n, &self)),
+                        };
+                    )+
 
-                    impl<'de, $($name: Deserialize<'de>),+> Visitor<'de> for TupleVisitor<$($name,)+> {
-                        type Value = ($($name,)+);
+                    Ok(($($name,)+))
+                }
+            }
 
-                        fn expecting(&self, formatter: &mut fmt::Formatter) -> fmt::Result {
-                            formatter.write_str(concat!("a tuple of size ", $len))
-                        }
+            deserializer.deserialize_tuple($len, TupleVisitor { marker: PhantomData })
+        }
 
-                        #[inline]
-                        #[allow(non_snake_case)]
-                        fn visit_seq<A>(self, mut seq: A) -> Result<Self::Value, A::Error>
-                        where
-                            A: SeqAccess<'de>,
-                        {
-                            $(
-                                let $name = match tri!(seq.next_element()) {
-                                    Some(value) => value,
-                                    None => return Err(Error::invalid_length($n, &self)),
-                                };
-                            )+
+        #[inline]
+        fn deserialize_in_place<D>(deserializer: D, place: &mut Self) -> Result<(), D::Error>
+        where
+            D: Deserializer<'de>,
+        {
+            struct TupleInPlaceVisitor<'a, $($name: 'a,)+>(&'a mut ($($name,)+));
 
-                            Ok(($($name,)+))
-                        }
-                    }
+            impl<'a, 'de, $($name: Deserialize<'de>),+> Visitor<'de> for TupleInPlaceVisitor<'a, $($name,)+> {
+                type Value = ();
 
-                    deserializer.deserialize_tuple($len, TupleVisitor { marker: PhantomData })
+                fn expecting(&self, formatter: &mut fmt::Formatter) -> fmt::Result {
+                    formatter.write_str(concat!("a tuple of size ", $len))
                 }
 
                 #[inline]
-                fn deserialize_in_place<D>(deserializer: D, place: &mut Self) -> Result<(), D::Error>
+                #[allow(non_snake_case)]
+                fn visit_seq<A>(self, mut seq: A) -> Result<Self::Value, A::Error>
                 where
-                    D: Deserializer<'de>,
+                    A: SeqAccess<'de>,
                 {
-                    struct TupleInPlaceVisitor<'a, $($name: 'a,)+>(&'a mut ($($name,)+));
-
-                    impl<'a, 'de, $($name: Deserialize<'de>),+> Visitor<'de> for TupleInPlaceVisitor<'a, $($name,)+> {
-                        type Value = ();
-
-                        fn expecting(&self, formatter: &mut fmt::Formatter) -> fmt::Result {
-                            formatter.write_str(concat!("a tuple of size ", $len))
-                        }
-
-                        #[inline]
-                        #[allow(non_snake_case)]
-                        fn visit_seq<A>(self, mut seq: A) -> Result<Self::Value, A::Error>
-                        where
-                            A: SeqAccess<'de>,
-                        {
-                            $(
-                                if tri!(seq.next_element_seed(InPlaceSeed(&mut (self.0).$n))).is_none() {
-                                    return Err(Error::invalid_length($n, &self));
-                                }
-                            )+
-
-                            Ok(())
+                    $(
+                        if tri!(seq.next_element_seed(InPlaceSeed(&mut (self.0).$n))).is_none() {
+                            return Err(Error::invalid_length($n, &self));
                         }
-                    }
+                    )+
 
-                    deserializer.deserialize_tuple($len, TupleInPlaceVisitor(place))
+                    Ok(())
                 }
             }
-        )+
-    }
+
+            deserializer.deserialize_tuple($len, TupleInPlaceVisitor(place))
+        }
+    };
+}
+
+#[cfg_attr(docsrs, doc(fake_variadic))]
+#[cfg_attr(
+    docsrs,
+    doc = "This trait is implemented for tuples up to 16 items long."
+)]
+impl<'de, T> Deserialize<'de> for (T,)
+where
+    T: Deserialize<'de>,
+{
+    tuple_impl_body!(1 => (0 T));
 }
 
 tuple_impls! {
-    1  => (0 T0)
     2  => (0 T0 1 T1)
     3  => (0 T0 1 T1 2 T2)
     4  => (0 T0 1 T1 2 T2 3 T3)
@@ -4724,7 +4766,7 @@ 
Files

 
 map_impl! {
     #[cfg(any(feature = "std", feature = "alloc"))]
-    #[cfg_attr(doc_cfg, doc(cfg(any(feature = "std", feature = "alloc"))))]
+    #[cfg_attr(docsrs, doc(cfg(any(feature = "std", feature = "alloc"))))]
     BTreeMap<K: Ord, V>,
     map,
     BTreeMap::new(),
@@ -4732,7 +4774,7 @@ 
Files

 
 map_impl! {
     #[cfg(feature = "std")]
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "std")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "std")))]
     HashMap<K: Eq + Hash, V, S: BuildHasher + Default>,
     map,
     HashMap::with_capacity_and_hasher(size_hint::cautious::<(K, V)>(map.size_hint()), S::default()),
@@ -4874,7 +4916,7 @@ 
Files

 }
 
 #[cfg(feature = "std")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "std")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "std")))]
 impl<'de> Deserialize<'de> for net::IpAddr {
     fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>
     where
@@ -4895,13 +4937,13 @@ 
Files

 
 parse_ip_impl! {
     #[cfg(feature = "std")]
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "std")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "std")))]
     net::Ipv4Addr, "IPv4 address", 4
 }
 
 parse_ip_impl! {
     #[cfg(feature = "std")]
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "std")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "std")))]
     net::Ipv6Addr, "IPv6 address", 16
 }
 
@@ -4928,7 +4970,7 @@ 
Files

 }
 
 #[cfg(feature = "std")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "std")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "std")))]
 impl<'de> Deserialize<'de> for net::SocketAddr {
     fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>
     where
@@ -4949,14 +4991,14 @@ 
Files

 
 parse_socket_impl! {
     #[cfg(feature = "std")]
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "std")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "std")))]
     net::SocketAddrV4, "IPv4 socket address",
     |(ip, port)| net::SocketAddrV4::new(ip, port),
 }
 
 parse_socket_impl! {
     #[cfg(feature = "std")]
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "std")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "std")))]
     net::SocketAddrV6, "IPv6 socket address",
     |(ip, port)| net::SocketAddrV6::new(ip, port, 0, 0),
 }
@@ -4992,7 +5034,7 @@ 
Files

 }
 
 #[cfg(feature = "std")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "std")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "std")))]
 impl<'de: 'a, 'a> Deserialize<'de> for &'a Path {
     fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>
     where
@@ -5047,7 +5089,7 @@ 
Files

 }
 
 #[cfg(feature = "std")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "std")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "std")))]
 impl<'de> Deserialize<'de> for PathBuf {
     fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>
     where
@@ -5059,7 +5101,7 @@ 
Files

 
 forwarded_impl! {
     #[cfg(feature = "std")]
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "std")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "std")))]
     (), Box<Path>, PathBuf::into_boxed_path
 }
 
@@ -5121,7 +5163,7 @@ 
Files

 }
 
 #[cfg(all(feature = "std", any(unix, windows)))]
-#[cfg_attr(doc_cfg, doc(cfg(all(feature = "std", any(unix, windows)))))]
+#[cfg_attr(docsrs, doc(cfg(all(feature = "std", any(unix, windows)))))]
 impl<'de> Deserialize<'de> for OsString {
     fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>
     where
@@ -5135,30 +5177,30 @@ 
Files

 
 forwarded_impl! {
     #[cfg(any(feature = "std", feature = "alloc"))]
-    #[cfg_attr(doc_cfg, doc(cfg(any(feature = "std", feature = "alloc"))))]
+    #[cfg_attr(docsrs, doc(cfg(any(feature = "std", feature = "alloc"))))]
     (T), Box<T>, Box::new
 }
 
 forwarded_impl! {
     #[cfg(any(feature = "std", feature = "alloc"))]
-    #[cfg_attr(doc_cfg, doc(cfg(any(feature = "std", feature = "alloc"))))]
+    #[cfg_attr(docsrs, doc(cfg(any(feature = "std", feature = "alloc"))))]
     (T), Box<[T]>, Vec::into_boxed_slice
 }
 
 forwarded_impl! {
     #[cfg(any(feature = "std", feature = "alloc"))]
-    #[cfg_attr(doc_cfg, doc(cfg(any(feature = "std", feature = "alloc"))))]
+    #[cfg_attr(docsrs, doc(cfg(any(feature = "std", feature = "alloc"))))]
     (), Box<str>, String::into_boxed_str
 }
 
 forwarded_impl! {
     #[cfg(all(feature = "std", any(unix, windows)))]
-    #[cfg_attr(doc_cfg, doc(cfg(all(feature = "std", any(unix, windows)))))]
+    #[cfg_attr(docsrs, doc(cfg(all(feature = "std", any(unix, windows)))))]
     (), Box<OsStr>, OsString::into_boxed_os_str
 }
 
 #[cfg(any(feature = "std", feature = "alloc"))]
-#[cfg_attr(doc_cfg, doc(cfg(any(feature = "std", feature = "alloc"))))]
+#[cfg_attr(docsrs, doc(cfg(any(feature = "std", feature = "alloc"))))]
 impl<'de, 'a, T> Deserialize<'de> for Cow<'a, T>
 where
     T: ?Sized + ToOwned,
@@ -5181,7 +5223,7 @@ 
Files

 /// [`"rc"`]: https://serde.rs/feature-flags.html#-features-rc
 #[cfg(all(feature = "rc", any(feature = "std", feature = "alloc")))]
 #[cfg_attr(
-    doc_cfg,
+    docsrs,
     doc(cfg(all(feature = "rc", any(feature = "std", feature = "alloc"))))
 )]
 impl<'de, T> Deserialize<'de> for RcWeak<T>
@@ -5203,7 +5245,7 @@ 
Files

 /// [`"rc"`]: https://serde.rs/feature-flags.html#-features-rc
 #[cfg(all(feature = "rc", any(feature = "std", feature = "alloc")))]
 #[cfg_attr(
-    doc_cfg,
+    docsrs,
     doc(cfg(all(feature = "rc", any(feature = "std", feature = "alloc"))))
 )]
 impl<'de, T> Deserialize<'de> for ArcWeak<T>
@@ -5251,7 +5293,7 @@ 
Files

     ///
     /// [`"rc"`]: https://serde.rs/feature-flags.html#-features-rc
     #[cfg(all(feature = "rc", any(feature = "std", feature = "alloc")))]
-    #[cfg_attr(doc_cfg, doc(cfg(all(feature = "rc", any(feature = "std", feature = "alloc")))))]
+    #[cfg_attr(docsrs, doc(cfg(all(feature = "rc", any(feature = "std", feature = "alloc")))))]
     Rc
 }
 
@@ -5264,7 +5306,7 @@ 
Files

     ///
     /// [`"rc"`]: https://serde.rs/feature-flags.html#-features-rc
     #[cfg(all(feature = "rc", any(feature = "std", feature = "alloc")))]
-    #[cfg_attr(doc_cfg, doc(cfg(all(feature = "rc", any(feature = "std", feature = "alloc")))))]
+    #[cfg_attr(docsrs, doc(cfg(all(feature = "rc", any(feature = "std", feature = "alloc")))))]
     Arc
 }
 
@@ -5288,13 +5330,13 @@ 
Files

 
 forwarded_impl! {
     #[cfg(feature = "std")]
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "std")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "std")))]
     (T), Mutex<T>, Mutex::new
 }
 
 forwarded_impl! {
     #[cfg(feature = "std")]
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "std")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "std")))]
     (T), RwLock<T>, RwLock::new
 }
 
@@ -5449,7 +5491,7 @@ 
Files

 ////////////////////////////////////////////////////////////////////////////////
 
 #[cfg(feature = "std")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "std")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "std")))]
 impl<'de> Deserialize<'de> for SystemTime {
     fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>
     where
@@ -6285,7 +6327,7 @@ 
Files

     ($($ty:ident $size:expr)*) => {
         $(
             #[cfg(any(no_target_has_atomic, target_has_atomic = $size))]
-            #[cfg_attr(doc_cfg, doc(cfg(all(feature = "std", target_has_atomic = $size))))]
+            #[cfg_attr(docsrs, doc(cfg(all(feature = "std", target_has_atomic = $size))))]
             impl<'de> Deserialize<'de> for $ty {
                 fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>
                 where
diff --git a/src/serde/de/mod.rs.html b/src/serde/de/mod.rs.html
index 133af3973c..d1b4457f51 100644
--- a/src/serde/de/mod.rs.html
+++ b/src/serde/de/mod.rs.html
@@ -1,4 +1,4 @@
-mod.rs - source

     /// `String`.
     #[inline]
     #[cfg(any(feature = "std", feature = "alloc"))]
-    #[cfg_attr(doc_cfg, doc(cfg(any(feature = "std", feature = "alloc"))))]
+    #[cfg_attr(docsrs, doc(cfg(any(feature = "std", feature = "alloc"))))]
     fn visit_string<E>(self, v: String) -> Result<Self::Value, E>
     where
         E: Error,
@@ -3915,7 +3915,7 @@ 
Files

     /// The default implementation forwards to `visit_bytes` and then drops the
     /// `Vec<u8>`.
     #[cfg(any(feature = "std", feature = "alloc"))]
-    #[cfg_attr(doc_cfg, doc(cfg(any(feature = "std", feature = "alloc"))))]
+    #[cfg_attr(docsrs, doc(cfg(any(feature = "std", feature = "alloc"))))]
     fn visit_byte_buf<E>(self, v: Vec<u8>) -> Result<Self::Value, E>
     where
         E: Error,
diff --git a/src/serde/de/seed.rs.html b/src/serde/de/seed.rs.html
index 039065b1db..ea5b760b4c 100644
--- a/src/serde/de/seed.rs.html
+++ b/src/serde/de/seed.rs.html
@@ -1,4 +1,4 @@
-seed.rs - source

 
 /// A deserializer holding a `String`.
 #[cfg(any(feature = "std", feature = "alloc"))]
-#[cfg_attr(doc_cfg, doc(cfg(any(feature = "std", feature = "alloc"))))]
+#[cfg_attr(docsrs, doc(cfg(any(feature = "std", feature = "alloc"))))]
 pub struct StringDeserializer<E> {
     value: String,
     marker: PhantomData<E>,
@@ -2304,7 +2304,7 @@ 
Files

 }
 
 #[cfg(any(feature = "std", feature = "alloc"))]
-#[cfg_attr(doc_cfg, doc(cfg(any(feature = "std", feature = "alloc"))))]
+#[cfg_attr(docsrs, doc(cfg(any(feature = "std", feature = "alloc"))))]
 impl<'de, E> IntoDeserializer<'de, E> for String
 where
     E: de::Error,
@@ -2392,7 +2392,7 @@ 
Files

 
 /// A deserializer holding a `Cow<str>`.
 #[cfg(any(feature = "std", feature = "alloc"))]
-#[cfg_attr(doc_cfg, doc(cfg(any(feature = "std", feature = "alloc"))))]
+#[cfg_attr(docsrs, doc(cfg(any(feature = "std", feature = "alloc"))))]
 pub struct CowStrDeserializer<'a, E> {
     value: Cow<'a, str>,
     marker: PhantomData<E>,
@@ -2409,7 +2409,7 @@ 
Files

 }
 
 #[cfg(any(feature = "std", feature = "alloc"))]
-#[cfg_attr(doc_cfg, doc(cfg(any(feature = "std", feature = "alloc"))))]
+#[cfg_attr(docsrs, doc(cfg(any(feature = "std", feature = "alloc"))))]
 impl<'de, 'a, E> IntoDeserializer<'de, E> for Cow<'a, str>
 where
     E: de::Error,
@@ -2728,7 +2728,7 @@ 
Files

 ////////////////////////////////////////////////////////////////////////////////
 
 #[cfg(any(feature = "std", feature = "alloc"))]
-#[cfg_attr(doc_cfg, doc(cfg(any(feature = "std", feature = "alloc"))))]
+#[cfg_attr(docsrs, doc(cfg(any(feature = "std", feature = "alloc"))))]
 impl<'de, T, E> IntoDeserializer<'de, E> for Vec<T>
 where
     T: IntoDeserializer<'de, E>,
@@ -2742,7 +2742,7 @@ 
Files

 }
 
 #[cfg(any(feature = "std", feature = "alloc"))]
-#[cfg_attr(doc_cfg, doc(cfg(any(feature = "std", feature = "alloc"))))]
+#[cfg_attr(docsrs, doc(cfg(any(feature = "std", feature = "alloc"))))]
 impl<'de, T, E> IntoDeserializer<'de, E> for BTreeSet<T>
 where
     T: IntoDeserializer<'de, E> + Eq + Ord,
@@ -2756,7 +2756,7 @@ 
Files

 }
 
 #[cfg(feature = "std")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "std")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "std")))]
 impl<'de, T, S, E> IntoDeserializer<'de, E> for HashSet<T, S>
 where
     T: IntoDeserializer<'de, E> + Eq + Hash,
@@ -3143,7 +3143,7 @@ 
Files

 ////////////////////////////////////////////////////////////////////////////////
 
 #[cfg(any(feature = "std", feature = "alloc"))]
-#[cfg_attr(doc_cfg, doc(cfg(any(feature = "std", feature = "alloc"))))]
+#[cfg_attr(docsrs, doc(cfg(any(feature = "std", feature = "alloc"))))]
 impl<'de, K, V, E> IntoDeserializer<'de, E> for BTreeMap<K, V>
 where
     K: IntoDeserializer<'de, E> + Eq + Ord,
@@ -3158,7 +3158,7 @@ 
Files

 }
 
 #[cfg(feature = "std")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "std")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "std")))]
 impl<'de, K, V, S, E> IntoDeserializer<'de, E> for HashMap<K, V, S>
 where
     K: IntoDeserializer<'de, E> + Eq + Hash,
diff --git a/src/serde/integer128.rs.html b/src/serde/integer128.rs.html
index 1912c33c37..412d282cd9 100644
--- a/src/serde/integer128.rs.html
+++ b/src/serde/integer128.rs.html
@@ -1,4 +1,4 @@
-integer128.rs - source

 ////////////////////////////////////////////////////////////////////////////////
 
 // Serde types in rustdoc of other crates get linked to here.
-#![doc(html_root_url = "https://docs.rs/serde/1.0.202")]
+#![doc(html_root_url = "https://docs.rs/serde/1.0.203")]
 // Support using Serde without the standard library!
 #![cfg_attr(not(feature = "std"), no_std)]
 // Show which crate feature enables conditionally compiled APIs in documentation.
-#![cfg_attr(doc_cfg, feature(doc_cfg))]
+#![cfg_attr(docsrs, feature(doc_cfg, rustdoc_internals))]
+#![cfg_attr(docsrs, allow(internal_features))]
 // Unstable functionality only if the user asks for it. For tracking and
 // discussion of these features please refer to this issue:
 //
@@ -671,7 +673,7 @@ 
Files

 
 /// Derive macro available if serde is built with `features = ["derive"]`.
 #[cfg(feature = "serde_derive")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "derive")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "derive")))]
 pub use serde_derive::{Deserialize, Serialize};
 
 #[cfg(all(not(no_serde_derive), any(feature = "std", feature = "alloc")))]
diff --git a/src/serde/macros.rs.html b/src/serde/macros.rs.html
index f023be2705..c6dcec89e5 100644
--- a/src/serde/macros.rs.html
+++ b/src/serde/macros.rs.html
@@ -1,4 +1,4 @@
-macros.rs - source

 macro_rules! tuple_impls {
     ($($len:expr => ($($n:tt $name:ident)+))+) => {
         $(
-            impl<$($name),+> Serialize for ($($name,)+)
+            #[cfg_attr(docsrs, doc(hidden))]
+            impl<$($name),+> Serialize for ($($name,)+)
             where
                 $($name: Serialize,)+
             {
-                #[inline]
-                fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>
-                where
-                    S: Serializer,
-                {
-                    let mut tuple = tri!(serializer.serialize_tuple($len));
-                    $(
-                        tri!(tuple.serialize_element(&self.$n));
-                    )+
-                    tuple.end()
-                }
+                tuple_impl_body!($len => ($($n)+));
             }
         )+
-    }
+    };
+}
+
+macro_rules! tuple_impl_body {
+    ($len:expr => ($($n:tt)+)) => {
+        #[inline]
+        fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>
+        where
+            S: Serializer,
+        {
+            let mut tuple = tri!(serializer.serialize_tuple($len));
+            $(
+                tri!(tuple.serialize_element(&self.$n));
+            )+
+            tuple.end()
+        }
+    };
+}
+
+#[cfg_attr(docsrs, doc(fake_variadic))]
+#[cfg_attr(
+    docsrs,
+    doc = "This trait is implemented for tuples up to 16 items long."
+)]
+impl<T> Serialize for (T,)
+where
+    T: Serialize,
+{
+    tuple_impl_body!(1 => (0));
 }
 
 tuple_impls! {
-    1 => (0 T0)
     2 => (0 T0 1 T1)
     3 => (0 T0 1 T1 2 T2)
     4 => (0 T0 1 T1 2 T2 3 T3)
@@ -1572,13 +1608,13 @@ 
Files

 
 map_impl! {
     #[cfg(any(feature = "std", feature = "alloc"))]
-    #[cfg_attr(doc_cfg, doc(cfg(any(feature = "std", feature = "alloc"))))]
+    #[cfg_attr(docsrs, doc(cfg(any(feature = "std", feature = "alloc"))))]
     BTreeMap<K: Ord, V>
 }
 
 map_impl! {
     #[cfg(feature = "std")]
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "std")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "std")))]
     HashMap<K: Eq + Hash, V, H: BuildHasher>
 }
 
@@ -1612,7 +1648,7 @@ 
Files

 
 deref_impl! {
     #[cfg(any(feature = "std", feature = "alloc"))]
-    #[cfg_attr(doc_cfg, doc(cfg(any(feature = "std", feature = "alloc"))))]
+    #[cfg_attr(docsrs, doc(cfg(any(feature = "std", feature = "alloc"))))]
     <T> Serialize for Box<T> where T: ?Sized + Serialize
 }
 
@@ -1626,7 +1662,7 @@ 
Files

     ///
     /// [`"rc"`]: https://serde.rs/feature-flags.html#-features-rc
     #[cfg(all(feature = "rc", any(feature = "std", feature = "alloc")))]
-    #[cfg_attr(doc_cfg, doc(cfg(all(feature = "rc", any(feature = "std", feature = "alloc")))))]
+    #[cfg_attr(docsrs, doc(cfg(all(feature = "rc", any(feature = "std", feature = "alloc")))))]
     <T> Serialize for Rc<T> where T: ?Sized + Serialize
 }
 
@@ -1640,13 +1676,13 @@ 
Files

     ///
     /// [`"rc"`]: https://serde.rs/feature-flags.html#-features-rc
     #[cfg(all(feature = "rc", any(feature = "std", feature = "alloc")))]
-    #[cfg_attr(doc_cfg, doc(cfg(all(feature = "rc", any(feature = "std", feature = "alloc")))))]
+    #[cfg_attr(docsrs, doc(cfg(all(feature = "rc", any(feature = "std", feature = "alloc")))))]
     <T> Serialize for Arc<T> where T: ?Sized + Serialize
 }
 
 deref_impl! {
     #[cfg(any(feature = "std", feature = "alloc"))]
-    #[cfg_attr(doc_cfg, doc(cfg(any(feature = "std", feature = "alloc"))))]
+    #[cfg_attr(docsrs, doc(cfg(any(feature = "std", feature = "alloc"))))]
     <'a, T> Serialize for Cow<'a, T> where T: ?Sized + Serialize + ToOwned
 }
 
@@ -1657,7 +1693,7 @@ 
Files

 /// [`"rc"`]: https://serde.rs/feature-flags.html#-features-rc
 #[cfg(all(feature = "rc", any(feature = "std", feature = "alloc")))]
 #[cfg_attr(
-    doc_cfg,
+    docsrs,
     doc(cfg(all(feature = "rc", any(feature = "std", feature = "alloc"))))
 )]
 impl<T> Serialize for RcWeak<T>
@@ -1677,7 +1713,7 @@ 
Files

 /// [`"rc"`]: https://serde.rs/feature-flags.html#-features-rc
 #[cfg(all(feature = "rc", any(feature = "std", feature = "alloc")))]
 #[cfg_attr(
-    doc_cfg,
+    docsrs,
     doc(cfg(all(feature = "rc", any(feature = "std", feature = "alloc"))))
 )]
 impl<T> Serialize for ArcWeak<T>
@@ -1756,7 +1792,7 @@ 
Files

 }
 
 #[cfg(feature = "std")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "std")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "std")))]
 impl<T> Serialize for Mutex<T>
 where
     T: ?Sized + Serialize,
@@ -1773,7 +1809,7 @@ 
Files

 }
 
 #[cfg(feature = "std")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "std")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "std")))]
 impl<T> Serialize for RwLock<T>
 where
     T: ?Sized + Serialize,
@@ -1827,7 +1863,7 @@ 
Files

 ////////////////////////////////////////////////////////////////////////////////
 
 #[cfg(feature = "std")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "std")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "std")))]
 impl Serialize for SystemTime {
     fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>
     where
@@ -1872,7 +1908,7 @@ 
Files

 }
 
 #[cfg(feature = "std")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "std")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "std")))]
 impl Serialize for net::IpAddr {
     fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>
     where
@@ -1943,7 +1979,7 @@ 
Files

 }
 
 #[cfg(feature = "std")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "std")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "std")))]
 impl Serialize for net::Ipv4Addr {
     fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>
     where
@@ -1968,7 +2004,7 @@ 
Files

 }
 
 #[cfg(feature = "std")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "std")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "std")))]
 impl Serialize for net::Ipv6Addr {
     fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>
     where
@@ -1985,7 +2021,7 @@ 
Files

 }
 
 #[cfg(feature = "std")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "std")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "std")))]
 impl Serialize for net::SocketAddr {
     fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>
     where
@@ -2010,7 +2046,7 @@ 
Files

 }
 
 #[cfg(feature = "std")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "std")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "std")))]
 impl Serialize for net::SocketAddrV4 {
     fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>
     where
@@ -2027,7 +2063,7 @@ 
Files

 }
 
 #[cfg(feature = "std")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "std")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "std")))]
 impl Serialize for net::SocketAddrV6 {
     fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>
     where
@@ -2049,7 +2085,7 @@ 
Files

 ////////////////////////////////////////////////////////////////////////////////
 
 #[cfg(feature = "std")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "std")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "std")))]
 impl Serialize for Path {
     fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>
     where
@@ -2063,7 +2099,7 @@ 
Files

 }
 
 #[cfg(feature = "std")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "std")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "std")))]
 impl Serialize for PathBuf {
     fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>
     where
@@ -2074,7 +2110,7 @@ 
Files

 }
 
 #[cfg(all(feature = "std", any(unix, windows)))]
-#[cfg_attr(doc_cfg, doc(cfg(all(feature = "std", any(unix, windows)))))]
+#[cfg_attr(docsrs, doc(cfg(all(feature = "std", any(unix, windows)))))]
 impl Serialize for OsStr {
     #[cfg(unix)]
     fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>
@@ -2097,7 +2133,7 @@ 
Files

 }
 
 #[cfg(all(feature = "std", any(unix, windows)))]
-#[cfg_attr(doc_cfg, doc(cfg(all(feature = "std", any(unix, windows)))))]
+#[cfg_attr(docsrs, doc(cfg(all(feature = "std", any(unix, windows)))))]
 impl Serialize for OsString {
     fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>
     where
@@ -2156,7 +2192,7 @@ 
Files

     ($($ty:ident $size:expr)*) => {
         $(
             #[cfg(any(no_target_has_atomic, target_has_atomic = $size))]
-            #[cfg_attr(doc_cfg, doc(cfg(all(feature = "std", target_has_atomic = $size))))]
+            #[cfg_attr(docsrs, doc(cfg(all(feature = "std", target_has_atomic = $size))))]
             impl Serialize for $ty {
                 fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>
                 where
diff --git a/src/serde/ser/impossible.rs.html b/src/serde/ser/impossible.rs.html
index 9cddbb24a0..b31d155bb9 100644
--- a/src/serde/ser/impossible.rs.html
+++ b/src/serde/ser/impossible.rs.html
@@ -1,4 +1,4 @@
-impossible.rs - source

     use proc_macro2::TokenStream;
     use quote::ToTokens;
 
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "printing")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "printing")))]
     impl ToTokens for Attribute {
         fn to_tokens(&self, tokens: &mut TokenStream) {
             self.pound_token.to_tokens(tokens);
@@ -1569,7 +1569,7 @@ 
Files

         }
     }
 
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "printing")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "printing")))]
     impl ToTokens for MetaList {
         fn to_tokens(&self, tokens: &mut TokenStream) {
             self.path.to_tokens(tokens);
@@ -1577,7 +1577,7 @@ 
Files

         }
     }
 
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "printing")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "printing")))]
     impl ToTokens for MetaNameValue {
         fn to_tokens(&self, tokens: &mut TokenStream) {
             self.path.to_tokens(tokens);
diff --git a/src/syn/bigint.rs.html b/src/syn/bigint.rs.html
index e01bef6d31..ea45857b85 100644
--- a/src/syn/bigint.rs.html
+++ b/src/syn/bigint.rs.html
@@ -1,4 +1,4 @@
-bigint.rs - source

 
 ast_struct! {
     /// A field of a struct or enum variant.
-    #[cfg_attr(doc_cfg, doc(cfg(any(feature = "full", feature = "derive"))))]
+    #[cfg_attr(docsrs, doc(cfg(any(feature = "full", feature = "derive"))))]
     pub struct Field {
         pub attrs: Vec<Attribute>,
 
@@ -599,7 +599,7 @@ 
Files

     use crate::ty::Type;
     use crate::verbatim;
 
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "parsing")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "parsing")))]
     impl Parse for Variant {
         fn parse(input: ParseStream) -> Result<Self> {
             let attrs = input.call(Attribute::parse_outer)?;
@@ -720,7 +720,7 @@ 
Files

         Err(input.error("unsupported expression"))
     }
 
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "parsing")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "parsing")))]
     impl Parse for FieldsNamed {
         fn parse(input: ParseStream) -> Result<Self> {
             let content;
@@ -731,7 +731,7 @@ 
Files

         }
     }
 
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "parsing")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "parsing")))]
     impl Parse for FieldsUnnamed {
         fn parse(input: ParseStream) -> Result<Self> {
             let content;
@@ -744,7 +744,7 @@ 
Files

 
     impl Field {
         /// Parses a named (braced struct) field.
-        #[cfg_attr(doc_cfg, doc(cfg(feature = "parsing")))]
+        #[cfg_attr(docsrs, doc(cfg(feature = "parsing")))]
         pub fn parse_named(input: ParseStream) -> Result<Self> {
             let attrs = input.call(Attribute::parse_outer)?;
             let vis: Visibility = input.parse()?;
@@ -781,7 +781,7 @@ 
Files

         }
 
         /// Parses an unnamed (tuple struct) field.
-        #[cfg_attr(doc_cfg, doc(cfg(feature = "parsing")))]
+        #[cfg_attr(docsrs, doc(cfg(feature = "parsing")))]
         pub fn parse_unnamed(input: ParseStream) -> Result<Self> {
             Ok(Field {
                 attrs: input.call(Attribute::parse_outer)?,
@@ -802,7 +802,7 @@ 
Files

     use proc_macro2::TokenStream;
     use quote::{ToTokens, TokenStreamExt};
 
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "printing")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "printing")))]
     impl ToTokens for Variant {
         fn to_tokens(&self, tokens: &mut TokenStream) {
             tokens.append_all(&self.attrs);
@@ -815,7 +815,7 @@ 
Files

         }
     }
 
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "printing")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "printing")))]
     impl ToTokens for FieldsNamed {
         fn to_tokens(&self, tokens: &mut TokenStream) {
             self.brace_token.surround(tokens, |tokens| {
@@ -824,7 +824,7 @@ 
Files

         }
     }
 
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "printing")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "printing")))]
     impl ToTokens for FieldsUnnamed {
         fn to_tokens(&self, tokens: &mut TokenStream) {
             self.paren_token.surround(tokens, |tokens| {
@@ -833,7 +833,7 @@ 
Files

         }
     }
 
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "printing")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "printing")))]
     impl ToTokens for Field {
         fn to_tokens(&self, tokens: &mut TokenStream) {
             tokens.append_all(&self.attrs);
diff --git a/src/syn/derive.rs.html b/src/syn/derive.rs.html
index bc9e60afd9..840664c8de 100644
--- a/src/syn/derive.rs.html
+++ b/src/syn/derive.rs.html
@@ -1,4 +1,4 @@
-derive.rs - source

 
 ast_struct! {
     /// Data structure sent to a `proc_macro_derive` macro.
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "derive")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "derive")))]
     pub struct DeriveInput {
         pub attrs: Vec<Attribute>,
         pub vis: Visibility,
@@ -287,7 +287,7 @@ 
Files

     /// This type is a [syntax tree enum].
     ///
     /// [syntax tree enum]: crate::expr::Expr#syntax-tree-enums
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "derive")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "derive")))]
     pub enum Data {
         Struct(DataStruct),
         Enum(DataEnum),
@@ -297,7 +297,7 @@ 
Files

 
 ast_struct! {
     /// A struct input to a `proc_macro_derive` macro.
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "derive")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "derive")))]
     pub struct DataStruct {
         pub struct_token: Token![struct],
         pub fields: Fields,
@@ -307,7 +307,7 @@ 
Files

 
 ast_struct! {
     /// An enum input to a `proc_macro_derive` macro.
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "derive")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "derive")))]
     pub struct DataEnum {
         pub enum_token: Token![enum],
         pub brace_token: token::Brace,
@@ -317,7 +317,7 @@ 
Files

 
 ast_struct! {
     /// An untagged union input to a `proc_macro_derive` macro.
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "derive")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "derive")))]
     pub struct DataUnion {
         pub union_token: Token![union],
         pub fields: FieldsNamed,
@@ -337,7 +337,7 @@ 
Files

     use crate::restriction::Visibility;
     use crate::token;
 
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "parsing")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "parsing")))]
     impl Parse for DeriveInput {
         fn parse(input: ParseStream) -> Result<Self> {
             let attrs = input.call(Attribute::parse_outer)?;
@@ -474,7 +474,7 @@ 
Files

     use proc_macro2::TokenStream;
     use quote::ToTokens;
 
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "printing")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "printing")))]
     impl ToTokens for DeriveInput {
         fn to_tokens(&self, tokens: &mut TokenStream) {
             for attr in self.attrs.outer() {
diff --git a/src/syn/discouraged.rs.html b/src/syn/discouraged.rs.html
index 342ac0d779..80e347eb46 100644
--- a/src/syn/discouraged.rs.html
+++ b/src/syn/discouraged.rs.html
@@ -1,4 +1,4 @@
-discouraged.rs - source

 
 ast_struct! {
     /// An assignment expression: `a = compute()`.
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "full")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "full")))]
     pub struct ExprAssign #full {
         pub attrs: Vec<Attribute>,
         pub left: Box<Expr>,
@@ -4254,7 +4246,7 @@ 
Files

 
 ast_struct! {
     /// An async block: `async { ... }`.
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "full")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "full")))]
     pub struct ExprAsync #full {
         pub attrs: Vec<Attribute>,
         pub async_token: Token![async],
@@ -4265,7 +4257,7 @@ 
Files

 
 ast_struct! {
     /// An await expression: `fut.await`.
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "full")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "full")))]
     pub struct ExprAwait #full {
         pub attrs: Vec<Attribute>,
         pub base: Box<Expr>,
@@ -4276,7 +4268,7 @@ 
Files

 
 ast_struct! {
     /// A binary operation: `a + b`, `a += b`.
-    #[cfg_attr(doc_cfg, doc(cfg(any(feature = "full", feature = "derive"))))]
+    #[cfg_attr(docsrs, doc(cfg(any(feature = "full", feature = "derive"))))]
     pub struct ExprBinary {
         pub attrs: Vec<Attribute>,
         pub left: Box<Expr>,
@@ -4287,7 +4279,7 @@ 
Files

 
 ast_struct! {
     /// A blocked scope: `{ ... }`.
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "full")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "full")))]
     pub struct ExprBlock #full {
         pub attrs: Vec<Attribute>,
         pub label: Option<Label>,
@@ -4298,7 +4290,7 @@ 
Files

 ast_struct! {
     /// A `break`, with an optional label to break and an optional
     /// expression.
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "full")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "full")))]
     pub struct ExprBreak #full {
         pub attrs: Vec<Attribute>,
         pub break_token: Token![break],
@@ -4309,7 +4301,7 @@ 
Files

 
 ast_struct! {
     /// A function call expression: `invoke(a, b)`.
-    #[cfg_attr(doc_cfg, doc(cfg(any(feature = "full", feature = "derive"))))]
+    #[cfg_attr(docsrs, doc(cfg(any(feature = "full", feature = "derive"))))]
     pub struct ExprCall {
         pub attrs: Vec<Attribute>,
         pub func: Box<Expr>,
@@ -4320,7 +4312,7 @@ 
Files

 
 ast_struct! {
     /// A cast expression: `foo as f64`.
-    #[cfg_attr(doc_cfg, doc(cfg(any(feature = "full", feature = "derive"))))]
+    #[cfg_attr(docsrs, doc(cfg(any(feature = "full", feature = "derive"))))]
     pub struct ExprCast {
         pub attrs: Vec<Attribute>,
         pub expr: Box<Expr>,
@@ -4331,7 +4323,7 @@ 
Files

 
 ast_struct! {
     /// A closure expression: `|a, b| a + b`.
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "full")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "full")))]
     pub struct ExprClosure #full {
         pub attrs: Vec<Attribute>,
         pub lifetimes: Option<BoundLifetimes>,
@@ -4349,7 +4341,7 @@ 
Files

 
 ast_struct! {
     /// A const block: `const { ... }`.
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "full")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "full")))]
     pub struct ExprConst #full {
         pub attrs: Vec<Attribute>,
         pub const_token: Token![const],
@@ -4359,7 +4351,7 @@ 
Files

 
 ast_struct! {
     /// A `continue`, with an optional label.
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "full")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "full")))]
     pub struct ExprContinue #full {
         pub attrs: Vec<Attribute>,
         pub continue_token: Token![continue],
@@ -4370,7 +4362,7 @@ 
Files

 ast_struct! {
     /// Access of a named struct field (`obj.k`) or unnamed tuple struct
     /// field (`obj.0`).
-    #[cfg_attr(doc_cfg, doc(cfg(any(feature = "full", feature = "derive"))))]
+    #[cfg_attr(docsrs, doc(cfg(any(feature = "full", feature = "derive"))))]
     pub struct ExprField {
         pub attrs: Vec<Attribute>,
         pub base: Box<Expr>,
@@ -4381,7 +4373,7 @@ 
Files

 
 ast_struct! {
     /// A for loop: `for pat in expr { ... }`.
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "full")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "full")))]
     pub struct ExprForLoop #full {
         pub attrs: Vec<Attribute>,
         pub label: Option<Label>,
@@ -4399,7 +4391,7 @@ 
Files

     /// This variant is important for faithfully representing the precedence
     /// of expressions and is related to `None`-delimited spans in a
     /// `TokenStream`.
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "full")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "full")))]
     pub struct ExprGroup {
         pub attrs: Vec<Attribute>,
         pub group_token: token::Group,
@@ -4413,7 +4405,7 @@ 
Files

     ///
     /// The `else` branch expression may only be an `If` or `Block`
     /// expression, not any of the other types of expression.
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "full")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "full")))]
     pub struct ExprIf #full {
         pub attrs: Vec<Attribute>,
         pub if_token: Token![if],
@@ -4425,7 +4417,7 @@ 
Files

 
 ast_struct! {
     /// A square bracketed indexing expression: `vector[2]`.
-    #[cfg_attr(doc_cfg, doc(cfg(any(feature = "full", feature = "derive"))))]
+    #[cfg_attr(docsrs, doc(cfg(any(feature = "full", feature = "derive"))))]
     pub struct ExprIndex {
         pub attrs: Vec<Attribute>,
         pub expr: Box<Expr>,
@@ -4436,7 +4428,7 @@ 
Files

 
 ast_struct! {
     /// The inferred value of a const generic argument, denoted `_`.
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "full")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "full")))]
     pub struct ExprInfer #full {
         pub attrs: Vec<Attribute>,
         pub underscore_token: Token![_],
@@ -4445,7 +4437,7 @@ 
Files

 
 ast_struct! {
     /// A `let` guard: `let Some(x) = opt`.
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "full")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "full")))]
     pub struct ExprLet #full {
         pub attrs: Vec<Attribute>,
         pub let_token: Token![let],
@@ -4457,7 +4449,7 @@ 
Files

 
 ast_struct! {
     /// A literal in place of an expression: `1`, `"foo"`.
-    #[cfg_attr(doc_cfg, doc(cfg(any(feature = "full", feature = "derive"))))]
+    #[cfg_attr(docsrs, doc(cfg(any(feature = "full", feature = "derive"))))]
     pub struct ExprLit {
         pub attrs: Vec<Attribute>,
         pub lit: Lit,
@@ -4466,7 +4458,7 @@ 
Files

 
 ast_struct! {
     /// Conditionless loop: `loop { ... }`.
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "full")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "full")))]
     pub struct ExprLoop #full {
         pub attrs: Vec<Attribute>,
         pub label: Option<Label>,
@@ -4477,7 +4469,7 @@ 
Files

 
 ast_struct! {
     /// A macro invocation expression: `format!("{}", q)`.
-    #[cfg_attr(doc_cfg, doc(cfg(any(feature = "full", feature = "derive"))))]
+    #[cfg_attr(docsrs, doc(cfg(any(feature = "full", feature = "derive"))))]
     pub struct ExprMacro {
         pub attrs: Vec<Attribute>,
         pub mac: Macro,
@@ -4486,7 +4478,7 @@ 
Files

 
 ast_struct! {
     /// A `match` expression: `match n { Some(n) => {}, None => {} }`.
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "full")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "full")))]
     pub struct ExprMatch #full {
         pub attrs: Vec<Attribute>,
         pub match_token: Token![match],
@@ -4498,7 +4490,7 @@ 
Files

 
 ast_struct! {
     /// A method call expression: `x.foo::<T>(a, b)`.
-    #[cfg_attr(doc_cfg, doc(cfg(any(feature = "full", feature = "derive"))))]
+    #[cfg_attr(docsrs, doc(cfg(any(feature = "full", feature = "derive"))))]
     pub struct ExprMethodCall {
         pub attrs: Vec<Attribute>,
         pub receiver: Box<Expr>,
@@ -4512,7 +4504,7 @@ 
Files

 
 ast_struct! {
     /// A parenthesized expression: `(a + b)`.
-    #[cfg_attr(doc_cfg, doc(cfg(any(feature = "full", feature = "derive"))))]
+    #[cfg_attr(docsrs, doc(cfg(any(feature = "full", feature = "derive"))))]
     pub struct ExprParen {
         pub attrs: Vec<Attribute>,
         pub paren_token: token::Paren,
@@ -4525,7 +4517,7 @@ 
Files

     /// parameters and a qualified self-type.
     ///
     /// A plain identifier like `x` is a path of length 1.
-    #[cfg_attr(doc_cfg, doc(cfg(any(feature = "full", feature = "derive"))))]
+    #[cfg_attr(docsrs, doc(cfg(any(feature = "full", feature = "derive"))))]
     pub struct ExprPath {
         pub attrs: Vec<Attribute>,
         pub qself: Option<QSelf>,
@@ -4535,7 +4527,7 @@ 
Files

 
 ast_struct! {
     /// A range expression: `1..2`, `1..`, `..2`, `1..=2`, `..=2`.
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "full")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "full")))]
     pub struct ExprRange #full {
         pub attrs: Vec<Attribute>,
         pub start: Option<Box<Expr>>,
@@ -4546,7 +4538,7 @@ 
Files

 
 ast_struct! {
     /// A referencing operation: `&a` or `&mut a`.
-    #[cfg_attr(doc_cfg, doc(cfg(any(feature = "full", feature = "derive"))))]
+    #[cfg_attr(docsrs, doc(cfg(any(feature = "full", feature = "derive"))))]
     pub struct ExprReference {
         pub attrs: Vec<Attribute>,
         pub and_token: Token![&],
@@ -4557,7 +4549,7 @@ 
Files

 
 ast_struct! {
     /// An array literal constructed from one repeated element: `[0u8; N]`.
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "full")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "full")))]
     pub struct ExprRepeat #full {
         pub attrs: Vec<Attribute>,
         pub bracket_token: token::Bracket,
@@ -4569,7 +4561,7 @@ 
Files

 
 ast_struct! {
     /// A `return`, with an optional value to be returned.
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "full")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "full")))]
     pub struct ExprReturn #full {
         pub attrs: Vec<Attribute>,
         pub return_token: Token![return],
@@ -4582,7 +4574,7 @@ 
Files

     ///
     /// The `rest` provides the value of the remaining fields as in `S { a:
     /// 1, b: 1, ..rest }`.
-    #[cfg_attr(doc_cfg, doc(cfg(any(feature = "full", feature = "derive"))))]
+    #[cfg_attr(docsrs, doc(cfg(any(feature = "full", feature = "derive"))))]
     pub struct ExprStruct {
         pub attrs: Vec<Attribute>,
         pub qself: Option<QSelf>,
@@ -4596,7 +4588,7 @@ 
Files

 
 ast_struct! {
     /// A try-expression: `expr?`.
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "full")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "full")))]
     pub struct ExprTry #full {
         pub attrs: Vec<Attribute>,
         pub expr: Box<Expr>,
@@ -4606,7 +4598,7 @@ 
Files

 
 ast_struct! {
     /// A try block: `try { ... }`.
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "full")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "full")))]
     pub struct ExprTryBlock #full {
         pub attrs: Vec<Attribute>,
         pub try_token: Token![try],
@@ -4616,7 +4608,7 @@ 
Files

 
 ast_struct! {
     /// A tuple expression: `(a, b, c, d)`.
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "full")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "full")))]
     pub struct ExprTuple #full {
         pub attrs: Vec<Attribute>,
         pub paren_token: token::Paren,
@@ -4626,7 +4618,7 @@ 
Files

 
 ast_struct! {
     /// A unary operation: `!x`, `*x`.
-    #[cfg_attr(doc_cfg, doc(cfg(any(feature = "full", feature = "derive"))))]
+    #[cfg_attr(docsrs, doc(cfg(any(feature = "full", feature = "derive"))))]
     pub struct ExprUnary {
         pub attrs: Vec<Attribute>,
         pub op: UnOp,
@@ -4636,7 +4628,7 @@ 
Files

 
 ast_struct! {
     /// An unsafe block: `unsafe { ... }`.
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "full")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "full")))]
     pub struct ExprUnsafe #full {
         pub attrs: Vec<Attribute>,
         pub unsafe_token: Token![unsafe],
@@ -4646,7 +4638,7 @@ 
Files

 
 ast_struct! {
     /// A while loop: `while expr { ... }`.
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "full")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "full")))]
     pub struct ExprWhile #full {
         pub attrs: Vec<Attribute>,
         pub label: Option<Label>,
@@ -4658,7 +4650,7 @@ 
Files

 
 ast_struct! {
     /// A yield expression: `yield expr`.
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "full")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "full")))]
     pub struct ExprYield #full {
         pub attrs: Vec<Attribute>,
         pub yield_token: Token![yield],
@@ -4777,7 +4769,7 @@ 
Files

     /// `..`, while the latter parses as `match (0..S) {}` implying tighter
     /// precedence for `..` than struct init, a contradiction.
     #[cfg(all(feature = "full", feature = "parsing"))]
-    #[cfg_attr(doc_cfg, doc(cfg(all(feature = "full", feature = "parsing"))))]
+    #[cfg_attr(docsrs, doc(cfg(all(feature = "full", feature = "parsing"))))]
     pub fn parse_without_eager_brace(input: ParseStream) -> Result<Expr> {
         parsing::ambiguous_expr(input, parsing::AllowStruct(false))
     }
@@ -4839,7 +4831,7 @@ 
Files

     ///
     /// [`parse_without_eager_brace`]: Self::parse_without_eager_brace
     #[cfg(all(feature = "full", feature = "parsing"))]
-    #[cfg_attr(doc_cfg, doc(cfg(all(feature = "full", feature = "parsing"))))]
+    #[cfg_attr(docsrs, doc(cfg(all(feature = "full", feature = "parsing"))))]
     pub fn parse_with_earlier_boundary_rule(input: ParseStream) -> Result<Expr> {
         parsing::parse_with_earlier_boundary_rule(input)
     }
@@ -4893,7 +4885,7 @@ 
Files

 ast_enum! {
     /// A struct or tuple struct field accessed in a struct literal or field
     /// expression.
-    #[cfg_attr(doc_cfg, doc(cfg(any(feature = "full", feature = "derive"))))]
+    #[cfg_attr(docsrs, doc(cfg(any(feature = "full", feature = "derive"))))]
     pub enum Member {
         /// A named field like `self.x`.
         Named(Ident),
@@ -4960,7 +4952,7 @@ 
Files

 
 ast_struct! {
     /// The index of an unnamed tuple struct field.
-    #[cfg_attr(doc_cfg, doc(cfg(any(feature = "full", feature = "derive"))))]
+    #[cfg_attr(docsrs, doc(cfg(any(feature = "full", feature = "derive"))))]
     pub struct Index {
         pub index: u32,
         pub span: Span,
@@ -5004,7 +4996,7 @@ 
Files

 
 ast_struct! {
     /// A field-value pair in a struct literal.
-    #[cfg_attr(doc_cfg, doc(cfg(any(feature = "full", feature = "derive"))))]
+    #[cfg_attr(docsrs, doc(cfg(any(feature = "full", feature = "derive"))))]
     pub struct FieldValue {
         pub attrs: Vec<Attribute>,
         pub member: Member,
@@ -5020,7 +5012,7 @@ 
Files

 #[cfg(feature = "full")]
 ast_struct! {
     /// A lifetime labeling a `for`, `while`, or `loop`.
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "full")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "full")))]
     pub struct Label {
         pub name: Lifetime,
         pub colon_token: Token![:],
@@ -5046,7 +5038,7 @@ 
Files

     /// #   false
     /// # }
     /// ```
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "full")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "full")))]
     pub struct Arm {
         pub attrs: Vec<Attribute>,
         pub pat: Pat,
@@ -5060,7 +5052,7 @@ 
Files

 #[cfg(feature = "full")]
 ast_enum! {
     /// Limit types of a range, inclusive or exclusive.
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "full")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "full")))]
     pub enum RangeLimits {
         /// Inclusive at the beginning, exclusive at the end.
         HalfOpen(Token![..]),
@@ -5132,7 +5124,7 @@ 
Files

     #[cfg(feature = "full")]
     pub(super) struct AllowStruct(pub bool);
 
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "parsing")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "parsing")))]
     impl Parse for Expr {
         fn parse(input: ParseStream) -> Result<Self> {
             ambiguous_expr(
@@ -5868,7 +5860,7 @@ 
Files

         }))
     }
 
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "parsing")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "parsing")))]
     impl Parse for ExprMacro {
         fn parse(input: ParseStream) -> Result<Self> {
             Ok(ExprMacro {
@@ -5963,7 +5955,7 @@ 
Files

     }
 
     #[cfg(feature = "full")]
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "parsing")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "parsing")))]
     impl Parse for ExprArray {
         fn parse(input: ParseStream) -> Result<Self> {
             let content;
@@ -5989,7 +5981,7 @@ 
Files

     }
 
     #[cfg(feature = "full")]
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "parsing")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "parsing")))]
     impl Parse for ExprRepeat {
         fn parse(input: ParseStream) -> Result<Self> {
             let content;
@@ -6022,7 +6014,7 @@ 
Files

         }
     }
 
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "parsing")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "parsing")))]
     impl Parse for ExprLit {
         fn parse(input: ParseStream) -> Result<Self> {
             Ok(ExprLit {
@@ -6067,7 +6059,7 @@ 
Files

     }
 
     #[cfg(feature = "full")]
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "parsing")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "parsing")))]
     impl Parse for ExprParen {
         fn parse(input: ParseStream) -> Result<Self> {
             expr_paren(input)
@@ -6084,10 +6076,10 @@ 
Files

     }
 
     #[cfg(feature = "full")]
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "parsing")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "parsing")))]
     impl Parse for ExprLet {
         fn parse(input: ParseStream) -> Result<Self> {
-            let allow_struct = AllowStruct(false);
+            let allow_struct = AllowStruct(true);
             expr_let(input, allow_struct)
         }
     }
@@ -6107,7 +6099,7 @@ 
Files

     }
 
     #[cfg(feature = "full")]
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "parsing")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "parsing")))]
     impl Parse for ExprIf {
         fn parse(input: ParseStream) -> Result<Self> {
             let attrs = input.call(Attribute::parse_outer)?;
@@ -6162,7 +6154,7 @@ 
Files

     }
 
     #[cfg(feature = "full")]
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "parsing")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "parsing")))]
     impl Parse for ExprInfer {
         fn parse(input: ParseStream) -> Result<Self> {
             Ok(ExprInfer {
@@ -6173,7 +6165,7 @@ 
Files

     }
 
     #[cfg(feature = "full")]
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "parsing")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "parsing")))]
     impl Parse for ExprForLoop {
         fn parse(input: ParseStream) -> Result<Self> {
             let mut attrs = input.call(Attribute::parse_outer)?;
@@ -6203,7 +6195,7 @@ 
Files

     }
 
     #[cfg(feature = "full")]
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "parsing")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "parsing")))]
     impl Parse for ExprLoop {
         fn parse(input: ParseStream) -> Result<Self> {
             let mut attrs = input.call(Attribute::parse_outer)?;
@@ -6225,7 +6217,7 @@ 
Files

     }
 
     #[cfg(feature = "full")]
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "parsing")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "parsing")))]
     impl Parse for ExprMatch {
         fn parse(input: ParseStream) -> Result<Self> {
             let mut attrs = input.call(Attribute::parse_outer)?;
@@ -6259,7 +6251,7 @@ 
Files

         ) => {
             $(
                 #[cfg(all(feature = "full", feature = "printing"))]
-                #[cfg_attr(doc_cfg, doc(cfg(feature = "parsing")))]
+                #[cfg_attr(docsrs, doc(cfg(feature = "parsing")))]
                 impl Parse for $expr_type {
                     fn parse(input: ParseStream) -> Result<Self> {
                         let mut expr: Expr = input.parse()?;
@@ -6291,7 +6283,7 @@ 
Files

     }
 
     #[cfg(feature = "full")]
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "parsing")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "parsing")))]
     impl Parse for ExprUnary {
         fn parse(input: ParseStream) -> Result<Self> {
             let attrs = Vec::new();
@@ -6314,7 +6306,7 @@ 
Files

     }
 
     #[cfg(feature = "full")]
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "parsing")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "parsing")))]
     impl Parse for ExprClosure {
         fn parse(input: ParseStream) -> Result<Self> {
             let allow_struct = AllowStruct(true);
@@ -6323,7 +6315,7 @@ 
Files

     }
 
     #[cfg(feature = "full")]
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "parsing")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "parsing")))]
     impl Parse for ExprReference {
         fn parse(input: ParseStream) -> Result<Self> {
             let allow_struct = AllowStruct(true);
@@ -6337,7 +6329,7 @@ 
Files

     }
 
     #[cfg(feature = "full")]
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "parsing")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "parsing")))]
     impl Parse for ExprBreak {
         fn parse(input: ParseStream) -> Result<Self> {
             let allow_struct = AllowStruct(true);
@@ -6346,7 +6338,7 @@ 
Files

     }
 
     #[cfg(feature = "full")]
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "parsing")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "parsing")))]
     impl Parse for ExprReturn {
         fn parse(input: ParseStream) -> Result<Self> {
             Ok(ExprReturn {
@@ -6364,7 +6356,7 @@ 
Files

     }
 
     #[cfg(feature = "full")]
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "parsing")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "parsing")))]
     impl Parse for ExprTryBlock {
         fn parse(input: ParseStream) -> Result<Self> {
             Ok(ExprTryBlock {
@@ -6376,7 +6368,7 @@ 
Files

     }
 
     #[cfg(feature = "full")]
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "parsing")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "parsing")))]
     impl Parse for ExprYield {
         fn parse(input: ParseStream) -> Result<Self> {
             Ok(ExprYield {
@@ -6450,7 +6442,7 @@ 
Files

     }
 
     #[cfg(feature = "full")]
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "parsing")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "parsing")))]
     impl Parse for ExprAsync {
         fn parse(input: ParseStream) -> Result<Self> {
             Ok(ExprAsync {
@@ -6499,7 +6491,7 @@ 
Files

     }
 
     #[cfg(feature = "full")]
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "parsing")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "parsing")))]
     impl Parse for ExprWhile {
         fn parse(input: ParseStream) -> Result<Self> {
             let mut attrs = input.call(Attribute::parse_outer)?;
@@ -6523,7 +6515,7 @@ 
Files

     }
 
     #[cfg(feature = "full")]
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "parsing")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "parsing")))]
     impl Parse for ExprConst {
         fn parse(input: ParseStream) -> Result<Self> {
             let const_token: Token![const] = input.parse()?;
@@ -6542,7 +6534,7 @@ 
Files

     }
 
     #[cfg(feature = "full")]
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "parsing")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "parsing")))]
     impl Parse for Label {
         fn parse(input: ParseStream) -> Result<Self> {
             Ok(Label {
@@ -6553,7 +6545,7 @@ 
Files

     }
 
     #[cfg(feature = "full")]
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "parsing")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "parsing")))]
     impl Parse for Option<Label> {
         fn parse(input: ParseStream) -> Result<Self> {
             if input.peek(Lifetime) {
@@ -6565,7 +6557,7 @@ 
Files

     }
 
     #[cfg(feature = "full")]
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "parsing")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "parsing")))]
     impl Parse for ExprContinue {
         fn parse(input: ParseStream) -> Result<Self> {
             Ok(ExprContinue {
@@ -6610,7 +6602,7 @@ 
Files

         })
     }
 
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "parsing")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "parsing")))]
     impl Parse for FieldValue {
         fn parse(input: ParseStream) -> Result<Self> {
             let attrs = input.call(Attribute::parse_outer)?;
@@ -6639,7 +6631,7 @@ 
Files

         }
     }
 
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "parsing")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "parsing")))]
     impl Parse for ExprStruct {
         fn parse(input: ParseStream) -> Result<Self> {
             let (qself, path) = path::parsing::qpath(input, true)?;
@@ -6693,7 +6685,7 @@ 
Files

     }
 
     #[cfg(feature = "full")]
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "parsing")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "parsing")))]
     impl Parse for ExprUnsafe {
         fn parse(input: ParseStream) -> Result<Self> {
             let unsafe_token: Token![unsafe] = input.parse()?;
@@ -6712,7 +6704,7 @@ 
Files

     }
 
     #[cfg(feature = "full")]
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "parsing")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "parsing")))]
     impl Parse for ExprBlock {
         fn parse(input: ParseStream) -> Result<Self> {
             let mut attrs = input.call(Attribute::parse_outer)?;
@@ -6764,7 +6756,7 @@ 
Files

     }
 
     #[cfg(feature = "full")]
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "parsing")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "parsing")))]
     impl Parse for RangeLimits {
         fn parse(input: ParseStream) -> Result<Self> {
             let lookahead = input.lookahead1();
@@ -6801,7 +6793,7 @@ 
Files

         }
     }
 
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "parsing")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "parsing")))]
     impl Parse for ExprPath {
         fn parse(input: ParseStream) -> Result<Self> {
             #[cfg(not(feature = "full"))]
@@ -6815,7 +6807,7 @@ 
Files

         }
     }
 
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "parsing")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "parsing")))]
     impl Parse for Member {
         fn parse(input: ParseStream) -> Result<Self> {
             if input.peek(Ident) {
@@ -6829,7 +6821,7 @@ 
Files

     }
 
     #[cfg(feature = "full")]
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "parsing")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "parsing")))]
     impl Parse for Arm {
         fn parse(input: ParseStream) -> Result<Arm> {
             let requires_comma;
@@ -6862,7 +6854,7 @@ 
Files

         }
     }
 
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "parsing")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "parsing")))]
     impl Parse for Index {
         fn parse(input: ParseStream) -> Result<Self> {
             let lit: LitInt = input.parse()?;
@@ -7021,7 +7013,7 @@ 
Files

             //     if x == (Struct {}) {}
             //
             if needs_group {
-                fixup = FixupContext::default();
+                fixup = FixupContext::NONE;
             }
             |tokens: &mut TokenStream| print_expr(expr, tokens, fixup)
         };
@@ -7037,7 +7029,7 @@ 
Files

     pub(crate) fn print_expr(expr: &Expr, tokens: &mut TokenStream, mut fixup: FixupContext) {
         let needs_group = fixup.would_cause_statement_boundary(expr);
         if needs_group {
-            fixup = FixupContext::default();
+            fixup = FixupContext::NONE;
         }
 
         let do_print_expr = |tokens: &mut TokenStream| match expr {
@@ -7090,7 +7082,7 @@ 
Files

     }
 
     #[cfg(feature = "full")]
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "printing")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "printing")))]
     impl ToTokens for ExprArray {
         fn to_tokens(&self, tokens: &mut TokenStream) {
             outer_attrs_to_tokens(&self.attrs, tokens);
@@ -7101,11 +7093,10 @@ 
Files

     }
 
     #[cfg(feature = "full")]
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "printing")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "printing")))]
     impl ToTokens for ExprAssign {
         fn to_tokens(&self, tokens: &mut TokenStream) {
-            let fixup = FixupContext::default();
-            print_expr_assign(self, tokens, fixup);
+            print_expr_assign(self, tokens, FixupContext::NONE);
         }
     }
 
@@ -7128,7 +7119,7 @@ 
Files

     }
 
     #[cfg(feature = "full")]
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "printing")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "printing")))]
     impl ToTokens for ExprAsync {
         fn to_tokens(&self, tokens: &mut TokenStream) {
             outer_attrs_to_tokens(&self.attrs, tokens);
@@ -7139,11 +7130,10 @@ 
Files

     }
 
     #[cfg(feature = "full")]
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "printing")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "printing")))]
     impl ToTokens for ExprAwait {
         fn to_tokens(&self, tokens: &mut TokenStream) {
-            let fixup = FixupContext::default();
-            print_expr_await(self, tokens, fixup);
+            print_expr_await(self, tokens, FixupContext::NONE);
         }
     }
 
@@ -7160,14 +7150,14 @@ 
Files

         e.await_token.to_tokens(tokens);
     }
 
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "printing")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "printing")))]
     impl ToTokens for ExprBinary {
         fn to_tokens(&self, tokens: &mut TokenStream) {
             print_expr_binary(
                 self,
                 tokens,
                 #[cfg(feature = "full")]
-                FixupContext::default(),
+                FixupContext::NONE,
             );
         }
     }
@@ -7233,7 +7223,7 @@ 
Files

     }
 
     #[cfg(feature = "full")]
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "printing")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "printing")))]
     impl ToTokens for ExprBlock {
         fn to_tokens(&self, tokens: &mut TokenStream) {
             outer_attrs_to_tokens(&self.attrs, tokens);
@@ -7246,11 +7236,10 @@ 
Files

     }
 
     #[cfg(feature = "full")]
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "printing")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "printing")))]
     impl ToTokens for ExprBreak {
         fn to_tokens(&self, tokens: &mut TokenStream) {
-            let fixup = FixupContext::default();
-            print_expr_break(self, tokens, fixup);
+            print_expr_break(self, tokens, FixupContext::NONE);
         }
     }
 
@@ -7264,14 +7253,14 @@ 
Files

         }
     }
 
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "printing")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "printing")))]
     impl ToTokens for ExprCall {
         fn to_tokens(&self, tokens: &mut TokenStream) {
             print_expr_call(
                 self,
                 tokens,
                 #[cfg(feature = "full")]
-                FixupContext::default(),
+                FixupContext::NONE,
             );
         }
     }
@@ -7301,14 +7290,14 @@ 
Files

         });
     }
 
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "printing")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "printing")))]
     impl ToTokens for ExprCast {
         fn to_tokens(&self, tokens: &mut TokenStream) {
             print_expr_cast(
                 self,
                 tokens,
                 #[cfg(feature = "full")]
-                FixupContext::default(),
+                FixupContext::NONE,
             );
         }
     }
@@ -7331,7 +7320,7 @@ 
Files

     }
 
     #[cfg(feature = "full")]
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "printing")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "printing")))]
     impl ToTokens for ExprClosure {
         fn to_tokens(&self, tokens: &mut TokenStream) {
             outer_attrs_to_tokens(&self.attrs, tokens);
@@ -7355,7 +7344,7 @@ 
Files

     }
 
     #[cfg(feature = "full")]
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "printing")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "printing")))]
     impl ToTokens for ExprConst {
         fn to_tokens(&self, tokens: &mut TokenStream) {
             outer_attrs_to_tokens(&self.attrs, tokens);
@@ -7368,7 +7357,7 @@ 
Files

     }
 
     #[cfg(feature = "full")]
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "printing")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "printing")))]
     impl ToTokens for ExprContinue {
         fn to_tokens(&self, tokens: &mut TokenStream) {
             outer_attrs_to_tokens(&self.attrs, tokens);
@@ -7377,14 +7366,14 @@ 
Files

         }
     }
 
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "printing")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "printing")))]
     impl ToTokens for ExprField {
         fn to_tokens(&self, tokens: &mut TokenStream) {
             print_expr_field(
                 self,
                 tokens,
                 #[cfg(feature = "full")]
-                FixupContext::default(),
+                FixupContext::NONE,
             );
         }
     }
@@ -7407,7 +7396,7 @@ 
Files

     }
 
     #[cfg(feature = "full")]
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "printing")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "printing")))]
     impl ToTokens for ExprForLoop {
         fn to_tokens(&self, tokens: &mut TokenStream) {
             outer_attrs_to_tokens(&self.attrs, tokens);
@@ -7423,7 +7412,7 @@ 
Files

         }
     }
 
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "printing")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "printing")))]
     impl ToTokens for ExprGroup {
         fn to_tokens(&self, tokens: &mut TokenStream) {
             outer_attrs_to_tokens(&self.attrs, tokens);
@@ -7434,7 +7423,7 @@ 
Files

     }
 
     #[cfg(feature = "full")]
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "printing")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "printing")))]
     impl ToTokens for ExprIf {
         fn to_tokens(&self, tokens: &mut TokenStream) {
             outer_attrs_to_tokens(&self.attrs, tokens);
@@ -7472,14 +7461,14 @@ 
Files

         }
     }
 
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "printing")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "printing")))]
     impl ToTokens for ExprIndex {
         fn to_tokens(&self, tokens: &mut TokenStream) {
             print_expr_index(
                 self,
                 tokens,
                 #[cfg(feature = "full")]
-                FixupContext::default(),
+                FixupContext::NONE,
             );
         }
     }
@@ -7503,7 +7492,7 @@ 
Files

     }
 
     #[cfg(feature = "full")]
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "printing")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "printing")))]
     impl ToTokens for ExprInfer {
         fn to_tokens(&self, tokens: &mut TokenStream) {
             outer_attrs_to_tokens(&self.attrs, tokens);
@@ -7512,11 +7501,10 @@ 
Files

     }
 
     #[cfg(feature = "full")]
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "printing")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "printing")))]
     impl ToTokens for ExprLet {
         fn to_tokens(&self, tokens: &mut TokenStream) {
-            let fixup = FixupContext::default();
-            print_expr_let(self, tokens, fixup);
+            print_expr_let(self, tokens, FixupContext::NONE);
         }
     }
 
@@ -7530,11 +7518,11 @@ 
Files

             &e.expr,
             fixup.needs_group_as_let_scrutinee(&e.expr),
             tokens,
-            FixupContext::default(),
+            FixupContext::NONE,
         );
     }
 
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "printing")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "printing")))]
     impl ToTokens for ExprLit {
         fn to_tokens(&self, tokens: &mut TokenStream) {
             outer_attrs_to_tokens(&self.attrs, tokens);
@@ -7543,7 +7531,7 @@ 
Files

     }
 
     #[cfg(feature = "full")]
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "printing")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "printing")))]
     impl ToTokens for ExprLoop {
         fn to_tokens(&self, tokens: &mut TokenStream) {
             outer_attrs_to_tokens(&self.attrs, tokens);
@@ -7556,7 +7544,7 @@ 
Files

         }
     }
 
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "printing")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "printing")))]
     impl ToTokens for ExprMacro {
         fn to_tokens(&self, tokens: &mut TokenStream) {
             outer_attrs_to_tokens(&self.attrs, tokens);
@@ -7565,7 +7553,7 @@ 
Files

     }
 
     #[cfg(feature = "full")]
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "printing")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "printing")))]
     impl ToTokens for ExprMatch {
         fn to_tokens(&self, tokens: &mut TokenStream) {
             outer_attrs_to_tokens(&self.attrs, tokens);
@@ -7589,14 +7577,14 @@ 
Files

         }
     }
 
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "printing")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "printing")))]
     impl ToTokens for ExprMethodCall {
         fn to_tokens(&self, tokens: &mut TokenStream) {
             print_expr_method_call(
                 self,
                 tokens,
                 #[cfg(feature = "full")]
-                FixupContext::default(),
+                FixupContext::NONE,
             );
         }
     }
@@ -7622,7 +7610,7 @@ 
Files

         });
     }
 
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "printing")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "printing")))]
     impl ToTokens for ExprParen {
         fn to_tokens(&self, tokens: &mut TokenStream) {
             outer_attrs_to_tokens(&self.attrs, tokens);
@@ -7632,7 +7620,7 @@ 
Files

         }
     }
 
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "printing")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "printing")))]
     impl ToTokens for ExprPath {
         fn to_tokens(&self, tokens: &mut TokenStream) {
             outer_attrs_to_tokens(&self.attrs, tokens);
@@ -7641,11 +7629,10 @@ 
Files

     }
 
     #[cfg(feature = "full")]
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "printing")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "printing")))]
     impl ToTokens for ExprRange {
         fn to_tokens(&self, tokens: &mut TokenStream) {
-            let fixup = FixupContext::default();
-            print_expr_range(self, tokens, fixup);
+            print_expr_range(self, tokens, FixupContext::NONE);
         }
     }
 
@@ -7671,14 +7658,14 @@ 
Files

         }
     }
 
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "printing")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "printing")))]
     impl ToTokens for ExprReference {
         fn to_tokens(&self, tokens: &mut TokenStream) {
             print_expr_reference(
                 self,
                 tokens,
                 #[cfg(feature = "full")]
-                FixupContext::default(),
+                FixupContext::NONE,
             );
         }
     }
@@ -7701,7 +7688,7 @@ 
Files

     }
 
     #[cfg(feature = "full")]
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "printing")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "printing")))]
     impl ToTokens for ExprRepeat {
         fn to_tokens(&self, tokens: &mut TokenStream) {
             outer_attrs_to_tokens(&self.attrs, tokens);
@@ -7714,11 +7701,10 @@ 
Files

     }
 
     #[cfg(feature = "full")]
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "printing")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "printing")))]
     impl ToTokens for ExprReturn {
         fn to_tokens(&self, tokens: &mut TokenStream) {
-            let fixup = FixupContext::default();
-            print_expr_return(self, tokens, fixup);
+            print_expr_return(self, tokens, FixupContext::NONE);
         }
     }
 
@@ -7731,7 +7717,7 @@ 
Files

         }
     }
 
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "printing")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "printing")))]
     impl ToTokens for ExprStruct {
         fn to_tokens(&self, tokens: &mut TokenStream) {
             outer_attrs_to_tokens(&self.attrs, tokens);
@@ -7749,11 +7735,10 @@ 
Files

     }
 
     #[cfg(feature = "full")]
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "printing")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "printing")))]
     impl ToTokens for ExprTry {
         fn to_tokens(&self, tokens: &mut TokenStream) {
-            let fixup = FixupContext::default();
-            print_expr_try(self, tokens, fixup);
+            print_expr_try(self, tokens, FixupContext::NONE);
         }
     }
 
@@ -7770,7 +7755,7 @@ 
Files

     }
 
     #[cfg(feature = "full")]
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "printing")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "printing")))]
     impl ToTokens for ExprTryBlock {
         fn to_tokens(&self, tokens: &mut TokenStream) {
             outer_attrs_to_tokens(&self.attrs, tokens);
@@ -7780,7 +7765,7 @@ 
Files

     }
 
     #[cfg(feature = "full")]
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "printing")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "printing")))]
     impl ToTokens for ExprTuple {
         fn to_tokens(&self, tokens: &mut TokenStream) {
             outer_attrs_to_tokens(&self.attrs, tokens);
@@ -7795,14 +7780,14 @@ 
Files

         }
     }
 
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "printing")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "printing")))]
     impl ToTokens for ExprUnary {
         fn to_tokens(&self, tokens: &mut TokenStream) {
             print_expr_unary(
                 self,
                 tokens,
                 #[cfg(feature = "full")]
-                FixupContext::default(),
+                FixupContext::NONE,
             );
         }
     }
@@ -7824,7 +7809,7 @@ 
Files

     }
 
     #[cfg(feature = "full")]
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "printing")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "printing")))]
     impl ToTokens for ExprUnsafe {
         fn to_tokens(&self, tokens: &mut TokenStream) {
             outer_attrs_to_tokens(&self.attrs, tokens);
@@ -7837,7 +7822,7 @@ 
Files

     }
 
     #[cfg(feature = "full")]
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "printing")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "printing")))]
     impl ToTokens for ExprWhile {
         fn to_tokens(&self, tokens: &mut TokenStream) {
             outer_attrs_to_tokens(&self.attrs, tokens);
@@ -7852,11 +7837,10 @@ 
Files

     }
 
     #[cfg(feature = "full")]
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "printing")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "printing")))]
     impl ToTokens for ExprYield {
         fn to_tokens(&self, tokens: &mut TokenStream) {
-            let fixup = FixupContext::default();
-            print_expr_yield(self, tokens, fixup);
+            print_expr_yield(self, tokens, FixupContext::NONE);
         }
     }
 
@@ -7870,7 +7854,7 @@ 
Files

     }
 
     #[cfg(feature = "full")]
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "printing")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "printing")))]
     impl ToTokens for Arm {
         fn to_tokens(&self, tokens: &mut TokenStream) {
             tokens.append_all(&self.attrs);
@@ -7885,7 +7869,7 @@ 
Files

         }
     }
 
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "printing")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "printing")))]
     impl ToTokens for FieldValue {
         fn to_tokens(&self, tokens: &mut TokenStream) {
             outer_attrs_to_tokens(&self.attrs, tokens);
@@ -7897,7 +7881,7 @@ 
Files

         }
     }
 
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "printing")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "printing")))]
     impl ToTokens for Index {
         fn to_tokens(&self, tokens: &mut TokenStream) {
             let mut lit = Literal::i64_unsuffixed(i64::from(self.index));
@@ -7907,7 +7891,7 @@ 
Files

     }
 
     #[cfg(feature = "full")]
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "printing")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "printing")))]
     impl ToTokens for Label {
         fn to_tokens(&self, tokens: &mut TokenStream) {
             self.name.to_tokens(tokens);
@@ -7915,7 +7899,7 @@ 
Files

         }
     }
 
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "printing")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "printing")))]
     impl ToTokens for Member {
         fn to_tokens(&self, tokens: &mut TokenStream) {
             match self {
@@ -7926,7 +7910,7 @@ 
Files

     }
 
     #[cfg(feature = "full")]
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "printing")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "printing")))]
     impl ToTokens for RangeLimits {
         fn to_tokens(&self, tokens: &mut TokenStream) {
             match self {
diff --git a/src/syn/ext.rs.html b/src/syn/ext.rs.html
index 112bea7e9b..0242628ae7 100644
--- a/src/syn/ext.rs.html
+++ b/src/syn/ext.rs.html
@@ -1,4 +1,4 @@
-ext.rs - source

     use crate::file::File;
     use crate::parse::{Parse, ParseStream};
 
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "parsing")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "parsing")))]
     impl Parse for File {
         fn parse(input: ParseStream) -> Result<Self> {
             Ok(File {
@@ -252,7 +252,7 @@ 
Files

     use proc_macro2::TokenStream;
     use quote::{ToTokens, TokenStreamExt};
 
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "printing")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "printing")))]
     impl ToTokens for File {
         fn to_tokens(&self, tokens: &mut TokenStream) {
             tokens.append_all(self.attrs.inner());
diff --git a/src/syn/fixup.rs.html b/src/syn/fixup.rs.html
index 0ae16a2fce..39d096a3a2 100644
--- a/src/syn/fixup.rs.html
+++ b/src/syn/fixup.rs.html
@@ -1,4 +1,4 @@
-fixup.rs - source

 213
 214
 215
+216
+217
+218
 
use crate::classify;
 use crate::expr::Expr;
 use crate::precedence::Precedence;
 
-#[derive(Copy, Clone, Debug)]
-pub(crate) struct FixupContext {
+pub(crate) struct FixupContext {
     // Print expression such that it can be parsed back as a statement
     // consisting of the original expression.
     //
@@ -305,27 +307,23 @@ 
Files

     parenthesize_exterior_struct_lit: bool,
 }
 
-/// The default amount of fixing is minimal fixing. Fixups should be turned on
-/// in a targeted fashion where needed.
-impl Default for FixupContext {
-    fn default() -> Self {
-        FixupContext {
-            stmt: false,
-            leftmost_subexpression_in_stmt: false,
-            match_arm: false,
-            leftmost_subexpression_in_match_arm: false,
-            parenthesize_exterior_struct_lit: false,
-        }
-    }
-}
-
 impl FixupContext {
+    /// The default amount of fixing is minimal fixing. Fixups should be turned
+    /// on in a targeted fashion where needed.
+    pub const NONE: Self = FixupContext {
+        stmt: false,
+        leftmost_subexpression_in_stmt: false,
+        match_arm: false,
+        leftmost_subexpression_in_match_arm: false,
+        parenthesize_exterior_struct_lit: false,
+    };
+
     /// Create the initial fixup for printing an expression in statement
     /// position.
     pub fn new_stmt() -> Self {
         FixupContext {
             stmt: true,
-            ..FixupContext::default()
+            ..FixupContext::NONE
         }
     }
 
@@ -334,7 +332,7 @@ 
Files

     pub fn new_match_arm() -> Self {
         FixupContext {
             match_arm: true,
-            ..FixupContext::default()
+            ..FixupContext::NONE
         }
     }
 
@@ -345,7 +343,7 @@ 
Files

     pub fn new_condition() -> Self {
         FixupContext {
             parenthesize_exterior_struct_lit: true,
-            ..FixupContext::default()
+            ..FixupContext::NONE
         }
     }
 
@@ -430,4 +428,12 @@ 
Files

             || Precedence::of_rhs(expr) <= Precedence::And
     }
 }
+
+impl Copy for FixupContext {}
+
+impl Clone for FixupContext {
+    fn clone(&self) -> Self {
+        *self
+    }
+}
 

\ No newline at end of file
diff --git a/src/syn/gen/clone.rs.html b/src/syn/gen/clone.rs.html
index 70d3d45757..85003d7f60 100644
--- a/src/syn/gen/clone.rs.html
+++ b/src/syn/gen/clone.rs.html
@@ -1,4 +1,4 @@
-clone.rs - source

 
 #![allow(clippy::clone_on_copy, clippy::expl_impl_clone_on_copy)]
 #[cfg(any(feature = "derive", feature = "full"))]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "clone-impls")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "clone-impls")))]
 impl Clone for crate::Abi {
     fn clone(&self) -> Self {
         crate::Abi {
@@ -2224,7 +2224,7 @@ 
Files

     }
 }
 #[cfg(any(feature = "derive", feature = "full"))]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "clone-impls")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "clone-impls")))]
 impl Clone for crate::AngleBracketedGenericArguments {
     fn clone(&self) -> Self {
         crate::AngleBracketedGenericArguments {
@@ -2236,7 +2236,7 @@ 
Files

     }
 }
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "clone-impls")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "clone-impls")))]
 impl Clone for crate::Arm {
     fn clone(&self) -> Self {
         crate::Arm {
@@ -2250,7 +2250,7 @@ 
Files

     }
 }
 #[cfg(any(feature = "derive", feature = "full"))]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "clone-impls")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "clone-impls")))]
 impl Clone for crate::AssocConst {
     fn clone(&self) -> Self {
         crate::AssocConst {
@@ -2262,7 +2262,7 @@ 
Files

     }
 }
 #[cfg(any(feature = "derive", feature = "full"))]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "clone-impls")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "clone-impls")))]
 impl Clone for crate::AssocType {
     fn clone(&self) -> Self {
         crate::AssocType {
@@ -2274,17 +2274,17 @@ 
Files

     }
 }
 #[cfg(any(feature = "derive", feature = "full"))]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "clone-impls")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "clone-impls")))]
 impl Copy for crate::AttrStyle {}
 #[cfg(any(feature = "derive", feature = "full"))]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "clone-impls")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "clone-impls")))]
 impl Clone for crate::AttrStyle {
     fn clone(&self) -> Self {
         *self
     }
 }
 #[cfg(any(feature = "derive", feature = "full"))]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "clone-impls")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "clone-impls")))]
 impl Clone for crate::Attribute {
     fn clone(&self) -> Self {
         crate::Attribute {
@@ -2296,7 +2296,7 @@ 
Files

     }
 }
 #[cfg(any(feature = "derive", feature = "full"))]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "clone-impls")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "clone-impls")))]
 impl Clone for crate::BareFnArg {
     fn clone(&self) -> Self {
         crate::BareFnArg {
@@ -2307,7 +2307,7 @@ 
Files

     }
 }
 #[cfg(any(feature = "derive", feature = "full"))]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "clone-impls")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "clone-impls")))]
 impl Clone for crate::BareVariadic {
     fn clone(&self) -> Self {
         crate::BareVariadic {
@@ -2319,17 +2319,17 @@ 
Files

     }
 }
 #[cfg(any(feature = "derive", feature = "full"))]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "clone-impls")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "clone-impls")))]
 impl Copy for crate::BinOp {}
 #[cfg(any(feature = "derive", feature = "full"))]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "clone-impls")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "clone-impls")))]
 impl Clone for crate::BinOp {
     fn clone(&self) -> Self {
         *self
     }
 }
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "clone-impls")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "clone-impls")))]
 impl Clone for crate::Block {
     fn clone(&self) -> Self {
         crate::Block {
@@ -2339,7 +2339,7 @@ 
Files

     }
 }
 #[cfg(any(feature = "derive", feature = "full"))]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "clone-impls")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "clone-impls")))]
 impl Clone for crate::BoundLifetimes {
     fn clone(&self) -> Self {
         crate::BoundLifetimes {
@@ -2351,7 +2351,7 @@ 
Files

     }
 }
 #[cfg(any(feature = "derive", feature = "full"))]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "clone-impls")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "clone-impls")))]
 impl Clone for crate::ConstParam {
     fn clone(&self) -> Self {
         crate::ConstParam {
@@ -2366,7 +2366,7 @@ 
Files

     }
 }
 #[cfg(any(feature = "derive", feature = "full"))]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "clone-impls")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "clone-impls")))]
 impl Clone for crate::Constraint {
     fn clone(&self) -> Self {
         crate::Constraint {
@@ -2378,7 +2378,7 @@ 
Files

     }
 }
 #[cfg(feature = "derive")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "clone-impls")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "clone-impls")))]
 impl Clone for crate::Data {
     fn clone(&self) -> Self {
         match self {
@@ -2389,7 +2389,7 @@ 
Files

     }
 }
 #[cfg(feature = "derive")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "clone-impls")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "clone-impls")))]
 impl Clone for crate::DataEnum {
     fn clone(&self) -> Self {
         crate::DataEnum {
@@ -2400,7 +2400,7 @@ 
Files

     }
 }
 #[cfg(feature = "derive")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "clone-impls")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "clone-impls")))]
 impl Clone for crate::DataStruct {
     fn clone(&self) -> Self {
         crate::DataStruct {
@@ -2411,7 +2411,7 @@ 
Files

     }
 }
 #[cfg(feature = "derive")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "clone-impls")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "clone-impls")))]
 impl Clone for crate::DataUnion {
     fn clone(&self) -> Self {
         crate::DataUnion {
@@ -2421,7 +2421,7 @@ 
Files

     }
 }
 #[cfg(feature = "derive")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "clone-impls")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "clone-impls")))]
 impl Clone for crate::DeriveInput {
     fn clone(&self) -> Self {
         crate::DeriveInput {
@@ -2434,7 +2434,7 @@ 
Files

     }
 }
 #[cfg(any(feature = "derive", feature = "full"))]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "clone-impls")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "clone-impls")))]
 impl Clone for crate::Expr {
     fn clone(&self) -> Self {
         match self {
@@ -2507,7 +2507,7 @@ 
Files

     }
 }
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "clone-impls")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "clone-impls")))]
 impl Clone for crate::ExprArray {
     fn clone(&self) -> Self {
         crate::ExprArray {
@@ -2518,7 +2518,7 @@ 
Files

     }
 }
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "clone-impls")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "clone-impls")))]
 impl Clone for crate::ExprAssign {
     fn clone(&self) -> Self {
         crate::ExprAssign {
@@ -2530,7 +2530,7 @@ 
Files

     }
 }
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "clone-impls")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "clone-impls")))]
 impl Clone for crate::ExprAsync {
     fn clone(&self) -> Self {
         crate::ExprAsync {
@@ -2542,7 +2542,7 @@ 
Files

     }
 }
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "clone-impls")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "clone-impls")))]
 impl Clone for crate::ExprAwait {
     fn clone(&self) -> Self {
         crate::ExprAwait {
@@ -2554,7 +2554,7 @@ 
Files

     }
 }
 #[cfg(any(feature = "derive", feature = "full"))]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "clone-impls")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "clone-impls")))]
 impl Clone for crate::ExprBinary {
     fn clone(&self) -> Self {
         crate::ExprBinary {
@@ -2566,7 +2566,7 @@ 
Files

     }
 }
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "clone-impls")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "clone-impls")))]
 impl Clone for crate::ExprBlock {
     fn clone(&self) -> Self {
         crate::ExprBlock {
@@ -2577,7 +2577,7 @@ 
Files

     }
 }
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "clone-impls")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "clone-impls")))]
 impl Clone for crate::ExprBreak {
     fn clone(&self) -> Self {
         crate::ExprBreak {
@@ -2589,7 +2589,7 @@ 
Files

     }
 }
 #[cfg(any(feature = "derive", feature = "full"))]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "clone-impls")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "clone-impls")))]
 impl Clone for crate::ExprCall {
     fn clone(&self) -> Self {
         crate::ExprCall {
@@ -2601,7 +2601,7 @@ 
Files

     }
 }
 #[cfg(any(feature = "derive", feature = "full"))]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "clone-impls")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "clone-impls")))]
 impl Clone for crate::ExprCast {
     fn clone(&self) -> Self {
         crate::ExprCast {
@@ -2613,7 +2613,7 @@ 
Files

     }
 }
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "clone-impls")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "clone-impls")))]
 impl Clone for crate::ExprClosure {
     fn clone(&self) -> Self {
         crate::ExprClosure {
@@ -2632,7 +2632,7 @@ 
Files

     }
 }
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "clone-impls")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "clone-impls")))]
 impl Clone for crate::ExprConst {
     fn clone(&self) -> Self {
         crate::ExprConst {
@@ -2643,7 +2643,7 @@ 
Files

     }
 }
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "clone-impls")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "clone-impls")))]
 impl Clone for crate::ExprContinue {
     fn clone(&self) -> Self {
         crate::ExprContinue {
@@ -2654,7 +2654,7 @@ 
Files

     }
 }
 #[cfg(any(feature = "derive", feature = "full"))]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "clone-impls")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "clone-impls")))]
 impl Clone for crate::ExprField {
     fn clone(&self) -> Self {
         crate::ExprField {
@@ -2666,7 +2666,7 @@ 
Files

     }
 }
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "clone-impls")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "clone-impls")))]
 impl Clone for crate::ExprForLoop {
     fn clone(&self) -> Self {
         crate::ExprForLoop {
@@ -2681,7 +2681,7 @@ 
Files

     }
 }
 #[cfg(any(feature = "derive", feature = "full"))]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "clone-impls")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "clone-impls")))]
 impl Clone for crate::ExprGroup {
     fn clone(&self) -> Self {
         crate::ExprGroup {
@@ -2692,7 +2692,7 @@ 
Files

     }
 }
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "clone-impls")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "clone-impls")))]
 impl Clone for crate::ExprIf {
     fn clone(&self) -> Self {
         crate::ExprIf {
@@ -2705,7 +2705,7 @@ 
Files

     }
 }
 #[cfg(any(feature = "derive", feature = "full"))]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "clone-impls")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "clone-impls")))]
 impl Clone for crate::ExprIndex {
     fn clone(&self) -> Self {
         crate::ExprIndex {
@@ -2717,7 +2717,7 @@ 
Files

     }
 }
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "clone-impls")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "clone-impls")))]
 impl Clone for crate::ExprInfer {
     fn clone(&self) -> Self {
         crate::ExprInfer {
@@ -2727,7 +2727,7 @@ 
Files

     }
 }
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "clone-impls")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "clone-impls")))]
 impl Clone for crate::ExprLet {
     fn clone(&self) -> Self {
         crate::ExprLet {
@@ -2740,7 +2740,7 @@ 
Files

     }
 }
 #[cfg(any(feature = "derive", feature = "full"))]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "clone-impls")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "clone-impls")))]
 impl Clone for crate::ExprLit {
     fn clone(&self) -> Self {
         crate::ExprLit {
@@ -2750,7 +2750,7 @@ 
Files

     }
 }
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "clone-impls")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "clone-impls")))]
 impl Clone for crate::ExprLoop {
     fn clone(&self) -> Self {
         crate::ExprLoop {
@@ -2762,7 +2762,7 @@ 
Files

     }
 }
 #[cfg(any(feature = "derive", feature = "full"))]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "clone-impls")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "clone-impls")))]
 impl Clone for crate::ExprMacro {
     fn clone(&self) -> Self {
         crate::ExprMacro {
@@ -2772,7 +2772,7 @@ 
Files

     }
 }
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "clone-impls")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "clone-impls")))]
 impl Clone for crate::ExprMatch {
     fn clone(&self) -> Self {
         crate::ExprMatch {
@@ -2785,7 +2785,7 @@ 
Files

     }
 }
 #[cfg(any(feature = "derive", feature = "full"))]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "clone-impls")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "clone-impls")))]
 impl Clone for crate::ExprMethodCall {
     fn clone(&self) -> Self {
         crate::ExprMethodCall {
@@ -2800,7 +2800,7 @@ 
Files

     }
 }
 #[cfg(any(feature = "derive", feature = "full"))]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "clone-impls")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "clone-impls")))]
 impl Clone for crate::ExprParen {
     fn clone(&self) -> Self {
         crate::ExprParen {
@@ -2811,7 +2811,7 @@ 
Files

     }
 }
 #[cfg(any(feature = "derive", feature = "full"))]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "clone-impls")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "clone-impls")))]
 impl Clone for crate::ExprPath {
     fn clone(&self) -> Self {
         crate::ExprPath {
@@ -2822,7 +2822,7 @@ 
Files

     }
 }
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "clone-impls")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "clone-impls")))]
 impl Clone for crate::ExprRange {
     fn clone(&self) -> Self {
         crate::ExprRange {
@@ -2834,7 +2834,7 @@ 
Files

     }
 }
 #[cfg(any(feature = "derive", feature = "full"))]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "clone-impls")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "clone-impls")))]
 impl Clone for crate::ExprReference {
     fn clone(&self) -> Self {
         crate::ExprReference {
@@ -2846,7 +2846,7 @@ 
Files

     }
 }
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "clone-impls")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "clone-impls")))]
 impl Clone for crate::ExprRepeat {
     fn clone(&self) -> Self {
         crate::ExprRepeat {
@@ -2859,7 +2859,7 @@ 
Files

     }
 }
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "clone-impls")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "clone-impls")))]
 impl Clone for crate::ExprReturn {
     fn clone(&self) -> Self {
         crate::ExprReturn {
@@ -2870,7 +2870,7 @@ 
Files

     }
 }
 #[cfg(any(feature = "derive", feature = "full"))]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "clone-impls")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "clone-impls")))]
 impl Clone for crate::ExprStruct {
     fn clone(&self) -> Self {
         crate::ExprStruct {
@@ -2885,7 +2885,7 @@ 
Files

     }
 }
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "clone-impls")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "clone-impls")))]
 impl Clone for crate::ExprTry {
     fn clone(&self) -> Self {
         crate::ExprTry {
@@ -2896,7 +2896,7 @@ 
Files

     }
 }
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "clone-impls")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "clone-impls")))]
 impl Clone for crate::ExprTryBlock {
     fn clone(&self) -> Self {
         crate::ExprTryBlock {
@@ -2907,7 +2907,7 @@ 
Files

     }
 }
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "clone-impls")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "clone-impls")))]
 impl Clone for crate::ExprTuple {
     fn clone(&self) -> Self {
         crate::ExprTuple {
@@ -2918,7 +2918,7 @@ 
Files

     }
 }
 #[cfg(any(feature = "derive", feature = "full"))]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "clone-impls")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "clone-impls")))]
 impl Clone for crate::ExprUnary {
     fn clone(&self) -> Self {
         crate::ExprUnary {
@@ -2929,7 +2929,7 @@ 
Files

     }
 }
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "clone-impls")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "clone-impls")))]
 impl Clone for crate::ExprUnsafe {
     fn clone(&self) -> Self {
         crate::ExprUnsafe {
@@ -2940,7 +2940,7 @@ 
Files

     }
 }
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "clone-impls")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "clone-impls")))]
 impl Clone for crate::ExprWhile {
     fn clone(&self) -> Self {
         crate::ExprWhile {
@@ -2953,7 +2953,7 @@ 
Files

     }
 }
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "clone-impls")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "clone-impls")))]
 impl Clone for crate::ExprYield {
     fn clone(&self) -> Self {
         crate::ExprYield {
@@ -2964,7 +2964,7 @@ 
Files

     }
 }
 #[cfg(any(feature = "derive", feature = "full"))]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "clone-impls")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "clone-impls")))]
 impl Clone for crate::Field {
     fn clone(&self) -> Self {
         crate::Field {
@@ -2978,7 +2978,7 @@ 
Files

     }
 }
 #[cfg(any(feature = "derive", feature = "full"))]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "clone-impls")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "clone-impls")))]
 impl Clone for crate::FieldMutability {
     fn clone(&self) -> Self {
         match self {
@@ -2987,7 +2987,7 @@ 
Files

     }
 }
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "clone-impls")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "clone-impls")))]
 impl Clone for crate::FieldPat {
     fn clone(&self) -> Self {
         crate::FieldPat {
@@ -2999,7 +2999,7 @@ 
Files

     }
 }
 #[cfg(any(feature = "derive", feature = "full"))]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "clone-impls")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "clone-impls")))]
 impl Clone for crate::FieldValue {
     fn clone(&self) -> Self {
         crate::FieldValue {
@@ -3011,7 +3011,7 @@ 
Files

     }
 }
 #[cfg(any(feature = "derive", feature = "full"))]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "clone-impls")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "clone-impls")))]
 impl Clone for crate::Fields {
     fn clone(&self) -> Self {
         match self {
@@ -3022,7 +3022,7 @@ 
Files

     }
 }
 #[cfg(any(feature = "derive", feature = "full"))]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "clone-impls")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "clone-impls")))]
 impl Clone for crate::FieldsNamed {
     fn clone(&self) -> Self {
         crate::FieldsNamed {
@@ -3032,7 +3032,7 @@ 
Files

     }
 }
 #[cfg(any(feature = "derive", feature = "full"))]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "clone-impls")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "clone-impls")))]
 impl Clone for crate::FieldsUnnamed {
     fn clone(&self) -> Self {
         crate::FieldsUnnamed {
@@ -3042,7 +3042,7 @@ 
Files

     }
 }
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "clone-impls")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "clone-impls")))]
 impl Clone for crate::File {
     fn clone(&self) -> Self {
         crate::File {
@@ -3053,7 +3053,7 @@ 
Files

     }
 }
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "clone-impls")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "clone-impls")))]
 impl Clone for crate::FnArg {
     fn clone(&self) -> Self {
         match self {
@@ -3063,7 +3063,7 @@ 
Files

     }
 }
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "clone-impls")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "clone-impls")))]
 impl Clone for crate::ForeignItem {
     fn clone(&self) -> Self {
         match self {
@@ -3076,7 +3076,7 @@ 
Files

     }
 }
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "clone-impls")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "clone-impls")))]
 impl Clone for crate::ForeignItemFn {
     fn clone(&self) -> Self {
         crate::ForeignItemFn {
@@ -3088,7 +3088,7 @@ 
Files

     }
 }
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "clone-impls")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "clone-impls")))]
 impl Clone for crate::ForeignItemMacro {
     fn clone(&self) -> Self {
         crate::ForeignItemMacro {
@@ -3099,7 +3099,7 @@ 
Files

     }
 }
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "clone-impls")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "clone-impls")))]
 impl Clone for crate::ForeignItemStatic {
     fn clone(&self) -> Self {
         crate::ForeignItemStatic {
@@ -3115,7 +3115,7 @@ 
Files

     }
 }
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "clone-impls")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "clone-impls")))]
 impl Clone for crate::ForeignItemType {
     fn clone(&self) -> Self {
         crate::ForeignItemType {
@@ -3129,7 +3129,7 @@ 
Files

     }
 }
 #[cfg(any(feature = "derive", feature = "full"))]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "clone-impls")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "clone-impls")))]
 impl Clone for crate::GenericArgument {
     fn clone(&self) -> Self {
         match self {
@@ -3153,7 +3153,7 @@ 
Files

     }
 }
 #[cfg(any(feature = "derive", feature = "full"))]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "clone-impls")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "clone-impls")))]
 impl Clone for crate::GenericParam {
     fn clone(&self) -> Self {
         match self {
@@ -3166,7 +3166,7 @@ 
Files

     }
 }
 #[cfg(any(feature = "derive", feature = "full"))]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "clone-impls")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "clone-impls")))]
 impl Clone for crate::Generics {
     fn clone(&self) -> Self {
         crate::Generics {
@@ -3178,7 +3178,7 @@ 
Files

     }
 }
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "clone-impls")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "clone-impls")))]
 impl Clone for crate::ImplItem {
     fn clone(&self) -> Self {
         match self {
@@ -3191,7 +3191,7 @@ 
Files

     }
 }
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "clone-impls")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "clone-impls")))]
 impl Clone for crate::ImplItemConst {
     fn clone(&self) -> Self {
         crate::ImplItemConst {
@@ -3210,7 +3210,7 @@ 
Files

     }
 }
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "clone-impls")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "clone-impls")))]
 impl Clone for crate::ImplItemFn {
     fn clone(&self) -> Self {
         crate::ImplItemFn {
@@ -3223,7 +3223,7 @@ 
Files

     }
 }
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "clone-impls")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "clone-impls")))]
 impl Clone for crate::ImplItemMacro {
     fn clone(&self) -> Self {
         crate::ImplItemMacro {
@@ -3234,7 +3234,7 @@ 
Files

     }
 }
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "clone-impls")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "clone-impls")))]
 impl Clone for crate::ImplItemType {
     fn clone(&self) -> Self {
         crate::ImplItemType {
@@ -3251,14 +3251,14 @@ 
Files

     }
 }
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "clone-impls")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "clone-impls")))]
 impl Clone for crate::ImplRestriction {
     fn clone(&self) -> Self {
         match *self {}
     }
 }
 #[cfg(any(feature = "derive", feature = "full"))]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "clone-impls")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "clone-impls")))]
 impl Clone for crate::Index {
     fn clone(&self) -> Self {
         crate::Index {
@@ -3268,7 +3268,7 @@ 
Files

     }
 }
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "clone-impls")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "clone-impls")))]
 impl Clone for crate::Item {
     fn clone(&self) -> Self {
         match self {
@@ -3292,7 +3292,7 @@ 
Files

     }
 }
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "clone-impls")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "clone-impls")))]
 impl Clone for crate::ItemConst {
     fn clone(&self) -> Self {
         crate::ItemConst {
@@ -3310,7 +3310,7 @@ 
Files

     }
 }
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "clone-impls")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "clone-impls")))]
 impl Clone for crate::ItemEnum {
     fn clone(&self) -> Self {
         crate::ItemEnum {
@@ -3325,7 +3325,7 @@ 
Files

     }
 }
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "clone-impls")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "clone-impls")))]
 impl Clone for crate::ItemExternCrate {
     fn clone(&self) -> Self {
         crate::ItemExternCrate {
@@ -3340,7 +3340,7 @@ 
Files

     }
 }
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "clone-impls")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "clone-impls")))]
 impl Clone for crate::ItemFn {
     fn clone(&self) -> Self {
         crate::ItemFn {
@@ -3352,7 +3352,7 @@ 
Files

     }
 }
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "clone-impls")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "clone-impls")))]
 impl Clone for crate::ItemForeignMod {
     fn clone(&self) -> Self {
         crate::ItemForeignMod {
@@ -3365,7 +3365,7 @@ 
Files

     }
 }
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "clone-impls")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "clone-impls")))]
 impl Clone for crate::ItemImpl {
     fn clone(&self) -> Self {
         crate::ItemImpl {
@@ -3382,7 +3382,7 @@ 
Files

     }
 }
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "clone-impls")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "clone-impls")))]
 impl Clone for crate::ItemMacro {
     fn clone(&self) -> Self {
         crate::ItemMacro {
@@ -3394,7 +3394,7 @@ 
Files

     }
 }
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "clone-impls")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "clone-impls")))]
 impl Clone for crate::ItemMod {
     fn clone(&self) -> Self {
         crate::ItemMod {
@@ -3409,7 +3409,7 @@ 
Files

     }
 }
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "clone-impls")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "clone-impls")))]
 impl Clone for crate::ItemStatic {
     fn clone(&self) -> Self {
         crate::ItemStatic {
@@ -3427,7 +3427,7 @@ 
Files

     }
 }
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "clone-impls")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "clone-impls")))]
 impl Clone for crate::ItemStruct {
     fn clone(&self) -> Self {
         crate::ItemStruct {
@@ -3442,7 +3442,7 @@ 
Files

     }
 }
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "clone-impls")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "clone-impls")))]
 impl Clone for crate::ItemTrait {
     fn clone(&self) -> Self {
         crate::ItemTrait {
@@ -3462,7 +3462,7 @@ 
Files

     }
 }
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "clone-impls")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "clone-impls")))]
 impl Clone for crate::ItemTraitAlias {
     fn clone(&self) -> Self {
         crate::ItemTraitAlias {
@@ -3478,7 +3478,7 @@ 
Files

     }
 }
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "clone-impls")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "clone-impls")))]
 impl Clone for crate::ItemType {
     fn clone(&self) -> Self {
         crate::ItemType {
@@ -3494,7 +3494,7 @@ 
Files

     }
 }
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "clone-impls")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "clone-impls")))]
 impl Clone for crate::ItemUnion {
     fn clone(&self) -> Self {
         crate::ItemUnion {
@@ -3508,7 +3508,7 @@ 
Files

     }
 }
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "clone-impls")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "clone-impls")))]
 impl Clone for crate::ItemUse {
     fn clone(&self) -> Self {
         crate::ItemUse {
@@ -3522,7 +3522,7 @@ 
Files

     }
 }
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "clone-impls")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "clone-impls")))]
 impl Clone for crate::Label {
     fn clone(&self) -> Self {
         crate::Label {
@@ -3532,7 +3532,7 @@ 
Files

     }
 }
 #[cfg(any(feature = "derive", feature = "full"))]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "clone-impls")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "clone-impls")))]
 impl Clone for crate::LifetimeParam {
     fn clone(&self) -> Self {
         crate::LifetimeParam {
@@ -3543,7 +3543,7 @@ 
Files

         }
     }
 }
-#[cfg_attr(doc_cfg, doc(cfg(feature = "clone-impls")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "clone-impls")))]
 impl Clone for crate::Lit {
     fn clone(&self) -> Self {
         match self {
@@ -3559,7 +3559,7 @@ 
Files

         }
     }
 }
-#[cfg_attr(doc_cfg, doc(cfg(feature = "clone-impls")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "clone-impls")))]
 impl Clone for crate::LitBool {
     fn clone(&self) -> Self {
         crate::LitBool {
@@ -3569,7 +3569,7 @@ 
Files

     }
 }
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "clone-impls")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "clone-impls")))]
 impl Clone for crate::Local {
     fn clone(&self) -> Self {
         crate::Local {
@@ -3582,7 +3582,7 @@ 
Files

     }
 }
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "clone-impls")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "clone-impls")))]
 impl Clone for crate::LocalInit {
     fn clone(&self) -> Self {
         crate::LocalInit {
@@ -3593,7 +3593,7 @@ 
Files

     }
 }
 #[cfg(any(feature = "derive", feature = "full"))]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "clone-impls")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "clone-impls")))]
 impl Clone for crate::Macro {
     fn clone(&self) -> Self {
         crate::Macro {
@@ -3605,7 +3605,7 @@ 
Files

     }
 }
 #[cfg(any(feature = "derive", feature = "full"))]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "clone-impls")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "clone-impls")))]
 impl Clone for crate::MacroDelimiter {
     fn clone(&self) -> Self {
         match self {
@@ -3618,7 +3618,7 @@ 
Files

     }
 }
 #[cfg(any(feature = "derive", feature = "full"))]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "clone-impls")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "clone-impls")))]
 impl Clone for crate::Member {
     fn clone(&self) -> Self {
         match self {
@@ -3628,7 +3628,7 @@ 
Files

     }
 }
 #[cfg(any(feature = "derive", feature = "full"))]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "clone-impls")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "clone-impls")))]
 impl Clone for crate::Meta {
     fn clone(&self) -> Self {
         match self {
@@ -3639,7 +3639,7 @@ 
Files

     }
 }
 #[cfg(any(feature = "derive", feature = "full"))]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "clone-impls")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "clone-impls")))]
 impl Clone for crate::MetaList {
     fn clone(&self) -> Self {
         crate::MetaList {
@@ -3650,7 +3650,7 @@ 
Files

     }
 }
 #[cfg(any(feature = "derive", feature = "full"))]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "clone-impls")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "clone-impls")))]
 impl Clone for crate::MetaNameValue {
     fn clone(&self) -> Self {
         crate::MetaNameValue {
@@ -3661,7 +3661,7 @@ 
Files

     }
 }
 #[cfg(any(feature = "derive", feature = "full"))]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "clone-impls")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "clone-impls")))]
 impl Clone for crate::ParenthesizedGenericArguments {
     fn clone(&self) -> Self {
         crate::ParenthesizedGenericArguments {
@@ -3672,7 +3672,7 @@ 
Files

     }
 }
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "clone-impls")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "clone-impls")))]
 impl Clone for crate::Pat {
     fn clone(&self) -> Self {
         match self {
@@ -3697,7 +3697,7 @@ 
Files

     }
 }
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "clone-impls")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "clone-impls")))]
 impl Clone for crate::PatIdent {
     fn clone(&self) -> Self {
         crate::PatIdent {
@@ -3710,7 +3710,7 @@ 
Files

     }
 }
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "clone-impls")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "clone-impls")))]
 impl Clone for crate::PatOr {
     fn clone(&self) -> Self {
         crate::PatOr {
@@ -3721,7 +3721,7 @@ 
Files

     }
 }
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "clone-impls")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "clone-impls")))]
 impl Clone for crate::PatParen {
     fn clone(&self) -> Self {
         crate::PatParen {
@@ -3732,7 +3732,7 @@ 
Files

     }
 }
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "clone-impls")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "clone-impls")))]
 impl Clone for crate::PatReference {
     fn clone(&self) -> Self {
         crate::PatReference {
@@ -3744,7 +3744,7 @@ 
Files

     }
 }
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "clone-impls")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "clone-impls")))]
 impl Clone for crate::PatRest {
     fn clone(&self) -> Self {
         crate::PatRest {
@@ -3754,7 +3754,7 @@ 
Files

     }
 }
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "clone-impls")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "clone-impls")))]
 impl Clone for crate::PatSlice {
     fn clone(&self) -> Self {
         crate::PatSlice {
@@ -3765,7 +3765,7 @@ 
Files

     }
 }
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "clone-impls")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "clone-impls")))]
 impl Clone for crate::PatStruct {
     fn clone(&self) -> Self {
         crate::PatStruct {
@@ -3779,7 +3779,7 @@ 
Files

     }
 }
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "clone-impls")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "clone-impls")))]
 impl Clone for crate::PatTuple {
     fn clone(&self) -> Self {
         crate::PatTuple {
@@ -3790,7 +3790,7 @@ 
Files

     }
 }
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "clone-impls")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "clone-impls")))]
 impl Clone for crate::PatTupleStruct {
     fn clone(&self) -> Self {
         crate::PatTupleStruct {
@@ -3803,7 +3803,7 @@ 
Files

     }
 }
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "clone-impls")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "clone-impls")))]
 impl Clone for crate::PatType {
     fn clone(&self) -> Self {
         crate::PatType {
@@ -3815,7 +3815,7 @@ 
Files

     }
 }
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "clone-impls")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "clone-impls")))]
 impl Clone for crate::PatWild {
     fn clone(&self) -> Self {
         crate::PatWild {
@@ -3825,7 +3825,7 @@ 
Files

     }
 }
 #[cfg(any(feature = "derive", feature = "full"))]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "clone-impls")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "clone-impls")))]
 impl Clone for crate::Path {
     fn clone(&self) -> Self {
         crate::Path {
@@ -3835,7 +3835,7 @@ 
Files

     }
 }
 #[cfg(any(feature = "derive", feature = "full"))]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "clone-impls")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "clone-impls")))]
 impl Clone for crate::PathArguments {
     fn clone(&self) -> Self {
         match self {
@@ -3850,7 +3850,7 @@ 
Files

     }
 }
 #[cfg(any(feature = "derive", feature = "full"))]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "clone-impls")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "clone-impls")))]
 impl Clone for crate::PathSegment {
     fn clone(&self) -> Self {
         crate::PathSegment {
@@ -3860,7 +3860,7 @@ 
Files

     }
 }
 #[cfg(any(feature = "derive", feature = "full"))]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "clone-impls")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "clone-impls")))]
 impl Clone for crate::PredicateLifetime {
     fn clone(&self) -> Self {
         crate::PredicateLifetime {
@@ -3871,7 +3871,7 @@ 
Files

     }
 }
 #[cfg(any(feature = "derive", feature = "full"))]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "clone-impls")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "clone-impls")))]
 impl Clone for crate::PredicateType {
     fn clone(&self) -> Self {
         crate::PredicateType {
@@ -3883,7 +3883,7 @@ 
Files

     }
 }
 #[cfg(any(feature = "derive", feature = "full"))]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "clone-impls")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "clone-impls")))]
 impl Clone for crate::QSelf {
     fn clone(&self) -> Self {
         crate::QSelf {
@@ -3896,17 +3896,17 @@ 
Files

     }
 }
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "clone-impls")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "clone-impls")))]
 impl Copy for crate::RangeLimits {}
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "clone-impls")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "clone-impls")))]
 impl Clone for crate::RangeLimits {
     fn clone(&self) -> Self {
         *self
     }
 }
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "clone-impls")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "clone-impls")))]
 impl Clone for crate::Receiver {
     fn clone(&self) -> Self {
         crate::Receiver {
@@ -3920,7 +3920,7 @@ 
Files

     }
 }
 #[cfg(any(feature = "derive", feature = "full"))]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "clone-impls")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "clone-impls")))]
 impl Clone for crate::ReturnType {
     fn clone(&self) -> Self {
         match self {
@@ -3932,7 +3932,7 @@ 
Files

     }
 }
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "clone-impls")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "clone-impls")))]
 impl Clone for crate::Signature {
     fn clone(&self) -> Self {
         crate::Signature {
@@ -3951,7 +3951,7 @@ 
Files

     }
 }
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "clone-impls")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "clone-impls")))]
 impl Clone for crate::StaticMutability {
     fn clone(&self) -> Self {
         match self {
@@ -3961,7 +3961,7 @@ 
Files

     }
 }
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "clone-impls")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "clone-impls")))]
 impl Clone for crate::Stmt {
     fn clone(&self) -> Self {
         match self {
@@ -3973,7 +3973,7 @@ 
Files

     }
 }
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "clone-impls")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "clone-impls")))]
 impl Clone for crate::StmtMacro {
     fn clone(&self) -> Self {
         crate::StmtMacro {
@@ -3984,7 +3984,7 @@ 
Files

     }
 }
 #[cfg(any(feature = "derive", feature = "full"))]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "clone-impls")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "clone-impls")))]
 impl Clone for crate::TraitBound {
     fn clone(&self) -> Self {
         crate::TraitBound {
@@ -3996,17 +3996,17 @@ 
Files

     }
 }
 #[cfg(any(feature = "derive", feature = "full"))]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "clone-impls")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "clone-impls")))]
 impl Copy for crate::TraitBoundModifier {}
 #[cfg(any(feature = "derive", feature = "full"))]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "clone-impls")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "clone-impls")))]
 impl Clone for crate::TraitBoundModifier {
     fn clone(&self) -> Self {
         *self
     }
 }
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "clone-impls")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "clone-impls")))]
 impl Clone for crate::TraitItem {
     fn clone(&self) -> Self {
         match self {
@@ -4019,7 +4019,7 @@ 
Files

     }
 }
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "clone-impls")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "clone-impls")))]
 impl Clone for crate::TraitItemConst {
     fn clone(&self) -> Self {
         crate::TraitItemConst {
@@ -4035,7 +4035,7 @@ 
Files

     }
 }
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "clone-impls")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "clone-impls")))]
 impl Clone for crate::TraitItemFn {
     fn clone(&self) -> Self {
         crate::TraitItemFn {
@@ -4047,7 +4047,7 @@ 
Files

     }
 }
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "clone-impls")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "clone-impls")))]
 impl Clone for crate::TraitItemMacro {
     fn clone(&self) -> Self {
         crate::TraitItemMacro {
@@ -4058,7 +4058,7 @@ 
Files

     }
 }
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "clone-impls")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "clone-impls")))]
 impl Clone for crate::TraitItemType {
     fn clone(&self) -> Self {
         crate::TraitItemType {
@@ -4074,7 +4074,7 @@ 
Files

     }
 }
 #[cfg(any(feature = "derive", feature = "full"))]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "clone-impls")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "clone-impls")))]
 impl Clone for crate::Type {
     fn clone(&self) -> Self {
         match self {
@@ -4097,7 +4097,7 @@ 
Files

     }
 }
 #[cfg(any(feature = "derive", feature = "full"))]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "clone-impls")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "clone-impls")))]
 impl Clone for crate::TypeArray {
     fn clone(&self) -> Self {
         crate::TypeArray {
@@ -4109,7 +4109,7 @@ 
Files

     }
 }
 #[cfg(any(feature = "derive", feature = "full"))]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "clone-impls")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "clone-impls")))]
 impl Clone for crate::TypeBareFn {
     fn clone(&self) -> Self {
         crate::TypeBareFn {
@@ -4125,7 +4125,7 @@ 
Files

     }
 }
 #[cfg(any(feature = "derive", feature = "full"))]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "clone-impls")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "clone-impls")))]
 impl Clone for crate::TypeGroup {
     fn clone(&self) -> Self {
         crate::TypeGroup {
@@ -4135,7 +4135,7 @@ 
Files

     }
 }
 #[cfg(any(feature = "derive", feature = "full"))]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "clone-impls")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "clone-impls")))]
 impl Clone for crate::TypeImplTrait {
     fn clone(&self) -> Self {
         crate::TypeImplTrait {
@@ -4145,7 +4145,7 @@ 
Files

     }
 }
 #[cfg(any(feature = "derive", feature = "full"))]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "clone-impls")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "clone-impls")))]
 impl Clone for crate::TypeInfer {
     fn clone(&self) -> Self {
         crate::TypeInfer {
@@ -4154,7 +4154,7 @@ 
Files

     }
 }
 #[cfg(any(feature = "derive", feature = "full"))]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "clone-impls")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "clone-impls")))]
 impl Clone for crate::TypeMacro {
     fn clone(&self) -> Self {
         crate::TypeMacro {
@@ -4163,7 +4163,7 @@ 
Files

     }
 }
 #[cfg(any(feature = "derive", feature = "full"))]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "clone-impls")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "clone-impls")))]
 impl Clone for crate::TypeNever {
     fn clone(&self) -> Self {
         crate::TypeNever {
@@ -4172,7 +4172,7 @@ 
Files

     }
 }
 #[cfg(any(feature = "derive", feature = "full"))]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "clone-impls")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "clone-impls")))]
 impl Clone for crate::TypeParam {
     fn clone(&self) -> Self {
         crate::TypeParam {
@@ -4186,7 +4186,7 @@ 
Files

     }
 }
 #[cfg(any(feature = "derive", feature = "full"))]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "clone-impls")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "clone-impls")))]
 impl Clone for crate::TypeParamBound {
     fn clone(&self) -> Self {
         match self {
@@ -4201,7 +4201,7 @@ 
Files

     }
 }
 #[cfg(any(feature = "derive", feature = "full"))]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "clone-impls")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "clone-impls")))]
 impl Clone for crate::TypeParen {
     fn clone(&self) -> Self {
         crate::TypeParen {
@@ -4211,7 +4211,7 @@ 
Files

     }
 }
 #[cfg(any(feature = "derive", feature = "full"))]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "clone-impls")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "clone-impls")))]
 impl Clone for crate::TypePath {
     fn clone(&self) -> Self {
         crate::TypePath {
@@ -4221,7 +4221,7 @@ 
Files

     }
 }
 #[cfg(any(feature = "derive", feature = "full"))]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "clone-impls")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "clone-impls")))]
 impl Clone for crate::TypePtr {
     fn clone(&self) -> Self {
         crate::TypePtr {
@@ -4233,7 +4233,7 @@ 
Files

     }
 }
 #[cfg(any(feature = "derive", feature = "full"))]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "clone-impls")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "clone-impls")))]
 impl Clone for crate::TypeReference {
     fn clone(&self) -> Self {
         crate::TypeReference {
@@ -4245,7 +4245,7 @@ 
Files

     }
 }
 #[cfg(any(feature = "derive", feature = "full"))]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "clone-impls")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "clone-impls")))]
 impl Clone for crate::TypeSlice {
     fn clone(&self) -> Self {
         crate::TypeSlice {
@@ -4255,7 +4255,7 @@ 
Files

     }
 }
 #[cfg(any(feature = "derive", feature = "full"))]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "clone-impls")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "clone-impls")))]
 impl Clone for crate::TypeTraitObject {
     fn clone(&self) -> Self {
         crate::TypeTraitObject {
@@ -4265,7 +4265,7 @@ 
Files

     }
 }
 #[cfg(any(feature = "derive", feature = "full"))]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "clone-impls")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "clone-impls")))]
 impl Clone for crate::TypeTuple {
     fn clone(&self) -> Self {
         crate::TypeTuple {
@@ -4275,17 +4275,17 @@ 
Files

     }
 }
 #[cfg(any(feature = "derive", feature = "full"))]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "clone-impls")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "clone-impls")))]
 impl Copy for crate::UnOp {}
 #[cfg(any(feature = "derive", feature = "full"))]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "clone-impls")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "clone-impls")))]
 impl Clone for crate::UnOp {
     fn clone(&self) -> Self {
         *self
     }
 }
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "clone-impls")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "clone-impls")))]
 impl Clone for crate::UseGlob {
     fn clone(&self) -> Self {
         crate::UseGlob {
@@ -4294,7 +4294,7 @@ 
Files

     }
 }
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "clone-impls")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "clone-impls")))]
 impl Clone for crate::UseGroup {
     fn clone(&self) -> Self {
         crate::UseGroup {
@@ -4304,7 +4304,7 @@ 
Files

     }
 }
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "clone-impls")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "clone-impls")))]
 impl Clone for crate::UseName {
     fn clone(&self) -> Self {
         crate::UseName {
@@ -4313,7 +4313,7 @@ 
Files

     }
 }
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "clone-impls")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "clone-impls")))]
 impl Clone for crate::UsePath {
     fn clone(&self) -> Self {
         crate::UsePath {
@@ -4324,7 +4324,7 @@ 
Files

     }
 }
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "clone-impls")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "clone-impls")))]
 impl Clone for crate::UseRename {
     fn clone(&self) -> Self {
         crate::UseRename {
@@ -4335,7 +4335,7 @@ 
Files

     }
 }
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "clone-impls")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "clone-impls")))]
 impl Clone for crate::UseTree {
     fn clone(&self) -> Self {
         match self {
@@ -4348,7 +4348,7 @@ 
Files

     }
 }
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "clone-impls")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "clone-impls")))]
 impl Clone for crate::Variadic {
     fn clone(&self) -> Self {
         crate::Variadic {
@@ -4360,7 +4360,7 @@ 
Files

     }
 }
 #[cfg(any(feature = "derive", feature = "full"))]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "clone-impls")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "clone-impls")))]
 impl Clone for crate::Variant {
     fn clone(&self) -> Self {
         crate::Variant {
@@ -4372,7 +4372,7 @@ 
Files

     }
 }
 #[cfg(any(feature = "derive", feature = "full"))]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "clone-impls")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "clone-impls")))]
 impl Clone for crate::VisRestricted {
     fn clone(&self) -> Self {
         crate::VisRestricted {
@@ -4384,7 +4384,7 @@ 
Files

     }
 }
 #[cfg(any(feature = "derive", feature = "full"))]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "clone-impls")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "clone-impls")))]
 impl Clone for crate::Visibility {
     fn clone(&self) -> Self {
         match self {
@@ -4397,7 +4397,7 @@ 
Files

     }
 }
 #[cfg(any(feature = "derive", feature = "full"))]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "clone-impls")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "clone-impls")))]
 impl Clone for crate::WhereClause {
     fn clone(&self) -> Self {
         crate::WhereClause {
@@ -4407,7 +4407,7 @@ 
Files

     }
 }
 #[cfg(any(feature = "derive", feature = "full"))]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "clone-impls")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "clone-impls")))]
 impl Clone for crate::WherePredicate {
     fn clone(&self) -> Self {
         match self {
diff --git a/src/syn/gen/debug.rs.html b/src/syn/gen/debug.rs.html
index 20b2d3da42..b4d0a61e71 100644
--- a/src/syn/gen/debug.rs.html
+++ b/src/syn/gen/debug.rs.html
@@ -1,4 +1,4 @@
-debug.rs - source

 #![allow(unknown_lints, non_local_definitions)]
 use std::fmt::{self, Debug};
 #[cfg(any(feature = "derive", feature = "full"))]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Debug for crate::Abi {
     fn fmt(&self, formatter: &mut fmt::Formatter) -> fmt::Result {
         let mut formatter = formatter.debug_struct("Abi");
@@ -3176,7 +3176,7 @@ 
Files

     }
 }
 #[cfg(any(feature = "derive", feature = "full"))]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Debug for crate::AngleBracketedGenericArguments {
     fn fmt(&self, formatter: &mut fmt::Formatter) -> fmt::Result {
         self.debug(formatter, "AngleBracketedGenericArguments")
@@ -3194,7 +3194,7 @@ 
Files

     }
 }
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Debug for crate::Arm {
     fn fmt(&self, formatter: &mut fmt::Formatter) -> fmt::Result {
         let mut formatter = formatter.debug_struct("Arm");
@@ -3208,7 +3208,7 @@ 
Files

     }
 }
 #[cfg(any(feature = "derive", feature = "full"))]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Debug for crate::AssocConst {
     fn fmt(&self, formatter: &mut fmt::Formatter) -> fmt::Result {
         let mut formatter = formatter.debug_struct("AssocConst");
@@ -3220,7 +3220,7 @@ 
Files

     }
 }
 #[cfg(any(feature = "derive", feature = "full"))]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Debug for crate::AssocType {
     fn fmt(&self, formatter: &mut fmt::Formatter) -> fmt::Result {
         let mut formatter = formatter.debug_struct("AssocType");
@@ -3232,7 +3232,7 @@ 
Files

     }
 }
 #[cfg(any(feature = "derive", feature = "full"))]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Debug for crate::AttrStyle {
     fn fmt(&self, formatter: &mut fmt::Formatter) -> fmt::Result {
         formatter.write_str("AttrStyle::")?;
@@ -3247,7 +3247,7 @@ 
Files

     }
 }
 #[cfg(any(feature = "derive", feature = "full"))]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Debug for crate::Attribute {
     fn fmt(&self, formatter: &mut fmt::Formatter) -> fmt::Result {
         let mut formatter = formatter.debug_struct("Attribute");
@@ -3259,7 +3259,7 @@ 
Files

     }
 }
 #[cfg(any(feature = "derive", feature = "full"))]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Debug for crate::BareFnArg {
     fn fmt(&self, formatter: &mut fmt::Formatter) -> fmt::Result {
         let mut formatter = formatter.debug_struct("BareFnArg");
@@ -3270,7 +3270,7 @@ 
Files

     }
 }
 #[cfg(any(feature = "derive", feature = "full"))]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Debug for crate::BareVariadic {
     fn fmt(&self, formatter: &mut fmt::Formatter) -> fmt::Result {
         let mut formatter = formatter.debug_struct("BareVariadic");
@@ -3282,7 +3282,7 @@ 
Files

     }
 }
 #[cfg(any(feature = "derive", feature = "full"))]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Debug for crate::BinOp {
     fn fmt(&self, formatter: &mut fmt::Formatter) -> fmt::Result {
         formatter.write_str("BinOp::")?;
@@ -3431,7 +3431,7 @@ 
Files

     }
 }
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Debug for crate::Block {
     fn fmt(&self, formatter: &mut fmt::Formatter) -> fmt::Result {
         let mut formatter = formatter.debug_struct("Block");
@@ -3441,7 +3441,7 @@ 
Files

     }
 }
 #[cfg(any(feature = "derive", feature = "full"))]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Debug for crate::BoundLifetimes {
     fn fmt(&self, formatter: &mut fmt::Formatter) -> fmt::Result {
         let mut formatter = formatter.debug_struct("BoundLifetimes");
@@ -3453,7 +3453,7 @@ 
Files

     }
 }
 #[cfg(any(feature = "derive", feature = "full"))]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Debug for crate::ConstParam {
     fn fmt(&self, formatter: &mut fmt::Formatter) -> fmt::Result {
         let mut formatter = formatter.debug_struct("ConstParam");
@@ -3468,7 +3468,7 @@ 
Files

     }
 }
 #[cfg(any(feature = "derive", feature = "full"))]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Debug for crate::Constraint {
     fn fmt(&self, formatter: &mut fmt::Formatter) -> fmt::Result {
         let mut formatter = formatter.debug_struct("Constraint");
@@ -3480,7 +3480,7 @@ 
Files

     }
 }
 #[cfg(feature = "derive")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Debug for crate::Data {
     fn fmt(&self, formatter: &mut fmt::Formatter) -> fmt::Result {
         formatter.write_str("Data::")?;
@@ -3492,7 +3492,7 @@ 
Files

     }
 }
 #[cfg(feature = "derive")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Debug for crate::DataEnum {
     fn fmt(&self, formatter: &mut fmt::Formatter) -> fmt::Result {
         self.debug(formatter, "DataEnum")
@@ -3509,7 +3509,7 @@ 
Files

     }
 }
 #[cfg(feature = "derive")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Debug for crate::DataStruct {
     fn fmt(&self, formatter: &mut fmt::Formatter) -> fmt::Result {
         self.debug(formatter, "DataStruct")
@@ -3526,7 +3526,7 @@ 
Files

     }
 }
 #[cfg(feature = "derive")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Debug for crate::DataUnion {
     fn fmt(&self, formatter: &mut fmt::Formatter) -> fmt::Result {
         self.debug(formatter, "DataUnion")
@@ -3542,7 +3542,7 @@ 
Files

     }
 }
 #[cfg(feature = "derive")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Debug for crate::DeriveInput {
     fn fmt(&self, formatter: &mut fmt::Formatter) -> fmt::Result {
         let mut formatter = formatter.debug_struct("DeriveInput");
@@ -3555,7 +3555,7 @@ 
Files

     }
 }
 #[cfg(any(feature = "derive", feature = "full"))]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Debug for crate::Expr {
     fn fmt(&self, formatter: &mut fmt::Formatter) -> fmt::Result {
         formatter.write_str("Expr::")?;
@@ -3633,7 +3633,7 @@ 
Files

     }
 }
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Debug for crate::ExprArray {
     fn fmt(&self, formatter: &mut fmt::Formatter) -> fmt::Result {
         self.debug(formatter, "ExprArray")
@@ -3650,7 +3650,7 @@ 
Files

     }
 }
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Debug for crate::ExprAssign {
     fn fmt(&self, formatter: &mut fmt::Formatter) -> fmt::Result {
         self.debug(formatter, "ExprAssign")
@@ -3668,7 +3668,7 @@ 
Files

     }
 }
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Debug for crate::ExprAsync {
     fn fmt(&self, formatter: &mut fmt::Formatter) -> fmt::Result {
         self.debug(formatter, "ExprAsync")
@@ -3686,7 +3686,7 @@ 
Files

     }
 }
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Debug for crate::ExprAwait {
     fn fmt(&self, formatter: &mut fmt::Formatter) -> fmt::Result {
         self.debug(formatter, "ExprAwait")
@@ -3704,7 +3704,7 @@ 
Files

     }
 }
 #[cfg(any(feature = "derive", feature = "full"))]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Debug for crate::ExprBinary {
     fn fmt(&self, formatter: &mut fmt::Formatter) -> fmt::Result {
         self.debug(formatter, "ExprBinary")
@@ -3722,7 +3722,7 @@ 
Files

     }
 }
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Debug for crate::ExprBlock {
     fn fmt(&self, formatter: &mut fmt::Formatter) -> fmt::Result {
         self.debug(formatter, "ExprBlock")
@@ -3739,7 +3739,7 @@ 
Files

     }
 }
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Debug for crate::ExprBreak {
     fn fmt(&self, formatter: &mut fmt::Formatter) -> fmt::Result {
         self.debug(formatter, "ExprBreak")
@@ -3757,7 +3757,7 @@ 
Files

     }
 }
 #[cfg(any(feature = "derive", feature = "full"))]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Debug for crate::ExprCall {
     fn fmt(&self, formatter: &mut fmt::Formatter) -> fmt::Result {
         self.debug(formatter, "ExprCall")
@@ -3775,7 +3775,7 @@ 
Files

     }
 }
 #[cfg(any(feature = "derive", feature = "full"))]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Debug for crate::ExprCast {
     fn fmt(&self, formatter: &mut fmt::Formatter) -> fmt::Result {
         self.debug(formatter, "ExprCast")
@@ -3793,7 +3793,7 @@ 
Files

     }
 }
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Debug for crate::ExprClosure {
     fn fmt(&self, formatter: &mut fmt::Formatter) -> fmt::Result {
         self.debug(formatter, "ExprClosure")
@@ -3818,7 +3818,7 @@ 
Files

     }
 }
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Debug for crate::ExprConst {
     fn fmt(&self, formatter: &mut fmt::Formatter) -> fmt::Result {
         self.debug(formatter, "ExprConst")
@@ -3835,7 +3835,7 @@ 
Files

     }
 }
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Debug for crate::ExprContinue {
     fn fmt(&self, formatter: &mut fmt::Formatter) -> fmt::Result {
         self.debug(formatter, "ExprContinue")
@@ -3852,7 +3852,7 @@ 
Files

     }
 }
 #[cfg(any(feature = "derive", feature = "full"))]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Debug for crate::ExprField {
     fn fmt(&self, formatter: &mut fmt::Formatter) -> fmt::Result {
         self.debug(formatter, "ExprField")
@@ -3870,7 +3870,7 @@ 
Files

     }
 }
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Debug for crate::ExprForLoop {
     fn fmt(&self, formatter: &mut fmt::Formatter) -> fmt::Result {
         self.debug(formatter, "ExprForLoop")
@@ -3891,7 +3891,7 @@ 
Files

     }
 }
 #[cfg(any(feature = "derive", feature = "full"))]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Debug for crate::ExprGroup {
     fn fmt(&self, formatter: &mut fmt::Formatter) -> fmt::Result {
         self.debug(formatter, "ExprGroup")
@@ -3908,7 +3908,7 @@ 
Files

     }
 }
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Debug for crate::ExprIf {
     fn fmt(&self, formatter: &mut fmt::Formatter) -> fmt::Result {
         self.debug(formatter, "ExprIf")
@@ -3927,7 +3927,7 @@ 
Files

     }
 }
 #[cfg(any(feature = "derive", feature = "full"))]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Debug for crate::ExprIndex {
     fn fmt(&self, formatter: &mut fmt::Formatter) -> fmt::Result {
         self.debug(formatter, "ExprIndex")
@@ -3945,7 +3945,7 @@ 
Files

     }
 }
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Debug for crate::ExprInfer {
     fn fmt(&self, formatter: &mut fmt::Formatter) -> fmt::Result {
         self.debug(formatter, "ExprInfer")
@@ -3961,7 +3961,7 @@ 
Files

     }
 }
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Debug for crate::ExprLet {
     fn fmt(&self, formatter: &mut fmt::Formatter) -> fmt::Result {
         self.debug(formatter, "ExprLet")
@@ -3980,7 +3980,7 @@ 
Files

     }
 }
 #[cfg(any(feature = "derive", feature = "full"))]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Debug for crate::ExprLit {
     fn fmt(&self, formatter: &mut fmt::Formatter) -> fmt::Result {
         self.debug(formatter, "ExprLit")
@@ -3996,7 +3996,7 @@ 
Files

     }
 }
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Debug for crate::ExprLoop {
     fn fmt(&self, formatter: &mut fmt::Formatter) -> fmt::Result {
         self.debug(formatter, "ExprLoop")
@@ -4014,7 +4014,7 @@ 
Files

     }
 }
 #[cfg(any(feature = "derive", feature = "full"))]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Debug for crate::ExprMacro {
     fn fmt(&self, formatter: &mut fmt::Formatter) -> fmt::Result {
         self.debug(formatter, "ExprMacro")
@@ -4030,7 +4030,7 @@ 
Files

     }
 }
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Debug for crate::ExprMatch {
     fn fmt(&self, formatter: &mut fmt::Formatter) -> fmt::Result {
         self.debug(formatter, "ExprMatch")
@@ -4049,7 +4049,7 @@ 
Files

     }
 }
 #[cfg(any(feature = "derive", feature = "full"))]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Debug for crate::ExprMethodCall {
     fn fmt(&self, formatter: &mut fmt::Formatter) -> fmt::Result {
         self.debug(formatter, "ExprMethodCall")
@@ -4070,7 +4070,7 @@ 
Files

     }
 }
 #[cfg(any(feature = "derive", feature = "full"))]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Debug for crate::ExprParen {
     fn fmt(&self, formatter: &mut fmt::Formatter) -> fmt::Result {
         self.debug(formatter, "ExprParen")
@@ -4087,7 +4087,7 @@ 
Files

     }
 }
 #[cfg(any(feature = "derive", feature = "full"))]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Debug for crate::ExprPath {
     fn fmt(&self, formatter: &mut fmt::Formatter) -> fmt::Result {
         self.debug(formatter, "ExprPath")
@@ -4104,7 +4104,7 @@ 
Files

     }
 }
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Debug for crate::ExprRange {
     fn fmt(&self, formatter: &mut fmt::Formatter) -> fmt::Result {
         self.debug(formatter, "ExprRange")
@@ -4122,7 +4122,7 @@ 
Files

     }
 }
 #[cfg(any(feature = "derive", feature = "full"))]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Debug for crate::ExprReference {
     fn fmt(&self, formatter: &mut fmt::Formatter) -> fmt::Result {
         self.debug(formatter, "ExprReference")
@@ -4140,7 +4140,7 @@ 
Files

     }
 }
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Debug for crate::ExprRepeat {
     fn fmt(&self, formatter: &mut fmt::Formatter) -> fmt::Result {
         self.debug(formatter, "ExprRepeat")
@@ -4159,7 +4159,7 @@ 
Files

     }
 }
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Debug for crate::ExprReturn {
     fn fmt(&self, formatter: &mut fmt::Formatter) -> fmt::Result {
         self.debug(formatter, "ExprReturn")
@@ -4176,7 +4176,7 @@ 
Files

     }
 }
 #[cfg(any(feature = "derive", feature = "full"))]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Debug for crate::ExprStruct {
     fn fmt(&self, formatter: &mut fmt::Formatter) -> fmt::Result {
         self.debug(formatter, "ExprStruct")
@@ -4197,7 +4197,7 @@ 
Files

     }
 }
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Debug for crate::ExprTry {
     fn fmt(&self, formatter: &mut fmt::Formatter) -> fmt::Result {
         self.debug(formatter, "ExprTry")
@@ -4214,7 +4214,7 @@ 
Files

     }
 }
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Debug for crate::ExprTryBlock {
     fn fmt(&self, formatter: &mut fmt::Formatter) -> fmt::Result {
         self.debug(formatter, "ExprTryBlock")
@@ -4231,7 +4231,7 @@ 
Files

     }
 }
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Debug for crate::ExprTuple {
     fn fmt(&self, formatter: &mut fmt::Formatter) -> fmt::Result {
         self.debug(formatter, "ExprTuple")
@@ -4248,7 +4248,7 @@ 
Files

     }
 }
 #[cfg(any(feature = "derive", feature = "full"))]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Debug for crate::ExprUnary {
     fn fmt(&self, formatter: &mut fmt::Formatter) -> fmt::Result {
         self.debug(formatter, "ExprUnary")
@@ -4265,7 +4265,7 @@ 
Files

     }
 }
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Debug for crate::ExprUnsafe {
     fn fmt(&self, formatter: &mut fmt::Formatter) -> fmt::Result {
         self.debug(formatter, "ExprUnsafe")
@@ -4282,7 +4282,7 @@ 
Files

     }
 }
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Debug for crate::ExprWhile {
     fn fmt(&self, formatter: &mut fmt::Formatter) -> fmt::Result {
         self.debug(formatter, "ExprWhile")
@@ -4301,7 +4301,7 @@ 
Files

     }
 }
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Debug for crate::ExprYield {
     fn fmt(&self, formatter: &mut fmt::Formatter) -> fmt::Result {
         self.debug(formatter, "ExprYield")
@@ -4318,7 +4318,7 @@ 
Files

     }
 }
 #[cfg(any(feature = "derive", feature = "full"))]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Debug for crate::Field {
     fn fmt(&self, formatter: &mut fmt::Formatter) -> fmt::Result {
         let mut formatter = formatter.debug_struct("Field");
@@ -4332,7 +4332,7 @@ 
Files

     }
 }
 #[cfg(any(feature = "derive", feature = "full"))]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Debug for crate::FieldMutability {
     fn fmt(&self, formatter: &mut fmt::Formatter) -> fmt::Result {
         formatter.write_str("FieldMutability::")?;
@@ -4342,7 +4342,7 @@ 
Files

     }
 }
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Debug for crate::FieldPat {
     fn fmt(&self, formatter: &mut fmt::Formatter) -> fmt::Result {
         let mut formatter = formatter.debug_struct("FieldPat");
@@ -4354,7 +4354,7 @@ 
Files

     }
 }
 #[cfg(any(feature = "derive", feature = "full"))]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Debug for crate::FieldValue {
     fn fmt(&self, formatter: &mut fmt::Formatter) -> fmt::Result {
         let mut formatter = formatter.debug_struct("FieldValue");
@@ -4366,7 +4366,7 @@ 
Files

     }
 }
 #[cfg(any(feature = "derive", feature = "full"))]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Debug for crate::Fields {
     fn fmt(&self, formatter: &mut fmt::Formatter) -> fmt::Result {
         formatter.write_str("Fields::")?;
@@ -4378,7 +4378,7 @@ 
Files

     }
 }
 #[cfg(any(feature = "derive", feature = "full"))]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Debug for crate::FieldsNamed {
     fn fmt(&self, formatter: &mut fmt::Formatter) -> fmt::Result {
         self.debug(formatter, "FieldsNamed")
@@ -4394,7 +4394,7 @@ 
Files

     }
 }
 #[cfg(any(feature = "derive", feature = "full"))]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Debug for crate::FieldsUnnamed {
     fn fmt(&self, formatter: &mut fmt::Formatter) -> fmt::Result {
         self.debug(formatter, "FieldsUnnamed")
@@ -4410,7 +4410,7 @@ 
Files

     }
 }
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Debug for crate::File {
     fn fmt(&self, formatter: &mut fmt::Formatter) -> fmt::Result {
         let mut formatter = formatter.debug_struct("File");
@@ -4421,7 +4421,7 @@ 
Files

     }
 }
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Debug for crate::FnArg {
     fn fmt(&self, formatter: &mut fmt::Formatter) -> fmt::Result {
         formatter.write_str("FnArg::")?;
@@ -4440,7 +4440,7 @@ 
Files

     }
 }
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Debug for crate::ForeignItem {
     fn fmt(&self, formatter: &mut fmt::Formatter) -> fmt::Result {
         formatter.write_str("ForeignItem::")?;
@@ -4458,7 +4458,7 @@ 
Files

     }
 }
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Debug for crate::ForeignItemFn {
     fn fmt(&self, formatter: &mut fmt::Formatter) -> fmt::Result {
         self.debug(formatter, "ForeignItemFn")
@@ -4476,7 +4476,7 @@ 
Files

     }
 }
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Debug for crate::ForeignItemMacro {
     fn fmt(&self, formatter: &mut fmt::Formatter) -> fmt::Result {
         self.debug(formatter, "ForeignItemMacro")
@@ -4493,7 +4493,7 @@ 
Files

     }
 }
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Debug for crate::ForeignItemStatic {
     fn fmt(&self, formatter: &mut fmt::Formatter) -> fmt::Result {
         self.debug(formatter, "ForeignItemStatic")
@@ -4515,7 +4515,7 @@ 
Files

     }
 }
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Debug for crate::ForeignItemType {
     fn fmt(&self, formatter: &mut fmt::Formatter) -> fmt::Result {
         self.debug(formatter, "ForeignItemType")
@@ -4535,7 +4535,7 @@ 
Files

     }
 }
 #[cfg(any(feature = "derive", feature = "full"))]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Debug for crate::GenericArgument {
     fn fmt(&self, formatter: &mut fmt::Formatter) -> fmt::Result {
         formatter.write_str("GenericArgument::")?;
@@ -4574,7 +4574,7 @@ 
Files

     }
 }
 #[cfg(any(feature = "derive", feature = "full"))]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Debug for crate::GenericParam {
     fn fmt(&self, formatter: &mut fmt::Formatter) -> fmt::Result {
         formatter.write_str("GenericParam::")?;
@@ -4598,7 +4598,7 @@ 
Files

     }
 }
 #[cfg(any(feature = "derive", feature = "full"))]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Debug for crate::Generics {
     fn fmt(&self, formatter: &mut fmt::Formatter) -> fmt::Result {
         let mut formatter = formatter.debug_struct("Generics");
@@ -4610,7 +4610,7 @@ 
Files

     }
 }
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Debug for crate::ImplItem {
     fn fmt(&self, formatter: &mut fmt::Formatter) -> fmt::Result {
         formatter.write_str("ImplItem::")?;
@@ -4628,7 +4628,7 @@ 
Files

     }
 }
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Debug for crate::ImplItemConst {
     fn fmt(&self, formatter: &mut fmt::Formatter) -> fmt::Result {
         self.debug(formatter, "ImplItemConst")
@@ -4653,7 +4653,7 @@ 
Files

     }
 }
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Debug for crate::ImplItemFn {
     fn fmt(&self, formatter: &mut fmt::Formatter) -> fmt::Result {
         self.debug(formatter, "ImplItemFn")
@@ -4672,7 +4672,7 @@ 
Files

     }
 }
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Debug for crate::ImplItemMacro {
     fn fmt(&self, formatter: &mut fmt::Formatter) -> fmt::Result {
         self.debug(formatter, "ImplItemMacro")
@@ -4689,7 +4689,7 @@ 
Files

     }
 }
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Debug for crate::ImplItemType {
     fn fmt(&self, formatter: &mut fmt::Formatter) -> fmt::Result {
         self.debug(formatter, "ImplItemType")
@@ -4712,14 +4712,14 @@ 
Files

     }
 }
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Debug for crate::ImplRestriction {
     fn fmt(&self, _formatter: &mut fmt::Formatter) -> fmt::Result {
         match *self {}
     }
 }
 #[cfg(any(feature = "derive", feature = "full"))]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Debug for crate::Index {
     fn fmt(&self, formatter: &mut fmt::Formatter) -> fmt::Result {
         let mut formatter = formatter.debug_struct("Index");
@@ -4729,7 +4729,7 @@ 
Files

     }
 }
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Debug for crate::Item {
     fn fmt(&self, formatter: &mut fmt::Formatter) -> fmt::Result {
         formatter.write_str("Item::")?;
@@ -4758,7 +4758,7 @@ 
Files

     }
 }
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Debug for crate::ItemConst {
     fn fmt(&self, formatter: &mut fmt::Formatter) -> fmt::Result {
         self.debug(formatter, "ItemConst")
@@ -4782,7 +4782,7 @@ 
Files

     }
 }
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Debug for crate::ItemEnum {
     fn fmt(&self, formatter: &mut fmt::Formatter) -> fmt::Result {
         self.debug(formatter, "ItemEnum")
@@ -4803,7 +4803,7 @@ 
Files

     }
 }
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Debug for crate::ItemExternCrate {
     fn fmt(&self, formatter: &mut fmt::Formatter) -> fmt::Result {
         self.debug(formatter, "ItemExternCrate")
@@ -4824,7 +4824,7 @@ 
Files

     }
 }
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Debug for crate::ItemFn {
     fn fmt(&self, formatter: &mut fmt::Formatter) -> fmt::Result {
         self.debug(formatter, "ItemFn")
@@ -4842,7 +4842,7 @@ 
Files

     }
 }
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Debug for crate::ItemForeignMod {
     fn fmt(&self, formatter: &mut fmt::Formatter) -> fmt::Result {
         self.debug(formatter, "ItemForeignMod")
@@ -4861,7 +4861,7 @@ 
Files

     }
 }
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Debug for crate::ItemImpl {
     fn fmt(&self, formatter: &mut fmt::Formatter) -> fmt::Result {
         self.debug(formatter, "ItemImpl")
@@ -4884,7 +4884,7 @@ 
Files

     }
 }
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Debug for crate::ItemMacro {
     fn fmt(&self, formatter: &mut fmt::Formatter) -> fmt::Result {
         self.debug(formatter, "ItemMacro")
@@ -4902,7 +4902,7 @@ 
Files

     }
 }
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Debug for crate::ItemMod {
     fn fmt(&self, formatter: &mut fmt::Formatter) -> fmt::Result {
         self.debug(formatter, "ItemMod")
@@ -4923,7 +4923,7 @@ 
Files

     }
 }
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Debug for crate::ItemStatic {
     fn fmt(&self, formatter: &mut fmt::Formatter) -> fmt::Result {
         self.debug(formatter, "ItemStatic")
@@ -4947,7 +4947,7 @@ 
Files

     }
 }
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Debug for crate::ItemStruct {
     fn fmt(&self, formatter: &mut fmt::Formatter) -> fmt::Result {
         self.debug(formatter, "ItemStruct")
@@ -4968,7 +4968,7 @@ 
Files

     }
 }
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Debug for crate::ItemTrait {
     fn fmt(&self, formatter: &mut fmt::Formatter) -> fmt::Result {
         self.debug(formatter, "ItemTrait")
@@ -4994,7 +4994,7 @@ 
Files

     }
 }
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Debug for crate::ItemTraitAlias {
     fn fmt(&self, formatter: &mut fmt::Formatter) -> fmt::Result {
         self.debug(formatter, "ItemTraitAlias")
@@ -5016,7 +5016,7 @@ 
Files

     }
 }
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Debug for crate::ItemType {
     fn fmt(&self, formatter: &mut fmt::Formatter) -> fmt::Result {
         self.debug(formatter, "ItemType")
@@ -5038,7 +5038,7 @@ 
Files

     }
 }
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Debug for crate::ItemUnion {
     fn fmt(&self, formatter: &mut fmt::Formatter) -> fmt::Result {
         self.debug(formatter, "ItemUnion")
@@ -5058,7 +5058,7 @@ 
Files

     }
 }
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Debug for crate::ItemUse {
     fn fmt(&self, formatter: &mut fmt::Formatter) -> fmt::Result {
         self.debug(formatter, "ItemUse")
@@ -5078,7 +5078,7 @@ 
Files

     }
 }
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Debug for crate::Label {
     fn fmt(&self, formatter: &mut fmt::Formatter) -> fmt::Result {
         let mut formatter = formatter.debug_struct("Label");
@@ -5087,7 +5087,7 @@ 
Files

         formatter.finish()
     }
 }
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Debug for crate::Lifetime {
     fn fmt(&self, formatter: &mut fmt::Formatter) -> fmt::Result {
         self.debug(formatter, "Lifetime")
@@ -5102,7 +5102,7 @@ 
Files

     }
 }
 #[cfg(any(feature = "derive", feature = "full"))]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Debug for crate::LifetimeParam {
     fn fmt(&self, formatter: &mut fmt::Formatter) -> fmt::Result {
         let mut formatter = formatter.debug_struct("LifetimeParam");
@@ -5113,7 +5113,7 @@ 
Files

         formatter.finish()
     }
 }
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Debug for crate::Lit {
     fn fmt(&self, formatter: &mut fmt::Formatter) -> fmt::Result {
         formatter.write_str("Lit::")?;
@@ -5135,7 +5135,7 @@ 
Files

     }
 }
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Debug for crate::Local {
     fn fmt(&self, formatter: &mut fmt::Formatter) -> fmt::Result {
         self.debug(formatter, "Local")
@@ -5154,7 +5154,7 @@ 
Files

     }
 }
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Debug for crate::LocalInit {
     fn fmt(&self, formatter: &mut fmt::Formatter) -> fmt::Result {
         let mut formatter = formatter.debug_struct("LocalInit");
@@ -5165,7 +5165,7 @@ 
Files

     }
 }
 #[cfg(any(feature = "derive", feature = "full"))]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Debug for crate::Macro {
     fn fmt(&self, formatter: &mut fmt::Formatter) -> fmt::Result {
         let mut formatter = formatter.debug_struct("Macro");
@@ -5177,7 +5177,7 @@ 
Files

     }
 }
 #[cfg(any(feature = "derive", feature = "full"))]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Debug for crate::MacroDelimiter {
     fn fmt(&self, formatter: &mut fmt::Formatter) -> fmt::Result {
         formatter.write_str("MacroDelimiter::")?;
@@ -5201,7 +5201,7 @@ 
Files

     }
 }
 #[cfg(any(feature = "derive", feature = "full"))]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Debug for crate::Member {
     fn fmt(&self, formatter: &mut fmt::Formatter) -> fmt::Result {
         formatter.write_str("Member::")?;
@@ -5220,7 +5220,7 @@ 
Files

     }
 }
 #[cfg(any(feature = "derive", feature = "full"))]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Debug for crate::Meta {
     fn fmt(&self, formatter: &mut fmt::Formatter) -> fmt::Result {
         formatter.write_str("Meta::")?;
@@ -5232,7 +5232,7 @@ 
Files

     }
 }
 #[cfg(any(feature = "derive", feature = "full"))]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Debug for crate::MetaList {
     fn fmt(&self, formatter: &mut fmt::Formatter) -> fmt::Result {
         self.debug(formatter, "MetaList")
@@ -5249,7 +5249,7 @@ 
Files

     }
 }
 #[cfg(any(feature = "derive", feature = "full"))]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Debug for crate::MetaNameValue {
     fn fmt(&self, formatter: &mut fmt::Formatter) -> fmt::Result {
         self.debug(formatter, "MetaNameValue")
@@ -5266,7 +5266,7 @@ 
Files

     }
 }
 #[cfg(any(feature = "derive", feature = "full"))]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Debug for crate::ParenthesizedGenericArguments {
     fn fmt(&self, formatter: &mut fmt::Formatter) -> fmt::Result {
         self.debug(formatter, "ParenthesizedGenericArguments")
@@ -5283,7 +5283,7 @@ 
Files

     }
 }
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Debug for crate::Pat {
     fn fmt(&self, formatter: &mut fmt::Formatter) -> fmt::Result {
         formatter.write_str("Pat::")?;
@@ -5313,7 +5313,7 @@ 
Files

     }
 }
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Debug for crate::PatIdent {
     fn fmt(&self, formatter: &mut fmt::Formatter) -> fmt::Result {
         self.debug(formatter, "PatIdent")
@@ -5332,7 +5332,7 @@ 
Files

     }
 }
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Debug for crate::PatOr {
     fn fmt(&self, formatter: &mut fmt::Formatter) -> fmt::Result {
         self.debug(formatter, "PatOr")
@@ -5349,7 +5349,7 @@ 
Files

     }
 }
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Debug for crate::PatParen {
     fn fmt(&self, formatter: &mut fmt::Formatter) -> fmt::Result {
         self.debug(formatter, "PatParen")
@@ -5366,7 +5366,7 @@ 
Files

     }
 }
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Debug for crate::PatReference {
     fn fmt(&self, formatter: &mut fmt::Formatter) -> fmt::Result {
         self.debug(formatter, "PatReference")
@@ -5384,7 +5384,7 @@ 
Files

     }
 }
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Debug for crate::PatRest {
     fn fmt(&self, formatter: &mut fmt::Formatter) -> fmt::Result {
         self.debug(formatter, "PatRest")
@@ -5400,7 +5400,7 @@ 
Files

     }
 }
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Debug for crate::PatSlice {
     fn fmt(&self, formatter: &mut fmt::Formatter) -> fmt::Result {
         self.debug(formatter, "PatSlice")
@@ -5417,7 +5417,7 @@ 
Files

     }
 }
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Debug for crate::PatStruct {
     fn fmt(&self, formatter: &mut fmt::Formatter) -> fmt::Result {
         self.debug(formatter, "PatStruct")
@@ -5437,7 +5437,7 @@ 
Files

     }
 }
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Debug for crate::PatTuple {
     fn fmt(&self, formatter: &mut fmt::Formatter) -> fmt::Result {
         self.debug(formatter, "PatTuple")
@@ -5454,7 +5454,7 @@ 
Files

     }
 }
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Debug for crate::PatTupleStruct {
     fn fmt(&self, formatter: &mut fmt::Formatter) -> fmt::Result {
         self.debug(formatter, "PatTupleStruct")
@@ -5473,7 +5473,7 @@ 
Files

     }
 }
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Debug for crate::PatType {
     fn fmt(&self, formatter: &mut fmt::Formatter) -> fmt::Result {
         self.debug(formatter, "PatType")
@@ -5491,7 +5491,7 @@ 
Files

     }
 }
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Debug for crate::PatWild {
     fn fmt(&self, formatter: &mut fmt::Formatter) -> fmt::Result {
         self.debug(formatter, "PatWild")
@@ -5507,7 +5507,7 @@ 
Files

     }
 }
 #[cfg(any(feature = "derive", feature = "full"))]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Debug for crate::Path {
     fn fmt(&self, formatter: &mut fmt::Formatter) -> fmt::Result {
         self.debug(formatter, "Path")
@@ -5523,7 +5523,7 @@ 
Files

     }
 }
 #[cfg(any(feature = "derive", feature = "full"))]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Debug for crate::PathArguments {
     fn fmt(&self, formatter: &mut fmt::Formatter) -> fmt::Result {
         formatter.write_str("PathArguments::")?;
@@ -5539,7 +5539,7 @@ 
Files

     }
 }
 #[cfg(any(feature = "derive", feature = "full"))]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Debug for crate::PathSegment {
     fn fmt(&self, formatter: &mut fmt::Formatter) -> fmt::Result {
         let mut formatter = formatter.debug_struct("PathSegment");
@@ -5549,7 +5549,7 @@ 
Files

     }
 }
 #[cfg(any(feature = "derive", feature = "full"))]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Debug for crate::PredicateLifetime {
     fn fmt(&self, formatter: &mut fmt::Formatter) -> fmt::Result {
         let mut formatter = formatter.debug_struct("PredicateLifetime");
@@ -5560,7 +5560,7 @@ 
Files

     }
 }
 #[cfg(any(feature = "derive", feature = "full"))]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Debug for crate::PredicateType {
     fn fmt(&self, formatter: &mut fmt::Formatter) -> fmt::Result {
         let mut formatter = formatter.debug_struct("PredicateType");
@@ -5572,7 +5572,7 @@ 
Files

     }
 }
 #[cfg(any(feature = "derive", feature = "full"))]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Debug for crate::QSelf {
     fn fmt(&self, formatter: &mut fmt::Formatter) -> fmt::Result {
         let mut formatter = formatter.debug_struct("QSelf");
@@ -5585,7 +5585,7 @@ 
Files

     }
 }
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Debug for crate::RangeLimits {
     fn fmt(&self, formatter: &mut fmt::Formatter) -> fmt::Result {
         formatter.write_str("RangeLimits::")?;
@@ -5604,7 +5604,7 @@ 
Files

     }
 }
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Debug for crate::Receiver {
     fn fmt(&self, formatter: &mut fmt::Formatter) -> fmt::Result {
         let mut formatter = formatter.debug_struct("Receiver");
@@ -5618,7 +5618,7 @@ 
Files

     }
 }
 #[cfg(any(feature = "derive", feature = "full"))]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Debug for crate::ReturnType {
     fn fmt(&self, formatter: &mut fmt::Formatter) -> fmt::Result {
         formatter.write_str("ReturnType::")?;
@@ -5634,7 +5634,7 @@ 
Files

     }
 }
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Debug for crate::Signature {
     fn fmt(&self, formatter: &mut fmt::Formatter) -> fmt::Result {
         let mut formatter = formatter.debug_struct("Signature");
@@ -5653,7 +5653,7 @@ 
Files

     }
 }
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Debug for crate::StaticMutability {
     fn fmt(&self, formatter: &mut fmt::Formatter) -> fmt::Result {
         formatter.write_str("StaticMutability::")?;
@@ -5668,7 +5668,7 @@ 
Files

     }
 }
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Debug for crate::Stmt {
     fn fmt(&self, formatter: &mut fmt::Formatter) -> fmt::Result {
         formatter.write_str("Stmt::")?;
@@ -5690,7 +5690,7 @@ 
Files

     }
 }
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Debug for crate::StmtMacro {
     fn fmt(&self, formatter: &mut fmt::Formatter) -> fmt::Result {
         self.debug(formatter, "StmtMacro")
@@ -5707,7 +5707,7 @@ 
Files

     }
 }
 #[cfg(any(feature = "derive", feature = "full"))]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Debug for crate::TraitBound {
     fn fmt(&self, formatter: &mut fmt::Formatter) -> fmt::Result {
         let mut formatter = formatter.debug_struct("TraitBound");
@@ -5719,7 +5719,7 @@ 
Files

     }
 }
 #[cfg(any(feature = "derive", feature = "full"))]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Debug for crate::TraitBoundModifier {
     fn fmt(&self, formatter: &mut fmt::Formatter) -> fmt::Result {
         formatter.write_str("TraitBoundModifier::")?;
@@ -5734,7 +5734,7 @@ 
Files

     }
 }
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Debug for crate::TraitItem {
     fn fmt(&self, formatter: &mut fmt::Formatter) -> fmt::Result {
         formatter.write_str("TraitItem::")?;
@@ -5752,7 +5752,7 @@ 
Files

     }
 }
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Debug for crate::TraitItemConst {
     fn fmt(&self, formatter: &mut fmt::Formatter) -> fmt::Result {
         self.debug(formatter, "TraitItemConst")
@@ -5774,7 +5774,7 @@ 
Files

     }
 }
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Debug for crate::TraitItemFn {
     fn fmt(&self, formatter: &mut fmt::Formatter) -> fmt::Result {
         self.debug(formatter, "TraitItemFn")
@@ -5792,7 +5792,7 @@ 
Files

     }
 }
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Debug for crate::TraitItemMacro {
     fn fmt(&self, formatter: &mut fmt::Formatter) -> fmt::Result {
         self.debug(formatter, "TraitItemMacro")
@@ -5809,7 +5809,7 @@ 
Files

     }
 }
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Debug for crate::TraitItemType {
     fn fmt(&self, formatter: &mut fmt::Formatter) -> fmt::Result {
         self.debug(formatter, "TraitItemType")
@@ -5831,7 +5831,7 @@ 
Files

     }
 }
 #[cfg(any(feature = "derive", feature = "full"))]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Debug for crate::Type {
     fn fmt(&self, formatter: &mut fmt::Formatter) -> fmt::Result {
         formatter.write_str("Type::")?;
@@ -5859,7 +5859,7 @@ 
Files

     }
 }
 #[cfg(any(feature = "derive", feature = "full"))]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Debug for crate::TypeArray {
     fn fmt(&self, formatter: &mut fmt::Formatter) -> fmt::Result {
         self.debug(formatter, "TypeArray")
@@ -5877,7 +5877,7 @@ 
Files

     }
 }
 #[cfg(any(feature = "derive", feature = "full"))]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Debug for crate::TypeBareFn {
     fn fmt(&self, formatter: &mut fmt::Formatter) -> fmt::Result {
         self.debug(formatter, "TypeBareFn")
@@ -5899,7 +5899,7 @@ 
Files

     }
 }
 #[cfg(any(feature = "derive", feature = "full"))]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Debug for crate::TypeGroup {
     fn fmt(&self, formatter: &mut fmt::Formatter) -> fmt::Result {
         self.debug(formatter, "TypeGroup")
@@ -5915,7 +5915,7 @@ 
Files

     }
 }
 #[cfg(any(feature = "derive", feature = "full"))]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Debug for crate::TypeImplTrait {
     fn fmt(&self, formatter: &mut fmt::Formatter) -> fmt::Result {
         self.debug(formatter, "TypeImplTrait")
@@ -5931,7 +5931,7 @@ 
Files

     }
 }
 #[cfg(any(feature = "derive", feature = "full"))]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Debug for crate::TypeInfer {
     fn fmt(&self, formatter: &mut fmt::Formatter) -> fmt::Result {
         self.debug(formatter, "TypeInfer")
@@ -5946,7 +5946,7 @@ 
Files

     }
 }
 #[cfg(any(feature = "derive", feature = "full"))]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Debug for crate::TypeMacro {
     fn fmt(&self, formatter: &mut fmt::Formatter) -> fmt::Result {
         self.debug(formatter, "TypeMacro")
@@ -5961,7 +5961,7 @@ 
Files

     }
 }
 #[cfg(any(feature = "derive", feature = "full"))]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Debug for crate::TypeNever {
     fn fmt(&self, formatter: &mut fmt::Formatter) -> fmt::Result {
         self.debug(formatter, "TypeNever")
@@ -5976,7 +5976,7 @@ 
Files

     }
 }
 #[cfg(any(feature = "derive", feature = "full"))]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Debug for crate::TypeParam {
     fn fmt(&self, formatter: &mut fmt::Formatter) -> fmt::Result {
         let mut formatter = formatter.debug_struct("TypeParam");
@@ -5990,7 +5990,7 @@ 
Files

     }
 }
 #[cfg(any(feature = "derive", feature = "full"))]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Debug for crate::TypeParamBound {
     fn fmt(&self, formatter: &mut fmt::Formatter) -> fmt::Result {
         formatter.write_str("TypeParamBound::")?;
@@ -6010,7 +6010,7 @@ 
Files

     }
 }
 #[cfg(any(feature = "derive", feature = "full"))]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Debug for crate::TypeParen {
     fn fmt(&self, formatter: &mut fmt::Formatter) -> fmt::Result {
         self.debug(formatter, "TypeParen")
@@ -6026,7 +6026,7 @@ 
Files

     }
 }
 #[cfg(any(feature = "derive", feature = "full"))]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Debug for crate::TypePath {
     fn fmt(&self, formatter: &mut fmt::Formatter) -> fmt::Result {
         self.debug(formatter, "TypePath")
@@ -6042,7 +6042,7 @@ 
Files

     }
 }
 #[cfg(any(feature = "derive", feature = "full"))]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Debug for crate::TypePtr {
     fn fmt(&self, formatter: &mut fmt::Formatter) -> fmt::Result {
         self.debug(formatter, "TypePtr")
@@ -6060,7 +6060,7 @@ 
Files

     }
 }
 #[cfg(any(feature = "derive", feature = "full"))]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Debug for crate::TypeReference {
     fn fmt(&self, formatter: &mut fmt::Formatter) -> fmt::Result {
         self.debug(formatter, "TypeReference")
@@ -6078,7 +6078,7 @@ 
Files

     }
 }
 #[cfg(any(feature = "derive", feature = "full"))]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Debug for crate::TypeSlice {
     fn fmt(&self, formatter: &mut fmt::Formatter) -> fmt::Result {
         self.debug(formatter, "TypeSlice")
@@ -6094,7 +6094,7 @@ 
Files

     }
 }
 #[cfg(any(feature = "derive", feature = "full"))]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Debug for crate::TypeTraitObject {
     fn fmt(&self, formatter: &mut fmt::Formatter) -> fmt::Result {
         self.debug(formatter, "TypeTraitObject")
@@ -6110,7 +6110,7 @@ 
Files

     }
 }
 #[cfg(any(feature = "derive", feature = "full"))]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Debug for crate::TypeTuple {
     fn fmt(&self, formatter: &mut fmt::Formatter) -> fmt::Result {
         self.debug(formatter, "TypeTuple")
@@ -6126,7 +6126,7 @@ 
Files

     }
 }
 #[cfg(any(feature = "derive", feature = "full"))]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Debug for crate::UnOp {
     fn fmt(&self, formatter: &mut fmt::Formatter) -> fmt::Result {
         formatter.write_str("UnOp::")?;
@@ -6150,7 +6150,7 @@ 
Files

     }
 }
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Debug for crate::UseGlob {
     fn fmt(&self, formatter: &mut fmt::Formatter) -> fmt::Result {
         let mut formatter = formatter.debug_struct("UseGlob");
@@ -6159,7 +6159,7 @@ 
Files

     }
 }
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Debug for crate::UseGroup {
     fn fmt(&self, formatter: &mut fmt::Formatter) -> fmt::Result {
         let mut formatter = formatter.debug_struct("UseGroup");
@@ -6169,7 +6169,7 @@ 
Files

     }
 }
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Debug for crate::UseName {
     fn fmt(&self, formatter: &mut fmt::Formatter) -> fmt::Result {
         let mut formatter = formatter.debug_struct("UseName");
@@ -6178,7 +6178,7 @@ 
Files

     }
 }
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Debug for crate::UsePath {
     fn fmt(&self, formatter: &mut fmt::Formatter) -> fmt::Result {
         let mut formatter = formatter.debug_struct("UsePath");
@@ -6189,7 +6189,7 @@ 
Files

     }
 }
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Debug for crate::UseRename {
     fn fmt(&self, formatter: &mut fmt::Formatter) -> fmt::Result {
         let mut formatter = formatter.debug_struct("UseRename");
@@ -6200,7 +6200,7 @@ 
Files

     }
 }
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Debug for crate::UseTree {
     fn fmt(&self, formatter: &mut fmt::Formatter) -> fmt::Result {
         formatter.write_str("UseTree::")?;
@@ -6234,7 +6234,7 @@ 
Files

     }
 }
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Debug for crate::Variadic {
     fn fmt(&self, formatter: &mut fmt::Formatter) -> fmt::Result {
         let mut formatter = formatter.debug_struct("Variadic");
@@ -6246,7 +6246,7 @@ 
Files

     }
 }
 #[cfg(any(feature = "derive", feature = "full"))]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Debug for crate::Variant {
     fn fmt(&self, formatter: &mut fmt::Formatter) -> fmt::Result {
         let mut formatter = formatter.debug_struct("Variant");
@@ -6258,7 +6258,7 @@ 
Files

     }
 }
 #[cfg(any(feature = "derive", feature = "full"))]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Debug for crate::VisRestricted {
     fn fmt(&self, formatter: &mut fmt::Formatter) -> fmt::Result {
         self.debug(formatter, "VisRestricted")
@@ -6276,7 +6276,7 @@ 
Files

     }
 }
 #[cfg(any(feature = "derive", feature = "full"))]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Debug for crate::Visibility {
     fn fmt(&self, formatter: &mut fmt::Formatter) -> fmt::Result {
         formatter.write_str("Visibility::")?;
@@ -6292,7 +6292,7 @@ 
Files

     }
 }
 #[cfg(any(feature = "derive", feature = "full"))]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Debug for crate::WhereClause {
     fn fmt(&self, formatter: &mut fmt::Formatter) -> fmt::Result {
         let mut formatter = formatter.debug_struct("WhereClause");
@@ -6302,7 +6302,7 @@ 
Files

     }
 }
 #[cfg(any(feature = "derive", feature = "full"))]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Debug for crate::WherePredicate {
     fn fmt(&self, formatter: &mut fmt::Formatter) -> fmt::Result {
         formatter.write_str("WherePredicate::")?;
diff --git a/src/syn/gen/eq.rs.html b/src/syn/gen/eq.rs.html
index d09e9e711d..c0a9043288 100644
--- a/src/syn/gen/eq.rs.html
+++ b/src/syn/gen/eq.rs.html
@@ -1,4 +1,4 @@
-eq.rs - source

 #[cfg(any(feature = "derive", feature = "full"))]
 use crate::tt::TokenStreamHelper;
 #[cfg(any(feature = "derive", feature = "full"))]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Eq for crate::Abi {}
 #[cfg(any(feature = "derive", feature = "full"))]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl PartialEq for crate::Abi {
     fn eq(&self, other: &Self) -> bool {
         self.name == other.name
     }
 }
 #[cfg(any(feature = "derive", feature = "full"))]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Eq for crate::AngleBracketedGenericArguments {}
 #[cfg(any(feature = "derive", feature = "full"))]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl PartialEq for crate::AngleBracketedGenericArguments {
     fn eq(&self, other: &Self) -> bool {
         self.colon2_token == other.colon2_token && self.args == other.args
     }
 }
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Eq for crate::Arm {}
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl PartialEq for crate::Arm {
     fn eq(&self, other: &Self) -> bool {
         self.attrs == other.attrs && self.pat == other.pat && self.guard == other.guard
@@ -2279,10 +2279,10 @@ 
Files

     }
 }
 #[cfg(any(feature = "derive", feature = "full"))]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Eq for crate::AssocConst {}
 #[cfg(any(feature = "derive", feature = "full"))]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl PartialEq for crate::AssocConst {
     fn eq(&self, other: &Self) -> bool {
         self.ident == other.ident && self.generics == other.generics
@@ -2290,10 +2290,10 @@ 
Files

     }
 }
 #[cfg(any(feature = "derive", feature = "full"))]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Eq for crate::AssocType {}
 #[cfg(any(feature = "derive", feature = "full"))]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl PartialEq for crate::AssocType {
     fn eq(&self, other: &Self) -> bool {
         self.ident == other.ident && self.generics == other.generics
@@ -2301,10 +2301,10 @@ 
Files

     }
 }
 #[cfg(any(feature = "derive", feature = "full"))]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Eq for crate::AttrStyle {}
 #[cfg(any(feature = "derive", feature = "full"))]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl PartialEq for crate::AttrStyle {
     fn eq(&self, other: &Self) -> bool {
         match (self, other) {
@@ -2315,40 +2315,40 @@ 
Files

     }
 }
 #[cfg(any(feature = "derive", feature = "full"))]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Eq for crate::Attribute {}
 #[cfg(any(feature = "derive", feature = "full"))]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl PartialEq for crate::Attribute {
     fn eq(&self, other: &Self) -> bool {
         self.style == other.style && self.meta == other.meta
     }
 }
 #[cfg(any(feature = "derive", feature = "full"))]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Eq for crate::BareFnArg {}
 #[cfg(any(feature = "derive", feature = "full"))]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl PartialEq for crate::BareFnArg {
     fn eq(&self, other: &Self) -> bool {
         self.attrs == other.attrs && self.name == other.name && self.ty == other.ty
     }
 }
 #[cfg(any(feature = "derive", feature = "full"))]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Eq for crate::BareVariadic {}
 #[cfg(any(feature = "derive", feature = "full"))]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl PartialEq for crate::BareVariadic {
     fn eq(&self, other: &Self) -> bool {
         self.attrs == other.attrs && self.name == other.name && self.comma == other.comma
     }
 }
 #[cfg(any(feature = "derive", feature = "full"))]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Eq for crate::BinOp {}
 #[cfg(any(feature = "derive", feature = "full"))]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl PartialEq for crate::BinOp {
     fn eq(&self, other: &Self) -> bool {
         match (self, other) {
@@ -2385,30 +2385,30 @@ 
Files

     }
 }
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Eq for crate::Block {}
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl PartialEq for crate::Block {
     fn eq(&self, other: &Self) -> bool {
         self.stmts == other.stmts
     }
 }
 #[cfg(any(feature = "derive", feature = "full"))]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Eq for crate::BoundLifetimes {}
 #[cfg(any(feature = "derive", feature = "full"))]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl PartialEq for crate::BoundLifetimes {
     fn eq(&self, other: &Self) -> bool {
         self.lifetimes == other.lifetimes
     }
 }
 #[cfg(any(feature = "derive", feature = "full"))]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Eq for crate::ConstParam {}
 #[cfg(any(feature = "derive", feature = "full"))]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl PartialEq for crate::ConstParam {
     fn eq(&self, other: &Self) -> bool {
         self.attrs == other.attrs && self.ident == other.ident && self.ty == other.ty
@@ -2416,10 +2416,10 @@ 
Files

     }
 }
 #[cfg(any(feature = "derive", feature = "full"))]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Eq for crate::Constraint {}
 #[cfg(any(feature = "derive", feature = "full"))]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl PartialEq for crate::Constraint {
     fn eq(&self, other: &Self) -> bool {
         self.ident == other.ident && self.generics == other.generics
@@ -2427,10 +2427,10 @@ 
Files

     }
 }
 #[cfg(feature = "derive")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Eq for crate::Data {}
 #[cfg(feature = "derive")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl PartialEq for crate::Data {
     fn eq(&self, other: &Self) -> bool {
         match (self, other) {
@@ -2442,40 +2442,40 @@ 
Files

     }
 }
 #[cfg(feature = "derive")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Eq for crate::DataEnum {}
 #[cfg(feature = "derive")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl PartialEq for crate::DataEnum {
     fn eq(&self, other: &Self) -> bool {
         self.variants == other.variants
     }
 }
 #[cfg(feature = "derive")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Eq for crate::DataStruct {}
 #[cfg(feature = "derive")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl PartialEq for crate::DataStruct {
     fn eq(&self, other: &Self) -> bool {
         self.fields == other.fields && self.semi_token == other.semi_token
     }
 }
 #[cfg(feature = "derive")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Eq for crate::DataUnion {}
 #[cfg(feature = "derive")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl PartialEq for crate::DataUnion {
     fn eq(&self, other: &Self) -> bool {
         self.fields == other.fields
     }
 }
 #[cfg(feature = "derive")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Eq for crate::DeriveInput {}
 #[cfg(feature = "derive")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl PartialEq for crate::DeriveInput {
     fn eq(&self, other: &Self) -> bool {
         self.attrs == other.attrs && self.vis == other.vis && self.ident == other.ident
@@ -2483,10 +2483,10 @@ 
Files

     }
 }
 #[cfg(any(feature = "derive", feature = "full"))]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Eq for crate::Expr {}
 #[cfg(any(feature = "derive", feature = "full"))]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl PartialEq for crate::Expr {
     fn eq(&self, other: &Self) -> bool {
         match (self, other) {
@@ -2572,30 +2572,30 @@ 
Files

     }
 }
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Eq for crate::ExprArray {}
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl PartialEq for crate::ExprArray {
     fn eq(&self, other: &Self) -> bool {
         self.attrs == other.attrs && self.elems == other.elems
     }
 }
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Eq for crate::ExprAssign {}
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl PartialEq for crate::ExprAssign {
     fn eq(&self, other: &Self) -> bool {
         self.attrs == other.attrs && self.left == other.left && self.right == other.right
     }
 }
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Eq for crate::ExprAsync {}
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl PartialEq for crate::ExprAsync {
     fn eq(&self, other: &Self) -> bool {
         self.attrs == other.attrs && self.capture == other.capture
@@ -2603,20 +2603,20 @@ 
Files

     }
 }
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Eq for crate::ExprAwait {}
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl PartialEq for crate::ExprAwait {
     fn eq(&self, other: &Self) -> bool {
         self.attrs == other.attrs && self.base == other.base
     }
 }
 #[cfg(any(feature = "derive", feature = "full"))]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Eq for crate::ExprBinary {}
 #[cfg(any(feature = "derive", feature = "full"))]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl PartialEq for crate::ExprBinary {
     fn eq(&self, other: &Self) -> bool {
         self.attrs == other.attrs && self.left == other.left && self.op == other.op
@@ -2624,10 +2624,10 @@ 
Files

     }
 }
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Eq for crate::ExprBlock {}
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl PartialEq for crate::ExprBlock {
     fn eq(&self, other: &Self) -> bool {
         self.attrs == other.attrs && self.label == other.label
@@ -2635,40 +2635,40 @@ 
Files

     }
 }
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Eq for crate::ExprBreak {}
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl PartialEq for crate::ExprBreak {
     fn eq(&self, other: &Self) -> bool {
         self.attrs == other.attrs && self.label == other.label && self.expr == other.expr
     }
 }
 #[cfg(any(feature = "derive", feature = "full"))]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Eq for crate::ExprCall {}
 #[cfg(any(feature = "derive", feature = "full"))]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl PartialEq for crate::ExprCall {
     fn eq(&self, other: &Self) -> bool {
         self.attrs == other.attrs && self.func == other.func && self.args == other.args
     }
 }
 #[cfg(any(feature = "derive", feature = "full"))]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Eq for crate::ExprCast {}
 #[cfg(any(feature = "derive", feature = "full"))]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl PartialEq for crate::ExprCast {
     fn eq(&self, other: &Self) -> bool {
         self.attrs == other.attrs && self.expr == other.expr && self.ty == other.ty
     }
 }
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Eq for crate::ExprClosure {}
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl PartialEq for crate::ExprClosure {
     fn eq(&self, other: &Self) -> bool {
         self.attrs == other.attrs && self.lifetimes == other.lifetimes
@@ -2679,30 +2679,30 @@ 
Files

     }
 }
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Eq for crate::ExprConst {}
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl PartialEq for crate::ExprConst {
     fn eq(&self, other: &Self) -> bool {
         self.attrs == other.attrs && self.block == other.block
     }
 }
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Eq for crate::ExprContinue {}
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl PartialEq for crate::ExprContinue {
     fn eq(&self, other: &Self) -> bool {
         self.attrs == other.attrs && self.label == other.label
     }
 }
 #[cfg(any(feature = "derive", feature = "full"))]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Eq for crate::ExprField {}
 #[cfg(any(feature = "derive", feature = "full"))]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl PartialEq for crate::ExprField {
     fn eq(&self, other: &Self) -> bool {
         self.attrs == other.attrs && self.base == other.base
@@ -2710,10 +2710,10 @@ 
Files

     }
 }
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Eq for crate::ExprForLoop {}
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl PartialEq for crate::ExprForLoop {
     fn eq(&self, other: &Self) -> bool {
         self.attrs == other.attrs && self.label == other.label && self.pat == other.pat
@@ -2721,20 +2721,20 @@ 
Files

     }
 }
 #[cfg(any(feature = "derive", feature = "full"))]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Eq for crate::ExprGroup {}
 #[cfg(any(feature = "derive", feature = "full"))]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl PartialEq for crate::ExprGroup {
     fn eq(&self, other: &Self) -> bool {
         self.attrs == other.attrs && self.expr == other.expr
     }
 }
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Eq for crate::ExprIf {}
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl PartialEq for crate::ExprIf {
     fn eq(&self, other: &Self) -> bool {
         self.attrs == other.attrs && self.cond == other.cond
@@ -2743,80 +2743,80 @@ 
Files

     }
 }
 #[cfg(any(feature = "derive", feature = "full"))]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Eq for crate::ExprIndex {}
 #[cfg(any(feature = "derive", feature = "full"))]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl PartialEq for crate::ExprIndex {
     fn eq(&self, other: &Self) -> bool {
         self.attrs == other.attrs && self.expr == other.expr && self.index == other.index
     }
 }
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Eq for crate::ExprInfer {}
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl PartialEq for crate::ExprInfer {
     fn eq(&self, other: &Self) -> bool {
         self.attrs == other.attrs
     }
 }
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Eq for crate::ExprLet {}
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl PartialEq for crate::ExprLet {
     fn eq(&self, other: &Self) -> bool {
         self.attrs == other.attrs && self.pat == other.pat && self.expr == other.expr
     }
 }
 #[cfg(any(feature = "derive", feature = "full"))]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Eq for crate::ExprLit {}
 #[cfg(any(feature = "derive", feature = "full"))]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl PartialEq for crate::ExprLit {
     fn eq(&self, other: &Self) -> bool {
         self.attrs == other.attrs && self.lit == other.lit
     }
 }
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Eq for crate::ExprLoop {}
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl PartialEq for crate::ExprLoop {
     fn eq(&self, other: &Self) -> bool {
         self.attrs == other.attrs && self.label == other.label && self.body == other.body
     }
 }
 #[cfg(any(feature = "derive", feature = "full"))]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Eq for crate::ExprMacro {}
 #[cfg(any(feature = "derive", feature = "full"))]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl PartialEq for crate::ExprMacro {
     fn eq(&self, other: &Self) -> bool {
         self.attrs == other.attrs && self.mac == other.mac
     }
 }
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Eq for crate::ExprMatch {}
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl PartialEq for crate::ExprMatch {
     fn eq(&self, other: &Self) -> bool {
         self.attrs == other.attrs && self.expr == other.expr && self.arms == other.arms
     }
 }
 #[cfg(any(feature = "derive", feature = "full"))]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Eq for crate::ExprMethodCall {}
 #[cfg(any(feature = "derive", feature = "full"))]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl PartialEq for crate::ExprMethodCall {
     fn eq(&self, other: &Self) -> bool {
         self.attrs == other.attrs && self.receiver == other.receiver
@@ -2825,30 +2825,30 @@ 
Files

     }
 }
 #[cfg(any(feature = "derive", feature = "full"))]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Eq for crate::ExprParen {}
 #[cfg(any(feature = "derive", feature = "full"))]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl PartialEq for crate::ExprParen {
     fn eq(&self, other: &Self) -> bool {
         self.attrs == other.attrs && self.expr == other.expr
     }
 }
 #[cfg(any(feature = "derive", feature = "full"))]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Eq for crate::ExprPath {}
 #[cfg(any(feature = "derive", feature = "full"))]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl PartialEq for crate::ExprPath {
     fn eq(&self, other: &Self) -> bool {
         self.attrs == other.attrs && self.qself == other.qself && self.path == other.path
     }
 }
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Eq for crate::ExprRange {}
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl PartialEq for crate::ExprRange {
     fn eq(&self, other: &Self) -> bool {
         self.attrs == other.attrs && self.start == other.start
@@ -2856,10 +2856,10 @@ 
Files

     }
 }
 #[cfg(any(feature = "derive", feature = "full"))]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Eq for crate::ExprReference {}
 #[cfg(any(feature = "derive", feature = "full"))]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl PartialEq for crate::ExprReference {
     fn eq(&self, other: &Self) -> bool {
         self.attrs == other.attrs && self.mutability == other.mutability
@@ -2867,30 +2867,30 @@ 
Files

     }
 }
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Eq for crate::ExprRepeat {}
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl PartialEq for crate::ExprRepeat {
     fn eq(&self, other: &Self) -> bool {
         self.attrs == other.attrs && self.expr == other.expr && self.len == other.len
     }
 }
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Eq for crate::ExprReturn {}
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl PartialEq for crate::ExprReturn {
     fn eq(&self, other: &Self) -> bool {
         self.attrs == other.attrs && self.expr == other.expr
     }
 }
 #[cfg(any(feature = "derive", feature = "full"))]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Eq for crate::ExprStruct {}
 #[cfg(any(feature = "derive", feature = "full"))]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl PartialEq for crate::ExprStruct {
     fn eq(&self, other: &Self) -> bool {
         self.attrs == other.attrs && self.qself == other.qself && self.path == other.path
@@ -2899,60 +2899,60 @@ 
Files

     }
 }
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Eq for crate::ExprTry {}
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl PartialEq for crate::ExprTry {
     fn eq(&self, other: &Self) -> bool {
         self.attrs == other.attrs && self.expr == other.expr
     }
 }
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Eq for crate::ExprTryBlock {}
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl PartialEq for crate::ExprTryBlock {
     fn eq(&self, other: &Self) -> bool {
         self.attrs == other.attrs && self.block == other.block
     }
 }
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Eq for crate::ExprTuple {}
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl PartialEq for crate::ExprTuple {
     fn eq(&self, other: &Self) -> bool {
         self.attrs == other.attrs && self.elems == other.elems
     }
 }
 #[cfg(any(feature = "derive", feature = "full"))]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Eq for crate::ExprUnary {}
 #[cfg(any(feature = "derive", feature = "full"))]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl PartialEq for crate::ExprUnary {
     fn eq(&self, other: &Self) -> bool {
         self.attrs == other.attrs && self.op == other.op && self.expr == other.expr
     }
 }
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Eq for crate::ExprUnsafe {}
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl PartialEq for crate::ExprUnsafe {
     fn eq(&self, other: &Self) -> bool {
         self.attrs == other.attrs && self.block == other.block
     }
 }
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Eq for crate::ExprWhile {}
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl PartialEq for crate::ExprWhile {
     fn eq(&self, other: &Self) -> bool {
         self.attrs == other.attrs && self.label == other.label && self.cond == other.cond
@@ -2960,20 +2960,20 @@ 
Files

     }
 }
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Eq for crate::ExprYield {}
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl PartialEq for crate::ExprYield {
     fn eq(&self, other: &Self) -> bool {
         self.attrs == other.attrs && self.expr == other.expr
     }
 }
 #[cfg(any(feature = "derive", feature = "full"))]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Eq for crate::Field {}
 #[cfg(any(feature = "derive", feature = "full"))]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl PartialEq for crate::Field {
     fn eq(&self, other: &Self) -> bool {
         self.attrs == other.attrs && self.vis == other.vis
@@ -2982,10 +2982,10 @@ 
Files

     }
 }
 #[cfg(any(feature = "derive", feature = "full"))]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Eq for crate::FieldMutability {}
 #[cfg(any(feature = "derive", feature = "full"))]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl PartialEq for crate::FieldMutability {
     fn eq(&self, other: &Self) -> bool {
         match (self, other) {
@@ -2994,10 +2994,10 @@ 
Files

     }
 }
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Eq for crate::FieldPat {}
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl PartialEq for crate::FieldPat {
     fn eq(&self, other: &Self) -> bool {
         self.attrs == other.attrs && self.member == other.member
@@ -3005,10 +3005,10 @@ 
Files

     }
 }
 #[cfg(any(feature = "derive", feature = "full"))]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Eq for crate::FieldValue {}
 #[cfg(any(feature = "derive", feature = "full"))]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl PartialEq for crate::FieldValue {
     fn eq(&self, other: &Self) -> bool {
         self.attrs == other.attrs && self.member == other.member
@@ -3016,10 +3016,10 @@ 
Files

     }
 }
 #[cfg(any(feature = "derive", feature = "full"))]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Eq for crate::Fields {}
 #[cfg(any(feature = "derive", feature = "full"))]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl PartialEq for crate::Fields {
     fn eq(&self, other: &Self) -> bool {
         match (self, other) {
@@ -3035,30 +3035,30 @@ 
Files

     }
 }
 #[cfg(any(feature = "derive", feature = "full"))]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Eq for crate::FieldsNamed {}
 #[cfg(any(feature = "derive", feature = "full"))]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl PartialEq for crate::FieldsNamed {
     fn eq(&self, other: &Self) -> bool {
         self.named == other.named
     }
 }
 #[cfg(any(feature = "derive", feature = "full"))]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Eq for crate::FieldsUnnamed {}
 #[cfg(any(feature = "derive", feature = "full"))]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl PartialEq for crate::FieldsUnnamed {
     fn eq(&self, other: &Self) -> bool {
         self.unnamed == other.unnamed
     }
 }
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Eq for crate::File {}
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl PartialEq for crate::File {
     fn eq(&self, other: &Self) -> bool {
         self.shebang == other.shebang && self.attrs == other.attrs
@@ -3066,10 +3066,10 @@ 
Files

     }
 }
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Eq for crate::FnArg {}
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl PartialEq for crate::FnArg {
     fn eq(&self, other: &Self) -> bool {
         match (self, other) {
@@ -3082,10 +3082,10 @@ 
Files

     }
 }
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Eq for crate::ForeignItem {}
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl PartialEq for crate::ForeignItem {
     fn eq(&self, other: &Self) -> bool {
         match (self, other) {
@@ -3110,20 +3110,20 @@ 
Files

     }
 }
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Eq for crate::ForeignItemFn {}
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl PartialEq for crate::ForeignItemFn {
     fn eq(&self, other: &Self) -> bool {
         self.attrs == other.attrs && self.vis == other.vis && self.sig == other.sig
     }
 }
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Eq for crate::ForeignItemMacro {}
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl PartialEq for crate::ForeignItemMacro {
     fn eq(&self, other: &Self) -> bool {
         self.attrs == other.attrs && self.mac == other.mac
@@ -3131,10 +3131,10 @@ 
Files

     }
 }
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Eq for crate::ForeignItemStatic {}
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl PartialEq for crate::ForeignItemStatic {
     fn eq(&self, other: &Self) -> bool {
         self.attrs == other.attrs && self.vis == other.vis
@@ -3143,10 +3143,10 @@ 
Files

     }
 }
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Eq for crate::ForeignItemType {}
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl PartialEq for crate::ForeignItemType {
     fn eq(&self, other: &Self) -> bool {
         self.attrs == other.attrs && self.vis == other.vis && self.ident == other.ident
@@ -3154,10 +3154,10 @@ 
Files

     }
 }
 #[cfg(any(feature = "derive", feature = "full"))]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Eq for crate::GenericArgument {}
 #[cfg(any(feature = "derive", feature = "full"))]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl PartialEq for crate::GenericArgument {
     fn eq(&self, other: &Self) -> bool {
         match (self, other) {
@@ -3190,10 +3190,10 @@ 
Files

     }
 }
 #[cfg(any(feature = "derive", feature = "full"))]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Eq for crate::GenericParam {}
 #[cfg(any(feature = "derive", feature = "full"))]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl PartialEq for crate::GenericParam {
     fn eq(&self, other: &Self) -> bool {
         match (self, other) {
@@ -3212,10 +3212,10 @@ 
Files

     }
 }
 #[cfg(any(feature = "derive", feature = "full"))]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Eq for crate::Generics {}
 #[cfg(any(feature = "derive", feature = "full"))]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl PartialEq for crate::Generics {
     fn eq(&self, other: &Self) -> bool {
         self.lt_token == other.lt_token && self.params == other.params
@@ -3223,10 +3223,10 @@ 
Files

     }
 }
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Eq for crate::ImplItem {}
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl PartialEq for crate::ImplItem {
     fn eq(&self, other: &Self) -> bool {
         match (self, other) {
@@ -3248,10 +3248,10 @@ 
Files

     }
 }
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Eq for crate::ImplItemConst {}
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl PartialEq for crate::ImplItemConst {
     fn eq(&self, other: &Self) -> bool {
         self.attrs == other.attrs && self.vis == other.vis
@@ -3261,10 +3261,10 @@ 
Files

     }
 }
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Eq for crate::ImplItemFn {}
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl PartialEq for crate::ImplItemFn {
     fn eq(&self, other: &Self) -> bool {
         self.attrs == other.attrs && self.vis == other.vis
@@ -3273,10 +3273,10 @@ 
Files

     }
 }
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Eq for crate::ImplItemMacro {}
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl PartialEq for crate::ImplItemMacro {
     fn eq(&self, other: &Self) -> bool {
         self.attrs == other.attrs && self.mac == other.mac
@@ -3284,10 +3284,10 @@ 
Files

     }
 }
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Eq for crate::ImplItemType {}
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl PartialEq for crate::ImplItemType {
     fn eq(&self, other: &Self) -> bool {
         self.attrs == other.attrs && self.vis == other.vis
@@ -3296,20 +3296,20 @@ 
Files

     }
 }
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Eq for crate::ImplRestriction {}
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl PartialEq for crate::ImplRestriction {
     fn eq(&self, _other: &Self) -> bool {
         match *self {}
     }
 }
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Eq for crate::Item {}
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl PartialEq for crate::Item {
     fn eq(&self, other: &Self) -> bool {
         match (self, other) {
@@ -3342,10 +3342,10 @@ 
Files

     }
 }
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Eq for crate::ItemConst {}
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl PartialEq for crate::ItemConst {
     fn eq(&self, other: &Self) -> bool {
         self.attrs == other.attrs && self.vis == other.vis && self.ident == other.ident
@@ -3354,10 +3354,10 @@ 
Files

     }
 }
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Eq for crate::ItemEnum {}
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl PartialEq for crate::ItemEnum {
     fn eq(&self, other: &Self) -> bool {
         self.attrs == other.attrs && self.vis == other.vis && self.ident == other.ident
@@ -3365,10 +3365,10 @@ 
Files

     }
 }
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Eq for crate::ItemExternCrate {}
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl PartialEq for crate::ItemExternCrate {
     fn eq(&self, other: &Self) -> bool {
         self.attrs == other.attrs && self.vis == other.vis && self.ident == other.ident
@@ -3376,10 +3376,10 @@ 
Files

     }
 }
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Eq for crate::ItemFn {}
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl PartialEq for crate::ItemFn {
     fn eq(&self, other: &Self) -> bool {
         self.attrs == other.attrs && self.vis == other.vis && self.sig == other.sig
@@ -3387,10 +3387,10 @@ 
Files

     }
 }
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Eq for crate::ItemForeignMod {}
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl PartialEq for crate::ItemForeignMod {
     fn eq(&self, other: &Self) -> bool {
         self.attrs == other.attrs && self.unsafety == other.unsafety
@@ -3398,10 +3398,10 @@ 
Files

     }
 }
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Eq for crate::ItemImpl {}
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl PartialEq for crate::ItemImpl {
     fn eq(&self, other: &Self) -> bool {
         self.attrs == other.attrs && self.defaultness == other.defaultness
@@ -3411,10 +3411,10 @@ 
Files

     }
 }
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Eq for crate::ItemMacro {}
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl PartialEq for crate::ItemMacro {
     fn eq(&self, other: &Self) -> bool {
         self.attrs == other.attrs && self.ident == other.ident && self.mac == other.mac
@@ -3422,10 +3422,10 @@ 
Files

     }
 }
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Eq for crate::ItemMod {}
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl PartialEq for crate::ItemMod {
     fn eq(&self, other: &Self) -> bool {
         self.attrs == other.attrs && self.vis == other.vis
@@ -3434,10 +3434,10 @@ 
Files

     }
 }
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Eq for crate::ItemStatic {}
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl PartialEq for crate::ItemStatic {
     fn eq(&self, other: &Self) -> bool {
         self.attrs == other.attrs && self.vis == other.vis
@@ -3446,10 +3446,10 @@ 
Files

     }
 }
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Eq for crate::ItemStruct {}
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl PartialEq for crate::ItemStruct {
     fn eq(&self, other: &Self) -> bool {
         self.attrs == other.attrs && self.vis == other.vis && self.ident == other.ident
@@ -3458,10 +3458,10 @@ 
Files

     }
 }
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Eq for crate::ItemTrait {}
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl PartialEq for crate::ItemTrait {
     fn eq(&self, other: &Self) -> bool {
         self.attrs == other.attrs && self.vis == other.vis
@@ -3472,10 +3472,10 @@ 
Files

     }
 }
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Eq for crate::ItemTraitAlias {}
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl PartialEq for crate::ItemTraitAlias {
     fn eq(&self, other: &Self) -> bool {
         self.attrs == other.attrs && self.vis == other.vis && self.ident == other.ident
@@ -3483,10 +3483,10 @@ 
Files

     }
 }
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Eq for crate::ItemType {}
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl PartialEq for crate::ItemType {
     fn eq(&self, other: &Self) -> bool {
         self.attrs == other.attrs && self.vis == other.vis && self.ident == other.ident
@@ -3494,10 +3494,10 @@ 
Files

     }
 }
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Eq for crate::ItemUnion {}
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl PartialEq for crate::ItemUnion {
     fn eq(&self, other: &Self) -> bool {
         self.attrs == other.attrs && self.vis == other.vis && self.ident == other.ident
@@ -3505,10 +3505,10 @@ 
Files

     }
 }
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Eq for crate::ItemUse {}
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl PartialEq for crate::ItemUse {
     fn eq(&self, other: &Self) -> bool {
         self.attrs == other.attrs && self.vis == other.vis
@@ -3516,29 +3516,29 @@ 
Files

     }
 }
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Eq for crate::Label {}
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl PartialEq for crate::Label {
     fn eq(&self, other: &Self) -> bool {
         self.name == other.name
     }
 }
 #[cfg(any(feature = "derive", feature = "full"))]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Eq for crate::LifetimeParam {}
 #[cfg(any(feature = "derive", feature = "full"))]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl PartialEq for crate::LifetimeParam {
     fn eq(&self, other: &Self) -> bool {
         self.attrs == other.attrs && self.lifetime == other.lifetime
             && self.colon_token == other.colon_token && self.bounds == other.bounds
     }
 }
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Eq for crate::Lit {}
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl PartialEq for crate::Lit {
     fn eq(&self, other: &Self) -> bool {
         match (self, other) {
@@ -3557,53 +3557,53 @@ 
Files

         }
     }
 }
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Eq for crate::LitBool {}
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl PartialEq for crate::LitBool {
     fn eq(&self, other: &Self) -> bool {
         self.value == other.value
     }
 }
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Eq for crate::LitByte {}
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Eq for crate::LitByteStr {}
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Eq for crate::LitCStr {}
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Eq for crate::LitChar {}
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Eq for crate::LitFloat {}
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Eq for crate::LitInt {}
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Eq for crate::LitStr {}
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Eq for crate::Local {}
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl PartialEq for crate::Local {
     fn eq(&self, other: &Self) -> bool {
         self.attrs == other.attrs && self.pat == other.pat && self.init == other.init
     }
 }
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Eq for crate::LocalInit {}
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl PartialEq for crate::LocalInit {
     fn eq(&self, other: &Self) -> bool {
         self.expr == other.expr && self.diverge == other.diverge
     }
 }
 #[cfg(any(feature = "derive", feature = "full"))]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Eq for crate::Macro {}
 #[cfg(any(feature = "derive", feature = "full"))]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl PartialEq for crate::Macro {
     fn eq(&self, other: &Self) -> bool {
         self.path == other.path && self.delimiter == other.delimiter
@@ -3611,10 +3611,10 @@ 
Files

     }
 }
 #[cfg(any(feature = "derive", feature = "full"))]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Eq for crate::MacroDelimiter {}
 #[cfg(any(feature = "derive", feature = "full"))]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl PartialEq for crate::MacroDelimiter {
     fn eq(&self, other: &Self) -> bool {
         match (self, other) {
@@ -3628,10 +3628,10 @@ 
Files

     }
 }
 #[cfg(any(feature = "derive", feature = "full"))]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Eq for crate::Meta {}
 #[cfg(any(feature = "derive", feature = "full"))]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl PartialEq for crate::Meta {
     fn eq(&self, other: &Self) -> bool {
         match (self, other) {
@@ -3645,10 +3645,10 @@ 
Files

     }
 }
 #[cfg(any(feature = "derive", feature = "full"))]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Eq for crate::MetaList {}
 #[cfg(any(feature = "derive", feature = "full"))]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl PartialEq for crate::MetaList {
     fn eq(&self, other: &Self) -> bool {
         self.path == other.path && self.delimiter == other.delimiter
@@ -3656,30 +3656,30 @@ 
Files

     }
 }
 #[cfg(any(feature = "derive", feature = "full"))]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Eq for crate::MetaNameValue {}
 #[cfg(any(feature = "derive", feature = "full"))]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl PartialEq for crate::MetaNameValue {
     fn eq(&self, other: &Self) -> bool {
         self.path == other.path && self.value == other.value
     }
 }
 #[cfg(any(feature = "derive", feature = "full"))]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Eq for crate::ParenthesizedGenericArguments {}
 #[cfg(any(feature = "derive", feature = "full"))]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl PartialEq for crate::ParenthesizedGenericArguments {
     fn eq(&self, other: &Self) -> bool {
         self.inputs == other.inputs && self.output == other.output
     }
 }
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Eq for crate::Pat {}
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl PartialEq for crate::Pat {
     fn eq(&self, other: &Self) -> bool {
         match (self, other) {
@@ -3711,10 +3711,10 @@ 
Files

     }
 }
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Eq for crate::PatIdent {}
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl PartialEq for crate::PatIdent {
     fn eq(&self, other: &Self) -> bool {
         self.attrs == other.attrs && self.by_ref == other.by_ref
@@ -3723,10 +3723,10 @@ 
Files

     }
 }
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Eq for crate::PatOr {}
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl PartialEq for crate::PatOr {
     fn eq(&self, other: &Self) -> bool {
         self.attrs == other.attrs && self.leading_vert == other.leading_vert
@@ -3734,20 +3734,20 @@ 
Files

     }
 }
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Eq for crate::PatParen {}
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl PartialEq for crate::PatParen {
     fn eq(&self, other: &Self) -> bool {
         self.attrs == other.attrs && self.pat == other.pat
     }
 }
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Eq for crate::PatReference {}
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl PartialEq for crate::PatReference {
     fn eq(&self, other: &Self) -> bool {
         self.attrs == other.attrs && self.mutability == other.mutability
@@ -3755,30 +3755,30 @@ 
Files

     }
 }
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Eq for crate::PatRest {}
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl PartialEq for crate::PatRest {
     fn eq(&self, other: &Self) -> bool {
         self.attrs == other.attrs
     }
 }
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Eq for crate::PatSlice {}
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl PartialEq for crate::PatSlice {
     fn eq(&self, other: &Self) -> bool {
         self.attrs == other.attrs && self.elems == other.elems
     }
 }
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Eq for crate::PatStruct {}
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl PartialEq for crate::PatStruct {
     fn eq(&self, other: &Self) -> bool {
         self.attrs == other.attrs && self.qself == other.qself && self.path == other.path
@@ -3786,20 +3786,20 @@ 
Files

     }
 }
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Eq for crate::PatTuple {}
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl PartialEq for crate::PatTuple {
     fn eq(&self, other: &Self) -> bool {
         self.attrs == other.attrs && self.elems == other.elems
     }
 }
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Eq for crate::PatTupleStruct {}
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl PartialEq for crate::PatTupleStruct {
     fn eq(&self, other: &Self) -> bool {
         self.attrs == other.attrs && self.qself == other.qself && self.path == other.path
@@ -3807,40 +3807,40 @@ 
Files

     }
 }
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Eq for crate::PatType {}
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl PartialEq for crate::PatType {
     fn eq(&self, other: &Self) -> bool {
         self.attrs == other.attrs && self.pat == other.pat && self.ty == other.ty
     }
 }
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Eq for crate::PatWild {}
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl PartialEq for crate::PatWild {
     fn eq(&self, other: &Self) -> bool {
         self.attrs == other.attrs
     }
 }
 #[cfg(any(feature = "derive", feature = "full"))]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Eq for crate::Path {}
 #[cfg(any(feature = "derive", feature = "full"))]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl PartialEq for crate::Path {
     fn eq(&self, other: &Self) -> bool {
         self.leading_colon == other.leading_colon && self.segments == other.segments
     }
 }
 #[cfg(any(feature = "derive", feature = "full"))]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Eq for crate::PathArguments {}
 #[cfg(any(feature = "derive", feature = "full"))]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl PartialEq for crate::PathArguments {
     fn eq(&self, other: &Self) -> bool {
         match (self, other) {
@@ -3858,30 +3858,30 @@ 
Files

     }
 }
 #[cfg(any(feature = "derive", feature = "full"))]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Eq for crate::PathSegment {}
 #[cfg(any(feature = "derive", feature = "full"))]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl PartialEq for crate::PathSegment {
     fn eq(&self, other: &Self) -> bool {
         self.ident == other.ident && self.arguments == other.arguments
     }
 }
 #[cfg(any(feature = "derive", feature = "full"))]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Eq for crate::PredicateLifetime {}
 #[cfg(any(feature = "derive", feature = "full"))]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl PartialEq for crate::PredicateLifetime {
     fn eq(&self, other: &Self) -> bool {
         self.lifetime == other.lifetime && self.bounds == other.bounds
     }
 }
 #[cfg(any(feature = "derive", feature = "full"))]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Eq for crate::PredicateType {}
 #[cfg(any(feature = "derive", feature = "full"))]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl PartialEq for crate::PredicateType {
     fn eq(&self, other: &Self) -> bool {
         self.lifetimes == other.lifetimes && self.bounded_ty == other.bounded_ty
@@ -3889,10 +3889,10 @@ 
Files

     }
 }
 #[cfg(any(feature = "derive", feature = "full"))]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Eq for crate::QSelf {}
 #[cfg(any(feature = "derive", feature = "full"))]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl PartialEq for crate::QSelf {
     fn eq(&self, other: &Self) -> bool {
         self.ty == other.ty && self.position == other.position
@@ -3900,10 +3900,10 @@ 
Files

     }
 }
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Eq for crate::RangeLimits {}
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl PartialEq for crate::RangeLimits {
     fn eq(&self, other: &Self) -> bool {
         match (self, other) {
@@ -3914,10 +3914,10 @@ 
Files

     }
 }
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Eq for crate::Receiver {}
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl PartialEq for crate::Receiver {
     fn eq(&self, other: &Self) -> bool {
         self.attrs == other.attrs && self.reference == other.reference
@@ -3926,10 +3926,10 @@ 
Files

     }
 }
 #[cfg(any(feature = "derive", feature = "full"))]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Eq for crate::ReturnType {}
 #[cfg(any(feature = "derive", feature = "full"))]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl PartialEq for crate::ReturnType {
     fn eq(&self, other: &Self) -> bool {
         match (self, other) {
@@ -3942,10 +3942,10 @@ 
Files

     }
 }
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Eq for crate::Signature {}
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl PartialEq for crate::Signature {
     fn eq(&self, other: &Self) -> bool {
         self.constness == other.constness && self.asyncness == other.asyncness
@@ -3956,10 +3956,10 @@ 
Files

     }
 }
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Eq for crate::StaticMutability {}
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl PartialEq for crate::StaticMutability {
     fn eq(&self, other: &Self) -> bool {
         match (self, other) {
@@ -3970,10 +3970,10 @@ 
Files

     }
 }
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Eq for crate::Stmt {}
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl PartialEq for crate::Stmt {
     fn eq(&self, other: &Self) -> bool {
         match (self, other) {
@@ -3988,10 +3988,10 @@ 
Files

     }
 }
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Eq for crate::StmtMacro {}
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl PartialEq for crate::StmtMacro {
     fn eq(&self, other: &Self) -> bool {
         self.attrs == other.attrs && self.mac == other.mac
@@ -3999,10 +3999,10 @@ 
Files

     }
 }
 #[cfg(any(feature = "derive", feature = "full"))]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Eq for crate::TraitBound {}
 #[cfg(any(feature = "derive", feature = "full"))]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl PartialEq for crate::TraitBound {
     fn eq(&self, other: &Self) -> bool {
         self.paren_token == other.paren_token && self.modifier == other.modifier
@@ -4010,10 +4010,10 @@ 
Files

     }
 }
 #[cfg(any(feature = "derive", feature = "full"))]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Eq for crate::TraitBoundModifier {}
 #[cfg(any(feature = "derive", feature = "full"))]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl PartialEq for crate::TraitBoundModifier {
     fn eq(&self, other: &Self) -> bool {
         match (self, other) {
@@ -4027,10 +4027,10 @@ 
Files

     }
 }
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Eq for crate::TraitItem {}
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl PartialEq for crate::TraitItem {
     fn eq(&self, other: &Self) -> bool {
         match (self, other) {
@@ -4054,10 +4054,10 @@ 
Files

     }
 }
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Eq for crate::TraitItemConst {}
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl PartialEq for crate::TraitItemConst {
     fn eq(&self, other: &Self) -> bool {
         self.attrs == other.attrs && self.ident == other.ident
@@ -4066,10 +4066,10 @@ 
Files

     }
 }
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Eq for crate::TraitItemFn {}
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl PartialEq for crate::TraitItemFn {
     fn eq(&self, other: &Self) -> bool {
         self.attrs == other.attrs && self.sig == other.sig
@@ -4077,10 +4077,10 @@ 
Files

     }
 }
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Eq for crate::TraitItemMacro {}
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl PartialEq for crate::TraitItemMacro {
     fn eq(&self, other: &Self) -> bool {
         self.attrs == other.attrs && self.mac == other.mac
@@ -4088,10 +4088,10 @@ 
Files

     }
 }
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Eq for crate::TraitItemType {}
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl PartialEq for crate::TraitItemType {
     fn eq(&self, other: &Self) -> bool {
         self.attrs == other.attrs && self.ident == other.ident
@@ -4100,10 +4100,10 @@ 
Files

     }
 }
 #[cfg(any(feature = "derive", feature = "full"))]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Eq for crate::Type {}
 #[cfg(any(feature = "derive", feature = "full"))]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl PartialEq for crate::Type {
     fn eq(&self, other: &Self) -> bool {
         match (self, other) {
@@ -4135,20 +4135,20 @@ 
Files

     }
 }
 #[cfg(any(feature = "derive", feature = "full"))]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Eq for crate::TypeArray {}
 #[cfg(any(feature = "derive", feature = "full"))]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl PartialEq for crate::TypeArray {
     fn eq(&self, other: &Self) -> bool {
         self.elem == other.elem && self.len == other.len
     }
 }
 #[cfg(any(feature = "derive", feature = "full"))]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Eq for crate::TypeBareFn {}
 #[cfg(any(feature = "derive", feature = "full"))]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl PartialEq for crate::TypeBareFn {
     fn eq(&self, other: &Self) -> bool {
         self.lifetimes == other.lifetimes && self.unsafety == other.unsafety
@@ -4157,60 +4157,60 @@ 
Files

     }
 }
 #[cfg(any(feature = "derive", feature = "full"))]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Eq for crate::TypeGroup {}
 #[cfg(any(feature = "derive", feature = "full"))]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl PartialEq for crate::TypeGroup {
     fn eq(&self, other: &Self) -> bool {
         self.elem == other.elem
     }
 }
 #[cfg(any(feature = "derive", feature = "full"))]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Eq for crate::TypeImplTrait {}
 #[cfg(any(feature = "derive", feature = "full"))]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl PartialEq for crate::TypeImplTrait {
     fn eq(&self, other: &Self) -> bool {
         self.bounds == other.bounds
     }
 }
 #[cfg(any(feature = "derive", feature = "full"))]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Eq for crate::TypeInfer {}
 #[cfg(any(feature = "derive", feature = "full"))]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl PartialEq for crate::TypeInfer {
     fn eq(&self, _other: &Self) -> bool {
         true
     }
 }
 #[cfg(any(feature = "derive", feature = "full"))]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Eq for crate::TypeMacro {}
 #[cfg(any(feature = "derive", feature = "full"))]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl PartialEq for crate::TypeMacro {
     fn eq(&self, other: &Self) -> bool {
         self.mac == other.mac
     }
 }
 #[cfg(any(feature = "derive", feature = "full"))]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Eq for crate::TypeNever {}
 #[cfg(any(feature = "derive", feature = "full"))]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl PartialEq for crate::TypeNever {
     fn eq(&self, _other: &Self) -> bool {
         true
     }
 }
 #[cfg(any(feature = "derive", feature = "full"))]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Eq for crate::TypeParam {}
 #[cfg(any(feature = "derive", feature = "full"))]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl PartialEq for crate::TypeParam {
     fn eq(&self, other: &Self) -> bool {
         self.attrs == other.attrs && self.ident == other.ident
@@ -4219,10 +4219,10 @@ 
Files

     }
 }
 #[cfg(any(feature = "derive", feature = "full"))]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Eq for crate::TypeParamBound {}
 #[cfg(any(feature = "derive", feature = "full"))]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl PartialEq for crate::TypeParamBound {
     fn eq(&self, other: &Self) -> bool {
         match (self, other) {
@@ -4243,30 +4243,30 @@ 
Files

     }
 }
 #[cfg(any(feature = "derive", feature = "full"))]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Eq for crate::TypeParen {}
 #[cfg(any(feature = "derive", feature = "full"))]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl PartialEq for crate::TypeParen {
     fn eq(&self, other: &Self) -> bool {
         self.elem == other.elem
     }
 }
 #[cfg(any(feature = "derive", feature = "full"))]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Eq for crate::TypePath {}
 #[cfg(any(feature = "derive", feature = "full"))]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl PartialEq for crate::TypePath {
     fn eq(&self, other: &Self) -> bool {
         self.qself == other.qself && self.path == other.path
     }
 }
 #[cfg(any(feature = "derive", feature = "full"))]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Eq for crate::TypePtr {}
 #[cfg(any(feature = "derive", feature = "full"))]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl PartialEq for crate::TypePtr {
     fn eq(&self, other: &Self) -> bool {
         self.const_token == other.const_token && self.mutability == other.mutability
@@ -4274,10 +4274,10 @@ 
Files

     }
 }
 #[cfg(any(feature = "derive", feature = "full"))]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Eq for crate::TypeReference {}
 #[cfg(any(feature = "derive", feature = "full"))]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl PartialEq for crate::TypeReference {
     fn eq(&self, other: &Self) -> bool {
         self.lifetime == other.lifetime && self.mutability == other.mutability
@@ -4285,40 +4285,40 @@ 
Files

     }
 }
 #[cfg(any(feature = "derive", feature = "full"))]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Eq for crate::TypeSlice {}
 #[cfg(any(feature = "derive", feature = "full"))]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl PartialEq for crate::TypeSlice {
     fn eq(&self, other: &Self) -> bool {
         self.elem == other.elem
     }
 }
 #[cfg(any(feature = "derive", feature = "full"))]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Eq for crate::TypeTraitObject {}
 #[cfg(any(feature = "derive", feature = "full"))]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl PartialEq for crate::TypeTraitObject {
     fn eq(&self, other: &Self) -> bool {
         self.dyn_token == other.dyn_token && self.bounds == other.bounds
     }
 }
 #[cfg(any(feature = "derive", feature = "full"))]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Eq for crate::TypeTuple {}
 #[cfg(any(feature = "derive", feature = "full"))]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl PartialEq for crate::TypeTuple {
     fn eq(&self, other: &Self) -> bool {
         self.elems == other.elems
     }
 }
 #[cfg(any(feature = "derive", feature = "full"))]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Eq for crate::UnOp {}
 #[cfg(any(feature = "derive", feature = "full"))]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl PartialEq for crate::UnOp {
     fn eq(&self, other: &Self) -> bool {
         match (self, other) {
@@ -4330,60 +4330,60 @@ 
Files

     }
 }
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Eq for crate::UseGlob {}
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl PartialEq for crate::UseGlob {
     fn eq(&self, _other: &Self) -> bool {
         true
     }
 }
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Eq for crate::UseGroup {}
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl PartialEq for crate::UseGroup {
     fn eq(&self, other: &Self) -> bool {
         self.items == other.items
     }
 }
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Eq for crate::UseName {}
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl PartialEq for crate::UseName {
     fn eq(&self, other: &Self) -> bool {
         self.ident == other.ident
     }
 }
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Eq for crate::UsePath {}
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl PartialEq for crate::UsePath {
     fn eq(&self, other: &Self) -> bool {
         self.ident == other.ident && self.tree == other.tree
     }
 }
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Eq for crate::UseRename {}
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl PartialEq for crate::UseRename {
     fn eq(&self, other: &Self) -> bool {
         self.ident == other.ident && self.rename == other.rename
     }
 }
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Eq for crate::UseTree {}
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl PartialEq for crate::UseTree {
     fn eq(&self, other: &Self) -> bool {
         match (self, other) {
@@ -4407,20 +4407,20 @@ 
Files

     }
 }
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Eq for crate::Variadic {}
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl PartialEq for crate::Variadic {
     fn eq(&self, other: &Self) -> bool {
         self.attrs == other.attrs && self.pat == other.pat && self.comma == other.comma
     }
 }
 #[cfg(any(feature = "derive", feature = "full"))]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Eq for crate::Variant {}
 #[cfg(any(feature = "derive", feature = "full"))]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl PartialEq for crate::Variant {
     fn eq(&self, other: &Self) -> bool {
         self.attrs == other.attrs && self.ident == other.ident
@@ -4428,20 +4428,20 @@ 
Files

     }
 }
 #[cfg(any(feature = "derive", feature = "full"))]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Eq for crate::VisRestricted {}
 #[cfg(any(feature = "derive", feature = "full"))]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl PartialEq for crate::VisRestricted {
     fn eq(&self, other: &Self) -> bool {
         self.in_token == other.in_token && self.path == other.path
     }
 }
 #[cfg(any(feature = "derive", feature = "full"))]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Eq for crate::Visibility {}
 #[cfg(any(feature = "derive", feature = "full"))]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl PartialEq for crate::Visibility {
     fn eq(&self, other: &Self) -> bool {
         match (self, other) {
@@ -4456,20 +4456,20 @@ 
Files

     }
 }
 #[cfg(any(feature = "derive", feature = "full"))]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Eq for crate::WhereClause {}
 #[cfg(any(feature = "derive", feature = "full"))]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl PartialEq for crate::WhereClause {
     fn eq(&self, other: &Self) -> bool {
         self.predicates == other.predicates
     }
 }
 #[cfg(any(feature = "derive", feature = "full"))]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Eq for crate::WherePredicate {}
 #[cfg(any(feature = "derive", feature = "full"))]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl PartialEq for crate::WherePredicate {
     fn eq(&self, other: &Self) -> bool {
         match (self, other) {
diff --git a/src/syn/gen/hash.rs.html b/src/syn/gen/hash.rs.html
index fe9db3a7e0..0cbc706f28 100644
--- a/src/syn/gen/hash.rs.html
+++ b/src/syn/gen/hash.rs.html
@@ -1,4 +1,4 @@
-hash.rs - source

 use crate::tt::TokenStreamHelper;
 use std::hash::{Hash, Hasher};
 #[cfg(any(feature = "derive", feature = "full"))]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Hash for crate::Abi {
     fn hash<H>(&self, state: &mut H)
     where
@@ -2824,7 +2824,7 @@ 
Files

     }
 }
 #[cfg(any(feature = "derive", feature = "full"))]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Hash for crate::AngleBracketedGenericArguments {
     fn hash<H>(&self, state: &mut H)
     where
@@ -2835,7 +2835,7 @@ 
Files

     }
 }
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Hash for crate::Arm {
     fn hash<H>(&self, state: &mut H)
     where
@@ -2849,7 +2849,7 @@ 
Files

     }
 }
 #[cfg(any(feature = "derive", feature = "full"))]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Hash for crate::AssocConst {
     fn hash<H>(&self, state: &mut H)
     where
@@ -2861,7 +2861,7 @@ 
Files

     }
 }
 #[cfg(any(feature = "derive", feature = "full"))]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Hash for crate::AssocType {
     fn hash<H>(&self, state: &mut H)
     where
@@ -2873,7 +2873,7 @@ 
Files

     }
 }
 #[cfg(any(feature = "derive", feature = "full"))]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Hash for crate::AttrStyle {
     fn hash<H>(&self, state: &mut H)
     where
@@ -2890,7 +2890,7 @@ 
Files

     }
 }
 #[cfg(any(feature = "derive", feature = "full"))]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Hash for crate::Attribute {
     fn hash<H>(&self, state: &mut H)
     where
@@ -2901,7 +2901,7 @@ 
Files

     }
 }
 #[cfg(any(feature = "derive", feature = "full"))]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Hash for crate::BareFnArg {
     fn hash<H>(&self, state: &mut H)
     where
@@ -2913,7 +2913,7 @@ 
Files

     }
 }
 #[cfg(any(feature = "derive", feature = "full"))]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Hash for crate::BareVariadic {
     fn hash<H>(&self, state: &mut H)
     where
@@ -2925,7 +2925,7 @@ 
Files

     }
 }
 #[cfg(any(feature = "derive", feature = "full"))]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Hash for crate::BinOp {
     fn hash<H>(&self, state: &mut H)
     where
@@ -3020,7 +3020,7 @@ 
Files

     }
 }
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Hash for crate::Block {
     fn hash<H>(&self, state: &mut H)
     where
@@ -3030,7 +3030,7 @@ 
Files

     }
 }
 #[cfg(any(feature = "derive", feature = "full"))]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Hash for crate::BoundLifetimes {
     fn hash<H>(&self, state: &mut H)
     where
@@ -3040,7 +3040,7 @@ 
Files

     }
 }
 #[cfg(any(feature = "derive", feature = "full"))]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Hash for crate::ConstParam {
     fn hash<H>(&self, state: &mut H)
     where
@@ -3054,7 +3054,7 @@ 
Files

     }
 }
 #[cfg(any(feature = "derive", feature = "full"))]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Hash for crate::Constraint {
     fn hash<H>(&self, state: &mut H)
     where
@@ -3066,7 +3066,7 @@ 
Files

     }
 }
 #[cfg(feature = "derive")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Hash for crate::Data {
     fn hash<H>(&self, state: &mut H)
     where
@@ -3089,7 +3089,7 @@ 
Files

     }
 }
 #[cfg(feature = "derive")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Hash for crate::DataEnum {
     fn hash<H>(&self, state: &mut H)
     where
@@ -3099,7 +3099,7 @@ 
Files

     }
 }
 #[cfg(feature = "derive")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Hash for crate::DataStruct {
     fn hash<H>(&self, state: &mut H)
     where
@@ -3110,7 +3110,7 @@ 
Files

     }
 }
 #[cfg(feature = "derive")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Hash for crate::DataUnion {
     fn hash<H>(&self, state: &mut H)
     where
@@ -3120,7 +3120,7 @@ 
Files

     }
 }
 #[cfg(feature = "derive")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Hash for crate::DeriveInput {
     fn hash<H>(&self, state: &mut H)
     where
@@ -3134,7 +3134,7 @@ 
Files

     }
 }
 #[cfg(any(feature = "derive", feature = "full"))]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Hash for crate::Expr {
     fn hash<H>(&self, state: &mut H)
     where
@@ -3327,7 +3327,7 @@ 
Files

     }
 }
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Hash for crate::ExprArray {
     fn hash<H>(&self, state: &mut H)
     where
@@ -3338,7 +3338,7 @@ 
Files

     }
 }
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Hash for crate::ExprAssign {
     fn hash<H>(&self, state: &mut H)
     where
@@ -3350,7 +3350,7 @@ 
Files

     }
 }
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Hash for crate::ExprAsync {
     fn hash<H>(&self, state: &mut H)
     where
@@ -3362,7 +3362,7 @@ 
Files

     }
 }
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Hash for crate::ExprAwait {
     fn hash<H>(&self, state: &mut H)
     where
@@ -3373,7 +3373,7 @@ 
Files

     }
 }
 #[cfg(any(feature = "derive", feature = "full"))]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Hash for crate::ExprBinary {
     fn hash<H>(&self, state: &mut H)
     where
@@ -3386,7 +3386,7 @@ 
Files

     }
 }
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Hash for crate::ExprBlock {
     fn hash<H>(&self, state: &mut H)
     where
@@ -3398,7 +3398,7 @@ 
Files

     }
 }
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Hash for crate::ExprBreak {
     fn hash<H>(&self, state: &mut H)
     where
@@ -3410,7 +3410,7 @@ 
Files

     }
 }
 #[cfg(any(feature = "derive", feature = "full"))]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Hash for crate::ExprCall {
     fn hash<H>(&self, state: &mut H)
     where
@@ -3422,7 +3422,7 @@ 
Files

     }
 }
 #[cfg(any(feature = "derive", feature = "full"))]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Hash for crate::ExprCast {
     fn hash<H>(&self, state: &mut H)
     where
@@ -3434,7 +3434,7 @@ 
Files

     }
 }
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Hash for crate::ExprClosure {
     fn hash<H>(&self, state: &mut H)
     where
@@ -3452,7 +3452,7 @@ 
Files

     }
 }
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Hash for crate::ExprConst {
     fn hash<H>(&self, state: &mut H)
     where
@@ -3463,7 +3463,7 @@ 
Files

     }
 }
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Hash for crate::ExprContinue {
     fn hash<H>(&self, state: &mut H)
     where
@@ -3474,7 +3474,7 @@ 
Files

     }
 }
 #[cfg(any(feature = "derive", feature = "full"))]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Hash for crate::ExprField {
     fn hash<H>(&self, state: &mut H)
     where
@@ -3486,7 +3486,7 @@ 
Files

     }
 }
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Hash for crate::ExprForLoop {
     fn hash<H>(&self, state: &mut H)
     where
@@ -3500,7 +3500,7 @@ 
Files

     }
 }
 #[cfg(any(feature = "derive", feature = "full"))]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Hash for crate::ExprGroup {
     fn hash<H>(&self, state: &mut H)
     where
@@ -3511,7 +3511,7 @@ 
Files

     }
 }
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Hash for crate::ExprIf {
     fn hash<H>(&self, state: &mut H)
     where
@@ -3524,7 +3524,7 @@ 
Files

     }
 }
 #[cfg(any(feature = "derive", feature = "full"))]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Hash for crate::ExprIndex {
     fn hash<H>(&self, state: &mut H)
     where
@@ -3536,7 +3536,7 @@ 
Files

     }
 }
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Hash for crate::ExprInfer {
     fn hash<H>(&self, state: &mut H)
     where
@@ -3546,7 +3546,7 @@ 
Files

     }
 }
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Hash for crate::ExprLet {
     fn hash<H>(&self, state: &mut H)
     where
@@ -3558,7 +3558,7 @@ 
Files

     }
 }
 #[cfg(any(feature = "derive", feature = "full"))]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Hash for crate::ExprLit {
     fn hash<H>(&self, state: &mut H)
     where
@@ -3569,7 +3569,7 @@ 
Files

     }
 }
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Hash for crate::ExprLoop {
     fn hash<H>(&self, state: &mut H)
     where
@@ -3581,7 +3581,7 @@ 
Files

     }
 }
 #[cfg(any(feature = "derive", feature = "full"))]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Hash for crate::ExprMacro {
     fn hash<H>(&self, state: &mut H)
     where
@@ -3592,7 +3592,7 @@ 
Files

     }
 }
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Hash for crate::ExprMatch {
     fn hash<H>(&self, state: &mut H)
     where
@@ -3604,7 +3604,7 @@ 
Files

     }
 }
 #[cfg(any(feature = "derive", feature = "full"))]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Hash for crate::ExprMethodCall {
     fn hash<H>(&self, state: &mut H)
     where
@@ -3618,7 +3618,7 @@ 
Files

     }
 }
 #[cfg(any(feature = "derive", feature = "full"))]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Hash for crate::ExprParen {
     fn hash<H>(&self, state: &mut H)
     where
@@ -3629,7 +3629,7 @@ 
Files

     }
 }
 #[cfg(any(feature = "derive", feature = "full"))]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Hash for crate::ExprPath {
     fn hash<H>(&self, state: &mut H)
     where
@@ -3641,7 +3641,7 @@ 
Files

     }
 }
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Hash for crate::ExprRange {
     fn hash<H>(&self, state: &mut H)
     where
@@ -3654,7 +3654,7 @@ 
Files

     }
 }
 #[cfg(any(feature = "derive", feature = "full"))]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Hash for crate::ExprReference {
     fn hash<H>(&self, state: &mut H)
     where
@@ -3666,7 +3666,7 @@ 
Files

     }
 }
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Hash for crate::ExprRepeat {
     fn hash<H>(&self, state: &mut H)
     where
@@ -3678,7 +3678,7 @@ 
Files

     }
 }
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Hash for crate::ExprReturn {
     fn hash<H>(&self, state: &mut H)
     where
@@ -3689,7 +3689,7 @@ 
Files

     }
 }
 #[cfg(any(feature = "derive", feature = "full"))]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Hash for crate::ExprStruct {
     fn hash<H>(&self, state: &mut H)
     where
@@ -3704,7 +3704,7 @@ 
Files

     }
 }
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Hash for crate::ExprTry {
     fn hash<H>(&self, state: &mut H)
     where
@@ -3715,7 +3715,7 @@ 
Files

     }
 }
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Hash for crate::ExprTryBlock {
     fn hash<H>(&self, state: &mut H)
     where
@@ -3726,7 +3726,7 @@ 
Files

     }
 }
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Hash for crate::ExprTuple {
     fn hash<H>(&self, state: &mut H)
     where
@@ -3737,7 +3737,7 @@ 
Files

     }
 }
 #[cfg(any(feature = "derive", feature = "full"))]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Hash for crate::ExprUnary {
     fn hash<H>(&self, state: &mut H)
     where
@@ -3749,7 +3749,7 @@ 
Files

     }
 }
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Hash for crate::ExprUnsafe {
     fn hash<H>(&self, state: &mut H)
     where
@@ -3760,7 +3760,7 @@ 
Files

     }
 }
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Hash for crate::ExprWhile {
     fn hash<H>(&self, state: &mut H)
     where
@@ -3773,7 +3773,7 @@ 
Files

     }
 }
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Hash for crate::ExprYield {
     fn hash<H>(&self, state: &mut H)
     where
@@ -3784,7 +3784,7 @@ 
Files

     }
 }
 #[cfg(any(feature = "derive", feature = "full"))]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Hash for crate::Field {
     fn hash<H>(&self, state: &mut H)
     where
@@ -3799,7 +3799,7 @@ 
Files

     }
 }
 #[cfg(any(feature = "derive", feature = "full"))]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Hash for crate::FieldMutability {
     fn hash<H>(&self, state: &mut H)
     where
@@ -3813,7 +3813,7 @@ 
Files

     }
 }
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Hash for crate::FieldPat {
     fn hash<H>(&self, state: &mut H)
     where
@@ -3826,7 +3826,7 @@ 
Files

     }
 }
 #[cfg(any(feature = "derive", feature = "full"))]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Hash for crate::FieldValue {
     fn hash<H>(&self, state: &mut H)
     where
@@ -3839,7 +3839,7 @@ 
Files

     }
 }
 #[cfg(any(feature = "derive", feature = "full"))]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Hash for crate::Fields {
     fn hash<H>(&self, state: &mut H)
     where
@@ -3861,7 +3861,7 @@ 
Files

     }
 }
 #[cfg(any(feature = "derive", feature = "full"))]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Hash for crate::FieldsNamed {
     fn hash<H>(&self, state: &mut H)
     where
@@ -3871,7 +3871,7 @@ 
Files

     }
 }
 #[cfg(any(feature = "derive", feature = "full"))]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Hash for crate::FieldsUnnamed {
     fn hash<H>(&self, state: &mut H)
     where
@@ -3881,7 +3881,7 @@ 
Files

     }
 }
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Hash for crate::File {
     fn hash<H>(&self, state: &mut H)
     where
@@ -3893,7 +3893,7 @@ 
Files

     }
 }
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Hash for crate::FnArg {
     fn hash<H>(&self, state: &mut H)
     where
@@ -3912,7 +3912,7 @@ 
Files

     }
 }
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Hash for crate::ForeignItem {
     fn hash<H>(&self, state: &mut H)
     where
@@ -3943,7 +3943,7 @@ 
Files

     }
 }
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Hash for crate::ForeignItemFn {
     fn hash<H>(&self, state: &mut H)
     where
@@ -3955,7 +3955,7 @@ 
Files

     }
 }
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Hash for crate::ForeignItemMacro {
     fn hash<H>(&self, state: &mut H)
     where
@@ -3967,7 +3967,7 @@ 
Files

     }
 }
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Hash for crate::ForeignItemStatic {
     fn hash<H>(&self, state: &mut H)
     where
@@ -3981,7 +3981,7 @@ 
Files

     }
 }
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Hash for crate::ForeignItemType {
     fn hash<H>(&self, state: &mut H)
     where
@@ -3994,7 +3994,7 @@ 
Files

     }
 }
 #[cfg(any(feature = "derive", feature = "full"))]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Hash for crate::GenericArgument {
     fn hash<H>(&self, state: &mut H)
     where
@@ -4029,7 +4029,7 @@ 
Files

     }
 }
 #[cfg(any(feature = "derive", feature = "full"))]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Hash for crate::GenericParam {
     fn hash<H>(&self, state: &mut H)
     where
@@ -4052,7 +4052,7 @@ 
Files

     }
 }
 #[cfg(any(feature = "derive", feature = "full"))]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Hash for crate::Generics {
     fn hash<H>(&self, state: &mut H)
     where
@@ -4065,7 +4065,7 @@ 
Files

     }
 }
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Hash for crate::ImplItem {
     fn hash<H>(&self, state: &mut H)
     where
@@ -4096,7 +4096,7 @@ 
Files

     }
 }
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Hash for crate::ImplItemConst {
     fn hash<H>(&self, state: &mut H)
     where
@@ -4112,7 +4112,7 @@ 
Files

     }
 }
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Hash for crate::ImplItemFn {
     fn hash<H>(&self, state: &mut H)
     where
@@ -4126,7 +4126,7 @@ 
Files

     }
 }
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Hash for crate::ImplItemMacro {
     fn hash<H>(&self, state: &mut H)
     where
@@ -4138,7 +4138,7 @@ 
Files

     }
 }
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Hash for crate::ImplItemType {
     fn hash<H>(&self, state: &mut H)
     where
@@ -4153,7 +4153,7 @@ 
Files

     }
 }
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Hash for crate::ImplRestriction {
     fn hash<H>(&self, _state: &mut H)
     where
@@ -4163,7 +4163,7 @@ 
Files

     }
 }
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Hash for crate::Item {
     fn hash<H>(&self, state: &mut H)
     where
@@ -4238,7 +4238,7 @@ 
Files

     }
 }
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Hash for crate::ItemConst {
     fn hash<H>(&self, state: &mut H)
     where
@@ -4253,7 +4253,7 @@ 
Files

     }
 }
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Hash for crate::ItemEnum {
     fn hash<H>(&self, state: &mut H)
     where
@@ -4267,7 +4267,7 @@ 
Files

     }
 }
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Hash for crate::ItemExternCrate {
     fn hash<H>(&self, state: &mut H)
     where
@@ -4280,7 +4280,7 @@ 
Files

     }
 }
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Hash for crate::ItemFn {
     fn hash<H>(&self, state: &mut H)
     where
@@ -4293,7 +4293,7 @@ 
Files

     }
 }
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Hash for crate::ItemForeignMod {
     fn hash<H>(&self, state: &mut H)
     where
@@ -4306,7 +4306,7 @@ 
Files

     }
 }
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Hash for crate::ItemImpl {
     fn hash<H>(&self, state: &mut H)
     where
@@ -4322,7 +4322,7 @@ 
Files

     }
 }
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Hash for crate::ItemMacro {
     fn hash<H>(&self, state: &mut H)
     where
@@ -4335,7 +4335,7 @@ 
Files

     }
 }
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Hash for crate::ItemMod {
     fn hash<H>(&self, state: &mut H)
     where
@@ -4350,7 +4350,7 @@ 
Files

     }
 }
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Hash for crate::ItemStatic {
     fn hash<H>(&self, state: &mut H)
     where
@@ -4365,7 +4365,7 @@ 
Files

     }
 }
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Hash for crate::ItemStruct {
     fn hash<H>(&self, state: &mut H)
     where
@@ -4380,7 +4380,7 @@ 
Files

     }
 }
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Hash for crate::ItemTrait {
     fn hash<H>(&self, state: &mut H)
     where
@@ -4399,7 +4399,7 @@ 
Files

     }
 }
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Hash for crate::ItemTraitAlias {
     fn hash<H>(&self, state: &mut H)
     where
@@ -4413,7 +4413,7 @@ 
Files

     }
 }
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Hash for crate::ItemType {
     fn hash<H>(&self, state: &mut H)
     where
@@ -4427,7 +4427,7 @@ 
Files

     }
 }
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Hash for crate::ItemUnion {
     fn hash<H>(&self, state: &mut H)
     where
@@ -4441,7 +4441,7 @@ 
Files

     }
 }
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Hash for crate::ItemUse {
     fn hash<H>(&self, state: &mut H)
     where
@@ -4454,7 +4454,7 @@ 
Files

     }
 }
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Hash for crate::Label {
     fn hash<H>(&self, state: &mut H)
     where
@@ -4464,7 +4464,7 @@ 
Files

     }
 }
 #[cfg(any(feature = "derive", feature = "full"))]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Hash for crate::LifetimeParam {
     fn hash<H>(&self, state: &mut H)
     where
@@ -4476,7 +4476,7 @@ 
Files

         self.bounds.hash(state);
     }
 }
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Hash for crate::Lit {
     fn hash<H>(&self, state: &mut H)
     where
@@ -4522,7 +4522,7 @@ 
Files

         }
     }
 }
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Hash for crate::LitBool {
     fn hash<H>(&self, state: &mut H)
     where
@@ -4532,7 +4532,7 @@ 
Files

     }
 }
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Hash for crate::Local {
     fn hash<H>(&self, state: &mut H)
     where
@@ -4544,7 +4544,7 @@ 
Files

     }
 }
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Hash for crate::LocalInit {
     fn hash<H>(&self, state: &mut H)
     where
@@ -4555,7 +4555,7 @@ 
Files

     }
 }
 #[cfg(any(feature = "derive", feature = "full"))]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Hash for crate::Macro {
     fn hash<H>(&self, state: &mut H)
     where
@@ -4567,7 +4567,7 @@ 
Files

     }
 }
 #[cfg(any(feature = "derive", feature = "full"))]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Hash for crate::MacroDelimiter {
     fn hash<H>(&self, state: &mut H)
     where
@@ -4587,7 +4587,7 @@ 
Files

     }
 }
 #[cfg(any(feature = "derive", feature = "full"))]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Hash for crate::Meta {
     fn hash<H>(&self, state: &mut H)
     where
@@ -4610,7 +4610,7 @@ 
Files

     }
 }
 #[cfg(any(feature = "derive", feature = "full"))]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Hash for crate::MetaList {
     fn hash<H>(&self, state: &mut H)
     where
@@ -4622,7 +4622,7 @@ 
Files

     }
 }
 #[cfg(any(feature = "derive", feature = "full"))]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Hash for crate::MetaNameValue {
     fn hash<H>(&self, state: &mut H)
     where
@@ -4633,7 +4633,7 @@ 
Files

     }
 }
 #[cfg(any(feature = "derive", feature = "full"))]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Hash for crate::ParenthesizedGenericArguments {
     fn hash<H>(&self, state: &mut H)
     where
@@ -4644,7 +4644,7 @@ 
Files

     }
 }
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Hash for crate::Pat {
     fn hash<H>(&self, state: &mut H)
     where
@@ -4723,7 +4723,7 @@ 
Files

     }
 }
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Hash for crate::PatIdent {
     fn hash<H>(&self, state: &mut H)
     where
@@ -4737,7 +4737,7 @@ 
Files

     }
 }
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Hash for crate::PatOr {
     fn hash<H>(&self, state: &mut H)
     where
@@ -4749,7 +4749,7 @@ 
Files

     }
 }
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Hash for crate::PatParen {
     fn hash<H>(&self, state: &mut H)
     where
@@ -4760,7 +4760,7 @@ 
Files

     }
 }
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Hash for crate::PatReference {
     fn hash<H>(&self, state: &mut H)
     where
@@ -4772,7 +4772,7 @@ 
Files

     }
 }
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Hash for crate::PatRest {
     fn hash<H>(&self, state: &mut H)
     where
@@ -4782,7 +4782,7 @@ 
Files

     }
 }
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Hash for crate::PatSlice {
     fn hash<H>(&self, state: &mut H)
     where
@@ -4793,7 +4793,7 @@ 
Files

     }
 }
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Hash for crate::PatStruct {
     fn hash<H>(&self, state: &mut H)
     where
@@ -4807,7 +4807,7 @@ 
Files

     }
 }
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Hash for crate::PatTuple {
     fn hash<H>(&self, state: &mut H)
     where
@@ -4818,7 +4818,7 @@ 
Files

     }
 }
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Hash for crate::PatTupleStruct {
     fn hash<H>(&self, state: &mut H)
     where
@@ -4831,7 +4831,7 @@ 
Files

     }
 }
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Hash for crate::PatType {
     fn hash<H>(&self, state: &mut H)
     where
@@ -4843,7 +4843,7 @@ 
Files

     }
 }
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Hash for crate::PatWild {
     fn hash<H>(&self, state: &mut H)
     where
@@ -4853,7 +4853,7 @@ 
Files

     }
 }
 #[cfg(any(feature = "derive", feature = "full"))]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Hash for crate::Path {
     fn hash<H>(&self, state: &mut H)
     where
@@ -4864,7 +4864,7 @@ 
Files

     }
 }
 #[cfg(any(feature = "derive", feature = "full"))]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Hash for crate::PathArguments {
     fn hash<H>(&self, state: &mut H)
     where
@@ -4886,7 +4886,7 @@ 
Files

     }
 }
 #[cfg(any(feature = "derive", feature = "full"))]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Hash for crate::PathSegment {
     fn hash<H>(&self, state: &mut H)
     where
@@ -4897,7 +4897,7 @@ 
Files

     }
 }
 #[cfg(any(feature = "derive", feature = "full"))]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Hash for crate::PredicateLifetime {
     fn hash<H>(&self, state: &mut H)
     where
@@ -4908,7 +4908,7 @@ 
Files

     }
 }
 #[cfg(any(feature = "derive", feature = "full"))]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Hash for crate::PredicateType {
     fn hash<H>(&self, state: &mut H)
     where
@@ -4920,7 +4920,7 @@ 
Files

     }
 }
 #[cfg(any(feature = "derive", feature = "full"))]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Hash for crate::QSelf {
     fn hash<H>(&self, state: &mut H)
     where
@@ -4932,7 +4932,7 @@ 
Files

     }
 }
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Hash for crate::RangeLimits {
     fn hash<H>(&self, state: &mut H)
     where
@@ -4949,7 +4949,7 @@ 
Files

     }
 }
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Hash for crate::Receiver {
     fn hash<H>(&self, state: &mut H)
     where
@@ -4963,7 +4963,7 @@ 
Files

     }
 }
 #[cfg(any(feature = "derive", feature = "full"))]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Hash for crate::ReturnType {
     fn hash<H>(&self, state: &mut H)
     where
@@ -4981,7 +4981,7 @@ 
Files

     }
 }
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Hash for crate::Signature {
     fn hash<H>(&self, state: &mut H)
     where
@@ -4999,7 +4999,7 @@ 
Files

     }
 }
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Hash for crate::StaticMutability {
     fn hash<H>(&self, state: &mut H)
     where
@@ -5016,7 +5016,7 @@ 
Files

     }
 }
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Hash for crate::Stmt {
     fn hash<H>(&self, state: &mut H)
     where
@@ -5044,7 +5044,7 @@ 
Files

     }
 }
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Hash for crate::StmtMacro {
     fn hash<H>(&self, state: &mut H)
     where
@@ -5056,7 +5056,7 @@ 
Files

     }
 }
 #[cfg(any(feature = "derive", feature = "full"))]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Hash for crate::TraitBound {
     fn hash<H>(&self, state: &mut H)
     where
@@ -5069,7 +5069,7 @@ 
Files

     }
 }
 #[cfg(any(feature = "derive", feature = "full"))]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Hash for crate::TraitBoundModifier {
     fn hash<H>(&self, state: &mut H)
     where
@@ -5086,7 +5086,7 @@ 
Files

     }
 }
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Hash for crate::TraitItem {
     fn hash<H>(&self, state: &mut H)
     where
@@ -5117,7 +5117,7 @@ 
Files

     }
 }
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Hash for crate::TraitItemConst {
     fn hash<H>(&self, state: &mut H)
     where
@@ -5131,7 +5131,7 @@ 
Files

     }
 }
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Hash for crate::TraitItemFn {
     fn hash<H>(&self, state: &mut H)
     where
@@ -5144,7 +5144,7 @@ 
Files

     }
 }
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Hash for crate::TraitItemMacro {
     fn hash<H>(&self, state: &mut H)
     where
@@ -5156,7 +5156,7 @@ 
Files

     }
 }
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Hash for crate::TraitItemType {
     fn hash<H>(&self, state: &mut H)
     where
@@ -5171,7 +5171,7 @@ 
Files

     }
 }
 #[cfg(any(feature = "derive", feature = "full"))]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Hash for crate::Type {
     fn hash<H>(&self, state: &mut H)
     where
@@ -5242,7 +5242,7 @@ 
Files

     }
 }
 #[cfg(any(feature = "derive", feature = "full"))]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Hash for crate::TypeArray {
     fn hash<H>(&self, state: &mut H)
     where
@@ -5253,7 +5253,7 @@ 
Files

     }
 }
 #[cfg(any(feature = "derive", feature = "full"))]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Hash for crate::TypeBareFn {
     fn hash<H>(&self, state: &mut H)
     where
@@ -5268,7 +5268,7 @@ 
Files

     }
 }
 #[cfg(any(feature = "derive", feature = "full"))]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Hash for crate::TypeGroup {
     fn hash<H>(&self, state: &mut H)
     where
@@ -5278,7 +5278,7 @@ 
Files

     }
 }
 #[cfg(any(feature = "derive", feature = "full"))]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Hash for crate::TypeImplTrait {
     fn hash<H>(&self, state: &mut H)
     where
@@ -5288,7 +5288,7 @@ 
Files

     }
 }
 #[cfg(any(feature = "derive", feature = "full"))]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Hash for crate::TypeInfer {
     fn hash<H>(&self, _state: &mut H)
     where
@@ -5296,7 +5296,7 @@ 
Files

     {}
 }
 #[cfg(any(feature = "derive", feature = "full"))]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Hash for crate::TypeMacro {
     fn hash<H>(&self, state: &mut H)
     where
@@ -5306,7 +5306,7 @@ 
Files

     }
 }
 #[cfg(any(feature = "derive", feature = "full"))]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Hash for crate::TypeNever {
     fn hash<H>(&self, _state: &mut H)
     where
@@ -5314,7 +5314,7 @@ 
Files

     {}
 }
 #[cfg(any(feature = "derive", feature = "full"))]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Hash for crate::TypeParam {
     fn hash<H>(&self, state: &mut H)
     where
@@ -5329,7 +5329,7 @@ 
Files

     }
 }
 #[cfg(any(feature = "derive", feature = "full"))]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Hash for crate::TypeParamBound {
     fn hash<H>(&self, state: &mut H)
     where
@@ -5352,7 +5352,7 @@ 
Files

     }
 }
 #[cfg(any(feature = "derive", feature = "full"))]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Hash for crate::TypeParen {
     fn hash<H>(&self, state: &mut H)
     where
@@ -5362,7 +5362,7 @@ 
Files

     }
 }
 #[cfg(any(feature = "derive", feature = "full"))]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Hash for crate::TypePath {
     fn hash<H>(&self, state: &mut H)
     where
@@ -5373,7 +5373,7 @@ 
Files

     }
 }
 #[cfg(any(feature = "derive", feature = "full"))]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Hash for crate::TypePtr {
     fn hash<H>(&self, state: &mut H)
     where
@@ -5385,7 +5385,7 @@ 
Files

     }
 }
 #[cfg(any(feature = "derive", feature = "full"))]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Hash for crate::TypeReference {
     fn hash<H>(&self, state: &mut H)
     where
@@ -5397,7 +5397,7 @@ 
Files

     }
 }
 #[cfg(any(feature = "derive", feature = "full"))]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Hash for crate::TypeSlice {
     fn hash<H>(&self, state: &mut H)
     where
@@ -5407,7 +5407,7 @@ 
Files

     }
 }
 #[cfg(any(feature = "derive", feature = "full"))]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Hash for crate::TypeTraitObject {
     fn hash<H>(&self, state: &mut H)
     where
@@ -5418,7 +5418,7 @@ 
Files

     }
 }
 #[cfg(any(feature = "derive", feature = "full"))]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Hash for crate::TypeTuple {
     fn hash<H>(&self, state: &mut H)
     where
@@ -5428,7 +5428,7 @@ 
Files

     }
 }
 #[cfg(any(feature = "derive", feature = "full"))]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Hash for crate::UnOp {
     fn hash<H>(&self, state: &mut H)
     where
@@ -5448,7 +5448,7 @@ 
Files

     }
 }
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Hash for crate::UseGlob {
     fn hash<H>(&self, _state: &mut H)
     where
@@ -5456,7 +5456,7 @@ 
Files

     {}
 }
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Hash for crate::UseGroup {
     fn hash<H>(&self, state: &mut H)
     where
@@ -5466,7 +5466,7 @@ 
Files

     }
 }
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Hash for crate::UseName {
     fn hash<H>(&self, state: &mut H)
     where
@@ -5476,7 +5476,7 @@ 
Files

     }
 }
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Hash for crate::UsePath {
     fn hash<H>(&self, state: &mut H)
     where
@@ -5487,7 +5487,7 @@ 
Files

     }
 }
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Hash for crate::UseRename {
     fn hash<H>(&self, state: &mut H)
     where
@@ -5498,7 +5498,7 @@ 
Files

     }
 }
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Hash for crate::UseTree {
     fn hash<H>(&self, state: &mut H)
     where
@@ -5529,7 +5529,7 @@ 
Files

     }
 }
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Hash for crate::Variadic {
     fn hash<H>(&self, state: &mut H)
     where
@@ -5541,7 +5541,7 @@ 
Files

     }
 }
 #[cfg(any(feature = "derive", feature = "full"))]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Hash for crate::Variant {
     fn hash<H>(&self, state: &mut H)
     where
@@ -5554,7 +5554,7 @@ 
Files

     }
 }
 #[cfg(any(feature = "derive", feature = "full"))]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Hash for crate::VisRestricted {
     fn hash<H>(&self, state: &mut H)
     where
@@ -5565,7 +5565,7 @@ 
Files

     }
 }
 #[cfg(any(feature = "derive", feature = "full"))]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Hash for crate::Visibility {
     fn hash<H>(&self, state: &mut H)
     where
@@ -5586,7 +5586,7 @@ 
Files

     }
 }
 #[cfg(any(feature = "derive", feature = "full"))]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Hash for crate::WhereClause {
     fn hash<H>(&self, state: &mut H)
     where
@@ -5596,7 +5596,7 @@ 
Files

     }
 }
 #[cfg(any(feature = "derive", feature = "full"))]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Hash for crate::WherePredicate {
     fn hash<H>(&self, state: &mut H)
     where
diff --git a/src/syn/gen/visit_mut.rs.html b/src/syn/gen/visit_mut.rs.html
index c2e630b01d..7f56b21689 100644
--- a/src/syn/gen/visit_mut.rs.html
+++ b/src/syn/gen/visit_mut.rs.html
@@ -1,4 +1,4 @@
-visit_mut.rs - source

 /// [module documentation]: self
 pub trait VisitMut {
     #[cfg(any(feature = "derive", feature = "full"))]
-    #[cfg_attr(doc_cfg, doc(cfg(any(feature = "derive", feature = "full"))))]
+    #[cfg_attr(docsrs, doc(cfg(any(feature = "derive", feature = "full"))))]
     fn visit_abi_mut(&mut self, i: &mut crate::Abi) {
         visit_abi_mut(self, i);
     }
     #[cfg(any(feature = "derive", feature = "full"))]
-    #[cfg_attr(doc_cfg, doc(cfg(any(feature = "derive", feature = "full"))))]
+    #[cfg_attr(docsrs, doc(cfg(any(feature = "derive", feature = "full"))))]
     fn visit_angle_bracketed_generic_arguments_mut(
         &mut self,
         i: &mut crate::AngleBracketedGenericArguments,
@@ -3898,367 +3898,367 @@ 
Files

         visit_angle_bracketed_generic_arguments_mut(self, i);
     }
     #[cfg(feature = "full")]
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "full")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "full")))]
     fn visit_arm_mut(&mut self, i: &mut crate::Arm) {
         visit_arm_mut(self, i);
     }
     #[cfg(any(feature = "derive", feature = "full"))]
-    #[cfg_attr(doc_cfg, doc(cfg(any(feature = "derive", feature = "full"))))]
+    #[cfg_attr(docsrs, doc(cfg(any(feature = "derive", feature = "full"))))]
     fn visit_assoc_const_mut(&mut self, i: &mut crate::AssocConst) {
         visit_assoc_const_mut(self, i);
     }
     #[cfg(any(feature = "derive", feature = "full"))]
-    #[cfg_attr(doc_cfg, doc(cfg(any(feature = "derive", feature = "full"))))]
+    #[cfg_attr(docsrs, doc(cfg(any(feature = "derive", feature = "full"))))]
     fn visit_assoc_type_mut(&mut self, i: &mut crate::AssocType) {
         visit_assoc_type_mut(self, i);
     }
     #[cfg(any(feature = "derive", feature = "full"))]
-    #[cfg_attr(doc_cfg, doc(cfg(any(feature = "derive", feature = "full"))))]
+    #[cfg_attr(docsrs, doc(cfg(any(feature = "derive", feature = "full"))))]
     fn visit_attr_style_mut(&mut self, i: &mut crate::AttrStyle) {
         visit_attr_style_mut(self, i);
     }
     #[cfg(any(feature = "derive", feature = "full"))]
-    #[cfg_attr(doc_cfg, doc(cfg(any(feature = "derive", feature = "full"))))]
+    #[cfg_attr(docsrs, doc(cfg(any(feature = "derive", feature = "full"))))]
     fn visit_attribute_mut(&mut self, i: &mut crate::Attribute) {
         visit_attribute_mut(self, i);
     }
     #[cfg(any(feature = "derive", feature = "full"))]
-    #[cfg_attr(doc_cfg, doc(cfg(any(feature = "derive", feature = "full"))))]
+    #[cfg_attr(docsrs, doc(cfg(any(feature = "derive", feature = "full"))))]
     fn visit_bare_fn_arg_mut(&mut self, i: &mut crate::BareFnArg) {
         visit_bare_fn_arg_mut(self, i);
     }
     #[cfg(any(feature = "derive", feature = "full"))]
-    #[cfg_attr(doc_cfg, doc(cfg(any(feature = "derive", feature = "full"))))]
+    #[cfg_attr(docsrs, doc(cfg(any(feature = "derive", feature = "full"))))]
     fn visit_bare_variadic_mut(&mut self, i: &mut crate::BareVariadic) {
         visit_bare_variadic_mut(self, i);
     }
     #[cfg(any(feature = "derive", feature = "full"))]
-    #[cfg_attr(doc_cfg, doc(cfg(any(feature = "derive", feature = "full"))))]
+    #[cfg_attr(docsrs, doc(cfg(any(feature = "derive", feature = "full"))))]
     fn visit_bin_op_mut(&mut self, i: &mut crate::BinOp) {
         visit_bin_op_mut(self, i);
     }
     #[cfg(feature = "full")]
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "full")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "full")))]
     fn visit_block_mut(&mut self, i: &mut crate::Block) {
         visit_block_mut(self, i);
     }
     #[cfg(any(feature = "derive", feature = "full"))]
-    #[cfg_attr(doc_cfg, doc(cfg(any(feature = "derive", feature = "full"))))]
+    #[cfg_attr(docsrs, doc(cfg(any(feature = "derive", feature = "full"))))]
     fn visit_bound_lifetimes_mut(&mut self, i: &mut crate::BoundLifetimes) {
         visit_bound_lifetimes_mut(self, i);
     }
     #[cfg(any(feature = "derive", feature = "full"))]
-    #[cfg_attr(doc_cfg, doc(cfg(any(feature = "derive", feature = "full"))))]
+    #[cfg_attr(docsrs, doc(cfg(any(feature = "derive", feature = "full"))))]
     fn visit_const_param_mut(&mut self, i: &mut crate::ConstParam) {
         visit_const_param_mut(self, i);
     }
     #[cfg(any(feature = "derive", feature = "full"))]
-    #[cfg_attr(doc_cfg, doc(cfg(any(feature = "derive", feature = "full"))))]
+    #[cfg_attr(docsrs, doc(cfg(any(feature = "derive", feature = "full"))))]
     fn visit_constraint_mut(&mut self, i: &mut crate::Constraint) {
         visit_constraint_mut(self, i);
     }
     #[cfg(feature = "derive")]
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "derive")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "derive")))]
     fn visit_data_mut(&mut self, i: &mut crate::Data) {
         visit_data_mut(self, i);
     }
     #[cfg(feature = "derive")]
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "derive")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "derive")))]
     fn visit_data_enum_mut(&mut self, i: &mut crate::DataEnum) {
         visit_data_enum_mut(self, i);
     }
     #[cfg(feature = "derive")]
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "derive")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "derive")))]
     fn visit_data_struct_mut(&mut self, i: &mut crate::DataStruct) {
         visit_data_struct_mut(self, i);
     }
     #[cfg(feature = "derive")]
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "derive")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "derive")))]
     fn visit_data_union_mut(&mut self, i: &mut crate::DataUnion) {
         visit_data_union_mut(self, i);
     }
     #[cfg(feature = "derive")]
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "derive")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "derive")))]
     fn visit_derive_input_mut(&mut self, i: &mut crate::DeriveInput) {
         visit_derive_input_mut(self, i);
     }
     #[cfg(any(feature = "derive", feature = "full"))]
-    #[cfg_attr(doc_cfg, doc(cfg(any(feature = "derive", feature = "full"))))]
+    #[cfg_attr(docsrs, doc(cfg(any(feature = "derive", feature = "full"))))]
     fn visit_expr_mut(&mut self, i: &mut crate::Expr) {
         visit_expr_mut(self, i);
     }
     #[cfg(feature = "full")]
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "full")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "full")))]
     fn visit_expr_array_mut(&mut self, i: &mut crate::ExprArray) {
         visit_expr_array_mut(self, i);
     }
     #[cfg(feature = "full")]
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "full")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "full")))]
     fn visit_expr_assign_mut(&mut self, i: &mut crate::ExprAssign) {
         visit_expr_assign_mut(self, i);
     }
     #[cfg(feature = "full")]
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "full")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "full")))]
     fn visit_expr_async_mut(&mut self, i: &mut crate::ExprAsync) {
         visit_expr_async_mut(self, i);
     }
     #[cfg(feature = "full")]
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "full")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "full")))]
     fn visit_expr_await_mut(&mut self, i: &mut crate::ExprAwait) {
         visit_expr_await_mut(self, i);
     }
     #[cfg(any(feature = "derive", feature = "full"))]
-    #[cfg_attr(doc_cfg, doc(cfg(any(feature = "derive", feature = "full"))))]
+    #[cfg_attr(docsrs, doc(cfg(any(feature = "derive", feature = "full"))))]
     fn visit_expr_binary_mut(&mut self, i: &mut crate::ExprBinary) {
         visit_expr_binary_mut(self, i);
     }
     #[cfg(feature = "full")]
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "full")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "full")))]
     fn visit_expr_block_mut(&mut self, i: &mut crate::ExprBlock) {
         visit_expr_block_mut(self, i);
     }
     #[cfg(feature = "full")]
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "full")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "full")))]
     fn visit_expr_break_mut(&mut self, i: &mut crate::ExprBreak) {
         visit_expr_break_mut(self, i);
     }
     #[cfg(any(feature = "derive", feature = "full"))]
-    #[cfg_attr(doc_cfg, doc(cfg(any(feature = "derive", feature = "full"))))]
+    #[cfg_attr(docsrs, doc(cfg(any(feature = "derive", feature = "full"))))]
     fn visit_expr_call_mut(&mut self, i: &mut crate::ExprCall) {
         visit_expr_call_mut(self, i);
     }
     #[cfg(any(feature = "derive", feature = "full"))]
-    #[cfg_attr(doc_cfg, doc(cfg(any(feature = "derive", feature = "full"))))]
+    #[cfg_attr(docsrs, doc(cfg(any(feature = "derive", feature = "full"))))]
     fn visit_expr_cast_mut(&mut self, i: &mut crate::ExprCast) {
         visit_expr_cast_mut(self, i);
     }
     #[cfg(feature = "full")]
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "full")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "full")))]
     fn visit_expr_closure_mut(&mut self, i: &mut crate::ExprClosure) {
         visit_expr_closure_mut(self, i);
     }
     #[cfg(feature = "full")]
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "full")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "full")))]
     fn visit_expr_const_mut(&mut self, i: &mut crate::ExprConst) {
         visit_expr_const_mut(self, i);
     }
     #[cfg(feature = "full")]
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "full")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "full")))]
     fn visit_expr_continue_mut(&mut self, i: &mut crate::ExprContinue) {
         visit_expr_continue_mut(self, i);
     }
     #[cfg(any(feature = "derive", feature = "full"))]
-    #[cfg_attr(doc_cfg, doc(cfg(any(feature = "derive", feature = "full"))))]
+    #[cfg_attr(docsrs, doc(cfg(any(feature = "derive", feature = "full"))))]
     fn visit_expr_field_mut(&mut self, i: &mut crate::ExprField) {
         visit_expr_field_mut(self, i);
     }
     #[cfg(feature = "full")]
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "full")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "full")))]
     fn visit_expr_for_loop_mut(&mut self, i: &mut crate::ExprForLoop) {
         visit_expr_for_loop_mut(self, i);
     }
     #[cfg(any(feature = "derive", feature = "full"))]
-    #[cfg_attr(doc_cfg, doc(cfg(any(feature = "derive", feature = "full"))))]
+    #[cfg_attr(docsrs, doc(cfg(any(feature = "derive", feature = "full"))))]
     fn visit_expr_group_mut(&mut self, i: &mut crate::ExprGroup) {
         visit_expr_group_mut(self, i);
     }
     #[cfg(feature = "full")]
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "full")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "full")))]
     fn visit_expr_if_mut(&mut self, i: &mut crate::ExprIf) {
         visit_expr_if_mut(self, i);
     }
     #[cfg(any(feature = "derive", feature = "full"))]
-    #[cfg_attr(doc_cfg, doc(cfg(any(feature = "derive", feature = "full"))))]
+    #[cfg_attr(docsrs, doc(cfg(any(feature = "derive", feature = "full"))))]
     fn visit_expr_index_mut(&mut self, i: &mut crate::ExprIndex) {
         visit_expr_index_mut(self, i);
     }
     #[cfg(feature = "full")]
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "full")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "full")))]
     fn visit_expr_infer_mut(&mut self, i: &mut crate::ExprInfer) {
         visit_expr_infer_mut(self, i);
     }
     #[cfg(feature = "full")]
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "full")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "full")))]
     fn visit_expr_let_mut(&mut self, i: &mut crate::ExprLet) {
         visit_expr_let_mut(self, i);
     }
     #[cfg(any(feature = "derive", feature = "full"))]
-    #[cfg_attr(doc_cfg, doc(cfg(any(feature = "derive", feature = "full"))))]
+    #[cfg_attr(docsrs, doc(cfg(any(feature = "derive", feature = "full"))))]
     fn visit_expr_lit_mut(&mut self, i: &mut crate::ExprLit) {
         visit_expr_lit_mut(self, i);
     }
     #[cfg(feature = "full")]
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "full")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "full")))]
     fn visit_expr_loop_mut(&mut self, i: &mut crate::ExprLoop) {
         visit_expr_loop_mut(self, i);
     }
     #[cfg(any(feature = "derive", feature = "full"))]
-    #[cfg_attr(doc_cfg, doc(cfg(any(feature = "derive", feature = "full"))))]
+    #[cfg_attr(docsrs, doc(cfg(any(feature = "derive", feature = "full"))))]
     fn visit_expr_macro_mut(&mut self, i: &mut crate::ExprMacro) {
         visit_expr_macro_mut(self, i);
     }
     #[cfg(feature = "full")]
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "full")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "full")))]
     fn visit_expr_match_mut(&mut self, i: &mut crate::ExprMatch) {
         visit_expr_match_mut(self, i);
     }
     #[cfg(any(feature = "derive", feature = "full"))]
-    #[cfg_attr(doc_cfg, doc(cfg(any(feature = "derive", feature = "full"))))]
+    #[cfg_attr(docsrs, doc(cfg(any(feature = "derive", feature = "full"))))]
     fn visit_expr_method_call_mut(&mut self, i: &mut crate::ExprMethodCall) {
         visit_expr_method_call_mut(self, i);
     }
     #[cfg(any(feature = "derive", feature = "full"))]
-    #[cfg_attr(doc_cfg, doc(cfg(any(feature = "derive", feature = "full"))))]
+    #[cfg_attr(docsrs, doc(cfg(any(feature = "derive", feature = "full"))))]
     fn visit_expr_paren_mut(&mut self, i: &mut crate::ExprParen) {
         visit_expr_paren_mut(self, i);
     }
     #[cfg(any(feature = "derive", feature = "full"))]
-    #[cfg_attr(doc_cfg, doc(cfg(any(feature = "derive", feature = "full"))))]
+    #[cfg_attr(docsrs, doc(cfg(any(feature = "derive", feature = "full"))))]
     fn visit_expr_path_mut(&mut self, i: &mut crate::ExprPath) {
         visit_expr_path_mut(self, i);
     }
     #[cfg(feature = "full")]
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "full")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "full")))]
     fn visit_expr_range_mut(&mut self, i: &mut crate::ExprRange) {
         visit_expr_range_mut(self, i);
     }
     #[cfg(any(feature = "derive", feature = "full"))]
-    #[cfg_attr(doc_cfg, doc(cfg(any(feature = "derive", feature = "full"))))]
+    #[cfg_attr(docsrs, doc(cfg(any(feature = "derive", feature = "full"))))]
     fn visit_expr_reference_mut(&mut self, i: &mut crate::ExprReference) {
         visit_expr_reference_mut(self, i);
     }
     #[cfg(feature = "full")]
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "full")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "full")))]
     fn visit_expr_repeat_mut(&mut self, i: &mut crate::ExprRepeat) {
         visit_expr_repeat_mut(self, i);
     }
     #[cfg(feature = "full")]
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "full")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "full")))]
     fn visit_expr_return_mut(&mut self, i: &mut crate::ExprReturn) {
         visit_expr_return_mut(self, i);
     }
     #[cfg(any(feature = "derive", feature = "full"))]
-    #[cfg_attr(doc_cfg, doc(cfg(any(feature = "derive", feature = "full"))))]
+    #[cfg_attr(docsrs, doc(cfg(any(feature = "derive", feature = "full"))))]
     fn visit_expr_struct_mut(&mut self, i: &mut crate::ExprStruct) {
         visit_expr_struct_mut(self, i);
     }
     #[cfg(feature = "full")]
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "full")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "full")))]
     fn visit_expr_try_mut(&mut self, i: &mut crate::ExprTry) {
         visit_expr_try_mut(self, i);
     }
     #[cfg(feature = "full")]
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "full")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "full")))]
     fn visit_expr_try_block_mut(&mut self, i: &mut crate::ExprTryBlock) {
         visit_expr_try_block_mut(self, i);
     }
     #[cfg(feature = "full")]
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "full")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "full")))]
     fn visit_expr_tuple_mut(&mut self, i: &mut crate::ExprTuple) {
         visit_expr_tuple_mut(self, i);
     }
     #[cfg(any(feature = "derive", feature = "full"))]
-    #[cfg_attr(doc_cfg, doc(cfg(any(feature = "derive", feature = "full"))))]
+    #[cfg_attr(docsrs, doc(cfg(any(feature = "derive", feature = "full"))))]
     fn visit_expr_unary_mut(&mut self, i: &mut crate::ExprUnary) {
         visit_expr_unary_mut(self, i);
     }
     #[cfg(feature = "full")]
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "full")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "full")))]
     fn visit_expr_unsafe_mut(&mut self, i: &mut crate::ExprUnsafe) {
         visit_expr_unsafe_mut(self, i);
     }
     #[cfg(feature = "full")]
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "full")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "full")))]
     fn visit_expr_while_mut(&mut self, i: &mut crate::ExprWhile) {
         visit_expr_while_mut(self, i);
     }
     #[cfg(feature = "full")]
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "full")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "full")))]
     fn visit_expr_yield_mut(&mut self, i: &mut crate::ExprYield) {
         visit_expr_yield_mut(self, i);
     }
     #[cfg(any(feature = "derive", feature = "full"))]
-    #[cfg_attr(doc_cfg, doc(cfg(any(feature = "derive", feature = "full"))))]
+    #[cfg_attr(docsrs, doc(cfg(any(feature = "derive", feature = "full"))))]
     fn visit_field_mut(&mut self, i: &mut crate::Field) {
         visit_field_mut(self, i);
     }
     #[cfg(any(feature = "derive", feature = "full"))]
-    #[cfg_attr(doc_cfg, doc(cfg(any(feature = "derive", feature = "full"))))]
+    #[cfg_attr(docsrs, doc(cfg(any(feature = "derive", feature = "full"))))]
     fn visit_field_mutability_mut(&mut self, i: &mut crate::FieldMutability) {
         visit_field_mutability_mut(self, i);
     }
     #[cfg(feature = "full")]
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "full")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "full")))]
     fn visit_field_pat_mut(&mut self, i: &mut crate::FieldPat) {
         visit_field_pat_mut(self, i);
     }
     #[cfg(any(feature = "derive", feature = "full"))]
-    #[cfg_attr(doc_cfg, doc(cfg(any(feature = "derive", feature = "full"))))]
+    #[cfg_attr(docsrs, doc(cfg(any(feature = "derive", feature = "full"))))]
     fn visit_field_value_mut(&mut self, i: &mut crate::FieldValue) {
         visit_field_value_mut(self, i);
     }
     #[cfg(any(feature = "derive", feature = "full"))]
-    #[cfg_attr(doc_cfg, doc(cfg(any(feature = "derive", feature = "full"))))]
+    #[cfg_attr(docsrs, doc(cfg(any(feature = "derive", feature = "full"))))]
     fn visit_fields_mut(&mut self, i: &mut crate::Fields) {
         visit_fields_mut(self, i);
     }
     #[cfg(any(feature = "derive", feature = "full"))]
-    #[cfg_attr(doc_cfg, doc(cfg(any(feature = "derive", feature = "full"))))]
+    #[cfg_attr(docsrs, doc(cfg(any(feature = "derive", feature = "full"))))]
     fn visit_fields_named_mut(&mut self, i: &mut crate::FieldsNamed) {
         visit_fields_named_mut(self, i);
     }
     #[cfg(any(feature = "derive", feature = "full"))]
-    #[cfg_attr(doc_cfg, doc(cfg(any(feature = "derive", feature = "full"))))]
+    #[cfg_attr(docsrs, doc(cfg(any(feature = "derive", feature = "full"))))]
     fn visit_fields_unnamed_mut(&mut self, i: &mut crate::FieldsUnnamed) {
         visit_fields_unnamed_mut(self, i);
     }
     #[cfg(feature = "full")]
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "full")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "full")))]
     fn visit_file_mut(&mut self, i: &mut crate::File) {
         visit_file_mut(self, i);
     }
     #[cfg(feature = "full")]
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "full")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "full")))]
     fn visit_fn_arg_mut(&mut self, i: &mut crate::FnArg) {
         visit_fn_arg_mut(self, i);
     }
     #[cfg(feature = "full")]
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "full")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "full")))]
     fn visit_foreign_item_mut(&mut self, i: &mut crate::ForeignItem) {
         visit_foreign_item_mut(self, i);
     }
     #[cfg(feature = "full")]
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "full")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "full")))]
     fn visit_foreign_item_fn_mut(&mut self, i: &mut crate::ForeignItemFn) {
         visit_foreign_item_fn_mut(self, i);
     }
     #[cfg(feature = "full")]
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "full")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "full")))]
     fn visit_foreign_item_macro_mut(&mut self, i: &mut crate::ForeignItemMacro) {
         visit_foreign_item_macro_mut(self, i);
     }
     #[cfg(feature = "full")]
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "full")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "full")))]
     fn visit_foreign_item_static_mut(&mut self, i: &mut crate::ForeignItemStatic) {
         visit_foreign_item_static_mut(self, i);
     }
     #[cfg(feature = "full")]
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "full")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "full")))]
     fn visit_foreign_item_type_mut(&mut self, i: &mut crate::ForeignItemType) {
         visit_foreign_item_type_mut(self, i);
     }
     #[cfg(any(feature = "derive", feature = "full"))]
-    #[cfg_attr(doc_cfg, doc(cfg(any(feature = "derive", feature = "full"))))]
+    #[cfg_attr(docsrs, doc(cfg(any(feature = "derive", feature = "full"))))]
     fn visit_generic_argument_mut(&mut self, i: &mut crate::GenericArgument) {
         visit_generic_argument_mut(self, i);
     }
     #[cfg(any(feature = "derive", feature = "full"))]
-    #[cfg_attr(doc_cfg, doc(cfg(any(feature = "derive", feature = "full"))))]
+    #[cfg_attr(docsrs, doc(cfg(any(feature = "derive", feature = "full"))))]
     fn visit_generic_param_mut(&mut self, i: &mut crate::GenericParam) {
         visit_generic_param_mut(self, i);
     }
     #[cfg(any(feature = "derive", feature = "full"))]
-    #[cfg_attr(doc_cfg, doc(cfg(any(feature = "derive", feature = "full"))))]
+    #[cfg_attr(docsrs, doc(cfg(any(feature = "derive", feature = "full"))))]
     fn visit_generics_mut(&mut self, i: &mut crate::Generics) {
         visit_generics_mut(self, i);
     }
@@ -4266,122 +4266,122 @@ 
Files

         visit_ident_mut(self, i);
     }
     #[cfg(feature = "full")]
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "full")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "full")))]
     fn visit_impl_item_mut(&mut self, i: &mut crate::ImplItem) {
         visit_impl_item_mut(self, i);
     }
     #[cfg(feature = "full")]
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "full")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "full")))]
     fn visit_impl_item_const_mut(&mut self, i: &mut crate::ImplItemConst) {
         visit_impl_item_const_mut(self, i);
     }
     #[cfg(feature = "full")]
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "full")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "full")))]
     fn visit_impl_item_fn_mut(&mut self, i: &mut crate::ImplItemFn) {
         visit_impl_item_fn_mut(self, i);
     }
     #[cfg(feature = "full")]
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "full")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "full")))]
     fn visit_impl_item_macro_mut(&mut self, i: &mut crate::ImplItemMacro) {
         visit_impl_item_macro_mut(self, i);
     }
     #[cfg(feature = "full")]
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "full")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "full")))]
     fn visit_impl_item_type_mut(&mut self, i: &mut crate::ImplItemType) {
         visit_impl_item_type_mut(self, i);
     }
     #[cfg(feature = "full")]
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "full")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "full")))]
     fn visit_impl_restriction_mut(&mut self, i: &mut crate::ImplRestriction) {
         visit_impl_restriction_mut(self, i);
     }
     #[cfg(any(feature = "derive", feature = "full"))]
-    #[cfg_attr(doc_cfg, doc(cfg(any(feature = "derive", feature = "full"))))]
+    #[cfg_attr(docsrs, doc(cfg(any(feature = "derive", feature = "full"))))]
     fn visit_index_mut(&mut self, i: &mut crate::Index) {
         visit_index_mut(self, i);
     }
     #[cfg(feature = "full")]
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "full")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "full")))]
     fn visit_item_mut(&mut self, i: &mut crate::Item) {
         visit_item_mut(self, i);
     }
     #[cfg(feature = "full")]
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "full")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "full")))]
     fn visit_item_const_mut(&mut self, i: &mut crate::ItemConst) {
         visit_item_const_mut(self, i);
     }
     #[cfg(feature = "full")]
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "full")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "full")))]
     fn visit_item_enum_mut(&mut self, i: &mut crate::ItemEnum) {
         visit_item_enum_mut(self, i);
     }
     #[cfg(feature = "full")]
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "full")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "full")))]
     fn visit_item_extern_crate_mut(&mut self, i: &mut crate::ItemExternCrate) {
         visit_item_extern_crate_mut(self, i);
     }
     #[cfg(feature = "full")]
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "full")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "full")))]
     fn visit_item_fn_mut(&mut self, i: &mut crate::ItemFn) {
         visit_item_fn_mut(self, i);
     }
     #[cfg(feature = "full")]
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "full")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "full")))]
     fn visit_item_foreign_mod_mut(&mut self, i: &mut crate::ItemForeignMod) {
         visit_item_foreign_mod_mut(self, i);
     }
     #[cfg(feature = "full")]
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "full")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "full")))]
     fn visit_item_impl_mut(&mut self, i: &mut crate::ItemImpl) {
         visit_item_impl_mut(self, i);
     }
     #[cfg(feature = "full")]
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "full")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "full")))]
     fn visit_item_macro_mut(&mut self, i: &mut crate::ItemMacro) {
         visit_item_macro_mut(self, i);
     }
     #[cfg(feature = "full")]
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "full")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "full")))]
     fn visit_item_mod_mut(&mut self, i: &mut crate::ItemMod) {
         visit_item_mod_mut(self, i);
     }
     #[cfg(feature = "full")]
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "full")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "full")))]
     fn visit_item_static_mut(&mut self, i: &mut crate::ItemStatic) {
         visit_item_static_mut(self, i);
     }
     #[cfg(feature = "full")]
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "full")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "full")))]
     fn visit_item_struct_mut(&mut self, i: &mut crate::ItemStruct) {
         visit_item_struct_mut(self, i);
     }
     #[cfg(feature = "full")]
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "full")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "full")))]
     fn visit_item_trait_mut(&mut self, i: &mut crate::ItemTrait) {
         visit_item_trait_mut(self, i);
     }
     #[cfg(feature = "full")]
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "full")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "full")))]
     fn visit_item_trait_alias_mut(&mut self, i: &mut crate::ItemTraitAlias) {
         visit_item_trait_alias_mut(self, i);
     }
     #[cfg(feature = "full")]
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "full")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "full")))]
     fn visit_item_type_mut(&mut self, i: &mut crate::ItemType) {
         visit_item_type_mut(self, i);
     }
     #[cfg(feature = "full")]
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "full")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "full")))]
     fn visit_item_union_mut(&mut self, i: &mut crate::ItemUnion) {
         visit_item_union_mut(self, i);
     }
     #[cfg(feature = "full")]
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "full")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "full")))]
     fn visit_item_use_mut(&mut self, i: &mut crate::ItemUse) {
         visit_item_use_mut(self, i);
     }
     #[cfg(feature = "full")]
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "full")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "full")))]
     fn visit_label_mut(&mut self, i: &mut crate::Label) {
         visit_label_mut(self, i);
     }
@@ -4389,7 +4389,7 @@ 
Files

         visit_lifetime_mut(self, i);
     }
     #[cfg(any(feature = "derive", feature = "full"))]
-    #[cfg_attr(doc_cfg, doc(cfg(any(feature = "derive", feature = "full"))))]
+    #[cfg_attr(docsrs, doc(cfg(any(feature = "derive", feature = "full"))))]
     fn visit_lifetime_param_mut(&mut self, i: &mut crate::LifetimeParam) {
         visit_lifetime_param_mut(self, i);
     }
@@ -4421,47 +4421,47 @@ 
Files

         visit_lit_str_mut(self, i);
     }
     #[cfg(feature = "full")]
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "full")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "full")))]
     fn visit_local_mut(&mut self, i: &mut crate::Local) {
         visit_local_mut(self, i);
     }
     #[cfg(feature = "full")]
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "full")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "full")))]
     fn visit_local_init_mut(&mut self, i: &mut crate::LocalInit) {
         visit_local_init_mut(self, i);
     }
     #[cfg(any(feature = "derive", feature = "full"))]
-    #[cfg_attr(doc_cfg, doc(cfg(any(feature = "derive", feature = "full"))))]
+    #[cfg_attr(docsrs, doc(cfg(any(feature = "derive", feature = "full"))))]
     fn visit_macro_mut(&mut self, i: &mut crate::Macro) {
         visit_macro_mut(self, i);
     }
     #[cfg(any(feature = "derive", feature = "full"))]
-    #[cfg_attr(doc_cfg, doc(cfg(any(feature = "derive", feature = "full"))))]
+    #[cfg_attr(docsrs, doc(cfg(any(feature = "derive", feature = "full"))))]
     fn visit_macro_delimiter_mut(&mut self, i: &mut crate::MacroDelimiter) {
         visit_macro_delimiter_mut(self, i);
     }
     #[cfg(any(feature = "derive", feature = "full"))]
-    #[cfg_attr(doc_cfg, doc(cfg(any(feature = "derive", feature = "full"))))]
+    #[cfg_attr(docsrs, doc(cfg(any(feature = "derive", feature = "full"))))]
     fn visit_member_mut(&mut self, i: &mut crate::Member) {
         visit_member_mut(self, i);
     }
     #[cfg(any(feature = "derive", feature = "full"))]
-    #[cfg_attr(doc_cfg, doc(cfg(any(feature = "derive", feature = "full"))))]
+    #[cfg_attr(docsrs, doc(cfg(any(feature = "derive", feature = "full"))))]
     fn visit_meta_mut(&mut self, i: &mut crate::Meta) {
         visit_meta_mut(self, i);
     }
     #[cfg(any(feature = "derive", feature = "full"))]
-    #[cfg_attr(doc_cfg, doc(cfg(any(feature = "derive", feature = "full"))))]
+    #[cfg_attr(docsrs, doc(cfg(any(feature = "derive", feature = "full"))))]
     fn visit_meta_list_mut(&mut self, i: &mut crate::MetaList) {
         visit_meta_list_mut(self, i);
     }
     #[cfg(any(feature = "derive", feature = "full"))]
-    #[cfg_attr(doc_cfg, doc(cfg(any(feature = "derive", feature = "full"))))]
+    #[cfg_attr(docsrs, doc(cfg(any(feature = "derive", feature = "full"))))]
     fn visit_meta_name_value_mut(&mut self, i: &mut crate::MetaNameValue) {
         visit_meta_name_value_mut(self, i);
     }
     #[cfg(any(feature = "derive", feature = "full"))]
-    #[cfg_attr(doc_cfg, doc(cfg(any(feature = "derive", feature = "full"))))]
+    #[cfg_attr(docsrs, doc(cfg(any(feature = "derive", feature = "full"))))]
     fn visit_parenthesized_generic_arguments_mut(
         &mut self,
         i: &mut crate::ParenthesizedGenericArguments,
@@ -4469,112 +4469,112 @@ 
Files

         visit_parenthesized_generic_arguments_mut(self, i);
     }
     #[cfg(feature = "full")]
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "full")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "full")))]
     fn visit_pat_mut(&mut self, i: &mut crate::Pat) {
         visit_pat_mut(self, i);
     }
     #[cfg(feature = "full")]
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "full")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "full")))]
     fn visit_pat_ident_mut(&mut self, i: &mut crate::PatIdent) {
         visit_pat_ident_mut(self, i);
     }
     #[cfg(feature = "full")]
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "full")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "full")))]
     fn visit_pat_or_mut(&mut self, i: &mut crate::PatOr) {
         visit_pat_or_mut(self, i);
     }
     #[cfg(feature = "full")]
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "full")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "full")))]
     fn visit_pat_paren_mut(&mut self, i: &mut crate::PatParen) {
         visit_pat_paren_mut(self, i);
     }
     #[cfg(feature = "full")]
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "full")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "full")))]
     fn visit_pat_reference_mut(&mut self, i: &mut crate::PatReference) {
         visit_pat_reference_mut(self, i);
     }
     #[cfg(feature = "full")]
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "full")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "full")))]
     fn visit_pat_rest_mut(&mut self, i: &mut crate::PatRest) {
         visit_pat_rest_mut(self, i);
     }
     #[cfg(feature = "full")]
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "full")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "full")))]
     fn visit_pat_slice_mut(&mut self, i: &mut crate::PatSlice) {
         visit_pat_slice_mut(self, i);
     }
     #[cfg(feature = "full")]
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "full")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "full")))]
     fn visit_pat_struct_mut(&mut self, i: &mut crate::PatStruct) {
         visit_pat_struct_mut(self, i);
     }
     #[cfg(feature = "full")]
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "full")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "full")))]
     fn visit_pat_tuple_mut(&mut self, i: &mut crate::PatTuple) {
         visit_pat_tuple_mut(self, i);
     }
     #[cfg(feature = "full")]
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "full")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "full")))]
     fn visit_pat_tuple_struct_mut(&mut self, i: &mut crate::PatTupleStruct) {
         visit_pat_tuple_struct_mut(self, i);
     }
     #[cfg(feature = "full")]
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "full")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "full")))]
     fn visit_pat_type_mut(&mut self, i: &mut crate::PatType) {
         visit_pat_type_mut(self, i);
     }
     #[cfg(feature = "full")]
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "full")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "full")))]
     fn visit_pat_wild_mut(&mut self, i: &mut crate::PatWild) {
         visit_pat_wild_mut(self, i);
     }
     #[cfg(any(feature = "derive", feature = "full"))]
-    #[cfg_attr(doc_cfg, doc(cfg(any(feature = "derive", feature = "full"))))]
+    #[cfg_attr(docsrs, doc(cfg(any(feature = "derive", feature = "full"))))]
     fn visit_path_mut(&mut self, i: &mut crate::Path) {
         visit_path_mut(self, i);
     }
     #[cfg(any(feature = "derive", feature = "full"))]
-    #[cfg_attr(doc_cfg, doc(cfg(any(feature = "derive", feature = "full"))))]
+    #[cfg_attr(docsrs, doc(cfg(any(feature = "derive", feature = "full"))))]
     fn visit_path_arguments_mut(&mut self, i: &mut crate::PathArguments) {
         visit_path_arguments_mut(self, i);
     }
     #[cfg(any(feature = "derive", feature = "full"))]
-    #[cfg_attr(doc_cfg, doc(cfg(any(feature = "derive", feature = "full"))))]
+    #[cfg_attr(docsrs, doc(cfg(any(feature = "derive", feature = "full"))))]
     fn visit_path_segment_mut(&mut self, i: &mut crate::PathSegment) {
         visit_path_segment_mut(self, i);
     }
     #[cfg(any(feature = "derive", feature = "full"))]
-    #[cfg_attr(doc_cfg, doc(cfg(any(feature = "derive", feature = "full"))))]
+    #[cfg_attr(docsrs, doc(cfg(any(feature = "derive", feature = "full"))))]
     fn visit_predicate_lifetime_mut(&mut self, i: &mut crate::PredicateLifetime) {
         visit_predicate_lifetime_mut(self, i);
     }
     #[cfg(any(feature = "derive", feature = "full"))]
-    #[cfg_attr(doc_cfg, doc(cfg(any(feature = "derive", feature = "full"))))]
+    #[cfg_attr(docsrs, doc(cfg(any(feature = "derive", feature = "full"))))]
     fn visit_predicate_type_mut(&mut self, i: &mut crate::PredicateType) {
         visit_predicate_type_mut(self, i);
     }
     #[cfg(any(feature = "derive", feature = "full"))]
-    #[cfg_attr(doc_cfg, doc(cfg(any(feature = "derive", feature = "full"))))]
+    #[cfg_attr(docsrs, doc(cfg(any(feature = "derive", feature = "full"))))]
     fn visit_qself_mut(&mut self, i: &mut crate::QSelf) {
         visit_qself_mut(self, i);
     }
     #[cfg(feature = "full")]
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "full")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "full")))]
     fn visit_range_limits_mut(&mut self, i: &mut crate::RangeLimits) {
         visit_range_limits_mut(self, i);
     }
     #[cfg(feature = "full")]
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "full")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "full")))]
     fn visit_receiver_mut(&mut self, i: &mut crate::Receiver) {
         visit_receiver_mut(self, i);
     }
     #[cfg(any(feature = "derive", feature = "full"))]
-    #[cfg_attr(doc_cfg, doc(cfg(any(feature = "derive", feature = "full"))))]
+    #[cfg_attr(docsrs, doc(cfg(any(feature = "derive", feature = "full"))))]
     fn visit_return_type_mut(&mut self, i: &mut crate::ReturnType) {
         visit_return_type_mut(self, i);
     }
     #[cfg(feature = "full")]
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "full")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "full")))]
     fn visit_signature_mut(&mut self, i: &mut crate::Signature) {
         visit_signature_mut(self, i);
     }
@@ -4582,208 +4582,208 @@ 
Files

         visit_span_mut(self, i);
     }
     #[cfg(feature = "full")]
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "full")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "full")))]
     fn visit_static_mutability_mut(&mut self, i: &mut crate::StaticMutability) {
         visit_static_mutability_mut(self, i);
     }
     #[cfg(feature = "full")]
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "full")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "full")))]
     fn visit_stmt_mut(&mut self, i: &mut crate::Stmt) {
         visit_stmt_mut(self, i);
     }
     #[cfg(feature = "full")]
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "full")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "full")))]
     fn visit_stmt_macro_mut(&mut self, i: &mut crate::StmtMacro) {
         visit_stmt_macro_mut(self, i);
     }
     #[cfg(any(feature = "derive", feature = "full"))]
-    #[cfg_attr(doc_cfg, doc(cfg(any(feature = "derive", feature = "full"))))]
+    #[cfg_attr(docsrs, doc(cfg(any(feature = "derive", feature = "full"))))]
     fn visit_trait_bound_mut(&mut self, i: &mut crate::TraitBound) {
         visit_trait_bound_mut(self, i);
     }
     #[cfg(any(feature = "derive", feature = "full"))]
-    #[cfg_attr(doc_cfg, doc(cfg(any(feature = "derive", feature = "full"))))]
+    #[cfg_attr(docsrs, doc(cfg(any(feature = "derive", feature = "full"))))]
     fn visit_trait_bound_modifier_mut(&mut self, i: &mut crate::TraitBoundModifier) {
         visit_trait_bound_modifier_mut(self, i);
     }
     #[cfg(feature = "full")]
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "full")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "full")))]
     fn visit_trait_item_mut(&mut self, i: &mut crate::TraitItem) {
         visit_trait_item_mut(self, i);
     }
     #[cfg(feature = "full")]
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "full")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "full")))]
     fn visit_trait_item_const_mut(&mut self, i: &mut crate::TraitItemConst) {
         visit_trait_item_const_mut(self, i);
     }
     #[cfg(feature = "full")]
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "full")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "full")))]
     fn visit_trait_item_fn_mut(&mut self, i: &mut crate::TraitItemFn) {
         visit_trait_item_fn_mut(self, i);
     }
     #[cfg(feature = "full")]
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "full")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "full")))]
     fn visit_trait_item_macro_mut(&mut self, i: &mut crate::TraitItemMacro) {
         visit_trait_item_macro_mut(self, i);
     }
     #[cfg(feature = "full")]
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "full")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "full")))]
     fn visit_trait_item_type_mut(&mut self, i: &mut crate::TraitItemType) {
         visit_trait_item_type_mut(self, i);
     }
     #[cfg(any(feature = "derive", feature = "full"))]
-    #[cfg_attr(doc_cfg, doc(cfg(any(feature = "derive", feature = "full"))))]
+    #[cfg_attr(docsrs, doc(cfg(any(feature = "derive", feature = "full"))))]
     fn visit_type_mut(&mut self, i: &mut crate::Type) {
         visit_type_mut(self, i);
     }
     #[cfg(any(feature = "derive", feature = "full"))]
-    #[cfg_attr(doc_cfg, doc(cfg(any(feature = "derive", feature = "full"))))]
+    #[cfg_attr(docsrs, doc(cfg(any(feature = "derive", feature = "full"))))]
     fn visit_type_array_mut(&mut self, i: &mut crate::TypeArray) {
         visit_type_array_mut(self, i);
     }
     #[cfg(any(feature = "derive", feature = "full"))]
-    #[cfg_attr(doc_cfg, doc(cfg(any(feature = "derive", feature = "full"))))]
+    #[cfg_attr(docsrs, doc(cfg(any(feature = "derive", feature = "full"))))]
     fn visit_type_bare_fn_mut(&mut self, i: &mut crate::TypeBareFn) {
         visit_type_bare_fn_mut(self, i);
     }
     #[cfg(any(feature = "derive", feature = "full"))]
-    #[cfg_attr(doc_cfg, doc(cfg(any(feature = "derive", feature = "full"))))]
+    #[cfg_attr(docsrs, doc(cfg(any(feature = "derive", feature = "full"))))]
     fn visit_type_group_mut(&mut self, i: &mut crate::TypeGroup) {
         visit_type_group_mut(self, i);
     }
     #[cfg(any(feature = "derive", feature = "full"))]
-    #[cfg_attr(doc_cfg, doc(cfg(any(feature = "derive", feature = "full"))))]
+    #[cfg_attr(docsrs, doc(cfg(any(feature = "derive", feature = "full"))))]
     fn visit_type_impl_trait_mut(&mut self, i: &mut crate::TypeImplTrait) {
         visit_type_impl_trait_mut(self, i);
     }
     #[cfg(any(feature = "derive", feature = "full"))]
-    #[cfg_attr(doc_cfg, doc(cfg(any(feature = "derive", feature = "full"))))]
+    #[cfg_attr(docsrs, doc(cfg(any(feature = "derive", feature = "full"))))]
     fn visit_type_infer_mut(&mut self, i: &mut crate::TypeInfer) {
         visit_type_infer_mut(self, i);
     }
     #[cfg(any(feature = "derive", feature = "full"))]
-    #[cfg_attr(doc_cfg, doc(cfg(any(feature = "derive", feature = "full"))))]
+    #[cfg_attr(docsrs, doc(cfg(any(feature = "derive", feature = "full"))))]
     fn visit_type_macro_mut(&mut self, i: &mut crate::TypeMacro) {
         visit_type_macro_mut(self, i);
     }
     #[cfg(any(feature = "derive", feature = "full"))]
-    #[cfg_attr(doc_cfg, doc(cfg(any(feature = "derive", feature = "full"))))]
+    #[cfg_attr(docsrs, doc(cfg(any(feature = "derive", feature = "full"))))]
     fn visit_type_never_mut(&mut self, i: &mut crate::TypeNever) {
         visit_type_never_mut(self, i);
     }
     #[cfg(any(feature = "derive", feature = "full"))]
-    #[cfg_attr(doc_cfg, doc(cfg(any(feature = "derive", feature = "full"))))]
+    #[cfg_attr(docsrs, doc(cfg(any(feature = "derive", feature = "full"))))]
     fn visit_type_param_mut(&mut self, i: &mut crate::TypeParam) {
         visit_type_param_mut(self, i);
     }
     #[cfg(any(feature = "derive", feature = "full"))]
-    #[cfg_attr(doc_cfg, doc(cfg(any(feature = "derive", feature = "full"))))]
+    #[cfg_attr(docsrs, doc(cfg(any(feature = "derive", feature = "full"))))]
     fn visit_type_param_bound_mut(&mut self, i: &mut crate::TypeParamBound) {
         visit_type_param_bound_mut(self, i);
     }
     #[cfg(any(feature = "derive", feature = "full"))]
-    #[cfg_attr(doc_cfg, doc(cfg(any(feature = "derive", feature = "full"))))]
+    #[cfg_attr(docsrs, doc(cfg(any(feature = "derive", feature = "full"))))]
     fn visit_type_paren_mut(&mut self, i: &mut crate::TypeParen) {
         visit_type_paren_mut(self, i);
     }
     #[cfg(any(feature = "derive", feature = "full"))]
-    #[cfg_attr(doc_cfg, doc(cfg(any(feature = "derive", feature = "full"))))]
+    #[cfg_attr(docsrs, doc(cfg(any(feature = "derive", feature = "full"))))]
     fn visit_type_path_mut(&mut self, i: &mut crate::TypePath) {
         visit_type_path_mut(self, i);
     }
     #[cfg(any(feature = "derive", feature = "full"))]
-    #[cfg_attr(doc_cfg, doc(cfg(any(feature = "derive", feature = "full"))))]
+    #[cfg_attr(docsrs, doc(cfg(any(feature = "derive", feature = "full"))))]
     fn visit_type_ptr_mut(&mut self, i: &mut crate::TypePtr) {
         visit_type_ptr_mut(self, i);
     }
     #[cfg(any(feature = "derive", feature = "full"))]
-    #[cfg_attr(doc_cfg, doc(cfg(any(feature = "derive", feature = "full"))))]
+    #[cfg_attr(docsrs, doc(cfg(any(feature = "derive", feature = "full"))))]
     fn visit_type_reference_mut(&mut self, i: &mut crate::TypeReference) {
         visit_type_reference_mut(self, i);
     }
     #[cfg(any(feature = "derive", feature = "full"))]
-    #[cfg_attr(doc_cfg, doc(cfg(any(feature = "derive", feature = "full"))))]
+    #[cfg_attr(docsrs, doc(cfg(any(feature = "derive", feature = "full"))))]
     fn visit_type_slice_mut(&mut self, i: &mut crate::TypeSlice) {
         visit_type_slice_mut(self, i);
     }
     #[cfg(any(feature = "derive", feature = "full"))]
-    #[cfg_attr(doc_cfg, doc(cfg(any(feature = "derive", feature = "full"))))]
+    #[cfg_attr(docsrs, doc(cfg(any(feature = "derive", feature = "full"))))]
     fn visit_type_trait_object_mut(&mut self, i: &mut crate::TypeTraitObject) {
         visit_type_trait_object_mut(self, i);
     }
     #[cfg(any(feature = "derive", feature = "full"))]
-    #[cfg_attr(doc_cfg, doc(cfg(any(feature = "derive", feature = "full"))))]
+    #[cfg_attr(docsrs, doc(cfg(any(feature = "derive", feature = "full"))))]
     fn visit_type_tuple_mut(&mut self, i: &mut crate::TypeTuple) {
         visit_type_tuple_mut(self, i);
     }
     #[cfg(any(feature = "derive", feature = "full"))]
-    #[cfg_attr(doc_cfg, doc(cfg(any(feature = "derive", feature = "full"))))]
+    #[cfg_attr(docsrs, doc(cfg(any(feature = "derive", feature = "full"))))]
     fn visit_un_op_mut(&mut self, i: &mut crate::UnOp) {
         visit_un_op_mut(self, i);
     }
     #[cfg(feature = "full")]
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "full")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "full")))]
     fn visit_use_glob_mut(&mut self, i: &mut crate::UseGlob) {
         visit_use_glob_mut(self, i);
     }
     #[cfg(feature = "full")]
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "full")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "full")))]
     fn visit_use_group_mut(&mut self, i: &mut crate::UseGroup) {
         visit_use_group_mut(self, i);
     }
     #[cfg(feature = "full")]
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "full")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "full")))]
     fn visit_use_name_mut(&mut self, i: &mut crate::UseName) {
         visit_use_name_mut(self, i);
     }
     #[cfg(feature = "full")]
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "full")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "full")))]
     fn visit_use_path_mut(&mut self, i: &mut crate::UsePath) {
         visit_use_path_mut(self, i);
     }
     #[cfg(feature = "full")]
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "full")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "full")))]
     fn visit_use_rename_mut(&mut self, i: &mut crate::UseRename) {
         visit_use_rename_mut(self, i);
     }
     #[cfg(feature = "full")]
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "full")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "full")))]
     fn visit_use_tree_mut(&mut self, i: &mut crate::UseTree) {
         visit_use_tree_mut(self, i);
     }
     #[cfg(feature = "full")]
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "full")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "full")))]
     fn visit_variadic_mut(&mut self, i: &mut crate::Variadic) {
         visit_variadic_mut(self, i);
     }
     #[cfg(any(feature = "derive", feature = "full"))]
-    #[cfg_attr(doc_cfg, doc(cfg(any(feature = "derive", feature = "full"))))]
+    #[cfg_attr(docsrs, doc(cfg(any(feature = "derive", feature = "full"))))]
     fn visit_variant_mut(&mut self, i: &mut crate::Variant) {
         visit_variant_mut(self, i);
     }
     #[cfg(any(feature = "derive", feature = "full"))]
-    #[cfg_attr(doc_cfg, doc(cfg(any(feature = "derive", feature = "full"))))]
+    #[cfg_attr(docsrs, doc(cfg(any(feature = "derive", feature = "full"))))]
     fn visit_vis_restricted_mut(&mut self, i: &mut crate::VisRestricted) {
         visit_vis_restricted_mut(self, i);
     }
     #[cfg(any(feature = "derive", feature = "full"))]
-    #[cfg_attr(doc_cfg, doc(cfg(any(feature = "derive", feature = "full"))))]
+    #[cfg_attr(docsrs, doc(cfg(any(feature = "derive", feature = "full"))))]
     fn visit_visibility_mut(&mut self, i: &mut crate::Visibility) {
         visit_visibility_mut(self, i);
     }
     #[cfg(any(feature = "derive", feature = "full"))]
-    #[cfg_attr(doc_cfg, doc(cfg(any(feature = "derive", feature = "full"))))]
+    #[cfg_attr(docsrs, doc(cfg(any(feature = "derive", feature = "full"))))]
     fn visit_where_clause_mut(&mut self, i: &mut crate::WhereClause) {
         visit_where_clause_mut(self, i);
     }
     #[cfg(any(feature = "derive", feature = "full"))]
-    #[cfg_attr(doc_cfg, doc(cfg(any(feature = "derive", feature = "full"))))]
+    #[cfg_attr(docsrs, doc(cfg(any(feature = "derive", feature = "full"))))]
     fn visit_where_predicate_mut(&mut self, i: &mut crate::WherePredicate) {
         visit_where_predicate_mut(self, i);
     }
 }
 #[cfg(any(feature = "derive", feature = "full"))]
-#[cfg_attr(doc_cfg, doc(cfg(any(feature = "derive", feature = "full"))))]
+#[cfg_attr(docsrs, doc(cfg(any(feature = "derive", feature = "full"))))]
 pub fn visit_abi_mut<V>(v: &mut V, node: &mut crate::Abi)
 where
     V: VisitMut + ?Sized,
@@ -4794,7 +4794,7 @@ 
Files

     }
 }
 #[cfg(any(feature = "derive", feature = "full"))]
-#[cfg_attr(doc_cfg, doc(cfg(any(feature = "derive", feature = "full"))))]
+#[cfg_attr(docsrs, doc(cfg(any(feature = "derive", feature = "full"))))]
 pub fn visit_angle_bracketed_generic_arguments_mut<V>(
     v: &mut V,
     node: &mut crate::AngleBracketedGenericArguments,
@@ -4811,7 +4811,7 @@ 
Files

     skip!(node.gt_token);
 }
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "full")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "full")))]
 pub fn visit_arm_mut<V>(v: &mut V, node: &mut crate::Arm)
 where
     V: VisitMut + ?Sized,
@@ -4829,7 +4829,7 @@ 
Files

     skip!(node.comma);
 }
 #[cfg(any(feature = "derive", feature = "full"))]
-#[cfg_attr(doc_cfg, doc(cfg(any(feature = "derive", feature = "full"))))]
+#[cfg_attr(docsrs, doc(cfg(any(feature = "derive", feature = "full"))))]
 pub fn visit_assoc_const_mut<V>(v: &mut V, node: &mut crate::AssocConst)
 where
     V: VisitMut + ?Sized,
@@ -4842,7 +4842,7 @@ 
Files

     v.visit_expr_mut(&mut node.value);
 }
 #[cfg(any(feature = "derive", feature = "full"))]
-#[cfg_attr(doc_cfg, doc(cfg(any(feature = "derive", feature = "full"))))]
+#[cfg_attr(docsrs, doc(cfg(any(feature = "derive", feature = "full"))))]
 pub fn visit_assoc_type_mut<V>(v: &mut V, node: &mut crate::AssocType)
 where
     V: VisitMut + ?Sized,
@@ -4855,7 +4855,7 @@ 
Files

     v.visit_type_mut(&mut node.ty);
 }
 #[cfg(any(feature = "derive", feature = "full"))]
-#[cfg_attr(doc_cfg, doc(cfg(any(feature = "derive", feature = "full"))))]
+#[cfg_attr(docsrs, doc(cfg(any(feature = "derive", feature = "full"))))]
 pub fn visit_attr_style_mut<V>(v: &mut V, node: &mut crate::AttrStyle)
 where
     V: VisitMut + ?Sized,
@@ -4868,7 +4868,7 @@ 
Files

     }
 }
 #[cfg(any(feature = "derive", feature = "full"))]
-#[cfg_attr(doc_cfg, doc(cfg(any(feature = "derive", feature = "full"))))]
+#[cfg_attr(docsrs, doc(cfg(any(feature = "derive", feature = "full"))))]
 pub fn visit_attribute_mut<V>(v: &mut V, node: &mut crate::Attribute)
 where
     V: VisitMut + ?Sized,
@@ -4879,7 +4879,7 @@ 
Files

     v.visit_meta_mut(&mut node.meta);
 }
 #[cfg(any(feature = "derive", feature = "full"))]
-#[cfg_attr(doc_cfg, doc(cfg(any(feature = "derive", feature = "full"))))]
+#[cfg_attr(docsrs, doc(cfg(any(feature = "derive", feature = "full"))))]
 pub fn visit_bare_fn_arg_mut<V>(v: &mut V, node: &mut crate::BareFnArg)
 where
     V: VisitMut + ?Sized,
@@ -4894,7 +4894,7 @@ 
Files

     v.visit_type_mut(&mut node.ty);
 }
 #[cfg(any(feature = "derive", feature = "full"))]
-#[cfg_attr(doc_cfg, doc(cfg(any(feature = "derive", feature = "full"))))]
+#[cfg_attr(docsrs, doc(cfg(any(feature = "derive", feature = "full"))))]
 pub fn visit_bare_variadic_mut<V>(v: &mut V, node: &mut crate::BareVariadic)
 where
     V: VisitMut + ?Sized,
@@ -4910,7 +4910,7 @@ 
Files

     skip!(node.comma);
 }
 #[cfg(any(feature = "derive", feature = "full"))]
-#[cfg_attr(doc_cfg, doc(cfg(any(feature = "derive", feature = "full"))))]
+#[cfg_attr(docsrs, doc(cfg(any(feature = "derive", feature = "full"))))]
 pub fn visit_bin_op_mut<V>(v: &mut V, node: &mut crate::BinOp)
 where
     V: VisitMut + ?Sized,
@@ -5003,7 +5003,7 @@ 
Files

     }
 }
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "full")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "full")))]
 pub fn visit_block_mut<V>(v: &mut V, node: &mut crate::Block)
 where
     V: VisitMut + ?Sized,
@@ -5014,7 +5014,7 @@ 
Files

     }
 }
 #[cfg(any(feature = "derive", feature = "full"))]
-#[cfg_attr(doc_cfg, doc(cfg(any(feature = "derive", feature = "full"))))]
+#[cfg_attr(docsrs, doc(cfg(any(feature = "derive", feature = "full"))))]
 pub fn visit_bound_lifetimes_mut<V>(v: &mut V, node: &mut crate::BoundLifetimes)
 where
     V: VisitMut + ?Sized,
@@ -5028,7 +5028,7 @@ 
Files

     skip!(node.gt_token);
 }
 #[cfg(any(feature = "derive", feature = "full"))]
-#[cfg_attr(doc_cfg, doc(cfg(any(feature = "derive", feature = "full"))))]
+#[cfg_attr(docsrs, doc(cfg(any(feature = "derive", feature = "full"))))]
 pub fn visit_const_param_mut<V>(v: &mut V, node: &mut crate::ConstParam)
 where
     V: VisitMut + ?Sized,
@@ -5046,7 +5046,7 @@ 
Files

     }
 }
 #[cfg(any(feature = "derive", feature = "full"))]
-#[cfg_attr(doc_cfg, doc(cfg(any(feature = "derive", feature = "full"))))]
+#[cfg_attr(docsrs, doc(cfg(any(feature = "derive", feature = "full"))))]
 pub fn visit_constraint_mut<V>(v: &mut V, node: &mut crate::Constraint)
 where
     V: VisitMut + ?Sized,
@@ -5062,7 +5062,7 @@ 
Files

     }
 }
 #[cfg(feature = "derive")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "derive")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "derive")))]
 pub fn visit_data_mut<V>(v: &mut V, node: &mut crate::Data)
 where
     V: VisitMut + ?Sized,
@@ -5080,7 +5080,7 @@ 
Files

     }
 }
 #[cfg(feature = "derive")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "derive")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "derive")))]
 pub fn visit_data_enum_mut<V>(v: &mut V, node: &mut crate::DataEnum)
 where
     V: VisitMut + ?Sized,
@@ -5093,7 +5093,7 @@ 
Files

     }
 }
 #[cfg(feature = "derive")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "derive")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "derive")))]
 pub fn visit_data_struct_mut<V>(v: &mut V, node: &mut crate::DataStruct)
 where
     V: VisitMut + ?Sized,
@@ -5103,7 +5103,7 @@ 
Files

     skip!(node.semi_token);
 }
 #[cfg(feature = "derive")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "derive")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "derive")))]
 pub fn visit_data_union_mut<V>(v: &mut V, node: &mut crate::DataUnion)
 where
     V: VisitMut + ?Sized,
@@ -5112,7 +5112,7 @@ 
Files

     v.visit_fields_named_mut(&mut node.fields);
 }
 #[cfg(feature = "derive")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "derive")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "derive")))]
 pub fn visit_derive_input_mut<V>(v: &mut V, node: &mut crate::DeriveInput)
 where
     V: VisitMut + ?Sized,
@@ -5126,7 +5126,7 @@ 
Files

     v.visit_data_mut(&mut node.data);
 }
 #[cfg(any(feature = "derive", feature = "full"))]
-#[cfg_attr(doc_cfg, doc(cfg(any(feature = "derive", feature = "full"))))]
+#[cfg_attr(docsrs, doc(cfg(any(feature = "derive", feature = "full"))))]
 pub fn visit_expr_mut<V>(v: &mut V, node: &mut crate::Expr)
 where
     V: VisitMut + ?Sized,
@@ -5252,7 +5252,7 @@ 
Files

     }
 }
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "full")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "full")))]
 pub fn visit_expr_array_mut<V>(v: &mut V, node: &mut crate::ExprArray)
 where
     V: VisitMut + ?Sized,
@@ -5267,7 +5267,7 @@ 
Files

     }
 }
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "full")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "full")))]
 pub fn visit_expr_assign_mut<V>(v: &mut V, node: &mut crate::ExprAssign)
 where
     V: VisitMut + ?Sized,
@@ -5280,7 +5280,7 @@ 
Files

     v.visit_expr_mut(&mut *node.right);
 }
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "full")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "full")))]
 pub fn visit_expr_async_mut<V>(v: &mut V, node: &mut crate::ExprAsync)
 where
     V: VisitMut + ?Sized,
@@ -5293,7 +5293,7 @@ 
Files

     v.visit_block_mut(&mut node.block);
 }
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "full")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "full")))]
 pub fn visit_expr_await_mut<V>(v: &mut V, node: &mut crate::ExprAwait)
 where
     V: VisitMut + ?Sized,
@@ -5306,7 +5306,7 @@ 
Files

     skip!(node.await_token);
 }
 #[cfg(any(feature = "derive", feature = "full"))]
-#[cfg_attr(doc_cfg, doc(cfg(any(feature = "derive", feature = "full"))))]
+#[cfg_attr(docsrs, doc(cfg(any(feature = "derive", feature = "full"))))]
 pub fn visit_expr_binary_mut<V>(v: &mut V, node: &mut crate::ExprBinary)
 where
     V: VisitMut + ?Sized,
@@ -5319,7 +5319,7 @@ 
Files

     v.visit_expr_mut(&mut *node.right);
 }
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "full")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "full")))]
 pub fn visit_expr_block_mut<V>(v: &mut V, node: &mut crate::ExprBlock)
 where
     V: VisitMut + ?Sized,
@@ -5333,7 +5333,7 @@ 
Files

     v.visit_block_mut(&mut node.block);
 }
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "full")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "full")))]
 pub fn visit_expr_break_mut<V>(v: &mut V, node: &mut crate::ExprBreak)
 where
     V: VisitMut + ?Sized,
@@ -5350,7 +5350,7 @@ 
Files

     }
 }
 #[cfg(any(feature = "derive", feature = "full"))]
-#[cfg_attr(doc_cfg, doc(cfg(any(feature = "derive", feature = "full"))))]
+#[cfg_attr(docsrs, doc(cfg(any(feature = "derive", feature = "full"))))]
 pub fn visit_expr_call_mut<V>(v: &mut V, node: &mut crate::ExprCall)
 where
     V: VisitMut + ?Sized,
@@ -5366,7 +5366,7 @@ 
Files

     }
 }
 #[cfg(any(feature = "derive", feature = "full"))]
-#[cfg_attr(doc_cfg, doc(cfg(any(feature = "derive", feature = "full"))))]
+#[cfg_attr(docsrs, doc(cfg(any(feature = "derive", feature = "full"))))]
 pub fn visit_expr_cast_mut<V>(v: &mut V, node: &mut crate::ExprCast)
 where
     V: VisitMut + ?Sized,
@@ -5379,7 +5379,7 @@ 
Files

     v.visit_type_mut(&mut *node.ty);
 }
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "full")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "full")))]
 pub fn visit_expr_closure_mut<V>(v: &mut V, node: &mut crate::ExprClosure)
 where
     V: VisitMut + ?Sized,
@@ -5404,7 +5404,7 @@ 
Files

     v.visit_expr_mut(&mut *node.body);
 }
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "full")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "full")))]
 pub fn visit_expr_const_mut<V>(v: &mut V, node: &mut crate::ExprConst)
 where
     V: VisitMut + ?Sized,
@@ -5416,7 +5416,7 @@ 
Files

     v.visit_block_mut(&mut node.block);
 }
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "full")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "full")))]
 pub fn visit_expr_continue_mut<V>(v: &mut V, node: &mut crate::ExprContinue)
 where
     V: VisitMut + ?Sized,
@@ -5430,7 +5430,7 @@ 
Files

     }
 }
 #[cfg(any(feature = "derive", feature = "full"))]
-#[cfg_attr(doc_cfg, doc(cfg(any(feature = "derive", feature = "full"))))]
+#[cfg_attr(docsrs, doc(cfg(any(feature = "derive", feature = "full"))))]
 pub fn visit_expr_field_mut<V>(v: &mut V, node: &mut crate::ExprField)
 where
     V: VisitMut + ?Sized,
@@ -5443,7 +5443,7 @@ 
Files

     v.visit_member_mut(&mut node.member);
 }
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "full")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "full")))]
 pub fn visit_expr_for_loop_mut<V>(v: &mut V, node: &mut crate::ExprForLoop)
 where
     V: VisitMut + ?Sized,
@@ -5461,7 +5461,7 @@ 
Files

     v.visit_block_mut(&mut node.body);
 }
 #[cfg(any(feature = "derive", feature = "full"))]
-#[cfg_attr(doc_cfg, doc(cfg(any(feature = "derive", feature = "full"))))]
+#[cfg_attr(docsrs, doc(cfg(any(feature = "derive", feature = "full"))))]
 pub fn visit_expr_group_mut<V>(v: &mut V, node: &mut crate::ExprGroup)
 where
     V: VisitMut + ?Sized,
@@ -5473,7 +5473,7 @@ 
Files

     v.visit_expr_mut(&mut *node.expr);
 }
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "full")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "full")))]
 pub fn visit_expr_if_mut<V>(v: &mut V, node: &mut crate::ExprIf)
 where
     V: VisitMut + ?Sized,
@@ -5490,7 +5490,7 @@ 
Files

     }
 }
 #[cfg(any(feature = "derive", feature = "full"))]
-#[cfg_attr(doc_cfg, doc(cfg(any(feature = "derive", feature = "full"))))]
+#[cfg_attr(docsrs, doc(cfg(any(feature = "derive", feature = "full"))))]
 pub fn visit_expr_index_mut<V>(v: &mut V, node: &mut crate::ExprIndex)
 where
     V: VisitMut + ?Sized,
@@ -5503,7 +5503,7 @@ 
Files

     v.visit_expr_mut(&mut *node.index);
 }
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "full")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "full")))]
 pub fn visit_expr_infer_mut<V>(v: &mut V, node: &mut crate::ExprInfer)
 where
     V: VisitMut + ?Sized,
@@ -5514,7 +5514,7 @@ 
Files

     skip!(node.underscore_token);
 }
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "full")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "full")))]
 pub fn visit_expr_let_mut<V>(v: &mut V, node: &mut crate::ExprLet)
 where
     V: VisitMut + ?Sized,
@@ -5528,7 +5528,7 @@ 
Files

     v.visit_expr_mut(&mut *node.expr);
 }
 #[cfg(any(feature = "derive", feature = "full"))]
-#[cfg_attr(doc_cfg, doc(cfg(any(feature = "derive", feature = "full"))))]
+#[cfg_attr(docsrs, doc(cfg(any(feature = "derive", feature = "full"))))]
 pub fn visit_expr_lit_mut<V>(v: &mut V, node: &mut crate::ExprLit)
 where
     V: VisitMut + ?Sized,
@@ -5539,7 +5539,7 @@ 
Files

     v.visit_lit_mut(&mut node.lit);
 }
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "full")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "full")))]
 pub fn visit_expr_loop_mut<V>(v: &mut V, node: &mut crate::ExprLoop)
 where
     V: VisitMut + ?Sized,
@@ -5554,7 +5554,7 @@ 
Files

     v.visit_block_mut(&mut node.body);
 }
 #[cfg(any(feature = "derive", feature = "full"))]
-#[cfg_attr(doc_cfg, doc(cfg(any(feature = "derive", feature = "full"))))]
+#[cfg_attr(docsrs, doc(cfg(any(feature = "derive", feature = "full"))))]
 pub fn visit_expr_macro_mut<V>(v: &mut V, node: &mut crate::ExprMacro)
 where
     V: VisitMut + ?Sized,
@@ -5565,7 +5565,7 @@ 
Files

     v.visit_macro_mut(&mut node.mac);
 }
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "full")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "full")))]
 pub fn visit_expr_match_mut<V>(v: &mut V, node: &mut crate::ExprMatch)
 where
     V: VisitMut + ?Sized,
@@ -5581,7 +5581,7 @@ 
Files

     }
 }
 #[cfg(any(feature = "derive", feature = "full"))]
-#[cfg_attr(doc_cfg, doc(cfg(any(feature = "derive", feature = "full"))))]
+#[cfg_attr(docsrs, doc(cfg(any(feature = "derive", feature = "full"))))]
 pub fn visit_expr_method_call_mut<V>(v: &mut V, node: &mut crate::ExprMethodCall)
 where
     V: VisitMut + ?Sized,
@@ -5602,7 +5602,7 @@ 
Files

     }
 }
 #[cfg(any(feature = "derive", feature = "full"))]
-#[cfg_attr(doc_cfg, doc(cfg(any(feature = "derive", feature = "full"))))]
+#[cfg_attr(docsrs, doc(cfg(any(feature = "derive", feature = "full"))))]
 pub fn visit_expr_paren_mut<V>(v: &mut V, node: &mut crate::ExprParen)
 where
     V: VisitMut + ?Sized,
@@ -5614,7 +5614,7 @@ 
Files

     v.visit_expr_mut(&mut *node.expr);
 }
 #[cfg(any(feature = "derive", feature = "full"))]
-#[cfg_attr(doc_cfg, doc(cfg(any(feature = "derive", feature = "full"))))]
+#[cfg_attr(docsrs, doc(cfg(any(feature = "derive", feature = "full"))))]
 pub fn visit_expr_path_mut<V>(v: &mut V, node: &mut crate::ExprPath)
 where
     V: VisitMut + ?Sized,
@@ -5628,7 +5628,7 @@ 
Files

     v.visit_path_mut(&mut node.path);
 }
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "full")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "full")))]
 pub fn visit_expr_range_mut<V>(v: &mut V, node: &mut crate::ExprRange)
 where
     V: VisitMut + ?Sized,
@@ -5645,7 +5645,7 @@ 
Files

     }
 }
 #[cfg(any(feature = "derive", feature = "full"))]
-#[cfg_attr(doc_cfg, doc(cfg(any(feature = "derive", feature = "full"))))]
+#[cfg_attr(docsrs, doc(cfg(any(feature = "derive", feature = "full"))))]
 pub fn visit_expr_reference_mut<V>(v: &mut V, node: &mut crate::ExprReference)
 where
     V: VisitMut + ?Sized,
@@ -5658,7 +5658,7 @@ 
Files

     v.visit_expr_mut(&mut *node.expr);
 }
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "full")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "full")))]
 pub fn visit_expr_repeat_mut<V>(v: &mut V, node: &mut crate::ExprRepeat)
 where
     V: VisitMut + ?Sized,
@@ -5672,7 +5672,7 @@ 
Files

     v.visit_expr_mut(&mut *node.len);
 }
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "full")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "full")))]
 pub fn visit_expr_return_mut<V>(v: &mut V, node: &mut crate::ExprReturn)
 where
     V: VisitMut + ?Sized,
@@ -5686,7 +5686,7 @@ 
Files

     }
 }
 #[cfg(any(feature = "derive", feature = "full"))]
-#[cfg_attr(doc_cfg, doc(cfg(any(feature = "derive", feature = "full"))))]
+#[cfg_attr(docsrs, doc(cfg(any(feature = "derive", feature = "full"))))]
 pub fn visit_expr_struct_mut<V>(v: &mut V, node: &mut crate::ExprStruct)
 where
     V: VisitMut + ?Sized,
@@ -5709,7 +5709,7 @@ 
Files

     }
 }
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "full")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "full")))]
 pub fn visit_expr_try_mut<V>(v: &mut V, node: &mut crate::ExprTry)
 where
     V: VisitMut + ?Sized,
@@ -5721,7 +5721,7 @@ 
Files

     skip!(node.question_token);
 }
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "full")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "full")))]
 pub fn visit_expr_try_block_mut<V>(v: &mut V, node: &mut crate::ExprTryBlock)
 where
     V: VisitMut + ?Sized,
@@ -5733,7 +5733,7 @@ 
Files

     v.visit_block_mut(&mut node.block);
 }
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "full")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "full")))]
 pub fn visit_expr_tuple_mut<V>(v: &mut V, node: &mut crate::ExprTuple)
 where
     V: VisitMut + ?Sized,
@@ -5748,7 +5748,7 @@ 
Files

     }
 }
 #[cfg(any(feature = "derive", feature = "full"))]
-#[cfg_attr(doc_cfg, doc(cfg(any(feature = "derive", feature = "full"))))]
+#[cfg_attr(docsrs, doc(cfg(any(feature = "derive", feature = "full"))))]
 pub fn visit_expr_unary_mut<V>(v: &mut V, node: &mut crate::ExprUnary)
 where
     V: VisitMut + ?Sized,
@@ -5760,7 +5760,7 @@ 
Files

     v.visit_expr_mut(&mut *node.expr);
 }
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "full")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "full")))]
 pub fn visit_expr_unsafe_mut<V>(v: &mut V, node: &mut crate::ExprUnsafe)
 where
     V: VisitMut + ?Sized,
@@ -5772,7 +5772,7 @@ 
Files

     v.visit_block_mut(&mut node.block);
 }
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "full")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "full")))]
 pub fn visit_expr_while_mut<V>(v: &mut V, node: &mut crate::ExprWhile)
 where
     V: VisitMut + ?Sized,
@@ -5788,7 +5788,7 @@ 
Files

     v.visit_block_mut(&mut node.body);
 }
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "full")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "full")))]
 pub fn visit_expr_yield_mut<V>(v: &mut V, node: &mut crate::ExprYield)
 where
     V: VisitMut + ?Sized,
@@ -5802,7 +5802,7 @@ 
Files

     }
 }
 #[cfg(any(feature = "derive", feature = "full"))]
-#[cfg_attr(doc_cfg, doc(cfg(any(feature = "derive", feature = "full"))))]
+#[cfg_attr(docsrs, doc(cfg(any(feature = "derive", feature = "full"))))]
 pub fn visit_field_mut<V>(v: &mut V, node: &mut crate::Field)
 where
     V: VisitMut + ?Sized,
@@ -5819,7 +5819,7 @@ 
Files

     v.visit_type_mut(&mut node.ty);
 }
 #[cfg(any(feature = "derive", feature = "full"))]
-#[cfg_attr(doc_cfg, doc(cfg(any(feature = "derive", feature = "full"))))]
+#[cfg_attr(docsrs, doc(cfg(any(feature = "derive", feature = "full"))))]
 pub fn visit_field_mutability_mut<V>(v: &mut V, node: &mut crate::FieldMutability)
 where
     V: VisitMut + ?Sized,
@@ -5829,7 +5829,7 @@ 
Files

     }
 }
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "full")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "full")))]
 pub fn visit_field_pat_mut<V>(v: &mut V, node: &mut crate::FieldPat)
 where
     V: VisitMut + ?Sized,
@@ -5842,7 +5842,7 @@ 
Files

     v.visit_pat_mut(&mut *node.pat);
 }
 #[cfg(any(feature = "derive", feature = "full"))]
-#[cfg_attr(doc_cfg, doc(cfg(any(feature = "derive", feature = "full"))))]
+#[cfg_attr(docsrs, doc(cfg(any(feature = "derive", feature = "full"))))]
 pub fn visit_field_value_mut<V>(v: &mut V, node: &mut crate::FieldValue)
 where
     V: VisitMut + ?Sized,
@@ -5855,7 +5855,7 @@ 
Files

     v.visit_expr_mut(&mut node.expr);
 }
 #[cfg(any(feature = "derive", feature = "full"))]
-#[cfg_attr(doc_cfg, doc(cfg(any(feature = "derive", feature = "full"))))]
+#[cfg_attr(docsrs, doc(cfg(any(feature = "derive", feature = "full"))))]
 pub fn visit_fields_mut<V>(v: &mut V, node: &mut crate::Fields)
 where
     V: VisitMut + ?Sized,
@@ -5871,7 +5871,7 @@ 
Files

     }
 }
 #[cfg(any(feature = "derive", feature = "full"))]
-#[cfg_attr(doc_cfg, doc(cfg(any(feature = "derive", feature = "full"))))]
+#[cfg_attr(docsrs, doc(cfg(any(feature = "derive", feature = "full"))))]
 pub fn visit_fields_named_mut<V>(v: &mut V, node: &mut crate::FieldsNamed)
 where
     V: VisitMut + ?Sized,
@@ -5883,7 +5883,7 @@ 
Files

     }
 }
 #[cfg(any(feature = "derive", feature = "full"))]
-#[cfg_attr(doc_cfg, doc(cfg(any(feature = "derive", feature = "full"))))]
+#[cfg_attr(docsrs, doc(cfg(any(feature = "derive", feature = "full"))))]
 pub fn visit_fields_unnamed_mut<V>(v: &mut V, node: &mut crate::FieldsUnnamed)
 where
     V: VisitMut + ?Sized,
@@ -5895,7 +5895,7 @@ 
Files

     }
 }
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "full")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "full")))]
 pub fn visit_file_mut<V>(v: &mut V, node: &mut crate::File)
 where
     V: VisitMut + ?Sized,
@@ -5909,7 +5909,7 @@ 
Files

     }
 }
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "full")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "full")))]
 pub fn visit_fn_arg_mut<V>(v: &mut V, node: &mut crate::FnArg)
 where
     V: VisitMut + ?Sized,
@@ -5924,7 +5924,7 @@ 
Files

     }
 }
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "full")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "full")))]
 pub fn visit_foreign_item_mut<V>(v: &mut V, node: &mut crate::ForeignItem)
 where
     V: VisitMut + ?Sized,
@@ -5948,7 +5948,7 @@ 
Files

     }
 }
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "full")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "full")))]
 pub fn visit_foreign_item_fn_mut<V>(v: &mut V, node: &mut crate::ForeignItemFn)
 where
     V: VisitMut + ?Sized,
@@ -5961,7 +5961,7 @@ 
Files

     skip!(node.semi_token);
 }
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "full")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "full")))]
 pub fn visit_foreign_item_macro_mut<V>(v: &mut V, node: &mut crate::ForeignItemMacro)
 where
     V: VisitMut + ?Sized,
@@ -5973,7 +5973,7 @@ 
Files

     skip!(node.semi_token);
 }
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "full")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "full")))]
 pub fn visit_foreign_item_static_mut<V>(v: &mut V, node: &mut crate::ForeignItemStatic)
 where
     V: VisitMut + ?Sized,
@@ -5990,7 +5990,7 @@ 
Files

     skip!(node.semi_token);
 }
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "full")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "full")))]
 pub fn visit_foreign_item_type_mut<V>(v: &mut V, node: &mut crate::ForeignItemType)
 where
     V: VisitMut + ?Sized,
@@ -6005,7 +6005,7 @@ 
Files

     skip!(node.semi_token);
 }
 #[cfg(any(feature = "derive", feature = "full"))]
-#[cfg_attr(doc_cfg, doc(cfg(any(feature = "derive", feature = "full"))))]
+#[cfg_attr(docsrs, doc(cfg(any(feature = "derive", feature = "full"))))]
 pub fn visit_generic_argument_mut<V>(v: &mut V, node: &mut crate::GenericArgument)
 where
     V: VisitMut + ?Sized,
@@ -6032,7 +6032,7 @@ 
Files

     }
 }
 #[cfg(any(feature = "derive", feature = "full"))]
-#[cfg_attr(doc_cfg, doc(cfg(any(feature = "derive", feature = "full"))))]
+#[cfg_attr(docsrs, doc(cfg(any(feature = "derive", feature = "full"))))]
 pub fn visit_generic_param_mut<V>(v: &mut V, node: &mut crate::GenericParam)
 where
     V: VisitMut + ?Sized,
@@ -6050,7 +6050,7 @@ 
Files

     }
 }
 #[cfg(any(feature = "derive", feature = "full"))]
-#[cfg_attr(doc_cfg, doc(cfg(any(feature = "derive", feature = "full"))))]
+#[cfg_attr(docsrs, doc(cfg(any(feature = "derive", feature = "full"))))]
 pub fn visit_generics_mut<V>(v: &mut V, node: &mut crate::Generics)
 where
     V: VisitMut + ?Sized,
@@ -6074,7 +6074,7 @@ 
Files

     node.set_span(span);
 }
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "full")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "full")))]
 pub fn visit_impl_item_mut<V>(v: &mut V, node: &mut crate::ImplItem)
 where
     V: VisitMut + ?Sized,
@@ -6098,7 +6098,7 @@ 
Files

     }
 }
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "full")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "full")))]
 pub fn visit_impl_item_const_mut<V>(v: &mut V, node: &mut crate::ImplItemConst)
 where
     V: VisitMut + ?Sized,
@@ -6118,7 +6118,7 @@ 
Files

     skip!(node.semi_token);
 }
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "full")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "full")))]
 pub fn visit_impl_item_fn_mut<V>(v: &mut V, node: &mut crate::ImplItemFn)
 where
     V: VisitMut + ?Sized,
@@ -6132,7 +6132,7 @@ 
Files

     v.visit_block_mut(&mut node.block);
 }
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "full")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "full")))]
 pub fn visit_impl_item_macro_mut<V>(v: &mut V, node: &mut crate::ImplItemMacro)
 where
     V: VisitMut + ?Sized,
@@ -6144,7 +6144,7 @@ 
Files

     skip!(node.semi_token);
 }
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "full")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "full")))]
 pub fn visit_impl_item_type_mut<V>(v: &mut V, node: &mut crate::ImplItemType)
 where
     V: VisitMut + ?Sized,
@@ -6162,7 +6162,7 @@ 
Files

     skip!(node.semi_token);
 }
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "full")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "full")))]
 pub fn visit_impl_restriction_mut<V>(v: &mut V, node: &mut crate::ImplRestriction)
 where
     V: VisitMut + ?Sized,
@@ -6170,7 +6170,7 @@ 
Files

     match *node {}
 }
 #[cfg(any(feature = "derive", feature = "full"))]
-#[cfg_attr(doc_cfg, doc(cfg(any(feature = "derive", feature = "full"))))]
+#[cfg_attr(docsrs, doc(cfg(any(feature = "derive", feature = "full"))))]
 pub fn visit_index_mut<V>(v: &mut V, node: &mut crate::Index)
 where
     V: VisitMut + ?Sized,
@@ -6179,7 +6179,7 @@ 
Files

     v.visit_span_mut(&mut node.span);
 }
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "full")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "full")))]
 pub fn visit_item_mut<V>(v: &mut V, node: &mut crate::Item)
 where
     V: VisitMut + ?Sized,
@@ -6236,7 +6236,7 @@ 
Files

     }
 }
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "full")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "full")))]
 pub fn visit_item_const_mut<V>(v: &mut V, node: &mut crate::ItemConst)
 where
     V: VisitMut + ?Sized,
@@ -6255,7 +6255,7 @@ 
Files

     skip!(node.semi_token);
 }
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "full")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "full")))]
 pub fn visit_item_enum_mut<V>(v: &mut V, node: &mut crate::ItemEnum)
 where
     V: VisitMut + ?Sized,
@@ -6274,7 +6274,7 @@ 
Files

     }
 }
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "full")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "full")))]
 pub fn visit_item_extern_crate_mut<V>(v: &mut V, node: &mut crate::ItemExternCrate)
 where
     V: VisitMut + ?Sized,
@@ -6293,7 +6293,7 @@ 
Files

     skip!(node.semi_token);
 }
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "full")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "full")))]
 pub fn visit_item_fn_mut<V>(v: &mut V, node: &mut crate::ItemFn)
 where
     V: VisitMut + ?Sized,
@@ -6306,7 +6306,7 @@ 
Files

     v.visit_block_mut(&mut *node.block);
 }
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "full")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "full")))]
 pub fn visit_item_foreign_mod_mut<V>(v: &mut V, node: &mut crate::ItemForeignMod)
 where
     V: VisitMut + ?Sized,
@@ -6322,7 +6322,7 @@ 
Files

     }
 }
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "full")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "full")))]
 pub fn visit_item_impl_mut<V>(v: &mut V, node: &mut crate::ItemImpl)
 where
     V: VisitMut + ?Sized,
@@ -6346,7 +6346,7 @@ 
Files

     }
 }
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "full")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "full")))]
 pub fn visit_item_macro_mut<V>(v: &mut V, node: &mut crate::ItemMacro)
 where
     V: VisitMut + ?Sized,
@@ -6361,7 +6361,7 @@ 
Files

     skip!(node.semi_token);
 }
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "full")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "full")))]
 pub fn visit_item_mod_mut<V>(v: &mut V, node: &mut crate::ItemMod)
 where
     V: VisitMut + ?Sized,
@@ -6382,7 +6382,7 @@ 
Files

     skip!(node.semi);
 }
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "full")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "full")))]
 pub fn visit_item_static_mut<V>(v: &mut V, node: &mut crate::ItemStatic)
 where
     V: VisitMut + ?Sized,
@@ -6401,7 +6401,7 @@ 
Files

     skip!(node.semi_token);
 }
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "full")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "full")))]
 pub fn visit_item_struct_mut<V>(v: &mut V, node: &mut crate::ItemStruct)
 where
     V: VisitMut + ?Sized,
@@ -6417,7 +6417,7 @@ 
Files

     skip!(node.semi_token);
 }
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "full")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "full")))]
 pub fn visit_item_trait_mut<V>(v: &mut V, node: &mut crate::ItemTrait)
 where
     V: VisitMut + ?Sized,
@@ -6445,7 +6445,7 @@ 
Files

     }
 }
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "full")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "full")))]
 pub fn visit_item_trait_alias_mut<V>(v: &mut V, node: &mut crate::ItemTraitAlias)
 where
     V: VisitMut + ?Sized,
@@ -6465,7 +6465,7 @@ 
Files

     skip!(node.semi_token);
 }
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "full")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "full")))]
 pub fn visit_item_type_mut<V>(v: &mut V, node: &mut crate::ItemType)
 where
     V: VisitMut + ?Sized,
@@ -6482,7 +6482,7 @@ 
Files

     skip!(node.semi_token);
 }
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "full")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "full")))]
 pub fn visit_item_union_mut<V>(v: &mut V, node: &mut crate::ItemUnion)
 where
     V: VisitMut + ?Sized,
@@ -6497,7 +6497,7 @@ 
Files

     v.visit_fields_named_mut(&mut node.fields);
 }
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "full")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "full")))]
 pub fn visit_item_use_mut<V>(v: &mut V, node: &mut crate::ItemUse)
 where
     V: VisitMut + ?Sized,
@@ -6512,7 +6512,7 @@ 
Files

     skip!(node.semi_token);
 }
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "full")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "full")))]
 pub fn visit_label_mut<V>(v: &mut V, node: &mut crate::Label)
 where
     V: VisitMut + ?Sized,
@@ -6528,7 +6528,7 @@ 
Files

     v.visit_ident_mut(&mut node.ident);
 }
 #[cfg(any(feature = "derive", feature = "full"))]
-#[cfg_attr(doc_cfg, doc(cfg(any(feature = "derive", feature = "full"))))]
+#[cfg_attr(docsrs, doc(cfg(any(feature = "derive", feature = "full"))))]
 pub fn visit_lifetime_param_mut<V>(v: &mut V, node: &mut crate::LifetimeParam)
 where
     V: VisitMut + ?Sized,
@@ -6613,7 +6613,7 @@ 
Files

     V: VisitMut + ?Sized,
 {}
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "full")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "full")))]
 pub fn visit_local_mut<V>(v: &mut V, node: &mut crate::Local)
 where
     V: VisitMut + ?Sized,
@@ -6629,7 +6629,7 @@ 
Files

     skip!(node.semi_token);
 }
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "full")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "full")))]
 pub fn visit_local_init_mut<V>(v: &mut V, node: &mut crate::LocalInit)
 where
     V: VisitMut + ?Sized,
@@ -6642,7 +6642,7 @@ 
Files

     }
 }
 #[cfg(any(feature = "derive", feature = "full"))]
-#[cfg_attr(doc_cfg, doc(cfg(any(feature = "derive", feature = "full"))))]
+#[cfg_attr(docsrs, doc(cfg(any(feature = "derive", feature = "full"))))]
 pub fn visit_macro_mut<V>(v: &mut V, node: &mut crate::Macro)
 where
     V: VisitMut + ?Sized,
@@ -6653,7 +6653,7 @@ 
Files

     skip!(node.tokens);
 }
 #[cfg(any(feature = "derive", feature = "full"))]
-#[cfg_attr(doc_cfg, doc(cfg(any(feature = "derive", feature = "full"))))]
+#[cfg_attr(docsrs, doc(cfg(any(feature = "derive", feature = "full"))))]
 pub fn visit_macro_delimiter_mut<V>(v: &mut V, node: &mut crate::MacroDelimiter)
 where
     V: VisitMut + ?Sized,
@@ -6671,7 +6671,7 @@ 
Files

     }
 }
 #[cfg(any(feature = "derive", feature = "full"))]
-#[cfg_attr(doc_cfg, doc(cfg(any(feature = "derive", feature = "full"))))]
+#[cfg_attr(docsrs, doc(cfg(any(feature = "derive", feature = "full"))))]
 pub fn visit_member_mut<V>(v: &mut V, node: &mut crate::Member)
 where
     V: VisitMut + ?Sized,
@@ -6686,7 +6686,7 @@ 
Files

     }
 }
 #[cfg(any(feature = "derive", feature = "full"))]
-#[cfg_attr(doc_cfg, doc(cfg(any(feature = "derive", feature = "full"))))]
+#[cfg_attr(docsrs, doc(cfg(any(feature = "derive", feature = "full"))))]
 pub fn visit_meta_mut<V>(v: &mut V, node: &mut crate::Meta)
 where
     V: VisitMut + ?Sized,
@@ -6704,7 +6704,7 @@ 
Files

     }
 }
 #[cfg(any(feature = "derive", feature = "full"))]
-#[cfg_attr(doc_cfg, doc(cfg(any(feature = "derive", feature = "full"))))]
+#[cfg_attr(docsrs, doc(cfg(any(feature = "derive", feature = "full"))))]
 pub fn visit_meta_list_mut<V>(v: &mut V, node: &mut crate::MetaList)
 where
     V: VisitMut + ?Sized,
@@ -6714,7 +6714,7 @@ 
Files

     skip!(node.tokens);
 }
 #[cfg(any(feature = "derive", feature = "full"))]
-#[cfg_attr(doc_cfg, doc(cfg(any(feature = "derive", feature = "full"))))]
+#[cfg_attr(docsrs, doc(cfg(any(feature = "derive", feature = "full"))))]
 pub fn visit_meta_name_value_mut<V>(v: &mut V, node: &mut crate::MetaNameValue)
 where
     V: VisitMut + ?Sized,
@@ -6724,7 +6724,7 @@ 
Files

     v.visit_expr_mut(&mut node.value);
 }
 #[cfg(any(feature = "derive", feature = "full"))]
-#[cfg_attr(doc_cfg, doc(cfg(any(feature = "derive", feature = "full"))))]
+#[cfg_attr(docsrs, doc(cfg(any(feature = "derive", feature = "full"))))]
 pub fn visit_parenthesized_generic_arguments_mut<V>(
     v: &mut V,
     node: &mut crate::ParenthesizedGenericArguments,
@@ -6740,7 +6740,7 @@ 
Files

     v.visit_return_type_mut(&mut node.output);
 }
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "full")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "full")))]
 pub fn visit_pat_mut<V>(v: &mut V, node: &mut crate::Pat)
 where
     V: VisitMut + ?Sized,
@@ -6800,7 +6800,7 @@ 
Files

     }
 }
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "full")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "full")))]
 pub fn visit_pat_ident_mut<V>(v: &mut V, node: &mut crate::PatIdent)
 where
     V: VisitMut + ?Sized,
@@ -6817,7 +6817,7 @@ 
Files

     }
 }
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "full")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "full")))]
 pub fn visit_pat_or_mut<V>(v: &mut V, node: &mut crate::PatOr)
 where
     V: VisitMut + ?Sized,
@@ -6832,7 +6832,7 @@ 
Files

     }
 }
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "full")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "full")))]
 pub fn visit_pat_paren_mut<V>(v: &mut V, node: &mut crate::PatParen)
 where
     V: VisitMut + ?Sized,
@@ -6844,7 +6844,7 @@ 
Files

     v.visit_pat_mut(&mut *node.pat);
 }
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "full")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "full")))]
 pub fn visit_pat_reference_mut<V>(v: &mut V, node: &mut crate::PatReference)
 where
     V: VisitMut + ?Sized,
@@ -6857,7 +6857,7 @@ 
Files

     v.visit_pat_mut(&mut *node.pat);
 }
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "full")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "full")))]
 pub fn visit_pat_rest_mut<V>(v: &mut V, node: &mut crate::PatRest)
 where
     V: VisitMut + ?Sized,
@@ -6868,7 +6868,7 @@ 
Files

     skip!(node.dot2_token);
 }
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "full")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "full")))]
 pub fn visit_pat_slice_mut<V>(v: &mut V, node: &mut crate::PatSlice)
 where
     V: VisitMut + ?Sized,
@@ -6883,7 +6883,7 @@ 
Files

     }
 }
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "full")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "full")))]
 pub fn visit_pat_struct_mut<V>(v: &mut V, node: &mut crate::PatStruct)
 where
     V: VisitMut + ?Sized,
@@ -6905,7 +6905,7 @@ 
Files

     }
 }
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "full")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "full")))]
 pub fn visit_pat_tuple_mut<V>(v: &mut V, node: &mut crate::PatTuple)
 where
     V: VisitMut + ?Sized,
@@ -6920,7 +6920,7 @@ 
Files

     }
 }
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "full")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "full")))]
 pub fn visit_pat_tuple_struct_mut<V>(v: &mut V, node: &mut crate::PatTupleStruct)
 where
     V: VisitMut + ?Sized,
@@ -6939,7 +6939,7 @@ 
Files

     }
 }
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "full")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "full")))]
 pub fn visit_pat_type_mut<V>(v: &mut V, node: &mut crate::PatType)
 where
     V: VisitMut + ?Sized,
@@ -6952,7 +6952,7 @@ 
Files

     v.visit_type_mut(&mut *node.ty);
 }
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "full")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "full")))]
 pub fn visit_pat_wild_mut<V>(v: &mut V, node: &mut crate::PatWild)
 where
     V: VisitMut + ?Sized,
@@ -6963,7 +6963,7 @@ 
Files

     skip!(node.underscore_token);
 }
 #[cfg(any(feature = "derive", feature = "full"))]
-#[cfg_attr(doc_cfg, doc(cfg(any(feature = "derive", feature = "full"))))]
+#[cfg_attr(docsrs, doc(cfg(any(feature = "derive", feature = "full"))))]
 pub fn visit_path_mut<V>(v: &mut V, node: &mut crate::Path)
 where
     V: VisitMut + ?Sized,
@@ -6975,7 +6975,7 @@ 
Files

     }
 }
 #[cfg(any(feature = "derive", feature = "full"))]
-#[cfg_attr(doc_cfg, doc(cfg(any(feature = "derive", feature = "full"))))]
+#[cfg_attr(docsrs, doc(cfg(any(feature = "derive", feature = "full"))))]
 pub fn visit_path_arguments_mut<V>(v: &mut V, node: &mut crate::PathArguments)
 where
     V: VisitMut + ?Sized,
@@ -6991,7 +6991,7 @@ 
Files

     }
 }
 #[cfg(any(feature = "derive", feature = "full"))]
-#[cfg_attr(doc_cfg, doc(cfg(any(feature = "derive", feature = "full"))))]
+#[cfg_attr(docsrs, doc(cfg(any(feature = "derive", feature = "full"))))]
 pub fn visit_path_segment_mut<V>(v: &mut V, node: &mut crate::PathSegment)
 where
     V: VisitMut + ?Sized,
@@ -7000,7 +7000,7 @@ 
Files

     v.visit_path_arguments_mut(&mut node.arguments);
 }
 #[cfg(any(feature = "derive", feature = "full"))]
-#[cfg_attr(doc_cfg, doc(cfg(any(feature = "derive", feature = "full"))))]
+#[cfg_attr(docsrs, doc(cfg(any(feature = "derive", feature = "full"))))]
 pub fn visit_predicate_lifetime_mut<V>(v: &mut V, node: &mut crate::PredicateLifetime)
 where
     V: VisitMut + ?Sized,
@@ -7013,7 +7013,7 @@ 
Files

     }
 }
 #[cfg(any(feature = "derive", feature = "full"))]
-#[cfg_attr(doc_cfg, doc(cfg(any(feature = "derive", feature = "full"))))]
+#[cfg_attr(docsrs, doc(cfg(any(feature = "derive", feature = "full"))))]
 pub fn visit_predicate_type_mut<V>(v: &mut V, node: &mut crate::PredicateType)
 where
     V: VisitMut + ?Sized,
@@ -7029,7 +7029,7 @@ 
Files

     }
 }
 #[cfg(any(feature = "derive", feature = "full"))]
-#[cfg_attr(doc_cfg, doc(cfg(any(feature = "derive", feature = "full"))))]
+#[cfg_attr(docsrs, doc(cfg(any(feature = "derive", feature = "full"))))]
 pub fn visit_qself_mut<V>(v: &mut V, node: &mut crate::QSelf)
 where
     V: VisitMut + ?Sized,
@@ -7041,7 +7041,7 @@ 
Files

     skip!(node.gt_token);
 }
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "full")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "full")))]
 pub fn visit_range_limits_mut<V>(v: &mut V, node: &mut crate::RangeLimits)
 where
     V: VisitMut + ?Sized,
@@ -7056,7 +7056,7 @@ 
Files

     }
 }
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "full")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "full")))]
 pub fn visit_receiver_mut<V>(v: &mut V, node: &mut crate::Receiver)
 where
     V: VisitMut + ?Sized,
@@ -7076,7 +7076,7 @@ 
Files

     v.visit_type_mut(&mut *node.ty);
 }
 #[cfg(any(feature = "derive", feature = "full"))]
-#[cfg_attr(doc_cfg, doc(cfg(any(feature = "derive", feature = "full"))))]
+#[cfg_attr(docsrs, doc(cfg(any(feature = "derive", feature = "full"))))]
 pub fn visit_return_type_mut<V>(v: &mut V, node: &mut crate::ReturnType)
 where
     V: VisitMut + ?Sized,
@@ -7090,7 +7090,7 @@ 
Files

     }
 }
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "full")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "full")))]
 pub fn visit_signature_mut<V>(v: &mut V, node: &mut crate::Signature)
 where
     V: VisitMut + ?Sized,
@@ -7119,7 +7119,7 @@ 
Files

     V: VisitMut + ?Sized,
 {}
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "full")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "full")))]
 pub fn visit_static_mutability_mut<V>(v: &mut V, node: &mut crate::StaticMutability)
 where
     V: VisitMut + ?Sized,
@@ -7132,7 +7132,7 @@ 
Files

     }
 }
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "full")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "full")))]
 pub fn visit_stmt_mut<V>(v: &mut V, node: &mut crate::Stmt)
 where
     V: VisitMut + ?Sized,
@@ -7154,7 +7154,7 @@ 
Files

     }
 }
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "full")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "full")))]
 pub fn visit_stmt_macro_mut<V>(v: &mut V, node: &mut crate::StmtMacro)
 where
     V: VisitMut + ?Sized,
@@ -7166,7 +7166,7 @@ 
Files

     skip!(node.semi_token);
 }
 #[cfg(any(feature = "derive", feature = "full"))]
-#[cfg_attr(doc_cfg, doc(cfg(any(feature = "derive", feature = "full"))))]
+#[cfg_attr(docsrs, doc(cfg(any(feature = "derive", feature = "full"))))]
 pub fn visit_trait_bound_mut<V>(v: &mut V, node: &mut crate::TraitBound)
 where
     V: VisitMut + ?Sized,
@@ -7179,7 +7179,7 @@ 
Files

     v.visit_path_mut(&mut node.path);
 }
 #[cfg(any(feature = "derive", feature = "full"))]
-#[cfg_attr(doc_cfg, doc(cfg(any(feature = "derive", feature = "full"))))]
+#[cfg_attr(docsrs, doc(cfg(any(feature = "derive", feature = "full"))))]
 pub fn visit_trait_bound_modifier_mut<V>(v: &mut V, node: &mut crate::TraitBoundModifier)
 where
     V: VisitMut + ?Sized,
@@ -7192,7 +7192,7 @@ 
Files

     }
 }
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "full")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "full")))]
 pub fn visit_trait_item_mut<V>(v: &mut V, node: &mut crate::TraitItem)
 where
     V: VisitMut + ?Sized,
@@ -7216,7 +7216,7 @@ 
Files

     }
 }
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "full")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "full")))]
 pub fn visit_trait_item_const_mut<V>(v: &mut V, node: &mut crate::TraitItemConst)
 where
     V: VisitMut + ?Sized,
@@ -7236,7 +7236,7 @@ 
Files

     skip!(node.semi_token);
 }
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "full")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "full")))]
 pub fn visit_trait_item_fn_mut<V>(v: &mut V, node: &mut crate::TraitItemFn)
 where
     V: VisitMut + ?Sized,
@@ -7251,7 +7251,7 @@ 
Files

     skip!(node.semi_token);
 }
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "full")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "full")))]
 pub fn visit_trait_item_macro_mut<V>(v: &mut V, node: &mut crate::TraitItemMacro)
 where
     V: VisitMut + ?Sized,
@@ -7263,7 +7263,7 @@ 
Files

     skip!(node.semi_token);
 }
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "full")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "full")))]
 pub fn visit_trait_item_type_mut<V>(v: &mut V, node: &mut crate::TraitItemType)
 where
     V: VisitMut + ?Sized,
@@ -7286,7 +7286,7 @@ 
Files

     skip!(node.semi_token);
 }
 #[cfg(any(feature = "derive", feature = "full"))]
-#[cfg_attr(doc_cfg, doc(cfg(any(feature = "derive", feature = "full"))))]
+#[cfg_attr(docsrs, doc(cfg(any(feature = "derive", feature = "full"))))]
 pub fn visit_type_mut<V>(v: &mut V, node: &mut crate::Type)
 where
     V: VisitMut + ?Sized,
@@ -7340,7 +7340,7 @@ 
Files

     }
 }
 #[cfg(any(feature = "derive", feature = "full"))]
-#[cfg_attr(doc_cfg, doc(cfg(any(feature = "derive", feature = "full"))))]
+#[cfg_attr(docsrs, doc(cfg(any(feature = "derive", feature = "full"))))]
 pub fn visit_type_array_mut<V>(v: &mut V, node: &mut crate::TypeArray)
 where
     V: VisitMut + ?Sized,
@@ -7351,7 +7351,7 @@ 
Files

     v.visit_expr_mut(&mut node.len);
 }
 #[cfg(any(feature = "derive", feature = "full"))]
-#[cfg_attr(doc_cfg, doc(cfg(any(feature = "derive", feature = "full"))))]
+#[cfg_attr(docsrs, doc(cfg(any(feature = "derive", feature = "full"))))]
 pub fn visit_type_bare_fn_mut<V>(v: &mut V, node: &mut crate::TypeBareFn)
 where
     V: VisitMut + ?Sized,
@@ -7375,7 +7375,7 @@ 
Files

     v.visit_return_type_mut(&mut node.output);
 }
 #[cfg(any(feature = "derive", feature = "full"))]
-#[cfg_attr(doc_cfg, doc(cfg(any(feature = "derive", feature = "full"))))]
+#[cfg_attr(docsrs, doc(cfg(any(feature = "derive", feature = "full"))))]
 pub fn visit_type_group_mut<V>(v: &mut V, node: &mut crate::TypeGroup)
 where
     V: VisitMut + ?Sized,
@@ -7384,7 +7384,7 @@ 
Files

     v.visit_type_mut(&mut *node.elem);
 }
 #[cfg(any(feature = "derive", feature = "full"))]
-#[cfg_attr(doc_cfg, doc(cfg(any(feature = "derive", feature = "full"))))]
+#[cfg_attr(docsrs, doc(cfg(any(feature = "derive", feature = "full"))))]
 pub fn visit_type_impl_trait_mut<V>(v: &mut V, node: &mut crate::TypeImplTrait)
 where
     V: VisitMut + ?Sized,
@@ -7396,7 +7396,7 @@ 
Files

     }
 }
 #[cfg(any(feature = "derive", feature = "full"))]
-#[cfg_attr(doc_cfg, doc(cfg(any(feature = "derive", feature = "full"))))]
+#[cfg_attr(docsrs, doc(cfg(any(feature = "derive", feature = "full"))))]
 pub fn visit_type_infer_mut<V>(v: &mut V, node: &mut crate::TypeInfer)
 where
     V: VisitMut + ?Sized,
@@ -7404,7 +7404,7 @@ 
Files

     skip!(node.underscore_token);
 }
 #[cfg(any(feature = "derive", feature = "full"))]
-#[cfg_attr(doc_cfg, doc(cfg(any(feature = "derive", feature = "full"))))]
+#[cfg_attr(docsrs, doc(cfg(any(feature = "derive", feature = "full"))))]
 pub fn visit_type_macro_mut<V>(v: &mut V, node: &mut crate::TypeMacro)
 where
     V: VisitMut + ?Sized,
@@ -7412,7 +7412,7 @@ 
Files

     v.visit_macro_mut(&mut node.mac);
 }
 #[cfg(any(feature = "derive", feature = "full"))]
-#[cfg_attr(doc_cfg, doc(cfg(any(feature = "derive", feature = "full"))))]
+#[cfg_attr(docsrs, doc(cfg(any(feature = "derive", feature = "full"))))]
 pub fn visit_type_never_mut<V>(v: &mut V, node: &mut crate::TypeNever)
 where
     V: VisitMut + ?Sized,
@@ -7420,7 +7420,7 @@ 
Files

     skip!(node.bang_token);
 }
 #[cfg(any(feature = "derive", feature = "full"))]
-#[cfg_attr(doc_cfg, doc(cfg(any(feature = "derive", feature = "full"))))]
+#[cfg_attr(docsrs, doc(cfg(any(feature = "derive", feature = "full"))))]
 pub fn visit_type_param_mut<V>(v: &mut V, node: &mut crate::TypeParam)
 where
     V: VisitMut + ?Sized,
@@ -7440,7 +7440,7 @@ 
Files

     }
 }
 #[cfg(any(feature = "derive", feature = "full"))]
-#[cfg_attr(doc_cfg, doc(cfg(any(feature = "derive", feature = "full"))))]
+#[cfg_attr(docsrs, doc(cfg(any(feature = "derive", feature = "full"))))]
 pub fn visit_type_param_bound_mut<V>(v: &mut V, node: &mut crate::TypeParamBound)
 where
     V: VisitMut + ?Sized,
@@ -7458,7 +7458,7 @@ 
Files

     }
 }
 #[cfg(any(feature = "derive", feature = "full"))]
-#[cfg_attr(doc_cfg, doc(cfg(any(feature = "derive", feature = "full"))))]
+#[cfg_attr(docsrs, doc(cfg(any(feature = "derive", feature = "full"))))]
 pub fn visit_type_paren_mut<V>(v: &mut V, node: &mut crate::TypeParen)
 where
     V: VisitMut + ?Sized,
@@ -7467,7 +7467,7 @@ 
Files

     v.visit_type_mut(&mut *node.elem);
 }
 #[cfg(any(feature = "derive", feature = "full"))]
-#[cfg_attr(doc_cfg, doc(cfg(any(feature = "derive", feature = "full"))))]
+#[cfg_attr(docsrs, doc(cfg(any(feature = "derive", feature = "full"))))]
 pub fn visit_type_path_mut<V>(v: &mut V, node: &mut crate::TypePath)
 where
     V: VisitMut + ?Sized,
@@ -7478,7 +7478,7 @@ 
Files

     v.visit_path_mut(&mut node.path);
 }
 #[cfg(any(feature = "derive", feature = "full"))]
-#[cfg_attr(doc_cfg, doc(cfg(any(feature = "derive", feature = "full"))))]
+#[cfg_attr(docsrs, doc(cfg(any(feature = "derive", feature = "full"))))]
 pub fn visit_type_ptr_mut<V>(v: &mut V, node: &mut crate::TypePtr)
 where
     V: VisitMut + ?Sized,
@@ -7489,7 +7489,7 @@ 
Files

     v.visit_type_mut(&mut *node.elem);
 }
 #[cfg(any(feature = "derive", feature = "full"))]
-#[cfg_attr(doc_cfg, doc(cfg(any(feature = "derive", feature = "full"))))]
+#[cfg_attr(docsrs, doc(cfg(any(feature = "derive", feature = "full"))))]
 pub fn visit_type_reference_mut<V>(v: &mut V, node: &mut crate::TypeReference)
 where
     V: VisitMut + ?Sized,
@@ -7502,7 +7502,7 @@ 
Files

     v.visit_type_mut(&mut *node.elem);
 }
 #[cfg(any(feature = "derive", feature = "full"))]
-#[cfg_attr(doc_cfg, doc(cfg(any(feature = "derive", feature = "full"))))]
+#[cfg_attr(docsrs, doc(cfg(any(feature = "derive", feature = "full"))))]
 pub fn visit_type_slice_mut<V>(v: &mut V, node: &mut crate::TypeSlice)
 where
     V: VisitMut + ?Sized,
@@ -7511,7 +7511,7 @@ 
Files

     v.visit_type_mut(&mut *node.elem);
 }
 #[cfg(any(feature = "derive", feature = "full"))]
-#[cfg_attr(doc_cfg, doc(cfg(any(feature = "derive", feature = "full"))))]
+#[cfg_attr(docsrs, doc(cfg(any(feature = "derive", feature = "full"))))]
 pub fn visit_type_trait_object_mut<V>(v: &mut V, node: &mut crate::TypeTraitObject)
 where
     V: VisitMut + ?Sized,
@@ -7523,7 +7523,7 @@ 
Files

     }
 }
 #[cfg(any(feature = "derive", feature = "full"))]
-#[cfg_attr(doc_cfg, doc(cfg(any(feature = "derive", feature = "full"))))]
+#[cfg_attr(docsrs, doc(cfg(any(feature = "derive", feature = "full"))))]
 pub fn visit_type_tuple_mut<V>(v: &mut V, node: &mut crate::TypeTuple)
 where
     V: VisitMut + ?Sized,
@@ -7535,7 +7535,7 @@ 
Files

     }
 }
 #[cfg(any(feature = "derive", feature = "full"))]
-#[cfg_attr(doc_cfg, doc(cfg(any(feature = "derive", feature = "full"))))]
+#[cfg_attr(docsrs, doc(cfg(any(feature = "derive", feature = "full"))))]
 pub fn visit_un_op_mut<V>(v: &mut V, node: &mut crate::UnOp)
 where
     V: VisitMut + ?Sized,
@@ -7553,7 +7553,7 @@ 
Files

     }
 }
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "full")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "full")))]
 pub fn visit_use_glob_mut<V>(v: &mut V, node: &mut crate::UseGlob)
 where
     V: VisitMut + ?Sized,
@@ -7561,7 +7561,7 @@ 
Files

     skip!(node.star_token);
 }
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "full")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "full")))]
 pub fn visit_use_group_mut<V>(v: &mut V, node: &mut crate::UseGroup)
 where
     V: VisitMut + ?Sized,
@@ -7573,7 +7573,7 @@ 
Files

     }
 }
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "full")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "full")))]
 pub fn visit_use_name_mut<V>(v: &mut V, node: &mut crate::UseName)
 where
     V: VisitMut + ?Sized,
@@ -7581,7 +7581,7 @@ 
Files

     v.visit_ident_mut(&mut node.ident);
 }
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "full")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "full")))]
 pub fn visit_use_path_mut<V>(v: &mut V, node: &mut crate::UsePath)
 where
     V: VisitMut + ?Sized,
@@ -7591,7 +7591,7 @@ 
Files

     v.visit_use_tree_mut(&mut *node.tree);
 }
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "full")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "full")))]
 pub fn visit_use_rename_mut<V>(v: &mut V, node: &mut crate::UseRename)
 where
     V: VisitMut + ?Sized,
@@ -7601,7 +7601,7 @@ 
Files

     v.visit_ident_mut(&mut node.rename);
 }
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "full")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "full")))]
 pub fn visit_use_tree_mut<V>(v: &mut V, node: &mut crate::UseTree)
 where
     V: VisitMut + ?Sized,
@@ -7625,7 +7625,7 @@ 
Files

     }
 }
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "full")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "full")))]
 pub fn visit_variadic_mut<V>(v: &mut V, node: &mut crate::Variadic)
 where
     V: VisitMut + ?Sized,
@@ -7641,7 +7641,7 @@ 
Files

     skip!(node.comma);
 }
 #[cfg(any(feature = "derive", feature = "full"))]
-#[cfg_attr(doc_cfg, doc(cfg(any(feature = "derive", feature = "full"))))]
+#[cfg_attr(docsrs, doc(cfg(any(feature = "derive", feature = "full"))))]
 pub fn visit_variant_mut<V>(v: &mut V, node: &mut crate::Variant)
 where
     V: VisitMut + ?Sized,
@@ -7657,7 +7657,7 @@ 
Files

     }
 }
 #[cfg(any(feature = "derive", feature = "full"))]
-#[cfg_attr(doc_cfg, doc(cfg(any(feature = "derive", feature = "full"))))]
+#[cfg_attr(docsrs, doc(cfg(any(feature = "derive", feature = "full"))))]
 pub fn visit_vis_restricted_mut<V>(v: &mut V, node: &mut crate::VisRestricted)
 where
     V: VisitMut + ?Sized,
@@ -7668,7 +7668,7 @@ 
Files

     v.visit_path_mut(&mut *node.path);
 }
 #[cfg(any(feature = "derive", feature = "full"))]
-#[cfg_attr(doc_cfg, doc(cfg(any(feature = "derive", feature = "full"))))]
+#[cfg_attr(docsrs, doc(cfg(any(feature = "derive", feature = "full"))))]
 pub fn visit_visibility_mut<V>(v: &mut V, node: &mut crate::Visibility)
 where
     V: VisitMut + ?Sized,
@@ -7684,7 +7684,7 @@ 
Files

     }
 }
 #[cfg(any(feature = "derive", feature = "full"))]
-#[cfg_attr(doc_cfg, doc(cfg(any(feature = "derive", feature = "full"))))]
+#[cfg_attr(docsrs, doc(cfg(any(feature = "derive", feature = "full"))))]
 pub fn visit_where_clause_mut<V>(v: &mut V, node: &mut crate::WhereClause)
 where
     V: VisitMut + ?Sized,
@@ -7696,7 +7696,7 @@ 
Files

     }
 }
 #[cfg(any(feature = "derive", feature = "full"))]
-#[cfg_attr(doc_cfg, doc(cfg(any(feature = "derive", feature = "full"))))]
+#[cfg_attr(docsrs, doc(cfg(any(feature = "derive", feature = "full"))))]
 pub fn visit_where_predicate_mut<V>(v: &mut V, node: &mut crate::WherePredicate)
 where
     V: VisitMut + ?Sized,
diff --git a/src/syn/gen_helper.rs.html b/src/syn/gen_helper.rs.html
deleted file mode 100644
index 19233521e3..0000000000
--- a/src/syn/gen_helper.rs.html
+++ /dev/null
@@ -1,71 +0,0 @@
-gen_helper.rs - source

-    
1
-2
-3
-4
-5
-6
-7
-8
-9
-10
-11
-12
-13
-14
-15
-16
-17
-18
-19
-20
-21
-22
-23
-24
-25
-26
-27
-28
-29
-30
-31
-32
-33
-34
-
#[cfg(feature = "fold")]
-pub(crate) mod fold {
-    use crate::punctuated::{Pair, Punctuated};
-
-    pub(crate) trait FoldHelper {
-        type Item;
-        fn lift<F>(self, f: F) -> Self
-        where
-            F: FnMut(Self::Item) -> Self::Item;
-    }
-
-    impl<T> FoldHelper for Vec<T> {
-        type Item = T;
-        fn lift<F>(self, f: F) -> Self
-        where
-            F: FnMut(Self::Item) -> Self::Item,
-        {
-            self.into_iter().map(f).collect()
-        }
-    }
-
-    impl<T, U> FoldHelper for Punctuated<T, U> {
-        type Item = T;
-        fn lift<F>(self, mut f: F) -> Self
-        where
-            F: FnMut(Self::Item) -> Self::Item,
-        {
-            self.into_pairs()
-                .map(Pair::into_tuple)
-                .map(|(t, u)| Pair::new(f(t), u))
-                .collect()
-        }
-    }
-}
-

\ No newline at end of file
diff --git a/src/syn/generics.rs.html b/src/syn/generics.rs.html
index dc0db25b86..c77182af2f 100644
--- a/src/syn/generics.rs.html
+++ b/src/syn/generics.rs.html
@@ -1,4 +1,4 @@
-generics.rs - source

     ///
     /// [generic parameters]: https://doc.rust-lang.org/stable/reference/items/generics.html#generic-parameters
     /// [where clause]: https://doc.rust-lang.org/stable/reference/items/generics.html#where-clauses
-    #[cfg_attr(doc_cfg, doc(cfg(any(feature = "full", feature = "derive"))))]
+    #[cfg_attr(docsrs, doc(cfg(any(feature = "full", feature = "derive"))))]
     pub struct Generics {
         pub lt_token: Option<Token![<]>,
         pub params: Punctuated<GenericParam, Token![,]>,
@@ -1328,7 +1328,7 @@ 
Files

     /// This type is a [syntax tree enum].
     ///
     /// [syntax tree enum]: crate::expr::Expr#syntax-tree-enums
-    #[cfg_attr(doc_cfg, doc(cfg(any(feature = "full", feature = "derive"))))]
+    #[cfg_attr(docsrs, doc(cfg(any(feature = "full", feature = "derive"))))]
     pub enum GenericParam {
         /// A lifetime parameter: `'a: 'b + 'c + 'd`.
         Lifetime(LifetimeParam),
@@ -1343,7 +1343,7 @@ 
Files

 
 ast_struct! {
     /// A lifetime definition: `'a: 'b + 'c + 'd`.
-    #[cfg_attr(doc_cfg, doc(cfg(any(feature = "full", feature = "derive"))))]
+    #[cfg_attr(docsrs, doc(cfg(any(feature = "full", feature = "derive"))))]
     pub struct LifetimeParam {
         pub attrs: Vec<Attribute>,
         pub lifetime: Lifetime,
@@ -1354,7 +1354,7 @@ 
Files

 
 ast_struct! {
     /// A generic type parameter: `T: Into<String>`.
-    #[cfg_attr(doc_cfg, doc(cfg(any(feature = "full", feature = "derive"))))]
+    #[cfg_attr(docsrs, doc(cfg(any(feature = "full", feature = "derive"))))]
     pub struct TypeParam {
         pub attrs: Vec<Attribute>,
         pub ident: Ident,
@@ -1367,7 +1367,7 @@ 
Files

 
 ast_struct! {
     /// A const generic parameter: `const LENGTH: usize`.
-    #[cfg_attr(doc_cfg, doc(cfg(any(feature = "full", feature = "derive"))))]
+    #[cfg_attr(docsrs, doc(cfg(any(feature = "full", feature = "derive"))))]
     pub struct ConstParam {
         pub attrs: Vec<Attribute>,
         pub const_token: Token![const],
@@ -1577,7 +1577,7 @@ 
Files

 /// Returned by `Generics::split_for_impl`.
 #[cfg(feature = "printing")]
 #[cfg_attr(
-    doc_cfg,
+    docsrs,
     doc(cfg(all(any(feature = "full", feature = "derive"), feature = "printing")))
 )]
 pub struct ImplGenerics<'a>(&'a Generics);
@@ -1585,7 +1585,7 @@ 
Files

 /// Returned by `Generics::split_for_impl`.
 #[cfg(feature = "printing")]
 #[cfg_attr(
-    doc_cfg,
+    docsrs,
     doc(cfg(all(any(feature = "full", feature = "derive"), feature = "printing")))
 )]
 pub struct TypeGenerics<'a>(&'a Generics);
@@ -1593,7 +1593,7 @@ 
Files

 /// Returned by `TypeGenerics::as_turbofish`.
 #[cfg(feature = "printing")]
 #[cfg_attr(
-    doc_cfg,
+    docsrs,
     doc(cfg(all(any(feature = "full", feature = "derive"), feature = "printing")))
 )]
 pub struct Turbofish<'a>(&'a Generics);
@@ -1619,7 +1619,7 @@ 
Files

     /// # ;
     /// ```
     #[cfg_attr(
-        doc_cfg,
+        docsrs,
         doc(cfg(all(any(feature = "full", feature = "derive"), feature = "printing")))
     )]
     pub fn split_for_impl(&self) -> (ImplGenerics, TypeGenerics, Option<&WhereClause>) {
@@ -1635,7 +1635,7 @@ 
Files

 macro_rules! generics_wrapper_impls {
     ($ty:ident) => {
         #[cfg(feature = "clone-impls")]
-        #[cfg_attr(doc_cfg, doc(cfg(feature = "clone-impls")))]
+        #[cfg_attr(docsrs, doc(cfg(feature = "clone-impls")))]
         impl<'a> Clone for $ty<'a> {
             fn clone(&self) -> Self {
                 $ty(self.0)
@@ -1643,7 +1643,7 @@ 
Files

         }
 
         #[cfg(feature = "extra-traits")]
-        #[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+        #[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
         impl<'a> Debug for $ty<'a> {
             fn fmt(&self, formatter: &mut fmt::Formatter) -> fmt::Result {
                 formatter
@@ -1654,11 +1654,11 @@ 
Files

         }
 
         #[cfg(feature = "extra-traits")]
-        #[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+        #[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
         impl<'a> Eq for $ty<'a> {}
 
         #[cfg(feature = "extra-traits")]
-        #[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+        #[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
         impl<'a> PartialEq for $ty<'a> {
             fn eq(&self, other: &Self) -> bool {
                 self.0 == other.0
@@ -1666,7 +1666,7 @@ 
Files

         }
 
         #[cfg(feature = "extra-traits")]
-        #[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+        #[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
         impl<'a> Hash for $ty<'a> {
             fn hash<H: Hasher>(&self, state: &mut H) {
                 self.0.hash(state);
@@ -1692,7 +1692,7 @@ 
Files

 
 ast_struct! {
     /// A set of bound lifetimes: `for<'a, 'b, 'c>`.
-    #[cfg_attr(doc_cfg, doc(cfg(any(feature = "full", feature = "derive"))))]
+    #[cfg_attr(docsrs, doc(cfg(any(feature = "full", feature = "derive"))))]
     pub struct BoundLifetimes {
         pub for_token: Token![for],
         pub lt_token: Token![<],
@@ -1738,7 +1738,7 @@ 
Files

 
 ast_enum_of_structs! {
     /// A trait or lifetime used as a bound on a type parameter.
-    #[cfg_attr(doc_cfg, doc(cfg(any(feature = "full", feature = "derive"))))]
+    #[cfg_attr(docsrs, doc(cfg(any(feature = "full", feature = "derive"))))]
     #[non_exhaustive]
     pub enum TypeParamBound {
         Trait(TraitBound),
@@ -1749,7 +1749,7 @@ 
Files

 
 ast_struct! {
     /// A trait used as a bound on a type parameter.
-    #[cfg_attr(doc_cfg, doc(cfg(any(feature = "full", feature = "derive"))))]
+    #[cfg_attr(docsrs, doc(cfg(any(feature = "full", feature = "derive"))))]
     pub struct TraitBound {
         pub paren_token: Option<token::Paren>,
         pub modifier: TraitBoundModifier,
@@ -1763,7 +1763,7 @@ 
Files

 ast_enum! {
     /// A modifier on a trait bound, currently only used for the `?` in
     /// `?Sized`.
-    #[cfg_attr(doc_cfg, doc(cfg(any(feature = "full", feature = "derive"))))]
+    #[cfg_attr(docsrs, doc(cfg(any(feature = "full", feature = "derive"))))]
     pub enum TraitBoundModifier {
         None,
         Maybe(Token![?]),
@@ -1773,7 +1773,7 @@ 
Files

 ast_struct! {
     /// A `where` clause in a definition: `where T: Deserialize<'de>, D:
     /// 'static`.
-    #[cfg_attr(doc_cfg, doc(cfg(any(feature = "full", feature = "derive"))))]
+    #[cfg_attr(docsrs, doc(cfg(any(feature = "full", feature = "derive"))))]
     pub struct WhereClause {
         pub where_token: Token![where],
         pub predicates: Punctuated<WherePredicate, Token![,]>,
@@ -1788,7 +1788,7 @@ 
Files

     /// This type is a [syntax tree enum].
     ///
     /// [syntax tree enum]: crate::expr::Expr#syntax-tree-enums
-    #[cfg_attr(doc_cfg, doc(cfg(any(feature = "full", feature = "derive"))))]
+    #[cfg_attr(docsrs, doc(cfg(any(feature = "full", feature = "derive"))))]
     #[non_exhaustive]
     pub enum WherePredicate {
         /// A lifetime predicate in a `where` clause: `'a: 'b + 'c`.
@@ -1801,7 +1801,7 @@ 
Files

 
 ast_struct! {
     /// A lifetime predicate in a `where` clause: `'a: 'b + 'c`.
-    #[cfg_attr(doc_cfg, doc(cfg(any(feature = "full", feature = "derive"))))]
+    #[cfg_attr(docsrs, doc(cfg(any(feature = "full", feature = "derive"))))]
     pub struct PredicateLifetime {
         pub lifetime: Lifetime,
         pub colon_token: Token![:],
@@ -1811,7 +1811,7 @@ 
Files

 
 ast_struct! {
     /// A type predicate in a `where` clause: `for<'c> Foo<'c>: Trait<'c>`.
-    #[cfg_attr(doc_cfg, doc(cfg(any(feature = "full", feature = "derive"))))]
+    #[cfg_attr(docsrs, doc(cfg(any(feature = "full", feature = "derive"))))]
     pub struct PredicateType {
         /// Any lifetimes from a `for` binding
         pub lifetimes: Option<BoundLifetimes>,
@@ -1842,7 +1842,7 @@ 
Files

     use crate::ty::Type;
     use crate::verbatim;
 
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "parsing")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "parsing")))]
     impl Parse for Generics {
         fn parse(input: ParseStream) -> Result<Self> {
             if !input.peek(Token![<]) {
@@ -1905,7 +1905,7 @@ 
Files

         }
     }
 
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "parsing")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "parsing")))]
     impl Parse for GenericParam {
         fn parse(input: ParseStream) -> Result<Self> {
             let attrs = input.call(Attribute::parse_outer)?;
@@ -1932,7 +1932,7 @@ 
Files

         }
     }
 
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "parsing")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "parsing")))]
     impl Parse for LifetimeParam {
         fn parse(input: ParseStream) -> Result<Self> {
             let has_colon;
@@ -1970,7 +1970,7 @@ 
Files

         }
     }
 
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "parsing")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "parsing")))]
     impl Parse for BoundLifetimes {
         fn parse(input: ParseStream) -> Result<Self> {
             Ok(BoundLifetimes {
@@ -1999,7 +1999,7 @@ 
Files

         }
     }
 
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "parsing")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "parsing")))]
     impl Parse for Option<BoundLifetimes> {
         fn parse(input: ParseStream) -> Result<Self> {
             if input.peek(Token![for]) {
@@ -2010,7 +2010,7 @@ 
Files

         }
     }
 
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "parsing")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "parsing")))]
     impl Parse for TypeParam {
         fn parse(input: ParseStream) -> Result<Self> {
             let attrs = input.call(Attribute::parse_outer)?;
@@ -2051,7 +2051,7 @@ 
Files

         }
     }
 
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "parsing")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "parsing")))]
     impl Parse for TypeParamBound {
         fn parse(input: ParseStream) -> Result<Self> {
             if input.peek(Lifetime) {
@@ -2111,7 +2111,7 @@ 
Files

         }
     }
 
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "parsing")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "parsing")))]
     impl Parse for TraitBound {
         fn parse(input: ParseStream) -> Result<Self> {
             let modifier: TraitBoundModifier = input.parse()?;
@@ -2136,7 +2136,7 @@ 
Files

         }
     }
 
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "parsing")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "parsing")))]
     impl Parse for TraitBoundModifier {
         fn parse(input: ParseStream) -> Result<Self> {
             if input.peek(Token![?]) {
@@ -2147,7 +2147,7 @@ 
Files

         }
     }
 
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "parsing")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "parsing")))]
     impl Parse for ConstParam {
         fn parse(input: ParseStream) -> Result<Self> {
             let mut default = None;
@@ -2171,7 +2171,7 @@ 
Files

         }
     }
 
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "parsing")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "parsing")))]
     impl Parse for WhereClause {
         fn parse(input: ParseStream) -> Result<Self> {
             Ok(WhereClause {
@@ -2202,7 +2202,7 @@ 
Files

         }
     }
 
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "parsing")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "parsing")))]
     impl Parse for Option<WhereClause> {
         fn parse(input: ParseStream) -> Result<Self> {
             if input.peek(Token![where]) {
@@ -2213,7 +2213,7 @@ 
Files

         }
     }
 
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "parsing")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "parsing")))]
     impl Parse for WherePredicate {
         fn parse(input: ParseStream) -> Result<Self> {
             if input.peek(Lifetime) && input.peek2(Token![:]) {
@@ -2294,7 +2294,7 @@ 
Files

     use proc_macro2::TokenStream;
     use quote::{ToTokens, TokenStreamExt};
 
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "printing")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "printing")))]
     impl ToTokens for Generics {
         fn to_tokens(&self, tokens: &mut TokenStream) {
             if self.params.is_empty() {
@@ -2435,7 +2435,7 @@ 
Files

         }
     }
 
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "printing")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "printing")))]
     impl ToTokens for BoundLifetimes {
         fn to_tokens(&self, tokens: &mut TokenStream) {
             self.for_token.to_tokens(tokens);
@@ -2445,7 +2445,7 @@ 
Files

         }
     }
 
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "printing")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "printing")))]
     impl ToTokens for LifetimeParam {
         fn to_tokens(&self, tokens: &mut TokenStream) {
             tokens.append_all(self.attrs.outer());
@@ -2457,7 +2457,7 @@ 
Files

         }
     }
 
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "printing")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "printing")))]
     impl ToTokens for TypeParam {
         fn to_tokens(&self, tokens: &mut TokenStream) {
             tokens.append_all(self.attrs.outer());
@@ -2473,7 +2473,7 @@ 
Files

         }
     }
 
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "printing")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "printing")))]
     impl ToTokens for TraitBound {
         fn to_tokens(&self, tokens: &mut TokenStream) {
             let to_tokens = |tokens: &mut TokenStream| {
@@ -2488,7 +2488,7 @@ 
Files

         }
     }
 
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "printing")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "printing")))]
     impl ToTokens for TraitBoundModifier {
         fn to_tokens(&self, tokens: &mut TokenStream) {
             match self {
@@ -2498,7 +2498,7 @@ 
Files

         }
     }
 
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "printing")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "printing")))]
     impl ToTokens for ConstParam {
         fn to_tokens(&self, tokens: &mut TokenStream) {
             tokens.append_all(self.attrs.outer());
@@ -2513,7 +2513,7 @@ 
Files

         }
     }
 
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "printing")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "printing")))]
     impl ToTokens for WhereClause {
         fn to_tokens(&self, tokens: &mut TokenStream) {
             if !self.predicates.is_empty() {
@@ -2523,7 +2523,7 @@ 
Files

         }
     }
 
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "printing")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "printing")))]
     impl ToTokens for PredicateLifetime {
         fn to_tokens(&self, tokens: &mut TokenStream) {
             self.lifetime.to_tokens(tokens);
@@ -2532,7 +2532,7 @@ 
Files

         }
     }
 
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "printing")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "printing")))]
     impl ToTokens for PredicateType {
         fn to_tokens(&self, tokens: &mut TokenStream) {
             self.lifetimes.to_tokens(tokens);
diff --git a/src/syn/group.rs.html b/src/syn/group.rs.html
index 5b1f8c06ec..841a6f4fb7 100644
--- a/src/syn/group.rs.html
+++ b/src/syn/group.rs.html
@@ -1,4 +1,4 @@
-group.rs - source

 /// # }
 /// ```
 #[macro_export]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "parsing")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "parsing")))]
 macro_rules! parenthesized {
     ($content:ident in $cursor:expr) => {
         match $crate::__private::parse_parens(&$cursor) {
@@ -513,7 +513,7 @@ 
Files

 /// # }
 /// ```
 #[macro_export]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "parsing")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "parsing")))]
 macro_rules! braced {
     ($content:ident in $cursor:expr) => {
         match $crate::__private::parse_braces(&$cursor) {
@@ -568,7 +568,7 @@ 
Files

 /// # }
 /// ```
 #[macro_export]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "parsing")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "parsing")))]
 macro_rules! bracketed {
     ($content:ident in $cursor:expr) => {
         match $crate::__private::parse_brackets(&$cursor) {
diff --git a/src/syn/ident.rs.html b/src/syn/ident.rs.html
index 90e0e44ab4..c4bfcc61fb 100644
--- a/src/syn/ident.rs.html
+++ b/src/syn/ident.rs.html
@@ -1,4 +1,4 @@
-ident.rs - source

         }
     }
 
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "parsing")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "parsing")))]
     impl Parse for Ident {
         fn parse(input: ParseStream) -> Result<Self> {
             input.step(|cursor| {
diff --git a/src/syn/item.rs.html b/src/syn/item.rs.html
index a024ab978b..95c754cfa4 100644
--- a/src/syn/item.rs.html
+++ b/src/syn/item.rs.html
@@ -1,4 +1,4 @@
-item.rs - source

     /// This type is a [syntax tree enum].
     ///
     /// [syntax tree enum]: crate::expr::Expr#syntax-tree-enums
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "full")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "full")))]
     #[non_exhaustive]
     pub enum Item {
         /// A constant item: `const MAX: u16 = 65535`.
@@ -3543,7 +3543,7 @@ 
Files

 
 ast_struct! {
     /// A constant item: `const MAX: u16 = 65535`.
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "full")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "full")))]
     pub struct ItemConst {
         pub attrs: Vec<Attribute>,
         pub vis: Visibility,
@@ -3560,7 +3560,7 @@ 
Files

 
 ast_struct! {
     /// An enum definition: `enum Foo<A, B> { A(A), B(B) }`.
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "full")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "full")))]
     pub struct ItemEnum {
         pub attrs: Vec<Attribute>,
         pub vis: Visibility,
@@ -3574,7 +3574,7 @@ 
Files

 
 ast_struct! {
     /// An `extern crate` item: `extern crate serde`.
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "full")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "full")))]
     pub struct ItemExternCrate {
         pub attrs: Vec<Attribute>,
         pub vis: Visibility,
@@ -3588,7 +3588,7 @@ 
Files

 
 ast_struct! {
     /// A free-standing function: `fn process(n: usize) -> Result<()> { ... }`.
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "full")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "full")))]
     pub struct ItemFn {
         pub attrs: Vec<Attribute>,
         pub vis: Visibility,
@@ -3599,7 +3599,7 @@ 
Files

 
 ast_struct! {
     /// A block of foreign items: `extern "C" { ... }`.
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "full")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "full")))]
     pub struct ItemForeignMod {
         pub attrs: Vec<Attribute>,
         pub unsafety: Option<Token![unsafe]>,
@@ -3612,7 +3612,7 @@ 
Files

 ast_struct! {
     /// An impl block providing trait or associated items: `impl<A> Trait
     /// for Data<A> { ... }`.
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "full")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "full")))]
     pub struct ItemImpl {
         pub attrs: Vec<Attribute>,
         pub defaultness: Option<Token![default]>,
@@ -3630,7 +3630,7 @@ 
Files

 
 ast_struct! {
     /// A macro invocation, which includes `macro_rules!` definitions.
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "full")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "full")))]
     pub struct ItemMacro {
         pub attrs: Vec<Attribute>,
         /// The `example` in `macro_rules! example { ... }`.
@@ -3642,7 +3642,7 @@ 
Files

 
 ast_struct! {
     /// A module or module declaration: `mod m` or `mod m { ... }`.
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "full")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "full")))]
     pub struct ItemMod {
         pub attrs: Vec<Attribute>,
         pub vis: Visibility,
@@ -3656,7 +3656,7 @@ 
Files

 
 ast_struct! {
     /// A static item: `static BIKE: Shed = Shed(42)`.
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "full")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "full")))]
     pub struct ItemStatic {
         pub attrs: Vec<Attribute>,
         pub vis: Visibility,
@@ -3673,7 +3673,7 @@ 
Files

 
 ast_struct! {
     /// A struct definition: `struct Foo<A> { x: A }`.
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "full")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "full")))]
     pub struct ItemStruct {
         pub attrs: Vec<Attribute>,
         pub vis: Visibility,
@@ -3687,7 +3687,7 @@ 
Files

 
 ast_struct! {
     /// A trait definition: `pub trait Iterator { ... }`.
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "full")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "full")))]
     pub struct ItemTrait {
         pub attrs: Vec<Attribute>,
         pub vis: Visibility,
@@ -3706,7 +3706,7 @@ 
Files

 
 ast_struct! {
     /// A trait alias: `pub trait SharableIterator = Iterator + Sync`.
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "full")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "full")))]
     pub struct ItemTraitAlias {
         pub attrs: Vec<Attribute>,
         pub vis: Visibility,
@@ -3721,7 +3721,7 @@ 
Files

 
 ast_struct! {
     /// A type alias: `type Result<T> = std::result::Result<T, MyError>`.
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "full")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "full")))]
     pub struct ItemType {
         pub attrs: Vec<Attribute>,
         pub vis: Visibility,
@@ -3736,7 +3736,7 @@ 
Files

 
 ast_struct! {
     /// A union definition: `union Foo<A, B> { x: A, y: B }`.
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "full")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "full")))]
     pub struct ItemUnion {
         pub attrs: Vec<Attribute>,
         pub vis: Visibility,
@@ -3749,7 +3749,7 @@ 
Files

 
 ast_struct! {
     /// A use declaration: `use std::collections::HashMap`.
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "full")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "full")))]
     pub struct ItemUse {
         pub attrs: Vec<Attribute>,
         pub vis: Visibility,
@@ -3872,7 +3872,7 @@ 
Files

     /// This type is a [syntax tree enum].
     ///
     /// [syntax tree enum]: crate::expr::Expr#syntax-tree-enums
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "full")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "full")))]
     pub enum UseTree {
         /// A path prefix of imports in a `use` item: `std::...`.
         Path(UsePath),
@@ -3893,7 +3893,7 @@ 
Files

 
 ast_struct! {
     /// A path prefix of imports in a `use` item: `std::...`.
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "full")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "full")))]
     pub struct UsePath {
         pub ident: Ident,
         pub colon2_token: Token![::],
@@ -3903,7 +3903,7 @@ 
Files

 
 ast_struct! {
     /// An identifier imported by a `use` item: `HashMap`.
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "full")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "full")))]
     pub struct UseName {
         pub ident: Ident,
     }
@@ -3911,7 +3911,7 @@ 
Files

 
 ast_struct! {
     /// An renamed identifier imported by a `use` item: `HashMap as Map`.
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "full")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "full")))]
     pub struct UseRename {
         pub ident: Ident,
         pub as_token: Token![as],
@@ -3921,7 +3921,7 @@ 
Files

 
 ast_struct! {
     /// A glob import in a `use` item: `*`.
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "full")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "full")))]
     pub struct UseGlob {
         pub star_token: Token![*],
     }
@@ -3929,7 +3929,7 @@ 
Files

 
 ast_struct! {
     /// A braced group of imports in a `use` item: `{A, B, C}`.
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "full")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "full")))]
     pub struct UseGroup {
         pub brace_token: token::Brace,
         pub items: Punctuated<UseTree, Token![,]>,
@@ -3944,7 +3944,7 @@ 
Files

     /// This type is a [syntax tree enum].
     ///
     /// [syntax tree enum]: crate::expr::Expr#syntax-tree-enums
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "full")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "full")))]
     #[non_exhaustive]
     pub enum ForeignItem {
         /// A foreign function in an `extern` block.
@@ -3984,7 +3984,7 @@ 
Files

 
 ast_struct! {
     /// A foreign function in an `extern` block.
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "full")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "full")))]
     pub struct ForeignItemFn {
         pub attrs: Vec<Attribute>,
         pub vis: Visibility,
@@ -3995,7 +3995,7 @@ 
Files

 
 ast_struct! {
     /// A foreign static item in an `extern` block: `static ext: u8`.
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "full")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "full")))]
     pub struct ForeignItemStatic {
         pub attrs: Vec<Attribute>,
         pub vis: Visibility,
@@ -4010,7 +4010,7 @@ 
Files

 
 ast_struct! {
     /// A foreign type in an `extern` block: `type void`.
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "full")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "full")))]
     pub struct ForeignItemType {
         pub attrs: Vec<Attribute>,
         pub vis: Visibility,
@@ -4023,7 +4023,7 @@ 
Files

 
 ast_struct! {
     /// A macro invocation within an extern block.
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "full")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "full")))]
     pub struct ForeignItemMacro {
         pub attrs: Vec<Attribute>,
         pub mac: Macro,
@@ -4039,7 +4039,7 @@ 
Files

     /// This type is a [syntax tree enum].
     ///
     /// [syntax tree enum]: crate::expr::Expr#syntax-tree-enums
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "full")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "full")))]
     #[non_exhaustive]
     pub enum TraitItem {
         /// An associated constant within the definition of a trait.
@@ -4079,7 +4079,7 @@ 
Files

 
 ast_struct! {
     /// An associated constant within the definition of a trait.
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "full")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "full")))]
     pub struct TraitItemConst {
         pub attrs: Vec<Attribute>,
         pub const_token: Token![const],
@@ -4094,7 +4094,7 @@ 
Files

 
 ast_struct! {
     /// An associated function within the definition of a trait.
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "full")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "full")))]
     pub struct TraitItemFn {
         pub attrs: Vec<Attribute>,
         pub sig: Signature,
@@ -4105,7 +4105,7 @@ 
Files

 
 ast_struct! {
     /// An associated type within the definition of a trait.
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "full")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "full")))]
     pub struct TraitItemType {
         pub attrs: Vec<Attribute>,
         pub type_token: Token![type],
@@ -4120,7 +4120,7 @@ 
Files

 
 ast_struct! {
     /// A macro invocation within the definition of a trait.
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "full")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "full")))]
     pub struct TraitItemMacro {
         pub attrs: Vec<Attribute>,
         pub mac: Macro,
@@ -4136,7 +4136,7 @@ 
Files

     /// This type is a [syntax tree enum].
     ///
     /// [syntax tree enum]: crate::expr::Expr#syntax-tree-enums
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "full")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "full")))]
     #[non_exhaustive]
     pub enum ImplItem {
         /// An associated constant within an impl block.
@@ -4176,7 +4176,7 @@ 
Files

 
 ast_struct! {
     /// An associated constant within an impl block.
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "full")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "full")))]
     pub struct ImplItemConst {
         pub attrs: Vec<Attribute>,
         pub vis: Visibility,
@@ -4194,7 +4194,7 @@ 
Files

 
 ast_struct! {
     /// An associated function within an impl block.
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "full")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "full")))]
     pub struct ImplItemFn {
         pub attrs: Vec<Attribute>,
         pub vis: Visibility,
@@ -4206,7 +4206,7 @@ 
Files

 
 ast_struct! {
     /// An associated type within an impl block.
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "full")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "full")))]
     pub struct ImplItemType {
         pub attrs: Vec<Attribute>,
         pub vis: Visibility,
@@ -4222,7 +4222,7 @@ 
Files

 
 ast_struct! {
     /// A macro invocation within an impl block.
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "full")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "full")))]
     pub struct ImplItemMacro {
         pub attrs: Vec<Attribute>,
         pub mac: Macro,
@@ -4233,7 +4233,7 @@ 
Files

 ast_struct! {
     /// A function signature in a trait or implementation: `unsafe fn
     /// initialize(&self)`.
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "full")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "full")))]
     pub struct Signature {
         pub constness: Option<Token![const]>,
         pub asyncness: Option<Token![async]>,
@@ -4262,7 +4262,7 @@ 
Files

 
 ast_enum_of_structs! {
     /// An argument in a function signature: the `n: usize` in `fn f(n: usize)`.
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "full")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "full")))]
     pub enum FnArg {
         /// The `self` argument of an associated method.
         Receiver(Receiver),
@@ -4280,7 +4280,7 @@ 
Files

     /// is written in shorthand such as `self` or `&self` or `&mut self`. In the
     /// shorthand case, the type in `ty` is reconstructed as one of `Self`,
     /// `&Self`, or `&mut Self`.
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "full")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "full")))]
     pub struct Receiver {
         pub attrs: Vec<Attribute>,
         pub reference: Option<(Token![&], Option<Lifetime>)>,
@@ -4309,7 +4309,7 @@ 
Files

     ///     //                               ^^^
     /// }
     /// ```
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "full")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "full")))]
     pub struct Variadic {
         pub attrs: Vec<Attribute>,
         pub pat: Option<(Box<Pat>, Token![:])>,
@@ -4320,7 +4320,7 @@ 
Files

 
 ast_enum! {
     /// The mutability of an `Item::Static` or `ForeignItem::Static`.
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "full")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "full")))]
     #[non_exhaustive]
     pub enum StaticMutability {
         Mut(Token![mut]),
@@ -4330,7 +4330,7 @@ 
Files

 
 ast_enum! {
     /// Unused, but reserved for RFC 3323 restrictions.
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "full")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "full")))]
     #[non_exhaustive]
     pub enum ImplRestriction {}
 
@@ -4377,7 +4377,7 @@ 
Files

     use crate::verbatim;
     use proc_macro2::TokenStream;
 
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "parsing")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "parsing")))]
     impl Parse for Item {
         fn parse(input: ParseStream) -> Result<Self> {
             let begin = input.fork();
@@ -4670,7 +4670,7 @@ 
Files

         }
     }
 
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "parsing")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "parsing")))]
     impl Parse for ItemMacro {
         fn parse(input: ParseStream) -> Result<Self> {
             let attrs = input.call(Attribute::parse_outer)?;
@@ -4724,7 +4724,7 @@ 
Files

         Ok(Item::Verbatim(verbatim::between(&begin, input)))
     }
 
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "parsing")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "parsing")))]
     impl Parse for ItemExternCrate {
         fn parse(input: ParseStream) -> Result<Self> {
             Ok(ItemExternCrate {
@@ -4757,7 +4757,7 @@ 
Files

         }
     }
 
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "parsing")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "parsing")))]
     impl Parse for ItemUse {
         fn parse(input: ParseStream) -> Result<Self> {
             let allow_crate_root_in_path = false;
@@ -4791,7 +4791,7 @@ 
Files

         }))
     }
 
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "parsing")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "parsing")))]
     impl Parse for UseTree {
         fn parse(input: ParseStream) -> Result<UseTree> {
             let allow_crate_root_in_path = false;
@@ -4873,7 +4873,7 @@ 
Files

         }
     }
 
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "parsing")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "parsing")))]
     impl Parse for ItemStatic {
         fn parse(input: ParseStream) -> Result<Self> {
             Ok(ItemStatic {
@@ -4891,7 +4891,7 @@ 
Files

         }
     }
 
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "parsing")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "parsing")))]
     impl Parse for ItemConst {
         fn parse(input: ParseStream) -> Result<Self> {
             let attrs = input.call(Attribute::parse_outer)?;
@@ -4935,7 +4935,7 @@ 
Files

             && fork.peek(Token![fn])
     }
 
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "parsing")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "parsing")))]
     impl Parse for Signature {
         fn parse(input: ParseStream) -> Result<Self> {
             let constness: Option<Token![const]> = input.parse()?;
@@ -4969,7 +4969,7 @@ 
Files

         }
     }
 
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "parsing")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "parsing")))]
     impl Parse for ItemFn {
         fn parse(input: ParseStream) -> Result<Self> {
             let outer_attrs = input.call(Attribute::parse_outer)?;
@@ -4998,7 +4998,7 @@ 
Files

         })
     }
 
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "parsing")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "parsing")))]
     impl Parse for FnArg {
         fn parse(input: ParseStream) -> Result<Self> {
             let allow_variadic = false;
@@ -5065,7 +5065,7 @@ 
Files

         })))
     }
 
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "parsing")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "parsing")))]
     impl Parse for Receiver {
         fn parse(input: ParseStream) -> Result<Self> {
             let reference = if input.peek(Token![&]) {
@@ -5179,7 +5179,7 @@ 
Files

         Ok((args, variadic))
     }
 
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "parsing")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "parsing")))]
     impl Parse for ItemMod {
         fn parse(input: ParseStream) -> Result<Self> {
             let mut attrs = input.call(Attribute::parse_outer)?;
@@ -5228,7 +5228,7 @@ 
Files

         }
     }
 
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "parsing")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "parsing")))]
     impl Parse for ItemForeignMod {
         fn parse(input: ParseStream) -> Result<Self> {
             let mut attrs = input.call(Attribute::parse_outer)?;
@@ -5253,7 +5253,7 @@ 
Files

         }
     }
 
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "parsing")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "parsing")))]
     impl Parse for ForeignItem {
         fn parse(input: ParseStream) -> Result<Self> {
             let begin = input.fork();
@@ -5332,7 +5332,7 @@ 
Files

         }
     }
 
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "parsing")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "parsing")))]
     impl Parse for ForeignItemFn {
         fn parse(input: ParseStream) -> Result<Self> {
             let attrs = input.call(Attribute::parse_outer)?;
@@ -5348,7 +5348,7 @@ 
Files

         }
     }
 
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "parsing")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "parsing")))]
     impl Parse for ForeignItemStatic {
         fn parse(input: ParseStream) -> Result<Self> {
             Ok(ForeignItemStatic {
@@ -5364,7 +5364,7 @@ 
Files

         }
     }
 
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "parsing")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "parsing")))]
     impl Parse for ForeignItemType {
         fn parse(input: ParseStream) -> Result<Self> {
             Ok(ForeignItemType {
@@ -5413,7 +5413,7 @@ 
Files

         }
     }
 
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "parsing")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "parsing")))]
     impl Parse for ForeignItemMacro {
         fn parse(input: ParseStream) -> Result<Self> {
             let attrs = input.call(Attribute::parse_outer)?;
@@ -5431,7 +5431,7 @@ 
Files

         }
     }
 
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "parsing")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "parsing")))]
     impl Parse for ItemType {
         fn parse(input: ParseStream) -> Result<Self> {
             Ok(ItemType {
@@ -5485,7 +5485,7 @@ 
Files

         }))
     }
 
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "parsing")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "parsing")))]
     impl Parse for ItemStruct {
         fn parse(input: ParseStream) -> Result<Self> {
             let attrs = input.call(Attribute::parse_outer)?;
@@ -5509,7 +5509,7 @@ 
Files

         }
     }
 
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "parsing")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "parsing")))]
     impl Parse for ItemEnum {
         fn parse(input: ParseStream) -> Result<Self> {
             let attrs = input.call(Attribute::parse_outer)?;
@@ -5533,7 +5533,7 @@ 
Files

         }
     }
 
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "parsing")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "parsing")))]
     impl Parse for ItemUnion {
         fn parse(input: ParseStream) -> Result<Self> {
             let attrs = input.call(Attribute::parse_outer)?;
@@ -5584,7 +5584,7 @@ 
Files

         }
     }
 
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "parsing")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "parsing")))]
     impl Parse for ItemTrait {
         fn parse(input: ParseStream) -> Result<Self> {
             let outer_attrs = input.call(Attribute::parse_outer)?;
@@ -5659,7 +5659,7 @@ 
Files

         })
     }
 
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "parsing")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "parsing")))]
     impl Parse for ItemTraitAlias {
         fn parse(input: ParseStream) -> Result<Self> {
             let (attrs, vis, trait_token, ident, generics) = parse_start_of_trait_alias(input)?;
@@ -5715,7 +5715,7 @@ 
Files

         })
     }
 
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "parsing")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "parsing")))]
     impl Parse for TraitItem {
         fn parse(input: ParseStream) -> Result<Self> {
             let begin = input.fork();
@@ -5800,7 +5800,7 @@ 
Files

         }
     }
 
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "parsing")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "parsing")))]
     impl Parse for TraitItemConst {
         fn parse(input: ParseStream) -> Result<Self> {
             let attrs = input.call(Attribute::parse_outer)?;
@@ -5837,7 +5837,7 @@ 
Files

         }
     }
 
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "parsing")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "parsing")))]
     impl Parse for TraitItemFn {
         fn parse(input: ParseStream) -> Result<Self> {
             let mut attrs = input.call(Attribute::parse_outer)?;
@@ -5866,7 +5866,7 @@ 
Files

         }
     }
 
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "parsing")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "parsing")))]
     impl Parse for TraitItemType {
         fn parse(input: ParseStream) -> Result<Self> {
             let attrs = input.call(Attribute::parse_outer)?;
@@ -5923,7 +5923,7 @@ 
Files

         }
     }
 
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "parsing")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "parsing")))]
     impl Parse for TraitItemMacro {
         fn parse(input: ParseStream) -> Result<Self> {
             let attrs = input.call(Attribute::parse_outer)?;
@@ -5941,7 +5941,7 @@ 
Files

         }
     }
 
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "parsing")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "parsing")))]
     impl Parse for ItemImpl {
         fn parse(input: ParseStream) -> Result<Self> {
             let allow_verbatim_impl = false;
@@ -6053,7 +6053,7 @@ 
Files

         }
     }
 
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "parsing")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "parsing")))]
     impl Parse for ImplItem {
         fn parse(input: ParseStream) -> Result<Self> {
             let begin = input.fork();
@@ -6148,7 +6148,7 @@ 
Files

         }
     }
 
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "parsing")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "parsing")))]
     impl Parse for ImplItemConst {
         fn parse(input: ParseStream) -> Result<Self> {
             let attrs = input.call(Attribute::parse_outer)?;
@@ -6185,7 +6185,7 @@ 
Files

         }
     }
 
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "parsing")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "parsing")))]
     impl Parse for ImplItemFn {
         fn parse(input: ParseStream) -> Result<Self> {
             let allow_omitted_body = false;
@@ -6226,7 +6226,7 @@ 
Files

         }))
     }
 
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "parsing")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "parsing")))]
     impl Parse for ImplItemType {
         fn parse(input: ParseStream) -> Result<Self> {
             let attrs = input.call(Attribute::parse_outer)?;
@@ -6288,7 +6288,7 @@ 
Files

         }))
     }
 
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "parsing")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "parsing")))]
     impl Parse for ImplItemMacro {
         fn parse(input: ParseStream) -> Result<Self> {
             let attrs = input.call(Attribute::parse_outer)?;
@@ -6315,7 +6315,7 @@ 
Files

         }
     }
 
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "parsing")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "parsing")))]
     impl Parse for StaticMutability {
         fn parse(input: ParseStream) -> Result<Self> {
             let mut_token: Option<Token![mut]> = input.parse()?;
@@ -6342,7 +6342,7 @@ 
Files

     use proc_macro2::TokenStream;
     use quote::{ToTokens, TokenStreamExt};
 
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "printing")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "printing")))]
     impl ToTokens for ItemExternCrate {
         fn to_tokens(&self, tokens: &mut TokenStream) {
             tokens.append_all(self.attrs.outer());
@@ -6358,7 +6358,7 @@ 
Files

         }
     }
 
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "printing")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "printing")))]
     impl ToTokens for ItemUse {
         fn to_tokens(&self, tokens: &mut TokenStream) {
             tokens.append_all(self.attrs.outer());
@@ -6370,7 +6370,7 @@ 
Files

         }
     }
 
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "printing")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "printing")))]
     impl ToTokens for ItemStatic {
         fn to_tokens(&self, tokens: &mut TokenStream) {
             tokens.append_all(self.attrs.outer());
@@ -6386,7 +6386,7 @@ 
Files

         }
     }
 
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "printing")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "printing")))]
     impl ToTokens for ItemConst {
         fn to_tokens(&self, tokens: &mut TokenStream) {
             tokens.append_all(self.attrs.outer());
@@ -6401,7 +6401,7 @@ 
Files

         }
     }
 
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "printing")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "printing")))]
     impl ToTokens for ItemFn {
         fn to_tokens(&self, tokens: &mut TokenStream) {
             tokens.append_all(self.attrs.outer());
@@ -6414,7 +6414,7 @@ 
Files

         }
     }
 
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "printing")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "printing")))]
     impl ToTokens for ItemMod {
         fn to_tokens(&self, tokens: &mut TokenStream) {
             tokens.append_all(self.attrs.outer());
@@ -6433,7 +6433,7 @@ 
Files

         }
     }
 
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "printing")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "printing")))]
     impl ToTokens for ItemForeignMod {
         fn to_tokens(&self, tokens: &mut TokenStream) {
             tokens.append_all(self.attrs.outer());
@@ -6446,7 +6446,7 @@ 
Files

         }
     }
 
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "printing")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "printing")))]
     impl ToTokens for ItemType {
         fn to_tokens(&self, tokens: &mut TokenStream) {
             tokens.append_all(self.attrs.outer());
@@ -6461,7 +6461,7 @@ 
Files

         }
     }
 
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "printing")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "printing")))]
     impl ToTokens for ItemEnum {
         fn to_tokens(&self, tokens: &mut TokenStream) {
             tokens.append_all(self.attrs.outer());
@@ -6476,7 +6476,7 @@ 
Files

         }
     }
 
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "printing")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "printing")))]
     impl ToTokens for ItemStruct {
         fn to_tokens(&self, tokens: &mut TokenStream) {
             tokens.append_all(self.attrs.outer());
@@ -6502,7 +6502,7 @@ 
Files

         }
     }
 
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "printing")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "printing")))]
     impl ToTokens for ItemUnion {
         fn to_tokens(&self, tokens: &mut TokenStream) {
             tokens.append_all(self.attrs.outer());
@@ -6515,7 +6515,7 @@ 
Files

         }
     }
 
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "printing")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "printing")))]
     impl ToTokens for ItemTrait {
         fn to_tokens(&self, tokens: &mut TokenStream) {
             tokens.append_all(self.attrs.outer());
@@ -6537,7 +6537,7 @@ 
Files

         }
     }
 
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "printing")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "printing")))]
     impl ToTokens for ItemTraitAlias {
         fn to_tokens(&self, tokens: &mut TokenStream) {
             tokens.append_all(self.attrs.outer());
@@ -6552,7 +6552,7 @@ 
Files

         }
     }
 
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "printing")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "printing")))]
     impl ToTokens for ItemImpl {
         fn to_tokens(&self, tokens: &mut TokenStream) {
             tokens.append_all(self.attrs.outer());
@@ -6574,7 +6574,7 @@ 
Files

         }
     }
 
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "printing")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "printing")))]
     impl ToTokens for ItemMacro {
         fn to_tokens(&self, tokens: &mut TokenStream) {
             tokens.append_all(self.attrs.outer());
@@ -6596,7 +6596,7 @@ 
Files

         }
     }
 
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "printing")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "printing")))]
     impl ToTokens for UsePath {
         fn to_tokens(&self, tokens: &mut TokenStream) {
             self.ident.to_tokens(tokens);
@@ -6605,14 +6605,14 @@ 
Files

         }
     }
 
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "printing")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "printing")))]
     impl ToTokens for UseName {
         fn to_tokens(&self, tokens: &mut TokenStream) {
             self.ident.to_tokens(tokens);
         }
     }
 
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "printing")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "printing")))]
     impl ToTokens for UseRename {
         fn to_tokens(&self, tokens: &mut TokenStream) {
             self.ident.to_tokens(tokens);
@@ -6621,14 +6621,14 @@ 
Files

         }
     }
 
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "printing")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "printing")))]
     impl ToTokens for UseGlob {
         fn to_tokens(&self, tokens: &mut TokenStream) {
             self.star_token.to_tokens(tokens);
         }
     }
 
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "printing")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "printing")))]
     impl ToTokens for UseGroup {
         fn to_tokens(&self, tokens: &mut TokenStream) {
             self.brace_token.surround(tokens, |tokens| {
@@ -6637,7 +6637,7 @@ 
Files

         }
     }
 
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "printing")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "printing")))]
     impl ToTokens for TraitItemConst {
         fn to_tokens(&self, tokens: &mut TokenStream) {
             tokens.append_all(self.attrs.outer());
@@ -6653,7 +6653,7 @@ 
Files

         }
     }
 
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "printing")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "printing")))]
     impl ToTokens for TraitItemFn {
         fn to_tokens(&self, tokens: &mut TokenStream) {
             tokens.append_all(self.attrs.outer());
@@ -6672,7 +6672,7 @@ 
Files

         }
     }
 
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "printing")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "printing")))]
     impl ToTokens for TraitItemType {
         fn to_tokens(&self, tokens: &mut TokenStream) {
             tokens.append_all(self.attrs.outer());
@@ -6692,7 +6692,7 @@ 
Files

         }
     }
 
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "printing")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "printing")))]
     impl ToTokens for TraitItemMacro {
         fn to_tokens(&self, tokens: &mut TokenStream) {
             tokens.append_all(self.attrs.outer());
@@ -6701,7 +6701,7 @@ 
Files

         }
     }
 
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "printing")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "printing")))]
     impl ToTokens for ImplItemConst {
         fn to_tokens(&self, tokens: &mut TokenStream) {
             tokens.append_all(self.attrs.outer());
@@ -6717,7 +6717,7 @@ 
Files

         }
     }
 
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "printing")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "printing")))]
     impl ToTokens for ImplItemFn {
         fn to_tokens(&self, tokens: &mut TokenStream) {
             tokens.append_all(self.attrs.outer());
@@ -6731,7 +6731,7 @@ 
Files

         }
     }
 
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "printing")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "printing")))]
     impl ToTokens for ImplItemType {
         fn to_tokens(&self, tokens: &mut TokenStream) {
             tokens.append_all(self.attrs.outer());
@@ -6747,7 +6747,7 @@ 
Files

         }
     }
 
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "printing")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "printing")))]
     impl ToTokens for ImplItemMacro {
         fn to_tokens(&self, tokens: &mut TokenStream) {
             tokens.append_all(self.attrs.outer());
@@ -6756,7 +6756,7 @@ 
Files

         }
     }
 
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "printing")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "printing")))]
     impl ToTokens for ForeignItemFn {
         fn to_tokens(&self, tokens: &mut TokenStream) {
             tokens.append_all(self.attrs.outer());
@@ -6766,7 +6766,7 @@ 
Files

         }
     }
 
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "printing")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "printing")))]
     impl ToTokens for ForeignItemStatic {
         fn to_tokens(&self, tokens: &mut TokenStream) {
             tokens.append_all(self.attrs.outer());
@@ -6780,7 +6780,7 @@ 
Files

         }
     }
 
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "printing")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "printing")))]
     impl ToTokens for ForeignItemType {
         fn to_tokens(&self, tokens: &mut TokenStream) {
             tokens.append_all(self.attrs.outer());
@@ -6793,7 +6793,7 @@ 
Files

         }
     }
 
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "printing")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "printing")))]
     impl ToTokens for ForeignItemMacro {
         fn to_tokens(&self, tokens: &mut TokenStream) {
             tokens.append_all(self.attrs.outer());
@@ -6802,7 +6802,7 @@ 
Files

         }
     }
 
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "printing")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "printing")))]
     impl ToTokens for Signature {
         fn to_tokens(&self, tokens: &mut TokenStream) {
             self.constness.to_tokens(tokens);
@@ -6826,7 +6826,7 @@ 
Files

         }
     }
 
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "printing")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "printing")))]
     impl ToTokens for Receiver {
         fn to_tokens(&self, tokens: &mut TokenStream) {
             tokens.append_all(self.attrs.outer());
@@ -6859,7 +6859,7 @@ 
Files

         }
     }
 
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "printing")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "printing")))]
     impl ToTokens for Variadic {
         fn to_tokens(&self, tokens: &mut TokenStream) {
             tokens.append_all(self.attrs.outer());
@@ -6872,7 +6872,7 @@ 
Files

         }
     }
 
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "printing")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "printing")))]
     impl ToTokens for StaticMutability {
         fn to_tokens(&self, tokens: &mut TokenStream) {
             match self {
diff --git a/src/syn/lib.rs.html b/src/syn/lib.rs.html
index 786810eef0..d8803a57ae 100644
--- a/src/syn/lib.rs.html
+++ b/src/syn/lib.rs.html
@@ -1,4 +1,4 @@
-lib.rs - source

 1017
 1018
 1019
-1020
-1021
-1022
 
//! [![github]](https://github.com/dtolnay/syn)&ensp;[![crates-io]](https://crates.io/crates/syn)&ensp;[![docs-rs]](crate)
 //!
 //! [github]: https://img.shields.io/badge/github-8da0cb?style=for-the-badge&labelColor=555555&logo=github
@@ -1273,8 +1270,8 @@ 
Files

 //!   dynamic library libproc_macro from rustc toolchain.
 
 // Syn types in rustdoc of other crates get linked to here.
-#![doc(html_root_url = "https://docs.rs/syn/2.0.64")]
-#![cfg_attr(doc_cfg, feature(doc_cfg))]
+#![doc(html_root_url = "https://docs.rs/syn/2.0.66")]
+#![cfg_attr(docsrs, feature(doc_cfg))]
 #![deny(unsafe_op_in_unsafe_fn)]
 #![allow(non_camel_case_types)]
 #![cfg_attr(not(check_cfg), allow(unexpected_cfgs))]
@@ -1298,6 +1295,7 @@ 
Files

     clippy::let_underscore_untyped, // https://github.com/rust-lang/rust-clippy/issues/10410
     clippy::manual_assert,
     clippy::manual_let_else,
+    clippy::manual_map,
     clippy::match_like_matches_macro,
     clippy::match_on_vec_items,
     clippy::match_same_arms,
@@ -1343,13 +1341,13 @@ 
Files

 #[cfg(any(feature = "full", feature = "derive"))]
 mod attr;
 #[cfg(any(feature = "full", feature = "derive"))]
-#[cfg_attr(doc_cfg, doc(cfg(any(feature = "full", feature = "derive"))))]
+#[cfg_attr(docsrs, doc(cfg(any(feature = "full", feature = "derive"))))]
 pub use crate::attr::{AttrStyle, Attribute, Meta, MetaList, MetaNameValue};
 
 mod bigint;
 
 #[cfg(feature = "parsing")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "parsing")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "parsing")))]
 pub mod buffer;
 
 #[cfg(any(
@@ -1365,13 +1363,13 @@ 
Files

 #[cfg(any(feature = "full", feature = "derive"))]
 mod data;
 #[cfg(any(feature = "full", feature = "derive"))]
-#[cfg_attr(doc_cfg, doc(cfg(any(feature = "full", feature = "derive"))))]
+#[cfg_attr(docsrs, doc(cfg(any(feature = "full", feature = "derive"))))]
 pub use crate::data::{Field, Fields, FieldsNamed, FieldsUnnamed, Variant};
 
 #[cfg(any(feature = "full", feature = "derive"))]
 mod derive;
 #[cfg(feature = "derive")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "derive")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "derive")))]
 pub use crate::derive::{Data, DataEnum, DataStruct, DataUnion, DeriveInput};
 
 mod drops;
@@ -1382,16 +1380,16 @@ 
Files

 #[cfg(any(feature = "full", feature = "derive"))]
 mod expr;
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "full")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "full")))]
 pub use crate::expr::{Arm, Label, RangeLimits};
 #[cfg(any(feature = "full", feature = "derive"))]
-#[cfg_attr(doc_cfg, doc(cfg(any(feature = "full", feature = "derive"))))]
+#[cfg_attr(docsrs, doc(cfg(any(feature = "full", feature = "derive"))))]
 pub use crate::expr::{
     Expr, ExprBinary, ExprCall, ExprCast, ExprField, ExprIndex, ExprLit, ExprMacro, ExprMethodCall,
     ExprParen, ExprPath, ExprReference, ExprStruct, ExprUnary, FieldValue, Index, Member,
 };
 #[cfg(any(feature = "full", feature = "derive"))]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "full")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "full")))]
 pub use crate::expr::{
     ExprArray, ExprAssign, ExprAsync, ExprAwait, ExprBlock, ExprBreak, ExprClosure, ExprConst,
     ExprContinue, ExprForLoop, ExprGroup, ExprIf, ExprInfer, ExprLet, ExprLoop, ExprMatch,
@@ -1400,13 +1398,13 @@ 
Files

 };
 
 #[cfg(feature = "parsing")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "parsing")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "parsing")))]
 pub mod ext;
 
 #[cfg(feature = "full")]
 mod file;
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "full")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "full")))]
 pub use crate::file::File;
 
 #[cfg(all(feature = "full", feature = "printing"))]
@@ -1415,7 +1413,7 @@ 
Files

 #[cfg(any(feature = "full", feature = "derive"))]
 mod generics;
 #[cfg(any(feature = "full", feature = "derive"))]
-#[cfg_attr(doc_cfg, doc(cfg(any(feature = "full", feature = "derive"))))]
+#[cfg_attr(docsrs, doc(cfg(any(feature = "full", feature = "derive"))))]
 pub use crate::generics::{
     BoundLifetimes, ConstParam, GenericParam, Generics, LifetimeParam, PredicateLifetime,
     PredicateType, TraitBound, TraitBoundModifier, TypeParam, TypeParamBound, WhereClause,
@@ -1423,7 +1421,7 @@ 
Files

 };
 #[cfg(all(any(feature = "full", feature = "derive"), feature = "printing"))]
 #[cfg_attr(
-    doc_cfg,
+    docsrs,
     doc(cfg(all(any(feature = "full", feature = "derive"), feature = "printing")))
 )]
 pub use crate::generics::{ImplGenerics, Turbofish, TypeGenerics};
@@ -1435,7 +1433,7 @@ 
Files

 #[cfg(feature = "full")]
 mod item;
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "full")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "full")))]
 pub use crate::item::{
     FnArg, ForeignItem, ForeignItemFn, ForeignItemMacro, ForeignItemStatic, ForeignItemType,
     ImplItem, ImplItemConst, ImplItemFn, ImplItemMacro, ImplItemType, ImplRestriction, Item,
@@ -1463,12 +1461,12 @@ 
Files

 #[cfg(any(feature = "full", feature = "derive"))]
 mod mac;
 #[cfg(any(feature = "full", feature = "derive"))]
-#[cfg_attr(doc_cfg, doc(cfg(any(feature = "full", feature = "derive"))))]
+#[cfg_attr(docsrs, doc(cfg(any(feature = "full", feature = "derive"))))]
 pub use crate::mac::{Macro, MacroDelimiter};
 
 #[cfg(all(feature = "parsing", any(feature = "full", feature = "derive")))]
 #[cfg_attr(
-    doc_cfg,
+    docsrs,
     doc(cfg(all(feature = "parsing", any(feature = "full", feature = "derive"))))
 )]
 pub mod meta;
@@ -1476,11 +1474,11 @@ 
Files

 #[cfg(any(feature = "full", feature = "derive"))]
 mod op;
 #[cfg(any(feature = "full", feature = "derive"))]
-#[cfg_attr(doc_cfg, doc(cfg(any(feature = "full", feature = "derive"))))]
+#[cfg_attr(docsrs, doc(cfg(any(feature = "full", feature = "derive"))))]
 pub use crate::op::{BinOp, UnOp};
 
 #[cfg(feature = "parsing")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "parsing")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "parsing")))]
 pub mod parse;
 
 #[cfg(all(feature = "parsing", feature = "proc-macro"))]
@@ -1492,7 +1490,7 @@ 
Files

 #[cfg(feature = "full")]
 mod pat;
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "full")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "full")))]
 pub use crate::pat::{
     FieldPat, Pat, PatConst, PatIdent, PatLit, PatMacro, PatOr, PatParen, PatPath, PatRange,
     PatReference, PatRest, PatSlice, PatStruct, PatTuple, PatTupleStruct, PatType, PatWild,
@@ -1501,7 +1499,7 @@ 
Files

 #[cfg(any(feature = "full", feature = "derive"))]
 mod path;
 #[cfg(any(feature = "full", feature = "derive"))]
-#[cfg_attr(doc_cfg, doc(cfg(any(feature = "full", feature = "derive"))))]
+#[cfg_attr(docsrs, doc(cfg(any(feature = "full", feature = "derive"))))]
 pub use crate::path::{
     AngleBracketedGenericArguments, AssocConst, AssocType, Constraint, GenericArgument,
     ParenthesizedGenericArguments, Path, PathArguments, PathSegment, QSelf,
@@ -1521,7 +1519,7 @@ 
Files

 #[cfg(any(feature = "full", feature = "derive"))]
 mod restriction;
 #[cfg(any(feature = "full", feature = "derive"))]
-#[cfg_attr(doc_cfg, doc(cfg(any(feature = "full", feature = "derive"))))]
+#[cfg_attr(docsrs, doc(cfg(any(feature = "full", feature = "derive"))))]
 pub use crate::restriction::{FieldMutability, VisRestricted, Visibility};
 
 mod sealed;
@@ -1529,13 +1527,13 @@ 
Files

 mod span;
 
 #[cfg(all(feature = "parsing", feature = "printing"))]
-#[cfg_attr(doc_cfg, doc(cfg(all(feature = "parsing", feature = "printing"))))]
+#[cfg_attr(docsrs, doc(cfg(all(feature = "parsing", feature = "printing"))))]
 pub mod spanned;
 
 #[cfg(feature = "full")]
 mod stmt;
 #[cfg(feature = "full")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "full")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "full")))]
 pub use crate::stmt::{Block, Local, LocalInit, Stmt, StmtMacro};
 
 mod thread;
@@ -1546,7 +1544,7 @@ 
Files

 #[cfg(any(feature = "full", feature = "derive"))]
 mod ty;
 #[cfg(any(feature = "full", feature = "derive"))]
-#[cfg_attr(doc_cfg, doc(cfg(any(feature = "full", feature = "derive"))))]
+#[cfg_attr(docsrs, doc(cfg(any(feature = "full", feature = "derive"))))]
 pub use crate::ty::{
     Abi, BareFnArg, BareVariadic, ReturnType, Type, TypeArray, TypeBareFn, TypeGroup,
     TypeImplTrait, TypeInfer, TypeMacro, TypeNever, TypeParen, TypePath, TypePtr, TypeReference,
@@ -1641,7 +1639,7 @@ 
Files

     /// }
     /// ```
     #[cfg(feature = "fold")]
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "fold")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "fold")))]
     #[rustfmt::skip]
     pub mod fold;
 
@@ -1760,7 +1758,7 @@ 
Files

     /// }
     /// ```
     #[cfg(feature = "visit")]
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "visit")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "visit")))]
     #[rustfmt::skip]
     pub mod visit;
 
@@ -1854,7 +1852,7 @@ 
Files

     /// }
     /// ```
     #[cfg(feature = "visit-mut")]
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "visit-mut")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "visit-mut")))]
     #[rustfmt::skip]
     pub mod visit_mut;
 
@@ -1873,22 +1871,18 @@ 
Files

     #[cfg(feature = "extra-traits")]
     #[rustfmt::skip]
     mod hash;
-
-    #[cfg(any(feature = "full", feature = "derive"))]
-    #[path = "../gen_helper.rs"]
-    mod helper;
 }
 
 #[cfg(feature = "fold")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "fold")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "fold")))]
 pub use crate::gen::fold;
 
 #[cfg(feature = "visit")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "visit")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "visit")))]
 pub use crate::gen::visit;
 
 #[cfg(feature = "visit-mut")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "visit-mut")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "visit-mut")))]
 pub use crate::gen::visit_mut;
 
 // Not public API.
@@ -1935,7 +1929,7 @@ 
Files

 /// }
 /// ```
 #[cfg(all(feature = "parsing", feature = "proc-macro"))]
-#[cfg_attr(doc_cfg, doc(cfg(all(feature = "parsing", feature = "proc-macro"))))]
+#[cfg_attr(docsrs, doc(cfg(all(feature = "parsing", feature = "proc-macro"))))]
 pub fn parse<T: parse::Parse>(tokens: proc_macro::TokenStream) -> Result<T> {
     parse::Parser::parse(T::parse, tokens)
 }
@@ -1953,7 +1947,7 @@ 
Files

 ///
 /// [`syn::parse`]: parse()
 #[cfg(feature = "parsing")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "parsing")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "parsing")))]
 pub fn parse2<T: parse::Parse>(tokens: proc_macro2::TokenStream) -> Result<T> {
     parse::Parser::parse2(T::parse, tokens)
 }
@@ -1980,7 +1974,7 @@ 
Files

 /// # run().unwrap();
 /// ```
 #[cfg(feature = "parsing")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "parsing")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "parsing")))]
 pub fn parse_str<T: parse::Parse>(s: &str) -> Result<T> {
     parse::Parser::parse_str(T::parse, s)
 }
@@ -2018,7 +2012,7 @@ 
Files

 /// # run().unwrap();
 /// ```
 #[cfg(all(feature = "parsing", feature = "full"))]
-#[cfg_attr(doc_cfg, doc(cfg(all(feature = "parsing", feature = "full"))))]
+#[cfg_attr(docsrs, doc(cfg(all(feature = "parsing", feature = "full"))))]
 pub fn parse_file(mut content: &str) -> Result<File> {
     // Strip the BOM if it is present
     const BOM: &str = "\u{feff}";
diff --git a/src/syn/lifetime.rs.html b/src/syn/lifetime.rs.html
index 3c6c965b73..2bbce361dd 100644
--- a/src/syn/lifetime.rs.html
+++ b/src/syn/lifetime.rs.html
@@ -1,4 +1,4 @@
-lifetime.rs - source

     use crate::lifetime::Lifetime;
     use crate::parse::{Parse, ParseStream};
 
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "parsing")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "parsing")))]
     impl Parse for Lifetime {
         fn parse(input: ParseStream) -> Result<Self> {
             input.step(|cursor| {
@@ -302,7 +302,7 @@ 
Files

     use proc_macro2::{Punct, Spacing, TokenStream};
     use quote::{ToTokens, TokenStreamExt};
 
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "printing")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "printing")))]
     impl ToTokens for Lifetime {
         fn to_tokens(&self, tokens: &mut TokenStream) {
             let mut apostrophe = Punct::new('\'', Spacing::Joint);
diff --git a/src/syn/lit.rs.html b/src/syn/lit.rs.html
index e724c4cefa..6d7e8de2a7 100644
--- a/src/syn/lit.rs.html
+++ b/src/syn/lit.rs.html
@@ -1,4 +1,4 @@
-lit.rs - source

     /// }
     /// ```
     #[cfg(feature = "parsing")]
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "parsing")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "parsing")))]
     pub fn parse<T: Parse>(&self) -> Result<T> {
         self.parse_with(T::parse)
     }
@@ -2041,7 +2041,7 @@ 
Files

     /// # }
     /// ```
     #[cfg(feature = "parsing")]
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "parsing")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "parsing")))]
     pub fn parse_with<F: Parser>(&self, parser: F) -> Result<F::Output> {
         use proc_macro2::Group;
 
@@ -2436,7 +2436,7 @@ 
Files

     use crate::lit::{LitBool, LitByte, LitByteStr, LitCStr, LitChar, LitFloat, LitInt, LitStr};
     use std::fmt::{self, Debug};
 
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
     impl Debug for LitStr {
         fn fmt(&self, formatter: &mut fmt::Formatter) -> fmt::Result {
             self.debug(formatter, "LitStr")
@@ -2452,7 +2452,7 @@ 
Files

         }
     }
 
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
     impl Debug for LitByteStr {
         fn fmt(&self, formatter: &mut fmt::Formatter) -> fmt::Result {
             self.debug(formatter, "LitByteStr")
@@ -2468,7 +2468,7 @@ 
Files

         }
     }
 
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
     impl Debug for LitCStr {
         fn fmt(&self, formatter: &mut fmt::Formatter) -> fmt::Result {
             self.debug(formatter, "LitCStr")
@@ -2484,7 +2484,7 @@ 
Files

         }
     }
 
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
     impl Debug for LitByte {
         fn fmt(&self, formatter: &mut fmt::Formatter) -> fmt::Result {
             self.debug(formatter, "LitByte")
@@ -2500,7 +2500,7 @@ 
Files

         }
     }
 
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
     impl Debug for LitChar {
         fn fmt(&self, formatter: &mut fmt::Formatter) -> fmt::Result {
             self.debug(formatter, "LitChar")
@@ -2516,7 +2516,7 @@ 
Files

         }
     }
 
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
     impl Debug for LitInt {
         fn fmt(&self, formatter: &mut fmt::Formatter) -> fmt::Result {
             self.debug(formatter, "LitInt")
@@ -2532,7 +2532,7 @@ 
Files

         }
     }
 
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
     impl Debug for LitFloat {
         fn fmt(&self, formatter: &mut fmt::Formatter) -> fmt::Result {
             self.debug(formatter, "LitFloat")
@@ -2548,7 +2548,7 @@ 
Files

         }
     }
 
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
     impl Debug for LitBool {
         fn fmt(&self, formatter: &mut fmt::Formatter) -> fmt::Result {
             self.debug(formatter, "LitBool")
@@ -2566,7 +2566,7 @@ 
Files

 }
 
 #[cfg(feature = "clone-impls")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "clone-impls")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "clone-impls")))]
 impl Clone for LitRepr {
     fn clone(&self) -> Self {
         LitRepr {
@@ -2577,7 +2577,7 @@ 
Files

 }
 
 #[cfg(feature = "clone-impls")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "clone-impls")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "clone-impls")))]
 impl Clone for LitIntRepr {
     fn clone(&self) -> Self {
         LitIntRepr {
@@ -2589,7 +2589,7 @@ 
Files

 }
 
 #[cfg(feature = "clone-impls")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "clone-impls")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "clone-impls")))]
 impl Clone for LitFloatRepr {
     fn clone(&self) -> Self {
         LitFloatRepr {
@@ -2603,7 +2603,7 @@ 
Files

 macro_rules! lit_extra_traits {
     ($ty:ident) => {
         #[cfg(feature = "clone-impls")]
-        #[cfg_attr(doc_cfg, doc(cfg(feature = "clone-impls")))]
+        #[cfg_attr(docsrs, doc(cfg(feature = "clone-impls")))]
         impl Clone for $ty {
             fn clone(&self) -> Self {
                 $ty {
@@ -2613,7 +2613,7 @@ 
Files

         }
 
         #[cfg(feature = "extra-traits")]
-        #[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+        #[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
         impl PartialEq for $ty {
             fn eq(&self, other: &Self) -> bool {
                 self.repr.token.to_string() == other.repr.token.to_string()
@@ -2621,7 +2621,7 @@ 
Files

         }
 
         #[cfg(feature = "extra-traits")]
-        #[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+        #[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
         impl Hash for $ty {
             fn hash<H>(&self, state: &mut H)
             where
@@ -2691,7 +2691,7 @@ 
Files

     use crate::parse::{Parse, ParseStream};
     use proc_macro2::{Literal, Punct};
 
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "parsing")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "parsing")))]
     impl Parse for Lit {
         fn parse(input: ParseStream) -> Result<Self> {
             input.step(|cursor| {
@@ -2762,7 +2762,7 @@ 
Files

         ))
     }
 
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "parsing")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "parsing")))]
     impl Parse for LitStr {
         fn parse(input: ParseStream) -> Result<Self> {
             let head = input.fork();
@@ -2773,7 +2773,7 @@ 
Files

         }
     }
 
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "parsing")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "parsing")))]
     impl Parse for LitByteStr {
         fn parse(input: ParseStream) -> Result<Self> {
             let head = input.fork();
@@ -2784,7 +2784,7 @@ 
Files

         }
     }
 
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "parsing")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "parsing")))]
     impl Parse for LitCStr {
         fn parse(input: ParseStream) -> Result<Self> {
             let head = input.fork();
@@ -2795,7 +2795,7 @@ 
Files

         }
     }
 
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "parsing")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "parsing")))]
     impl Parse for LitByte {
         fn parse(input: ParseStream) -> Result<Self> {
             let head = input.fork();
@@ -2806,7 +2806,7 @@ 
Files

         }
     }
 
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "parsing")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "parsing")))]
     impl Parse for LitChar {
         fn parse(input: ParseStream) -> Result<Self> {
             let head = input.fork();
@@ -2817,7 +2817,7 @@ 
Files

         }
     }
 
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "parsing")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "parsing")))]
     impl Parse for LitInt {
         fn parse(input: ParseStream) -> Result<Self> {
             let head = input.fork();
@@ -2828,7 +2828,7 @@ 
Files

         }
     }
 
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "parsing")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "parsing")))]
     impl Parse for LitFloat {
         fn parse(input: ParseStream) -> Result<Self> {
             let head = input.fork();
@@ -2839,7 +2839,7 @@ 
Files

         }
     }
 
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "parsing")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "parsing")))]
     impl Parse for LitBool {
         fn parse(input: ParseStream) -> Result<Self> {
             let head = input.fork();
@@ -2857,56 +2857,56 @@ 
Files

     use proc_macro2::TokenStream;
     use quote::{ToTokens, TokenStreamExt};
 
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "printing")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "printing")))]
     impl ToTokens for LitStr {
         fn to_tokens(&self, tokens: &mut TokenStream) {
             self.repr.token.to_tokens(tokens);
         }
     }
 
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "printing")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "printing")))]
     impl ToTokens for LitByteStr {
         fn to_tokens(&self, tokens: &mut TokenStream) {
             self.repr.token.to_tokens(tokens);
         }
     }
 
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "printing")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "printing")))]
     impl ToTokens for LitCStr {
         fn to_tokens(&self, tokens: &mut TokenStream) {
             self.repr.token.to_tokens(tokens);
         }
     }
 
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "printing")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "printing")))]
     impl ToTokens for LitByte {
         fn to_tokens(&self, tokens: &mut TokenStream) {
             self.repr.token.to_tokens(tokens);
         }
     }
 
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "printing")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "printing")))]
     impl ToTokens for LitChar {
         fn to_tokens(&self, tokens: &mut TokenStream) {
             self.repr.token.to_tokens(tokens);
         }
     }
 
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "printing")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "printing")))]
     impl ToTokens for LitInt {
         fn to_tokens(&self, tokens: &mut TokenStream) {
             self.repr.token.to_tokens(tokens);
         }
     }
 
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "printing")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "printing")))]
     impl ToTokens for LitFloat {
         fn to_tokens(&self, tokens: &mut TokenStream) {
             self.repr.token.to_tokens(tokens);
         }
     }
 
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "printing")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "printing")))]
     impl ToTokens for LitBool {
         fn to_tokens(&self, tokens: &mut TokenStream) {
             tokens.append(self.token());
diff --git a/src/syn/lookahead.rs.html b/src/syn/lookahead.rs.html
index e09265c0ee..41c9bb0e1d 100644
--- a/src/syn/lookahead.rs.html
+++ b/src/syn/lookahead.rs.html
@@ -1,4 +1,4 @@
-lookahead.rs - source

     /// The error message will identify all of the expected token types that
     /// have been peeked against this lookahead instance.
     pub fn error(self) -> Error {
-        let comparisons = self.comparisons.borrow();
+        let comparisons = self.comparisons.into_inner();
         match comparisons.len() {
             0 => {
                 if self.cursor.eof() {
diff --git a/src/syn/mac.rs.html b/src/syn/mac.rs.html
index 1bf0c59c60..adc682506f 100644
--- a/src/syn/mac.rs.html
+++ b/src/syn/mac.rs.html
@@ -1,4 +1,4 @@
-mac.rs - source

 
 ast_struct! {
     /// A macro invocation: `println!("{}", mac)`.
-    #[cfg_attr(doc_cfg, doc(cfg(any(feature = "full", feature = "derive"))))]
+    #[cfg_attr(docsrs, doc(cfg(any(feature = "full", feature = "derive"))))]
     pub struct Macro {
         pub path: Path,
         pub bang_token: Token![!],
@@ -249,7 +249,7 @@ 
Files

 
 ast_enum! {
     /// A grouping token that surrounds a macro body: `m!(...)` or `m!{...}` or `m![...]`.
-    #[cfg_attr(doc_cfg, doc(cfg(any(feature = "full", feature = "derive"))))]
+    #[cfg_attr(docsrs, doc(cfg(any(feature = "full", feature = "derive"))))]
     pub enum MacroDelimiter {
         Paren(Paren),
         Brace(Brace),
@@ -359,7 +359,7 @@ 
Files

     /// }
     /// ```
     #[cfg(feature = "parsing")]
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "parsing")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "parsing")))]
     pub fn parse_body<T: Parse>(&self) -> Result<T> {
         self.parse_body_with(T::parse)
     }
@@ -367,7 +367,7 @@ 
Files

     /// Parse the tokens within the macro invocation's delimiters using the
     /// given parser.
     #[cfg(feature = "parsing")]
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "parsing")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "parsing")))]
     pub fn parse_body_with<F: Parser>(&self, parser: F) -> Result<F::Output> {
         let scope = self.delimiter.span().close();
         crate::parse::parse_scoped(parser, scope, self.tokens.clone())
@@ -401,7 +401,7 @@ 
Files

     use crate::parse::{Parse, ParseStream};
     use crate::path::Path;
 
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "parsing")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "parsing")))]
     impl Parse for Macro {
         fn parse(input: ParseStream) -> Result<Self> {
             let tokens;
@@ -437,7 +437,7 @@ 
Files

         }
     }
 
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "printing")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "printing")))]
     impl ToTokens for Macro {
         fn to_tokens(&self, tokens: &mut TokenStream) {
             self.path.to_tokens(tokens);
diff --git a/src/syn/macros.rs.html b/src/syn/macros.rs.html
index d1ca4e21ba..bc1e32c38c 100644
--- a/src/syn/macros.rs.html
+++ b/src/syn/macros.rs.html
@@ -1,4 +1,4 @@
-macros.rs - source

     };
 
     (($($arms:tt)*) $tokens:ident $name:ident {}) => {
-        #[cfg_attr(doc_cfg, doc(cfg(feature = "printing")))]
+        #[cfg_attr(docsrs, doc(cfg(feature = "printing")))]
         impl ::quote::ToTokens for $name {
             fn to_tokens(&self, $tokens: &mut ::proc_macro2::TokenStream) {
                 match self {
diff --git a/src/syn/meta.rs.html b/src/syn/meta.rs.html
index 56c87da00f..62b0201bff 100644
--- a/src/syn/meta.rs.html
+++ b/src/syn/meta.rs.html
@@ -1,4 +1,4 @@
-meta.rs - source

 
 ast_enum! {
     /// A unary operator: `*`, `!`, `-`.
-    #[cfg_attr(doc_cfg, doc(cfg(any(feature = "full", feature = "derive"))))]
+    #[cfg_attr(docsrs, doc(cfg(any(feature = "full", feature = "derive"))))]
     #[non_exhaustive]
     pub enum UnOp {
         /// The `*` operator for dereferencing
@@ -303,7 +303,7 @@ 
Files

     use crate::op::{BinOp, UnOp};
     use crate::parse::{Parse, ParseStream};
 
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "parsing")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "parsing")))]
     impl Parse for BinOp {
         fn parse(input: ParseStream) -> Result<Self> {
             if input.peek(Token![+=]) {
@@ -368,7 +368,7 @@ 
Files

         }
     }
 
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "parsing")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "parsing")))]
     impl Parse for UnOp {
         fn parse(input: ParseStream) -> Result<Self> {
             let lookahead = input.lookahead1();
@@ -391,7 +391,7 @@ 
Files

     use proc_macro2::TokenStream;
     use quote::ToTokens;
 
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "printing")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "printing")))]
     impl ToTokens for BinOp {
         fn to_tokens(&self, tokens: &mut TokenStream) {
             match self {
@@ -427,7 +427,7 @@ 
Files

         }
     }
 
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "printing")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "printing")))]
     impl ToTokens for UnOp {
         fn to_tokens(&self, tokens: &mut TokenStream) {
             match self {
diff --git a/src/syn/parse.rs.html b/src/syn/parse.rs.html
index e6da3c05b8..f8f227f4eb 100644
--- a/src/syn/parse.rs.html
+++ b/src/syn/parse.rs.html
@@ -1,4 +1,4 @@
-parse.rs - source

     }
 }
 
-#[cfg_attr(doc_cfg, doc(cfg(feature = "parsing")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "parsing")))]
 impl<T: Parse> Parse for Box<T> {
     fn parse(input: ParseStream) -> Result<Self> {
         input.parse().map(Box::new)
     }
 }
 
-#[cfg_attr(doc_cfg, doc(cfg(feature = "parsing")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "parsing")))]
 impl<T: Parse + Token> Parse for Option<T> {
     fn parse(input: ParseStream) -> Result<Self> {
         if T::peek(input.cursor()) {
@@ -2571,14 +2571,14 @@ 
Files

     }
 }
 
-#[cfg_attr(doc_cfg, doc(cfg(feature = "parsing")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "parsing")))]
 impl Parse for TokenStream {
     fn parse(input: ParseStream) -> Result<Self> {
         input.step(|cursor| Ok((cursor.token_stream(), Cursor::empty())))
     }
 }
 
-#[cfg_attr(doc_cfg, doc(cfg(feature = "parsing")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "parsing")))]
 impl Parse for TokenTree {
     fn parse(input: ParseStream) -> Result<Self> {
         input.step(|cursor| match cursor.token_tree() {
@@ -2588,7 +2588,7 @@ 
Files

     }
 }
 
-#[cfg_attr(doc_cfg, doc(cfg(feature = "parsing")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "parsing")))]
 impl Parse for Group {
     fn parse(input: ParseStream) -> Result<Self> {
         input.step(|cursor| {
@@ -2602,7 +2602,7 @@ 
Files

     }
 }
 
-#[cfg_attr(doc_cfg, doc(cfg(feature = "parsing")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "parsing")))]
 impl Parse for Punct {
     fn parse(input: ParseStream) -> Result<Self> {
         input.step(|cursor| match cursor.punct() {
@@ -2612,7 +2612,7 @@ 
Files

     }
 }
 
-#[cfg_attr(doc_cfg, doc(cfg(feature = "parsing")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "parsing")))]
 impl Parse for Literal {
     fn parse(input: ParseStream) -> Result<Self> {
         input.step(|cursor| match cursor.literal() {
@@ -2641,7 +2641,7 @@ 
Files

     /// This function will check that the input is fully parsed. If there are
     /// any unparsed tokens at the end of the stream, an error is returned.
     #[cfg(feature = "proc-macro")]
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "proc-macro")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "proc-macro")))]
     fn parse(self, tokens: proc_macro::TokenStream) -> Result<Self::Output> {
         self.parse2(proc_macro2::TokenStream::from(tokens))
     }
@@ -2750,7 +2750,7 @@ 
Files

 }
 
 #[cfg(feature = "printing")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "printing")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "printing")))]
 impl ToTokens for Nothing {
     fn to_tokens(&self, tokens: &mut TokenStream) {
         let _ = tokens;
@@ -2758,7 +2758,7 @@ 
Files

 }
 
 #[cfg(feature = "clone-impls")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "clone-impls")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "clone-impls")))]
 impl Clone for Nothing {
     fn clone(&self) -> Self {
         *self
@@ -2766,11 +2766,11 @@ 
Files

 }
 
 #[cfg(feature = "clone-impls")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "clone-impls")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "clone-impls")))]
 impl Copy for Nothing {}
 
 #[cfg(feature = "extra-traits")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Debug for Nothing {
     fn fmt(&self, f: &mut fmt::Formatter) -> fmt::Result {
         f.write_str("Nothing")
@@ -2778,11 +2778,11 @@ 
Files

 }
 
 #[cfg(feature = "extra-traits")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Eq for Nothing {}
 
 #[cfg(feature = "extra-traits")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl PartialEq for Nothing {
     fn eq(&self, _other: &Self) -> bool {
         true
@@ -2790,7 +2790,7 @@ 
Files

 }
 
 #[cfg(feature = "extra-traits")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Hash for Nothing {
     fn hash<H: Hasher>(&self, _state: &mut H) {}
 }
diff --git a/src/syn/parse_macro_input.rs.html b/src/syn/parse_macro_input.rs.html
index 31a5dc4ce6..a8e39ea734 100644
--- a/src/syn/parse_macro_input.rs.html
+++ b/src/syn/parse_macro_input.rs.html
@@ -1,4 +1,4 @@
-parse_macro_input.rs - source

 /// # }
 /// ```
 #[macro_export]
-#[cfg_attr(doc_cfg, doc(cfg(all(feature = "parsing", feature = "proc-macro"))))]
+#[cfg_attr(docsrs, doc(cfg(all(feature = "parsing", feature = "proc-macro"))))]
 macro_rules! parse_macro_input {
     ($tokenstream:ident as $ty:ty) => {
         match $crate::parse::<$ty>($tokenstream) {
diff --git a/src/syn/parse_quote.rs.html b/src/syn/parse_quote.rs.html
index 4c41387ae5..26da7b49d6 100644
--- a/src/syn/parse_quote.rs.html
+++ b/src/syn/parse_quote.rs.html
@@ -1,4 +1,4 @@
-parse_quote.rs - source

 /// Panics if the tokens fail to parse as the expected syntax tree type. The
 /// caller is responsible for ensuring that the input tokens are syntactically
 /// valid.
-#[cfg_attr(doc_cfg, doc(cfg(all(feature = "parsing", feature = "printing"))))]
+#[cfg_attr(docsrs, doc(cfg(all(feature = "parsing", feature = "printing"))))]
 #[macro_export]
 macro_rules! parse_quote {
     ($($tt:tt)*) => {
@@ -308,7 +308,7 @@ 
Files

 ///     };
 /// }
 /// ```
-#[cfg_attr(doc_cfg, doc(cfg(all(feature = "parsing", feature = "printing"))))]
+#[cfg_attr(docsrs, doc(cfg(all(feature = "parsing", feature = "printing"))))]
 #[macro_export]
 macro_rules! parse_quote_spanned {
     ($span:expr=> $($tt:tt)*) => {
diff --git a/src/syn/pat.rs.html b/src/syn/pat.rs.html
index 6f9441f5dd..04aead51ae 100644
--- a/src/syn/pat.rs.html
+++ b/src/syn/pat.rs.html
@@ -1,4 +1,4 @@
-pat.rs - source

     /// This type is a [syntax tree enum].
     ///
     /// [syntax tree enum]: crate::expr::Expr#syntax-tree-enums
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "full")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "full")))]
     #[non_exhaustive]
     pub enum Pat {
         /// A const block: `const { ... }`.
@@ -1061,7 +1061,7 @@ 
Files

     ///
     /// It may also be a unit struct or struct variant (e.g. `None`), or a
     /// constant; these cannot be distinguished syntactically.
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "full")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "full")))]
     pub struct PatIdent {
         pub attrs: Vec<Attribute>,
         pub by_ref: Option<Token![ref]>,
@@ -1073,7 +1073,7 @@ 
Files

 
 ast_struct! {
     /// A pattern that matches any one of a set of cases.
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "full")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "full")))]
     pub struct PatOr {
         pub attrs: Vec<Attribute>,
         pub leading_vert: Option<Token![|]>,
@@ -1083,7 +1083,7 @@ 
Files

 
 ast_struct! {
     /// A parenthesized pattern: `(A | B)`.
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "full")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "full")))]
     pub struct PatParen {
         pub attrs: Vec<Attribute>,
         pub paren_token: token::Paren,
@@ -1093,7 +1093,7 @@ 
Files

 
 ast_struct! {
     /// A reference pattern: `&mut var`.
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "full")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "full")))]
     pub struct PatReference {
         pub attrs: Vec<Attribute>,
         pub and_token: Token![&],
@@ -1104,7 +1104,7 @@ 
Files

 
 ast_struct! {
     /// The dots in a tuple or slice pattern: `[0, 1, ..]`.
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "full")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "full")))]
     pub struct PatRest {
         pub attrs: Vec<Attribute>,
         pub dot2_token: Token![..],
@@ -1113,7 +1113,7 @@ 
Files

 
 ast_struct! {
     /// A dynamically sized slice pattern: `[a, b, ref i @ .., y, z]`.
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "full")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "full")))]
     pub struct PatSlice {
         pub attrs: Vec<Attribute>,
         pub bracket_token: token::Bracket,
@@ -1123,7 +1123,7 @@ 
Files

 
 ast_struct! {
     /// A struct or struct variant pattern: `Variant { x, y, .. }`.
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "full")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "full")))]
     pub struct PatStruct {
         pub attrs: Vec<Attribute>,
         pub qself: Option<QSelf>,
@@ -1136,7 +1136,7 @@ 
Files

 
 ast_struct! {
     /// A tuple pattern: `(a, b)`.
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "full")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "full")))]
     pub struct PatTuple {
         pub attrs: Vec<Attribute>,
         pub paren_token: token::Paren,
@@ -1146,7 +1146,7 @@ 
Files

 
 ast_struct! {
     /// A tuple struct or tuple variant pattern: `Variant(x, y, .., z)`.
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "full")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "full")))]
     pub struct PatTupleStruct {
         pub attrs: Vec<Attribute>,
         pub qself: Option<QSelf>,
@@ -1158,7 +1158,7 @@ 
Files

 
 ast_struct! {
     /// A type ascription pattern: `foo: f64`.
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "full")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "full")))]
     pub struct PatType {
         pub attrs: Vec<Attribute>,
         pub pat: Box<Pat>,
@@ -1169,7 +1169,7 @@ 
Files

 
 ast_struct! {
     /// A pattern that matches any value: `_`.
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "full")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "full")))]
     pub struct PatWild {
         pub attrs: Vec<Attribute>,
         pub underscore_token: Token![_],
@@ -1181,7 +1181,7 @@ 
Files

     ///
     /// Patterns like the fields of Foo `{ x, ref y, ref mut z }` are treated
     /// the same as `x: x, y: ref y, z: ref mut z` but there is no colon token.
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "full")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "full")))]
     pub struct FieldPat {
         pub attrs: Vec<Attribute>,
         pub member: Member,
@@ -1213,7 +1213,7 @@ 
Files

     use crate::verbatim;
     use proc_macro2::TokenStream;
 
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "parsing")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "parsing")))]
     impl Pat {
         /// Parse a pattern that does _not_ involve `|` at the top level.
         ///
@@ -1337,7 +1337,7 @@ 
Files

         }
     }
 
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "parsing")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "parsing")))]
     impl Parse for PatType {
         fn parse(input: ParseStream) -> Result<Self> {
             Ok(PatType {
@@ -1769,7 +1769,7 @@ 
Files

     use proc_macro2::TokenStream;
     use quote::{ToTokens, TokenStreamExt};
 
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "printing")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "printing")))]
     impl ToTokens for PatIdent {
         fn to_tokens(&self, tokens: &mut TokenStream) {
             tokens.append_all(self.attrs.outer());
@@ -1783,7 +1783,7 @@ 
Files

         }
     }
 
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "printing")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "printing")))]
     impl ToTokens for PatOr {
         fn to_tokens(&self, tokens: &mut TokenStream) {
             tokens.append_all(self.attrs.outer());
@@ -1792,7 +1792,7 @@ 
Files

         }
     }
 
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "printing")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "printing")))]
     impl ToTokens for PatParen {
         fn to_tokens(&self, tokens: &mut TokenStream) {
             tokens.append_all(self.attrs.outer());
@@ -1802,7 +1802,7 @@ 
Files

         }
     }
 
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "printing")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "printing")))]
     impl ToTokens for PatReference {
         fn to_tokens(&self, tokens: &mut TokenStream) {
             tokens.append_all(self.attrs.outer());
@@ -1812,7 +1812,7 @@ 
Files

         }
     }
 
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "printing")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "printing")))]
     impl ToTokens for PatRest {
         fn to_tokens(&self, tokens: &mut TokenStream) {
             tokens.append_all(self.attrs.outer());
@@ -1820,7 +1820,7 @@ 
Files

         }
     }
 
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "printing")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "printing")))]
     impl ToTokens for PatSlice {
         fn to_tokens(&self, tokens: &mut TokenStream) {
             tokens.append_all(self.attrs.outer());
@@ -1830,7 +1830,7 @@ 
Files

         }
     }
 
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "printing")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "printing")))]
     impl ToTokens for PatStruct {
         fn to_tokens(&self, tokens: &mut TokenStream) {
             tokens.append_all(self.attrs.outer());
@@ -1846,7 +1846,7 @@ 
Files

         }
     }
 
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "printing")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "printing")))]
     impl ToTokens for PatTuple {
         fn to_tokens(&self, tokens: &mut TokenStream) {
             tokens.append_all(self.attrs.outer());
@@ -1865,7 +1865,7 @@ 
Files

         }
     }
 
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "printing")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "printing")))]
     impl ToTokens for PatTupleStruct {
         fn to_tokens(&self, tokens: &mut TokenStream) {
             tokens.append_all(self.attrs.outer());
@@ -1876,7 +1876,7 @@ 
Files

         }
     }
 
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "printing")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "printing")))]
     impl ToTokens for PatType {
         fn to_tokens(&self, tokens: &mut TokenStream) {
             tokens.append_all(self.attrs.outer());
@@ -1886,7 +1886,7 @@ 
Files

         }
     }
 
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "printing")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "printing")))]
     impl ToTokens for PatWild {
         fn to_tokens(&self, tokens: &mut TokenStream) {
             tokens.append_all(self.attrs.outer());
@@ -1894,7 +1894,7 @@ 
Files

         }
     }
 
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "printing")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "printing")))]
     impl ToTokens for FieldPat {
         fn to_tokens(&self, tokens: &mut TokenStream) {
             tokens.append_all(self.attrs.outer());
diff --git a/src/syn/path.rs.html b/src/syn/path.rs.html
index 92f2b51fc6..f241a21265 100644
--- a/src/syn/path.rs.html
+++ b/src/syn/path.rs.html
@@ -1,4 +1,4 @@
-path.rs - source

 
 ast_struct! {
     /// A path at which a named item is exported (e.g. `std::collections::HashMap`).
-    #[cfg_attr(doc_cfg, doc(cfg(any(feature = "full", feature = "derive"))))]
+    #[cfg_attr(docsrs, doc(cfg(any(feature = "full", feature = "derive"))))]
     pub struct Path {
         pub leading_colon: Option<Token![::]>,
         pub segments: Punctuated<PathSegment, Token![::]>,
@@ -980,7 +980,7 @@ 
Files

 
     /// An error if this path is not a single ident, as defined in `get_ident`.
     #[cfg(feature = "parsing")]
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "parsing")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "parsing")))]
     pub fn require_ident(&self) -> Result<&Ident> {
         self.get_ident().ok_or_else(|| {
             crate::error::new2(
@@ -994,7 +994,7 @@ 
Files

 
 ast_struct! {
     /// A segment of a path together with any path arguments on that segment.
-    #[cfg_attr(doc_cfg, doc(cfg(any(feature = "full", feature = "derive"))))]
+    #[cfg_attr(docsrs, doc(cfg(any(feature = "full", feature = "derive"))))]
     pub struct PathSegment {
         pub ident: Ident,
         pub arguments: PathArguments,
@@ -1023,7 +1023,7 @@ 
Files

     /// ## Parenthesized
     ///
     /// The `(A, B) -> C` in `Fn(A, B) -> C`.
-    #[cfg_attr(doc_cfg, doc(cfg(any(feature = "full", feature = "derive"))))]
+    #[cfg_attr(docsrs, doc(cfg(any(feature = "full", feature = "derive"))))]
     pub enum PathArguments {
         None,
         /// The `<'a, T>` in `std::slice::iter<'a, T>`.
@@ -1058,7 +1058,7 @@ 
Files

 
 ast_enum! {
     /// An individual generic argument, like `'a`, `T`, or `Item = T`.
-    #[cfg_attr(doc_cfg, doc(cfg(any(feature = "full", feature = "derive"))))]
+    #[cfg_attr(docsrs, doc(cfg(any(feature = "full", feature = "derive"))))]
     #[non_exhaustive]
     pub enum GenericArgument {
         /// A lifetime argument.
@@ -1084,7 +1084,7 @@ 
Files

 ast_struct! {
     /// Angle bracketed arguments of a path segment: the `<K, V>` in `HashMap<K,
     /// V>`.
-    #[cfg_attr(doc_cfg, doc(cfg(any(feature = "full", feature = "derive"))))]
+    #[cfg_attr(docsrs, doc(cfg(any(feature = "full", feature = "derive"))))]
     pub struct AngleBracketedGenericArguments {
         pub colon2_token: Option<Token![::]>,
         pub lt_token: Token![<],
@@ -1096,7 +1096,7 @@ 
Files

 ast_struct! {
     /// A binding (equality constraint) on an associated type: the `Item = u8`
     /// in `Iterator<Item = u8>`.
-    #[cfg_attr(doc_cfg, doc(cfg(any(feature = "full", feature = "derive"))))]
+    #[cfg_attr(docsrs, doc(cfg(any(feature = "full", feature = "derive"))))]
     pub struct AssocType {
         pub ident: Ident,
         pub generics: Option<AngleBracketedGenericArguments>,
@@ -1108,7 +1108,7 @@ 
Files

 ast_struct! {
     /// An equality constraint on an associated constant: the `PANIC = false` in
     /// `Trait<PANIC = false>`.
-    #[cfg_attr(doc_cfg, doc(cfg(any(feature = "full", feature = "derive"))))]
+    #[cfg_attr(docsrs, doc(cfg(any(feature = "full", feature = "derive"))))]
     pub struct AssocConst {
         pub ident: Ident,
         pub generics: Option<AngleBracketedGenericArguments>,
@@ -1119,7 +1119,7 @@ 
Files

 
 ast_struct! {
     /// An associated type bound: `Iterator<Item: Display>`.
-    #[cfg_attr(doc_cfg, doc(cfg(any(feature = "full", feature = "derive"))))]
+    #[cfg_attr(docsrs, doc(cfg(any(feature = "full", feature = "derive"))))]
     pub struct Constraint {
         pub ident: Ident,
         pub generics: Option<AngleBracketedGenericArguments>,
@@ -1131,7 +1131,7 @@ 
Files

 ast_struct! {
     /// Arguments of a function path segment: the `(A, B) -> C` in `Fn(A,B) ->
     /// C`.
-    #[cfg_attr(doc_cfg, doc(cfg(any(feature = "full", feature = "derive"))))]
+    #[cfg_attr(docsrs, doc(cfg(any(feature = "full", feature = "derive"))))]
     pub struct ParenthesizedGenericArguments {
         pub paren_token: token::Paren,
         /// `(A, B)`
@@ -1158,7 +1158,7 @@ 
Files

     ///  ^~~~~~   ^
     ///  ty       position = 0
     /// ```
-    #[cfg_attr(doc_cfg, doc(cfg(any(feature = "full", feature = "derive"))))]
+    #[cfg_attr(docsrs, doc(cfg(any(feature = "full", feature = "derive"))))]
     pub struct QSelf {
         pub lt_token: Token![<],
         pub ty: Box<Type>,
@@ -1193,14 +1193,14 @@ 
Files

     #[cfg(not(feature = "full"))]
     use crate::verbatim;
 
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "parsing")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "parsing")))]
     impl Parse for Path {
         fn parse(input: ParseStream) -> Result<Self> {
             Self::parse_helper(input, false)
         }
     }
 
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "parsing")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "parsing")))]
     impl Parse for GenericArgument {
         fn parse(input: ParseStream) -> Result<Self> {
             if input.peek(Lifetime) && !input.peek2(Token![+]) {
@@ -1331,7 +1331,7 @@ 
Files

         /// The ordinary [`Parse`] impl for `AngleBracketedGenericArguments`
         /// parses optional leading `::`.
         #[cfg(feature = "full")]
-        #[cfg_attr(doc_cfg, doc(cfg(all(feature = "parsing", feature = "full"))))]
+        #[cfg_attr(docsrs, doc(cfg(all(feature = "parsing", feature = "full"))))]
         pub fn parse_turbofish(input: ParseStream) -> Result<Self> {
             let colon2_token: Token![::] = input.parse()?;
             Self::do_parse(Some(colon2_token), input)
@@ -1365,7 +1365,7 @@ 
Files

         }
     }
 
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "parsing")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "parsing")))]
     impl Parse for AngleBracketedGenericArguments {
         fn parse(input: ParseStream) -> Result<Self> {
             let colon2_token: Option<Token![::]> = input.parse()?;
@@ -1373,7 +1373,7 @@ 
Files

         }
     }
 
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "parsing")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "parsing")))]
     impl Parse for ParenthesizedGenericArguments {
         fn parse(input: ParseStream) -> Result<Self> {
             let content;
@@ -1385,7 +1385,7 @@ 
Files

         }
     }
 
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "parsing")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "parsing")))]
     impl Parse for PathSegment {
         fn parse(input: ParseStream) -> Result<Self> {
             Self::parse_helper(input, false)
@@ -1453,7 +1453,7 @@ 
Files

         ///     }
         /// }
         /// ```
-        #[cfg_attr(doc_cfg, doc(cfg(feature = "parsing")))]
+        #[cfg_attr(docsrs, doc(cfg(feature = "parsing")))]
         pub fn parse_mod_style(input: ParseStream) -> Result<Self> {
             Ok(Path {
                 leading_colon: input.parse()?,
@@ -1590,7 +1590,7 @@ 
Files

     use quote::ToTokens;
     use std::cmp;
 
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "printing")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "printing")))]
     impl ToTokens for Path {
         fn to_tokens(&self, tokens: &mut TokenStream) {
             self.leading_colon.to_tokens(tokens);
@@ -1598,7 +1598,7 @@ 
Files

         }
     }
 
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "printing")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "printing")))]
     impl ToTokens for PathSegment {
         fn to_tokens(&self, tokens: &mut TokenStream) {
             self.ident.to_tokens(tokens);
@@ -1606,7 +1606,7 @@ 
Files

         }
     }
 
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "printing")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "printing")))]
     impl ToTokens for PathArguments {
         fn to_tokens(&self, tokens: &mut TokenStream) {
             match self {
@@ -1621,7 +1621,7 @@ 
Files

         }
     }
 
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "printing")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "printing")))]
     impl ToTokens for GenericArgument {
         #[allow(clippy::match_same_arms)]
         fn to_tokens(&self, tokens: &mut TokenStream) {
@@ -1638,7 +1638,7 @@ 
Files

         }
     }
 
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "printing")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "printing")))]
     impl ToTokens for AngleBracketedGenericArguments {
         fn to_tokens(&self, tokens: &mut TokenStream) {
             self.colon2_token.to_tokens(tokens);
@@ -1681,7 +1681,7 @@ 
Files

         }
     }
 
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "printing")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "printing")))]
     impl ToTokens for AssocType {
         fn to_tokens(&self, tokens: &mut TokenStream) {
             self.ident.to_tokens(tokens);
@@ -1691,7 +1691,7 @@ 
Files

         }
     }
 
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "printing")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "printing")))]
     impl ToTokens for AssocConst {
         fn to_tokens(&self, tokens: &mut TokenStream) {
             self.ident.to_tokens(tokens);
@@ -1701,7 +1701,7 @@ 
Files

         }
     }
 
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "printing")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "printing")))]
     impl ToTokens for Constraint {
         fn to_tokens(&self, tokens: &mut TokenStream) {
             self.ident.to_tokens(tokens);
@@ -1711,7 +1711,7 @@ 
Files

         }
     }
 
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "printing")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "printing")))]
     impl ToTokens for ParenthesizedGenericArguments {
         fn to_tokens(&self, tokens: &mut TokenStream) {
             self.paren_token.surround(tokens, |tokens| {
@@ -1756,7 +1756,7 @@ 
Files

     }
 
     #[cfg(feature = "parsing")]
-    #[cfg_attr(doc_cfg, doc(cfg(all(feature = "parsing", feature = "printing"))))]
+    #[cfg_attr(docsrs, doc(cfg(all(feature = "parsing", feature = "printing"))))]
     impl Spanned for QSelf {
         fn span(&self) -> Span {
             struct QSelfDelimiters<'a>(&'a QSelf);
diff --git a/src/syn/precedence.rs.html b/src/syn/precedence.rs.html
index 87c2092eef..721344641f 100644
--- a/src/syn/precedence.rs.html
+++ b/src/syn/precedence.rs.html
@@ -1,4 +1,4 @@
-precedence.rs - source

     ///
     /// [`parse_terminated`]: Punctuated::parse_terminated
     #[cfg(feature = "parsing")]
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "parsing")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "parsing")))]
     pub fn parse_terminated_with(
         input: ParseStream,
         parser: fn(ParseStream) -> Result<T>,
@@ -1426,7 +1449,7 @@ 
Files

     /// is not followed by a `P`, even if there are remaining tokens in the
     /// stream.
     #[cfg(feature = "parsing")]
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "parsing")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "parsing")))]
     pub fn parse_separated_nonempty(input: ParseStream) -> Result<Self>
     where
         T: Parse,
@@ -1444,7 +1467,7 @@ 
Files

     ///
     /// [`parse_separated_nonempty`]: Punctuated::parse_separated_nonempty
     #[cfg(feature = "parsing")]
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "parsing")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "parsing")))]
     pub fn parse_separated_nonempty_with(
         input: ParseStream,
         parser: fn(ParseStream) -> Result<T>,
@@ -1469,7 +1492,7 @@ 
Files

 }
 
 #[cfg(feature = "clone-impls")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "clone-impls")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "clone-impls")))]
 impl<T, P> Clone for Punctuated<T, P>
 where
     T: Clone,
@@ -1489,7 +1512,7 @@ 
Files

 }
 
 #[cfg(feature = "extra-traits")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl<T, P> Eq for Punctuated<T, P>
 where
     T: Eq,
@@ -1498,7 +1521,7 @@ 
Files

 }
 
 #[cfg(feature = "extra-traits")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl<T, P> PartialEq for Punctuated<T, P>
 where
     T: PartialEq,
@@ -1511,7 +1534,7 @@ 
Files

 }
 
 #[cfg(feature = "extra-traits")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl<T, P> Hash for Punctuated<T, P>
 where
     T: Hash,
@@ -1525,7 +1548,7 @@ 
Files

 }
 
 #[cfg(feature = "extra-traits")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl<T: Debug, P: Debug> Debug for Punctuated<T, P> {
     fn fmt(&self, f: &mut fmt::Formatter) -> fmt::Result {
         let mut list = f.debug_list();
@@ -2118,7 +2141,7 @@ 
Files

 }
 
 #[cfg(feature = "clone-impls")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "clone-impls")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "clone-impls")))]
 impl<T, P> Pair<&T, &P> {
     pub fn cloned(self) -> Pair<T, P>
     where
@@ -2133,7 +2156,7 @@ 
Files

 }
 
 #[cfg(feature = "clone-impls")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "clone-impls")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "clone-impls")))]
 impl<T, P> Clone for Pair<T, P>
 where
     T: Clone,
@@ -2148,7 +2171,7 @@ 
Files

 }
 
 #[cfg(feature = "clone-impls")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "clone-impls")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "clone-impls")))]
 impl<T, P> Copy for Pair<T, P>
 where
     T: Copy,
@@ -2184,13 +2207,36 @@ 
Files

     }
 }
 
+#[cfg(all(feature = "fold", any(feature = "full", feature = "derive")))]
+pub(crate) fn fold<T, P, V, F>(
+    punctuated: Punctuated<T, P>,
+    fold: &mut V,
+    mut f: F,
+) -> Punctuated<T, P>
+where
+    V: ?Sized,
+    F: FnMut(&mut V, T) -> T,
+{
+    Punctuated {
+        inner: punctuated
+            .inner
+            .into_iter()
+            .map(|(t, p)| (f(fold, t), p))
+            .collect(),
+        last: match punctuated.last {
+            Some(t) => Some(Box::new(f(fold, *t))),
+            None => None,
+        },
+    }
+}
+
 #[cfg(feature = "printing")]
 mod printing {
     use crate::punctuated::{Pair, Punctuated};
     use proc_macro2::TokenStream;
     use quote::{ToTokens, TokenStreamExt};
 
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "printing")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "printing")))]
     impl<T, P> ToTokens for Punctuated<T, P>
     where
         T: ToTokens,
@@ -2201,7 +2247,7 @@ 
Files

         }
     }
 
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "printing")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "printing")))]
     impl<T, P> ToTokens for Pair<T, P>
     where
         T: ToTokens,
diff --git a/src/syn/restriction.rs.html b/src/syn/restriction.rs.html
index 87be582cb1..108661f28e 100644
--- a/src/syn/restriction.rs.html
+++ b/src/syn/restriction.rs.html
@@ -1,4 +1,4 @@
-restriction.rs - source

     /// This type is a [syntax tree enum].
     ///
     /// [syntax tree enum]: crate::expr::Expr#syntax-tree-enums
-    #[cfg_attr(doc_cfg, doc(cfg(any(feature = "full", feature = "derive"))))]
+    #[cfg_attr(docsrs, doc(cfg(any(feature = "full", feature = "derive"))))]
     pub enum Visibility {
         /// A public visibility level: `pub`.
         Public(Token![pub]),
@@ -205,7 +205,7 @@ 
Files

 ast_struct! {
     /// A visibility level restricted to some path: `pub(self)` or
     /// `pub(super)` or `pub(crate)` or `pub(in some::module)`.
-    #[cfg_attr(doc_cfg, doc(cfg(any(feature = "full", feature = "derive"))))]
+    #[cfg_attr(docsrs, doc(cfg(any(feature = "full", feature = "derive"))))]
     pub struct VisRestricted {
         pub pub_token: Token![pub],
         pub paren_token: token::Paren,
@@ -216,7 +216,7 @@ 
Files

 
 ast_enum! {
     /// Unused, but reserved for RFC 3323 restrictions.
-    #[cfg_attr(doc_cfg, doc(cfg(any(feature = "full", feature = "derive"))))]
+    #[cfg_attr(docsrs, doc(cfg(any(feature = "full", feature = "derive"))))]
     #[non_exhaustive]
     pub enum FieldMutability {
         None,
@@ -245,7 +245,7 @@ 
Files

     use crate::restriction::{VisRestricted, Visibility};
     use crate::token;
 
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "parsing")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "parsing")))]
     impl Parse for Visibility {
         fn parse(input: ParseStream) -> Result<Self> {
             // Recognize an empty None-delimited group, as produced by a $:vis
@@ -328,7 +328,7 @@ 
Files

     use proc_macro2::TokenStream;
     use quote::ToTokens;
 
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "printing")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "printing")))]
     impl ToTokens for Visibility {
         fn to_tokens(&self, tokens: &mut TokenStream) {
             match self {
@@ -339,7 +339,7 @@ 
Files

         }
     }
 
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "printing")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "printing")))]
     impl ToTokens for VisRestricted {
         fn to_tokens(&self, tokens: &mut TokenStream) {
             self.pub_token.to_tokens(tokens);
diff --git a/src/syn/sealed.rs.html b/src/syn/sealed.rs.html
index e9a871803e..e60820b520 100644
--- a/src/syn/sealed.rs.html
+++ b/src/syn/sealed.rs.html
@@ -1,4 +1,4 @@
-sealed.rs - source

     ///
     /// `LocalInit` represents `= s.parse()?` in `let x: u64 = s.parse()?` and
     /// `= r else { return }` in `let Ok(x) = r else { return }`.
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "full")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "full")))]
     pub struct LocalInit {
         pub eq_token: Token![=],
         pub expr: Box<Expr>,
@@ -552,7 +552,7 @@ 
Files

     /// Syntactically it's ambiguous which other kind of statement this macro
     /// would expand to. It can be any of local variable (`let`), item, or
     /// expression.
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "full")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "full")))]
     pub struct StmtMacro {
         pub attrs: Vec<Attribute>,
         pub mac: Macro,
@@ -630,7 +630,7 @@ 
Files

         ///     }
         /// }
         /// ```
-        #[cfg_attr(doc_cfg, doc(cfg(feature = "parsing")))]
+        #[cfg_attr(docsrs, doc(cfg(feature = "parsing")))]
         pub fn parse_within(input: ParseStream) -> Result<Vec<Stmt>> {
             let mut stmts = Vec::new();
             loop {
@@ -659,7 +659,7 @@ 
Files

         }
     }
 
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "parsing")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "parsing")))]
     impl Parse for Block {
         fn parse(input: ParseStream) -> Result<Self> {
             let content;
@@ -670,7 +670,7 @@ 
Files

         }
     }
 
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "parsing")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "parsing")))]
     impl Parse for Stmt {
         fn parse(input: ParseStream) -> Result<Self> {
             let allow_nosemi = AllowNoSemi(false);
@@ -902,7 +902,7 @@ 
Files

     use proc_macro2::TokenStream;
     use quote::{ToTokens, TokenStreamExt};
 
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "printing")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "printing")))]
     impl ToTokens for Block {
         fn to_tokens(&self, tokens: &mut TokenStream) {
             self.brace_token.surround(tokens, |tokens| {
@@ -911,7 +911,7 @@ 
Files

         }
     }
 
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "printing")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "printing")))]
     impl ToTokens for Stmt {
         fn to_tokens(&self, tokens: &mut TokenStream) {
             match self {
@@ -926,7 +926,7 @@ 
Files

         }
     }
 
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "printing")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "printing")))]
     impl ToTokens for Local {
         fn to_tokens(&self, tokens: &mut TokenStream) {
             expr::printing::outer_attrs_to_tokens(&self.attrs, tokens);
@@ -953,7 +953,7 @@ 
Files

         }
     }
 
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "printing")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "printing")))]
     impl ToTokens for StmtMacro {
         fn to_tokens(&self, tokens: &mut TokenStream) {
             expr::printing::outer_attrs_to_tokens(&self.attrs, tokens);
diff --git a/src/syn/thread.rs.html b/src/syn/thread.rs.html
index d9b9c67550..0b252c2715 100644
--- a/src/syn/thread.rs.html
+++ b/src/syn/thread.rs.html
@@ -1,4 +1,4 @@
-thread.rs - source

             }
 
             #[cfg(feature = "extra-traits")]
-            #[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+            #[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
             impl Debug for $name {
                 fn fmt(&self, f: &mut fmt::Formatter) -> fmt::Result {
                     f.write_str(stringify!($name))
@@ -1434,11 +1434,11 @@ 
Files

             }
 
             #[cfg(feature = "extra-traits")]
-            #[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+            #[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
             impl cmp::Eq for $name {}
 
             #[cfg(feature = "extra-traits")]
-            #[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+            #[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
             impl PartialEq for $name {
                 fn eq(&self, _other: &$name) -> bool {
                     true
@@ -1446,13 +1446,13 @@ 
Files

             }
 
             #[cfg(feature = "extra-traits")]
-            #[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+            #[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
             impl Hash for $name {
                 fn hash<H: Hasher>(&self, _state: &mut H) {}
             }
 
             #[cfg(feature = "printing")]
-            #[cfg_attr(doc_cfg, doc(cfg(feature = "printing")))]
+            #[cfg_attr(docsrs, doc(cfg(feature = "printing")))]
             impl ToTokens for $name {
                 fn to_tokens(&self, tokens: &mut TokenStream) {
                     printing::keyword($token, self.span, tokens);
@@ -1460,7 +1460,7 @@ 
Files

             }
 
             #[cfg(feature = "parsing")]
-            #[cfg_attr(doc_cfg, doc(cfg(feature = "parsing")))]
+            #[cfg_attr(docsrs, doc(cfg(feature = "parsing")))]
             impl Parse for $name {
                 fn parse(input: ParseStream) -> Result<Self> {
                     Ok($name {
@@ -1541,11 +1541,11 @@ 
Files

             }
 
             #[cfg(feature = "clone-impls")]
-            #[cfg_attr(doc_cfg, doc(cfg(feature = "clone-impls")))]
+            #[cfg_attr(docsrs, doc(cfg(feature = "clone-impls")))]
             impl Copy for $name {}
 
             #[cfg(feature = "clone-impls")]
-            #[cfg_attr(doc_cfg, doc(cfg(feature = "clone-impls")))]
+            #[cfg_attr(docsrs, doc(cfg(feature = "clone-impls")))]
             impl Clone for $name {
                 fn clone(&self) -> Self {
                     *self
@@ -1553,7 +1553,7 @@ 
Files

             }
 
             #[cfg(feature = "extra-traits")]
-            #[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+            #[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
             impl Debug for $name {
                 fn fmt(&self, f: &mut fmt::Formatter) -> fmt::Result {
                     f.write_str(stringify!($name))
@@ -1561,11 +1561,11 @@ 
Files

             }
 
             #[cfg(feature = "extra-traits")]
-            #[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+            #[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
             impl cmp::Eq for $name {}
 
             #[cfg(feature = "extra-traits")]
-            #[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+            #[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
             impl PartialEq for $name {
                 fn eq(&self, _other: &$name) -> bool {
                     true
@@ -1573,7 +1573,7 @@ 
Files

             }
 
             #[cfg(feature = "extra-traits")]
-            #[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+            #[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
             impl Hash for $name {
                 fn hash<H: Hasher>(&self, _state: &mut H) {}
             }
@@ -1591,7 +1591,7 @@ 
Files

             }
 
             #[cfg(feature = "printing")]
-            #[cfg_attr(doc_cfg, doc(cfg(feature = "printing")))]
+            #[cfg_attr(docsrs, doc(cfg(feature = "printing")))]
             impl ToTokens for $name {
                 fn to_tokens(&self, tokens: &mut TokenStream) {
                     printing::punct($token, &self.spans, tokens);
@@ -1599,7 +1599,7 @@ 
Files

             }
 
             #[cfg(feature = "parsing")]
-            #[cfg_attr(doc_cfg, doc(cfg(feature = "parsing")))]
+            #[cfg_attr(docsrs, doc(cfg(feature = "parsing")))]
             impl Parse for $name {
                 fn parse(input: ParseStream) -> Result<Self> {
                     Ok($name {
@@ -1648,11 +1648,11 @@ 
Files

             }
 
             #[cfg(feature = "clone-impls")]
-            #[cfg_attr(doc_cfg, doc(cfg(feature = "clone-impls")))]
+            #[cfg_attr(docsrs, doc(cfg(feature = "clone-impls")))]
             impl Copy for $name {}
 
             #[cfg(feature = "clone-impls")]
-            #[cfg_attr(doc_cfg, doc(cfg(feature = "clone-impls")))]
+            #[cfg_attr(docsrs, doc(cfg(feature = "clone-impls")))]
             impl Clone for $name {
                 fn clone(&self) -> Self {
                     *self
@@ -1660,7 +1660,7 @@ 
Files

             }
 
             #[cfg(feature = "extra-traits")]
-            #[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+            #[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
             impl Debug for $name {
                 fn fmt(&self, f: &mut fmt::Formatter) -> fmt::Result {
                     f.write_str(stringify!($name))
@@ -1668,11 +1668,11 @@ 
Files

             }
 
             #[cfg(feature = "extra-traits")]
-            #[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+            #[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
             impl cmp::Eq for $name {}
 
             #[cfg(feature = "extra-traits")]
-            #[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+            #[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
             impl PartialEq for $name {
                 fn eq(&self, _other: &$name) -> bool {
                     true
@@ -1680,7 +1680,7 @@ 
Files

             }
 
             #[cfg(feature = "extra-traits")]
-            #[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+            #[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
             impl Hash for $name {
                 fn hash<H: Hasher>(&self, _state: &mut H) {}
             }
@@ -1708,7 +1708,7 @@ 
Files

 }
 
 #[cfg(feature = "printing")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "printing")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "printing")))]
 impl ToTokens for Underscore {
     fn to_tokens(&self, tokens: &mut TokenStream) {
         tokens.append(Ident::new("_", self.span));
@@ -1716,7 +1716,7 @@ 
Files

 }
 
 #[cfg(feature = "parsing")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "parsing")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "parsing")))]
 impl Parse for Underscore {
     fn parse(input: ParseStream) -> Result<Self> {
         input.step(|cursor| {
@@ -1777,11 +1777,11 @@ 
Files

 }
 
 #[cfg(feature = "clone-impls")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "clone-impls")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "clone-impls")))]
 impl Copy for Group {}
 
 #[cfg(feature = "clone-impls")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "clone-impls")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "clone-impls")))]
 impl Clone for Group {
     fn clone(&self) -> Self {
         *self
@@ -1789,7 +1789,7 @@ 
Files

 }
 
 #[cfg(feature = "extra-traits")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Debug for Group {
     fn fmt(&self, f: &mut fmt::Formatter) -> fmt::Result {
         f.write_str("Group")
@@ -1797,11 +1797,11 @@ 
Files

 }
 
 #[cfg(feature = "extra-traits")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl cmp::Eq for Group {}
 
 #[cfg(feature = "extra-traits")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl PartialEq for Group {
     fn eq(&self, _other: &Group) -> bool {
         true
@@ -1809,7 +1809,7 @@ 
Files

 }
 
 #[cfg(feature = "extra-traits")]
-#[cfg_attr(doc_cfg, doc(cfg(feature = "extra-traits")))]
+#[cfg_attr(docsrs, doc(cfg(feature = "extra-traits")))]
 impl Hash for Group {
     fn hash<H: Hasher>(&self, _state: &mut H) {}
 }
diff --git a/src/syn/tt.rs.html b/src/syn/tt.rs.html
index 90a109b4d5..8cdf6b2a3c 100644
--- a/src/syn/tt.rs.html
+++ b/src/syn/tt.rs.html
@@ -1,4 +1,4 @@
-tt.rs - source

 
 ast_struct! {
     /// A fixed size array type: `[T; n]`.
-    #[cfg_attr(doc_cfg, doc(cfg(any(feature = "full", feature = "derive"))))]
+    #[cfg_attr(docsrs, doc(cfg(any(feature = "full", feature = "derive"))))]
     pub struct TypeArray {
         pub bracket_token: token::Bracket,
         pub elem: Box<Type>,
@@ -1320,7 +1320,7 @@ 
Files

 
 ast_struct! {
     /// A bare function type: `fn(usize) -> bool`.
-    #[cfg_attr(doc_cfg, doc(cfg(any(feature = "full", feature = "derive"))))]
+    #[cfg_attr(docsrs, doc(cfg(any(feature = "full", feature = "derive"))))]
     pub struct TypeBareFn {
         pub lifetimes: Option<BoundLifetimes>,
         pub unsafety: Option<Token![unsafe]>,
@@ -1335,7 +1335,7 @@ 
Files

 
 ast_struct! {
     /// A type contained within invisible delimiters.
-    #[cfg_attr(doc_cfg, doc(cfg(any(feature = "full", feature = "derive"))))]
+    #[cfg_attr(docsrs, doc(cfg(any(feature = "full", feature = "derive"))))]
     pub struct TypeGroup {
         pub group_token: token::Group,
         pub elem: Box<Type>,
@@ -1345,7 +1345,7 @@ 
Files

 ast_struct! {
     /// An `impl Bound1 + Bound2 + Bound3` type where `Bound` is a trait or
     /// a lifetime.
-    #[cfg_attr(doc_cfg, doc(cfg(any(feature = "full", feature = "derive"))))]
+    #[cfg_attr(docsrs, doc(cfg(any(feature = "full", feature = "derive"))))]
     pub struct TypeImplTrait {
         pub impl_token: Token![impl],
         pub bounds: Punctuated<TypeParamBound, Token![+]>,
@@ -1354,7 +1354,7 @@ 
Files

 
 ast_struct! {
     /// Indication that a type should be inferred by the compiler: `_`.
-    #[cfg_attr(doc_cfg, doc(cfg(any(feature = "full", feature = "derive"))))]
+    #[cfg_attr(docsrs, doc(cfg(any(feature = "full", feature = "derive"))))]
     pub struct TypeInfer {
         pub underscore_token: Token![_],
     }
@@ -1362,7 +1362,7 @@ 
Files

 
 ast_struct! {
     /// A macro in the type position.
-    #[cfg_attr(doc_cfg, doc(cfg(any(feature = "full", feature = "derive"))))]
+    #[cfg_attr(docsrs, doc(cfg(any(feature = "full", feature = "derive"))))]
     pub struct TypeMacro {
         pub mac: Macro,
     }
@@ -1370,7 +1370,7 @@ 
Files

 
 ast_struct! {
     /// The never type: `!`.
-    #[cfg_attr(doc_cfg, doc(cfg(any(feature = "full", feature = "derive"))))]
+    #[cfg_attr(docsrs, doc(cfg(any(feature = "full", feature = "derive"))))]
     pub struct TypeNever {
         pub bang_token: Token![!],
     }
@@ -1378,7 +1378,7 @@ 
Files

 
 ast_struct! {
     /// A parenthesized type equivalent to the inner type.
-    #[cfg_attr(doc_cfg, doc(cfg(any(feature = "full", feature = "derive"))))]
+    #[cfg_attr(docsrs, doc(cfg(any(feature = "full", feature = "derive"))))]
     pub struct TypeParen {
         pub paren_token: token::Paren,
         pub elem: Box<Type>,
@@ -1388,7 +1388,7 @@ 
Files

 ast_struct! {
     /// A path like `std::slice::Iter`, optionally qualified with a
     /// self-type as in `<Vec<T> as SomeTrait>::Associated`.
-    #[cfg_attr(doc_cfg, doc(cfg(any(feature = "full", feature = "derive"))))]
+    #[cfg_attr(docsrs, doc(cfg(any(feature = "full", feature = "derive"))))]
     pub struct TypePath {
         pub qself: Option<QSelf>,
         pub path: Path,
@@ -1397,7 +1397,7 @@ 
Files

 
 ast_struct! {
     /// A raw pointer type: `*const T` or `*mut T`.
-    #[cfg_attr(doc_cfg, doc(cfg(any(feature = "full", feature = "derive"))))]
+    #[cfg_attr(docsrs, doc(cfg(any(feature = "full", feature = "derive"))))]
     pub struct TypePtr {
         pub star_token: Token![*],
         pub const_token: Option<Token![const]>,
@@ -1408,7 +1408,7 @@ 
Files

 
 ast_struct! {
     /// A reference type: `&'a T` or `&'a mut T`.
-    #[cfg_attr(doc_cfg, doc(cfg(any(feature = "full", feature = "derive"))))]
+    #[cfg_attr(docsrs, doc(cfg(any(feature = "full", feature = "derive"))))]
     pub struct TypeReference {
         pub and_token: Token![&],
         pub lifetime: Option<Lifetime>,
@@ -1419,7 +1419,7 @@ 
Files

 
 ast_struct! {
     /// A dynamically sized slice type: `[T]`.
-    #[cfg_attr(doc_cfg, doc(cfg(any(feature = "full", feature = "derive"))))]
+    #[cfg_attr(docsrs, doc(cfg(any(feature = "full", feature = "derive"))))]
     pub struct TypeSlice {
         pub bracket_token: token::Bracket,
         pub elem: Box<Type>,
@@ -1429,7 +1429,7 @@ 
Files

 ast_struct! {
     /// A trait object type `dyn Bound1 + Bound2 + Bound3` where `Bound` is a
     /// trait or a lifetime.
-    #[cfg_attr(doc_cfg, doc(cfg(any(feature = "full", feature = "derive"))))]
+    #[cfg_attr(docsrs, doc(cfg(any(feature = "full", feature = "derive"))))]
     pub struct TypeTraitObject {
         pub dyn_token: Option<Token![dyn]>,
         pub bounds: Punctuated<TypeParamBound, Token![+]>,
@@ -1438,7 +1438,7 @@ 
Files

 
 ast_struct! {
     /// A tuple type: `(A, B, C, String)`.
-    #[cfg_attr(doc_cfg, doc(cfg(any(feature = "full", feature = "derive"))))]
+    #[cfg_attr(docsrs, doc(cfg(any(feature = "full", feature = "derive"))))]
     pub struct TypeTuple {
         pub paren_token: token::Paren,
         pub elems: Punctuated<Type, Token![,]>,
@@ -1447,7 +1447,7 @@ 
Files

 
 ast_struct! {
     /// The binary interface of a function: `extern "C"`.
-    #[cfg_attr(doc_cfg, doc(cfg(any(feature = "full", feature = "derive"))))]
+    #[cfg_attr(docsrs, doc(cfg(any(feature = "full", feature = "derive"))))]
     pub struct Abi {
         pub extern_token: Token![extern],
         pub name: Option<LitStr>,
@@ -1456,7 +1456,7 @@ 
Files

 
 ast_struct! {
     /// An argument in a function type: the `usize` in `fn(usize) -> bool`.
-    #[cfg_attr(doc_cfg, doc(cfg(any(feature = "full", feature = "derive"))))]
+    #[cfg_attr(docsrs, doc(cfg(any(feature = "full", feature = "derive"))))]
     pub struct BareFnArg {
         pub attrs: Vec<Attribute>,
         pub name: Option<(Ident, Token![:])>,
@@ -1466,7 +1466,7 @@ 
Files

 
 ast_struct! {
     /// The variadic argument of a function pointer like `fn(usize, ...)`.
-    #[cfg_attr(doc_cfg, doc(cfg(any(feature = "full", feature = "derive"))))]
+    #[cfg_attr(docsrs, doc(cfg(any(feature = "full", feature = "derive"))))]
     pub struct BareVariadic {
         pub attrs: Vec<Attribute>,
         pub name: Option<(Ident, Token![:])>,
@@ -1477,7 +1477,7 @@ 
Files

 
 ast_enum! {
     /// Return type of a function signature.
-    #[cfg_attr(doc_cfg, doc(cfg(any(feature = "full", feature = "derive"))))]
+    #[cfg_attr(docsrs, doc(cfg(any(feature = "full", feature = "derive"))))]
     pub enum ReturnType {
         /// Return type is not specified.
         ///
@@ -1510,7 +1510,7 @@ 
Files

     use crate::verbatim;
     use proc_macro2::Span;
 
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "parsing")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "parsing")))]
     impl Parse for Type {
         fn parse(input: ParseStream) -> Result<Self> {
             let allow_plus = true;
@@ -1525,7 +1525,7 @@ 
Files

         /// contain a `+` character.
         ///
         /// This parser does not allow a `+`, while the default parser does.
-        #[cfg_attr(doc_cfg, doc(cfg(feature = "parsing")))]
+        #[cfg_attr(docsrs, doc(cfg(feature = "parsing")))]
         pub fn without_plus(input: ParseStream) -> Result<Self> {
             let allow_plus = false;
             let allow_group_generic = true;
@@ -1807,7 +1807,7 @@ 
Files

         }
     }
 
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "parsing")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "parsing")))]
     impl Parse for TypeSlice {
         fn parse(input: ParseStream) -> Result<Self> {
             let content;
@@ -1818,7 +1818,7 @@ 
Files

         }
     }
 
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "parsing")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "parsing")))]
     impl Parse for TypeArray {
         fn parse(input: ParseStream) -> Result<Self> {
             let content;
@@ -1831,7 +1831,7 @@ 
Files

         }
     }
 
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "parsing")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "parsing")))]
     impl Parse for TypePtr {
         fn parse(input: ParseStream) -> Result<Self> {
             let star_token: Token![*] = input.parse()?;
@@ -1854,7 +1854,7 @@ 
Files

         }
     }
 
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "parsing")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "parsing")))]
     impl Parse for TypeReference {
         fn parse(input: ParseStream) -> Result<Self> {
             Ok(TypeReference {
@@ -1867,7 +1867,7 @@ 
Files

         }
     }
 
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "parsing")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "parsing")))]
     impl Parse for TypeBareFn {
         fn parse(input: ParseStream) -> Result<Self> {
             let args;
@@ -1914,7 +1914,7 @@ 
Files

         }
     }
 
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "parsing")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "parsing")))]
     impl Parse for TypeNever {
         fn parse(input: ParseStream) -> Result<Self> {
             Ok(TypeNever {
@@ -1923,7 +1923,7 @@ 
Files

         }
     }
 
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "parsing")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "parsing")))]
     impl Parse for TypeInfer {
         fn parse(input: ParseStream) -> Result<Self> {
             Ok(TypeInfer {
@@ -1932,7 +1932,7 @@ 
Files

         }
     }
 
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "parsing")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "parsing")))]
     impl Parse for TypeTuple {
         fn parse(input: ParseStream) -> Result<Self> {
             let content;
@@ -1965,7 +1965,7 @@ 
Files

         }
     }
 
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "parsing")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "parsing")))]
     impl Parse for TypeMacro {
         fn parse(input: ParseStream) -> Result<Self> {
             Ok(TypeMacro {
@@ -1974,7 +1974,7 @@ 
Files

         }
     }
 
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "parsing")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "parsing")))]
     impl Parse for TypePath {
         fn parse(input: ParseStream) -> Result<Self> {
             let expr_style = false;
@@ -1984,7 +1984,7 @@ 
Files

     }
 
     impl ReturnType {
-        #[cfg_attr(doc_cfg, doc(cfg(feature = "parsing")))]
+        #[cfg_attr(docsrs, doc(cfg(feature = "parsing")))]
         pub fn without_plus(input: ParseStream) -> Result<Self> {
             let allow_plus = false;
             Self::parse(input, allow_plus)
@@ -2002,7 +2002,7 @@ 
Files

         }
     }
 
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "parsing")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "parsing")))]
     impl Parse for ReturnType {
         fn parse(input: ParseStream) -> Result<Self> {
             let allow_plus = true;
@@ -2010,7 +2010,7 @@ 
Files

         }
     }
 
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "parsing")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "parsing")))]
     impl Parse for TypeTraitObject {
         fn parse(input: ParseStream) -> Result<Self> {
             let allow_plus = true;
@@ -2019,7 +2019,7 @@ 
Files

     }
 
     impl TypeTraitObject {
-        #[cfg_attr(doc_cfg, doc(cfg(feature = "parsing")))]
+        #[cfg_attr(docsrs, doc(cfg(feature = "parsing")))]
         pub fn without_plus(input: ParseStream) -> Result<Self> {
             let allow_plus = false;
             Self::parse(input, allow_plus)
@@ -2064,7 +2064,7 @@ 
Files

         }
     }
 
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "parsing")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "parsing")))]
     impl Parse for TypeImplTrait {
         fn parse(input: ParseStream) -> Result<Self> {
             let allow_plus = true;
@@ -2073,7 +2073,7 @@ 
Files

     }
 
     impl TypeImplTrait {
-        #[cfg_attr(doc_cfg, doc(cfg(feature = "parsing")))]
+        #[cfg_attr(docsrs, doc(cfg(feature = "parsing")))]
         pub fn without_plus(input: ParseStream) -> Result<Self> {
             let allow_plus = false;
             Self::parse(input, allow_plus)
@@ -2107,7 +2107,7 @@ 
Files

         }
     }
 
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "parsing")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "parsing")))]
     impl Parse for TypeGroup {
         fn parse(input: ParseStream) -> Result<Self> {
             let group = crate::group::parse_group(input)?;
@@ -2118,7 +2118,7 @@ 
Files

         }
     }
 
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "parsing")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "parsing")))]
     impl Parse for TypeParen {
         fn parse(input: ParseStream) -> Result<Self> {
             let allow_plus = false;
@@ -2139,7 +2139,7 @@ 
Files

         }
     }
 
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "parsing")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "parsing")))]
     impl Parse for BareFnArg {
         fn parse(input: ParseStream) -> Result<Self> {
             let allow_self = false;
@@ -2210,7 +2210,7 @@ 
Files

         })
     }
 
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "parsing")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "parsing")))]
     impl Parse for Abi {
         fn parse(input: ParseStream) -> Result<Self> {
             Ok(Abi {
@@ -2220,7 +2220,7 @@ 
Files

         }
     }
 
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "parsing")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "parsing")))]
     impl Parse for Option<Abi> {
         fn parse(input: ParseStream) -> Result<Self> {
             if input.peek(Token![extern]) {
@@ -2245,7 +2245,7 @@ 
Files

     use proc_macro2::TokenStream;
     use quote::{ToTokens, TokenStreamExt};
 
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "printing")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "printing")))]
     impl ToTokens for TypeSlice {
         fn to_tokens(&self, tokens: &mut TokenStream) {
             self.bracket_token.surround(tokens, |tokens| {
@@ -2254,7 +2254,7 @@ 
Files

         }
     }
 
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "printing")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "printing")))]
     impl ToTokens for TypeArray {
         fn to_tokens(&self, tokens: &mut TokenStream) {
             self.bracket_token.surround(tokens, |tokens| {
@@ -2265,7 +2265,7 @@ 
Files

         }
     }
 
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "printing")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "printing")))]
     impl ToTokens for TypePtr {
         fn to_tokens(&self, tokens: &mut TokenStream) {
             self.star_token.to_tokens(tokens);
@@ -2279,7 +2279,7 @@ 
Files

         }
     }
 
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "printing")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "printing")))]
     impl ToTokens for TypeReference {
         fn to_tokens(&self, tokens: &mut TokenStream) {
             self.and_token.to_tokens(tokens);
@@ -2289,7 +2289,7 @@ 
Files

         }
     }
 
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "printing")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "printing")))]
     impl ToTokens for TypeBareFn {
         fn to_tokens(&self, tokens: &mut TokenStream) {
             self.lifetimes.to_tokens(tokens);
@@ -2310,14 +2310,14 @@ 
Files

         }
     }
 
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "printing")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "printing")))]
     impl ToTokens for TypeNever {
         fn to_tokens(&self, tokens: &mut TokenStream) {
             self.bang_token.to_tokens(tokens);
         }
     }
 
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "printing")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "printing")))]
     impl ToTokens for TypeTuple {
         fn to_tokens(&self, tokens: &mut TokenStream) {
             self.paren_token.surround(tokens, |tokens| {
@@ -2331,14 +2331,14 @@ 
Files

         }
     }
 
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "printing")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "printing")))]
     impl ToTokens for TypePath {
         fn to_tokens(&self, tokens: &mut TokenStream) {
             path::printing::print_path(tokens, &self.qself, &self.path);
         }
     }
 
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "printing")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "printing")))]
     impl ToTokens for TypeTraitObject {
         fn to_tokens(&self, tokens: &mut TokenStream) {
             self.dyn_token.to_tokens(tokens);
@@ -2346,7 +2346,7 @@ 
Files

         }
     }
 
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "printing")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "printing")))]
     impl ToTokens for TypeImplTrait {
         fn to_tokens(&self, tokens: &mut TokenStream) {
             self.impl_token.to_tokens(tokens);
@@ -2354,7 +2354,7 @@ 
Files

         }
     }
 
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "printing")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "printing")))]
     impl ToTokens for TypeGroup {
         fn to_tokens(&self, tokens: &mut TokenStream) {
             self.group_token.surround(tokens, |tokens| {
@@ -2363,7 +2363,7 @@ 
Files

         }
     }
 
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "printing")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "printing")))]
     impl ToTokens for TypeParen {
         fn to_tokens(&self, tokens: &mut TokenStream) {
             self.paren_token.surround(tokens, |tokens| {
@@ -2372,21 +2372,21 @@ 
Files

         }
     }
 
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "printing")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "printing")))]
     impl ToTokens for TypeInfer {
         fn to_tokens(&self, tokens: &mut TokenStream) {
             self.underscore_token.to_tokens(tokens);
         }
     }
 
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "printing")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "printing")))]
     impl ToTokens for TypeMacro {
         fn to_tokens(&self, tokens: &mut TokenStream) {
             self.mac.to_tokens(tokens);
         }
     }
 
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "printing")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "printing")))]
     impl ToTokens for ReturnType {
         fn to_tokens(&self, tokens: &mut TokenStream) {
             match self {
@@ -2399,7 +2399,7 @@ 
Files

         }
     }
 
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "printing")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "printing")))]
     impl ToTokens for BareFnArg {
         fn to_tokens(&self, tokens: &mut TokenStream) {
             tokens.append_all(self.attrs.outer());
@@ -2411,7 +2411,7 @@ 
Files

         }
     }
 
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "printing")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "printing")))]
     impl ToTokens for BareVariadic {
         fn to_tokens(&self, tokens: &mut TokenStream) {
             tokens.append_all(self.attrs.outer());
@@ -2424,7 +2424,7 @@ 
Files

         }
     }
 
-    #[cfg_attr(doc_cfg, doc(cfg(feature = "printing")))]
+    #[cfg_attr(docsrs, doc(cfg(feature = "printing")))]
     impl ToTokens for Abi {
         fn to_tokens(&self, tokens: &mut TokenStream) {
             self.extern_token.to_tokens(tokens);
diff --git a/src/syn/verbatim.rs.html b/src/syn/verbatim.rs.html
index 2f8bbf980e..b1e75fabe4 100644
--- a/src/syn/verbatim.rs.html
+++ b/src/syn/verbatim.rs.html
@@ -1,4 +1,4 @@
-verbatim.rs - source