From 63f2e8b1b31e275d36426054c75bcd8292031ddd Mon Sep 17 00:00:00 2001 From: edg-l Date: Sun, 26 May 2024 15:24:04 +0000 Subject: [PATCH] deploy: 21eb2e9df9c5f3904055dc274dc0b174d1a504c3 --- anyhow/all.html | 2 +- anyhow/fn.Ok.html | 2 +- anyhow/index.html | 4 +- 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 +- edb/all.html | 2 +- edb/config/index.html | 2 +- edb/config/struct.Config.html | 2 +- edb/config/struct.Package.html | 2 +- edb/config/struct.Profile.html | 2 +- edb/enum.Commands.html | 2 +- edb/fn.get_platform_library_ext.html | 2 +- edb/fn.main.html | 2 +- edb/index.html | 2 +- edb/struct.Cli.html | 2 +- edlang_ast/all.html | 2 +- edlang_ast/enum.ArithOp.html | 2 +- edlang_ast/enum.BinaryOp.html | 2 +- edlang_ast/enum.BitwiseOp.html | 2 +- edlang_ast/enum.CmpOp.html | 2 +- edlang_ast/enum.Expression.html | 2 +- edlang_ast/enum.LogicOp.html | 2 +- edlang_ast/enum.ModuleStatement.html | 2 +- edlang_ast/enum.PathSegment.html | 2 +- edlang_ast/enum.Statement.html | 2 +- edlang_ast/enum.Type.html | 2 +- edlang_ast/enum.TypeQualifier.html | 2 +- edlang_ast/enum.UnaryOp.html | 2 +- edlang_ast/enum.ValueExpr.html | 2 +- edlang_ast/index.html | 2 +- edlang_ast/struct.ArrayInitExpr.html | 2 +- edlang_ast/struct.AssignStmt.html | 2 +- edlang_ast/struct.Block.html | 2 +- edlang_ast/struct.Constant.html | 2 +- edlang_ast/struct.FnCallExpr.html | 2 +- edlang_ast/struct.FnParam.html | 2 +- edlang_ast/struct.ForStmt.html | 2 +- edlang_ast/struct.Function.html | 2 +- edlang_ast/struct.Ident.html | 2 +- edlang_ast/struct.IfStmt.html | 2 +- edlang_ast/struct.Import.html | 2 +- edlang_ast/struct.LetStmt.html | 2 +- edlang_ast/struct.Module.html | 2 +- edlang_ast/struct.PathExpr.html | 2 +- edlang_ast/struct.ReturnStmt.html | 2 +- edlang_ast/struct.Span.html | 2 +- edlang_ast/struct.Struct.html | 2 +- edlang_ast/struct.StructField.html | 2 +- edlang_ast/struct.StructImpl.html | 2 +- edlang_ast/struct.StructInitExpr.html | 2 +- edlang_ast/struct.StructInitField.html | 2 +- edlang_ast/struct.WhileStmt.html | 2 +- edlang_check/all.html | 2 +- edlang_check/fn.lowering_error_to_report.html | 2 +- edlang_check/index.html | 2 +- edlang_codegen_llvm/all.html | 2 +- edlang_codegen_llvm/codegen/fn.compile.html | 2 +- edlang_codegen_llvm/codegen/index.html | 2 +- edlang_codegen_llvm/fn.compile.html | 2 +- edlang_codegen_llvm/index.html | 2 +- edlang_driver/all.html | 2 +- edlang_driver/fn.compile.html | 2 +- edlang_driver/fn.main.html | 2 +- edlang_driver/fn.parse_file.html | 2 +- edlang_driver/index.html | 2 +- edlang_driver/linker/fn.link_binary.html | 2 +- edlang_driver/linker/fn.link_shared_lib.html | 2 +- edlang_driver/linker/index.html | 2 +- edlang_driver/struct.CompilerArgs.html | 2 +- edlang_ir/all.html | 2 +- edlang_ir/enum.BinOp.html | 2 +- edlang_ir/enum.ConstKind.html | 2 +- edlang_ir/enum.ConstValue.html | 2 +- edlang_ir/enum.FloatTy.html | 2 +- edlang_ir/enum.IntTy.html | 2 +- edlang_ir/enum.LocalKind.html | 2 +- edlang_ir/enum.LogicalOp.html | 2 +- edlang_ir/enum.Operand.html | 2 +- edlang_ir/enum.PlaceElem.html | 2 +- edlang_ir/enum.RValue.html | 2 +- edlang_ir/enum.StatementKind.html | 2 +- edlang_ir/enum.Terminator.html | 2 +- edlang_ir/enum.TypeKind.html | 4 +- edlang_ir/enum.UintTy.html | 2 +- edlang_ir/enum.UnOp.html | 2 +- edlang_ir/enum.ValueTree.html | 2 +- edlang_ir/index.html | 2 +- edlang_ir/scalar_int/fn.sign_extend.html | 2 +- edlang_ir/scalar_int/fn.truncate.html | 2 +- edlang_ir/scalar_int/index.html | 2 +- edlang_ir/scalar_int/struct.ScalarInt.html | 2 +- edlang_ir/struct.AdtBody.html | 2 +- edlang_ir/struct.AdtVariant.html | 2 +- edlang_ir/struct.BasicBlock.html | 2 +- edlang_ir/struct.Body.html | 2 +- edlang_ir/struct.ConstData.html | 2 +- edlang_ir/struct.DebugInfo.html | 2 +- edlang_ir/struct.DefId.html | 2 +- edlang_ir/struct.Local.html | 2 +- edlang_ir/struct.ModuleBody.html | 2 +- edlang_ir/struct.Place.html | 2 +- edlang_ir/struct.ProgramBody.html | 2 +- edlang_ir/struct.Statement.html | 2 +- edlang_ir/struct.SwitchTarget.html | 2 +- edlang_ir/struct.SymbolTable.html | 2 +- edlang_ir/struct.TypeInfo.html | 2 +- edlang_lowering/all.html | 2 +- .../errors/enum.LoweringError.html | 2 +- edlang_lowering/errors/index.html | 2 +- edlang_lowering/fn.lower_modules.html | 2 +- edlang_lowering/fn.lower_type.html | 2 +- edlang_lowering/index.html | 2 +- edlang_parser/all.html | 2 +- edlang_parser/error/index.html | 2 +- edlang_parser/error/type.Error.html | 2 +- edlang_parser/fn.error_to_report.html | 2 +- edlang_parser/fn.parse_ast.html | 2 +- edlang_parser/fn.print_report.html | 2 +- edlang_parser/grammar/grammar/index.html | 2 +- .../struct.BinaryFirstLvlOpParser.html | 6 +- .../struct.BinarySecondLvlOpParser.html | 6 +- .../struct.BinaryThirdLvlOpParser.html | 6 +- .../grammar/grammar/struct.ModuleParser.html | 6 +- .../grammar/struct.PathSegmentsParser.html | 6 +- .../grammar/struct.StructImplParser.html | 6 +- .../grammar/struct.TopLevelModuleParser.html | 6 +- .../grammar/grammar/struct.UnaryOpParser.html | 6 +- .../grammar/grammar/trait.__ToTriple.html | 10 +- edlang_parser/grammar/index.html | 2 +- edlang_parser/index.html | 2 +- edlang_parser/lexer/enum.LexicalError.html | 4 +- edlang_parser/lexer/index.html | 2 +- edlang_parser/lexer/struct.Lexer.html | 265 +- edlang_parser/lexer/type.Spanned.html | 2 +- edlang_parser/tokens/enum.LexingError.html | 4 +- edlang_parser/tokens/enum.Token.html | 2 +- edlang_parser/tokens/index.html | 2 +- edlang_session/all.html | 2 +- edlang_session/enum.DebugInfo.html | 2 +- edlang_session/enum.OptLevel.html | 2 +- edlang_session/index.html | 2 +- edlang_session/struct.Session.html | 2 +- edlang_span/all.html | 2 +- edlang_span/index.html | 2 +- edlang_span/struct.Span.html | 2 +- edlangc/all.html | 2 +- edlangc/fn.main.html | 2 +- edlangc/index.html | 2 +- inkwell/attributes/index.html | 2 +- inkwell/builder/enum.BuilderError.html | 2 +- inkwell/builder/struct.Builder.html | 4 +- inkwell/context/index.html | 2 +- inkwell/context/struct.Context.html | 88 +- inkwell/context/struct.ContextRef.html | 82 +- inkwell/context/trait.AsContextRef.html | 6 +- .../debug_info/enum.DWARFEmissionKind.html | 12 +- .../debug_info/enum.DWARFSourceLanguage.html | 12 +- inkwell/debug_info/index.html | 2 +- inkwell/debug_info/struct.DIBasicType.html | 8 +- inkwell/debug_info/struct.DICompileUnit.html | 8 +- .../debug_info/struct.DICompositeType.html | 8 +- inkwell/debug_info/struct.DIDerivedType.html | 6 +- inkwell/debug_info/struct.DIExpression.html | 8 +- inkwell/debug_info/struct.DIFile.html | 8 +- .../struct.DIGlobalVariableExpression.html | 8 +- inkwell/debug_info/struct.DILexicalBlock.html | 8 +- .../debug_info/struct.DILocalVariable.html | 8 +- inkwell/debug_info/struct.DILocation.html | 8 +- inkwell/debug_info/struct.DINamespace.html | 8 +- inkwell/debug_info/struct.DISubprogram.html | 8 +- .../debug_info/struct.DISubroutineType.html | 6 +- inkwell/debug_info/struct.DIType.html | 8 +- .../debug_info/struct.DebugInfoBuilder.html | 52 +- inkwell/debug_info/trait.AsDIScope.html | 4 +- .../debug_info/trait.DIFlagsConstants.html | 4 +- inkwell/debug_info/type.DIFlags.html | 2 +- inkwell/enum.AtomicOrdering.html | 12 +- inkwell/enum.AtomicRMWBinOp.html | 12 +- inkwell/enum.DLLStorageClass.html | 14 +- inkwell/enum.FloatPredicate.html | 12 +- inkwell/enum.GlobalVisibility.html | 14 +- inkwell/enum.InlineAsmDialect.html | 12 +- inkwell/enum.IntPredicate.html | 12 +- inkwell/enum.OptimizationLevel.html | 8 +- inkwell/enum.ThreadLocalMode.html | 6 +- inkwell/index.html | 2 +- inkwell/memory_buffer/index.html | 2 +- .../memory_buffer/struct.MemoryBuffer.html | 12 +- inkwell/module/enum.FlagBehavior.html | 12 +- inkwell/module/index.html | 2 +- inkwell/module/struct.FunctionIterator.html | 4 +- inkwell/module/struct.GlobalIterator.html | 4 +- inkwell/module/struct.Module.html | 52 +- inkwell/object_file/index.html | 2 +- inkwell/object_file/struct.ObjectFile.html | 2 +- inkwell/object_file/struct.Relocation.html | 4 +- .../struct.RelocationIterator.html | 6 +- inkwell/object_file/struct.Section.html | 4 +- .../object_file/struct.SectionIterator.html | 4 +- inkwell/object_file/struct.Symbol.html | 2 +- .../object_file/struct.SymbolIterator.html | 4 +- inkwell/struct.AddressSpace.html | 6 +- inkwell/support/enum.LoadLibraryError.html | 6 +- inkwell/support/error_handling/index.html | 2 +- .../fn.enable_llvm_pretty_stack_trace.html | 2 +- inkwell/support/fn.get_llvm_version.html | 2 +- inkwell/support/fn.is_multithreaded.html | 2 +- .../support/fn.load_library_permanently.html | 2 +- inkwell/support/fn.load_visible_symbols.html | 2 +- .../fn.search_for_address_of_symbol.html | 2 +- inkwell/support/fn.shutdown_llvm.html | 2 +- inkwell/support/index.html | 2 +- inkwell/support/struct.LLVMString.html | 4 +- inkwell/targets/enum.ByteOrdering.html | 6 +- inkwell/targets/enum.CodeModel.html | 6 +- inkwell/targets/enum.FileType.html | 6 +- inkwell/targets/enum.RelocMode.html | 6 +- inkwell/targets/index.html | 2 +- .../targets/struct.InitializationConfig.html | 6 +- inkwell/targets/struct.Target.html | 10 +- inkwell/targets/struct.TargetData.html | 12 +- inkwell/targets/struct.TargetMachine.html | 16 +- .../targets/struct.TargetMachineOptions.html | 4 +- inkwell/targets/struct.TargetTriple.html | 4 +- inkwell/types/enum.AnyTypeEnum.html | 4 +- inkwell/types/enum.BasicMetadataTypeEnum.html | 4 +- inkwell/types/enum.BasicTypeEnum.html | 4 +- inkwell/types/enum.StringRadix.html | 10 +- inkwell/types/index.html | 2 +- inkwell/types/struct.ArrayType.html | 39 +- inkwell/types/struct.FieldTypesIter.html | 4 +- inkwell/types/struct.FloatType.html | 10 +- inkwell/types/struct.IntType.html | 46 +- inkwell/types/struct.MetadataType.html | 2 +- inkwell/types/struct.PointerType.html | 10 +- inkwell/types/struct.StructType.html | 10 +- inkwell/types/struct.VectorType.html | 12 +- inkwell/types/trait.AsTypeRef.html | 2 +- ...onstant.FIRST_CUSTOM_METADATA_KIND_ID.html | 7 +- inkwell/values/enum.AggregateValueEnum.html | 18 +- inkwell/values/enum.AnyValueEnum.html | 80 +- .../values/enum.BasicMetadataValueEnum.html | 56 +- inkwell/values/enum.BasicValueEnum.html | 46 +- inkwell/values/index.html | 5 +- inkwell/values/struct.ArrayValue.html | 80 +- inkwell/values/struct.BasicValueUse.html | 6 +- inkwell/values/struct.FloatValue.html | 44 +- inkwell/values/struct.FunctionValue.html | 8 +- inkwell/values/struct.GlobalValue.html | 2 +- inkwell/values/struct.InstructionValue.html | 98 +- inkwell/values/struct.IntValue.html | 28 +- inkwell/values/struct.MetadataValue.html | 26 +- inkwell/values/struct.OperandIter.html | 4 +- inkwell/values/struct.OperandUseIter.html | 4 +- inkwell/values/struct.PhiValue.html | 10 +- inkwell/values/struct.PointerValue.html | 26 +- inkwell/values/struct.StructValue.html | 30 +- inkwell/values/struct.VectorValue.html | 36 +- inkwell/values/trait.AsValueRef.html | 2 +- itertools/adaptors/map/type.MapResults.html | 11 - itertools/adaptors/struct.Step.html | 11 - itertools/all.html | 4 +- itertools/enum.Diff.html | 2 +- itertools/enum.Either.html | 262 +- itertools/enum.EitherOrBoth.html | 2 +- itertools/enum.FoldWhile.html | 12 +- itertools/enum.MinMaxResult.html | 2 +- itertools/enum.Position.html | 2 +- itertools/fn.all.html | 2 +- itertools/fn.any.html | 2 +- itertools/fn.assert_equal.html | 6 +- itertools/fn.chain.html | 2 +- itertools/fn.cloned.html | 4 +- itertools/fn.concat.html | 2 +- itertools/fn.cons_tuples.html | 4 +- itertools/fn.diff_with.html | 4 +- itertools/fn.enumerate.html | 2 +- itertools/fn.equal.html | 4 +- itertools/fn.fold.html | 2 +- itertools/fn.interleave.html | 6 +- itertools/fn.intersperse.html | 2 +- itertools/fn.intersperse_with.html | 2 +- itertools/fn.iterate.html | 4 +- itertools/fn.join.html | 4 +- itertools/fn.kmerge.html | 2 +- itertools/fn.kmerge_by.html | 2 +- itertools/fn.max.html | 2 +- itertools/fn.merge.html | 2 +- itertools/fn.merge_join_by.html | 2 +- itertools/fn.min.html | 2 +- itertools/fn.multipeek.html | 2 +- itertools/fn.multiunzip.html | 2 +- itertools/fn.multizip.html | 8 +- itertools/fn.partition.html | 4 +- itertools/fn.peek_nth.html | 2 +- itertools/fn.process_results.html | 4 +- itertools/fn.put_back.html | 4 +- itertools/fn.put_back_n.html | 2 +- itertools/fn.rciter.html | 2 +- itertools/fn.repeat_call.html | 22 - itertools/fn.repeat_n.html | 2 +- itertools/fn.rev.html | 2 +- itertools/fn.sorted.html | 2 +- itertools/fn.sorted_unstable.html | 8 +- itertools/fn.unfold.html | 6 +- itertools/fn.zip.html | 2 +- itertools/fn.zip_eq.html | 7 +- itertools/groupbylazy/struct.ChunkBy.html | 11 + itertools/groupbylazy/struct.GroupBy.html | 11 - itertools/groupbylazy/type.GroupBy.html | 11 + itertools/index.html | 27 +- itertools/iter_index/trait.IteratorIndex.html | 11 + itertools/macro.chain.html | 4 +- itertools/macro.iproduct.html | 11 +- itertools/macro.izip.html | 4 +- itertools/sidebar-items.js | 2 +- itertools/sources/fn.repeat_call.html | 11 - itertools/sources/struct.RepeatCall.html | 11 - itertools/structs/index.html | 21 +- itertools/structs/sidebar-items.js | 2 +- itertools/structs/struct.Batching.html | 272 +- itertools/structs/struct.Chunk.html | 270 +- ...truct.GroupBy.html => struct.ChunkBy.html} | 18 +- itertools/structs/struct.Chunks.html | 270 +- .../structs/struct.CircularTupleWindows.html | 262 +- itertools/structs/struct.Combinations.html | 272 +- .../struct.CombinationsWithReplacement.html | 270 +- itertools/structs/struct.ConsTuples.html | 2048 +++++----- itertools/structs/struct.ExactlyOneError.html | 262 +- itertools/structs/struct.FilterMapOk.html | 274 +- itertools/structs/struct.FilterOk.html | 274 +- itertools/structs/struct.FlattenOk.html | 292 +- itertools/structs/struct.Format.html | 24 +- itertools/structs/struct.FormatWith.html | 10 +- itertools/structs/struct.Group.html | 270 +- itertools/structs/struct.GroupingMap.html | 50 +- itertools/structs/struct.Groups.html | 270 +- itertools/structs/struct.Interleave.html | 270 +- .../structs/struct.InterleaveShortest.html | 274 +- itertools/structs/struct.IntersperseWith.html | 262 +- itertools/structs/struct.IntoChunks.html | 12 +- itertools/structs/struct.Iterate.html | 270 +- itertools/structs/struct.KMergeBy.html | 262 +- itertools/structs/struct.MergeBy.html | 280 +- itertools/structs/struct.MultiPeek.html | 266 +- itertools/structs/struct.MultiProduct.html | 278 +- itertools/structs/struct.PadUsing.html | 262 +- itertools/structs/struct.PeekNth.html | 274 +- .../structs/struct.PeekingTakeWhile.html | 266 +- itertools/structs/struct.Permutations.html | 262 +- itertools/structs/struct.Positions.html | 276 +- itertools/structs/struct.Powerset.html | 276 +- itertools/structs/struct.ProcessResults.html | 275 +- itertools/structs/struct.Product.html | 274 +- itertools/structs/struct.PutBack.html | 288 +- itertools/structs/struct.PutBackN.html | 272 +- itertools/structs/struct.RcIter.html | 262 +- itertools/structs/struct.RepeatCall.html | 670 --- itertools/structs/struct.RepeatN.html | 266 +- itertools/structs/struct.Step.html | 675 ---- .../structs/struct.TakeWhileInclusive.html | 267 +- itertools/structs/struct.TakeWhileRef.html | 270 +- itertools/structs/struct.Tee.html | 262 +- itertools/structs/struct.TupleBuffer.html | 262 +- .../structs/struct.TupleCombinations.html | 274 +- itertools/structs/struct.TupleWindows.html | 262 +- itertools/structs/struct.Tuples.html | 262 +- itertools/structs/struct.Unfold.html | 274 +- itertools/structs/struct.Unique.html | 262 +- itertools/structs/struct.UniqueBy.html | 262 +- itertools/structs/struct.Update.html | 280 +- itertools/structs/struct.WhileSome.html | 268 +- itertools/structs/struct.WithPosition.html | 262 +- itertools/structs/struct.Zip.html | 3590 +++++++++-------- itertools/structs/struct.ZipEq.html | 271 +- itertools/structs/struct.ZipLongest.html | 277 +- itertools/structs/type.Coalesce.html | 2 +- itertools/structs/type.Dedup.html | 2 +- itertools/structs/type.DedupBy.html | 2 +- itertools/structs/type.DedupByWithCount.html | 2 +- itertools/structs/type.DedupWithCount.html | 2 +- itertools/structs/type.Duplicates.html | 2 +- itertools/structs/type.DuplicatesBy.html | 2 +- itertools/structs/type.GroupBy.html | 3 + itertools/structs/type.GroupingMapBy.html | 4 +- itertools/structs/type.Intersperse.html | 2 +- itertools/structs/type.KMerge.html | 2 +- itertools/structs/type.MapInto.html | 4 +- itertools/structs/type.MapOk.html | 2 +- itertools/structs/type.MapResults.html | 3 - itertools/structs/type.Merge.html | 2 +- itertools/structs/type.MergeJoinBy.html | 2 +- itertools/trait.Itertools.html | 586 ++- itertools/trait.MultiUnzip.html | 2 +- itertools/trait.PeekingNext.html | 8 +- itertools/traits/index.html | 7 +- itertools/traits/sidebar-items.js | 2 +- itertools/traits/trait.HomogeneousTuple.html | 2 +- itertools/traits/trait.IteratorIndex.html | 20 + regex_syntax/ast/enum.ErrorKind.html | 2 +- regex_syntax/enum.Error.html | 2 +- regex_syntax/hir/literal/struct.Literal.html | 2 +- regex_syntax/hir/struct.Hir.html | 4 +- regex_syntax/struct.UnicodeWordError.html | 2 +- search-index.js | 12 +- src-files.js | 2 +- src/anyhow/backtrace.rs.html | 2 +- src/anyhow/chain.rs.html | 2 +- src/anyhow/context.rs.html | 2 +- src/anyhow/ensure.rs.html | 360 +- src/anyhow/error.rs.html | 2 +- src/anyhow/fmt.rs.html | 2 +- src/anyhow/kind.rs.html | 2 +- src/anyhow/lib.rs.html | 60 +- src/anyhow/macros.rs.html | 2 +- src/anyhow/ptr.rs.html | 2 +- src/anyhow/wrapper.rs.html | 2 +- .../out/grammar.rs.html | 2 +- src/inkwell/attributes.rs.html | 14 +- src/inkwell/basic_block.rs.html | 2 +- src/inkwell/builder.rs.html | 10 +- src/inkwell/comdat.rs.html | 2 +- src/inkwell/context.rs.html | 18 +- src/inkwell/data_layout.rs.html | 2 +- src/inkwell/debug_info.rs.html | 6 +- src/inkwell/execution_engine.rs.html | 6 +- src/inkwell/intrinsics.rs.html | 2 +- src/inkwell/lib.rs.html | 16 +- src/inkwell/memory_buffer.rs.html | 10 +- src/inkwell/module.rs.html | 6 +- src/inkwell/object_file.rs.html | 8 +- src/inkwell/passes.rs.html | 2 +- src/inkwell/support/error_handling.rs.html | 16 +- src/inkwell/support/mod.rs.html | 10 +- src/inkwell/targets.rs.html | 16 +- src/inkwell/types/array_type.rs.html | 34 +- src/inkwell/types/enums.rs.html | 4 +- src/inkwell/types/float_type.rs.html | 24 +- src/inkwell/types/fn_type.rs.html | 2 +- src/inkwell/types/int_type.rs.html | 42 +- src/inkwell/types/metadata_type.rs.html | 2 +- src/inkwell/types/mod.rs.html | 14 +- src/inkwell/types/ptr_type.rs.html | 26 +- src/inkwell/types/struct_type.rs.html | 20 +- src/inkwell/types/traits.rs.html | 2 +- src/inkwell/types/vec_type.rs.html | 26 +- src/inkwell/types/void_type.rs.html | 2 +- src/inkwell/values/array_value.rs.html | 54 +- src/inkwell/values/basic_value_use.rs.html | 8 +- src/inkwell/values/call_site_value.rs.html | 2 +- src/inkwell/values/enums.rs.html | 2 +- src/inkwell/values/float_value.rs.html | 8 +- src/inkwell/values/fn_value.rs.html | 2 +- src/inkwell/values/generic_value.rs.html | 2 +- src/inkwell/values/global_value.rs.html | 2 +- src/inkwell/values/instruction_value.rs.html | 30 +- src/inkwell/values/int_value.rs.html | 8 +- src/inkwell/values/metadata_value.rs.html | 56 +- src/inkwell/values/mod.rs.html | 10 +- src/inkwell/values/phi_value.rs.html | 2 +- src/inkwell/values/ptr_value.rs.html | 2 +- src/inkwell/values/struct_value.rs.html | 2 +- src/inkwell/values/traits.rs.html | 2 +- src/inkwell/values/vec_value.rs.html | 12 +- src/inkwell_internals/cfg.rs.html | 2 +- src/inkwell_internals/enum.rs.html | 2 +- src/inkwell_internals/lib.rs.html | 2 +- src/itertools/adaptors/coalesce.rs.html | 2 +- src/itertools/adaptors/map.rs.html | 30 +- src/itertools/adaptors/mod.rs.html | 146 +- src/itertools/adaptors/multi_product.rs.html | 336 +- src/itertools/combinations.rs.html | 164 +- .../combinations_with_replacement.rs.html | 108 +- src/itertools/concat_impl.rs.html | 2 +- src/itertools/cons_tuples_impl.rs.html | 22 +- src/itertools/diff.rs.html | 6 +- src/itertools/duplicates_impl.rs.html | 2 +- src/itertools/either_or_both.rs.html | 2 +- src/itertools/exactly_one_err.rs.html | 2 +- src/itertools/extrema_set.rs.html | 2 +- src/itertools/flatten_ok.rs.html | 94 +- src/itertools/format.rs.html | 26 +- src/itertools/free.rs.html | 8 +- src/itertools/group_map.rs.html | 6 +- src/itertools/groupbylazy.rs.html | 42 +- src/itertools/grouping_map.rs.html | 80 +- src/itertools/impl_macros.rs.html | 2 +- src/itertools/intersperse.rs.html | 2 +- src/itertools/iter_index.rs.html | 235 ++ src/itertools/k_smallest.rs.html | 182 +- src/itertools/kmerge_impl.rs.html | 4 +- src/itertools/lazy_buffer.rs.html | 22 +- src/itertools/lib.rs.html | 806 +++- src/itertools/merge_join.rs.html | 162 +- src/itertools/minmax.rs.html | 2 +- src/itertools/multipeek_impl.rs.html | 2 +- src/itertools/pad_tail.rs.html | 2 +- src/itertools/peek_nth.rs.html | 10 +- src/itertools/peeking_take_while.rs.html | 8 +- src/itertools/permutations.rs.html | 6 +- src/itertools/powerset.rs.html | 56 +- src/itertools/process_results_impl.rs.html | 88 +- src/itertools/put_back_n_impl.rs.html | 6 +- src/itertools/rciter_impl.rs.html | 2 +- src/itertools/repeatn.rs.html | 2 +- src/itertools/size_hint.rs.html | 4 +- src/itertools/sources.rs.html | 118 +- src/itertools/take_while_inclusive.rs.html | 4 +- src/itertools/tee.rs.html | 2 +- src/itertools/tuple_impl.rs.html | 2 +- src/itertools/unique_impl.rs.html | 2 +- src/itertools/unziptuple.rs.html | 2 +- src/itertools/with_position.rs.html | 2 +- src/itertools/zip_eq_impl.rs.html | 8 +- src/itertools/zip_longest.rs.html | 4 +- src/itertools/ziptuple.rs.html | 12 +- src/thiserror/aserror.rs.html | 6 +- src/thiserror/display.rs.html | 4 +- src/thiserror/lib.rs.html | 8 +- src/thiserror_impl/ast.rs.html | 2 +- src/thiserror_impl/attr.rs.html | 2 +- src/thiserror_impl/expand.rs.html | 2 +- src/thiserror_impl/fmt.rs.html | 2 +- src/thiserror_impl/generics.rs.html | 2 +- src/thiserror_impl/lib.rs.html | 2 +- src/thiserror_impl/prop.rs.html | 2 +- src/thiserror_impl/span.rs.html | 2 +- src/thiserror_impl/valid.rs.html | 2 +- thiserror/all.html | 2 +- thiserror/derive.Error.html | 2 +- thiserror/index.html | 2 +- thiserror_impl/all.html | 2 +- thiserror_impl/derive.Error.html | 2 +- thiserror_impl/index.html | 2 +- trait.impl/core/clone/trait.Clone.js | 4 +- trait.impl/core/fmt/trait.Debug.js | 2 +- .../iter/traits/collect/trait.IntoIterator.js | 2 +- .../double_ended/trait.DoubleEndedIterator.js | 2 +- .../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 | 2 +- trait.impl/core/marker/trait.Send.js | 2 +- trait.impl/core/marker/trait.Sync.js | 2 +- trait.impl/core/marker/trait.Unpin.js | 2 +- .../panic/unwind_safe/trait.RefUnwindSafe.js | 2 +- .../panic/unwind_safe/trait.UnwindSafe.js | 2 +- .../iter_index/trait.IteratorIndex.js | 3 + type.impl/core/result/enum.Result.js | 2 +- .../{type.MapOk.js => struct.ChunkBy.js} | 0 .../itertools/structs/struct.GroupingMap.js | 2 +- type.impl/itertools/structs/struct.MergeBy.js | 2 +- 557 files changed, 13857 insertions(+), 13237 deletions(-) delete mode 100644 itertools/adaptors/map/type.MapResults.html delete mode 100644 itertools/adaptors/struct.Step.html delete mode 100644 itertools/fn.repeat_call.html create mode 100644 itertools/groupbylazy/struct.ChunkBy.html delete mode 100644 itertools/groupbylazy/struct.GroupBy.html create mode 100644 itertools/groupbylazy/type.GroupBy.html create mode 100644 itertools/iter_index/trait.IteratorIndex.html delete mode 100644 itertools/sources/fn.repeat_call.html delete mode 100644 itertools/sources/struct.RepeatCall.html rename itertools/structs/{struct.GroupBy.html => struct.ChunkBy.html} (91%) delete mode 100644 itertools/structs/struct.RepeatCall.html delete mode 100644 itertools/structs/struct.Step.html create mode 100644 itertools/structs/type.GroupBy.html delete mode 100644 itertools/structs/type.MapResults.html create mode 100644 itertools/traits/trait.IteratorIndex.html rename src/edlang_parser/home/runner/work/edlang/edlang/target/debug/build/{edlang_parser-b6a2de6e549ede1f => edlang_parser-77b468da3623ed26}/out/grammar.rs.html (99%) create mode 100644 src/itertools/iter_index.rs.html create mode 100644 trait.impl/itertools/iter_index/trait.IteratorIndex.js rename type.impl/itertools/structs/{type.MapOk.js => struct.ChunkBy.js} (100%) diff --git a/anyhow/all.html b/anyhow/all.html index d18065f36..a6a5907f4 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 c22819334..b3e499732 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 ef25d8a5a..8c9f30150 100644 --- a/anyhow/index.html +++ b/anyhow/index.html @@ -1,6 +1,6 @@ -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 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 865389f35..1b9073a74 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 03557878e..6b9fcea23 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/edb/all.html b/edb/all.html
index c0385b698..59465c4c3 100644
--- a/edb/all.html
+++ b/edb/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
Functions

\ No newline at end of file
diff --git a/edb/config/index.html b/edb/config/index.html
index 4bf7e3454..3918a143a 100644
--- a/edb/config/index.html
+++ b/edb/config/index.html
@@ -1,2 +1,2 @@
-edb::config - Rust

+edb::config - Rust

     
Module edb::config
source · 
Structs§

\ No newline at end of file
diff --git a/edb/config/struct.Config.html b/edb/config/struct.Config.html
index 76e77839a..9da36ee1a 100644
--- a/edb/config/struct.Config.html
+++ b/edb/config/struct.Config.html
@@ -1,4 +1,4 @@
-Config in edb::config - Rust

+Config in edb::config - Rust

     
Struct edb::config::Config
source · 
pub struct Config {
     pub package: Package,
     pub profile: HashMap<String, Profile>,
diff --git a/edb/config/struct.Package.html b/edb/config/struct.Package.html
index 090e20cff..dfcb17838 100644
--- a/edb/config/struct.Package.html
+++ b/edb/config/struct.Package.html
@@ -1,4 +1,4 @@
-Package in edb::config - Rust

+Package in edb::config - Rust

     
Struct edb::config::Package
source · 
pub struct Package {
     pub name: String,
     pub version: String,
diff --git a/edb/config/struct.Profile.html b/edb/config/struct.Profile.html
index 3a0a8f7c8..66ec99e78 100644
--- a/edb/config/struct.Profile.html
+++ b/edb/config/struct.Profile.html
@@ -1,4 +1,4 @@
-Profile in edb::config - Rust

+Profile in edb::config - Rust

     
Struct edb::config::Profile
source · 
pub struct Profile {
     pub release: bool,
     pub opt_level: u8,
diff --git a/edb/enum.Commands.html b/edb/enum.Commands.html
index 9ed5f43db..c3013c74b 100644
--- a/edb/enum.Commands.html
+++ b/edb/enum.Commands.html
@@ -1,4 +1,4 @@
-Commands in edb - Rust

+Commands in edb - Rust

     
Enum edb::Commands
source · 
pub(crate) enum Commands {
     New {
         path: PathBuf,
diff --git a/edb/fn.get_platform_library_ext.html b/edb/fn.get_platform_library_ext.html
index c73219393..131390a14 100644
--- a/edb/fn.get_platform_library_ext.html
+++ b/edb/fn.get_platform_library_ext.html
@@ -1,2 +1,2 @@
-get_platform_library_ext in edb - Rust

+get_platform_library_ext in edb - Rust

     
Function edb::get_platform_library_ext
source · 
pub fn get_platform_library_ext() -> &'static str

\ No newline at end of file
diff --git a/edb/fn.main.html b/edb/fn.main.html
index 6f35b1e40..d08079128 100644
--- a/edb/fn.main.html
+++ b/edb/fn.main.html
@@ -1,2 +1,2 @@
-main in edb - Rust

+main in edb - Rust

     
Function edb::main
source · 
pub(crate) fn main() -> Result<()>

\ No newline at end of file
diff --git a/edb/index.html b/edb/index.html
index 0436150c1..d37739e98 100644
--- a/edb/index.html
+++ b/edb/index.html
@@ -1,3 +1,3 @@
-edb - Rust
source§
fn get<R>(self, index: R) -> <R as IteratorIndex<Self>>::Output
where
+    Self: Sized,
+    R: IteratorIndex<Self>,
Returns an iterator over a subsection of the iterator. Read more
source§
fn zip_longest<J>(
     self,
     other: J
 ) -> ZipLongest<Self, <J as IntoIterator>::IntoIter>
where
     J: IntoIterator,
     Self: Sized,
Create an iterator which iterates over both this and the specified
-iterator simultaneously, yielding pairs of two optional elements. Read more
source§
fn zip_eq<J>(self, other: J) -> ZipEq<Self, <J as IntoIterator>::IntoIter>
where
+iterator simultaneously, yielding pairs of two optional elements. Read more
source§
fn zip_eq<J>(self, other: J) -> ZipEq<Self, <J as IntoIterator>::IntoIter>
where
     J: IntoIterator,
     Self: Sized,
Create an iterator which iterates over both this and the specified
-iterator simultaneously, yielding pairs of elements. Read more
source§
fn batching<B, F>(self, f: F) -> Batching<Self, F>
where
+iterator simultaneously, yielding pairs of elements. Read more
source§
fn batching<B, F>(self, f: F) -> Batching<Self, F>
where
     F: FnMut(&mut Self) -> Option<B>,
     Self: Sized,
A “meta iterator adaptor”. Its closure receives a reference to the
 iterator and may pick off as many elements as it likes, to produce the
-next iterator element. Read more
source§
fn group_by<K, F>(self, key: F) -> GroupBy<K, Self, F>
where
+next iterator element. Read more
source§
fn chunk_by<K, F>(self, key: F) -> ChunkBy<K, Self, F>
where
     Self: Sized,
     F: FnMut(&Self::Item) -> K,
     K: PartialEq,
Return an iterable that can group iterator elements.
 Consecutive elements that map to the same key (“runs”), are assigned
-to the same group. Read more
source§
fn chunks(self, size: usize) -> IntoChunks<Self>
where
-    Self: Sized,
Return an iterable that can chunk the iterator. Read more
source§
fn tuple_windows<T>(self) -> TupleWindows<Self, T>
where
+to the same group. Read more
source§
fn group_by<K, F>(self, key: F) -> ChunkBy<K, Self, F>
where
+    Self: Sized,
+    F: FnMut(&Self::Item) -> K,
+    K: PartialEq,
👎Deprecated since 0.13.0: Use .chunk_by() instead
See .chunk_by().
source§
fn chunks(self, size: usize) -> IntoChunks<Self>
where
+    Self: Sized,
Return an iterable that can chunk the iterator. Read more
source§
fn tuple_windows<T>(self) -> TupleWindows<Self, T>
where
     Self: Sized + Iterator<Item = <T as TupleCollect>::Item>,
     T: HomogeneousTuple,
     <T as TupleCollect>::Item: Clone,
Return an iterator over all contiguous windows producing tuples of
-a specific size (up to 12). Read more
source§
fn circular_tuple_windows<T>(self) -> CircularTupleWindows<Self, T>
where
+a specific size (up to 12). Read more
source§
fn circular_tuple_windows<T>(self) -> CircularTupleWindows<Self, T>
where
     Self: Sized + Clone + Iterator<Item = <T as TupleCollect>::Item> + ExactSizeIterator,
     T: TupleCollect + Clone,
     <T as TupleCollect>::Item: Clone,
Return an iterator over all windows, wrapping back to the first
 elements when the window would otherwise exceed the length of the
-iterator, producing tuples of a specific size (up to 12). Read more
source§
fn tuples<T>(self) -> Tuples<Self, T>
where
+iterator, producing tuples of a specific size (up to 12). Read more
source§
fn tuples<T>(self) -> Tuples<Self, T>
where
     Self: Sized + Iterator<Item = <T as TupleCollect>::Item>,
     T: HomogeneousTuple,
Return an iterator that groups the items in tuples of a specific size
-(up to 12). Read more
source§
fn tee(self) -> (Tee<Self>, Tee<Self>)
where
+(up to 12). Read more
source§
fn tee(self) -> (Tee<Self>, Tee<Self>)
where
     Self: Sized,
     Self::Item: Clone,
Split into an iterator pair that both yield all elements from
-the original iterator. Read more
source§
fn step(self, n: usize) -> Step<Self>
where
-    Self: Sized,
👎Deprecated since 0.8.0: Use std .step_by() instead
Return an iterator adaptor that steps n elements in the base iterator
-for each iteration. Read more
source§
fn map_into<R>(self) -> MapSpecialCase<Self, MapSpecialCaseFnInto<R>>
where
+the original iterator. Read more
source§
fn map_into<R>(self) -> MapSpecialCase<Self, MapSpecialCaseFnInto<R>>
where
     Self: Sized,
-    Self::Item: Into<R>,
Convert each item of the iterator using the Into trait. Read more
source§
fn map_results<F, T, U, E>(
-    self,
-    f: F
-) -> MapSpecialCase<Self, MapSpecialCaseFnOk<F>>
where
-    Self: Sized + Iterator<Item = Result<T, E>>,
-    F: FnMut(T) -> U,
👎Deprecated since 0.10.0: Use .map_ok() instead
See .map_ok().
source§
fn map_ok<F, T, U, E>(self, f: F) -> MapSpecialCase<Self, MapSpecialCaseFnOk<F>>
where
+    Self::Item: Into<R>,
Convert each item of the iterator using the Into trait. Read more
source§
fn map_ok<F, T, U, E>(self, f: F) -> MapSpecialCase<Self, MapSpecialCaseFnOk<F>>
where
     Self: Sized + Iterator<Item = Result<T, E>>,
     F: FnMut(T) -> U,
Return an iterator adaptor that applies the provided closure
 to every Result::Ok value. Result::Err values are
-unchanged. Read more
source§
fn filter_ok<F, T, E>(self, f: F) -> FilterOk<Self, F>
where
+unchanged. Read more
source§
fn filter_ok<F, T, E>(self, f: F) -> FilterOk<Self, F>
where
     Self: Sized + Iterator<Item = Result<T, E>>,
     F: FnMut(&T) -> bool,
Return an iterator adaptor that filters every Result::Ok
 value with the provided closure. Result::Err values are
-unchanged. Read more
source§
fn filter_map_ok<F, T, U, E>(self, f: F) -> FilterMapOk<Self, F>
where
+unchanged. Read more
source§
fn filter_map_ok<F, T, U, E>(self, f: F) -> FilterMapOk<Self, F>
where
     Self: Sized + Iterator<Item = Result<T, E>>,
     F: FnMut(T) -> Option<U>,
Return an iterator adaptor that filters and transforms every
 Result::Ok value with the provided closure. Result::Err
-values are unchanged. Read more
source§
fn flatten_ok<T, E>(self) -> FlattenOk<Self, T, E>
where
+values are unchanged. Read more
source§
fn flatten_ok<T, E>(self) -> FlattenOk<Self, T, E>
where
     Self: Sized + Iterator<Item = Result<T, E>>,
     T: IntoIterator,
Return an iterator adaptor that flattens every Result::Ok value into
-a series of Result::Ok values. Result::Err values are unchanged. Read more
source§
fn process_results<F, T, E, R>(self, processor: F) -> Result<R, E>
where
+a series of Result::Ok values. Result::Err values are unchanged. Read more
source§
fn process_results<F, T, E, R>(self, processor: F) -> Result<R, E>
where
     Self: Sized + Iterator<Item = Result<T, E>>,
     F: FnOnce(ProcessResults<'_, Self, E>) -> R,
“Lift” a function of the values of the current iterator so as to process
-an iterator of Result values instead. Read more
source§
fn merge<J>(
+an iterator of Result values instead. Read more
source§

fn merge<J>( self, other: J ) -> MergeBy<Self, <J as IntoIterator>::IntoIter, MergeLte>
where @@ -282,7 +280,7 @@ an iterator of Result values instead. Item: PartialOrd, J: IntoIterator<Item = Self::Item>,

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

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

source§

fn merge_by<J, F>( self, other: J, is_first: F @@ -290,7 +288,7 @@ result is sorted. Re Self: Sized, J: IntoIterator<Item = Self::Item>, F: FnMut(&Self::Item, &Self::Item) -> bool,

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

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

source§

fn merge_join_by<J, F, T>( self, other: J, cmp_fn: F @@ -298,18 +296,18 @@ This is much like IntoIterator, F: FnMut(&Self::Item, &<J as IntoIterator>::Item) -> T, Self: Sized,

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

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

source§

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

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

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

source§

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

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

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

source§

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

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

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

source§

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

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

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

source§

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

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

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

source§

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

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

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

source§

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

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

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

source§

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

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

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

source§

fn dedup_by_with_count<Cmp>( self, cmp: Cmp ) -> CoalesceBy<Self, DedupPredWithCount2CoalescePred<Cmp>, WithCount>
where @@ -350,247 +348,258 @@ If the iterator is sorted, all elements will be unique. FnMut(&Self::Item, &Self::Item) -> bool,

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

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

source§

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

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

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

source§

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

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

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

source§

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

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

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

source§

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

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

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

source§

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

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

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

source§

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

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

fn take_while_inclusive<F>(self, accept: F) -> TakeWhileInclusive<Self, F>
where +to only pick off elements while the predicate accept returns true. Read more

source§

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

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

fn while_some<A>(self) -> WhileSome<Self>
where +first returned false. Read more

source§

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

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

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

source§

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

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

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

source§

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

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

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

source§

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

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

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

source§

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

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

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

source§

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

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

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

source§

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

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

fn with_position(self) -> WithPosition<Self>
where +min by filling missing elements using a closure f. Read more

source§

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

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

fn positions<P>(self, predicate: P) -> Positions<Self, P>
where +ease special-case handling of the first or last elements. Read more

source§

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

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

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

source§

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

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

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

source§

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

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

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

source§

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

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

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

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

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

source§

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

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

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

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

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

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

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

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

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

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

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

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

fn all_equal(&mut self) -> bool
where + Q: PartialEq,

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

fn all_equal(&mut self) -> bool
where Self: Sized, - Self::Item: PartialEq,

Check whether all elements compare equal. Read more
source§

fn all_equal_value( + Self::Item: PartialEq,

Check whether all elements compare equal. Read more
source§

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

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

fn all_unique(&mut self) -> bool
where +two non-equal elements found. Read more

source§

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

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

fn dropping(self, n: usize) -> Self
where + Self::Item: Eq + Hash,

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

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

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

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

source§

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

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

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

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

fn concat(self) -> Self::Item
where +and return the same iterator again. Read more

source§

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

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

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

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

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

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

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

source§

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

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

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

source§

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

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

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

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

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

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

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

source§

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

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

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

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

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

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

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

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

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

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

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

Fold Result values from an iterator. Read more
source§

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

Fold Result values from an iterator. Read more
source§

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

Fold Option values from an iterator. Read more
source§

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

Fold Option values from an iterator. Read more
source§

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

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

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

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

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

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

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

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

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

👎Deprecated since 0.13.0: Use .tree_reduce() instead
See .tree_reduce().
source§

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

source§

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

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

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

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

fn k_smallest_by<F>(self, k: usize, cmp: F) -> IntoIter<Self::Item>
where + Self: Sized, + F: FnMut(&Self::Item, &Self::Item) -> Ordering,

Sort the k smallest elements into a new iterator using the provided comparison. Read more
source§

fn k_smallest_by_key<F, K>(self, k: usize, key: F) -> IntoIter<Self::Item>
where + Self: Sized, + F: FnMut(&Self::Item) -> K, + K: Ord,

Return the elements producing the k smallest outputs of the provided function. Read more
source§

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

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

fn k_largest_by<F>(self, k: usize, cmp: F) -> IntoIter<Self::Item>
where + Self: Sized, + F: FnMut(&Self::Item, &Self::Item) -> Ordering,

Sort the k largest elements into a new iterator using the provided comparison. Read more
source§

fn k_largest_by_key<F, K>(self, k: usize, key: F) -> IntoIter<Self::Item>
where + Self: Sized, + F: FnMut(&Self::Item) -> K, + K: Ord,

Return the elements producing the k largest outputs of the provided function. Read more
source§

fn tail(self, n: usize) -> IntoIter<Self::Item>
where + Self: Sized,

Consumes the iterator and return an iterator of the last n elements. Read more
source§

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

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

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

source§

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

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

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

source§

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

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

fn into_group_map_by<K, V, F>(self, f: F) -> HashMap<K, Vec<V>>
where +are taken from (Key, Value) tuple pairs yielded by the input iterator. Read more

source§

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

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

fn into_grouping_map<K, V>(self) -> GroupingMap<Self>
where + F: FnMut(&V) -> K,

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

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

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

fn into_grouping_map_by<K, V, F>( +group-and-fold operations it allows to perform. Read more

source§

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

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

fn min_set(self) -> Vec<Self::Item>
where +group-and-fold operations it allows to perform. Read more

source§

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

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

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

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

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

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

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

source§

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

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

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

source§

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

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

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

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

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

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

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

source§

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

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

fn minmax(self) -> MinMaxResult<Self::Item>
where +the specified function. Read more

source§

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

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

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

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

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

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

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

source§

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

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

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

source§

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

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

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

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

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

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

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

source§

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

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

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

source§

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

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

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

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

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

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

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

source§

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

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

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

source§

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

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

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

source§

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

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

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

source§

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

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

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

source§

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

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

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

If the iterator yields no elements, Ok(None) will be returned. If the iterator yields +iterator. Read more
source§

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

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

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

source§

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

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

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

source§

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

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

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

source§

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

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

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

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

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

Returns the length of the iterator if one exists. +determining identity using a keying function. Read more
source§

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

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

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

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

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

source§

fn fg(&self, value: Color) -> Painted<&T>

Returns a styled value derived from self with the foreground set to value.

diff --git a/edlang_parser/lexer/type.Spanned.html b/edlang_parser/lexer/type.Spanned.html index 0b1b6a0b4..8af158d51 100644 --- a/edlang_parser/lexer/type.Spanned.html +++ b/edlang_parser/lexer/type.Spanned.html @@ -1,4 +1,4 @@ -Spanned in edlang_parser::lexer - Rust
+Spanned in edlang_parser::lexer - Rust

Type Alias edlang_parser::lexer::Spanned

source · 
pub type Spanned<Tok, Loc, Error> = Result<(Loc, Tok, Loc), Error>;

Aliased Type§

enum Spanned<Tok, Loc, Error> {
     Ok((Loc, Tok, Loc)),
     Err(Error),
diff --git a/edlang_parser/tokens/enum.LexingError.html b/edlang_parser/tokens/enum.LexingError.html
index 5ea49daec..a2d3b92e0 100644
--- a/edlang_parser/tokens/enum.LexingError.html
+++ b/edlang_parser/tokens/enum.LexingError.html
@@ -1,8 +1,8 @@
-LexingError in edlang_parser::tokens - Rust

+LexingError in edlang_parser::tokens - Rust

     
Enum edlang_parser::tokens::LexingError
source · 
pub enum LexingError {
     NumberParseError,
     Other,
-}
Variants§
§
NumberParseError
§
Other
Trait Implementations§
source§
impl Clone for LexingError
source§
fn clone(&self) -> LexingError
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 LexingError
source§
fn fmt(&self, f: &mut Formatter<'_>) -> Result
Formats the value using the given formatter. Read more
source§
impl Default for LexingError
source§
fn default() -> LexingError
Returns the “default value” for a type. Read more
source§
impl From<Infallible> for LexingError
source§
fn from(_: Infallible) -> Self
Converts to this type from the input type.
source§
impl From<ParseIntError> for LexingError
source§
fn from(_: ParseIntError) -> Self
Converts to this type from the input type.
source§
impl PartialEq for LexingError
source§
fn eq(&self, other: &LexingError) -> bool
This method tests for self and other values to be equal, and is used
+}

Variants§

§

NumberParseError

§

Other

Trait Implementations§

source§

impl Clone for LexingError

source§

fn clone(&self) -> LexingError

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 LexingError

source§

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

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

impl Default for LexingError

source§

fn default() -> LexingError

Returns the “default value” for a type. Read more
source§

impl From<Infallible> for LexingError

source§

fn from(_: Infallible) -> Self

Converts to this type from the input type.
source§

impl From<ParseIntError> for LexingError

source§

fn from(_: ParseIntError) -> Self

Converts to this type from the input type.
source§

impl PartialEq for LexingError

source§

fn eq(&self, other: &LexingError) -> bool

This method tests for self and other values to be equal, and is used by ==.
1.0.0 · source§

fn ne(&self, other: &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 LexingError

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/edlang_parser/tokens/enum.Token.html b/edlang_parser/tokens/enum.Token.html index 68cc76b18..fb35c9e42 100644 --- a/edlang_parser/tokens/enum.Token.html +++ b/edlang_parser/tokens/enum.Token.html @@ -1,4 +1,4 @@ -Token in edlang_parser::tokens - Rust
+Token in edlang_parser::tokens - Rust

Enum edlang_parser::tokens::Token

source · 
pub enum Token {
 
Show 55 variants    KeywordLet,
     KeywordConst,
diff --git a/edlang_parser/tokens/index.html b/edlang_parser/tokens/index.html
index 151ab44bb..2cb55a6b1 100644
--- a/edlang_parser/tokens/index.html
+++ b/edlang_parser/tokens/index.html
@@ -1,2 +1,2 @@
-edlang_parser::tokens - Rust

+edlang_parser::tokens - Rust

     
Module edlang_parser::tokens
source · 
Enums§

\ No newline at end of file
diff --git a/edlang_session/all.html b/edlang_session/all.html
index 608e83c5e..010e91b40 100644
--- a/edlang_session/all.html
+++ b/edlang_session/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/edlang_session/enum.DebugInfo.html b/edlang_session/enum.DebugInfo.html
index 8257064d2..77585645f 100644
--- a/edlang_session/enum.DebugInfo.html
+++ b/edlang_session/enum.DebugInfo.html
@@ -1,4 +1,4 @@
-DebugInfo in edlang_session - Rust

+DebugInfo in edlang_session - Rust

     
Enum edlang_session::DebugInfo
source · 
pub enum DebugInfo {
     None,
     Full,
diff --git a/edlang_session/enum.OptLevel.html b/edlang_session/enum.OptLevel.html
index aeb6a7c0f..3f602d084 100644
--- a/edlang_session/enum.OptLevel.html
+++ b/edlang_session/enum.OptLevel.html
@@ -1,4 +1,4 @@
-OptLevel in edlang_session - Rust

+OptLevel in edlang_session - Rust

     
Enum edlang_session::OptLevel
source · 
pub enum OptLevel {
     None,
     Less,
diff --git a/edlang_session/index.html b/edlang_session/index.html
index 2e5f90a42..d0a2c7103 100644
--- a/edlang_session/index.html
+++ b/edlang_session/index.html
@@ -1,3 +1,3 @@
-edlang_session - Rust
source
pub fn create_builder(&self) -> Builder<'_>
Creates a new Builder for a Context.

+
source
pub fn create_builder(&self) -> Builder<'_>
Creates a new Builder for a Context.

 
§Example

 
use inkwell::context::Context;
 
 let context = Context::create();
 let builder = context.create_builder();

-
source
pub fn create_module(&self, name: &str) -> Module<'_>
Creates a new Module for a Context.

+
source
pub fn create_module(&self, name: &str) -> Module<'_>
Creates a new Module for a Context.

 
§Example

 
use inkwell::context::Context;
 
 let context = Context::create();
 let module = context.create_module("my_module");

-
source
pub fn create_module_from_ir(
+

source

pub fn create_module_from_ir( &self, memory_buffer: MemoryBuffer ) -> Result<Module<'_>, LLVMString>

Creates a new Module for the current Context from a MemoryBuffer.

@@ -54,7 +54,7 @@ builder.build_return(None).unwrap(); let memory_buffer = module.write_bitcode_to_memory(); let module2 = context.create_module_from_ir(memory_buffer).unwrap();
-
source

pub fn create_inline_asm<'ctx>( +

source

pub fn create_inline_asm<'ctx>( &'ctx self, ty: FunctionType<'ctx>, assembly: String, @@ -123,7 +123,7 @@ builder.position_at_end(basic_block); builder.build_indirect_call(asm_fn, asm, params, "exit").unwrap(); builder.build_return(None).unwrap(); -

source

pub fn void_type(&self) -> VoidType<'_>

Gets the VoidType. It will be assigned the current context.

+
source

pub fn void_type(&self) -> VoidType<'_>

Gets the VoidType. It will be assigned the current context.

§Example
use inkwell::context::Context;
 
@@ -131,7 +131,7 @@ builder.build_return(None).unwrap();let void_type = context.void_type();
 
 assert_eq!(void_type.get_context(), context);
-
source

pub fn bool_type(&self) -> IntType<'_>

Gets the IntType representing 1 bit width. It will be assigned the current context.

+
source

pub fn bool_type(&self) -> IntType<'_>

Gets the IntType representing 1 bit width. It will be assigned the current context.

§Example
use inkwell::context::Context;
 
@@ -140,7 +140,7 @@ builder.build_return(None).unwrap();assert_eq!(bool_type.get_bit_width(), 1);
 assert_eq!(bool_type.get_context(), context);
-
source

pub fn i8_type(&self) -> IntType<'_>

Gets the IntType representing 8 bit width. It will be assigned the current context.

+
source

pub fn i8_type(&self) -> IntType<'_>

Gets the IntType representing 8 bit width. It will be assigned the current context.

§Example
use inkwell::context::Context;
 
@@ -149,7 +149,7 @@ builder.build_return(None).unwrap();assert_eq!(i8_type.get_bit_width(), 8);
 assert_eq!(i8_type.get_context(), context);
-
source

pub fn i16_type(&self) -> IntType<'_>

Gets the IntType representing 16 bit width. It will be assigned the current context.

+
source

pub fn i16_type(&self) -> IntType<'_>

Gets the IntType representing 16 bit width. It will be assigned the current context.

§Example
use inkwell::context::Context;
 
@@ -158,7 +158,7 @@ builder.build_return(None).unwrap();assert_eq!(i16_type.get_bit_width(), 16);
 assert_eq!(i16_type.get_context(), context);
-
source

pub fn i32_type(&self) -> IntType<'_>

Gets the IntType representing 32 bit width. It will be assigned the current context.

+
source

pub fn i32_type(&self) -> IntType<'_>

Gets the IntType representing 32 bit width. It will be assigned the current context.

§Example
use inkwell::context::Context;
 
@@ -167,7 +167,7 @@ builder.build_return(None).unwrap();assert_eq!(i32_type.get_bit_width(), 32);
 assert_eq!(i32_type.get_context(), context);
-
source

pub fn i64_type(&self) -> IntType<'_>

Gets the IntType representing 64 bit width. It will be assigned the current context.

+
source

pub fn i64_type(&self) -> IntType<'_>

Gets the IntType representing 64 bit width. It will be assigned the current context.

§Example
use inkwell::context::Context;
 
@@ -176,7 +176,7 @@ builder.build_return(None).unwrap();assert_eq!(i64_type.get_bit_width(), 64);
 assert_eq!(i64_type.get_context(), context);
-
source

pub fn i128_type(&self) -> IntType<'_>

Gets the IntType representing 128 bit width. It will be assigned the current context.

+
source

pub fn i128_type(&self) -> IntType<'_>

Gets the IntType representing 128 bit width. It will be assigned the current context.

§Example
use inkwell::context::Context;
 
@@ -185,7 +185,7 @@ builder.build_return(None).unwrap();assert_eq!(i128_type.get_bit_width(), 128);
 assert_eq!(i128_type.get_context(), context);
-
source

pub fn custom_width_int_type(&self, bits: u32) -> IntType<'_>

Gets the IntType representing a custom bit width. It will be assigned the current context.

+
source

pub fn custom_width_int_type(&self, bits: u32) -> IntType<'_>

Gets the IntType representing a custom bit width. It will be assigned the current context.

§Example
use inkwell::context::Context;
 
@@ -194,7 +194,7 @@ builder.build_return(None).unwrap();assert_eq!(i42_type.get_bit_width(), 42);
 assert_eq!(i42_type.get_context(), context);
-
source

pub fn metadata_type(&self) -> MetadataType<'_>

Gets the MetadataType representing 128 bit width. It will be assigned the current context.

+
source

pub fn metadata_type(&self) -> MetadataType<'_>

Gets the MetadataType representing 128 bit width. It will be assigned the current context.

§Example
use inkwell::context::Context;
 use inkwell::values::IntValue;
@@ -203,7 +203,7 @@ builder.build_return(None).unwrap();let md_type = context.metadata_type();
 
 assert_eq!(md_type.get_context(), context);
-
source

pub fn ptr_sized_int_type( +

source

pub fn ptr_sized_int_type( &self, target_data: &TargetData, address_space: Option<AddressSpace> @@ -220,7 +220,7 @@ Target::initialize_native(&InitializationConfig::d let execution_engine = module.create_jit_execution_engine(OptimizationLevel::None).unwrap(); let target_data = execution_engine.get_target_data(); let int_type = context.ptr_sized_int_type(&target_data, None); -

source

pub fn f16_type(&self) -> FloatType<'_>

Gets the FloatType representing a 16 bit width. It will be assigned the current context.

+
source

pub fn f16_type(&self) -> FloatType<'_>

Gets the FloatType representing a 16 bit width. It will be assigned the current context.

§Example
use inkwell::context::Context;
 
@@ -229,7 +229,7 @@ Target::initialize_native(&InitializationConfig::d
 let f16_type = context.f16_type();
 
 assert_eq!(f16_type.get_context(), context);
-
source

pub fn f32_type(&self) -> FloatType<'_>

Gets the FloatType representing a 32 bit width. It will be assigned the current context.

+
source

pub fn f32_type(&self) -> FloatType<'_>

Gets the FloatType representing a 32 bit width. It will be assigned the current context.

§Example
use inkwell::context::Context;
 
@@ -238,7 +238,7 @@ Target::initialize_native(&InitializationConfig::d
 let f32_type = context.f32_type();
 
 assert_eq!(f32_type.get_context(), context);
-
source

pub fn f64_type(&self) -> FloatType<'_>

Gets the FloatType representing a 64 bit width. It will be assigned the current context.

+
source

pub fn f64_type(&self) -> FloatType<'_>

Gets the FloatType representing a 64 bit width. It will be assigned the current context.

§Example
use inkwell::context::Context;
 
@@ -247,7 +247,7 @@ Target::initialize_native(&InitializationConfig::d
 let f64_type = context.f64_type();
 
 assert_eq!(f64_type.get_context(), context);
-
source

pub fn x86_f80_type(&self) -> FloatType<'_>

Gets the FloatType representing a 80 bit width. It will be assigned the current context.

+
source

pub fn x86_f80_type(&self) -> FloatType<'_>

Gets the FloatType representing a 80 bit width. It will be assigned the current context.

§Example
use inkwell::context::Context;
 
@@ -256,7 +256,7 @@ Target::initialize_native(&InitializationConfig::d
 let x86_f80_type = context.x86_f80_type();
 
 assert_eq!(x86_f80_type.get_context(), context);
-
source

pub fn f128_type(&self) -> FloatType<'_>

Gets the FloatType representing a 128 bit width. It will be assigned the current context.

+
source

pub fn f128_type(&self) -> FloatType<'_>

Gets the FloatType representing a 128 bit width. It will be assigned the current context.

§Example
use inkwell::context::Context;
 
@@ -265,7 +265,7 @@ Target::initialize_native(&InitializationConfig::d
 let f128_type = context.f128_type();
 
 assert_eq!(f128_type.get_context(), context);
-
source

pub fn ppc_f128_type(&self) -> FloatType<'_>

Gets the FloatType representing a 128 bit width. It will be assigned the current context.

+
source

pub fn ppc_f128_type(&self) -> FloatType<'_>

Gets the FloatType representing a 128 bit width. It will be assigned the current context.

PPC is two 64 bits side by side rather than one single 128 bit float.

§Example
use inkwell::context::Context;
@@ -275,7 +275,7 @@ Target::initialize_native(&InitializationConfig::d
 let f128_type = context.ppc_f128_type();
 
 assert_eq!(f128_type.get_context(), context);
-
source

pub fn ptr_type(&self, address_space: AddressSpace) -> PointerType<'_>

Gets the PointerType. It will be assigned the current context.

+
source

pub fn ptr_type(&self, address_space: AddressSpace) -> PointerType<'_>

Gets the PointerType. It will be assigned the current context.

§Example
use inkwell::context::Context;
 use inkwell::AddressSpace;
@@ -285,7 +285,7 @@ Target::initialize_native(&InitializationConfig::d
 
 assert_eq!(ptr_type.get_address_space(), AddressSpace::default());
 assert_eq!(ptr_type.get_context(), context);
-
source

pub fn struct_type( +

source

pub fn struct_type( &self, field_types: &[BasicTypeEnum<'_>], packed: bool @@ -299,7 +299,7 @@ Target::initialize_native(&InitializationConfig::d let struct_type = context.struct_type(&[i16_type.into(), f32_type.into()], false); assert_eq!(struct_type.get_field_types(), &[i16_type.into(), f32_type.into()]); -

source

pub fn opaque_struct_type(&self, name: &str) -> StructType<'_>

Creates an opaque StructType with no type definition yet defined.

+
source

pub fn opaque_struct_type(&self, name: &str) -> StructType<'_>

Creates an opaque StructType with no type definition yet defined.

§Example
use inkwell::context::Context;
 
@@ -309,7 +309,7 @@ Target::initialize_native(&InitializationConfig::d
 let struct_type = context.opaque_struct_type("my_struct");
 
 assert_eq!(struct_type.get_field_types(), &[]);
-
source

pub fn get_struct_type<'ctx>(&self, name: &str) -> Option<StructType<'ctx>>

Gets a named StructType from this Context.

+
source

pub fn get_struct_type<'ctx>(&self, name: &str) -> Option<StructType<'ctx>>

Gets a named StructType from this Context.

§Example
use inkwell::context::Context;
 
@@ -320,7 +320,7 @@ Target::initialize_native(&InitializationConfig::d
 let opaque = context.opaque_struct_type("foo");
 
 assert_eq!(context.get_struct_type("foo").unwrap(), opaque);
-
source

pub fn const_struct( +

source

pub fn const_struct( &self, values: &[BasicValueEnum<'_>], packed: bool @@ -336,7 +336,7 @@ Target::initialize_native(&InitializationConfig::d let const_struct = context.const_struct(&[i16_two.into(), f32_one.into()], false); assert_eq!(const_struct.get_type().get_field_types(), &[i16_type.into(), f32_type.into()]); -

source

pub fn append_basic_block<'ctx>( +

source

pub fn append_basic_block<'ctx>( &'ctx self, function: FunctionValue<'ctx>, name: &str @@ -358,7 +358,7 @@ Target::initialize_native(&InitializationConfig::d assert_eq!(fn_value.count_basic_blocks(), 2); assert_eq!(fn_value.get_first_basic_block().unwrap(), entry_basic_block); assert_eq!(fn_value.get_last_basic_block().unwrap(), last_basic_block); -

source

pub fn insert_basic_block_after<'ctx>( +

source

pub fn insert_basic_block_after<'ctx>( &'ctx self, basic_block: BasicBlock<'ctx>, name: &str @@ -380,7 +380,7 @@ Target::initialize_native(&InitializationConfig::d assert_eq!(fn_value.count_basic_blocks(), 2); assert_eq!(fn_value.get_first_basic_block().unwrap(), entry_basic_block); assert_eq!(fn_value.get_last_basic_block().unwrap(), last_basic_block); -

source

pub fn prepend_basic_block<'ctx>( +

source

pub fn prepend_basic_block<'ctx>( &'ctx self, basic_block: BasicBlock<'ctx>, name: &str @@ -402,7 +402,7 @@ Target::initialize_native(&InitializationConfig::d assert_eq!(fn_value.count_basic_blocks(), 2); assert_eq!(fn_value.get_first_basic_block().unwrap(), first_basic_block); assert_eq!(fn_value.get_last_basic_block().unwrap(), entry_basic_block); -

source

pub fn metadata_node<'ctx>( +

source

pub fn metadata_node<'ctx>( &'ctx self, values: &[BasicMetadataValueEnum<'ctx>] ) -> MetadataValue<'ctx>

Creates a MetadataValue tuple of heterogeneous types (a “Node”) for the current context. It can be assigned to a value.

@@ -431,7 +431,7 @@ builder.position_at_end(entry_block); assert!(md_node.is_node()); ret_instr.set_metadata(md_node, 0);
-
source

pub fn metadata_string(&self, string: &str) -> MetadataValue<'_>

Creates a MetadataValue string for the current context. It can be assigned to a value.

+
source

pub fn metadata_string(&self, string: &str) -> MetadataValue<'_>

Creates a MetadataValue string for the current context. It can be assigned to a value.

§Example
use inkwell::context::Context;
 
@@ -454,7 +454,7 @@ builder.position_at_end(entry_block);
 assert!(md_string.is_string());
 
 ret_instr.set_metadata(md_string, 0);
-
source

pub fn get_kind_id(&self, key: &str) -> u32

Obtains the index of a metadata kind id. If the string doesn’t exist, LLVM will add it at index FIRST_CUSTOM_METADATA_KIND_ID onward.

+
source

pub fn get_kind_id(&self, key: &str) -> u32

Obtains the index of a metadata kind id. If the string doesn’t exist, LLVM will add it at index FIRST_CUSTOM_METADATA_KIND_ID onward.

§Example
use inkwell::context::Context;
 use inkwell::values::FIRST_CUSTOM_METADATA_KIND_ID;
@@ -467,7 +467,7 @@ ret_instr.set_metadata(md_string, 0);
// Custom kind id doesn't exist in LLVM until now: assert_eq!(context.get_kind_id("foo"), FIRST_CUSTOM_METADATA_KIND_ID);
-
source

pub fn create_enum_attribute(&self, kind_id: u32, val: u64) -> Attribute

Creates an enum Attribute in this Context.

+
source

pub fn create_enum_attribute(&self, kind_id: u32, val: u64) -> Attribute

Creates an enum Attribute in this Context.

§Example
use inkwell::context::Context;
 
@@ -475,7 +475,7 @@ ret_instr.set_metadata(md_string, 0);
let enum_attribute = context.create_enum_attribute(0, 10); assert!(enum_attribute.is_enum());
-
source

pub fn create_string_attribute(&self, key: &str, val: &str) -> Attribute

Creates a string Attribute in this Context.

+
source

pub fn create_string_attribute(&self, key: &str, val: &str) -> Attribute

Creates a string Attribute in this Context.

§Example
use inkwell::context::Context;
 
@@ -483,7 +483,7 @@ ret_instr.set_metadata(md_string, 0);
let string_attribute = context.create_string_attribute("my_key_123", "my_val"); assert!(string_attribute.is_string());
-
source

pub fn create_type_attribute( +

source

pub fn create_type_attribute( &self, kind_id: u32, type_ref: AnyTypeEnum<'_> @@ -504,7 +504,7 @@ ret_instr.set_metadata(md_string, 0);assert!(type_attribute.is_type()); assert_eq!(type_attribute.get_type_value(), any_type); assert_ne!(type_attribute.get_type_value(), context.i64_type().as_any_type_enum()); -

source

pub fn const_string( +

source

pub fn const_string( &self, string: &[u8], null_terminated: bool @@ -517,14 +517,14 @@ ret_instr.set_metadata(md_string, 0);let string = context.const_string(b"my_string", false); assert_eq!(string.print_to_string().to_string(), "[9 x i8] c\"my_string\""); -

Trait Implementations§

source§

impl<'ctx> AsContextRef<'ctx> for &'ctx Context

source§

fn as_ctx_ref(&self) -> LLVMContextRef

Acquires the underlying raw pointer belonging to this Context type.

-
source§

impl Debug for Context

source§

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

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

impl Drop for Context

source§

fn drop(&mut self)

Executes the destructor for this type. Read more
source§

impl PartialEq<Context> for ContextRef<'_>

source§

fn eq(&self, other: &Context) -> bool

This method tests for self and other values to be equal, and is used +

Trait Implementations§

source§

impl<'ctx> AsContextRef<'ctx> for &'ctx Context

source§

fn as_ctx_ref(&self) -> LLVMContextRef

Acquires the underlying raw pointer belonging to this Context type.

+
source§

impl Debug for Context

source§

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

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

impl Drop for Context

source§

fn drop(&mut self)

Executes the destructor for this type. Read more
source§

impl PartialEq<Context> for ContextRef<'_>

source§

fn eq(&self, other: &Context) -> bool

This method tests for self and other values to be equal, and is used by ==.
1.0.0 · source§

fn ne(&self, other: &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<ContextRef<'_>> for Context

source§

fn eq(&self, other: &ContextRef<'_>) -> bool

This method tests for self and other values to be equal, and is used -by ==.
1.0.0 · source§

fn ne(&self, other: &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 Context

source§

fn eq(&self, other: &Context) -> 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<ContextRef<'_>> for Context

source§

fn eq(&self, other: &ContextRef<'_>) -> bool

This method tests for self and other values to be equal, and is used by ==.
1.0.0 · source§

fn ne(&self, other: &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 Context

source§

impl Send for Context

source§

impl StructuralPartialEq for Context

Auto Trait Implementations§

Blanket Implementations§

source§

impl<T> Any for T
where +sufficient, and should not be overridden without very good reason.

source§

impl PartialEq for Context

source§

fn eq(&self, other: &Context) -> bool

This method tests for self and other values to be equal, and is used +by ==.
1.0.0 · source§

fn ne(&self, other: &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 Context

source§

impl Send for Context

source§

impl StructuralPartialEq for Context

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/inkwell/context/struct.ContextRef.html b/inkwell/context/struct.ContextRef.html index 2121410ac..0ac6612ef 100644 --- a/inkwell/context/struct.ContextRef.html +++ b/inkwell/context/struct.ContextRef.html @@ -1,18 +1,18 @@ ContextRef in inkwell::context - Rust
-

Struct inkwell::context::ContextRef

source · 
pub struct ContextRef<'ctx> { /* private fields */ }
Expand description

A ContextRef is a smart pointer allowing borrowed access to a type’s Context.

-

Implementations§

source§

impl<'ctx> ContextRef<'ctx>

source

pub fn create_builder(&self) -> Builder<'ctx>

Creates a new Builder for a Context.

+

Struct inkwell::context::ContextRef

source · 
pub struct ContextRef<'ctx> { /* private fields */ }
Expand description

A ContextRef is a smart pointer allowing borrowed access to a type’s Context.

+

Implementations§

source§

impl<'ctx> ContextRef<'ctx>

source

pub fn create_builder(&self) -> Builder<'ctx>

Creates a new Builder for a Context.

§Example
use inkwell::context::Context;
 
 let context = Context::create();
 let builder = context.create_builder();
-
source

pub fn create_module(&self, name: &str) -> Module<'ctx>

Creates a new Module for a Context.

+
source

pub fn create_module(&self, name: &str) -> Module<'ctx>

Creates a new Module for a Context.

§Example
use inkwell::context::Context;
 
 let context = Context::create();
 let module = context.create_module("my_module");
-
source

pub fn create_module_from_ir( +

source

pub fn create_module_from_ir( &self, memory_buffer: MemoryBuffer ) -> Result<Module<'ctx>, LLVMString>

Creates a new Module for the current Context from a MemoryBuffer.

@@ -33,7 +33,7 @@ builder.build_return(None).unwrap(); let memory_buffer = module.write_bitcode_to_memory(); let module2 = context.create_module_from_ir(memory_buffer).unwrap();
-
source

pub fn create_inline_asm( +

source

pub fn create_inline_asm( &self, ty: FunctionType<'ctx>, assembly: String, @@ -102,7 +102,7 @@ builder.position_at_end(basic_block); builder.build_indirect_call(asm_fn, asm, params, "exit").unwrap(); builder.build_return(None).unwrap();

-
source

pub fn void_type(&self) -> VoidType<'ctx>

Gets the VoidType. It will be assigned the current context.

+
source

pub fn void_type(&self) -> VoidType<'ctx>

Gets the VoidType. It will be assigned the current context.

§Example
use inkwell::context::Context;
 
@@ -110,7 +110,7 @@ builder.build_return(None).unwrap();let void_type = context.void_type();
 
 assert_eq!(void_type.get_context(), context);
-
source

pub fn bool_type(&self) -> IntType<'ctx>

Gets the IntType representing 1 bit width. It will be assigned the current context.

+
source

pub fn bool_type(&self) -> IntType<'ctx>

Gets the IntType representing 1 bit width. It will be assigned the current context.

§Example
use inkwell::context::Context;
 
@@ -119,7 +119,7 @@ builder.build_return(None).unwrap();assert_eq!(bool_type.get_bit_width(), 1);
 assert_eq!(bool_type.get_context(), context);
-
source

pub fn i8_type(&self) -> IntType<'ctx>

Gets the IntType representing 8 bit width. It will be assigned the current context.

+
source

pub fn i8_type(&self) -> IntType<'ctx>

Gets the IntType representing 8 bit width. It will be assigned the current context.

§Example
use inkwell::context::Context;
 
@@ -128,7 +128,7 @@ builder.build_return(None).unwrap();assert_eq!(i8_type.get_bit_width(), 8);
 assert_eq!(i8_type.get_context(), context);
-
source

pub fn i16_type(&self) -> IntType<'ctx>

Gets the IntType representing 16 bit width. It will be assigned the current context.

+
source

pub fn i16_type(&self) -> IntType<'ctx>

Gets the IntType representing 16 bit width. It will be assigned the current context.

§Example
use inkwell::context::Context;
 
@@ -137,7 +137,7 @@ builder.build_return(None).unwrap();assert_eq!(i16_type.get_bit_width(), 16);
 assert_eq!(i16_type.get_context(), context);
-
source

pub fn i32_type(&self) -> IntType<'ctx>

Gets the IntType representing 32 bit width. It will be assigned the current context.

+
source

pub fn i32_type(&self) -> IntType<'ctx>

Gets the IntType representing 32 bit width. It will be assigned the current context.

§Example
use inkwell::context::Context;
 
@@ -146,7 +146,7 @@ builder.build_return(None).unwrap();assert_eq!(i32_type.get_bit_width(), 32);
 assert_eq!(i32_type.get_context(), context);
-
source

pub fn i64_type(&self) -> IntType<'ctx>

Gets the IntType representing 64 bit width. It will be assigned the current context.

+
source

pub fn i64_type(&self) -> IntType<'ctx>

Gets the IntType representing 64 bit width. It will be assigned the current context.

§Example
use inkwell::context::Context;
 
@@ -155,7 +155,7 @@ builder.build_return(None).unwrap();assert_eq!(i64_type.get_bit_width(), 64);
 assert_eq!(i64_type.get_context(), context);
-
source

pub fn i128_type(&self) -> IntType<'ctx>

Gets the IntType representing 128 bit width. It will be assigned the current context.

+
source

pub fn i128_type(&self) -> IntType<'ctx>

Gets the IntType representing 128 bit width. It will be assigned the current context.

§Example
use inkwell::context::Context;
 
@@ -164,7 +164,7 @@ builder.build_return(None).unwrap();assert_eq!(i128_type.get_bit_width(), 128);
 assert_eq!(i128_type.get_context(), context);
-
source

pub fn custom_width_int_type(&self, bits: u32) -> IntType<'ctx>

Gets the IntType representing a custom bit width. It will be assigned the current context.

+
source

pub fn custom_width_int_type(&self, bits: u32) -> IntType<'ctx>

Gets the IntType representing a custom bit width. It will be assigned the current context.

§Example
use inkwell::context::Context;
 
@@ -173,7 +173,7 @@ builder.build_return(None).unwrap();assert_eq!(i42_type.get_bit_width(), 42);
 assert_eq!(i42_type.get_context(), context);
-
source

pub fn metadata_type(&self) -> MetadataType<'ctx>

Gets the MetadataType representing 128 bit width. It will be assigned the current context.

+
source

pub fn metadata_type(&self) -> MetadataType<'ctx>

Gets the MetadataType representing 128 bit width. It will be assigned the current context.

§Example
use inkwell::context::Context;
 use inkwell::values::IntValue;
@@ -182,7 +182,7 @@ builder.build_return(None).unwrap();let md_type = context.metadata_type();
 
 assert_eq!(md_type.get_context(), context);
-
source

pub fn ptr_sized_int_type( +

source

pub fn ptr_sized_int_type( &self, target_data: &TargetData, address_space: Option<AddressSpace> @@ -199,7 +199,7 @@ Target::initialize_native(&InitializationConfig::d let execution_engine = module.create_jit_execution_engine(OptimizationLevel::None).unwrap(); let target_data = execution_engine.get_target_data(); let int_type = context.ptr_sized_int_type(&target_data, None);

-
source

pub fn f16_type(&self) -> FloatType<'ctx>

Gets the FloatType representing a 16 bit width. It will be assigned the current context.

+
source

pub fn f16_type(&self) -> FloatType<'ctx>

Gets the FloatType representing a 16 bit width. It will be assigned the current context.

§Example
use inkwell::context::Context;
 
@@ -208,7 +208,7 @@ Target::initialize_native(&InitializationConfig::d
 let f16_type = context.f16_type();
 
 assert_eq!(f16_type.get_context(), context);
-
source

pub fn f32_type(&self) -> FloatType<'ctx>

Gets the FloatType representing a 32 bit width. It will be assigned the current context.

+
source

pub fn f32_type(&self) -> FloatType<'ctx>

Gets the FloatType representing a 32 bit width. It will be assigned the current context.

§Example
use inkwell::context::Context;
 
@@ -217,7 +217,7 @@ Target::initialize_native(&InitializationConfig::d
 let f32_type = context.f32_type();
 
 assert_eq!(f32_type.get_context(), context);
-
source

pub fn f64_type(&self) -> FloatType<'ctx>

Gets the FloatType representing a 64 bit width. It will be assigned the current context.

+
source

pub fn f64_type(&self) -> FloatType<'ctx>

Gets the FloatType representing a 64 bit width. It will be assigned the current context.

§Example
use inkwell::context::Context;
 
@@ -226,7 +226,7 @@ Target::initialize_native(&InitializationConfig::d
 let f64_type = context.f64_type();
 
 assert_eq!(f64_type.get_context(), context);
-
source

pub fn x86_f80_type(&self) -> FloatType<'ctx>

Gets the FloatType representing a 80 bit width. It will be assigned the current context.

+
source

pub fn x86_f80_type(&self) -> FloatType<'ctx>

Gets the FloatType representing a 80 bit width. It will be assigned the current context.

§Example
use inkwell::context::Context;
 
@@ -235,7 +235,7 @@ Target::initialize_native(&InitializationConfig::d
 let x86_f80_type = context.x86_f80_type();
 
 assert_eq!(x86_f80_type.get_context(), context);
-
source

pub fn f128_type(&self) -> FloatType<'ctx>

Gets the FloatType representing a 128 bit width. It will be assigned the current context.

+
source

pub fn f128_type(&self) -> FloatType<'ctx>

Gets the FloatType representing a 128 bit width. It will be assigned the current context.

§Example
use inkwell::context::Context;
 
@@ -244,7 +244,7 @@ Target::initialize_native(&InitializationConfig::d
 let f128_type = context.f128_type();
 
 assert_eq!(f128_type.get_context(), context);
-
source

pub fn ppc_f128_type(&self) -> FloatType<'ctx>

Gets the FloatType representing a 128 bit width. It will be assigned the current context.

+
source

pub fn ppc_f128_type(&self) -> FloatType<'ctx>

Gets the FloatType representing a 128 bit width. It will be assigned the current context.

PPC is two 64 bits side by side rather than one single 128 bit float.

§Example
use inkwell::context::Context;
@@ -254,7 +254,7 @@ Target::initialize_native(&InitializationConfig::d
 let f128_type = context.ppc_f128_type();
 
 assert_eq!(f128_type.get_context(), context);
-
source

pub fn ptr_type(&self, address_space: AddressSpace) -> PointerType<'ctx>

Gets the PointerType. It will be assigned the current context.

+
source

pub fn ptr_type(&self, address_space: AddressSpace) -> PointerType<'ctx>

Gets the PointerType. It will be assigned the current context.

§Example
use inkwell::context::Context;
 use inkwell::AddressSpace;
@@ -264,7 +264,7 @@ Target::initialize_native(&InitializationConfig::d
 
 assert_eq!(ptr_type.get_address_space(), AddressSpace::default());
 assert_eq!(ptr_type.get_context(), context);
-
source

pub fn struct_type( +

source

pub fn struct_type( &self, field_types: &[BasicTypeEnum<'ctx>], packed: bool @@ -278,7 +278,7 @@ Target::initialize_native(&InitializationConfig::d let struct_type = context.struct_type(&[i16_type.into(), f32_type.into()], false); assert_eq!(struct_type.get_field_types(), &[i16_type.into(), f32_type.into()]); -

source

pub fn opaque_struct_type(&self, name: &str) -> StructType<'ctx>

Creates an opaque StructType with no type definition yet defined.

+
source

pub fn opaque_struct_type(&self, name: &str) -> StructType<'ctx>

Creates an opaque StructType with no type definition yet defined.

§Example
use inkwell::context::Context;
 
@@ -288,7 +288,7 @@ Target::initialize_native(&InitializationConfig::d
 let struct_type = context.opaque_struct_type("my_struct");
 
 assert_eq!(struct_type.get_field_types(), &[]);
-
source

pub fn get_struct_type(&self, name: &str) -> Option<StructType<'ctx>>

Gets a named StructType from this Context.

+
source

pub fn get_struct_type(&self, name: &str) -> Option<StructType<'ctx>>

Gets a named StructType from this Context.

§Example
use inkwell::context::Context;
 
@@ -299,7 +299,7 @@ Target::initialize_native(&InitializationConfig::d
 let opaque = context.opaque_struct_type("foo");
 
 assert_eq!(context.get_struct_type("foo").unwrap(), opaque);
-
source

pub fn const_struct( +

source

pub fn const_struct( &self, values: &[BasicValueEnum<'ctx>], packed: bool @@ -315,7 +315,7 @@ Target::initialize_native(&InitializationConfig::d let const_struct = context.const_struct(&[i16_two.into(), f32_one.into()], false); assert_eq!(const_struct.get_type().get_field_types(), &[i16_type.into(), f32_type.into()]); -

source

pub fn append_basic_block( +

source

pub fn append_basic_block( &self, function: FunctionValue<'ctx>, name: &str @@ -337,7 +337,7 @@ Target::initialize_native(&InitializationConfig::d assert_eq!(fn_value.count_basic_blocks(), 2); assert_eq!(fn_value.get_first_basic_block().unwrap(), entry_basic_block); assert_eq!(fn_value.get_last_basic_block().unwrap(), last_basic_block); -

source

pub fn insert_basic_block_after( +

source

pub fn insert_basic_block_after( &self, basic_block: BasicBlock<'ctx>, name: &str @@ -359,7 +359,7 @@ Target::initialize_native(&InitializationConfig::d assert_eq!(fn_value.count_basic_blocks(), 2); assert_eq!(fn_value.get_first_basic_block().unwrap(), entry_basic_block); assert_eq!(fn_value.get_last_basic_block().unwrap(), last_basic_block); -

source

pub fn prepend_basic_block( +

source

pub fn prepend_basic_block( &self, basic_block: BasicBlock<'ctx>, name: &str @@ -381,7 +381,7 @@ Target::initialize_native(&InitializationConfig::d assert_eq!(fn_value.count_basic_blocks(), 2); assert_eq!(fn_value.get_first_basic_block().unwrap(), first_basic_block); assert_eq!(fn_value.get_last_basic_block().unwrap(), entry_basic_block); -

source

pub fn metadata_node( +

source

pub fn metadata_node( &self, values: &[BasicMetadataValueEnum<'ctx>] ) -> MetadataValue<'ctx>

Creates a MetadataValue tuple of heterogeneous types (a “Node”) for the current context. It can be assigned to a value.

@@ -410,7 +410,7 @@ builder.position_at_end(entry_block); assert!(md_node.is_node()); ret_instr.set_metadata(md_node, 0);
-
source

pub fn metadata_string(&self, string: &str) -> MetadataValue<'ctx>

Creates a MetadataValue string for the current context. It can be assigned to a value.

+
source

pub fn metadata_string(&self, string: &str) -> MetadataValue<'ctx>

Creates a MetadataValue string for the current context. It can be assigned to a value.

§Example
use inkwell::context::Context;
 
@@ -433,7 +433,7 @@ builder.position_at_end(entry_block);
 assert!(md_string.is_string());
 
 ret_instr.set_metadata(md_string, 0);
-
source

pub fn get_kind_id(&self, key: &str) -> u32

Obtains the index of a metadata kind id. If the string doesn’t exist, LLVM will add it at index FIRST_CUSTOM_METADATA_KIND_ID onward.

+
source

pub fn get_kind_id(&self, key: &str) -> u32

Obtains the index of a metadata kind id. If the string doesn’t exist, LLVM will add it at index FIRST_CUSTOM_METADATA_KIND_ID onward.

§Example
use inkwell::context::Context;
 use inkwell::values::FIRST_CUSTOM_METADATA_KIND_ID;
@@ -446,7 +446,7 @@ ret_instr.set_metadata(md_string, 0);
// Custom kind id doesn't exist in LLVM until now: assert_eq!(context.get_kind_id("foo"), FIRST_CUSTOM_METADATA_KIND_ID);
-
source

pub fn create_enum_attribute(&self, kind_id: u32, val: u64) -> Attribute

Creates an enum Attribute in this Context.

+
source

pub fn create_enum_attribute(&self, kind_id: u32, val: u64) -> Attribute

Creates an enum Attribute in this Context.

§Example
use inkwell::context::Context;
 
@@ -454,7 +454,7 @@ ret_instr.set_metadata(md_string, 0);
let enum_attribute = context.create_enum_attribute(0, 10); assert!(enum_attribute.is_enum());
-
source

pub fn create_string_attribute(&self, key: &str, val: &str) -> Attribute

Creates a string Attribute in this Context.

+
source

pub fn create_string_attribute(&self, key: &str, val: &str) -> Attribute

Creates a string Attribute in this Context.

§Example
use inkwell::context::Context;
 
@@ -462,7 +462,7 @@ ret_instr.set_metadata(md_string, 0);
let string_attribute = context.create_string_attribute("my_key_123", "my_val"); assert!(string_attribute.is_string());
-
source

pub fn create_type_attribute( +

source

pub fn create_type_attribute( &self, kind_id: u32, type_ref: AnyTypeEnum<'_> @@ -483,7 +483,7 @@ ret_instr.set_metadata(md_string, 0);assert!(type_attribute.is_type()); assert_eq!(type_attribute.get_type_value(), any_type); assert_ne!(type_attribute.get_type_value(), context.i64_type().as_any_type_enum()); -

source

pub fn const_string( +

source

pub fn const_string( &self, string: &[u8], null_terminated: bool @@ -496,14 +496,14 @@ ret_instr.set_metadata(md_string, 0);let string = context.const_string(b"my_string", false); assert_eq!(string.print_to_string().to_string(), "[9 x i8] c\"my_string\""); -

Trait Implementations§

source§

impl<'ctx> AsContextRef<'ctx> for ContextRef<'ctx>

source§

fn as_ctx_ref(&self) -> LLVMContextRef

Acquires the underlying raw pointer belonging to this ContextRef type.

-
source§

impl<'ctx> Clone for ContextRef<'ctx>

source§

fn clone(&self) -> ContextRef<'ctx>

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<'ctx> Debug for ContextRef<'ctx>

source§

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

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

impl PartialEq<Context> for ContextRef<'_>

source§

fn eq(&self, other: &Context) -> bool

This method tests for self and other values to be equal, and is used +

Trait Implementations§

source§

impl<'ctx> AsContextRef<'ctx> for ContextRef<'ctx>

source§

fn as_ctx_ref(&self) -> LLVMContextRef

Acquires the underlying raw pointer belonging to this ContextRef type.

+
source§

impl<'ctx> Clone for ContextRef<'ctx>

source§

fn clone(&self) -> ContextRef<'ctx>

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<'ctx> Debug for ContextRef<'ctx>

source§

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

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

impl PartialEq<Context> for ContextRef<'_>

source§

fn eq(&self, other: &Context) -> bool

This method tests for self and other values to be equal, and is used by ==.
1.0.0 · source§

fn ne(&self, other: &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<ContextRef<'_>> for Context

source§

fn eq(&self, other: &ContextRef<'_>) -> 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<ContextRef<'_>> for Context

source§

fn eq(&self, other: &ContextRef<'_>) -> bool

This method tests for self and other values to be equal, and is used by ==.
1.0.0 · source§

fn ne(&self, other: &Rhs) -> bool

This method tests for !=. The default implementation is almost always -sufficient, and should not be overridden without very good reason.
source§

impl<'ctx> PartialEq for ContextRef<'ctx>

source§

fn eq(&self, other: &ContextRef<'ctx>) -> 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<'ctx> PartialEq for ContextRef<'ctx>

source§

fn eq(&self, other: &ContextRef<'ctx>) -> bool

This method tests for self and other values to be equal, and is used by ==.
1.0.0 · source§

fn ne(&self, other: &Rhs) -> bool

This method tests for !=. The default implementation is almost always -sufficient, and should not be overridden without very good reason.
source§

impl<'ctx> Copy for ContextRef<'ctx>

source§

impl<'ctx> Eq for ContextRef<'ctx>

source§

impl<'ctx> StructuralPartialEq for ContextRef<'ctx>

Auto Trait Implementations§

§

impl<'ctx> Freeze for ContextRef<'ctx>

§

impl<'ctx> RefUnwindSafe for ContextRef<'ctx>

§

impl<'ctx> !Send for ContextRef<'ctx>

§

impl<'ctx> !Sync for ContextRef<'ctx>

§

impl<'ctx> Unpin for ContextRef<'ctx>

§

impl<'ctx> UnwindSafe for ContextRef<'ctx>

Blanket Implementations§

source§

impl<T> Any for T
where +sufficient, and should not be overridden without very good reason.

source§

impl<'ctx> Copy for ContextRef<'ctx>

source§

impl<'ctx> Eq for ContextRef<'ctx>

source§

impl<'ctx> StructuralPartialEq for ContextRef<'ctx>

Auto Trait Implementations§

§

impl<'ctx> Freeze for ContextRef<'ctx>

§

impl<'ctx> RefUnwindSafe for ContextRef<'ctx>

§

impl<'ctx> !Send for ContextRef<'ctx>

§

impl<'ctx> !Sync for ContextRef<'ctx>

§

impl<'ctx> Unpin for ContextRef<'ctx>

§

impl<'ctx> UnwindSafe for ContextRef<'ctx>

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/inkwell/context/trait.AsContextRef.html b/inkwell/context/trait.AsContextRef.html index 2d4e554d3..4bbdc2a12 100644 --- a/inkwell/context/trait.AsContextRef.html +++ b/inkwell/context/trait.AsContextRef.html @@ -1,7 +1,7 @@ AsContextRef in inkwell::context - Rust
-

Trait inkwell::context::AsContextRef

source · 
pub unsafe trait AsContextRef<'ctx> {
+    
Trait inkwell::context::AsContextRef
source · 
pub unsafe trait AsContextRef<'ctx> {
     // Required method
     fn as_ctx_ref(&self) -> LLVMContextRef;
 }
Expand description
This trait abstracts an LLVM Context type and should be implemented with caution.

-
Required Methods§
source
fn as_ctx_ref(&self) -> LLVMContextRef
Returns the internal LLVM reference behind the type

-
Implementors§
source§
impl<'ctx> AsContextRef<'ctx> for &'ctx Context
source§
impl<'ctx> AsContextRef<'ctx> for ContextRef<'ctx>

\ No newline at end of file
+

Required Methods§

source

fn as_ctx_ref(&self) -> LLVMContextRef

Returns the internal LLVM reference behind the type

+

Implementors§

source§

impl<'ctx> AsContextRef<'ctx> for &'ctx Context

source§

impl<'ctx> AsContextRef<'ctx> for ContextRef<'ctx>

\ No newline at end of file diff --git a/inkwell/debug_info/enum.DWARFEmissionKind.html b/inkwell/debug_info/enum.DWARFEmissionKind.html index fb54199d6..1a9feec9b 100644 --- a/inkwell/debug_info/enum.DWARFEmissionKind.html +++ b/inkwell/debug_info/enum.DWARFEmissionKind.html @@ -1,19 +1,19 @@ DWARFEmissionKind in inkwell::debug_info - Rust
-

Enum inkwell::debug_info::DWARFEmissionKind

source · 
pub enum DWARFEmissionKind {
+    
Enum inkwell::debug_info::DWARFEmissionKind
source · 
pub enum DWARFEmissionKind {
     None,
     Full,
     LineTablesOnly,
 }
Expand description
The amount of debug information to emit. Corresponds to LLVMDWARFEmissionKind enum from LLVM.

-
Variants§
§
None
§
Full
§
LineTablesOnly
Trait Implementations§
source§
impl Clone for DWARFEmissionKind
source§
fn clone(&self) -> DWARFEmissionKind
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 DWARFEmissionKind
source§
fn fmt(&self, f: &mut Formatter<'_>) -> Result
Formats the value using the given formatter. Read more
source§
impl From<LLVMDWARFEmissionKind> for DWARFEmissionKind
source§
fn from(src: LLVMDWARFEmissionKind) -> Self
Converts to this type from the input type.
source§
impl Hash for DWARFEmissionKind
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
+
Variants§
§
None
§
Full
§
LineTablesOnly
Trait Implementations§
source§
impl Clone for DWARFEmissionKind
source§
fn clone(&self) -> DWARFEmissionKind
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 DWARFEmissionKind
source§
fn fmt(&self, f: &mut Formatter<'_>) -> Result
Formats the value using the given formatter. Read more
source§
impl From<LLVMDWARFEmissionKind> for DWARFEmissionKind
source§
fn from(src: LLVMDWARFEmissionKind) -> Self
Converts to this type from the input type.
source§
impl Hash for DWARFEmissionKind
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 Into<LLVMDWARFEmissionKind> for DWARFEmissionKind
source§
fn into(self) -> LLVMDWARFEmissionKind
Converts this type into the (usually inferred) input type.
source§
impl Ord for DWARFEmissionKind
source§
fn cmp(&self, other: &DWARFEmissionKind) -> 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 Into<LLVMDWARFEmissionKind> for DWARFEmissionKind
source§
fn into(self) -> LLVMDWARFEmissionKind
Converts this type into the (usually inferred) input type.
source§
impl Ord for DWARFEmissionKind
source§
fn cmp(&self, other: &DWARFEmissionKind) -> 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 DWARFEmissionKind
source§
fn eq(&self, other: &DWARFEmissionKind) -> 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 DWARFEmissionKind
source§
fn eq(&self, other: &DWARFEmissionKind) -> bool
This method tests for self and other values to be equal, and is used
 by ==.
1.0.0 · source§
fn ne(&self, other: &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 DWARFEmissionKind
source§
fn partial_cmp(&self, other: &DWARFEmissionKind) -> 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 DWARFEmissionKind
source§
fn partial_cmp(&self, other: &DWARFEmissionKind) -> Option<Ordering>
This method returns an ordering between self and other values if one exists. Read more
1.0.0 · source§
fn lt(&self, other: &Rhs) -> bool
This method tests less than (for self and other) and is used by the < operator. Read more
1.0.0 · source§
fn le(&self, other: &Rhs) -> bool
This method tests less than or equal to (for self and other) and is used by the <=
 operator. Read more
1.0.0 · source§
fn gt(&self, other: &Rhs) -> bool
This method tests greater than (for self and other) and is used by the > operator. Read more
1.0.0 · source§
fn ge(&self, other: &Rhs) -> bool
This method tests greater than or equal to (for self and other) and is used by the >=
-operator. Read more
source§
impl Copy for DWARFEmissionKind
source§
impl Eq for DWARFEmissionKind
source§
impl StructuralPartialEq for DWARFEmissionKind

Auto Trait Implementations§

Blanket Implementations§

source§

impl<T> Any for T
where +operator. Read more

source§

impl Copy for DWARFEmissionKind

source§

impl Eq for DWARFEmissionKind

source§

impl StructuralPartialEq for DWARFEmissionKind

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/inkwell/debug_info/enum.DWARFSourceLanguage.html b/inkwell/debug_info/enum.DWARFSourceLanguage.html index 9183fba46..d6f76078b 100644 --- a/inkwell/debug_info/enum.DWARFSourceLanguage.html +++ b/inkwell/debug_info/enum.DWARFSourceLanguage.html @@ -1,5 +1,5 @@ DWARFSourceLanguage in inkwell::debug_info - Rust
-

Enum inkwell::debug_info::DWARFSourceLanguage

source · 
pub enum DWARFSourceLanguage {
+    
Enum inkwell::debug_info::DWARFSourceLanguage
source · 
pub enum DWARFSourceLanguage {
 
Show 50 variants    C89,
     C,
     Ada83,
@@ -51,16 +51,16 @@
     Ada2012,
     Mojo,
 
}
Expand description
Source languages known by DWARF. Corresponds to LLVMDWARFSourceLanguage enum from LLVM.

-
Variants§
§
C89
§
C
§
Ada83
§
CPlusPlus
§
Cobol74
§
Cobol85
§
Fortran77
§
Fortran90
§
Pascal83
§
Modula2
§
Java
§
C99
§
Ada95
§
Fortran95
§
PLI
§
ObjC
§
ObjCPlusPlus
§
UPC
§
D
§
Python
§
OpenCL
§
Go
§
Modula3
§
Haskell
§
CPlusPlus03
§
CPlusPlus11
§
OCaml
§
Rust
§
C11
§
Swift
§
Julia
§
Dylan
§
CPlusPlus14
§
Fortran03
§
Fortran08
§
RenderScript
§
BLISS
§
MipsAssembler
§
GOOGLERenderScript
§
BORLANDDelphi
§
Kotlin
§
Zig
§
Crystal
§
CPlusPlus17
§
CPlusPlus20
§
C17
§
Fortran18
§
Ada2005
§
Ada2012
§
Mojo
Trait Implementations§
source§
impl Clone for DWARFSourceLanguage
source§
fn clone(&self) -> DWARFSourceLanguage
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 DWARFSourceLanguage
source§
fn fmt(&self, f: &mut Formatter<'_>) -> Result
Formats the value using the given formatter. Read more
source§
impl From<LLVMDWARFSourceLanguage> for DWARFSourceLanguage
source§
fn from(src: LLVMDWARFSourceLanguage) -> Self
Converts to this type from the input type.
source§
impl Hash for DWARFSourceLanguage
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
+
Variants§
§
C89
§
C
§
Ada83
§
CPlusPlus
§
Cobol74
§
Cobol85
§
Fortran77
§
Fortran90
§
Pascal83
§
Modula2
§
Java
§
C99
§
Ada95
§
Fortran95
§
PLI
§
ObjC
§
ObjCPlusPlus
§
UPC
§
D
§
Python
§
OpenCL
§
Go
§
Modula3
§
Haskell
§
CPlusPlus03
§
CPlusPlus11
§
OCaml
§
Rust
§
C11
§
Swift
§
Julia
§
Dylan
§
CPlusPlus14
§
Fortran03
§
Fortran08
§
RenderScript
§
BLISS
§
MipsAssembler
§
GOOGLERenderScript
§
BORLANDDelphi
§
Kotlin
§
Zig
§
Crystal
§
CPlusPlus17
§
CPlusPlus20
§
C17
§
Fortran18
§
Ada2005
§
Ada2012
§
Mojo
Trait Implementations§
source§
impl Clone for DWARFSourceLanguage
source§
fn clone(&self) -> DWARFSourceLanguage
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 DWARFSourceLanguage
source§
fn fmt(&self, f: &mut Formatter<'_>) -> Result
Formats the value using the given formatter. Read more
source§
impl From<LLVMDWARFSourceLanguage> for DWARFSourceLanguage
source§
fn from(src: LLVMDWARFSourceLanguage) -> Self
Converts to this type from the input type.
source§
impl Hash for DWARFSourceLanguage
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 Into<LLVMDWARFSourceLanguage> for DWARFSourceLanguage
source§
fn into(self) -> LLVMDWARFSourceLanguage
Converts this type into the (usually inferred) input type.
source§
impl Ord for DWARFSourceLanguage
source§
fn cmp(&self, other: &DWARFSourceLanguage) -> 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 Into<LLVMDWARFSourceLanguage> for DWARFSourceLanguage
source§
fn into(self) -> LLVMDWARFSourceLanguage
Converts this type into the (usually inferred) input type.
source§
impl Ord for DWARFSourceLanguage
source§
fn cmp(&self, other: &DWARFSourceLanguage) -> 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 DWARFSourceLanguage
source§
fn eq(&self, other: &DWARFSourceLanguage) -> 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 DWARFSourceLanguage

source§

fn eq(&self, other: &DWARFSourceLanguage) -> bool

This method tests for self and other values to be equal, and is used by ==.
1.0.0 · source§

fn ne(&self, other: &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 DWARFSourceLanguage

source§

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

source§

fn partial_cmp(&self, other: &DWARFSourceLanguage) -> Option<Ordering>

This method returns an ordering between self and other values if one exists. Read more
1.0.0 · source§

fn lt(&self, other: &Rhs) -> bool

This method tests less than (for self and other) and is used by the < operator. Read more
1.0.0 · source§

fn le(&self, other: &Rhs) -> bool

This method tests less than or equal to (for self and other) and is used by the <= operator. Read more
1.0.0 · source§

fn gt(&self, other: &Rhs) -> bool

This method tests greater than (for self and other) and is used by the > operator. Read more
1.0.0 · source§

fn ge(&self, other: &Rhs) -> bool

This method tests greater than or equal to (for self and other) and is used by the >= -operator. Read more
source§

impl Copy for DWARFSourceLanguage

source§

impl Eq for DWARFSourceLanguage

source§

impl StructuralPartialEq for DWARFSourceLanguage

Auto Trait Implementations§

Blanket Implementations§

source§

impl<T> Any for T
where +operator. Read more

source§

impl Copy for DWARFSourceLanguage

source§

impl Eq for DWARFSourceLanguage

source§

impl StructuralPartialEq for DWARFSourceLanguage

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/inkwell/debug_info/index.html b/inkwell/debug_info/index.html index 4c53d19f9..3c1aaefee 100644 --- a/inkwell/debug_info/index.html +++ b/inkwell/debug_info/index.html @@ -1,5 +1,5 @@ inkwell::debug_info - Rust
-

Module inkwell::debug_info

source ·
Expand description

Debug symbols - DebugInfoBuilder interface

+

Module inkwell::debug_info

source ·
Expand description

Debug symbols - DebugInfoBuilder interface

§Example usage

§Setting up the module for holding debug info:

ⓘ
let context = Context::create();
 let module = context.create_module("bin");
diff --git a/inkwell/debug_info/struct.DIBasicType.html b/inkwell/debug_info/struct.DIBasicType.html
index 6f4cdc18a..0bba3b02a 100644
--- a/inkwell/debug_info/struct.DIBasicType.html
+++ b/inkwell/debug_info/struct.DIBasicType.html
@@ -1,9 +1,9 @@
 DIBasicType in inkwell::debug_info - Rust

-    
Struct inkwell::debug_info::DIBasicType
source · 
pub struct DIBasicType<'ctx> { /* private fields */ }
Expand description
A primitive debug info type created by create_basic_type method of DebugInfoBuilder

-
Implementations§
source§
impl<'ctx> DIBasicType<'ctx>
source
pub fn as_type(&self) -> DIType<'ctx>
source
pub fn as_mut_ptr(&self) -> LLVMMetadataRef
Acquires the underlying raw pointer belonging to this DIBasicType type.

-
Trait Implementations§
source§
impl<'ctx> AsDIScope<'ctx> for DIBasicType<'ctx>
source§
fn as_debug_info_scope(self) -> DIScope<'ctx>
source§
impl<'ctx> Clone for DIBasicType<'ctx>
source§
fn clone(&self) -> DIBasicType<'ctx>
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<'ctx> Debug for DIBasicType<'ctx>
source§
fn fmt(&self, f: &mut Formatter<'_>) -> Result
Formats the value using the given formatter. Read more
source§
impl<'ctx> PartialEq for DIBasicType<'ctx>
source§
fn eq(&self, other: &DIBasicType<'ctx>) -> bool
This method tests for self and other values to be equal, and is used
+    
Struct inkwell::debug_info::DIBasicType
source · 
pub struct DIBasicType<'ctx> { /* private fields */ }
Expand description
A primitive debug info type created by create_basic_type method of DebugInfoBuilder

+
Implementations§
source§
impl<'ctx> DIBasicType<'ctx>
source
pub fn as_type(&self) -> DIType<'ctx>
source
pub fn as_mut_ptr(&self) -> LLVMMetadataRef
Acquires the underlying raw pointer belonging to this DIBasicType type.

+
Trait Implementations§
source§
impl<'ctx> AsDIScope<'ctx> for DIBasicType<'ctx>
source§
fn as_debug_info_scope(self) -> DIScope<'ctx>
source§
impl<'ctx> Clone for DIBasicType<'ctx>
source§
fn clone(&self) -> DIBasicType<'ctx>
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<'ctx> Debug for DIBasicType<'ctx>
source§
fn fmt(&self, f: &mut Formatter<'_>) -> Result
Formats the value using the given formatter. Read more
source§
impl<'ctx> PartialEq for DIBasicType<'ctx>
source§
fn eq(&self, other: &DIBasicType<'ctx>) -> bool
This method tests for self and other values to be equal, and is used
 by ==.
1.0.0 · source§
fn ne(&self, other: &Rhs) -> bool
This method tests for !=. The default implementation is almost always
-sufficient, and should not be overridden without very good reason.
source§
impl<'ctx> Copy for DIBasicType<'ctx>
source§
impl<'ctx> Eq for DIBasicType<'ctx>
source§
impl<'ctx> StructuralPartialEq for DIBasicType<'ctx>
Auto Trait Implementations§
§
impl<'ctx> Freeze for DIBasicType<'ctx>
§
impl<'ctx> RefUnwindSafe for DIBasicType<'ctx>
§
impl<'ctx> !Send for DIBasicType<'ctx>
§
impl<'ctx> !Sync for DIBasicType<'ctx>
§
impl<'ctx> Unpin for DIBasicType<'ctx>
§
impl<'ctx> UnwindSafe for DIBasicType<'ctx>
Blanket Implementations§
source§
impl<T> Any for T
where
+sufficient, and should not be overridden without very good reason.
source§
impl<'ctx> Copy for DIBasicType<'ctx>
source§
impl<'ctx> Eq for DIBasicType<'ctx>
source§
impl<'ctx> StructuralPartialEq for DIBasicType<'ctx>
Auto Trait Implementations§
§
impl<'ctx> Freeze for DIBasicType<'ctx>
§
impl<'ctx> RefUnwindSafe for DIBasicType<'ctx>
§
impl<'ctx> !Send for DIBasicType<'ctx>
§
impl<'ctx> !Sync for DIBasicType<'ctx>
§
impl<'ctx> Unpin for DIBasicType<'ctx>
§
impl<'ctx> UnwindSafe for DIBasicType<'ctx>
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/inkwell/debug_info/struct.DICompileUnit.html b/inkwell/debug_info/struct.DICompileUnit.html
index 9b3ada6b2..db4797a19 100644
--- a/inkwell/debug_info/struct.DICompileUnit.html
+++ b/inkwell/debug_info/struct.DICompileUnit.html
@@ -1,9 +1,9 @@
 DICompileUnit in inkwell::debug_info - Rust

-    
Struct inkwell::debug_info::DICompileUnit
source · 
pub struct DICompileUnit<'ctx> { /* private fields */ }
Expand description
Compilation unit scope for debug info

-
Implementations§
source§
impl<'ctx> DICompileUnit<'ctx>
source
pub fn get_file(&self) -> DIFile<'ctx>
source
pub fn as_mut_ptr(&self) -> LLVMMetadataRef
Acquires the underlying raw pointer belonging to this DICompileUnit type.

-
Trait Implementations§
source§
impl<'ctx> AsDIScope<'ctx> for DICompileUnit<'ctx>
source§
fn as_debug_info_scope(self) -> DIScope<'ctx>
source§
impl<'ctx> Clone for DICompileUnit<'ctx>
source§
fn clone(&self) -> DICompileUnit<'ctx>
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<'ctx> Debug for DICompileUnit<'ctx>
source§
fn fmt(&self, f: &mut Formatter<'_>) -> Result
Formats the value using the given formatter. Read more
source§
impl<'ctx> PartialEq for DICompileUnit<'ctx>
source§
fn eq(&self, other: &DICompileUnit<'ctx>) -> bool
This method tests for self and other values to be equal, and is used
+    
Struct inkwell::debug_info::DICompileUnit
source · 
pub struct DICompileUnit<'ctx> { /* private fields */ }
Expand description
Compilation unit scope for debug info

+
Implementations§
source§
impl<'ctx> DICompileUnit<'ctx>
source
pub fn get_file(&self) -> DIFile<'ctx>
source
pub fn as_mut_ptr(&self) -> LLVMMetadataRef
Acquires the underlying raw pointer belonging to this DICompileUnit type.

+
Trait Implementations§
source§
impl<'ctx> AsDIScope<'ctx> for DICompileUnit<'ctx>
source§
fn as_debug_info_scope(self) -> DIScope<'ctx>
source§
impl<'ctx> Clone for DICompileUnit<'ctx>
source§
fn clone(&self) -> DICompileUnit<'ctx>
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<'ctx> Debug for DICompileUnit<'ctx>
source§
fn fmt(&self, f: &mut Formatter<'_>) -> Result
Formats the value using the given formatter. Read more
source§
impl<'ctx> PartialEq for DICompileUnit<'ctx>
source§
fn eq(&self, other: &DICompileUnit<'ctx>) -> bool
This method tests for self and other values to be equal, and is used
 by ==.
1.0.0 · source§
fn ne(&self, other: &Rhs) -> bool
This method tests for !=. The default implementation is almost always
-sufficient, and should not be overridden without very good reason.
source§
impl<'ctx> Copy for DICompileUnit<'ctx>
source§
impl<'ctx> Eq for DICompileUnit<'ctx>
source§
impl<'ctx> StructuralPartialEq for DICompileUnit<'ctx>
Auto Trait Implementations§
§
impl<'ctx> Freeze for DICompileUnit<'ctx>
§
impl<'ctx> RefUnwindSafe for DICompileUnit<'ctx>
§
impl<'ctx> !Send for DICompileUnit<'ctx>
§
impl<'ctx> !Sync for DICompileUnit<'ctx>
§
impl<'ctx> Unpin for DICompileUnit<'ctx>
§
impl<'ctx> UnwindSafe for DICompileUnit<'ctx>
Blanket Implementations§
source§
impl<T> Any for T
where
+sufficient, and should not be overridden without very good reason.
source§
impl<'ctx> Copy for DICompileUnit<'ctx>
source§
impl<'ctx> Eq for DICompileUnit<'ctx>
source§
impl<'ctx> StructuralPartialEq for DICompileUnit<'ctx>
Auto Trait Implementations§
§
impl<'ctx> Freeze for DICompileUnit<'ctx>
§
impl<'ctx> RefUnwindSafe for DICompileUnit<'ctx>
§
impl<'ctx> !Send for DICompileUnit<'ctx>
§
impl<'ctx> !Sync for DICompileUnit<'ctx>
§
impl<'ctx> Unpin for DICompileUnit<'ctx>
§
impl<'ctx> UnwindSafe for DICompileUnit<'ctx>
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/inkwell/debug_info/struct.DICompositeType.html b/inkwell/debug_info/struct.DICompositeType.html
index d067de592..026512a28 100644
--- a/inkwell/debug_info/struct.DICompositeType.html
+++ b/inkwell/debug_info/struct.DICompositeType.html
@@ -1,9 +1,9 @@
 DICompositeType in inkwell::debug_info - Rust

-    
Struct inkwell::debug_info::DICompositeType
source · 
pub struct DICompositeType<'ctx> { /* private fields */ }
Expand description
A wrapper around an array of types, such as a union or struct.

-
Implementations§
source§
impl<'ctx> DICompositeType<'ctx>
source
pub fn as_type(&self) -> DIType<'ctx>
source
pub fn as_mut_ptr(&self) -> LLVMMetadataRef
Acquires the underlying raw pointer belonging to this DICompositeType type.

-
Trait Implementations§
source§
impl<'ctx> AsDIScope<'ctx> for DICompositeType<'ctx>
source§
fn as_debug_info_scope(self) -> DIScope<'ctx>
source§
impl<'ctx> Clone for DICompositeType<'ctx>
source§
fn clone(&self) -> DICompositeType<'ctx>
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<'ctx> Debug for DICompositeType<'ctx>
source§
fn fmt(&self, f: &mut Formatter<'_>) -> Result
Formats the value using the given formatter. Read more
source§
impl<'ctx> PartialEq for DICompositeType<'ctx>
source§
fn eq(&self, other: &DICompositeType<'ctx>) -> bool
This method tests for self and other values to be equal, and is used
+    
Struct inkwell::debug_info::DICompositeType
source · 
pub struct DICompositeType<'ctx> { /* private fields */ }
Expand description
A wrapper around an array of types, such as a union or struct.

+
Implementations§
source§
impl<'ctx> DICompositeType<'ctx>
source
pub fn as_type(&self) -> DIType<'ctx>
source
pub fn as_mut_ptr(&self) -> LLVMMetadataRef
Acquires the underlying raw pointer belonging to this DICompositeType type.

+
Trait Implementations§
source§
impl<'ctx> AsDIScope<'ctx> for DICompositeType<'ctx>
source§
fn as_debug_info_scope(self) -> DIScope<'ctx>
source§
impl<'ctx> Clone for DICompositeType<'ctx>
source§
fn clone(&self) -> DICompositeType<'ctx>
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<'ctx> Debug for DICompositeType<'ctx>
source§
fn fmt(&self, f: &mut Formatter<'_>) -> Result
Formats the value using the given formatter. Read more
source§
impl<'ctx> PartialEq for DICompositeType<'ctx>
source§
fn eq(&self, other: &DICompositeType<'ctx>) -> bool
This method tests for self and other values to be equal, and is used
 by ==.
1.0.0 · source§
fn ne(&self, other: &Rhs) -> bool
This method tests for !=. The default implementation is almost always
-sufficient, and should not be overridden without very good reason.
source§
impl<'ctx> Copy for DICompositeType<'ctx>
source§
impl<'ctx> Eq for DICompositeType<'ctx>
source§
impl<'ctx> StructuralPartialEq for DICompositeType<'ctx>
Auto Trait Implementations§
§
impl<'ctx> Freeze for DICompositeType<'ctx>
§
impl<'ctx> RefUnwindSafe for DICompositeType<'ctx>
§
impl<'ctx> !Send for DICompositeType<'ctx>
§
impl<'ctx> !Sync for DICompositeType<'ctx>
§
impl<'ctx> Unpin for DICompositeType<'ctx>
§
impl<'ctx> UnwindSafe for DICompositeType<'ctx>
Blanket Implementations§
source§
impl<T> Any for T
where
+sufficient, and should not be overridden without very good reason.
source§
impl<'ctx> Copy for DICompositeType<'ctx>
source§
impl<'ctx> Eq for DICompositeType<'ctx>
source§
impl<'ctx> StructuralPartialEq for DICompositeType<'ctx>
Auto Trait Implementations§
§
impl<'ctx> Freeze for DICompositeType<'ctx>
§
impl<'ctx> RefUnwindSafe for DICompositeType<'ctx>
§
impl<'ctx> !Send for DICompositeType<'ctx>
§
impl<'ctx> !Sync for DICompositeType<'ctx>
§
impl<'ctx> Unpin for DICompositeType<'ctx>
§
impl<'ctx> UnwindSafe for DICompositeType<'ctx>
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/inkwell/debug_info/struct.DIDerivedType.html b/inkwell/debug_info/struct.DIDerivedType.html
index c90ee6652..c91e547a3 100644
--- a/inkwell/debug_info/struct.DIDerivedType.html
+++ b/inkwell/debug_info/struct.DIDerivedType.html
@@ -1,8 +1,8 @@
 DIDerivedType in inkwell::debug_info - Rust

-    
Struct inkwell::debug_info::DIDerivedType
source · 
pub struct DIDerivedType<'ctx> { /* private fields */ }
Expand description
A wrapper around a single type, such as a typedef or member type.

-
Implementations§
source§
impl<'ctx> DIDerivedType<'ctx>
source
pub fn as_type(&self) -> DIType<'ctx>
source§
impl<'ctx> DIDerivedType<'ctx>
source
pub fn as_mut_ptr(&self) -> LLVMMetadataRef
Trait Implementations§
source§
impl<'ctx> AsDIScope<'ctx> for DIDerivedType<'ctx>
source§
fn as_debug_info_scope(self) -> DIScope<'ctx>
source§
impl<'ctx> Clone for DIDerivedType<'ctx>
source§
fn clone(&self) -> DIDerivedType<'ctx>
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<'ctx> Debug for DIDerivedType<'ctx>
source§
fn fmt(&self, f: &mut Formatter<'_>) -> Result
Formats the value using the given formatter. Read more
source§
impl<'ctx> PartialEq for DIDerivedType<'ctx>
source§
fn eq(&self, other: &DIDerivedType<'ctx>) -> bool
This method tests for self and other values to be equal, and is used
+    
Struct inkwell::debug_info::DIDerivedType
source · 
pub struct DIDerivedType<'ctx> { /* private fields */ }
Expand description
A wrapper around a single type, such as a typedef or member type.

+
Implementations§
source§
impl<'ctx> DIDerivedType<'ctx>
source
pub fn as_type(&self) -> DIType<'ctx>
source§
impl<'ctx> DIDerivedType<'ctx>
source
pub fn as_mut_ptr(&self) -> LLVMMetadataRef
Trait Implementations§
source§
impl<'ctx> AsDIScope<'ctx> for DIDerivedType<'ctx>
source§
fn as_debug_info_scope(self) -> DIScope<'ctx>
source§
impl<'ctx> Clone for DIDerivedType<'ctx>
source§
fn clone(&self) -> DIDerivedType<'ctx>
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<'ctx> Debug for DIDerivedType<'ctx>
source§
fn fmt(&self, f: &mut Formatter<'_>) -> Result
Formats the value using the given formatter. Read more
source§
impl<'ctx> PartialEq for DIDerivedType<'ctx>
source§
fn eq(&self, other: &DIDerivedType<'ctx>) -> bool
This method tests for self and other values to be equal, and is used
 by ==.
1.0.0 · source§
fn ne(&self, other: &Rhs) -> bool
This method tests for !=. The default implementation is almost always
-sufficient, and should not be overridden without very good reason.
source§
impl<'ctx> Copy for DIDerivedType<'ctx>
source§
impl<'ctx> Eq for DIDerivedType<'ctx>
source§
impl<'ctx> StructuralPartialEq for DIDerivedType<'ctx>
Auto Trait Implementations§
§
impl<'ctx> Freeze for DIDerivedType<'ctx>
§
impl<'ctx> RefUnwindSafe for DIDerivedType<'ctx>
§
impl<'ctx> !Send for DIDerivedType<'ctx>
§
impl<'ctx> !Sync for DIDerivedType<'ctx>
§
impl<'ctx> Unpin for DIDerivedType<'ctx>
§
impl<'ctx> UnwindSafe for DIDerivedType<'ctx>
Blanket Implementations§
source§
impl<T> Any for T
where
+sufficient, and should not be overridden without very good reason.
source§
impl<'ctx> Copy for DIDerivedType<'ctx>
source§
impl<'ctx> Eq for DIDerivedType<'ctx>
source§
impl<'ctx> StructuralPartialEq for DIDerivedType<'ctx>
Auto Trait Implementations§
§
impl<'ctx> Freeze for DIDerivedType<'ctx>
§
impl<'ctx> RefUnwindSafe for DIDerivedType<'ctx>
§
impl<'ctx> !Send for DIDerivedType<'ctx>
§
impl<'ctx> !Sync for DIDerivedType<'ctx>
§
impl<'ctx> Unpin for DIDerivedType<'ctx>
§
impl<'ctx> UnwindSafe for DIDerivedType<'ctx>
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/inkwell/debug_info/struct.DIExpression.html b/inkwell/debug_info/struct.DIExpression.html
index eb18e8618..cbc10c6ea 100644
--- a/inkwell/debug_info/struct.DIExpression.html
+++ b/inkwell/debug_info/struct.DIExpression.html
@@ -1,9 +1,9 @@
 DIExpression in inkwell::debug_info - Rust

-    
Struct inkwell::debug_info::DIExpression
source · 
pub struct DIExpression<'ctx> { /* private fields */ }
Expand description
https://llvm.org/docs/LangRef.html#diexpression

-
Implementations§
source§
impl<'ctx> DIExpression<'ctx>
source
pub fn as_mut_ptr(&self) -> LLVMMetadataRef
Acquires the underlying raw pointer belonging to this DIExpression type.

-
Trait Implementations§
source§
impl<'ctx> Clone for DIExpression<'ctx>
source§
fn clone(&self) -> DIExpression<'ctx>
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<'ctx> Debug for DIExpression<'ctx>
source§
fn fmt(&self, f: &mut Formatter<'_>) -> Result
Formats the value using the given formatter. Read more
source§
impl<'ctx> PartialEq for DIExpression<'ctx>
source§
fn eq(&self, other: &DIExpression<'ctx>) -> bool
This method tests for self and other values to be equal, and is used
+    
Struct inkwell::debug_info::DIExpression
source · 
pub struct DIExpression<'ctx> { /* private fields */ }
Expand description
https://llvm.org/docs/LangRef.html#diexpression

+
Implementations§
source§
impl<'ctx> DIExpression<'ctx>
source
pub fn as_mut_ptr(&self) -> LLVMMetadataRef
Acquires the underlying raw pointer belonging to this DIExpression type.

+
Trait Implementations§
source§
impl<'ctx> Clone for DIExpression<'ctx>
source§
fn clone(&self) -> DIExpression<'ctx>
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<'ctx> Debug for DIExpression<'ctx>
source§
fn fmt(&self, f: &mut Formatter<'_>) -> Result
Formats the value using the given formatter. Read more
source§
impl<'ctx> PartialEq for DIExpression<'ctx>
source§
fn eq(&self, other: &DIExpression<'ctx>) -> bool
This method tests for self and other values to be equal, and is used
 by ==.
1.0.0 · source§
fn ne(&self, other: &Rhs) -> bool
This method tests for !=. The default implementation is almost always
-sufficient, and should not be overridden without very good reason.
source§
impl<'ctx> Copy for DIExpression<'ctx>
source§
impl<'ctx> Eq for DIExpression<'ctx>
source§
impl<'ctx> StructuralPartialEq for DIExpression<'ctx>
Auto Trait Implementations§
§
impl<'ctx> Freeze for DIExpression<'ctx>
§
impl<'ctx> RefUnwindSafe for DIExpression<'ctx>
§
impl<'ctx> !Send for DIExpression<'ctx>
§
impl<'ctx> !Sync for DIExpression<'ctx>
§
impl<'ctx> Unpin for DIExpression<'ctx>
§
impl<'ctx> UnwindSafe for DIExpression<'ctx>
Blanket Implementations§
source§
impl<T> Any for T
where
+sufficient, and should not be overridden without very good reason.
source§
impl<'ctx> Copy for DIExpression<'ctx>
source§
impl<'ctx> Eq for DIExpression<'ctx>
source§
impl<'ctx> StructuralPartialEq for DIExpression<'ctx>
Auto Trait Implementations§
§
impl<'ctx> Freeze for DIExpression<'ctx>
§
impl<'ctx> RefUnwindSafe for DIExpression<'ctx>
§
impl<'ctx> !Send for DIExpression<'ctx>
§
impl<'ctx> !Sync for DIExpression<'ctx>
§
impl<'ctx> Unpin for DIExpression<'ctx>
§
impl<'ctx> UnwindSafe for DIExpression<'ctx>
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/inkwell/debug_info/struct.DIFile.html b/inkwell/debug_info/struct.DIFile.html
index 1caf2307e..52359dc97 100644
--- a/inkwell/debug_info/struct.DIFile.html
+++ b/inkwell/debug_info/struct.DIFile.html
@@ -1,9 +1,9 @@
 DIFile in inkwell::debug_info - Rust

-    
Struct inkwell::debug_info::DIFile
source · 
pub struct DIFile<'ctx> { /* private fields */ }
Expand description
Source file scope for debug info

-
Implementations§
source§
impl<'ctx> DIFile<'ctx>
source
pub fn as_mut_ptr(&self) -> LLVMMetadataRef
Acquires the underlying raw pointer belonging to this DIFile type.

-
Trait Implementations§
source§
impl<'ctx> AsDIScope<'ctx> for DIFile<'ctx>
source§
fn as_debug_info_scope(self) -> DIScope<'ctx>
source§
impl<'ctx> Clone for DIFile<'ctx>
source§
fn clone(&self) -> DIFile<'ctx>
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<'ctx> Debug for DIFile<'ctx>
source§
fn fmt(&self, f: &mut Formatter<'_>) -> Result
Formats the value using the given formatter. Read more
source§
impl<'ctx> PartialEq for DIFile<'ctx>
source§
fn eq(&self, other: &DIFile<'ctx>) -> bool
This method tests for self and other values to be equal, and is used
+    
Struct inkwell::debug_info::DIFile
source · 
pub struct DIFile<'ctx> { /* private fields */ }
Expand description
Source file scope for debug info

+
Implementations§
source§
impl<'ctx> DIFile<'ctx>
source
pub fn as_mut_ptr(&self) -> LLVMMetadataRef
Acquires the underlying raw pointer belonging to this DIFile type.

+
Trait Implementations§
source§
impl<'ctx> AsDIScope<'ctx> for DIFile<'ctx>
source§
fn as_debug_info_scope(self) -> DIScope<'ctx>
source§
impl<'ctx> Clone for DIFile<'ctx>
source§
fn clone(&self) -> DIFile<'ctx>
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<'ctx> Debug for DIFile<'ctx>
source§
fn fmt(&self, f: &mut Formatter<'_>) -> Result
Formats the value using the given formatter. Read more
source§
impl<'ctx> PartialEq for DIFile<'ctx>
source§
fn eq(&self, other: &DIFile<'ctx>) -> bool
This method tests for self and other values to be equal, and is used
 by ==.
1.0.0 · source§
fn ne(&self, other: &Rhs) -> bool
This method tests for !=. The default implementation is almost always
-sufficient, and should not be overridden without very good reason.
source§
impl<'ctx> Copy for DIFile<'ctx>
source§
impl<'ctx> Eq for DIFile<'ctx>
source§
impl<'ctx> StructuralPartialEq for DIFile<'ctx>
Auto Trait Implementations§
§
impl<'ctx> Freeze for DIFile<'ctx>
§
impl<'ctx> RefUnwindSafe for DIFile<'ctx>
§
impl<'ctx> !Send for DIFile<'ctx>
§
impl<'ctx> !Sync for DIFile<'ctx>
§
impl<'ctx> Unpin for DIFile<'ctx>
§
impl<'ctx> UnwindSafe for DIFile<'ctx>
Blanket Implementations§
source§
impl<T> Any for T
where
+sufficient, and should not be overridden without very good reason.
source§
impl<'ctx> Copy for DIFile<'ctx>
source§
impl<'ctx> Eq for DIFile<'ctx>
source§
impl<'ctx> StructuralPartialEq for DIFile<'ctx>
Auto Trait Implementations§
§
impl<'ctx> Freeze for DIFile<'ctx>
§
impl<'ctx> RefUnwindSafe for DIFile<'ctx>
§
impl<'ctx> !Send for DIFile<'ctx>
§
impl<'ctx> !Sync for DIFile<'ctx>
§
impl<'ctx> Unpin for DIFile<'ctx>
§
impl<'ctx> UnwindSafe for DIFile<'ctx>
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/inkwell/debug_info/struct.DIGlobalVariableExpression.html b/inkwell/debug_info/struct.DIGlobalVariableExpression.html
index 8ee31d130..f45bf1a9d 100644
--- a/inkwell/debug_info/struct.DIGlobalVariableExpression.html
+++ b/inkwell/debug_info/struct.DIGlobalVariableExpression.html
@@ -1,11 +1,11 @@
 DIGlobalVariableExpression in inkwell::debug_info - Rust

-    
Struct inkwell::debug_info::DIGlobalVariableExpression
source · 
pub struct DIGlobalVariableExpression<'ctx> { /* private fields */ }
Implementations§
source§
impl<'ctx> DIGlobalVariableExpression<'ctx>
source
pub fn as_metadata_value(
+    
Struct inkwell::debug_info::DIGlobalVariableExpression
source · 
pub struct DIGlobalVariableExpression<'ctx> { /* private fields */ }
Implementations§
source§
impl<'ctx> DIGlobalVariableExpression<'ctx>
source
pub fn as_metadata_value(
     &self,
     context: impl AsContextRef<'ctx>
-) -> MetadataValue<'ctx>
source
pub fn as_mut_ptr(&self) -> LLVMMetadataRef
Acquires the underlying raw pointer belonging to this DIGlobalVariableExpression type.

-
Trait Implementations§
source§
impl<'ctx> Clone for DIGlobalVariableExpression<'ctx>
source§
fn clone(&self) -> DIGlobalVariableExpression<'ctx>
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<'ctx> Debug for DIGlobalVariableExpression<'ctx>
source§
fn fmt(&self, f: &mut Formatter<'_>) -> Result
Formats the value using the given formatter. Read more
source§
impl<'ctx> PartialEq for DIGlobalVariableExpression<'ctx>
source§
fn eq(&self, other: &DIGlobalVariableExpression<'ctx>) -> bool
This method tests for self and other values to be equal, and is used
+) -> MetadataValue<'ctx>
source
pub fn as_mut_ptr(&self) -> LLVMMetadataRef
Acquires the underlying raw pointer belonging to this DIGlobalVariableExpression type.

+
Trait Implementations§
source§
impl<'ctx> Clone for DIGlobalVariableExpression<'ctx>
source§
fn clone(&self) -> DIGlobalVariableExpression<'ctx>
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<'ctx> Debug for DIGlobalVariableExpression<'ctx>
source§
fn fmt(&self, f: &mut Formatter<'_>) -> Result
Formats the value using the given formatter. Read more
source§
impl<'ctx> PartialEq for DIGlobalVariableExpression<'ctx>
source§
fn eq(&self, other: &DIGlobalVariableExpression<'ctx>) -> bool
This method tests for self and other values to be equal, and is used
 by ==.
1.0.0 · source§
fn ne(&self, other: &Rhs) -> bool
This method tests for !=. The default implementation is almost always
-sufficient, and should not be overridden without very good reason.
source§
impl<'ctx> Copy for DIGlobalVariableExpression<'ctx>
source§
impl<'ctx> Eq for DIGlobalVariableExpression<'ctx>
source§
impl<'ctx> StructuralPartialEq for DIGlobalVariableExpression<'ctx>
Auto Trait Implementations§
Blanket Implementations§
source§
impl<T> Any for T
where
+sufficient, and should not be overridden without very good reason.
source§
impl<'ctx> Copy for DIGlobalVariableExpression<'ctx>
source§
impl<'ctx> Eq for DIGlobalVariableExpression<'ctx>
source§
impl<'ctx> StructuralPartialEq for DIGlobalVariableExpression<'ctx>
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/inkwell/debug_info/struct.DILexicalBlock.html b/inkwell/debug_info/struct.DILexicalBlock.html
index 608bfe5d7..ffda01528 100644
--- a/inkwell/debug_info/struct.DILexicalBlock.html
+++ b/inkwell/debug_info/struct.DILexicalBlock.html
@@ -1,9 +1,9 @@
 DILexicalBlock in inkwell::debug_info - Rust

-    
Struct inkwell::debug_info::DILexicalBlock
source · 
pub struct DILexicalBlock<'ctx> { /* private fields */ }
Expand description
Lexical block scope for debug info

-
Implementations§
source§
impl<'ctx> DILexicalBlock<'ctx>
source
pub fn as_mut_ptr(&self) -> LLVMMetadataRef
Acquires the underlying raw pointer belonging to this DILexicalBlock type.

-
Trait Implementations§
source§
impl<'ctx> AsDIScope<'ctx> for DILexicalBlock<'ctx>
source§
fn as_debug_info_scope(self) -> DIScope<'ctx>
source§
impl<'ctx> Clone for DILexicalBlock<'ctx>
source§
fn clone(&self) -> DILexicalBlock<'ctx>
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<'ctx> Debug for DILexicalBlock<'ctx>
source§
fn fmt(&self, f: &mut Formatter<'_>) -> Result
Formats the value using the given formatter. Read more
source§
impl<'ctx> PartialEq for DILexicalBlock<'ctx>
source§
fn eq(&self, other: &DILexicalBlock<'ctx>) -> bool
This method tests for self and other values to be equal, and is used
+    
Struct inkwell::debug_info::DILexicalBlock
source · 
pub struct DILexicalBlock<'ctx> { /* private fields */ }
Expand description
Lexical block scope for debug info

+
Implementations§
source§
impl<'ctx> DILexicalBlock<'ctx>
source
pub fn as_mut_ptr(&self) -> LLVMMetadataRef
Acquires the underlying raw pointer belonging to this DILexicalBlock type.

+
Trait Implementations§
source§
impl<'ctx> AsDIScope<'ctx> for DILexicalBlock<'ctx>
source§
fn as_debug_info_scope(self) -> DIScope<'ctx>
source§
impl<'ctx> Clone for DILexicalBlock<'ctx>
source§
fn clone(&self) -> DILexicalBlock<'ctx>
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<'ctx> Debug for DILexicalBlock<'ctx>
source§
fn fmt(&self, f: &mut Formatter<'_>) -> Result
Formats the value using the given formatter. Read more
source§
impl<'ctx> PartialEq for DILexicalBlock<'ctx>
source§
fn eq(&self, other: &DILexicalBlock<'ctx>) -> bool
This method tests for self and other values to be equal, and is used
 by ==.
1.0.0 · source§
fn ne(&self, other: &Rhs) -> bool
This method tests for !=. The default implementation is almost always
-sufficient, and should not be overridden without very good reason.
source§
impl<'ctx> Copy for DILexicalBlock<'ctx>
source§
impl<'ctx> Eq for DILexicalBlock<'ctx>
source§
impl<'ctx> StructuralPartialEq for DILexicalBlock<'ctx>
Auto Trait Implementations§
§
impl<'ctx> Freeze for DILexicalBlock<'ctx>
§
impl<'ctx> RefUnwindSafe for DILexicalBlock<'ctx>
§
impl<'ctx> !Send for DILexicalBlock<'ctx>
§
impl<'ctx> !Sync for DILexicalBlock<'ctx>
§
impl<'ctx> Unpin for DILexicalBlock<'ctx>
§
impl<'ctx> UnwindSafe for DILexicalBlock<'ctx>
Blanket Implementations§
source§
impl<T> Any for T
where
+sufficient, and should not be overridden without very good reason.
source§
impl<'ctx> Copy for DILexicalBlock<'ctx>
source§
impl<'ctx> Eq for DILexicalBlock<'ctx>
source§
impl<'ctx> StructuralPartialEq for DILexicalBlock<'ctx>
Auto Trait Implementations§
§
impl<'ctx> Freeze for DILexicalBlock<'ctx>
§
impl<'ctx> RefUnwindSafe for DILexicalBlock<'ctx>
§
impl<'ctx> !Send for DILexicalBlock<'ctx>
§
impl<'ctx> !Sync for DILexicalBlock<'ctx>
§
impl<'ctx> Unpin for DILexicalBlock<'ctx>
§
impl<'ctx> UnwindSafe for DILexicalBlock<'ctx>
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/inkwell/debug_info/struct.DILocalVariable.html b/inkwell/debug_info/struct.DILocalVariable.html
index dd8616524..c9cabe915 100644
--- a/inkwell/debug_info/struct.DILocalVariable.html
+++ b/inkwell/debug_info/struct.DILocalVariable.html
@@ -1,9 +1,9 @@
 DILocalVariable in inkwell::debug_info - Rust

-    
Struct inkwell::debug_info::DILocalVariable
source · 
pub struct DILocalVariable<'ctx> { /* private fields */ }
Expand description
Metadata representing a variable inside a scope

-
Implementations§
source§
impl<'ctx> DILocalVariable<'ctx>
source
pub fn as_mut_ptr(&self) -> LLVMMetadataRef
Acquires the underlying raw pointer belonging to this DILocalVariable type.

-
Trait Implementations§
source§
impl<'ctx> Clone for DILocalVariable<'ctx>
source§
fn clone(&self) -> DILocalVariable<'ctx>
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<'ctx> Debug for DILocalVariable<'ctx>
source§
fn fmt(&self, f: &mut Formatter<'_>) -> Result
Formats the value using the given formatter. Read more
source§
impl<'ctx> PartialEq for DILocalVariable<'ctx>
source§
fn eq(&self, other: &DILocalVariable<'ctx>) -> bool
This method tests for self and other values to be equal, and is used
+    
Struct inkwell::debug_info::DILocalVariable
source · 
pub struct DILocalVariable<'ctx> { /* private fields */ }
Expand description
Metadata representing a variable inside a scope

+
Implementations§
source§
impl<'ctx> DILocalVariable<'ctx>
source
pub fn as_mut_ptr(&self) -> LLVMMetadataRef
Acquires the underlying raw pointer belonging to this DILocalVariable type.

+
Trait Implementations§
source§
impl<'ctx> Clone for DILocalVariable<'ctx>
source§
fn clone(&self) -> DILocalVariable<'ctx>
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<'ctx> Debug for DILocalVariable<'ctx>
source§
fn fmt(&self, f: &mut Formatter<'_>) -> Result
Formats the value using the given formatter. Read more
source§
impl<'ctx> PartialEq for DILocalVariable<'ctx>
source§
fn eq(&self, other: &DILocalVariable<'ctx>) -> bool
This method tests for self and other values to be equal, and is used
 by ==.
1.0.0 · source§
fn ne(&self, other: &Rhs) -> bool
This method tests for !=. The default implementation is almost always
-sufficient, and should not be overridden without very good reason.
source§
impl<'ctx> Copy for DILocalVariable<'ctx>
source§
impl<'ctx> Eq for DILocalVariable<'ctx>
source§
impl<'ctx> StructuralPartialEq for DILocalVariable<'ctx>
Auto Trait Implementations§
§
impl<'ctx> Freeze for DILocalVariable<'ctx>
§
impl<'ctx> RefUnwindSafe for DILocalVariable<'ctx>
§
impl<'ctx> !Send for DILocalVariable<'ctx>
§
impl<'ctx> !Sync for DILocalVariable<'ctx>
§
impl<'ctx> Unpin for DILocalVariable<'ctx>
§
impl<'ctx> UnwindSafe for DILocalVariable<'ctx>
Blanket Implementations§
source§
impl<T> Any for T
where
+sufficient, and should not be overridden without very good reason.
source§
impl<'ctx> Copy for DILocalVariable<'ctx>
source§
impl<'ctx> Eq for DILocalVariable<'ctx>
source§
impl<'ctx> StructuralPartialEq for DILocalVariable<'ctx>
Auto Trait Implementations§
§
impl<'ctx> Freeze for DILocalVariable<'ctx>
§
impl<'ctx> RefUnwindSafe for DILocalVariable<'ctx>
§
impl<'ctx> !Send for DILocalVariable<'ctx>
§
impl<'ctx> !Sync for DILocalVariable<'ctx>
§
impl<'ctx> Unpin for DILocalVariable<'ctx>
§
impl<'ctx> UnwindSafe for DILocalVariable<'ctx>
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/inkwell/debug_info/struct.DILocation.html b/inkwell/debug_info/struct.DILocation.html
index a403f8128..bbbd3ff98 100644
--- a/inkwell/debug_info/struct.DILocation.html
+++ b/inkwell/debug_info/struct.DILocation.html
@@ -1,5 +1,5 @@
 DILocation in inkwell::debug_info - Rust

-    
Struct inkwell::debug_info::DILocation
source · 
pub struct DILocation<'ctx> { /* private fields */ }
Expand description
A debug location within the source code. Contains the following information:

+    
Struct inkwell::debug_info::DILocation
source · 
pub struct DILocation<'ctx> { /* private fields */ }
Expand description
A debug location within the source code. Contains the following information:

 
    
 
  • line, column
    • 
 
  • scope
    • 
@@ -7,10 +7,10 @@
 

 
Created by create_debug_location of DebugInfoBuilder and consumed by
 set_current_debug_location of Builder.

-
Implementations§
source§
impl<'ctx> DILocation<'ctx>
source
pub fn get_line(&self) -> u32
source
pub fn get_column(&self) -> u32
source
pub fn get_scope(&self) -> DIScope<'ctx>
source
pub fn as_mut_ptr(&self) -> LLVMMetadataRef
Acquires the underlying raw pointer belonging to this DILocation type.

-
Trait Implementations§
source§
impl<'ctx> Clone for DILocation<'ctx>
source§
fn clone(&self) -> DILocation<'ctx>
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<'ctx> Debug for DILocation<'ctx>
source§
fn fmt(&self, f: &mut Formatter<'_>) -> Result
Formats the value using the given formatter. Read more
source§
impl<'ctx> PartialEq for DILocation<'ctx>
source§
fn eq(&self, other: &DILocation<'ctx>) -> bool
This method tests for self and other values to be equal, and is used
+
Implementations§
source§
impl<'ctx> DILocation<'ctx>
source
pub fn get_line(&self) -> u32
source
pub fn get_column(&self) -> u32
source
pub fn get_scope(&self) -> DIScope<'ctx>
source
pub fn as_mut_ptr(&self) -> LLVMMetadataRef
Acquires the underlying raw pointer belonging to this DILocation type.

+
Trait Implementations§
source§
impl<'ctx> Clone for DILocation<'ctx>
source§
fn clone(&self) -> DILocation<'ctx>
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<'ctx> Debug for DILocation<'ctx>
source§
fn fmt(&self, f: &mut Formatter<'_>) -> Result
Formats the value using the given formatter. Read more
source§
impl<'ctx> PartialEq for DILocation<'ctx>
source§
fn eq(&self, other: &DILocation<'ctx>) -> bool
This method tests for self and other values to be equal, and is used
 by ==.
1.0.0 · source§
fn ne(&self, other: &Rhs) -> bool
This method tests for !=. The default implementation is almost always
-sufficient, and should not be overridden without very good reason.
source§
impl<'ctx> Copy for DILocation<'ctx>
source§
impl<'ctx> Eq for DILocation<'ctx>
source§
impl<'ctx> StructuralPartialEq for DILocation<'ctx>
Auto Trait Implementations§
§
impl<'ctx> Freeze for DILocation<'ctx>
§
impl<'ctx> RefUnwindSafe for DILocation<'ctx>
§
impl<'ctx> !Send for DILocation<'ctx>
§
impl<'ctx> !Sync for DILocation<'ctx>
§
impl<'ctx> Unpin for DILocation<'ctx>
§
impl<'ctx> UnwindSafe for DILocation<'ctx>
Blanket Implementations§
source§
impl<T> Any for T
where
+sufficient, and should not be overridden without very good reason.
source§
impl<'ctx> Copy for DILocation<'ctx>
source§
impl<'ctx> Eq for DILocation<'ctx>
source§
impl<'ctx> StructuralPartialEq for DILocation<'ctx>
Auto Trait Implementations§
§
impl<'ctx> Freeze for DILocation<'ctx>
§
impl<'ctx> RefUnwindSafe for DILocation<'ctx>
§
impl<'ctx> !Send for DILocation<'ctx>
§
impl<'ctx> !Sync for DILocation<'ctx>
§
impl<'ctx> Unpin for DILocation<'ctx>
§
impl<'ctx> UnwindSafe for DILocation<'ctx>
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/inkwell/debug_info/struct.DINamespace.html b/inkwell/debug_info/struct.DINamespace.html
index 03b3fcdb4..1559acb2b 100644
--- a/inkwell/debug_info/struct.DINamespace.html
+++ b/inkwell/debug_info/struct.DINamespace.html
@@ -1,9 +1,9 @@
 DINamespace in inkwell::debug_info - Rust

-    
Struct inkwell::debug_info::DINamespace
source · 
pub struct DINamespace<'ctx> { /* private fields */ }
Expand description
Namespace scope for debug info

-
Implementations§
source§
impl<'ctx> DINamespace<'ctx>
source
pub fn as_mut_ptr(&self) -> LLVMMetadataRef
Acquires the underlying raw pointer belonging to this DINamespace type.

-
Trait Implementations§
source§
impl<'ctx> AsDIScope<'ctx> for DINamespace<'ctx>
source§
fn as_debug_info_scope(self) -> DIScope<'ctx>
source§
impl<'ctx> Clone for DINamespace<'ctx>
source§
fn clone(&self) -> DINamespace<'ctx>
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<'ctx> Debug for DINamespace<'ctx>
source§
fn fmt(&self, f: &mut Formatter<'_>) -> Result
Formats the value using the given formatter. Read more
source§
impl<'ctx> PartialEq for DINamespace<'ctx>
source§
fn eq(&self, other: &DINamespace<'ctx>) -> bool
This method tests for self and other values to be equal, and is used
+    
Struct inkwell::debug_info::DINamespace
source · 
pub struct DINamespace<'ctx> { /* private fields */ }
Expand description
Namespace scope for debug info

+
Implementations§
source§
impl<'ctx> DINamespace<'ctx>
source
pub fn as_mut_ptr(&self) -> LLVMMetadataRef
Acquires the underlying raw pointer belonging to this DINamespace type.

+
Trait Implementations§
source§
impl<'ctx> AsDIScope<'ctx> for DINamespace<'ctx>
source§
fn as_debug_info_scope(self) -> DIScope<'ctx>
source§
impl<'ctx> Clone for DINamespace<'ctx>
source§
fn clone(&self) -> DINamespace<'ctx>
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<'ctx> Debug for DINamespace<'ctx>
source§
fn fmt(&self, f: &mut Formatter<'_>) -> Result
Formats the value using the given formatter. Read more
source§
impl<'ctx> PartialEq for DINamespace<'ctx>
source§
fn eq(&self, other: &DINamespace<'ctx>) -> bool
This method tests for self and other values to be equal, and is used
 by ==.
1.0.0 · source§
fn ne(&self, other: &Rhs) -> bool
This method tests for !=. The default implementation is almost always
-sufficient, and should not be overridden without very good reason.
source§
impl<'ctx> Copy for DINamespace<'ctx>
source§
impl<'ctx> Eq for DINamespace<'ctx>
source§
impl<'ctx> StructuralPartialEq for DINamespace<'ctx>
Auto Trait Implementations§
§
impl<'ctx> Freeze for DINamespace<'ctx>
§
impl<'ctx> RefUnwindSafe for DINamespace<'ctx>
§
impl<'ctx> !Send for DINamespace<'ctx>
§
impl<'ctx> !Sync for DINamespace<'ctx>
§
impl<'ctx> Unpin for DINamespace<'ctx>
§
impl<'ctx> UnwindSafe for DINamespace<'ctx>
Blanket Implementations§
source§
impl<T> Any for T
where
+sufficient, and should not be overridden without very good reason.
source§
impl<'ctx> Copy for DINamespace<'ctx>
source§
impl<'ctx> Eq for DINamespace<'ctx>
source§
impl<'ctx> StructuralPartialEq for DINamespace<'ctx>
Auto Trait Implementations§
§
impl<'ctx> Freeze for DINamespace<'ctx>
§
impl<'ctx> RefUnwindSafe for DINamespace<'ctx>
§
impl<'ctx> !Send for DINamespace<'ctx>
§
impl<'ctx> !Sync for DINamespace<'ctx>
§
impl<'ctx> Unpin for DINamespace<'ctx>
§
impl<'ctx> UnwindSafe for DINamespace<'ctx>
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/inkwell/debug_info/struct.DISubprogram.html b/inkwell/debug_info/struct.DISubprogram.html
index af6780cac..449fd96ef 100644
--- a/inkwell/debug_info/struct.DISubprogram.html
+++ b/inkwell/debug_info/struct.DISubprogram.html
@@ -1,9 +1,9 @@
 DISubprogram in inkwell::debug_info - Rust

-    
Struct inkwell::debug_info::DISubprogram
source · 
pub struct DISubprogram<'ctx> { /* private fields */ }
Expand description
Function body scope for debug info

-
Implementations§
source§
impl<'ctx> DISubprogram<'ctx>
source
pub fn as_mut_ptr(&self) -> LLVMMetadataRef
Acquires the underlying raw pointer belonging to this DISubprogram type.

-
Trait Implementations§
source§
impl<'ctx> AsDIScope<'ctx> for DISubprogram<'ctx>
source§
fn as_debug_info_scope(self) -> DIScope<'ctx>
source§
impl<'ctx> Clone for DISubprogram<'ctx>
source§
fn clone(&self) -> DISubprogram<'ctx>
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<'ctx> Debug for DISubprogram<'ctx>
source§
fn fmt(&self, f: &mut Formatter<'_>) -> Result
Formats the value using the given formatter. Read more
source§
impl<'ctx> PartialEq for DISubprogram<'ctx>
source§
fn eq(&self, other: &DISubprogram<'ctx>) -> bool
This method tests for self and other values to be equal, and is used
+    
Struct inkwell::debug_info::DISubprogram
source · 
pub struct DISubprogram<'ctx> { /* private fields */ }
Expand description
Function body scope for debug info

+
Implementations§
source§
impl<'ctx> DISubprogram<'ctx>
source
pub fn as_mut_ptr(&self) -> LLVMMetadataRef
Acquires the underlying raw pointer belonging to this DISubprogram type.

+
Trait Implementations§
source§
impl<'ctx> AsDIScope<'ctx> for DISubprogram<'ctx>
source§
fn as_debug_info_scope(self) -> DIScope<'ctx>
source§
impl<'ctx> Clone for DISubprogram<'ctx>
source§
fn clone(&self) -> DISubprogram<'ctx>
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<'ctx> Debug for DISubprogram<'ctx>
source§
fn fmt(&self, f: &mut Formatter<'_>) -> Result
Formats the value using the given formatter. Read more
source§
impl<'ctx> PartialEq for DISubprogram<'ctx>
source§
fn eq(&self, other: &DISubprogram<'ctx>) -> bool
This method tests for self and other values to be equal, and is used
 by ==.
1.0.0 · source§
fn ne(&self, other: &Rhs) -> bool
This method tests for !=. The default implementation is almost always
-sufficient, and should not be overridden without very good reason.
source§
impl<'ctx> Copy for DISubprogram<'ctx>
source§
impl<'ctx> Eq for DISubprogram<'ctx>
source§
impl<'ctx> StructuralPartialEq for DISubprogram<'ctx>
Auto Trait Implementations§
§
impl<'ctx> Freeze for DISubprogram<'ctx>
§
impl<'ctx> RefUnwindSafe for DISubprogram<'ctx>
§
impl<'ctx> !Send for DISubprogram<'ctx>
§
impl<'ctx> !Sync for DISubprogram<'ctx>
§
impl<'ctx> Unpin for DISubprogram<'ctx>
§
impl<'ctx> UnwindSafe for DISubprogram<'ctx>
Blanket Implementations§
source§
impl<T> Any for T
where
+sufficient, and should not be overridden without very good reason.
source§
impl<'ctx> Copy for DISubprogram<'ctx>
source§
impl<'ctx> Eq for DISubprogram<'ctx>
source§
impl<'ctx> StructuralPartialEq for DISubprogram<'ctx>
Auto Trait Implementations§
§
impl<'ctx> Freeze for DISubprogram<'ctx>
§
impl<'ctx> RefUnwindSafe for DISubprogram<'ctx>
§
impl<'ctx> !Send for DISubprogram<'ctx>
§
impl<'ctx> !Sync for DISubprogram<'ctx>
§
impl<'ctx> Unpin for DISubprogram<'ctx>
§
impl<'ctx> UnwindSafe for DISubprogram<'ctx>
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/inkwell/debug_info/struct.DISubroutineType.html b/inkwell/debug_info/struct.DISubroutineType.html
index d17825170..f5b446f50 100644
--- a/inkwell/debug_info/struct.DISubroutineType.html
+++ b/inkwell/debug_info/struct.DISubroutineType.html
@@ -1,8 +1,8 @@
 DISubroutineType in inkwell::debug_info - Rust

-    
Struct inkwell::debug_info::DISubroutineType
source · 
pub struct DISubroutineType<'ctx> { /* private fields */ }
Expand description
Metadata representing the type of a function

-
Trait Implementations§
source§
impl<'ctx> Clone for DISubroutineType<'ctx>
source§
fn clone(&self) -> DISubroutineType<'ctx>
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<'ctx> Debug for DISubroutineType<'ctx>
source§
fn fmt(&self, f: &mut Formatter<'_>) -> Result
Formats the value using the given formatter. Read more
source§
impl<'ctx> PartialEq for DISubroutineType<'ctx>
source§
fn eq(&self, other: &DISubroutineType<'ctx>) -> bool
This method tests for self and other values to be equal, and is used
+    
Struct inkwell::debug_info::DISubroutineType
source · 
pub struct DISubroutineType<'ctx> { /* private fields */ }
Expand description
Metadata representing the type of a function

+
Trait Implementations§
source§
impl<'ctx> Clone for DISubroutineType<'ctx>
source§
fn clone(&self) -> DISubroutineType<'ctx>
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<'ctx> Debug for DISubroutineType<'ctx>
source§
fn fmt(&self, f: &mut Formatter<'_>) -> Result
Formats the value using the given formatter. Read more
source§
impl<'ctx> PartialEq for DISubroutineType<'ctx>
source§
fn eq(&self, other: &DISubroutineType<'ctx>) -> bool
This method tests for self and other values to be equal, and is used
 by ==.
1.0.0 · source§
fn ne(&self, other: &Rhs) -> bool
This method tests for !=. The default implementation is almost always
-sufficient, and should not be overridden without very good reason.
source§
impl<'ctx> Copy for DISubroutineType<'ctx>
source§
impl<'ctx> Eq for DISubroutineType<'ctx>
source§
impl<'ctx> StructuralPartialEq for DISubroutineType<'ctx>
Auto Trait Implementations§
§
impl<'ctx> Freeze for DISubroutineType<'ctx>
§
impl<'ctx> RefUnwindSafe for DISubroutineType<'ctx>
§
impl<'ctx> !Send for DISubroutineType<'ctx>
§
impl<'ctx> !Sync for DISubroutineType<'ctx>
§
impl<'ctx> Unpin for DISubroutineType<'ctx>
§
impl<'ctx> UnwindSafe for DISubroutineType<'ctx>
Blanket Implementations§
source§
impl<T> Any for T
where
+sufficient, and should not be overridden without very good reason.
source§
impl<'ctx> Copy for DISubroutineType<'ctx>
source§
impl<'ctx> Eq for DISubroutineType<'ctx>
source§
impl<'ctx> StructuralPartialEq for DISubroutineType<'ctx>
Auto Trait Implementations§
§
impl<'ctx> Freeze for DISubroutineType<'ctx>
§
impl<'ctx> RefUnwindSafe for DISubroutineType<'ctx>
§
impl<'ctx> !Send for DISubroutineType<'ctx>
§
impl<'ctx> !Sync for DISubroutineType<'ctx>
§
impl<'ctx> Unpin for DISubroutineType<'ctx>
§
impl<'ctx> UnwindSafe for DISubroutineType<'ctx>
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/inkwell/debug_info/struct.DIType.html b/inkwell/debug_info/struct.DIType.html
index 01c7f7a15..9ee9a39ca 100644
--- a/inkwell/debug_info/struct.DIType.html
+++ b/inkwell/debug_info/struct.DIType.html
@@ -1,9 +1,9 @@
 DIType in inkwell::debug_info - Rust

-    
Struct inkwell::debug_info::DIType
source · 
pub struct DIType<'ctx> { /* private fields */ }
Expand description
Any kind of debug info type

-
Implementations§
source§
impl<'ctx> DIType<'ctx>
source
pub fn get_size_in_bits(&self) -> u64
source
pub fn get_align_in_bits(&self) -> u32
source
pub fn get_offset_in_bits(&self) -> u64
source
pub fn as_mut_ptr(&self) -> LLVMMetadataRef
Acquires the underlying raw pointer belonging to this DIType type.

-
Trait Implementations§
source§
impl<'ctx> AsDIScope<'ctx> for DIType<'ctx>
source§
fn as_debug_info_scope(self) -> DIScope<'ctx>
source§
impl<'ctx> Clone for DIType<'ctx>
source§
fn clone(&self) -> DIType<'ctx>
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<'ctx> Debug for DIType<'ctx>
source§
fn fmt(&self, f: &mut Formatter<'_>) -> Result
Formats the value using the given formatter. Read more
source§
impl<'ctx> PartialEq for DIType<'ctx>
source§
fn eq(&self, other: &DIType<'ctx>) -> bool
This method tests for self and other values to be equal, and is used
+    
Struct inkwell::debug_info::DIType
source · 
pub struct DIType<'ctx> { /* private fields */ }
Expand description
Any kind of debug info type

+
Implementations§
source§
impl<'ctx> DIType<'ctx>
source
pub fn get_size_in_bits(&self) -> u64
source
pub fn get_align_in_bits(&self) -> u32
source
pub fn get_offset_in_bits(&self) -> u64
source
pub fn as_mut_ptr(&self) -> LLVMMetadataRef
Acquires the underlying raw pointer belonging to this DIType type.

+
Trait Implementations§
source§
impl<'ctx> AsDIScope<'ctx> for DIType<'ctx>
source§
fn as_debug_info_scope(self) -> DIScope<'ctx>
source§
impl<'ctx> Clone for DIType<'ctx>
source§
fn clone(&self) -> DIType<'ctx>
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<'ctx> Debug for DIType<'ctx>
source§
fn fmt(&self, f: &mut Formatter<'_>) -> Result
Formats the value using the given formatter. Read more
source§
impl<'ctx> PartialEq for DIType<'ctx>
source§
fn eq(&self, other: &DIType<'ctx>) -> bool
This method tests for self and other values to be equal, and is used
 by ==.
1.0.0 · source§
fn ne(&self, other: &Rhs) -> bool
This method tests for !=. The default implementation is almost always
-sufficient, and should not be overridden without very good reason.
source§
impl<'ctx> Copy for DIType<'ctx>
source§
impl<'ctx> Eq for DIType<'ctx>
source§
impl<'ctx> StructuralPartialEq for DIType<'ctx>
Auto Trait Implementations§
§
impl<'ctx> Freeze for DIType<'ctx>
§
impl<'ctx> RefUnwindSafe for DIType<'ctx>
§
impl<'ctx> !Send for DIType<'ctx>
§
impl<'ctx> !Sync for DIType<'ctx>
§
impl<'ctx> Unpin for DIType<'ctx>
§
impl<'ctx> UnwindSafe for DIType<'ctx>
Blanket Implementations§
source§
impl<T> Any for T
where
+sufficient, and should not be overridden without very good reason.
source§
impl<'ctx> Copy for DIType<'ctx>
source§
impl<'ctx> Eq for DIType<'ctx>
source§
impl<'ctx> StructuralPartialEq for DIType<'ctx>
Auto Trait Implementations§
§
impl<'ctx> Freeze for DIType<'ctx>
§
impl<'ctx> RefUnwindSafe for DIType<'ctx>
§
impl<'ctx> !Send for DIType<'ctx>
§
impl<'ctx> !Sync for DIType<'ctx>
§
impl<'ctx> Unpin for DIType<'ctx>
§
impl<'ctx> UnwindSafe for DIType<'ctx>
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/inkwell/debug_info/struct.DebugInfoBuilder.html b/inkwell/debug_info/struct.DebugInfoBuilder.html
index 559801314..6dad1b275 100644
--- a/inkwell/debug_info/struct.DebugInfoBuilder.html
+++ b/inkwell/debug_info/struct.DebugInfoBuilder.html
@@ -2,8 +2,8 @@
     
Struct inkwell::debug_info::DebugInfoBuilder
source · 
pub struct DebugInfoBuilder<'ctx> { /* private fields */ }
Expand description
A builder object to create debug info metadata. Used along with Builder while producing
 IR. Created by Module::create_debug_info_builder. See debug_info module level
 documentation for more.

-
Implementations§
source§
impl<'ctx> DebugInfoBuilder<'ctx>
source
pub fn as_mut_ptr(&self) -> LLVMDIBuilderRef
Acquires the underlying raw pointer belonging to this DebugInfoBuilder type.

-
source
pub fn create_function(
+
Implementations§
source§
impl<'ctx> DebugInfoBuilder<'ctx>
source
pub fn as_mut_ptr(&self) -> LLVMDIBuilderRef
Acquires the underlying raw pointer belonging to this DebugInfoBuilder type.

+
source
pub fn create_function(
     &self,
     scope: DIScope<'ctx>,
     name: &str,
@@ -32,15 +32,15 @@ function”).
 
  • flags - E.g.: LLVMDIFlagLValueReference. These flags are used to emit dwarf attributes.
    • 
 
  • is_optimized - True if optimization is ON.
    • 
 
-
    source
    pub fn create_lexical_block(
+
    source
    pub fn create_lexical_block(
     &self,
     parent_scope: DIScope<'ctx>,
     file: DIFile<'ctx>,
     line: u32,
     column: u32
 ) -> DILexicalBlock<'ctx>
    Create a lexical block scope.
    
-
    source
    pub fn create_file(&self, filename: &str, directory: &str) -> DIFile<'ctx>
    Create a file scope.
    
-
    source
    pub fn create_debug_location(
+
    source
    pub fn create_file(&self, filename: &str, directory: &str) -> DIFile<'ctx>
    Create a file scope.
    
+
    source
    pub fn create_debug_location(
     &self,
     context: impl AsContextRef<'ctx>,
     line: u32,
@@ -48,7 +48,7 @@ function”).
     scope: DIScope<'ctx>,
     inlined_at: Option<DILocation<'ctx>>
 ) -> DILocation<'ctx>
    Create a debug location.
    
-
    source
    pub fn create_basic_type(
+
    source
    pub fn create_basic_type(
     &self,
     name: &str,
     size_in_bits: u64,
@@ -56,7 +56,7 @@ function”).
     flags: DIFlags
 ) -> Result<DIBasicType<'ctx>, &'static str>
    Create a primitive basic type. encoding is an unsigned int flag (DW_ATE_*
 enum) defined by the chosen DWARF standard.
    
-
    source
    pub fn create_typedef(
+
    source
    pub fn create_typedef(
     &self,
     ditype: DIType<'ctx>,
     name: &str,
@@ -65,7 +65,7 @@ enum) defined by the chosen DWARF standard.
    
     scope: DIScope<'ctx>,
     align_in_bits: u32
 ) -> DIDerivedType<'ctx>
    Create a typedef (alias) of ditype
    
-
    source
    pub fn create_union_type(
+
    source
    pub fn create_union_type(
     &self,
     scope: DIScope<'ctx>,
     name: &str,
@@ -78,7 +78,7 @@ enum) defined by the chosen DWARF standard.
    
     runtime_language: u32,
     unique_id: &str
 ) -> DICompositeType<'ctx>
    Create union type of multiple types.
    
-
    source
    pub fn create_member_type(
+
    source
    pub fn create_member_type(
     &self,
     scope: DIScope<'ctx>,
     name: &str,
@@ -90,7 +90,7 @@ enum) defined by the chosen DWARF standard.
    
     flags: DIFlags,
     ty: DIType<'ctx>
 ) -> DIDerivedType<'ctx>
    Create a type for a non-static member.
    
-
    source
    pub fn create_struct_type(
+
    source
    pub fn create_struct_type(
     &self,
     scope: DIScope<'ctx>,
     name: &str,
@@ -105,14 +105,14 @@ enum) defined by the chosen DWARF standard.
    
     vtable_holder: Option<DIType<'ctx>>,
     unique_id: &str
 ) -> DICompositeType<'ctx>
    Create a struct type.
    
-
    source
    pub fn create_subroutine_type(
+
    source
    pub fn create_subroutine_type(
     &self,
     file: DIFile<'ctx>,
     return_type: Option<DIType<'ctx>>,
     parameter_types: &[DIType<'ctx>],
     flags: DIFlags
 ) -> DISubroutineType<'ctx>
    Create a function type
    
-
    source
    pub fn create_pointer_type(
+
    source
    pub fn create_pointer_type(
     &self,
     name: &str,
     pointee: DIType<'ctx>,
@@ -120,19 +120,19 @@ enum) defined by the chosen DWARF standard.
    
     align_in_bits: u32,
     address_space: AddressSpace
 ) -> DIDerivedType<'ctx>
    Creates a pointer type
    
-
    source
    pub fn create_reference_type(
+
    source
    pub fn create_reference_type(
     &self,
     pointee: DIType<'ctx>,
     tag: u32
 ) -> DIDerivedType<'ctx>
    Creates a pointer type
    
-
    source
    pub fn create_array_type(
+
    source
    pub fn create_array_type(
     &self,
     inner_type: DIType<'ctx>,
     size_in_bits: u64,
     align_in_bits: u32,
     subscripts: &[Range<i64>]
 ) -> DICompositeType<'ctx>
    Creates an array type
    
-
    source
    pub fn create_global_variable_expression(
+
    source
    pub fn create_global_variable_expression(
     &self,
     scope: DIScope<'ctx>,
     name: &str,
@@ -144,7 +144,7 @@ enum) defined by the chosen DWARF standard.
    
     expression: Option<DIExpression<'_>>,
     declaration: Option<DIScope<'_>>,
     align_in_bits: u32
-) -> DIGlobalVariableExpression<'ctx>
    source
    pub fn create_constant_expression(&self, value: i64) -> DIExpression<'ctx>
    source
    pub fn create_parameter_variable(
+) -> DIGlobalVariableExpression<'ctx>
    source
    pub fn create_constant_expression(&self, value: i64) -> DIExpression<'ctx>
    source
    pub fn create_parameter_variable(
     &self,
     scope: DIScope<'ctx>,
     name: &str,
@@ -155,7 +155,7 @@ enum) defined by the chosen DWARF standard.
    
     always_preserve: bool,
     flags: DIFlags
 ) -> DILocalVariable<'ctx>
    Create function parameter variable.
    
-
    source
    pub fn create_auto_variable(
+
    source
    pub fn create_auto_variable(
     &self,
     scope: DIScope<'ctx>,
     name: &str,
@@ -166,12 +166,12 @@ enum) defined by the chosen DWARF standard.
    
     flags: DIFlags,
     align_in_bits: u32
 ) -> DILocalVariable<'ctx>
    Create local automatic storage variable.
    
-
    source
    pub fn create_namespace(
+
    source
    pub fn create_namespace(
     &self,
     scope: DIScope<'ctx>,
     name: &str,
     export_symbols: bool
-) -> DINamespace<'ctx>
    source
    pub fn insert_declare_before_instruction(
+) -> DINamespace<'ctx>
    source
    pub fn insert_declare_before_instruction(
     &self,
     storage: PointerValue<'ctx>,
     var_info: Option<DILocalVariable<'ctx>>,
@@ -179,7 +179,7 @@ enum) defined by the chosen DWARF standard.
    
     debug_loc: DILocation<'ctx>,
     instruction: InstructionValue<'ctx>
 ) -> InstructionValue<'ctx>
    Insert a variable declaration (llvm.dbg.declare) before a specified instruction.
    
-
    source
    pub fn insert_declare_at_end(
+
    source
    pub fn insert_declare_at_end(
     &self,
     storage: PointerValue<'ctx>,
     var_info: Option<DILocalVariable<'ctx>>,
@@ -187,11 +187,11 @@ enum) defined by the chosen DWARF standard.
    
     debug_loc: DILocation<'ctx>,
     block: BasicBlock<'ctx>
 ) -> InstructionValue<'ctx>
    Insert a variable declaration (llvm.dbg.declare intrinsic) at the end of block
    
-
    source
    pub fn create_expression(
+
    source
    pub fn create_expression(
     &self,
     address_operations: Vec<i64>
 ) -> DIExpression<'ctx>
    Create an expression
    
-
    source
    pub fn insert_dbg_value_before(
+
    source
    pub fn insert_dbg_value_before(
     &self,
     value: BasicValueEnum<'ctx>,
     var_info: DILocalVariable<'ctx>,
@@ -199,12 +199,12 @@ enum) defined by the chosen DWARF standard.
    
     debug_loc: DILocation<'ctx>,
     instruction: InstructionValue<'ctx>
 ) -> InstructionValue<'ctx>
    Insert a new llvm.dbg.value intrinsic call before an instruction.
    
-
    source
    pub unsafe fn create_placeholder_derived_type(
+
    source
    pub unsafe fn create_placeholder_derived_type(
     &self,
     context: impl AsContextRef<'ctx>
 ) -> DIDerivedType<'ctx>
    Construct a placeholders derived type to be used when building debug info with circular references.
    
 
    All placeholders must be replaced before calling finalize().
    
-
    source
    pub unsafe fn replace_placeholder_derived_type(
+
    source
    pub unsafe fn replace_placeholder_derived_type(
     &self,
     placeholder: DIDerivedType<'ctx>,
     other: DIDerivedType<'ctx>
@@ -212,10 +212,10 @@ enum) defined by the chosen DWARF standard.
    
 
    §Safety:
    
 
    This and any other copies of this placeholder made by Copy or Clone
 become dangling pointers after calling this method.
    
-
    source
    pub fn finalize(&self)
    Construct any deferred debug info descriptors. May generate invalid metadata if debug info
+
    source
    pub fn finalize(&self)
    Construct any deferred debug info descriptors. May generate invalid metadata if debug info
 is incomplete. Module/function verification can then fail.
    
 
    Call before any kind of code generation (including verification). Can be called more than once.
    
-
    Trait Implementations§
    source§
    impl<'ctx> Debug for DebugInfoBuilder<'ctx>
    source§
    fn fmt(&self, f: &mut Formatter<'_>) -> Result
    Formats the value using the given formatter. Read more
    source§
    impl<'ctx> Drop for DebugInfoBuilder<'ctx>
    source§
    fn drop(&mut self)
    Executes the destructor for this type. Read more
    source§
    impl<'ctx> PartialEq for DebugInfoBuilder<'ctx>
    source§
    fn eq(&self, other: &DebugInfoBuilder<'ctx>) -> bool
    This method tests for self and other values to be equal, and is used
+
    Trait Implementations§
    source§
    impl<'ctx> Debug for DebugInfoBuilder<'ctx>
    source§
    fn fmt(&self, f: &mut Formatter<'_>) -> Result
    Formats the value using the given formatter. Read more
    source§
    impl<'ctx> Drop for DebugInfoBuilder<'ctx>
    source§
    fn drop(&mut self)
    Executes the destructor for this type. Read more
    source§
    impl<'ctx> PartialEq for DebugInfoBuilder<'ctx>
    source§
    fn eq(&self, other: &DebugInfoBuilder<'ctx>) -> bool
    This method tests for self and other values to be equal, and is used
 by ==.
    1.0.0 · source§
    fn ne(&self, other: &Rhs) -> bool
    This method tests for !=. The default implementation is almost always
 sufficient, and should not be overridden without very good reason.
    source§
    impl<'ctx> Eq for DebugInfoBuilder<'ctx>
    source§
    impl<'ctx> StructuralPartialEq for DebugInfoBuilder<'ctx>
    Auto Trait Implementations§
    §
    impl<'ctx> Freeze for DebugInfoBuilder<'ctx>
    §
    impl<'ctx> RefUnwindSafe for DebugInfoBuilder<'ctx>
    §
    impl<'ctx> !Send for DebugInfoBuilder<'ctx>
    §
    impl<'ctx> !Sync for DebugInfoBuilder<'ctx>
    §
    impl<'ctx> Unpin for DebugInfoBuilder<'ctx>
    §
    impl<'ctx> UnwindSafe for DebugInfoBuilder<'ctx>
    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/inkwell/debug_info/trait.AsDIScope.html b/inkwell/debug_info/trait.AsDIScope.html
index 4b93b088c..cb17a76d8 100644
--- a/inkwell/debug_info/trait.AsDIScope.html
+++ b/inkwell/debug_info/trait.AsDIScope.html
@@ -1,7 +1,7 @@
 AsDIScope in inkwell::debug_info - Rust
    
-    
    Trait inkwell::debug_info::AsDIScope
    source · 
    pub trait AsDIScope<'ctx> {
+    
    Trait inkwell::debug_info::AsDIScope
    source · 
    pub trait AsDIScope<'ctx> {
     // Required method
     fn as_debug_info_scope(self) -> DIScope<'ctx>;
 }
    Expand description
    Specific scopes (i.e. DILexicalBlock) can be turned into a DIScope with the
 AsDIScope::as_debug_info_scope trait method.
    
-
    Required Methods§
    source
    fn as_debug_info_scope(self) -> DIScope<'ctx>
    Implementors§
    source§
    impl<'ctx> AsDIScope<'ctx> for DIBasicType<'ctx>
    source§
    impl<'ctx> AsDIScope<'ctx> for DICompileUnit<'ctx>
    source§
    impl<'ctx> AsDIScope<'ctx> for DICompositeType<'ctx>
    source§
    impl<'ctx> AsDIScope<'ctx> for DIDerivedType<'ctx>
    source§
    impl<'ctx> AsDIScope<'ctx> for DIFile<'ctx>
    source§
    impl<'ctx> AsDIScope<'ctx> for DILexicalBlock<'ctx>
    source§
    impl<'ctx> AsDIScope<'ctx> for DINamespace<'ctx>
    source§
    impl<'ctx> AsDIScope<'ctx> for DISubprogram<'ctx>
    source§
    impl<'ctx> AsDIScope<'ctx> for DIType<'ctx>
    
\ No newline at end of file
+
    Required Methods§
    source
    fn as_debug_info_scope(self) -> DIScope<'ctx>
    Implementors§
    source§
    impl<'ctx> AsDIScope<'ctx> for DIBasicType<'ctx>
    source§
    impl<'ctx> AsDIScope<'ctx> for DICompileUnit<'ctx>
    source§
    impl<'ctx> AsDIScope<'ctx> for DICompositeType<'ctx>
    source§
    impl<'ctx> AsDIScope<'ctx> for DIDerivedType<'ctx>
    source§
    impl<'ctx> AsDIScope<'ctx> for DIFile<'ctx>
    source§
    impl<'ctx> AsDIScope<'ctx> for DILexicalBlock<'ctx>
    source§
    impl<'ctx> AsDIScope<'ctx> for DINamespace<'ctx>
    source§
    impl<'ctx> AsDIScope<'ctx> for DISubprogram<'ctx>
    source§
    impl<'ctx> AsDIScope<'ctx> for DIType<'ctx>
    
\ No newline at end of file
diff --git a/inkwell/debug_info/trait.DIFlagsConstants.html b/inkwell/debug_info/trait.DIFlagsConstants.html
index 30145c4bd..bc02a23fc 100644
--- a/inkwell/debug_info/trait.DIFlagsConstants.html
+++ b/inkwell/debug_info/trait.DIFlagsConstants.html
@@ -1,5 +1,5 @@
 DIFlagsConstants in inkwell::debug_info - Rust
    
-    
    Trait inkwell::debug_info::DIFlagsConstants
    source · 
    pub trait DIFlagsConstants {
+    
    Trait inkwell::debug_info::DIFlagsConstants
    source · 
    pub trait DIFlagsConstants {
 
    Show 27 associated constants and 0 method    const ZERO: Self;
     const PRIVATE: Self;
     const PROTECTED: Self;
@@ -27,4 +27,4 @@
     const TYPE_PASS_BY_REFERENCE: Self;
     const THUNK: Self;
     const INDIRECT_VIRTUAL_BASE: Self;
-
    }
    Required Associated Constants§
    source
    const ZERO: Self
    source
    const PRIVATE: Self
    source
    const PROTECTED: Self
    source
    const PUBLIC: Self
    source
    const FWD_DECL: Self
    source
    const APPLE_BLOCK: Self
    source
    const VIRTUAL: Self
    source
    const ARTIFICIAL: Self
    source
    const EXPLICIT: Self
    source
    const PROTOTYPED: Self
    source
    const OBJC_CLASS_COMPLETE: Self
    source
    const OBJECT_POINTER: Self
    source
    const VECTOR: Self
    source
    const STATIC_MEMBER: Self
    source
    const LVALUE_REFERENCE: Self
    source
    const RVALUE_REFERENCE: Self
    source
    const RESERVED: Self
    source
    const SINGLE_INHERITANCE: Self
    source
    const MULTIPLE_INHERITANCE: Self
    source
    const VIRTUAL_INHERITANCE: Self
    source
    const INTRODUCED_VIRTUAL: Self
    source
    const BIT_FIELD: Self
    source
    const NO_RETURN: Self
    source
    const TYPE_PASS_BY_VALUE: Self
    source
    const TYPE_PASS_BY_REFERENCE: Self
    source
    const THUNK: Self
    source
    const INDIRECT_VIRTUAL_BASE: Self
    Object Safety§
    This trait is not object safe.
    Implementors§
    source§
    impl DIFlagsConstants for DIFlags
    source§
    const ZERO: DIFlags = 0i32
    source§
    const PRIVATE: DIFlags = 1i32
    source§
    const PROTECTED: DIFlags = 2i32
    source§
    const PUBLIC: DIFlags = 3i32
    source§
    const FWD_DECL: DIFlags = 4i32
    source§
    const APPLE_BLOCK: DIFlags = 8i32
    source§
    const VIRTUAL: DIFlags = 32i32
    source§
    const ARTIFICIAL: DIFlags = 64i32
    source§
    const EXPLICIT: DIFlags = 128i32
    source§
    const PROTOTYPED: DIFlags = 256i32
    source§
    const OBJC_CLASS_COMPLETE: DIFlags = 512i32
    source§
    const OBJECT_POINTER: DIFlags = 1_024i32
    source§
    const VECTOR: DIFlags = 2_048i32
    source§
    const STATIC_MEMBER: DIFlags = 4_096i32
    source§
    const LVALUE_REFERENCE: DIFlags = 8_192i32
    source§
    const RVALUE_REFERENCE: DIFlags = 16_384i32
    source§
    const RESERVED: DIFlags = 32_768i32
    source§
    const SINGLE_INHERITANCE: DIFlags = 65_536i32
    source§
    const MULTIPLE_INHERITANCE: DIFlags = 131_072i32
    source§
    const VIRTUAL_INHERITANCE: DIFlags = 196_608i32
    source§
    const INTRODUCED_VIRTUAL: DIFlags = 262_144i32
    source§
    const BIT_FIELD: DIFlags = 524_288i32
    source§
    const NO_RETURN: DIFlags = 1_048_576i32
    source§
    const TYPE_PASS_BY_VALUE: DIFlags = 4_194_304i32
    source§
    const TYPE_PASS_BY_REFERENCE: DIFlags = 8_388_608i32
    source§
    const THUNK: DIFlags = 33_554_432i32
    source§
    const INDIRECT_VIRTUAL_BASE: DIFlags = 36i32
    
\ No newline at end of file
+
    }

    Required Associated Constants§

    source

    const ZERO: Self

    source

    const PRIVATE: Self

    source

    const PROTECTED: Self

    source

    const PUBLIC: Self

    source

    const FWD_DECL: Self

    source

    const APPLE_BLOCK: Self

    source

    const VIRTUAL: Self

    source

    const ARTIFICIAL: Self

    source

    const EXPLICIT: Self

    source

    const PROTOTYPED: Self

    source

    const OBJC_CLASS_COMPLETE: Self

    source

    const OBJECT_POINTER: Self

    source

    const VECTOR: Self

    source

    const STATIC_MEMBER: Self

    source

    const LVALUE_REFERENCE: Self

    source

    const RVALUE_REFERENCE: Self

    source

    const RESERVED: Self

    source

    const SINGLE_INHERITANCE: Self

    source

    const MULTIPLE_INHERITANCE: Self

    source

    const VIRTUAL_INHERITANCE: Self

    source

    const INTRODUCED_VIRTUAL: Self

    source

    const BIT_FIELD: Self

    source

    const NO_RETURN: Self

    source

    const TYPE_PASS_BY_VALUE: Self

    source

    const TYPE_PASS_BY_REFERENCE: Self

    source

    const THUNK: Self

    source

    const INDIRECT_VIRTUAL_BASE: Self

    Object Safety§

    This trait is not object safe.

    Implementors§

    source§

    impl DIFlagsConstants for DIFlags

    source§

    const ZERO: DIFlags = 0i32

    source§

    const PRIVATE: DIFlags = 1i32

    source§

    const PROTECTED: DIFlags = 2i32

    source§

    const PUBLIC: DIFlags = 3i32

    source§

    const FWD_DECL: DIFlags = 4i32

    source§

    const APPLE_BLOCK: DIFlags = 8i32

    source§

    const VIRTUAL: DIFlags = 32i32

    source§

    const ARTIFICIAL: DIFlags = 64i32

    source§

    const EXPLICIT: DIFlags = 128i32

    source§

    const PROTOTYPED: DIFlags = 256i32

    source§

    const OBJC_CLASS_COMPLETE: DIFlags = 512i32

    source§

    const OBJECT_POINTER: DIFlags = 1_024i32

    source§

    const VECTOR: DIFlags = 2_048i32

    source§

    const STATIC_MEMBER: DIFlags = 4_096i32

    source§

    const LVALUE_REFERENCE: DIFlags = 8_192i32

    source§

    const RVALUE_REFERENCE: DIFlags = 16_384i32

    source§

    const RESERVED: DIFlags = 32_768i32

    source§

    const SINGLE_INHERITANCE: DIFlags = 65_536i32

    source§

    const MULTIPLE_INHERITANCE: DIFlags = 131_072i32

    source§

    const VIRTUAL_INHERITANCE: DIFlags = 196_608i32

    source§

    const INTRODUCED_VIRTUAL: DIFlags = 262_144i32

    source§

    const BIT_FIELD: DIFlags = 524_288i32

    source§

    const NO_RETURN: DIFlags = 1_048_576i32

    source§

    const TYPE_PASS_BY_VALUE: DIFlags = 4_194_304i32

    source§

    const TYPE_PASS_BY_REFERENCE: DIFlags = 8_388_608i32

    source§

    const THUNK: DIFlags = 33_554_432i32

    source§

    const INDIRECT_VIRTUAL_BASE: DIFlags = 36i32

    \ No newline at end of file diff --git a/inkwell/debug_info/type.DIFlags.html b/inkwell/debug_info/type.DIFlags.html index 1e5d7bd48..8127ec8ce 100644 --- a/inkwell/debug_info/type.DIFlags.html +++ b/inkwell/debug_info/type.DIFlags.html @@ -1,2 +1,2 @@ DIFlags in inkwell::debug_info - Rust
    -

    Type Alias inkwell::debug_info::DIFlags

    source · 
    pub type DIFlags = i32;

    Trait Implementations§

    source§

    impl DIFlagsConstants for DIFlags

    source§

    const ZERO: DIFlags = 0i32

    source§

    const PRIVATE: DIFlags = 1i32

    source§

    const PROTECTED: DIFlags = 2i32

    source§

    const PUBLIC: DIFlags = 3i32

    source§

    const FWD_DECL: DIFlags = 4i32

    source§

    const APPLE_BLOCK: DIFlags = 8i32

    source§

    const VIRTUAL: DIFlags = 32i32

    source§

    const ARTIFICIAL: DIFlags = 64i32

    source§

    const EXPLICIT: DIFlags = 128i32

    source§

    const PROTOTYPED: DIFlags = 256i32

    source§

    const OBJC_CLASS_COMPLETE: DIFlags = 512i32

    source§

    const OBJECT_POINTER: DIFlags = 1_024i32

    source§

    const VECTOR: DIFlags = 2_048i32

    source§

    const STATIC_MEMBER: DIFlags = 4_096i32

    source§

    const LVALUE_REFERENCE: DIFlags = 8_192i32

    source§

    const RVALUE_REFERENCE: DIFlags = 16_384i32

    source§

    const RESERVED: DIFlags = 32_768i32

    source§

    const SINGLE_INHERITANCE: DIFlags = 65_536i32

    source§

    const MULTIPLE_INHERITANCE: DIFlags = 131_072i32

    source§

    const VIRTUAL_INHERITANCE: DIFlags = 196_608i32

    source§

    const INTRODUCED_VIRTUAL: DIFlags = 262_144i32

    source§

    const BIT_FIELD: DIFlags = 524_288i32

    source§

    const NO_RETURN: DIFlags = 1_048_576i32

    source§

    const TYPE_PASS_BY_VALUE: DIFlags = 4_194_304i32

    source§

    const TYPE_PASS_BY_REFERENCE: DIFlags = 8_388_608i32

    source§

    const THUNK: DIFlags = 33_554_432i32

    source§

    const INDIRECT_VIRTUAL_BASE: DIFlags = 36i32

    \ No newline at end of file +

    Type Alias inkwell::debug_info::DIFlags

    source · 
    pub type DIFlags = i32;

    Trait Implementations§

    source§

    impl DIFlagsConstants for DIFlags

    source§

    const ZERO: DIFlags = 0i32

    source§

    const PRIVATE: DIFlags = 1i32

    source§

    const PROTECTED: DIFlags = 2i32

    source§

    const PUBLIC: DIFlags = 3i32

    source§

    const FWD_DECL: DIFlags = 4i32

    source§

    const APPLE_BLOCK: DIFlags = 8i32

    source§

    const VIRTUAL: DIFlags = 32i32

    source§

    const ARTIFICIAL: DIFlags = 64i32

    source§

    const EXPLICIT: DIFlags = 128i32

    source§

    const PROTOTYPED: DIFlags = 256i32

    source§

    const OBJC_CLASS_COMPLETE: DIFlags = 512i32

    source§

    const OBJECT_POINTER: DIFlags = 1_024i32

    source§

    const VECTOR: DIFlags = 2_048i32

    source§

    const STATIC_MEMBER: DIFlags = 4_096i32

    source§

    const LVALUE_REFERENCE: DIFlags = 8_192i32

    source§

    const RVALUE_REFERENCE: DIFlags = 16_384i32

    source§

    const RESERVED: DIFlags = 32_768i32

    source§

    const SINGLE_INHERITANCE: DIFlags = 65_536i32

    source§

    const MULTIPLE_INHERITANCE: DIFlags = 131_072i32

    source§

    const VIRTUAL_INHERITANCE: DIFlags = 196_608i32

    source§

    const INTRODUCED_VIRTUAL: DIFlags = 262_144i32

    source§

    const BIT_FIELD: DIFlags = 524_288i32

    source§

    const NO_RETURN: DIFlags = 1_048_576i32

    source§

    const TYPE_PASS_BY_VALUE: DIFlags = 4_194_304i32

    source§

    const TYPE_PASS_BY_REFERENCE: DIFlags = 8_388_608i32

    source§

    const THUNK: DIFlags = 33_554_432i32

    source§

    const INDIRECT_VIRTUAL_BASE: DIFlags = 36i32

    \ No newline at end of file diff --git a/inkwell/enum.AtomicOrdering.html b/inkwell/enum.AtomicOrdering.html index 7f3cf9f3c..5f6754aac 100644 --- a/inkwell/enum.AtomicOrdering.html +++ b/inkwell/enum.AtomicOrdering.html @@ -1,5 +1,5 @@ AtomicOrdering in inkwell - Rust
    -

    Enum inkwell::AtomicOrdering

    source · 
    pub enum AtomicOrdering {
+    
    Enum inkwell::AtomicOrdering
    source · 
    pub enum AtomicOrdering {
     NotAtomic,
     Unordered,
     Monotonic,
@@ -7,16 +7,16 @@
     Release,
     AcquireRelease,
     SequentiallyConsistent,
-}
    Variants§
    §
    NotAtomic
    §
    Unordered
    §
    Monotonic
    §
    Acquire
    §
    Release
    §
    AcquireRelease
    §
    SequentiallyConsistent
    Trait Implementations§
    source§
    impl Clone for AtomicOrdering
    source§
    fn clone(&self) -> AtomicOrdering
    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 AtomicOrdering
    source§
    fn fmt(&self, f: &mut Formatter<'_>) -> Result
    Formats the value using the given formatter. Read more
    source§
    impl From<LLVMAtomicOrdering> for AtomicOrdering
    source§
    fn from(src: LLVMAtomicOrdering) -> Self
    Converts to this type from the input type.
    source§
    impl Hash for AtomicOrdering
    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
+}

    Variants§

    §

    NotAtomic

    §

    Unordered

    §

    Monotonic

    §

    Acquire

    §

    Release

    §

    AcquireRelease

    §

    SequentiallyConsistent

    Trait Implementations§

    source§

    impl Clone for AtomicOrdering

    source§

    fn clone(&self) -> AtomicOrdering

    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 AtomicOrdering

    source§

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

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

    impl From<LLVMAtomicOrdering> for AtomicOrdering

    source§

    fn from(src: LLVMAtomicOrdering) -> Self

    Converts to this type from the input type.
    source§

    impl Hash for AtomicOrdering

    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 Into<LLVMAtomicOrdering> for AtomicOrdering

    source§

    fn into(self) -> LLVMAtomicOrdering

    Converts this type into the (usually inferred) input type.
    source§

    impl Ord for AtomicOrdering

    source§

    fn cmp(&self, other: &AtomicOrdering) -> 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 Into<LLVMAtomicOrdering> for AtomicOrdering

    source§

    fn into(self) -> LLVMAtomicOrdering

    Converts this type into the (usually inferred) input type.
    source§

    impl Ord for AtomicOrdering

    source§

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

    source§

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

    source§

    fn eq(&self, other: &AtomicOrdering) -> bool

    This method tests for self and other values to be equal, and is used by ==.
    1.0.0 · source§

    fn ne(&self, other: &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 AtomicOrdering

    source§

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

    source§

    fn partial_cmp(&self, other: &AtomicOrdering) -> Option<Ordering>

    This method returns an ordering between self and other values if one exists. Read more
    1.0.0 · source§

    fn lt(&self, other: &Rhs) -> bool

    This method tests less than (for self and other) and is used by the < operator. Read more
    1.0.0 · source§

    fn le(&self, other: &Rhs) -> bool

    This method tests less than or equal to (for self and other) and is used by the <= operator. Read more
    1.0.0 · source§

    fn gt(&self, other: &Rhs) -> bool

    This method tests greater than (for self and other) and is used by the > operator. Read more
    1.0.0 · source§

    fn ge(&self, other: &Rhs) -> bool

    This method tests greater than or equal to (for self and other) and is used by the >= -operator. Read more
    source§

    impl Copy for AtomicOrdering

    source§

    impl Eq for AtomicOrdering

    source§

    impl StructuralPartialEq for AtomicOrdering

    Auto Trait Implementations§

    Blanket Implementations§

    source§

    impl<T> Any for T
    where +operator. Read more

    source§

    impl Copy for AtomicOrdering

    source§

    impl Eq for AtomicOrdering

    source§

    impl StructuralPartialEq for AtomicOrdering

    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/inkwell/enum.AtomicRMWBinOp.html b/inkwell/enum.AtomicRMWBinOp.html index 16f2cae64..76e91c0dc 100644 --- a/inkwell/enum.AtomicRMWBinOp.html +++ b/inkwell/enum.AtomicRMWBinOp.html @@ -1,5 +1,5 @@ AtomicRMWBinOp in inkwell - Rust
    -

    Enum inkwell::AtomicRMWBinOp

    source · 
    pub enum AtomicRMWBinOp {
+    
    Enum inkwell::AtomicRMWBinOp
    source · 
    pub enum AtomicRMWBinOp {
 
    Show 15 variants    Xchg,
     Add,
     Sub,
@@ -30,16 +30,16 @@
 
    §
    FSub
    Subtract a float-typed value off the value in memory and returns the prior value.
    
 
    §
    FMax
    Sets memory to the greater of the two float-typed values, one provided and one from memory. Returns the value that was in memory.
    
 
    §
    FMin
    Sets memory to the lesser of the two float-typed values, one provided and one from memory. Returns the value that was in memory.
    
-

    Trait Implementations§

    source§

    impl Clone for AtomicRMWBinOp

    source§

    fn clone(&self) -> AtomicRMWBinOp

    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 AtomicRMWBinOp

    source§

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

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

    impl From<LLVMAtomicRMWBinOp> for AtomicRMWBinOp

    source§

    fn from(src: LLVMAtomicRMWBinOp) -> Self

    Converts to this type from the input type.
    source§

    impl Hash for AtomicRMWBinOp

    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 AtomicRMWBinOp

    source§

    fn clone(&self) -> AtomicRMWBinOp

    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 AtomicRMWBinOp

    source§

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

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

    impl From<LLVMAtomicRMWBinOp> for AtomicRMWBinOp

    source§

    fn from(src: LLVMAtomicRMWBinOp) -> Self

    Converts to this type from the input type.
    source§

    impl Hash for AtomicRMWBinOp

    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 Into<LLVMAtomicRMWBinOp> for AtomicRMWBinOp

    source§

    fn into(self) -> LLVMAtomicRMWBinOp

    Converts this type into the (usually inferred) input type.
    source§

    impl Ord for AtomicRMWBinOp

    source§

    fn cmp(&self, other: &AtomicRMWBinOp) -> 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 Into<LLVMAtomicRMWBinOp> for AtomicRMWBinOp

    source§

    fn into(self) -> LLVMAtomicRMWBinOp

    Converts this type into the (usually inferred) input type.
    source§

    impl Ord for AtomicRMWBinOp

    source§

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

    source§

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

    source§

    fn eq(&self, other: &AtomicRMWBinOp) -> bool

    This method tests for self and other values to be equal, and is used by ==.
    1.0.0 · source§

    fn ne(&self, other: &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 AtomicRMWBinOp

    source§

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

    source§

    fn partial_cmp(&self, other: &AtomicRMWBinOp) -> Option<Ordering>

    This method returns an ordering between self and other values if one exists. Read more
    1.0.0 · source§

    fn lt(&self, other: &Rhs) -> bool

    This method tests less than (for self and other) and is used by the < operator. Read more
    1.0.0 · source§

    fn le(&self, other: &Rhs) -> bool

    This method tests less than or equal to (for self and other) and is used by the <= operator. Read more
    1.0.0 · source§

    fn gt(&self, other: &Rhs) -> bool

    This method tests greater than (for self and other) and is used by the > operator. Read more
    1.0.0 · source§

    fn ge(&self, other: &Rhs) -> bool

    This method tests greater than or equal to (for self and other) and is used by the >= -operator. Read more
    source§

    impl Copy for AtomicRMWBinOp

    source§

    impl Eq for AtomicRMWBinOp

    source§

    impl StructuralPartialEq for AtomicRMWBinOp

    Auto Trait Implementations§

    Blanket Implementations§

    source§

    impl<T> Any for T
    where +operator. Read more

    source§

    impl Copy for AtomicRMWBinOp

    source§

    impl Eq for AtomicRMWBinOp

    source§

    impl StructuralPartialEq for AtomicRMWBinOp

    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/inkwell/enum.DLLStorageClass.html b/inkwell/enum.DLLStorageClass.html index 40623ba03..8875188c0 100644 --- a/inkwell/enum.DLLStorageClass.html +++ b/inkwell/enum.DLLStorageClass.html @@ -1,19 +1,19 @@ DLLStorageClass in inkwell - Rust
    -

    Enum inkwell::DLLStorageClass

    source · 
    pub enum DLLStorageClass {
+    
    Enum inkwell::DLLStorageClass
    source · 
    pub enum DLLStorageClass {
     Default,
     Import,
     Export,
-}
    Variants§
    §
    Default
    §
    Import
    §
    Export
    Trait Implementations§
    source§
    impl Clone for DLLStorageClass
    source§
    fn clone(&self) -> DLLStorageClass
    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 DLLStorageClass
    source§
    fn fmt(&self, f: &mut Formatter<'_>) -> Result
    Formats the value using the given formatter. Read more
    source§
    impl Default for DLLStorageClass
    source§
    fn default() -> Self
    Returns the default value for DLLStorageClass, namely DLLStorageClass::Default.
    
-
    source§
    impl From<LLVMDLLStorageClass> for DLLStorageClass
    source§
    fn from(src: LLVMDLLStorageClass) -> Self
    Converts to this type from the input type.
    source§
    impl Hash for DLLStorageClass
    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
+}

    Variants§

    §

    Default

    §

    Import

    §

    Export

    Trait Implementations§

    source§

    impl Clone for DLLStorageClass

    source§

    fn clone(&self) -> DLLStorageClass

    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 DLLStorageClass

    source§

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

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

    impl Default for DLLStorageClass

    source§

    fn default() -> Self

    Returns the default value for DLLStorageClass, namely DLLStorageClass::Default.

    +
    source§

    impl From<LLVMDLLStorageClass> for DLLStorageClass

    source§

    fn from(src: LLVMDLLStorageClass) -> Self

    Converts to this type from the input type.
    source§

    impl Hash for DLLStorageClass

    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 Into<LLVMDLLStorageClass> for DLLStorageClass

    source§

    fn into(self) -> LLVMDLLStorageClass

    Converts this type into the (usually inferred) input type.
    source§

    impl Ord for DLLStorageClass

    source§

    fn cmp(&self, other: &DLLStorageClass) -> 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 Into<LLVMDLLStorageClass> for DLLStorageClass

    source§

    fn into(self) -> LLVMDLLStorageClass

    Converts this type into the (usually inferred) input type.
    source§

    impl Ord for DLLStorageClass

    source§

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

    source§

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

    source§

    fn eq(&self, other: &DLLStorageClass) -> bool

    This method tests for self and other values to be equal, and is used by ==.
    1.0.0 · source§

    fn ne(&self, other: &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 DLLStorageClass

    source§

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

    source§

    fn partial_cmp(&self, other: &DLLStorageClass) -> Option<Ordering>

    This method returns an ordering between self and other values if one exists. Read more
    1.0.0 · source§

    fn lt(&self, other: &Rhs) -> bool

    This method tests less than (for self and other) and is used by the < operator. Read more
    1.0.0 · source§

    fn le(&self, other: &Rhs) -> bool

    This method tests less than or equal to (for self and other) and is used by the <= operator. Read more
    1.0.0 · source§

    fn gt(&self, other: &Rhs) -> bool

    This method tests greater than (for self and other) and is used by the > operator. Read more
    1.0.0 · source§

    fn ge(&self, other: &Rhs) -> bool

    This method tests greater than or equal to (for self and other) and is used by the >= -operator. Read more
    source§

    impl Copy for DLLStorageClass

    source§

    impl Eq for DLLStorageClass

    source§

    impl StructuralPartialEq for DLLStorageClass

    Auto Trait Implementations§

    Blanket Implementations§

    source§

    impl<T> Any for T
    where +operator. Read more

    source§

    impl Copy for DLLStorageClass

    source§

    impl Eq for DLLStorageClass

    source§

    impl StructuralPartialEq for DLLStorageClass

    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/inkwell/enum.FloatPredicate.html b/inkwell/enum.FloatPredicate.html index 9825ceb51..656657648 100644 --- a/inkwell/enum.FloatPredicate.html +++ b/inkwell/enum.FloatPredicate.html @@ -1,5 +1,5 @@ FloatPredicate in inkwell - Rust
    -

    Enum inkwell::FloatPredicate

    source · 
    pub enum FloatPredicate {
+    
    Enum inkwell::FloatPredicate
    source · 
    pub enum FloatPredicate {
 
    Show 16 variants    OEQ,
     OGE,
     OGT,
@@ -33,16 +33,16 @@
 
    §
    ULT
    Returns true if left < right or either is NaN
    
 
    §
    UNE
    Returns true if left != right or either is NaN
    
 
    §
    UNO
    Returns true if either value is NaN
    
-

    Trait Implementations§

    source§

    impl Clone for FloatPredicate

    source§

    fn clone(&self) -> FloatPredicate

    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 FloatPredicate

    source§

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

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

    impl From<LLVMRealPredicate> for FloatPredicate

    source§

    fn from(src: LLVMRealPredicate) -> Self

    Converts to this type from the input type.
    source§

    impl Hash for FloatPredicate

    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 FloatPredicate

    source§

    fn clone(&self) -> FloatPredicate

    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 FloatPredicate

    source§

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

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

    impl From<LLVMRealPredicate> for FloatPredicate

    source§

    fn from(src: LLVMRealPredicate) -> Self

    Converts to this type from the input type.
    source§

    impl Hash for FloatPredicate

    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 Into<LLVMRealPredicate> for FloatPredicate

    source§

    fn into(self) -> LLVMRealPredicate

    Converts this type into the (usually inferred) input type.
    source§

    impl Ord for FloatPredicate

    source§

    fn cmp(&self, other: &FloatPredicate) -> 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 Into<LLVMRealPredicate> for FloatPredicate

    source§

    fn into(self) -> LLVMRealPredicate

    Converts this type into the (usually inferred) input type.
    source§

    impl Ord for FloatPredicate

    source§

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

    source§

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

    source§

    fn eq(&self, other: &FloatPredicate) -> bool

    This method tests for self and other values to be equal, and is used by ==.
    1.0.0 · source§

    fn ne(&self, other: &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 FloatPredicate

    source§

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

    source§

    fn partial_cmp(&self, other: &FloatPredicate) -> Option<Ordering>

    This method returns an ordering between self and other values if one exists. Read more
    1.0.0 · source§

    fn lt(&self, other: &Rhs) -> bool

    This method tests less than (for self and other) and is used by the < operator. Read more
    1.0.0 · source§

    fn le(&self, other: &Rhs) -> bool

    This method tests less than or equal to (for self and other) and is used by the <= operator. Read more
    1.0.0 · source§

    fn gt(&self, other: &Rhs) -> bool

    This method tests greater than (for self and other) and is used by the > operator. Read more
    1.0.0 · source§

    fn ge(&self, other: &Rhs) -> bool

    This method tests greater than or equal to (for self and other) and is used by the >= -operator. Read more
    source§

    impl Copy for FloatPredicate

    source§

    impl Eq for FloatPredicate

    source§

    impl StructuralPartialEq for FloatPredicate

    Auto Trait Implementations§

    Blanket Implementations§

    source§

    impl<T> Any for T
    where +operator. Read more

    source§

    impl Copy for FloatPredicate

    source§

    impl Eq for FloatPredicate

    source§

    impl StructuralPartialEq for FloatPredicate

    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/inkwell/enum.GlobalVisibility.html b/inkwell/enum.GlobalVisibility.html index f69cd4d37..c2f697030 100644 --- a/inkwell/enum.GlobalVisibility.html +++ b/inkwell/enum.GlobalVisibility.html @@ -1,19 +1,19 @@ GlobalVisibility in inkwell - Rust
    -

    Enum inkwell::GlobalVisibility

    source · 
    pub enum GlobalVisibility {
+    
    Enum inkwell::GlobalVisibility
    source · 
    pub enum GlobalVisibility {
     Default,
     Hidden,
     Protected,
-}
    Variants§
    §
    Default
    §
    Hidden
    §
    Protected
    Trait Implementations§
    source§
    impl Clone for GlobalVisibility
    source§
    fn clone(&self) -> GlobalVisibility
    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 GlobalVisibility
    source§
    fn fmt(&self, f: &mut Formatter<'_>) -> Result
    Formats the value using the given formatter. Read more
    source§
    impl Default for GlobalVisibility
    source§
    fn default() -> Self
    Returns the default value for GlobalVisibility, namely GlobalVisibility::Default.
    
-
    source§
    impl From<LLVMVisibility> for GlobalVisibility
    source§
    fn from(src: LLVMVisibility) -> Self
    Converts to this type from the input type.
    source§
    impl Hash for GlobalVisibility
    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
+}

    Variants§

    §

    Default

    §

    Hidden

    §

    Protected

    Trait Implementations§

    source§

    impl Clone for GlobalVisibility

    source§

    fn clone(&self) -> GlobalVisibility

    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 GlobalVisibility

    source§

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

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

    impl Default for GlobalVisibility

    source§

    fn default() -> Self

    Returns the default value for GlobalVisibility, namely GlobalVisibility::Default.

    +
    source§

    impl From<LLVMVisibility> for GlobalVisibility

    source§

    fn from(src: LLVMVisibility) -> Self

    Converts to this type from the input type.
    source§

    impl Hash for GlobalVisibility

    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 Into<LLVMVisibility> for GlobalVisibility

    source§

    fn into(self) -> LLVMVisibility

    Converts this type into the (usually inferred) input type.
    source§

    impl Ord for GlobalVisibility

    source§

    fn cmp(&self, other: &GlobalVisibility) -> 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 Into<LLVMVisibility> for GlobalVisibility

    source§

    fn into(self) -> LLVMVisibility

    Converts this type into the (usually inferred) input type.
    source§

    impl Ord for GlobalVisibility

    source§

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

    source§

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

    source§

    fn eq(&self, other: &GlobalVisibility) -> bool

    This method tests for self and other values to be equal, and is used by ==.
    1.0.0 · source§

    fn ne(&self, other: &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 GlobalVisibility

    source§

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

    source§

    fn partial_cmp(&self, other: &GlobalVisibility) -> Option<Ordering>

    This method returns an ordering between self and other values if one exists. Read more
    1.0.0 · source§

    fn lt(&self, other: &Rhs) -> bool

    This method tests less than (for self and other) and is used by the < operator. Read more
    1.0.0 · source§

    fn le(&self, other: &Rhs) -> bool

    This method tests less than or equal to (for self and other) and is used by the <= operator. Read more
    1.0.0 · source§

    fn gt(&self, other: &Rhs) -> bool

    This method tests greater than (for self and other) and is used by the > operator. Read more
    1.0.0 · source§

    fn ge(&self, other: &Rhs) -> bool

    This method tests greater than or equal to (for self and other) and is used by the >= -operator. Read more
    source§

    impl Copy for GlobalVisibility

    source§

    impl Eq for GlobalVisibility

    source§

    impl StructuralPartialEq for GlobalVisibility

    Auto Trait Implementations§

    Blanket Implementations§

    source§

    impl<T> Any for T
    where +operator. Read more

    source§

    impl Copy for GlobalVisibility

    source§

    impl Eq for GlobalVisibility

    source§

    impl StructuralPartialEq for GlobalVisibility

    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/inkwell/enum.InlineAsmDialect.html b/inkwell/enum.InlineAsmDialect.html index bf17c4128..7b9e9a4a0 100644 --- a/inkwell/enum.InlineAsmDialect.html +++ b/inkwell/enum.InlineAsmDialect.html @@ -1,17 +1,17 @@ InlineAsmDialect in inkwell - Rust
    -

    Enum inkwell::InlineAsmDialect

    source · 
    pub enum InlineAsmDialect {
+    
    Enum inkwell::InlineAsmDialect
    source · 
    pub enum InlineAsmDialect {
     ATT,
     Intel,
-}
    Variants§
    §
    ATT
    §
    Intel
    Trait Implementations§
    source§
    impl Clone for InlineAsmDialect
    source§
    fn clone(&self) -> InlineAsmDialect
    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 InlineAsmDialect
    source§
    fn fmt(&self, f: &mut Formatter<'_>) -> Result
    Formats the value using the given formatter. Read more
    source§
    impl From<LLVMInlineAsmDialect> for InlineAsmDialect
    source§
    fn from(src: LLVMInlineAsmDialect) -> Self
    Converts to this type from the input type.
    source§
    impl Hash for InlineAsmDialect
    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
+}

    Variants§

    §

    ATT

    §

    Intel

    Trait Implementations§

    source§

    impl Clone for InlineAsmDialect

    source§

    fn clone(&self) -> InlineAsmDialect

    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 InlineAsmDialect

    source§

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

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

    impl From<LLVMInlineAsmDialect> for InlineAsmDialect

    source§

    fn from(src: LLVMInlineAsmDialect) -> Self

    Converts to this type from the input type.
    source§

    impl Hash for InlineAsmDialect

    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 Into<LLVMInlineAsmDialect> for InlineAsmDialect

    source§

    fn into(self) -> LLVMInlineAsmDialect

    Converts this type into the (usually inferred) input type.
    source§

    impl Ord for InlineAsmDialect

    source§

    fn cmp(&self, other: &InlineAsmDialect) -> 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 Into<LLVMInlineAsmDialect> for InlineAsmDialect

    source§

    fn into(self) -> LLVMInlineAsmDialect

    Converts this type into the (usually inferred) input type.
    source§

    impl Ord for InlineAsmDialect

    source§

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

    source§

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

    source§

    fn eq(&self, other: &InlineAsmDialect) -> bool

    This method tests for self and other values to be equal, and is used by ==.
    1.0.0 · source§

    fn ne(&self, other: &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 InlineAsmDialect

    source§

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

    source§

    fn partial_cmp(&self, other: &InlineAsmDialect) -> Option<Ordering>

    This method returns an ordering between self and other values if one exists. Read more
    1.0.0 · source§

    fn lt(&self, other: &Rhs) -> bool

    This method tests less than (for self and other) and is used by the < operator. Read more
    1.0.0 · source§

    fn le(&self, other: &Rhs) -> bool

    This method tests less than or equal to (for self and other) and is used by the <= operator. Read more
    1.0.0 · source§

    fn gt(&self, other: &Rhs) -> bool

    This method tests greater than (for self and other) and is used by the > operator. Read more
    1.0.0 · source§

    fn ge(&self, other: &Rhs) -> bool

    This method tests greater than or equal to (for self and other) and is used by the >= -operator. Read more
    source§

    impl Copy for InlineAsmDialect

    source§

    impl Eq for InlineAsmDialect

    source§

    impl StructuralPartialEq for InlineAsmDialect

    Auto Trait Implementations§

    Blanket Implementations§

    source§

    impl<T> Any for T
    where +operator. Read more

    source§

    impl Copy for InlineAsmDialect

    source§

    impl Eq for InlineAsmDialect

    source§

    impl StructuralPartialEq for InlineAsmDialect

    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/inkwell/enum.IntPredicate.html b/inkwell/enum.IntPredicate.html index 5c00c1c4d..2bd957a0b 100644 --- a/inkwell/enum.IntPredicate.html +++ b/inkwell/enum.IntPredicate.html @@ -1,5 +1,5 @@ IntPredicate in inkwell - Rust
    -

    Enum inkwell::IntPredicate

    source · 
    pub enum IntPredicate {
+    
    Enum inkwell::IntPredicate
    source · 
    pub enum IntPredicate {
     EQ,
     NE,
     UGT,
@@ -21,16 +21,16 @@
 
    §
    SGE
    Signed Greater Than or Equal
    
 
    §
    SLT
    Signed Less Than
    
 
    §
    SLE
    Signed Less Than or Equal
    
-

    Trait Implementations§

    source§

    impl Clone for IntPredicate

    source§

    fn clone(&self) -> IntPredicate

    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 IntPredicate

    source§

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

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

    impl From<LLVMIntPredicate> for IntPredicate

    source§

    fn from(src: LLVMIntPredicate) -> Self

    Converts to this type from the input type.
    source§

    impl Hash for IntPredicate

    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 IntPredicate

    source§

    fn clone(&self) -> IntPredicate

    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 IntPredicate

    source§

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

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

    impl From<LLVMIntPredicate> for IntPredicate

    source§

    fn from(src: LLVMIntPredicate) -> Self

    Converts to this type from the input type.
    source§

    impl Hash for IntPredicate

    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 Into<LLVMIntPredicate> for IntPredicate

    source§

    fn into(self) -> LLVMIntPredicate

    Converts this type into the (usually inferred) input type.
    source§

    impl Ord for IntPredicate

    source§

    fn cmp(&self, other: &IntPredicate) -> 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 Into<LLVMIntPredicate> for IntPredicate

    source§

    fn into(self) -> LLVMIntPredicate

    Converts this type into the (usually inferred) input type.
    source§

    impl Ord for IntPredicate

    source§

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

    source§

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

    source§

    fn eq(&self, other: &IntPredicate) -> bool

    This method tests for self and other values to be equal, and is used by ==.
    1.0.0 · source§

    fn ne(&self, other: &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 IntPredicate

    source§

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

    source§

    fn partial_cmp(&self, other: &IntPredicate) -> Option<Ordering>

    This method returns an ordering between self and other values if one exists. Read more
    1.0.0 · source§

    fn lt(&self, other: &Rhs) -> bool

    This method tests less than (for self and other) and is used by the < operator. Read more
    1.0.0 · source§

    fn le(&self, other: &Rhs) -> bool

    This method tests less than or equal to (for self and other) and is used by the <= operator. Read more
    1.0.0 · source§

    fn gt(&self, other: &Rhs) -> bool

    This method tests greater than (for self and other) and is used by the > operator. Read more
    1.0.0 · source§

    fn ge(&self, other: &Rhs) -> bool

    This method tests greater than or equal to (for self and other) and is used by the >= -operator. Read more
    source§

    impl Copy for IntPredicate

    source§

    impl Eq for IntPredicate

    source§

    impl StructuralPartialEq for IntPredicate

    Auto Trait Implementations§

    Blanket Implementations§

    source§

    impl<T> Any for T
    where +operator. Read more

    source§

    impl Copy for IntPredicate

    source§

    impl Eq for IntPredicate

    source§

    impl StructuralPartialEq for IntPredicate

    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/inkwell/enum.OptimizationLevel.html b/inkwell/enum.OptimizationLevel.html index fbe8015e2..5d1ac1844 100644 --- a/inkwell/enum.OptimizationLevel.html +++ b/inkwell/enum.OptimizationLevel.html @@ -1,5 +1,5 @@ OptimizationLevel in inkwell - Rust
    -

    Enum inkwell::OptimizationLevel

    source · 
    #[repr(u32)]
    pub enum OptimizationLevel {
+    
    Enum inkwell::OptimizationLevel
    source · 
    #[repr(u32)]
    pub enum OptimizationLevel {
     None = 0,
     Less = 1,
     Default = 2,
@@ -7,10 +7,10 @@
 }
    Expand description
    Defines the optimization level used to compile a Module.
    
 
    §Remarks
    
 
    See also: https://llvm.org/doxygen/CodeGen_8h_source.html
    
-
    Variants§
    §
    None = 0
    §
    Less = 1
    §
    Default = 2
    §
    Aggressive = 3
    Trait Implementations§
    source§
    impl Clone for OptimizationLevel
    source§
    fn clone(&self) -> OptimizationLevel
    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 OptimizationLevel
    source§
    fn fmt(&self, f: &mut Formatter<'_>) -> Result
    Formats the value using the given formatter. Read more
    source§
    impl Default for OptimizationLevel
    source§
    fn default() -> Self
    Returns the default value for OptimizationLevel, namely OptimizationLevel::Default.
    
-
    source§
    impl From<OptimizationLevel> for LLVMCodeGenOptLevel
    source§
    fn from(value: OptimizationLevel) -> Self
    Converts to this type from the input type.
    source§
    impl PartialEq for OptimizationLevel
    source§
    fn eq(&self, other: &OptimizationLevel) -> bool
    This method tests for self and other values to be equal, and is used
+
    Variants§
    §
    None = 0
    §
    Less = 1
    §
    Default = 2
    §
    Aggressive = 3
    Trait Implementations§
    source§
    impl Clone for OptimizationLevel
    source§
    fn clone(&self) -> OptimizationLevel
    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 OptimizationLevel
    source§
    fn fmt(&self, f: &mut Formatter<'_>) -> Result
    Formats the value using the given formatter. Read more
    source§
    impl Default for OptimizationLevel
    source§
    fn default() -> Self
    Returns the default value for OptimizationLevel, namely OptimizationLevel::Default.
    
+
    source§
    impl From<OptimizationLevel> for LLVMCodeGenOptLevel
    source§
    fn from(value: OptimizationLevel) -> Self
    Converts to this type from the input type.
    source§
    impl PartialEq for OptimizationLevel
    source§
    fn eq(&self, other: &OptimizationLevel) -> bool
    This method tests for self and other values to be equal, and is used
 by ==.
    1.0.0 · source§
    fn ne(&self, other: &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 OptimizationLevel
    source§
    impl Eq for OptimizationLevel
    source§
    impl StructuralPartialEq for OptimizationLevel
    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 OptimizationLevel
    source§
    impl Eq for OptimizationLevel
    source§
    impl StructuralPartialEq for OptimizationLevel
    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/inkwell/enum.ThreadLocalMode.html b/inkwell/enum.ThreadLocalMode.html
index bf23cc663..1c049cc22 100644
--- a/inkwell/enum.ThreadLocalMode.html
+++ b/inkwell/enum.ThreadLocalMode.html
@@ -1,12 +1,12 @@
 ThreadLocalMode in inkwell - Rust
    
-    
    Enum inkwell::ThreadLocalMode
    source · 
    pub enum ThreadLocalMode {
+    
    Enum inkwell::ThreadLocalMode
    source · 
    pub enum ThreadLocalMode {
     GeneralDynamicTLSModel,
     LocalDynamicTLSModel,
     InitialExecTLSModel,
     LocalExecTLSModel,
-}
    Variants§
    §
    GeneralDynamicTLSModel
    §
    LocalDynamicTLSModel
    §
    InitialExecTLSModel
    §
    LocalExecTLSModel
    Trait Implementations§
    source§
    impl Clone for ThreadLocalMode
    source§
    fn clone(&self) -> ThreadLocalMode
    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 ThreadLocalMode
    source§
    fn fmt(&self, f: &mut Formatter<'_>) -> Result
    Formats the value using the given formatter. Read more
    source§
    impl PartialEq for ThreadLocalMode
    source§
    fn eq(&self, other: &ThreadLocalMode) -> bool
    This method tests for self and other values to be equal, and is used
+}
    Variants§
    §
    GeneralDynamicTLSModel
    §
    LocalDynamicTLSModel
    §
    InitialExecTLSModel
    §
    LocalExecTLSModel
    Trait Implementations§
    source§
    impl Clone for ThreadLocalMode
    source§
    fn clone(&self) -> ThreadLocalMode
    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 ThreadLocalMode
    source§
    fn fmt(&self, f: &mut Formatter<'_>) -> Result
    Formats the value using the given formatter. Read more
    source§
    impl PartialEq for ThreadLocalMode
    source§
    fn eq(&self, other: &ThreadLocalMode) -> bool
    This method tests for self and other values to be equal, and is used
 by ==.
    1.0.0 · source§
    fn ne(&self, other: &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 ThreadLocalMode
    source§
    impl Eq for ThreadLocalMode
    source§
    impl StructuralPartialEq for ThreadLocalMode
    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 ThreadLocalMode
    source§
    impl Eq for ThreadLocalMode
    source§
    impl StructuralPartialEq for ThreadLocalMode
    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/inkwell/index.html b/inkwell/index.html
index 02050f274..7e2ea49ef 100644
--- a/inkwell/index.html
+++ b/inkwell/index.html
@@ -1,6 +1,6 @@
 inkwell - Rust
    
-    
    Crate inkwell
    source · 
    Expand description
    Inkwell documentation is a work in progress.
    
+    
    Crate inkwell
    source · 
    Expand description
    Inkwell documentation is a work in progress.
    
 
    If you have any LLVM knowledge that could be used to improve these docs, we would greatly appreciate you opening an issue and/or a pull request on our GitHub page.
    
 
    Due to a rustdoc issue, this documentation represents only the latest supported LLVM version. We hope that this issue will be resolved in the future so that multiple versions can be documented side by side.
    
 
    §Library Wide Notes
    
diff --git a/inkwell/memory_buffer/index.html b/inkwell/memory_buffer/index.html
index e12892a95..0f89d51e2 100644
--- a/inkwell/memory_buffer/index.html
+++ b/inkwell/memory_buffer/index.html
@@ -1,2 +1,2 @@
 inkwell::memory_buffer - Rust
    
-    
    Module inkwell::memory_buffer
    source · 
    Structs§
    
\ No newline at end of file
+    
    Module inkwell::memory_buffer
    source · 
    Structs§
    
\ No newline at end of file
diff --git a/inkwell/memory_buffer/struct.MemoryBuffer.html b/inkwell/memory_buffer/struct.MemoryBuffer.html
index 62bf8c4e6..92edd2717 100644
--- a/inkwell/memory_buffer/struct.MemoryBuffer.html
+++ b/inkwell/memory_buffer/struct.MemoryBuffer.html
@@ -1,16 +1,16 @@
 MemoryBuffer in inkwell::memory_buffer - Rust
    
-    
    Struct inkwell::memory_buffer::MemoryBuffer
    source · 
    pub struct MemoryBuffer { /* private fields */ }
    Implementations§
    source§
    impl MemoryBuffer
    source
    pub unsafe fn new(memory_buffer: LLVMMemoryBufferRef) -> Self
    source
    pub fn as_mut_ptr(&self) -> LLVMMemoryBufferRef
    source
    pub fn create_from_file(path: &Path) -> Result<Self, LLVMString>
    source
    pub fn create_from_stdin() -> Result<Self, LLVMString>
    source
    pub fn create_from_memory_range(input: &[u8], name: &str) -> Self
    This function is likely slightly cheaper than create_from_memory_range_copy since it intentionally
+    
    Struct inkwell::memory_buffer::MemoryBuffer
    source · 
    pub struct MemoryBuffer { /* private fields */ }
    Implementations§
    source§
    impl MemoryBuffer
    source
    pub unsafe fn new(memory_buffer: LLVMMemoryBufferRef) -> Self
    source
    pub fn as_mut_ptr(&self) -> LLVMMemoryBufferRef
    source
    pub fn create_from_file(path: &Path) -> Result<Self, LLVMString>
    source
    pub fn create_from_stdin() -> Result<Self, LLVMString>
    source
    pub fn create_from_memory_range(input: &[u8], name: &str) -> Self
    This function is likely slightly cheaper than create_from_memory_range_copy since it intentionally
 leaks data to LLVM so that it doesn’t have to reallocate. create_from_memory_range_copy may be removed
 in the future
    
-
    source
    pub fn create_from_memory_range_copy(input: &[u8], name: &str) -> Self
    This will create a new MemoryBuffer from the given input.
    
+
    source
    pub fn create_from_memory_range_copy(input: &[u8], name: &str) -> Self
    This will create a new MemoryBuffer from the given input.
    
 
    This function is likely slightly more expensive than create_from_memory_range since it does not leak
 data to LLVM, forcing LLVM to make a copy. This function may be removed in the future in favor of
 create_from_memory_range
    
-
    source
    pub fn as_slice(&self) -> &[u8] ⓘ
    Gets a byte slice of this MemoryBuffer.
    
-
    source
    pub fn get_size(&self) -> usize
    Gets the byte size of this MemoryBuffer.
    
-
    source
    pub fn create_object_file(self) -> Result<ObjectFile, ()>
    Convert this MemoryBuffer into an ObjectFile. LLVM does not currently
+
    source
    pub fn as_slice(&self) -> &[u8] ⓘ
    Gets a byte slice of this MemoryBuffer.
    
+
    source
    pub fn get_size(&self) -> usize
    Gets the byte size of this MemoryBuffer.
    
+
    source
    pub fn create_object_file(self) -> Result<ObjectFile, ()>
    Convert this MemoryBuffer into an ObjectFile. LLVM does not currently
 provide any way to determine the cause of error if conversion fails.
    
-
    Trait Implementations§
    source§
    impl Debug for MemoryBuffer
    source§
    fn fmt(&self, f: &mut Formatter<'_>) -> Result
    Formats the value using the given formatter. Read more
    source§
    impl Drop for MemoryBuffer
    source§
    fn drop(&mut self)
    Executes the destructor for this type. Read more
    Auto Trait Implementations§
    Blanket Implementations§
    source§
    impl<T> Any for T
    where
+
    Trait Implementations§
    source§
    impl Debug for MemoryBuffer
    source§
    fn fmt(&self, f: &mut Formatter<'_>) -> Result
    Formats the value using the given formatter. Read more
    source§
    impl Drop for MemoryBuffer
    source§
    fn drop(&mut self)
    Executes the destructor for 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/inkwell/module/enum.FlagBehavior.html b/inkwell/module/enum.FlagBehavior.html
index 58dc0ec00..4942efc1b 100644
--- a/inkwell/module/enum.FlagBehavior.html
+++ b/inkwell/module/enum.FlagBehavior.html
@@ -1,5 +1,5 @@
 FlagBehavior in inkwell::module - Rust
    
-    
    Enum inkwell::module::FlagBehavior
    source · 
    pub enum FlagBehavior {
+    
    Enum inkwell::module::FlagBehavior
    source · 
    pub enum FlagBehavior {
     Error,
     Warning,
     Require,
@@ -22,16 +22,16 @@ both modules specify Override, but the values differ, an error
 
    §
    Append
    Appends the two values, which are required to be metadata nodes.
    
 
    §
    AppendUnique
    Appends the two values, which are required to be metadata nodes. However, duplicate
 entries in the second list are dropped during the append operation.
    
-
    Trait Implementations§
    source§
    impl Clone for FlagBehavior
    source§
    fn clone(&self) -> FlagBehavior
    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 FlagBehavior
    source§
    fn fmt(&self, f: &mut Formatter<'_>) -> Result
    Formats the value using the given formatter. Read more
    source§
    impl From<LLVMModuleFlagBehavior> for FlagBehavior
    source§
    fn from(src: LLVMModuleFlagBehavior) -> Self
    Converts to this type from the input type.
    source§
    impl Hash for FlagBehavior
    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 FlagBehavior
    source§
    fn clone(&self) -> FlagBehavior
    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 FlagBehavior
    source§
    fn fmt(&self, f: &mut Formatter<'_>) -> Result
    Formats the value using the given formatter. Read more
    source§
    impl From<LLVMModuleFlagBehavior> for FlagBehavior
    source§
    fn from(src: LLVMModuleFlagBehavior) -> Self
    Converts to this type from the input type.
    source§
    impl Hash for FlagBehavior
    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 Into<LLVMModuleFlagBehavior> for FlagBehavior
    source§
    fn into(self) -> LLVMModuleFlagBehavior
    Converts this type into the (usually inferred) input type.
    source§
    impl Ord for FlagBehavior
    source§
    fn cmp(&self, other: &FlagBehavior) -> 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 Into<LLVMModuleFlagBehavior> for FlagBehavior
    source§
    fn into(self) -> LLVMModuleFlagBehavior
    Converts this type into the (usually inferred) input type.
    source§
    impl Ord for FlagBehavior
    source§
    fn cmp(&self, other: &FlagBehavior) -> 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 FlagBehavior
    source§
    fn eq(&self, other: &FlagBehavior) -> 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 FlagBehavior
    source§
    fn eq(&self, other: &FlagBehavior) -> bool
    This method tests for self and other values to be equal, and is used
 by ==.
    1.0.0 · source§
    fn ne(&self, other: &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 FlagBehavior
    source§
    fn partial_cmp(&self, other: &FlagBehavior) -> 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 FlagBehavior
    source§
    fn partial_cmp(&self, other: &FlagBehavior) -> Option<Ordering>
    This method returns an ordering between self and other values if one exists. Read more
    1.0.0 · source§
    fn lt(&self, other: &Rhs) -> bool
    This method tests less than (for self and other) and is used by the < operator. Read more
    1.0.0 · source§
    fn le(&self, other: &Rhs) -> bool
    This method tests less than or equal to (for self and other) and is used by the <=
 operator. Read more
    1.0.0 · source§
    fn gt(&self, other: &Rhs) -> bool
    This method tests greater than (for self and other) and is used by the > operator. Read more
    1.0.0 · source§
    fn ge(&self, other: &Rhs) -> bool
    This method tests greater than or equal to (for self and other) and is used by the >=
-operator. Read more
    source§
    impl Copy for FlagBehavior
    source§
    impl Eq for FlagBehavior
    source§
    impl StructuralPartialEq for FlagBehavior
    Auto Trait Implementations§
    Blanket Implementations§
    source§
    impl<T> Any for T
    where
+operator. Read more
    source§
    impl Copy for FlagBehavior
    source§
    impl Eq for FlagBehavior
    source§
    impl StructuralPartialEq for FlagBehavior
    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/inkwell/module/index.html b/inkwell/module/index.html
index 42ccb3a1f..4ebb03098 100644
--- a/inkwell/module/index.html
+++ b/inkwell/module/index.html
@@ -1,5 +1,5 @@
 inkwell::module - Rust
    
-    
    Module inkwell::module
    source · 
    Expand description
    A Module represents a single code compilation unit.
    
+    
    Module inkwell::module
    source · 
    Expand description
    A Module represents a single code compilation unit.
    
 
    Structs§
    • FunctionIterator
      Iterate over all FunctionValues in an llvm module
    • GlobalIterator
      Iterate over all GlobalValues in an llvm module
    • Module
      Represents a reference to an LLVM Module.
 The underlying module will be disposed when dropping this object.
    Enums§
    -
    source

    pub fn get_global_metadata_size(&self, key: &str) -> u32

    Obtains the number of MetaDataValues indexed by a particular key.

    +
    source

    pub fn get_global_metadata_size(&self, key: &str) -> u32

    Obtains the number of MetaDataValues indexed by a particular key.

    §Example
    use inkwell::context::Context;
 
@@ -356,7 +356,7 @@ module.add_global_metadata("my_md", assert_eq!(md_0[0].into_metadata_value().get_string_value(), md_string.get_string_value());
 assert_eq!(md_1[0].into_int_value(), bool_val);
 assert_eq!(md_1[1].into_float_value(), f32_val);
    -
    source

    pub fn get_global_metadata(&self, key: &str) -> Vec<MetadataValue<'ctx>>

    Obtains the global MetaDataValue node indexed by key, which may contain 1 string or multiple values as its get_node_values()

    +
    source

    pub fn get_global_metadata(&self, key: &str) -> Vec<MetadataValue<'ctx>>

    Obtains the global MetaDataValue node indexed by key, which may contain 1 string or multiple values as its get_node_values()

    §Example
    use inkwell::context::Context;
 
@@ -388,7 +388,7 @@ module.add_global_metadata("my_md", assert_eq!(md_0[0].into_metadata_value().get_string_value(), md_string.get_string_value());
 assert_eq!(md_1[0].into_int_value(), bool_val);
 assert_eq!(md_1[1].into_float_value(), f32_val);
    -
    source

    pub fn get_first_global(&self) -> Option<GlobalValue<'ctx>>

    Gets the first GlobalValue in a module.

    +
    source

    pub fn get_first_global(&self) -> Option<GlobalValue<'ctx>>

    Gets the first GlobalValue in a module.

    §Example
    use inkwell::AddressSpace;
 use inkwell::context::Context;
@@ -402,7 +402,7 @@ module.add_global_metadata("my_md", let global = module.add_global(i8_type, Some(AddressSpace::from(4u16)), "my_global");
 
 assert_eq!(module.get_first_global().unwrap(), global);
    -
    source

    pub fn get_last_global(&self) -> Option<GlobalValue<'ctx>>

    Gets the last GlobalValue in a module.

    +
    source

    pub fn get_last_global(&self) -> Option<GlobalValue<'ctx>>

    Gets the last GlobalValue in a module.

    §Example
    use inkwell::AddressSpace;
 use inkwell::context::Context;
@@ -416,7 +416,7 @@ module.add_global_metadata("my_md", let global = module.add_global(i8_type, Some(AddressSpace::from(4u16)), "my_global");
 
 assert_eq!(module.get_last_global().unwrap(), global);
    -
    source

    pub fn get_global(&self, name: &str) -> Option<GlobalValue<'ctx>>

    Gets a named GlobalValue in a module.

    +
    source

    pub fn get_global(&self, name: &str) -> Option<GlobalValue<'ctx>>

    Gets a named GlobalValue in a module.

    §Example
    use inkwell::AddressSpace;
 use inkwell::context::Context;
@@ -430,8 +430,8 @@ module.add_global_metadata("my_md", let global = module.add_global(i8_type, Some(AddressSpace::from(4u16)), "my_global");
 
 assert_eq!(module.get_global("my_global").unwrap(), global);
    -
    source

    pub fn get_globals(&self) -> GlobalIterator<'ctx> ⓘ

    An iterator over the globals in this Module.

    -
    source

    pub fn parse_bitcode_from_buffer( +

    source

    pub fn get_globals(&self) -> GlobalIterator<'ctx> ⓘ

    An iterator over the globals in this Module.

    +
    source

    pub fn parse_bitcode_from_buffer( buffer: &MemoryBuffer, context: impl AsContextRef<'ctx> ) -> Result<Self, LLVMString>

    Creates a new Module from a MemoryBuffer with bitcode.

    @@ -448,7 +448,7 @@ module.add_global_metadata("my_md", assert_eq!(module.unwrap().get_context(), context);
    -
    source

    pub fn parse_bitcode_from_path<P: AsRef<Path>>( +

    source

    pub fn parse_bitcode_from_path<P: AsRef<Path>>( path: P, context: impl AsContextRef<'ctx> ) -> Result<Self, LLVMString>

    A convenience function for creating a Module from a bitcode file for a given context.

    @@ -463,7 +463,7 @@ module.add_global_metadata("my_md", assert_eq!(module.unwrap().get_context(), context);
    -
    source

    pub fn get_name(&self) -> &CStr

    Gets the name of this Module.

    +
    source

    pub fn get_name(&self) -> &CStr

    Gets the name of this Module.

    §Example
    use inkwell::context::Context;
 
@@ -471,7 +471,7 @@ module.add_global_metadata("my_md", let module = context.create_module("my_module");
 
 assert_eq!(module.get_name().to_str(), Ok("my_mdoule"));
    -
    source

    pub fn set_name(&self, name: &str)

    Assigns the name of this Module.

    +
    source

    pub fn set_name(&self, name: &str)

    Assigns the name of this Module.

    §Example
    use inkwell::context::Context;
 
@@ -481,7 +481,7 @@ module.add_global_metadata("my_md", "my_module2");
 
 assert_eq!(module.get_name().to_str(), Ok("my_module2"));
    -
    source

    pub fn get_source_file_name(&self) -> &CStr

    Gets the source file name. It defaults to the module identifier but is separate from it.

    +
    source

    pub fn get_source_file_name(&self) -> &CStr

    Gets the source file name. It defaults to the module identifier but is separate from it.

    §Example
    use inkwell::context::Context;
 
@@ -494,7 +494,7 @@ module.set_source_file_name("my_mod.rs");
 
 assert_eq!(module.get_name().to_str(), Ok("my_mod"));
 assert_eq!(module.get_source_file_name().to_str(), Ok("my_mod.rs"));
    -
    source

    pub fn set_source_file_name(&self, file_name: &str)

    Sets the source file name. It defaults to the module identifier but is separate from it.

    +
    source

    pub fn set_source_file_name(&self, file_name: &str)

    Sets the source file name. It defaults to the module identifier but is separate from it.

    §Example
    use inkwell::context::Context;
 
@@ -507,7 +507,7 @@ module.set_source_file_name("my_mod.rs");
 
 assert_eq!(module.get_name().to_str(), Ok("my_mod"));
 assert_eq!(module.get_source_file_name().to_str(), Ok("my_mod.rs"));
    -

    Links one module into another. This will merge two Modules into one.

    +

    Links one module into another. This will merge two Modules into one.

    §Example
    use inkwell::context::Context;
 
@@ -516,28 +516,28 @@ module.set_source_file_name("my_mod.rs");
 let module2 = context.create_module("mod2");
 
 assert!(module.link_in_module(module2).is_ok());
    -
    source

    pub fn get_or_insert_comdat(&self, name: &str) -> Comdat

    Gets the Comdat associated with a particular name. If it does not exist, it will be created. +

    source

    pub fn get_or_insert_comdat(&self, name: &str) -> Comdat

    Gets the Comdat associated with a particular name. If it does not exist, it will be created. A new Comdat defaults to a kind of ComdatSelectionKind::Any.

    -
    source

    pub fn get_flag(&self, key: &str) -> Option<MetadataValue<'ctx>>

    Gets the MetadataValue flag associated with the key in this module, if any. +

    source

    pub fn get_flag(&self, key: &str) -> Option<MetadataValue<'ctx>>

    Gets the MetadataValue flag associated with the key in this module, if any. If a BasicValue was used to create this flag, it will be wrapped in a MetadataValue when returned from this function.

    -
    source

    pub fn add_metadata_flag( +

    source

    pub fn add_metadata_flag( &self, key: &str, behavior: FlagBehavior, flag: MetadataValue<'ctx> )

    Append a MetadataValue as a module wide flag. Note that using the same key twice will likely invalidate the module.

    -
    source

    pub fn add_basic_value_flag<BV: BasicValue<'ctx>>( +

    source

    pub fn add_basic_value_flag<BV: BasicValue<'ctx>>( &self, key: &str, behavior: FlagBehavior, flag: BV )

    Append a BasicValue as a module wide flag. Note that using the same key twice will likely invalidate the module.

    -
    source

    pub fn strip_debug_info(&self) -> bool

    Strips and debug info from the module, if it exists.

    -
    source

    pub fn get_debug_metadata_version(&self) -> c_uint

    Gets the version of debug metadata contained in this Module.

    -
    source

    pub fn create_debug_info_builder( +

    source

    pub fn strip_debug_info(&self) -> bool

    Strips and debug info from the module, if it exists.

    +
    source

    pub fn get_debug_metadata_version(&self) -> c_uint

    Gets the version of debug metadata contained in this Module.

    +
    source

    pub fn create_debug_info_builder( &self, allow_unresolved: bool, language: DWARFSourceLanguage, @@ -555,7 +555,7 @@ will likely invalidate the module.

    sysroot: &str, sdk: &str ) -> (DebugInfoBuilder<'ctx>, DICompileUnit<'ctx>)

    Creates a DebugInfoBuilder for this Module.

    -
    source

    pub fn run_passes( +

    source

    pub fn run_passes( &self, passes: &str, machine: &TargetMachine, @@ -566,7 +566,7 @@ The format of this string is the same as opt’s -passes argument for the new pa Individual passes may be specified, separated by commas. Full pipelines may also be invoked using default and friends. See opt for full reference of the Passes format.

    -

    Trait Implementations§

    source§

    impl Clone for Module<'_>

    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<'ctx> Debug for Module<'ctx>

    source§

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

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

    impl Drop for Module<'_>

    source§

    fn drop(&mut self)

    Executes the destructor for this type. Read more
    source§

    impl<'ctx> PartialEq for Module<'ctx>

    source§

    fn eq(&self, other: &Module<'ctx>) -> bool

    This method tests for self and other values to be equal, and is used +

    Trait Implementations§

    source§

    impl Clone for Module<'_>

    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<'ctx> Debug for Module<'ctx>

    source§

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

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

    impl Drop for Module<'_>

    source§

    fn drop(&mut self)

    Executes the destructor for this type. Read more
    source§

    impl<'ctx> PartialEq for Module<'ctx>

    source§

    fn eq(&self, other: &Module<'ctx>) -> bool

    This method tests for self and other values to be equal, and is used by ==.
    1.0.0 · source§

    fn ne(&self, other: &Rhs) -> bool

    This method tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.
    source§

    impl PassManagerSubType for Module<'_>

    §

    type Input = ()

    source§

    unsafe fn create<I: Borrow<Self::Input>>(_: I) -> LLVMPassManagerRef

    source§

    unsafe fn run_in_pass_manager(&self, pass_manager: &PassManager<Self>) -> bool

    source§

    impl<'ctx> Eq for Module<'ctx>

    source§

    impl<'ctx> StructuralPartialEq for Module<'ctx>

    Auto Trait Implementations§

    §

    impl<'ctx> !Freeze for Module<'ctx>

    §

    impl<'ctx> !RefUnwindSafe for Module<'ctx>

    §

    impl<'ctx> !Send for Module<'ctx>

    §

    impl<'ctx> !Sync for Module<'ctx>

    §

    impl<'ctx> Unpin for Module<'ctx>

    §

    impl<'ctx> UnwindSafe for Module<'ctx>

    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/inkwell/object_file/index.html b/inkwell/object_file/index.html index 5c0da7e4d..c564dbff1 100644 --- a/inkwell/object_file/index.html +++ b/inkwell/object_file/index.html @@ -1,2 +1,2 @@ inkwell::object_file - Rust
    -

    Module inkwell::object_file

    source ·

    Structs§

    \ No newline at end of file +

    Module inkwell::object_file

    source ·

    Structs§

    \ No newline at end of file diff --git a/inkwell/object_file/struct.ObjectFile.html b/inkwell/object_file/struct.ObjectFile.html index bde564771..8fc609560 100644 --- a/inkwell/object_file/struct.ObjectFile.html +++ b/inkwell/object_file/struct.ObjectFile.html @@ -1,5 +1,5 @@ ObjectFile in inkwell::object_file - Rust
    -

    Struct inkwell::object_file::ObjectFile

    source · 
    pub struct ObjectFile { /* private fields */ }

    Implementations§

    source§

    impl ObjectFile

    source

    pub unsafe fn new(object_file: LLVMObjectFileRef) -> Self

    source

    pub fn as_mut_ptr(&self) -> LLVMObjectFileRef

    source

    pub fn get_sections(&self) -> SectionIterator ⓘ

    source

    pub fn get_symbols(&self) -> SymbolIterator ⓘ

    Trait Implementations§

    source§

    impl Debug for ObjectFile

    source§

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

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

    impl Drop for ObjectFile

    source§

    fn drop(&mut self)

    Executes the destructor for this type. Read more

    Auto Trait Implementations§

    Blanket Implementations§

    source§

    impl<T> Any for T
    where +

    Struct inkwell::object_file::ObjectFile

    source · 
    pub struct ObjectFile { /* private fields */ }

    Implementations§

    source§

    impl ObjectFile

    source

    pub unsafe fn new(object_file: LLVMObjectFileRef) -> Self

    source

    pub fn as_mut_ptr(&self) -> LLVMObjectFileRef

    source

    pub fn get_sections(&self) -> SectionIterator ⓘ

    source

    pub fn get_symbols(&self) -> SymbolIterator ⓘ

    Trait Implementations§

    source§

    impl Debug for ObjectFile

    source§

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

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

    impl Drop for ObjectFile

    source§

    fn drop(&mut self)

    Executes the destructor for 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/inkwell/object_file/struct.Relocation.html b/inkwell/object_file/struct.Relocation.html index 6503abbaa..cc7d9548a 100644 --- a/inkwell/object_file/struct.Relocation.html +++ b/inkwell/object_file/struct.Relocation.html @@ -1,8 +1,8 @@ Relocation in inkwell::object_file - Rust
    -

    Struct inkwell::object_file::Relocation

    source · 
    pub struct Relocation { /* private fields */ }

    Implementations§

    source§

    impl Relocation

    source

    pub unsafe fn new( +

    Struct inkwell::object_file::Relocation

    source · 
    pub struct Relocation { /* private fields */ }

    Implementations§

    source§

    impl Relocation

    source

    pub unsafe fn new( relocation: LLVMRelocationIteratorRef, object_file: LLVMObjectFileRef -) -> Self

    source

    pub fn as_mut_ptr(&self) -> (LLVMRelocationIteratorRef, LLVMObjectFileRef)

    source

    pub fn get_offset(&self) -> u64

    source

    pub fn get_symbols(&self) -> SymbolIterator ⓘ

    source

    pub fn get_type(&self) -> (u64, &CStr)

    source

    pub fn get_value(&self) -> &CStr

    Trait Implementations§

    source§

    impl Debug for Relocation

    source§

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

    Formats the value using the given formatter. Read more

    Auto Trait Implementations§

    Blanket Implementations§

    source§

    impl<T> Any for T
    where +) -> Self

    source

    pub fn as_mut_ptr(&self) -> (LLVMRelocationIteratorRef, LLVMObjectFileRef)

    source

    pub fn get_offset(&self) -> u64

    source

    pub fn get_symbols(&self) -> SymbolIterator ⓘ

    source

    pub fn get_type(&self) -> (u64, &CStr)

    source

    pub fn get_value(&self) -> &CStr

    Trait Implementations§

    source§

    impl Debug for Relocation

    source§

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

    Formats the value using the given formatter. 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/inkwell/object_file/struct.RelocationIterator.html b/inkwell/object_file/struct.RelocationIterator.html index 0f668da7c..bd4a3a9d8 100644 --- a/inkwell/object_file/struct.RelocationIterator.html +++ b/inkwell/object_file/struct.RelocationIterator.html @@ -1,11 +1,11 @@ RelocationIterator in inkwell::object_file - Rust
    -

    Struct inkwell::object_file::RelocationIterator

    source · 
    pub struct RelocationIterator { /* private fields */ }

    Implementations§

    source§

    impl RelocationIterator

    source

    pub unsafe fn new( +

    Struct inkwell::object_file::RelocationIterator

    source · 
    pub struct RelocationIterator { /* private fields */ }

    Implementations§

    source§

    impl RelocationIterator

    source

    pub unsafe fn new( relocation_iterator: LLVMRelocationIteratorRef, section_iterator: LLVMSectionIteratorRef, object_file: LLVMObjectFileRef -) -> Self

    source

    pub fn as_mut_ptr( +) -> Self

    source

    pub fn as_mut_ptr( &self -) -> (LLVMRelocationIteratorRef, LLVMSectionIteratorRef, LLVMObjectFileRef)

    Trait Implementations§

    source§

    impl Debug for RelocationIterator

    source§

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

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

    impl Drop for RelocationIterator

    source§

    fn drop(&mut self)

    Executes the destructor for this type. Read more
    source§

    impl Iterator for RelocationIterator

    §

    type Item = Relocation

    The type of the elements being iterated over.
    source§

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

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

    fn next_chunk<const N: usize>( +) -> (LLVMRelocationIteratorRef, LLVMSectionIteratorRef, LLVMObjectFileRef)

    Trait Implementations§

    source§

    impl Debug for RelocationIterator

    source§

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

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

    impl Drop for RelocationIterator

    source§

    fn drop(&mut self)

    Executes the destructor for this type. Read more
    source§

    impl Iterator for RelocationIterator

    §

    type Item = Relocation

    The type of the elements being iterated over.
    source§

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

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

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

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

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

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

    fn count(self) -> usize
    where diff --git a/inkwell/object_file/struct.Section.html b/inkwell/object_file/struct.Section.html index 6f32b4138..50ef54050 100644 --- a/inkwell/object_file/struct.Section.html +++ b/inkwell/object_file/struct.Section.html @@ -1,8 +1,8 @@ Section in inkwell::object_file - Rust
    -

    Struct inkwell::object_file::Section

    source · 
    pub struct Section { /* private fields */ }

    Implementations§

    source§

    impl Section

    source

    pub unsafe fn new( +

    Struct inkwell::object_file::Section

    source · 
    pub struct Section { /* private fields */ }

    Implementations§

    source§

    impl Section

    source

    pub unsafe fn new( section: LLVMSectionIteratorRef, object_file: LLVMObjectFileRef -) -> Self

    source

    pub unsafe fn as_mut_ptr(&self) -> (LLVMSectionIteratorRef, LLVMObjectFileRef)

    source

    pub fn get_name(&self) -> Option<&CStr>

    source

    pub fn size(&self) -> u64

    source

    pub fn get_contents(&self) -> &[u8] ⓘ

    source

    pub fn get_address(&self) -> u64

    source

    pub fn get_relocations(&self) -> RelocationIterator ⓘ

    Trait Implementations§

    source§

    impl Debug for Section

    source§

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

    Formats the value using the given formatter. Read more

    Auto Trait Implementations§

    Blanket Implementations§

    source§

    impl<T> Any for T
    where +) -> Self

    source

    pub unsafe fn as_mut_ptr(&self) -> (LLVMSectionIteratorRef, LLVMObjectFileRef)

    source

    pub fn get_name(&self) -> Option<&CStr>

    source

    pub fn size(&self) -> u64

    source

    pub fn get_contents(&self) -> &[u8] ⓘ

    source

    pub fn get_address(&self) -> u64

    source

    pub fn get_relocations(&self) -> RelocationIterator ⓘ

    Trait Implementations§

    source§

    impl Debug for Section

    source§

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

    Formats the value using the given formatter. 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/inkwell/object_file/struct.SectionIterator.html b/inkwell/object_file/struct.SectionIterator.html index 003aff747..4c31ef869 100644 --- a/inkwell/object_file/struct.SectionIterator.html +++ b/inkwell/object_file/struct.SectionIterator.html @@ -1,8 +1,8 @@ SectionIterator in inkwell::object_file - Rust
    -

    Struct inkwell::object_file::SectionIterator

    source · 
    pub struct SectionIterator { /* private fields */ }

    Implementations§

    source§

    impl SectionIterator

    source

    pub unsafe fn new( +

    Struct inkwell::object_file::SectionIterator

    source · 
    pub struct SectionIterator { /* private fields */ }

    Implementations§

    source§

    impl SectionIterator

    source

    pub unsafe fn new( section_iterator: LLVMSectionIteratorRef, object_file: LLVMObjectFileRef -) -> Self

    source

    pub fn as_mut_ptr(&self) -> (LLVMSectionIteratorRef, LLVMObjectFileRef)

    Trait Implementations§

    source§

    impl Debug for SectionIterator

    source§

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

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

    impl Drop for SectionIterator

    source§

    fn drop(&mut self)

    Executes the destructor for this type. Read more
    source§

    impl Iterator for SectionIterator

    §

    type Item = Section

    The type of the elements being iterated over.
    source§

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

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

    fn next_chunk<const N: usize>( +) -> Self

    source

    pub fn as_mut_ptr(&self) -> (LLVMSectionIteratorRef, LLVMObjectFileRef)

    Trait Implementations§

    source§

    impl Debug for SectionIterator

    source§

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

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

    impl Drop for SectionIterator

    source§

    fn drop(&mut self)

    Executes the destructor for this type. Read more
    source§

    impl Iterator for SectionIterator

    §

    type Item = Section

    The type of the elements being iterated over.
    source§

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

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

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

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

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

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

    fn count(self) -> usize
    where diff --git a/inkwell/object_file/struct.Symbol.html b/inkwell/object_file/struct.Symbol.html index f124ab22f..76e9858e3 100644 --- a/inkwell/object_file/struct.Symbol.html +++ b/inkwell/object_file/struct.Symbol.html @@ -1,5 +1,5 @@ Symbol in inkwell::object_file - Rust
    -

    Struct inkwell::object_file::Symbol

    source · 
    pub struct Symbol { /* private fields */ }

    Implementations§

    source§

    impl Symbol

    source

    pub unsafe fn new(symbol: LLVMSymbolIteratorRef) -> Self

    source

    pub fn as_mut_ptr(&self) -> LLVMSymbolIteratorRef

    source

    pub fn get_name(&self) -> Option<&CStr>

    source

    pub fn size(&self) -> u64

    source

    pub fn get_address(&self) -> u64

    Trait Implementations§

    source§

    impl Debug for Symbol

    source§

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

    Formats the value using the given formatter. Read more

    Auto Trait Implementations§

    §

    impl Freeze for Symbol

    §

    impl RefUnwindSafe for Symbol

    §

    impl !Send for Symbol

    §

    impl !Sync for Symbol

    §

    impl Unpin for Symbol

    §

    impl UnwindSafe for Symbol

    Blanket Implementations§

    source§

    impl<T> Any for T
    where +

    Struct inkwell::object_file::Symbol

    source · 
    pub struct Symbol { /* private fields */ }

    Implementations§

    source§

    impl Symbol

    source

    pub unsafe fn new(symbol: LLVMSymbolIteratorRef) -> Self

    source

    pub fn as_mut_ptr(&self) -> LLVMSymbolIteratorRef

    source

    pub fn get_name(&self) -> Option<&CStr>

    source

    pub fn size(&self) -> u64

    source

    pub fn get_address(&self) -> u64

    Trait Implementations§

    source§

    impl Debug for Symbol

    source§

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

    Formats the value using the given formatter. Read more

    Auto Trait Implementations§

    §

    impl Freeze for Symbol

    §

    impl RefUnwindSafe for Symbol

    §

    impl !Send for Symbol

    §

    impl !Sync for Symbol

    §

    impl Unpin for Symbol

    §

    impl UnwindSafe for Symbol

    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/inkwell/object_file/struct.SymbolIterator.html b/inkwell/object_file/struct.SymbolIterator.html index 48c386eb2..df90fdd7b 100644 --- a/inkwell/object_file/struct.SymbolIterator.html +++ b/inkwell/object_file/struct.SymbolIterator.html @@ -1,8 +1,8 @@ SymbolIterator in inkwell::object_file - Rust
    -

    Struct inkwell::object_file::SymbolIterator

    source · 
    pub struct SymbolIterator { /* private fields */ }

    Implementations§

    source§

    impl SymbolIterator

    source

    pub unsafe fn new( +

    Struct inkwell::object_file::SymbolIterator

    source · 
    pub struct SymbolIterator { /* private fields */ }

    Implementations§

    source§

    impl SymbolIterator

    source

    pub unsafe fn new( symbol_iterator: LLVMSymbolIteratorRef, object_file: LLVMObjectFileRef -) -> Self

    source

    pub fn as_mut_ptr(&self) -> (LLVMSymbolIteratorRef, LLVMObjectFileRef)

    Trait Implementations§

    source§

    impl Debug for SymbolIterator

    source§

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

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

    impl Drop for SymbolIterator

    source§

    fn drop(&mut self)

    Executes the destructor for this type. Read more
    source§

    impl Iterator for SymbolIterator

    §

    type Item = Symbol

    The type of the elements being iterated over.
    source§

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

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

    fn next_chunk<const N: usize>( +) -> Self

    source

    pub fn as_mut_ptr(&self) -> (LLVMSymbolIteratorRef, LLVMObjectFileRef)

    Trait Implementations§

    source§

    impl Debug for SymbolIterator

    source§

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

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

    impl Drop for SymbolIterator

    source§

    fn drop(&mut self)

    Executes the destructor for this type. Read more
    source§

    impl Iterator for SymbolIterator

    §

    type Item = Symbol

    The type of the elements being iterated over.
    source§

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

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

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

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

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

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

    fn count(self) -> usize
    where diff --git a/inkwell/struct.AddressSpace.html b/inkwell/struct.AddressSpace.html index 454d69e8e..a137e391e 100644 --- a/inkwell/struct.AddressSpace.html +++ b/inkwell/struct.AddressSpace.html @@ -1,5 +1,5 @@ AddressSpace in inkwell - Rust
    -

    Struct inkwell::AddressSpace

    source · 
    pub struct AddressSpace(/* private fields */);
    Expand description

    Defines the address space in which a global will be inserted.

    +

    Struct inkwell::AddressSpace

    source · 
    pub struct AddressSpace(/* private fields */);
    Expand description

    Defines the address space in which a global will be inserted.

    The default address space is zero. An address space can always be created from a u16:

    inkwell::AddressSpace::from(1u16);
    @@ -8,9 +8,9 @@ 
    inkwell::AddressSpace::try_from(42u32).expect("fits in 24-bit unsigned int");

    §Remarks

    See also: https://llvm.org/doxygen/NVPTXBaseInfo_8h_source.html

    -

    Trait Implementations§

    source§

    impl Clone for AddressSpace

    source§

    fn clone(&self) -> AddressSpace

    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 AddressSpace

    source§

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

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

    impl Default for AddressSpace

    source§

    fn default() -> Self

    Returns the “default value” for a type. Read more
    source§

    impl From<u16> for AddressSpace

    source§

    fn from(val: u16) -> Self

    Converts to this type from the input type.
    source§

    impl PartialEq for AddressSpace

    source§

    fn eq(&self, other: &AddressSpace) -> bool

    This method tests for self and other values to be equal, and is used +

    Trait Implementations§

    source§

    impl Clone for AddressSpace

    source§

    fn clone(&self) -> AddressSpace

    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 AddressSpace

    source§

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

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

    impl Default for AddressSpace

    source§

    fn default() -> AddressSpace

    Returns the “default value” for a type. Read more
    source§

    impl From<u16> for AddressSpace

    source§

    fn from(val: u16) -> Self

    Converts to this type from the input type.
    source§

    impl PartialEq for AddressSpace

    source§

    fn eq(&self, other: &AddressSpace) -> bool

    This method tests for self and other values to be equal, and is used by ==.
    1.0.0 · source§

    fn ne(&self, other: &Rhs) -> bool

    This method tests for !=. The default implementation is almost always -sufficient, and should not be overridden without very good reason.
    source§

    impl TryFrom<u32> for AddressSpace

    §

    type Error = ()

    The type returned in the event of a conversion error.
    source§

    fn try_from(val: u32) -> Result<Self, Self::Error>

    Performs the conversion.
    source§

    impl Copy for AddressSpace

    source§

    impl Eq for AddressSpace

    source§

    impl StructuralPartialEq for AddressSpace

    Auto Trait Implementations§

    Blanket Implementations§

    source§

    impl<T> Any for T
    where +sufficient, and should not be overridden without very good reason.

    source§

    impl TryFrom<u32> for AddressSpace

    §

    type Error = ()

    The type returned in the event of a conversion error.
    source§

    fn try_from(val: u32) -> Result<Self, Self::Error>

    Performs the conversion.
    source§

    impl Copy for AddressSpace

    source§

    impl Eq for AddressSpace

    source§

    impl StructuralPartialEq for AddressSpace

    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/inkwell/support/enum.LoadLibraryError.html b/inkwell/support/enum.LoadLibraryError.html index 785ae3ddf..2f82dc4b0 100644 --- a/inkwell/support/enum.LoadLibraryError.html +++ b/inkwell/support/enum.LoadLibraryError.html @@ -1,13 +1,13 @@ LoadLibraryError in inkwell::support - Rust
    -

    Enum inkwell::support::LoadLibraryError

    source · 
    pub enum LoadLibraryError {
+    
    Enum inkwell::support::LoadLibraryError
    source · 
    pub enum LoadLibraryError {
     UnicodeError,
     LoadingError,
 }
    Expand description
    Possible errors that can occur when loading a library
    
 
    Variants§
    §
    UnicodeError
    The given path could not be converted to a &str
    
 
    §
    LoadingError
    The given path could not be loaded as a library
    
-
    Trait Implementations§
    source§
    impl Clone for LoadLibraryError
    source§
    fn clone(&self) -> LoadLibraryError
    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 LoadLibraryError
    source§
    fn fmt(&self, f: &mut Formatter<'_>) -> Result
    Formats the value using the given formatter. Read more
    source§
    impl Display for LoadLibraryError
    source§
    fn fmt(&self, __formatter: &mut Formatter<'_>) -> Result
    Formats the value using the given formatter. Read more
    source§
    impl Error for LoadLibraryError
    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 LoadLibraryError
    source§
    fn eq(&self, other: &LoadLibraryError) -> bool
    This method tests for self and other values to be equal, and is used
+
    Trait Implementations§
    source§
    impl Clone for LoadLibraryError
    source§
    fn clone(&self) -> LoadLibraryError
    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 LoadLibraryError
    source§
    fn fmt(&self, f: &mut Formatter<'_>) -> Result
    Formats the value using the given formatter. Read more
    source§
    impl Display for LoadLibraryError
    source§
    fn fmt(&self, __formatter: &mut Formatter<'_>) -> Result
    Formats the value using the given formatter. Read more
    source§
    impl Error for LoadLibraryError
    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 LoadLibraryError
    source§
    fn eq(&self, other: &LoadLibraryError) -> bool
    This method tests for self and other values to be equal, and is used
 by ==.
    1.0.0 · source§
    fn ne(&self, other: &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 LoadLibraryError
    source§
    impl Eq for LoadLibraryError
    source§
    impl StructuralPartialEq for LoadLibraryError
    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 LoadLibraryError
    source§
    impl Eq for LoadLibraryError
    source§
    impl StructuralPartialEq for LoadLibraryError
    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/inkwell/support/error_handling/index.html b/inkwell/support/error_handling/index.html
index 1a0f97e67..6bffe0a86 100644
--- a/inkwell/support/error_handling/index.html
+++ b/inkwell/support/error_handling/index.html
@@ -1,3 +1,3 @@
 inkwell::support::error_handling - Rust
    
-    
    Module inkwell::support::error_handling
    source · 
    Expand description
    This module contains some supplemental functions for dealing with errors.
    
+    
    Module inkwell::support::error_handling
    source · 
    Expand description
    This module contains some supplemental functions for dealing with errors.
    
 
    Functions§
    
\ No newline at end of file
diff --git a/inkwell/support/fn.enable_llvm_pretty_stack_trace.html b/inkwell/support/fn.enable_llvm_pretty_stack_trace.html
index 9d4e83df3..432e946f3 100644
--- a/inkwell/support/fn.enable_llvm_pretty_stack_trace.html
+++ b/inkwell/support/fn.enable_llvm_pretty_stack_trace.html
@@ -1,2 +1,2 @@
 enable_llvm_pretty_stack_trace in inkwell::support - Rust
    
-    
    Function inkwell::support::enable_llvm_pretty_stack_trace
    source · 
    pub fn enable_llvm_pretty_stack_trace()
    
\ No newline at end of file
+    
    Function inkwell::support::enable_llvm_pretty_stack_trace
    source · 
    pub fn enable_llvm_pretty_stack_trace()
    
\ No newline at end of file
diff --git a/inkwell/support/fn.get_llvm_version.html b/inkwell/support/fn.get_llvm_version.html
index 584cf4e47..2d14d7dfb 100644
--- a/inkwell/support/fn.get_llvm_version.html
+++ b/inkwell/support/fn.get_llvm_version.html
@@ -1,3 +1,3 @@
 get_llvm_version in inkwell::support - Rust
    
-    
    Function inkwell::support::get_llvm_version
    source · 
    pub fn get_llvm_version() -> (u32, u32, u32)
    Expand description
    Returns the major, minor, and patch version of the LLVM in use
    
+    
    Function inkwell::support::get_llvm_version
    source · 
    pub fn get_llvm_version() -> (u32, u32, u32)
    Expand description
    Returns the major, minor, and patch version of the LLVM in use
    
 
    
\ No newline at end of file
diff --git a/inkwell/support/fn.is_multithreaded.html b/inkwell/support/fn.is_multithreaded.html
index 4ddeefed8..8d19fec64 100644
--- a/inkwell/support/fn.is_multithreaded.html
+++ b/inkwell/support/fn.is_multithreaded.html
@@ -1,4 +1,4 @@
 is_multithreaded in inkwell::support - Rust
    
-    
    Function inkwell::support::is_multithreaded
    source · 
    pub fn is_multithreaded() -> bool
    Expand description
    Determines whether or not LLVM has been configured to run in multithreaded mode. (Inkwell currently does
+    
    Function inkwell::support::is_multithreaded
    source · 
    pub fn is_multithreaded() -> bool
    Expand description
    Determines whether or not LLVM has been configured to run in multithreaded mode. (Inkwell currently does
 not officially support multithreaded mode)
    
 
    
\ No newline at end of file
diff --git a/inkwell/support/fn.load_library_permanently.html b/inkwell/support/fn.load_library_permanently.html
index bbc2563d3..ad86dd8ff 100644
--- a/inkwell/support/fn.load_library_permanently.html
+++ b/inkwell/support/fn.load_library_permanently.html
@@ -1,4 +1,4 @@
 load_library_permanently in inkwell::support - Rust
    
-    
    Function inkwell::support::load_library_permanently
    source · 
    pub fn load_library_permanently(path: &Path) -> Result<(), LoadLibraryError>
    Expand description
    Permanently load the dynamic library at the given path.
    
+    
    Function inkwell::support::load_library_permanently
    source · 
    pub fn load_library_permanently(path: &Path) -> Result<(), LoadLibraryError>
    Expand description
    Permanently load the dynamic library at the given path.
    
 
    It is safe to call this function multiple times for the same library.
    
 
    
\ No newline at end of file
diff --git a/inkwell/support/fn.load_visible_symbols.html b/inkwell/support/fn.load_visible_symbols.html
index 66e4c8969..5a01e90d3 100644
--- a/inkwell/support/fn.load_visible_symbols.html
+++ b/inkwell/support/fn.load_visible_symbols.html
@@ -1,3 +1,3 @@
 load_visible_symbols in inkwell::support - Rust
    
-    
    Function inkwell::support::load_visible_symbols
    source · 
    pub fn load_visible_symbols()
    Expand description
    Permanently loads all the symbols visible inside the current program
    
+    
    Function inkwell::support::load_visible_symbols
    source · 
    pub fn load_visible_symbols()
    Expand description
    Permanently loads all the symbols visible inside the current program
    
 
    
\ No newline at end of file
diff --git a/inkwell/support/fn.search_for_address_of_symbol.html b/inkwell/support/fn.search_for_address_of_symbol.html
index 49fef7b62..9c9671a6e 100644
--- a/inkwell/support/fn.search_for_address_of_symbol.html
+++ b/inkwell/support/fn.search_for_address_of_symbol.html
@@ -1,4 +1,4 @@
 search_for_address_of_symbol in inkwell::support - Rust
    
-    
    Function inkwell::support::search_for_address_of_symbol
    source · 
    pub fn search_for_address_of_symbol(symbol: &str) -> Option<usize>
    Expand description
    Search through all previously loaded dynamic libraries for symbol.
    
+    
    Function inkwell::support::search_for_address_of_symbol
    source · 
    pub fn search_for_address_of_symbol(symbol: &str) -> Option<usize>
    Expand description
    Search through all previously loaded dynamic libraries for symbol.
    
 
    Returns an address of the symbol, if found
    
 
    
\ No newline at end of file
diff --git a/inkwell/support/fn.shutdown_llvm.html b/inkwell/support/fn.shutdown_llvm.html
index 5124dfd24..a93fc4242 100644
--- a/inkwell/support/fn.shutdown_llvm.html
+++ b/inkwell/support/fn.shutdown_llvm.html
@@ -1,4 +1,4 @@
 shutdown_llvm in inkwell::support - Rust
    
-    
    Function inkwell::support::shutdown_llvm
    source · 
    pub unsafe fn shutdown_llvm()
    Expand description
    This function is very unsafe. Any reference to LLVM data after this function is called will likely segfault.
+    
    Function inkwell::support::shutdown_llvm
    source · 
    pub unsafe fn shutdown_llvm()
    Expand description
    This function is very unsafe. Any reference to LLVM data after this function is called will likely segfault.
 Probably only ever useful to call before your program ends. Might not even be absolutely necessary.
    
 
    
\ No newline at end of file
diff --git a/inkwell/support/index.html b/inkwell/support/index.html
index a3a72d419..78cf05ba5 100644
--- a/inkwell/support/index.html
+++ b/inkwell/support/index.html
@@ -1,4 +1,4 @@
 inkwell::support - Rust
    
-    
    Module inkwell::support
    source · 
    Modules§
    • error_handling
      This module contains some supplemental functions for dealing with errors.
    Structs§
    • LLVMString
      An owned LLVM String. Also known as a LLVM Message
    Enums§
    Functions§
    -

    Trait Implementations§

    source§

    impl Debug for LLVMString

    source§

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

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

    impl Deref for LLVMString

    §

    type Target = CStr

    The resulting type after dereferencing.
    source§

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

    Dereferences the value.
    source§

    impl Display for LLVMString

    source§

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

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

    impl Drop for LLVMString

    source§

    fn drop(&mut self)

    Executes the destructor for this type. Read more
    source§

    impl Error for LLVMString

    source§

    fn description(&self) -> &str

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

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

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

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

    The lower-level source of this error, if any. Read more
    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 LLVMString

    source§

    fn eq(&self, other: &LLVMString) -> bool

    This method tests for self and other values to be equal, and is used +

    Trait Implementations§

    source§

    impl Debug for LLVMString

    source§

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

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

    impl Deref for LLVMString

    §

    type Target = CStr

    The resulting type after dereferencing.
    source§

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

    Dereferences the value.
    source§

    impl Display for LLVMString

    source§

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

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

    impl Drop for LLVMString

    source§

    fn drop(&mut self)

    Executes the destructor for this type. Read more
    source§

    impl Error for LLVMString

    source§

    fn description(&self) -> &str

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

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

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

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

    The lower-level source of this error, if any. Read more
    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 LLVMString

    source§

    fn eq(&self, other: &LLVMString) -> bool

    This method tests for self and other values to be equal, and is used by ==.
    1.0.0 · source§

    fn ne(&self, other: &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 LLVMString

    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/inkwell/targets/enum.ByteOrdering.html b/inkwell/targets/enum.ByteOrdering.html index 694873aea..3105cb5c5 100644 --- a/inkwell/targets/enum.ByteOrdering.html +++ b/inkwell/targets/enum.ByteOrdering.html @@ -1,10 +1,10 @@ ByteOrdering in inkwell::targets - Rust
    -

    Enum inkwell::targets::ByteOrdering

    source · 
    pub enum ByteOrdering {
+    
    Enum inkwell::targets::ByteOrdering
    source · 
    pub enum ByteOrdering {
     BigEndian,
     LittleEndian,
-}
    Variants§
    §
    BigEndian
    §
    LittleEndian
    Trait Implementations§
    source§
    impl Clone for ByteOrdering
    source§
    fn clone(&self) -> ByteOrdering
    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 ByteOrdering
    source§
    fn fmt(&self, f: &mut Formatter<'_>) -> Result
    Formats the value using the given formatter. Read more
    source§
    impl PartialEq for ByteOrdering
    source§
    fn eq(&self, other: &ByteOrdering) -> bool
    This method tests for self and other values to be equal, and is used
+}

    Variants§

    §

    BigEndian

    §

    LittleEndian

    Trait Implementations§

    source§

    impl Clone for ByteOrdering

    source§

    fn clone(&self) -> ByteOrdering

    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 ByteOrdering

    source§

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

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

    impl PartialEq for ByteOrdering

    source§

    fn eq(&self, other: &ByteOrdering) -> bool

    This method tests for self and other values to be equal, and is used by ==.
    1.0.0 · source§

    fn ne(&self, other: &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 ByteOrdering

    source§

    impl Eq for ByteOrdering

    source§

    impl StructuralPartialEq for ByteOrdering

    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 ByteOrdering

    source§

    impl Eq for ByteOrdering

    source§

    impl StructuralPartialEq for ByteOrdering

    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/inkwell/targets/enum.CodeModel.html b/inkwell/targets/enum.CodeModel.html index 80081253f..76ffd45bc 100644 --- a/inkwell/targets/enum.CodeModel.html +++ b/inkwell/targets/enum.CodeModel.html @@ -1,14 +1,14 @@ CodeModel in inkwell::targets - Rust
    -

    Enum inkwell::targets::CodeModel

    source · 
    pub enum CodeModel {
+    
    Enum inkwell::targets::CodeModel
    source · 
    pub enum CodeModel {
     Default,
     JITDefault,
     Small,
     Kernel,
     Medium,
     Large,
-}
    Variants§
    §
    Default
    §
    JITDefault
    §
    Small
    §
    Kernel
    §
    Medium
    §
    Large
    Trait Implementations§
    source§
    impl Clone for CodeModel
    source§
    fn clone(&self) -> CodeModel
    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 CodeModel
    source§
    fn fmt(&self, f: &mut Formatter<'_>) -> Result
    Formats the value using the given formatter. Read more
    source§
    impl Default for CodeModel
    source§
    fn default() -> CodeModel
    Returns the “default value” for a type. Read more
    source§
    impl From<CodeModel> for LLVMCodeModel
    source§
    fn from(value: CodeModel) -> Self
    Converts to this type from the input type.
    source§
    impl PartialEq for CodeModel
    source§
    fn eq(&self, other: &CodeModel) -> bool
    This method tests for self and other values to be equal, and is used
+}

    Variants§

    §

    Default

    §

    JITDefault

    §

    Small

    §

    Kernel

    §

    Medium

    §

    Large

    Trait Implementations§

    source§

    impl Clone for CodeModel

    source§

    fn clone(&self) -> CodeModel

    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 CodeModel

    source§

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

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

    impl Default for CodeModel

    source§

    fn default() -> CodeModel

    Returns the “default value” for a type. Read more
    source§

    impl From<CodeModel> for LLVMCodeModel

    source§

    fn from(value: CodeModel) -> Self

    Converts to this type from the input type.
    source§

    impl PartialEq for CodeModel

    source§

    fn eq(&self, other: &CodeModel) -> bool

    This method tests for self and other values to be equal, and is used by ==.
    1.0.0 · source§

    fn ne(&self, other: &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 CodeModel

    source§

    impl Eq for CodeModel

    source§

    impl StructuralPartialEq for CodeModel

    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 CodeModel

    source§

    impl Eq for CodeModel

    source§

    impl StructuralPartialEq for CodeModel

    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/inkwell/targets/enum.FileType.html b/inkwell/targets/enum.FileType.html index fde9f6287..79a9179bd 100644 --- a/inkwell/targets/enum.FileType.html +++ b/inkwell/targets/enum.FileType.html @@ -1,10 +1,10 @@ FileType in inkwell::targets - Rust
    -

    Enum inkwell::targets::FileType

    source · 
    pub enum FileType {
+    
    Enum inkwell::targets::FileType
    source · 
    pub enum FileType {
     Assembly,
     Object,
-}
    Variants§
    §
    Assembly
    §
    Object
    Trait Implementations§
    source§
    impl Clone for FileType
    source§
    fn clone(&self) -> FileType
    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 FileType
    source§
    fn fmt(&self, f: &mut Formatter<'_>) -> Result
    Formats the value using the given formatter. Read more
    source§
    impl PartialEq for FileType
    source§
    fn eq(&self, other: &FileType) -> bool
    This method tests for self and other values to be equal, and is used
+}

    Variants§

    §

    Assembly

    §

    Object

    Trait Implementations§

    source§

    impl Clone for FileType

    source§

    fn clone(&self) -> FileType

    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 FileType

    source§

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

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

    impl PartialEq for FileType

    source§

    fn eq(&self, other: &FileType) -> bool

    This method tests for self and other values to be equal, and is used by ==.
    1.0.0 · source§

    fn ne(&self, other: &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 FileType

    source§

    impl Eq for FileType

    source§

    impl StructuralPartialEq for FileType

    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 FileType

    source§

    impl Eq for FileType

    source§

    impl StructuralPartialEq for FileType

    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/inkwell/targets/enum.RelocMode.html b/inkwell/targets/enum.RelocMode.html index 37a57acfb..ae07ffdf4 100644 --- a/inkwell/targets/enum.RelocMode.html +++ b/inkwell/targets/enum.RelocMode.html @@ -1,12 +1,12 @@ RelocMode in inkwell::targets - Rust
    -

    Enum inkwell::targets::RelocMode

    source · 
    pub enum RelocMode {
+    
    Enum inkwell::targets::RelocMode
    source · 
    pub enum RelocMode {
     Default,
     Static,
     PIC,
     DynamicNoPic,
-}
    Variants§
    §
    Default
    §
    Static
    §
    PIC
    §
    DynamicNoPic
    Trait Implementations§
    source§
    impl Clone for RelocMode
    source§
    fn clone(&self) -> RelocMode
    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 RelocMode
    source§
    fn fmt(&self, f: &mut Formatter<'_>) -> Result
    Formats the value using the given formatter. Read more
    source§
    impl Default for RelocMode
    source§
    fn default() -> RelocMode
    Returns the “default value” for a type. Read more
    source§
    impl From<RelocMode> for LLVMRelocMode
    source§
    fn from(value: RelocMode) -> Self
    Converts to this type from the input type.
    source§
    impl PartialEq for RelocMode
    source§
    fn eq(&self, other: &RelocMode) -> bool
    This method tests for self and other values to be equal, and is used
+}

    Variants§

    §

    Default

    §

    Static

    §

    PIC

    §

    DynamicNoPic

    Trait Implementations§

    source§

    impl Clone for RelocMode

    source§

    fn clone(&self) -> RelocMode

    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 RelocMode

    source§

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

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

    impl Default for RelocMode

    source§

    fn default() -> RelocMode

    Returns the “default value” for a type. Read more
    source§

    impl From<RelocMode> for LLVMRelocMode

    source§

    fn from(value: RelocMode) -> Self

    Converts to this type from the input type.
    source§

    impl PartialEq for RelocMode

    source§

    fn eq(&self, other: &RelocMode) -> bool

    This method tests for self and other values to be equal, and is used by ==.
    1.0.0 · source§

    fn ne(&self, other: &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 RelocMode

    source§

    impl Eq for RelocMode

    source§

    impl StructuralPartialEq for RelocMode

    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 RelocMode

    source§

    impl Eq for RelocMode

    source§

    impl StructuralPartialEq for RelocMode

    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/inkwell/targets/index.html b/inkwell/targets/index.html index 80afbe23a..a85f7ff90 100644 --- a/inkwell/targets/index.html +++ b/inkwell/targets/index.html @@ -1,3 +1,3 @@ inkwell::targets - Rust
    -

    Module inkwell::targets

    source ·

    Structs§

    source§

    impl Copy for InitializationConfig

    source§

    impl Eq for InitializationConfig

    source§

    impl StructuralPartialEq for InitializationConfig

    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/inkwell/targets/struct.Target.html b/inkwell/targets/struct.Target.html index e3e73cf5d..c21135f9d 100644 --- a/inkwell/targets/struct.Target.html +++ b/inkwell/targets/struct.Target.html @@ -1,6 +1,6 @@ Target in inkwell::targets - Rust
    -

    Struct inkwell::targets::Target

    source · 
    pub struct Target { /* private fields */ }

    Implementations§

    source§

    impl Target

    source

    pub unsafe fn new(target: LLVMTargetRef) -> Self

    source

    pub fn as_mut_ptr(&self) -> LLVMTargetRef

    Acquires the underlying raw pointer belonging to this Target type.

    -
    source

    pub fn initialize_x86(config: &InitializationConfig)

    source

    pub fn initialize_arm(config: &InitializationConfig)

    source

    pub fn initialize_mips(config: &InitializationConfig)

    source

    pub fn initialize_aarch64(config: &InitializationConfig)

    source

    pub fn initialize_amd_gpu(config: &InitializationConfig)

    source

    pub fn initialize_system_z(config: &InitializationConfig)

    source

    pub fn initialize_hexagon(config: &InitializationConfig)

    source

    pub fn initialize_nvptx(config: &InitializationConfig)

    source

    pub fn initialize_msp430(config: &InitializationConfig)

    source

    pub fn initialize_x_core(config: &InitializationConfig)

    source

    pub fn initialize_power_pc(config: &InitializationConfig)

    source

    pub fn initialize_sparc(config: &InitializationConfig)

    source

    pub fn initialize_bpf(config: &InitializationConfig)

    source

    pub fn initialize_lanai(config: &InitializationConfig)

    source

    pub fn initialize_riscv(config: &InitializationConfig)

    source

    pub fn initialize_loongarch(config: &InitializationConfig)

    source

    pub fn initialize_webassembly(config: &InitializationConfig)

    source

    pub fn initialize_native(config: &InitializationConfig) -> Result<(), String>

    source

    pub fn initialize_all(config: &InitializationConfig)

    source

    pub fn create_target_machine( +

    Struct inkwell::targets::Target

    source · 
    pub struct Target { /* private fields */ }

    Implementations§

    source§

    impl Target

    source

    pub unsafe fn new(target: LLVMTargetRef) -> Self

    source

    pub fn as_mut_ptr(&self) -> LLVMTargetRef

    Acquires the underlying raw pointer belonging to this Target type.

    +
    source

    pub fn initialize_x86(config: &InitializationConfig)

    source

    pub fn initialize_arm(config: &InitializationConfig)

    source

    pub fn initialize_mips(config: &InitializationConfig)

    source

    pub fn initialize_aarch64(config: &InitializationConfig)

    source

    pub fn initialize_amd_gpu(config: &InitializationConfig)

    source

    pub fn initialize_system_z(config: &InitializationConfig)

    source

    pub fn initialize_hexagon(config: &InitializationConfig)

    source

    pub fn initialize_nvptx(config: &InitializationConfig)

    source

    pub fn initialize_msp430(config: &InitializationConfig)

    source

    pub fn initialize_x_core(config: &InitializationConfig)

    source

    pub fn initialize_power_pc(config: &InitializationConfig)

    source

    pub fn initialize_sparc(config: &InitializationConfig)

    source

    pub fn initialize_bpf(config: &InitializationConfig)

    source

    pub fn initialize_lanai(config: &InitializationConfig)

    source

    pub fn initialize_riscv(config: &InitializationConfig)

    source

    pub fn initialize_loongarch(config: &InitializationConfig)

    source

    pub fn initialize_webassembly(config: &InitializationConfig)

    source

    pub fn initialize_native(config: &InitializationConfig) -> Result<(), String>

    source

    pub fn initialize_all(config: &InitializationConfig)

    source

    pub fn create_target_machine( &self, triple: &TargetTriple, cpu: &str, @@ -8,7 +8,7 @@ level: OptimizationLevel, reloc_mode: RelocMode, code_model: CodeModel -) -> Option<TargetMachine>

    source

    pub fn create_target_machine_from_options( +) -> Option<TargetMachine>

    source

    pub fn create_target_machine_from_options( &self, triple: &TargetTriple, options: TargetMachineOptions @@ -31,9 +31,9 @@ Target::initialize_x86(&InitializationConfig::defa assert_eq!(target_machine.get_cpu().to_str(), Ok("x86-64")); assert_eq!(target_machine.get_feature_string().to_str(), Ok("+avx2"));

    -

    source

    pub fn get_first() -> Option<Self>

    source

    pub fn get_next(&self) -> Option<Self>

    source

    pub fn get_name(&self) -> &CStr

    source

    pub fn get_description(&self) -> &CStr

    source

    pub fn from_name(name: &str) -> Option<Self>

    source

    pub fn from_triple(triple: &TargetTriple) -> Result<Self, LLVMString>

    source

    pub fn has_jit(&self) -> bool

    source

    pub fn has_target_machine(&self) -> bool

    source

    pub fn has_asm_backend(&self) -> bool

    Trait Implementations§

    source§

    impl Debug for Target

    source§

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

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

    impl PartialEq for Target

    source§

    fn eq(&self, other: &Target) -> bool

    This method tests for self and other values to be equal, and is used +
    source

    pub fn get_first() -> Option<Self>

    source

    pub fn get_next(&self) -> Option<Self>

    source

    pub fn get_name(&self) -> &CStr

    source

    pub fn get_description(&self) -> &CStr

    source

    pub fn from_name(name: &str) -> Option<Self>

    source

    pub fn from_triple(triple: &TargetTriple) -> Result<Self, LLVMString>

    source

    pub fn has_jit(&self) -> bool

    source

    pub fn has_target_machine(&self) -> bool

    source

    pub fn has_asm_backend(&self) -> bool

    Trait Implementations§

    source§

    impl Debug for Target

    source§

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

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

    impl PartialEq for Target

    source§

    fn eq(&self, other: &Target) -> bool

    This method tests for self and other values to be equal, and is used by ==.
    1.0.0 · source§

    fn ne(&self, other: &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 Target

    source§

    impl StructuralPartialEq for Target

    Auto Trait Implementations§

    §

    impl Freeze for Target

    §

    impl RefUnwindSafe for Target

    §

    impl !Send for Target

    §

    impl !Sync for Target

    §

    impl Unpin for Target

    §

    impl UnwindSafe for Target

    Blanket Implementations§

    source§

    impl<T> Any for T
    where +sufficient, and should not be overridden without very good reason.

    source§

    impl Eq for Target

    source§

    impl StructuralPartialEq for Target

    Auto Trait Implementations§

    §

    impl Freeze for Target

    §

    impl RefUnwindSafe for Target

    §

    impl !Send for Target

    §

    impl !Sync for Target

    §

    impl Unpin for Target

    §

    impl UnwindSafe for Target

    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/inkwell/targets/struct.TargetData.html b/inkwell/targets/struct.TargetData.html index 934b4ac98..0a3b67cde 100644 --- a/inkwell/targets/struct.TargetData.html +++ b/inkwell/targets/struct.TargetData.html @@ -1,6 +1,6 @@ TargetData in inkwell::targets - Rust
    -

    Struct inkwell::targets::TargetData

    source · 
    pub struct TargetData { /* private fields */ }

    Implementations§

    source§

    impl TargetData

    source

    pub unsafe fn new(target_data: LLVMTargetDataRef) -> TargetData

    source

    pub fn as_mut_ptr(&self) -> LLVMTargetDataRef

    Acquires the underlying raw pointer belonging to this TargetData type.

    -
    source

    pub fn ptr_sized_int_type_in_context<'ctx>( +

    Struct inkwell::targets::TargetData

    source · 
    pub struct TargetData { /* private fields */ }

    Implementations§

    source§

    impl TargetData

    source

    pub unsafe fn new(target_data: LLVMTargetDataRef) -> TargetData

    source

    pub fn as_mut_ptr(&self) -> LLVMTargetDataRef

    Acquires the underlying raw pointer belonging to this TargetData type.

    +
    source

    pub fn ptr_sized_int_type_in_context<'ctx>( &self, context: impl AsContextRef<'ctx>, address_space: Option<AddressSpace> @@ -17,17 +17,17 @@ Target::initialize_native(&InitializationConfig::d let execution_engine = module.create_jit_execution_engine(OptimizationLevel::None).unwrap(); let target_data = execution_engine.get_target_data(); let int_type = target_data.ptr_sized_int_type_in_context(&context, None);

    -

    source

    pub fn get_data_layout(&self) -> DataLayout

    source

    pub fn get_bit_size(&self, type_: &dyn AnyType<'_>) -> u64

    source

    pub fn create(str_repr: &str) -> TargetData

    source

    pub fn get_byte_ordering(&self) -> ByteOrdering

    source

    pub fn get_pointer_byte_size(&self, address_space: Option<AddressSpace>) -> u32

    source

    pub fn get_store_size(&self, type_: &dyn AnyType<'_>) -> u64

    source

    pub fn get_abi_size(&self, type_: &dyn AnyType<'_>) -> u64

    source

    pub fn get_abi_alignment(&self, type_: &dyn AnyType<'_>) -> u32

    source

    pub fn get_call_frame_alignment(&self, type_: &dyn AnyType<'_>) -> u32

    source

    pub fn get_preferred_alignment(&self, type_: &dyn AnyType<'_>) -> u32

    source

    pub fn get_preferred_alignment_of_global(&self, value: &GlobalValue<'_>) -> u32

    source

    pub fn element_at_offset( +

    source

    pub fn get_data_layout(&self) -> DataLayout

    source

    pub fn get_bit_size(&self, type_: &dyn AnyType<'_>) -> u64

    source

    pub fn create(str_repr: &str) -> TargetData

    source

    pub fn get_byte_ordering(&self) -> ByteOrdering

    source

    pub fn get_pointer_byte_size(&self, address_space: Option<AddressSpace>) -> u32

    source

    pub fn get_store_size(&self, type_: &dyn AnyType<'_>) -> u64

    source

    pub fn get_abi_size(&self, type_: &dyn AnyType<'_>) -> u64

    source

    pub fn get_abi_alignment(&self, type_: &dyn AnyType<'_>) -> u32

    source

    pub fn get_call_frame_alignment(&self, type_: &dyn AnyType<'_>) -> u32

    source

    pub fn get_preferred_alignment(&self, type_: &dyn AnyType<'_>) -> u32

    source

    pub fn get_preferred_alignment_of_global(&self, value: &GlobalValue<'_>) -> u32

    source

    pub fn element_at_offset( &self, struct_type: &StructType<'_>, offset: u64 -) -> u32

    source

    pub fn offset_of_element( +) -> u32

    source

    pub fn offset_of_element( &self, struct_type: &StructType<'_>, element: u32 -) -> Option<u64>

    Trait Implementations§

    source§

    impl Debug for TargetData

    source§

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

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

    impl Drop for TargetData

    source§

    fn drop(&mut self)

    Executes the destructor for this type. Read more
    source§

    impl PartialEq for TargetData

    source§

    fn eq(&self, other: &TargetData) -> bool

    This method tests for self and other values to be equal, and is used +) -> Option<u64>

    Trait Implementations§

    source§

    impl Debug for TargetData

    source§

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

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

    impl Drop for TargetData

    source§

    fn drop(&mut self)

    Executes the destructor for this type. Read more
    source§

    impl PartialEq for TargetData

    source§

    fn eq(&self, other: &TargetData) -> bool

    This method tests for self and other values to be equal, and is used by ==.
    1.0.0 · source§

    fn ne(&self, other: &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 TargetData

    source§

    impl StructuralPartialEq for TargetData

    Auto Trait Implementations§

    Blanket Implementations§

    source§

    impl<T> Any for T
    where +sufficient, and should not be overridden without very good reason.

    source§

    impl Eq for TargetData

    source§

    impl StructuralPartialEq for TargetData

    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/inkwell/targets/struct.TargetMachine.html b/inkwell/targets/struct.TargetMachine.html index 1289394b7..09ede1edc 100644 --- a/inkwell/targets/struct.TargetMachine.html +++ b/inkwell/targets/struct.TargetMachine.html @@ -1,20 +1,20 @@ TargetMachine in inkwell::targets - Rust
    -

    Struct inkwell::targets::TargetMachine

    source · 
    pub struct TargetMachine { /* private fields */ }

    Implementations§

    source§

    impl TargetMachine

    source

    pub unsafe fn new(target_machine: LLVMTargetMachineRef) -> Self

    source

    pub fn as_mut_ptr(&self) -> LLVMTargetMachineRef

    Acquires the underlying raw pointer belonging to this TargetMachine type.

    -
    source

    pub fn get_target(&self) -> Target

    source

    pub fn get_triple(&self) -> TargetTriple

    source

    pub fn get_default_triple() -> TargetTriple

    Gets the default triple for the current system.

    +

    Struct inkwell::targets::TargetMachine

    source · 
    pub struct TargetMachine { /* private fields */ }

    Implementations§

    source§

    impl TargetMachine

    source

    pub unsafe fn new(target_machine: LLVMTargetMachineRef) -> Self

    source

    pub fn as_mut_ptr(&self) -> LLVMTargetMachineRef

    Acquires the underlying raw pointer belonging to this TargetMachine type.

    +
    source

    pub fn get_target(&self) -> Target

    source

    pub fn get_triple(&self) -> TargetTriple

    source

    pub fn get_default_triple() -> TargetTriple

    Gets the default triple for the current system.

    §Example
    use inkwell::targets::TargetMachine;
 
 let default_triple = TargetMachine::get_default_triple();
 
 assert_eq!(default_triple.as_str().to_str(), Ok("x86_64-pc-linux-gnu"));
    -
    source

    pub fn normalize_triple(triple: &TargetTriple) -> TargetTriple

    source

    pub fn get_host_cpu_name() -> LLVMString

    Gets a string containing the host CPU’s name (triple).

    +
    source

    pub fn normalize_triple(triple: &TargetTriple) -> TargetTriple

    source

    pub fn get_host_cpu_name() -> LLVMString

    Gets a string containing the host CPU’s name (triple).

    §Example Output

    x86_64-pc-linux-gnu

    -
    source

    pub fn get_host_cpu_features() -> LLVMString

    Gets a comma separated list of supported features by the host CPU.

    +
    source

    pub fn get_host_cpu_features() -> LLVMString

    Gets a comma separated list of supported features by the host CPU.

    §Example Output

    +sse2,+cx16,+sahf,-tbm

    -
    source

    pub fn get_cpu(&self) -> LLVMString

    source

    pub fn get_feature_string(&self) -> &CStr

    source

    pub fn get_target_data(&self) -> TargetData

    Create TargetData from this target machine

    -
    source

    pub fn set_asm_verbosity(&self, verbosity: bool)

    source

    pub fn add_analysis_passes<T>(&self, pass_manager: &PassManager<T>)

    source

    pub fn write_to_memory_buffer( +

    source

    pub fn get_cpu(&self) -> LLVMString

    source

    pub fn get_feature_string(&self) -> &CStr

    source

    pub fn get_target_data(&self) -> TargetData

    Create TargetData from this target machine

    +
    source

    pub fn set_asm_verbosity(&self, verbosity: bool)

    source

    pub fn add_analysis_passes<T>(&self, pass_manager: &PassManager<T>)

    source

    pub fn write_to_memory_buffer( &self, module: &Module<'_>, file_type: FileType @@ -48,7 +48,7 @@ Target::initialize_x86(&InitializationConfig::defa module.add_function("my_fn", fn_type, None); let buffer = target_machine.write_to_memory_buffer(&module, FileType::Assembly).unwrap();

    -
    source

    pub fn write_to_file( +

    source

    pub fn write_to_file( &self, module: &Module<'_>, file_type: FileType, @@ -86,7 +86,7 @@ Target::initialize_x86(&InitializationConfig::defa module.add_function("my_fn", fn_type, None); assert!(target_machine.write_to_file(&module, FileType::Object, &path).is_ok());

    -

    Trait Implementations§

    source§

    impl Debug for TargetMachine

    source§

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

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

    impl Drop for TargetMachine

    source§

    fn drop(&mut self)

    Executes the destructor for this type. Read more

    Auto Trait Implementations§

    Blanket Implementations§

    source§

    impl<T> Any for T
    where +

    Trait Implementations§

    source§

    impl Debug for TargetMachine

    source§

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

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

    impl Drop for TargetMachine

    source§

    fn drop(&mut self)

    Executes the destructor for 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/inkwell/targets/struct.TargetMachineOptions.html b/inkwell/targets/struct.TargetMachineOptions.html index bf62325cc..ee30fa93b 100644 --- a/inkwell/targets/struct.TargetMachineOptions.html +++ b/inkwell/targets/struct.TargetMachineOptions.html @@ -1,9 +1,9 @@ TargetMachineOptions in inkwell::targets - Rust
    -

    Struct inkwell::targets::TargetMachineOptions

    source · 
    pub struct TargetMachineOptions(/* private fields */);
    Expand description

    LLVM target machine options provide another way to create target machines, +

    Struct inkwell::targets::TargetMachineOptions

    source · 
    pub struct TargetMachineOptions(/* private fields */);
    Expand description

    LLVM target machine options provide another way to create target machines, used with Target::create_target_machine_from_options.

    The option structure exposes an additional setting (i.e., the target ABI) and provides default values for unspecified settings.

    -

    Implementations§

    source§

    impl TargetMachineOptions

    source

    pub fn new() -> Self

    source

    pub fn set_cpu(self, cpu: &str) -> Self

    source

    pub fn set_features(self, features: &str) -> Self

    source

    pub fn set_abi(self, abi: &str) -> Self

    source

    pub fn set_level(self, level: OptimizationLevel) -> Self

    source

    pub fn set_reloc_mode(self, reloc_mode: RelocMode) -> Self

    source

    pub fn set_code_model(self, code_model: CodeModel) -> Self

    Trait Implementations§

    source§

    impl Debug for TargetMachineOptions

    source§

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

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

    impl Default for TargetMachineOptions

    source§

    fn default() -> TargetMachineOptions

    Returns the “default value” for a type. Read more
    source§

    impl Drop for TargetMachineOptions

    source§

    fn drop(&mut self)

    Executes the destructor for this type. Read more

    Auto Trait Implementations§

    Blanket Implementations§

    source§

    impl<T> Any for T
    where +

    Implementations§

    source§

    impl TargetMachineOptions

    source

    pub fn new() -> Self

    source

    pub fn set_cpu(self, cpu: &str) -> Self

    source

    pub fn set_features(self, features: &str) -> Self

    source

    pub fn set_abi(self, abi: &str) -> Self

    source

    pub fn set_level(self, level: OptimizationLevel) -> Self

    source

    pub fn set_reloc_mode(self, reloc_mode: RelocMode) -> Self

    source

    pub fn set_code_model(self, code_model: CodeModel) -> Self

    Trait Implementations§

    source§

    impl Debug for TargetMachineOptions

    source§

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

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

    impl Default for TargetMachineOptions

    source§

    fn default() -> TargetMachineOptions

    Returns the “default value” for a type. Read more
    source§

    impl Drop for TargetMachineOptions

    source§

    fn drop(&mut self)

    Executes the destructor for 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/inkwell/targets/struct.TargetTriple.html b/inkwell/targets/struct.TargetTriple.html index 01440d179..51e407940 100644 --- a/inkwell/targets/struct.TargetTriple.html +++ b/inkwell/targets/struct.TargetTriple.html @@ -1,7 +1,7 @@ TargetTriple in inkwell::targets - Rust
    -

    Struct inkwell::targets::TargetTriple

    source · 
    pub struct TargetTriple { /* private fields */ }

    Implementations§

    source§

    impl TargetTriple

    source

    pub unsafe fn new(triple: LLVMString) -> TargetTriple

    source

    pub fn create(triple: &str) -> TargetTriple

    source

    pub fn as_str(&self) -> &CStr

    source

    pub fn as_ptr(&self) -> *const c_char

    Trait Implementations§

    source§

    impl Debug for TargetTriple

    source§

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

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

    impl Display for TargetTriple

    source§

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

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

    impl PartialEq for TargetTriple

    source§

    fn eq(&self, other: &TargetTriple) -> bool

    This method tests for self and other values to be equal, and is used +

    Struct inkwell::targets::TargetTriple

    source · 
    pub struct TargetTriple { /* private fields */ }

    Implementations§

    source§

    impl TargetTriple

    source

    pub unsafe fn new(triple: LLVMString) -> TargetTriple

    source

    pub fn create(triple: &str) -> TargetTriple

    source

    pub fn as_str(&self) -> &CStr

    source

    pub fn as_ptr(&self) -> *const c_char

    Trait Implementations§

    source§

    impl Debug for TargetTriple

    source§

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

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

    impl Display for TargetTriple

    source§

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

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

    impl PartialEq for TargetTriple

    source§

    fn eq(&self, other: &TargetTriple) -> bool

    This method tests for self and other values to be equal, and is used by ==.
    1.0.0 · source§

    fn ne(&self, other: &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 TargetTriple

    Auto Trait Implementations§

    Blanket Implementations§

    source§

    impl<T> Any for T
    where +sufficient, and should not be overridden without very good reason.

    source§

    impl Eq for TargetTriple

    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/inkwell/types/enum.AnyTypeEnum.html b/inkwell/types/enum.AnyTypeEnum.html index ae2740444..d4ce095f3 100644 --- a/inkwell/types/enum.AnyTypeEnum.html +++ b/inkwell/types/enum.AnyTypeEnum.html @@ -21,9 +21,9 @@
    §Safety

    Undefined behavior, if referenced type isn’t part of AnyTypeEnum

    source

    pub fn into_array_type(self) -> ArrayType<'ctx>

    source

    pub fn into_float_type(self) -> FloatType<'ctx>

    source

    pub fn into_function_type(self) -> FunctionType<'ctx>

    source

    pub fn into_int_type(self) -> IntType<'ctx>

    source

    pub fn into_pointer_type(self) -> PointerType<'ctx>

    source

    pub fn into_struct_type(self) -> StructType<'ctx>

    source

    pub fn into_vector_type(self) -> VectorType<'ctx>

    source

    pub fn into_void_type(self) -> VoidType<'ctx>

    source

    pub fn is_array_type(self) -> bool

    source

    pub fn is_float_type(self) -> bool

    source

    pub fn is_function_type(self) -> bool

    source

    pub fn is_int_type(self) -> bool

    source

    pub fn is_pointer_type(self) -> bool

    source

    pub fn is_struct_type(self) -> bool

    source

    pub fn is_vector_type(self) -> bool

    source

    pub fn is_void_type(self) -> bool

    source

    pub fn size_of(&self) -> Option<IntValue<'ctx>>

    source

    pub fn print_to_string(self) -> LLVMString

    Print the definition of a AnyTypeEnum to LLVMString.

    -

    Trait Implementations§

    source§

    impl<'ctx> AnyType<'ctx> for AnyTypeEnum<'ctx>

    source§

    fn as_any_type_enum(&self) -> AnyTypeEnum<'ctx>

    Returns an AnyTypeEnum that represents the current type.
    source§

    fn print_to_string(&self) -> LLVMString

    Prints the definition of a Type to a LLVMString.
    source§

    impl AsTypeRef for AnyTypeEnum<'_>

    source§

    fn as_type_ref(&self) -> LLVMTypeRef

    Returns the internal LLVM reference behind the type
    source§

    impl<'ctx> Clone for AnyTypeEnum<'ctx>

    source§

    fn clone(&self) -> AnyTypeEnum<'ctx>

    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<'ctx> Debug for AnyTypeEnum<'ctx>

    source§

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

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

    impl Display for AnyTypeEnum<'_>

    source§

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

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

    impl<'ctx> From<ArrayType<'ctx>> for AnyTypeEnum<'ctx>

    source§

    fn from(value: ArrayType<'_>) -> AnyTypeEnum<'_>

    Converts to this type from the input type.
    source§

    impl<'ctx> From<FloatType<'ctx>> for AnyTypeEnum<'ctx>

    source§

    fn from(value: FloatType<'_>) -> AnyTypeEnum<'_>

    Converts to this type from the input type.
    source§

    impl<'ctx> From<FunctionType<'ctx>> for AnyTypeEnum<'ctx>

    source§

    fn from(value: FunctionType<'_>) -> AnyTypeEnum<'_>

    Converts to this type from the input type.
    source§

    impl<'ctx> From<IntType<'ctx>> for AnyTypeEnum<'ctx>

    source§

    fn from(value: IntType<'_>) -> AnyTypeEnum<'_>

    Converts to this type from the input type.
    source§

    impl<'ctx> From<PointerType<'ctx>> for AnyTypeEnum<'ctx>

    source§

    fn from(value: PointerType<'_>) -> AnyTypeEnum<'_>

    Converts to this type from the input type.
    source§

    impl<'ctx> From<StructType<'ctx>> for AnyTypeEnum<'ctx>

    source§

    fn from(value: StructType<'_>) -> AnyTypeEnum<'_>

    Converts to this type from the input type.
    source§

    impl<'ctx> From<VectorType<'ctx>> for AnyTypeEnum<'ctx>

    source§

    fn from(value: VectorType<'_>) -> AnyTypeEnum<'_>

    Converts to this type from the input type.
    source§

    impl<'ctx> From<VoidType<'ctx>> for AnyTypeEnum<'ctx>

    source§

    fn from(value: VoidType<'_>) -> AnyTypeEnum<'_>

    Converts to this type from the input type.
    source§

    impl<'ctx> PartialEq for AnyTypeEnum<'ctx>

    source§

    fn eq(&self, other: &AnyTypeEnum<'ctx>) -> bool

    This method tests for self and other values to be equal, and is used +

    Trait Implementations§

    source§

    impl<'ctx> AnyType<'ctx> for AnyTypeEnum<'ctx>

    source§

    fn as_any_type_enum(&self) -> AnyTypeEnum<'ctx>

    Returns an AnyTypeEnum that represents the current type.
    source§

    fn print_to_string(&self) -> LLVMString

    Prints the definition of a Type to a LLVMString.
    source§

    impl AsTypeRef for AnyTypeEnum<'_>

    source§

    fn as_type_ref(&self) -> LLVMTypeRef

    Returns the internal LLVM reference behind the type
    source§

    impl<'ctx> Clone for AnyTypeEnum<'ctx>

    source§

    fn clone(&self) -> AnyTypeEnum<'ctx>

    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<'ctx> Debug for AnyTypeEnum<'ctx>

    source§

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

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

    impl Display for AnyTypeEnum<'_>

    source§

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

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

    impl<'ctx> From<ArrayType<'ctx>> for AnyTypeEnum<'ctx>

    source§

    fn from(value: ArrayType<'_>) -> AnyTypeEnum<'_>

    Converts to this type from the input type.
    source§

    impl<'ctx> From<FloatType<'ctx>> for AnyTypeEnum<'ctx>

    source§

    fn from(value: FloatType<'_>) -> AnyTypeEnum<'_>

    Converts to this type from the input type.
    source§

    impl<'ctx> From<FunctionType<'ctx>> for AnyTypeEnum<'ctx>

    source§

    fn from(value: FunctionType<'_>) -> AnyTypeEnum<'_>

    Converts to this type from the input type.
    source§

    impl<'ctx> From<IntType<'ctx>> for AnyTypeEnum<'ctx>

    source§

    fn from(value: IntType<'_>) -> AnyTypeEnum<'_>

    Converts to this type from the input type.
    source§

    impl<'ctx> From<PointerType<'ctx>> for AnyTypeEnum<'ctx>

    source§

    fn from(value: PointerType<'_>) -> AnyTypeEnum<'_>

    Converts to this type from the input type.
    source§

    impl<'ctx> From<StructType<'ctx>> for AnyTypeEnum<'ctx>

    source§

    fn from(value: StructType<'_>) -> AnyTypeEnum<'_>

    Converts to this type from the input type.
    source§

    impl<'ctx> From<VectorType<'ctx>> for AnyTypeEnum<'ctx>

    source§

    fn from(value: VectorType<'_>) -> AnyTypeEnum<'_>

    Converts to this type from the input type.
    source§

    impl<'ctx> From<VoidType<'ctx>> for AnyTypeEnum<'ctx>

    source§

    fn from(value: VoidType<'_>) -> AnyTypeEnum<'_>

    Converts to this type from the input type.
    source§

    impl<'ctx> PartialEq for AnyTypeEnum<'ctx>

    source§

    fn eq(&self, other: &AnyTypeEnum<'ctx>) -> bool

    This method tests for self and other values to be equal, and is used by ==.
    1.0.0 · source§

    fn ne(&self, other: &Rhs) -> bool

    This method tests for !=. The default implementation is almost always -sufficient, and should not be overridden without very good reason.
    source§

    impl<'ctx> TryFrom<AnyTypeEnum<'ctx>> for ArrayType<'ctx>

    §

    type Error = ()

    The type returned in the event of a conversion error.
    source§

    fn try_from(value: AnyTypeEnum<'ctx>) -> Result<Self, Self::Error>

    Performs the conversion.
    source§

    impl<'ctx> TryFrom<AnyTypeEnum<'ctx>> for BasicMetadataTypeEnum<'ctx>

    §

    type Error = ()

    The type returned in the event of a conversion error.
    source§

    fn try_from(value: AnyTypeEnum<'ctx>) -> Result<Self, Self::Error>

    Performs the conversion.
    source§

    impl<'ctx> TryFrom<AnyTypeEnum<'ctx>> for BasicTypeEnum<'ctx>

    §

    type Error = ()

    The type returned in the event of a conversion error.
    source§

    fn try_from(value: AnyTypeEnum<'ctx>) -> Result<Self, Self::Error>

    Performs the conversion.
    source§

    impl<'ctx> TryFrom<AnyTypeEnum<'ctx>> for FloatType<'ctx>

    §

    type Error = ()

    The type returned in the event of a conversion error.
    source§

    fn try_from(value: AnyTypeEnum<'ctx>) -> Result<Self, Self::Error>

    Performs the conversion.
    source§

    impl<'ctx> TryFrom<AnyTypeEnum<'ctx>> for FunctionType<'ctx>

    §

    type Error = ()

    The type returned in the event of a conversion error.
    source§

    fn try_from(value: AnyTypeEnum<'ctx>) -> Result<Self, Self::Error>

    Performs the conversion.
    source§

    impl<'ctx> TryFrom<AnyTypeEnum<'ctx>> for IntType<'ctx>

    §

    type Error = ()

    The type returned in the event of a conversion error.
    source§

    fn try_from(value: AnyTypeEnum<'ctx>) -> Result<Self, Self::Error>

    Performs the conversion.
    source§

    impl<'ctx> TryFrom<AnyTypeEnum<'ctx>> for PointerType<'ctx>

    §

    type Error = ()

    The type returned in the event of a conversion error.
    source§

    fn try_from(value: AnyTypeEnum<'ctx>) -> Result<Self, Self::Error>

    Performs the conversion.
    source§

    impl<'ctx> TryFrom<AnyTypeEnum<'ctx>> for StructType<'ctx>

    §

    type Error = ()

    The type returned in the event of a conversion error.
    source§

    fn try_from(value: AnyTypeEnum<'ctx>) -> Result<Self, Self::Error>

    Performs the conversion.
    source§

    impl<'ctx> TryFrom<AnyTypeEnum<'ctx>> for VectorType<'ctx>

    §

    type Error = ()

    The type returned in the event of a conversion error.
    source§

    fn try_from(value: AnyTypeEnum<'ctx>) -> Result<Self, Self::Error>

    Performs the conversion.
    source§

    impl<'ctx> TryFrom<AnyTypeEnum<'ctx>> for VoidType<'ctx>

    §

    type Error = ()

    The type returned in the event of a conversion error.
    source§

    fn try_from(value: AnyTypeEnum<'ctx>) -> Result<Self, Self::Error>

    Performs the conversion.
    source§

    impl<'ctx> Copy for AnyTypeEnum<'ctx>

    source§

    impl<'ctx> Eq for AnyTypeEnum<'ctx>

    source§

    impl<'ctx> StructuralPartialEq for AnyTypeEnum<'ctx>

    Auto Trait Implementations§

    §

    impl<'ctx> Freeze for AnyTypeEnum<'ctx>

    §

    impl<'ctx> RefUnwindSafe for AnyTypeEnum<'ctx>

    §

    impl<'ctx> !Send for AnyTypeEnum<'ctx>

    §

    impl<'ctx> !Sync for AnyTypeEnum<'ctx>

    §

    impl<'ctx> Unpin for AnyTypeEnum<'ctx>

    §

    impl<'ctx> UnwindSafe for AnyTypeEnum<'ctx>

    Blanket Implementations§

    source§

    impl<T> Any for T
    where +sufficient, and should not be overridden without very good reason.

    source§

    impl<'ctx> TryFrom<AnyTypeEnum<'ctx>> for ArrayType<'ctx>

    §

    type Error = ()

    The type returned in the event of a conversion error.
    source§

    fn try_from(value: AnyTypeEnum<'ctx>) -> Result<Self, Self::Error>

    Performs the conversion.
    source§

    impl<'ctx> TryFrom<AnyTypeEnum<'ctx>> for BasicMetadataTypeEnum<'ctx>

    §

    type Error = ()

    The type returned in the event of a conversion error.
    source§

    fn try_from(value: AnyTypeEnum<'ctx>) -> Result<Self, Self::Error>

    Performs the conversion.
    source§

    impl<'ctx> TryFrom<AnyTypeEnum<'ctx>> for BasicTypeEnum<'ctx>

    §

    type Error = ()

    The type returned in the event of a conversion error.
    source§

    fn try_from(value: AnyTypeEnum<'ctx>) -> Result<Self, Self::Error>

    Performs the conversion.
    source§

    impl<'ctx> TryFrom<AnyTypeEnum<'ctx>> for FloatType<'ctx>

    §

    type Error = ()

    The type returned in the event of a conversion error.
    source§

    fn try_from(value: AnyTypeEnum<'ctx>) -> Result<Self, Self::Error>

    Performs the conversion.
    source§

    impl<'ctx> TryFrom<AnyTypeEnum<'ctx>> for FunctionType<'ctx>

    §

    type Error = ()

    The type returned in the event of a conversion error.
    source§

    fn try_from(value: AnyTypeEnum<'ctx>) -> Result<Self, Self::Error>

    Performs the conversion.
    source§

    impl<'ctx> TryFrom<AnyTypeEnum<'ctx>> for IntType<'ctx>

    §

    type Error = ()

    The type returned in the event of a conversion error.
    source§

    fn try_from(value: AnyTypeEnum<'ctx>) -> Result<Self, Self::Error>

    Performs the conversion.
    source§

    impl<'ctx> TryFrom<AnyTypeEnum<'ctx>> for PointerType<'ctx>

    §

    type Error = ()

    The type returned in the event of a conversion error.
    source§

    fn try_from(value: AnyTypeEnum<'ctx>) -> Result<Self, Self::Error>

    Performs the conversion.
    source§

    impl<'ctx> TryFrom<AnyTypeEnum<'ctx>> for StructType<'ctx>

    §

    type Error = ()

    The type returned in the event of a conversion error.
    source§

    fn try_from(value: AnyTypeEnum<'ctx>) -> Result<Self, Self::Error>

    Performs the conversion.
    source§

    impl<'ctx> TryFrom<AnyTypeEnum<'ctx>> for VectorType<'ctx>

    §

    type Error = ()

    The type returned in the event of a conversion error.
    source§

    fn try_from(value: AnyTypeEnum<'ctx>) -> Result<Self, Self::Error>

    Performs the conversion.
    source§

    impl<'ctx> TryFrom<AnyTypeEnum<'ctx>> for VoidType<'ctx>

    §

    type Error = ()

    The type returned in the event of a conversion error.
    source§

    fn try_from(value: AnyTypeEnum<'ctx>) -> Result<Self, Self::Error>

    Performs the conversion.
    source§

    impl<'ctx> Copy for AnyTypeEnum<'ctx>

    source§

    impl<'ctx> Eq for AnyTypeEnum<'ctx>

    source§

    impl<'ctx> StructuralPartialEq for AnyTypeEnum<'ctx>

    Auto Trait Implementations§

    §

    impl<'ctx> Freeze for AnyTypeEnum<'ctx>

    §

    impl<'ctx> RefUnwindSafe for AnyTypeEnum<'ctx>

    §

    impl<'ctx> !Send for AnyTypeEnum<'ctx>

    §

    impl<'ctx> !Sync for AnyTypeEnum<'ctx>

    §

    impl<'ctx> Unpin for AnyTypeEnum<'ctx>

    §

    impl<'ctx> UnwindSafe for AnyTypeEnum<'ctx>

    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/inkwell/types/enum.BasicMetadataTypeEnum.html b/inkwell/types/enum.BasicMetadataTypeEnum.html index a43f62812..494eccb35 100644 --- a/inkwell/types/enum.BasicMetadataTypeEnum.html +++ b/inkwell/types/enum.BasicMetadataTypeEnum.html @@ -8,9 +8,9 @@ VectorType(VectorType<'ctx>), MetadataType(MetadataType<'ctx>), }

    Variants§

    §

    ArrayType(ArrayType<'ctx>)

    §

    FloatType(FloatType<'ctx>)

    §

    IntType(IntType<'ctx>)

    §

    PointerType(PointerType<'ctx>)

    §

    StructType(StructType<'ctx>)

    §

    VectorType(VectorType<'ctx>)

    §

    MetadataType(MetadataType<'ctx>)

    Implementations§

    source§

    impl<'ctx> BasicMetadataTypeEnum<'ctx>

    source

    pub fn into_array_type(self) -> ArrayType<'ctx>

    source

    pub fn into_float_type(self) -> FloatType<'ctx>

    source

    pub fn into_int_type(self) -> IntType<'ctx>

    source

    pub fn into_pointer_type(self) -> PointerType<'ctx>

    source

    pub fn into_struct_type(self) -> StructType<'ctx>

    source

    pub fn into_vector_type(self) -> VectorType<'ctx>

    source

    pub fn into_metadata_type(self) -> MetadataType<'ctx>

    source

    pub fn is_array_type(self) -> bool

    source

    pub fn is_float_type(self) -> bool

    source

    pub fn is_int_type(self) -> bool

    source

    pub fn is_metadata_type(self) -> bool

    source

    pub fn is_pointer_type(self) -> bool

    source

    pub fn is_struct_type(self) -> bool

    source

    pub fn is_vector_type(self) -> bool

    source

    pub fn print_to_string(self) -> LLVMString

    Print the definition of a BasicMetadataTypeEnum to LLVMString.

    -

    Trait Implementations§

    source§

    impl AsTypeRef for BasicMetadataTypeEnum<'_>

    source§

    fn as_type_ref(&self) -> LLVMTypeRef

    Returns the internal LLVM reference behind the type
    source§

    impl<'ctx> Clone for BasicMetadataTypeEnum<'ctx>

    source§

    fn clone(&self) -> BasicMetadataTypeEnum<'ctx>

    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<'ctx> Debug for BasicMetadataTypeEnum<'ctx>

    source§

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

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

    impl Display for BasicMetadataTypeEnum<'_>

    source§

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

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

    impl<'ctx> From<ArrayType<'ctx>> for BasicMetadataTypeEnum<'ctx>

    source§

    fn from(value: ArrayType<'_>) -> BasicMetadataTypeEnum<'_>

    Converts to this type from the input type.
    source§

    impl<'ctx> From<BasicTypeEnum<'ctx>> for BasicMetadataTypeEnum<'ctx>

    source§

    fn from(value: BasicTypeEnum<'ctx>) -> Self

    Converts to this type from the input type.
    source§

    impl<'ctx> From<FloatType<'ctx>> for BasicMetadataTypeEnum<'ctx>

    source§

    fn from(value: FloatType<'_>) -> BasicMetadataTypeEnum<'_>

    Converts to this type from the input type.
    source§

    impl<'ctx> From<IntType<'ctx>> for BasicMetadataTypeEnum<'ctx>

    source§

    fn from(value: IntType<'_>) -> BasicMetadataTypeEnum<'_>

    Converts to this type from the input type.
    source§

    impl<'ctx> From<MetadataType<'ctx>> for BasicMetadataTypeEnum<'ctx>

    source§

    fn from(value: MetadataType<'_>) -> BasicMetadataTypeEnum<'_>

    Converts to this type from the input type.
    source§

    impl<'ctx> From<PointerType<'ctx>> for BasicMetadataTypeEnum<'ctx>

    source§

    fn from(value: PointerType<'_>) -> BasicMetadataTypeEnum<'_>

    Converts to this type from the input type.
    source§

    impl<'ctx> From<StructType<'ctx>> for BasicMetadataTypeEnum<'ctx>

    source§

    fn from(value: StructType<'_>) -> BasicMetadataTypeEnum<'_>

    Converts to this type from the input type.
    source§

    impl<'ctx> From<VectorType<'ctx>> for BasicMetadataTypeEnum<'ctx>

    source§

    fn from(value: VectorType<'_>) -> BasicMetadataTypeEnum<'_>

    Converts to this type from the input type.
    source§

    impl<'ctx> PartialEq for BasicMetadataTypeEnum<'ctx>

    source§

    fn eq(&self, other: &BasicMetadataTypeEnum<'ctx>) -> bool

    This method tests for self and other values to be equal, and is used +

    Trait Implementations§

    source§

    impl AsTypeRef for BasicMetadataTypeEnum<'_>

    source§

    fn as_type_ref(&self) -> LLVMTypeRef

    Returns the internal LLVM reference behind the type
    source§

    impl<'ctx> Clone for BasicMetadataTypeEnum<'ctx>

    source§

    fn clone(&self) -> BasicMetadataTypeEnum<'ctx>

    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<'ctx> Debug for BasicMetadataTypeEnum<'ctx>

    source§

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

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

    impl Display for BasicMetadataTypeEnum<'_>

    source§

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

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

    impl<'ctx> From<ArrayType<'ctx>> for BasicMetadataTypeEnum<'ctx>

    source§

    fn from(value: ArrayType<'_>) -> BasicMetadataTypeEnum<'_>

    Converts to this type from the input type.
    source§

    impl<'ctx> From<BasicTypeEnum<'ctx>> for BasicMetadataTypeEnum<'ctx>

    source§

    fn from(value: BasicTypeEnum<'ctx>) -> Self

    Converts to this type from the input type.
    source§

    impl<'ctx> From<FloatType<'ctx>> for BasicMetadataTypeEnum<'ctx>

    source§

    fn from(value: FloatType<'_>) -> BasicMetadataTypeEnum<'_>

    Converts to this type from the input type.
    source§

    impl<'ctx> From<IntType<'ctx>> for BasicMetadataTypeEnum<'ctx>

    source§

    fn from(value: IntType<'_>) -> BasicMetadataTypeEnum<'_>

    Converts to this type from the input type.
    source§

    impl<'ctx> From<MetadataType<'ctx>> for BasicMetadataTypeEnum<'ctx>

    source§

    fn from(value: MetadataType<'_>) -> BasicMetadataTypeEnum<'_>

    Converts to this type from the input type.
    source§

    impl<'ctx> From<PointerType<'ctx>> for BasicMetadataTypeEnum<'ctx>

    source§

    fn from(value: PointerType<'_>) -> BasicMetadataTypeEnum<'_>

    Converts to this type from the input type.
    source§

    impl<'ctx> From<StructType<'ctx>> for BasicMetadataTypeEnum<'ctx>

    source§

    fn from(value: StructType<'_>) -> BasicMetadataTypeEnum<'_>

    Converts to this type from the input type.
    source§

    impl<'ctx> From<VectorType<'ctx>> for BasicMetadataTypeEnum<'ctx>

    source§

    fn from(value: VectorType<'_>) -> BasicMetadataTypeEnum<'_>

    Converts to this type from the input type.
    source§

    impl<'ctx> PartialEq for BasicMetadataTypeEnum<'ctx>

    source§

    fn eq(&self, other: &BasicMetadataTypeEnum<'ctx>) -> bool

    This method tests for self and other values to be equal, and is used by ==.
    1.0.0 · source§

    fn ne(&self, other: &Rhs) -> bool

    This method tests for !=. The default implementation is almost always -sufficient, and should not be overridden without very good reason.
    source§

    impl<'ctx> TryFrom<AnyTypeEnum<'ctx>> for BasicMetadataTypeEnum<'ctx>

    §

    type Error = ()

    The type returned in the event of a conversion error.
    source§

    fn try_from(value: AnyTypeEnum<'ctx>) -> Result<Self, Self::Error>

    Performs the conversion.
    source§

    impl<'ctx> TryFrom<BasicMetadataTypeEnum<'ctx>> for ArrayType<'ctx>

    §

    type Error = ()

    The type returned in the event of a conversion error.
    source§

    fn try_from(value: BasicMetadataTypeEnum<'ctx>) -> Result<Self, Self::Error>

    Performs the conversion.
    source§

    impl<'ctx> TryFrom<BasicMetadataTypeEnum<'ctx>> for BasicTypeEnum<'ctx>

    §

    type Error = ()

    The type returned in the event of a conversion error.
    source§

    fn try_from(value: BasicMetadataTypeEnum<'ctx>) -> Result<Self, Self::Error>

    Performs the conversion.
    source§

    impl<'ctx> TryFrom<BasicMetadataTypeEnum<'ctx>> for FloatType<'ctx>

    §

    type Error = ()

    The type returned in the event of a conversion error.
    source§

    fn try_from(value: BasicMetadataTypeEnum<'ctx>) -> Result<Self, Self::Error>

    Performs the conversion.
    source§

    impl<'ctx> TryFrom<BasicMetadataTypeEnum<'ctx>> for IntType<'ctx>

    §

    type Error = ()

    The type returned in the event of a conversion error.
    source§

    fn try_from(value: BasicMetadataTypeEnum<'ctx>) -> Result<Self, Self::Error>

    Performs the conversion.
    source§

    impl<'ctx> TryFrom<BasicMetadataTypeEnum<'ctx>> for MetadataType<'ctx>

    §

    type Error = ()

    The type returned in the event of a conversion error.
    source§

    fn try_from(value: BasicMetadataTypeEnum<'ctx>) -> Result<Self, Self::Error>

    Performs the conversion.
    source§

    impl<'ctx> TryFrom<BasicMetadataTypeEnum<'ctx>> for PointerType<'ctx>

    §

    type Error = ()

    The type returned in the event of a conversion error.
    source§

    fn try_from(value: BasicMetadataTypeEnum<'ctx>) -> Result<Self, Self::Error>

    Performs the conversion.
    source§

    impl<'ctx> TryFrom<BasicMetadataTypeEnum<'ctx>> for StructType<'ctx>

    §

    type Error = ()

    The type returned in the event of a conversion error.
    source§

    fn try_from(value: BasicMetadataTypeEnum<'ctx>) -> Result<Self, Self::Error>

    Performs the conversion.
    source§

    impl<'ctx> TryFrom<BasicMetadataTypeEnum<'ctx>> for VectorType<'ctx>

    §

    type Error = ()

    The type returned in the event of a conversion error.
    source§

    fn try_from(value: BasicMetadataTypeEnum<'ctx>) -> Result<Self, Self::Error>

    Performs the conversion.
    source§

    impl<'ctx> Copy for BasicMetadataTypeEnum<'ctx>

    source§

    impl<'ctx> Eq for BasicMetadataTypeEnum<'ctx>

    source§

    impl<'ctx> StructuralPartialEq for BasicMetadataTypeEnum<'ctx>

    Auto Trait Implementations§

    §

    impl<'ctx> Freeze for BasicMetadataTypeEnum<'ctx>

    §

    impl<'ctx> RefUnwindSafe for BasicMetadataTypeEnum<'ctx>

    §

    impl<'ctx> !Send for BasicMetadataTypeEnum<'ctx>

    §

    impl<'ctx> !Sync for BasicMetadataTypeEnum<'ctx>

    §

    impl<'ctx> Unpin for BasicMetadataTypeEnum<'ctx>

    §

    impl<'ctx> UnwindSafe for BasicMetadataTypeEnum<'ctx>

    Blanket Implementations§

    source§

    impl<T> Any for T
    where +sufficient, and should not be overridden without very good reason.

    source§

    impl<'ctx> TryFrom<AnyTypeEnum<'ctx>> for BasicMetadataTypeEnum<'ctx>

    §

    type Error = ()

    The type returned in the event of a conversion error.
    source§

    fn try_from(value: AnyTypeEnum<'ctx>) -> Result<Self, Self::Error>

    Performs the conversion.
    source§

    impl<'ctx> TryFrom<BasicMetadataTypeEnum<'ctx>> for ArrayType<'ctx>

    §

    type Error = ()

    The type returned in the event of a conversion error.
    source§

    fn try_from(value: BasicMetadataTypeEnum<'ctx>) -> Result<Self, Self::Error>

    Performs the conversion.
    source§

    impl<'ctx> TryFrom<BasicMetadataTypeEnum<'ctx>> for BasicTypeEnum<'ctx>

    §

    type Error = ()

    The type returned in the event of a conversion error.
    source§

    fn try_from(value: BasicMetadataTypeEnum<'ctx>) -> Result<Self, Self::Error>

    Performs the conversion.
    source§

    impl<'ctx> TryFrom<BasicMetadataTypeEnum<'ctx>> for FloatType<'ctx>

    §

    type Error = ()

    The type returned in the event of a conversion error.
    source§

    fn try_from(value: BasicMetadataTypeEnum<'ctx>) -> Result<Self, Self::Error>

    Performs the conversion.
    source§

    impl<'ctx> TryFrom<BasicMetadataTypeEnum<'ctx>> for IntType<'ctx>

    §

    type Error = ()

    The type returned in the event of a conversion error.
    source§

    fn try_from(value: BasicMetadataTypeEnum<'ctx>) -> Result<Self, Self::Error>

    Performs the conversion.
    source§

    impl<'ctx> TryFrom<BasicMetadataTypeEnum<'ctx>> for MetadataType<'ctx>

    §

    type Error = ()

    The type returned in the event of a conversion error.
    source§

    fn try_from(value: BasicMetadataTypeEnum<'ctx>) -> Result<Self, Self::Error>

    Performs the conversion.
    source§

    impl<'ctx> TryFrom<BasicMetadataTypeEnum<'ctx>> for PointerType<'ctx>

    §

    type Error = ()

    The type returned in the event of a conversion error.
    source§

    fn try_from(value: BasicMetadataTypeEnum<'ctx>) -> Result<Self, Self::Error>

    Performs the conversion.
    source§

    impl<'ctx> TryFrom<BasicMetadataTypeEnum<'ctx>> for StructType<'ctx>

    §

    type Error = ()

    The type returned in the event of a conversion error.
    source§

    fn try_from(value: BasicMetadataTypeEnum<'ctx>) -> Result<Self, Self::Error>

    Performs the conversion.
    source§

    impl<'ctx> TryFrom<BasicMetadataTypeEnum<'ctx>> for VectorType<'ctx>

    §

    type Error = ()

    The type returned in the event of a conversion error.
    source§

    fn try_from(value: BasicMetadataTypeEnum<'ctx>) -> Result<Self, Self::Error>

    Performs the conversion.
    source§

    impl<'ctx> Copy for BasicMetadataTypeEnum<'ctx>

    source§

    impl<'ctx> Eq for BasicMetadataTypeEnum<'ctx>

    source§

    impl<'ctx> StructuralPartialEq for BasicMetadataTypeEnum<'ctx>

    Auto Trait Implementations§

    §

    impl<'ctx> Freeze for BasicMetadataTypeEnum<'ctx>

    §

    impl<'ctx> RefUnwindSafe for BasicMetadataTypeEnum<'ctx>

    §

    impl<'ctx> !Send for BasicMetadataTypeEnum<'ctx>

    §

    impl<'ctx> !Sync for BasicMetadataTypeEnum<'ctx>

    §

    impl<'ctx> Unpin for BasicMetadataTypeEnum<'ctx>

    §

    impl<'ctx> UnwindSafe for BasicMetadataTypeEnum<'ctx>

    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/inkwell/types/enum.BasicTypeEnum.html b/inkwell/types/enum.BasicTypeEnum.html index 78a353458..881a5c4f7 100644 --- a/inkwell/types/enum.BasicTypeEnum.html +++ b/inkwell/types/enum.BasicTypeEnum.html @@ -30,9 +30,9 @@ param_types: &[BasicMetadataTypeEnum<'ctx>], is_var_args: bool ) -> FunctionType<'ctx>

    Create a FunctionType with this BasicType as its return type. Read more
    source§

    fn is_sized(&self) -> bool

    Determines whether or not this BasicType is sized or not. -For example, opaque structs are unsized. Read more
    source§

    fn size_of(&self) -> Option<IntValue<'ctx>>

    Gets the size of this BasicType. Value may vary depending on the target architecture. Read more
    source§

    fn array_type(&self, size: u32) -> ArrayType<'ctx>

    Create an ArrayType with this BasicType as its elements. Read more
    source§

    fn ptr_type(&self, address_space: AddressSpace) -> PointerType<'ctx>

    👎Deprecated: Starting from version 15.0, LLVM doesn’t differentiate between pointer types. Use Context::ptr_type instead.
    Create a PointerType that points to this BasicType. Read more

    source§

    impl<'ctx> Clone for BasicTypeEnum<'ctx>

    source§

    fn clone(&self) -> BasicTypeEnum<'ctx>

    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<'ctx> Debug for BasicTypeEnum<'ctx>

    source§

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

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

    impl Display for BasicTypeEnum<'_>

    source§

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

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

    impl<'ctx> From<ArrayType<'ctx>> for BasicTypeEnum<'ctx>

    source§

    fn from(value: ArrayType<'_>) -> BasicTypeEnum<'_>

    Converts to this type from the input type.
    source§

    impl<'ctx> From<BasicTypeEnum<'ctx>> for BasicMetadataTypeEnum<'ctx>

    source§

    fn from(value: BasicTypeEnum<'ctx>) -> Self

    Converts to this type from the input type.
    source§

    impl<'ctx> From<FloatType<'ctx>> for BasicTypeEnum<'ctx>

    source§

    fn from(value: FloatType<'_>) -> BasicTypeEnum<'_>

    Converts to this type from the input type.
    source§

    impl<'ctx> From<IntType<'ctx>> for BasicTypeEnum<'ctx>

    source§

    fn from(value: IntType<'_>) -> BasicTypeEnum<'_>

    Converts to this type from the input type.
    source§

    impl<'ctx> From<PointerType<'ctx>> for BasicTypeEnum<'ctx>

    source§

    fn from(value: PointerType<'_>) -> BasicTypeEnum<'_>

    Converts to this type from the input type.
    source§

    impl<'ctx> From<StructType<'ctx>> for BasicTypeEnum<'ctx>

    source§

    fn from(value: StructType<'_>) -> BasicTypeEnum<'_>

    Converts to this type from the input type.
    source§

    impl<'ctx> From<VectorType<'ctx>> for BasicTypeEnum<'ctx>

    source§

    fn from(value: VectorType<'_>) -> BasicTypeEnum<'_>

    Converts to this type from the input type.
    source§

    impl<'ctx> PartialEq for BasicTypeEnum<'ctx>

    source§

    fn eq(&self, other: &BasicTypeEnum<'ctx>) -> bool

    This method tests for self and other values to be equal, and is used +For example, opaque structs are unsized. Read more
    source§

    fn size_of(&self) -> Option<IntValue<'ctx>>

    Gets the size of this BasicType. Value may vary depending on the target architecture. Read more
    source§

    fn array_type(&self, size: u32) -> ArrayType<'ctx>

    Create an ArrayType with this BasicType as its elements. Read more
    source§

    fn ptr_type(&self, address_space: AddressSpace) -> PointerType<'ctx>

    👎Deprecated: Starting from version 15.0, LLVM doesn’t differentiate between pointer types. Use Context::ptr_type instead.
    Create a PointerType that points to this BasicType. Read more
    source§

    impl<'ctx> Clone for BasicTypeEnum<'ctx>

    source§

    fn clone(&self) -> BasicTypeEnum<'ctx>

    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<'ctx> Debug for BasicTypeEnum<'ctx>

    source§

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

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

    impl Display for BasicTypeEnum<'_>

    source§

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

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

    impl<'ctx> From<ArrayType<'ctx>> for BasicTypeEnum<'ctx>

    source§

    fn from(value: ArrayType<'_>) -> BasicTypeEnum<'_>

    Converts to this type from the input type.
    source§

    impl<'ctx> From<BasicTypeEnum<'ctx>> for BasicMetadataTypeEnum<'ctx>

    source§

    fn from(value: BasicTypeEnum<'ctx>) -> Self

    Converts to this type from the input type.
    source§

    impl<'ctx> From<FloatType<'ctx>> for BasicTypeEnum<'ctx>

    source§

    fn from(value: FloatType<'_>) -> BasicTypeEnum<'_>

    Converts to this type from the input type.
    source§

    impl<'ctx> From<IntType<'ctx>> for BasicTypeEnum<'ctx>

    source§

    fn from(value: IntType<'_>) -> BasicTypeEnum<'_>

    Converts to this type from the input type.
    source§

    impl<'ctx> From<PointerType<'ctx>> for BasicTypeEnum<'ctx>

    source§

    fn from(value: PointerType<'_>) -> BasicTypeEnum<'_>

    Converts to this type from the input type.
    source§

    impl<'ctx> From<StructType<'ctx>> for BasicTypeEnum<'ctx>

    source§

    fn from(value: StructType<'_>) -> BasicTypeEnum<'_>

    Converts to this type from the input type.
    source§

    impl<'ctx> From<VectorType<'ctx>> for BasicTypeEnum<'ctx>

    source§

    fn from(value: VectorType<'_>) -> BasicTypeEnum<'_>

    Converts to this type from the input type.
    source§

    impl<'ctx> PartialEq for BasicTypeEnum<'ctx>

    source§

    fn eq(&self, other: &BasicTypeEnum<'ctx>) -> bool

    This method tests for self and other values to be equal, and is used by ==.
    1.0.0 · source§

    fn ne(&self, other: &Rhs) -> bool

    This method tests for !=. The default implementation is almost always -sufficient, and should not be overridden without very good reason.
    source§

    impl<'ctx> TryFrom<AnyTypeEnum<'ctx>> for BasicTypeEnum<'ctx>

    §

    type Error = ()

    The type returned in the event of a conversion error.
    source§

    fn try_from(value: AnyTypeEnum<'ctx>) -> Result<Self, Self::Error>

    Performs the conversion.
    source§

    impl<'ctx> TryFrom<BasicMetadataTypeEnum<'ctx>> for BasicTypeEnum<'ctx>

    §

    type Error = ()

    The type returned in the event of a conversion error.
    source§

    fn try_from(value: BasicMetadataTypeEnum<'ctx>) -> Result<Self, Self::Error>

    Performs the conversion.
    source§

    impl<'ctx> TryFrom<BasicTypeEnum<'ctx>> for ArrayType<'ctx>

    §

    type Error = ()

    The type returned in the event of a conversion error.
    source§

    fn try_from(value: BasicTypeEnum<'ctx>) -> Result<Self, Self::Error>

    Performs the conversion.
    source§

    impl<'ctx> TryFrom<BasicTypeEnum<'ctx>> for FloatType<'ctx>

    §

    type Error = ()

    The type returned in the event of a conversion error.
    source§

    fn try_from(value: BasicTypeEnum<'ctx>) -> Result<Self, Self::Error>

    Performs the conversion.
    source§

    impl<'ctx> TryFrom<BasicTypeEnum<'ctx>> for IntType<'ctx>

    §

    type Error = ()

    The type returned in the event of a conversion error.
    source§

    fn try_from(value: BasicTypeEnum<'ctx>) -> Result<Self, Self::Error>

    Performs the conversion.
    source§

    impl<'ctx> TryFrom<BasicTypeEnum<'ctx>> for PointerType<'ctx>

    §

    type Error = ()

    The type returned in the event of a conversion error.
    source§

    fn try_from(value: BasicTypeEnum<'ctx>) -> Result<Self, Self::Error>

    Performs the conversion.
    source§

    impl<'ctx> TryFrom<BasicTypeEnum<'ctx>> for StructType<'ctx>

    §

    type Error = ()

    The type returned in the event of a conversion error.
    source§

    fn try_from(value: BasicTypeEnum<'ctx>) -> Result<Self, Self::Error>

    Performs the conversion.
    source§

    impl<'ctx> TryFrom<BasicTypeEnum<'ctx>> for VectorType<'ctx>

    §

    type Error = ()

    The type returned in the event of a conversion error.
    source§

    fn try_from(value: BasicTypeEnum<'ctx>) -> Result<Self, Self::Error>

    Performs the conversion.
    source§

    impl<'ctx> Copy for BasicTypeEnum<'ctx>

    source§

    impl<'ctx> Eq for BasicTypeEnum<'ctx>

    source§

    impl<'ctx> StructuralPartialEq for BasicTypeEnum<'ctx>

    Auto Trait Implementations§

    §

    impl<'ctx> Freeze for BasicTypeEnum<'ctx>

    §

    impl<'ctx> RefUnwindSafe for BasicTypeEnum<'ctx>

    §

    impl<'ctx> !Send for BasicTypeEnum<'ctx>

    §

    impl<'ctx> !Sync for BasicTypeEnum<'ctx>

    §

    impl<'ctx> Unpin for BasicTypeEnum<'ctx>

    §

    impl<'ctx> UnwindSafe for BasicTypeEnum<'ctx>

    Blanket Implementations§

    source§

    impl<T> Any for T
    where +sufficient, and should not be overridden without very good reason.

    source§

    impl<'ctx> TryFrom<AnyTypeEnum<'ctx>> for BasicTypeEnum<'ctx>

    §

    type Error = ()

    The type returned in the event of a conversion error.
    source§

    fn try_from(value: AnyTypeEnum<'ctx>) -> Result<Self, Self::Error>

    Performs the conversion.
    source§

    impl<'ctx> TryFrom<BasicMetadataTypeEnum<'ctx>> for BasicTypeEnum<'ctx>

    §

    type Error = ()

    The type returned in the event of a conversion error.
    source§

    fn try_from(value: BasicMetadataTypeEnum<'ctx>) -> Result<Self, Self::Error>

    Performs the conversion.
    source§

    impl<'ctx> TryFrom<BasicTypeEnum<'ctx>> for ArrayType<'ctx>

    §

    type Error = ()

    The type returned in the event of a conversion error.
    source§

    fn try_from(value: BasicTypeEnum<'ctx>) -> Result<Self, Self::Error>

    Performs the conversion.
    source§

    impl<'ctx> TryFrom<BasicTypeEnum<'ctx>> for FloatType<'ctx>

    §

    type Error = ()

    The type returned in the event of a conversion error.
    source§

    fn try_from(value: BasicTypeEnum<'ctx>) -> Result<Self, Self::Error>

    Performs the conversion.
    source§

    impl<'ctx> TryFrom<BasicTypeEnum<'ctx>> for IntType<'ctx>

    §

    type Error = ()

    The type returned in the event of a conversion error.
    source§

    fn try_from(value: BasicTypeEnum<'ctx>) -> Result<Self, Self::Error>

    Performs the conversion.
    source§

    impl<'ctx> TryFrom<BasicTypeEnum<'ctx>> for PointerType<'ctx>

    §

    type Error = ()

    The type returned in the event of a conversion error.
    source§

    fn try_from(value: BasicTypeEnum<'ctx>) -> Result<Self, Self::Error>

    Performs the conversion.
    source§

    impl<'ctx> TryFrom<BasicTypeEnum<'ctx>> for StructType<'ctx>

    §

    type Error = ()

    The type returned in the event of a conversion error.
    source§

    fn try_from(value: BasicTypeEnum<'ctx>) -> Result<Self, Self::Error>

    Performs the conversion.
    source§

    impl<'ctx> TryFrom<BasicTypeEnum<'ctx>> for VectorType<'ctx>

    §

    type Error = ()

    The type returned in the event of a conversion error.
    source§

    fn try_from(value: BasicTypeEnum<'ctx>) -> Result<Self, Self::Error>

    Performs the conversion.
    source§

    impl<'ctx> Copy for BasicTypeEnum<'ctx>

    source§

    impl<'ctx> Eq for BasicTypeEnum<'ctx>

    source§

    impl<'ctx> StructuralPartialEq for BasicTypeEnum<'ctx>

    Auto Trait Implementations§

    §

    impl<'ctx> Freeze for BasicTypeEnum<'ctx>

    §

    impl<'ctx> RefUnwindSafe for BasicTypeEnum<'ctx>

    §

    impl<'ctx> !Send for BasicTypeEnum<'ctx>

    §

    impl<'ctx> !Sync for BasicTypeEnum<'ctx>

    §

    impl<'ctx> Unpin for BasicTypeEnum<'ctx>

    §

    impl<'ctx> UnwindSafe for BasicTypeEnum<'ctx>

    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/inkwell/types/enum.StringRadix.html b/inkwell/types/enum.StringRadix.html index 454566f6e..56d2d9431 100644 --- a/inkwell/types/enum.StringRadix.html +++ b/inkwell/types/enum.StringRadix.html @@ -1,5 +1,5 @@ StringRadix in inkwell::types - Rust
    -

    Enum inkwell::types::StringRadix

    source · 
    pub enum StringRadix {
+    
    Enum inkwell::types::StringRadix
    source · 
    pub enum StringRadix {
     Binary = 2,
     Octal = 8,
     Decimal = 10,
@@ -11,12 +11,12 @@
 
    §
    Decimal = 10
    Decimal 0-9
    
 
    §
    Hexadecimal = 16
    Hexadecimal with upper or lowercase letters up to F.
    
 
    §
    Alphanumeric = 36
    Alphanumeric, 0-9 and all 26 letters in upper or lowercase.
    
-

    Implementations§

    source§

    impl StringRadix

    source

    pub fn matches_str(&self, slice: &str) -> bool

    Is the string valid for the given radix?

    -

    Trait Implementations§

    source§

    impl Clone for StringRadix

    source§

    fn clone(&self) -> StringRadix

    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 StringRadix

    source§

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

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

    impl Hash for StringRadix

    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 +

    Implementations§

    source§

    impl StringRadix

    source

    pub fn matches_str(&self, slice: &str) -> bool

    Is the string valid for the given radix?

    +

    Trait Implementations§

    source§

    impl Clone for StringRadix

    source§

    fn clone(&self) -> StringRadix

    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 StringRadix

    source§

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

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

    impl Hash for StringRadix

    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 StringRadix

    source§

    fn eq(&self, other: &StringRadix) -> bool

    This method tests for self and other values to be equal, and is used + Self: Sized,

    Feeds a slice of this type into the given Hasher. Read more
    source§

    impl PartialEq for StringRadix

    source§

    fn eq(&self, other: &StringRadix) -> bool

    This method tests for self and other values to be equal, and is used by ==.
    1.0.0 · source§

    fn ne(&self, other: &Rhs) -> bool

    This method tests for !=. The default implementation is almost always -sufficient, and should not be overridden without very good reason.
    source§

    impl TryFrom<u8> for StringRadix

    §

    type Error = ()

    The type returned in the event of a conversion error.
    source§

    fn try_from(value: u8) -> Result<Self, Self::Error>

    Performs the conversion.
    source§

    impl Copy for StringRadix

    source§

    impl Eq for StringRadix

    source§

    impl StructuralPartialEq for StringRadix

    Auto Trait Implementations§

    Blanket Implementations§

    source§

    impl<T> Any for T
    where +sufficient, and should not be overridden without very good reason.

    source§

    impl TryFrom<u8> for StringRadix

    §

    type Error = ()

    The type returned in the event of a conversion error.
    source§

    fn try_from(value: u8) -> Result<Self, Self::Error>

    Performs the conversion.
    source§

    impl Copy for StringRadix

    source§

    impl Eq for StringRadix

    source§

    impl StructuralPartialEq for StringRadix

    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/inkwell/types/index.html b/inkwell/types/index.html index 79f735fef..68bcd4c90 100644 --- a/inkwell/types/index.html +++ b/inkwell/types/index.html @@ -1,4 +1,4 @@ inkwell::types - Rust
    -

    Module inkwell::types

    source ·
    Expand description

    A type is a classification which determines how data is used.

    +

    Module inkwell::types

    source ·
    Expand description

    A type is a classification which determines how data is used.

    Structs§

    • ArrayType
      An ArrayType is the type of contiguous constants or variables.
    • FieldTypesIter
      Iterate over all BasicTypeEnums in a struct.
    • FloatType
      A FloatType is the type of a floating point constant or variable.
    • FunctionType
      A FunctionType is the type of a function variable.
    • IntType
      An IntType is the type of an integer constant or variable.
    • MetadataType
      A MetadataType is the type of a metadata.
    • PointerType
      A PointerType is the type of a pointer constant or variable.
    • StructType
      A StructType is the type of a heterogeneous container of types.
    • VectorType
      A VectorType is the type of a multiple value SIMD constant or variable.
    • VoidType
      A VoidType is a special type with no possible direct instances. It’s only useful as a function return type.

    Enums§

    Traits§

    • AnyType
      Represents any LLVM type.
    • AsTypeRef
      Accessor to the inner LLVM type reference
    • BasicType
      Represents a basic LLVM type, that may be used in functions and struct definitions.
    • FloatMathType
      Represents an LLVM type that can have floating point math operations applied to it.
    • IntMathType
      Represents an LLVM type that can have integer math operations applied to it.
    • PointerMathType
      Represents an LLVM type that can have pointer operations applied to it.
    \ No newline at end of file diff --git a/inkwell/types/struct.ArrayType.html b/inkwell/types/struct.ArrayType.html index 6bedc5128..eae9d89e2 100644 --- a/inkwell/types/struct.ArrayType.html +++ b/inkwell/types/struct.ArrayType.html @@ -1,9 +1,9 @@ -ArrayType in inkwell::types - Rust
    -

    Struct inkwell::types::ArrayType

    source · 
    pub struct ArrayType<'ctx> { /* private fields */ }
    Expand description

    An ArrayType is the type of contiguous constants or variables.

    -

    Implementations§

    source§

    impl<'ctx> ArrayType<'ctx>

    source

    pub unsafe fn new(array_type: LLVMTypeRef) -> Self

    Create ArrayType from LLVMTypeRef

    +ArrayType in inkwell::types - Rust
    +

    Struct inkwell::types::ArrayType

    source · 
    pub struct ArrayType<'ctx> { /* private fields */ }
    Expand description

    An ArrayType is the type of contiguous constants or variables.

    +

    Implementations§

    source§

    impl<'ctx> ArrayType<'ctx>

    source

    pub unsafe fn new(array_type: LLVMTypeRef) -> Self

    Create ArrayType from LLVMTypeRef

    §Safety

    Undefined behavior, if referenced type isn’t array type

    -
    source

    pub fn size_of(self) -> Option<IntValue<'ctx>>

    Gets the size of this ArrayType. Value may vary depending on the target architecture.

    +
    source

    pub fn size_of(self) -> Option<IntValue<'ctx>>

    Gets the size of this ArrayType. Value may vary depending on the target architecture.

    §Example
    use inkwell::context::Context;
 
@@ -11,7 +11,7 @@
 let i8_type = context.i8_type();
 let i8_array_type = i8_type.array_type(3);
 let i8_array_type_size = i8_array_type.size_of();
    -
    source

    pub fn get_alignment(self) -> IntValue<'ctx>

    Gets the alignment of this ArrayType. Value may vary depending on the target architecture.

    +
    source

    pub fn get_alignment(self) -> IntValue<'ctx>

    Gets the alignment of this ArrayType. Value may vary depending on the target architecture.

    §Example
    use inkwell::context::Context;
 
@@ -19,7 +19,7 @@
 let i8_type = context.i8_type();
 let i8_array_type = i8_type.array_type(3);
 let i8_array_type_alignment = i8_array_type.get_alignment();
    -
    source

    pub fn ptr_type(self, address_space: AddressSpace) -> PointerType<'ctx>

    👎Deprecated: Starting from version 15.0, LLVM doesn’t differentiate between pointer types. Use Context::ptr_type instead.

    Creates a PointerType with this ArrayType for its element type.

    +
    source

    pub fn ptr_type(self, address_space: AddressSpace) -> PointerType<'ctx>

    👎Deprecated: Starting from version 15.0, LLVM doesn’t differentiate between pointer types. Use Context::ptr_type instead.

    Creates a PointerType with this ArrayType for its element type.

    §Example
    use inkwell::context::Context;
 use inkwell::AddressSpace;
@@ -43,7 +43,7 @@
     feature = "llvm14-0"
 ))]
 assert_eq!(i8_array_ptr_type.get_element_type().into_array_type(), i8_array_type);
    -
    source

    pub fn get_context(self) -> ContextRef<'ctx>

    Gets a reference to the Context this ArrayType was created in.

    +
    source

    pub fn get_context(self) -> ContextRef<'ctx>

    Gets a reference to the Context this ArrayType was created in.

    §Example
    use inkwell::context::Context;
 
@@ -52,7 +52,7 @@
 let i8_array_type = i8_type.array_type(3);
 
 assert_eq!(i8_array_type.get_context(), context);
    -
    source

    pub fn fn_type( +

    source

    pub fn fn_type( self, param_types: &[BasicMetadataTypeEnum<'ctx>], is_var_args: bool @@ -64,7 +64,7 @@ let i8_type = context.i8_type(); let i8_array_type = i8_type.array_type(3); let fn_type = i8_array_type.fn_type(&[], false);

    -
    source

    pub fn array_type(self, size: u32) -> ArrayType<'ctx>

    Creates an ArrayType with this ArrayType for its element type.

    +
    source

    pub fn array_type(self, size: u32) -> ArrayType<'ctx>

    Creates an ArrayType with this ArrayType for its element type.

    §Example
    use inkwell::context::Context;
 
@@ -75,7 +75,7 @@
 
 assert_eq!(i8_array_array_type.len(), 3);
 assert_eq!(i8_array_array_type.get_element_type().into_array_type(), i8_array_type);
    -
    source

    pub fn const_array(self, values: &[ArrayValue<'ctx>]) -> ArrayValue<'ctx>

    Creates a constant ArrayValue.

    +
    source

    pub fn const_array(self, values: &[ArrayValue<'ctx>]) -> ArrayValue<'ctx>

    Creates a constant ArrayValue of ArrayValues.

    §Example
    use inkwell::context::Context;
 
@@ -86,7 +86,7 @@
 let f32_array_array = f32_array_type.const_array(&[f32_array_val, f32_array_val]);
 
 assert!(f32_array_array.is_const());
    -
    source

    pub fn const_zero(self) -> ArrayValue<'ctx>

    Creates a constant zero value of this ArrayType.

    +
    source

    pub fn const_zero(self) -> ArrayValue<'ctx>

    Creates a constant zero value of this ArrayType.

    §Example
    use inkwell::context::Context;
 
@@ -94,7 +94,7 @@
 let i8_type = context.i8_type();
 let i8_array_type = i8_type.array_type(3);
 let i8_array_zero = i8_array_type.const_zero();
    -
    source

    pub fn len(self) -> u32

    Gets the length of this ArrayType.

    +
    source

    pub fn len(self) -> u32

    Gets the length of this ArrayType.

    §Example
    use inkwell::context::Context;
 
@@ -103,8 +103,9 @@
 let i8_array_type = i8_type.array_type(3);
 
 assert_eq!(i8_array_type.len(), 3);
    -
    source

    pub fn print_to_string(self) -> LLVMString

    Print the definition of an ArrayType to LLVMString

    -
    source

    pub fn get_undef(self) -> ArrayValue<'ctx>

    Creates an undefined instance of a ArrayType.

    +
    source

    pub fn is_empty(self) -> bool

    Returns true if this ArrayType contains no elements.

    +
    source

    pub fn print_to_string(self) -> LLVMString

    Print the definition of an ArrayType to LLVMString

    +
    source

    pub fn get_undef(self) -> ArrayValue<'ctx>

    Creates an undefined instance of a ArrayType.

    §Example
    use inkwell::context::Context;
 
@@ -114,7 +115,7 @@
 let i8_array_undef = i8_array_type.get_undef();
 
 assert!(i8_array_undef.is_undef());
    -
    source

    pub fn get_poison(self) -> ArrayValue<'ctx>

    Creates a poison instance of a ArrayType.

    +
    source

    pub fn get_poison(self) -> ArrayValue<'ctx>

    Creates a poison instance of a ArrayType.

    §Example
    use inkwell::context::Context;
 use inkwell::values::AnyValue;
@@ -125,7 +126,7 @@
 let i8_array_poison = i8_array_type.get_poison();
 
 assert!(i8_array_poison.is_poison());
    -
    source

    pub fn get_element_type(self) -> BasicTypeEnum<'ctx>

    Gets the element type of this ArrayType.

    +
    source

    pub fn get_element_type(self) -> BasicTypeEnum<'ctx>

    Gets the element type of this ArrayType.

    §Example
    use inkwell::context::Context;
 
@@ -134,14 +135,14 @@
 let i8_array_type = i8_type.array_type(3);
 
 assert_eq!(i8_array_type.get_element_type().into_int_type(), i8_type);
    -

    Trait Implementations§

    source§

    impl<'ctx> AnyType<'ctx> for ArrayType<'ctx>

    source§

    fn as_any_type_enum(&self) -> AnyTypeEnum<'ctx>

    Returns an AnyTypeEnum that represents the current type.
    source§

    fn print_to_string(&self) -> LLVMString

    Prints the definition of a Type to a LLVMString.
    source§

    impl AsTypeRef for ArrayType<'_>

    source§

    fn as_type_ref(&self) -> LLVMTypeRef

    Returns the internal LLVM reference behind the type
    source§

    impl<'ctx> BasicType<'ctx> for ArrayType<'ctx>

    source§

    fn as_basic_type_enum(&self) -> BasicTypeEnum<'ctx>

    Returns a BasicTypeEnum that represents the current type.
    source§

    fn fn_type( +

    Trait Implementations§

    source§

    impl<'ctx> AnyType<'ctx> for ArrayType<'ctx>

    source§

    fn as_any_type_enum(&self) -> AnyTypeEnum<'ctx>

    Returns an AnyTypeEnum that represents the current type.
    source§

    fn print_to_string(&self) -> LLVMString

    Prints the definition of a Type to a LLVMString.
    source§

    impl AsTypeRef for ArrayType<'_>

    source§

    fn as_type_ref(&self) -> LLVMTypeRef

    Returns the internal LLVM reference behind the type
    source§

    impl<'ctx> BasicType<'ctx> for ArrayType<'ctx>

    source§

    fn as_basic_type_enum(&self) -> BasicTypeEnum<'ctx>

    Returns a BasicTypeEnum that represents the current type.
    source§

    fn fn_type( &self, param_types: &[BasicMetadataTypeEnum<'ctx>], is_var_args: bool ) -> FunctionType<'ctx>

    Create a FunctionType with this BasicType as its return type. Read more
    source§

    fn is_sized(&self) -> bool

    Determines whether or not this BasicType is sized or not. -For example, opaque structs are unsized. Read more
    source§

    fn size_of(&self) -> Option<IntValue<'ctx>>

    Gets the size of this BasicType. Value may vary depending on the target architecture. Read more
    source§

    fn array_type(&self, size: u32) -> ArrayType<'ctx>

    Create an ArrayType with this BasicType as its elements. Read more
    source§

    fn ptr_type(&self, address_space: AddressSpace) -> PointerType<'ctx>

    👎Deprecated: Starting from version 15.0, LLVM doesn’t differentiate between pointer types. Use Context::ptr_type instead.
    Create a PointerType that points to this BasicType. Read more
    source§

    impl<'ctx> Clone for ArrayType<'ctx>

    source§

    fn clone(&self) -> ArrayType<'ctx>

    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<'ctx> Debug for ArrayType<'ctx>

    source§

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

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

    impl Display for ArrayType<'_>

    source§

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

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

    impl<'ctx> From<ArrayType<'ctx>> for AnyTypeEnum<'ctx>

    source§

    fn from(value: ArrayType<'_>) -> AnyTypeEnum<'_>

    Converts to this type from the input type.
    source§

    impl<'ctx> From<ArrayType<'ctx>> for BasicMetadataTypeEnum<'ctx>

    source§

    fn from(value: ArrayType<'_>) -> BasicMetadataTypeEnum<'_>

    Converts to this type from the input type.
    source§

    impl<'ctx> From<ArrayType<'ctx>> for BasicTypeEnum<'ctx>

    source§

    fn from(value: ArrayType<'_>) -> BasicTypeEnum<'_>

    Converts to this type from the input type.
    source§

    impl<'ctx> PartialEq for ArrayType<'ctx>

    source§

    fn eq(&self, other: &ArrayType<'ctx>) -> bool

    This method tests for self and other values to be equal, and is used +For example, opaque structs are unsized. Read more
    source§

    fn size_of(&self) -> Option<IntValue<'ctx>>

    Gets the size of this BasicType. Value may vary depending on the target architecture. Read more
    source§

    fn array_type(&self, size: u32) -> ArrayType<'ctx>

    Create an ArrayType with this BasicType as its elements. Read more
    source§

    fn ptr_type(&self, address_space: AddressSpace) -> PointerType<'ctx>

    👎Deprecated: Starting from version 15.0, LLVM doesn’t differentiate between pointer types. Use Context::ptr_type instead.
    Create a PointerType that points to this BasicType. Read more
    source§

    impl<'ctx> Clone for ArrayType<'ctx>

    source§

    fn clone(&self) -> ArrayType<'ctx>

    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<'ctx> Debug for ArrayType<'ctx>

    source§

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

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

    impl Display for ArrayType<'_>

    source§

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

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

    impl<'ctx> From<ArrayType<'ctx>> for AnyTypeEnum<'ctx>

    source§

    fn from(value: ArrayType<'_>) -> AnyTypeEnum<'_>

    Converts to this type from the input type.
    source§

    impl<'ctx> From<ArrayType<'ctx>> for BasicMetadataTypeEnum<'ctx>

    source§

    fn from(value: ArrayType<'_>) -> BasicMetadataTypeEnum<'_>

    Converts to this type from the input type.
    source§

    impl<'ctx> From<ArrayType<'ctx>> for BasicTypeEnum<'ctx>

    source§

    fn from(value: ArrayType<'_>) -> BasicTypeEnum<'_>

    Converts to this type from the input type.
    source§

    impl<'ctx> PartialEq for ArrayType<'ctx>

    source§

    fn eq(&self, other: &ArrayType<'ctx>) -> bool

    This method tests for self and other values to be equal, and is used by ==.
    1.0.0 · source§

    fn ne(&self, other: &Rhs) -> bool

    This method tests for !=. The default implementation is almost always -sufficient, and should not be overridden without very good reason.
    source§

    impl<'ctx> TryFrom<AnyTypeEnum<'ctx>> for ArrayType<'ctx>

    §

    type Error = ()

    The type returned in the event of a conversion error.
    source§

    fn try_from(value: AnyTypeEnum<'ctx>) -> Result<Self, Self::Error>

    Performs the conversion.
    source§

    impl<'ctx> TryFrom<BasicMetadataTypeEnum<'ctx>> for ArrayType<'ctx>

    §

    type Error = ()

    The type returned in the event of a conversion error.
    source§

    fn try_from(value: BasicMetadataTypeEnum<'ctx>) -> Result<Self, Self::Error>

    Performs the conversion.
    source§

    impl<'ctx> TryFrom<BasicTypeEnum<'ctx>> for ArrayType<'ctx>

    §

    type Error = ()

    The type returned in the event of a conversion error.
    source§

    fn try_from(value: BasicTypeEnum<'ctx>) -> Result<Self, Self::Error>

    Performs the conversion.
    source§

    impl<'ctx> Copy for ArrayType<'ctx>

    source§

    impl<'ctx> Eq for ArrayType<'ctx>

    source§

    impl<'ctx> StructuralPartialEq for ArrayType<'ctx>

    Auto Trait Implementations§

    §

    impl<'ctx> Freeze for ArrayType<'ctx>

    §

    impl<'ctx> RefUnwindSafe for ArrayType<'ctx>

    §

    impl<'ctx> !Send for ArrayType<'ctx>

    §

    impl<'ctx> !Sync for ArrayType<'ctx>

    §

    impl<'ctx> Unpin for ArrayType<'ctx>

    §

    impl<'ctx> UnwindSafe for ArrayType<'ctx>

    Blanket Implementations§

    source§

    impl<T> Any for T
    where +sufficient, and should not be overridden without very good reason.

    source§

    impl<'ctx> TryFrom<AnyTypeEnum<'ctx>> for ArrayType<'ctx>

    §

    type Error = ()

    The type returned in the event of a conversion error.
    source§

    fn try_from(value: AnyTypeEnum<'ctx>) -> Result<Self, Self::Error>

    Performs the conversion.
    source§

    impl<'ctx> TryFrom<BasicMetadataTypeEnum<'ctx>> for ArrayType<'ctx>

    §

    type Error = ()

    The type returned in the event of a conversion error.
    source§

    fn try_from(value: BasicMetadataTypeEnum<'ctx>) -> Result<Self, Self::Error>

    Performs the conversion.
    source§

    impl<'ctx> TryFrom<BasicTypeEnum<'ctx>> for ArrayType<'ctx>

    §

    type Error = ()

    The type returned in the event of a conversion error.
    source§

    fn try_from(value: BasicTypeEnum<'ctx>) -> Result<Self, Self::Error>

    Performs the conversion.
    source§

    impl<'ctx> Copy for ArrayType<'ctx>

    source§

    impl<'ctx> Eq for ArrayType<'ctx>

    source§

    impl<'ctx> StructuralPartialEq for ArrayType<'ctx>

    Auto Trait Implementations§

    §

    impl<'ctx> Freeze for ArrayType<'ctx>

    §

    impl<'ctx> RefUnwindSafe for ArrayType<'ctx>

    §

    impl<'ctx> !Send for ArrayType<'ctx>

    §

    impl<'ctx> !Sync for ArrayType<'ctx>

    §

    impl<'ctx> Unpin for ArrayType<'ctx>

    §

    impl<'ctx> UnwindSafe for ArrayType<'ctx>

    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/inkwell/types/struct.FieldTypesIter.html b/inkwell/types/struct.FieldTypesIter.html index ffa2b9fda..35ee15c83 100644 --- a/inkwell/types/struct.FieldTypesIter.html +++ b/inkwell/types/struct.FieldTypesIter.html @@ -1,6 +1,6 @@ FieldTypesIter in inkwell::types - Rust
    -

    Struct inkwell::types::FieldTypesIter

    source · 
    pub struct FieldTypesIter<'ctx> { /* private fields */ }
    Expand description

    Iterate over all BasicTypeEnums in a struct.

    -

    Trait Implementations§

    source§

    impl<'ctx> Debug for FieldTypesIter<'ctx>

    source§

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

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

    impl<'ctx> Iterator for FieldTypesIter<'ctx>

    §

    type Item = BasicTypeEnum<'ctx>

    The type of the elements being iterated over.
    source§

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

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

    fn next_chunk<const N: usize>( +

    Struct inkwell::types::FieldTypesIter

    source · 
    pub struct FieldTypesIter<'ctx> { /* private fields */ }
    Expand description

    Iterate over all BasicTypeEnums in a struct.

    +

    Trait Implementations§

    source§

    impl<'ctx> Debug for FieldTypesIter<'ctx>

    source§

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

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

    impl<'ctx> Iterator for FieldTypesIter<'ctx>

    §

    type Item = BasicTypeEnum<'ctx>

    The type of the elements being iterated over.
    source§

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

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

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

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

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

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

    fn count(self) -> usize
    where diff --git a/inkwell/types/struct.FloatType.html b/inkwell/types/struct.FloatType.html index 023bd4e39..fa21de827 100644 --- a/inkwell/types/struct.FloatType.html +++ b/inkwell/types/struct.FloatType.html @@ -1,6 +1,6 @@ FloatType in inkwell::types - Rust

    Struct inkwell::types::FloatType

    source · 
    pub struct FloatType<'ctx> { /* private fields */ }
    Expand description

    A FloatType is the type of a floating point constant or variable.

    -

    Implementations§

    source§

    impl<'ctx> FloatType<'ctx>

    source

    pub unsafe fn new(float_type: LLVMTypeRef) -> Self

    Create FloatType from LLVMTypeRef

    +

    Implementations§

    source§

    impl<'ctx> FloatType<'ctx>

    source

    pub unsafe fn new(float_type: LLVMTypeRef) -> Self

    Create FloatType from LLVMTypeRef

    §Safety

    Undefined behavior, if referenced type isn’t float type

    source

    pub fn fn_type( @@ -146,7 +146,7 @@ so this may produce unexpected results and should not be relied upon for validat assert!(f32_poison.is_poison());

    source

    pub fn create_generic_value(self, value: f64) -> GenericValue<'ctx>

    Creates a GenericValue for use with ExecutionEngines.

    -
    source

    pub fn const_array(self, values: &[FloatValue<'ctx>]) -> ArrayValue<'ctx>

    Creates a constant ArrayValue.

    +
    source

    pub fn const_array(self, values: &[FloatValue<'ctx>]) -> ArrayValue<'ctx>

    Creates a constant ArrayValue.

    §Example
    use inkwell::context::Context;
 
@@ -157,14 +157,14 @@ so this may produce unexpected results and should not be relied upon for validat
 let f32_array = f32_type.const_array(&[f32_val, f32_val2]);
 
 assert!(f32_array.is_const());
    -

    Trait Implementations§

    source§

    impl<'ctx> AnyType<'ctx> for FloatType<'ctx>

    source§

    fn as_any_type_enum(&self) -> AnyTypeEnum<'ctx>

    Returns an AnyTypeEnum that represents the current type.
    source§

    fn print_to_string(&self) -> LLVMString

    Prints the definition of a Type to a LLVMString.
    source§

    impl AsTypeRef for FloatType<'_>

    source§

    fn as_type_ref(&self) -> LLVMTypeRef

    Returns the internal LLVM reference behind the type
    source§

    impl<'ctx> BasicType<'ctx> for FloatType<'ctx>

    source§

    fn as_basic_type_enum(&self) -> BasicTypeEnum<'ctx>

    Returns a BasicTypeEnum that represents the current type.
    source§

    fn fn_type( +

    Trait Implementations§

    source§

    impl<'ctx> AnyType<'ctx> for FloatType<'ctx>

    source§

    fn as_any_type_enum(&self) -> AnyTypeEnum<'ctx>

    Returns an AnyTypeEnum that represents the current type.
    source§

    fn print_to_string(&self) -> LLVMString

    Prints the definition of a Type to a LLVMString.
    source§

    impl AsTypeRef for FloatType<'_>

    source§

    fn as_type_ref(&self) -> LLVMTypeRef

    Returns the internal LLVM reference behind the type
    source§

    impl<'ctx> BasicType<'ctx> for FloatType<'ctx>

    source§

    fn as_basic_type_enum(&self) -> BasicTypeEnum<'ctx>

    Returns a BasicTypeEnum that represents the current type.
    source§

    fn fn_type( &self, param_types: &[BasicMetadataTypeEnum<'ctx>], is_var_args: bool ) -> FunctionType<'ctx>

    Create a FunctionType with this BasicType as its return type. Read more
    source§

    fn is_sized(&self) -> bool

    Determines whether or not this BasicType is sized or not. -For example, opaque structs are unsized. Read more
    source§

    fn size_of(&self) -> Option<IntValue<'ctx>>

    Gets the size of this BasicType. Value may vary depending on the target architecture. Read more
    source§

    fn array_type(&self, size: u32) -> ArrayType<'ctx>

    Create an ArrayType with this BasicType as its elements. Read more
    source§

    fn ptr_type(&self, address_space: AddressSpace) -> PointerType<'ctx>

    👎Deprecated: Starting from version 15.0, LLVM doesn’t differentiate between pointer types. Use Context::ptr_type instead.
    Create a PointerType that points to this BasicType. Read more
    source§

    impl<'ctx> Clone for FloatType<'ctx>

    source§

    fn clone(&self) -> FloatType<'ctx>

    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<'ctx> Debug for FloatType<'ctx>

    source§

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

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

    impl Display for FloatType<'_>

    source§

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

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

    impl<'ctx> FloatMathType<'ctx> for FloatType<'ctx>

    §

    type ValueType = FloatValue<'ctx>

    The value instance of a float or float vector type.
    §

    type MathConvType = IntType<'ctx>

    The type for float to int or float vector to int vector conversions.
    source§

    impl<'ctx> From<FloatType<'ctx>> for AnyTypeEnum<'ctx>

    source§

    fn from(value: FloatType<'_>) -> AnyTypeEnum<'_>

    Converts to this type from the input type.
    source§

    impl<'ctx> From<FloatType<'ctx>> for BasicMetadataTypeEnum<'ctx>

    source§

    fn from(value: FloatType<'_>) -> BasicMetadataTypeEnum<'_>

    Converts to this type from the input type.
    source§

    impl<'ctx> From<FloatType<'ctx>> for BasicTypeEnum<'ctx>

    source§

    fn from(value: FloatType<'_>) -> BasicTypeEnum<'_>

    Converts to this type from the input type.
    source§

    impl<'ctx> PartialEq for FloatType<'ctx>

    source§

    fn eq(&self, other: &FloatType<'ctx>) -> bool

    This method tests for self and other values to be equal, and is used +For example, opaque structs are unsized. Read more
    source§

    fn size_of(&self) -> Option<IntValue<'ctx>>

    Gets the size of this BasicType. Value may vary depending on the target architecture. Read more
    source§

    fn array_type(&self, size: u32) -> ArrayType<'ctx>

    Create an ArrayType with this BasicType as its elements. Read more
    source§

    fn ptr_type(&self, address_space: AddressSpace) -> PointerType<'ctx>

    👎Deprecated: Starting from version 15.0, LLVM doesn’t differentiate between pointer types. Use Context::ptr_type instead.
    Create a PointerType that points to this BasicType. Read more
    source§

    impl<'ctx> Clone for FloatType<'ctx>

    source§

    fn clone(&self) -> FloatType<'ctx>

    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<'ctx> Debug for FloatType<'ctx>

    source§

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

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

    impl Display for FloatType<'_>

    source§

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

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

    impl<'ctx> FloatMathType<'ctx> for FloatType<'ctx>

    §

    type ValueType = FloatValue<'ctx>

    The value instance of a float or float vector type.
    §

    type MathConvType = IntType<'ctx>

    The type for float to int or float vector to int vector conversions.
    source§

    impl<'ctx> From<FloatType<'ctx>> for AnyTypeEnum<'ctx>

    source§

    fn from(value: FloatType<'_>) -> AnyTypeEnum<'_>

    Converts to this type from the input type.
    source§

    impl<'ctx> From<FloatType<'ctx>> for BasicMetadataTypeEnum<'ctx>

    source§

    fn from(value: FloatType<'_>) -> BasicMetadataTypeEnum<'_>

    Converts to this type from the input type.
    source§

    impl<'ctx> From<FloatType<'ctx>> for BasicTypeEnum<'ctx>

    source§

    fn from(value: FloatType<'_>) -> BasicTypeEnum<'_>

    Converts to this type from the input type.
    source§

    impl<'ctx> PartialEq for FloatType<'ctx>

    source§

    fn eq(&self, other: &FloatType<'ctx>) -> bool

    This method tests for self and other values to be equal, and is used by ==.
    1.0.0 · source§

    fn ne(&self, other: &Rhs) -> bool

    This method tests for !=. The default implementation is almost always -sufficient, and should not be overridden without very good reason.
    source§

    impl<'ctx> TryFrom<AnyTypeEnum<'ctx>> for FloatType<'ctx>

    §

    type Error = ()

    The type returned in the event of a conversion error.
    source§

    fn try_from(value: AnyTypeEnum<'ctx>) -> Result<Self, Self::Error>

    Performs the conversion.
    source§

    impl<'ctx> TryFrom<BasicMetadataTypeEnum<'ctx>> for FloatType<'ctx>

    §

    type Error = ()

    The type returned in the event of a conversion error.
    source§

    fn try_from(value: BasicMetadataTypeEnum<'ctx>) -> Result<Self, Self::Error>

    Performs the conversion.
    source§

    impl<'ctx> TryFrom<BasicTypeEnum<'ctx>> for FloatType<'ctx>

    §

    type Error = ()

    The type returned in the event of a conversion error.
    source§

    fn try_from(value: BasicTypeEnum<'ctx>) -> Result<Self, Self::Error>

    Performs the conversion.
    source§

    impl<'ctx> Copy for FloatType<'ctx>

    source§

    impl<'ctx> Eq for FloatType<'ctx>

    source§

    impl<'ctx> StructuralPartialEq for FloatType<'ctx>

    Auto Trait Implementations§

    §

    impl<'ctx> Freeze for FloatType<'ctx>

    §

    impl<'ctx> RefUnwindSafe for FloatType<'ctx>

    §

    impl<'ctx> !Send for FloatType<'ctx>

    §

    impl<'ctx> !Sync for FloatType<'ctx>

    §

    impl<'ctx> Unpin for FloatType<'ctx>

    §

    impl<'ctx> UnwindSafe for FloatType<'ctx>

    Blanket Implementations§

    source§

    impl<T> Any for T
    where +sufficient, and should not be overridden without very good reason.

    source§

    impl<'ctx> TryFrom<AnyTypeEnum<'ctx>> for FloatType<'ctx>

    §

    type Error = ()

    The type returned in the event of a conversion error.
    source§

    fn try_from(value: AnyTypeEnum<'ctx>) -> Result<Self, Self::Error>

    Performs the conversion.
    source§

    impl<'ctx> TryFrom<BasicMetadataTypeEnum<'ctx>> for FloatType<'ctx>

    §

    type Error = ()

    The type returned in the event of a conversion error.
    source§

    fn try_from(value: BasicMetadataTypeEnum<'ctx>) -> Result<Self, Self::Error>

    Performs the conversion.
    source§

    impl<'ctx> TryFrom<BasicTypeEnum<'ctx>> for FloatType<'ctx>

    §

    type Error = ()

    The type returned in the event of a conversion error.
    source§

    fn try_from(value: BasicTypeEnum<'ctx>) -> Result<Self, Self::Error>

    Performs the conversion.
    source§

    impl<'ctx> Copy for FloatType<'ctx>

    source§

    impl<'ctx> Eq for FloatType<'ctx>

    source§

    impl<'ctx> StructuralPartialEq for FloatType<'ctx>

    Auto Trait Implementations§

    §

    impl<'ctx> Freeze for FloatType<'ctx>

    §

    impl<'ctx> RefUnwindSafe for FloatType<'ctx>

    §

    impl<'ctx> !Send for FloatType<'ctx>

    §

    impl<'ctx> !Sync for FloatType<'ctx>

    §

    impl<'ctx> Unpin for FloatType<'ctx>

    §

    impl<'ctx> UnwindSafe for FloatType<'ctx>

    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/inkwell/types/struct.IntType.html b/inkwell/types/struct.IntType.html index 641396a4f..1d6318702 100644 --- a/inkwell/types/struct.IntType.html +++ b/inkwell/types/struct.IntType.html @@ -1,9 +1,9 @@ IntType in inkwell::types - Rust
    -

    Struct inkwell::types::IntType

    source · 
    pub struct IntType<'ctx> { /* private fields */ }
    Expand description

    An IntType is the type of an integer constant or variable.

    -

    Implementations§

    source§

    impl<'ctx> IntType<'ctx>

    source

    pub unsafe fn new(int_type: LLVMTypeRef) -> Self

    Create IntType from LLVMTypeRef

    +

    Struct inkwell::types::IntType

    source · 
    pub struct IntType<'ctx> { /* private fields */ }
    Expand description

    An IntType is the type of an integer constant or variable.

    +

    Implementations§

    source§

    impl<'ctx> IntType<'ctx>

    source

    pub unsafe fn new(int_type: LLVMTypeRef) -> Self

    Create IntType from LLVMTypeRef

    §Safety

    Undefined behavior, if referenced type isn’t int type

    -
    source

    pub fn const_int(self, value: u64, sign_extend: bool) -> IntValue<'ctx>

    Creates an IntValue representing a constant value of this IntType. It will be automatically assigned this IntType’s Context.

    +
    source

    pub fn const_int(self, value: u64, sign_extend: bool) -> IntValue<'ctx>

    Creates an IntValue representing a constant value of this IntType. It will be automatically assigned this IntType’s Context.

    §Example
    use inkwell::context::Context;
 
@@ -11,7 +11,7 @@
 let context = Context::create();
 let i32_type = context.i32_type();
 let i32_value = i32_type.const_int(42, false);
    -
    source

    pub fn const_int_from_string( +

    source

    pub fn const_int_from_string( self, slice: &str, radix: StringRadix @@ -39,14 +39,14 @@ so this may produce unexpected results and should not be relied upon for validat let i8_val = i8_type.const_int_from_string("ABCD", StringRadix::Binary); assert!(i8_val.is_none());

    -
    source

    pub fn const_int_arbitrary_precision(self, words: &[u64]) -> IntValue<'ctx>

    Create a constant IntValue of arbitrary precision.

    +
    source

    pub fn const_int_arbitrary_precision(self, words: &[u64]) -> IntValue<'ctx>

    Create a constant IntValue of arbitrary precision.

    §Example
    use inkwell::context::Context;
 
 let context = Context::create();
 let i64_type = context.i64_type();
 let i64_val = i64_type.const_int_arbitrary_precision(&[1, 2]);
    -
    source

    pub fn const_all_ones(self) -> IntValue<'ctx>

    Creates an IntValue representing a constant value of all one bits of this IntType. It will be automatically assigned this IntType’s Context.

    +
    source

    pub fn const_all_ones(self) -> IntValue<'ctx>

    Creates an IntValue representing a constant value of all one bits of this IntType. It will be automatically assigned this IntType’s Context.

    §Example
    use inkwell::context::Context;
 
@@ -54,7 +54,7 @@ so this may produce unexpected results and should not be relied upon for validat
 let context = Context::create();
 let i32_type = context.i32_type();
 let i32_ptr_value = i32_type.const_all_ones();
    -
    source

    pub fn const_zero(self) -> IntValue<'ctx>

    Creates a constant zero value of this IntType.

    +
    source

    pub fn const_zero(self) -> IntValue<'ctx>

    Creates a constant zero value of this IntType.

    §Example
    use inkwell::context::Context;
 use inkwell::values::AnyValue;
@@ -64,7 +64,7 @@ so this may produce unexpected results and should not be relied upon for validat
 let i8_zero = i8_type.const_zero();
 
 assert_eq!(i8_zero.print_to_string().to_string(), "i8 0");
    -
    source

    pub fn fn_type( +

    source

    pub fn fn_type( self, param_types: &[BasicMetadataTypeEnum<'ctx>], is_var_args: bool @@ -75,7 +75,7 @@ so this may produce unexpected results and should not be relied upon for validat let context = Context::create(); let i8_type = context.i8_type(); let fn_type = i8_type.fn_type(&[], false);

    -
    source

    pub fn array_type(self, size: u32) -> ArrayType<'ctx>

    Creates an ArrayType with this IntType for its element type.

    +
    source

    pub fn array_type(self, size: u32) -> ArrayType<'ctx>

    Creates an ArrayType with this IntType for its element type.

    §Example
    use inkwell::context::Context;
 
@@ -85,7 +85,7 @@ so this may produce unexpected results and should not be relied upon for validat
 
 assert_eq!(i8_array_type.len(), 3);
 assert_eq!(i8_array_type.get_element_type().into_int_type(), i8_type);
    -
    source

    pub fn vec_type(self, size: u32) -> VectorType<'ctx>

    Creates a VectorType with this IntType for its element type.

    +
    source

    pub fn vec_type(self, size: u32) -> VectorType<'ctx>

    Creates a VectorType with this IntType for its element type.

    §Example
    use inkwell::context::Context;
 
@@ -95,7 +95,7 @@ so this may produce unexpected results and should not be relied upon for validat
 
 assert_eq!(i8_vector_type.get_size(), 3);
 assert_eq!(i8_vector_type.get_element_type().into_int_type(), i8_type);
    -
    source

    pub fn get_context(self) -> ContextRef<'ctx>

    Gets a reference to the Context this IntType was created in.

    +
    source

    pub fn get_context(self) -> ContextRef<'ctx>

    Gets a reference to the Context this IntType was created in.

    §Example
    use inkwell::context::Context;
 
@@ -103,21 +103,21 @@ so this may produce unexpected results and should not be relied upon for validat
 let i8_type = context.i8_type();
 
 assert_eq!(i8_type.get_context(), context);
    -
    source

    pub fn size_of(self) -> IntValue<'ctx>

    Gets the size of this IntType. Value may vary depending on the target architecture.

    +
    source

    pub fn size_of(self) -> IntValue<'ctx>

    Gets the size of this IntType. Value may vary depending on the target architecture.

    §Example
    use inkwell::context::Context;
 
 let context = Context::create();
 let i8_type = context.i8_type();
 let i8_type_size = i8_type.size_of();
    -
    source

    pub fn get_alignment(self) -> IntValue<'ctx>

    Gets the alignment of this IntType. Value may vary depending on the target architecture.

    +
    source

    pub fn get_alignment(self) -> IntValue<'ctx>

    Gets the alignment of this IntType. Value may vary depending on the target architecture.

    §Example
    use inkwell::context::Context;
 
 let context = Context::create();
 let i8_type = context.i8_type();
 let i8_type_alignment = i8_type.get_alignment();
    -
    source

    pub fn ptr_type(self, address_space: AddressSpace) -> PointerType<'ctx>

    👎Deprecated: Starting from version 15.0, LLVM doesn’t differentiate between pointer types. Use Context::ptr_type instead.

    Creates a PointerType with this IntType for its element type.

    +
    source

    pub fn ptr_type(self, address_space: AddressSpace) -> PointerType<'ctx>

    👎Deprecated: Starting from version 15.0, LLVM doesn’t differentiate between pointer types. Use Context::ptr_type instead.

    Creates a PointerType with this IntType for its element type.

    §Example
    use inkwell::context::Context;
 use inkwell::AddressSpace;
@@ -140,7 +140,7 @@ so this may produce unexpected results and should not be relied upon for validat
     feature = "llvm14-0"
 ))]
 assert_eq!(i8_ptr_type.get_element_type().into_int_type(), i8_type);
    -
    source

    pub fn get_bit_width(self) -> u32

    Gets the bit width of an IntType.

    +
    source

    pub fn get_bit_width(self) -> u32

    Gets the bit width of an IntType.

    §Example
    use inkwell::context::Context;
 
@@ -148,8 +148,8 @@ so this may produce unexpected results and should not be relied upon for validat
 let bool_type = context.bool_type();
 
 assert_eq!(bool_type.get_bit_width(), 1);
    -
    source

    pub fn print_to_string(self) -> LLVMString

    Print the definition of an IntType to LLVMString.

    -
    source

    pub fn get_undef(self) -> IntValue<'ctx>

    Creates an undefined instance of an IntType.

    +
    source

    pub fn print_to_string(self) -> LLVMString

    Print the definition of an IntType to LLVMString.

    +
    source

    pub fn get_undef(self) -> IntValue<'ctx>

    Creates an undefined instance of an IntType.

    §Example
    use inkwell::context::Context;
 use inkwell::AddressSpace;
@@ -159,7 +159,7 @@ so this may produce unexpected results and should not be relied upon for validat
 let i8_undef = i8_type.get_undef();
 
 assert!(i8_undef.is_undef());
    -
    source

    pub fn get_poison(self) -> IntValue<'ctx>

    Creates a poison instance of an IntType.

    +
    source

    pub fn get_poison(self) -> IntValue<'ctx>

    Creates a poison instance of an IntType.

    §Example
    use inkwell::context::Context;
 use inkwell::AddressSpace;
@@ -170,12 +170,12 @@ so this may produce unexpected results and should not be relied upon for validat
 let i8_poison = i8_type.get_poison();
 
 assert!(i8_poison.is_poison());
    -
    source

    pub fn create_generic_value( +

    source

    pub fn create_generic_value( self, value: u64, is_signed: bool ) -> GenericValue<'ctx>

    Creates a GenericValue for use with ExecutionEngines.

    -
    source

    pub fn const_array(self, values: &[IntValue<'ctx>]) -> ArrayValue<'ctx>

    Creates a constant ArrayValue.

    +
    source

    pub fn const_array(self, values: &[IntValue<'ctx>]) -> ArrayValue<'ctx>

    Creates a constant ArrayValue.

    §Example
    use inkwell::context::Context;
 
@@ -186,14 +186,14 @@ so this may produce unexpected results and should not be relied upon for validat
 let i8_array = i8_type.const_array(&[i8_val, i8_val2]);
 
 assert!(i8_array.is_const());
    -

    Trait Implementations§

    source§

    impl<'ctx> AnyType<'ctx> for IntType<'ctx>

    source§

    fn as_any_type_enum(&self) -> AnyTypeEnum<'ctx>

    Returns an AnyTypeEnum that represents the current type.
    source§

    fn print_to_string(&self) -> LLVMString

    Prints the definition of a Type to a LLVMString.
    source§

    impl AsTypeRef for IntType<'_>

    source§

    fn as_type_ref(&self) -> LLVMTypeRef

    Returns the internal LLVM reference behind the type
    source§

    impl<'ctx> BasicType<'ctx> for IntType<'ctx>

    source§

    fn as_basic_type_enum(&self) -> BasicTypeEnum<'ctx>

    Returns a BasicTypeEnum that represents the current type.
    source§

    fn fn_type( +

    Trait Implementations§

    source§

    impl<'ctx> AnyType<'ctx> for IntType<'ctx>

    source§

    fn as_any_type_enum(&self) -> AnyTypeEnum<'ctx>

    Returns an AnyTypeEnum that represents the current type.
    source§

    fn print_to_string(&self) -> LLVMString

    Prints the definition of a Type to a LLVMString.
    source§

    impl AsTypeRef for IntType<'_>

    source§

    fn as_type_ref(&self) -> LLVMTypeRef

    Returns the internal LLVM reference behind the type
    source§

    impl<'ctx> BasicType<'ctx> for IntType<'ctx>

    source§

    fn as_basic_type_enum(&self) -> BasicTypeEnum<'ctx>

    Returns a BasicTypeEnum that represents the current type.
    source§

    fn fn_type( &self, param_types: &[BasicMetadataTypeEnum<'ctx>], is_var_args: bool ) -> FunctionType<'ctx>

    Create a FunctionType with this BasicType as its return type. Read more
    source§

    fn is_sized(&self) -> bool

    Determines whether or not this BasicType is sized or not. -For example, opaque structs are unsized. Read more
    source§

    fn size_of(&self) -> Option<IntValue<'ctx>>

    Gets the size of this BasicType. Value may vary depending on the target architecture. Read more
    source§

    fn array_type(&self, size: u32) -> ArrayType<'ctx>

    Create an ArrayType with this BasicType as its elements. Read more
    source§

    fn ptr_type(&self, address_space: AddressSpace) -> PointerType<'ctx>

    👎Deprecated: Starting from version 15.0, LLVM doesn’t differentiate between pointer types. Use Context::ptr_type instead.
    Create a PointerType that points to this BasicType. Read more
    source§

    impl<'ctx> Clone for IntType<'ctx>

    source§

    fn clone(&self) -> IntType<'ctx>

    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<'ctx> Debug for IntType<'ctx>

    source§

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

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

    impl Display for IntType<'_>

    source§

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

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

    impl<'ctx> From<IntType<'ctx>> for AnyTypeEnum<'ctx>

    source§

    fn from(value: IntType<'_>) -> AnyTypeEnum<'_>

    Converts to this type from the input type.
    source§

    impl<'ctx> From<IntType<'ctx>> for BasicMetadataTypeEnum<'ctx>

    source§

    fn from(value: IntType<'_>) -> BasicMetadataTypeEnum<'_>

    Converts to this type from the input type.
    source§

    impl<'ctx> From<IntType<'ctx>> for BasicTypeEnum<'ctx>

    source§

    fn from(value: IntType<'_>) -> BasicTypeEnum<'_>

    Converts to this type from the input type.
    source§

    impl<'ctx> IntMathType<'ctx> for IntType<'ctx>

    §

    type ValueType = IntValue<'ctx>

    The value instance of an int or int vector type.
    §

    type MathConvType = FloatType<'ctx>

    The type for int to float or int vector to float vector conversions.
    §

    type PtrConvType = PointerType<'ctx>

    The type for int to pointer or int vector to pointer vector conversions.
    source§

    impl<'ctx> PartialEq for IntType<'ctx>

    source§

    fn eq(&self, other: &IntType<'ctx>) -> bool

    This method tests for self and other values to be equal, and is used +For example, opaque structs are unsized. Read more
    source§

    fn size_of(&self) -> Option<IntValue<'ctx>>

    Gets the size of this BasicType. Value may vary depending on the target architecture. Read more
    source§

    fn array_type(&self, size: u32) -> ArrayType<'ctx>

    Create an ArrayType with this BasicType as its elements. Read more
    source§

    fn ptr_type(&self, address_space: AddressSpace) -> PointerType<'ctx>

    👎Deprecated: Starting from version 15.0, LLVM doesn’t differentiate between pointer types. Use Context::ptr_type instead.
    Create a PointerType that points to this BasicType. Read more
    source§

    impl<'ctx> Clone for IntType<'ctx>

    source§

    fn clone(&self) -> IntType<'ctx>

    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<'ctx> Debug for IntType<'ctx>

    source§

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

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

    impl Display for IntType<'_>

    source§

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

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

    impl<'ctx> From<IntType<'ctx>> for AnyTypeEnum<'ctx>

    source§

    fn from(value: IntType<'_>) -> AnyTypeEnum<'_>

    Converts to this type from the input type.
    source§

    impl<'ctx> From<IntType<'ctx>> for BasicMetadataTypeEnum<'ctx>

    source§

    fn from(value: IntType<'_>) -> BasicMetadataTypeEnum<'_>

    Converts to this type from the input type.
    source§

    impl<'ctx> From<IntType<'ctx>> for BasicTypeEnum<'ctx>

    source§

    fn from(value: IntType<'_>) -> BasicTypeEnum<'_>

    Converts to this type from the input type.
    source§

    impl<'ctx> IntMathType<'ctx> for IntType<'ctx>

    §

    type ValueType = IntValue<'ctx>

    The value instance of an int or int vector type.
    §

    type MathConvType = FloatType<'ctx>

    The type for int to float or int vector to float vector conversions.
    §

    type PtrConvType = PointerType<'ctx>

    The type for int to pointer or int vector to pointer vector conversions.
    source§

    impl<'ctx> PartialEq for IntType<'ctx>

    source§

    fn eq(&self, other: &IntType<'ctx>) -> bool

    This method tests for self and other values to be equal, and is used by ==.
    1.0.0 · source§

    fn ne(&self, other: &Rhs) -> bool

    This method tests for !=. The default implementation is almost always -sufficient, and should not be overridden without very good reason.
    source§

    impl<'ctx> TryFrom<AnyTypeEnum<'ctx>> for IntType<'ctx>

    §

    type Error = ()

    The type returned in the event of a conversion error.
    source§

    fn try_from(value: AnyTypeEnum<'ctx>) -> Result<Self, Self::Error>

    Performs the conversion.
    source§

    impl<'ctx> TryFrom<BasicMetadataTypeEnum<'ctx>> for IntType<'ctx>

    §

    type Error = ()

    The type returned in the event of a conversion error.
    source§

    fn try_from(value: BasicMetadataTypeEnum<'ctx>) -> Result<Self, Self::Error>

    Performs the conversion.
    source§

    impl<'ctx> TryFrom<BasicTypeEnum<'ctx>> for IntType<'ctx>

    §

    type Error = ()

    The type returned in the event of a conversion error.
    source§

    fn try_from(value: BasicTypeEnum<'ctx>) -> Result<Self, Self::Error>

    Performs the conversion.
    source§

    impl<'ctx> Copy for IntType<'ctx>

    source§

    impl<'ctx> Eq for IntType<'ctx>

    source§

    impl<'ctx> StructuralPartialEq for IntType<'ctx>

    Auto Trait Implementations§

    §

    impl<'ctx> Freeze for IntType<'ctx>

    §

    impl<'ctx> RefUnwindSafe for IntType<'ctx>

    §

    impl<'ctx> !Send for IntType<'ctx>

    §

    impl<'ctx> !Sync for IntType<'ctx>

    §

    impl<'ctx> Unpin for IntType<'ctx>

    §

    impl<'ctx> UnwindSafe for IntType<'ctx>

    Blanket Implementations§

    source§

    impl<T> Any for T
    where +sufficient, and should not be overridden without very good reason.

    source§

    impl<'ctx> TryFrom<AnyTypeEnum<'ctx>> for IntType<'ctx>

    §

    type Error = ()

    The type returned in the event of a conversion error.
    source§

    fn try_from(value: AnyTypeEnum<'ctx>) -> Result<Self, Self::Error>

    Performs the conversion.
    source§

    impl<'ctx> TryFrom<BasicMetadataTypeEnum<'ctx>> for IntType<'ctx>

    §

    type Error = ()

    The type returned in the event of a conversion error.
    source§

    fn try_from(value: BasicMetadataTypeEnum<'ctx>) -> Result<Self, Self::Error>

    Performs the conversion.
    source§

    impl<'ctx> TryFrom<BasicTypeEnum<'ctx>> for IntType<'ctx>

    §

    type Error = ()

    The type returned in the event of a conversion error.
    source§

    fn try_from(value: BasicTypeEnum<'ctx>) -> Result<Self, Self::Error>

    Performs the conversion.
    source§

    impl<'ctx> Copy for IntType<'ctx>

    source§

    impl<'ctx> Eq for IntType<'ctx>

    source§

    impl<'ctx> StructuralPartialEq for IntType<'ctx>

    Auto Trait Implementations§

    §

    impl<'ctx> Freeze for IntType<'ctx>

    §

    impl<'ctx> RefUnwindSafe for IntType<'ctx>

    §

    impl<'ctx> !Send for IntType<'ctx>

    §

    impl<'ctx> !Sync for IntType<'ctx>

    §

    impl<'ctx> Unpin for IntType<'ctx>

    §

    impl<'ctx> UnwindSafe for IntType<'ctx>

    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/inkwell/types/struct.MetadataType.html b/inkwell/types/struct.MetadataType.html index 58e6813f1..c6577ddb4 100644 --- a/inkwell/types/struct.MetadataType.html +++ b/inkwell/types/struct.MetadataType.html @@ -23,7 +23,7 @@ assert_eq!(md_type.get_context(), context);
    source

    pub fn print_to_string(self) -> LLVMString

    Print the definition of a MetadataType to LLVMString.

    -

    Trait Implementations§

    source§

    impl AsTypeRef for MetadataType<'_>

    source§

    fn as_type_ref(&self) -> LLVMTypeRef

    Returns the internal LLVM reference behind the type
    source§

    impl<'ctx> Clone for MetadataType<'ctx>

    source§

    fn clone(&self) -> MetadataType<'ctx>

    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<'ctx> Debug for MetadataType<'ctx>

    source§

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

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

    impl Display for MetadataType<'_>

    source§

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

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

    impl<'ctx> From<MetadataType<'ctx>> for BasicMetadataTypeEnum<'ctx>

    source§

    fn from(value: MetadataType<'_>) -> BasicMetadataTypeEnum<'_>

    Converts to this type from the input type.
    source§

    impl<'ctx> PartialEq for MetadataType<'ctx>

    source§

    fn eq(&self, other: &MetadataType<'ctx>) -> bool

    This method tests for self and other values to be equal, and is used +

    Trait Implementations§

    source§

    impl AsTypeRef for MetadataType<'_>

    source§

    fn as_type_ref(&self) -> LLVMTypeRef

    Returns the internal LLVM reference behind the type
    source§

    impl<'ctx> Clone for MetadataType<'ctx>

    source§

    fn clone(&self) -> MetadataType<'ctx>

    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<'ctx> Debug for MetadataType<'ctx>

    source§

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

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

    impl Display for MetadataType<'_>

    source§

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

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

    impl<'ctx> From<MetadataType<'ctx>> for BasicMetadataTypeEnum<'ctx>

    source§

    fn from(value: MetadataType<'_>) -> BasicMetadataTypeEnum<'_>

    Converts to this type from the input type.
    source§

    impl<'ctx> PartialEq for MetadataType<'ctx>

    source§

    fn eq(&self, other: &MetadataType<'ctx>) -> bool

    This method tests for self and other values to be equal, and is used by ==.
    1.0.0 · source§

    fn ne(&self, other: &Rhs) -> bool

    This method tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.
    source§

    impl<'ctx> TryFrom<BasicMetadataTypeEnum<'ctx>> for MetadataType<'ctx>

    §

    type Error = ()

    The type returned in the event of a conversion error.
    source§

    fn try_from(value: BasicMetadataTypeEnum<'ctx>) -> Result<Self, Self::Error>

    Performs the conversion.
    source§

    impl<'ctx> Copy for MetadataType<'ctx>

    source§

    impl<'ctx> Eq for MetadataType<'ctx>

    source§

    impl<'ctx> StructuralPartialEq for MetadataType<'ctx>

    Auto Trait Implementations§

    §

    impl<'ctx> Freeze for MetadataType<'ctx>

    §

    impl<'ctx> RefUnwindSafe for MetadataType<'ctx>

    §

    impl<'ctx> !Send for MetadataType<'ctx>

    §

    impl<'ctx> !Sync for MetadataType<'ctx>

    §

    impl<'ctx> Unpin for MetadataType<'ctx>

    §

    impl<'ctx> UnwindSafe for MetadataType<'ctx>

    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/inkwell/types/struct.PointerType.html b/inkwell/types/struct.PointerType.html index c1056936b..d823a26e4 100644 --- a/inkwell/types/struct.PointerType.html +++ b/inkwell/types/struct.PointerType.html @@ -1,6 +1,6 @@ PointerType in inkwell::types - Rust

    Struct inkwell::types::PointerType

    source · 
    pub struct PointerType<'ctx> { /* private fields */ }
    Expand description

    A PointerType is the type of a pointer constant or variable.

    -

    Implementations§

    source§

    impl<'ctx> PointerType<'ctx>

    source

    pub unsafe fn new(ptr_type: LLVMTypeRef) -> Self

    Create PointerType from LLVMTypeRef

    +

    Implementations§

    source§

    impl<'ctx> PointerType<'ctx>

    source

    pub unsafe fn new(ptr_type: LLVMTypeRef) -> Self

    Create PointerType from LLVMTypeRef

    §Safety

    Undefined behavior, if referenced type isn’t pointer type

    source

    pub fn size_of(self) -> IntValue<'ctx>

    Gets the size of this PointerType. Value may vary depending on the target architecture.

    @@ -186,7 +186,7 @@ so this function may be removed in the future.

    assert_eq!(f32_ptr_vec_type.get_size(), 3); assert_eq!(f32_ptr_vec_type.get_element_type().into_pointer_type(), f32_ptr_type);
    -
    source

    pub fn const_array(self, values: &[PointerValue<'ctx>]) -> ArrayValue<'ctx>

    Creates a constant ArrayValue.

    +
    source

    pub fn const_array(self, values: &[PointerValue<'ctx>]) -> ArrayValue<'ctx>

    Creates a constant ArrayValue.

    §Example
    use inkwell::context::Context;
 use inkwell::AddressSpace;
@@ -201,13 +201,13 @@ so this function may be removed in the future.
    
 let f32_ptr_array = f32_ptr_type.const_array(&[f32_ptr_val, f32_ptr_val]);
 
 assert!(f32_ptr_array.is_const());
    -
    source

    pub fn is_opaque(self) -> bool

    Determine whether this pointer is opaque.

    -

    Trait Implementations§

    source§

    impl<'ctx> AnyType<'ctx> for PointerType<'ctx>

    source§

    fn as_any_type_enum(&self) -> AnyTypeEnum<'ctx>

    Returns an AnyTypeEnum that represents the current type.
    source§

    fn print_to_string(&self) -> LLVMString

    Prints the definition of a Type to a LLVMString.
    source§

    impl AsTypeRef for PointerType<'_>

    source§

    fn as_type_ref(&self) -> LLVMTypeRef

    Returns the internal LLVM reference behind the type
    source§

    impl<'ctx> BasicType<'ctx> for PointerType<'ctx>

    source§

    fn as_basic_type_enum(&self) -> BasicTypeEnum<'ctx>

    Returns a BasicTypeEnum that represents the current type.
    source§

    fn fn_type( +

    source

    pub fn is_opaque(self) -> bool

    Determine whether this pointer is opaque.

    +

    Trait Implementations§

    source§

    impl<'ctx> AnyType<'ctx> for PointerType<'ctx>

    source§

    fn as_any_type_enum(&self) -> AnyTypeEnum<'ctx>

    Returns an AnyTypeEnum that represents the current type.
    source§

    fn print_to_string(&self) -> LLVMString

    Prints the definition of a Type to a LLVMString.
    source§

    impl AsTypeRef for PointerType<'_>

    source§

    fn as_type_ref(&self) -> LLVMTypeRef

    Returns the internal LLVM reference behind the type
    source§

    impl<'ctx> BasicType<'ctx> for PointerType<'ctx>

    source§

    fn as_basic_type_enum(&self) -> BasicTypeEnum<'ctx>

    Returns a BasicTypeEnum that represents the current type.
    source§

    fn fn_type( &self, param_types: &[BasicMetadataTypeEnum<'ctx>], is_var_args: bool ) -> FunctionType<'ctx>

    Create a FunctionType with this BasicType as its return type. Read more
    source§

    fn is_sized(&self) -> bool

    Determines whether or not this BasicType is sized or not. -For example, opaque structs are unsized. Read more
    source§

    fn size_of(&self) -> Option<IntValue<'ctx>>

    Gets the size of this BasicType. Value may vary depending on the target architecture. Read more
    source§

    fn array_type(&self, size: u32) -> ArrayType<'ctx>

    Create an ArrayType with this BasicType as its elements. Read more
    source§

    fn ptr_type(&self, address_space: AddressSpace) -> PointerType<'ctx>

    👎Deprecated: Starting from version 15.0, LLVM doesn’t differentiate between pointer types. Use Context::ptr_type instead.
    Create a PointerType that points to this BasicType. Read more
    source§

    impl<'ctx> Clone for PointerType<'ctx>

    source§

    fn clone(&self) -> PointerType<'ctx>

    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<'ctx> Debug for PointerType<'ctx>

    source§

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

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

    impl Display for PointerType<'_>

    source§

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

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

    impl<'ctx> From<PointerType<'ctx>> for AnyTypeEnum<'ctx>

    source§

    fn from(value: PointerType<'_>) -> AnyTypeEnum<'_>

    Converts to this type from the input type.
    source§

    impl<'ctx> From<PointerType<'ctx>> for BasicMetadataTypeEnum<'ctx>

    source§

    fn from(value: PointerType<'_>) -> BasicMetadataTypeEnum<'_>

    Converts to this type from the input type.
    source§

    impl<'ctx> From<PointerType<'ctx>> for BasicTypeEnum<'ctx>

    source§

    fn from(value: PointerType<'_>) -> BasicTypeEnum<'_>

    Converts to this type from the input type.
    source§

    impl<'ctx> PartialEq for PointerType<'ctx>

    source§

    fn eq(&self, other: &PointerType<'ctx>) -> bool

    This method tests for self and other values to be equal, and is used +For example, opaque structs are unsized. Read more
    source§

    fn size_of(&self) -> Option<IntValue<'ctx>>

    Gets the size of this BasicType. Value may vary depending on the target architecture. Read more
    source§

    fn array_type(&self, size: u32) -> ArrayType<'ctx>

    Create an ArrayType with this BasicType as its elements. Read more
    source§

    fn ptr_type(&self, address_space: AddressSpace) -> PointerType<'ctx>

    👎Deprecated: Starting from version 15.0, LLVM doesn’t differentiate between pointer types. Use Context::ptr_type instead.
    Create a PointerType that points to this BasicType. Read more
    source§

    impl<'ctx> Clone for PointerType<'ctx>

    source§

    fn clone(&self) -> PointerType<'ctx>

    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<'ctx> Debug for PointerType<'ctx>

    source§

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

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

    impl Display for PointerType<'_>

    source§

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

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

    impl<'ctx> From<PointerType<'ctx>> for AnyTypeEnum<'ctx>

    source§

    fn from(value: PointerType<'_>) -> AnyTypeEnum<'_>

    Converts to this type from the input type.
    source§

    impl<'ctx> From<PointerType<'ctx>> for BasicMetadataTypeEnum<'ctx>

    source§

    fn from(value: PointerType<'_>) -> BasicMetadataTypeEnum<'_>

    Converts to this type from the input type.
    source§

    impl<'ctx> From<PointerType<'ctx>> for BasicTypeEnum<'ctx>

    source§

    fn from(value: PointerType<'_>) -> BasicTypeEnum<'_>

    Converts to this type from the input type.
    source§

    impl<'ctx> PartialEq for PointerType<'ctx>

    source§

    fn eq(&self, other: &PointerType<'ctx>) -> bool

    This method tests for self and other values to be equal, and is used by ==.
    1.0.0 · source§

    fn ne(&self, other: &Rhs) -> bool

    This method tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.
    source§

    impl<'ctx> PointerMathType<'ctx> for PointerType<'ctx>

    §

    type ValueType = PointerValue<'ctx>

    The value instance of a pointer type.
    §

    type PtrConvType = IntType<'ctx>

    The type for pointer to int or pointer vector to int conversions.
    source§

    impl<'ctx> TryFrom<AnyTypeEnum<'ctx>> for PointerType<'ctx>

    §

    type Error = ()

    The type returned in the event of a conversion error.
    source§

    fn try_from(value: AnyTypeEnum<'ctx>) -> Result<Self, Self::Error>

    Performs the conversion.
    source§

    impl<'ctx> TryFrom<BasicMetadataTypeEnum<'ctx>> for PointerType<'ctx>

    §

    type Error = ()

    The type returned in the event of a conversion error.
    source§

    fn try_from(value: BasicMetadataTypeEnum<'ctx>) -> Result<Self, Self::Error>

    Performs the conversion.
    source§

    impl<'ctx> TryFrom<BasicTypeEnum<'ctx>> for PointerType<'ctx>

    §

    type Error = ()

    The type returned in the event of a conversion error.
    source§

    fn try_from(value: BasicTypeEnum<'ctx>) -> Result<Self, Self::Error>

    Performs the conversion.
    source§

    impl<'ctx> Copy for PointerType<'ctx>

    source§

    impl<'ctx> Eq for PointerType<'ctx>

    source§

    impl<'ctx> StructuralPartialEq for PointerType<'ctx>

    Auto Trait Implementations§

    §

    impl<'ctx> Freeze for PointerType<'ctx>

    §

    impl<'ctx> RefUnwindSafe for PointerType<'ctx>

    §

    impl<'ctx> !Send for PointerType<'ctx>

    §

    impl<'ctx> !Sync for PointerType<'ctx>

    §

    impl<'ctx> Unpin for PointerType<'ctx>

    §

    impl<'ctx> UnwindSafe for PointerType<'ctx>

    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/inkwell/types/struct.StructType.html b/inkwell/types/struct.StructType.html index 5b7274d17..d059d0d27 100644 --- a/inkwell/types/struct.StructType.html +++ b/inkwell/types/struct.StructType.html @@ -1,6 +1,6 @@ StructType in inkwell::types - Rust

    Struct inkwell::types::StructType

    source · 
    pub struct StructType<'ctx> { /* private fields */ }
    Expand description

    A StructType is the type of a heterogeneous container of types.

    -

    Implementations§

    source§

    impl<'ctx> StructType<'ctx>

    source

    pub unsafe fn new(struct_type: LLVMTypeRef) -> Self

    Create StructType from LLVMTypeRef

    +

    Implementations§

    source§

    impl<'ctx> StructType<'ctx>

    source

    pub unsafe fn new(struct_type: LLVMTypeRef) -> Self

    Create StructType from LLVMTypeRef

    §Safety

    Undefined behavior, if referenced type isn’t struct type

    source

    pub fn get_field_type_at_index(self, index: u32) -> Option<BasicTypeEnum<'ctx>>

    Gets the type of a field belonging to this StructType.

    @@ -195,7 +195,7 @@ opaque_struct_type.set_body(&[f32_type.into()], false); assert!(!opaque_struct_type.is_opaque());
    -
    source

    pub fn const_array(self, values: &[StructValue<'ctx>]) -> ArrayValue<'ctx>

    Creates a constant ArrayValue.

    +
    source

    pub fn const_array(self, values: &[StructValue<'ctx>]) -> ArrayValue<'ctx>

    Creates a constant ArrayValue.

    §Example
    use inkwell::context::Context;
 
@@ -206,14 +206,14 @@ opaque_struct_type.set_body(&[f32_type.into()], let struct_array = struct_type.const_array(&[struct_val, struct_val]);
 
 assert!(struct_array.is_const());
    -

    Trait Implementations§

    source§

    impl<'ctx> AnyType<'ctx> for StructType<'ctx>

    source§

    fn as_any_type_enum(&self) -> AnyTypeEnum<'ctx>

    Returns an AnyTypeEnum that represents the current type.
    source§

    fn print_to_string(&self) -> LLVMString

    Prints the definition of a Type to a LLVMString.
    source§

    impl AsTypeRef for StructType<'_>

    source§

    fn as_type_ref(&self) -> LLVMTypeRef

    Returns the internal LLVM reference behind the type
    source§

    impl<'ctx> BasicType<'ctx> for StructType<'ctx>

    source§

    fn as_basic_type_enum(&self) -> BasicTypeEnum<'ctx>

    Returns a BasicTypeEnum that represents the current type.
    source§

    fn fn_type( +

    Trait Implementations§

    source§

    impl<'ctx> AnyType<'ctx> for StructType<'ctx>

    source§

    fn as_any_type_enum(&self) -> AnyTypeEnum<'ctx>

    Returns an AnyTypeEnum that represents the current type.
    source§

    fn print_to_string(&self) -> LLVMString

    Prints the definition of a Type to a LLVMString.
    source§

    impl AsTypeRef for StructType<'_>

    source§

    fn as_type_ref(&self) -> LLVMTypeRef

    Returns the internal LLVM reference behind the type
    source§

    impl<'ctx> BasicType<'ctx> for StructType<'ctx>

    source§

    fn as_basic_type_enum(&self) -> BasicTypeEnum<'ctx>

    Returns a BasicTypeEnum that represents the current type.
    source§

    fn fn_type( &self, param_types: &[BasicMetadataTypeEnum<'ctx>], is_var_args: bool ) -> FunctionType<'ctx>

    Create a FunctionType with this BasicType as its return type. Read more
    source§

    fn is_sized(&self) -> bool

    Determines whether or not this BasicType is sized or not. -For example, opaque structs are unsized. Read more
    source§

    fn size_of(&self) -> Option<IntValue<'ctx>>

    Gets the size of this BasicType. Value may vary depending on the target architecture. Read more
    source§

    fn array_type(&self, size: u32) -> ArrayType<'ctx>

    Create an ArrayType with this BasicType as its elements. Read more
    source§

    fn ptr_type(&self, address_space: AddressSpace) -> PointerType<'ctx>

    👎Deprecated: Starting from version 15.0, LLVM doesn’t differentiate between pointer types. Use Context::ptr_type instead.
    Create a PointerType that points to this BasicType. Read more
    source§

    impl<'ctx> Clone for StructType<'ctx>

    source§

    fn clone(&self) -> StructType<'ctx>

    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<'ctx> Debug for StructType<'ctx>

    source§

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

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

    impl Display for StructType<'_>

    source§

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

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

    impl<'ctx> From<StructType<'ctx>> for AnyTypeEnum<'ctx>

    source§

    fn from(value: StructType<'_>) -> AnyTypeEnum<'_>

    Converts to this type from the input type.
    source§

    impl<'ctx> From<StructType<'ctx>> for BasicMetadataTypeEnum<'ctx>

    source§

    fn from(value: StructType<'_>) -> BasicMetadataTypeEnum<'_>

    Converts to this type from the input type.
    source§

    impl<'ctx> From<StructType<'ctx>> for BasicTypeEnum<'ctx>

    source§

    fn from(value: StructType<'_>) -> BasicTypeEnum<'_>

    Converts to this type from the input type.
    source§

    impl<'ctx> PartialEq for StructType<'ctx>

    source§

    fn eq(&self, other: &StructType<'ctx>) -> bool

    This method tests for self and other values to be equal, and is used +For example, opaque structs are unsized. Read more
    source§

    fn size_of(&self) -> Option<IntValue<'ctx>>

    Gets the size of this BasicType. Value may vary depending on the target architecture. Read more
    source§

    fn array_type(&self, size: u32) -> ArrayType<'ctx>

    Create an ArrayType with this BasicType as its elements. Read more
    source§

    fn ptr_type(&self, address_space: AddressSpace) -> PointerType<'ctx>

    👎Deprecated: Starting from version 15.0, LLVM doesn’t differentiate between pointer types. Use Context::ptr_type instead.
    Create a PointerType that points to this BasicType. Read more
    source§

    impl<'ctx> Clone for StructType<'ctx>

    source§

    fn clone(&self) -> StructType<'ctx>

    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<'ctx> Debug for StructType<'ctx>

    source§

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

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

    impl Display for StructType<'_>

    source§

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

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

    impl<'ctx> From<StructType<'ctx>> for AnyTypeEnum<'ctx>

    source§

    fn from(value: StructType<'_>) -> AnyTypeEnum<'_>

    Converts to this type from the input type.
    source§

    impl<'ctx> From<StructType<'ctx>> for BasicMetadataTypeEnum<'ctx>

    source§

    fn from(value: StructType<'_>) -> BasicMetadataTypeEnum<'_>

    Converts to this type from the input type.
    source§

    impl<'ctx> From<StructType<'ctx>> for BasicTypeEnum<'ctx>

    source§

    fn from(value: StructType<'_>) -> BasicTypeEnum<'_>

    Converts to this type from the input type.
    source§

    impl<'ctx> PartialEq for StructType<'ctx>

    source§

    fn eq(&self, other: &StructType<'ctx>) -> bool

    This method tests for self and other values to be equal, and is used by ==.
    1.0.0 · source§

    fn ne(&self, other: &Rhs) -> bool

    This method tests for !=. The default implementation is almost always -sufficient, and should not be overridden without very good reason.
    source§

    impl<'ctx> TryFrom<AnyTypeEnum<'ctx>> for StructType<'ctx>

    §

    type Error = ()

    The type returned in the event of a conversion error.
    source§

    fn try_from(value: AnyTypeEnum<'ctx>) -> Result<Self, Self::Error>

    Performs the conversion.
    source§

    impl<'ctx> TryFrom<BasicMetadataTypeEnum<'ctx>> for StructType<'ctx>

    §

    type Error = ()

    The type returned in the event of a conversion error.
    source§

    fn try_from(value: BasicMetadataTypeEnum<'ctx>) -> Result<Self, Self::Error>

    Performs the conversion.
    source§

    impl<'ctx> TryFrom<BasicTypeEnum<'ctx>> for StructType<'ctx>

    §

    type Error = ()

    The type returned in the event of a conversion error.
    source§

    fn try_from(value: BasicTypeEnum<'ctx>) -> Result<Self, Self::Error>

    Performs the conversion.
    source§

    impl<'ctx> Copy for StructType<'ctx>

    source§

    impl<'ctx> Eq for StructType<'ctx>

    source§

    impl<'ctx> StructuralPartialEq for StructType<'ctx>

    Auto Trait Implementations§

    §

    impl<'ctx> Freeze for StructType<'ctx>

    §

    impl<'ctx> RefUnwindSafe for StructType<'ctx>

    §

    impl<'ctx> !Send for StructType<'ctx>

    §

    impl<'ctx> !Sync for StructType<'ctx>

    §

    impl<'ctx> Unpin for StructType<'ctx>

    §

    impl<'ctx> UnwindSafe for StructType<'ctx>

    Blanket Implementations§

    source§

    impl<T> Any for T
    where +sufficient, and should not be overridden without very good reason.

    source§

    impl<'ctx> TryFrom<AnyTypeEnum<'ctx>> for StructType<'ctx>

    §

    type Error = ()

    The type returned in the event of a conversion error.
    source§

    fn try_from(value: AnyTypeEnum<'ctx>) -> Result<Self, Self::Error>

    Performs the conversion.
    source§

    impl<'ctx> TryFrom<BasicMetadataTypeEnum<'ctx>> for StructType<'ctx>

    §

    type Error = ()

    The type returned in the event of a conversion error.
    source§

    fn try_from(value: BasicMetadataTypeEnum<'ctx>) -> Result<Self, Self::Error>

    Performs the conversion.
    source§

    impl<'ctx> TryFrom<BasicTypeEnum<'ctx>> for StructType<'ctx>

    §

    type Error = ()

    The type returned in the event of a conversion error.
    source§

    fn try_from(value: BasicTypeEnum<'ctx>) -> Result<Self, Self::Error>

    Performs the conversion.
    source§

    impl<'ctx> Copy for StructType<'ctx>

    source§

    impl<'ctx> Eq for StructType<'ctx>

    source§

    impl<'ctx> StructuralPartialEq for StructType<'ctx>

    Auto Trait Implementations§

    §

    impl<'ctx> Freeze for StructType<'ctx>

    §

    impl<'ctx> RefUnwindSafe for StructType<'ctx>

    §

    impl<'ctx> !Send for StructType<'ctx>

    §

    impl<'ctx> !Sync for StructType<'ctx>

    §

    impl<'ctx> Unpin for StructType<'ctx>

    §

    impl<'ctx> UnwindSafe for StructType<'ctx>

    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/inkwell/types/struct.VectorType.html b/inkwell/types/struct.VectorType.html index 7160c2412..c18df441f 100644 --- a/inkwell/types/struct.VectorType.html +++ b/inkwell/types/struct.VectorType.html @@ -1,6 +1,6 @@ VectorType in inkwell::types - Rust

    Struct inkwell::types::VectorType

    source · 
    pub struct VectorType<'ctx> { /* private fields */ }
    Expand description

    A VectorType is the type of a multiple value SIMD constant or variable.

    -

    Implementations§

    source§

    impl<'ctx> VectorType<'ctx>

    source

    pub unsafe fn new(vector_type: LLVMTypeRef) -> Self

    Create VectorType from LLVMTypeRef

    +

    Implementations§

    source§

    impl<'ctx> VectorType<'ctx>

    source

    pub unsafe fn new(vector_type: LLVMTypeRef) -> Self

    Create VectorType from LLVMTypeRef

    §Safety

    Undefined behavior, if referenced type isn’t vector type

    source

    pub fn size_of(self) -> Option<IntValue<'ctx>>

    Gets the size of this VectorType. Value may vary depending on the target architecture.

    @@ -129,7 +129,7 @@ assert_eq!(f32_vec_array_type.len(), 3); assert_eq!(f32_vec_array_type.get_element_type().into_vector_type(), f32_vec_type);
    -
    source

    pub fn const_array(self, values: &[VectorValue<'ctx>]) -> ArrayValue<'ctx>

    Creates a constant ArrayValue.

    +
    source

    pub fn const_array(self, values: &[VectorValue<'ctx>]) -> ArrayValue<'ctx>

    Creates a constant ArrayValue.

    §Example
    use inkwell::context::Context;
 use inkwell::types::VectorType;
@@ -143,7 +143,7 @@
 let f32_array = f32_vec_type.const_array(&[f32_vec_val, f32_vec_val]);
 
 assert!(f32_array.is_const());
    -
    source

    pub fn get_context(self) -> ContextRef<'ctx>

    Gets a reference to the Context this VectorType was created in.

    +
    source

    pub fn get_context(self) -> ContextRef<'ctx>

    Gets a reference to the Context this VectorType was created in.

    §Example
    use inkwell::context::Context;
 
@@ -152,14 +152,14 @@
 let f32_vec_type = f32_type.vec_type(7);
 
 assert_eq!(f32_vec_type.get_context(), context);
    -

    Trait Implementations§

    source§

    impl<'ctx> AnyType<'ctx> for VectorType<'ctx>

    source§

    fn as_any_type_enum(&self) -> AnyTypeEnum<'ctx>

    Returns an AnyTypeEnum that represents the current type.
    source§

    fn print_to_string(&self) -> LLVMString

    Prints the definition of a Type to a LLVMString.
    source§

    impl AsTypeRef for VectorType<'_>

    source§

    fn as_type_ref(&self) -> LLVMTypeRef

    Returns the internal LLVM reference behind the type
    source§

    impl<'ctx> BasicType<'ctx> for VectorType<'ctx>

    source§

    fn as_basic_type_enum(&self) -> BasicTypeEnum<'ctx>

    Returns a BasicTypeEnum that represents the current type.
    source§

    fn fn_type( +

    Trait Implementations§

    source§

    impl<'ctx> AnyType<'ctx> for VectorType<'ctx>

    source§

    fn as_any_type_enum(&self) -> AnyTypeEnum<'ctx>

    Returns an AnyTypeEnum that represents the current type.
    source§

    fn print_to_string(&self) -> LLVMString

    Prints the definition of a Type to a LLVMString.
    source§

    impl AsTypeRef for VectorType<'_>

    source§

    fn as_type_ref(&self) -> LLVMTypeRef

    Returns the internal LLVM reference behind the type
    source§

    impl<'ctx> BasicType<'ctx> for VectorType<'ctx>

    source§

    fn as_basic_type_enum(&self) -> BasicTypeEnum<'ctx>

    Returns a BasicTypeEnum that represents the current type.
    source§

    fn fn_type( &self, param_types: &[BasicMetadataTypeEnum<'ctx>], is_var_args: bool ) -> FunctionType<'ctx>

    Create a FunctionType with this BasicType as its return type. Read more
    source§

    fn is_sized(&self) -> bool

    Determines whether or not this BasicType is sized or not. -For example, opaque structs are unsized. Read more
    source§

    fn size_of(&self) -> Option<IntValue<'ctx>>

    Gets the size of this BasicType. Value may vary depending on the target architecture. Read more
    source§

    fn array_type(&self, size: u32) -> ArrayType<'ctx>

    Create an ArrayType with this BasicType as its elements. Read more
    source§

    fn ptr_type(&self, address_space: AddressSpace) -> PointerType<'ctx>

    👎Deprecated: Starting from version 15.0, LLVM doesn’t differentiate between pointer types. Use Context::ptr_type instead.
    Create a PointerType that points to this BasicType. Read more
    source§

    impl<'ctx> Clone for VectorType<'ctx>

    source§

    fn clone(&self) -> VectorType<'ctx>

    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<'ctx> Debug for VectorType<'ctx>

    source§

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

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

    impl Display for VectorType<'_>

    source§

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

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

    impl<'ctx> FloatMathType<'ctx> for VectorType<'ctx>

    §

    type ValueType = VectorValue<'ctx>

    The value instance of a float or float vector type.
    §

    type MathConvType = VectorType<'ctx>

    The type for float to int or float vector to int vector conversions.
    source§

    impl<'ctx> From<VectorType<'ctx>> for AnyTypeEnum<'ctx>

    source§

    fn from(value: VectorType<'_>) -> AnyTypeEnum<'_>

    Converts to this type from the input type.
    source§

    impl<'ctx> From<VectorType<'ctx>> for BasicMetadataTypeEnum<'ctx>

    source§

    fn from(value: VectorType<'_>) -> BasicMetadataTypeEnum<'_>

    Converts to this type from the input type.
    source§

    impl<'ctx> From<VectorType<'ctx>> for BasicTypeEnum<'ctx>

    source§

    fn from(value: VectorType<'_>) -> BasicTypeEnum<'_>

    Converts to this type from the input type.
    source§

    impl<'ctx> IntMathType<'ctx> for VectorType<'ctx>

    §

    type ValueType = VectorValue<'ctx>

    The value instance of an int or int vector type.
    §

    type MathConvType = VectorType<'ctx>

    The type for int to float or int vector to float vector conversions.
    §

    type PtrConvType = VectorType<'ctx>

    The type for int to pointer or int vector to pointer vector conversions.
    source§

    impl<'ctx> PartialEq for VectorType<'ctx>

    source§

    fn eq(&self, other: &VectorType<'ctx>) -> bool

    This method tests for self and other values to be equal, and is used +For example, opaque structs are unsized. Read more
    source§

    fn size_of(&self) -> Option<IntValue<'ctx>>

    Gets the size of this BasicType. Value may vary depending on the target architecture. Read more
    source§

    fn array_type(&self, size: u32) -> ArrayType<'ctx>

    Create an ArrayType with this BasicType as its elements. Read more
    source§

    fn ptr_type(&self, address_space: AddressSpace) -> PointerType<'ctx>

    👎Deprecated: Starting from version 15.0, LLVM doesn’t differentiate between pointer types. Use Context::ptr_type instead.
    Create a PointerType that points to this BasicType. Read more
    source§

    impl<'ctx> Clone for VectorType<'ctx>

    source§

    fn clone(&self) -> VectorType<'ctx>

    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<'ctx> Debug for VectorType<'ctx>

    source§

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

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

    impl Display for VectorType<'_>

    source§

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

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

    impl<'ctx> FloatMathType<'ctx> for VectorType<'ctx>

    §

    type ValueType = VectorValue<'ctx>

    The value instance of a float or float vector type.
    §

    type MathConvType = VectorType<'ctx>

    The type for float to int or float vector to int vector conversions.
    source§

    impl<'ctx> From<VectorType<'ctx>> for AnyTypeEnum<'ctx>

    source§

    fn from(value: VectorType<'_>) -> AnyTypeEnum<'_>

    Converts to this type from the input type.
    source§

    impl<'ctx> From<VectorType<'ctx>> for BasicMetadataTypeEnum<'ctx>

    source§

    fn from(value: VectorType<'_>) -> BasicMetadataTypeEnum<'_>

    Converts to this type from the input type.
    source§

    impl<'ctx> From<VectorType<'ctx>> for BasicTypeEnum<'ctx>

    source§

    fn from(value: VectorType<'_>) -> BasicTypeEnum<'_>

    Converts to this type from the input type.
    source§

    impl<'ctx> IntMathType<'ctx> for VectorType<'ctx>

    §

    type ValueType = VectorValue<'ctx>

    The value instance of an int or int vector type.
    §

    type MathConvType = VectorType<'ctx>

    The type for int to float or int vector to float vector conversions.
    §

    type PtrConvType = VectorType<'ctx>

    The type for int to pointer or int vector to pointer vector conversions.
    source§

    impl<'ctx> PartialEq for VectorType<'ctx>

    source§

    fn eq(&self, other: &VectorType<'ctx>) -> bool

    This method tests for self and other values to be equal, and is used by ==.
    1.0.0 · source§

    fn ne(&self, other: &Rhs) -> bool

    This method tests for !=. The default implementation is almost always -sufficient, and should not be overridden without very good reason.
    source§

    impl<'ctx> PointerMathType<'ctx> for VectorType<'ctx>

    §

    type ValueType = VectorValue<'ctx>

    The value instance of a pointer type.
    §

    type PtrConvType = VectorType<'ctx>

    The type for pointer to int or pointer vector to int conversions.
    source§

    impl<'ctx> TryFrom<AnyTypeEnum<'ctx>> for VectorType<'ctx>

    §

    type Error = ()

    The type returned in the event of a conversion error.
    source§

    fn try_from(value: AnyTypeEnum<'ctx>) -> Result<Self, Self::Error>

    Performs the conversion.
    source§

    impl<'ctx> TryFrom<BasicMetadataTypeEnum<'ctx>> for VectorType<'ctx>

    §

    type Error = ()

    The type returned in the event of a conversion error.
    source§

    fn try_from(value: BasicMetadataTypeEnum<'ctx>) -> Result<Self, Self::Error>

    Performs the conversion.
    source§

    impl<'ctx> TryFrom<BasicTypeEnum<'ctx>> for VectorType<'ctx>

    §

    type Error = ()

    The type returned in the event of a conversion error.
    source§

    fn try_from(value: BasicTypeEnum<'ctx>) -> Result<Self, Self::Error>

    Performs the conversion.
    source§

    impl<'ctx> Copy for VectorType<'ctx>

    source§

    impl<'ctx> Eq for VectorType<'ctx>

    source§

    impl<'ctx> StructuralPartialEq for VectorType<'ctx>

    Auto Trait Implementations§

    §

    impl<'ctx> Freeze for VectorType<'ctx>

    §

    impl<'ctx> RefUnwindSafe for VectorType<'ctx>

    §

    impl<'ctx> !Send for VectorType<'ctx>

    §

    impl<'ctx> !Sync for VectorType<'ctx>

    §

    impl<'ctx> Unpin for VectorType<'ctx>

    §

    impl<'ctx> UnwindSafe for VectorType<'ctx>

    Blanket Implementations§

    source§

    impl<T> Any for T
    where +sufficient, and should not be overridden without very good reason.

    source§

    impl<'ctx> PointerMathType<'ctx> for VectorType<'ctx>

    §

    type ValueType = VectorValue<'ctx>

    The value instance of a pointer type.
    §

    type PtrConvType = VectorType<'ctx>

    The type for pointer to int or pointer vector to int conversions.
    source§

    impl<'ctx> TryFrom<AnyTypeEnum<'ctx>> for VectorType<'ctx>

    §

    type Error = ()

    The type returned in the event of a conversion error.
    source§

    fn try_from(value: AnyTypeEnum<'ctx>) -> Result<Self, Self::Error>

    Performs the conversion.
    source§

    impl<'ctx> TryFrom<BasicMetadataTypeEnum<'ctx>> for VectorType<'ctx>

    §

    type Error = ()

    The type returned in the event of a conversion error.
    source§

    fn try_from(value: BasicMetadataTypeEnum<'ctx>) -> Result<Self, Self::Error>

    Performs the conversion.
    source§

    impl<'ctx> TryFrom<BasicTypeEnum<'ctx>> for VectorType<'ctx>

    §

    type Error = ()

    The type returned in the event of a conversion error.
    source§

    fn try_from(value: BasicTypeEnum<'ctx>) -> Result<Self, Self::Error>

    Performs the conversion.
    source§

    impl<'ctx> Copy for VectorType<'ctx>

    source§

    impl<'ctx> Eq for VectorType<'ctx>

    source§

    impl<'ctx> StructuralPartialEq for VectorType<'ctx>

    Auto Trait Implementations§

    §

    impl<'ctx> Freeze for VectorType<'ctx>

    §

    impl<'ctx> RefUnwindSafe for VectorType<'ctx>

    §

    impl<'ctx> !Send for VectorType<'ctx>

    §

    impl<'ctx> !Sync for VectorType<'ctx>

    §

    impl<'ctx> Unpin for VectorType<'ctx>

    §

    impl<'ctx> UnwindSafe for VectorType<'ctx>

    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/inkwell/types/trait.AsTypeRef.html b/inkwell/types/trait.AsTypeRef.html index ac3de3a1e..e7335c8a3 100644 --- a/inkwell/types/trait.AsTypeRef.html +++ b/inkwell/types/trait.AsTypeRef.html @@ -4,4 +4,4 @@ fn as_type_ref(&self) -> LLVMTypeRef; }
    Expand description

    Accessor to the inner LLVM type reference

    Required Methods§

    source

    fn as_type_ref(&self) -> LLVMTypeRef

    Returns the internal LLVM reference behind the type

    -

    Implementors§

    \ No newline at end of file +

    Implementors§

    \ No newline at end of file diff --git a/inkwell/values/constant.FIRST_CUSTOM_METADATA_KIND_ID.html b/inkwell/values/constant.FIRST_CUSTOM_METADATA_KIND_ID.html index 00106d7b8..06daac2c6 100644 --- a/inkwell/values/constant.FIRST_CUSTOM_METADATA_KIND_ID.html +++ b/inkwell/values/constant.FIRST_CUSTOM_METADATA_KIND_ID.html @@ -1,2 +1,5 @@ -FIRST_CUSTOM_METADATA_KIND_ID in inkwell::values - Rust
    -

    Constant inkwell::values::FIRST_CUSTOM_METADATA_KIND_ID

    source · 
    pub const FIRST_CUSTOM_METADATA_KIND_ID: u32 = 40;
    \ No newline at end of file +FIRST_CUSTOM_METADATA_KIND_ID in inkwell::values - Rust
    +

    Constant inkwell::values::FIRST_CUSTOM_METADATA_KIND_ID

    source · 
    pub const FIRST_CUSTOM_METADATA_KIND_ID: u32 = _; // 40u32
    Expand description

    Value returned by Context::get_kind_id() +for the first input string that isn’t known.

    +

    Each LLVM version has a different set of pre-defined metadata kinds.

    +
    \ No newline at end of file diff --git a/inkwell/values/enum.AggregateValueEnum.html b/inkwell/values/enum.AggregateValueEnum.html index 29c8caed1..6daf676e3 100644 --- a/inkwell/values/enum.AggregateValueEnum.html +++ b/inkwell/values/enum.AggregateValueEnum.html @@ -8,16 +8,16 @@

    source

    pub fn is_array_value(self) -> bool

    source

    pub fn is_struct_value(self) -> bool

    source

    pub fn into_array_value(self) -> ArrayValue<'ctx>

    source

    pub fn into_struct_value(self) -> StructValue<'ctx>

    Trait Implementations§

    source§

    impl<'ctx> AggregateValue<'ctx> for AggregateValueEnum<'ctx>

    source§

    fn as_aggregate_value_enum(&self) -> AggregateValueEnum<'ctx>

    Returns an enum containing a typed version of the AggregateValue.
    source§

    impl<'ctx> AnyValue<'ctx> for AggregateValueEnum<'ctx>

    source§

    fn as_any_value_enum(&self) -> AnyValueEnum<'ctx>

    Returns an enum containing a typed version of AnyValue.
    source§

    fn print_to_string(&self) -> LLVMString

    Prints a value to a LLVMString
    source§

    fn is_poison(&self) -> bool

    Returns whether the value is poison
    source§

    impl AsValueRef for AggregateValueEnum<'_>

    source§

    fn as_value_ref(&self) -> LLVMValueRef

    source§

    impl<'ctx> BasicValue<'ctx> for AggregateValueEnum<'ctx>

    source§

    fn as_basic_value_enum(&self) -> BasicValueEnum<'ctx>

    Returns an enum containing a typed version of the BasicValue.
    source§

    fn as_instruction_value(&self) -> Option<InstructionValue<'ctx>>

    Most BasicValues are the byproduct of an instruction and so are convertible into an InstructionValue
    source§

    fn get_first_use(&self) -> Option<BasicValueUse<'_>>

    source§

    fn set_name(&self, name: &str)

    Sets the name of a BasicValue. If the value is a constant, this is a noop.
    source§

    impl<'ctx> Clone for AggregateValueEnum<'ctx>

    source§

    fn clone(&self) -> AggregateValueEnum<'ctx>

    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<'ctx> Debug for AggregateValueEnum<'ctx>

    source§

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

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

    impl Display for AggregateValueEnum<'_>

    source§

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

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

    impl<'ctx> From<ArrayValue<'ctx>> for AggregateValueEnum<'ctx>

    source§

    fn from(value: ArrayValue<'_>) -> AggregateValueEnum<'_>

    Converts to this type from the input type.
    source§

    impl<'ctx> From<StructValue<'ctx>> for AggregateValueEnum<'ctx>

    source§

    fn from(value: StructValue<'_>) -> AggregateValueEnum<'_>

    Converts to this type from the input type.
    source§

    impl<'ctx> Hash for AggregateValueEnum<'ctx>

    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<'ctx> PartialEq<AggregateValueEnum<'ctx>> for ArrayValue<'ctx>

    source§

    fn eq(&self, other: &AggregateValueEnum<'ctx>) -> bool

    This method tests for self and other values to be equal, and is used -by ==.
    1.0.0 · source§

    fn ne(&self, other: &Rhs) -> bool

    This method tests for !=. The default implementation is almost always -sufficient, and should not be overridden without very good reason.
    source§

    impl<'ctx> PartialEq<AggregateValueEnum<'ctx>> for StructValue<'ctx>

    source§

    fn eq(&self, other: &AggregateValueEnum<'ctx>) -> bool

    This method tests for self and other values to be equal, and is used -by ==.
    1.0.0 · source§

    fn ne(&self, other: &Rhs) -> bool

    This method tests for !=. The default implementation is almost always -sufficient, and should not be overridden without very good reason.
    source§

    impl<'ctx> PartialEq<ArrayValue<'ctx>> for AggregateValueEnum<'ctx>

    source§

    fn eq(&self, other: &ArrayValue<'ctx>) -> bool

    This method tests for self and other values to be equal, and is used -by ==.
    1.0.0 · source§

    fn ne(&self, other: &Rhs) -> bool

    This method tests for !=. The default implementation is almost always -sufficient, and should not be overridden without very good reason.
    source§

    impl<'ctx> PartialEq<StructValue<'ctx>> for AggregateValueEnum<'ctx>

    source§

    fn eq(&self, other: &StructValue<'ctx>) -> bool

    This method tests for self and other values to be equal, and is used -by ==.
    1.0.0 · source§

    fn ne(&self, other: &Rhs) -> bool

    This method tests for !=. The default implementation is almost always -sufficient, and should not be overridden without very good reason.
    source§

    impl<'ctx> PartialEq for AggregateValueEnum<'ctx>

    source§

    fn eq(&self, other: &AggregateValueEnum<'ctx>) -> bool

    This method tests for self and other values to be equal, and is used + Self: Sized,
    Feeds a slice of this type into the given Hasher. Read more
    source§

    impl<'ctx> PartialEq<AggregateValueEnum<'ctx>> for ArrayValue<'ctx>

    source§

    fn eq(&self, other: &AggregateValueEnum<'ctx>) -> bool

    This method tests for self and other values to be equal, and is used by ==.
    1.0.0 · source§

    fn ne(&self, other: &Rhs) -> bool

    This method tests for !=. The default implementation is almost always +sufficient, and should not be overridden without very good reason.
    source§

    impl<'ctx> PartialEq<AggregateValueEnum<'ctx>> for StructValue<'ctx>

    source§

    fn eq(&self, other: &AggregateValueEnum<'ctx>) -> bool

    This method tests for self and other values to be equal, and is used +by ==.
    1.0.0 · source§

    fn ne(&self, other: &Rhs) -> bool

    This method tests for !=. The default implementation is almost always +sufficient, and should not be overridden without very good reason.
    source§

    impl<'ctx> PartialEq<ArrayValue<'ctx>> for AggregateValueEnum<'ctx>

    source§

    fn eq(&self, other: &ArrayValue<'ctx>) -> bool

    This method tests for self and other values to be equal, and is used +by ==.
    1.0.0 · source§

    fn ne(&self, other: &Rhs) -> bool

    This method tests for !=. The default implementation is almost always +sufficient, and should not be overridden without very good reason.
    source§

    impl<'ctx> PartialEq<StructValue<'ctx>> for AggregateValueEnum<'ctx>

    source§

    fn eq(&self, other: &StructValue<'ctx>) -> bool

    This method tests for self and other values to be equal, and is used +by ==.
    1.0.0 · source§

    fn ne(&self, other: &Rhs) -> bool

    This method tests for !=. The default implementation is almost always +sufficient, and should not be overridden without very good reason.
    source§

    impl<'ctx> PartialEq for AggregateValueEnum<'ctx>

    source§

    fn eq(&self, other: &AggregateValueEnum<'ctx>) -> bool

    This method tests for self and other values to be equal, and is used +by ==.
    1.0.0 · source§

    fn ne(&self, other: &Rhs) -> bool

    This method tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.
    source§

    impl<'ctx> TryFrom<AggregateValueEnum<'ctx>> for ArrayValue<'ctx>

    §

    type Error = ()

    The type returned in the event of a conversion error.
    source§

    fn try_from(value: AggregateValueEnum<'ctx>) -> Result<Self, Self::Error>

    Performs the conversion.
    source§

    impl<'ctx> TryFrom<AggregateValueEnum<'ctx>> for StructValue<'ctx>

    §

    type Error = ()

    The type returned in the event of a conversion error.
    source§

    fn try_from(value: AggregateValueEnum<'ctx>) -> Result<Self, Self::Error>

    Performs the conversion.
    source§

    impl<'ctx> Copy for AggregateValueEnum<'ctx>

    source§

    impl<'ctx> Eq for AggregateValueEnum<'ctx>

    source§

    impl<'ctx> StructuralPartialEq for AggregateValueEnum<'ctx>

    Auto Trait Implementations§

    §

    impl<'ctx> Freeze for AggregateValueEnum<'ctx>

    §

    impl<'ctx> RefUnwindSafe for AggregateValueEnum<'ctx>

    §

    impl<'ctx> !Send for AggregateValueEnum<'ctx>

    §

    impl<'ctx> !Sync for AggregateValueEnum<'ctx>

    §

    impl<'ctx> Unpin for AggregateValueEnum<'ctx>

    §

    impl<'ctx> UnwindSafe for AggregateValueEnum<'ctx>

    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/inkwell/values/enum.AnyValueEnum.html b/inkwell/values/enum.AnyValueEnum.html index f03d9a68a..387d01a51 100644 --- a/inkwell/values/enum.AnyValueEnum.html +++ b/inkwell/values/enum.AnyValueEnum.html @@ -13,51 +13,51 @@ }

    Variants§

    §

    ArrayValue(ArrayValue<'ctx>)

    §

    IntValue(IntValue<'ctx>)

    §

    FloatValue(FloatValue<'ctx>)

    §

    PhiValue(PhiValue<'ctx>)

    §

    FunctionValue(FunctionValue<'ctx>)

    §

    PointerValue(PointerValue<'ctx>)

    §

    StructValue(StructValue<'ctx>)

    §

    VectorValue(VectorValue<'ctx>)

    §

    InstructionValue(InstructionValue<'ctx>)

    §

    MetadataValue(MetadataValue<'ctx>)

    Implementations§

    source§

    impl<'ctx> AnyValueEnum<'ctx>

    source

    pub unsafe fn new(value: LLVMValueRef) -> Self

    Get a value from an LLVMValueRef.

    §Safety

    The ref must be valid and of supported enum type options (LLVMTypeKind).

    -
    source

    pub fn get_type(&self) -> AnyTypeEnum<'ctx>

    source

    pub fn is_array_value(self) -> bool

    source

    pub fn is_int_value(self) -> bool

    source

    pub fn is_float_value(self) -> bool

    source

    pub fn is_phi_value(self) -> bool

    source

    pub fn is_function_value(self) -> bool

    source

    pub fn is_pointer_value(self) -> bool

    source

    pub fn is_struct_value(self) -> bool

    source

    pub fn is_vector_value(self) -> bool

    source

    pub fn is_instruction_value(self) -> bool

    source

    pub fn into_array_value(self) -> ArrayValue<'ctx>

    source

    pub fn into_int_value(self) -> IntValue<'ctx>

    source

    pub fn into_float_value(self) -> FloatValue<'ctx>

    source

    pub fn into_phi_value(self) -> PhiValue<'ctx>

    source

    pub fn into_function_value(self) -> FunctionValue<'ctx>

    source

    pub fn into_pointer_value(self) -> PointerValue<'ctx>

    source

    pub fn into_struct_value(self) -> StructValue<'ctx>

    source

    pub fn into_vector_value(self) -> VectorValue<'ctx>

    source

    pub fn into_instruction_value(self) -> InstructionValue<'ctx>

    Trait Implementations§

    source§

    impl<'ctx> AnyValue<'ctx> for AnyValueEnum<'ctx>

    source§

    fn as_any_value_enum(&self) -> AnyValueEnum<'ctx>

    Returns an enum containing a typed version of AnyValue.
    source§

    fn print_to_string(&self) -> LLVMString

    Prints a value to a LLVMString
    source§

    fn is_poison(&self) -> bool

    Returns whether the value is poison
    source§

    impl AsValueRef for AnyValueEnum<'_>

    source§

    fn as_value_ref(&self) -> LLVMValueRef

    source§

    impl<'ctx> Clone for AnyValueEnum<'ctx>

    source§

    fn clone(&self) -> AnyValueEnum<'ctx>

    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<'ctx> Debug for AnyValueEnum<'ctx>

    source§

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

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

    impl Display for AnyValueEnum<'_>

    source§

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

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

    impl<'ctx> From<ArrayValue<'ctx>> for AnyValueEnum<'ctx>

    source§

    fn from(value: ArrayValue<'_>) -> AnyValueEnum<'_>

    Converts to this type from the input type.
    source§

    impl<'ctx> From<BasicValueEnum<'ctx>> for AnyValueEnum<'ctx>

    source§

    fn from(value: BasicValueEnum<'ctx>) -> Self

    Converts to this type from the input type.
    source§

    impl<'ctx> From<FloatValue<'ctx>> for AnyValueEnum<'ctx>

    source§

    fn from(value: FloatValue<'_>) -> AnyValueEnum<'_>

    Converts to this type from the input type.
    source§

    impl<'ctx> From<FunctionValue<'ctx>> for AnyValueEnum<'ctx>

    source§

    fn from(value: FunctionValue<'_>) -> AnyValueEnum<'_>

    Converts to this type from the input type.
    source§

    impl<'ctx> From<InstructionValue<'ctx>> for AnyValueEnum<'ctx>

    source§

    fn from(value: InstructionValue<'_>) -> AnyValueEnum<'_>

    Converts to this type from the input type.
    source§

    impl<'ctx> From<IntValue<'ctx>> for AnyValueEnum<'ctx>

    source§

    fn from(value: IntValue<'_>) -> AnyValueEnum<'_>

    Converts to this type from the input type.
    source§

    impl<'ctx> From<MetadataValue<'ctx>> for AnyValueEnum<'ctx>

    source§

    fn from(value: MetadataValue<'_>) -> AnyValueEnum<'_>

    Converts to this type from the input type.
    source§

    impl<'ctx> From<PhiValue<'ctx>> for AnyValueEnum<'ctx>

    source§

    fn from(value: PhiValue<'_>) -> AnyValueEnum<'_>

    Converts to this type from the input type.
    source§

    impl<'ctx> From<PointerValue<'ctx>> for AnyValueEnum<'ctx>

    source§

    fn from(value: PointerValue<'_>) -> AnyValueEnum<'_>

    Converts to this type from the input type.
    source§

    impl<'ctx> From<StructValue<'ctx>> for AnyValueEnum<'ctx>

    source§

    fn from(value: StructValue<'_>) -> AnyValueEnum<'_>

    Converts to this type from the input type.
    source§

    impl<'ctx> From<VectorValue<'ctx>> for AnyValueEnum<'ctx>

    source§

    fn from(value: VectorValue<'_>) -> AnyValueEnum<'_>

    Converts to this type from the input type.
    source§

    impl<'ctx> Hash for AnyValueEnum<'ctx>

    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

    pub fn get_type(&self) -> AnyTypeEnum<'ctx>

    source

    pub fn is_array_value(self) -> bool

    source

    pub fn is_int_value(self) -> bool

    source

    pub fn is_float_value(self) -> bool

    source

    pub fn is_phi_value(self) -> bool

    source

    pub fn is_function_value(self) -> bool

    source

    pub fn is_pointer_value(self) -> bool

    source

    pub fn is_struct_value(self) -> bool

    source

    pub fn is_vector_value(self) -> bool

    source

    pub fn is_instruction_value(self) -> bool

    source

    pub fn into_array_value(self) -> ArrayValue<'ctx>

    source

    pub fn into_int_value(self) -> IntValue<'ctx>

    source

    pub fn into_float_value(self) -> FloatValue<'ctx>

    source

    pub fn into_phi_value(self) -> PhiValue<'ctx>

    source

    pub fn into_function_value(self) -> FunctionValue<'ctx>

    source

    pub fn into_pointer_value(self) -> PointerValue<'ctx>

    source

    pub fn into_struct_value(self) -> StructValue<'ctx>

    source

    pub fn into_vector_value(self) -> VectorValue<'ctx>

    source

    pub fn into_instruction_value(self) -> InstructionValue<'ctx>

    Trait Implementations§

    source§

    impl<'ctx> AnyValue<'ctx> for AnyValueEnum<'ctx>

    source§

    fn as_any_value_enum(&self) -> AnyValueEnum<'ctx>

    Returns an enum containing a typed version of AnyValue.
    source§

    fn print_to_string(&self) -> LLVMString

    Prints a value to a LLVMString
    source§

    fn is_poison(&self) -> bool

    Returns whether the value is poison
    source§

    impl AsValueRef for AnyValueEnum<'_>

    source§

    fn as_value_ref(&self) -> LLVMValueRef

    source§

    impl<'ctx> Clone for AnyValueEnum<'ctx>

    source§

    fn clone(&self) -> AnyValueEnum<'ctx>

    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<'ctx> Debug for AnyValueEnum<'ctx>

    source§

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

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

    impl Display for AnyValueEnum<'_>

    source§

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

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

    impl<'ctx> From<ArrayValue<'ctx>> for AnyValueEnum<'ctx>

    source§

    fn from(value: ArrayValue<'_>) -> AnyValueEnum<'_>

    Converts to this type from the input type.
    source§

    impl<'ctx> From<BasicValueEnum<'ctx>> for AnyValueEnum<'ctx>

    source§

    fn from(value: BasicValueEnum<'ctx>) -> Self

    Converts to this type from the input type.
    source§

    impl<'ctx> From<FloatValue<'ctx>> for AnyValueEnum<'ctx>

    source§

    fn from(value: FloatValue<'_>) -> AnyValueEnum<'_>

    Converts to this type from the input type.
    source§

    impl<'ctx> From<FunctionValue<'ctx>> for AnyValueEnum<'ctx>

    source§

    fn from(value: FunctionValue<'_>) -> AnyValueEnum<'_>

    Converts to this type from the input type.
    source§

    impl<'ctx> From<InstructionValue<'ctx>> for AnyValueEnum<'ctx>

    source§

    fn from(value: InstructionValue<'_>) -> AnyValueEnum<'_>

    Converts to this type from the input type.
    source§

    impl<'ctx> From<IntValue<'ctx>> for AnyValueEnum<'ctx>

    source§

    fn from(value: IntValue<'_>) -> AnyValueEnum<'_>

    Converts to this type from the input type.
    source§

    impl<'ctx> From<MetadataValue<'ctx>> for AnyValueEnum<'ctx>

    source§

    fn from(value: MetadataValue<'_>) -> AnyValueEnum<'_>

    Converts to this type from the input type.
    source§

    impl<'ctx> From<PhiValue<'ctx>> for AnyValueEnum<'ctx>

    source§

    fn from(value: PhiValue<'_>) -> AnyValueEnum<'_>

    Converts to this type from the input type.
    source§

    impl<'ctx> From<PointerValue<'ctx>> for AnyValueEnum<'ctx>

    source§

    fn from(value: PointerValue<'_>) -> AnyValueEnum<'_>

    Converts to this type from the input type.
    source§

    impl<'ctx> From<StructValue<'ctx>> for AnyValueEnum<'ctx>

    source§

    fn from(value: StructValue<'_>) -> AnyValueEnum<'_>

    Converts to this type from the input type.
    source§

    impl<'ctx> From<VectorValue<'ctx>> for AnyValueEnum<'ctx>

    source§

    fn from(value: VectorValue<'_>) -> AnyValueEnum<'_>

    Converts to this type from the input type.
    source§

    impl<'ctx> Hash for AnyValueEnum<'ctx>

    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<'ctx> PartialEq<AnyValueEnum<'ctx>> for ArrayValue<'ctx>

    source§

    fn eq(&self, other: &AnyValueEnum<'ctx>) -> bool

    This method tests for self and other values to be equal, and is used -by ==.
    1.0.0 · source§

    fn ne(&self, other: &Rhs) -> bool

    This method tests for !=. The default implementation is almost always -sufficient, and should not be overridden without very good reason.
    source§

    impl<'ctx> PartialEq<AnyValueEnum<'ctx>> for FloatValue<'ctx>

    source§

    fn eq(&self, other: &AnyValueEnum<'ctx>) -> bool

    This method tests for self and other values to be equal, and is used -by ==.
    1.0.0 · source§

    fn ne(&self, other: &Rhs) -> bool

    This method tests for !=. The default implementation is almost always -sufficient, and should not be overridden without very good reason.
    source§

    impl<'ctx> PartialEq<AnyValueEnum<'ctx>> for FunctionValue<'ctx>

    source§

    fn eq(&self, other: &AnyValueEnum<'ctx>) -> bool

    This method tests for self and other values to be equal, and is used -by ==.
    1.0.0 · source§

    fn ne(&self, other: &Rhs) -> bool

    This method tests for !=. The default implementation is almost always -sufficient, and should not be overridden without very good reason.
    source§

    impl<'ctx> PartialEq<AnyValueEnum<'ctx>> for InstructionValue<'ctx>

    source§

    fn eq(&self, other: &AnyValueEnum<'ctx>) -> bool

    This method tests for self and other values to be equal, and is used -by ==.
    1.0.0 · source§

    fn ne(&self, other: &Rhs) -> bool

    This method tests for !=. The default implementation is almost always -sufficient, and should not be overridden without very good reason.
    source§

    impl<'ctx> PartialEq<AnyValueEnum<'ctx>> for IntValue<'ctx>

    source§

    fn eq(&self, other: &AnyValueEnum<'ctx>) -> bool

    This method tests for self and other values to be equal, and is used -by ==.
    1.0.0 · source§

    fn ne(&self, other: &Rhs) -> bool

    This method tests for !=. The default implementation is almost always -sufficient, and should not be overridden without very good reason.
    source§

    impl<'ctx> PartialEq<AnyValueEnum<'ctx>> for MetadataValue<'ctx>

    source§

    fn eq(&self, other: &AnyValueEnum<'ctx>) -> bool

    This method tests for self and other values to be equal, and is used -by ==.
    1.0.0 · source§

    fn ne(&self, other: &Rhs) -> bool

    This method tests for !=. The default implementation is almost always -sufficient, and should not be overridden without very good reason.
    source§

    impl<'ctx> PartialEq<AnyValueEnum<'ctx>> for PhiValue<'ctx>

    source§

    fn eq(&self, other: &AnyValueEnum<'ctx>) -> bool

    This method tests for self and other values to be equal, and is used -by ==.
    1.0.0 · source§

    fn ne(&self, other: &Rhs) -> bool

    This method tests for !=. The default implementation is almost always -sufficient, and should not be overridden without very good reason.
    source§

    impl<'ctx> PartialEq<AnyValueEnum<'ctx>> for PointerValue<'ctx>

    source§

    fn eq(&self, other: &AnyValueEnum<'ctx>) -> bool

    This method tests for self and other values to be equal, and is used -by ==.
    1.0.0 · source§

    fn ne(&self, other: &Rhs) -> bool

    This method tests for !=. The default implementation is almost always -sufficient, and should not be overridden without very good reason.
    source§

    impl<'ctx> PartialEq<AnyValueEnum<'ctx>> for StructValue<'ctx>

    source§

    fn eq(&self, other: &AnyValueEnum<'ctx>) -> bool

    This method tests for self and other values to be equal, and is used -by ==.
    1.0.0 · source§

    fn ne(&self, other: &Rhs) -> bool

    This method tests for !=. The default implementation is almost always -sufficient, and should not be overridden without very good reason.
    source§

    impl<'ctx> PartialEq<AnyValueEnum<'ctx>> for VectorValue<'ctx>

    source§

    fn eq(&self, other: &AnyValueEnum<'ctx>) -> bool

    This method tests for self and other values to be equal, and is used -by ==.
    1.0.0 · source§

    fn ne(&self, other: &Rhs) -> bool

    This method tests for !=. The default implementation is almost always -sufficient, and should not be overridden without very good reason.
    source§

    impl<'ctx> PartialEq<ArrayValue<'ctx>> for AnyValueEnum<'ctx>

    source§

    fn eq(&self, other: &ArrayValue<'ctx>) -> bool

    This method tests for self and other values to be equal, and is used -by ==.
    1.0.0 · source§

    fn ne(&self, other: &Rhs) -> bool

    This method tests for !=. The default implementation is almost always -sufficient, and should not be overridden without very good reason.
    source§

    impl<'ctx> PartialEq<FloatValue<'ctx>> for AnyValueEnum<'ctx>

    source§

    fn eq(&self, other: &FloatValue<'ctx>) -> bool

    This method tests for self and other values to be equal, and is used -by ==.
    1.0.0 · source§

    fn ne(&self, other: &Rhs) -> bool

    This method tests for !=. The default implementation is almost always -sufficient, and should not be overridden without very good reason.
    source§

    impl<'ctx> PartialEq<FunctionValue<'ctx>> for AnyValueEnum<'ctx>

    source§

    fn eq(&self, other: &FunctionValue<'ctx>) -> bool

    This method tests for self and other values to be equal, and is used -by ==.
    1.0.0 · source§

    fn ne(&self, other: &Rhs) -> bool

    This method tests for !=. The default implementation is almost always -sufficient, and should not be overridden without very good reason.
    source§

    impl<'ctx> PartialEq<InstructionValue<'ctx>> for AnyValueEnum<'ctx>

    source§

    fn eq(&self, other: &InstructionValue<'ctx>) -> bool

    This method tests for self and other values to be equal, and is used -by ==.
    1.0.0 · source§

    fn ne(&self, other: &Rhs) -> bool

    This method tests for !=. The default implementation is almost always -sufficient, and should not be overridden without very good reason.
    source§

    impl<'ctx> PartialEq<IntValue<'ctx>> for AnyValueEnum<'ctx>

    source§

    fn eq(&self, other: &IntValue<'ctx>) -> bool

    This method tests for self and other values to be equal, and is used -by ==.
    1.0.0 · source§

    fn ne(&self, other: &Rhs) -> bool

    This method tests for !=. The default implementation is almost always -sufficient, and should not be overridden without very good reason.
    source§

    impl<'ctx> PartialEq<MetadataValue<'ctx>> for AnyValueEnum<'ctx>

    source§

    fn eq(&self, other: &MetadataValue<'ctx>) -> bool

    This method tests for self and other values to be equal, and is used + Self: Sized,

    Feeds a slice of this type into the given Hasher. Read more
    source§

    impl<'ctx> PartialEq<AnyValueEnum<'ctx>> for ArrayValue<'ctx>

    source§

    fn eq(&self, other: &AnyValueEnum<'ctx>) -> bool

    This method tests for self and other values to be equal, and is used by ==.
    1.0.0 · source§

    fn ne(&self, other: &Rhs) -> bool

    This method tests for !=. The default implementation is almost always -sufficient, and should not be overridden without very good reason.
    source§

    impl<'ctx> PartialEq<PhiValue<'ctx>> for AnyValueEnum<'ctx>

    source§

    fn eq(&self, other: &PhiValue<'ctx>) -> 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<'ctx> PartialEq<AnyValueEnum<'ctx>> for FloatValue<'ctx>

    source§

    fn eq(&self, other: &AnyValueEnum<'ctx>) -> bool

    This method tests for self and other values to be equal, and is used +by ==.
    1.0.0 · source§

    fn ne(&self, other: &Rhs) -> bool

    This method tests for !=. The default implementation is almost always +sufficient, and should not be overridden without very good reason.
    source§

    impl<'ctx> PartialEq<AnyValueEnum<'ctx>> for FunctionValue<'ctx>

    source§

    fn eq(&self, other: &AnyValueEnum<'ctx>) -> bool

    This method tests for self and other values to be equal, and is used +by ==.
    1.0.0 · source§

    fn ne(&self, other: &Rhs) -> bool

    This method tests for !=. The default implementation is almost always +sufficient, and should not be overridden without very good reason.
    source§

    impl<'ctx> PartialEq<AnyValueEnum<'ctx>> for InstructionValue<'ctx>

    source§

    fn eq(&self, other: &AnyValueEnum<'ctx>) -> bool

    This method tests for self and other values to be equal, and is used +by ==.
    1.0.0 · source§

    fn ne(&self, other: &Rhs) -> bool

    This method tests for !=. The default implementation is almost always +sufficient, and should not be overridden without very good reason.
    source§

    impl<'ctx> PartialEq<AnyValueEnum<'ctx>> for IntValue<'ctx>

    source§

    fn eq(&self, other: &AnyValueEnum<'ctx>) -> bool

    This method tests for self and other values to be equal, and is used +by ==.
    1.0.0 · source§

    fn ne(&self, other: &Rhs) -> bool

    This method tests for !=. The default implementation is almost always +sufficient, and should not be overridden without very good reason.
    source§

    impl<'ctx> PartialEq<AnyValueEnum<'ctx>> for MetadataValue<'ctx>

    source§

    fn eq(&self, other: &AnyValueEnum<'ctx>) -> bool

    This method tests for self and other values to be equal, and is used +by ==.
    1.0.0 · source§

    fn ne(&self, other: &Rhs) -> bool

    This method tests for !=. The default implementation is almost always +sufficient, and should not be overridden without very good reason.
    source§

    impl<'ctx> PartialEq<AnyValueEnum<'ctx>> for PhiValue<'ctx>

    source§

    fn eq(&self, other: &AnyValueEnum<'ctx>) -> bool

    This method tests for self and other values to be equal, and is used +by ==.
    1.0.0 · source§

    fn ne(&self, other: &Rhs) -> bool

    This method tests for !=. The default implementation is almost always +sufficient, and should not be overridden without very good reason.
    source§

    impl<'ctx> PartialEq<AnyValueEnum<'ctx>> for PointerValue<'ctx>

    source§

    fn eq(&self, other: &AnyValueEnum<'ctx>) -> bool

    This method tests for self and other values to be equal, and is used +by ==.
    1.0.0 · source§

    fn ne(&self, other: &Rhs) -> bool

    This method tests for !=. The default implementation is almost always +sufficient, and should not be overridden without very good reason.
    source§

    impl<'ctx> PartialEq<AnyValueEnum<'ctx>> for StructValue<'ctx>

    source§

    fn eq(&self, other: &AnyValueEnum<'ctx>) -> bool

    This method tests for self and other values to be equal, and is used +by ==.
    1.0.0 · source§

    fn ne(&self, other: &Rhs) -> bool

    This method tests for !=. The default implementation is almost always +sufficient, and should not be overridden without very good reason.
    source§

    impl<'ctx> PartialEq<AnyValueEnum<'ctx>> for VectorValue<'ctx>

    source§

    fn eq(&self, other: &AnyValueEnum<'ctx>) -> bool

    This method tests for self and other values to be equal, and is used +by ==.
    1.0.0 · source§

    fn ne(&self, other: &Rhs) -> bool

    This method tests for !=. The default implementation is almost always +sufficient, and should not be overridden without very good reason.
    source§

    impl<'ctx> PartialEq<ArrayValue<'ctx>> for AnyValueEnum<'ctx>

    source§

    fn eq(&self, other: &ArrayValue<'ctx>) -> bool

    This method tests for self and other values to be equal, and is used by ==.
    1.0.0 · source§

    fn ne(&self, other: &Rhs) -> bool

    This method tests for !=. The default implementation is almost always +sufficient, and should not be overridden without very good reason.
    source§

    impl<'ctx> PartialEq<FloatValue<'ctx>> for AnyValueEnum<'ctx>

    source§

    fn eq(&self, other: &FloatValue<'ctx>) -> bool

    This method tests for self and other values to be equal, and is used +by ==.
    1.0.0 · source§

    fn ne(&self, other: &Rhs) -> bool

    This method tests for !=. The default implementation is almost always +sufficient, and should not be overridden without very good reason.
    source§

    impl<'ctx> PartialEq<FunctionValue<'ctx>> for AnyValueEnum<'ctx>

    source§

    fn eq(&self, other: &FunctionValue<'ctx>) -> bool

    This method tests for self and other values to be equal, and is used +by ==.
    1.0.0 · source§

    fn ne(&self, other: &Rhs) -> bool

    This method tests for !=. The default implementation is almost always +sufficient, and should not be overridden without very good reason.
    source§

    impl<'ctx> PartialEq<InstructionValue<'ctx>> for AnyValueEnum<'ctx>

    source§

    fn eq(&self, other: &InstructionValue<'ctx>) -> bool

    This method tests for self and other values to be equal, and is used +by ==.
    1.0.0 · source§

    fn ne(&self, other: &Rhs) -> bool

    This method tests for !=. The default implementation is almost always +sufficient, and should not be overridden without very good reason.
    source§

    impl<'ctx> PartialEq<IntValue<'ctx>> for AnyValueEnum<'ctx>

    source§

    fn eq(&self, other: &IntValue<'ctx>) -> bool

    This method tests for self and other values to be equal, and is used +by ==.
    1.0.0 · source§

    fn ne(&self, other: &Rhs) -> bool

    This method tests for !=. The default implementation is almost always +sufficient, and should not be overridden without very good reason.
    source§

    impl<'ctx> PartialEq<MetadataValue<'ctx>> for AnyValueEnum<'ctx>

    source§

    fn eq(&self, other: &MetadataValue<'ctx>) -> bool

    This method tests for self and other values to be equal, and is used +by ==.
    1.0.0 · source§

    fn ne(&self, other: &Rhs) -> bool

    This method tests for !=. The default implementation is almost always +sufficient, and should not be overridden without very good reason.
    source§

    impl<'ctx> PartialEq<PhiValue<'ctx>> for AnyValueEnum<'ctx>

    source§

    fn eq(&self, other: &PhiValue<'ctx>) -> bool

    This method tests for self and other values to be equal, and is used +by ==.
    1.0.0 · source§

    fn ne(&self, other: &Rhs) -> bool

    This method tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.
    source§

    impl<'ctx> PartialEq<PointerValue<'ctx>> for AnyValueEnum<'ctx>

    source§

    fn eq(&self, other: &PointerValue<'ctx>) -> bool

    This method tests for self and other values to be equal, and is used by ==.
    1.0.0 · source§

    fn ne(&self, other: &Rhs) -> bool

    This method tests for !=. The default implementation is almost always -sufficient, and should not be overridden without very good reason.
    source§

    impl<'ctx> PartialEq<StructValue<'ctx>> for AnyValueEnum<'ctx>

    source§

    fn eq(&self, other: &StructValue<'ctx>) -> bool

    This method tests for self and other values to be equal, and is used -by ==.
    1.0.0 · source§

    fn ne(&self, other: &Rhs) -> bool

    This method tests for !=. The default implementation is almost always -sufficient, and should not be overridden without very good reason.
    source§

    impl<'ctx> PartialEq<VectorValue<'ctx>> for AnyValueEnum<'ctx>

    source§

    fn eq(&self, other: &VectorValue<'ctx>) -> bool

    This method tests for self and other values to be equal, and is used -by ==.
    1.0.0 · source§

    fn ne(&self, other: &Rhs) -> bool

    This method tests for !=. The default implementation is almost always -sufficient, and should not be overridden without very good reason.
    source§

    impl<'ctx> PartialEq for AnyValueEnum<'ctx>

    source§

    fn eq(&self, other: &AnyValueEnum<'ctx>) -> bool

    This method tests for self and other values to be equal, and is used -by ==.
    1.0.0 · source§

    fn ne(&self, other: &Rhs) -> bool

    This method tests for !=. The default implementation is almost always -sufficient, and should not be overridden without very good reason.
    source§

    impl<'ctx> TryFrom<AnyValueEnum<'ctx>> for ArrayValue<'ctx>

    §

    type Error = ()

    The type returned in the event of a conversion error.
    source§

    fn try_from(value: AnyValueEnum<'ctx>) -> Result<Self, Self::Error>

    Performs the conversion.
    source§

    impl<'ctx> TryFrom<AnyValueEnum<'ctx>> for BasicMetadataValueEnum<'ctx>

    §

    type Error = ()

    The type returned in the event of a conversion error.
    source§

    fn try_from(value: AnyValueEnum<'ctx>) -> Result<Self, Self::Error>

    Performs the conversion.
    source§

    impl<'ctx> TryFrom<AnyValueEnum<'ctx>> for BasicValueEnum<'ctx>

    §

    type Error = ()

    The type returned in the event of a conversion error.
    source§

    fn try_from(value: AnyValueEnum<'ctx>) -> Result<Self, Self::Error>

    Performs the conversion.
    source§

    impl<'ctx> TryFrom<AnyValueEnum<'ctx>> for FloatValue<'ctx>

    §

    type Error = ()

    The type returned in the event of a conversion error.
    source§

    fn try_from(value: AnyValueEnum<'ctx>) -> Result<Self, Self::Error>

    Performs the conversion.
    source§

    impl<'ctx> TryFrom<AnyValueEnum<'ctx>> for FunctionValue<'ctx>

    §

    type Error = ()

    The type returned in the event of a conversion error.
    source§

    fn try_from(value: AnyValueEnum<'ctx>) -> Result<Self, Self::Error>

    Performs the conversion.
    source§

    impl<'ctx> TryFrom<AnyValueEnum<'ctx>> for InstructionValue<'ctx>

    §

    type Error = ()

    The type returned in the event of a conversion error.
    source§

    fn try_from(value: AnyValueEnum<'ctx>) -> Result<Self, Self::Error>

    Performs the conversion.
    source§

    impl<'ctx> TryFrom<AnyValueEnum<'ctx>> for IntValue<'ctx>

    §

    type Error = ()

    The type returned in the event of a conversion error.
    source§

    fn try_from(value: AnyValueEnum<'ctx>) -> Result<Self, Self::Error>

    Performs the conversion.
    source§

    impl<'ctx> TryFrom<AnyValueEnum<'ctx>> for MetadataValue<'ctx>

    §

    type Error = ()

    The type returned in the event of a conversion error.
    source§

    fn try_from(value: AnyValueEnum<'ctx>) -> Result<Self, Self::Error>

    Performs the conversion.
    source§

    impl<'ctx> TryFrom<AnyValueEnum<'ctx>> for PhiValue<'ctx>

    §

    type Error = ()

    The type returned in the event of a conversion error.
    source§

    fn try_from(value: AnyValueEnum<'ctx>) -> Result<Self, Self::Error>

    Performs the conversion.
    source§

    impl<'ctx> TryFrom<AnyValueEnum<'ctx>> for PointerValue<'ctx>

    §

    type Error = ()

    The type returned in the event of a conversion error.
    source§

    fn try_from(value: AnyValueEnum<'ctx>) -> Result<Self, Self::Error>

    Performs the conversion.
    source§

    impl<'ctx> TryFrom<AnyValueEnum<'ctx>> for StructValue<'ctx>

    §

    type Error = ()

    The type returned in the event of a conversion error.
    source§

    fn try_from(value: AnyValueEnum<'ctx>) -> Result<Self, Self::Error>

    Performs the conversion.
    source§

    impl<'ctx> TryFrom<AnyValueEnum<'ctx>> for VectorValue<'ctx>

    §

    type Error = ()

    The type returned in the event of a conversion error.
    source§

    fn try_from(value: AnyValueEnum<'ctx>) -> Result<Self, Self::Error>

    Performs the conversion.
    source§

    impl<'ctx> Copy for AnyValueEnum<'ctx>

    source§

    impl<'ctx> Eq for AnyValueEnum<'ctx>

    source§

    impl<'ctx> StructuralPartialEq for AnyValueEnum<'ctx>

    Auto Trait Implementations§

    §

    impl<'ctx> Freeze for AnyValueEnum<'ctx>

    §

    impl<'ctx> RefUnwindSafe for AnyValueEnum<'ctx>

    §

    impl<'ctx> !Send for AnyValueEnum<'ctx>

    §

    impl<'ctx> !Sync for AnyValueEnum<'ctx>

    §

    impl<'ctx> Unpin for AnyValueEnum<'ctx>

    §

    impl<'ctx> UnwindSafe for AnyValueEnum<'ctx>

    Blanket Implementations§

    source§

    impl<T> Any for T
    where +sufficient, and should not be overridden without very good reason.

    source§

    impl<'ctx> PartialEq<StructValue<'ctx>> for AnyValueEnum<'ctx>

    source§

    fn eq(&self, other: &StructValue<'ctx>) -> bool

    This method tests for self and other values to be equal, and is used +by ==.
    1.0.0 · source§

    fn ne(&self, other: &Rhs) -> bool

    This method tests for !=. The default implementation is almost always +sufficient, and should not be overridden without very good reason.
    source§

    impl<'ctx> PartialEq<VectorValue<'ctx>> for AnyValueEnum<'ctx>

    source§

    fn eq(&self, other: &VectorValue<'ctx>) -> bool

    This method tests for self and other values to be equal, and is used +by ==.
    1.0.0 · source§

    fn ne(&self, other: &Rhs) -> bool

    This method tests for !=. The default implementation is almost always +sufficient, and should not be overridden without very good reason.
    source§

    impl<'ctx> PartialEq for AnyValueEnum<'ctx>

    source§

    fn eq(&self, other: &AnyValueEnum<'ctx>) -> bool

    This method tests for self and other values to be equal, and is used +by ==.
    1.0.0 · source§

    fn ne(&self, other: &Rhs) -> bool

    This method tests for !=. The default implementation is almost always +sufficient, and should not be overridden without very good reason.
    source§

    impl<'ctx> TryFrom<AnyValueEnum<'ctx>> for ArrayValue<'ctx>

    §

    type Error = ()

    The type returned in the event of a conversion error.
    source§

    fn try_from(value: AnyValueEnum<'ctx>) -> Result<Self, Self::Error>

    Performs the conversion.
    source§

    impl<'ctx> TryFrom<AnyValueEnum<'ctx>> for BasicMetadataValueEnum<'ctx>

    §

    type Error = ()

    The type returned in the event of a conversion error.
    source§

    fn try_from(value: AnyValueEnum<'ctx>) -> Result<Self, Self::Error>

    Performs the conversion.
    source§

    impl<'ctx> TryFrom<AnyValueEnum<'ctx>> for BasicValueEnum<'ctx>

    §

    type Error = ()

    The type returned in the event of a conversion error.
    source§

    fn try_from(value: AnyValueEnum<'ctx>) -> Result<Self, Self::Error>

    Performs the conversion.
    source§

    impl<'ctx> TryFrom<AnyValueEnum<'ctx>> for FloatValue<'ctx>

    §

    type Error = ()

    The type returned in the event of a conversion error.
    source§

    fn try_from(value: AnyValueEnum<'ctx>) -> Result<Self, Self::Error>

    Performs the conversion.
    source§

    impl<'ctx> TryFrom<AnyValueEnum<'ctx>> for FunctionValue<'ctx>

    §

    type Error = ()

    The type returned in the event of a conversion error.
    source§

    fn try_from(value: AnyValueEnum<'ctx>) -> Result<Self, Self::Error>

    Performs the conversion.
    source§

    impl<'ctx> TryFrom<AnyValueEnum<'ctx>> for InstructionValue<'ctx>

    §

    type Error = ()

    The type returned in the event of a conversion error.
    source§

    fn try_from(value: AnyValueEnum<'ctx>) -> Result<Self, Self::Error>

    Performs the conversion.
    source§

    impl<'ctx> TryFrom<AnyValueEnum<'ctx>> for IntValue<'ctx>

    §

    type Error = ()

    The type returned in the event of a conversion error.
    source§

    fn try_from(value: AnyValueEnum<'ctx>) -> Result<Self, Self::Error>

    Performs the conversion.
    source§

    impl<'ctx> TryFrom<AnyValueEnum<'ctx>> for MetadataValue<'ctx>

    §

    type Error = ()

    The type returned in the event of a conversion error.
    source§

    fn try_from(value: AnyValueEnum<'ctx>) -> Result<Self, Self::Error>

    Performs the conversion.
    source§

    impl<'ctx> TryFrom<AnyValueEnum<'ctx>> for PhiValue<'ctx>

    §

    type Error = ()

    The type returned in the event of a conversion error.
    source§

    fn try_from(value: AnyValueEnum<'ctx>) -> Result<Self, Self::Error>

    Performs the conversion.
    source§

    impl<'ctx> TryFrom<AnyValueEnum<'ctx>> for PointerValue<'ctx>

    §

    type Error = ()

    The type returned in the event of a conversion error.
    source§

    fn try_from(value: AnyValueEnum<'ctx>) -> Result<Self, Self::Error>

    Performs the conversion.
    source§

    impl<'ctx> TryFrom<AnyValueEnum<'ctx>> for StructValue<'ctx>

    §

    type Error = ()

    The type returned in the event of a conversion error.
    source§

    fn try_from(value: AnyValueEnum<'ctx>) -> Result<Self, Self::Error>

    Performs the conversion.
    source§

    impl<'ctx> TryFrom<AnyValueEnum<'ctx>> for VectorValue<'ctx>

    §

    type Error = ()

    The type returned in the event of a conversion error.
    source§

    fn try_from(value: AnyValueEnum<'ctx>) -> Result<Self, Self::Error>

    Performs the conversion.
    source§

    impl<'ctx> Copy for AnyValueEnum<'ctx>

    source§

    impl<'ctx> Eq for AnyValueEnum<'ctx>

    source§

    impl<'ctx> StructuralPartialEq for AnyValueEnum<'ctx>

    Auto Trait Implementations§

    §

    impl<'ctx> Freeze for AnyValueEnum<'ctx>

    §

    impl<'ctx> RefUnwindSafe for AnyValueEnum<'ctx>

    §

    impl<'ctx> !Send for AnyValueEnum<'ctx>

    §

    impl<'ctx> !Sync for AnyValueEnum<'ctx>

    §

    impl<'ctx> Unpin for AnyValueEnum<'ctx>

    §

    impl<'ctx> UnwindSafe for AnyValueEnum<'ctx>

    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/inkwell/values/enum.BasicMetadataValueEnum.html b/inkwell/values/enum.BasicMetadataValueEnum.html index 64d464487..30da28203 100644 --- a/inkwell/values/enum.BasicMetadataValueEnum.html +++ b/inkwell/values/enum.BasicMetadataValueEnum.html @@ -7,39 +7,39 @@ StructValue(StructValue<'ctx>), VectorValue(VectorValue<'ctx>), MetadataValue(MetadataValue<'ctx>), -}

    Variants§

    §

    ArrayValue(ArrayValue<'ctx>)

    §

    IntValue(IntValue<'ctx>)

    §

    FloatValue(FloatValue<'ctx>)

    §

    PointerValue(PointerValue<'ctx>)

    §

    StructValue(StructValue<'ctx>)

    §

    VectorValue(VectorValue<'ctx>)

    §

    MetadataValue(MetadataValue<'ctx>)

    Implementations§

    source§

    impl<'ctx> BasicMetadataValueEnum<'ctx>

    source

    pub fn is_array_value(self) -> bool

    source

    pub fn is_int_value(self) -> bool

    source

    pub fn is_float_value(self) -> bool

    source

    pub fn is_pointer_value(self) -> bool

    source

    pub fn is_struct_value(self) -> bool

    source

    pub fn is_vector_value(self) -> bool

    source

    pub fn is_metadata_value(self) -> bool

    source

    pub fn into_array_value(self) -> ArrayValue<'ctx>

    source

    pub fn into_int_value(self) -> IntValue<'ctx>

    source

    pub fn into_float_value(self) -> FloatValue<'ctx>

    source

    pub fn into_pointer_value(self) -> PointerValue<'ctx>

    source

    pub fn into_struct_value(self) -> StructValue<'ctx>

    source

    pub fn into_vector_value(self) -> VectorValue<'ctx>

    source

    pub fn into_metadata_value(self) -> MetadataValue<'ctx>

    Trait Implementations§

    source§

    impl<'ctx> AnyValue<'ctx> for BasicMetadataValueEnum<'ctx>

    source§

    fn as_any_value_enum(&self) -> AnyValueEnum<'ctx>

    Returns an enum containing a typed version of AnyValue.
    source§

    fn print_to_string(&self) -> LLVMString

    Prints a value to a LLVMString
    source§

    fn is_poison(&self) -> bool

    Returns whether the value is poison
    source§

    impl AsValueRef for BasicMetadataValueEnum<'_>

    source§

    fn as_value_ref(&self) -> LLVMValueRef

    source§

    impl<'ctx> Clone for BasicMetadataValueEnum<'ctx>

    source§

    fn clone(&self) -> BasicMetadataValueEnum<'ctx>

    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<'ctx> Debug for BasicMetadataValueEnum<'ctx>

    source§

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

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

    impl Display for BasicMetadataValueEnum<'_>

    source§

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

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

    impl<'ctx> From<ArrayValue<'ctx>> for BasicMetadataValueEnum<'ctx>

    source§

    fn from(value: ArrayValue<'_>) -> BasicMetadataValueEnum<'_>

    Converts to this type from the input type.
    source§

    impl<'ctx> From<BasicValueEnum<'ctx>> for BasicMetadataValueEnum<'ctx>

    source§

    fn from(value: BasicValueEnum<'ctx>) -> Self

    Converts to this type from the input type.
    source§

    impl<'ctx> From<FloatValue<'ctx>> for BasicMetadataValueEnum<'ctx>

    source§

    fn from(value: FloatValue<'_>) -> BasicMetadataValueEnum<'_>

    Converts to this type from the input type.
    source§

    impl<'ctx> From<IntValue<'ctx>> for BasicMetadataValueEnum<'ctx>

    source§

    fn from(value: IntValue<'_>) -> BasicMetadataValueEnum<'_>

    Converts to this type from the input type.
    source§

    impl<'ctx> From<MetadataValue<'ctx>> for BasicMetadataValueEnum<'ctx>

    source§

    fn from(value: MetadataValue<'_>) -> BasicMetadataValueEnum<'_>

    Converts to this type from the input type.
    source§

    impl<'ctx> From<PointerValue<'ctx>> for BasicMetadataValueEnum<'ctx>

    source§

    fn from(value: PointerValue<'_>) -> BasicMetadataValueEnum<'_>

    Converts to this type from the input type.
    source§

    impl<'ctx> From<StructValue<'ctx>> for BasicMetadataValueEnum<'ctx>

    source§

    fn from(value: StructValue<'_>) -> BasicMetadataValueEnum<'_>

    Converts to this type from the input type.
    source§

    impl<'ctx> From<VectorValue<'ctx>> for BasicMetadataValueEnum<'ctx>

    source§

    fn from(value: VectorValue<'_>) -> BasicMetadataValueEnum<'_>

    Converts to this type from the input type.
    source§

    impl<'ctx> Hash for BasicMetadataValueEnum<'ctx>

    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 +}

    Variants§

    §

    ArrayValue(ArrayValue<'ctx>)

    §

    IntValue(IntValue<'ctx>)

    §

    FloatValue(FloatValue<'ctx>)

    §

    PointerValue(PointerValue<'ctx>)

    §

    StructValue(StructValue<'ctx>)

    §

    VectorValue(VectorValue<'ctx>)

    §

    MetadataValue(MetadataValue<'ctx>)

    Implementations§

    source§

    impl<'ctx> BasicMetadataValueEnum<'ctx>

    source

    pub fn is_array_value(self) -> bool

    source

    pub fn is_int_value(self) -> bool

    source

    pub fn is_float_value(self) -> bool

    source

    pub fn is_pointer_value(self) -> bool

    source

    pub fn is_struct_value(self) -> bool

    source

    pub fn is_vector_value(self) -> bool

    source

    pub fn is_metadata_value(self) -> bool

    source

    pub fn into_array_value(self) -> ArrayValue<'ctx>

    source

    pub fn into_int_value(self) -> IntValue<'ctx>

    source

    pub fn into_float_value(self) -> FloatValue<'ctx>

    source

    pub fn into_pointer_value(self) -> PointerValue<'ctx>

    source

    pub fn into_struct_value(self) -> StructValue<'ctx>

    source

    pub fn into_vector_value(self) -> VectorValue<'ctx>

    source

    pub fn into_metadata_value(self) -> MetadataValue<'ctx>

    Trait Implementations§

    source§

    impl<'ctx> AnyValue<'ctx> for BasicMetadataValueEnum<'ctx>

    source§

    fn as_any_value_enum(&self) -> AnyValueEnum<'ctx>

    Returns an enum containing a typed version of AnyValue.
    source§

    fn print_to_string(&self) -> LLVMString

    Prints a value to a LLVMString
    source§

    fn is_poison(&self) -> bool

    Returns whether the value is poison
    source§

    impl AsValueRef for BasicMetadataValueEnum<'_>

    source§

    fn as_value_ref(&self) -> LLVMValueRef

    source§

    impl<'ctx> Clone for BasicMetadataValueEnum<'ctx>

    source§

    fn clone(&self) -> BasicMetadataValueEnum<'ctx>

    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<'ctx> Debug for BasicMetadataValueEnum<'ctx>

    source§

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

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

    impl Display for BasicMetadataValueEnum<'_>

    source§

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

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

    impl<'ctx> From<ArrayValue<'ctx>> for BasicMetadataValueEnum<'ctx>

    source§

    fn from(value: ArrayValue<'_>) -> BasicMetadataValueEnum<'_>

    Converts to this type from the input type.
    source§

    impl<'ctx> From<BasicValueEnum<'ctx>> for BasicMetadataValueEnum<'ctx>

    source§

    fn from(value: BasicValueEnum<'ctx>) -> Self

    Converts to this type from the input type.
    source§

    impl<'ctx> From<FloatValue<'ctx>> for BasicMetadataValueEnum<'ctx>

    source§

    fn from(value: FloatValue<'_>) -> BasicMetadataValueEnum<'_>

    Converts to this type from the input type.
    source§

    impl<'ctx> From<IntValue<'ctx>> for BasicMetadataValueEnum<'ctx>

    source§

    fn from(value: IntValue<'_>) -> BasicMetadataValueEnum<'_>

    Converts to this type from the input type.
    source§

    impl<'ctx> From<MetadataValue<'ctx>> for BasicMetadataValueEnum<'ctx>

    source§

    fn from(value: MetadataValue<'_>) -> BasicMetadataValueEnum<'_>

    Converts to this type from the input type.
    source§

    impl<'ctx> From<PointerValue<'ctx>> for BasicMetadataValueEnum<'ctx>

    source§

    fn from(value: PointerValue<'_>) -> BasicMetadataValueEnum<'_>

    Converts to this type from the input type.
    source§

    impl<'ctx> From<StructValue<'ctx>> for BasicMetadataValueEnum<'ctx>

    source§

    fn from(value: StructValue<'_>) -> BasicMetadataValueEnum<'_>

    Converts to this type from the input type.
    source§

    impl<'ctx> From<VectorValue<'ctx>> for BasicMetadataValueEnum<'ctx>

    source§

    fn from(value: VectorValue<'_>) -> BasicMetadataValueEnum<'_>

    Converts to this type from the input type.
    source§

    impl<'ctx> Hash for BasicMetadataValueEnum<'ctx>

    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<'ctx> PartialEq<ArrayValue<'ctx>> for BasicMetadataValueEnum<'ctx>

    source§

    fn eq(&self, other: &ArrayValue<'ctx>) -> bool

    This method tests for self and other values to be equal, and is used -by ==.
    1.0.0 · source§

    fn ne(&self, other: &Rhs) -> bool

    This method tests for !=. The default implementation is almost always -sufficient, and should not be overridden without very good reason.
    source§

    impl<'ctx> PartialEq<BasicMetadataValueEnum<'ctx>> for ArrayValue<'ctx>

    source§

    fn eq(&self, other: &BasicMetadataValueEnum<'ctx>) -> bool

    This method tests for self and other values to be equal, and is used -by ==.
    1.0.0 · source§

    fn ne(&self, other: &Rhs) -> bool

    This method tests for !=. The default implementation is almost always -sufficient, and should not be overridden without very good reason.
    source§

    impl<'ctx> PartialEq<BasicMetadataValueEnum<'ctx>> for FloatValue<'ctx>

    source§

    fn eq(&self, other: &BasicMetadataValueEnum<'ctx>) -> bool

    This method tests for self and other values to be equal, and is used -by ==.
    1.0.0 · source§

    fn ne(&self, other: &Rhs) -> bool

    This method tests for !=. The default implementation is almost always -sufficient, and should not be overridden without very good reason.
    source§

    impl<'ctx> PartialEq<BasicMetadataValueEnum<'ctx>> for IntValue<'ctx>

    source§

    fn eq(&self, other: &BasicMetadataValueEnum<'ctx>) -> bool

    This method tests for self and other values to be equal, and is used -by ==.
    1.0.0 · source§

    fn ne(&self, other: &Rhs) -> bool

    This method tests for !=. The default implementation is almost always -sufficient, and should not be overridden without very good reason.
    source§

    impl<'ctx> PartialEq<BasicMetadataValueEnum<'ctx>> for MetadataValue<'ctx>

    source§

    fn eq(&self, other: &BasicMetadataValueEnum<'ctx>) -> bool

    This method tests for self and other values to be equal, and is used + Self: Sized,

    Feeds a slice of this type into the given Hasher. Read more
    source§

    impl<'ctx> PartialEq<ArrayValue<'ctx>> for BasicMetadataValueEnum<'ctx>

    source§

    fn eq(&self, other: &ArrayValue<'ctx>) -> bool

    This method tests for self and other values to be equal, and is used by ==.
    1.0.0 · source§

    fn ne(&self, other: &Rhs) -> bool

    This method tests for !=. The default implementation is almost always -sufficient, and should not be overridden without very good reason.
    source§

    impl<'ctx> PartialEq<BasicMetadataValueEnum<'ctx>> for PointerValue<'ctx>

    source§

    fn eq(&self, other: &BasicMetadataValueEnum<'ctx>) -> bool

    This method tests for self and other values to be equal, and is used -by ==.
    1.0.0 · source§

    fn ne(&self, other: &Rhs) -> bool

    This method tests for !=. The default implementation is almost always -sufficient, and should not be overridden without very good reason.
    source§

    impl<'ctx> PartialEq<BasicMetadataValueEnum<'ctx>> for StructValue<'ctx>

    source§

    fn eq(&self, other: &BasicMetadataValueEnum<'ctx>) -> bool

    This method tests for self and other values to be equal, and is used -by ==.
    1.0.0 · source§

    fn ne(&self, other: &Rhs) -> bool

    This method tests for !=. The default implementation is almost always -sufficient, and should not be overridden without very good reason.
    source§

    impl<'ctx> PartialEq<BasicMetadataValueEnum<'ctx>> for VectorValue<'ctx>

    source§

    fn eq(&self, other: &BasicMetadataValueEnum<'ctx>) -> bool

    This method tests for self and other values to be equal, and is used -by ==.
    1.0.0 · source§

    fn ne(&self, other: &Rhs) -> bool

    This method tests for !=. The default implementation is almost always -sufficient, and should not be overridden without very good reason.
    source§

    impl<'ctx> PartialEq<FloatValue<'ctx>> for BasicMetadataValueEnum<'ctx>

    source§

    fn eq(&self, other: &FloatValue<'ctx>) -> bool

    This method tests for self and other values to be equal, and is used -by ==.
    1.0.0 · source§

    fn ne(&self, other: &Rhs) -> bool

    This method tests for !=. The default implementation is almost always -sufficient, and should not be overridden without very good reason.
    source§

    impl<'ctx> PartialEq<IntValue<'ctx>> for BasicMetadataValueEnum<'ctx>

    source§

    fn eq(&self, other: &IntValue<'ctx>) -> bool

    This method tests for self and other values to be equal, and is used -by ==.
    1.0.0 · source§

    fn ne(&self, other: &Rhs) -> bool

    This method tests for !=. The default implementation is almost always -sufficient, and should not be overridden without very good reason.
    source§

    impl<'ctx> PartialEq<MetadataValue<'ctx>> for BasicMetadataValueEnum<'ctx>

    source§

    fn eq(&self, other: &MetadataValue<'ctx>) -> bool

    This method tests for self and other values to be equal, and is used -by ==.
    1.0.0 · source§

    fn ne(&self, other: &Rhs) -> bool

    This method tests for !=. The default implementation is almost always -sufficient, and should not be overridden without very good reason.
    source§

    impl<'ctx> PartialEq<PointerValue<'ctx>> for BasicMetadataValueEnum<'ctx>

    source§

    fn eq(&self, other: &PointerValue<'ctx>) -> 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<'ctx> PartialEq<BasicMetadataValueEnum<'ctx>> for ArrayValue<'ctx>

    source§

    fn eq(&self, other: &BasicMetadataValueEnum<'ctx>) -> bool

    This method tests for self and other values to be equal, and is used +by ==.
    1.0.0 · source§

    fn ne(&self, other: &Rhs) -> bool

    This method tests for !=. The default implementation is almost always +sufficient, and should not be overridden without very good reason.
    source§

    impl<'ctx> PartialEq<BasicMetadataValueEnum<'ctx>> for FloatValue<'ctx>

    source§

    fn eq(&self, other: &BasicMetadataValueEnum<'ctx>) -> bool

    This method tests for self and other values to be equal, and is used by ==.
    1.0.0 · source§

    fn ne(&self, other: &Rhs) -> bool

    This method tests for !=. The default implementation is almost always -sufficient, and should not be overridden without very good reason.
    source§

    impl<'ctx> PartialEq<StructValue<'ctx>> for BasicMetadataValueEnum<'ctx>

    source§

    fn eq(&self, other: &StructValue<'ctx>) -> bool

    This method tests for self and other values to be equal, and is used -by ==.
    1.0.0 · source§

    fn ne(&self, other: &Rhs) -> bool

    This method tests for !=. The default implementation is almost always -sufficient, and should not be overridden without very good reason.
    source§

    impl<'ctx> PartialEq<VectorValue<'ctx>> for BasicMetadataValueEnum<'ctx>

    source§

    fn eq(&self, other: &VectorValue<'ctx>) -> 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<'ctx> PartialEq<BasicMetadataValueEnum<'ctx>> for IntValue<'ctx>

    source§

    fn eq(&self, other: &BasicMetadataValueEnum<'ctx>) -> bool

    This method tests for self and other values to be equal, and is used +by ==.
    1.0.0 · source§

    fn ne(&self, other: &Rhs) -> bool

    This method tests for !=. The default implementation is almost always +sufficient, and should not be overridden without very good reason.
    source§

    impl<'ctx> PartialEq<BasicMetadataValueEnum<'ctx>> for MetadataValue<'ctx>

    source§

    fn eq(&self, other: &BasicMetadataValueEnum<'ctx>) -> bool

    This method tests for self and other values to be equal, and is used by ==.
    1.0.0 · source§

    fn ne(&self, other: &Rhs) -> bool

    This method tests for !=. The default implementation is almost always -sufficient, and should not be overridden without very good reason.
    source§

    impl<'ctx> PartialEq for BasicMetadataValueEnum<'ctx>

    source§

    fn eq(&self, other: &BasicMetadataValueEnum<'ctx>) -> 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<'ctx> PartialEq<BasicMetadataValueEnum<'ctx>> for PointerValue<'ctx>

    source§

    fn eq(&self, other: &BasicMetadataValueEnum<'ctx>) -> bool

    This method tests for self and other values to be equal, and is used +by ==.
    1.0.0 · source§

    fn ne(&self, other: &Rhs) -> bool

    This method tests for !=. The default implementation is almost always +sufficient, and should not be overridden without very good reason.
    source§

    impl<'ctx> PartialEq<BasicMetadataValueEnum<'ctx>> for StructValue<'ctx>

    source§

    fn eq(&self, other: &BasicMetadataValueEnum<'ctx>) -> bool

    This method tests for self and other values to be equal, and is used +by ==.
    1.0.0 · source§

    fn ne(&self, other: &Rhs) -> bool

    This method tests for !=. The default implementation is almost always +sufficient, and should not be overridden without very good reason.
    source§

    impl<'ctx> PartialEq<BasicMetadataValueEnum<'ctx>> for VectorValue<'ctx>

    source§

    fn eq(&self, other: &BasicMetadataValueEnum<'ctx>) -> bool

    This method tests for self and other values to be equal, and is used +by ==.
    1.0.0 · source§

    fn ne(&self, other: &Rhs) -> bool

    This method tests for !=. The default implementation is almost always +sufficient, and should not be overridden without very good reason.
    source§

    impl<'ctx> PartialEq<FloatValue<'ctx>> for BasicMetadataValueEnum<'ctx>

    source§

    fn eq(&self, other: &FloatValue<'ctx>) -> bool

    This method tests for self and other values to be equal, and is used +by ==.
    1.0.0 · source§

    fn ne(&self, other: &Rhs) -> bool

    This method tests for !=. The default implementation is almost always +sufficient, and should not be overridden without very good reason.
    source§

    impl<'ctx> PartialEq<IntValue<'ctx>> for BasicMetadataValueEnum<'ctx>

    source§

    fn eq(&self, other: &IntValue<'ctx>) -> bool

    This method tests for self and other values to be equal, and is used +by ==.
    1.0.0 · source§

    fn ne(&self, other: &Rhs) -> bool

    This method tests for !=. The default implementation is almost always +sufficient, and should not be overridden without very good reason.
    source§

    impl<'ctx> PartialEq<MetadataValue<'ctx>> for BasicMetadataValueEnum<'ctx>

    source§

    fn eq(&self, other: &MetadataValue<'ctx>) -> bool

    This method tests for self and other values to be equal, and is used +by ==.
    1.0.0 · source§

    fn ne(&self, other: &Rhs) -> bool

    This method tests for !=. The default implementation is almost always +sufficient, and should not be overridden without very good reason.
    source§

    impl<'ctx> PartialEq<PointerValue<'ctx>> for BasicMetadataValueEnum<'ctx>

    source§

    fn eq(&self, other: &PointerValue<'ctx>) -> bool

    This method tests for self and other values to be equal, and is used by ==.
    1.0.0 · source§

    fn ne(&self, other: &Rhs) -> bool

    This method tests for !=. The default implementation is almost always -sufficient, and should not be overridden without very good reason.
    source§

    impl<'ctx> TryFrom<AnyValueEnum<'ctx>> for BasicMetadataValueEnum<'ctx>

    §

    type Error = ()

    The type returned in the event of a conversion error.
    source§

    fn try_from(value: AnyValueEnum<'ctx>) -> Result<Self, Self::Error>

    Performs the conversion.
    source§

    impl<'ctx> TryFrom<BasicMetadataValueEnum<'ctx>> for ArrayValue<'ctx>

    §

    type Error = ()

    The type returned in the event of a conversion error.
    source§

    fn try_from(value: BasicMetadataValueEnum<'ctx>) -> Result<Self, Self::Error>

    Performs the conversion.
    source§

    impl<'ctx> TryFrom<BasicMetadataValueEnum<'ctx>> for BasicValueEnum<'ctx>

    §

    type Error = ()

    The type returned in the event of a conversion error.
    source§

    fn try_from(value: BasicMetadataValueEnum<'ctx>) -> Result<Self, Self::Error>

    Performs the conversion.
    source§

    impl<'ctx> TryFrom<BasicMetadataValueEnum<'ctx>> for FloatValue<'ctx>

    §

    type Error = ()

    The type returned in the event of a conversion error.
    source§

    fn try_from(value: BasicMetadataValueEnum<'ctx>) -> Result<Self, Self::Error>

    Performs the conversion.
    source§

    impl<'ctx> TryFrom<BasicMetadataValueEnum<'ctx>> for IntValue<'ctx>

    §

    type Error = ()

    The type returned in the event of a conversion error.
    source§

    fn try_from(value: BasicMetadataValueEnum<'ctx>) -> Result<Self, Self::Error>

    Performs the conversion.
    source§

    impl<'ctx> TryFrom<BasicMetadataValueEnum<'ctx>> for MetadataValue<'ctx>

    §

    type Error = ()

    The type returned in the event of a conversion error.
    source§

    fn try_from(value: BasicMetadataValueEnum<'ctx>) -> Result<Self, Self::Error>

    Performs the conversion.
    source§

    impl<'ctx> TryFrom<BasicMetadataValueEnum<'ctx>> for PointerValue<'ctx>

    §

    type Error = ()

    The type returned in the event of a conversion error.
    source§

    fn try_from(value: BasicMetadataValueEnum<'ctx>) -> Result<Self, Self::Error>

    Performs the conversion.
    source§

    impl<'ctx> TryFrom<BasicMetadataValueEnum<'ctx>> for StructValue<'ctx>

    §

    type Error = ()

    The type returned in the event of a conversion error.
    source§

    fn try_from(value: BasicMetadataValueEnum<'ctx>) -> Result<Self, Self::Error>

    Performs the conversion.
    source§

    impl<'ctx> TryFrom<BasicMetadataValueEnum<'ctx>> for VectorValue<'ctx>

    §

    type Error = ()

    The type returned in the event of a conversion error.
    source§

    fn try_from(value: BasicMetadataValueEnum<'ctx>) -> Result<Self, Self::Error>

    Performs the conversion.
    source§

    impl<'ctx> Copy for BasicMetadataValueEnum<'ctx>

    source§

    impl<'ctx> Eq for BasicMetadataValueEnum<'ctx>

    source§

    impl<'ctx> StructuralPartialEq for BasicMetadataValueEnum<'ctx>

    Auto Trait Implementations§

    §

    impl<'ctx> Freeze for BasicMetadataValueEnum<'ctx>

    §

    impl<'ctx> RefUnwindSafe for BasicMetadataValueEnum<'ctx>

    §

    impl<'ctx> !Send for BasicMetadataValueEnum<'ctx>

    §

    impl<'ctx> !Sync for BasicMetadataValueEnum<'ctx>

    §

    impl<'ctx> Unpin for BasicMetadataValueEnum<'ctx>

    §

    impl<'ctx> UnwindSafe for BasicMetadataValueEnum<'ctx>

    Blanket Implementations§

    source§

    impl<T> Any for T
    where +sufficient, and should not be overridden without very good reason.

    source§

    impl<'ctx> PartialEq<StructValue<'ctx>> for BasicMetadataValueEnum<'ctx>

    source§

    fn eq(&self, other: &StructValue<'ctx>) -> bool

    This method tests for self and other values to be equal, and is used +by ==.
    1.0.0 · source§

    fn ne(&self, other: &Rhs) -> bool

    This method tests for !=. The default implementation is almost always +sufficient, and should not be overridden without very good reason.
    source§

    impl<'ctx> PartialEq<VectorValue<'ctx>> for BasicMetadataValueEnum<'ctx>

    source§

    fn eq(&self, other: &VectorValue<'ctx>) -> bool

    This method tests for self and other values to be equal, and is used +by ==.
    1.0.0 · source§

    fn ne(&self, other: &Rhs) -> bool

    This method tests for !=. The default implementation is almost always +sufficient, and should not be overridden without very good reason.
    source§

    impl<'ctx> PartialEq for BasicMetadataValueEnum<'ctx>

    source§

    fn eq(&self, other: &BasicMetadataValueEnum<'ctx>) -> bool

    This method tests for self and other values to be equal, and is used +by ==.
    1.0.0 · source§

    fn ne(&self, other: &Rhs) -> bool

    This method tests for !=. The default implementation is almost always +sufficient, and should not be overridden without very good reason.
    source§

    impl<'ctx> TryFrom<AnyValueEnum<'ctx>> for BasicMetadataValueEnum<'ctx>

    §

    type Error = ()

    The type returned in the event of a conversion error.
    source§

    fn try_from(value: AnyValueEnum<'ctx>) -> Result<Self, Self::Error>

    Performs the conversion.
    source§

    impl<'ctx> TryFrom<BasicMetadataValueEnum<'ctx>> for ArrayValue<'ctx>

    §

    type Error = ()

    The type returned in the event of a conversion error.
    source§

    fn try_from(value: BasicMetadataValueEnum<'ctx>) -> Result<Self, Self::Error>

    Performs the conversion.
    source§

    impl<'ctx> TryFrom<BasicMetadataValueEnum<'ctx>> for BasicValueEnum<'ctx>

    §

    type Error = ()

    The type returned in the event of a conversion error.
    source§

    fn try_from(value: BasicMetadataValueEnum<'ctx>) -> Result<Self, Self::Error>

    Performs the conversion.
    source§

    impl<'ctx> TryFrom<BasicMetadataValueEnum<'ctx>> for FloatValue<'ctx>

    §

    type Error = ()

    The type returned in the event of a conversion error.
    source§

    fn try_from(value: BasicMetadataValueEnum<'ctx>) -> Result<Self, Self::Error>

    Performs the conversion.
    source§

    impl<'ctx> TryFrom<BasicMetadataValueEnum<'ctx>> for IntValue<'ctx>

    §

    type Error = ()

    The type returned in the event of a conversion error.
    source§

    fn try_from(value: BasicMetadataValueEnum<'ctx>) -> Result<Self, Self::Error>

    Performs the conversion.
    source§

    impl<'ctx> TryFrom<BasicMetadataValueEnum<'ctx>> for MetadataValue<'ctx>

    §

    type Error = ()

    The type returned in the event of a conversion error.
    source§

    fn try_from(value: BasicMetadataValueEnum<'ctx>) -> Result<Self, Self::Error>

    Performs the conversion.
    source§

    impl<'ctx> TryFrom<BasicMetadataValueEnum<'ctx>> for PointerValue<'ctx>

    §

    type Error = ()

    The type returned in the event of a conversion error.
    source§

    fn try_from(value: BasicMetadataValueEnum<'ctx>) -> Result<Self, Self::Error>

    Performs the conversion.
    source§

    impl<'ctx> TryFrom<BasicMetadataValueEnum<'ctx>> for StructValue<'ctx>

    §

    type Error = ()

    The type returned in the event of a conversion error.
    source§

    fn try_from(value: BasicMetadataValueEnum<'ctx>) -> Result<Self, Self::Error>

    Performs the conversion.
    source§

    impl<'ctx> TryFrom<BasicMetadataValueEnum<'ctx>> for VectorValue<'ctx>

    §

    type Error = ()

    The type returned in the event of a conversion error.
    source§

    fn try_from(value: BasicMetadataValueEnum<'ctx>) -> Result<Self, Self::Error>

    Performs the conversion.
    source§

    impl<'ctx> Copy for BasicMetadataValueEnum<'ctx>

    source§

    impl<'ctx> Eq for BasicMetadataValueEnum<'ctx>

    source§

    impl<'ctx> StructuralPartialEq for BasicMetadataValueEnum<'ctx>

    Auto Trait Implementations§

    §

    impl<'ctx> Freeze for BasicMetadataValueEnum<'ctx>

    §

    impl<'ctx> RefUnwindSafe for BasicMetadataValueEnum<'ctx>

    §

    impl<'ctx> !Send for BasicMetadataValueEnum<'ctx>

    §

    impl<'ctx> !Sync for BasicMetadataValueEnum<'ctx>

    §

    impl<'ctx> Unpin for BasicMetadataValueEnum<'ctx>

    §

    impl<'ctx> UnwindSafe for BasicMetadataValueEnum<'ctx>

    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/inkwell/values/enum.BasicValueEnum.html b/inkwell/values/enum.BasicValueEnum.html index 11606a13c..682a256f2 100644 --- a/inkwell/values/enum.BasicValueEnum.html +++ b/inkwell/values/enum.BasicValueEnum.html @@ -12,35 +12,35 @@
    source

    pub fn get_name(&self) -> &CStr

    Get the name of the BasicValueEnum.

    source

    pub fn set_name(&self, name: &str)

    Set name of the BasicValueEnum.

    source

    pub fn get_type(&self) -> BasicTypeEnum<'ctx>

    source

    pub fn is_array_value(self) -> bool

    source

    pub fn is_int_value(self) -> bool

    source

    pub fn is_float_value(self) -> bool

    source

    pub fn is_pointer_value(self) -> bool

    source

    pub fn is_struct_value(self) -> bool

    source

    pub fn is_vector_value(self) -> bool

    source

    pub fn into_array_value(self) -> ArrayValue<'ctx>

    source

    pub fn into_int_value(self) -> IntValue<'ctx>

    source

    pub fn into_float_value(self) -> FloatValue<'ctx>

    source

    pub fn into_pointer_value(self) -> PointerValue<'ctx>

    source

    pub fn into_struct_value(self) -> StructValue<'ctx>

    source

    pub fn into_vector_value(self) -> VectorValue<'ctx>

    Trait Implementations§

    source§

    impl<'ctx> AnyValue<'ctx> for BasicValueEnum<'ctx>

    source§

    fn as_any_value_enum(&self) -> AnyValueEnum<'ctx>

    Returns an enum containing a typed version of AnyValue.
    source§

    fn print_to_string(&self) -> LLVMString

    Prints a value to a LLVMString
    source§

    fn is_poison(&self) -> bool

    Returns whether the value is poison
    source§

    impl AsValueRef for BasicValueEnum<'_>

    source§

    fn as_value_ref(&self) -> LLVMValueRef

    source§

    impl<'ctx> BasicValue<'ctx> for BasicValueEnum<'ctx>

    source§

    fn as_basic_value_enum(&self) -> BasicValueEnum<'ctx>

    Returns an enum containing a typed version of the BasicValue.
    source§

    fn as_instruction_value(&self) -> Option<InstructionValue<'ctx>>

    Most BasicValues are the byproduct of an instruction -and so are convertible into an InstructionValue
    source§

    fn get_first_use(&self) -> Option<BasicValueUse<'_>>

    source§

    fn set_name(&self, name: &str)

    Sets the name of a BasicValue. If the value is a constant, this is a noop.
    source§

    impl<'ctx> Clone for BasicValueEnum<'ctx>

    source§

    fn clone(&self) -> BasicValueEnum<'ctx>

    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<'ctx> Debug for BasicValueEnum<'ctx>

    source§

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

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

    impl Display for BasicValueEnum<'_>

    source§

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

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

    impl<'ctx> From<ArrayValue<'ctx>> for BasicValueEnum<'ctx>

    source§

    fn from(value: ArrayValue<'_>) -> BasicValueEnum<'_>

    Converts to this type from the input type.
    source§

    impl<'ctx> From<BasicValueEnum<'ctx>> for AnyValueEnum<'ctx>

    source§

    fn from(value: BasicValueEnum<'ctx>) -> Self

    Converts to this type from the input type.
    source§

    impl<'ctx> From<BasicValueEnum<'ctx>> for BasicMetadataValueEnum<'ctx>

    source§

    fn from(value: BasicValueEnum<'ctx>) -> Self

    Converts to this type from the input type.
    source§

    impl<'ctx> From<FloatValue<'ctx>> for BasicValueEnum<'ctx>

    source§

    fn from(value: FloatValue<'_>) -> BasicValueEnum<'_>

    Converts to this type from the input type.
    source§

    impl<'ctx> From<IntValue<'ctx>> for BasicValueEnum<'ctx>

    source§

    fn from(value: IntValue<'_>) -> BasicValueEnum<'_>

    Converts to this type from the input type.
    source§

    impl<'ctx> From<PointerValue<'ctx>> for BasicValueEnum<'ctx>

    source§

    fn from(value: PointerValue<'_>) -> BasicValueEnum<'_>

    Converts to this type from the input type.
    source§

    impl<'ctx> From<StructValue<'ctx>> for BasicValueEnum<'ctx>

    source§

    fn from(value: StructValue<'_>) -> BasicValueEnum<'_>

    Converts to this type from the input type.
    source§

    impl<'ctx> From<VectorValue<'ctx>> for BasicValueEnum<'ctx>

    source§

    fn from(value: VectorValue<'_>) -> BasicValueEnum<'_>

    Converts to this type from the input type.
    source§

    impl<'ctx> Hash for BasicValueEnum<'ctx>

    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 +and so are convertible into an InstructionValue

    source§

    fn get_first_use(&self) -> Option<BasicValueUse<'_>>

    source§

    fn set_name(&self, name: &str)

    Sets the name of a BasicValue. If the value is a constant, this is a noop.
    source§

    impl<'ctx> Clone for BasicValueEnum<'ctx>

    source§

    fn clone(&self) -> BasicValueEnum<'ctx>

    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<'ctx> Debug for BasicValueEnum<'ctx>

    source§

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

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

    impl Display for BasicValueEnum<'_>

    source§

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

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

    impl<'ctx> From<ArrayValue<'ctx>> for BasicValueEnum<'ctx>

    source§

    fn from(value: ArrayValue<'_>) -> BasicValueEnum<'_>

    Converts to this type from the input type.
    source§

    impl<'ctx> From<BasicValueEnum<'ctx>> for AnyValueEnum<'ctx>

    source§

    fn from(value: BasicValueEnum<'ctx>) -> Self

    Converts to this type from the input type.
    source§

    impl<'ctx> From<BasicValueEnum<'ctx>> for BasicMetadataValueEnum<'ctx>

    source§

    fn from(value: BasicValueEnum<'ctx>) -> Self

    Converts to this type from the input type.
    source§

    impl<'ctx> From<FloatValue<'ctx>> for BasicValueEnum<'ctx>

    source§

    fn from(value: FloatValue<'_>) -> BasicValueEnum<'_>

    Converts to this type from the input type.
    source§

    impl<'ctx> From<IntValue<'ctx>> for BasicValueEnum<'ctx>

    source§

    fn from(value: IntValue<'_>) -> BasicValueEnum<'_>

    Converts to this type from the input type.
    source§

    impl<'ctx> From<PointerValue<'ctx>> for BasicValueEnum<'ctx>

    source§

    fn from(value: PointerValue<'_>) -> BasicValueEnum<'_>

    Converts to this type from the input type.
    source§

    impl<'ctx> From<StructValue<'ctx>> for BasicValueEnum<'ctx>

    source§

    fn from(value: StructValue<'_>) -> BasicValueEnum<'_>

    Converts to this type from the input type.
    source§

    impl<'ctx> From<VectorValue<'ctx>> for BasicValueEnum<'ctx>

    source§

    fn from(value: VectorValue<'_>) -> BasicValueEnum<'_>

    Converts to this type from the input type.
    source§

    impl<'ctx> Hash for BasicValueEnum<'ctx>

    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<'ctx> PartialEq<ArrayValue<'ctx>> for BasicValueEnum<'ctx>

    source§

    fn eq(&self, other: &ArrayValue<'ctx>) -> bool

    This method tests for self and other values to be equal, and is used -by ==.
    1.0.0 · source§

    fn ne(&self, other: &Rhs) -> bool

    This method tests for !=. The default implementation is almost always -sufficient, and should not be overridden without very good reason.
    source§

    impl<'ctx> PartialEq<BasicValueEnum<'ctx>> for ArrayValue<'ctx>

    source§

    fn eq(&self, other: &BasicValueEnum<'ctx>) -> bool

    This method tests for self and other values to be equal, and is used -by ==.
    1.0.0 · source§

    fn ne(&self, other: &Rhs) -> bool

    This method tests for !=. The default implementation is almost always -sufficient, and should not be overridden without very good reason.
    source§

    impl<'ctx> PartialEq<BasicValueEnum<'ctx>> for FloatValue<'ctx>

    source§

    fn eq(&self, other: &BasicValueEnum<'ctx>) -> bool

    This method tests for self and other values to be equal, and is used -by ==.
    1.0.0 · source§

    fn ne(&self, other: &Rhs) -> bool

    This method tests for !=. The default implementation is almost always -sufficient, and should not be overridden without very good reason.
    source§

    impl<'ctx> PartialEq<BasicValueEnum<'ctx>> for IntValue<'ctx>

    source§

    fn eq(&self, other: &BasicValueEnum<'ctx>) -> bool

    This method tests for self and other values to be equal, and is used -by ==.
    1.0.0 · source§

    fn ne(&self, other: &Rhs) -> bool

    This method tests for !=. The default implementation is almost always -sufficient, and should not be overridden without very good reason.
    source§

    impl<'ctx> PartialEq<BasicValueEnum<'ctx>> for PointerValue<'ctx>

    source§

    fn eq(&self, other: &BasicValueEnum<'ctx>) -> bool

    This method tests for self and other values to be equal, and is used -by ==.
    1.0.0 · source§

    fn ne(&self, other: &Rhs) -> bool

    This method tests for !=. The default implementation is almost always -sufficient, and should not be overridden without very good reason.
    source§

    impl<'ctx> PartialEq<BasicValueEnum<'ctx>> for StructValue<'ctx>

    source§

    fn eq(&self, other: &BasicValueEnum<'ctx>) -> bool

    This method tests for self and other values to be equal, and is used + Self: Sized,
    Feeds a slice of this type into the given Hasher. Read more
    source§

    impl<'ctx> PartialEq<ArrayValue<'ctx>> for BasicValueEnum<'ctx>

    source§

    fn eq(&self, other: &ArrayValue<'ctx>) -> bool

    This method tests for self and other values to be equal, and is used by ==.
    1.0.0 · source§

    fn ne(&self, other: &Rhs) -> bool

    This method tests for !=. The default implementation is almost always -sufficient, and should not be overridden without very good reason.
    source§

    impl<'ctx> PartialEq<BasicValueEnum<'ctx>> for VectorValue<'ctx>

    source§

    fn eq(&self, other: &BasicValueEnum<'ctx>) -> 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<'ctx> PartialEq<BasicValueEnum<'ctx>> for ArrayValue<'ctx>

    source§

    fn eq(&self, other: &BasicValueEnum<'ctx>) -> bool

    This method tests for self and other values to be equal, and is used by ==.
    1.0.0 · source§

    fn ne(&self, other: &Rhs) -> bool

    This method tests for !=. The default implementation is almost always +sufficient, and should not be overridden without very good reason.
    source§

    impl<'ctx> PartialEq<BasicValueEnum<'ctx>> for FloatValue<'ctx>

    source§

    fn eq(&self, other: &BasicValueEnum<'ctx>) -> bool

    This method tests for self and other values to be equal, and is used +by ==.
    1.0.0 · source§

    fn ne(&self, other: &Rhs) -> bool

    This method tests for !=. The default implementation is almost always +sufficient, and should not be overridden without very good reason.
    source§

    impl<'ctx> PartialEq<BasicValueEnum<'ctx>> for IntValue<'ctx>

    source§

    fn eq(&self, other: &BasicValueEnum<'ctx>) -> bool

    This method tests for self and other values to be equal, and is used +by ==.
    1.0.0 · source§

    fn ne(&self, other: &Rhs) -> bool

    This method tests for !=. The default implementation is almost always +sufficient, and should not be overridden without very good reason.
    source§

    impl<'ctx> PartialEq<BasicValueEnum<'ctx>> for PointerValue<'ctx>

    source§

    fn eq(&self, other: &BasicValueEnum<'ctx>) -> bool

    This method tests for self and other values to be equal, and is used +by ==.
    1.0.0 · source§

    fn ne(&self, other: &Rhs) -> bool

    This method tests for !=. The default implementation is almost always +sufficient, and should not be overridden without very good reason.
    source§

    impl<'ctx> PartialEq<BasicValueEnum<'ctx>> for StructValue<'ctx>

    source§

    fn eq(&self, other: &BasicValueEnum<'ctx>) -> bool

    This method tests for self and other values to be equal, and is used +by ==.
    1.0.0 · source§

    fn ne(&self, other: &Rhs) -> bool

    This method tests for !=. The default implementation is almost always +sufficient, and should not be overridden without very good reason.
    source§

    impl<'ctx> PartialEq<BasicValueEnum<'ctx>> for VectorValue<'ctx>

    source§

    fn eq(&self, other: &BasicValueEnum<'ctx>) -> bool

    This method tests for self and other values to be equal, and is used +by ==.
    1.0.0 · source§

    fn ne(&self, other: &Rhs) -> bool

    This method tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.
    source§

    impl<'ctx> PartialEq<FloatValue<'ctx>> for BasicValueEnum<'ctx>

    source§

    fn eq(&self, other: &FloatValue<'ctx>) -> bool

    This method tests for self and other values to be equal, and is used by ==.
    1.0.0 · source§

    fn ne(&self, other: &Rhs) -> bool

    This method tests for !=. The default implementation is almost always -sufficient, and should not be overridden without very good reason.
    source§

    impl<'ctx> PartialEq<IntValue<'ctx>> for BasicValueEnum<'ctx>

    source§

    fn eq(&self, other: &IntValue<'ctx>) -> bool

    This method tests for self and other values to be equal, and is used -by ==.
    1.0.0 · source§

    fn ne(&self, other: &Rhs) -> bool

    This method tests for !=. The default implementation is almost always -sufficient, and should not be overridden without very good reason.
    source§

    impl<'ctx> PartialEq<PointerValue<'ctx>> for BasicValueEnum<'ctx>

    source§

    fn eq(&self, other: &PointerValue<'ctx>) -> bool

    This method tests for self and other values to be equal, and is used -by ==.
    1.0.0 · source§

    fn ne(&self, other: &Rhs) -> bool

    This method tests for !=. The default implementation is almost always -sufficient, and should not be overridden without very good reason.
    source§

    impl<'ctx> PartialEq<StructValue<'ctx>> for BasicValueEnum<'ctx>

    source§

    fn eq(&self, other: &StructValue<'ctx>) -> bool

    This method tests for self and other values to be equal, and is used -by ==.
    1.0.0 · source§

    fn ne(&self, other: &Rhs) -> bool

    This method tests for !=. The default implementation is almost always -sufficient, and should not be overridden without very good reason.
    source§

    impl<'ctx> PartialEq<VectorValue<'ctx>> for BasicValueEnum<'ctx>

    source§

    fn eq(&self, other: &VectorValue<'ctx>) -> bool

    This method tests for self and other values to be equal, and is used -by ==.
    1.0.0 · source§

    fn ne(&self, other: &Rhs) -> bool

    This method tests for !=. The default implementation is almost always -sufficient, and should not be overridden without very good reason.
    source§

    impl<'ctx> PartialEq for BasicValueEnum<'ctx>

    source§

    fn eq(&self, other: &BasicValueEnum<'ctx>) -> 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<'ctx> PartialEq<IntValue<'ctx>> for BasicValueEnum<'ctx>

    source§

    fn eq(&self, other: &IntValue<'ctx>) -> bool

    This method tests for self and other values to be equal, and is used +by ==.
    1.0.0 · source§

    fn ne(&self, other: &Rhs) -> bool

    This method tests for !=. The default implementation is almost always +sufficient, and should not be overridden without very good reason.
    source§

    impl<'ctx> PartialEq<PointerValue<'ctx>> for BasicValueEnum<'ctx>

    source§

    fn eq(&self, other: &PointerValue<'ctx>) -> bool

    This method tests for self and other values to be equal, and is used +by ==.
    1.0.0 · source§

    fn ne(&self, other: &Rhs) -> bool

    This method tests for !=. The default implementation is almost always +sufficient, and should not be overridden without very good reason.
    source§

    impl<'ctx> PartialEq<StructValue<'ctx>> for BasicValueEnum<'ctx>

    source§

    fn eq(&self, other: &StructValue<'ctx>) -> bool

    This method tests for self and other values to be equal, and is used by ==.
    1.0.0 · source§

    fn ne(&self, other: &Rhs) -> bool

    This method tests for !=. The default implementation is almost always -sufficient, and should not be overridden without very good reason.
    source§

    impl<'ctx> TryFrom<AnyValueEnum<'ctx>> for BasicValueEnum<'ctx>

    §

    type Error = ()

    The type returned in the event of a conversion error.
    source§

    fn try_from(value: AnyValueEnum<'ctx>) -> Result<Self, Self::Error>

    Performs the conversion.
    source§

    impl<'ctx> TryFrom<BasicMetadataValueEnum<'ctx>> for BasicValueEnum<'ctx>

    §

    type Error = ()

    The type returned in the event of a conversion error.
    source§

    fn try_from(value: BasicMetadataValueEnum<'ctx>) -> Result<Self, Self::Error>

    Performs the conversion.
    source§

    impl<'ctx> TryFrom<BasicValueEnum<'ctx>> for ArrayValue<'ctx>

    §

    type Error = ()

    The type returned in the event of a conversion error.
    source§

    fn try_from(value: BasicValueEnum<'ctx>) -> Result<Self, Self::Error>

    Performs the conversion.
    source§

    impl<'ctx> TryFrom<BasicValueEnum<'ctx>> for FloatValue<'ctx>

    §

    type Error = ()

    The type returned in the event of a conversion error.
    source§

    fn try_from(value: BasicValueEnum<'ctx>) -> Result<Self, Self::Error>

    Performs the conversion.
    source§

    impl<'ctx> TryFrom<BasicValueEnum<'ctx>> for IntValue<'ctx>

    §

    type Error = ()

    The type returned in the event of a conversion error.
    source§

    fn try_from(value: BasicValueEnum<'ctx>) -> Result<Self, Self::Error>

    Performs the conversion.
    source§

    impl<'ctx> TryFrom<BasicValueEnum<'ctx>> for PointerValue<'ctx>

    §

    type Error = ()

    The type returned in the event of a conversion error.
    source§

    fn try_from(value: BasicValueEnum<'ctx>) -> Result<Self, Self::Error>

    Performs the conversion.
    source§

    impl<'ctx> TryFrom<BasicValueEnum<'ctx>> for StructValue<'ctx>

    §

    type Error = ()

    The type returned in the event of a conversion error.
    source§

    fn try_from(value: BasicValueEnum<'ctx>) -> Result<Self, Self::Error>

    Performs the conversion.
    source§

    impl<'ctx> TryFrom<BasicValueEnum<'ctx>> for VectorValue<'ctx>

    §

    type Error = ()

    The type returned in the event of a conversion error.
    source§

    fn try_from(value: BasicValueEnum<'ctx>) -> Result<Self, Self::Error>

    Performs the conversion.
    source§

    impl<'ctx> Copy for BasicValueEnum<'ctx>

    source§

    impl<'ctx> Eq for BasicValueEnum<'ctx>

    source§

    impl<'ctx> StructuralPartialEq for BasicValueEnum<'ctx>

    Auto Trait Implementations§

    §

    impl<'ctx> Freeze for BasicValueEnum<'ctx>

    §

    impl<'ctx> RefUnwindSafe for BasicValueEnum<'ctx>

    §

    impl<'ctx> !Send for BasicValueEnum<'ctx>

    §

    impl<'ctx> !Sync for BasicValueEnum<'ctx>

    §

    impl<'ctx> Unpin for BasicValueEnum<'ctx>

    §

    impl<'ctx> UnwindSafe for BasicValueEnum<'ctx>

    Blanket Implementations§

    source§

    impl<T> Any for T
    where +sufficient, and should not be overridden without very good reason.

    source§

    impl<'ctx> PartialEq<VectorValue<'ctx>> for BasicValueEnum<'ctx>

    source§

    fn eq(&self, other: &VectorValue<'ctx>) -> bool

    This method tests for self and other values to be equal, and is used +by ==.
    1.0.0 · source§

    fn ne(&self, other: &Rhs) -> bool

    This method tests for !=. The default implementation is almost always +sufficient, and should not be overridden without very good reason.
    source§

    impl<'ctx> PartialEq for BasicValueEnum<'ctx>

    source§

    fn eq(&self, other: &BasicValueEnum<'ctx>) -> bool

    This method tests for self and other values to be equal, and is used +by ==.
    1.0.0 · source§

    fn ne(&self, other: &Rhs) -> bool

    This method tests for !=. The default implementation is almost always +sufficient, and should not be overridden without very good reason.
    source§

    impl<'ctx> TryFrom<AnyValueEnum<'ctx>> for BasicValueEnum<'ctx>

    §

    type Error = ()

    The type returned in the event of a conversion error.
    source§

    fn try_from(value: AnyValueEnum<'ctx>) -> Result<Self, Self::Error>

    Performs the conversion.
    source§

    impl<'ctx> TryFrom<BasicMetadataValueEnum<'ctx>> for BasicValueEnum<'ctx>

    §

    type Error = ()

    The type returned in the event of a conversion error.
    source§

    fn try_from(value: BasicMetadataValueEnum<'ctx>) -> Result<Self, Self::Error>

    Performs the conversion.
    source§

    impl<'ctx> TryFrom<BasicValueEnum<'ctx>> for ArrayValue<'ctx>

    §

    type Error = ()

    The type returned in the event of a conversion error.
    source§

    fn try_from(value: BasicValueEnum<'ctx>) -> Result<Self, Self::Error>

    Performs the conversion.
    source§

    impl<'ctx> TryFrom<BasicValueEnum<'ctx>> for FloatValue<'ctx>

    §

    type Error = ()

    The type returned in the event of a conversion error.
    source§

    fn try_from(value: BasicValueEnum<'ctx>) -> Result<Self, Self::Error>

    Performs the conversion.
    source§

    impl<'ctx> TryFrom<BasicValueEnum<'ctx>> for IntValue<'ctx>

    §

    type Error = ()

    The type returned in the event of a conversion error.
    source§

    fn try_from(value: BasicValueEnum<'ctx>) -> Result<Self, Self::Error>

    Performs the conversion.
    source§

    impl<'ctx> TryFrom<BasicValueEnum<'ctx>> for PointerValue<'ctx>

    §

    type Error = ()

    The type returned in the event of a conversion error.
    source§

    fn try_from(value: BasicValueEnum<'ctx>) -> Result<Self, Self::Error>

    Performs the conversion.
    source§

    impl<'ctx> TryFrom<BasicValueEnum<'ctx>> for StructValue<'ctx>

    §

    type Error = ()

    The type returned in the event of a conversion error.
    source§

    fn try_from(value: BasicValueEnum<'ctx>) -> Result<Self, Self::Error>

    Performs the conversion.
    source§

    impl<'ctx> TryFrom<BasicValueEnum<'ctx>> for VectorValue<'ctx>

    §

    type Error = ()

    The type returned in the event of a conversion error.
    source§

    fn try_from(value: BasicValueEnum<'ctx>) -> Result<Self, Self::Error>

    Performs the conversion.
    source§

    impl<'ctx> Copy for BasicValueEnum<'ctx>

    source§

    impl<'ctx> Eq for BasicValueEnum<'ctx>

    source§

    impl<'ctx> StructuralPartialEq for BasicValueEnum<'ctx>

    Auto Trait Implementations§

    §

    impl<'ctx> Freeze for BasicValueEnum<'ctx>

    §

    impl<'ctx> RefUnwindSafe for BasicValueEnum<'ctx>

    §

    impl<'ctx> !Send for BasicValueEnum<'ctx>

    §

    impl<'ctx> !Sync for BasicValueEnum<'ctx>

    §

    impl<'ctx> Unpin for BasicValueEnum<'ctx>

    §

    impl<'ctx> UnwindSafe for BasicValueEnum<'ctx>

    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/inkwell/values/index.html b/inkwell/values/index.html index 0a71552ce..92476329f 100644 --- a/inkwell/values/index.html +++ b/inkwell/values/index.html @@ -1,4 +1,5 @@ inkwell::values - Rust
    -

    Module inkwell::values

    source ·
    Expand description

    A value is an instance of a type.

    +

    Module inkwell::values

    source ·
    Expand description

    A value is an instance of a type.

    Structs§

    Enums§

    Constants§

    Traits§

    \ No newline at end of file +the Phi’s containing basic block.
  • PointerValue
  • StructValue
  • VectorValue

    • Enums§

    Constants§

    Traits§

    \ No newline at end of file diff --git a/inkwell/values/struct.ArrayValue.html b/inkwell/values/struct.ArrayValue.html index 500e21b8e..5d82eb232 100644 --- a/inkwell/values/struct.ArrayValue.html +++ b/inkwell/values/struct.ArrayValue.html @@ -1,19 +1,31 @@ -ArrayValue in inkwell::values - Rust
    -

    Struct inkwell::values::ArrayValue

    source · 
    pub struct ArrayValue<'ctx> { /* private fields */ }
    Expand description

    An ArrayValue is a block of contiguous constants or variables.

    -

    Implementations§

    source§

    impl<'ctx> ArrayValue<'ctx>

    source

    pub unsafe fn new(value: LLVMValueRef) -> Self

    Get a value from an LLVMValueRef.

    +ArrayValue in inkwell::values - Rust
    +

    Struct inkwell::values::ArrayValue

    source · 
    pub struct ArrayValue<'ctx> { /* private fields */ }
    Expand description

    An ArrayValue is a block of contiguous constants or variables.

    +

    Implementations§

    source§

    impl<'ctx> ArrayValue<'ctx>

    source

    pub unsafe fn new(value: LLVMValueRef) -> Self

    Get a value from an LLVMValueRef.

    §Safety

    The ref must be valid and of type array.

    -
    source

    pub fn get_name(&self) -> &CStr

    Get name of the ArrayValue. If the value is a constant, this will +

    source

    pub unsafe fn new_const_array<T: AsTypeRef, V: AsValueRef>( + ty: &T, + values: &[V] +) -> Self

    Creates a new constant ArrayValue with the given type and values.

    +
    §Safety
    +

    values must be of the same type as ty.

    +
    source

    pub unsafe fn new_raw_const_array( + ty: LLVMTypeRef, + values: &[LLVMValueRef] +) -> Self

    Creates a new constant ArrayValue with the given type and values.

    +
    §Safety
    +

    values must be of the same type as ty.

    +
    source

    pub fn get_name(&self) -> &CStr

    Get name of the ArrayValue. If the value is a constant, this will return an empty string.

    -
    source

    pub fn set_name(&self, name: &str)

    Set name of the ArrayValue.

    -
    source

    pub fn get_type(self) -> ArrayType<'ctx>

    Gets the type of this ArrayValue.

    -
    source

    pub fn is_null(self) -> bool

    Determines whether or not this value is null.

    -
    source

    pub fn is_undef(self) -> bool

    Determines whether or not this value is undefined.

    -
    source

    pub fn print_to_stderr(self)

    Prints this ArrayValue to standard error.

    -
    source

    pub fn as_instruction(self) -> Option<InstructionValue<'ctx>>

    Attempt to convert this ArrayValue to an InstructionValue, if possible.

    -
    source

    pub fn replace_all_uses_with(self, other: ArrayValue<'ctx>)

    Replaces all uses of this value with another value of the same type. +

    source

    pub fn set_name(&self, name: &str)

    Set name of the ArrayValue.

    +
    source

    pub fn get_type(self) -> ArrayType<'ctx>

    Gets the type of this ArrayValue.

    +
    source

    pub fn is_null(self) -> bool

    Determines whether or not this value is null.

    +
    source

    pub fn is_undef(self) -> bool

    Determines whether or not this value is undefined.

    +
    source

    pub fn print_to_stderr(self)

    Prints this ArrayValue to standard error.

    +
    source

    pub fn as_instruction(self) -> Option<InstructionValue<'ctx>>

    Attempt to convert this ArrayValue to an InstructionValue, if possible.

    +
    source

    pub fn replace_all_uses_with(self, other: ArrayValue<'ctx>)

    Replaces all uses of this value with another value of the same type. If used incorrectly this may result in invalid IR.

    -
    source

    pub fn is_const(self) -> bool

    Determines whether or not an ArrayValue is a constant.

    +
    source

    pub fn is_const(self) -> bool

    Determines whether or not an ArrayValue is a constant.

    §Example
    use inkwell::context::Context;
 
@@ -23,7 +35,7 @@ If used incorrectly this may result in invalid IR.
    
 let array_val = i64_type.const_array(&[i64_val]);
 
 assert!(array_val.is_const());
    -
    source

    pub fn is_const_string(self) -> bool

    Determines whether or not an ArrayValue represents a constant array of i8s.

    +
    source

    pub fn is_const_string(self) -> bool

    Determines whether or not an ArrayValue represents a constant array of i8s.

    §Example
    use inkwell::context::Context;
 
@@ -31,7 +43,7 @@ If used incorrectly this may result in invalid IR.
    
 let string = context.const_string(b"my_string", false);
 
 assert!(string.is_const_string());
    -
    source

    pub fn get_string_constant(&self) -> Option<&CStr>

    Obtain the string from the ArrayValue +

    source

    pub fn get_string_constant(&self) -> Option<&CStr>

    Obtain the string from the ArrayValue if the value points to a constant string.

    §Example
    use inkwell::context::Context;
@@ -42,28 +54,28 @@ if the value points to a constant string.
    
 
 let result = CStr::from_bytes_with_nul(b"hello!\0").unwrap();
 assert_eq!(string.get_string_constant(), Some(result));
    -

    Trait Implementations§

    source§

    impl<'ctx> AggregateValue<'ctx> for ArrayValue<'ctx>

    source§

    fn as_aggregate_value_enum(&self) -> AggregateValueEnum<'ctx>

    Returns an enum containing a typed version of the AggregateValue.
    source§

    impl<'ctx> AnyValue<'ctx> for ArrayValue<'ctx>

    source§

    fn as_any_value_enum(&self) -> AnyValueEnum<'ctx>

    Returns an enum containing a typed version of AnyValue.
    source§

    fn print_to_string(&self) -> LLVMString

    Prints a value to a LLVMString
    source§

    fn is_poison(&self) -> bool

    Returns whether the value is poison
    source§

    impl AsValueRef for ArrayValue<'_>

    source§

    fn as_value_ref(&self) -> LLVMValueRef

    source§

    impl<'ctx> BasicValue<'ctx> for ArrayValue<'ctx>

    source§

    fn as_basic_value_enum(&self) -> BasicValueEnum<'ctx>

    Returns an enum containing a typed version of the BasicValue.
    source§

    fn as_instruction_value(&self) -> Option<InstructionValue<'ctx>>

    Most BasicValues are the byproduct of an instruction -and so are convertible into an InstructionValue
    source§

    fn get_first_use(&self) -> Option<BasicValueUse<'_>>

    source§

    fn set_name(&self, name: &str)

    Sets the name of a BasicValue. If the value is a constant, this is a noop.
    source§

    impl<'ctx> Clone for ArrayValue<'ctx>

    source§

    fn clone(&self) -> ArrayValue<'ctx>

    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 ArrayValue<'_>

    source§

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

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

    impl Display for ArrayValue<'_>

    source§

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

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

    impl<'ctx> From<ArrayValue<'ctx>> for AggregateValueEnum<'ctx>

    source§

    fn from(value: ArrayValue<'_>) -> AggregateValueEnum<'_>

    Converts to this type from the input type.
    source§

    impl<'ctx> From<ArrayValue<'ctx>> for AnyValueEnum<'ctx>

    source§

    fn from(value: ArrayValue<'_>) -> AnyValueEnum<'_>

    Converts to this type from the input type.
    source§

    impl<'ctx> From<ArrayValue<'ctx>> for BasicMetadataValueEnum<'ctx>

    source§

    fn from(value: ArrayValue<'_>) -> BasicMetadataValueEnum<'_>

    Converts to this type from the input type.
    source§

    impl<'ctx> From<ArrayValue<'ctx>> for BasicValueEnum<'ctx>

    source§

    fn from(value: ArrayValue<'_>) -> BasicValueEnum<'_>

    Converts to this type from the input type.
    source§

    impl<'ctx> Hash for ArrayValue<'ctx>

    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<'ctx> AggregateValue<'ctx> for ArrayValue<'ctx>

    source§

    fn as_aggregate_value_enum(&self) -> AggregateValueEnum<'ctx>

    Returns an enum containing a typed version of the AggregateValue.
    source§

    impl<'ctx> AnyValue<'ctx> for ArrayValue<'ctx>

    source§

    fn as_any_value_enum(&self) -> AnyValueEnum<'ctx>

    Returns an enum containing a typed version of AnyValue.
    source§

    fn print_to_string(&self) -> LLVMString

    Prints a value to a LLVMString
    source§

    fn is_poison(&self) -> bool

    Returns whether the value is poison
    source§

    impl AsValueRef for ArrayValue<'_>

    source§

    fn as_value_ref(&self) -> LLVMValueRef

    source§

    impl<'ctx> BasicValue<'ctx> for ArrayValue<'ctx>

    source§

    fn as_basic_value_enum(&self) -> BasicValueEnum<'ctx>

    Returns an enum containing a typed version of the BasicValue.
    source§

    fn as_instruction_value(&self) -> Option<InstructionValue<'ctx>>

    Most BasicValues are the byproduct of an instruction +and so are convertible into an InstructionValue
    source§

    fn get_first_use(&self) -> Option<BasicValueUse<'_>>

    source§

    fn set_name(&self, name: &str)

    Sets the name of a BasicValue. If the value is a constant, this is a noop.
    source§

    impl<'ctx> Clone for ArrayValue<'ctx>

    source§

    fn clone(&self) -> ArrayValue<'ctx>

    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 ArrayValue<'_>

    source§

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

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

    impl Display for ArrayValue<'_>

    source§

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

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

    impl<'ctx> From<ArrayValue<'ctx>> for AggregateValueEnum<'ctx>

    source§

    fn from(value: ArrayValue<'_>) -> AggregateValueEnum<'_>

    Converts to this type from the input type.
    source§

    impl<'ctx> From<ArrayValue<'ctx>> for AnyValueEnum<'ctx>

    source§

    fn from(value: ArrayValue<'_>) -> AnyValueEnum<'_>

    Converts to this type from the input type.
    source§

    impl<'ctx> From<ArrayValue<'ctx>> for BasicMetadataValueEnum<'ctx>

    source§

    fn from(value: ArrayValue<'_>) -> BasicMetadataValueEnum<'_>

    Converts to this type from the input type.
    source§

    impl<'ctx> From<ArrayValue<'ctx>> for BasicValueEnum<'ctx>

    source§

    fn from(value: ArrayValue<'_>) -> BasicValueEnum<'_>

    Converts to this type from the input type.
    source§

    impl<'ctx> Hash for ArrayValue<'ctx>

    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<'ctx> PartialEq<AggregateValueEnum<'ctx>> for ArrayValue<'ctx>

    source§

    fn eq(&self, other: &AggregateValueEnum<'ctx>) -> bool

    This method tests for self and other values to be equal, and is used -by ==.
    1.0.0 · source§

    fn ne(&self, other: &Rhs) -> bool

    This method tests for !=. The default implementation is almost always -sufficient, and should not be overridden without very good reason.
    source§

    impl<'ctx> PartialEq<AnyValueEnum<'ctx>> for ArrayValue<'ctx>

    source§

    fn eq(&self, other: &AnyValueEnum<'ctx>) -> bool

    This method tests for self and other values to be equal, and is used -by ==.
    1.0.0 · source§

    fn ne(&self, other: &Rhs) -> bool

    This method tests for !=. The default implementation is almost always -sufficient, and should not be overridden without very good reason.
    source§

    impl<'ctx> PartialEq<ArrayValue<'ctx>> for AggregateValueEnum<'ctx>

    source§

    fn eq(&self, other: &ArrayValue<'ctx>) -> bool

    This method tests for self and other values to be equal, and is used -by ==.
    1.0.0 · source§

    fn ne(&self, other: &Rhs) -> bool

    This method tests for !=. The default implementation is almost always -sufficient, and should not be overridden without very good reason.
    source§

    impl<'ctx> PartialEq<ArrayValue<'ctx>> for AnyValueEnum<'ctx>

    source§

    fn eq(&self, other: &ArrayValue<'ctx>) -> bool

    This method tests for self and other values to be equal, and is used -by ==.
    1.0.0 · source§

    fn ne(&self, other: &Rhs) -> bool

    This method tests for !=. The default implementation is almost always -sufficient, and should not be overridden without very good reason.
    source§

    impl<'ctx> PartialEq<ArrayValue<'ctx>> for BasicMetadataValueEnum<'ctx>

    source§

    fn eq(&self, other: &ArrayValue<'ctx>) -> bool

    This method tests for self and other values to be equal, and is used -by ==.
    1.0.0 · source§

    fn ne(&self, other: &Rhs) -> bool

    This method tests for !=. The default implementation is almost always -sufficient, and should not be overridden without very good reason.
    source§

    impl<'ctx> PartialEq<ArrayValue<'ctx>> for BasicValueEnum<'ctx>

    source§

    fn eq(&self, other: &ArrayValue<'ctx>) -> bool

    This method tests for self and other values to be equal, and is used -by ==.
    1.0.0 · source§

    fn ne(&self, other: &Rhs) -> bool

    This method tests for !=. The default implementation is almost always -sufficient, and should not be overridden without very good reason.
    source§

    impl<'ctx> PartialEq<BasicMetadataValueEnum<'ctx>> for ArrayValue<'ctx>

    source§

    fn eq(&self, other: &BasicMetadataValueEnum<'ctx>) -> bool

    This method tests for self and other values to be equal, and is used -by ==.
    1.0.0 · source§

    fn ne(&self, other: &Rhs) -> bool

    This method tests for !=. The default implementation is almost always -sufficient, and should not be overridden without very good reason.
    source§

    impl<'ctx> PartialEq<BasicValueEnum<'ctx>> for ArrayValue<'ctx>

    source§

    fn eq(&self, other: &BasicValueEnum<'ctx>) -> bool

    This method tests for self and other values to be equal, and is used -by ==.
    1.0.0 · source§

    fn ne(&self, other: &Rhs) -> bool

    This method tests for !=. The default implementation is almost always -sufficient, and should not be overridden without very good reason.
    source§

    impl<'ctx> PartialEq for ArrayValue<'ctx>

    source§

    fn eq(&self, other: &ArrayValue<'ctx>) -> bool

    This method tests for self and other values to be equal, and is used + Self: Sized,
    Feeds a slice of this type into the given Hasher. Read more
    source§

    impl<'ctx> PartialEq<AggregateValueEnum<'ctx>> for ArrayValue<'ctx>

    source§

    fn eq(&self, other: &AggregateValueEnum<'ctx>) -> bool

    This method tests for self and other values to be equal, and is used by ==.
    1.0.0 · source§

    fn ne(&self, other: &Rhs) -> bool

    This method tests for !=. The default implementation is almost always -sufficient, and should not be overridden without very good reason.
    source§

    impl<'ctx> TryFrom<AggregateValueEnum<'ctx>> for ArrayValue<'ctx>

    §

    type Error = ()

    The type returned in the event of a conversion error.
    source§

    fn try_from(value: AggregateValueEnum<'ctx>) -> Result<Self, Self::Error>

    Performs the conversion.
    source§

    impl<'ctx> TryFrom<AnyValueEnum<'ctx>> for ArrayValue<'ctx>

    §

    type Error = ()

    The type returned in the event of a conversion error.
    source§

    fn try_from(value: AnyValueEnum<'ctx>) -> Result<Self, Self::Error>

    Performs the conversion.
    source§

    impl<'ctx> TryFrom<BasicMetadataValueEnum<'ctx>> for ArrayValue<'ctx>

    §

    type Error = ()

    The type returned in the event of a conversion error.
    source§

    fn try_from(value: BasicMetadataValueEnum<'ctx>) -> Result<Self, Self::Error>

    Performs the conversion.
    source§

    impl<'ctx> TryFrom<BasicValueEnum<'ctx>> for ArrayValue<'ctx>

    §

    type Error = ()

    The type returned in the event of a conversion error.
    source§

    fn try_from(value: BasicValueEnum<'ctx>) -> Result<Self, Self::Error>

    Performs the conversion.
    source§

    impl<'ctx> Copy for ArrayValue<'ctx>

    source§

    impl<'ctx> Eq for ArrayValue<'ctx>

    source§

    impl<'ctx> StructuralPartialEq for ArrayValue<'ctx>

    Auto Trait Implementations§

    §

    impl<'ctx> Freeze for ArrayValue<'ctx>

    §

    impl<'ctx> RefUnwindSafe for ArrayValue<'ctx>

    §

    impl<'ctx> !Send for ArrayValue<'ctx>

    §

    impl<'ctx> !Sync for ArrayValue<'ctx>

    §

    impl<'ctx> Unpin for ArrayValue<'ctx>

    §

    impl<'ctx> UnwindSafe for ArrayValue<'ctx>

    Blanket Implementations§

    source§

    impl<T> Any for T
    where +sufficient, and should not be overridden without very good reason.

    source§

    impl<'ctx> PartialEq<AnyValueEnum<'ctx>> for ArrayValue<'ctx>

    source§

    fn eq(&self, other: &AnyValueEnum<'ctx>) -> bool

    This method tests for self and other values to be equal, and is used +by ==.
    1.0.0 · source§

    fn ne(&self, other: &Rhs) -> bool

    This method tests for !=. The default implementation is almost always +sufficient, and should not be overridden without very good reason.
    source§

    impl<'ctx> PartialEq<ArrayValue<'ctx>> for AggregateValueEnum<'ctx>

    source§

    fn eq(&self, other: &ArrayValue<'ctx>) -> bool

    This method tests for self and other values to be equal, and is used +by ==.
    1.0.0 · source§

    fn ne(&self, other: &Rhs) -> bool

    This method tests for !=. The default implementation is almost always +sufficient, and should not be overridden without very good reason.
    source§

    impl<'ctx> PartialEq<ArrayValue<'ctx>> for AnyValueEnum<'ctx>

    source§

    fn eq(&self, other: &ArrayValue<'ctx>) -> bool

    This method tests for self and other values to be equal, and is used +by ==.
    1.0.0 · source§

    fn ne(&self, other: &Rhs) -> bool

    This method tests for !=. The default implementation is almost always +sufficient, and should not be overridden without very good reason.
    source§

    impl<'ctx> PartialEq<ArrayValue<'ctx>> for BasicMetadataValueEnum<'ctx>

    source§

    fn eq(&self, other: &ArrayValue<'ctx>) -> bool

    This method tests for self and other values to be equal, and is used +by ==.
    1.0.0 · source§

    fn ne(&self, other: &Rhs) -> bool

    This method tests for !=. The default implementation is almost always +sufficient, and should not be overridden without very good reason.
    source§

    impl<'ctx> PartialEq<ArrayValue<'ctx>> for BasicValueEnum<'ctx>

    source§

    fn eq(&self, other: &ArrayValue<'ctx>) -> bool

    This method tests for self and other values to be equal, and is used +by ==.
    1.0.0 · source§

    fn ne(&self, other: &Rhs) -> bool

    This method tests for !=. The default implementation is almost always +sufficient, and should not be overridden without very good reason.
    source§

    impl<'ctx> PartialEq<BasicMetadataValueEnum<'ctx>> for ArrayValue<'ctx>

    source§

    fn eq(&self, other: &BasicMetadataValueEnum<'ctx>) -> bool

    This method tests for self and other values to be equal, and is used +by ==.
    1.0.0 · source§

    fn ne(&self, other: &Rhs) -> bool

    This method tests for !=. The default implementation is almost always +sufficient, and should not be overridden without very good reason.
    source§

    impl<'ctx> PartialEq<BasicValueEnum<'ctx>> for ArrayValue<'ctx>

    source§

    fn eq(&self, other: &BasicValueEnum<'ctx>) -> bool

    This method tests for self and other values to be equal, and is used +by ==.
    1.0.0 · source§

    fn ne(&self, other: &Rhs) -> bool

    This method tests for !=. The default implementation is almost always +sufficient, and should not be overridden without very good reason.
    source§

    impl<'ctx> PartialEq for ArrayValue<'ctx>

    source§

    fn eq(&self, other: &ArrayValue<'ctx>) -> bool

    This method tests for self and other values to be equal, and is used +by ==.
    1.0.0 · source§

    fn ne(&self, other: &Rhs) -> bool

    This method tests for !=. The default implementation is almost always +sufficient, and should not be overridden without very good reason.
    source§

    impl<'ctx> TryFrom<AggregateValueEnum<'ctx>> for ArrayValue<'ctx>

    §

    type Error = ()

    The type returned in the event of a conversion error.
    source§

    fn try_from(value: AggregateValueEnum<'ctx>) -> Result<Self, Self::Error>

    Performs the conversion.
    source§

    impl<'ctx> TryFrom<AnyValueEnum<'ctx>> for ArrayValue<'ctx>

    §

    type Error = ()

    The type returned in the event of a conversion error.
    source§

    fn try_from(value: AnyValueEnum<'ctx>) -> Result<Self, Self::Error>

    Performs the conversion.
    source§

    impl<'ctx> TryFrom<BasicMetadataValueEnum<'ctx>> for ArrayValue<'ctx>

    §

    type Error = ()

    The type returned in the event of a conversion error.
    source§

    fn try_from(value: BasicMetadataValueEnum<'ctx>) -> Result<Self, Self::Error>

    Performs the conversion.
    source§

    impl<'ctx> TryFrom<BasicValueEnum<'ctx>> for ArrayValue<'ctx>

    §

    type Error = ()

    The type returned in the event of a conversion error.
    source§

    fn try_from(value: BasicValueEnum<'ctx>) -> Result<Self, Self::Error>

    Performs the conversion.
    source§

    impl<'ctx> Copy for ArrayValue<'ctx>

    source§

    impl<'ctx> Eq for ArrayValue<'ctx>

    source§

    impl<'ctx> StructuralPartialEq for ArrayValue<'ctx>

    Auto Trait Implementations§

    §

    impl<'ctx> Freeze for ArrayValue<'ctx>

    §

    impl<'ctx> RefUnwindSafe for ArrayValue<'ctx>

    §

    impl<'ctx> !Send for ArrayValue<'ctx>

    §

    impl<'ctx> !Sync for ArrayValue<'ctx>

    §

    impl<'ctx> Unpin for ArrayValue<'ctx>

    §

    impl<'ctx> UnwindSafe for ArrayValue<'ctx>

    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/inkwell/values/struct.BasicValueUse.html b/inkwell/values/struct.BasicValueUse.html index 24a40dfc3..40b73b8e2 100644 --- a/inkwell/values/struct.BasicValueUse.html +++ b/inkwell/values/struct.BasicValueUse.html @@ -27,7 +27,7 @@ builder.position_at_end(basic_block); let arg1 = function.get_first_param().unwrap().into_pointer_value(); -let f32_val = f32_type.const_float(::std::f64::consts::PI); +let f32_val = f32_type.const_float(std::f64::consts::PI); let store_instruction = builder.build_store(arg1, f32_val).unwrap(); let free_instruction = builder.build_free(arg1).unwrap(); let return_instruction = builder.build_return(None).unwrap(); @@ -77,7 +77,7 @@ declare void @free(i8*) builder.position_at_end(basic_block); let arg1 = function.get_first_param().unwrap().into_pointer_value(); -let f32_val = f32_type.const_float(::std::f64::consts::PI); +let f32_val = f32_type.const_float(std::f64::consts::PI); let store_instruction = builder.build_store(arg1, f32_val).unwrap(); let free_instruction = builder.build_free(arg1).unwrap(); let return_instruction = builder.build_return(None).unwrap(); @@ -110,7 +110,7 @@ builder.position_at_end(basic_block); builder.position_at_end(basic_block); let arg1 = function.get_first_param().unwrap().into_pointer_value(); -let f32_val = f32_type.const_float(::std::f64::consts::PI); +let f32_val = f32_type.const_float(std::f64::consts::PI); let store_instruction = builder.build_store(arg1, f32_val).unwrap(); let free_instruction = builder.build_free(arg1).unwrap(); let return_instruction = builder.build_return(None).unwrap(); diff --git a/inkwell/values/struct.FloatValue.html b/inkwell/values/struct.FloatValue.html index d9e291e45..7ad2300fe 100644 --- a/inkwell/values/struct.FloatValue.html +++ b/inkwell/values/struct.FloatValue.html @@ -1,15 +1,15 @@ FloatValue in inkwell::values - Rust
    -

    Struct inkwell::values::FloatValue

    source · 
    pub struct FloatValue<'ctx> { /* private fields */ }

    Implementations§

    source§

    impl<'ctx> FloatValue<'ctx>

    source

    pub unsafe fn new(value: LLVMValueRef) -> Self

    Get a value from an LLVMValueRef.

    +

    Struct inkwell::values::FloatValue

    source · 
    pub struct FloatValue<'ctx> { /* private fields */ }

    Implementations§

    source§

    impl<'ctx> FloatValue<'ctx>

    source

    pub unsafe fn new(value: LLVMValueRef) -> Self

    Get a value from an LLVMValueRef.

    §Safety

    The ref must be valid and of type float.

    -
    source

    pub fn get_name(&self) -> &CStr

    Gets name of the FloatValue. If the value is a constant, this will +

    source

    pub fn get_name(&self) -> &CStr

    Gets name of the FloatValue. If the value is a constant, this will return an empty string.

    -
    source

    pub fn set_name(&self, name: &str)

    Set name of the FloatValue.

    -
    source

    pub fn get_type(self) -> FloatType<'ctx>

    source

    pub fn is_null(self) -> bool

    source

    pub fn is_undef(self) -> bool

    source

    pub fn print_to_stderr(self)

    source

    pub fn as_instruction(self) -> Option<InstructionValue<'ctx>>

    source

    pub fn const_compare( +

    source

    pub fn set_name(&self, name: &str)

    Set name of the FloatValue.

    +
    source

    pub fn get_type(self) -> FloatType<'ctx>

    source

    pub fn is_null(self) -> bool

    source

    pub fn is_undef(self) -> bool

    source

    pub fn print_to_stderr(self)

    source

    pub fn as_instruction(self) -> Option<InstructionValue<'ctx>>

    source

    pub fn const_compare( self, op: FloatPredicate, rhs: FloatValue<'ctx> -) -> IntValue<'ctx>

    source

    pub fn is_const(self) -> bool

    Determines whether or not a FloatValue is a constant.

    +) -> IntValue<'ctx>
    source

    pub fn is_const(self) -> bool

    Determines whether or not a FloatValue is a constant.

    §Example
    use inkwell::context::Context;
 
@@ -18,7 +18,7 @@ return an empty string.
    
 let f64_val = f64_type.const_float(1.2);
 
 assert!(f64_val.is_const());
    -
    source

    pub fn get_constant(self) -> Option<(f64, bool)>

    Obtains a constant FloatValue’s value and whether or not it lost info.

    +
    source

    pub fn get_constant(self) -> Option<(f64, bool)>

    Obtains a constant FloatValue’s value and whether or not it lost info.

    §Example
    use inkwell::context::Context;
 
@@ -27,24 +27,24 @@ return an empty string.
    
 let f64_1_2 = f64_type.const_float(1.2);
 
 assert_eq!(f64_1_2.get_constant(), Some((1.2, false)));
    -
    source

    pub fn replace_all_uses_with(self, other: FloatValue<'ctx>)

    Trait Implementations§

    source§

    impl<'ctx> AnyValue<'ctx> for FloatValue<'ctx>

    source§

    fn as_any_value_enum(&self) -> AnyValueEnum<'ctx>

    Returns an enum containing a typed version of AnyValue.
    source§

    fn print_to_string(&self) -> LLVMString

    Prints a value to a LLVMString
    source§

    fn is_poison(&self) -> bool

    Returns whether the value is poison
    source§

    impl AsValueRef for FloatValue<'_>

    source§

    fn as_value_ref(&self) -> LLVMValueRef

    source§

    impl<'ctx> BasicValue<'ctx> for FloatValue<'ctx>

    source§

    fn as_basic_value_enum(&self) -> BasicValueEnum<'ctx>

    Returns an enum containing a typed version of the BasicValue.
    source§

    fn as_instruction_value(&self) -> Option<InstructionValue<'ctx>>

    Most BasicValues are the byproduct of an instruction -and so are convertible into an InstructionValue
    source§

    fn get_first_use(&self) -> Option<BasicValueUse<'_>>

    source§

    fn set_name(&self, name: &str)

    Sets the name of a BasicValue. If the value is a constant, this is a noop.
    source§

    impl<'ctx> Clone for FloatValue<'ctx>

    source§

    fn clone(&self) -> FloatValue<'ctx>

    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<'ctx> Debug for FloatValue<'ctx>

    source§

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

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

    impl Display for FloatValue<'_>

    source§

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

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

    impl<'ctx> FloatMathValue<'ctx> for FloatValue<'ctx>

    §

    type BaseType = FloatType<'ctx>

    source§

    unsafe fn new(value: LLVMValueRef) -> FloatValue<'ctx>

    source§

    impl<'ctx> From<FloatValue<'ctx>> for AnyValueEnum<'ctx>

    source§

    fn from(value: FloatValue<'_>) -> AnyValueEnum<'_>

    Converts to this type from the input type.
    source§

    impl<'ctx> From<FloatValue<'ctx>> for BasicMetadataValueEnum<'ctx>

    source§

    fn from(value: FloatValue<'_>) -> BasicMetadataValueEnum<'_>

    Converts to this type from the input type.
    source§

    impl<'ctx> From<FloatValue<'ctx>> for BasicValueEnum<'ctx>

    source§

    fn from(value: FloatValue<'_>) -> BasicValueEnum<'_>

    Converts to this type from the input type.
    source§

    impl<'ctx> Hash for FloatValue<'ctx>

    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

    pub fn replace_all_uses_with(self, other: FloatValue<'ctx>)

    Trait Implementations§

    source§

    impl<'ctx> AnyValue<'ctx> for FloatValue<'ctx>

    source§

    fn as_any_value_enum(&self) -> AnyValueEnum<'ctx>

    Returns an enum containing a typed version of AnyValue.
    source§

    fn print_to_string(&self) -> LLVMString

    Prints a value to a LLVMString
    source§

    fn is_poison(&self) -> bool

    Returns whether the value is poison
    source§

    impl AsValueRef for FloatValue<'_>

    source§

    fn as_value_ref(&self) -> LLVMValueRef

    source§

    impl<'ctx> BasicValue<'ctx> for FloatValue<'ctx>

    source§

    fn as_basic_value_enum(&self) -> BasicValueEnum<'ctx>

    Returns an enum containing a typed version of the BasicValue.
    source§

    fn as_instruction_value(&self) -> Option<InstructionValue<'ctx>>

    Most BasicValues are the byproduct of an instruction +and so are convertible into an InstructionValue
    source§

    fn get_first_use(&self) -> Option<BasicValueUse<'_>>

    source§

    fn set_name(&self, name: &str)

    Sets the name of a BasicValue. If the value is a constant, this is a noop.
    source§

    impl<'ctx> Clone for FloatValue<'ctx>

    source§

    fn clone(&self) -> FloatValue<'ctx>

    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<'ctx> Debug for FloatValue<'ctx>

    source§

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

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

    impl Display for FloatValue<'_>

    source§

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

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

    impl<'ctx> FloatMathValue<'ctx> for FloatValue<'ctx>

    §

    type BaseType = FloatType<'ctx>

    source§

    unsafe fn new(value: LLVMValueRef) -> FloatValue<'ctx>

    source§

    impl<'ctx> From<FloatValue<'ctx>> for AnyValueEnum<'ctx>

    source§

    fn from(value: FloatValue<'_>) -> AnyValueEnum<'_>

    Converts to this type from the input type.
    source§

    impl<'ctx> From<FloatValue<'ctx>> for BasicMetadataValueEnum<'ctx>

    source§

    fn from(value: FloatValue<'_>) -> BasicMetadataValueEnum<'_>

    Converts to this type from the input type.
    source§

    impl<'ctx> From<FloatValue<'ctx>> for BasicValueEnum<'ctx>

    source§

    fn from(value: FloatValue<'_>) -> BasicValueEnum<'_>

    Converts to this type from the input type.
    source§

    impl<'ctx> Hash for FloatValue<'ctx>

    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<'ctx> PartialEq<AnyValueEnum<'ctx>> for FloatValue<'ctx>

    source§

    fn eq(&self, other: &AnyValueEnum<'ctx>) -> bool

    This method tests for self and other values to be equal, and is used -by ==.
    1.0.0 · source§

    fn ne(&self, other: &Rhs) -> bool

    This method tests for !=. The default implementation is almost always -sufficient, and should not be overridden without very good reason.
    source§

    impl<'ctx> PartialEq<BasicMetadataValueEnum<'ctx>> for FloatValue<'ctx>

    source§

    fn eq(&self, other: &BasicMetadataValueEnum<'ctx>) -> bool

    This method tests for self and other values to be equal, and is used -by ==.
    1.0.0 · source§

    fn ne(&self, other: &Rhs) -> bool

    This method tests for !=. The default implementation is almost always -sufficient, and should not be overridden without very good reason.
    source§

    impl<'ctx> PartialEq<BasicValueEnum<'ctx>> for FloatValue<'ctx>

    source§

    fn eq(&self, other: &BasicValueEnum<'ctx>) -> bool

    This method tests for self and other values to be equal, and is used -by ==.
    1.0.0 · source§

    fn ne(&self, other: &Rhs) -> bool

    This method tests for !=. The default implementation is almost always -sufficient, and should not be overridden without very good reason.
    source§

    impl<'ctx> PartialEq<FloatValue<'ctx>> for AnyValueEnum<'ctx>

    source§

    fn eq(&self, other: &FloatValue<'ctx>) -> bool

    This method tests for self and other values to be equal, and is used -by ==.
    1.0.0 · source§

    fn ne(&self, other: &Rhs) -> bool

    This method tests for !=. The default implementation is almost always -sufficient, and should not be overridden without very good reason.
    source§

    impl<'ctx> PartialEq<FloatValue<'ctx>> for BasicMetadataValueEnum<'ctx>

    source§

    fn eq(&self, other: &FloatValue<'ctx>) -> bool

    This method tests for self and other values to be equal, and is used -by ==.
    1.0.0 · source§

    fn ne(&self, other: &Rhs) -> bool

    This method tests for !=. The default implementation is almost always -sufficient, and should not be overridden without very good reason.
    source§

    impl<'ctx> PartialEq<FloatValue<'ctx>> for BasicValueEnum<'ctx>

    source§

    fn eq(&self, other: &FloatValue<'ctx>) -> bool

    This method tests for self and other values to be equal, and is used -by ==.
    1.0.0 · source§

    fn ne(&self, other: &Rhs) -> bool

    This method tests for !=. The default implementation is almost always -sufficient, and should not be overridden without very good reason.
    source§

    impl<'ctx> PartialEq for FloatValue<'ctx>

    source§

    fn eq(&self, other: &FloatValue<'ctx>) -> bool

    This method tests for self and other values to be equal, and is used + Self: Sized,
    Feeds a slice of this type into the given Hasher. Read more
    source§

    impl<'ctx> PartialEq<AnyValueEnum<'ctx>> for FloatValue<'ctx>

    source§

    fn eq(&self, other: &AnyValueEnum<'ctx>) -> bool

    This method tests for self and other values to be equal, and is used by ==.
    1.0.0 · source§

    fn ne(&self, other: &Rhs) -> bool

    This method tests for !=. The default implementation is almost always -sufficient, and should not be overridden without very good reason.
    source§

    impl<'ctx> TryFrom<AnyValueEnum<'ctx>> for FloatValue<'ctx>

    §

    type Error = ()

    The type returned in the event of a conversion error.
    source§

    fn try_from(value: AnyValueEnum<'ctx>) -> Result<Self, Self::Error>

    Performs the conversion.
    source§

    impl<'ctx> TryFrom<BasicMetadataValueEnum<'ctx>> for FloatValue<'ctx>

    §

    type Error = ()

    The type returned in the event of a conversion error.
    source§

    fn try_from(value: BasicMetadataValueEnum<'ctx>) -> Result<Self, Self::Error>

    Performs the conversion.
    source§

    impl<'ctx> TryFrom<BasicValueEnum<'ctx>> for FloatValue<'ctx>

    §

    type Error = ()

    The type returned in the event of a conversion error.
    source§

    fn try_from(value: BasicValueEnum<'ctx>) -> Result<Self, Self::Error>

    Performs the conversion.
    source§

    impl<'ctx> TryFrom<InstructionValue<'ctx>> for FloatValue<'ctx>

    §

    type Error = ()

    The type returned in the event of a conversion error.
    source§

    fn try_from(value: InstructionValue<'_>) -> Result<Self, Self::Error>

    Performs the conversion.
    source§

    impl<'ctx> Copy for FloatValue<'ctx>

    source§

    impl<'ctx> Eq for FloatValue<'ctx>

    source§

    impl<'ctx> StructuralPartialEq for FloatValue<'ctx>

    Auto Trait Implementations§

    §

    impl<'ctx> Freeze for FloatValue<'ctx>

    §

    impl<'ctx> RefUnwindSafe for FloatValue<'ctx>

    §

    impl<'ctx> !Send for FloatValue<'ctx>

    §

    impl<'ctx> !Sync for FloatValue<'ctx>

    §

    impl<'ctx> Unpin for FloatValue<'ctx>

    §

    impl<'ctx> UnwindSafe for FloatValue<'ctx>

    Blanket Implementations§

    source§

    impl<T> Any for T
    where +sufficient, and should not be overridden without very good reason.

    source§

    impl<'ctx> PartialEq<BasicMetadataValueEnum<'ctx>> for FloatValue<'ctx>

    source§

    fn eq(&self, other: &BasicMetadataValueEnum<'ctx>) -> bool

    This method tests for self and other values to be equal, and is used +by ==.
    1.0.0 · source§

    fn ne(&self, other: &Rhs) -> bool

    This method tests for !=. The default implementation is almost always +sufficient, and should not be overridden without very good reason.
    source§

    impl<'ctx> PartialEq<BasicValueEnum<'ctx>> for FloatValue<'ctx>

    source§

    fn eq(&self, other: &BasicValueEnum<'ctx>) -> bool

    This method tests for self and other values to be equal, and is used +by ==.
    1.0.0 · source§

    fn ne(&self, other: &Rhs) -> bool

    This method tests for !=. The default implementation is almost always +sufficient, and should not be overridden without very good reason.
    source§

    impl<'ctx> PartialEq<FloatValue<'ctx>> for AnyValueEnum<'ctx>

    source§

    fn eq(&self, other: &FloatValue<'ctx>) -> bool

    This method tests for self and other values to be equal, and is used +by ==.
    1.0.0 · source§

    fn ne(&self, other: &Rhs) -> bool

    This method tests for !=. The default implementation is almost always +sufficient, and should not be overridden without very good reason.
    source§

    impl<'ctx> PartialEq<FloatValue<'ctx>> for BasicMetadataValueEnum<'ctx>

    source§

    fn eq(&self, other: &FloatValue<'ctx>) -> bool

    This method tests for self and other values to be equal, and is used +by ==.
    1.0.0 · source§

    fn ne(&self, other: &Rhs) -> bool

    This method tests for !=. The default implementation is almost always +sufficient, and should not be overridden without very good reason.
    source§

    impl<'ctx> PartialEq<FloatValue<'ctx>> for BasicValueEnum<'ctx>

    source§

    fn eq(&self, other: &FloatValue<'ctx>) -> bool

    This method tests for self and other values to be equal, and is used +by ==.
    1.0.0 · source§

    fn ne(&self, other: &Rhs) -> bool

    This method tests for !=. The default implementation is almost always +sufficient, and should not be overridden without very good reason.
    source§

    impl<'ctx> PartialEq for FloatValue<'ctx>

    source§

    fn eq(&self, other: &FloatValue<'ctx>) -> bool

    This method tests for self and other values to be equal, and is used +by ==.
    1.0.0 · source§

    fn ne(&self, other: &Rhs) -> bool

    This method tests for !=. The default implementation is almost always +sufficient, and should not be overridden without very good reason.
    source§

    impl<'ctx> TryFrom<AnyValueEnum<'ctx>> for FloatValue<'ctx>

    §

    type Error = ()

    The type returned in the event of a conversion error.
    source§

    fn try_from(value: AnyValueEnum<'ctx>) -> Result<Self, Self::Error>

    Performs the conversion.
    source§

    impl<'ctx> TryFrom<BasicMetadataValueEnum<'ctx>> for FloatValue<'ctx>

    §

    type Error = ()

    The type returned in the event of a conversion error.
    source§

    fn try_from(value: BasicMetadataValueEnum<'ctx>) -> Result<Self, Self::Error>

    Performs the conversion.
    source§

    impl<'ctx> TryFrom<BasicValueEnum<'ctx>> for FloatValue<'ctx>

    §

    type Error = ()

    The type returned in the event of a conversion error.
    source§

    fn try_from(value: BasicValueEnum<'ctx>) -> Result<Self, Self::Error>

    Performs the conversion.
    source§

    impl<'ctx> TryFrom<InstructionValue<'ctx>> for FloatValue<'ctx>

    §

    type Error = ()

    The type returned in the event of a conversion error.
    source§

    fn try_from(value: InstructionValue<'_>) -> Result<Self, Self::Error>

    Performs the conversion.
    source§

    impl<'ctx> Copy for FloatValue<'ctx>

    source§

    impl<'ctx> Eq for FloatValue<'ctx>

    source§

    impl<'ctx> StructuralPartialEq for FloatValue<'ctx>

    Auto Trait Implementations§

    §

    impl<'ctx> Freeze for FloatValue<'ctx>

    §

    impl<'ctx> RefUnwindSafe for FloatValue<'ctx>

    §

    impl<'ctx> !Send for FloatValue<'ctx>

    §

    impl<'ctx> !Sync for FloatValue<'ctx>

    §

    impl<'ctx> Unpin for FloatValue<'ctx>

    §

    impl<'ctx> UnwindSafe for FloatValue<'ctx>

    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/inkwell/values/struct.FunctionValue.html b/inkwell/values/struct.FunctionValue.html index 544fc214a..5648a8e88 100644 --- a/inkwell/values/struct.FunctionValue.html +++ b/inkwell/values/struct.FunctionValue.html @@ -129,12 +129,12 @@ a PointerValue.

    source

    pub fn set_section(self, section: Option<&str>)

    Set the section to which this function should belong

    Trait Implementations§

    source§

    impl<'ctx> AnyValue<'ctx> for FunctionValue<'ctx>

    source§

    fn as_any_value_enum(&self) -> AnyValueEnum<'ctx>

    Returns an enum containing a typed version of AnyValue.
    source§

    fn print_to_string(&self) -> LLVMString

    Prints a value to a LLVMString
    source§

    fn is_poison(&self) -> bool

    Returns whether the value is poison
    source§

    impl AsValueRef for FunctionValue<'_>

    source§

    fn as_value_ref(&self) -> LLVMValueRef

    source§

    impl<'ctx> Clone for FunctionValue<'ctx>

    source§

    fn clone(&self) -> FunctionValue<'ctx>

    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 FunctionValue<'_>

    source§

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

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

    impl Display for FunctionValue<'_>

    source§

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

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

    impl<'ctx> From<FunctionValue<'ctx>> for AnyValueEnum<'ctx>

    source§

    fn from(value: FunctionValue<'_>) -> AnyValueEnum<'_>

    Converts to this type from the input type.
    source§

    impl<'ctx> Hash for FunctionValue<'ctx>

    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<'ctx> PartialEq<AnyValueEnum<'ctx>> for FunctionValue<'ctx>

    source§

    fn eq(&self, other: &AnyValueEnum<'ctx>) -> bool

    This method tests for self and other values to be equal, and is used -by ==.
    1.0.0 · source§

    fn ne(&self, other: &Rhs) -> bool

    This method tests for !=. The default implementation is almost always -sufficient, and should not be overridden without very good reason.
    source§

    impl<'ctx> PartialEq<FunctionValue<'ctx>> for AnyValueEnum<'ctx>

    source§

    fn eq(&self, other: &FunctionValue<'ctx>) -> bool

    This method tests for self and other values to be equal, and is used + Self: Sized,
    Feeds a slice of this type into the given Hasher. Read more
    source§

    impl<'ctx> PartialEq<AnyValueEnum<'ctx>> for FunctionValue<'ctx>

    source§

    fn eq(&self, other: &AnyValueEnum<'ctx>) -> bool

    This method tests for self and other values to be equal, and is used by ==.
    1.0.0 · source§

    fn ne(&self, other: &Rhs) -> bool

    This method tests for !=. The default implementation is almost always -sufficient, and should not be overridden without very good reason.
    source§

    impl<'ctx> PartialEq for FunctionValue<'ctx>

    source§

    fn eq(&self, other: &FunctionValue<'ctx>) -> 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<'ctx> PartialEq<FunctionValue<'ctx>> for AnyValueEnum<'ctx>

    source§

    fn eq(&self, other: &FunctionValue<'ctx>) -> bool

    This method tests for self and other values to be equal, and is used by ==.
    1.0.0 · source§

    fn ne(&self, other: &Rhs) -> bool

    This method tests for !=. The default implementation is almost always +sufficient, and should not be overridden without very good reason.
    source§

    impl<'ctx> PartialEq for FunctionValue<'ctx>

    source§

    fn eq(&self, other: &FunctionValue<'ctx>) -> bool

    This method tests for self and other values to be equal, and is used +by ==.
    1.0.0 · source§

    fn ne(&self, other: &Rhs) -> bool

    This method tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.
    source§

    impl<'ctx> PassManagerSubType for FunctionValue<'ctx>

    §

    type Input = Module<'ctx>

    source§

    unsafe fn create<I: Borrow<Self::Input>>(input: I) -> LLVMPassManagerRef

    source§

    unsafe fn run_in_pass_manager(&self, pass_manager: &PassManager<Self>) -> bool

    source§

    impl<'ctx> TryFrom<AnyValueEnum<'ctx>> for FunctionValue<'ctx>

    §

    type Error = ()

    The type returned in the event of a conversion error.
    source§

    fn try_from(value: AnyValueEnum<'ctx>) -> Result<Self, Self::Error>

    Performs the conversion.
    source§

    impl<'ctx> Copy for FunctionValue<'ctx>

    source§

    impl<'ctx> Eq for FunctionValue<'ctx>

    source§

    impl<'ctx> StructuralPartialEq for FunctionValue<'ctx>

    Auto Trait Implementations§

    §

    impl<'ctx> Freeze for FunctionValue<'ctx>

    §

    impl<'ctx> RefUnwindSafe for FunctionValue<'ctx>

    §

    impl<'ctx> !Send for FunctionValue<'ctx>

    §

    impl<'ctx> !Sync for FunctionValue<'ctx>

    §

    impl<'ctx> Unpin for FunctionValue<'ctx>

    §

    impl<'ctx> UnwindSafe for FunctionValue<'ctx>

    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/inkwell/values/struct.GlobalValue.html b/inkwell/values/struct.GlobalValue.html index 596427d44..2d88d84da 100644 --- a/inkwell/values/struct.GlobalValue.html +++ b/inkwell/values/struct.GlobalValue.html @@ -26,7 +26,7 @@ context.append_basic_block(fn_value, "entry");

    source

    pub fn get_comdat(self) -> Option<Comdat>

    Gets a Comdat assigned to this GlobalValue, if any.

    source

    pub fn set_comdat(self, comdat: Comdat)

    Assigns a Comdat to this GlobalValue.

    source

    pub fn get_unnamed_address(self) -> UnnamedAddress

    source

    pub fn set_unnamed_address(self, address: UnnamedAddress)

    source

    pub fn get_linkage(self) -> Linkage

    source

    pub fn set_linkage(self, linkage: Linkage)

    source

    pub fn get_value_type(self) -> AnyTypeEnum<'ctx>

    Trait Implementations§

    source§

    impl<'ctx> AnyValue<'ctx> for GlobalValue<'ctx>

    source§

    fn as_any_value_enum(&self) -> AnyValueEnum<'ctx>

    Returns an enum containing a typed version of AnyValue.
    source§

    fn print_to_string(&self) -> LLVMString

    Prints a value to a LLVMString
    source§

    fn is_poison(&self) -> bool

    Returns whether the value is poison
    source§

    impl AsValueRef for GlobalValue<'_>

    source§

    fn as_value_ref(&self) -> LLVMValueRef

    source§

    impl<'ctx> BasicValue<'ctx> for GlobalValue<'ctx>

    source§

    fn as_basic_value_enum(&self) -> BasicValueEnum<'ctx>

    Returns an enum containing a typed version of the BasicValue.
    source§

    fn as_instruction_value(&self) -> Option<InstructionValue<'ctx>>

    Most BasicValues are the byproduct of an instruction -and so are convertible into an InstructionValue
    source§

    fn get_first_use(&self) -> Option<BasicValueUse<'_>>

    source§

    fn set_name(&self, name: &str)

    Sets the name of a BasicValue. If the value is a constant, this is a noop.
    source§

    impl<'ctx> Clone for GlobalValue<'ctx>

    source§

    fn clone(&self) -> GlobalValue<'ctx>

    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<'ctx> Debug for GlobalValue<'ctx>

    source§

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

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

    impl Display for GlobalValue<'_>

    source§

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

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

    impl<'ctx> Hash for GlobalValue<'ctx>

    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 +and so are convertible into an InstructionValue

    source§

    fn get_first_use(&self) -> Option<BasicValueUse<'_>>

    source§

    fn set_name(&self, name: &str)

    Sets the name of a BasicValue. If the value is a constant, this is a noop.
    source§

    impl<'ctx> Clone for GlobalValue<'ctx>

    source§

    fn clone(&self) -> GlobalValue<'ctx>

    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<'ctx> Debug for GlobalValue<'ctx>

    source§

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

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

    impl Display for GlobalValue<'_>

    source§

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

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

    impl<'ctx> Hash for GlobalValue<'ctx>

    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<'ctx> PartialEq for GlobalValue<'ctx>

    source§

    fn eq(&self, other: &GlobalValue<'ctx>) -> bool

    This method tests for self and other values to be equal, 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/inkwell/values/struct.InstructionValue.html b/inkwell/values/struct.InstructionValue.html index f8c086e64..392035ab9 100644 --- a/inkwell/values/struct.InstructionValue.html +++ b/inkwell/values/struct.InstructionValue.html @@ -1,43 +1,45 @@ -InstructionValue in inkwell::values - Rust
    -

    Struct inkwell::values::InstructionValue

    source · 
    pub struct InstructionValue<'ctx> { /* private fields */ }

    Implementations§

    source§

    impl<'ctx> InstructionValue<'ctx>

    source

    pub unsafe fn new(instruction_value: LLVMValueRef) -> Self

    Get a value from an LLVMValueRef.

    +InstructionValue in inkwell::values - Rust
    +

    Struct inkwell::values::InstructionValue

    source · 
    pub struct InstructionValue<'ctx> { /* private fields */ }

    Implementations§

    source§

    impl<'ctx> InstructionValue<'ctx>

    source

    pub unsafe fn new(instruction_value: LLVMValueRef) -> Self

    Get a value from an LLVMValueRef.

    §Safety

    The ref must be valid and of type instruction.

    -
    source

    pub fn get_name(&self) -> Option<&CStr>

    Get name of the InstructionValue.

    -
    source

    pub fn get_instruction_with_name( +

    source

    pub fn explicit_clone(&self) -> Self

    Creates a clone of this InstructionValue, and returns it. +The clone will have no parent, and no name.

    +
    source

    pub fn get_name(&self) -> Option<&CStr>

    Get name of the InstructionValue.

    +
    source

    pub fn get_instruction_with_name( &self, name: &str ) -> Option<InstructionValue<'ctx>>

    Get a instruction with it’s name Compares against all instructions after self, and self.

    -
    source

    pub fn set_name(&self, name: &str) -> Result<(), &'static str>

    Set name of the InstructionValue.

    -
    source

    pub fn get_type(self) -> AnyTypeEnum<'ctx>

    Get type of the current InstructionValue

    -
    source

    pub fn get_opcode(self) -> InstructionOpcode

    source

    pub fn get_previous_instruction(self) -> Option<Self>

    source

    pub fn get_next_instruction(self) -> Option<Self>

    source

    pub fn erase_from_basic_block(self)

    source

    pub fn remove_from_basic_block(self)

    source

    pub fn get_parent(self) -> Option<BasicBlock<'ctx>>

    source

    pub fn is_terminator(self) -> bool

    Returns if the instruction is a terminator

    -
    source

    pub fn is_conditional(self) -> bool

    Returns if a terminator is conditional or not

    -
    source

    pub fn is_tail_call(self) -> bool

    source

    pub fn get_tail_call_kind(self) -> Option<LLVMTailCallKind>

    Returns the tail call kind on call instructions.

    +
    source

    pub fn set_name(&self, name: &str) -> Result<(), &'static str>

    Set name of the InstructionValue.

    +
    source

    pub fn get_type(self) -> AnyTypeEnum<'ctx>

    Get type of the current InstructionValue

    +
    source

    pub fn get_opcode(self) -> InstructionOpcode

    source

    pub fn get_previous_instruction(self) -> Option<Self>

    source

    pub fn get_next_instruction(self) -> Option<Self>

    source

    pub fn erase_from_basic_block(self)

    source

    pub fn remove_from_basic_block(self)

    source

    pub fn get_parent(self) -> Option<BasicBlock<'ctx>>

    source

    pub fn is_terminator(self) -> bool

    Returns if the instruction is a terminator

    +
    source

    pub fn is_conditional(self) -> bool

    Returns if a terminator is conditional or not

    +
    source

    pub fn is_tail_call(self) -> bool

    source

    pub fn get_tail_call_kind(self) -> Option<LLVMTailCallKind>

    Returns the tail call kind on call instructions.

    Other instructions return None.

    -
    source

    pub fn can_use_fast_math_flags(self) -> bool

    Check whether this instructions supports fast math flags.

    -
    source

    pub fn get_fast_math_flags(self) -> Option<u32>

    Get fast math flags of supported instructions.

    +
    source

    pub fn can_use_fast_math_flags(self) -> bool

    Check whether this instructions supports fast math flags.

    +
    source

    pub fn get_fast_math_flags(self) -> Option<u32>

    Get fast math flags of supported instructions.

    Calling this on unsupported instructions is safe and returns None.

    -
    source

    pub fn set_fast_math_flags(self, flags: u32)

    Set fast math flags on supported instructions.

    +
    source

    pub fn set_fast_math_flags(self, flags: u32)

    Set fast math flags on supported instructions.

    Calling this on unsupported instructions is safe and results in a no-op.

    -
    source

    pub fn get_non_negative_flag(self) -> Option<bool>

    Check if a zext instruction has the non-negative flag set.

    +
    source

    pub fn get_non_negative_flag(self) -> Option<bool>

    Check if a zext instruction has the non-negative flag set.

    Calling this function on other instructions is safe and returns None.

    -
    source

    pub fn set_non_negative_flag(self, flag: bool)

    Set the non-negative flag on zext instructions.

    +
    source

    pub fn set_non_negative_flag(self, flag: bool)

    Set the non-negative flag on zext instructions.

    Calling this function on other instructions is safe and results in a no-op.

    -
    source

    pub fn get_disjoint_flag(self) -> Option<bool>

    Checks if an or instruction has the disjoint flag set.

    +
    source

    pub fn get_disjoint_flag(self) -> Option<bool>

    Checks if an or instruction has the disjoint flag set.

    Calling this function on other instructions is safe and returns None.

    -
    source

    pub fn set_disjoint_flag(self, flag: bool)

    Set the disjoint flag on or instructions.

    +
    source

    pub fn set_disjoint_flag(self, flag: bool)

    Set the disjoint flag on or instructions.

    Calling this function on other instructions is safe and results in a no-op.

    -
    source

    pub fn replace_all_uses_with(self, other: &InstructionValue<'ctx>)

    source

    pub fn get_volatile(self) -> Result<bool, &'static str>

    Returns whether or not a memory access instruction is volatile.

    -
    source

    pub fn set_volatile(self, volatile: bool) -> Result<(), &'static str>

    Sets whether or not a memory access instruction is volatile.

    -
    source

    pub fn get_allocated_type(self) -> Result<BasicTypeEnum<'ctx>, &'static str>

    Returns the type that is allocated by the alloca instruction.

    -
    source

    pub fn get_alignment(self) -> Result<u32, &'static str>

    Returns alignment on a memory access instruction or alloca.

    -
    source

    pub fn set_alignment(self, alignment: u32) -> Result<(), &'static str>

    Sets alignment on a memory access instruction or alloca.

    -
    source

    pub fn get_atomic_ordering(self) -> Result<AtomicOrdering, &'static str>

    Returns atomic ordering on a memory access instruction.

    -
    source

    pub fn set_atomic_ordering( +

    source

    pub fn replace_all_uses_with(self, other: &InstructionValue<'ctx>)

    source

    pub fn get_volatile(self) -> Result<bool, &'static str>

    Returns whether or not a memory access instruction is volatile.

    +
    source

    pub fn set_volatile(self, volatile: bool) -> Result<(), &'static str>

    Sets whether or not a memory access instruction is volatile.

    +
    source

    pub fn get_allocated_type(self) -> Result<BasicTypeEnum<'ctx>, &'static str>

    Returns the type that is allocated by the alloca instruction.

    +
    source

    pub fn get_alignment(self) -> Result<u32, &'static str>

    Returns alignment on a memory access instruction or alloca.

    +
    source

    pub fn set_alignment(self, alignment: u32) -> Result<(), &'static str>

    Sets alignment on a memory access instruction or alloca.

    +
    source

    pub fn get_atomic_ordering(self) -> Result<AtomicOrdering, &'static str>

    Returns atomic ordering on a memory access instruction.

    +
    source

    pub fn set_atomic_ordering( self, ordering: AtomicOrdering ) -> Result<(), &'static str>

    Sets atomic ordering on a memory access instruction.

    -
    source

    pub fn get_num_operands(self) -> u32

    Obtains the number of operands an InstructionValue has. +

    source

    pub fn get_num_operands(self) -> u32

    Obtains the number of operands an InstructionValue has. An operand is a BasicValue used in an IR instruction.

    The following example,

    @@ -61,7 +63,7 @@ An operand is a BasicValue used in an IR instruction.

    builder.position_at_end(basic_block); let arg1 = function.get_first_param().unwrap().into_pointer_value(); -let f32_val = f32_type.const_float(::std::f64::consts::PI); +let f32_val = f32_type.const_float(std::f64::consts::PI); let store_instruction = builder.build_store(arg1, f32_val).unwrap(); let free_instruction = builder.build_free(arg1).unwrap(); let return_instruction = builder.build_return(None).unwrap(); @@ -91,7 +93,7 @@ declare void @free(i8*)
  • Void return has zero: void is not a value and does not count as an operand even though the return instruction can take values.
    • -
    source

    pub fn get_operand( +

    source

    pub fn get_operand( self, index: u32 ) -> Option<Either<BasicValueEnum<'ctx>, BasicBlock<'ctx>>>

    Obtains the operand an InstructionValue has at a given index if any. @@ -118,7 +120,7 @@ An operand is a BasicValue used in an IR instruction.

    builder.position_at_end(basic_block); let arg1 = function.get_first_param().unwrap().into_pointer_value(); -let f32_val = f32_type.const_float(::std::f64::consts::PI); +let f32_val = f32_type.const_float(std::f64::consts::PI); let store_instruction = builder.build_store(arg1, f32_val).unwrap(); let free_instruction = builder.build_free(arg1).unwrap(); let return_instruction = builder.build_return(None).unwrap(); @@ -153,14 +155,14 @@ declare void @free(i8*)
  • Void return has zero: void is not a value and does not count as an operand even though the return instruction can take values.
    • -
    source

    pub unsafe fn get_operand_unchecked( +

    source

    pub unsafe fn get_operand_unchecked( self, index: u32 ) -> Option<Either<BasicValueEnum<'ctx>, BasicBlock<'ctx>>>

    Get the operand of an InstructionValue.

    §Safety

    The index must be less than InstructionValue::get_num_operands.

    -
    source

    pub fn get_operands(self) -> OperandIter<'ctx> ⓘ

    Get an instruction value operand iterator.

    -
    source

    pub fn set_operand<BV: BasicValue<'ctx>>(self, index: u32, val: BV) -> bool

    Sets the operand an InstructionValue has at a given index if possible. +

    source

    pub fn get_operands(self) -> OperandIter<'ctx> ⓘ

    Get an instruction value operand iterator.

    +
    source

    pub fn set_operand<BV: BasicValue<'ctx>>(self, index: u32, val: BV) -> bool

    Sets the operand an InstructionValue has at a given index if possible. An operand is a BasicValue used in an IR instruction.

    use inkwell::AddressSpace;
@@ -183,7 +185,7 @@ An operand is a BasicValue used in an IR instruction.
    
 builder.position_at_end(basic_block);
 
 let arg1 = function.get_first_param().unwrap().into_pointer_value();
-let f32_val = f32_type.const_float(::std::f64::consts::PI);
+let f32_val = f32_type.const_float(std::f64::consts::PI);
 let store_instruction = builder.build_store(arg1, f32_val).unwrap();
 let free_instruction = builder.build_free(arg1).unwrap();
 let return_instruction = builder.build_return(None).unwrap();
@@ -192,7 +194,7 @@ builder.position_at_end(basic_block);
 free_instruction.set_operand(0, f32_val);
 
 assert_eq!(free_instruction.get_operand(0).unwrap().left().unwrap(), f32_val);
    -
    source

    pub fn get_operand_use(self, index: u32) -> Option<BasicValueUse<'ctx>>

    Gets the use of an operand(BasicValue), if any.

    +
    source

    pub fn get_operand_use(self, index: u32) -> Option<BasicValueUse<'ctx>>

    Gets the use of an operand(BasicValue), if any.

    use inkwell::AddressSpace;
 use inkwell::context::Context;
@@ -215,20 +217,20 @@ builder.position_at_end(basic_block);
 builder.position_at_end(basic_block);
 
 let arg1 = function.get_first_param().unwrap().into_pointer_value();
-let f32_val = f32_type.const_float(::std::f64::consts::PI);
+let f32_val = f32_type.const_float(std::f64::consts::PI);
 let store_instruction = builder.build_store(arg1, f32_val).unwrap();
 let free_instruction = builder.build_free(arg1).unwrap();
 let return_instruction = builder.build_return(None).unwrap();
 
 assert_eq!(store_instruction.get_operand_use(1), arg1.get_first_use());
    -
    source

    pub unsafe fn get_operand_use_unchecked( +

    source

    pub unsafe fn get_operand_use_unchecked( self, index: u32 ) -> Option<BasicValueUse<'ctx>>

    Gets the use of an operand(BasicValue), if any.

    §Safety

    The index must be smaller than InstructionValue::get_num_operands.

    -
    source

    pub fn get_operand_uses(self) -> OperandUseIter<'ctx> ⓘ

    Get an instruction value operand use iterator.

    -
    source

    pub fn get_first_use(self) -> Option<BasicValueUse<'ctx>>

    Gets the first use of an InstructionValue if any.

    +
    source

    pub fn get_operand_uses(self) -> OperandUseIter<'ctx> ⓘ

    Get an instruction value operand use iterator.

    +
    source

    pub fn get_first_use(self) -> Option<BasicValueUse<'ctx>>

    Gets the first use of an InstructionValue if any.

    The following example,

    use inkwell::AddressSpace;
@@ -252,42 +254,40 @@ builder.position_at_end(basic_block);
 builder.position_at_end(basic_block);
 
 let arg1 = function.get_first_param().unwrap().into_pointer_value();
-let f32_val = f32_type.const_float(::std::f64::consts::PI);
+let f32_val = f32_type.const_float(std::f64::consts::PI);
 let store_instruction = builder.build_store(arg1, f32_val).unwrap();
 let free_instruction = builder.build_free(arg1).unwrap();
 let return_instruction = builder.build_return(None).unwrap();
 
 assert!(arg1.get_first_use().is_some());
    -
    source

    pub fn get_icmp_predicate(self) -> Option<IntPredicate>

    Gets the predicate of an ICmp InstructionValue. +

    source

    pub fn get_icmp_predicate(self) -> Option<IntPredicate>

    Gets the predicate of an ICmp InstructionValue. For instance, in the LLVM instruction %3 = icmp slt i32 %0, %1 this gives the slt.

    If the instruction is not an ICmp, this returns None.

    -
    source

    pub fn get_fcmp_predicate(self) -> Option<FloatPredicate>

    Gets the predicate of an FCmp InstructionValue. +

    source

    pub fn get_fcmp_predicate(self) -> Option<FloatPredicate>

    Gets the predicate of an FCmp InstructionValue. For instance, in the LLVM instruction %3 = fcmp olt float %0, %1 this gives the olt.

    If the instruction is not an FCmp, this returns None.

    -
    source

    pub fn has_metadata(self) -> bool

    Determines whether or not this Instruction has any associated metadata.

    -
    source

    pub fn get_metadata(self, kind_id: u32) -> Option<MetadataValue<'ctx>>

    Gets the MetadataValue associated with this Instruction at a specific +

    source

    pub fn has_metadata(self) -> bool

    Determines whether or not this Instruction has any associated metadata.

    +
    source

    pub fn get_metadata(self, kind_id: u32) -> Option<MetadataValue<'ctx>>

    Gets the MetadataValue associated with this Instruction at a specific kind_id.

    -
    source

    pub fn set_metadata( +

    source

    pub fn set_metadata( self, metadata: MetadataValue<'ctx>, kind_id: u32 ) -> Result<(), &'static str>

    Determines whether or not this Instruction has any associated metadata kind_id.

    -

    Trait Implementations§

    source§

    impl<'ctx> AnyValue<'ctx> for InstructionValue<'ctx>

    source§

    fn as_any_value_enum(&self) -> AnyValueEnum<'ctx>

    Returns an enum containing a typed version of AnyValue.
    source§

    fn print_to_string(&self) -> LLVMString

    Prints a value to a LLVMString
    source§

    fn is_poison(&self) -> bool

    Returns whether the value is poison
    source§

    impl AsValueRef for InstructionValue<'_>

    source§

    fn as_value_ref(&self) -> LLVMValueRef

    source§

    impl Clone for InstructionValue<'_>

    source§

    fn clone(&self) -> Self

    Creates a clone of this InstructionValue, and returns it. -The clone will have no parent, and no name.

    -
    1.0.0 · source§

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

    Performs copy-assignment from source. Read more
    source§

    impl<'ctx> Debug for InstructionValue<'ctx>

    source§

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

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

    impl Display for InstructionValue<'_>

    source§

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

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

    impl<'ctx> From<InstructionValue<'ctx>> for AnyValueEnum<'ctx>

    source§

    fn from(value: InstructionValue<'_>) -> AnyValueEnum<'_>

    Converts to this type from the input type.
    source§

    impl<'ctx> Hash for InstructionValue<'ctx>

    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<'ctx> AnyValue<'ctx> for InstructionValue<'ctx>

    source§

    fn as_any_value_enum(&self) -> AnyValueEnum<'ctx>

    Returns an enum containing a typed version of AnyValue.
    source§

    fn print_to_string(&self) -> LLVMString

    Prints a value to a LLVMString
    source§

    fn is_poison(&self) -> bool

    Returns whether the value is poison
    source§

    impl AsValueRef for InstructionValue<'_>

    source§

    fn as_value_ref(&self) -> LLVMValueRef

    source§

    impl<'ctx> Clone for InstructionValue<'ctx>

    source§

    fn clone(&self) -> InstructionValue<'ctx>

    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<'ctx> Debug for InstructionValue<'ctx>

    source§

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

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

    impl Display for InstructionValue<'_>

    source§

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

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

    impl<'ctx> From<InstructionValue<'ctx>> for AnyValueEnum<'ctx>

    source§

    fn from(value: InstructionValue<'_>) -> AnyValueEnum<'_>

    Converts to this type from the input type.
    source§

    impl<'ctx> Hash for InstructionValue<'ctx>

    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<'ctx> PartialEq<AnyValueEnum<'ctx>> for InstructionValue<'ctx>

    source§

    fn eq(&self, other: &AnyValueEnum<'ctx>) -> bool

    This method tests for self and other values to be equal, and is used by ==.
    1.0.0 · source§

    fn ne(&self, other: &Rhs) -> bool

    This method tests for !=. The default implementation is almost always -sufficient, and should not be overridden without very good reason.
    source§

    impl<'ctx> PartialEq<InstructionValue<'ctx>> for AnyValueEnum<'ctx>

    source§

    fn eq(&self, other: &InstructionValue<'ctx>) -> bool

    This method tests for self and other values to be equal, and is used -by ==.
    1.0.0 · source§

    fn ne(&self, other: &Rhs) -> bool

    This method tests for !=. The default implementation is almost always -sufficient, and should not be overridden without very good reason.
    source§

    impl<'ctx> PartialEq for InstructionValue<'ctx>

    source§

    fn eq(&self, other: &InstructionValue<'ctx>) -> 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<'ctx> PartialEq<InstructionValue<'ctx>> for AnyValueEnum<'ctx>

    source§

    fn eq(&self, other: &InstructionValue<'ctx>) -> bool

    This method tests for self and other values to be equal, and is used by ==.
    1.0.0 · source§

    fn ne(&self, other: &Rhs) -> bool

    This method tests for !=. The default implementation is almost always -sufficient, and should not be overridden without very good reason.
    source§

    impl<'ctx> TryFrom<AnyValueEnum<'ctx>> for InstructionValue<'ctx>

    §

    type Error = ()

    The type returned in the event of a conversion error.
    source§

    fn try_from(value: AnyValueEnum<'ctx>) -> Result<Self, Self::Error>

    Performs the conversion.
    source§

    impl<'ctx> TryFrom<InstructionValue<'ctx>> for FloatValue<'ctx>

    §

    type Error = ()

    The type returned in the event of a conversion error.
    source§

    fn try_from(value: InstructionValue<'_>) -> Result<Self, Self::Error>

    Performs the conversion.
    source§

    impl<'ctx> TryFrom<InstructionValue<'ctx>> for IntValue<'ctx>

    §

    type Error = ()

    The type returned in the event of a conversion error.
    source§

    fn try_from(value: InstructionValue<'_>) -> Result<Self, Self::Error>

    Performs the conversion.
    source§

    impl<'ctx> TryFrom<InstructionValue<'ctx>> for PhiValue<'ctx>

    §

    type Error = ()

    The type returned in the event of a conversion error.
    source§

    fn try_from(value: InstructionValue<'_>) -> Result<Self, Self::Error>

    Performs the conversion.
    source§

    impl<'ctx> TryFrom<InstructionValue<'ctx>> for PointerValue<'ctx>

    §

    type Error = ()

    The type returned in the event of a conversion error.
    source§

    fn try_from(value: InstructionValue<'_>) -> Result<Self, Self::Error>

    Performs the conversion.
    source§

    impl<'ctx> Copy for InstructionValue<'ctx>

    source§

    impl<'ctx> Eq for InstructionValue<'ctx>

    source§

    impl<'ctx> StructuralPartialEq for InstructionValue<'ctx>

    Auto Trait Implementations§

    §

    impl<'ctx> Freeze for InstructionValue<'ctx>

    §

    impl<'ctx> RefUnwindSafe for InstructionValue<'ctx>

    §

    impl<'ctx> !Send for InstructionValue<'ctx>

    §

    impl<'ctx> !Sync for InstructionValue<'ctx>

    §

    impl<'ctx> Unpin for InstructionValue<'ctx>

    §

    impl<'ctx> UnwindSafe for InstructionValue<'ctx>

    Blanket Implementations§

    source§

    impl<T> Any for T
    where +sufficient, and should not be overridden without very good reason.

    source§

    impl<'ctx> PartialEq for InstructionValue<'ctx>

    source§

    fn eq(&self, other: &InstructionValue<'ctx>) -> bool

    This method tests for self and other values to be equal, and is used +by ==.
    1.0.0 · source§

    fn ne(&self, other: &Rhs) -> bool

    This method tests for !=. The default implementation is almost always +sufficient, and should not be overridden without very good reason.
    source§

    impl<'ctx> TryFrom<AnyValueEnum<'ctx>> for InstructionValue<'ctx>

    §

    type Error = ()

    The type returned in the event of a conversion error.
    source§

    fn try_from(value: AnyValueEnum<'ctx>) -> Result<Self, Self::Error>

    Performs the conversion.
    source§

    impl<'ctx> TryFrom<InstructionValue<'ctx>> for FloatValue<'ctx>

    §

    type Error = ()

    The type returned in the event of a conversion error.
    source§

    fn try_from(value: InstructionValue<'_>) -> Result<Self, Self::Error>

    Performs the conversion.
    source§

    impl<'ctx> TryFrom<InstructionValue<'ctx>> for IntValue<'ctx>

    §

    type Error = ()

    The type returned in the event of a conversion error.
    source§

    fn try_from(value: InstructionValue<'_>) -> Result<Self, Self::Error>

    Performs the conversion.
    source§

    impl<'ctx> TryFrom<InstructionValue<'ctx>> for PhiValue<'ctx>

    §

    type Error = ()

    The type returned in the event of a conversion error.
    source§

    fn try_from(value: InstructionValue<'_>) -> Result<Self, Self::Error>

    Performs the conversion.
    source§

    impl<'ctx> TryFrom<InstructionValue<'ctx>> for PointerValue<'ctx>

    §

    type Error = ()

    The type returned in the event of a conversion error.
    source§

    fn try_from(value: InstructionValue<'_>) -> Result<Self, Self::Error>

    Performs the conversion.
    source§

    impl<'ctx> Copy for InstructionValue<'ctx>

    source§

    impl<'ctx> Eq for InstructionValue<'ctx>

    source§

    impl<'ctx> StructuralPartialEq for InstructionValue<'ctx>

    Auto Trait Implementations§

    §

    impl<'ctx> Freeze for InstructionValue<'ctx>

    §

    impl<'ctx> RefUnwindSafe for InstructionValue<'ctx>

    §

    impl<'ctx> !Send for InstructionValue<'ctx>

    §

    impl<'ctx> !Sync for InstructionValue<'ctx>

    §

    impl<'ctx> Unpin for InstructionValue<'ctx>

    §

    impl<'ctx> UnwindSafe for InstructionValue<'ctx>

    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/inkwell/values/struct.IntValue.html b/inkwell/values/struct.IntValue.html index 5d9091bd9..3da4126b4 100644 --- a/inkwell/values/struct.IntValue.html +++ b/inkwell/values/struct.IntValue.html @@ -52,23 +52,23 @@ example the address of a function casted to an integer.

    assert_eq!(i8_all_ones.get_sign_extended_constant(), Some(-1));
    source

    pub fn replace_all_uses_with(self, other: IntValue<'ctx>)

    Trait Implementations§

    source§

    impl<'ctx> AnyValue<'ctx> for IntValue<'ctx>

    source§

    fn as_any_value_enum(&self) -> AnyValueEnum<'ctx>

    Returns an enum containing a typed version of AnyValue.
    source§

    fn print_to_string(&self) -> LLVMString

    Prints a value to a LLVMString
    source§

    fn is_poison(&self) -> bool

    Returns whether the value is poison
    source§

    impl AsValueRef for IntValue<'_>

    source§

    fn as_value_ref(&self) -> LLVMValueRef

    source§

    impl<'ctx> BasicValue<'ctx> for IntValue<'ctx>

    source§

    fn as_basic_value_enum(&self) -> BasicValueEnum<'ctx>

    Returns an enum containing a typed version of the BasicValue.
    source§

    fn as_instruction_value(&self) -> Option<InstructionValue<'ctx>>

    Most BasicValues are the byproduct of an instruction -and so are convertible into an InstructionValue
    source§

    fn get_first_use(&self) -> Option<BasicValueUse<'_>>

    source§

    fn set_name(&self, name: &str)

    Sets the name of a BasicValue. If the value is a constant, this is a noop.
    source§

    impl<'ctx> Clone for IntValue<'ctx>

    source§

    fn clone(&self) -> IntValue<'ctx>

    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<'ctx> Debug for IntValue<'ctx>

    source§

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

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

    impl Display for IntValue<'_>

    source§

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

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

    impl<'ctx> From<IntValue<'ctx>> for AnyValueEnum<'ctx>

    source§

    fn from(value: IntValue<'_>) -> AnyValueEnum<'_>

    Converts to this type from the input type.
    source§

    impl<'ctx> From<IntValue<'ctx>> for BasicMetadataValueEnum<'ctx>

    source§

    fn from(value: IntValue<'_>) -> BasicMetadataValueEnum<'_>

    Converts to this type from the input type.
    source§

    impl<'ctx> From<IntValue<'ctx>> for BasicValueEnum<'ctx>

    source§

    fn from(value: IntValue<'_>) -> BasicValueEnum<'_>

    Converts to this type from the input type.
    source§

    impl<'ctx> Hash for IntValue<'ctx>

    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 +and so are convertible into an InstructionValue

    source§

    fn get_first_use(&self) -> Option<BasicValueUse<'_>>

    source§

    fn set_name(&self, name: &str)

    Sets the name of a BasicValue. If the value is a constant, this is a noop.
    source§

    impl<'ctx> Clone for IntValue<'ctx>

    source§

    fn clone(&self) -> IntValue<'ctx>

    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<'ctx> Debug for IntValue<'ctx>

    source§

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

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

    impl Display for IntValue<'_>

    source§

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

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

    impl<'ctx> From<IntValue<'ctx>> for AnyValueEnum<'ctx>

    source§

    fn from(value: IntValue<'_>) -> AnyValueEnum<'_>

    Converts to this type from the input type.
    source§

    impl<'ctx> From<IntValue<'ctx>> for BasicMetadataValueEnum<'ctx>

    source§

    fn from(value: IntValue<'_>) -> BasicMetadataValueEnum<'_>

    Converts to this type from the input type.
    source§

    impl<'ctx> From<IntValue<'ctx>> for BasicValueEnum<'ctx>

    source§

    fn from(value: IntValue<'_>) -> BasicValueEnum<'_>

    Converts to this type from the input type.
    source§

    impl<'ctx> Hash for IntValue<'ctx>

    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<'ctx> IntMathValue<'ctx> for IntValue<'ctx>

    §

    type BaseType = IntType<'ctx>

    source§

    unsafe fn new(value: LLVMValueRef) -> IntValue<'ctx>

    source§

    impl<'ctx> PartialEq<AnyValueEnum<'ctx>> for IntValue<'ctx>

    source§

    fn eq(&self, other: &AnyValueEnum<'ctx>) -> bool

    This method tests for self and other values to be equal, and is used -by ==.
    1.0.0 · source§

    fn ne(&self, other: &Rhs) -> bool

    This method tests for !=. The default implementation is almost always -sufficient, and should not be overridden without very good reason.
    source§

    impl<'ctx> PartialEq<BasicMetadataValueEnum<'ctx>> for IntValue<'ctx>

    source§

    fn eq(&self, other: &BasicMetadataValueEnum<'ctx>) -> bool

    This method tests for self and other values to be equal, and is used -by ==.
    1.0.0 · source§

    fn ne(&self, other: &Rhs) -> bool

    This method tests for !=. The default implementation is almost always -sufficient, and should not be overridden without very good reason.
    source§

    impl<'ctx> PartialEq<BasicValueEnum<'ctx>> for IntValue<'ctx>

    source§

    fn eq(&self, other: &BasicValueEnum<'ctx>) -> bool

    This method tests for self and other values to be equal, and is used -by ==.
    1.0.0 · source§

    fn ne(&self, other: &Rhs) -> bool

    This method tests for !=. The default implementation is almost always -sufficient, and should not be overridden without very good reason.
    source§

    impl<'ctx> PartialEq<IntValue<'ctx>> for AnyValueEnum<'ctx>

    source§

    fn eq(&self, other: &IntValue<'ctx>) -> bool

    This method tests for self and other values to be equal, and is used -by ==.
    1.0.0 · source§

    fn ne(&self, other: &Rhs) -> bool

    This method tests for !=. The default implementation is almost always -sufficient, and should not be overridden without very good reason.
    source§

    impl<'ctx> PartialEq<IntValue<'ctx>> for BasicMetadataValueEnum<'ctx>

    source§

    fn eq(&self, other: &IntValue<'ctx>) -> bool

    This method tests for self and other values to be equal, and is used -by ==.
    1.0.0 · source§

    fn ne(&self, other: &Rhs) -> bool

    This method tests for !=. The default implementation is almost always -sufficient, and should not be overridden without very good reason.
    source§

    impl<'ctx> PartialEq<IntValue<'ctx>> for BasicValueEnum<'ctx>

    source§

    fn eq(&self, other: &IntValue<'ctx>) -> bool

    This method tests for self and other values to be equal, and is used + Self: Sized,
    Feeds a slice of this type into the given Hasher. Read more
    source§

    impl<'ctx> IntMathValue<'ctx> for IntValue<'ctx>

    §

    type BaseType = IntType<'ctx>

    source§

    unsafe fn new(value: LLVMValueRef) -> IntValue<'ctx>

    source§

    impl<'ctx> PartialEq<AnyValueEnum<'ctx>> for IntValue<'ctx>

    source§

    fn eq(&self, other: &AnyValueEnum<'ctx>) -> bool

    This method tests for self and other values to be equal, and is used by ==.
    1.0.0 · source§

    fn ne(&self, other: &Rhs) -> bool

    This method tests for !=. The default implementation is almost always -sufficient, and should not be overridden without very good reason.
    source§

    impl<'ctx> PartialEq for IntValue<'ctx>

    source§

    fn eq(&self, other: &IntValue<'ctx>) -> 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<'ctx> PartialEq<BasicMetadataValueEnum<'ctx>> for IntValue<'ctx>

    source§

    fn eq(&self, other: &BasicMetadataValueEnum<'ctx>) -> bool

    This method tests for self and other values to be equal, and is used by ==.
    1.0.0 · source§

    fn ne(&self, other: &Rhs) -> bool

    This method tests for !=. The default implementation is almost always -sufficient, and should not be overridden without very good reason.
    source§

    impl<'ctx> TryFrom<AnyValueEnum<'ctx>> for IntValue<'ctx>

    §

    type Error = ()

    The type returned in the event of a conversion error.
    source§

    fn try_from(value: AnyValueEnum<'ctx>) -> Result<Self, Self::Error>

    Performs the conversion.
    source§

    impl<'ctx> TryFrom<BasicMetadataValueEnum<'ctx>> for IntValue<'ctx>

    §

    type Error = ()

    The type returned in the event of a conversion error.
    source§

    fn try_from(value: BasicMetadataValueEnum<'ctx>) -> Result<Self, Self::Error>

    Performs the conversion.
    source§

    impl<'ctx> TryFrom<BasicValueEnum<'ctx>> for IntValue<'ctx>

    §

    type Error = ()

    The type returned in the event of a conversion error.
    source§

    fn try_from(value: BasicValueEnum<'ctx>) -> Result<Self, Self::Error>

    Performs the conversion.
    source§

    impl<'ctx> TryFrom<InstructionValue<'ctx>> for IntValue<'ctx>

    §

    type Error = ()

    The type returned in the event of a conversion error.
    source§

    fn try_from(value: InstructionValue<'_>) -> Result<Self, Self::Error>

    Performs the conversion.
    source§

    impl<'ctx> Copy for IntValue<'ctx>

    source§

    impl<'ctx> Eq for IntValue<'ctx>

    source§

    impl<'ctx> StructuralPartialEq for IntValue<'ctx>

    Auto Trait Implementations§

    §

    impl<'ctx> Freeze for IntValue<'ctx>

    §

    impl<'ctx> RefUnwindSafe for IntValue<'ctx>

    §

    impl<'ctx> !Send for IntValue<'ctx>

    §

    impl<'ctx> !Sync for IntValue<'ctx>

    §

    impl<'ctx> Unpin for IntValue<'ctx>

    §

    impl<'ctx> UnwindSafe for IntValue<'ctx>

    Blanket Implementations§

    source§

    impl<T> Any for T
    where +sufficient, and should not be overridden without very good reason.

    source§

    impl<'ctx> PartialEq<BasicValueEnum<'ctx>> for IntValue<'ctx>

    source§

    fn eq(&self, other: &BasicValueEnum<'ctx>) -> bool

    This method tests for self and other values to be equal, and is used +by ==.
    1.0.0 · source§

    fn ne(&self, other: &Rhs) -> bool

    This method tests for !=. The default implementation is almost always +sufficient, and should not be overridden without very good reason.
    source§

    impl<'ctx> PartialEq<IntValue<'ctx>> for AnyValueEnum<'ctx>

    source§

    fn eq(&self, other: &IntValue<'ctx>) -> bool

    This method tests for self and other values to be equal, and is used +by ==.
    1.0.0 · source§

    fn ne(&self, other: &Rhs) -> bool

    This method tests for !=. The default implementation is almost always +sufficient, and should not be overridden without very good reason.
    source§

    impl<'ctx> PartialEq<IntValue<'ctx>> for BasicMetadataValueEnum<'ctx>

    source§

    fn eq(&self, other: &IntValue<'ctx>) -> bool

    This method tests for self and other values to be equal, and is used +by ==.
    1.0.0 · source§

    fn ne(&self, other: &Rhs) -> bool

    This method tests for !=. The default implementation is almost always +sufficient, and should not be overridden without very good reason.
    source§

    impl<'ctx> PartialEq<IntValue<'ctx>> for BasicValueEnum<'ctx>

    source§

    fn eq(&self, other: &IntValue<'ctx>) -> bool

    This method tests for self and other values to be equal, and is used +by ==.
    1.0.0 · source§

    fn ne(&self, other: &Rhs) -> bool

    This method tests for !=. The default implementation is almost always +sufficient, and should not be overridden without very good reason.
    source§

    impl<'ctx> PartialEq for IntValue<'ctx>

    source§

    fn eq(&self, other: &IntValue<'ctx>) -> bool

    This method tests for self and other values to be equal, and is used +by ==.
    1.0.0 · source§

    fn ne(&self, other: &Rhs) -> bool

    This method tests for !=. The default implementation is almost always +sufficient, and should not be overridden without very good reason.
    source§

    impl<'ctx> TryFrom<AnyValueEnum<'ctx>> for IntValue<'ctx>

    §

    type Error = ()

    The type returned in the event of a conversion error.
    source§

    fn try_from(value: AnyValueEnum<'ctx>) -> Result<Self, Self::Error>

    Performs the conversion.
    source§

    impl<'ctx> TryFrom<BasicMetadataValueEnum<'ctx>> for IntValue<'ctx>

    §

    type Error = ()

    The type returned in the event of a conversion error.
    source§

    fn try_from(value: BasicMetadataValueEnum<'ctx>) -> Result<Self, Self::Error>

    Performs the conversion.
    source§

    impl<'ctx> TryFrom<BasicValueEnum<'ctx>> for IntValue<'ctx>

    §

    type Error = ()

    The type returned in the event of a conversion error.
    source§

    fn try_from(value: BasicValueEnum<'ctx>) -> Result<Self, Self::Error>

    Performs the conversion.
    source§

    impl<'ctx> TryFrom<InstructionValue<'ctx>> for IntValue<'ctx>

    §

    type Error = ()

    The type returned in the event of a conversion error.
    source§

    fn try_from(value: InstructionValue<'_>) -> Result<Self, Self::Error>

    Performs the conversion.
    source§

    impl<'ctx> Copy for IntValue<'ctx>

    source§

    impl<'ctx> Eq for IntValue<'ctx>

    source§

    impl<'ctx> StructuralPartialEq for IntValue<'ctx>

    Auto Trait Implementations§

    §

    impl<'ctx> Freeze for IntValue<'ctx>

    §

    impl<'ctx> RefUnwindSafe for IntValue<'ctx>

    §

    impl<'ctx> !Send for IntValue<'ctx>

    §

    impl<'ctx> !Sync for IntValue<'ctx>

    §

    impl<'ctx> Unpin for IntValue<'ctx>

    §

    impl<'ctx> UnwindSafe for IntValue<'ctx>

    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/inkwell/values/struct.MetadataValue.html b/inkwell/values/struct.MetadataValue.html index f49fb8616..8ce0cd19d 100644 --- a/inkwell/values/struct.MetadataValue.html +++ b/inkwell/values/struct.MetadataValue.html @@ -1,21 +1,21 @@ MetadataValue in inkwell::values - Rust
    -

    Struct inkwell::values::MetadataValue

    source · 
    pub struct MetadataValue<'ctx> { /* private fields */ }

    Implementations§

    source§

    impl<'ctx> MetadataValue<'ctx>

    source

    pub unsafe fn new(value: LLVMValueRef) -> Self

    Get a value from an LLVMValueRef.

    +

    Struct inkwell::values::MetadataValue

    source · 
    pub struct MetadataValue<'ctx> { /* private fields */ }

    Implementations§

    source§

    impl<'ctx> MetadataValue<'ctx>

    source

    pub unsafe fn new(value: LLVMValueRef) -> Self

    Get a value from an LLVMValueRef.

    §Safety

    The ref must be valid and of type metadata.

    -
    source

    pub fn get_name(&self) -> &CStr

    Get name of the MetadataValue.

    -
    source

    pub fn is_node(self) -> bool

    source

    pub fn is_string(self) -> bool

    source

    pub fn get_string_value(&self) -> Option<&CStr>

    source

    pub fn get_node_size(self) -> u32

    source

    pub fn get_node_values(self) -> Vec<BasicMetadataValueEnum<'ctx>>

    source

    pub fn print_to_stderr(self)

    source

    pub fn replace_all_uses_with(self, other: &MetadataValue<'ctx>)

    Trait Implementations§

    source§

    impl<'ctx> AnyValue<'ctx> for MetadataValue<'ctx>

    source§

    fn as_any_value_enum(&self) -> AnyValueEnum<'ctx>

    Returns an enum containing a typed version of AnyValue.
    source§

    fn print_to_string(&self) -> LLVMString

    Prints a value to a LLVMString
    source§

    fn is_poison(&self) -> bool

    Returns whether the value is poison
    source§

    impl AsValueRef for MetadataValue<'_>

    source§

    fn as_value_ref(&self) -> LLVMValueRef

    source§

    impl<'ctx> Clone for MetadataValue<'ctx>

    source§

    fn clone(&self) -> MetadataValue<'ctx>

    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 MetadataValue<'_>

    source§

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

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

    impl Display for MetadataValue<'_>

    source§

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

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

    impl<'ctx> From<MetadataValue<'ctx>> for AnyValueEnum<'ctx>

    source§

    fn from(value: MetadataValue<'_>) -> AnyValueEnum<'_>

    Converts to this type from the input type.
    source§

    impl<'ctx> From<MetadataValue<'ctx>> for BasicMetadataValueEnum<'ctx>

    source§

    fn from(value: MetadataValue<'_>) -> BasicMetadataValueEnum<'_>

    Converts to this type from the input type.
    source§

    impl<'ctx> Hash for MetadataValue<'ctx>

    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

    pub fn get_name(&self) -> &CStr

    Get name of the MetadataValue.

    +
    source

    pub fn is_node(self) -> bool

    source

    pub fn is_string(self) -> bool

    source

    pub fn get_string_value(&self) -> Option<&CStr>

    source

    pub fn get_node_size(self) -> u32

    source

    pub fn get_node_values(self) -> Vec<BasicMetadataValueEnum<'ctx>>

    source

    pub fn print_to_stderr(self)

    source

    pub fn replace_all_uses_with(self, other: &MetadataValue<'ctx>)

    Trait Implementations§

    source§

    impl<'ctx> AnyValue<'ctx> for MetadataValue<'ctx>

    source§

    fn as_any_value_enum(&self) -> AnyValueEnum<'ctx>

    Returns an enum containing a typed version of AnyValue.
    source§

    fn print_to_string(&self) -> LLVMString

    Prints a value to a LLVMString
    source§

    fn is_poison(&self) -> bool

    Returns whether the value is poison
    source§

    impl AsValueRef for MetadataValue<'_>

    source§

    fn as_value_ref(&self) -> LLVMValueRef

    source§

    impl<'ctx> Clone for MetadataValue<'ctx>

    source§

    fn clone(&self) -> MetadataValue<'ctx>

    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 MetadataValue<'_>

    source§

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

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

    impl Display for MetadataValue<'_>

    source§

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

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

    impl<'ctx> From<MetadataValue<'ctx>> for AnyValueEnum<'ctx>

    source§

    fn from(value: MetadataValue<'_>) -> AnyValueEnum<'_>

    Converts to this type from the input type.
    source§

    impl<'ctx> From<MetadataValue<'ctx>> for BasicMetadataValueEnum<'ctx>

    source§

    fn from(value: MetadataValue<'_>) -> BasicMetadataValueEnum<'_>

    Converts to this type from the input type.
    source§

    impl<'ctx> Hash for MetadataValue<'ctx>

    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<'ctx> PartialEq<AnyValueEnum<'ctx>> for MetadataValue<'ctx>

    source§

    fn eq(&self, other: &AnyValueEnum<'ctx>) -> bool

    This method tests for self and other values to be equal, and is used -by ==.
    1.0.0 · source§

    fn ne(&self, other: &Rhs) -> bool

    This method tests for !=. The default implementation is almost always -sufficient, and should not be overridden without very good reason.
    source§

    impl<'ctx> PartialEq<BasicMetadataValueEnum<'ctx>> for MetadataValue<'ctx>

    source§

    fn eq(&self, other: &BasicMetadataValueEnum<'ctx>) -> bool

    This method tests for self and other values to be equal, and is used -by ==.
    1.0.0 · source§

    fn ne(&self, other: &Rhs) -> bool

    This method tests for !=. The default implementation is almost always -sufficient, and should not be overridden without very good reason.
    source§

    impl<'ctx> PartialEq<MetadataValue<'ctx>> for AnyValueEnum<'ctx>

    source§

    fn eq(&self, other: &MetadataValue<'ctx>) -> bool

    This method tests for self and other values to be equal, and is used -by ==.
    1.0.0 · source§

    fn ne(&self, other: &Rhs) -> bool

    This method tests for !=. The default implementation is almost always -sufficient, and should not be overridden without very good reason.
    source§

    impl<'ctx> PartialEq<MetadataValue<'ctx>> for BasicMetadataValueEnum<'ctx>

    source§

    fn eq(&self, other: &MetadataValue<'ctx>) -> bool

    This method tests for self and other values to be equal, and is used -by ==.
    1.0.0 · source§

    fn ne(&self, other: &Rhs) -> bool

    This method tests for !=. The default implementation is almost always -sufficient, and should not be overridden without very good reason.
    source§

    impl<'ctx> PartialEq for MetadataValue<'ctx>

    source§

    fn eq(&self, other: &MetadataValue<'ctx>) -> bool

    This method tests for self and other values to be equal, and is used + Self: Sized,
    Feeds a slice of this type into the given Hasher. Read more
    source§

    impl<'ctx> PartialEq<AnyValueEnum<'ctx>> for MetadataValue<'ctx>

    source§

    fn eq(&self, other: &AnyValueEnum<'ctx>) -> bool

    This method tests for self and other values to be equal, and is used by ==.
    1.0.0 · source§

    fn ne(&self, other: &Rhs) -> bool

    This method tests for !=. The default implementation is almost always -sufficient, and should not be overridden without very good reason.
    source§

    impl<'ctx> TryFrom<AnyValueEnum<'ctx>> for MetadataValue<'ctx>

    §

    type Error = ()

    The type returned in the event of a conversion error.
    source§

    fn try_from(value: AnyValueEnum<'ctx>) -> Result<Self, Self::Error>

    Performs the conversion.
    source§

    impl<'ctx> TryFrom<BasicMetadataValueEnum<'ctx>> for MetadataValue<'ctx>

    §

    type Error = ()

    The type returned in the event of a conversion error.
    source§

    fn try_from(value: BasicMetadataValueEnum<'ctx>) -> Result<Self, Self::Error>

    Performs the conversion.
    source§

    impl<'ctx> Copy for MetadataValue<'ctx>

    source§

    impl<'ctx> Eq for MetadataValue<'ctx>

    source§

    impl<'ctx> StructuralPartialEq for MetadataValue<'ctx>

    Auto Trait Implementations§

    §

    impl<'ctx> Freeze for MetadataValue<'ctx>

    §

    impl<'ctx> RefUnwindSafe for MetadataValue<'ctx>

    §

    impl<'ctx> !Send for MetadataValue<'ctx>

    §

    impl<'ctx> !Sync for MetadataValue<'ctx>

    §

    impl<'ctx> Unpin for MetadataValue<'ctx>

    §

    impl<'ctx> UnwindSafe for MetadataValue<'ctx>

    Blanket Implementations§

    source§

    impl<T> Any for T
    where +sufficient, and should not be overridden without very good reason.

    source§

    impl<'ctx> PartialEq<BasicMetadataValueEnum<'ctx>> for MetadataValue<'ctx>

    source§

    fn eq(&self, other: &BasicMetadataValueEnum<'ctx>) -> bool

    This method tests for self and other values to be equal, and is used +by ==.
    1.0.0 · source§

    fn ne(&self, other: &Rhs) -> bool

    This method tests for !=. The default implementation is almost always +sufficient, and should not be overridden without very good reason.
    source§

    impl<'ctx> PartialEq<MetadataValue<'ctx>> for AnyValueEnum<'ctx>

    source§

    fn eq(&self, other: &MetadataValue<'ctx>) -> bool

    This method tests for self and other values to be equal, and is used +by ==.
    1.0.0 · source§

    fn ne(&self, other: &Rhs) -> bool

    This method tests for !=. The default implementation is almost always +sufficient, and should not be overridden without very good reason.
    source§

    impl<'ctx> PartialEq<MetadataValue<'ctx>> for BasicMetadataValueEnum<'ctx>

    source§

    fn eq(&self, other: &MetadataValue<'ctx>) -> bool

    This method tests for self and other values to be equal, and is used +by ==.
    1.0.0 · source§

    fn ne(&self, other: &Rhs) -> bool

    This method tests for !=. The default implementation is almost always +sufficient, and should not be overridden without very good reason.
    source§

    impl<'ctx> PartialEq for MetadataValue<'ctx>

    source§

    fn eq(&self, other: &MetadataValue<'ctx>) -> bool

    This method tests for self and other values to be equal, and is used +by ==.
    1.0.0 · source§

    fn ne(&self, other: &Rhs) -> bool

    This method tests for !=. The default implementation is almost always +sufficient, and should not be overridden without very good reason.
    source§

    impl<'ctx> TryFrom<AnyValueEnum<'ctx>> for MetadataValue<'ctx>

    §

    type Error = ()

    The type returned in the event of a conversion error.
    source§

    fn try_from(value: AnyValueEnum<'ctx>) -> Result<Self, Self::Error>

    Performs the conversion.
    source§

    impl<'ctx> TryFrom<BasicMetadataValueEnum<'ctx>> for MetadataValue<'ctx>

    §

    type Error = ()

    The type returned in the event of a conversion error.
    source§

    fn try_from(value: BasicMetadataValueEnum<'ctx>) -> Result<Self, Self::Error>

    Performs the conversion.
    source§

    impl<'ctx> Copy for MetadataValue<'ctx>

    source§

    impl<'ctx> Eq for MetadataValue<'ctx>

    source§

    impl<'ctx> StructuralPartialEq for MetadataValue<'ctx>

    Auto Trait Implementations§

    §

    impl<'ctx> Freeze for MetadataValue<'ctx>

    §

    impl<'ctx> RefUnwindSafe for MetadataValue<'ctx>

    §

    impl<'ctx> !Send for MetadataValue<'ctx>

    §

    impl<'ctx> !Sync for MetadataValue<'ctx>

    §

    impl<'ctx> Unpin for MetadataValue<'ctx>

    §

    impl<'ctx> UnwindSafe for MetadataValue<'ctx>

    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/inkwell/values/struct.OperandIter.html b/inkwell/values/struct.OperandIter.html index 79ffb6a81..f050c6ebb 100644 --- a/inkwell/values/struct.OperandIter.html +++ b/inkwell/values/struct.OperandIter.html @@ -1,6 +1,6 @@ OperandIter in inkwell::values - Rust
    -

    Struct inkwell::values::OperandIter

    source · 
    pub struct OperandIter<'ctx> { /* private fields */ }
    Expand description

    Iterate over all the operands of an instruction value.

    -

    Trait Implementations§

    source§

    impl<'ctx> Debug for OperandIter<'ctx>

    source§

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

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

    impl<'ctx> Iterator for OperandIter<'ctx>

    §

    type Item = Option<Either<BasicValueEnum<'ctx>, BasicBlock<'ctx>>>

    The type of the elements being iterated over.
    source§

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

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

    fn next_chunk<const N: usize>( +

    Struct inkwell::values::OperandIter

    source · 
    pub struct OperandIter<'ctx> { /* private fields */ }
    Expand description

    Iterate over all the operands of an instruction value.

    +

    Trait Implementations§

    source§

    impl<'ctx> Debug for OperandIter<'ctx>

    source§

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

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

    impl<'ctx> Iterator for OperandIter<'ctx>

    §

    type Item = Option<Either<BasicValueEnum<'ctx>, BasicBlock<'ctx>>>

    The type of the elements being iterated over.
    source§

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

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

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

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

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

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

    fn count(self) -> usize
    where diff --git a/inkwell/values/struct.OperandUseIter.html b/inkwell/values/struct.OperandUseIter.html index 9512907e8..a70a73858 100644 --- a/inkwell/values/struct.OperandUseIter.html +++ b/inkwell/values/struct.OperandUseIter.html @@ -1,6 +1,6 @@ OperandUseIter in inkwell::values - Rust
    -

    Struct inkwell::values::OperandUseIter

    source · 
    pub struct OperandUseIter<'ctx> { /* private fields */ }
    Expand description

    Iterate over all the operands of an instruction value.

    -

    Trait Implementations§

    source§

    impl<'ctx> Debug for OperandUseIter<'ctx>

    source§

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

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

    impl<'ctx> Iterator for OperandUseIter<'ctx>

    §

    type Item = Option<BasicValueUse<'ctx>>

    The type of the elements being iterated over.
    source§

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

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

    fn next_chunk<const N: usize>( +

    Struct inkwell::values::OperandUseIter

    source · 
    pub struct OperandUseIter<'ctx> { /* private fields */ }
    Expand description

    Iterate over all the operands of an instruction value.

    +

    Trait Implementations§

    source§

    impl<'ctx> Debug for OperandUseIter<'ctx>

    source§

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

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

    impl<'ctx> Iterator for OperandUseIter<'ctx>

    §

    type Item = Option<BasicValueUse<'ctx>>

    The type of the elements being iterated over.
    source§

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

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

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

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

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

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

    fn count(self) -> usize
    where diff --git a/inkwell/values/struct.PhiValue.html b/inkwell/values/struct.PhiValue.html index 4c16219f0..bfe04101a 100644 --- a/inkwell/values/struct.PhiValue.html +++ b/inkwell/values/struct.PhiValue.html @@ -18,14 +18,14 @@ the Phi’s containing basic block.

    source

    pub fn get_incomings(self) -> IncomingIter<'ctx> ⓘ

    Get an incoming edge iterator.

    source

    pub fn get_name(&self) -> &CStr

    Gets the name of a ArrayValue. If the value is a constant, this will return an empty string.

    -
    source

    pub fn set_name(self, name: &str)

    source

    pub fn is_null(self) -> bool

    source

    pub fn is_undef(self) -> bool

    source

    pub fn as_instruction(self) -> InstructionValue<'ctx>

    source

    pub fn replace_all_uses_with(self, other: &PhiValue<'ctx>)

    source

    pub fn as_basic_value(self) -> BasicValueEnum<'ctx>

    Trait Implementations§

    source§

    impl<'ctx> AnyValue<'ctx> for PhiValue<'ctx>

    source§

    fn as_any_value_enum(&self) -> AnyValueEnum<'ctx>

    Returns an enum containing a typed version of AnyValue.
    source§

    fn print_to_string(&self) -> LLVMString

    Prints a value to a LLVMString
    source§

    fn is_poison(&self) -> bool

    Returns whether the value is poison
    source§

    impl AsValueRef for PhiValue<'_>

    source§

    fn as_value_ref(&self) -> LLVMValueRef

    source§

    impl<'ctx> Clone for PhiValue<'ctx>

    source§

    fn clone(&self) -> PhiValue<'ctx>

    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<'ctx> Debug for PhiValue<'ctx>

    source§

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

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

    impl Display for PhiValue<'_>

    source§

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

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

    impl<'ctx> From<PhiValue<'ctx>> for AnyValueEnum<'ctx>

    source§

    fn from(value: PhiValue<'_>) -> AnyValueEnum<'_>

    Converts to this type from the input type.
    source§

    impl<'ctx> Hash for PhiValue<'ctx>

    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

    pub fn set_name(self, name: &str)

    source

    pub fn is_null(self) -> bool

    source

    pub fn is_undef(self) -> bool

    source

    pub fn as_instruction(self) -> InstructionValue<'ctx>

    source

    pub fn replace_all_uses_with(self, other: &PhiValue<'ctx>)

    source

    pub fn as_basic_value(self) -> BasicValueEnum<'ctx>

    Trait Implementations§

    source§

    impl<'ctx> AnyValue<'ctx> for PhiValue<'ctx>

    source§

    fn as_any_value_enum(&self) -> AnyValueEnum<'ctx>

    Returns an enum containing a typed version of AnyValue.
    source§

    fn print_to_string(&self) -> LLVMString

    Prints a value to a LLVMString
    source§

    fn is_poison(&self) -> bool

    Returns whether the value is poison
    source§

    impl AsValueRef for PhiValue<'_>

    source§

    fn as_value_ref(&self) -> LLVMValueRef

    source§

    impl<'ctx> Clone for PhiValue<'ctx>

    source§

    fn clone(&self) -> PhiValue<'ctx>

    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<'ctx> Debug for PhiValue<'ctx>

    source§

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

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

    impl Display for PhiValue<'_>

    source§

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

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

    impl<'ctx> From<PhiValue<'ctx>> for AnyValueEnum<'ctx>

    source§

    fn from(value: PhiValue<'_>) -> AnyValueEnum<'_>

    Converts to this type from the input type.
    source§

    impl<'ctx> Hash for PhiValue<'ctx>

    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<'ctx> PartialEq<AnyValueEnum<'ctx>> for PhiValue<'ctx>

    source§

    fn eq(&self, other: &AnyValueEnum<'ctx>) -> bool

    This method tests for self and other values to be equal, and is used -by ==.
    1.0.0 · source§

    fn ne(&self, other: &Rhs) -> bool

    This method tests for !=. The default implementation is almost always -sufficient, and should not be overridden without very good reason.
    source§

    impl<'ctx> PartialEq<PhiValue<'ctx>> for AnyValueEnum<'ctx>

    source§

    fn eq(&self, other: &PhiValue<'ctx>) -> bool

    This method tests for self and other values to be equal, and is used + Self: Sized,

    Feeds a slice of this type into the given Hasher. Read more
    source§

    impl<'ctx> PartialEq<AnyValueEnum<'ctx>> for PhiValue<'ctx>

    source§

    fn eq(&self, other: &AnyValueEnum<'ctx>) -> bool

    This method tests for self and other values to be equal, and is used by ==.
    1.0.0 · source§

    fn ne(&self, other: &Rhs) -> bool

    This method tests for !=. The default implementation is almost always -sufficient, and should not be overridden without very good reason.
    source§

    impl<'ctx> PartialEq for PhiValue<'ctx>

    source§

    fn eq(&self, other: &PhiValue<'ctx>) -> 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<'ctx> PartialEq<PhiValue<'ctx>> for AnyValueEnum<'ctx>

    source§

    fn eq(&self, other: &PhiValue<'ctx>) -> bool

    This method tests for self and other values to be equal, and is used by ==.
    1.0.0 · source§

    fn ne(&self, other: &Rhs) -> bool

    This method tests for !=. The default implementation is almost always +sufficient, and should not be overridden without very good reason.
    source§

    impl<'ctx> PartialEq for PhiValue<'ctx>

    source§

    fn eq(&self, other: &PhiValue<'ctx>) -> bool

    This method tests for self and other values to be equal, and is used +by ==.
    1.0.0 · source§

    fn ne(&self, other: &Rhs) -> bool

    This method tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.
    source§

    impl<'ctx> TryFrom<AnyValueEnum<'ctx>> for PhiValue<'ctx>

    §

    type Error = ()

    The type returned in the event of a conversion error.
    source§

    fn try_from(value: AnyValueEnum<'ctx>) -> Result<Self, Self::Error>

    Performs the conversion.
    source§

    impl<'ctx> TryFrom<InstructionValue<'ctx>> for PhiValue<'ctx>

    §

    type Error = ()

    The type returned in the event of a conversion error.
    source§

    fn try_from(value: InstructionValue<'_>) -> Result<Self, Self::Error>

    Performs the conversion.
    source§

    impl<'ctx> Copy for PhiValue<'ctx>

    source§

    impl<'ctx> Eq for PhiValue<'ctx>

    source§

    impl<'ctx> StructuralPartialEq for PhiValue<'ctx>

    Auto Trait Implementations§

    §

    impl<'ctx> Freeze for PhiValue<'ctx>

    §

    impl<'ctx> RefUnwindSafe for PhiValue<'ctx>

    §

    impl<'ctx> !Send for PhiValue<'ctx>

    §

    impl<'ctx> !Sync for PhiValue<'ctx>

    §

    impl<'ctx> Unpin for PhiValue<'ctx>

    §

    impl<'ctx> UnwindSafe for PhiValue<'ctx>

    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/inkwell/values/struct.PointerValue.html b/inkwell/values/struct.PointerValue.html index b459e4e91..133a44363 100644 --- a/inkwell/values/struct.PointerValue.html +++ b/inkwell/values/struct.PointerValue.html @@ -26,23 +26,23 @@ will return an empty string.

    self, ptr_type: PointerType<'ctx> ) -> PointerValue<'ctx>

    source

    pub fn replace_all_uses_with(self, other: PointerValue<'ctx>)

    Trait Implementations§

    source§

    impl<'ctx> AnyValue<'ctx> for PointerValue<'ctx>

    source§

    fn as_any_value_enum(&self) -> AnyValueEnum<'ctx>

    Returns an enum containing a typed version of AnyValue.
    source§

    fn print_to_string(&self) -> LLVMString

    Prints a value to a LLVMString
    source§

    fn is_poison(&self) -> bool

    Returns whether the value is poison
    source§

    impl AsValueRef for PointerValue<'_>

    source§

    fn as_value_ref(&self) -> LLVMValueRef

    source§

    impl<'ctx> BasicValue<'ctx> for PointerValue<'ctx>

    source§

    fn as_basic_value_enum(&self) -> BasicValueEnum<'ctx>

    Returns an enum containing a typed version of the BasicValue.
    source§

    fn as_instruction_value(&self) -> Option<InstructionValue<'ctx>>

    Most BasicValues are the byproduct of an instruction -and so are convertible into an InstructionValue
    source§

    fn get_first_use(&self) -> Option<BasicValueUse<'_>>

    source§

    fn set_name(&self, name: &str)

    Sets the name of a BasicValue. If the value is a constant, this is a noop.
    source§

    impl<'ctx> Clone for PointerValue<'ctx>

    source§

    fn clone(&self) -> PointerValue<'ctx>

    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<'ctx> Debug for PointerValue<'ctx>

    source§

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

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

    impl Display for PointerValue<'_>

    source§

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

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

    impl<'ctx> From<PointerValue<'ctx>> for AnyValueEnum<'ctx>

    source§

    fn from(value: PointerValue<'_>) -> AnyValueEnum<'_>

    Converts to this type from the input type.
    source§

    impl<'ctx> From<PointerValue<'ctx>> for BasicMetadataValueEnum<'ctx>

    source§

    fn from(value: PointerValue<'_>) -> BasicMetadataValueEnum<'_>

    Converts to this type from the input type.
    source§

    impl<'ctx> From<PointerValue<'ctx>> for BasicValueEnum<'ctx>

    source§

    fn from(value: PointerValue<'_>) -> BasicValueEnum<'_>

    Converts to this type from the input type.
    source§

    impl<'ctx> Hash for PointerValue<'ctx>

    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 +and so are convertible into an InstructionValue

    source§

    fn get_first_use(&self) -> Option<BasicValueUse<'_>>

    source§

    fn set_name(&self, name: &str)

    Sets the name of a BasicValue. If the value is a constant, this is a noop.
    source§

    impl<'ctx> Clone for PointerValue<'ctx>

    source§

    fn clone(&self) -> PointerValue<'ctx>

    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<'ctx> Debug for PointerValue<'ctx>

    source§

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

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

    impl Display for PointerValue<'_>

    source§

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

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

    impl<'ctx> From<PointerValue<'ctx>> for AnyValueEnum<'ctx>

    source§

    fn from(value: PointerValue<'_>) -> AnyValueEnum<'_>

    Converts to this type from the input type.
    source§

    impl<'ctx> From<PointerValue<'ctx>> for BasicMetadataValueEnum<'ctx>

    source§

    fn from(value: PointerValue<'_>) -> BasicMetadataValueEnum<'_>

    Converts to this type from the input type.
    source§

    impl<'ctx> From<PointerValue<'ctx>> for BasicValueEnum<'ctx>

    source§

    fn from(value: PointerValue<'_>) -> BasicValueEnum<'_>

    Converts to this type from the input type.
    source§

    impl<'ctx> Hash for PointerValue<'ctx>

    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<'ctx> IntMathValue<'ctx> for PointerValue<'ctx>

    §

    type BaseType = IntType<'ctx>

    source§

    unsafe fn new(value: LLVMValueRef) -> PointerValue<'ctx>

    source§

    impl<'ctx> PartialEq<AnyValueEnum<'ctx>> for PointerValue<'ctx>

    source§

    fn eq(&self, other: &AnyValueEnum<'ctx>) -> bool

    This method tests for self and other values to be equal, and is used -by ==.
    1.0.0 · source§

    fn ne(&self, other: &Rhs) -> bool

    This method tests for !=. The default implementation is almost always -sufficient, and should not be overridden without very good reason.
    source§

    impl<'ctx> PartialEq<BasicMetadataValueEnum<'ctx>> for PointerValue<'ctx>

    source§

    fn eq(&self, other: &BasicMetadataValueEnum<'ctx>) -> bool

    This method tests for self and other values to be equal, and is used -by ==.
    1.0.0 · source§

    fn ne(&self, other: &Rhs) -> bool

    This method tests for !=. The default implementation is almost always -sufficient, and should not be overridden without very good reason.
    source§

    impl<'ctx> PartialEq<BasicValueEnum<'ctx>> for PointerValue<'ctx>

    source§

    fn eq(&self, other: &BasicValueEnum<'ctx>) -> bool

    This method tests for self and other values to be equal, and is used + Self: Sized,

    Feeds a slice of this type into the given Hasher. Read more
    source§

    impl<'ctx> IntMathValue<'ctx> for PointerValue<'ctx>

    §

    type BaseType = IntType<'ctx>

    source§

    unsafe fn new(value: LLVMValueRef) -> PointerValue<'ctx>

    source§

    impl<'ctx> PartialEq<AnyValueEnum<'ctx>> for PointerValue<'ctx>

    source§

    fn eq(&self, other: &AnyValueEnum<'ctx>) -> bool

    This method tests for self and other values to be equal, and is used by ==.
    1.0.0 · source§

    fn ne(&self, other: &Rhs) -> bool

    This method tests for !=. The default implementation is almost always -sufficient, and should not be overridden without very good reason.
    source§

    impl<'ctx> PartialEq<PointerValue<'ctx>> for AnyValueEnum<'ctx>

    source§

    fn eq(&self, other: &PointerValue<'ctx>) -> bool

    This method tests for self and other values to be equal, and is used -by ==.
    1.0.0 · source§

    fn ne(&self, other: &Rhs) -> bool

    This method tests for !=. The default implementation is almost always -sufficient, and should not be overridden without very good reason.
    source§

    impl<'ctx> PartialEq<PointerValue<'ctx>> for BasicMetadataValueEnum<'ctx>

    source§

    fn eq(&self, other: &PointerValue<'ctx>) -> bool

    This method tests for self and other values to be equal, and is used -by ==.
    1.0.0 · source§

    fn ne(&self, other: &Rhs) -> bool

    This method tests for !=. The default implementation is almost always -sufficient, and should not be overridden without very good reason.
    source§

    impl<'ctx> PartialEq<PointerValue<'ctx>> for BasicValueEnum<'ctx>

    source§

    fn eq(&self, other: &PointerValue<'ctx>) -> 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<'ctx> PartialEq<BasicMetadataValueEnum<'ctx>> for PointerValue<'ctx>

    source§

    fn eq(&self, other: &BasicMetadataValueEnum<'ctx>) -> bool

    This method tests for self and other values to be equal, and is used +by ==.
    1.0.0 · source§

    fn ne(&self, other: &Rhs) -> bool

    This method tests for !=. The default implementation is almost always +sufficient, and should not be overridden without very good reason.
    source§

    impl<'ctx> PartialEq<BasicValueEnum<'ctx>> for PointerValue<'ctx>

    source§

    fn eq(&self, other: &BasicValueEnum<'ctx>) -> bool

    This method tests for self and other values to be equal, and is used by ==.
    1.0.0 · source§

    fn ne(&self, other: &Rhs) -> bool

    This method tests for !=. The default implementation is almost always -sufficient, and should not be overridden without very good reason.
    source§

    impl<'ctx> PartialEq for PointerValue<'ctx>

    source§

    fn eq(&self, other: &PointerValue<'ctx>) -> 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<'ctx> PartialEq<PointerValue<'ctx>> for AnyValueEnum<'ctx>

    source§

    fn eq(&self, other: &PointerValue<'ctx>) -> bool

    This method tests for self and other values to be equal, and is used +by ==.
    1.0.0 · source§

    fn ne(&self, other: &Rhs) -> bool

    This method tests for !=. The default implementation is almost always +sufficient, and should not be overridden without very good reason.
    source§

    impl<'ctx> PartialEq<PointerValue<'ctx>> for BasicMetadataValueEnum<'ctx>

    source§

    fn eq(&self, other: &PointerValue<'ctx>) -> bool

    This method tests for self and other values to be equal, and is used by ==.
    1.0.0 · source§

    fn ne(&self, other: &Rhs) -> bool

    This method tests for !=. The default implementation is almost always -sufficient, and should not be overridden without very good reason.
    source§

    impl<'ctx> PointerMathValue<'ctx> for PointerValue<'ctx>

    §

    type BaseType = PointerType<'ctx>

    source§

    unsafe fn new(value: LLVMValueRef) -> PointerValue<'ctx>

    source§

    impl<'ctx> TryFrom<AnyValueEnum<'ctx>> for PointerValue<'ctx>

    §

    type Error = ()

    The type returned in the event of a conversion error.
    source§

    fn try_from(value: AnyValueEnum<'ctx>) -> Result<Self, Self::Error>

    Performs the conversion.
    source§

    impl<'ctx> TryFrom<BasicMetadataValueEnum<'ctx>> for PointerValue<'ctx>

    §

    type Error = ()

    The type returned in the event of a conversion error.
    source§

    fn try_from(value: BasicMetadataValueEnum<'ctx>) -> Result<Self, Self::Error>

    Performs the conversion.
    source§

    impl<'ctx> TryFrom<BasicValueEnum<'ctx>> for PointerValue<'ctx>

    §

    type Error = ()

    The type returned in the event of a conversion error.
    source§

    fn try_from(value: BasicValueEnum<'ctx>) -> Result<Self, Self::Error>

    Performs the conversion.
    source§

    impl<'ctx> TryFrom<InstructionValue<'ctx>> for PointerValue<'ctx>

    §

    type Error = ()

    The type returned in the event of a conversion error.
    source§

    fn try_from(value: InstructionValue<'_>) -> Result<Self, Self::Error>

    Performs the conversion.
    source§

    impl<'ctx> Copy for PointerValue<'ctx>

    source§

    impl<'ctx> Eq for PointerValue<'ctx>

    source§

    impl<'ctx> StructuralPartialEq for PointerValue<'ctx>

    Auto Trait Implementations§

    §

    impl<'ctx> Freeze for PointerValue<'ctx>

    §

    impl<'ctx> RefUnwindSafe for PointerValue<'ctx>

    §

    impl<'ctx> !Send for PointerValue<'ctx>

    §

    impl<'ctx> !Sync for PointerValue<'ctx>

    §

    impl<'ctx> Unpin for PointerValue<'ctx>

    §

    impl<'ctx> UnwindSafe for PointerValue<'ctx>

    Blanket Implementations§

    source§

    impl<T> Any for T
    where +sufficient, and should not be overridden without very good reason.

    source§

    impl<'ctx> PartialEq<PointerValue<'ctx>> for BasicValueEnum<'ctx>

    source§

    fn eq(&self, other: &PointerValue<'ctx>) -> bool

    This method tests for self and other values to be equal, and is used +by ==.
    1.0.0 · source§

    fn ne(&self, other: &Rhs) -> bool

    This method tests for !=. The default implementation is almost always +sufficient, and should not be overridden without very good reason.
    source§

    impl<'ctx> PartialEq for PointerValue<'ctx>

    source§

    fn eq(&self, other: &PointerValue<'ctx>) -> bool

    This method tests for self and other values to be equal, and is used +by ==.
    1.0.0 · source§

    fn ne(&self, other: &Rhs) -> bool

    This method tests for !=. The default implementation is almost always +sufficient, and should not be overridden without very good reason.
    source§

    impl<'ctx> PointerMathValue<'ctx> for PointerValue<'ctx>

    §

    type BaseType = PointerType<'ctx>

    source§

    unsafe fn new(value: LLVMValueRef) -> PointerValue<'ctx>

    source§

    impl<'ctx> TryFrom<AnyValueEnum<'ctx>> for PointerValue<'ctx>

    §

    type Error = ()

    The type returned in the event of a conversion error.
    source§

    fn try_from(value: AnyValueEnum<'ctx>) -> Result<Self, Self::Error>

    Performs the conversion.
    source§

    impl<'ctx> TryFrom<BasicMetadataValueEnum<'ctx>> for PointerValue<'ctx>

    §

    type Error = ()

    The type returned in the event of a conversion error.
    source§

    fn try_from(value: BasicMetadataValueEnum<'ctx>) -> Result<Self, Self::Error>

    Performs the conversion.
    source§

    impl<'ctx> TryFrom<BasicValueEnum<'ctx>> for PointerValue<'ctx>

    §

    type Error = ()

    The type returned in the event of a conversion error.
    source§

    fn try_from(value: BasicValueEnum<'ctx>) -> Result<Self, Self::Error>

    Performs the conversion.
    source§

    impl<'ctx> TryFrom<InstructionValue<'ctx>> for PointerValue<'ctx>

    §

    type Error = ()

    The type returned in the event of a conversion error.
    source§

    fn try_from(value: InstructionValue<'_>) -> Result<Self, Self::Error>

    Performs the conversion.
    source§

    impl<'ctx> Copy for PointerValue<'ctx>

    source§

    impl<'ctx> Eq for PointerValue<'ctx>

    source§

    impl<'ctx> StructuralPartialEq for PointerValue<'ctx>

    Auto Trait Implementations§

    §

    impl<'ctx> Freeze for PointerValue<'ctx>

    §

    impl<'ctx> RefUnwindSafe for PointerValue<'ctx>

    §

    impl<'ctx> !Send for PointerValue<'ctx>

    §

    impl<'ctx> !Sync for PointerValue<'ctx>

    §

    impl<'ctx> Unpin for PointerValue<'ctx>

    §

    impl<'ctx> UnwindSafe for PointerValue<'ctx>

    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/inkwell/values/struct.StructValue.html b/inkwell/values/struct.StructValue.html index e1851dc9c..2a55b2cb4 100644 --- a/inkwell/values/struct.StructValue.html +++ b/inkwell/values/struct.StructValue.html @@ -48,27 +48,27 @@ return an empty string.

    source

    pub fn set_name(&self, name: &str)

    Get name of the StructValue.

    source

    pub fn get_type(self) -> StructType<'ctx>

    source

    pub fn is_null(self) -> bool

    source

    pub fn is_undef(self) -> bool

    source

    pub fn print_to_stderr(self)

    source

    pub fn as_instruction(self) -> Option<InstructionValue<'ctx>>

    source

    pub fn replace_all_uses_with(self, other: StructValue<'ctx>)

    Trait Implementations§

    source§

    impl<'ctx> AggregateValue<'ctx> for StructValue<'ctx>

    source§

    fn as_aggregate_value_enum(&self) -> AggregateValueEnum<'ctx>

    Returns an enum containing a typed version of the AggregateValue.
    source§

    impl<'ctx> AnyValue<'ctx> for StructValue<'ctx>

    source§

    fn as_any_value_enum(&self) -> AnyValueEnum<'ctx>

    Returns an enum containing a typed version of AnyValue.
    source§

    fn print_to_string(&self) -> LLVMString

    Prints a value to a LLVMString
    source§

    fn is_poison(&self) -> bool

    Returns whether the value is poison
    source§

    impl AsValueRef for StructValue<'_>

    source§

    fn as_value_ref(&self) -> LLVMValueRef

    source§

    impl<'ctx> BasicValue<'ctx> for StructValue<'ctx>

    source§

    fn as_basic_value_enum(&self) -> BasicValueEnum<'ctx>

    Returns an enum containing a typed version of the BasicValue.
    source§

    fn as_instruction_value(&self) -> Option<InstructionValue<'ctx>>

    Most BasicValues are the byproduct of an instruction -and so are convertible into an InstructionValue
    source§

    fn get_first_use(&self) -> Option<BasicValueUse<'_>>

    source§

    fn set_name(&self, name: &str)

    Sets the name of a BasicValue. If the value is a constant, this is a noop.
    source§

    impl<'ctx> Clone for StructValue<'ctx>

    source§

    fn clone(&self) -> StructValue<'ctx>

    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<'ctx> Debug for StructValue<'ctx>

    source§

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

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

    impl Display for StructValue<'_>

    source§

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

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

    impl<'ctx> From<StructValue<'ctx>> for AggregateValueEnum<'ctx>

    source§

    fn from(value: StructValue<'_>) -> AggregateValueEnum<'_>

    Converts to this type from the input type.
    source§

    impl<'ctx> From<StructValue<'ctx>> for AnyValueEnum<'ctx>

    source§

    fn from(value: StructValue<'_>) -> AnyValueEnum<'_>

    Converts to this type from the input type.
    source§

    impl<'ctx> From<StructValue<'ctx>> for BasicMetadataValueEnum<'ctx>

    source§

    fn from(value: StructValue<'_>) -> BasicMetadataValueEnum<'_>

    Converts to this type from the input type.
    source§

    impl<'ctx> From<StructValue<'ctx>> for BasicValueEnum<'ctx>

    source§

    fn from(value: StructValue<'_>) -> BasicValueEnum<'_>

    Converts to this type from the input type.
    source§

    impl<'ctx> Hash for StructValue<'ctx>

    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 +and so are convertible into an InstructionValue

    source§

    fn get_first_use(&self) -> Option<BasicValueUse<'_>>

    source§

    fn set_name(&self, name: &str)

    Sets the name of a BasicValue. If the value is a constant, this is a noop.
    source§

    impl<'ctx> Clone for StructValue<'ctx>

    source§

    fn clone(&self) -> StructValue<'ctx>

    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<'ctx> Debug for StructValue<'ctx>

    source§

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

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

    impl Display for StructValue<'_>

    source§

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

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

    impl<'ctx> From<StructValue<'ctx>> for AggregateValueEnum<'ctx>

    source§

    fn from(value: StructValue<'_>) -> AggregateValueEnum<'_>

    Converts to this type from the input type.
    source§

    impl<'ctx> From<StructValue<'ctx>> for AnyValueEnum<'ctx>

    source§

    fn from(value: StructValue<'_>) -> AnyValueEnum<'_>

    Converts to this type from the input type.
    source§

    impl<'ctx> From<StructValue<'ctx>> for BasicMetadataValueEnum<'ctx>

    source§

    fn from(value: StructValue<'_>) -> BasicMetadataValueEnum<'_>

    Converts to this type from the input type.
    source§

    impl<'ctx> From<StructValue<'ctx>> for BasicValueEnum<'ctx>

    source§

    fn from(value: StructValue<'_>) -> BasicValueEnum<'_>

    Converts to this type from the input type.
    source§

    impl<'ctx> Hash for StructValue<'ctx>

    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<'ctx> PartialEq<AggregateValueEnum<'ctx>> for StructValue<'ctx>

    source§

    fn eq(&self, other: &AggregateValueEnum<'ctx>) -> bool

    This method tests for self and other values to be equal, and is used -by ==.
    1.0.0 · source§

    fn ne(&self, other: &Rhs) -> bool

    This method tests for !=. The default implementation is almost always -sufficient, and should not be overridden without very good reason.
    source§

    impl<'ctx> PartialEq<AnyValueEnum<'ctx>> for StructValue<'ctx>

    source§

    fn eq(&self, other: &AnyValueEnum<'ctx>) -> bool

    This method tests for self and other values to be equal, and is used + Self: Sized,
    Feeds a slice of this type into the given Hasher. Read more
    source§

    impl<'ctx> PartialEq<AggregateValueEnum<'ctx>> for StructValue<'ctx>

    source§

    fn eq(&self, other: &AggregateValueEnum<'ctx>) -> bool

    This method tests for self and other values to be equal, and is used by ==.
    1.0.0 · source§

    fn ne(&self, other: &Rhs) -> bool

    This method tests for !=. The default implementation is almost always -sufficient, and should not be overridden without very good reason.
    source§

    impl<'ctx> PartialEq<BasicMetadataValueEnum<'ctx>> for StructValue<'ctx>

    source§

    fn eq(&self, other: &BasicMetadataValueEnum<'ctx>) -> bool

    This method tests for self and other values to be equal, and is used -by ==.
    1.0.0 · source§

    fn ne(&self, other: &Rhs) -> bool

    This method tests for !=. The default implementation is almost always -sufficient, and should not be overridden without very good reason.
    source§

    impl<'ctx> PartialEq<BasicValueEnum<'ctx>> for StructValue<'ctx>

    source§

    fn eq(&self, other: &BasicValueEnum<'ctx>) -> bool

    This method tests for self and other values to be equal, and is used -by ==.
    1.0.0 · source§

    fn ne(&self, other: &Rhs) -> bool

    This method tests for !=. The default implementation is almost always -sufficient, and should not be overridden without very good reason.
    source§

    impl<'ctx> PartialEq<StructValue<'ctx>> for AggregateValueEnum<'ctx>

    source§

    fn eq(&self, other: &StructValue<'ctx>) -> bool

    This method tests for self and other values to be equal, and is used -by ==.
    1.0.0 · source§

    fn ne(&self, other: &Rhs) -> bool

    This method tests for !=. The default implementation is almost always -sufficient, and should not be overridden without very good reason.
    source§

    impl<'ctx> PartialEq<StructValue<'ctx>> for AnyValueEnum<'ctx>

    source§

    fn eq(&self, other: &StructValue<'ctx>) -> 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<'ctx> PartialEq<AnyValueEnum<'ctx>> for StructValue<'ctx>

    source§

    fn eq(&self, other: &AnyValueEnum<'ctx>) -> bool

    This method tests for self and other values to be equal, and is used by ==.
    1.0.0 · source§

    fn ne(&self, other: &Rhs) -> bool

    This method tests for !=. The default implementation is almost always -sufficient, and should not be overridden without very good reason.
    source§

    impl<'ctx> PartialEq<StructValue<'ctx>> for BasicMetadataValueEnum<'ctx>

    source§

    fn eq(&self, other: &StructValue<'ctx>) -> 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<'ctx> PartialEq<BasicMetadataValueEnum<'ctx>> for StructValue<'ctx>

    source§

    fn eq(&self, other: &BasicMetadataValueEnum<'ctx>) -> bool

    This method tests for self and other values to be equal, and is used by ==.
    1.0.0 · source§

    fn ne(&self, other: &Rhs) -> bool

    This method tests for !=. The default implementation is almost always -sufficient, and should not be overridden without very good reason.
    source§

    impl<'ctx> PartialEq<StructValue<'ctx>> for BasicValueEnum<'ctx>

    source§

    fn eq(&self, other: &StructValue<'ctx>) -> 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<'ctx> PartialEq<BasicValueEnum<'ctx>> for StructValue<'ctx>

    source§

    fn eq(&self, other: &BasicValueEnum<'ctx>) -> bool

    This method tests for self and other values to be equal, and is used +by ==.
    1.0.0 · source§

    fn ne(&self, other: &Rhs) -> bool

    This method tests for !=. The default implementation is almost always +sufficient, and should not be overridden without very good reason.
    source§

    impl<'ctx> PartialEq<StructValue<'ctx>> for AggregateValueEnum<'ctx>

    source§

    fn eq(&self, other: &StructValue<'ctx>) -> bool

    This method tests for self and other values to be equal, and is used +by ==.
    1.0.0 · source§

    fn ne(&self, other: &Rhs) -> bool

    This method tests for !=. The default implementation is almost always +sufficient, and should not be overridden without very good reason.
    source§

    impl<'ctx> PartialEq<StructValue<'ctx>> for AnyValueEnum<'ctx>

    source§

    fn eq(&self, other: &StructValue<'ctx>) -> bool

    This method tests for self and other values to be equal, and is used by ==.
    1.0.0 · source§

    fn ne(&self, other: &Rhs) -> bool

    This method tests for !=. The default implementation is almost always -sufficient, and should not be overridden without very good reason.
    source§

    impl<'ctx> PartialEq for StructValue<'ctx>

    source§

    fn eq(&self, other: &StructValue<'ctx>) -> 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<'ctx> PartialEq<StructValue<'ctx>> for BasicMetadataValueEnum<'ctx>

    source§

    fn eq(&self, other: &StructValue<'ctx>) -> bool

    This method tests for self and other values to be equal, and is used +by ==.
    1.0.0 · source§

    fn ne(&self, other: &Rhs) -> bool

    This method tests for !=. The default implementation is almost always +sufficient, and should not be overridden without very good reason.
    source§

    impl<'ctx> PartialEq<StructValue<'ctx>> for BasicValueEnum<'ctx>

    source§

    fn eq(&self, other: &StructValue<'ctx>) -> bool

    This method tests for self and other values to be equal, and is used by ==.
    1.0.0 · source§

    fn ne(&self, other: &Rhs) -> bool

    This method tests for !=. The default implementation is almost always -sufficient, and should not be overridden without very good reason.
    source§

    impl<'ctx> TryFrom<AggregateValueEnum<'ctx>> for StructValue<'ctx>

    §

    type Error = ()

    The type returned in the event of a conversion error.
    source§

    fn try_from(value: AggregateValueEnum<'ctx>) -> Result<Self, Self::Error>

    Performs the conversion.
    source§

    impl<'ctx> TryFrom<AnyValueEnum<'ctx>> for StructValue<'ctx>

    §

    type Error = ()

    The type returned in the event of a conversion error.
    source§

    fn try_from(value: AnyValueEnum<'ctx>) -> Result<Self, Self::Error>

    Performs the conversion.
    source§

    impl<'ctx> TryFrom<BasicMetadataValueEnum<'ctx>> for StructValue<'ctx>

    §

    type Error = ()

    The type returned in the event of a conversion error.
    source§

    fn try_from(value: BasicMetadataValueEnum<'ctx>) -> Result<Self, Self::Error>

    Performs the conversion.
    source§

    impl<'ctx> TryFrom<BasicValueEnum<'ctx>> for StructValue<'ctx>

    §

    type Error = ()

    The type returned in the event of a conversion error.
    source§

    fn try_from(value: BasicValueEnum<'ctx>) -> Result<Self, Self::Error>

    Performs the conversion.
    source§

    impl<'ctx> Copy for StructValue<'ctx>

    source§

    impl<'ctx> Eq for StructValue<'ctx>

    source§

    impl<'ctx> StructuralPartialEq for StructValue<'ctx>

    Auto Trait Implementations§

    §

    impl<'ctx> Freeze for StructValue<'ctx>

    §

    impl<'ctx> RefUnwindSafe for StructValue<'ctx>

    §

    impl<'ctx> !Send for StructValue<'ctx>

    §

    impl<'ctx> !Sync for StructValue<'ctx>

    §

    impl<'ctx> Unpin for StructValue<'ctx>

    §

    impl<'ctx> UnwindSafe for StructValue<'ctx>

    Blanket Implementations§

    source§

    impl<T> Any for T
    where +sufficient, and should not be overridden without very good reason.

    source§

    impl<'ctx> PartialEq for StructValue<'ctx>

    source§

    fn eq(&self, other: &StructValue<'ctx>) -> bool

    This method tests for self and other values to be equal, and is used +by ==.
    1.0.0 · source§

    fn ne(&self, other: &Rhs) -> bool

    This method tests for !=. The default implementation is almost always +sufficient, and should not be overridden without very good reason.
    source§

    impl<'ctx> TryFrom<AggregateValueEnum<'ctx>> for StructValue<'ctx>

    §

    type Error = ()

    The type returned in the event of a conversion error.
    source§

    fn try_from(value: AggregateValueEnum<'ctx>) -> Result<Self, Self::Error>

    Performs the conversion.
    source§

    impl<'ctx> TryFrom<AnyValueEnum<'ctx>> for StructValue<'ctx>

    §

    type Error = ()

    The type returned in the event of a conversion error.
    source§

    fn try_from(value: AnyValueEnum<'ctx>) -> Result<Self, Self::Error>

    Performs the conversion.
    source§

    impl<'ctx> TryFrom<BasicMetadataValueEnum<'ctx>> for StructValue<'ctx>

    §

    type Error = ()

    The type returned in the event of a conversion error.
    source§

    fn try_from(value: BasicMetadataValueEnum<'ctx>) -> Result<Self, Self::Error>

    Performs the conversion.
    source§

    impl<'ctx> TryFrom<BasicValueEnum<'ctx>> for StructValue<'ctx>

    §

    type Error = ()

    The type returned in the event of a conversion error.
    source§

    fn try_from(value: BasicValueEnum<'ctx>) -> Result<Self, Self::Error>

    Performs the conversion.
    source§

    impl<'ctx> Copy for StructValue<'ctx>

    source§

    impl<'ctx> Eq for StructValue<'ctx>

    source§

    impl<'ctx> StructuralPartialEq for StructValue<'ctx>

    Auto Trait Implementations§

    §

    impl<'ctx> Freeze for StructValue<'ctx>

    §

    impl<'ctx> RefUnwindSafe for StructValue<'ctx>

    §

    impl<'ctx> !Send for StructValue<'ctx>

    §

    impl<'ctx> !Sync for StructValue<'ctx>

    §

    impl<'ctx> Unpin for StructValue<'ctx>

    §

    impl<'ctx> UnwindSafe for StructValue<'ctx>

    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/inkwell/values/struct.VectorValue.html b/inkwell/values/struct.VectorValue.html index 7fde52986..413df328d 100644 --- a/inkwell/values/struct.VectorValue.html +++ b/inkwell/values/struct.VectorValue.html @@ -1,8 +1,8 @@ VectorValue in inkwell::values - Rust
    -

    Struct inkwell::values::VectorValue

    source · 
    pub struct VectorValue<'ctx> { /* private fields */ }

    Implementations§

    source§

    impl<'ctx> VectorValue<'ctx>

    source

    pub unsafe fn new(vector_value: LLVMValueRef) -> Self

    Get a value from an LLVMValueRef.

    +

    Struct inkwell::values::VectorValue

    source · 
    pub struct VectorValue<'ctx> { /* private fields */ }

    Implementations§

    source§

    impl<'ctx> VectorValue<'ctx>

    source

    pub unsafe fn new(vector_value: LLVMValueRef) -> Self

    Get a value from an LLVMValueRef.

    §Safety

    The ref must be valid and of type vector.

    -
    source

    pub fn is_const(self) -> bool

    Determines whether or not a VectorValue is a constant.

    +
    source

    pub fn is_const(self) -> bool

    Determines whether or not a VectorValue is a constant.

    §Example
    use inkwell::context::Context;
 
@@ -12,38 +12,38 @@
 let i8_vec_zero = i8_vec_type.const_zero();
 
 assert!(i8_vec_zero.is_const());
    -
    source

    pub fn is_constant_vector(self) -> bool

    source

    pub fn is_constant_data_vector(self) -> bool

    source

    pub fn print_to_stderr(self)

    source

    pub fn get_name(&self) -> &CStr

    Gets the name of a VectorValue. If the value is a constant, this will +

    source

    pub fn is_constant_vector(self) -> bool

    source

    pub fn is_constant_data_vector(self) -> bool

    source

    pub fn print_to_stderr(self)

    source

    pub fn get_name(&self) -> &CStr

    Gets the name of a VectorValue. If the value is a constant, this will return an empty string.

    -
    source

    pub fn set_name(&self, name: &str)

    Set name of the VectorValue.

    -
    source

    pub fn get_type(self) -> VectorType<'ctx>

    source

    pub fn is_null(self) -> bool

    source

    pub fn is_undef(self) -> bool

    source

    pub fn as_instruction(self) -> Option<InstructionValue<'ctx>>

    source

    pub fn const_extract_element( +

    source

    pub fn set_name(&self, name: &str)

    Set name of the VectorValue.

    +
    source

    pub fn get_type(self) -> VectorType<'ctx>

    source

    pub fn is_null(self) -> bool

    source

    pub fn is_undef(self) -> bool

    source

    pub fn as_instruction(self) -> Option<InstructionValue<'ctx>>

    source

    pub fn const_extract_element( self, index: IntValue<'ctx> -) -> BasicValueEnum<'ctx>

    source

    pub fn const_insert_element<BV: BasicValue<'ctx>>( +) -> BasicValueEnum<'ctx>

    source

    pub fn const_insert_element<BV: BasicValue<'ctx>>( self, index: IntValue<'ctx>, value: BV -) -> BasicValueEnum<'ctx>

    source

    pub fn replace_all_uses_with(self, other: VectorValue<'ctx>)

    source

    pub fn get_element_as_constant(self, index: u32) -> BasicValueEnum<'ctx>

    source

    pub fn const_shuffle_vector( +) -> BasicValueEnum<'ctx>

    source

    pub fn replace_all_uses_with(self, other: VectorValue<'ctx>)

    source

    pub fn get_element_as_constant(self, index: u32) -> BasicValueEnum<'ctx>

    source

    pub fn const_shuffle_vector( self, right: VectorValue<'ctx>, mask: VectorValue<'ctx> -) -> VectorValue<'ctx>

    Trait Implementations§

    source§

    impl<'ctx> AnyValue<'ctx> for VectorValue<'ctx>

    source§

    fn as_any_value_enum(&self) -> AnyValueEnum<'ctx>

    Returns an enum containing a typed version of AnyValue.
    source§

    fn print_to_string(&self) -> LLVMString

    Prints a value to a LLVMString
    source§

    fn is_poison(&self) -> bool

    Returns whether the value is poison
    source§

    impl AsValueRef for VectorValue<'_>

    source§

    fn as_value_ref(&self) -> LLVMValueRef

    source§

    impl<'ctx> BasicValue<'ctx> for VectorValue<'ctx>

    source§

    fn as_basic_value_enum(&self) -> BasicValueEnum<'ctx>

    Returns an enum containing a typed version of the BasicValue.
    source§

    fn as_instruction_value(&self) -> Option<InstructionValue<'ctx>>

    Most BasicValues are the byproduct of an instruction -and so are convertible into an InstructionValue
    source§

    fn get_first_use(&self) -> Option<BasicValueUse<'_>>

    source§

    fn set_name(&self, name: &str)

    Sets the name of a BasicValue. If the value is a constant, this is a noop.
    source§

    impl<'ctx> Clone for VectorValue<'ctx>

    source§

    fn clone(&self) -> VectorValue<'ctx>

    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<'ctx> Debug for VectorValue<'ctx>

    source§

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

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

    impl Display for VectorValue<'_>

    source§

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

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

    impl<'ctx> FloatMathValue<'ctx> for VectorValue<'ctx>

    §

    type BaseType = VectorType<'ctx>

    source§

    unsafe fn new(value: LLVMValueRef) -> VectorValue<'ctx>

    source§

    impl<'ctx> From<VectorValue<'ctx>> for AnyValueEnum<'ctx>

    source§

    fn from(value: VectorValue<'_>) -> AnyValueEnum<'_>

    Converts to this type from the input type.
    source§

    impl<'ctx> From<VectorValue<'ctx>> for BasicMetadataValueEnum<'ctx>

    source§

    fn from(value: VectorValue<'_>) -> BasicMetadataValueEnum<'_>

    Converts to this type from the input type.
    source§

    impl<'ctx> From<VectorValue<'ctx>> for BasicValueEnum<'ctx>

    source§

    fn from(value: VectorValue<'_>) -> BasicValueEnum<'_>

    Converts to this type from the input type.
    source§

    impl<'ctx> Hash for VectorValue<'ctx>

    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 +) -> VectorValue<'ctx>

    Trait Implementations§

    source§

    impl<'ctx> AnyValue<'ctx> for VectorValue<'ctx>

    source§

    fn as_any_value_enum(&self) -> AnyValueEnum<'ctx>

    Returns an enum containing a typed version of AnyValue.
    source§

    fn print_to_string(&self) -> LLVMString

    Prints a value to a LLVMString
    source§

    fn is_poison(&self) -> bool

    Returns whether the value is poison
    source§

    impl AsValueRef for VectorValue<'_>

    source§

    fn as_value_ref(&self) -> LLVMValueRef

    source§

    impl<'ctx> BasicValue<'ctx> for VectorValue<'ctx>

    source§

    fn as_basic_value_enum(&self) -> BasicValueEnum<'ctx>

    Returns an enum containing a typed version of the BasicValue.
    source§

    fn as_instruction_value(&self) -> Option<InstructionValue<'ctx>>

    Most BasicValues are the byproduct of an instruction +and so are convertible into an InstructionValue
    source§

    fn get_first_use(&self) -> Option<BasicValueUse<'_>>

    source§

    fn set_name(&self, name: &str)

    Sets the name of a BasicValue. If the value is a constant, this is a noop.
    source§

    impl<'ctx> Clone for VectorValue<'ctx>

    source§

    fn clone(&self) -> VectorValue<'ctx>

    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<'ctx> Debug for VectorValue<'ctx>

    source§

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

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

    impl Display for VectorValue<'_>

    source§

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

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

    impl<'ctx> FloatMathValue<'ctx> for VectorValue<'ctx>

    §

    type BaseType = VectorType<'ctx>

    source§

    unsafe fn new(value: LLVMValueRef) -> VectorValue<'ctx>

    source§

    impl<'ctx> From<VectorValue<'ctx>> for AnyValueEnum<'ctx>

    source§

    fn from(value: VectorValue<'_>) -> AnyValueEnum<'_>

    Converts to this type from the input type.
    source§

    impl<'ctx> From<VectorValue<'ctx>> for BasicMetadataValueEnum<'ctx>

    source§

    fn from(value: VectorValue<'_>) -> BasicMetadataValueEnum<'_>

    Converts to this type from the input type.
    source§

    impl<'ctx> From<VectorValue<'ctx>> for BasicValueEnum<'ctx>

    source§

    fn from(value: VectorValue<'_>) -> BasicValueEnum<'_>

    Converts to this type from the input type.
    source§

    impl<'ctx> Hash for VectorValue<'ctx>

    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<'ctx> IntMathValue<'ctx> for VectorValue<'ctx>

    §

    type BaseType = VectorType<'ctx>

    source§

    unsafe fn new(value: LLVMValueRef) -> VectorValue<'ctx>

    source§

    impl<'ctx> PartialEq<AnyValueEnum<'ctx>> for VectorValue<'ctx>

    source§

    fn eq(&self, other: &AnyValueEnum<'ctx>) -> bool

    This method tests for self and other values to be equal, and is used -by ==.
    1.0.0 · source§

    fn ne(&self, other: &Rhs) -> bool

    This method tests for !=. The default implementation is almost always + Self: Sized,
    Feeds a slice of this type into the given Hasher. Read more
    source§

    impl<'ctx> IntMathValue<'ctx> for VectorValue<'ctx>

    §

    type BaseType = VectorType<'ctx>

    source§

    unsafe fn new(value: LLVMValueRef) -> VectorValue<'ctx>

    source§

    impl<'ctx> PartialEq<AnyValueEnum<'ctx>> for VectorValue<'ctx>

    source§

    fn eq(&self, other: &AnyValueEnum<'ctx>) -> bool

    This method tests for self and other values to be equal, and is used +by ==.
    1.0.0 · source§

    fn ne(&self, other: &Rhs) -> bool

    This method tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.
    source§

    impl<'ctx> PartialEq<BasicMetadataValueEnum<'ctx>> for VectorValue<'ctx>

    source§

    fn eq(&self, other: &BasicMetadataValueEnum<'ctx>) -> bool

    This method tests for self and other values to be equal, and is used by ==.
    1.0.0 · source§

    fn ne(&self, other: &Rhs) -> bool

    This method tests for !=. The default implementation is almost always -sufficient, and should not be overridden without very good reason.
    source§

    impl<'ctx> PartialEq<BasicValueEnum<'ctx>> for VectorValue<'ctx>

    source§

    fn eq(&self, other: &BasicValueEnum<'ctx>) -> bool

    This method tests for self and other values to be equal, and is used -by ==.
    1.0.0 · source§

    fn ne(&self, other: &Rhs) -> bool

    This method tests for !=. The default implementation is almost always +sufficient, and should not be overridden without very good reason.
    source§

    impl<'ctx> PartialEq<BasicValueEnum<'ctx>> for VectorValue<'ctx>

    source§

    fn eq(&self, other: &BasicValueEnum<'ctx>) -> bool

    This method tests for self and other values to be equal, and is used +by ==.
    1.0.0 · source§

    fn ne(&self, other: &Rhs) -> bool

    This method tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.
    source§

    impl<'ctx> PartialEq<VectorValue<'ctx>> for AnyValueEnum<'ctx>

    source§

    fn eq(&self, other: &VectorValue<'ctx>) -> bool

    This method tests for self and other values to be equal, and is used by ==.
    1.0.0 · source§

    fn ne(&self, other: &Rhs) -> bool

    This method tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.
    source§

    impl<'ctx> PartialEq<VectorValue<'ctx>> for BasicMetadataValueEnum<'ctx>

    source§

    fn eq(&self, other: &VectorValue<'ctx>) -> bool

    This method tests for self and other values to be equal, and is used by ==.
    1.0.0 · source§

    fn ne(&self, other: &Rhs) -> bool

    This method tests for !=. The default implementation is almost always -sufficient, and should not be overridden without very good reason.
    source§

    impl<'ctx> PartialEq<VectorValue<'ctx>> for BasicValueEnum<'ctx>

    source§

    fn eq(&self, other: &VectorValue<'ctx>) -> bool

    This method tests for self and other values to be equal, and is used -by ==.
    1.0.0 · source§

    fn ne(&self, other: &Rhs) -> bool

    This method tests for !=. The default implementation is almost always -sufficient, and should not be overridden without very good reason.
    source§

    impl<'ctx> PartialEq for VectorValue<'ctx>

    source§

    fn eq(&self, other: &VectorValue<'ctx>) -> bool

    This method tests for self and other values to be equal, and is used -by ==.
    1.0.0 · source§

    fn ne(&self, other: &Rhs) -> bool

    This method tests for !=. The default implementation is almost always -sufficient, and should not be overridden without very good reason.
    source§

    impl<'ctx> PointerMathValue<'ctx> for VectorValue<'ctx>

    §

    type BaseType = VectorType<'ctx>

    source§

    unsafe fn new(value: LLVMValueRef) -> VectorValue<'ctx>

    source§

    impl<'ctx> TryFrom<AnyValueEnum<'ctx>> for VectorValue<'ctx>

    §

    type Error = ()

    The type returned in the event of a conversion error.
    source§

    fn try_from(value: AnyValueEnum<'ctx>) -> Result<Self, Self::Error>

    Performs the conversion.
    source§

    impl<'ctx> TryFrom<BasicMetadataValueEnum<'ctx>> for VectorValue<'ctx>

    §

    type Error = ()

    The type returned in the event of a conversion error.
    source§

    fn try_from(value: BasicMetadataValueEnum<'ctx>) -> Result<Self, Self::Error>

    Performs the conversion.
    source§

    impl<'ctx> TryFrom<BasicValueEnum<'ctx>> for VectorValue<'ctx>

    §

    type Error = ()

    The type returned in the event of a conversion error.
    source§

    fn try_from(value: BasicValueEnum<'ctx>) -> Result<Self, Self::Error>

    Performs the conversion.
    source§

    impl<'ctx> Copy for VectorValue<'ctx>

    source§

    impl<'ctx> Eq for VectorValue<'ctx>

    source§

    impl<'ctx> StructuralPartialEq for VectorValue<'ctx>

    Auto Trait Implementations§

    §

    impl<'ctx> Freeze for VectorValue<'ctx>

    §

    impl<'ctx> RefUnwindSafe for VectorValue<'ctx>

    §

    impl<'ctx> !Send for VectorValue<'ctx>

    §

    impl<'ctx> !Sync for VectorValue<'ctx>

    §

    impl<'ctx> Unpin for VectorValue<'ctx>

    §

    impl<'ctx> UnwindSafe for VectorValue<'ctx>

    Blanket Implementations§

    source§

    impl<T> Any for T
    where +sufficient, and should not be overridden without very good reason.

    source§

    impl<'ctx> PartialEq<VectorValue<'ctx>> for BasicValueEnum<'ctx>

    source§

    fn eq(&self, other: &VectorValue<'ctx>) -> bool

    This method tests for self and other values to be equal, and is used +by ==.
    1.0.0 · source§

    fn ne(&self, other: &Rhs) -> bool

    This method tests for !=. The default implementation is almost always +sufficient, and should not be overridden without very good reason.
    source§

    impl<'ctx> PartialEq for VectorValue<'ctx>

    source§

    fn eq(&self, other: &VectorValue<'ctx>) -> bool

    This method tests for self and other values to be equal, and is used +by ==.
    1.0.0 · source§

    fn ne(&self, other: &Rhs) -> bool

    This method tests for !=. The default implementation is almost always +sufficient, and should not be overridden without very good reason.
    source§

    impl<'ctx> PointerMathValue<'ctx> for VectorValue<'ctx>

    §

    type BaseType = VectorType<'ctx>

    source§

    unsafe fn new(value: LLVMValueRef) -> VectorValue<'ctx>

    source§

    impl<'ctx> TryFrom<AnyValueEnum<'ctx>> for VectorValue<'ctx>

    §

    type Error = ()

    The type returned in the event of a conversion error.
    source§

    fn try_from(value: AnyValueEnum<'ctx>) -> Result<Self, Self::Error>

    Performs the conversion.
    source§

    impl<'ctx> TryFrom<BasicMetadataValueEnum<'ctx>> for VectorValue<'ctx>

    §

    type Error = ()

    The type returned in the event of a conversion error.
    source§

    fn try_from(value: BasicMetadataValueEnum<'ctx>) -> Result<Self, Self::Error>

    Performs the conversion.
    source§

    impl<'ctx> TryFrom<BasicValueEnum<'ctx>> for VectorValue<'ctx>

    §

    type Error = ()

    The type returned in the event of a conversion error.
    source§

    fn try_from(value: BasicValueEnum<'ctx>) -> Result<Self, Self::Error>

    Performs the conversion.
    source§

    impl<'ctx> Copy for VectorValue<'ctx>

    source§

    impl<'ctx> Eq for VectorValue<'ctx>

    source§

    impl<'ctx> StructuralPartialEq for VectorValue<'ctx>

    Auto Trait Implementations§

    §

    impl<'ctx> Freeze for VectorValue<'ctx>

    §

    impl<'ctx> RefUnwindSafe for VectorValue<'ctx>

    §

    impl<'ctx> !Send for VectorValue<'ctx>

    §

    impl<'ctx> !Sync for VectorValue<'ctx>

    §

    impl<'ctx> Unpin for VectorValue<'ctx>

    §

    impl<'ctx> UnwindSafe for VectorValue<'ctx>

    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/inkwell/values/trait.AsValueRef.html b/inkwell/values/trait.AsValueRef.html index b3c2c4268..754d6cc90 100644 --- a/inkwell/values/trait.AsValueRef.html +++ b/inkwell/values/trait.AsValueRef.html @@ -2,4 +2,4 @@

    Trait inkwell::values::AsValueRef

    source · 
    pub unsafe trait AsValueRef {
     // Required method
     fn as_value_ref(&self) -> LLVMValueRef;
-}

    Required Methods§

    source

    fn as_value_ref(&self) -> LLVMValueRef

    Implementors§

    \ No newline at end of file +}

    Required Methods§

    source

    fn as_value_ref(&self) -> LLVMValueRef

    Implementors§

    \ No newline at end of file diff --git a/itertools/adaptors/map/type.MapResults.html b/itertools/adaptors/map/type.MapResults.html deleted file mode 100644 index a833e386b..000000000 --- a/itertools/adaptors/map/type.MapResults.html +++ /dev/null @@ -1,11 +0,0 @@ - - - - - Redirection - - -

    Redirecting to ../../../itertools/structs/type.MapResults.html...

    - - - \ No newline at end of file diff --git a/itertools/adaptors/struct.Step.html b/itertools/adaptors/struct.Step.html deleted file mode 100644 index 2a695d030..000000000 --- a/itertools/adaptors/struct.Step.html +++ /dev/null @@ -1,11 +0,0 @@ - - - - - Redirection - - -

    Redirecting to ../../itertools/structs/struct.Step.html...

    - - - \ No newline at end of file diff --git a/itertools/all.html b/itertools/all.html index 28064a41c..4f8264967 100644 --- a/itertools/all.html +++ b/itertools/all.html @@ -1,2 +1,2 @@ -List of all items in this crate
    -

    List of all items

    Structs

    Enums

    Traits

    Macros

    Functions

    Type Aliases

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

    List of all items

    Structs

    Enums

    Traits

    Macros

    Functions

    Type Aliases

    \ No newline at end of file diff --git a/itertools/enum.Diff.html b/itertools/enum.Diff.html index 198182df7..dfda1dce7 100644 --- a/itertools/enum.Diff.html +++ b/itertools/enum.Diff.html @@ -1,4 +1,4 @@ -Diff in itertools - Rust
    +Diff in itertools - Rust

    Enum itertools::Diff

    source · 
    pub enum Diff<I, J>
    where
     I: Iterator,
     J: Iterator,
    {
diff --git a/itertools/enum.Either.html b/itertools/enum.Either.html
index 851402dbb..b12025273 100644
--- a/itertools/enum.Either.html
+++ b/itertools/enum.Either.html
@@ -1,4 +1,4 @@
-Either in itertools - Rust
    
+Either in itertools - Rust
    
     
    Enum itertools::Either
    source · 
    pub enum Either<L, R> {
     Left(L),
     Right(R),
@@ -781,86 +781,87 @@ if into_left(&self) returns true.
 Converts self into a Right variant of Either<Self, Self>
 otherwise. Read more
    source§

    impl<F> IntoFuture for F
    where F: Future,

    §

    type Output = <F as Future>::Output

    The output that the future will produce on completion.
    §

    type IntoFuture = F

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

    fn into_future(self) -> <F as IntoFuture>::IntoFuture

    Creates a future from a value. Read more
    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> Itertools for T
    where - T: Iterator + ?Sized,

    source§

    fn interleave<J>(self, other: J) -> Interleave<Self, J::IntoIter> ⓘ
    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> Itertools for T
    where + T: Iterator + ?Sized,

    source§

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

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

    fn interleave_shortest<J>( + Self: Sized,

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

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

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

    fn intersperse(self, element: Self::Item) -> Intersperse<Self>
    where +out. Read more

    source§

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

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

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

    source§

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

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

    fn zip_longest<J>(self, other: J) -> ZipLongest<Self, J::IntoIter> ⓘ
    where +between each element of the adapted iterator. Read more

    source§

    fn get<R>(self, index: R) -> R::Output
    where + Self: Sized, + R: IteratorIndex<Self>,

    Returns an iterator over a subsection of the iterator. Read more
    source§

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

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

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

    source§

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

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

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

    source§

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

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

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

    source§

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

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

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

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

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

    source§

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

    👎Deprecated since 0.13.0: Use .chunk_by() instead
    See .chunk_by().
    source§

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

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

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

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

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

    source§

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

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

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

    source§

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

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

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

    source§

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

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

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

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

    fn map_into<R>(self) -> MapInto<Self, R>
    where +the original iterator. Read more

    source§

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

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

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

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

    fn map_ok<F, T, U, E>(self, f: F) -> MapOk<Self, F>
    where + Self::Item: Into<R>,

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

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

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

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

    source§

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

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

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

    source§

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

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

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

    source§

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

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

    fn process_results<F, T, E, R>(self, processor: F) -> Result<R, E>
    where +a series of Result::Ok values. Result::Err values are unchanged. Read more

    source§

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

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

    fn merge<J>(self, other: J) -> Merge<Self, J::IntoIter>
    where +an iterator of Result values instead. Read more

    source§

    fn merge<J>(self, other: J) -> Merge<Self, J::IntoIter>
    where Self: Sized, Self::Item: PartialOrd, J: IntoIterator<Item = Self::Item>,

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

    fn merge_by<J, F>(self, other: J, is_first: F) -> MergeBy<Self, J::IntoIter, F> ⓘ
    where +result is sorted. Read more

    source§

    fn merge_by<J, F>(self, other: J, is_first: F) -> MergeBy<Self, J::IntoIter, F> ⓘ
    where Self: Sized, J: IntoIterator<Item = Self::Item>, F: FnMut(&Self::Item, &Self::Item) -> bool,

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

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

    source§

    fn merge_join_by<J, F, T>( self, other: J, cmp_fn: F @@ -868,284 +869,295 @@ This is much like IntoIterator, F: FnMut(&Self::Item, &J::Item) -> T, Self: Sized,

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

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

    source§

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

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

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

    source§

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

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

    fn cartesian_product<J>(self, other: J) -> Product<Self, J::IntoIter> ⓘ
    where +merging them according to the given closure. Read more

    source§

    fn cartesian_product<J>(self, other: J) -> Product<Self, J::IntoIter> ⓘ
    where Self: Sized, Self::Item: Clone, J: IntoIterator, J::IntoIter: Clone,

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

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

    source§

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

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

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

    source§

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

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

    fn dedup(self) -> Dedup<Self>
    where +optionally merge together consecutive elements. Read more

    source§

    fn dedup(self) -> Dedup<Self>
    where Self: Sized, Self::Item: PartialEq,

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

    fn dedup_by<Cmp>(self, cmp: Cmp) -> DedupBy<Self, Cmp>
    where +If the iterator is sorted, all elements will be unique. Read more

    source§

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

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

    fn dedup_with_count(self) -> DedupWithCount<Self>
    where +If the iterator is sorted, all elements will be unique. Read more

    source§

    fn dedup_with_count(self) -> DedupWithCount<Self>
    where Self: Sized,

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

    fn dedup_by_with_count<Cmp>(self, cmp: Cmp) -> DedupByWithCount<Self, Cmp>
    where +If the iterator is sorted, all elements will be unique. Read more

    source§

    fn dedup_by_with_count<Cmp>(self, cmp: Cmp) -> DedupByWithCount<Self, Cmp>
    where Self: Sized, Cmp: FnMut(&Self::Item, &Self::Item) -> bool,

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

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

    source§

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

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

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

    source§

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

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

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

    source§

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

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

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

    source§

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

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

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

    source§

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

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

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

    source§

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

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

    fn take_while_inclusive<F>(self, accept: F) -> TakeWhileInclusive<Self, F> ⓘ
    where +to only pick off elements while the predicate accept returns true. Read more

    source§

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

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

    fn while_some<A>(self) -> WhileSome<Self> ⓘ
    where +first returned false. Read more

    source§

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

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

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

    source§

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

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

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

    source§

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

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

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

    source§

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

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

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

    source§

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

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

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

    source§

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

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

    fn pad_using<F>(self, min: usize, f: F) -> PadUsing<Self, F> ⓘ
    where +iterator. Read more

    source§

    fn pad_using<F>(self, min: usize, f: F) -> PadUsing<Self, F> ⓘ
    where Self: Sized, F: FnMut(usize) -> Self::Item,

    Return an iterator adaptor that pads the sequence to a minimum length of -min by filling missing elements using a closure f. Read more
    source§

    fn with_position(self) -> WithPosition<Self> ⓘ
    where +min by filling missing elements using a closure f. Read more

    source§

    fn with_position(self) -> WithPosition<Self> ⓘ
    where Self: Sized,

    Return an iterator adaptor that combines each element with a Position to -ease special-case handling of the first or last elements. Read more
    source§

    fn positions<P>(self, predicate: P) -> Positions<Self, P> ⓘ
    where +ease special-case handling of the first or last elements. Read more

    source§

    fn positions<P>(self, predicate: P) -> Positions<Self, P> ⓘ
    where Self: Sized, P: FnMut(Self::Item) -> bool,

    Return an iterator adaptor that yields the indices of all elements -satisfying a predicate, counted from the start of the iterator. Read more
    source§

    fn update<F>(self, updater: F) -> Update<Self, F> ⓘ
    where +satisfying a predicate, counted from the start of the iterator. Read more

    source§

    fn update<F>(self, updater: F) -> Update<Self, F> ⓘ
    where Self: Sized, F: FnMut(&mut Self::Item),

    Return an iterator adaptor that applies a mutating function -to each element before yielding it. Read more
    source§

    fn next_tuple<T>(&mut self) -> Option<T>
    where +to each element before yielding it. Read more

    source§

    fn next_tuple<T>(&mut self) -> Option<T>
    where Self: Sized + Iterator<Item = T::Item>, T: HomogeneousTuple,

    Advances the iterator and returns the next items grouped in a tuple of -a specific size (up to 12). Read more
    source§

    fn collect_tuple<T>(self) -> Option<T>
    where +a specific size (up to 12). Read more

    source§

    fn collect_tuple<T>(self) -> Option<T>
    where Self: Sized + Iterator<Item = T::Item>, T: HomogeneousTuple,

    Collects all items from the iterator into a tuple of a specific size -(up to 12). Read more
    source§

    fn find_position<P>(&mut self, pred: P) -> Option<(usize, Self::Item)>
    where - P: FnMut(&Self::Item) -> bool,

    Find the position and value of the first element satisfying a predicate. Read more
    source§

    fn find_or_last<P>(self, predicate: P) -> Option<Self::Item>
    where +(up to 12). Read more

    source§

    fn find_position<P>(&mut self, pred: P) -> Option<(usize, Self::Item)>
    where + P: FnMut(&Self::Item) -> bool,

    Find the position and value of the first element satisfying a predicate. Read more
    source§

    fn find_or_last<P>(self, predicate: P) -> Option<Self::Item>
    where Self: Sized, - P: FnMut(&Self::Item) -> bool,

    Find the value of the first element satisfying a predicate or return the last element, if any. Read more
    source§

    fn find_or_first<P>(self, predicate: P) -> Option<Self::Item>
    where + P: FnMut(&Self::Item) -> bool,

    Find the value of the first element satisfying a predicate or return the last element, if any. Read more
    source§

    fn find_or_first<P>(self, predicate: P) -> Option<Self::Item>
    where Self: Sized, - P: FnMut(&Self::Item) -> bool,

    Find the value of the first element satisfying a predicate or return the first element, if any. Read more
    source§

    fn contains<Q>(&mut self, query: &Q) -> bool
    where + P: FnMut(&Self::Item) -> bool,

    Find the value of the first element satisfying a predicate or return the first element, if any. Read more
    source§

    fn contains<Q>(&mut self, query: &Q) -> bool
    where Self: Sized, Self::Item: Borrow<Q>, - Q: PartialEq,

    Returns true if the given item is present in this iterator. Read more
    source§

    fn all_equal(&mut self) -> bool
    where + Q: PartialEq,

    Returns true if the given item is present in this iterator. Read more
    source§

    fn all_equal(&mut self) -> bool
    where Self: Sized, - Self::Item: PartialEq,

    Check whether all elements compare equal. Read more
    source§

    fn all_equal_value( + Self::Item: PartialEq,

    Check whether all elements compare equal. Read more
    source§

    fn all_equal_value( &mut self ) -> Result<Self::Item, Option<(Self::Item, Self::Item)>>
    where Self: Sized, Self::Item: PartialEq,

    If there are elements and they are all equal, return a single copy of that element. If there are no elements, return an Error containing None. If there are elements and they are not all equal, return a tuple containing the first -two non-equal elements found. Read more
    source§

    fn all_unique(&mut self) -> bool
    where +two non-equal elements found. Read more

    source§

    fn all_unique(&mut self) -> bool
    where Self: Sized, - Self::Item: Eq + Hash,

    Check whether all elements are unique (non equal). Read more
    source§

    fn dropping(self, n: usize) -> Self
    where + Self::Item: Eq + Hash,

    Check whether all elements are unique (non equal). Read more
    source§

    fn dropping(self, n: usize) -> Self
    where Self: Sized,

    Consume the first n elements from the iterator eagerly, -and return the same iterator again. Read more
    source§

    fn dropping_back(self, n: usize) -> Self
    where +and return the same iterator again. Read more

    source§

    fn dropping_back(self, n: usize) -> Self
    where Self: Sized + DoubleEndedIterator,

    Consume the last n elements from the iterator eagerly, -and return the same iterator again. Read more
    source§

    fn foreach<F>(self, f: F)
    where - F: FnMut(Self::Item), - Self: Sized,

    👎Deprecated since 0.8.0: Use .for_each() instead
    Run the closure f eagerly on each element of the iterator. Read more
    source§

    fn concat(self) -> Self::Item
    where +and return the same iterator again. Read more

    source§

    fn concat(self) -> Self::Item
    where Self: Sized, - Self::Item: Extend<<<Self as Iterator>::Item as IntoIterator>::Item> + IntoIterator + Default,

    Combine all an iterator’s elements into one element by using Extend. Read more
    source§

    fn collect_vec(self) -> Vec<Self::Item>
    where + Self::Item: Extend<<<Self as Iterator>::Item as IntoIterator>::Item> + IntoIterator + Default,

    Combine all an iterator’s elements into one element by using Extend. Read more
    source§

    fn collect_vec(self) -> Vec<Self::Item>
    where Self: Sized,

    .collect_vec() is simply a type specialization of Iterator::collect, -for convenience.
    source§

    fn try_collect<T, U, E>(self) -> Result<U, E>
    where +for convenience.

    source§

    fn try_collect<T, U, E>(self) -> Result<U, E>
    where Self: Sized + Iterator<Item = Result<T, E>>, Result<U, E>: FromIterator<Result<T, E>>,

    .try_collect() is more convenient way of writing -.collect::<Result<_, _>>() Read more
    source§

    fn set_from<'a, A: 'a, J>(&mut self, from: J) -> usize
    where +.collect::<Result<_, _>>() Read more

    source§

    fn set_from<'a, A: 'a, J>(&mut self, from: J) -> usize
    where Self: Iterator<Item = &'a mut A>, J: IntoIterator<Item = A>,

    Assign to each reference in self from the from iterator, -stopping at the shortest of the two iterators. Read more
    source§

    fn join(&mut self, sep: &str) -> String
    where - Self::Item: Display,

    Combine all iterator elements into one String, separated by sep. Read more
    source§

    fn format(self, sep: &str) -> Format<'_, Self>
    where - Self: Sized,

    Format all iterator elements, separated by sep. Read more
    source§

    fn format_with<F>(self, sep: &str, format: F) -> FormatWith<'_, Self, F>
    where +stopping at the shortest of the two iterators. Read more

    source§

    fn join(&mut self, sep: &str) -> String
    where + Self::Item: Display,

    Combine all iterator elements into one String, separated by sep. Read more
    source§

    fn format(self, sep: &str) -> Format<'_, Self>
    where + Self: Sized,

    Format all iterator elements, separated by sep. Read more
    source§

    fn format_with<F>(self, sep: &str, format: F) -> FormatWith<'_, Self, F>
    where Self: Sized, - F: FnMut(Self::Item, &mut dyn FnMut(&dyn Display) -> Result) -> Result,

    Format all iterator elements, separated by sep. Read more
    source§

    fn fold_results<A, E, B, F>(&mut self, start: B, f: F) -> Result<B, E>
    where + F: FnMut(Self::Item, &mut dyn FnMut(&dyn Display) -> Result) -> Result,

    Format all iterator elements, separated by sep. Read more
    source§

    fn fold_ok<A, E, B, F>(&mut self, start: B, f: F) -> Result<B, E>
    where Self: Iterator<Item = Result<A, E>>, - F: FnMut(B, A) -> B,

    👎Deprecated since 0.10.0: Use .fold_ok() instead
    See .fold_ok().
    source§

    fn fold_ok<A, E, B, F>(&mut self, start: B, f: F) -> Result<B, E>
    where - Self: Iterator<Item = Result<A, E>>, - F: FnMut(B, A) -> B,

    Fold Result values from an iterator. Read more
    source§

    fn fold_options<A, B, F>(&mut self, start: B, f: F) -> Option<B>
    where + F: FnMut(B, A) -> B,

    Fold Result values from an iterator. Read more
    source§

    fn fold_options<A, B, F>(&mut self, start: B, f: F) -> Option<B>
    where Self: Iterator<Item = Option<A>>, - F: FnMut(B, A) -> B,

    Fold Option values from an iterator. Read more
    source§

    fn fold1<F>(self, f: F) -> Option<Self::Item>
    where + F: FnMut(B, A) -> B,

    Fold Option values from an iterator. Read more
    source§

    fn fold1<F>(self, f: F) -> Option<Self::Item>
    where F: FnMut(Self::Item, Self::Item) -> Self::Item, - Self: Sized,

    👎Deprecated since 0.10.2: Use Iterator::reduce instead
    Accumulator of the elements in the iterator. Read more
    source§

    fn tree_fold1<F>(self, f: F) -> Option<Self::Item>
    where + Self: Sized,

    👎Deprecated since 0.10.2: Use Iterator::reduce instead
    Accumulator of the elements in the iterator. Read more
    source§

    fn tree_reduce<F>(self, f: F) -> Option<Self::Item>
    where F: FnMut(Self::Item, Self::Item) -> Self::Item, - Self: Sized,

    Accumulate the elements in the iterator in a tree-like manner. Read more
    source§

    fn fold_while<B, F>(&mut self, init: B, f: F) -> FoldWhile<B>
    where + Self: Sized,

    Accumulate the elements in the iterator in a tree-like manner. Read more
    source§

    fn tree_fold1<F>(self, f: F) -> Option<Self::Item>
    where + F: FnMut(Self::Item, Self::Item) -> Self::Item, + Self: Sized,

    👎Deprecated since 0.13.0: Use .tree_reduce() instead
    See .tree_reduce().
    source§

    fn fold_while<B, F>(&mut self, init: B, f: F) -> FoldWhile<B>
    where Self: Sized, - F: FnMut(B, Self::Item) -> FoldWhile<B>,

    An iterator method that applies a function, producing a single, final value. Read more
    source§

    fn sum1<S>(self) -> Option<S>
    where + F: FnMut(B, Self::Item) -> FoldWhile<B>,

    An iterator method that applies a function, producing a single, final value. Read more
    source§

    fn sum1<S>(self) -> Option<S>
    where Self: Sized, - S: Sum<Self::Item>,

    Iterate over the entire iterator and add all the elements. Read more
    source§

    fn product1<P>(self) -> Option<P>
    where + S: Sum<Self::Item>,

    Iterate over the entire iterator and add all the elements. Read more
    source§

    fn product1<P>(self) -> Option<P>
    where Self: Sized, - P: Product<Self::Item>,

    Iterate over the entire iterator and multiply all the elements. Read more
    source§

    fn sorted_unstable(self) -> IntoIter<Self::Item> ⓘ
    where + P: Product<Self::Item>,

    Iterate over the entire iterator and multiply all the elements. Read more
    source§

    fn sorted_unstable(self) -> IntoIter<Self::Item> ⓘ
    where Self: Sized, - Self::Item: Ord,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_unstable_by<F>(self, cmp: F) -> IntoIter<Self::Item> ⓘ
    where + Self::Item: Ord,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_unstable_by<F>(self, cmp: F) -> IntoIter<Self::Item> ⓘ
    where Self: Sized, - F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_unstable_by_key<K, F>(self, f: F) -> IntoIter<Self::Item> ⓘ
    where + F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_unstable_by_key<K, F>(self, f: F) -> IntoIter<Self::Item> ⓘ
    where Self: Sized, K: Ord, - F: FnMut(&Self::Item) -> K,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted(self) -> IntoIter<Self::Item> ⓘ
    where + F: FnMut(&Self::Item) -> K,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted(self) -> IntoIter<Self::Item> ⓘ
    where Self: Sized, - Self::Item: Ord,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_by<F>(self, cmp: F) -> IntoIter<Self::Item> ⓘ
    where + Self::Item: Ord,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_by<F>(self, cmp: F) -> IntoIter<Self::Item> ⓘ
    where Self: Sized, - F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_by_key<K, F>(self, f: F) -> IntoIter<Self::Item> ⓘ
    where + F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_by_key<K, F>(self, f: F) -> IntoIter<Self::Item> ⓘ
    where Self: Sized, K: Ord, - F: FnMut(&Self::Item) -> K,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_by_cached_key<K, F>(self, f: F) -> IntoIter<Self::Item> ⓘ
    where + F: FnMut(&Self::Item) -> K,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_by_cached_key<K, F>(self, f: F) -> IntoIter<Self::Item> ⓘ
    where Self: Sized, K: Ord, F: FnMut(&Self::Item) -> K,

    Sort all iterator elements into a new iterator in ascending order. The key function is -called exactly once per key. Read more
    source§

    fn k_smallest(self, k: usize) -> IntoIter<Self::Item> ⓘ
    where +called exactly once per key. Read more

    source§

    fn k_smallest(self, k: usize) -> IntoIter<Self::Item> ⓘ
    where Self: Sized, - Self::Item: Ord,

    Sort the k smallest elements into a new iterator, in ascending order. Read more
    source§

    fn partition_map<A, B, F, L, R>(self, predicate: F) -> (A, B)
    where + Self::Item: Ord,

    Sort the k smallest elements into a new iterator, in ascending order. Read more
    source§

    fn k_smallest_by<F>(self, k: usize, cmp: F) -> IntoIter<Self::Item> ⓘ
    where + Self: Sized, + F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Sort the k smallest elements into a new iterator using the provided comparison. Read more
    source§

    fn k_smallest_by_key<F, K>(self, k: usize, key: F) -> IntoIter<Self::Item> ⓘ
    where + Self: Sized, + F: FnMut(&Self::Item) -> K, + K: Ord,

    Return the elements producing the k smallest outputs of the provided function. Read more
    source§

    fn k_largest(self, k: usize) -> IntoIter<Self::Item> ⓘ
    where + Self: Sized, + Self::Item: Ord,

    Sort the k largest elements into a new iterator, in descending order. Read more
    source§

    fn k_largest_by<F>(self, k: usize, cmp: F) -> IntoIter<Self::Item> ⓘ
    where + Self: Sized, + F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Sort the k largest elements into a new iterator using the provided comparison. Read more
    source§

    fn k_largest_by_key<F, K>(self, k: usize, key: F) -> IntoIter<Self::Item> ⓘ
    where + Self: Sized, + F: FnMut(&Self::Item) -> K, + K: Ord,

    Return the elements producing the k largest outputs of the provided function. Read more
    source§

    fn tail(self, n: usize) -> IntoIter<Self::Item> ⓘ
    where + Self: Sized,

    Consumes the iterator and return an iterator of the last n elements. Read more
    source§

    fn partition_map<A, B, F, L, R>(self, predicate: F) -> (A, B)
    where Self: Sized, F: FnMut(Self::Item) -> Either<L, R>, A: Default + Extend<L>, B: Default + Extend<R>,

    Collect all iterator elements into one of two partitions. Unlike Iterator::partition, each partition may -have a distinct type. Read more
    source§

    fn partition_result<A, B, T, E>(self) -> (A, B)
    where +have a distinct type. Read more

    source§

    fn partition_result<A, B, T, E>(self) -> (A, B)
    where Self: Iterator<Item = Result<T, E>> + Sized, A: Default + Extend<T>, B: Default + Extend<E>,

    Partition a sequence of Results into one list of all the Ok elements -and another list of all the Err elements. Read more
    source§

    fn into_group_map<K, V>(self) -> HashMap<K, Vec<V>>
    where +and another list of all the Err elements. Read more

    source§

    fn into_group_map<K, V>(self) -> HashMap<K, Vec<V>>
    where Self: Iterator<Item = (K, V)> + Sized, K: Hash + Eq,

    Return a HashMap of keys mapped to Vecs of values. Keys and values -are taken from (Key, Value) tuple pairs yielded by the input iterator. Read more
    source§

    fn into_group_map_by<K, V, F>(self, f: F) -> HashMap<K, Vec<V>>
    where +are taken from (Key, Value) tuple pairs yielded by the input iterator. Read more

    source§

    fn into_group_map_by<K, V, F>(self, f: F) -> HashMap<K, Vec<V>>
    where Self: Iterator<Item = V> + Sized, K: Hash + Eq, - F: Fn(&V) -> K,

    Return an Iterator on a HashMap. Keys mapped to Vecs of values. The key is specified -in the closure. Read more
    source§

    fn into_grouping_map<K, V>(self) -> GroupingMap<Self>
    where + F: FnMut(&V) -> K,

    Return an Iterator on a HashMap. Keys mapped to Vecs of values. The key is specified +in the closure. Read more
    source§

    fn into_grouping_map<K, V>(self) -> GroupingMap<Self>
    where Self: Iterator<Item = (K, V)> + Sized, K: Hash + Eq,

    Constructs a GroupingMap to be used later with one of the efficient -group-and-fold operations it allows to perform. Read more
    source§

    fn into_grouping_map_by<K, V, F>(self, key_mapper: F) -> GroupingMapBy<Self, F>
    where +group-and-fold operations it allows to perform. Read more

    source§

    fn into_grouping_map_by<K, V, F>(self, key_mapper: F) -> GroupingMapBy<Self, F>
    where Self: Iterator<Item = V> + Sized, K: Hash + Eq, F: FnMut(&V) -> K,

    Constructs a GroupingMap to be used later with one of the efficient -group-and-fold operations it allows to perform. Read more
    source§

    fn min_set(self) -> Vec<Self::Item>
    where +group-and-fold operations it allows to perform. Read more

    source§

    fn min_set(self) -> Vec<Self::Item>
    where Self: Sized, - Self::Item: Ord,

    Return all minimum elements of an iterator. Read more
    source§

    fn min_set_by<F>(self, compare: F) -> Vec<Self::Item>
    where + Self::Item: Ord,

    Return all minimum elements of an iterator. Read more
    source§

    fn min_set_by<F>(self, compare: F) -> Vec<Self::Item>
    where Self: Sized, F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Return all minimum elements of an iterator, as determined by -the specified function. Read more
    source§

    fn min_set_by_key<K, F>(self, key: F) -> Vec<Self::Item>
    where +the specified function. Read more

    source§

    fn min_set_by_key<K, F>(self, key: F) -> Vec<Self::Item>
    where Self: Sized, K: Ord, F: FnMut(&Self::Item) -> K,

    Return all minimum elements of an iterator, as determined by -the specified function. Read more
    source§

    fn max_set(self) -> Vec<Self::Item>
    where +the specified function. Read more

    source§

    fn max_set(self) -> Vec<Self::Item>
    where Self: Sized, - Self::Item: Ord,

    Return all maximum elements of an iterator. Read more
    source§

    fn max_set_by<F>(self, compare: F) -> Vec<Self::Item>
    where + Self::Item: Ord,

    Return all maximum elements of an iterator. Read more
    source§

    fn max_set_by<F>(self, compare: F) -> Vec<Self::Item>
    where Self: Sized, F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Return all maximum elements of an iterator, as determined by -the specified function. Read more
    source§

    fn max_set_by_key<K, F>(self, key: F) -> Vec<Self::Item>
    where +the specified function. Read more

    source§

    fn max_set_by_key<K, F>(self, key: F) -> Vec<Self::Item>
    where Self: Sized, K: Ord, F: FnMut(&Self::Item) -> K,

    Return all maximum elements of an iterator, as determined by -the specified function. Read more
    source§

    fn minmax(self) -> MinMaxResult<Self::Item>
    where +the specified function. Read more

    source§

    fn minmax(self) -> MinMaxResult<Self::Item>
    where Self: Sized, - Self::Item: PartialOrd,

    Return the minimum and maximum elements in the iterator. Read more
    source§

    fn minmax_by_key<K, F>(self, key: F) -> MinMaxResult<Self::Item>
    where + Self::Item: PartialOrd,

    Return the minimum and maximum elements in the iterator. Read more
    source§

    fn minmax_by_key<K, F>(self, key: F) -> MinMaxResult<Self::Item>
    where Self: Sized, K: PartialOrd, F: FnMut(&Self::Item) -> K,

    Return the minimum and maximum element of an iterator, as determined by -the specified function. Read more
    source§

    fn minmax_by<F>(self, compare: F) -> MinMaxResult<Self::Item>
    where +the specified function. Read more

    source§

    fn minmax_by<F>(self, compare: F) -> MinMaxResult<Self::Item>
    where Self: Sized, F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Return the minimum and maximum element of an iterator, as determined by -the specified comparison function. Read more
    source§

    fn position_max(self) -> Option<usize>
    where +the specified comparison function. Read more

    source§

    fn position_max(self) -> Option<usize>
    where Self: Sized, - Self::Item: Ord,

    Return the position of the maximum element in the iterator. Read more
    source§

    fn position_max_by_key<K, F>(self, key: F) -> Option<usize>
    where + Self::Item: Ord,

    Return the position of the maximum element in the iterator. Read more
    source§

    fn position_max_by_key<K, F>(self, key: F) -> Option<usize>
    where Self: Sized, K: Ord, F: FnMut(&Self::Item) -> K,

    Return the position of the maximum element in the iterator, as -determined by the specified function. Read more
    source§

    fn position_max_by<F>(self, compare: F) -> Option<usize>
    where +determined by the specified function. Read more

    source§

    fn position_max_by<F>(self, compare: F) -> Option<usize>
    where Self: Sized, F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Return the position of the maximum element in the iterator, as -determined by the specified comparison function. Read more
    source§

    fn position_min(self) -> Option<usize>
    where +determined by the specified comparison function. Read more

    source§

    fn position_min(self) -> Option<usize>
    where Self: Sized, - Self::Item: Ord,

    Return the position of the minimum element in the iterator. Read more
    source§

    fn position_min_by_key<K, F>(self, key: F) -> Option<usize>
    where + Self::Item: Ord,

    Return the position of the minimum element in the iterator. Read more
    source§

    fn position_min_by_key<K, F>(self, key: F) -> Option<usize>
    where Self: Sized, K: Ord, F: FnMut(&Self::Item) -> K,

    Return the position of the minimum element in the iterator, as -determined by the specified function. Read more
    source§

    fn position_min_by<F>(self, compare: F) -> Option<usize>
    where +determined by the specified function. Read more

    source§

    fn position_min_by<F>(self, compare: F) -> Option<usize>
    where Self: Sized, F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Return the position of the minimum element in the iterator, as -determined by the specified comparison function. Read more
    source§

    fn position_minmax(self) -> MinMaxResult<usize>
    where +determined by the specified comparison function. Read more

    source§

    fn position_minmax(self) -> MinMaxResult<usize>
    where Self: Sized, Self::Item: PartialOrd,

    Return the positions of the minimum and maximum elements in -the iterator. Read more
    source§

    fn position_minmax_by_key<K, F>(self, key: F) -> MinMaxResult<usize>
    where +the iterator. Read more

    source§

    fn position_minmax_by_key<K, F>(self, key: F) -> MinMaxResult<usize>
    where Self: Sized, K: PartialOrd, F: FnMut(&Self::Item) -> K,

    Return the postions of the minimum and maximum elements of an -iterator, as determined by the specified function. Read more
    source§

    fn position_minmax_by<F>(self, compare: F) -> MinMaxResult<usize>
    where +iterator, as determined by the specified function. Read more

    source§

    fn position_minmax_by<F>(self, compare: F) -> MinMaxResult<usize>
    where Self: Sized, F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Return the postions of the minimum and maximum elements of an -iterator, as determined by the specified comparison function. Read more
    source§

    fn exactly_one(self) -> Result<Self::Item, ExactlyOneError<Self>>
    where +iterator, as determined by the specified comparison function. Read more

    source§

    fn exactly_one(self) -> Result<Self::Item, ExactlyOneError<Self>>
    where Self: Sized,

    If the iterator yields exactly one element, that element will be returned, otherwise an error will be returned containing an iterator that has the same output as the input -iterator. Read more
    source§

    fn at_most_one(self) -> Result<Option<Self::Item>, ExactlyOneError<Self>>
    where - Self: Sized,

    If the iterator yields no elements, Ok(None) will be returned. If the iterator yields +iterator. Read more
    source§

    fn at_most_one(self) -> Result<Option<Self::Item>, ExactlyOneError<Self>>
    where + Self: Sized,

    If the iterator yields no elements, Ok(None) will be returned. If the iterator yields exactly one element, that element will be returned, otherwise an error will be returned -containing an iterator that has the same output as the input iterator. Read more
    source§

    fn multipeek(self) -> MultiPeek<Self> ⓘ
    where +containing an iterator that has the same output as the input iterator. Read more

    source§

    fn multipeek(self) -> MultiPeek<Self> ⓘ
    where Self: Sized,

    An iterator adaptor that allows the user to peek at multiple .next() -values without advancing the base iterator. Read more
    source§

    fn counts(self) -> HashMap<Self::Item, usize>
    where +values without advancing the base iterator. Read more

    source§

    fn counts(self) -> HashMap<Self::Item, usize>
    where Self: Sized, Self::Item: Eq + Hash,

    Collect the items in this iterator and return a HashMap which contains each item that appears in the iterator and the number -of times it appears. Read more
    source§

    fn counts_by<K, F>(self, f: F) -> HashMap<K, usize>
    where +of times it appears. Read more

    source§

    fn counts_by<K, F>(self, f: F) -> HashMap<K, usize>
    where Self: Sized, K: Eq + Hash, F: FnMut(Self::Item) -> K,

    Collect the items in this iterator and return a HashMap which contains each item that appears in the iterator and the number of times it appears, -determining identity using a keying function. Read more
    source§

    fn multiunzip<FromI>(self) -> FromI
    where - Self: Sized + MultiUnzip<FromI>,

    Converts an iterator of tuples into a tuple of containers. Read more
    source§

    fn try_len(&self) -> Result<usize, (usize, Option<usize>)>

    Returns the length of the iterator if one exists. +determining identity using a keying function. Read more
    source§

    fn multiunzip<FromI>(self) -> FromI
    where + Self: Sized + MultiUnzip<FromI>,

    Converts an iterator of tuples into a tuple of containers. Read more
    source§

    fn try_len(&self) -> Result<usize, (usize, Option<usize>)>

    Returns the length of the iterator if one exists. Otherwise return self.size_hint(). Read more
    source§

    impl<IT> MultiUnzip<()> for IT
    where IT: Iterator<Item = ()>,

    source§

    fn multiunzip(self)

    Unzip this iterator into multiple collections.
    source§

    impl<IT, A, FromA> MultiUnzip<(FromA,)> for IT
    where IT: Iterator<Item = (A,)>, @@ -1249,4 +1261,4 @@ Otherwise return self.size_hint(). 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 + 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/itertools/enum.EitherOrBoth.html b/itertools/enum.EitherOrBoth.html index e2fbf51f3..dc7074c84 100644 --- a/itertools/enum.EitherOrBoth.html +++ b/itertools/enum.EitherOrBoth.html @@ -1,4 +1,4 @@ -EitherOrBoth in itertools - Rust
    +EitherOrBoth in itertools - Rust

    Enum itertools::EitherOrBoth

    source · 
    pub enum EitherOrBoth<A, B = A> {
     Both(A, B),
     Left(A),
diff --git a/itertools/enum.FoldWhile.html b/itertools/enum.FoldWhile.html
index 04f0b96b6..89c4e58c4 100644
--- a/itertools/enum.FoldWhile.html
+++ b/itertools/enum.FoldWhile.html
@@ -1,16 +1,16 @@
-FoldWhile in itertools - Rust
    
-    
    Enum itertools::FoldWhile
    source · 
    pub enum FoldWhile<T> {
+FoldWhile in itertools - Rust
    
+    
    Enum itertools::FoldWhile
    source · 
    pub enum FoldWhile<T> {
     Continue(T),
     Done(T),
 }
    Expand description
    An enum used for controlling the execution of fold_while.
    
 
    See .fold_while() for more information.
    
 
    Variants§
    §
    Continue(T)
    Continue folding with this value
    
 
    §
    Done(T)
    Fold is complete and will return this value
    
-
    Implementations§
    source§
    impl<T> FoldWhile<T>
    source
    pub fn into_inner(self) -> T
    Return the value in the continue or done.
    
-
    source
    pub fn is_done(&self) -> bool
    Return true if self is Done, false if it is Continue.
    
-
    Trait Implementations§
    source§
    impl<T: Clone> Clone for FoldWhile<T>
    source§
    fn clone(&self) -> FoldWhile<T>
    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 FoldWhile<T>
    source§
    fn fmt(&self, f: &mut Formatter<'_>) -> Result
    Formats the value using the given formatter. Read more
    source§
    impl<T: PartialEq> PartialEq for FoldWhile<T>
    source§
    fn eq(&self, other: &FoldWhile<T>) -> bool
    This method tests for self and other values to be equal, and is used
+
    Implementations§
    source§
    impl<T> FoldWhile<T>
    source
    pub fn into_inner(self) -> T
    Return the value in the continue or done.
    
+
    source
    pub fn is_done(&self) -> bool
    Return true if self is Done, false if it is Continue.
    
+
    Trait Implementations§
    source§
    impl<T: Clone> Clone for FoldWhile<T>
    source§
    fn clone(&self) -> FoldWhile<T>
    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 FoldWhile<T>
    source§
    fn fmt(&self, f: &mut Formatter<'_>) -> Result
    Formats the value using the given formatter. Read more
    source§
    impl<T: PartialEq> PartialEq for FoldWhile<T>
    source§
    fn eq(&self, other: &FoldWhile<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<T: Copy> Copy for FoldWhile<T>
    source§
    impl<T: Eq> Eq for FoldWhile<T>
    source§
    impl<T> StructuralPartialEq for FoldWhile<T>
    Auto Trait Implementations§
    §
    impl<T> Freeze for FoldWhile<T>
    where
+sufficient, and should not be overridden without very good reason.
    source§
    impl<T: Copy> Copy for FoldWhile<T>
    source§
    impl<T: Eq> Eq for FoldWhile<T>
    source§
    impl<T> StructuralPartialEq for FoldWhile<T>
    Auto Trait Implementations§
    §
    impl<T> Freeze for FoldWhile<T>
    where
     T: Freeze,
    §
    impl<T> RefUnwindSafe for FoldWhile<T>
    where
     T: RefUnwindSafe,
    §
    impl<T> Send for FoldWhile<T>
    where
     T: Send,
    §
    impl<T> Sync for FoldWhile<T>
    where
diff --git a/itertools/enum.MinMaxResult.html b/itertools/enum.MinMaxResult.html
index 9dc5fc6e1..5c97b0c9a 100644
--- a/itertools/enum.MinMaxResult.html
+++ b/itertools/enum.MinMaxResult.html
@@ -1,4 +1,4 @@
-MinMaxResult in itertools - Rust
    
+MinMaxResult in itertools - Rust
    
     
    Enum itertools::MinMaxResult
    source · 
    pub enum MinMaxResult<T> {
     NoElements,
     OneElement(T),
diff --git a/itertools/enum.Position.html b/itertools/enum.Position.html
index 672b912ea..4fd535062 100644
--- a/itertools/enum.Position.html
+++ b/itertools/enum.Position.html
@@ -1,4 +1,4 @@
-Position in itertools - Rust
    
+Position in itertools - Rust
    
     
    Enum itertools::Position
    source · 
    pub enum Position {
     First,
     Middle,
diff --git a/itertools/fn.all.html b/itertools/fn.all.html
index 5e6c675f5..d00fdc177 100644
--- a/itertools/fn.all.html
+++ b/itertools/fn.all.html
@@ -1,4 +1,4 @@
-all in itertools - Rust
    
+all in itertools - Rust
    
     
    Function itertools::all
    source · 
    pub fn all<I, F>(iterable: I, f: F) -> bool
    where
     I: IntoIterator,
     F: FnMut(I::Item) -> bool,
    Expand description
    Test whether the predicate holds for all elements in the iterable.
    
diff --git a/itertools/fn.any.html b/itertools/fn.any.html
index 063cb7143..429757d7b 100644
--- a/itertools/fn.any.html
+++ b/itertools/fn.any.html
@@ -1,4 +1,4 @@
-any in itertools - Rust
    
+any in itertools - Rust
    
     
    Function itertools::any
    source · 
    pub fn any<I, F>(iterable: I, f: F) -> bool
    where
     I: IntoIterator,
     F: FnMut(I::Item) -> bool,
    Expand description
    Test whether the predicate holds for any elements in the iterable.
    
diff --git a/itertools/fn.assert_equal.html b/itertools/fn.assert_equal.html
index f8b49e8c0..e9bf46da0 100644
--- a/itertools/fn.assert_equal.html
+++ b/itertools/fn.assert_equal.html
@@ -1,12 +1,12 @@
-assert_equal in itertools - Rust
    
-    
    Function itertools::assert_equal
    source · 
    pub fn assert_equal<I, J>(a: I, b: J)
    where
+assert_equal in itertools - Rust
    
+    
    Function itertools::assert_equal
    source · 
    pub fn assert_equal<I, J>(a: I, b: J)
    where
     I: IntoIterator,
     J: IntoIterator,
     I::Item: Debug + PartialEq<J::Item>,
     J::Item: Debug,
    Expand description
    Assert that two iterables produce equal sequences, with the same
 semantics as equal(a, b).
    
 
    Panics on assertion failure with a message that shows the
-two iteration elements.
    
+two different elements and the iteration index.
    
 
 
    ⓘ
    assert_equal("exceed".split('c'), "excess".split('c'));
 // ^PANIC: panicked at 'Failed assertion Some("eed") == Some("ess") for iteration 1'.
    
diff --git a/itertools/fn.chain.html b/itertools/fn.chain.html
index 9640a282d..efe37aa5b 100644
--- a/itertools/fn.chain.html
+++ b/itertools/fn.chain.html
@@ -1,4 +1,4 @@
-chain in itertools - Rust
    
+chain in itertools - Rust
    
     
    Function itertools::chain
    source · 
    pub fn chain<I, J>(
     i: I,
     j: J
diff --git a/itertools/fn.cloned.html b/itertools/fn.cloned.html
index ad80c47b1..bbe65542e 100644
--- a/itertools/fn.cloned.html
+++ b/itertools/fn.cloned.html
@@ -1,7 +1,7 @@
-cloned in itertools - Rust
    
+cloned in itertools - Rust
    
     
    Function itertools::cloned
    source · 
    pub fn cloned<'a, I, T>(iterable: I) -> Cloned<I::IntoIter>
    where
     I: IntoIterator<Item = &'a T>,
-    T: Clone + 'a,
    Expand description
    Create an iterator that clones each element from &T to T
    
+    T: Clone + 'a,
    Expand description
    Create an iterator that clones each element from &T to T.
    
 
    IntoIterator enabled version of Iterator::cloned.
    
 
 
    use itertools::cloned;
diff --git a/itertools/fn.concat.html b/itertools/fn.concat.html
index 1a4802887..65f9cd8fd 100644
--- a/itertools/fn.concat.html
+++ b/itertools/fn.concat.html
@@ -1,4 +1,4 @@
-concat in itertools - Rust
    
+concat in itertools - Rust
    
     
    Function itertools::concat
    source · 
    pub fn concat<I>(iterable: I) -> I::Item
    where
     I: IntoIterator,
     I::Item: Extend<<<I as IntoIterator>::Item as IntoIterator>::Item> + IntoIterator + Default,
    Expand description
    Combine all an iterator’s elements into one element by using Extend.
    
diff --git a/itertools/fn.cons_tuples.html b/itertools/fn.cons_tuples.html
index 8af44534e..901cb7e68 100644
--- a/itertools/fn.cons_tuples.html
+++ b/itertools/fn.cons_tuples.html
@@ -1,5 +1,5 @@
-cons_tuples in itertools - Rust
    
-    
    Function itertools::cons_tuples
    source · 
    pub fn cons_tuples<I, J>(iterable: I) -> ConsTuples<I::IntoIter, J>
    where
+cons_tuples in itertools - Rust
    
+    
    Function itertools::cons_tuples
    source · 
    pub fn cons_tuples<I, J>(iterable: I) -> ConsTuples<I::IntoIter, J>
    where
     I: IntoIterator<Item = J>,
    Expand description
    Create an iterator that maps for example iterators of
 ((A, B), C) to (A, B, C).
    
 
    
\ No newline at end of file
diff --git a/itertools/fn.diff_with.html b/itertools/fn.diff_with.html
index c088d32ab..daf93ca1e 100644
--- a/itertools/fn.diff_with.html
+++ b/itertools/fn.diff_with.html
@@ -1,4 +1,4 @@
-diff_with in itertools - Rust
    
+diff_with in itertools - Rust
    
     
    Function itertools::diff_with
    source · 
    pub fn diff_with<I, J, F>(
     i: I,
     j: J,
@@ -6,7 +6,7 @@
 ) -> Option<Diff<I::IntoIter, J::IntoIter>>
    where
     I: IntoIterator,
     J: IntoIterator,
-    F: Fn(&I::Item, &J::Item) -> bool,
    Expand description
    Compares every element yielded by both i and j with the given function in lock-step and
+    F: FnMut(&I::Item, &J::Item) -> bool,
    Expand description
    Compares every element yielded by both i and j with the given function in lock-step and
 returns a Diff which describes how j differs from i.
    
 
    If the number of elements yielded by j is less than the number of elements yielded by i,
 the number of j elements yielded will be returned along with i’s remaining elements as
diff --git a/itertools/fn.enumerate.html b/itertools/fn.enumerate.html
index 704b4d6c0..efeababb4 100644
--- a/itertools/fn.enumerate.html
+++ b/itertools/fn.enumerate.html
@@ -1,4 +1,4 @@
-enumerate in itertools - Rust
    
+enumerate in itertools - Rust
    
     
    Function itertools::enumerate
    source · 
    pub fn enumerate<I>(iterable: I) -> Enumerate<I::IntoIter>
    where
     I: IntoIterator,
    Expand description
    Iterate iterable with a running index.
    
 
    IntoIterator enabled version of Iterator::enumerate.
    
diff --git a/itertools/fn.equal.html b/itertools/fn.equal.html
index 79aeb6160..69e8931aa 100644
--- a/itertools/fn.equal.html
+++ b/itertools/fn.equal.html
@@ -1,5 +1,5 @@
-equal in itertools - Rust
    
-    
    Function itertools::equal
    source · 
    pub fn equal<I, J>(a: I, b: J) -> bool
    where
+equal in itertools - Rust
    
+    
    Function itertools::equal
    source · 
    pub fn equal<I, J>(a: I, b: J) -> bool
    where
     I: IntoIterator,
     J: IntoIterator,
     I::Item: PartialEq<J::Item>,
    Expand description
    Return true if both iterables produce equal sequences
diff --git a/itertools/fn.fold.html b/itertools/fn.fold.html
index 17ba8e79f..44a8da83f 100644
--- a/itertools/fn.fold.html
+++ b/itertools/fn.fold.html
@@ -1,4 +1,4 @@
-fold in itertools - Rust
    
+fold in itertools - Rust
    
     
    Function itertools::fold
    source · 
    pub fn fold<I, B, F>(iterable: I, init: B, f: F) -> B
    where
     I: IntoIterator,
     F: FnMut(B, I::Item) -> B,
    Expand description
    Perform a fold operation over the iterable.
    
diff --git a/itertools/fn.interleave.html b/itertools/fn.interleave.html
index d369257b5..4a3bb84d3 100644
--- a/itertools/fn.interleave.html
+++ b/itertools/fn.interleave.html
@@ -1,9 +1,9 @@
-interleave in itertools - Rust
    
-    
    Function itertools::interleave
    source · 
    pub fn interleave<I, J>(
+interleave in itertools - Rust
    
+    
    Function itertools::interleave
    source · 
    pub fn interleave<I, J>(
     i: I,
     j: J
 ) -> Interleave<<I as IntoIterator>::IntoIter, <J as IntoIterator>::IntoIter> ⓘ
    where
     I: IntoIterator,
     J: IntoIterator<Item = I::Item>,
    Expand description
    Create an iterator that interleaves elements in i and j.
    
-
    IntoIterator enabled version of [Itertools::interleave].
    
+
    IntoIterator enabled version of Itertools::interleave.
    
 
    
\ No newline at end of file
diff --git a/itertools/fn.intersperse.html b/itertools/fn.intersperse.html
index 3a72118d5..fc5dacb58 100644
--- a/itertools/fn.intersperse.html
+++ b/itertools/fn.intersperse.html
@@ -1,4 +1,4 @@
-intersperse in itertools - Rust
    
+intersperse in itertools - Rust
    
     
    Function itertools::intersperse
    source · 
    pub fn intersperse<I>(iterable: I, element: I::Item) -> Intersperse<I::IntoIter>
    where
     I: IntoIterator,
     <I as IntoIterator>::Item: Clone,
    Expand description
    Iterate iterable with a particular value inserted between each element.
    
diff --git a/itertools/fn.intersperse_with.html b/itertools/fn.intersperse_with.html
index af6ad314c..75023e34c 100644
--- a/itertools/fn.intersperse_with.html
+++ b/itertools/fn.intersperse_with.html
@@ -1,4 +1,4 @@
-intersperse_with in itertools - Rust
    
+intersperse_with in itertools - Rust
    
     
    Function itertools::intersperse_with
    source · 
    pub fn intersperse_with<I, F>(
     iterable: I,
     element: F
diff --git a/itertools/fn.iterate.html b/itertools/fn.iterate.html
index c072933e7..5561d04f9 100644
--- a/itertools/fn.iterate.html
+++ b/itertools/fn.iterate.html
@@ -1,5 +1,5 @@
-iterate in itertools - Rust
    
-    
    Function itertools::iterate
    source · 
    pub fn iterate<St, F>(initial_value: St, f: F) -> Iterate<St, F> ⓘ
    where
+iterate in itertools - Rust
    
+    
    Function itertools::iterate
    source · 
    pub fn iterate<St, F>(initial_value: St, f: F) -> Iterate<St, F> ⓘ
    where
     F: FnMut(&St) -> St,
    Expand description
    Creates a new iterator that infinitely applies function to value and yields results.
    
 
 
    use itertools::iterate;
diff --git a/itertools/fn.join.html b/itertools/fn.join.html
index 4cd8602a9..e17e4b475 100644
--- a/itertools/fn.join.html
+++ b/itertools/fn.join.html
@@ -1,7 +1,7 @@
-join in itertools - Rust
    
+join in itertools - Rust
    
     
    Function itertools::join
    source · 
    pub fn join<I>(iterable: I, sep: &str) -> String
    where
     I: IntoIterator,
-    I::Item: Display,
    Expand description
    Combine all iterator elements into one String, separated by sep.
    
+    I::Item: Display,
    Expand description
    Combine all iterator elements into one String, separated by sep.
    
 
    IntoIterator enabled version of Itertools::join.
    
 
 
    use itertools::join;
diff --git a/itertools/fn.kmerge.html b/itertools/fn.kmerge.html
index a74034bbe..710327b44 100644
--- a/itertools/fn.kmerge.html
+++ b/itertools/fn.kmerge.html
@@ -1,4 +1,4 @@
-kmerge in itertools - Rust
    
+kmerge in itertools - Rust
    
     
    Function itertools::kmerge
    source · 
    pub fn kmerge<I>(iterable: I) -> KMerge<<I::Item as IntoIterator>::IntoIter>
    where
     I: IntoIterator,
     I::Item: IntoIterator,
diff --git a/itertools/fn.kmerge_by.html b/itertools/fn.kmerge_by.html
index 3d883ae9e..abed52655 100644
--- a/itertools/fn.kmerge_by.html
+++ b/itertools/fn.kmerge_by.html
@@ -1,4 +1,4 @@
-kmerge_by in itertools - Rust
    
+kmerge_by in itertools - Rust
    
     
    Function itertools::kmerge_by
    source · 
    pub fn kmerge_by<I, F>(
     iterable: I,
     less_than: F
diff --git a/itertools/fn.max.html b/itertools/fn.max.html
index 6f4a062be..7ad5d98ba 100644
--- a/itertools/fn.max.html
+++ b/itertools/fn.max.html
@@ -1,4 +1,4 @@
-max in itertools - Rust
    
+max in itertools - Rust
    
     
    Function itertools::max
    source · 
    pub fn max<I>(iterable: I) -> Option<I::Item>
    where
     I: IntoIterator,
     I::Item: Ord,
    Expand description
    Return the maximum value of the iterable.
    
diff --git a/itertools/fn.merge.html b/itertools/fn.merge.html
index ea04976af..a654570b5 100644
--- a/itertools/fn.merge.html
+++ b/itertools/fn.merge.html
@@ -1,4 +1,4 @@
-merge in itertools - Rust
    
+merge in itertools - Rust
    
     
    Function itertools::merge
    source · 
    pub fn merge<I, J>(
     i: I,
     j: J
diff --git a/itertools/fn.merge_join_by.html b/itertools/fn.merge_join_by.html
index ba2f7ce07..dfbd84019 100644
--- a/itertools/fn.merge_join_by.html
+++ b/itertools/fn.merge_join_by.html
@@ -1,4 +1,4 @@
-merge_join_by in itertools - Rust
    
+merge_join_by in itertools - Rust
    
     
    Function itertools::merge_join_by
    source · 
    pub fn merge_join_by<I, J, F, T>(
     left: I,
     right: J,
diff --git a/itertools/fn.min.html b/itertools/fn.min.html
index 650f92998..bcc350027 100644
--- a/itertools/fn.min.html
+++ b/itertools/fn.min.html
@@ -1,4 +1,4 @@
-min in itertools - Rust
    
+min in itertools - Rust
    
     
    Function itertools::min
    source · 
    pub fn min<I>(iterable: I) -> Option<I::Item>
    where
     I: IntoIterator,
     I::Item: Ord,
    Expand description
    Return the minimum value of the iterable.
    
diff --git a/itertools/fn.multipeek.html b/itertools/fn.multipeek.html
index 5522dc66d..2ee03093b 100644
--- a/itertools/fn.multipeek.html
+++ b/itertools/fn.multipeek.html
@@ -1,4 +1,4 @@
-multipeek in itertools - Rust
    
+multipeek in itertools - Rust
    
     
    Function itertools::multipeek
    source · 
    pub fn multipeek<I>(iterable: I) -> MultiPeek<I::IntoIter> ⓘ
    where
     I: IntoIterator,
    Expand description
    An iterator adaptor that allows the user to peek at multiple .next()
 values without advancing the base iterator.
    
diff --git a/itertools/fn.multiunzip.html b/itertools/fn.multiunzip.html
index 532f6dc83..86c806db5 100644
--- a/itertools/fn.multiunzip.html
+++ b/itertools/fn.multiunzip.html
@@ -1,4 +1,4 @@
-multiunzip in itertools - Rust
    
+multiunzip in itertools - Rust
    
     
    Function itertools::multiunzip
    source · 
    pub fn multiunzip<FromI, I>(i: I) -> FromI
    where
     I: IntoIterator,
     I::IntoIter: MultiUnzip<FromI>,
    Expand description
    Converts an iterator of tuples into a tuple of containers.
    
diff --git a/itertools/fn.multizip.html b/itertools/fn.multizip.html
index f8be58f1c..1ad312d70 100644
--- a/itertools/fn.multizip.html
+++ b/itertools/fn.multizip.html
@@ -1,12 +1,12 @@
-multizip in itertools - Rust
    
-    
    Function itertools::multizip
    source · 
    pub fn multizip<T, U>(t: U) -> Zip<T>
    where
-    Zip<T>: From<U> + Iterator,
    Expand description
    An iterator that generalizes .zip() and allows running multiple iterators in lockstep.
    
+multizip in itertools - Rust
    
+    
    Function itertools::multizip
    source · 
    pub fn multizip<T, U>(t: U) -> Zip<T>
    where
+    Zip<T>: From<U> + Iterator,
    Expand description
    An iterator that generalizes .zip() and allows running multiple iterators in lockstep.
    
 
    The iterator Zip<(I, J, ..., M)> is formed from a tuple of iterators (or values that
 implement IntoIterator) and yields elements
 until any of the subiterators yields None.
    
 
    The iterator element type is a tuple like like (A, B, ..., E) where A to E are the
 element types of the subiterator.
    
-
    Note: The result of this macro is a value of a named type (Zip<(I, J, ..)> of each component iterator I, J, ...) if each component iterator is
+
    Note: The result of this function is a value of a named type (Zip<(I, J, ..)> of each component iterator I, J, ...) if each component iterator is
 nameable.
    
 
    Prefer izip!() over multizip for the performance benefits of using the
 standard library .zip(). Prefer multizip if a nameable type is needed.
    
diff --git a/itertools/fn.partition.html b/itertools/fn.partition.html
index e023112b6..acf6faea8 100644
--- a/itertools/fn.partition.html
+++ b/itertools/fn.partition.html
@@ -1,5 +1,5 @@
-partition in itertools - Rust
    
-    
    Function itertools::partition
    source · 
    pub fn partition<'a, A: 'a, I, F>(iter: I, pred: F) -> usize
    where
+partition in itertools - Rust
    
+    
    Function itertools::partition
    source · 
    pub fn partition<'a, A: 'a, I, F>(iter: I, pred: F) -> usize
    where
     I: IntoIterator<Item = &'a mut A>,
     I::IntoIter: DoubleEndedIterator,
     F: FnMut(&A) -> bool,
    Expand description
    Partition a sequence using predicate pred so that elements
diff --git a/itertools/fn.peek_nth.html b/itertools/fn.peek_nth.html
index f0695196c..7a964fc8c 100644
--- a/itertools/fn.peek_nth.html
+++ b/itertools/fn.peek_nth.html
@@ -1,4 +1,4 @@
-peek_nth in itertools - Rust
    
+peek_nth in itertools - Rust
    
     
    Function itertools::peek_nth
    source · 
    pub fn peek_nth<I>(iterable: I) -> PeekNth<I::IntoIter> ⓘ
    where
     I: IntoIterator,
    Expand description
    A drop-in replacement for std::iter::Peekable which adds a peek_nth
 method allowing the user to peek at a value several iterations forward
diff --git a/itertools/fn.process_results.html b/itertools/fn.process_results.html
index 8e3b83148..8c83960fd 100644
--- a/itertools/fn.process_results.html
+++ b/itertools/fn.process_results.html
@@ -1,5 +1,5 @@
-process_results in itertools - Rust
    
-    
    Function itertools::process_results
    source · 
    pub fn process_results<I, F, T, E, R>(iterable: I, processor: F) -> Result<R, E>
    where
+process_results in itertools - Rust
    
+    
    Function itertools::process_results
    source · 
    pub fn process_results<I, F, T, E, R>(iterable: I, processor: F) -> Result<R, E>
    where
     I: IntoIterator<Item = Result<T, E>>,
     F: FnOnce(ProcessResults<'_, I::IntoIter, E>) -> R,
    Expand description
    “Lift” a function of the values of an iterator so that it can process
 an iterator of Result values instead.
    
diff --git a/itertools/fn.put_back.html b/itertools/fn.put_back.html
index c316dd63b..d9f3c358f 100644
--- a/itertools/fn.put_back.html
+++ b/itertools/fn.put_back.html
@@ -1,4 +1,4 @@
-put_back in itertools - Rust
    
-    
    Function itertools::put_back
    source · 
    pub fn put_back<I>(iterable: I) -> PutBack<I::IntoIter> ⓘ
    where
+put_back in itertools - Rust
    
+    
    Function itertools::put_back
    source · 
    pub fn put_back<I>(iterable: I) -> PutBack<I::IntoIter> ⓘ
    where
     I: IntoIterator,
    Expand description
    Create an iterator where you can put back a single item
    
 
    
\ No newline at end of file
diff --git a/itertools/fn.put_back_n.html b/itertools/fn.put_back_n.html
index 870ae5382..779b59345 100644
--- a/itertools/fn.put_back_n.html
+++ b/itertools/fn.put_back_n.html
@@ -1,4 +1,4 @@
-put_back_n in itertools - Rust
    
+put_back_n in itertools - Rust
    
     
    Function itertools::put_back_n
    source · 
    pub fn put_back_n<I>(iterable: I) -> PutBackN<I::IntoIter> ⓘ
    where
     I: IntoIterator,
    Expand description
    Create an iterator where you can put back multiple values to the front
 of the iteration.
    
diff --git a/itertools/fn.rciter.html b/itertools/fn.rciter.html
index 4668252a0..bc796d89d 100644
--- a/itertools/fn.rciter.html
+++ b/itertools/fn.rciter.html
@@ -1,4 +1,4 @@
-rciter in itertools - Rust
    
+rciter in itertools - Rust
    
     
    Function itertools::rciter
    source · 
    pub fn rciter<I>(iterable: I) -> RcIter<I::IntoIter> ⓘ
    where
     I: IntoIterator,
    Expand description
    Return an iterator inside a Rc<RefCell<_>> wrapper.
    
 
    The returned RcIter can be cloned, and each clone will refer back to the
diff --git a/itertools/fn.repeat_call.html b/itertools/fn.repeat_call.html
deleted file mode 100644
index 1b15ff6ca..000000000
--- a/itertools/fn.repeat_call.html
+++ /dev/null
@@ -1,22 +0,0 @@
-repeat_call in itertools - Rust
    
-    
    Function itertools::repeat_call
    source · 
    pub fn repeat_call<F, A>(function: F) -> RepeatCall<F> ⓘ
    where
-    F: FnMut() -> A,
    👎Deprecated since 0.8.0: Use std repeat_with() instead
    Expand description
    An iterator source that produces elements indefinitely by calling
-a given closure.
    
-
    Iterator element type is the return type of the closure.
    
-
-
    use itertools::repeat_call;
-use itertools::Itertools;
-use std::collections::BinaryHeap;
-
-let mut heap = BinaryHeap::from(vec![2, 5, 3, 7, 8]);
-
-// extract each element in sorted order
-for element in repeat_call(|| heap.pop()).while_some() {
-    print!("{}", element);
-}
-
-itertools::assert_equal(
-    repeat_call(|| 1).take(5),
-    vec![1, 1, 1, 1, 1]
-);
    
-
    
\ No newline at end of file
diff --git a/itertools/fn.repeat_n.html b/itertools/fn.repeat_n.html
index 135a528e7..b753ff7d7 100644
--- a/itertools/fn.repeat_n.html
+++ b/itertools/fn.repeat_n.html
@@ -1,4 +1,4 @@
-repeat_n in itertools - Rust
    
+repeat_n in itertools - Rust
    
     
    Function itertools::repeat_n
    source · 
    pub fn repeat_n<A>(element: A, n: usize) -> RepeatN<A> ⓘ
    where
     A: Clone,
    Expand description
    Create an iterator that produces n repetitions of element.
    
 
    
\ No newline at end of file
diff --git a/itertools/fn.rev.html b/itertools/fn.rev.html
index 2529fb336..75899ad9e 100644
--- a/itertools/fn.rev.html
+++ b/itertools/fn.rev.html
@@ -1,4 +1,4 @@
-rev in itertools - Rust
    
+rev in itertools - Rust
    
     
    Function itertools::rev
    source · 
    pub fn rev<I>(iterable: I) -> Rev<I::IntoIter>
    where
     I: IntoIterator,
     I::IntoIter: DoubleEndedIterator,
    Expand description
    Iterate iterable in reverse.
    
diff --git a/itertools/fn.sorted.html b/itertools/fn.sorted.html
index a1c782c26..8a861b080 100644
--- a/itertools/fn.sorted.html
+++ b/itertools/fn.sorted.html
@@ -1,4 +1,4 @@
-sorted in itertools - Rust
    
+sorted in itertools - Rust
    
     
    Function itertools::sorted
    source · 
    pub fn sorted<I>(iterable: I) -> IntoIter<I::Item> ⓘ
    where
     I: IntoIterator,
     I::Item: Ord,
    Expand description
    Sort all iterator elements into a new iterator in ascending order.
    
diff --git a/itertools/fn.sorted_unstable.html b/itertools/fn.sorted_unstable.html
index c6e94ab4e..de6596bae 100644
--- a/itertools/fn.sorted_unstable.html
+++ b/itertools/fn.sorted_unstable.html
@@ -1,9 +1,9 @@
-sorted_unstable in itertools - Rust
    
-    
    Function itertools::sorted_unstable
    source · 
    pub fn sorted_unstable<I>(iterable: I) -> IntoIter<I::Item> ⓘ
    where
+sorted_unstable in itertools - Rust
    
+    
    Function itertools::sorted_unstable
    source · 
    pub fn sorted_unstable<I>(iterable: I) -> IntoIter<I::Item> ⓘ
    where
     I: IntoIterator,
     I::Item: Ord,
    Expand description
    Sort all iterator elements into a new iterator in ascending order.
-This sort is unstable (i.e., may reorder equal elements).
-IntoIterator enabled version of Itertools::sorted_unstable.
    
+This sort is unstable (i.e., may reorder equal elements).
    
+
    IntoIterator enabled version of Itertools::sorted_unstable.
    
 
 
    use itertools::sorted_unstable;
 use itertools::assert_equal;
diff --git a/itertools/fn.unfold.html b/itertools/fn.unfold.html
index 8e172405c..b33368ca2 100644
--- a/itertools/fn.unfold.html
+++ b/itertools/fn.unfold.html
@@ -1,6 +1,6 @@
-unfold in itertools - Rust
    
-    
    Function itertools::unfold
    source · 
    pub fn unfold<A, St, F>(initial_state: St, f: F) -> Unfold<St, F> ⓘ
    where
-    F: FnMut(&mut St) -> Option<A>,
    Expand description
    Creates a new unfold source with the specified closure as the “iterator
+unfold in itertools - Rust
    
+    
    Function itertools::unfold
    source · 
    pub fn unfold<A, St, F>(initial_state: St, f: F) -> Unfold<St, F> ⓘ
    where
+    F: FnMut(&mut St) -> Option<A>,
    👎Deprecated since 0.13.0: Use std::iter::from_fn instead
    Expand description
    Creates a new unfold source with the specified closure as the “iterator
 function” and an initial state to eventually pass to the closure
    
 
    unfold is a general iterator builder: it has a mutable state value,
 and a closure with access to the state that produces the next value.
    
diff --git a/itertools/fn.zip.html b/itertools/fn.zip.html
index 3408848e5..02c02bc26 100644
--- a/itertools/fn.zip.html
+++ b/itertools/fn.zip.html
@@ -1,4 +1,4 @@
-zip in itertools - Rust
    
+zip in itertools - Rust
    
     
    Function itertools::zip
    source · 
    pub fn zip<I, J>(i: I, j: J) -> Zip<I::IntoIter, J::IntoIter>
    where
     I: IntoIterator,
     J: IntoIterator,
    👎Deprecated since 0.10.4: Use std::iter::zip instead
    Expand description
    Converts the arguments to iterators and zips them.
    
diff --git a/itertools/fn.zip_eq.html b/itertools/fn.zip_eq.html
index 0dfbaae98..5edb21787 100644
--- a/itertools/fn.zip_eq.html
+++ b/itertools/fn.zip_eq.html
@@ -1,8 +1,7 @@
-zip_eq in itertools - Rust
    
-    
    Function itertools::zip_eq
    source · 
    pub fn zip_eq<I, J>(i: I, j: J) -> ZipEq<I::IntoIter, J::IntoIter> ⓘ
    where
+zip_eq in itertools - Rust
    
+    
    Function itertools::zip_eq
    source · 
    pub fn zip_eq<I, J>(i: I, j: J) -> ZipEq<I::IntoIter, J::IntoIter> ⓘ
    where
     I: IntoIterator,
-    J: IntoIterator,
    Expand description
    Iterate i and j in lock step.
    
-
    Panics if the iterators are not of the same length.
    
+    J: IntoIterator,
    Expand description
    Zips two iterators but panics if they are not of the same length.
    
 
    IntoIterator enabled version of Itertools::zip_eq.
    
 
 
    use itertools::zip_eq;
diff --git a/itertools/groupbylazy/struct.ChunkBy.html b/itertools/groupbylazy/struct.ChunkBy.html
new file mode 100644
index 000000000..19a6529b4
--- /dev/null
+++ b/itertools/groupbylazy/struct.ChunkBy.html
@@ -0,0 +1,11 @@
+
+
+
+    
+    Redirection
+
+
+    
    Redirecting to ../../itertools/structs/struct.ChunkBy.html...
    
+    
+
+
\ No newline at end of file
diff --git a/itertools/groupbylazy/struct.GroupBy.html b/itertools/groupbylazy/struct.GroupBy.html
deleted file mode 100644
index c77f1d2dc..000000000
--- a/itertools/groupbylazy/struct.GroupBy.html
+++ /dev/null
@@ -1,11 +0,0 @@
-
-
-
-    
-    Redirection
-
-
-    
    Redirecting to ../../itertools/structs/struct.GroupBy.html...
    
-    
-
-
\ No newline at end of file
diff --git a/itertools/groupbylazy/type.GroupBy.html b/itertools/groupbylazy/type.GroupBy.html
new file mode 100644
index 000000000..2f6d9bce5
--- /dev/null
+++ b/itertools/groupbylazy/type.GroupBy.html
@@ -0,0 +1,11 @@
+
+
+
+    
+    Redirection
+
+
+    
    Redirecting to ../../itertools/structs/type.GroupBy.html...
    
+    
+
+
\ No newline at end of file
diff --git a/itertools/index.html b/itertools/index.html
index e6be3ea31..d32fa6f3c 100644
--- a/itertools/index.html
+++ b/itertools/index.html
@@ -1,6 +1,6 @@
-itertools - Rust
    
\ No newline at end of file
+of the iteration.
  • rciter
    Return an iterator inside a Rc<RefCell<_>> wrapper.
  • repeat_n
    Create an iterator that produces n repetitions of element.
  • rev
    Iterate iterable in reverse.
  • sorted
    Sort all iterator elements into a new iterator in ascending order.
  • sorted_unstable
    Sort all iterator elements into a new iterator in ascending order.
+This sort is unstable (i.e., may reorder equal elements).
  • unfoldDeprecated
    Creates a new unfold source with the specified closure as the “iterator
+function” and an initial state to eventually pass to the closure
  • zipDeprecated
    Converts the arguments to iterators and zips them.
  • zip_eq
    Zips two iterators but panics if they are not of the same length.
    • 
\ No newline at end of file
diff --git a/itertools/iter_index/trait.IteratorIndex.html b/itertools/iter_index/trait.IteratorIndex.html
new file mode 100644
index 000000000..9e650a808
--- /dev/null
+++ b/itertools/iter_index/trait.IteratorIndex.html
@@ -0,0 +1,11 @@
+
+
+
+    
+    Redirection
+
+
+    
    Redirecting to ../../itertools/traits/trait.IteratorIndex.html...
    
+    
+
+
\ No newline at end of file
diff --git a/itertools/macro.chain.html b/itertools/macro.chain.html
index 9094146ca..12da06f2e 100644
--- a/itertools/macro.chain.html
+++ b/itertools/macro.chain.html
@@ -1,5 +1,5 @@
-chain in itertools - Rust
    
-    
    Macro itertools::chain
    source · 
    macro_rules! chain {
+chain in itertools - Rust
    
+    
    Macro itertools::chain
    source · 
    macro_rules! chain {
     () => { ... };
     ($first:expr $(, $rest:expr )* $(,)?) => { ... };
 }
    Expand description
    Chain zero or more iterators together into one sequence.
    
diff --git a/itertools/macro.iproduct.html b/itertools/macro.iproduct.html
index 8d838e6a5..626b05955 100644
--- a/itertools/macro.iproduct.html
+++ b/itertools/macro.iproduct.html
@@ -1,10 +1,11 @@
-iproduct in itertools - Rust
    
-    
    Macro itertools::iproduct
    source · 
    macro_rules! iproduct {
+iproduct in itertools - Rust
    
+    
    Macro itertools::iproduct
    source · 
    macro_rules! iproduct {
     (@flatten $I:expr,) => { ... };
     (@flatten $I:expr, $J:expr, $($K:expr,)*) => { ... };
-    ($I:expr) => { ... };
-    ($I:expr, $J:expr) => { ... };
-    ($I:expr, $J:expr, $($K:expr),+) => { ... };
+    () => { ... };
+    ($I:expr $(,)?) => { ... };
+    ($I:expr, $J:expr $(,)?) => { ... };
+    ($I:expr, $J:expr, $($K:expr),+ $(,)?) => { ... };
 }
    Expand description
    Create an iterator over the “cartesian product” of iterators.
    
 
    Iterator element type is like (A, B, ..., E) if formed
 from iterators (I, J, ..., M) with element types I::Item = A, J::Item = B, etc.
    
diff --git a/itertools/macro.izip.html b/itertools/macro.izip.html
index 3c9bf1adb..ba87a3918 100644
--- a/itertools/macro.izip.html
+++ b/itertools/macro.izip.html
@@ -1,5 +1,5 @@
-izip in itertools - Rust
    
-    
    Macro itertools::izip
    source · 
    macro_rules! izip {
+izip in itertools - Rust
    
+    
    Macro itertools::izip
    source · 
    macro_rules! izip {
     ( @closure $p:pat => $tup:expr ) => { ... };
     ( @closure $p:pat => ( $($tup:tt)* ) , $_iter:expr $( , $tail:expr )* ) => { ... };
     ($first:expr $(,)*) => { ... };
diff --git a/itertools/sidebar-items.js b/itertools/sidebar-items.js
index 32a5cffa1..26600a29c 100644
--- a/itertools/sidebar-items.js
+++ b/itertools/sidebar-items.js
@@ -1 +1 @@
-window.SIDEBAR_ITEMS = {"enum":["Diff","Either","EitherOrBoth","FoldWhile","MinMaxResult","Position"],"fn":["all","any","assert_equal","chain","cloned","concat","cons_tuples","diff_with","enumerate","equal","fold","interleave","intersperse","intersperse_with","iterate","join","kmerge","kmerge_by","max","merge","merge_join_by","min","multipeek","multiunzip","multizip","partition","peek_nth","process_results","put_back","put_back_n","rciter","repeat_call","repeat_n","rev","sorted","sorted_unstable","unfold","zip","zip_eq"],"macro":["chain","iproduct","izip"],"mod":["structs","traits"],"trait":["Itertools","MultiUnzip","PeekingNext"]};
\ No newline at end of file
+window.SIDEBAR_ITEMS = {"enum":["Diff","Either","EitherOrBoth","FoldWhile","MinMaxResult","Position"],"fn":["all","any","assert_equal","chain","cloned","concat","cons_tuples","diff_with","enumerate","equal","fold","interleave","intersperse","intersperse_with","iterate","join","kmerge","kmerge_by","max","merge","merge_join_by","min","multipeek","multiunzip","multizip","partition","peek_nth","process_results","put_back","put_back_n","rciter","repeat_n","rev","sorted","sorted_unstable","unfold","zip","zip_eq"],"macro":["chain","iproduct","izip"],"mod":["structs","traits"],"trait":["Itertools","MultiUnzip","PeekingNext"]};
\ No newline at end of file
diff --git a/itertools/sources/fn.repeat_call.html b/itertools/sources/fn.repeat_call.html
deleted file mode 100644
index a7120572c..000000000
--- a/itertools/sources/fn.repeat_call.html
+++ /dev/null
@@ -1,11 +0,0 @@
-
-
-
-    
-    Redirection
-
-
-    
    Redirecting to ../../itertools/fn.repeat_call.html...
    
-    
-
-
\ No newline at end of file
diff --git a/itertools/sources/struct.RepeatCall.html b/itertools/sources/struct.RepeatCall.html
deleted file mode 100644
index 1be6f7283..000000000
--- a/itertools/sources/struct.RepeatCall.html
+++ /dev/null
@@ -1,11 +0,0 @@
-
-
-
-    
-    Redirection
-
-
-    
    Redirecting to ../../itertools/structs/struct.RepeatCall.html...
    
-    
-
-
\ No newline at end of file
diff --git a/itertools/structs/index.html b/itertools/structs/index.html
index 5b760f217..a3578602e 100644
--- a/itertools/structs/index.html
+++ b/itertools/structs/index.html
@@ -1,12 +1,12 @@
-itertools::structs - Rust
    
-    
    Module itertools::structs
    source · 
    Expand description
    The concrete iterator types.
    
+itertools::structs - Rust
    
+    
    Module itertools::structs
    source · 
    Expand description
    The concrete iterator types.
    
 
    Structs§
    • Batching
      A “meta iterator adaptor”. Its closure receives a reference to the iterator
-and may pick off as many elements as it likes, to produce the next iterator element.
    • Chunk
      An iterator for the elements in a single chunk.
    • Chunks
      An iterator that yields the Chunk iterators.
    • CircularTupleWindows
      An iterator over all windows, wrapping back to the first elements when the
+and may pick off as many elements as it likes, to produce the next iterator element.
    • Chunk
      An iterator for the elements in a single chunk.
    • ChunkBy
      ChunkBy is the storage for the lazy grouping operation.
    • Chunks
      An iterator that yields the Chunk iterators.
    • CircularTupleWindows
      An iterator over all windows, wrapping back to the first elements when the
 window would otherwise exceed the length of the iterator, producing tuples
 of a specific size.
    • Combinations
      An iterator to iterate through all the k-length combinations in an iterator.
    • CombinationsWithReplacement
      An iterator to iterate through all the n-length combinations in an iterator, with replacement.
    • ConsTuples
      An iterator that maps an iterator of tuples like
 ((A, B), C) to an iterator of (A, B, C).
    • ExactlyOneError
      Iterator returned for the error case of Itertools::exactly_one()
 This iterator yields exactly the same elements as the input iterator.
    • FilterMapOk
      An iterator adapter to filter and apply a transformation on values within a nested Result::Ok.
    • FilterOk
      An iterator adapter to filter values within a nested Result::Ok.
    • FlattenOk
      An iterator adaptor that flattens Result::Ok values and
-allows Result::Err values through unchanged.
    • Format
      Format all iterator elements lazily, separated by sep.
    • FormatWith
      Format all iterator elements lazily, separated by sep.
    • Group
      An iterator for the elements in a single group.
    • GroupBy
      GroupBy is the storage for the lazy grouping operation.
    • GroupingMap
      GroupingMap is an intermediate struct for efficient group-and-fold operations.
+allows Result::Err values through unchanged.
    • Format
      Format all iterator elements lazily, separated by sep.
    • FormatWith
      Format all iterator elements lazily, separated by sep.
    • Group
      An iterator for the elements in a single group.
    • GroupingMap
      GroupingMap is an intermediate struct for efficient group-and-fold operations.
 It groups elements by their key and at the same time fold each group
 using some aggregating operation.
    • Groups
      An iterator that yields the Group iterators.
    • Interleave
      An iterator adaptor that alternates elements from two iterators until both
 run out.
    • InterleaveShortest
      An iterator adaptor that alternates elements from the two iterators until
@@ -20,15 +20,16 @@ elements from an iterator.
    • Product
      An iterator adaptor that iterates over the cartesian product of
 the element sets of two iterators I and J.
    • PutBack
      An iterator adaptor that allows putting back a single
 item to the front of the iterator.
    • PutBackN
      An iterator adaptor that allows putting multiple
-items in front of the iterator.
    • RcIter
      A wrapper for Rc<RefCell<I>>, that implements the Iterator trait.
    • RepeatCallDeprecated
      See repeat_call for more information.
    • RepeatN
      An iterator that produces n repetitions of an element.
    • StepDeprecated
      An iterator adaptor that steps a number elements in the base iterator
-for each iteration.
    • TakeWhileInclusive
      An iterator adaptor that consumes elements while the given predicate is
+items in front of the iterator.
    • RcIter
      A wrapper for Rc<RefCell<I>>, that implements the Iterator trait.
    • RepeatN
      An iterator that produces n repetitions of an element.
    • TakeWhileInclusive
      An iterator adaptor that consumes elements while the given predicate is
 true, including the element for which the predicate first returned
 false.
    • TakeWhileRef
      An iterator adaptor that borrows from a Clone-able iterator
 to only pick off elements while the predicate returns true.
    • Tee
      One half of an iterator pair where both return the same elements.
    • TupleBuffer
      An iterator over a incomplete tuple.
    • TupleCombinations
      An iterator to iterate through all combinations in a Clone-able iterator that produces tuples
-of a specific size.
    • TupleWindows
      An iterator over all contiguous windows that produces tuples of a specific size.
    • Tuples
      An iterator that groups the items in tuples of a specific size.
    • Unfold
      See unfold for more information.
    • Unique
      An iterator adapter to filter out duplicate elements.
    • UniqueBy
      An iterator adapter to filter out duplicate elements.
    • Update
      An iterator adapter to apply a mutating function to each element before yielding it.
    • WhileSome
      An iterator adaptor that filters Option<A> iterator elements
-and produces A. Stops on the first None encountered.
    • WithPosition
      An iterator adaptor that wraps each element in an Position.
    • Zip
      See multizip for more information.
    • ZipEq
      An iterator which iterates two other iterators simultaneously
    • ZipLongest
      An iterator which iterates two other iterators simultaneously
    Type Aliases§
    • Coalesce
      An iterator adaptor that may join together adjacent elements.
    • Dedup
      An iterator adaptor that removes repeated duplicates.
    • DedupBy
      An iterator adaptor that removes repeated duplicates, determining equality using a comparison function.
    • DedupByWithCount
      An iterator adaptor that removes repeated duplicates, while keeping a count of how many
+of a specific size.
    • TupleWindows
      An iterator over all contiguous windows that produces tuples of a specific size.
    • Tuples
      An iterator that groups the items in tuples of a specific size.
    • UnfoldDeprecated
      See unfold for more information.
    • Unique
      An iterator adapter to filter out duplicate elements.
    • UniqueBy
      An iterator adapter to filter out duplicate elements.
    • Update
      An iterator adapter to apply a mutating function to each element before yielding it.
    • WhileSome
      An iterator adaptor that filters Option<A> iterator elements
+and produces A. Stops on the first None encountered.
    • WithPosition
      An iterator adaptor that wraps each element in an Position.
    • Zip
      See multizip for more information.
    • ZipEq
      An iterator which iterates two other iterators simultaneously
+and panic if they have different lengths.
    • ZipLongest
      An iterator which iterates two other iterators simultaneously
+and wraps the elements in EitherOrBoth.
    Type Aliases§
    • Coalesce
      An iterator adaptor that may join together adjacent elements.
    • Dedup
      An iterator adaptor that removes repeated duplicates.
    • DedupBy
      An iterator adaptor that removes repeated duplicates, determining equality using a comparison function.
    • DedupByWithCount
      An iterator adaptor that removes repeated duplicates, while keeping a count of how many
 repeated elements were present. This will determine equality using a comparison function.
    • DedupWithCount
      An iterator adaptor that removes repeated duplicates, while keeping a count of how many
-repeated elements were present.
    • Duplicates
      An iterator adapter to filter out duplicate elements.
    • DuplicatesBy
      An iterator adapter to filter for duplicate elements.
    • GroupingMapBy
      GroupingMapBy is an intermediate struct for efficient group-and-fold operations.
    • Intersperse
      An iterator adaptor to insert a particular value
+repeated elements were present.
    • Duplicates
      An iterator adapter to filter out duplicate elements.
    • DuplicatesBy
      An iterator adapter to filter for duplicate elements.
    • GroupByDeprecated
      See ChunkBy.
    • GroupingMapBy
      GroupingMapBy is an intermediate struct for efficient group-and-fold operations.
    • Intersperse
      An iterator adaptor to insert a particular value
 between each element of the adapted iterator.
    • KMerge
      An iterator adaptor that merges an abitrary number of base iterators in ascending order.
-If all base iterators are sorted (ascending), the result is sorted.
    • MapInto
      An iterator adapter to apply Into conversion to each element.
    • MapOk
      An iterator adapter to apply a transformation within a nested Result::Ok.
    • MapResultsDeprecated
      See MapOk.
    • Merge
      An iterator adaptor that merges the two base iterators in ascending order.
+If all base iterators are sorted (ascending), the result is sorted.
    • MapInto
      An iterator adapter to apply Into conversion to each element.
    • MapOk
      An iterator adapter to apply a transformation within a nested Result::Ok.
    • Merge
      An iterator adaptor that merges the two base iterators in ascending order.
 If both base iterators are sorted (ascending), the result is sorted.
    • MergeJoinBy
      An iterator adaptor that merge-joins items from the two base iterators in ascending order.
    
\ No newline at end of file
diff --git a/itertools/structs/sidebar-items.js b/itertools/structs/sidebar-items.js
index 816aa3370..311ca1ac2 100644
--- a/itertools/structs/sidebar-items.js
+++ b/itertools/structs/sidebar-items.js
@@ -1 +1 @@
-window.SIDEBAR_ITEMS = {"struct":["Batching","Chunk","Chunks","CircularTupleWindows","Combinations","CombinationsWithReplacement","ConsTuples","ExactlyOneError","FilterMapOk","FilterOk","FlattenOk","Format","FormatWith","Group","GroupBy","GroupingMap","Groups","Interleave","InterleaveShortest","IntersperseWith","IntoChunks","Iterate","KMergeBy","MergeBy","MultiPeek","MultiProduct","PadUsing","PeekNth","PeekingTakeWhile","Permutations","Positions","Powerset","ProcessResults","Product","PutBack","PutBackN","RcIter","RepeatCall","RepeatN","Step","TakeWhileInclusive","TakeWhileRef","Tee","TupleBuffer","TupleCombinations","TupleWindows","Tuples","Unfold","Unique","UniqueBy","Update","WhileSome","WithPosition","Zip","ZipEq","ZipLongest"],"type":["Coalesce","Dedup","DedupBy","DedupByWithCount","DedupWithCount","Duplicates","DuplicatesBy","GroupingMapBy","Intersperse","KMerge","MapInto","MapOk","MapResults","Merge","MergeJoinBy"]};
\ No newline at end of file
+window.SIDEBAR_ITEMS = {"struct":["Batching","Chunk","ChunkBy","Chunks","CircularTupleWindows","Combinations","CombinationsWithReplacement","ConsTuples","ExactlyOneError","FilterMapOk","FilterOk","FlattenOk","Format","FormatWith","Group","GroupingMap","Groups","Interleave","InterleaveShortest","IntersperseWith","IntoChunks","Iterate","KMergeBy","MergeBy","MultiPeek","MultiProduct","PadUsing","PeekNth","PeekingTakeWhile","Permutations","Positions","Powerset","ProcessResults","Product","PutBack","PutBackN","RcIter","RepeatN","TakeWhileInclusive","TakeWhileRef","Tee","TupleBuffer","TupleCombinations","TupleWindows","Tuples","Unfold","Unique","UniqueBy","Update","WhileSome","WithPosition","Zip","ZipEq","ZipLongest"],"type":["Coalesce","Dedup","DedupBy","DedupByWithCount","DedupWithCount","Duplicates","DuplicatesBy","GroupBy","GroupingMapBy","Intersperse","KMerge","MapInto","MapOk","Merge","MergeJoinBy"]};
\ No newline at end of file
diff --git a/itertools/structs/struct.Batching.html b/itertools/structs/struct.Batching.html
index a971dba89..ce7ddb1dd 100644
--- a/itertools/structs/struct.Batching.html
+++ b/itertools/structs/struct.Batching.html
@@ -1,12 +1,12 @@
-Batching in itertools::structs - Rust
    
-    
    Struct itertools::structs::Batching
    source · 
    pub struct Batching<I, F> { /* private fields */ }
    Expand description
    A “meta iterator adaptor”. Its closure receives a reference to the iterator
+Batching in itertools::structs - Rust
    
+    
    Struct itertools::structs::Batching
    source · 
    pub struct Batching<I, F> { /* private fields */ }
    Expand description
    A “meta iterator adaptor”. Its closure receives a reference to the iterator
 and may pick off as many elements as it likes, to produce the next iterator element.
    
-
    Iterator element type is X, if the return type of F is Option<X>.
    
+
    Iterator element type is X if the return type of F is Option<X>.
    
 
    See .batching() for more information.
    
-
    Trait Implementations§
    source§
    impl<I: Clone, F: Clone> Clone for Batching<I, F>
    source§
    fn clone(&self) -> Batching<I, F> ⓘ
    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<I, F> Debug for Batching<I, F>
    where
-    I: Debug,
    source§
    fn fmt(&self, f: &mut Formatter<'_>) -> Result
    Formats the value using the given formatter. Read more
    source§
    impl<B, F, I> Iterator for Batching<I, F>
    where
+
    Trait Implementations§
    source§
    impl<I: Clone, F: Clone> Clone for Batching<I, F>
    source§
    fn clone(&self) -> Batching<I, F> ⓘ
    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<I, F> Debug for Batching<I, F>
    where
+    I: Debug,
    source§
    fn fmt(&self, f: &mut Formatter<'_>) -> Result
    Formats the value using the given formatter. Read more
    source§
    impl<B, F, I> Iterator for Batching<I, F>
    where
     I: Iterator,
-    F: FnMut(&mut I) -> Option<B>,
    §
    type Item = B
    The type of the elements being iterated over.
    source§
    fn next(&mut self) -> Option<Self::Item>
    Advances the iterator and returns the next value. Read more
    source§
    fn next_chunk<const N: usize>(
+    F: FnMut(&mut I) -> Option<B>,
    §
    type Item = B
    The type of the elements being iterated over.
    source§
    fn next(&mut self) -> Option<Self::Item>
    Advances the iterator and returns the next value. Read more
    source§
    fn next_chunk<const N: usize>(
     &mut self
 ) -> Result<[Self::Item; N], IntoIter<Self::Item, N>>
    where
     Self: Sized,
    🔬This is a nightly-only experimental API. (iter_next_chunk)
    Advances the iterator and returns an array containing the next N values. Read more
    1.0.0 · source§
    fn size_hint(&self) -> (usize, Option<usize>)
    Returns the bounds on the remaining length of the iterator. Read more
    1.0.0 · source§
    fn count(self) -> usize
    where
@@ -211,86 +211,87 @@ otherwise. Right variant of Either<Self, Self>
 otherwise. Read more
    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> Itertools for T
    where
-    T: Iterator + ?Sized,
    source§
    fn interleave<J>(self, other: J) -> Interleave<Self, J::IntoIter> ⓘ
    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> Itertools for T
    where
+    T: Iterator + ?Sized,
    source§
    fn interleave<J>(self, other: J) -> Interleave<Self, J::IntoIter> ⓘ
    where
     J: IntoIterator<Item = Self::Item>,
-    Self: Sized,
    Alternate elements from two iterators until both have run out. Read more
    source§
    fn interleave_shortest<J>(
+    Self: Sized,
    Alternate elements from two iterators until both have run out. Read more
    source§
    fn interleave_shortest<J>(
     self,
     other: J
 ) -> InterleaveShortest<Self, J::IntoIter> ⓘ
    where
     J: IntoIterator<Item = Self::Item>,
     Self: Sized,
    Alternate elements from two iterators until at least one of them has run
-out. Read more
    source§
    fn intersperse(self, element: Self::Item) -> Intersperse<Self>
    where
+out. Read more
    source§
    fn intersperse(self, element: Self::Item) -> Intersperse<Self>
    where
     Self: Sized,
     Self::Item: Clone,
    An iterator adaptor to insert a particular value
-between each element of the adapted iterator. Read more
    source§
    fn intersperse_with<F>(self, element: F) -> IntersperseWith<Self, F> ⓘ
    where
+between each element of the adapted iterator. Read more
    source§
    fn intersperse_with<F>(self, element: F) -> IntersperseWith<Self, F> ⓘ
    where
     Self: Sized,
     F: FnMut() -> Self::Item,
    An iterator adaptor to insert a particular value created by a function
-between each element of the adapted iterator. Read more
    source§
    fn zip_longest<J>(self, other: J) -> ZipLongest<Self, J::IntoIter> ⓘ
    where
+between each element of the adapted iterator. Read more
    source§
    fn get<R>(self, index: R) -> R::Output
    where
+    Self: Sized,
+    R: IteratorIndex<Self>,
    Returns an iterator over a subsection of the iterator. Read more
    source§
    fn zip_longest<J>(self, other: J) -> ZipLongest<Self, J::IntoIter> ⓘ
    where
     J: IntoIterator,
     Self: Sized,
    Create an iterator which iterates over both this and the specified
-iterator simultaneously, yielding pairs of two optional elements. Read more
    source§
    fn zip_eq<J>(self, other: J) -> ZipEq<Self, J::IntoIter> ⓘ
    where
+iterator simultaneously, yielding pairs of two optional elements. Read more
    source§
    fn zip_eq<J>(self, other: J) -> ZipEq<Self, J::IntoIter> ⓘ
    where
     J: IntoIterator,
     Self: Sized,
    Create an iterator which iterates over both this and the specified
-iterator simultaneously, yielding pairs of elements. Read more
    source§
    fn batching<B, F>(self, f: F) -> Batching<Self, F> ⓘ
    where
+iterator simultaneously, yielding pairs of elements. Read more
    source§
    fn batching<B, F>(self, f: F) -> Batching<Self, F> ⓘ
    where
     F: FnMut(&mut Self) -> Option<B>,
     Self: Sized,
    A “meta iterator adaptor”. Its closure receives a reference to the
 iterator and may pick off as many elements as it likes, to produce the
-next iterator element. Read more
    source§
    fn group_by<K, F>(self, key: F) -> GroupBy<K, Self, F>
    where
+next iterator element. Read more
    source§
    fn chunk_by<K, F>(self, key: F) -> ChunkBy<K, Self, F>
    where
     Self: Sized,
     F: FnMut(&Self::Item) -> K,
     K: PartialEq,
    Return an iterable that can group iterator elements.
 Consecutive elements that map to the same key (“runs”), are assigned
-to the same group. Read more
    source§
    fn chunks(self, size: usize) -> IntoChunks<Self>
    where
-    Self: Sized,
    Return an iterable that can chunk the iterator. Read more
    source§
    fn tuple_windows<T>(self) -> TupleWindows<Self, T> ⓘ
    where
+to the same group. Read more
    source§
    fn group_by<K, F>(self, key: F) -> ChunkBy<K, Self, F>
    where
+    Self: Sized,
+    F: FnMut(&Self::Item) -> K,
+    K: PartialEq,
    👎Deprecated since 0.13.0: Use .chunk_by() instead
    See .chunk_by().
    source§
    fn chunks(self, size: usize) -> IntoChunks<Self>
    where
+    Self: Sized,
    Return an iterable that can chunk the iterator. Read more
    source§
    fn tuple_windows<T>(self) -> TupleWindows<Self, T> ⓘ
    where
     Self: Sized + Iterator<Item = T::Item>,
     T: HomogeneousTuple,
     T::Item: Clone,
    Return an iterator over all contiguous windows producing tuples of
-a specific size (up to 12). Read more
    source§
    fn circular_tuple_windows<T>(self) -> CircularTupleWindows<Self, T> ⓘ
    where
+a specific size (up to 12). Read more
    source§
    fn circular_tuple_windows<T>(self) -> CircularTupleWindows<Self, T> ⓘ
    where
     Self: Sized + Clone + Iterator<Item = T::Item> + ExactSizeIterator,
     T: TupleCollect + Clone,
     T::Item: Clone,
    Return an iterator over all windows, wrapping back to the first
 elements when the window would otherwise exceed the length of the
-iterator, producing tuples of a specific size (up to 12). Read more
    source§
    fn tuples<T>(self) -> Tuples<Self, T> ⓘ
    where
+iterator, producing tuples of a specific size (up to 12). Read more
    source§
    fn tuples<T>(self) -> Tuples<Self, T> ⓘ
    where
     Self: Sized + Iterator<Item = T::Item>,
     T: HomogeneousTuple,
    Return an iterator that groups the items in tuples of a specific size
-(up to 12). Read more
    source§
    fn tee(self) -> (Tee<Self>, Tee<Self>)
    where
+(up to 12). Read more
    source§
    fn tee(self) -> (Tee<Self>, Tee<Self>)
    where
     Self: Sized,
     Self::Item: Clone,
    Split into an iterator pair that both yield all elements from
-the original iterator. Read more
    source§
    fn step(self, n: usize) -> Step<Self> ⓘ
    where
-    Self: Sized,
    👎Deprecated since 0.8.0: Use std .step_by() instead
    Return an iterator adaptor that steps n elements in the base iterator
-for each iteration. Read more
    source§
    fn map_into<R>(self) -> MapInto<Self, R>
    where
+the original iterator. Read more
    source§
    fn map_into<R>(self) -> MapInto<Self, R>
    where
     Self: Sized,
-    Self::Item: Into<R>,
    Convert each item of the iterator using the Into trait. Read more
    source§
    fn map_results<F, T, U, E>(self, f: F) -> MapOk<Self, F>
    where
-    Self: Iterator<Item = Result<T, E>> + Sized,
-    F: FnMut(T) -> U,
    👎Deprecated since 0.10.0: Use .map_ok() instead
    See .map_ok().
    source§
    fn map_ok<F, T, U, E>(self, f: F) -> MapOk<Self, F>
    where
+    Self::Item: Into<R>,
    Convert each item of the iterator using the Into trait. Read more
    source§
    fn map_ok<F, T, U, E>(self, f: F) -> MapOk<Self, F>
    where
     Self: Iterator<Item = Result<T, E>> + Sized,
     F: FnMut(T) -> U,
    Return an iterator adaptor that applies the provided closure
 to every Result::Ok value. Result::Err values are
-unchanged. Read more
    source§
    fn filter_ok<F, T, E>(self, f: F) -> FilterOk<Self, F> ⓘ
    where
+unchanged. Read more
    source§
    fn filter_ok<F, T, E>(self, f: F) -> FilterOk<Self, F> ⓘ
    where
     Self: Iterator<Item = Result<T, E>> + Sized,
     F: FnMut(&T) -> bool,
    Return an iterator adaptor that filters every Result::Ok
 value with the provided closure. Result::Err values are
-unchanged. Read more
    source§
    fn filter_map_ok<F, T, U, E>(self, f: F) -> FilterMapOk<Self, F> ⓘ
    where
+unchanged. Read more
    source§
    fn filter_map_ok<F, T, U, E>(self, f: F) -> FilterMapOk<Self, F> ⓘ
    where
     Self: Iterator<Item = Result<T, E>> + Sized,
     F: FnMut(T) -> Option<U>,
    Return an iterator adaptor that filters and transforms every
 Result::Ok value with the provided closure. Result::Err
-values are unchanged. Read more
    source§
    fn flatten_ok<T, E>(self) -> FlattenOk<Self, T, E> ⓘ
    where
+values are unchanged. Read more
    source§
    fn flatten_ok<T, E>(self) -> FlattenOk<Self, T, E> ⓘ
    where
     Self: Iterator<Item = Result<T, E>> + Sized,
     T: IntoIterator,
    Return an iterator adaptor that flattens every Result::Ok value into
-a series of Result::Ok values. Result::Err values are unchanged. Read more
    source§
    fn process_results<F, T, E, R>(self, processor: F) -> Result<R, E>
    where
+a series of Result::Ok values. Result::Err values are unchanged. Read more
    source§
    fn process_results<F, T, E, R>(self, processor: F) -> Result<R, E>
    where
     Self: Iterator<Item = Result<T, E>> + Sized,
     F: FnOnce(ProcessResults<'_, Self, E>) -> R,
    “Lift” a function of the values of the current iterator so as to process
-an iterator of Result values instead. Read more
    source§
    fn merge<J>(self, other: J) -> Merge<Self, J::IntoIter>
    where
+an iterator of Result values instead. Read more
    source§
    fn merge<J>(self, other: J) -> Merge<Self, J::IntoIter>
    where
     Self: Sized,
     Self::Item: PartialOrd,
     J: IntoIterator<Item = Self::Item>,
    Return an iterator adaptor that merges the two base iterators in
 ascending order.  If both base iterators are sorted (ascending), the
-result is sorted. Read more
    source§
    fn merge_by<J, F>(self, other: J, is_first: F) -> MergeBy<Self, J::IntoIter, F> ⓘ
    where
+result is sorted. Read more
    source§
    fn merge_by<J, F>(self, other: J, is_first: F) -> MergeBy<Self, J::IntoIter, F> ⓘ
    where
     Self: Sized,
     J: IntoIterator<Item = Self::Item>,
     F: FnMut(&Self::Item, &Self::Item) -> bool,
    Return an iterator adaptor that merges the two base iterators in order.
-This is much like .merge() but allows for a custom ordering. Read more
    source§
    fn merge_join_by<J, F, T>(
+This is much like .merge() but allows for a custom ordering. Read more
    source§
    fn merge_join_by<J, F, T>(
     self,
     other: J,
     cmp_fn: F
@@ -298,284 +299,295 @@ This is much like IntoIterator,
     F: FnMut(&Self::Item, &J::Item) -> T,
     Self: Sized,
    Create an iterator that merges items from both this and the specified -iterator in ascending order. Read more
    source§

    fn kmerge(self) -> KMerge<<Self::Item as IntoIterator>::IntoIter>
    where +iterator in ascending order. Read more

    source§

    fn kmerge(self) -> KMerge<<Self::Item as IntoIterator>::IntoIter>
    where Self: Sized, Self::Item: IntoIterator, <Self::Item as IntoIterator>::Item: PartialOrd,

    Return an iterator adaptor that flattens an iterator of iterators by -merging them in ascending order. Read more
    source§

    fn kmerge_by<F>( +merging them in ascending order. Read more

    source§

    fn kmerge_by<F>( self, first: F ) -> KMergeBy<<Self::Item as IntoIterator>::IntoIter, F> ⓘ
    where Self: Sized, Self::Item: IntoIterator, F: FnMut(&<Self::Item as IntoIterator>::Item, &<Self::Item as IntoIterator>::Item) -> bool,

    Return an iterator adaptor that flattens an iterator of iterators by -merging them according to the given closure. Read more
    source§

    fn cartesian_product<J>(self, other: J) -> Product<Self, J::IntoIter> ⓘ
    where +merging them according to the given closure. Read more

    source§

    fn cartesian_product<J>(self, other: J) -> Product<Self, J::IntoIter> ⓘ
    where Self: Sized, Self::Item: Clone, J: IntoIterator, J::IntoIter: Clone,

    Return an iterator adaptor that iterates over the cartesian product of -the element sets of two iterators self and J. Read more
    source§

    fn multi_cartesian_product( +the element sets of two iterators self and J. Read more

    source§

    fn multi_cartesian_product( self ) -> MultiProduct<<Self::Item as IntoIterator>::IntoIter> ⓘ
    where Self: Sized, Self::Item: IntoIterator, <Self::Item as IntoIterator>::IntoIter: Clone, <Self::Item as IntoIterator>::Item: Clone,

    Return an iterator adaptor that iterates over the cartesian product of -all subiterators returned by meta-iterator self. Read more
    source§

    fn coalesce<F>(self, f: F) -> Coalesce<Self, F>
    where +all subiterators returned by meta-iterator self. Read more

    source§

    fn coalesce<F>(self, f: F) -> Coalesce<Self, F>
    where Self: Sized, F: FnMut(Self::Item, Self::Item) -> Result<Self::Item, (Self::Item, Self::Item)>,

    Return an iterator adaptor that uses the passed-in closure to -optionally merge together consecutive elements. Read more
    source§

    fn dedup(self) -> Dedup<Self>
    where +optionally merge together consecutive elements. Read more

    source§

    fn dedup(self) -> Dedup<Self>
    where Self: Sized, Self::Item: PartialEq,

    Remove duplicates from sections of consecutive identical elements. -If the iterator is sorted, all elements will be unique. Read more
    source§

    fn dedup_by<Cmp>(self, cmp: Cmp) -> DedupBy<Self, Cmp>
    where +If the iterator is sorted, all elements will be unique. Read more

    source§

    fn dedup_by<Cmp>(self, cmp: Cmp) -> DedupBy<Self, Cmp>
    where Self: Sized, Cmp: FnMut(&Self::Item, &Self::Item) -> bool,

    Remove duplicates from sections of consecutive identical elements, determining equality using a comparison function. -If the iterator is sorted, all elements will be unique. Read more
    source§

    fn dedup_with_count(self) -> DedupWithCount<Self>
    where +If the iterator is sorted, all elements will be unique. Read more

    source§

    fn dedup_with_count(self) -> DedupWithCount<Self>
    where Self: Sized,

    Remove duplicates from sections of consecutive identical elements, while keeping a count of how many repeated elements were present. -If the iterator is sorted, all elements will be unique. Read more
    source§

    fn dedup_by_with_count<Cmp>(self, cmp: Cmp) -> DedupByWithCount<Self, Cmp>
    where +If the iterator is sorted, all elements will be unique. Read more

    source§

    fn dedup_by_with_count<Cmp>(self, cmp: Cmp) -> DedupByWithCount<Self, Cmp>
    where Self: Sized, Cmp: FnMut(&Self::Item, &Self::Item) -> bool,

    Remove duplicates from sections of consecutive identical elements, while keeping a count of how many repeated elements were present. This will determine equality using a comparison function. -If the iterator is sorted, all elements will be unique. Read more
    source§

    fn duplicates(self) -> Duplicates<Self>
    where +If the iterator is sorted, all elements will be unique. Read more

    source§

    fn duplicates(self) -> Duplicates<Self>
    where Self: Sized, Self::Item: Eq + Hash,

    Return an iterator adaptor that produces elements that appear more than once during the -iteration. Duplicates are detected using hash and equality. Read more
    source§

    fn duplicates_by<V, F>(self, f: F) -> DuplicatesBy<Self, V, F>
    where +iteration. Duplicates are detected using hash and equality. Read more

    source§

    fn duplicates_by<V, F>(self, f: F) -> DuplicatesBy<Self, V, F>
    where Self: Sized, V: Eq + Hash, F: FnMut(&Self::Item) -> V,

    Return an iterator adaptor that produces elements that appear more than once during the -iteration. Duplicates are detected using hash and equality. Read more
    source§

    fn unique(self) -> Unique<Self> ⓘ
    where +iteration. Duplicates are detected using hash and equality. Read more

    source§

    fn unique(self) -> Unique<Self> ⓘ
    where Self: Sized, Self::Item: Clone + Eq + Hash,

    Return an iterator adaptor that filters out elements that have already been produced once during the iteration. Duplicates -are detected using hash and equality. Read more
    source§

    fn unique_by<V, F>(self, f: F) -> UniqueBy<Self, V, F> ⓘ
    where +are detected using hash and equality. Read more

    source§

    fn unique_by<V, F>(self, f: F) -> UniqueBy<Self, V, F> ⓘ
    where Self: Sized, V: Eq + Hash, F: FnMut(&Self::Item) -> V,

    Return an iterator adaptor that filters out elements that have -already been produced once during the iteration. Read more
    source§

    fn peeking_take_while<F>(&mut self, accept: F) -> PeekingTakeWhile<'_, Self, F> ⓘ
    where +already been produced once during the iteration. Read more

    source§

    fn peeking_take_while<F>(&mut self, accept: F) -> PeekingTakeWhile<'_, Self, F> ⓘ
    where Self: Sized + PeekingNext, F: FnMut(&Self::Item) -> bool,

    Return an iterator adaptor that borrows from this iterator and -takes items while the closure accept returns true. Read more
    source§

    fn take_while_ref<F>(&mut self, accept: F) -> TakeWhileRef<'_, Self, F> ⓘ
    where +takes items while the closure accept returns true. Read more

    source§

    fn take_while_ref<F>(&mut self, accept: F) -> TakeWhileRef<'_, Self, F> ⓘ
    where Self: Clone, F: FnMut(&Self::Item) -> bool,

    Return an iterator adaptor that borrows from a Clone-able iterator -to only pick off elements while the predicate accept returns true. Read more
    source§

    fn take_while_inclusive<F>(self, accept: F) -> TakeWhileInclusive<Self, F> ⓘ
    where +to only pick off elements while the predicate accept returns true. Read more

    source§

    fn take_while_inclusive<F>(self, accept: F) -> TakeWhileInclusive<Self, F> ⓘ
    where Self: Sized, F: FnMut(&Self::Item) -> bool,

    Returns an iterator adaptor that consumes elements while the given predicate is true, including the element for which the predicate -first returned false. Read more
    source§

    fn while_some<A>(self) -> WhileSome<Self> ⓘ
    where +first returned false. Read more

    source§

    fn while_some<A>(self) -> WhileSome<Self> ⓘ
    where Self: Sized + Iterator<Item = Option<A>>,

    Return an iterator adaptor that filters Option<A> iterator elements -and produces A. Stops on the first None encountered. Read more
    source§

    fn tuple_combinations<T>(self) -> TupleCombinations<Self, T> ⓘ
    where +and produces A. Stops on the first None encountered. Read more

    source§

    fn tuple_combinations<T>(self) -> TupleCombinations<Self, T> ⓘ
    where Self: Sized + Clone, Self::Item: Clone, T: HasCombination<Self>,

    Return an iterator adaptor that iterates over the combinations of the -elements from an iterator. Read more
    source§

    fn combinations(self, k: usize) -> Combinations<Self> ⓘ
    where +elements from an iterator. Read more

    source§

    fn combinations(self, k: usize) -> Combinations<Self> ⓘ
    where Self: Sized, Self::Item: Clone,

    Return an iterator adaptor that iterates over the k-length combinations of -the elements from an iterator. Read more
    source§

    fn combinations_with_replacement( +the elements from an iterator. Read more

    source§

    fn combinations_with_replacement( self, k: usize ) -> CombinationsWithReplacement<Self> ⓘ
    where Self: Sized, Self::Item: Clone,

    Return an iterator that iterates over the k-length combinations of -the elements from an iterator, with replacement. Read more
    source§

    fn permutations(self, k: usize) -> Permutations<Self> ⓘ
    where +the elements from an iterator, with replacement. Read more

    source§

    fn permutations(self, k: usize) -> Permutations<Self> ⓘ
    where Self: Sized, Self::Item: Clone,

    Return an iterator adaptor that iterates over all k-permutations of the -elements from an iterator. Read more
    source§

    fn powerset(self) -> Powerset<Self> ⓘ
    where +elements from an iterator. Read more

    source§

    fn powerset(self) -> Powerset<Self> ⓘ
    where Self: Sized, Self::Item: Clone,

    Return an iterator that iterates through the powerset of the elements from an -iterator. Read more
    source§

    fn pad_using<F>(self, min: usize, f: F) -> PadUsing<Self, F> ⓘ
    where +iterator. Read more

    source§

    fn pad_using<F>(self, min: usize, f: F) -> PadUsing<Self, F> ⓘ
    where Self: Sized, F: FnMut(usize) -> Self::Item,

    Return an iterator adaptor that pads the sequence to a minimum length of -min by filling missing elements using a closure f. Read more
    source§

    fn with_position(self) -> WithPosition<Self> ⓘ
    where +min by filling missing elements using a closure f. Read more

    source§

    fn with_position(self) -> WithPosition<Self> ⓘ
    where Self: Sized,

    Return an iterator adaptor that combines each element with a Position to -ease special-case handling of the first or last elements. Read more
    source§

    fn positions<P>(self, predicate: P) -> Positions<Self, P> ⓘ
    where +ease special-case handling of the first or last elements. Read more

    source§

    fn positions<P>(self, predicate: P) -> Positions<Self, P> ⓘ
    where Self: Sized, P: FnMut(Self::Item) -> bool,

    Return an iterator adaptor that yields the indices of all elements -satisfying a predicate, counted from the start of the iterator. Read more
    source§

    fn update<F>(self, updater: F) -> Update<Self, F> ⓘ
    where +satisfying a predicate, counted from the start of the iterator. Read more

    source§

    fn update<F>(self, updater: F) -> Update<Self, F> ⓘ
    where Self: Sized, F: FnMut(&mut Self::Item),

    Return an iterator adaptor that applies a mutating function -to each element before yielding it. Read more
    source§

    fn next_tuple<T>(&mut self) -> Option<T>
    where +to each element before yielding it. Read more

    source§

    fn next_tuple<T>(&mut self) -> Option<T>
    where Self: Sized + Iterator<Item = T::Item>, T: HomogeneousTuple,

    Advances the iterator and returns the next items grouped in a tuple of -a specific size (up to 12). Read more
    source§

    fn collect_tuple<T>(self) -> Option<T>
    where +a specific size (up to 12). Read more

    source§

    fn collect_tuple<T>(self) -> Option<T>
    where Self: Sized + Iterator<Item = T::Item>, T: HomogeneousTuple,

    Collects all items from the iterator into a tuple of a specific size -(up to 12). Read more
    source§

    fn find_position<P>(&mut self, pred: P) -> Option<(usize, Self::Item)>
    where - P: FnMut(&Self::Item) -> bool,

    Find the position and value of the first element satisfying a predicate. Read more
    source§

    fn find_or_last<P>(self, predicate: P) -> Option<Self::Item>
    where +(up to 12). Read more

    source§

    fn find_position<P>(&mut self, pred: P) -> Option<(usize, Self::Item)>
    where + P: FnMut(&Self::Item) -> bool,

    Find the position and value of the first element satisfying a predicate. Read more
    source§

    fn find_or_last<P>(self, predicate: P) -> Option<Self::Item>
    where Self: Sized, - P: FnMut(&Self::Item) -> bool,

    Find the value of the first element satisfying a predicate or return the last element, if any. Read more
    source§

    fn find_or_first<P>(self, predicate: P) -> Option<Self::Item>
    where + P: FnMut(&Self::Item) -> bool,

    Find the value of the first element satisfying a predicate or return the last element, if any. Read more
    source§

    fn find_or_first<P>(self, predicate: P) -> Option<Self::Item>
    where Self: Sized, - P: FnMut(&Self::Item) -> bool,

    Find the value of the first element satisfying a predicate or return the first element, if any. Read more
    source§

    fn contains<Q>(&mut self, query: &Q) -> bool
    where + P: FnMut(&Self::Item) -> bool,

    Find the value of the first element satisfying a predicate or return the first element, if any. Read more
    source§

    fn contains<Q>(&mut self, query: &Q) -> bool
    where Self: Sized, Self::Item: Borrow<Q>, - Q: PartialEq,

    Returns true if the given item is present in this iterator. Read more
    source§

    fn all_equal(&mut self) -> bool
    where + Q: PartialEq,

    Returns true if the given item is present in this iterator. Read more
    source§

    fn all_equal(&mut self) -> bool
    where Self: Sized, - Self::Item: PartialEq,

    Check whether all elements compare equal. Read more
    source§

    fn all_equal_value( + Self::Item: PartialEq,

    Check whether all elements compare equal. Read more
    source§

    fn all_equal_value( &mut self ) -> Result<Self::Item, Option<(Self::Item, Self::Item)>>
    where Self: Sized, Self::Item: PartialEq,

    If there are elements and they are all equal, return a single copy of that element. If there are no elements, return an Error containing None. If there are elements and they are not all equal, return a tuple containing the first -two non-equal elements found. Read more
    source§

    fn all_unique(&mut self) -> bool
    where +two non-equal elements found. Read more

    source§

    fn all_unique(&mut self) -> bool
    where Self: Sized, - Self::Item: Eq + Hash,

    Check whether all elements are unique (non equal). Read more
    source§

    fn dropping(self, n: usize) -> Self
    where + Self::Item: Eq + Hash,

    Check whether all elements are unique (non equal). Read more
    source§

    fn dropping(self, n: usize) -> Self
    where Self: Sized,

    Consume the first n elements from the iterator eagerly, -and return the same iterator again. Read more
    source§

    fn dropping_back(self, n: usize) -> Self
    where +and return the same iterator again. Read more

    source§

    fn dropping_back(self, n: usize) -> Self
    where Self: Sized + DoubleEndedIterator,

    Consume the last n elements from the iterator eagerly, -and return the same iterator again. Read more
    source§

    fn foreach<F>(self, f: F)
    where - F: FnMut(Self::Item), - Self: Sized,

    👎Deprecated since 0.8.0: Use .for_each() instead
    Run the closure f eagerly on each element of the iterator. Read more
    source§

    fn concat(self) -> Self::Item
    where +and return the same iterator again. Read more

    source§

    fn concat(self) -> Self::Item
    where Self: Sized, - Self::Item: Extend<<<Self as Iterator>::Item as IntoIterator>::Item> + IntoIterator + Default,

    Combine all an iterator’s elements into one element by using Extend. Read more
    source§

    fn collect_vec(self) -> Vec<Self::Item>
    where + Self::Item: Extend<<<Self as Iterator>::Item as IntoIterator>::Item> + IntoIterator + Default,

    Combine all an iterator’s elements into one element by using Extend. Read more
    source§

    fn collect_vec(self) -> Vec<Self::Item>
    where Self: Sized,

    .collect_vec() is simply a type specialization of Iterator::collect, -for convenience.
    source§

    fn try_collect<T, U, E>(self) -> Result<U, E>
    where +for convenience.

    source§

    fn try_collect<T, U, E>(self) -> Result<U, E>
    where Self: Sized + Iterator<Item = Result<T, E>>, Result<U, E>: FromIterator<Result<T, E>>,

    .try_collect() is more convenient way of writing -.collect::<Result<_, _>>() Read more
    source§

    fn set_from<'a, A: 'a, J>(&mut self, from: J) -> usize
    where +.collect::<Result<_, _>>() Read more

    source§

    fn set_from<'a, A: 'a, J>(&mut self, from: J) -> usize
    where Self: Iterator<Item = &'a mut A>, J: IntoIterator<Item = A>,

    Assign to each reference in self from the from iterator, -stopping at the shortest of the two iterators. Read more
    source§

    fn join(&mut self, sep: &str) -> String
    where - Self::Item: Display,

    Combine all iterator elements into one String, separated by sep. Read more
    source§

    fn format(self, sep: &str) -> Format<'_, Self>
    where - Self: Sized,

    Format all iterator elements, separated by sep. Read more
    source§

    fn format_with<F>(self, sep: &str, format: F) -> FormatWith<'_, Self, F>
    where +stopping at the shortest of the two iterators. Read more

    source§

    fn join(&mut self, sep: &str) -> String
    where + Self::Item: Display,

    Combine all iterator elements into one String, separated by sep. Read more
    source§

    fn format(self, sep: &str) -> Format<'_, Self>
    where + Self: Sized,

    Format all iterator elements, separated by sep. Read more
    source§

    fn format_with<F>(self, sep: &str, format: F) -> FormatWith<'_, Self, F>
    where Self: Sized, - F: FnMut(Self::Item, &mut dyn FnMut(&dyn Display) -> Result) -> Result,

    Format all iterator elements, separated by sep. Read more
    source§

    fn fold_results<A, E, B, F>(&mut self, start: B, f: F) -> Result<B, E>
    where + F: FnMut(Self::Item, &mut dyn FnMut(&dyn Display) -> Result) -> Result,

    Format all iterator elements, separated by sep. Read more
    source§

    fn fold_ok<A, E, B, F>(&mut self, start: B, f: F) -> Result<B, E>
    where Self: Iterator<Item = Result<A, E>>, - F: FnMut(B, A) -> B,

    👎Deprecated since 0.10.0: Use .fold_ok() instead
    See .fold_ok().
    source§

    fn fold_ok<A, E, B, F>(&mut self, start: B, f: F) -> Result<B, E>
    where - Self: Iterator<Item = Result<A, E>>, - F: FnMut(B, A) -> B,

    Fold Result values from an iterator. Read more
    source§

    fn fold_options<A, B, F>(&mut self, start: B, f: F) -> Option<B>
    where + F: FnMut(B, A) -> B,

    Fold Result values from an iterator. Read more
    source§

    fn fold_options<A, B, F>(&mut self, start: B, f: F) -> Option<B>
    where Self: Iterator<Item = Option<A>>, - F: FnMut(B, A) -> B,

    Fold Option values from an iterator. Read more
    source§

    fn fold1<F>(self, f: F) -> Option<Self::Item>
    where + F: FnMut(B, A) -> B,

    Fold Option values from an iterator. Read more
    source§

    fn fold1<F>(self, f: F) -> Option<Self::Item>
    where F: FnMut(Self::Item, Self::Item) -> Self::Item, - Self: Sized,

    👎Deprecated since 0.10.2: Use Iterator::reduce instead
    Accumulator of the elements in the iterator. Read more
    source§

    fn tree_fold1<F>(self, f: F) -> Option<Self::Item>
    where + Self: Sized,

    👎Deprecated since 0.10.2: Use Iterator::reduce instead
    Accumulator of the elements in the iterator. Read more
    source§

    fn tree_reduce<F>(self, f: F) -> Option<Self::Item>
    where F: FnMut(Self::Item, Self::Item) -> Self::Item, - Self: Sized,

    Accumulate the elements in the iterator in a tree-like manner. Read more
    source§

    fn fold_while<B, F>(&mut self, init: B, f: F) -> FoldWhile<B>
    where + Self: Sized,

    Accumulate the elements in the iterator in a tree-like manner. Read more
    source§

    fn tree_fold1<F>(self, f: F) -> Option<Self::Item>
    where + F: FnMut(Self::Item, Self::Item) -> Self::Item, + Self: Sized,

    👎Deprecated since 0.13.0: Use .tree_reduce() instead
    See .tree_reduce().
    source§

    fn fold_while<B, F>(&mut self, init: B, f: F) -> FoldWhile<B>
    where Self: Sized, - F: FnMut(B, Self::Item) -> FoldWhile<B>,

    An iterator method that applies a function, producing a single, final value. Read more
    source§

    fn sum1<S>(self) -> Option<S>
    where + F: FnMut(B, Self::Item) -> FoldWhile<B>,

    An iterator method that applies a function, producing a single, final value. Read more
    source§

    fn sum1<S>(self) -> Option<S>
    where Self: Sized, - S: Sum<Self::Item>,

    Iterate over the entire iterator and add all the elements. Read more
    source§

    fn product1<P>(self) -> Option<P>
    where + S: Sum<Self::Item>,

    Iterate over the entire iterator and add all the elements. Read more
    source§

    fn product1<P>(self) -> Option<P>
    where Self: Sized, - P: Product<Self::Item>,

    Iterate over the entire iterator and multiply all the elements. Read more
    source§

    fn sorted_unstable(self) -> IntoIter<Self::Item> ⓘ
    where + P: Product<Self::Item>,

    Iterate over the entire iterator and multiply all the elements. Read more
    source§

    fn sorted_unstable(self) -> IntoIter<Self::Item> ⓘ
    where Self: Sized, - Self::Item: Ord,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_unstable_by<F>(self, cmp: F) -> IntoIter<Self::Item> ⓘ
    where + Self::Item: Ord,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_unstable_by<F>(self, cmp: F) -> IntoIter<Self::Item> ⓘ
    where Self: Sized, - F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_unstable_by_key<K, F>(self, f: F) -> IntoIter<Self::Item> ⓘ
    where + F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_unstable_by_key<K, F>(self, f: F) -> IntoIter<Self::Item> ⓘ
    where Self: Sized, K: Ord, - F: FnMut(&Self::Item) -> K,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted(self) -> IntoIter<Self::Item> ⓘ
    where + F: FnMut(&Self::Item) -> K,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted(self) -> IntoIter<Self::Item> ⓘ
    where Self: Sized, - Self::Item: Ord,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_by<F>(self, cmp: F) -> IntoIter<Self::Item> ⓘ
    where + Self::Item: Ord,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_by<F>(self, cmp: F) -> IntoIter<Self::Item> ⓘ
    where Self: Sized, - F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_by_key<K, F>(self, f: F) -> IntoIter<Self::Item> ⓘ
    where + F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_by_key<K, F>(self, f: F) -> IntoIter<Self::Item> ⓘ
    where Self: Sized, K: Ord, - F: FnMut(&Self::Item) -> K,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_by_cached_key<K, F>(self, f: F) -> IntoIter<Self::Item> ⓘ
    where + F: FnMut(&Self::Item) -> K,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_by_cached_key<K, F>(self, f: F) -> IntoIter<Self::Item> ⓘ
    where Self: Sized, K: Ord, F: FnMut(&Self::Item) -> K,

    Sort all iterator elements into a new iterator in ascending order. The key function is -called exactly once per key. Read more
    source§

    fn k_smallest(self, k: usize) -> IntoIter<Self::Item> ⓘ
    where +called exactly once per key. Read more

    source§

    fn k_smallest(self, k: usize) -> IntoIter<Self::Item> ⓘ
    where Self: Sized, - Self::Item: Ord,

    Sort the k smallest elements into a new iterator, in ascending order. Read more
    source§

    fn partition_map<A, B, F, L, R>(self, predicate: F) -> (A, B)
    where + Self::Item: Ord,

    Sort the k smallest elements into a new iterator, in ascending order. Read more
    source§

    fn k_smallest_by<F>(self, k: usize, cmp: F) -> IntoIter<Self::Item> ⓘ
    where + Self: Sized, + F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Sort the k smallest elements into a new iterator using the provided comparison. Read more
    source§

    fn k_smallest_by_key<F, K>(self, k: usize, key: F) -> IntoIter<Self::Item> ⓘ
    where + Self: Sized, + F: FnMut(&Self::Item) -> K, + K: Ord,

    Return the elements producing the k smallest outputs of the provided function. Read more
    source§

    fn k_largest(self, k: usize) -> IntoIter<Self::Item> ⓘ
    where + Self: Sized, + Self::Item: Ord,

    Sort the k largest elements into a new iterator, in descending order. Read more
    source§

    fn k_largest_by<F>(self, k: usize, cmp: F) -> IntoIter<Self::Item> ⓘ
    where + Self: Sized, + F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Sort the k largest elements into a new iterator using the provided comparison. Read more
    source§

    fn k_largest_by_key<F, K>(self, k: usize, key: F) -> IntoIter<Self::Item> ⓘ
    where + Self: Sized, + F: FnMut(&Self::Item) -> K, + K: Ord,

    Return the elements producing the k largest outputs of the provided function. Read more
    source§

    fn tail(self, n: usize) -> IntoIter<Self::Item> ⓘ
    where + Self: Sized,

    Consumes the iterator and return an iterator of the last n elements. Read more
    source§

    fn partition_map<A, B, F, L, R>(self, predicate: F) -> (A, B)
    where Self: Sized, F: FnMut(Self::Item) -> Either<L, R>, A: Default + Extend<L>, B: Default + Extend<R>,

    Collect all iterator elements into one of two partitions. Unlike Iterator::partition, each partition may -have a distinct type. Read more
    source§

    fn partition_result<A, B, T, E>(self) -> (A, B)
    where +have a distinct type. Read more

    source§

    fn partition_result<A, B, T, E>(self) -> (A, B)
    where Self: Iterator<Item = Result<T, E>> + Sized, A: Default + Extend<T>, B: Default + Extend<E>,

    Partition a sequence of Results into one list of all the Ok elements -and another list of all the Err elements. Read more
    source§

    fn into_group_map<K, V>(self) -> HashMap<K, Vec<V>>
    where +and another list of all the Err elements. Read more

    source§

    fn into_group_map<K, V>(self) -> HashMap<K, Vec<V>>
    where Self: Iterator<Item = (K, V)> + Sized, K: Hash + Eq,

    Return a HashMap of keys mapped to Vecs of values. Keys and values -are taken from (Key, Value) tuple pairs yielded by the input iterator. Read more
    source§

    fn into_group_map_by<K, V, F>(self, f: F) -> HashMap<K, Vec<V>>
    where +are taken from (Key, Value) tuple pairs yielded by the input iterator. Read more

    source§

    fn into_group_map_by<K, V, F>(self, f: F) -> HashMap<K, Vec<V>>
    where Self: Iterator<Item = V> + Sized, K: Hash + Eq, - F: Fn(&V) -> K,

    Return an Iterator on a HashMap. Keys mapped to Vecs of values. The key is specified -in the closure. Read more
    source§

    fn into_grouping_map<K, V>(self) -> GroupingMap<Self>
    where + F: FnMut(&V) -> K,

    Return an Iterator on a HashMap. Keys mapped to Vecs of values. The key is specified +in the closure. Read more
    source§

    fn into_grouping_map<K, V>(self) -> GroupingMap<Self>
    where Self: Iterator<Item = (K, V)> + Sized, K: Hash + Eq,

    Constructs a GroupingMap to be used later with one of the efficient -group-and-fold operations it allows to perform. Read more
    source§

    fn into_grouping_map_by<K, V, F>(self, key_mapper: F) -> GroupingMapBy<Self, F>
    where +group-and-fold operations it allows to perform. Read more

    source§

    fn into_grouping_map_by<K, V, F>(self, key_mapper: F) -> GroupingMapBy<Self, F>
    where Self: Iterator<Item = V> + Sized, K: Hash + Eq, F: FnMut(&V) -> K,

    Constructs a GroupingMap to be used later with one of the efficient -group-and-fold operations it allows to perform. Read more
    source§

    fn min_set(self) -> Vec<Self::Item>
    where +group-and-fold operations it allows to perform. Read more

    source§

    fn min_set(self) -> Vec<Self::Item>
    where Self: Sized, - Self::Item: Ord,

    Return all minimum elements of an iterator. Read more
    source§

    fn min_set_by<F>(self, compare: F) -> Vec<Self::Item>
    where + Self::Item: Ord,

    Return all minimum elements of an iterator. Read more
    source§

    fn min_set_by<F>(self, compare: F) -> Vec<Self::Item>
    where Self: Sized, F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Return all minimum elements of an iterator, as determined by -the specified function. Read more
    source§

    fn min_set_by_key<K, F>(self, key: F) -> Vec<Self::Item>
    where +the specified function. Read more

    source§

    fn min_set_by_key<K, F>(self, key: F) -> Vec<Self::Item>
    where Self: Sized, K: Ord, F: FnMut(&Self::Item) -> K,

    Return all minimum elements of an iterator, as determined by -the specified function. Read more
    source§

    fn max_set(self) -> Vec<Self::Item>
    where +the specified function. Read more

    source§

    fn max_set(self) -> Vec<Self::Item>
    where Self: Sized, - Self::Item: Ord,

    Return all maximum elements of an iterator. Read more
    source§

    fn max_set_by<F>(self, compare: F) -> Vec<Self::Item>
    where + Self::Item: Ord,

    Return all maximum elements of an iterator. Read more
    source§

    fn max_set_by<F>(self, compare: F) -> Vec<Self::Item>
    where Self: Sized, F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Return all maximum elements of an iterator, as determined by -the specified function. Read more
    source§

    fn max_set_by_key<K, F>(self, key: F) -> Vec<Self::Item>
    where +the specified function. Read more

    source§

    fn max_set_by_key<K, F>(self, key: F) -> Vec<Self::Item>
    where Self: Sized, K: Ord, F: FnMut(&Self::Item) -> K,

    Return all maximum elements of an iterator, as determined by -the specified function. Read more
    source§

    fn minmax(self) -> MinMaxResult<Self::Item>
    where +the specified function. Read more

    source§

    fn minmax(self) -> MinMaxResult<Self::Item>
    where Self: Sized, - Self::Item: PartialOrd,

    Return the minimum and maximum elements in the iterator. Read more
    source§

    fn minmax_by_key<K, F>(self, key: F) -> MinMaxResult<Self::Item>
    where + Self::Item: PartialOrd,

    Return the minimum and maximum elements in the iterator. Read more
    source§

    fn minmax_by_key<K, F>(self, key: F) -> MinMaxResult<Self::Item>
    where Self: Sized, K: PartialOrd, F: FnMut(&Self::Item) -> K,

    Return the minimum and maximum element of an iterator, as determined by -the specified function. Read more
    source§

    fn minmax_by<F>(self, compare: F) -> MinMaxResult<Self::Item>
    where +the specified function. Read more

    source§

    fn minmax_by<F>(self, compare: F) -> MinMaxResult<Self::Item>
    where Self: Sized, F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Return the minimum and maximum element of an iterator, as determined by -the specified comparison function. Read more
    source§

    fn position_max(self) -> Option<usize>
    where +the specified comparison function. Read more

    source§

    fn position_max(self) -> Option<usize>
    where Self: Sized, - Self::Item: Ord,

    Return the position of the maximum element in the iterator. Read more
    source§

    fn position_max_by_key<K, F>(self, key: F) -> Option<usize>
    where + Self::Item: Ord,

    Return the position of the maximum element in the iterator. Read more
    source§

    fn position_max_by_key<K, F>(self, key: F) -> Option<usize>
    where Self: Sized, K: Ord, F: FnMut(&Self::Item) -> K,

    Return the position of the maximum element in the iterator, as -determined by the specified function. Read more
    source§

    fn position_max_by<F>(self, compare: F) -> Option<usize>
    where +determined by the specified function. Read more

    source§

    fn position_max_by<F>(self, compare: F) -> Option<usize>
    where Self: Sized, F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Return the position of the maximum element in the iterator, as -determined by the specified comparison function. Read more
    source§

    fn position_min(self) -> Option<usize>
    where +determined by the specified comparison function. Read more

    source§

    fn position_min(self) -> Option<usize>
    where Self: Sized, - Self::Item: Ord,

    Return the position of the minimum element in the iterator. Read more
    source§

    fn position_min_by_key<K, F>(self, key: F) -> Option<usize>
    where + Self::Item: Ord,

    Return the position of the minimum element in the iterator. Read more
    source§

    fn position_min_by_key<K, F>(self, key: F) -> Option<usize>
    where Self: Sized, K: Ord, F: FnMut(&Self::Item) -> K,

    Return the position of the minimum element in the iterator, as -determined by the specified function. Read more
    source§

    fn position_min_by<F>(self, compare: F) -> Option<usize>
    where +determined by the specified function. Read more

    source§

    fn position_min_by<F>(self, compare: F) -> Option<usize>
    where Self: Sized, F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Return the position of the minimum element in the iterator, as -determined by the specified comparison function. Read more
    source§

    fn position_minmax(self) -> MinMaxResult<usize>
    where +determined by the specified comparison function. Read more

    source§

    fn position_minmax(self) -> MinMaxResult<usize>
    where Self: Sized, Self::Item: PartialOrd,

    Return the positions of the minimum and maximum elements in -the iterator. Read more
    source§

    fn position_minmax_by_key<K, F>(self, key: F) -> MinMaxResult<usize>
    where +the iterator. Read more

    source§

    fn position_minmax_by_key<K, F>(self, key: F) -> MinMaxResult<usize>
    where Self: Sized, K: PartialOrd, F: FnMut(&Self::Item) -> K,

    Return the postions of the minimum and maximum elements of an -iterator, as determined by the specified function. Read more
    source§

    fn position_minmax_by<F>(self, compare: F) -> MinMaxResult<usize>
    where +iterator, as determined by the specified function. Read more

    source§

    fn position_minmax_by<F>(self, compare: F) -> MinMaxResult<usize>
    where Self: Sized, F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Return the postions of the minimum and maximum elements of an -iterator, as determined by the specified comparison function. Read more
    source§

    fn exactly_one(self) -> Result<Self::Item, ExactlyOneError<Self>>
    where +iterator, as determined by the specified comparison function. Read more

    source§

    fn exactly_one(self) -> Result<Self::Item, ExactlyOneError<Self>>
    where Self: Sized,

    If the iterator yields exactly one element, that element will be returned, otherwise an error will be returned containing an iterator that has the same output as the input -iterator. Read more
    source§

    fn at_most_one(self) -> Result<Option<Self::Item>, ExactlyOneError<Self>>
    where - Self: Sized,

    If the iterator yields no elements, Ok(None) will be returned. If the iterator yields +iterator. Read more
    source§

    fn at_most_one(self) -> Result<Option<Self::Item>, ExactlyOneError<Self>>
    where + Self: Sized,

    If the iterator yields no elements, Ok(None) will be returned. If the iterator yields exactly one element, that element will be returned, otherwise an error will be returned -containing an iterator that has the same output as the input iterator. Read more
    source§

    fn multipeek(self) -> MultiPeek<Self> ⓘ
    where +containing an iterator that has the same output as the input iterator. Read more

    source§

    fn multipeek(self) -> MultiPeek<Self> ⓘ
    where Self: Sized,

    An iterator adaptor that allows the user to peek at multiple .next() -values without advancing the base iterator. Read more
    source§

    fn counts(self) -> HashMap<Self::Item, usize>
    where +values without advancing the base iterator. Read more

    source§

    fn counts(self) -> HashMap<Self::Item, usize>
    where Self: Sized, Self::Item: Eq + Hash,

    Collect the items in this iterator and return a HashMap which contains each item that appears in the iterator and the number -of times it appears. Read more
    source§

    fn counts_by<K, F>(self, f: F) -> HashMap<K, usize>
    where +of times it appears. Read more

    source§

    fn counts_by<K, F>(self, f: F) -> HashMap<K, usize>
    where Self: Sized, K: Eq + Hash, F: FnMut(Self::Item) -> K,

    Collect the items in this iterator and return a HashMap which contains each item that appears in the iterator and the number of times it appears, -determining identity using a keying function. Read more
    source§

    fn multiunzip<FromI>(self) -> FromI
    where - Self: Sized + MultiUnzip<FromI>,

    Converts an iterator of tuples into a tuple of containers. Read more
    source§

    fn try_len(&self) -> Result<usize, (usize, Option<usize>)>

    Returns the length of the iterator if one exists. +determining identity using a keying function. Read more
    source§

    fn multiunzip<FromI>(self) -> FromI
    where + Self: Sized + MultiUnzip<FromI>,

    Converts an iterator of tuples into a tuple of containers. Read more
    source§

    fn try_len(&self) -> Result<usize, (usize, Option<usize>)>

    Returns the length of the iterator if one exists. Otherwise return self.size_hint(). Read more
    source§

    impl<IT> MultiUnzip<()> for IT
    where IT: Iterator<Item = ()>,

    source§

    fn multiunzip(self)

    Unzip this iterator into multiple collections.
    source§

    impl<IT, A, FromA> MultiUnzip<(FromA,)> for IT
    where IT: Iterator<Item = (A,)>, @@ -678,4 +690,4 @@ Otherwise return self.size_hint(). (FromA, FromB, FromC, FromD, FromE, FromF, FromG, FromH, FromI, FromJ, FromK, FromL)

    Unzip this iterator into multiple collections.
    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 + 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/itertools/structs/struct.Chunk.html b/itertools/structs/struct.Chunk.html index baccd755d..6c5d62ab7 100644 --- a/itertools/structs/struct.Chunk.html +++ b/itertools/structs/struct.Chunk.html @@ -1,13 +1,13 @@ -Chunk in itertools::structs - Rust
    -

    Struct itertools::structs::Chunk

    source · 
    pub struct Chunk<'a, I>
    where
+Chunk in itertools::structs - Rust
    
+    
    Struct itertools::structs::Chunk
    source · 
    pub struct Chunk<'a, I>
    where
     I: Iterator + 'a,
     I::Item: 'a,
    { /* private fields */ }
    Expand description
    An iterator for the elements in a single chunk.
    
 
    Iterator element type is I::Item.
    
-
    Trait Implementations§
    source§
    impl<'a, I> Drop for Chunk<'a, I>
    where
+
    Trait Implementations§
    source§
    impl<'a, I> Drop for Chunk<'a, I>
    where
     I: Iterator,
-    I::Item: 'a,
    source§
    fn drop(&mut self)
    Executes the destructor for this type. Read more
    source§
    impl<'a, I> Iterator for Chunk<'a, I>
    where
+    I::Item: 'a,
    source§
    fn drop(&mut self)
    Executes the destructor for this type. Read more
    source§
    impl<'a, I> Iterator for Chunk<'a, I>
    where
     I: Iterator,
-    I::Item: 'a,
    §
    type Item = <I as Iterator>::Item
    The type of the elements being iterated over.
    source§
    fn next(&mut self) -> Option<Self::Item>
    Advances the iterator and returns the next value. Read more
    source§
    fn next_chunk<const N: usize>(
+    I::Item: 'a,
    §
    type Item = <I as Iterator>::Item
    The type of the elements being iterated over.
    source§
    fn next(&mut self) -> Option<Self::Item>
    Advances the iterator and returns the next value. Read more
    source§
    fn next_chunk<const N: usize>(
     &mut self
 ) -> Result<[Self::Item; N], IntoIter<Self::Item, N>>
    where
     Self: Sized,
    🔬This is a nightly-only experimental API. (iter_next_chunk)
    Advances the iterator and returns an array containing the next N values. Read more
    1.0.0 · source§
    fn size_hint(&self) -> (usize, Option<usize>)
    Returns the bounds on the remaining length of the iterator. Read more
    1.0.0 · source§
    fn count(self) -> usize
    where
@@ -202,86 +202,87 @@ otherwise. Right variant of Either<Self, Self>
 otherwise. Read more
    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> Itertools for T
    where
-    T: Iterator + ?Sized,
    source§
    fn interleave<J>(self, other: J) -> Interleave<Self, J::IntoIter> ⓘ
    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> Itertools for T
    where
+    T: Iterator + ?Sized,
    source§
    fn interleave<J>(self, other: J) -> Interleave<Self, J::IntoIter> ⓘ
    where
     J: IntoIterator<Item = Self::Item>,
-    Self: Sized,
    Alternate elements from two iterators until both have run out. Read more
    source§
    fn interleave_shortest<J>(
+    Self: Sized,
    Alternate elements from two iterators until both have run out. Read more
    source§

    fn interleave_shortest<J>( self, other: J ) -> InterleaveShortest<Self, J::IntoIter> ⓘ
    where J: IntoIterator<Item = Self::Item>, Self: Sized,

    Alternate elements from two iterators until at least one of them has run -out. Read more
    source§

    fn intersperse(self, element: Self::Item) -> Intersperse<Self>
    where +out. Read more

    source§

    fn intersperse(self, element: Self::Item) -> Intersperse<Self>
    where Self: Sized, Self::Item: Clone,

    An iterator adaptor to insert a particular value -between each element of the adapted iterator. Read more
    source§

    fn intersperse_with<F>(self, element: F) -> IntersperseWith<Self, F> ⓘ
    where +between each element of the adapted iterator. Read more

    source§

    fn intersperse_with<F>(self, element: F) -> IntersperseWith<Self, F> ⓘ
    where Self: Sized, F: FnMut() -> Self::Item,

    An iterator adaptor to insert a particular value created by a function -between each element of the adapted iterator. Read more
    source§

    fn zip_longest<J>(self, other: J) -> ZipLongest<Self, J::IntoIter> ⓘ
    where +between each element of the adapted iterator. Read more

    source§

    fn get<R>(self, index: R) -> R::Output
    where + Self: Sized, + R: IteratorIndex<Self>,

    Returns an iterator over a subsection of the iterator. Read more
    source§

    fn zip_longest<J>(self, other: J) -> ZipLongest<Self, J::IntoIter> ⓘ
    where J: IntoIterator, Self: Sized,

    Create an iterator which iterates over both this and the specified -iterator simultaneously, yielding pairs of two optional elements. Read more
    source§

    fn zip_eq<J>(self, other: J) -> ZipEq<Self, J::IntoIter> ⓘ
    where +iterator simultaneously, yielding pairs of two optional elements. Read more

    source§

    fn zip_eq<J>(self, other: J) -> ZipEq<Self, J::IntoIter> ⓘ
    where J: IntoIterator, Self: Sized,

    Create an iterator which iterates over both this and the specified -iterator simultaneously, yielding pairs of elements. Read more
    source§

    fn batching<B, F>(self, f: F) -> Batching<Self, F> ⓘ
    where +iterator simultaneously, yielding pairs of elements. Read more

    source§

    fn batching<B, F>(self, f: F) -> Batching<Self, F> ⓘ
    where F: FnMut(&mut Self) -> Option<B>, Self: Sized,

    A “meta iterator adaptor”. Its closure receives a reference to the iterator and may pick off as many elements as it likes, to produce the -next iterator element. Read more
    source§

    fn group_by<K, F>(self, key: F) -> GroupBy<K, Self, F>
    where +next iterator element. Read more

    source§

    fn chunk_by<K, F>(self, key: F) -> ChunkBy<K, Self, F>
    where Self: Sized, F: FnMut(&Self::Item) -> K, K: PartialEq,

    Return an iterable that can group iterator elements. Consecutive elements that map to the same key (“runs”), are assigned -to the same group. Read more
    source§

    fn chunks(self, size: usize) -> IntoChunks<Self>
    where - Self: Sized,

    Return an iterable that can chunk the iterator. Read more
    source§

    fn tuple_windows<T>(self) -> TupleWindows<Self, T> ⓘ
    where +to the same group. Read more

    source§

    fn group_by<K, F>(self, key: F) -> ChunkBy<K, Self, F>
    where + Self: Sized, + F: FnMut(&Self::Item) -> K, + K: PartialEq,

    👎Deprecated since 0.13.0: Use .chunk_by() instead
    See .chunk_by().
    source§

    fn chunks(self, size: usize) -> IntoChunks<Self>
    where + Self: Sized,

    Return an iterable that can chunk the iterator. Read more
    source§

    fn tuple_windows<T>(self) -> TupleWindows<Self, T> ⓘ
    where Self: Sized + Iterator<Item = T::Item>, T: HomogeneousTuple, T::Item: Clone,

    Return an iterator over all contiguous windows producing tuples of -a specific size (up to 12). Read more
    source§

    fn circular_tuple_windows<T>(self) -> CircularTupleWindows<Self, T> ⓘ
    where +a specific size (up to 12). Read more

    source§

    fn circular_tuple_windows<T>(self) -> CircularTupleWindows<Self, T> ⓘ
    where Self: Sized + Clone + Iterator<Item = T::Item> + ExactSizeIterator, T: TupleCollect + Clone, T::Item: Clone,

    Return an iterator over all windows, wrapping back to the first elements when the window would otherwise exceed the length of the -iterator, producing tuples of a specific size (up to 12). Read more
    source§

    fn tuples<T>(self) -> Tuples<Self, T> ⓘ
    where +iterator, producing tuples of a specific size (up to 12). Read more

    source§

    fn tuples<T>(self) -> Tuples<Self, T> ⓘ
    where Self: Sized + Iterator<Item = T::Item>, T: HomogeneousTuple,

    Return an iterator that groups the items in tuples of a specific size -(up to 12). Read more
    source§

    fn tee(self) -> (Tee<Self>, Tee<Self>)
    where +(up to 12). Read more

    source§

    fn tee(self) -> (Tee<Self>, Tee<Self>)
    where Self: Sized, Self::Item: Clone,

    Split into an iterator pair that both yield all elements from -the original iterator. Read more
    source§

    fn step(self, n: usize) -> Step<Self> ⓘ
    where - Self: Sized,

    👎Deprecated since 0.8.0: Use std .step_by() instead
    Return an iterator adaptor that steps n elements in the base iterator -for each iteration. Read more
    source§

    fn map_into<R>(self) -> MapInto<Self, R>
    where +the original iterator. Read more

    source§

    fn map_into<R>(self) -> MapInto<Self, R>
    where Self: Sized, - Self::Item: Into<R>,

    Convert each item of the iterator using the Into trait. Read more
    source§

    fn map_results<F, T, U, E>(self, f: F) -> MapOk<Self, F>
    where - Self: Iterator<Item = Result<T, E>> + Sized, - F: FnMut(T) -> U,

    👎Deprecated since 0.10.0: Use .map_ok() instead
    See .map_ok().
    source§

    fn map_ok<F, T, U, E>(self, f: F) -> MapOk<Self, F>
    where + Self::Item: Into<R>,

    Convert each item of the iterator using the Into trait. Read more
    source§

    fn map_ok<F, T, U, E>(self, f: F) -> MapOk<Self, F>
    where Self: Iterator<Item = Result<T, E>> + Sized, F: FnMut(T) -> U,

    Return an iterator adaptor that applies the provided closure to every Result::Ok value. Result::Err values are -unchanged. Read more
    source§

    fn filter_ok<F, T, E>(self, f: F) -> FilterOk<Self, F> ⓘ
    where +unchanged. Read more

    source§

    fn filter_ok<F, T, E>(self, f: F) -> FilterOk<Self, F> ⓘ
    where Self: Iterator<Item = Result<T, E>> + Sized, F: FnMut(&T) -> bool,

    Return an iterator adaptor that filters every Result::Ok value with the provided closure. Result::Err values are -unchanged. Read more
    source§

    fn filter_map_ok<F, T, U, E>(self, f: F) -> FilterMapOk<Self, F> ⓘ
    where +unchanged. Read more

    source§

    fn filter_map_ok<F, T, U, E>(self, f: F) -> FilterMapOk<Self, F> ⓘ
    where Self: Iterator<Item = Result<T, E>> + Sized, F: FnMut(T) -> Option<U>,

    Return an iterator adaptor that filters and transforms every Result::Ok value with the provided closure. Result::Err -values are unchanged. Read more
    source§

    fn flatten_ok<T, E>(self) -> FlattenOk<Self, T, E> ⓘ
    where +values are unchanged. Read more

    source§

    fn flatten_ok<T, E>(self) -> FlattenOk<Self, T, E> ⓘ
    where Self: Iterator<Item = Result<T, E>> + Sized, T: IntoIterator,

    Return an iterator adaptor that flattens every Result::Ok value into -a series of Result::Ok values. Result::Err values are unchanged. Read more
    source§

    fn process_results<F, T, E, R>(self, processor: F) -> Result<R, E>
    where +a series of Result::Ok values. Result::Err values are unchanged. Read more

    source§

    fn process_results<F, T, E, R>(self, processor: F) -> Result<R, E>
    where Self: Iterator<Item = Result<T, E>> + Sized, F: FnOnce(ProcessResults<'_, Self, E>) -> R,

    “Lift” a function of the values of the current iterator so as to process -an iterator of Result values instead. Read more
    source§

    fn merge<J>(self, other: J) -> Merge<Self, J::IntoIter>
    where +an iterator of Result values instead. Read more

    source§

    fn merge<J>(self, other: J) -> Merge<Self, J::IntoIter>
    where Self: Sized, Self::Item: PartialOrd, J: IntoIterator<Item = Self::Item>,

    Return an iterator adaptor that merges the two base iterators in ascending order. If both base iterators are sorted (ascending), the -result is sorted. Read more
    source§

    fn merge_by<J, F>(self, other: J, is_first: F) -> MergeBy<Self, J::IntoIter, F> ⓘ
    where +result is sorted. Read more

    source§

    fn merge_by<J, F>(self, other: J, is_first: F) -> MergeBy<Self, J::IntoIter, F> ⓘ
    where Self: Sized, J: IntoIterator<Item = Self::Item>, F: FnMut(&Self::Item, &Self::Item) -> bool,

    Return an iterator adaptor that merges the two base iterators in order. -This is much like .merge() but allows for a custom ordering. Read more
    source§

    fn merge_join_by<J, F, T>( +This is much like .merge() but allows for a custom ordering. Read more

    source§

    fn merge_join_by<J, F, T>( self, other: J, cmp_fn: F @@ -289,284 +290,295 @@ This is much like IntoIterator, F: FnMut(&Self::Item, &J::Item) -> T, Self: Sized,

    Create an iterator that merges items from both this and the specified -iterator in ascending order. Read more
    source§

    fn kmerge(self) -> KMerge<<Self::Item as IntoIterator>::IntoIter>
    where +iterator in ascending order. Read more

    source§

    fn kmerge(self) -> KMerge<<Self::Item as IntoIterator>::IntoIter>
    where Self: Sized, Self::Item: IntoIterator, <Self::Item as IntoIterator>::Item: PartialOrd,

    Return an iterator adaptor that flattens an iterator of iterators by -merging them in ascending order. Read more
    source§

    fn kmerge_by<F>( +merging them in ascending order. Read more

    source§

    fn kmerge_by<F>( self, first: F ) -> KMergeBy<<Self::Item as IntoIterator>::IntoIter, F> ⓘ
    where Self: Sized, Self::Item: IntoIterator, F: FnMut(&<Self::Item as IntoIterator>::Item, &<Self::Item as IntoIterator>::Item) -> bool,

    Return an iterator adaptor that flattens an iterator of iterators by -merging them according to the given closure. Read more
    source§

    fn cartesian_product<J>(self, other: J) -> Product<Self, J::IntoIter> ⓘ
    where +merging them according to the given closure. Read more

    source§

    fn cartesian_product<J>(self, other: J) -> Product<Self, J::IntoIter> ⓘ
    where Self: Sized, Self::Item: Clone, J: IntoIterator, J::IntoIter: Clone,

    Return an iterator adaptor that iterates over the cartesian product of -the element sets of two iterators self and J. Read more
    source§

    fn multi_cartesian_product( +the element sets of two iterators self and J. Read more

    source§

    fn multi_cartesian_product( self ) -> MultiProduct<<Self::Item as IntoIterator>::IntoIter> ⓘ
    where Self: Sized, Self::Item: IntoIterator, <Self::Item as IntoIterator>::IntoIter: Clone, <Self::Item as IntoIterator>::Item: Clone,

    Return an iterator adaptor that iterates over the cartesian product of -all subiterators returned by meta-iterator self. Read more
    source§

    fn coalesce<F>(self, f: F) -> Coalesce<Self, F>
    where +all subiterators returned by meta-iterator self. Read more

    source§

    fn coalesce<F>(self, f: F) -> Coalesce<Self, F>
    where Self: Sized, F: FnMut(Self::Item, Self::Item) -> Result<Self::Item, (Self::Item, Self::Item)>,

    Return an iterator adaptor that uses the passed-in closure to -optionally merge together consecutive elements. Read more
    source§

    fn dedup(self) -> Dedup<Self>
    where +optionally merge together consecutive elements. Read more

    source§

    fn dedup(self) -> Dedup<Self>
    where Self: Sized, Self::Item: PartialEq,

    Remove duplicates from sections of consecutive identical elements. -If the iterator is sorted, all elements will be unique. Read more
    source§

    fn dedup_by<Cmp>(self, cmp: Cmp) -> DedupBy<Self, Cmp>
    where +If the iterator is sorted, all elements will be unique. Read more

    source§

    fn dedup_by<Cmp>(self, cmp: Cmp) -> DedupBy<Self, Cmp>
    where Self: Sized, Cmp: FnMut(&Self::Item, &Self::Item) -> bool,

    Remove duplicates from sections of consecutive identical elements, determining equality using a comparison function. -If the iterator is sorted, all elements will be unique. Read more
    source§

    fn dedup_with_count(self) -> DedupWithCount<Self>
    where +If the iterator is sorted, all elements will be unique. Read more

    source§

    fn dedup_with_count(self) -> DedupWithCount<Self>
    where Self: Sized,

    Remove duplicates from sections of consecutive identical elements, while keeping a count of how many repeated elements were present. -If the iterator is sorted, all elements will be unique. Read more
    source§

    fn dedup_by_with_count<Cmp>(self, cmp: Cmp) -> DedupByWithCount<Self, Cmp>
    where +If the iterator is sorted, all elements will be unique. Read more

    source§

    fn dedup_by_with_count<Cmp>(self, cmp: Cmp) -> DedupByWithCount<Self, Cmp>
    where Self: Sized, Cmp: FnMut(&Self::Item, &Self::Item) -> bool,

    Remove duplicates from sections of consecutive identical elements, while keeping a count of how many repeated elements were present. This will determine equality using a comparison function. -If the iterator is sorted, all elements will be unique. Read more
    source§

    fn duplicates(self) -> Duplicates<Self>
    where +If the iterator is sorted, all elements will be unique. Read more

    source§

    fn duplicates(self) -> Duplicates<Self>
    where Self: Sized, Self::Item: Eq + Hash,

    Return an iterator adaptor that produces elements that appear more than once during the -iteration. Duplicates are detected using hash and equality. Read more
    source§

    fn duplicates_by<V, F>(self, f: F) -> DuplicatesBy<Self, V, F>
    where +iteration. Duplicates are detected using hash and equality. Read more

    source§

    fn duplicates_by<V, F>(self, f: F) -> DuplicatesBy<Self, V, F>
    where Self: Sized, V: Eq + Hash, F: FnMut(&Self::Item) -> V,

    Return an iterator adaptor that produces elements that appear more than once during the -iteration. Duplicates are detected using hash and equality. Read more
    source§

    fn unique(self) -> Unique<Self> ⓘ
    where +iteration. Duplicates are detected using hash and equality. Read more

    source§

    fn unique(self) -> Unique<Self> ⓘ
    where Self: Sized, Self::Item: Clone + Eq + Hash,

    Return an iterator adaptor that filters out elements that have already been produced once during the iteration. Duplicates -are detected using hash and equality. Read more
    source§

    fn unique_by<V, F>(self, f: F) -> UniqueBy<Self, V, F> ⓘ
    where +are detected using hash and equality. Read more

    source§

    fn unique_by<V, F>(self, f: F) -> UniqueBy<Self, V, F> ⓘ
    where Self: Sized, V: Eq + Hash, F: FnMut(&Self::Item) -> V,

    Return an iterator adaptor that filters out elements that have -already been produced once during the iteration. Read more
    source§

    fn peeking_take_while<F>(&mut self, accept: F) -> PeekingTakeWhile<'_, Self, F> ⓘ
    where +already been produced once during the iteration. Read more

    source§

    fn peeking_take_while<F>(&mut self, accept: F) -> PeekingTakeWhile<'_, Self, F> ⓘ
    where Self: Sized + PeekingNext, F: FnMut(&Self::Item) -> bool,

    Return an iterator adaptor that borrows from this iterator and -takes items while the closure accept returns true. Read more
    source§

    fn take_while_ref<F>(&mut self, accept: F) -> TakeWhileRef<'_, Self, F> ⓘ
    where +takes items while the closure accept returns true. Read more

    source§

    fn take_while_ref<F>(&mut self, accept: F) -> TakeWhileRef<'_, Self, F> ⓘ
    where Self: Clone, F: FnMut(&Self::Item) -> bool,

    Return an iterator adaptor that borrows from a Clone-able iterator -to only pick off elements while the predicate accept returns true. Read more
    source§

    fn take_while_inclusive<F>(self, accept: F) -> TakeWhileInclusive<Self, F> ⓘ
    where +to only pick off elements while the predicate accept returns true. Read more

    source§

    fn take_while_inclusive<F>(self, accept: F) -> TakeWhileInclusive<Self, F> ⓘ
    where Self: Sized, F: FnMut(&Self::Item) -> bool,

    Returns an iterator adaptor that consumes elements while the given predicate is true, including the element for which the predicate -first returned false. Read more
    source§

    fn while_some<A>(self) -> WhileSome<Self> ⓘ
    where +first returned false. Read more

    source§

    fn while_some<A>(self) -> WhileSome<Self> ⓘ
    where Self: Sized + Iterator<Item = Option<A>>,

    Return an iterator adaptor that filters Option<A> iterator elements -and produces A. Stops on the first None encountered. Read more
    source§

    fn tuple_combinations<T>(self) -> TupleCombinations<Self, T> ⓘ
    where +and produces A. Stops on the first None encountered. Read more

    source§

    fn tuple_combinations<T>(self) -> TupleCombinations<Self, T> ⓘ
    where Self: Sized + Clone, Self::Item: Clone, T: HasCombination<Self>,

    Return an iterator adaptor that iterates over the combinations of the -elements from an iterator. Read more
    source§

    fn combinations(self, k: usize) -> Combinations<Self> ⓘ
    where +elements from an iterator. Read more

    source§

    fn combinations(self, k: usize) -> Combinations<Self> ⓘ
    where Self: Sized, Self::Item: Clone,

    Return an iterator adaptor that iterates over the k-length combinations of -the elements from an iterator. Read more
    source§

    fn combinations_with_replacement( +the elements from an iterator. Read more

    source§

    fn combinations_with_replacement( self, k: usize ) -> CombinationsWithReplacement<Self> ⓘ
    where Self: Sized, Self::Item: Clone,

    Return an iterator that iterates over the k-length combinations of -the elements from an iterator, with replacement. Read more
    source§

    fn permutations(self, k: usize) -> Permutations<Self> ⓘ
    where +the elements from an iterator, with replacement. Read more

    source§

    fn permutations(self, k: usize) -> Permutations<Self> ⓘ
    where Self: Sized, Self::Item: Clone,

    Return an iterator adaptor that iterates over all k-permutations of the -elements from an iterator. Read more
    source§

    fn powerset(self) -> Powerset<Self> ⓘ
    where +elements from an iterator. Read more

    source§

    fn powerset(self) -> Powerset<Self> ⓘ
    where Self: Sized, Self::Item: Clone,

    Return an iterator that iterates through the powerset of the elements from an -iterator. Read more
    source§

    fn pad_using<F>(self, min: usize, f: F) -> PadUsing<Self, F> ⓘ
    where +iterator. Read more

    source§

    fn pad_using<F>(self, min: usize, f: F) -> PadUsing<Self, F> ⓘ
    where Self: Sized, F: FnMut(usize) -> Self::Item,

    Return an iterator adaptor that pads the sequence to a minimum length of -min by filling missing elements using a closure f. Read more
    source§

    fn with_position(self) -> WithPosition<Self> ⓘ
    where +min by filling missing elements using a closure f. Read more

    source§

    fn with_position(self) -> WithPosition<Self> ⓘ
    where Self: Sized,

    Return an iterator adaptor that combines each element with a Position to -ease special-case handling of the first or last elements. Read more
    source§

    fn positions<P>(self, predicate: P) -> Positions<Self, P> ⓘ
    where +ease special-case handling of the first or last elements. Read more

    source§

    fn positions<P>(self, predicate: P) -> Positions<Self, P> ⓘ
    where Self: Sized, P: FnMut(Self::Item) -> bool,

    Return an iterator adaptor that yields the indices of all elements -satisfying a predicate, counted from the start of the iterator. Read more
    source§

    fn update<F>(self, updater: F) -> Update<Self, F> ⓘ
    where +satisfying a predicate, counted from the start of the iterator. Read more

    source§

    fn update<F>(self, updater: F) -> Update<Self, F> ⓘ
    where Self: Sized, F: FnMut(&mut Self::Item),

    Return an iterator adaptor that applies a mutating function -to each element before yielding it. Read more
    source§

    fn next_tuple<T>(&mut self) -> Option<T>
    where +to each element before yielding it. Read more

    source§

    fn next_tuple<T>(&mut self) -> Option<T>
    where Self: Sized + Iterator<Item = T::Item>, T: HomogeneousTuple,

    Advances the iterator and returns the next items grouped in a tuple of -a specific size (up to 12). Read more
    source§

    fn collect_tuple<T>(self) -> Option<T>
    where +a specific size (up to 12). Read more

    source§

    fn collect_tuple<T>(self) -> Option<T>
    where Self: Sized + Iterator<Item = T::Item>, T: HomogeneousTuple,

    Collects all items from the iterator into a tuple of a specific size -(up to 12). Read more
    source§

    fn find_position<P>(&mut self, pred: P) -> Option<(usize, Self::Item)>
    where - P: FnMut(&Self::Item) -> bool,

    Find the position and value of the first element satisfying a predicate. Read more
    source§

    fn find_or_last<P>(self, predicate: P) -> Option<Self::Item>
    where +(up to 12). Read more

    source§

    fn find_position<P>(&mut self, pred: P) -> Option<(usize, Self::Item)>
    where + P: FnMut(&Self::Item) -> bool,

    Find the position and value of the first element satisfying a predicate. Read more
    source§

    fn find_or_last<P>(self, predicate: P) -> Option<Self::Item>
    where Self: Sized, - P: FnMut(&Self::Item) -> bool,

    Find the value of the first element satisfying a predicate or return the last element, if any. Read more
    source§

    fn find_or_first<P>(self, predicate: P) -> Option<Self::Item>
    where + P: FnMut(&Self::Item) -> bool,

    Find the value of the first element satisfying a predicate or return the last element, if any. Read more
    source§

    fn find_or_first<P>(self, predicate: P) -> Option<Self::Item>
    where Self: Sized, - P: FnMut(&Self::Item) -> bool,

    Find the value of the first element satisfying a predicate or return the first element, if any. Read more
    source§

    fn contains<Q>(&mut self, query: &Q) -> bool
    where + P: FnMut(&Self::Item) -> bool,

    Find the value of the first element satisfying a predicate or return the first element, if any. Read more
    source§

    fn contains<Q>(&mut self, query: &Q) -> bool
    where Self: Sized, Self::Item: Borrow<Q>, - Q: PartialEq,

    Returns true if the given item is present in this iterator. Read more
    source§

    fn all_equal(&mut self) -> bool
    where + Q: PartialEq,

    Returns true if the given item is present in this iterator. Read more
    source§

    fn all_equal(&mut self) -> bool
    where Self: Sized, - Self::Item: PartialEq,

    Check whether all elements compare equal. Read more
    source§

    fn all_equal_value( + Self::Item: PartialEq,

    Check whether all elements compare equal. Read more
    source§

    fn all_equal_value( &mut self ) -> Result<Self::Item, Option<(Self::Item, Self::Item)>>
    where Self: Sized, Self::Item: PartialEq,

    If there are elements and they are all equal, return a single copy of that element. If there are no elements, return an Error containing None. If there are elements and they are not all equal, return a tuple containing the first -two non-equal elements found. Read more
    source§

    fn all_unique(&mut self) -> bool
    where +two non-equal elements found. Read more

    source§

    fn all_unique(&mut self) -> bool
    where Self: Sized, - Self::Item: Eq + Hash,

    Check whether all elements are unique (non equal). Read more
    source§

    fn dropping(self, n: usize) -> Self
    where + Self::Item: Eq + Hash,

    Check whether all elements are unique (non equal). Read more
    source§

    fn dropping(self, n: usize) -> Self
    where Self: Sized,

    Consume the first n elements from the iterator eagerly, -and return the same iterator again. Read more
    source§

    fn dropping_back(self, n: usize) -> Self
    where +and return the same iterator again. Read more

    source§

    fn dropping_back(self, n: usize) -> Self
    where Self: Sized + DoubleEndedIterator,

    Consume the last n elements from the iterator eagerly, -and return the same iterator again. Read more
    source§

    fn foreach<F>(self, f: F)
    where - F: FnMut(Self::Item), - Self: Sized,

    👎Deprecated since 0.8.0: Use .for_each() instead
    Run the closure f eagerly on each element of the iterator. Read more
    source§

    fn concat(self) -> Self::Item
    where +and return the same iterator again. Read more

    source§

    fn concat(self) -> Self::Item
    where Self: Sized, - Self::Item: Extend<<<Self as Iterator>::Item as IntoIterator>::Item> + IntoIterator + Default,

    Combine all an iterator’s elements into one element by using Extend. Read more
    source§

    fn collect_vec(self) -> Vec<Self::Item>
    where + Self::Item: Extend<<<Self as Iterator>::Item as IntoIterator>::Item> + IntoIterator + Default,

    Combine all an iterator’s elements into one element by using Extend. Read more
    source§

    fn collect_vec(self) -> Vec<Self::Item>
    where Self: Sized,

    .collect_vec() is simply a type specialization of Iterator::collect, -for convenience.
    source§

    fn try_collect<T, U, E>(self) -> Result<U, E>
    where +for convenience.

    source§

    fn try_collect<T, U, E>(self) -> Result<U, E>
    where Self: Sized + Iterator<Item = Result<T, E>>, Result<U, E>: FromIterator<Result<T, E>>,

    .try_collect() is more convenient way of writing -.collect::<Result<_, _>>() Read more
    source§

    fn set_from<'a, A: 'a, J>(&mut self, from: J) -> usize
    where +.collect::<Result<_, _>>() Read more

    source§

    fn set_from<'a, A: 'a, J>(&mut self, from: J) -> usize
    where Self: Iterator<Item = &'a mut A>, J: IntoIterator<Item = A>,

    Assign to each reference in self from the from iterator, -stopping at the shortest of the two iterators. Read more
    source§

    fn join(&mut self, sep: &str) -> String
    where - Self::Item: Display,

    Combine all iterator elements into one String, separated by sep. Read more
    source§

    fn format(self, sep: &str) -> Format<'_, Self>
    where - Self: Sized,

    Format all iterator elements, separated by sep. Read more
    source§

    fn format_with<F>(self, sep: &str, format: F) -> FormatWith<'_, Self, F>
    where +stopping at the shortest of the two iterators. Read more

    source§

    fn join(&mut self, sep: &str) -> String
    where + Self::Item: Display,

    Combine all iterator elements into one String, separated by sep. Read more
    source§

    fn format(self, sep: &str) -> Format<'_, Self>
    where + Self: Sized,

    Format all iterator elements, separated by sep. Read more
    source§

    fn format_with<F>(self, sep: &str, format: F) -> FormatWith<'_, Self, F>
    where Self: Sized, - F: FnMut(Self::Item, &mut dyn FnMut(&dyn Display) -> Result) -> Result,

    Format all iterator elements, separated by sep. Read more
    source§

    fn fold_results<A, E, B, F>(&mut self, start: B, f: F) -> Result<B, E>
    where + F: FnMut(Self::Item, &mut dyn FnMut(&dyn Display) -> Result) -> Result,

    Format all iterator elements, separated by sep. Read more
    source§

    fn fold_ok<A, E, B, F>(&mut self, start: B, f: F) -> Result<B, E>
    where Self: Iterator<Item = Result<A, E>>, - F: FnMut(B, A) -> B,

    👎Deprecated since 0.10.0: Use .fold_ok() instead
    See .fold_ok().
    source§

    fn fold_ok<A, E, B, F>(&mut self, start: B, f: F) -> Result<B, E>
    where - Self: Iterator<Item = Result<A, E>>, - F: FnMut(B, A) -> B,

    Fold Result values from an iterator. Read more
    source§

    fn fold_options<A, B, F>(&mut self, start: B, f: F) -> Option<B>
    where + F: FnMut(B, A) -> B,

    Fold Result values from an iterator. Read more
    source§

    fn fold_options<A, B, F>(&mut self, start: B, f: F) -> Option<B>
    where Self: Iterator<Item = Option<A>>, - F: FnMut(B, A) -> B,

    Fold Option values from an iterator. Read more
    source§

    fn fold1<F>(self, f: F) -> Option<Self::Item>
    where + F: FnMut(B, A) -> B,

    Fold Option values from an iterator. Read more
    source§

    fn fold1<F>(self, f: F) -> Option<Self::Item>
    where F: FnMut(Self::Item, Self::Item) -> Self::Item, - Self: Sized,

    👎Deprecated since 0.10.2: Use Iterator::reduce instead
    Accumulator of the elements in the iterator. Read more
    source§

    fn tree_fold1<F>(self, f: F) -> Option<Self::Item>
    where + Self: Sized,

    👎Deprecated since 0.10.2: Use Iterator::reduce instead
    Accumulator of the elements in the iterator. Read more
    source§

    fn tree_reduce<F>(self, f: F) -> Option<Self::Item>
    where F: FnMut(Self::Item, Self::Item) -> Self::Item, - Self: Sized,

    Accumulate the elements in the iterator in a tree-like manner. Read more
    source§

    fn fold_while<B, F>(&mut self, init: B, f: F) -> FoldWhile<B>
    where + Self: Sized,

    Accumulate the elements in the iterator in a tree-like manner. Read more
    source§

    fn tree_fold1<F>(self, f: F) -> Option<Self::Item>
    where + F: FnMut(Self::Item, Self::Item) -> Self::Item, + Self: Sized,

    👎Deprecated since 0.13.0: Use .tree_reduce() instead
    See .tree_reduce().
    source§

    fn fold_while<B, F>(&mut self, init: B, f: F) -> FoldWhile<B>
    where Self: Sized, - F: FnMut(B, Self::Item) -> FoldWhile<B>,

    An iterator method that applies a function, producing a single, final value. Read more
    source§

    fn sum1<S>(self) -> Option<S>
    where + F: FnMut(B, Self::Item) -> FoldWhile<B>,

    An iterator method that applies a function, producing a single, final value. Read more
    source§

    fn sum1<S>(self) -> Option<S>
    where Self: Sized, - S: Sum<Self::Item>,

    Iterate over the entire iterator and add all the elements. Read more
    source§

    fn product1<P>(self) -> Option<P>
    where + S: Sum<Self::Item>,

    Iterate over the entire iterator and add all the elements. Read more
    source§

    fn product1<P>(self) -> Option<P>
    where Self: Sized, - P: Product<Self::Item>,

    Iterate over the entire iterator and multiply all the elements. Read more
    source§

    fn sorted_unstable(self) -> IntoIter<Self::Item> ⓘ
    where + P: Product<Self::Item>,

    Iterate over the entire iterator and multiply all the elements. Read more
    source§

    fn sorted_unstable(self) -> IntoIter<Self::Item> ⓘ
    where Self: Sized, - Self::Item: Ord,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_unstable_by<F>(self, cmp: F) -> IntoIter<Self::Item> ⓘ
    where + Self::Item: Ord,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_unstable_by<F>(self, cmp: F) -> IntoIter<Self::Item> ⓘ
    where Self: Sized, - F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_unstable_by_key<K, F>(self, f: F) -> IntoIter<Self::Item> ⓘ
    where + F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_unstable_by_key<K, F>(self, f: F) -> IntoIter<Self::Item> ⓘ
    where Self: Sized, K: Ord, - F: FnMut(&Self::Item) -> K,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted(self) -> IntoIter<Self::Item> ⓘ
    where + F: FnMut(&Self::Item) -> K,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted(self) -> IntoIter<Self::Item> ⓘ
    where Self: Sized, - Self::Item: Ord,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_by<F>(self, cmp: F) -> IntoIter<Self::Item> ⓘ
    where + Self::Item: Ord,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_by<F>(self, cmp: F) -> IntoIter<Self::Item> ⓘ
    where Self: Sized, - F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_by_key<K, F>(self, f: F) -> IntoIter<Self::Item> ⓘ
    where + F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_by_key<K, F>(self, f: F) -> IntoIter<Self::Item> ⓘ
    where Self: Sized, K: Ord, - F: FnMut(&Self::Item) -> K,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_by_cached_key<K, F>(self, f: F) -> IntoIter<Self::Item> ⓘ
    where + F: FnMut(&Self::Item) -> K,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_by_cached_key<K, F>(self, f: F) -> IntoIter<Self::Item> ⓘ
    where Self: Sized, K: Ord, F: FnMut(&Self::Item) -> K,

    Sort all iterator elements into a new iterator in ascending order. The key function is -called exactly once per key. Read more
    source§

    fn k_smallest(self, k: usize) -> IntoIter<Self::Item> ⓘ
    where +called exactly once per key. Read more

    source§

    fn k_smallest(self, k: usize) -> IntoIter<Self::Item> ⓘ
    where Self: Sized, - Self::Item: Ord,

    Sort the k smallest elements into a new iterator, in ascending order. Read more
    source§

    fn partition_map<A, B, F, L, R>(self, predicate: F) -> (A, B)
    where + Self::Item: Ord,

    Sort the k smallest elements into a new iterator, in ascending order. Read more
    source§

    fn k_smallest_by<F>(self, k: usize, cmp: F) -> IntoIter<Self::Item> ⓘ
    where + Self: Sized, + F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Sort the k smallest elements into a new iterator using the provided comparison. Read more
    source§

    fn k_smallest_by_key<F, K>(self, k: usize, key: F) -> IntoIter<Self::Item> ⓘ
    where + Self: Sized, + F: FnMut(&Self::Item) -> K, + K: Ord,

    Return the elements producing the k smallest outputs of the provided function. Read more
    source§

    fn k_largest(self, k: usize) -> IntoIter<Self::Item> ⓘ
    where + Self: Sized, + Self::Item: Ord,

    Sort the k largest elements into a new iterator, in descending order. Read more
    source§

    fn k_largest_by<F>(self, k: usize, cmp: F) -> IntoIter<Self::Item> ⓘ
    where + Self: Sized, + F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Sort the k largest elements into a new iterator using the provided comparison. Read more
    source§

    fn k_largest_by_key<F, K>(self, k: usize, key: F) -> IntoIter<Self::Item> ⓘ
    where + Self: Sized, + F: FnMut(&Self::Item) -> K, + K: Ord,

    Return the elements producing the k largest outputs of the provided function. Read more
    source§

    fn tail(self, n: usize) -> IntoIter<Self::Item> ⓘ
    where + Self: Sized,

    Consumes the iterator and return an iterator of the last n elements. Read more
    source§

    fn partition_map<A, B, F, L, R>(self, predicate: F) -> (A, B)
    where Self: Sized, F: FnMut(Self::Item) -> Either<L, R>, A: Default + Extend<L>, B: Default + Extend<R>,

    Collect all iterator elements into one of two partitions. Unlike Iterator::partition, each partition may -have a distinct type. Read more
    source§

    fn partition_result<A, B, T, E>(self) -> (A, B)
    where +have a distinct type. Read more

    source§

    fn partition_result<A, B, T, E>(self) -> (A, B)
    where Self: Iterator<Item = Result<T, E>> + Sized, A: Default + Extend<T>, B: Default + Extend<E>,

    Partition a sequence of Results into one list of all the Ok elements -and another list of all the Err elements. Read more
    source§

    fn into_group_map<K, V>(self) -> HashMap<K, Vec<V>>
    where +and another list of all the Err elements. Read more

    source§

    fn into_group_map<K, V>(self) -> HashMap<K, Vec<V>>
    where Self: Iterator<Item = (K, V)> + Sized, K: Hash + Eq,

    Return a HashMap of keys mapped to Vecs of values. Keys and values -are taken from (Key, Value) tuple pairs yielded by the input iterator. Read more
    source§

    fn into_group_map_by<K, V, F>(self, f: F) -> HashMap<K, Vec<V>>
    where +are taken from (Key, Value) tuple pairs yielded by the input iterator. Read more

    source§

    fn into_group_map_by<K, V, F>(self, f: F) -> HashMap<K, Vec<V>>
    where Self: Iterator<Item = V> + Sized, K: Hash + Eq, - F: Fn(&V) -> K,

    Return an Iterator on a HashMap. Keys mapped to Vecs of values. The key is specified -in the closure. Read more
    source§

    fn into_grouping_map<K, V>(self) -> GroupingMap<Self>
    where + F: FnMut(&V) -> K,

    Return an Iterator on a HashMap. Keys mapped to Vecs of values. The key is specified +in the closure. Read more
    source§

    fn into_grouping_map<K, V>(self) -> GroupingMap<Self>
    where Self: Iterator<Item = (K, V)> + Sized, K: Hash + Eq,

    Constructs a GroupingMap to be used later with one of the efficient -group-and-fold operations it allows to perform. Read more
    source§

    fn into_grouping_map_by<K, V, F>(self, key_mapper: F) -> GroupingMapBy<Self, F>
    where +group-and-fold operations it allows to perform. Read more

    source§

    fn into_grouping_map_by<K, V, F>(self, key_mapper: F) -> GroupingMapBy<Self, F>
    where Self: Iterator<Item = V> + Sized, K: Hash + Eq, F: FnMut(&V) -> K,

    Constructs a GroupingMap to be used later with one of the efficient -group-and-fold operations it allows to perform. Read more
    source§

    fn min_set(self) -> Vec<Self::Item>
    where +group-and-fold operations it allows to perform. Read more

    source§

    fn min_set(self) -> Vec<Self::Item>
    where Self: Sized, - Self::Item: Ord,

    Return all minimum elements of an iterator. Read more
    source§

    fn min_set_by<F>(self, compare: F) -> Vec<Self::Item>
    where + Self::Item: Ord,

    Return all minimum elements of an iterator. Read more
    source§

    fn min_set_by<F>(self, compare: F) -> Vec<Self::Item>
    where Self: Sized, F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Return all minimum elements of an iterator, as determined by -the specified function. Read more
    source§

    fn min_set_by_key<K, F>(self, key: F) -> Vec<Self::Item>
    where +the specified function. Read more

    source§

    fn min_set_by_key<K, F>(self, key: F) -> Vec<Self::Item>
    where Self: Sized, K: Ord, F: FnMut(&Self::Item) -> K,

    Return all minimum elements of an iterator, as determined by -the specified function. Read more
    source§

    fn max_set(self) -> Vec<Self::Item>
    where +the specified function. Read more

    source§

    fn max_set(self) -> Vec<Self::Item>
    where Self: Sized, - Self::Item: Ord,

    Return all maximum elements of an iterator. Read more
    source§

    fn max_set_by<F>(self, compare: F) -> Vec<Self::Item>
    where + Self::Item: Ord,

    Return all maximum elements of an iterator. Read more
    source§

    fn max_set_by<F>(self, compare: F) -> Vec<Self::Item>
    where Self: Sized, F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Return all maximum elements of an iterator, as determined by -the specified function. Read more
    source§

    fn max_set_by_key<K, F>(self, key: F) -> Vec<Self::Item>
    where +the specified function. Read more

    source§

    fn max_set_by_key<K, F>(self, key: F) -> Vec<Self::Item>
    where Self: Sized, K: Ord, F: FnMut(&Self::Item) -> K,

    Return all maximum elements of an iterator, as determined by -the specified function. Read more
    source§

    fn minmax(self) -> MinMaxResult<Self::Item>
    where +the specified function. Read more

    source§

    fn minmax(self) -> MinMaxResult<Self::Item>
    where Self: Sized, - Self::Item: PartialOrd,

    Return the minimum and maximum elements in the iterator. Read more
    source§

    fn minmax_by_key<K, F>(self, key: F) -> MinMaxResult<Self::Item>
    where + Self::Item: PartialOrd,

    Return the minimum and maximum elements in the iterator. Read more
    source§

    fn minmax_by_key<K, F>(self, key: F) -> MinMaxResult<Self::Item>
    where Self: Sized, K: PartialOrd, F: FnMut(&Self::Item) -> K,

    Return the minimum and maximum element of an iterator, as determined by -the specified function. Read more
    source§

    fn minmax_by<F>(self, compare: F) -> MinMaxResult<Self::Item>
    where +the specified function. Read more

    source§

    fn minmax_by<F>(self, compare: F) -> MinMaxResult<Self::Item>
    where Self: Sized, F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Return the minimum and maximum element of an iterator, as determined by -the specified comparison function. Read more
    source§

    fn position_max(self) -> Option<usize>
    where +the specified comparison function. Read more

    source§

    fn position_max(self) -> Option<usize>
    where Self: Sized, - Self::Item: Ord,

    Return the position of the maximum element in the iterator. Read more
    source§

    fn position_max_by_key<K, F>(self, key: F) -> Option<usize>
    where + Self::Item: Ord,

    Return the position of the maximum element in the iterator. Read more
    source§

    fn position_max_by_key<K, F>(self, key: F) -> Option<usize>
    where Self: Sized, K: Ord, F: FnMut(&Self::Item) -> K,

    Return the position of the maximum element in the iterator, as -determined by the specified function. Read more
    source§

    fn position_max_by<F>(self, compare: F) -> Option<usize>
    where +determined by the specified function. Read more

    source§

    fn position_max_by<F>(self, compare: F) -> Option<usize>
    where Self: Sized, F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Return the position of the maximum element in the iterator, as -determined by the specified comparison function. Read more
    source§

    fn position_min(self) -> Option<usize>
    where +determined by the specified comparison function. Read more

    source§

    fn position_min(self) -> Option<usize>
    where Self: Sized, - Self::Item: Ord,

    Return the position of the minimum element in the iterator. Read more
    source§

    fn position_min_by_key<K, F>(self, key: F) -> Option<usize>
    where + Self::Item: Ord,

    Return the position of the minimum element in the iterator. Read more
    source§

    fn position_min_by_key<K, F>(self, key: F) -> Option<usize>
    where Self: Sized, K: Ord, F: FnMut(&Self::Item) -> K,

    Return the position of the minimum element in the iterator, as -determined by the specified function. Read more
    source§

    fn position_min_by<F>(self, compare: F) -> Option<usize>
    where +determined by the specified function. Read more

    source§

    fn position_min_by<F>(self, compare: F) -> Option<usize>
    where Self: Sized, F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Return the position of the minimum element in the iterator, as -determined by the specified comparison function. Read more
    source§

    fn position_minmax(self) -> MinMaxResult<usize>
    where +determined by the specified comparison function. Read more

    source§

    fn position_minmax(self) -> MinMaxResult<usize>
    where Self: Sized, Self::Item: PartialOrd,

    Return the positions of the minimum and maximum elements in -the iterator. Read more
    source§

    fn position_minmax_by_key<K, F>(self, key: F) -> MinMaxResult<usize>
    where +the iterator. Read more

    source§

    fn position_minmax_by_key<K, F>(self, key: F) -> MinMaxResult<usize>
    where Self: Sized, K: PartialOrd, F: FnMut(&Self::Item) -> K,

    Return the postions of the minimum and maximum elements of an -iterator, as determined by the specified function. Read more
    source§

    fn position_minmax_by<F>(self, compare: F) -> MinMaxResult<usize>
    where +iterator, as determined by the specified function. Read more

    source§

    fn position_minmax_by<F>(self, compare: F) -> MinMaxResult<usize>
    where Self: Sized, F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Return the postions of the minimum and maximum elements of an -iterator, as determined by the specified comparison function. Read more
    source§

    fn exactly_one(self) -> Result<Self::Item, ExactlyOneError<Self>>
    where +iterator, as determined by the specified comparison function. Read more

    source§

    fn exactly_one(self) -> Result<Self::Item, ExactlyOneError<Self>>
    where Self: Sized,

    If the iterator yields exactly one element, that element will be returned, otherwise an error will be returned containing an iterator that has the same output as the input -iterator. Read more
    source§

    fn at_most_one(self) -> Result<Option<Self::Item>, ExactlyOneError<Self>>
    where - Self: Sized,

    If the iterator yields no elements, Ok(None) will be returned. If the iterator yields +iterator. Read more
    source§

    fn at_most_one(self) -> Result<Option<Self::Item>, ExactlyOneError<Self>>
    where + Self: Sized,

    If the iterator yields no elements, Ok(None) will be returned. If the iterator yields exactly one element, that element will be returned, otherwise an error will be returned -containing an iterator that has the same output as the input iterator. Read more
    source§

    fn multipeek(self) -> MultiPeek<Self> ⓘ
    where +containing an iterator that has the same output as the input iterator. Read more

    source§

    fn multipeek(self) -> MultiPeek<Self> ⓘ
    where Self: Sized,

    An iterator adaptor that allows the user to peek at multiple .next() -values without advancing the base iterator. Read more
    source§

    fn counts(self) -> HashMap<Self::Item, usize>
    where +values without advancing the base iterator. Read more

    source§

    fn counts(self) -> HashMap<Self::Item, usize>
    where Self: Sized, Self::Item: Eq + Hash,

    Collect the items in this iterator and return a HashMap which contains each item that appears in the iterator and the number -of times it appears. Read more
    source§

    fn counts_by<K, F>(self, f: F) -> HashMap<K, usize>
    where +of times it appears. Read more

    source§

    fn counts_by<K, F>(self, f: F) -> HashMap<K, usize>
    where Self: Sized, K: Eq + Hash, F: FnMut(Self::Item) -> K,

    Collect the items in this iterator and return a HashMap which contains each item that appears in the iterator and the number of times it appears, -determining identity using a keying function. Read more
    source§

    fn multiunzip<FromI>(self) -> FromI
    where - Self: Sized + MultiUnzip<FromI>,

    Converts an iterator of tuples into a tuple of containers. Read more
    source§

    fn try_len(&self) -> Result<usize, (usize, Option<usize>)>

    Returns the length of the iterator if one exists. +determining identity using a keying function. Read more
    source§

    fn multiunzip<FromI>(self) -> FromI
    where + Self: Sized + MultiUnzip<FromI>,

    Converts an iterator of tuples into a tuple of containers. Read more
    source§

    fn try_len(&self) -> Result<usize, (usize, Option<usize>)>

    Returns the length of the iterator if one exists. Otherwise return self.size_hint(). Read more
    source§

    impl<IT> MultiUnzip<()> for IT
    where IT: Iterator<Item = ()>,

    source§

    fn multiunzip(self)

    Unzip this iterator into multiple collections.
    source§

    impl<IT, A, FromA> MultiUnzip<(FromA,)> for IT
    where IT: Iterator<Item = (A,)>, @@ -668,4 +680,4 @@ Otherwise return self.size_hint(). (FromA, FromB, FromC, FromD, FromE, FromF, FromG, FromH, FromI, FromJ, FromK, FromL)

    Unzip this iterator into multiple collections.
    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 + 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/itertools/structs/struct.GroupBy.html b/itertools/structs/struct.ChunkBy.html similarity index 91% rename from itertools/structs/struct.GroupBy.html rename to itertools/structs/struct.ChunkBy.html index fe83ff4d4..ae2e1cd02 100644 --- a/itertools/structs/struct.GroupBy.html +++ b/itertools/structs/struct.ChunkBy.html @@ -1,28 +1,28 @@ -GroupBy in itertools::structs - Rust
    -

    Struct itertools::structs::GroupBy

    source · 
    pub struct GroupBy<K, I, F>
    where
-    I: Iterator,
    { /* private fields */ }
    Expand description

    GroupBy is the storage for the lazy grouping operation.

    +ChunkBy in itertools::structs - Rust
    +

    Struct itertools::structs::ChunkBy

    source · 
    pub struct ChunkBy<K, I, F>
    where
+    I: Iterator,
    { /* private fields */ }
    Expand description

    ChunkBy is the storage for the lazy grouping operation.

    If the groups are consumed in their original order, or if each -group is dropped without keeping it around, then GroupBy uses +group is dropped without keeping it around, then ChunkBy uses no allocations. It needs allocations only if several group iterators are alive at the same time.

    This type implements IntoIterator (it is not an iterator itself), because the group iterators need to borrow from this value. It should be stored in a local variable or temporary and iterated.

    -

    See .group_by() for more information.

    -

    Trait Implementations§

    source§

    impl<'a, K, I, F> IntoIterator for &'a GroupBy<K, I, F>
    where +

    See .chunk_by() for more information.

    +

    Trait Implementations§

    source§

    impl<'a, K, I, F> IntoIterator for &'a ChunkBy<K, I, F>
    where I: Iterator, I::Item: 'a, F: FnMut(&I::Item) -> K, - K: PartialEq,

    §

    type Item = (K, Group<'a, K, I, F>)

    The type of the elements being iterated over.
    §

    type IntoIter = Groups<'a, K, I, F>

    Which kind of iterator are we turning this into?
    source§

    fn into_iter(self) -> Self::IntoIter

    Creates an iterator from a value. Read more

    Auto Trait Implementations§

    §

    impl<K, I, F> !Freeze for GroupBy<K, I, F>

    §

    impl<K, I, F> !RefUnwindSafe for GroupBy<K, I, F>

    §

    impl<K, I, F> Send for GroupBy<K, I, F>
    where + K: PartialEq,

    §

    type Item = (K, Group<'a, K, I, F>)

    The type of the elements being iterated over.
    §

    type IntoIter = Groups<'a, K, I, F>

    Which kind of iterator are we turning this into?
    source§

    fn into_iter(self) -> Self::IntoIter

    Creates an iterator from a value. Read more

    Auto Trait Implementations§

    §

    impl<K, I, F> !Freeze for ChunkBy<K, I, F>

    §

    impl<K, I, F> !RefUnwindSafe for ChunkBy<K, I, F>

    §

    impl<K, I, F> Send for ChunkBy<K, I, F>
    where F: Send, I: Send, K: Send, - <I as Iterator>::Item: Send,

    §

    impl<K, I, F> !Sync for GroupBy<K, I, F>

    §

    impl<K, I, F> Unpin for GroupBy<K, I, F>
    where + <I as Iterator>::Item: Send,

    §

    impl<K, I, F> !Sync for ChunkBy<K, I, F>

    §

    impl<K, I, F> Unpin for ChunkBy<K, I, F>
    where F: Unpin, I: Unpin, K: Unpin, - <I as Iterator>::Item: Unpin,

    §

    impl<K, I, F> UnwindSafe for GroupBy<K, I, F>
    where + <I as Iterator>::Item: Unpin,

    §

    impl<K, I, F> UnwindSafe for ChunkBy<K, I, F>
    where F: UnwindSafe, I: UnwindSafe, K: UnwindSafe, diff --git a/itertools/structs/struct.Chunks.html b/itertools/structs/struct.Chunks.html index a29ac7885..db0652aa6 100644 --- a/itertools/structs/struct.Chunks.html +++ b/itertools/structs/struct.Chunks.html @@ -1,14 +1,14 @@ -Chunks in itertools::structs - Rust
    -

    Struct itertools::structs::Chunks

    source · 
    pub struct Chunks<'a, I>
    where
+Chunks in itertools::structs - Rust
    
+    
    Struct itertools::structs::Chunks
    source · 
    pub struct Chunks<'a, I>
    where
     I: Iterator + 'a,
     I::Item: 'a,
    { /* private fields */ }
    Expand description
    An iterator that yields the Chunk iterators.
    
 
    Iterator element type is Chunk.
    
 
    See .chunks() for more information.
    
-
    Trait Implementations§
    source§
    impl<'a, I> Clone for Chunks<'a, I>
    where
+
    Trait Implementations§
    source§
    impl<'a, I> Clone for Chunks<'a, I>
    where
     I: Iterator + 'a + Clone,
-    I::Item: 'a,
    source§
    fn clone(&self) -> Chunks<'a, I> ⓘ
    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, I> Iterator for Chunks<'a, I>
    where
+    I::Item: 'a,
    source§
    fn clone(&self) -> Chunks<'a, I> ⓘ
    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, I> Iterator for Chunks<'a, I>
    where
     I: Iterator,
-    I::Item: 'a,
    §
    type Item = Chunk<'a, I>
    The type of the elements being iterated over.
    source§
    fn next(&mut self) -> Option<Self::Item>
    Advances the iterator and returns the next value. Read more
    source§
    fn next_chunk<const N: usize>(
+    I::Item: 'a,

    §

    type Item = Chunk<'a, I>

    The type of the elements being iterated over.
    source§

    fn next(&mut self) -> Option<Self::Item>

    Advances the iterator and returns the next value. Read more
    source§

    fn next_chunk<const N: usize>( &mut self ) -> Result<[Self::Item; N], IntoIter<Self::Item, N>>
    where Self: Sized,

    🔬This is a nightly-only experimental API. (iter_next_chunk)
    Advances the iterator and returns an array containing the next N values. Read more
    1.0.0 · source§

    fn size_hint(&self) -> (usize, Option<usize>)

    Returns the bounds on the remaining length of the iterator. Read more
    1.0.0 · source§

    fn count(self) -> usize
    where @@ -203,86 +203,87 @@ otherwise. Right variant of Either<Self, Self> otherwise. Read more

    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> Itertools for T
    where - T: Iterator + ?Sized,

    source§

    fn interleave<J>(self, other: J) -> Interleave<Self, J::IntoIter> ⓘ
    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> Itertools for T
    where + T: Iterator + ?Sized,

    source§

    fn interleave<J>(self, other: J) -> Interleave<Self, J::IntoIter> ⓘ
    where J: IntoIterator<Item = Self::Item>, - Self: Sized,

    Alternate elements from two iterators until both have run out. Read more
    source§

    fn interleave_shortest<J>( + Self: Sized,

    Alternate elements from two iterators until both have run out. Read more
    source§

    fn interleave_shortest<J>( self, other: J ) -> InterleaveShortest<Self, J::IntoIter> ⓘ
    where J: IntoIterator<Item = Self::Item>, Self: Sized,

    Alternate elements from two iterators until at least one of them has run -out. Read more
    source§

    fn intersperse(self, element: Self::Item) -> Intersperse<Self>
    where +out. Read more

    source§

    fn intersperse(self, element: Self::Item) -> Intersperse<Self>
    where Self: Sized, Self::Item: Clone,

    An iterator adaptor to insert a particular value -between each element of the adapted iterator. Read more
    source§

    fn intersperse_with<F>(self, element: F) -> IntersperseWith<Self, F> ⓘ
    where +between each element of the adapted iterator. Read more

    source§

    fn intersperse_with<F>(self, element: F) -> IntersperseWith<Self, F> ⓘ
    where Self: Sized, F: FnMut() -> Self::Item,

    An iterator adaptor to insert a particular value created by a function -between each element of the adapted iterator. Read more
    source§

    fn zip_longest<J>(self, other: J) -> ZipLongest<Self, J::IntoIter> ⓘ
    where +between each element of the adapted iterator. Read more

    source§

    fn get<R>(self, index: R) -> R::Output
    where + Self: Sized, + R: IteratorIndex<Self>,

    Returns an iterator over a subsection of the iterator. Read more
    source§

    fn zip_longest<J>(self, other: J) -> ZipLongest<Self, J::IntoIter> ⓘ
    where J: IntoIterator, Self: Sized,

    Create an iterator which iterates over both this and the specified -iterator simultaneously, yielding pairs of two optional elements. Read more
    source§

    fn zip_eq<J>(self, other: J) -> ZipEq<Self, J::IntoIter> ⓘ
    where +iterator simultaneously, yielding pairs of two optional elements. Read more

    source§

    fn zip_eq<J>(self, other: J) -> ZipEq<Self, J::IntoIter> ⓘ
    where J: IntoIterator, Self: Sized,

    Create an iterator which iterates over both this and the specified -iterator simultaneously, yielding pairs of elements. Read more
    source§

    fn batching<B, F>(self, f: F) -> Batching<Self, F> ⓘ
    where +iterator simultaneously, yielding pairs of elements. Read more

    source§

    fn batching<B, F>(self, f: F) -> Batching<Self, F> ⓘ
    where F: FnMut(&mut Self) -> Option<B>, Self: Sized,

    A “meta iterator adaptor”. Its closure receives a reference to the iterator and may pick off as many elements as it likes, to produce the -next iterator element. Read more
    source§

    fn group_by<K, F>(self, key: F) -> GroupBy<K, Self, F>
    where +next iterator element. Read more

    source§

    fn chunk_by<K, F>(self, key: F) -> ChunkBy<K, Self, F>
    where Self: Sized, F: FnMut(&Self::Item) -> K, K: PartialEq,

    Return an iterable that can group iterator elements. Consecutive elements that map to the same key (“runs”), are assigned -to the same group. Read more
    source§

    fn chunks(self, size: usize) -> IntoChunks<Self>
    where - Self: Sized,

    Return an iterable that can chunk the iterator. Read more
    source§

    fn tuple_windows<T>(self) -> TupleWindows<Self, T> ⓘ
    where +to the same group. Read more

    source§

    fn group_by<K, F>(self, key: F) -> ChunkBy<K, Self, F>
    where + Self: Sized, + F: FnMut(&Self::Item) -> K, + K: PartialEq,

    👎Deprecated since 0.13.0: Use .chunk_by() instead
    See .chunk_by().
    source§

    fn chunks(self, size: usize) -> IntoChunks<Self>
    where + Self: Sized,

    Return an iterable that can chunk the iterator. Read more
    source§

    fn tuple_windows<T>(self) -> TupleWindows<Self, T> ⓘ
    where Self: Sized + Iterator<Item = T::Item>, T: HomogeneousTuple, T::Item: Clone,

    Return an iterator over all contiguous windows producing tuples of -a specific size (up to 12). Read more
    source§

    fn circular_tuple_windows<T>(self) -> CircularTupleWindows<Self, T> ⓘ
    where +a specific size (up to 12). Read more

    source§

    fn circular_tuple_windows<T>(self) -> CircularTupleWindows<Self, T> ⓘ
    where Self: Sized + Clone + Iterator<Item = T::Item> + ExactSizeIterator, T: TupleCollect + Clone, T::Item: Clone,

    Return an iterator over all windows, wrapping back to the first elements when the window would otherwise exceed the length of the -iterator, producing tuples of a specific size (up to 12). Read more
    source§

    fn tuples<T>(self) -> Tuples<Self, T> ⓘ
    where +iterator, producing tuples of a specific size (up to 12). Read more

    source§

    fn tuples<T>(self) -> Tuples<Self, T> ⓘ
    where Self: Sized + Iterator<Item = T::Item>, T: HomogeneousTuple,

    Return an iterator that groups the items in tuples of a specific size -(up to 12). Read more
    source§

    fn tee(self) -> (Tee<Self>, Tee<Self>)
    where +(up to 12). Read more

    source§

    fn tee(self) -> (Tee<Self>, Tee<Self>)
    where Self: Sized, Self::Item: Clone,

    Split into an iterator pair that both yield all elements from -the original iterator. Read more
    source§

    fn step(self, n: usize) -> Step<Self> ⓘ
    where - Self: Sized,

    👎Deprecated since 0.8.0: Use std .step_by() instead
    Return an iterator adaptor that steps n elements in the base iterator -for each iteration. Read more
    source§

    fn map_into<R>(self) -> MapInto<Self, R>
    where +the original iterator. Read more

    source§

    fn map_into<R>(self) -> MapInto<Self, R>
    where Self: Sized, - Self::Item: Into<R>,

    Convert each item of the iterator using the Into trait. Read more
    source§

    fn map_results<F, T, U, E>(self, f: F) -> MapOk<Self, F>
    where - Self: Iterator<Item = Result<T, E>> + Sized, - F: FnMut(T) -> U,

    👎Deprecated since 0.10.0: Use .map_ok() instead
    See .map_ok().
    source§

    fn map_ok<F, T, U, E>(self, f: F) -> MapOk<Self, F>
    where + Self::Item: Into<R>,

    Convert each item of the iterator using the Into trait. Read more
    source§

    fn map_ok<F, T, U, E>(self, f: F) -> MapOk<Self, F>
    where Self: Iterator<Item = Result<T, E>> + Sized, F: FnMut(T) -> U,

    Return an iterator adaptor that applies the provided closure to every Result::Ok value. Result::Err values are -unchanged. Read more
    source§

    fn filter_ok<F, T, E>(self, f: F) -> FilterOk<Self, F> ⓘ
    where +unchanged. Read more

    source§

    fn filter_ok<F, T, E>(self, f: F) -> FilterOk<Self, F> ⓘ
    where Self: Iterator<Item = Result<T, E>> + Sized, F: FnMut(&T) -> bool,

    Return an iterator adaptor that filters every Result::Ok value with the provided closure. Result::Err values are -unchanged. Read more
    source§

    fn filter_map_ok<F, T, U, E>(self, f: F) -> FilterMapOk<Self, F> ⓘ
    where +unchanged. Read more

    source§

    fn filter_map_ok<F, T, U, E>(self, f: F) -> FilterMapOk<Self, F> ⓘ
    where Self: Iterator<Item = Result<T, E>> + Sized, F: FnMut(T) -> Option<U>,

    Return an iterator adaptor that filters and transforms every Result::Ok value with the provided closure. Result::Err -values are unchanged. Read more
    source§

    fn flatten_ok<T, E>(self) -> FlattenOk<Self, T, E> ⓘ
    where +values are unchanged. Read more

    source§

    fn flatten_ok<T, E>(self) -> FlattenOk<Self, T, E> ⓘ
    where Self: Iterator<Item = Result<T, E>> + Sized, T: IntoIterator,

    Return an iterator adaptor that flattens every Result::Ok value into -a series of Result::Ok values. Result::Err values are unchanged. Read more
    source§

    fn process_results<F, T, E, R>(self, processor: F) -> Result<R, E>
    where +a series of Result::Ok values. Result::Err values are unchanged. Read more

    source§

    fn process_results<F, T, E, R>(self, processor: F) -> Result<R, E>
    where Self: Iterator<Item = Result<T, E>> + Sized, F: FnOnce(ProcessResults<'_, Self, E>) -> R,

    “Lift” a function of the values of the current iterator so as to process -an iterator of Result values instead. Read more
    source§

    fn merge<J>(self, other: J) -> Merge<Self, J::IntoIter>
    where +an iterator of Result values instead. Read more

    source§

    fn merge<J>(self, other: J) -> Merge<Self, J::IntoIter>
    where Self: Sized, Self::Item: PartialOrd, J: IntoIterator<Item = Self::Item>,

    Return an iterator adaptor that merges the two base iterators in ascending order. If both base iterators are sorted (ascending), the -result is sorted. Read more
    source§

    fn merge_by<J, F>(self, other: J, is_first: F) -> MergeBy<Self, J::IntoIter, F> ⓘ
    where +result is sorted. Read more

    source§

    fn merge_by<J, F>(self, other: J, is_first: F) -> MergeBy<Self, J::IntoIter, F> ⓘ
    where Self: Sized, J: IntoIterator<Item = Self::Item>, F: FnMut(&Self::Item, &Self::Item) -> bool,

    Return an iterator adaptor that merges the two base iterators in order. -This is much like .merge() but allows for a custom ordering. Read more
    source§

    fn merge_join_by<J, F, T>( +This is much like .merge() but allows for a custom ordering. Read more

    source§

    fn merge_join_by<J, F, T>( self, other: J, cmp_fn: F @@ -290,285 +291,296 @@ This is much like IntoIterator, F: FnMut(&Self::Item, &J::Item) -> T, Self: Sized,

    Create an iterator that merges items from both this and the specified -iterator in ascending order. Read more
    source§

    fn kmerge(self) -> KMerge<<Self::Item as IntoIterator>::IntoIter>
    where +iterator in ascending order. Read more

    source§

    fn kmerge(self) -> KMerge<<Self::Item as IntoIterator>::IntoIter>
    where Self: Sized, Self::Item: IntoIterator, <Self::Item as IntoIterator>::Item: PartialOrd,

    Return an iterator adaptor that flattens an iterator of iterators by -merging them in ascending order. Read more
    source§

    fn kmerge_by<F>( +merging them in ascending order. Read more

    source§

    fn kmerge_by<F>( self, first: F ) -> KMergeBy<<Self::Item as IntoIterator>::IntoIter, F> ⓘ
    where Self: Sized, Self::Item: IntoIterator, F: FnMut(&<Self::Item as IntoIterator>::Item, &<Self::Item as IntoIterator>::Item) -> bool,

    Return an iterator adaptor that flattens an iterator of iterators by -merging them according to the given closure. Read more
    source§

    fn cartesian_product<J>(self, other: J) -> Product<Self, J::IntoIter> ⓘ
    where +merging them according to the given closure. Read more

    source§

    fn cartesian_product<J>(self, other: J) -> Product<Self, J::IntoIter> ⓘ
    where Self: Sized, Self::Item: Clone, J: IntoIterator, J::IntoIter: Clone,

    Return an iterator adaptor that iterates over the cartesian product of -the element sets of two iterators self and J. Read more
    source§

    fn multi_cartesian_product( +the element sets of two iterators self and J. Read more

    source§

    fn multi_cartesian_product( self ) -> MultiProduct<<Self::Item as IntoIterator>::IntoIter> ⓘ
    where Self: Sized, Self::Item: IntoIterator, <Self::Item as IntoIterator>::IntoIter: Clone, <Self::Item as IntoIterator>::Item: Clone,

    Return an iterator adaptor that iterates over the cartesian product of -all subiterators returned by meta-iterator self. Read more
    source§

    fn coalesce<F>(self, f: F) -> Coalesce<Self, F>
    where +all subiterators returned by meta-iterator self. Read more

    source§

    fn coalesce<F>(self, f: F) -> Coalesce<Self, F>
    where Self: Sized, F: FnMut(Self::Item, Self::Item) -> Result<Self::Item, (Self::Item, Self::Item)>,

    Return an iterator adaptor that uses the passed-in closure to -optionally merge together consecutive elements. Read more
    source§

    fn dedup(self) -> Dedup<Self>
    where +optionally merge together consecutive elements. Read more

    source§

    fn dedup(self) -> Dedup<Self>
    where Self: Sized, Self::Item: PartialEq,

    Remove duplicates from sections of consecutive identical elements. -If the iterator is sorted, all elements will be unique. Read more
    source§

    fn dedup_by<Cmp>(self, cmp: Cmp) -> DedupBy<Self, Cmp>
    where +If the iterator is sorted, all elements will be unique. Read more

    source§

    fn dedup_by<Cmp>(self, cmp: Cmp) -> DedupBy<Self, Cmp>
    where Self: Sized, Cmp: FnMut(&Self::Item, &Self::Item) -> bool,

    Remove duplicates from sections of consecutive identical elements, determining equality using a comparison function. -If the iterator is sorted, all elements will be unique. Read more
    source§

    fn dedup_with_count(self) -> DedupWithCount<Self>
    where +If the iterator is sorted, all elements will be unique. Read more

    source§

    fn dedup_with_count(self) -> DedupWithCount<Self>
    where Self: Sized,

    Remove duplicates from sections of consecutive identical elements, while keeping a count of how many repeated elements were present. -If the iterator is sorted, all elements will be unique. Read more
    source§

    fn dedup_by_with_count<Cmp>(self, cmp: Cmp) -> DedupByWithCount<Self, Cmp>
    where +If the iterator is sorted, all elements will be unique. Read more

    source§

    fn dedup_by_with_count<Cmp>(self, cmp: Cmp) -> DedupByWithCount<Self, Cmp>
    where Self: Sized, Cmp: FnMut(&Self::Item, &Self::Item) -> bool,

    Remove duplicates from sections of consecutive identical elements, while keeping a count of how many repeated elements were present. This will determine equality using a comparison function. -If the iterator is sorted, all elements will be unique. Read more
    source§

    fn duplicates(self) -> Duplicates<Self>
    where +If the iterator is sorted, all elements will be unique. Read more

    source§

    fn duplicates(self) -> Duplicates<Self>
    where Self: Sized, Self::Item: Eq + Hash,

    Return an iterator adaptor that produces elements that appear more than once during the -iteration. Duplicates are detected using hash and equality. Read more
    source§

    fn duplicates_by<V, F>(self, f: F) -> DuplicatesBy<Self, V, F>
    where +iteration. Duplicates are detected using hash and equality. Read more

    source§

    fn duplicates_by<V, F>(self, f: F) -> DuplicatesBy<Self, V, F>
    where Self: Sized, V: Eq + Hash, F: FnMut(&Self::Item) -> V,

    Return an iterator adaptor that produces elements that appear more than once during the -iteration. Duplicates are detected using hash and equality. Read more
    source§

    fn unique(self) -> Unique<Self> ⓘ
    where +iteration. Duplicates are detected using hash and equality. Read more

    source§

    fn unique(self) -> Unique<Self> ⓘ
    where Self: Sized, Self::Item: Clone + Eq + Hash,

    Return an iterator adaptor that filters out elements that have already been produced once during the iteration. Duplicates -are detected using hash and equality. Read more
    source§

    fn unique_by<V, F>(self, f: F) -> UniqueBy<Self, V, F> ⓘ
    where +are detected using hash and equality. Read more

    source§

    fn unique_by<V, F>(self, f: F) -> UniqueBy<Self, V, F> ⓘ
    where Self: Sized, V: Eq + Hash, F: FnMut(&Self::Item) -> V,

    Return an iterator adaptor that filters out elements that have -already been produced once during the iteration. Read more
    source§

    fn peeking_take_while<F>(&mut self, accept: F) -> PeekingTakeWhile<'_, Self, F> ⓘ
    where +already been produced once during the iteration. Read more

    source§

    fn peeking_take_while<F>(&mut self, accept: F) -> PeekingTakeWhile<'_, Self, F> ⓘ
    where Self: Sized + PeekingNext, F: FnMut(&Self::Item) -> bool,

    Return an iterator adaptor that borrows from this iterator and -takes items while the closure accept returns true. Read more
    source§

    fn take_while_ref<F>(&mut self, accept: F) -> TakeWhileRef<'_, Self, F> ⓘ
    where +takes items while the closure accept returns true. Read more

    source§

    fn take_while_ref<F>(&mut self, accept: F) -> TakeWhileRef<'_, Self, F> ⓘ
    where Self: Clone, F: FnMut(&Self::Item) -> bool,

    Return an iterator adaptor that borrows from a Clone-able iterator -to only pick off elements while the predicate accept returns true. Read more
    source§

    fn take_while_inclusive<F>(self, accept: F) -> TakeWhileInclusive<Self, F> ⓘ
    where +to only pick off elements while the predicate accept returns true. Read more

    source§

    fn take_while_inclusive<F>(self, accept: F) -> TakeWhileInclusive<Self, F> ⓘ
    where Self: Sized, F: FnMut(&Self::Item) -> bool,

    Returns an iterator adaptor that consumes elements while the given predicate is true, including the element for which the predicate -first returned false. Read more
    source§

    fn while_some<A>(self) -> WhileSome<Self> ⓘ
    where +first returned false. Read more

    source§

    fn while_some<A>(self) -> WhileSome<Self> ⓘ
    where Self: Sized + Iterator<Item = Option<A>>,

    Return an iterator adaptor that filters Option<A> iterator elements -and produces A. Stops on the first None encountered. Read more
    source§

    fn tuple_combinations<T>(self) -> TupleCombinations<Self, T> ⓘ
    where +and produces A. Stops on the first None encountered. Read more

    source§

    fn tuple_combinations<T>(self) -> TupleCombinations<Self, T> ⓘ
    where Self: Sized + Clone, Self::Item: Clone, T: HasCombination<Self>,

    Return an iterator adaptor that iterates over the combinations of the -elements from an iterator. Read more
    source§

    fn combinations(self, k: usize) -> Combinations<Self> ⓘ
    where +elements from an iterator. Read more

    source§

    fn combinations(self, k: usize) -> Combinations<Self> ⓘ
    where Self: Sized, Self::Item: Clone,

    Return an iterator adaptor that iterates over the k-length combinations of -the elements from an iterator. Read more
    source§

    fn combinations_with_replacement( +the elements from an iterator. Read more

    source§

    fn combinations_with_replacement( self, k: usize ) -> CombinationsWithReplacement<Self> ⓘ
    where Self: Sized, Self::Item: Clone,

    Return an iterator that iterates over the k-length combinations of -the elements from an iterator, with replacement. Read more
    source§

    fn permutations(self, k: usize) -> Permutations<Self> ⓘ
    where +the elements from an iterator, with replacement. Read more

    source§

    fn permutations(self, k: usize) -> Permutations<Self> ⓘ
    where Self: Sized, Self::Item: Clone,

    Return an iterator adaptor that iterates over all k-permutations of the -elements from an iterator. Read more
    source§

    fn powerset(self) -> Powerset<Self> ⓘ
    where +elements from an iterator. Read more

    source§

    fn powerset(self) -> Powerset<Self> ⓘ
    where Self: Sized, Self::Item: Clone,

    Return an iterator that iterates through the powerset of the elements from an -iterator. Read more
    source§

    fn pad_using<F>(self, min: usize, f: F) -> PadUsing<Self, F> ⓘ
    where +iterator. Read more

    source§

    fn pad_using<F>(self, min: usize, f: F) -> PadUsing<Self, F> ⓘ
    where Self: Sized, F: FnMut(usize) -> Self::Item,

    Return an iterator adaptor that pads the sequence to a minimum length of -min by filling missing elements using a closure f. Read more
    source§

    fn with_position(self) -> WithPosition<Self> ⓘ
    where +min by filling missing elements using a closure f. Read more

    source§

    fn with_position(self) -> WithPosition<Self> ⓘ
    where Self: Sized,

    Return an iterator adaptor that combines each element with a Position to -ease special-case handling of the first or last elements. Read more
    source§

    fn positions<P>(self, predicate: P) -> Positions<Self, P> ⓘ
    where +ease special-case handling of the first or last elements. Read more

    source§

    fn positions<P>(self, predicate: P) -> Positions<Self, P> ⓘ
    where Self: Sized, P: FnMut(Self::Item) -> bool,

    Return an iterator adaptor that yields the indices of all elements -satisfying a predicate, counted from the start of the iterator. Read more
    source§

    fn update<F>(self, updater: F) -> Update<Self, F> ⓘ
    where +satisfying a predicate, counted from the start of the iterator. Read more

    source§

    fn update<F>(self, updater: F) -> Update<Self, F> ⓘ
    where Self: Sized, F: FnMut(&mut Self::Item),

    Return an iterator adaptor that applies a mutating function -to each element before yielding it. Read more
    source§

    fn next_tuple<T>(&mut self) -> Option<T>
    where +to each element before yielding it. Read more

    source§

    fn next_tuple<T>(&mut self) -> Option<T>
    where Self: Sized + Iterator<Item = T::Item>, T: HomogeneousTuple,

    Advances the iterator and returns the next items grouped in a tuple of -a specific size (up to 12). Read more
    source§

    fn collect_tuple<T>(self) -> Option<T>
    where +a specific size (up to 12). Read more

    source§

    fn collect_tuple<T>(self) -> Option<T>
    where Self: Sized + Iterator<Item = T::Item>, T: HomogeneousTuple,

    Collects all items from the iterator into a tuple of a specific size -(up to 12). Read more
    source§

    fn find_position<P>(&mut self, pred: P) -> Option<(usize, Self::Item)>
    where - P: FnMut(&Self::Item) -> bool,

    Find the position and value of the first element satisfying a predicate. Read more
    source§

    fn find_or_last<P>(self, predicate: P) -> Option<Self::Item>
    where +(up to 12). Read more

    source§

    fn find_position<P>(&mut self, pred: P) -> Option<(usize, Self::Item)>
    where + P: FnMut(&Self::Item) -> bool,

    Find the position and value of the first element satisfying a predicate. Read more
    source§

    fn find_or_last<P>(self, predicate: P) -> Option<Self::Item>
    where Self: Sized, - P: FnMut(&Self::Item) -> bool,

    Find the value of the first element satisfying a predicate or return the last element, if any. Read more
    source§

    fn find_or_first<P>(self, predicate: P) -> Option<Self::Item>
    where + P: FnMut(&Self::Item) -> bool,

    Find the value of the first element satisfying a predicate or return the last element, if any. Read more
    source§

    fn find_or_first<P>(self, predicate: P) -> Option<Self::Item>
    where Self: Sized, - P: FnMut(&Self::Item) -> bool,

    Find the value of the first element satisfying a predicate or return the first element, if any. Read more
    source§

    fn contains<Q>(&mut self, query: &Q) -> bool
    where + P: FnMut(&Self::Item) -> bool,

    Find the value of the first element satisfying a predicate or return the first element, if any. Read more
    source§

    fn contains<Q>(&mut self, query: &Q) -> bool
    where Self: Sized, Self::Item: Borrow<Q>, - Q: PartialEq,

    Returns true if the given item is present in this iterator. Read more
    source§

    fn all_equal(&mut self) -> bool
    where + Q: PartialEq,

    Returns true if the given item is present in this iterator. Read more
    source§

    fn all_equal(&mut self) -> bool
    where Self: Sized, - Self::Item: PartialEq,

    Check whether all elements compare equal. Read more
    source§

    fn all_equal_value( + Self::Item: PartialEq,

    Check whether all elements compare equal. Read more
    source§

    fn all_equal_value( &mut self ) -> Result<Self::Item, Option<(Self::Item, Self::Item)>>
    where Self: Sized, Self::Item: PartialEq,

    If there are elements and they are all equal, return a single copy of that element. If there are no elements, return an Error containing None. If there are elements and they are not all equal, return a tuple containing the first -two non-equal elements found. Read more
    source§

    fn all_unique(&mut self) -> bool
    where +two non-equal elements found. Read more

    source§

    fn all_unique(&mut self) -> bool
    where Self: Sized, - Self::Item: Eq + Hash,

    Check whether all elements are unique (non equal). Read more
    source§

    fn dropping(self, n: usize) -> Self
    where + Self::Item: Eq + Hash,

    Check whether all elements are unique (non equal). Read more
    source§

    fn dropping(self, n: usize) -> Self
    where Self: Sized,

    Consume the first n elements from the iterator eagerly, -and return the same iterator again. Read more
    source§

    fn dropping_back(self, n: usize) -> Self
    where +and return the same iterator again. Read more

    source§

    fn dropping_back(self, n: usize) -> Self
    where Self: Sized + DoubleEndedIterator,

    Consume the last n elements from the iterator eagerly, -and return the same iterator again. Read more
    source§

    fn foreach<F>(self, f: F)
    where - F: FnMut(Self::Item), - Self: Sized,

    👎Deprecated since 0.8.0: Use .for_each() instead
    Run the closure f eagerly on each element of the iterator. Read more
    source§

    fn concat(self) -> Self::Item
    where +and return the same iterator again. Read more

    source§

    fn concat(self) -> Self::Item
    where Self: Sized, - Self::Item: Extend<<<Self as Iterator>::Item as IntoIterator>::Item> + IntoIterator + Default,

    Combine all an iterator’s elements into one element by using Extend. Read more
    source§

    fn collect_vec(self) -> Vec<Self::Item>
    where + Self::Item: Extend<<<Self as Iterator>::Item as IntoIterator>::Item> + IntoIterator + Default,

    Combine all an iterator’s elements into one element by using Extend. Read more
    source§

    fn collect_vec(self) -> Vec<Self::Item>
    where Self: Sized,

    .collect_vec() is simply a type specialization of Iterator::collect, -for convenience.
    source§

    fn try_collect<T, U, E>(self) -> Result<U, E>
    where +for convenience.

    source§

    fn try_collect<T, U, E>(self) -> Result<U, E>
    where Self: Sized + Iterator<Item = Result<T, E>>, Result<U, E>: FromIterator<Result<T, E>>,

    .try_collect() is more convenient way of writing -.collect::<Result<_, _>>() Read more
    source§

    fn set_from<'a, A: 'a, J>(&mut self, from: J) -> usize
    where +.collect::<Result<_, _>>() Read more

    source§

    fn set_from<'a, A: 'a, J>(&mut self, from: J) -> usize
    where Self: Iterator<Item = &'a mut A>, J: IntoIterator<Item = A>,

    Assign to each reference in self from the from iterator, -stopping at the shortest of the two iterators. Read more
    source§

    fn join(&mut self, sep: &str) -> String
    where - Self::Item: Display,

    Combine all iterator elements into one String, separated by sep. Read more
    source§

    fn format(self, sep: &str) -> Format<'_, Self>
    where - Self: Sized,

    Format all iterator elements, separated by sep. Read more
    source§

    fn format_with<F>(self, sep: &str, format: F) -> FormatWith<'_, Self, F>
    where +stopping at the shortest of the two iterators. Read more

    source§

    fn join(&mut self, sep: &str) -> String
    where + Self::Item: Display,

    Combine all iterator elements into one String, separated by sep. Read more
    source§

    fn format(self, sep: &str) -> Format<'_, Self>
    where + Self: Sized,

    Format all iterator elements, separated by sep. Read more
    source§

    fn format_with<F>(self, sep: &str, format: F) -> FormatWith<'_, Self, F>
    where Self: Sized, - F: FnMut(Self::Item, &mut dyn FnMut(&dyn Display) -> Result) -> Result,

    Format all iterator elements, separated by sep. Read more
    source§

    fn fold_results<A, E, B, F>(&mut self, start: B, f: F) -> Result<B, E>
    where + F: FnMut(Self::Item, &mut dyn FnMut(&dyn Display) -> Result) -> Result,

    Format all iterator elements, separated by sep. Read more
    source§

    fn fold_ok<A, E, B, F>(&mut self, start: B, f: F) -> Result<B, E>
    where Self: Iterator<Item = Result<A, E>>, - F: FnMut(B, A) -> B,

    👎Deprecated since 0.10.0: Use .fold_ok() instead
    See .fold_ok().
    source§

    fn fold_ok<A, E, B, F>(&mut self, start: B, f: F) -> Result<B, E>
    where - Self: Iterator<Item = Result<A, E>>, - F: FnMut(B, A) -> B,

    Fold Result values from an iterator. Read more
    source§

    fn fold_options<A, B, F>(&mut self, start: B, f: F) -> Option<B>
    where + F: FnMut(B, A) -> B,

    Fold Result values from an iterator. Read more
    source§

    fn fold_options<A, B, F>(&mut self, start: B, f: F) -> Option<B>
    where Self: Iterator<Item = Option<A>>, - F: FnMut(B, A) -> B,

    Fold Option values from an iterator. Read more
    source§

    fn fold1<F>(self, f: F) -> Option<Self::Item>
    where + F: FnMut(B, A) -> B,

    Fold Option values from an iterator. Read more
    source§

    fn fold1<F>(self, f: F) -> Option<Self::Item>
    where F: FnMut(Self::Item, Self::Item) -> Self::Item, - Self: Sized,

    👎Deprecated since 0.10.2: Use Iterator::reduce instead
    Accumulator of the elements in the iterator. Read more
    source§

    fn tree_fold1<F>(self, f: F) -> Option<Self::Item>
    where + Self: Sized,

    👎Deprecated since 0.10.2: Use Iterator::reduce instead
    Accumulator of the elements in the iterator. Read more
    source§

    fn tree_reduce<F>(self, f: F) -> Option<Self::Item>
    where F: FnMut(Self::Item, Self::Item) -> Self::Item, - Self: Sized,

    Accumulate the elements in the iterator in a tree-like manner. Read more
    source§

    fn fold_while<B, F>(&mut self, init: B, f: F) -> FoldWhile<B>
    where + Self: Sized,

    Accumulate the elements in the iterator in a tree-like manner. Read more
    source§

    fn tree_fold1<F>(self, f: F) -> Option<Self::Item>
    where + F: FnMut(Self::Item, Self::Item) -> Self::Item, + Self: Sized,

    👎Deprecated since 0.13.0: Use .tree_reduce() instead
    See .tree_reduce().
    source§

    fn fold_while<B, F>(&mut self, init: B, f: F) -> FoldWhile<B>
    where Self: Sized, - F: FnMut(B, Self::Item) -> FoldWhile<B>,

    An iterator method that applies a function, producing a single, final value. Read more
    source§

    fn sum1<S>(self) -> Option<S>
    where + F: FnMut(B, Self::Item) -> FoldWhile<B>,

    An iterator method that applies a function, producing a single, final value. Read more
    source§

    fn sum1<S>(self) -> Option<S>
    where Self: Sized, - S: Sum<Self::Item>,

    Iterate over the entire iterator and add all the elements. Read more
    source§

    fn product1<P>(self) -> Option<P>
    where + S: Sum<Self::Item>,

    Iterate over the entire iterator and add all the elements. Read more
    source§

    fn product1<P>(self) -> Option<P>
    where Self: Sized, - P: Product<Self::Item>,

    Iterate over the entire iterator and multiply all the elements. Read more
    source§

    fn sorted_unstable(self) -> IntoIter<Self::Item> ⓘ
    where + P: Product<Self::Item>,

    Iterate over the entire iterator and multiply all the elements. Read more
    source§

    fn sorted_unstable(self) -> IntoIter<Self::Item> ⓘ
    where Self: Sized, - Self::Item: Ord,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_unstable_by<F>(self, cmp: F) -> IntoIter<Self::Item> ⓘ
    where + Self::Item: Ord,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_unstable_by<F>(self, cmp: F) -> IntoIter<Self::Item> ⓘ
    where Self: Sized, - F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_unstable_by_key<K, F>(self, f: F) -> IntoIter<Self::Item> ⓘ
    where + F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_unstable_by_key<K, F>(self, f: F) -> IntoIter<Self::Item> ⓘ
    where Self: Sized, K: Ord, - F: FnMut(&Self::Item) -> K,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted(self) -> IntoIter<Self::Item> ⓘ
    where + F: FnMut(&Self::Item) -> K,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted(self) -> IntoIter<Self::Item> ⓘ
    where Self: Sized, - Self::Item: Ord,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_by<F>(self, cmp: F) -> IntoIter<Self::Item> ⓘ
    where + Self::Item: Ord,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_by<F>(self, cmp: F) -> IntoIter<Self::Item> ⓘ
    where Self: Sized, - F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_by_key<K, F>(self, f: F) -> IntoIter<Self::Item> ⓘ
    where + F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_by_key<K, F>(self, f: F) -> IntoIter<Self::Item> ⓘ
    where Self: Sized, K: Ord, - F: FnMut(&Self::Item) -> K,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_by_cached_key<K, F>(self, f: F) -> IntoIter<Self::Item> ⓘ
    where + F: FnMut(&Self::Item) -> K,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_by_cached_key<K, F>(self, f: F) -> IntoIter<Self::Item> ⓘ
    where Self: Sized, K: Ord, F: FnMut(&Self::Item) -> K,

    Sort all iterator elements into a new iterator in ascending order. The key function is -called exactly once per key. Read more
    source§

    fn k_smallest(self, k: usize) -> IntoIter<Self::Item> ⓘ
    where +called exactly once per key. Read more

    source§

    fn k_smallest(self, k: usize) -> IntoIter<Self::Item> ⓘ
    where Self: Sized, - Self::Item: Ord,

    Sort the k smallest elements into a new iterator, in ascending order. Read more
    source§

    fn partition_map<A, B, F, L, R>(self, predicate: F) -> (A, B)
    where + Self::Item: Ord,

    Sort the k smallest elements into a new iterator, in ascending order. Read more
    source§

    fn k_smallest_by<F>(self, k: usize, cmp: F) -> IntoIter<Self::Item> ⓘ
    where + Self: Sized, + F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Sort the k smallest elements into a new iterator using the provided comparison. Read more
    source§

    fn k_smallest_by_key<F, K>(self, k: usize, key: F) -> IntoIter<Self::Item> ⓘ
    where + Self: Sized, + F: FnMut(&Self::Item) -> K, + K: Ord,

    Return the elements producing the k smallest outputs of the provided function. Read more
    source§

    fn k_largest(self, k: usize) -> IntoIter<Self::Item> ⓘ
    where + Self: Sized, + Self::Item: Ord,

    Sort the k largest elements into a new iterator, in descending order. Read more
    source§

    fn k_largest_by<F>(self, k: usize, cmp: F) -> IntoIter<Self::Item> ⓘ
    where + Self: Sized, + F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Sort the k largest elements into a new iterator using the provided comparison. Read more
    source§

    fn k_largest_by_key<F, K>(self, k: usize, key: F) -> IntoIter<Self::Item> ⓘ
    where + Self: Sized, + F: FnMut(&Self::Item) -> K, + K: Ord,

    Return the elements producing the k largest outputs of the provided function. Read more
    source§

    fn tail(self, n: usize) -> IntoIter<Self::Item> ⓘ
    where + Self: Sized,

    Consumes the iterator and return an iterator of the last n elements. Read more
    source§

    fn partition_map<A, B, F, L, R>(self, predicate: F) -> (A, B)
    where Self: Sized, F: FnMut(Self::Item) -> Either<L, R>, A: Default + Extend<L>, B: Default + Extend<R>,

    Collect all iterator elements into one of two partitions. Unlike Iterator::partition, each partition may -have a distinct type. Read more
    source§

    fn partition_result<A, B, T, E>(self) -> (A, B)
    where +have a distinct type. Read more

    source§

    fn partition_result<A, B, T, E>(self) -> (A, B)
    where Self: Iterator<Item = Result<T, E>> + Sized, A: Default + Extend<T>, B: Default + Extend<E>,

    Partition a sequence of Results into one list of all the Ok elements -and another list of all the Err elements. Read more
    source§

    fn into_group_map<K, V>(self) -> HashMap<K, Vec<V>>
    where +and another list of all the Err elements. Read more

    source§

    fn into_group_map<K, V>(self) -> HashMap<K, Vec<V>>
    where Self: Iterator<Item = (K, V)> + Sized, K: Hash + Eq,

    Return a HashMap of keys mapped to Vecs of values. Keys and values -are taken from (Key, Value) tuple pairs yielded by the input iterator. Read more
    source§

    fn into_group_map_by<K, V, F>(self, f: F) -> HashMap<K, Vec<V>>
    where +are taken from (Key, Value) tuple pairs yielded by the input iterator. Read more

    source§

    fn into_group_map_by<K, V, F>(self, f: F) -> HashMap<K, Vec<V>>
    where Self: Iterator<Item = V> + Sized, K: Hash + Eq, - F: Fn(&V) -> K,

    Return an Iterator on a HashMap. Keys mapped to Vecs of values. The key is specified -in the closure. Read more
    source§

    fn into_grouping_map<K, V>(self) -> GroupingMap<Self>
    where + F: FnMut(&V) -> K,

    Return an Iterator on a HashMap. Keys mapped to Vecs of values. The key is specified +in the closure. Read more
    source§

    fn into_grouping_map<K, V>(self) -> GroupingMap<Self>
    where Self: Iterator<Item = (K, V)> + Sized, K: Hash + Eq,

    Constructs a GroupingMap to be used later with one of the efficient -group-and-fold operations it allows to perform. Read more
    source§

    fn into_grouping_map_by<K, V, F>(self, key_mapper: F) -> GroupingMapBy<Self, F>
    where +group-and-fold operations it allows to perform. Read more

    source§

    fn into_grouping_map_by<K, V, F>(self, key_mapper: F) -> GroupingMapBy<Self, F>
    where Self: Iterator<Item = V> + Sized, K: Hash + Eq, F: FnMut(&V) -> K,

    Constructs a GroupingMap to be used later with one of the efficient -group-and-fold operations it allows to perform. Read more
    source§

    fn min_set(self) -> Vec<Self::Item>
    where +group-and-fold operations it allows to perform. Read more

    source§

    fn min_set(self) -> Vec<Self::Item>
    where Self: Sized, - Self::Item: Ord,

    Return all minimum elements of an iterator. Read more
    source§

    fn min_set_by<F>(self, compare: F) -> Vec<Self::Item>
    where + Self::Item: Ord,

    Return all minimum elements of an iterator. Read more
    source§

    fn min_set_by<F>(self, compare: F) -> Vec<Self::Item>
    where Self: Sized, F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Return all minimum elements of an iterator, as determined by -the specified function. Read more
    source§

    fn min_set_by_key<K, F>(self, key: F) -> Vec<Self::Item>
    where +the specified function. Read more

    source§

    fn min_set_by_key<K, F>(self, key: F) -> Vec<Self::Item>
    where Self: Sized, K: Ord, F: FnMut(&Self::Item) -> K,

    Return all minimum elements of an iterator, as determined by -the specified function. Read more
    source§

    fn max_set(self) -> Vec<Self::Item>
    where +the specified function. Read more

    source§

    fn max_set(self) -> Vec<Self::Item>
    where Self: Sized, - Self::Item: Ord,

    Return all maximum elements of an iterator. Read more
    source§

    fn max_set_by<F>(self, compare: F) -> Vec<Self::Item>
    where + Self::Item: Ord,

    Return all maximum elements of an iterator. Read more
    source§

    fn max_set_by<F>(self, compare: F) -> Vec<Self::Item>
    where Self: Sized, F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Return all maximum elements of an iterator, as determined by -the specified function. Read more
    source§

    fn max_set_by_key<K, F>(self, key: F) -> Vec<Self::Item>
    where +the specified function. Read more

    source§

    fn max_set_by_key<K, F>(self, key: F) -> Vec<Self::Item>
    where Self: Sized, K: Ord, F: FnMut(&Self::Item) -> K,

    Return all maximum elements of an iterator, as determined by -the specified function. Read more
    source§

    fn minmax(self) -> MinMaxResult<Self::Item>
    where +the specified function. Read more

    source§

    fn minmax(self) -> MinMaxResult<Self::Item>
    where Self: Sized, - Self::Item: PartialOrd,

    Return the minimum and maximum elements in the iterator. Read more
    source§

    fn minmax_by_key<K, F>(self, key: F) -> MinMaxResult<Self::Item>
    where + Self::Item: PartialOrd,

    Return the minimum and maximum elements in the iterator. Read more
    source§

    fn minmax_by_key<K, F>(self, key: F) -> MinMaxResult<Self::Item>
    where Self: Sized, K: PartialOrd, F: FnMut(&Self::Item) -> K,

    Return the minimum and maximum element of an iterator, as determined by -the specified function. Read more
    source§

    fn minmax_by<F>(self, compare: F) -> MinMaxResult<Self::Item>
    where +the specified function. Read more

    source§

    fn minmax_by<F>(self, compare: F) -> MinMaxResult<Self::Item>
    where Self: Sized, F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Return the minimum and maximum element of an iterator, as determined by -the specified comparison function. Read more
    source§

    fn position_max(self) -> Option<usize>
    where +the specified comparison function. Read more

    source§

    fn position_max(self) -> Option<usize>
    where Self: Sized, - Self::Item: Ord,

    Return the position of the maximum element in the iterator. Read more
    source§

    fn position_max_by_key<K, F>(self, key: F) -> Option<usize>
    where + Self::Item: Ord,

    Return the position of the maximum element in the iterator. Read more
    source§

    fn position_max_by_key<K, F>(self, key: F) -> Option<usize>
    where Self: Sized, K: Ord, F: FnMut(&Self::Item) -> K,

    Return the position of the maximum element in the iterator, as -determined by the specified function. Read more
    source§

    fn position_max_by<F>(self, compare: F) -> Option<usize>
    where +determined by the specified function. Read more

    source§

    fn position_max_by<F>(self, compare: F) -> Option<usize>
    where Self: Sized, F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Return the position of the maximum element in the iterator, as -determined by the specified comparison function. Read more
    source§

    fn position_min(self) -> Option<usize>
    where +determined by the specified comparison function. Read more

    source§

    fn position_min(self) -> Option<usize>
    where Self: Sized, - Self::Item: Ord,

    Return the position of the minimum element in the iterator. Read more
    source§

    fn position_min_by_key<K, F>(self, key: F) -> Option<usize>
    where + Self::Item: Ord,

    Return the position of the minimum element in the iterator. Read more
    source§

    fn position_min_by_key<K, F>(self, key: F) -> Option<usize>
    where Self: Sized, K: Ord, F: FnMut(&Self::Item) -> K,

    Return the position of the minimum element in the iterator, as -determined by the specified function. Read more
    source§

    fn position_min_by<F>(self, compare: F) -> Option<usize>
    where +determined by the specified function. Read more

    source§

    fn position_min_by<F>(self, compare: F) -> Option<usize>
    where Self: Sized, F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Return the position of the minimum element in the iterator, as -determined by the specified comparison function. Read more
    source§

    fn position_minmax(self) -> MinMaxResult<usize>
    where +determined by the specified comparison function. Read more

    source§

    fn position_minmax(self) -> MinMaxResult<usize>
    where Self: Sized, Self::Item: PartialOrd,

    Return the positions of the minimum and maximum elements in -the iterator. Read more
    source§

    fn position_minmax_by_key<K, F>(self, key: F) -> MinMaxResult<usize>
    where +the iterator. Read more

    source§

    fn position_minmax_by_key<K, F>(self, key: F) -> MinMaxResult<usize>
    where Self: Sized, K: PartialOrd, F: FnMut(&Self::Item) -> K,

    Return the postions of the minimum and maximum elements of an -iterator, as determined by the specified function. Read more
    source§

    fn position_minmax_by<F>(self, compare: F) -> MinMaxResult<usize>
    where +iterator, as determined by the specified function. Read more

    source§

    fn position_minmax_by<F>(self, compare: F) -> MinMaxResult<usize>
    where Self: Sized, F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Return the postions of the minimum and maximum elements of an -iterator, as determined by the specified comparison function. Read more
    source§

    fn exactly_one(self) -> Result<Self::Item, ExactlyOneError<Self>>
    where +iterator, as determined by the specified comparison function. Read more

    source§

    fn exactly_one(self) -> Result<Self::Item, ExactlyOneError<Self>>
    where Self: Sized,

    If the iterator yields exactly one element, that element will be returned, otherwise an error will be returned containing an iterator that has the same output as the input -iterator. Read more
    source§

    fn at_most_one(self) -> Result<Option<Self::Item>, ExactlyOneError<Self>>
    where - Self: Sized,

    If the iterator yields no elements, Ok(None) will be returned. If the iterator yields +iterator. Read more
    source§

    fn at_most_one(self) -> Result<Option<Self::Item>, ExactlyOneError<Self>>
    where + Self: Sized,

    If the iterator yields no elements, Ok(None) will be returned. If the iterator yields exactly one element, that element will be returned, otherwise an error will be returned -containing an iterator that has the same output as the input iterator. Read more
    source§

    fn multipeek(self) -> MultiPeek<Self> ⓘ
    where +containing an iterator that has the same output as the input iterator. Read more

    source§

    fn multipeek(self) -> MultiPeek<Self> ⓘ
    where Self: Sized,

    An iterator adaptor that allows the user to peek at multiple .next() -values without advancing the base iterator. Read more
    source§

    fn counts(self) -> HashMap<Self::Item, usize>
    where +values without advancing the base iterator. Read more

    source§

    fn counts(self) -> HashMap<Self::Item, usize>
    where Self: Sized, Self::Item: Eq + Hash,

    Collect the items in this iterator and return a HashMap which contains each item that appears in the iterator and the number -of times it appears. Read more
    source§

    fn counts_by<K, F>(self, f: F) -> HashMap<K, usize>
    where +of times it appears. Read more

    source§

    fn counts_by<K, F>(self, f: F) -> HashMap<K, usize>
    where Self: Sized, K: Eq + Hash, F: FnMut(Self::Item) -> K,

    Collect the items in this iterator and return a HashMap which contains each item that appears in the iterator and the number of times it appears, -determining identity using a keying function. Read more
    source§

    fn multiunzip<FromI>(self) -> FromI
    where - Self: Sized + MultiUnzip<FromI>,

    Converts an iterator of tuples into a tuple of containers. Read more
    source§

    fn try_len(&self) -> Result<usize, (usize, Option<usize>)>

    Returns the length of the iterator if one exists. +determining identity using a keying function. Read more
    source§

    fn multiunzip<FromI>(self) -> FromI
    where + Self: Sized + MultiUnzip<FromI>,

    Converts an iterator of tuples into a tuple of containers. Read more
    source§

    fn try_len(&self) -> Result<usize, (usize, Option<usize>)>

    Returns the length of the iterator if one exists. Otherwise return self.size_hint(). Read more
    source§

    impl<T> 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 + 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/itertools/structs/struct.CircularTupleWindows.html b/itertools/structs/struct.CircularTupleWindows.html index 6679f3ab4..2be72887e 100644 --- a/itertools/structs/struct.CircularTupleWindows.html +++ b/itertools/structs/struct.CircularTupleWindows.html @@ -1,4 +1,4 @@ -CircularTupleWindows in itertools::structs - Rust
    +CircularTupleWindows in itertools::structs - Rust

    Struct itertools::structs::CircularTupleWindows

    source · 
    pub struct CircularTupleWindows<I, T>
    where
     I: Iterator<Item = T::Item> + Clone,
     T: TupleCollect + Clone,
    { /* private fields */ }
    Expand description

    An iterator over all windows, wrapping back to the first elements when the @@ -225,86 +225,87 @@ otherwise. Right variant of Either<Self, Self> otherwise. Read more

    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> Itertools for T
    where - T: Iterator + ?Sized,

    source§

    fn interleave<J>(self, other: J) -> Interleave<Self, J::IntoIter> ⓘ
    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> Itertools for T
    where + T: Iterator + ?Sized,

    source§

    fn interleave<J>(self, other: J) -> Interleave<Self, J::IntoIter> ⓘ
    where J: IntoIterator<Item = Self::Item>, - Self: Sized,

    Alternate elements from two iterators until both have run out. Read more
    source§

    fn interleave_shortest<J>( + Self: Sized,

    Alternate elements from two iterators until both have run out. Read more
    source§

    fn interleave_shortest<J>( self, other: J ) -> InterleaveShortest<Self, J::IntoIter> ⓘ
    where J: IntoIterator<Item = Self::Item>, Self: Sized,

    Alternate elements from two iterators until at least one of them has run -out. Read more
    source§

    fn intersperse(self, element: Self::Item) -> Intersperse<Self>
    where +out. Read more

    source§

    fn intersperse(self, element: Self::Item) -> Intersperse<Self>
    where Self: Sized, Self::Item: Clone,

    An iterator adaptor to insert a particular value -between each element of the adapted iterator. Read more
    source§

    fn intersperse_with<F>(self, element: F) -> IntersperseWith<Self, F> ⓘ
    where +between each element of the adapted iterator. Read more

    source§

    fn intersperse_with<F>(self, element: F) -> IntersperseWith<Self, F> ⓘ
    where Self: Sized, F: FnMut() -> Self::Item,

    An iterator adaptor to insert a particular value created by a function -between each element of the adapted iterator. Read more
    source§

    fn zip_longest<J>(self, other: J) -> ZipLongest<Self, J::IntoIter> ⓘ
    where +between each element of the adapted iterator. Read more

    source§

    fn get<R>(self, index: R) -> R::Output
    where + Self: Sized, + R: IteratorIndex<Self>,

    Returns an iterator over a subsection of the iterator. Read more
    source§

    fn zip_longest<J>(self, other: J) -> ZipLongest<Self, J::IntoIter> ⓘ
    where J: IntoIterator, Self: Sized,

    Create an iterator which iterates over both this and the specified -iterator simultaneously, yielding pairs of two optional elements. Read more
    source§

    fn zip_eq<J>(self, other: J) -> ZipEq<Self, J::IntoIter> ⓘ
    where +iterator simultaneously, yielding pairs of two optional elements. Read more

    source§

    fn zip_eq<J>(self, other: J) -> ZipEq<Self, J::IntoIter> ⓘ
    where J: IntoIterator, Self: Sized,

    Create an iterator which iterates over both this and the specified -iterator simultaneously, yielding pairs of elements. Read more
    source§

    fn batching<B, F>(self, f: F) -> Batching<Self, F> ⓘ
    where +iterator simultaneously, yielding pairs of elements. Read more

    source§

    fn batching<B, F>(self, f: F) -> Batching<Self, F> ⓘ
    where F: FnMut(&mut Self) -> Option<B>, Self: Sized,

    A “meta iterator adaptor”. Its closure receives a reference to the iterator and may pick off as many elements as it likes, to produce the -next iterator element. Read more
    source§

    fn group_by<K, F>(self, key: F) -> GroupBy<K, Self, F>
    where +next iterator element. Read more

    source§

    fn chunk_by<K, F>(self, key: F) -> ChunkBy<K, Self, F>
    where Self: Sized, F: FnMut(&Self::Item) -> K, K: PartialEq,

    Return an iterable that can group iterator elements. Consecutive elements that map to the same key (“runs”), are assigned -to the same group. Read more
    source§

    fn chunks(self, size: usize) -> IntoChunks<Self>
    where - Self: Sized,

    Return an iterable that can chunk the iterator. Read more
    source§

    fn tuple_windows<T>(self) -> TupleWindows<Self, T> ⓘ
    where +to the same group. Read more

    source§

    fn group_by<K, F>(self, key: F) -> ChunkBy<K, Self, F>
    where + Self: Sized, + F: FnMut(&Self::Item) -> K, + K: PartialEq,

    👎Deprecated since 0.13.0: Use .chunk_by() instead
    See .chunk_by().
    source§

    fn chunks(self, size: usize) -> IntoChunks<Self>
    where + Self: Sized,

    Return an iterable that can chunk the iterator. Read more
    source§

    fn tuple_windows<T>(self) -> TupleWindows<Self, T> ⓘ
    where Self: Sized + Iterator<Item = T::Item>, T: HomogeneousTuple, T::Item: Clone,

    Return an iterator over all contiguous windows producing tuples of -a specific size (up to 12). Read more
    source§

    fn circular_tuple_windows<T>(self) -> CircularTupleWindows<Self, T> ⓘ
    where +a specific size (up to 12). Read more

    source§

    fn circular_tuple_windows<T>(self) -> CircularTupleWindows<Self, T> ⓘ
    where Self: Sized + Clone + Iterator<Item = T::Item> + ExactSizeIterator, T: TupleCollect + Clone, T::Item: Clone,

    Return an iterator over all windows, wrapping back to the first elements when the window would otherwise exceed the length of the -iterator, producing tuples of a specific size (up to 12). Read more
    source§

    fn tuples<T>(self) -> Tuples<Self, T> ⓘ
    where +iterator, producing tuples of a specific size (up to 12). Read more

    source§

    fn tuples<T>(self) -> Tuples<Self, T> ⓘ
    where Self: Sized + Iterator<Item = T::Item>, T: HomogeneousTuple,

    Return an iterator that groups the items in tuples of a specific size -(up to 12). Read more
    source§

    fn tee(self) -> (Tee<Self>, Tee<Self>)
    where +(up to 12). Read more

    source§

    fn tee(self) -> (Tee<Self>, Tee<Self>)
    where Self: Sized, Self::Item: Clone,

    Split into an iterator pair that both yield all elements from -the original iterator. Read more
    source§

    fn step(self, n: usize) -> Step<Self> ⓘ
    where - Self: Sized,

    👎Deprecated since 0.8.0: Use std .step_by() instead
    Return an iterator adaptor that steps n elements in the base iterator -for each iteration. Read more
    source§

    fn map_into<R>(self) -> MapInto<Self, R>
    where +the original iterator. Read more

    source§

    fn map_into<R>(self) -> MapInto<Self, R>
    where Self: Sized, - Self::Item: Into<R>,

    Convert each item of the iterator using the Into trait. Read more
    source§

    fn map_results<F, T, U, E>(self, f: F) -> MapOk<Self, F>
    where - Self: Iterator<Item = Result<T, E>> + Sized, - F: FnMut(T) -> U,

    👎Deprecated since 0.10.0: Use .map_ok() instead
    See .map_ok().
    source§

    fn map_ok<F, T, U, E>(self, f: F) -> MapOk<Self, F>
    where + Self::Item: Into<R>,

    Convert each item of the iterator using the Into trait. Read more
    source§

    fn map_ok<F, T, U, E>(self, f: F) -> MapOk<Self, F>
    where Self: Iterator<Item = Result<T, E>> + Sized, F: FnMut(T) -> U,

    Return an iterator adaptor that applies the provided closure to every Result::Ok value. Result::Err values are -unchanged. Read more
    source§

    fn filter_ok<F, T, E>(self, f: F) -> FilterOk<Self, F> ⓘ
    where +unchanged. Read more

    source§

    fn filter_ok<F, T, E>(self, f: F) -> FilterOk<Self, F> ⓘ
    where Self: Iterator<Item = Result<T, E>> + Sized, F: FnMut(&T) -> bool,

    Return an iterator adaptor that filters every Result::Ok value with the provided closure. Result::Err values are -unchanged. Read more
    source§

    fn filter_map_ok<F, T, U, E>(self, f: F) -> FilterMapOk<Self, F> ⓘ
    where +unchanged. Read more

    source§

    fn filter_map_ok<F, T, U, E>(self, f: F) -> FilterMapOk<Self, F> ⓘ
    where Self: Iterator<Item = Result<T, E>> + Sized, F: FnMut(T) -> Option<U>,

    Return an iterator adaptor that filters and transforms every Result::Ok value with the provided closure. Result::Err -values are unchanged. Read more
    source§

    fn flatten_ok<T, E>(self) -> FlattenOk<Self, T, E> ⓘ
    where +values are unchanged. Read more

    source§

    fn flatten_ok<T, E>(self) -> FlattenOk<Self, T, E> ⓘ
    where Self: Iterator<Item = Result<T, E>> + Sized, T: IntoIterator,

    Return an iterator adaptor that flattens every Result::Ok value into -a series of Result::Ok values. Result::Err values are unchanged. Read more
    source§

    fn process_results<F, T, E, R>(self, processor: F) -> Result<R, E>
    where +a series of Result::Ok values. Result::Err values are unchanged. Read more

    source§

    fn process_results<F, T, E, R>(self, processor: F) -> Result<R, E>
    where Self: Iterator<Item = Result<T, E>> + Sized, F: FnOnce(ProcessResults<'_, Self, E>) -> R,

    “Lift” a function of the values of the current iterator so as to process -an iterator of Result values instead. Read more
    source§

    fn merge<J>(self, other: J) -> Merge<Self, J::IntoIter>
    where +an iterator of Result values instead. Read more

    source§

    fn merge<J>(self, other: J) -> Merge<Self, J::IntoIter>
    where Self: Sized, Self::Item: PartialOrd, J: IntoIterator<Item = Self::Item>,

    Return an iterator adaptor that merges the two base iterators in ascending order. If both base iterators are sorted (ascending), the -result is sorted. Read more
    source§

    fn merge_by<J, F>(self, other: J, is_first: F) -> MergeBy<Self, J::IntoIter, F> ⓘ
    where +result is sorted. Read more

    source§

    fn merge_by<J, F>(self, other: J, is_first: F) -> MergeBy<Self, J::IntoIter, F> ⓘ
    where Self: Sized, J: IntoIterator<Item = Self::Item>, F: FnMut(&Self::Item, &Self::Item) -> bool,

    Return an iterator adaptor that merges the two base iterators in order. -This is much like .merge() but allows for a custom ordering. Read more
    source§

    fn merge_join_by<J, F, T>( +This is much like .merge() but allows for a custom ordering. Read more

    source§

    fn merge_join_by<J, F, T>( self, other: J, cmp_fn: F @@ -312,284 +313,295 @@ This is much like IntoIterator, F: FnMut(&Self::Item, &J::Item) -> T, Self: Sized,

    Create an iterator that merges items from both this and the specified -iterator in ascending order. Read more
    source§

    fn kmerge(self) -> KMerge<<Self::Item as IntoIterator>::IntoIter>
    where +iterator in ascending order. Read more

    source§

    fn kmerge(self) -> KMerge<<Self::Item as IntoIterator>::IntoIter>
    where Self: Sized, Self::Item: IntoIterator, <Self::Item as IntoIterator>::Item: PartialOrd,

    Return an iterator adaptor that flattens an iterator of iterators by -merging them in ascending order. Read more
    source§

    fn kmerge_by<F>( +merging them in ascending order. Read more

    source§

    fn kmerge_by<F>( self, first: F ) -> KMergeBy<<Self::Item as IntoIterator>::IntoIter, F> ⓘ
    where Self: Sized, Self::Item: IntoIterator, F: FnMut(&<Self::Item as IntoIterator>::Item, &<Self::Item as IntoIterator>::Item) -> bool,

    Return an iterator adaptor that flattens an iterator of iterators by -merging them according to the given closure. Read more
    source§

    fn cartesian_product<J>(self, other: J) -> Product<Self, J::IntoIter> ⓘ
    where +merging them according to the given closure. Read more

    source§

    fn cartesian_product<J>(self, other: J) -> Product<Self, J::IntoIter> ⓘ
    where Self: Sized, Self::Item: Clone, J: IntoIterator, J::IntoIter: Clone,

    Return an iterator adaptor that iterates over the cartesian product of -the element sets of two iterators self and J. Read more
    source§

    fn multi_cartesian_product( +the element sets of two iterators self and J. Read more

    source§

    fn multi_cartesian_product( self ) -> MultiProduct<<Self::Item as IntoIterator>::IntoIter> ⓘ
    where Self: Sized, Self::Item: IntoIterator, <Self::Item as IntoIterator>::IntoIter: Clone, <Self::Item as IntoIterator>::Item: Clone,

    Return an iterator adaptor that iterates over the cartesian product of -all subiterators returned by meta-iterator self. Read more
    source§

    fn coalesce<F>(self, f: F) -> Coalesce<Self, F>
    where +all subiterators returned by meta-iterator self. Read more

    source§

    fn coalesce<F>(self, f: F) -> Coalesce<Self, F>
    where Self: Sized, F: FnMut(Self::Item, Self::Item) -> Result<Self::Item, (Self::Item, Self::Item)>,

    Return an iterator adaptor that uses the passed-in closure to -optionally merge together consecutive elements. Read more
    source§

    fn dedup(self) -> Dedup<Self>
    where +optionally merge together consecutive elements. Read more

    source§

    fn dedup(self) -> Dedup<Self>
    where Self: Sized, Self::Item: PartialEq,

    Remove duplicates from sections of consecutive identical elements. -If the iterator is sorted, all elements will be unique. Read more
    source§

    fn dedup_by<Cmp>(self, cmp: Cmp) -> DedupBy<Self, Cmp>
    where +If the iterator is sorted, all elements will be unique. Read more

    source§

    fn dedup_by<Cmp>(self, cmp: Cmp) -> DedupBy<Self, Cmp>
    where Self: Sized, Cmp: FnMut(&Self::Item, &Self::Item) -> bool,

    Remove duplicates from sections of consecutive identical elements, determining equality using a comparison function. -If the iterator is sorted, all elements will be unique. Read more
    source§

    fn dedup_with_count(self) -> DedupWithCount<Self>
    where +If the iterator is sorted, all elements will be unique. Read more

    source§

    fn dedup_with_count(self) -> DedupWithCount<Self>
    where Self: Sized,

    Remove duplicates from sections of consecutive identical elements, while keeping a count of how many repeated elements were present. -If the iterator is sorted, all elements will be unique. Read more
    source§

    fn dedup_by_with_count<Cmp>(self, cmp: Cmp) -> DedupByWithCount<Self, Cmp>
    where +If the iterator is sorted, all elements will be unique. Read more

    source§

    fn dedup_by_with_count<Cmp>(self, cmp: Cmp) -> DedupByWithCount<Self, Cmp>
    where Self: Sized, Cmp: FnMut(&Self::Item, &Self::Item) -> bool,

    Remove duplicates from sections of consecutive identical elements, while keeping a count of how many repeated elements were present. This will determine equality using a comparison function. -If the iterator is sorted, all elements will be unique. Read more
    source§

    fn duplicates(self) -> Duplicates<Self>
    where +If the iterator is sorted, all elements will be unique. Read more

    source§

    fn duplicates(self) -> Duplicates<Self>
    where Self: Sized, Self::Item: Eq + Hash,

    Return an iterator adaptor that produces elements that appear more than once during the -iteration. Duplicates are detected using hash and equality. Read more
    source§

    fn duplicates_by<V, F>(self, f: F) -> DuplicatesBy<Self, V, F>
    where +iteration. Duplicates are detected using hash and equality. Read more

    source§

    fn duplicates_by<V, F>(self, f: F) -> DuplicatesBy<Self, V, F>
    where Self: Sized, V: Eq + Hash, F: FnMut(&Self::Item) -> V,

    Return an iterator adaptor that produces elements that appear more than once during the -iteration. Duplicates are detected using hash and equality. Read more
    source§

    fn unique(self) -> Unique<Self> ⓘ
    where +iteration. Duplicates are detected using hash and equality. Read more

    source§

    fn unique(self) -> Unique<Self> ⓘ
    where Self: Sized, Self::Item: Clone + Eq + Hash,

    Return an iterator adaptor that filters out elements that have already been produced once during the iteration. Duplicates -are detected using hash and equality. Read more
    source§

    fn unique_by<V, F>(self, f: F) -> UniqueBy<Self, V, F> ⓘ
    where +are detected using hash and equality. Read more

    source§

    fn unique_by<V, F>(self, f: F) -> UniqueBy<Self, V, F> ⓘ
    where Self: Sized, V: Eq + Hash, F: FnMut(&Self::Item) -> V,

    Return an iterator adaptor that filters out elements that have -already been produced once during the iteration. Read more
    source§

    fn peeking_take_while<F>(&mut self, accept: F) -> PeekingTakeWhile<'_, Self, F> ⓘ
    where +already been produced once during the iteration. Read more

    source§

    fn peeking_take_while<F>(&mut self, accept: F) -> PeekingTakeWhile<'_, Self, F> ⓘ
    where Self: Sized + PeekingNext, F: FnMut(&Self::Item) -> bool,

    Return an iterator adaptor that borrows from this iterator and -takes items while the closure accept returns true. Read more
    source§

    fn take_while_ref<F>(&mut self, accept: F) -> TakeWhileRef<'_, Self, F> ⓘ
    where +takes items while the closure accept returns true. Read more

    source§

    fn take_while_ref<F>(&mut self, accept: F) -> TakeWhileRef<'_, Self, F> ⓘ
    where Self: Clone, F: FnMut(&Self::Item) -> bool,

    Return an iterator adaptor that borrows from a Clone-able iterator -to only pick off elements while the predicate accept returns true. Read more
    source§

    fn take_while_inclusive<F>(self, accept: F) -> TakeWhileInclusive<Self, F> ⓘ
    where +to only pick off elements while the predicate accept returns true. Read more

    source§

    fn take_while_inclusive<F>(self, accept: F) -> TakeWhileInclusive<Self, F> ⓘ
    where Self: Sized, F: FnMut(&Self::Item) -> bool,

    Returns an iterator adaptor that consumes elements while the given predicate is true, including the element for which the predicate -first returned false. Read more
    source§

    fn while_some<A>(self) -> WhileSome<Self> ⓘ
    where +first returned false. Read more

    source§

    fn while_some<A>(self) -> WhileSome<Self> ⓘ
    where Self: Sized + Iterator<Item = Option<A>>,

    Return an iterator adaptor that filters Option<A> iterator elements -and produces A. Stops on the first None encountered. Read more
    source§

    fn tuple_combinations<T>(self) -> TupleCombinations<Self, T> ⓘ
    where +and produces A. Stops on the first None encountered. Read more

    source§

    fn tuple_combinations<T>(self) -> TupleCombinations<Self, T> ⓘ
    where Self: Sized + Clone, Self::Item: Clone, T: HasCombination<Self>,

    Return an iterator adaptor that iterates over the combinations of the -elements from an iterator. Read more
    source§

    fn combinations(self, k: usize) -> Combinations<Self> ⓘ
    where +elements from an iterator. Read more

    source§

    fn combinations(self, k: usize) -> Combinations<Self> ⓘ
    where Self: Sized, Self::Item: Clone,

    Return an iterator adaptor that iterates over the k-length combinations of -the elements from an iterator. Read more
    source§

    fn combinations_with_replacement( +the elements from an iterator. Read more

    source§

    fn combinations_with_replacement( self, k: usize ) -> CombinationsWithReplacement<Self> ⓘ
    where Self: Sized, Self::Item: Clone,

    Return an iterator that iterates over the k-length combinations of -the elements from an iterator, with replacement. Read more
    source§

    fn permutations(self, k: usize) -> Permutations<Self> ⓘ
    where +the elements from an iterator, with replacement. Read more

    source§

    fn permutations(self, k: usize) -> Permutations<Self> ⓘ
    where Self: Sized, Self::Item: Clone,

    Return an iterator adaptor that iterates over all k-permutations of the -elements from an iterator. Read more
    source§

    fn powerset(self) -> Powerset<Self> ⓘ
    where +elements from an iterator. Read more

    source§

    fn powerset(self) -> Powerset<Self> ⓘ
    where Self: Sized, Self::Item: Clone,

    Return an iterator that iterates through the powerset of the elements from an -iterator. Read more
    source§

    fn pad_using<F>(self, min: usize, f: F) -> PadUsing<Self, F> ⓘ
    where +iterator. Read more

    source§

    fn pad_using<F>(self, min: usize, f: F) -> PadUsing<Self, F> ⓘ
    where Self: Sized, F: FnMut(usize) -> Self::Item,

    Return an iterator adaptor that pads the sequence to a minimum length of -min by filling missing elements using a closure f. Read more
    source§

    fn with_position(self) -> WithPosition<Self> ⓘ
    where +min by filling missing elements using a closure f. Read more

    source§

    fn with_position(self) -> WithPosition<Self> ⓘ
    where Self: Sized,

    Return an iterator adaptor that combines each element with a Position to -ease special-case handling of the first or last elements. Read more
    source§

    fn positions<P>(self, predicate: P) -> Positions<Self, P> ⓘ
    where +ease special-case handling of the first or last elements. Read more

    source§

    fn positions<P>(self, predicate: P) -> Positions<Self, P> ⓘ
    where Self: Sized, P: FnMut(Self::Item) -> bool,

    Return an iterator adaptor that yields the indices of all elements -satisfying a predicate, counted from the start of the iterator. Read more
    source§

    fn update<F>(self, updater: F) -> Update<Self, F> ⓘ
    where +satisfying a predicate, counted from the start of the iterator. Read more

    source§

    fn update<F>(self, updater: F) -> Update<Self, F> ⓘ
    where Self: Sized, F: FnMut(&mut Self::Item),

    Return an iterator adaptor that applies a mutating function -to each element before yielding it. Read more
    source§

    fn next_tuple<T>(&mut self) -> Option<T>
    where +to each element before yielding it. Read more

    source§

    fn next_tuple<T>(&mut self) -> Option<T>
    where Self: Sized + Iterator<Item = T::Item>, T: HomogeneousTuple,

    Advances the iterator and returns the next items grouped in a tuple of -a specific size (up to 12). Read more
    source§

    fn collect_tuple<T>(self) -> Option<T>
    where +a specific size (up to 12). Read more

    source§

    fn collect_tuple<T>(self) -> Option<T>
    where Self: Sized + Iterator<Item = T::Item>, T: HomogeneousTuple,

    Collects all items from the iterator into a tuple of a specific size -(up to 12). Read more
    source§

    fn find_position<P>(&mut self, pred: P) -> Option<(usize, Self::Item)>
    where - P: FnMut(&Self::Item) -> bool,

    Find the position and value of the first element satisfying a predicate. Read more
    source§

    fn find_or_last<P>(self, predicate: P) -> Option<Self::Item>
    where +(up to 12). Read more

    source§

    fn find_position<P>(&mut self, pred: P) -> Option<(usize, Self::Item)>
    where + P: FnMut(&Self::Item) -> bool,

    Find the position and value of the first element satisfying a predicate. Read more
    source§

    fn find_or_last<P>(self, predicate: P) -> Option<Self::Item>
    where Self: Sized, - P: FnMut(&Self::Item) -> bool,

    Find the value of the first element satisfying a predicate or return the last element, if any. Read more
    source§

    fn find_or_first<P>(self, predicate: P) -> Option<Self::Item>
    where + P: FnMut(&Self::Item) -> bool,

    Find the value of the first element satisfying a predicate or return the last element, if any. Read more
    source§

    fn find_or_first<P>(self, predicate: P) -> Option<Self::Item>
    where Self: Sized, - P: FnMut(&Self::Item) -> bool,

    Find the value of the first element satisfying a predicate or return the first element, if any. Read more
    source§

    fn contains<Q>(&mut self, query: &Q) -> bool
    where + P: FnMut(&Self::Item) -> bool,

    Find the value of the first element satisfying a predicate or return the first element, if any. Read more
    source§

    fn contains<Q>(&mut self, query: &Q) -> bool
    where Self: Sized, Self::Item: Borrow<Q>, - Q: PartialEq,

    Returns true if the given item is present in this iterator. Read more
    source§

    fn all_equal(&mut self) -> bool
    where + Q: PartialEq,

    Returns true if the given item is present in this iterator. Read more
    source§

    fn all_equal(&mut self) -> bool
    where Self: Sized, - Self::Item: PartialEq,

    Check whether all elements compare equal. Read more
    source§

    fn all_equal_value( + Self::Item: PartialEq,

    Check whether all elements compare equal. Read more
    source§

    fn all_equal_value( &mut self ) -> Result<Self::Item, Option<(Self::Item, Self::Item)>>
    where Self: Sized, Self::Item: PartialEq,

    If there are elements and they are all equal, return a single copy of that element. If there are no elements, return an Error containing None. If there are elements and they are not all equal, return a tuple containing the first -two non-equal elements found. Read more
    source§

    fn all_unique(&mut self) -> bool
    where +two non-equal elements found. Read more

    source§

    fn all_unique(&mut self) -> bool
    where Self: Sized, - Self::Item: Eq + Hash,

    Check whether all elements are unique (non equal). Read more
    source§

    fn dropping(self, n: usize) -> Self
    where + Self::Item: Eq + Hash,

    Check whether all elements are unique (non equal). Read more
    source§

    fn dropping(self, n: usize) -> Self
    where Self: Sized,

    Consume the first n elements from the iterator eagerly, -and return the same iterator again. Read more
    source§

    fn dropping_back(self, n: usize) -> Self
    where +and return the same iterator again. Read more

    source§

    fn dropping_back(self, n: usize) -> Self
    where Self: Sized + DoubleEndedIterator,

    Consume the last n elements from the iterator eagerly, -and return the same iterator again. Read more
    source§

    fn foreach<F>(self, f: F)
    where - F: FnMut(Self::Item), - Self: Sized,

    👎Deprecated since 0.8.0: Use .for_each() instead
    Run the closure f eagerly on each element of the iterator. Read more
    source§

    fn concat(self) -> Self::Item
    where +and return the same iterator again. Read more

    source§

    fn concat(self) -> Self::Item
    where Self: Sized, - Self::Item: Extend<<<Self as Iterator>::Item as IntoIterator>::Item> + IntoIterator + Default,

    Combine all an iterator’s elements into one element by using Extend. Read more
    source§

    fn collect_vec(self) -> Vec<Self::Item>
    where + Self::Item: Extend<<<Self as Iterator>::Item as IntoIterator>::Item> + IntoIterator + Default,

    Combine all an iterator’s elements into one element by using Extend. Read more
    source§

    fn collect_vec(self) -> Vec<Self::Item>
    where Self: Sized,

    .collect_vec() is simply a type specialization of Iterator::collect, -for convenience.
    source§

    fn try_collect<T, U, E>(self) -> Result<U, E>
    where +for convenience.

    source§

    fn try_collect<T, U, E>(self) -> Result<U, E>
    where Self: Sized + Iterator<Item = Result<T, E>>, Result<U, E>: FromIterator<Result<T, E>>,

    .try_collect() is more convenient way of writing -.collect::<Result<_, _>>() Read more
    source§

    fn set_from<'a, A: 'a, J>(&mut self, from: J) -> usize
    where +.collect::<Result<_, _>>() Read more

    source§

    fn set_from<'a, A: 'a, J>(&mut self, from: J) -> usize
    where Self: Iterator<Item = &'a mut A>, J: IntoIterator<Item = A>,

    Assign to each reference in self from the from iterator, -stopping at the shortest of the two iterators. Read more
    source§

    fn join(&mut self, sep: &str) -> String
    where - Self::Item: Display,

    Combine all iterator elements into one String, separated by sep. Read more
    source§

    fn format(self, sep: &str) -> Format<'_, Self>
    where - Self: Sized,

    Format all iterator elements, separated by sep. Read more
    source§

    fn format_with<F>(self, sep: &str, format: F) -> FormatWith<'_, Self, F>
    where +stopping at the shortest of the two iterators. Read more

    source§

    fn join(&mut self, sep: &str) -> String
    where + Self::Item: Display,

    Combine all iterator elements into one String, separated by sep. Read more
    source§

    fn format(self, sep: &str) -> Format<'_, Self>
    where + Self: Sized,

    Format all iterator elements, separated by sep. Read more
    source§

    fn format_with<F>(self, sep: &str, format: F) -> FormatWith<'_, Self, F>
    where Self: Sized, - F: FnMut(Self::Item, &mut dyn FnMut(&dyn Display) -> Result) -> Result,

    Format all iterator elements, separated by sep. Read more
    source§

    fn fold_results<A, E, B, F>(&mut self, start: B, f: F) -> Result<B, E>
    where + F: FnMut(Self::Item, &mut dyn FnMut(&dyn Display) -> Result) -> Result,

    Format all iterator elements, separated by sep. Read more
    source§

    fn fold_ok<A, E, B, F>(&mut self, start: B, f: F) -> Result<B, E>
    where Self: Iterator<Item = Result<A, E>>, - F: FnMut(B, A) -> B,

    👎Deprecated since 0.10.0: Use .fold_ok() instead
    See .fold_ok().
    source§

    fn fold_ok<A, E, B, F>(&mut self, start: B, f: F) -> Result<B, E>
    where - Self: Iterator<Item = Result<A, E>>, - F: FnMut(B, A) -> B,

    Fold Result values from an iterator. Read more
    source§

    fn fold_options<A, B, F>(&mut self, start: B, f: F) -> Option<B>
    where + F: FnMut(B, A) -> B,

    Fold Result values from an iterator. Read more
    source§

    fn fold_options<A, B, F>(&mut self, start: B, f: F) -> Option<B>
    where Self: Iterator<Item = Option<A>>, - F: FnMut(B, A) -> B,

    Fold Option values from an iterator. Read more
    source§

    fn fold1<F>(self, f: F) -> Option<Self::Item>
    where + F: FnMut(B, A) -> B,

    Fold Option values from an iterator. Read more
    source§

    fn fold1<F>(self, f: F) -> Option<Self::Item>
    where F: FnMut(Self::Item, Self::Item) -> Self::Item, - Self: Sized,

    👎Deprecated since 0.10.2: Use Iterator::reduce instead
    Accumulator of the elements in the iterator. Read more
    source§

    fn tree_fold1<F>(self, f: F) -> Option<Self::Item>
    where + Self: Sized,

    👎Deprecated since 0.10.2: Use Iterator::reduce instead
    Accumulator of the elements in the iterator. Read more
    source§

    fn tree_reduce<F>(self, f: F) -> Option<Self::Item>
    where F: FnMut(Self::Item, Self::Item) -> Self::Item, - Self: Sized,

    Accumulate the elements in the iterator in a tree-like manner. Read more
    source§

    fn fold_while<B, F>(&mut self, init: B, f: F) -> FoldWhile<B>
    where + Self: Sized,

    Accumulate the elements in the iterator in a tree-like manner. Read more
    source§

    fn tree_fold1<F>(self, f: F) -> Option<Self::Item>
    where + F: FnMut(Self::Item, Self::Item) -> Self::Item, + Self: Sized,

    👎Deprecated since 0.13.0: Use .tree_reduce() instead
    See .tree_reduce().
    source§

    fn fold_while<B, F>(&mut self, init: B, f: F) -> FoldWhile<B>
    where Self: Sized, - F: FnMut(B, Self::Item) -> FoldWhile<B>,

    An iterator method that applies a function, producing a single, final value. Read more
    source§

    fn sum1<S>(self) -> Option<S>
    where + F: FnMut(B, Self::Item) -> FoldWhile<B>,

    An iterator method that applies a function, producing a single, final value. Read more
    source§

    fn sum1<S>(self) -> Option<S>
    where Self: Sized, - S: Sum<Self::Item>,

    Iterate over the entire iterator and add all the elements. Read more
    source§

    fn product1<P>(self) -> Option<P>
    where + S: Sum<Self::Item>,

    Iterate over the entire iterator and add all the elements. Read more
    source§

    fn product1<P>(self) -> Option<P>
    where Self: Sized, - P: Product<Self::Item>,

    Iterate over the entire iterator and multiply all the elements. Read more
    source§

    fn sorted_unstable(self) -> IntoIter<Self::Item> ⓘ
    where + P: Product<Self::Item>,

    Iterate over the entire iterator and multiply all the elements. Read more
    source§

    fn sorted_unstable(self) -> IntoIter<Self::Item> ⓘ
    where Self: Sized, - Self::Item: Ord,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_unstable_by<F>(self, cmp: F) -> IntoIter<Self::Item> ⓘ
    where + Self::Item: Ord,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_unstable_by<F>(self, cmp: F) -> IntoIter<Self::Item> ⓘ
    where Self: Sized, - F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_unstable_by_key<K, F>(self, f: F) -> IntoIter<Self::Item> ⓘ
    where + F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_unstable_by_key<K, F>(self, f: F) -> IntoIter<Self::Item> ⓘ
    where Self: Sized, K: Ord, - F: FnMut(&Self::Item) -> K,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted(self) -> IntoIter<Self::Item> ⓘ
    where + F: FnMut(&Self::Item) -> K,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted(self) -> IntoIter<Self::Item> ⓘ
    where Self: Sized, - Self::Item: Ord,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_by<F>(self, cmp: F) -> IntoIter<Self::Item> ⓘ
    where + Self::Item: Ord,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_by<F>(self, cmp: F) -> IntoIter<Self::Item> ⓘ
    where Self: Sized, - F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_by_key<K, F>(self, f: F) -> IntoIter<Self::Item> ⓘ
    where + F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_by_key<K, F>(self, f: F) -> IntoIter<Self::Item> ⓘ
    where Self: Sized, K: Ord, - F: FnMut(&Self::Item) -> K,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_by_cached_key<K, F>(self, f: F) -> IntoIter<Self::Item> ⓘ
    where + F: FnMut(&Self::Item) -> K,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_by_cached_key<K, F>(self, f: F) -> IntoIter<Self::Item> ⓘ
    where Self: Sized, K: Ord, F: FnMut(&Self::Item) -> K,

    Sort all iterator elements into a new iterator in ascending order. The key function is -called exactly once per key. Read more
    source§

    fn k_smallest(self, k: usize) -> IntoIter<Self::Item> ⓘ
    where +called exactly once per key. Read more

    source§

    fn k_smallest(self, k: usize) -> IntoIter<Self::Item> ⓘ
    where Self: Sized, - Self::Item: Ord,

    Sort the k smallest elements into a new iterator, in ascending order. Read more
    source§

    fn partition_map<A, B, F, L, R>(self, predicate: F) -> (A, B)
    where + Self::Item: Ord,

    Sort the k smallest elements into a new iterator, in ascending order. Read more
    source§

    fn k_smallest_by<F>(self, k: usize, cmp: F) -> IntoIter<Self::Item> ⓘ
    where + Self: Sized, + F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Sort the k smallest elements into a new iterator using the provided comparison. Read more
    source§

    fn k_smallest_by_key<F, K>(self, k: usize, key: F) -> IntoIter<Self::Item> ⓘ
    where + Self: Sized, + F: FnMut(&Self::Item) -> K, + K: Ord,

    Return the elements producing the k smallest outputs of the provided function. Read more
    source§

    fn k_largest(self, k: usize) -> IntoIter<Self::Item> ⓘ
    where + Self: Sized, + Self::Item: Ord,

    Sort the k largest elements into a new iterator, in descending order. Read more
    source§

    fn k_largest_by<F>(self, k: usize, cmp: F) -> IntoIter<Self::Item> ⓘ
    where + Self: Sized, + F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Sort the k largest elements into a new iterator using the provided comparison. Read more
    source§

    fn k_largest_by_key<F, K>(self, k: usize, key: F) -> IntoIter<Self::Item> ⓘ
    where + Self: Sized, + F: FnMut(&Self::Item) -> K, + K: Ord,

    Return the elements producing the k largest outputs of the provided function. Read more
    source§

    fn tail(self, n: usize) -> IntoIter<Self::Item> ⓘ
    where + Self: Sized,

    Consumes the iterator and return an iterator of the last n elements. Read more
    source§

    fn partition_map<A, B, F, L, R>(self, predicate: F) -> (A, B)
    where Self: Sized, F: FnMut(Self::Item) -> Either<L, R>, A: Default + Extend<L>, B: Default + Extend<R>,

    Collect all iterator elements into one of two partitions. Unlike Iterator::partition, each partition may -have a distinct type. Read more
    source§

    fn partition_result<A, B, T, E>(self) -> (A, B)
    where +have a distinct type. Read more

    source§

    fn partition_result<A, B, T, E>(self) -> (A, B)
    where Self: Iterator<Item = Result<T, E>> + Sized, A: Default + Extend<T>, B: Default + Extend<E>,

    Partition a sequence of Results into one list of all the Ok elements -and another list of all the Err elements. Read more
    source§

    fn into_group_map<K, V>(self) -> HashMap<K, Vec<V>>
    where +and another list of all the Err elements. Read more

    source§

    fn into_group_map<K, V>(self) -> HashMap<K, Vec<V>>
    where Self: Iterator<Item = (K, V)> + Sized, K: Hash + Eq,

    Return a HashMap of keys mapped to Vecs of values. Keys and values -are taken from (Key, Value) tuple pairs yielded by the input iterator. Read more
    source§

    fn into_group_map_by<K, V, F>(self, f: F) -> HashMap<K, Vec<V>>
    where +are taken from (Key, Value) tuple pairs yielded by the input iterator. Read more

    source§

    fn into_group_map_by<K, V, F>(self, f: F) -> HashMap<K, Vec<V>>
    where Self: Iterator<Item = V> + Sized, K: Hash + Eq, - F: Fn(&V) -> K,

    Return an Iterator on a HashMap. Keys mapped to Vecs of values. The key is specified -in the closure. Read more
    source§

    fn into_grouping_map<K, V>(self) -> GroupingMap<Self>
    where + F: FnMut(&V) -> K,

    Return an Iterator on a HashMap. Keys mapped to Vecs of values. The key is specified +in the closure. Read more
    source§

    fn into_grouping_map<K, V>(self) -> GroupingMap<Self>
    where Self: Iterator<Item = (K, V)> + Sized, K: Hash + Eq,

    Constructs a GroupingMap to be used later with one of the efficient -group-and-fold operations it allows to perform. Read more
    source§

    fn into_grouping_map_by<K, V, F>(self, key_mapper: F) -> GroupingMapBy<Self, F>
    where +group-and-fold operations it allows to perform. Read more

    source§

    fn into_grouping_map_by<K, V, F>(self, key_mapper: F) -> GroupingMapBy<Self, F>
    where Self: Iterator<Item = V> + Sized, K: Hash + Eq, F: FnMut(&V) -> K,

    Constructs a GroupingMap to be used later with one of the efficient -group-and-fold operations it allows to perform. Read more
    source§

    fn min_set(self) -> Vec<Self::Item>
    where +group-and-fold operations it allows to perform. Read more

    source§

    fn min_set(self) -> Vec<Self::Item>
    where Self: Sized, - Self::Item: Ord,

    Return all minimum elements of an iterator. Read more
    source§

    fn min_set_by<F>(self, compare: F) -> Vec<Self::Item>
    where + Self::Item: Ord,

    Return all minimum elements of an iterator. Read more
    source§

    fn min_set_by<F>(self, compare: F) -> Vec<Self::Item>
    where Self: Sized, F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Return all minimum elements of an iterator, as determined by -the specified function. Read more
    source§

    fn min_set_by_key<K, F>(self, key: F) -> Vec<Self::Item>
    where +the specified function. Read more

    source§

    fn min_set_by_key<K, F>(self, key: F) -> Vec<Self::Item>
    where Self: Sized, K: Ord, F: FnMut(&Self::Item) -> K,

    Return all minimum elements of an iterator, as determined by -the specified function. Read more
    source§

    fn max_set(self) -> Vec<Self::Item>
    where +the specified function. Read more

    source§

    fn max_set(self) -> Vec<Self::Item>
    where Self: Sized, - Self::Item: Ord,

    Return all maximum elements of an iterator. Read more
    source§

    fn max_set_by<F>(self, compare: F) -> Vec<Self::Item>
    where + Self::Item: Ord,

    Return all maximum elements of an iterator. Read more
    source§

    fn max_set_by<F>(self, compare: F) -> Vec<Self::Item>
    where Self: Sized, F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Return all maximum elements of an iterator, as determined by -the specified function. Read more
    source§

    fn max_set_by_key<K, F>(self, key: F) -> Vec<Self::Item>
    where +the specified function. Read more

    source§

    fn max_set_by_key<K, F>(self, key: F) -> Vec<Self::Item>
    where Self: Sized, K: Ord, F: FnMut(&Self::Item) -> K,

    Return all maximum elements of an iterator, as determined by -the specified function. Read more
    source§

    fn minmax(self) -> MinMaxResult<Self::Item>
    where +the specified function. Read more

    source§

    fn minmax(self) -> MinMaxResult<Self::Item>
    where Self: Sized, - Self::Item: PartialOrd,

    Return the minimum and maximum elements in the iterator. Read more
    source§

    fn minmax_by_key<K, F>(self, key: F) -> MinMaxResult<Self::Item>
    where + Self::Item: PartialOrd,

    Return the minimum and maximum elements in the iterator. Read more
    source§

    fn minmax_by_key<K, F>(self, key: F) -> MinMaxResult<Self::Item>
    where Self: Sized, K: PartialOrd, F: FnMut(&Self::Item) -> K,

    Return the minimum and maximum element of an iterator, as determined by -the specified function. Read more
    source§

    fn minmax_by<F>(self, compare: F) -> MinMaxResult<Self::Item>
    where +the specified function. Read more

    source§

    fn minmax_by<F>(self, compare: F) -> MinMaxResult<Self::Item>
    where Self: Sized, F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Return the minimum and maximum element of an iterator, as determined by -the specified comparison function. Read more
    source§

    fn position_max(self) -> Option<usize>
    where +the specified comparison function. Read more

    source§

    fn position_max(self) -> Option<usize>
    where Self: Sized, - Self::Item: Ord,

    Return the position of the maximum element in the iterator. Read more
    source§

    fn position_max_by_key<K, F>(self, key: F) -> Option<usize>
    where + Self::Item: Ord,

    Return the position of the maximum element in the iterator. Read more
    source§

    fn position_max_by_key<K, F>(self, key: F) -> Option<usize>
    where Self: Sized, K: Ord, F: FnMut(&Self::Item) -> K,

    Return the position of the maximum element in the iterator, as -determined by the specified function. Read more
    source§

    fn position_max_by<F>(self, compare: F) -> Option<usize>
    where +determined by the specified function. Read more

    source§

    fn position_max_by<F>(self, compare: F) -> Option<usize>
    where Self: Sized, F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Return the position of the maximum element in the iterator, as -determined by the specified comparison function. Read more
    source§

    fn position_min(self) -> Option<usize>
    where +determined by the specified comparison function. Read more

    source§

    fn position_min(self) -> Option<usize>
    where Self: Sized, - Self::Item: Ord,

    Return the position of the minimum element in the iterator. Read more
    source§

    fn position_min_by_key<K, F>(self, key: F) -> Option<usize>
    where + Self::Item: Ord,

    Return the position of the minimum element in the iterator. Read more
    source§

    fn position_min_by_key<K, F>(self, key: F) -> Option<usize>
    where Self: Sized, K: Ord, F: FnMut(&Self::Item) -> K,

    Return the position of the minimum element in the iterator, as -determined by the specified function. Read more
    source§

    fn position_min_by<F>(self, compare: F) -> Option<usize>
    where +determined by the specified function. Read more

    source§

    fn position_min_by<F>(self, compare: F) -> Option<usize>
    where Self: Sized, F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Return the position of the minimum element in the iterator, as -determined by the specified comparison function. Read more
    source§

    fn position_minmax(self) -> MinMaxResult<usize>
    where +determined by the specified comparison function. Read more

    source§

    fn position_minmax(self) -> MinMaxResult<usize>
    where Self: Sized, Self::Item: PartialOrd,

    Return the positions of the minimum and maximum elements in -the iterator. Read more
    source§

    fn position_minmax_by_key<K, F>(self, key: F) -> MinMaxResult<usize>
    where +the iterator. Read more

    source§

    fn position_minmax_by_key<K, F>(self, key: F) -> MinMaxResult<usize>
    where Self: Sized, K: PartialOrd, F: FnMut(&Self::Item) -> K,

    Return the postions of the minimum and maximum elements of an -iterator, as determined by the specified function. Read more
    source§

    fn position_minmax_by<F>(self, compare: F) -> MinMaxResult<usize>
    where +iterator, as determined by the specified function. Read more

    source§

    fn position_minmax_by<F>(self, compare: F) -> MinMaxResult<usize>
    where Self: Sized, F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Return the postions of the minimum and maximum elements of an -iterator, as determined by the specified comparison function. Read more
    source§

    fn exactly_one(self) -> Result<Self::Item, ExactlyOneError<Self>>
    where +iterator, as determined by the specified comparison function. Read more

    source§

    fn exactly_one(self) -> Result<Self::Item, ExactlyOneError<Self>>
    where Self: Sized,

    If the iterator yields exactly one element, that element will be returned, otherwise an error will be returned containing an iterator that has the same output as the input -iterator. Read more
    source§

    fn at_most_one(self) -> Result<Option<Self::Item>, ExactlyOneError<Self>>
    where - Self: Sized,

    If the iterator yields no elements, Ok(None) will be returned. If the iterator yields +iterator. Read more
    source§

    fn at_most_one(self) -> Result<Option<Self::Item>, ExactlyOneError<Self>>
    where + Self: Sized,

    If the iterator yields no elements, Ok(None) will be returned. If the iterator yields exactly one element, that element will be returned, otherwise an error will be returned -containing an iterator that has the same output as the input iterator. Read more
    source§

    fn multipeek(self) -> MultiPeek<Self> ⓘ
    where +containing an iterator that has the same output as the input iterator. Read more

    source§

    fn multipeek(self) -> MultiPeek<Self> ⓘ
    where Self: Sized,

    An iterator adaptor that allows the user to peek at multiple .next() -values without advancing the base iterator. Read more
    source§

    fn counts(self) -> HashMap<Self::Item, usize>
    where +values without advancing the base iterator. Read more

    source§

    fn counts(self) -> HashMap<Self::Item, usize>
    where Self: Sized, Self::Item: Eq + Hash,

    Collect the items in this iterator and return a HashMap which contains each item that appears in the iterator and the number -of times it appears. Read more
    source§

    fn counts_by<K, F>(self, f: F) -> HashMap<K, usize>
    where +of times it appears. Read more

    source§

    fn counts_by<K, F>(self, f: F) -> HashMap<K, usize>
    where Self: Sized, K: Eq + Hash, F: FnMut(Self::Item) -> K,

    Collect the items in this iterator and return a HashMap which contains each item that appears in the iterator and the number of times it appears, -determining identity using a keying function. Read more
    source§

    fn multiunzip<FromI>(self) -> FromI
    where - Self: Sized + MultiUnzip<FromI>,

    Converts an iterator of tuples into a tuple of containers. Read more
    source§

    fn try_len(&self) -> Result<usize, (usize, Option<usize>)>

    Returns the length of the iterator if one exists. +determining identity using a keying function. Read more
    source§

    fn multiunzip<FromI>(self) -> FromI
    where + Self: Sized + MultiUnzip<FromI>,

    Converts an iterator of tuples into a tuple of containers. Read more
    source§

    fn try_len(&self) -> Result<usize, (usize, Option<usize>)>

    Returns the length of the iterator if one exists. Otherwise return self.size_hint(). Read more
    source§

    impl<IT, A, FromA> MultiUnzip<(FromA,)> for IT
    where IT: Iterator<Item = (A,)>, FromA: Default + Extend<A>,

    source§

    fn multiunzip(self) -> (FromA,)

    Unzip this iterator into multiple collections.
    source§

    impl<IT, A, FromA, B, FromB> MultiUnzip<(FromA, FromB)> for IT
    where @@ -691,4 +703,4 @@ Otherwise return self.size_hint(). (FromA, FromB, FromC, FromD, FromE, FromF, FromG, FromH, FromI, FromJ, FromK, FromL)

    Unzip this iterator into multiple collections.
    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 + 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/itertools/structs/struct.Combinations.html b/itertools/structs/struct.Combinations.html index d07672be5..952d6b434 100644 --- a/itertools/structs/struct.Combinations.html +++ b/itertools/structs/struct.Combinations.html @@ -1,20 +1,20 @@ -Combinations in itertools::structs - Rust
    +Combinations in itertools::structs - Rust

    Struct itertools::structs::Combinations

    source · 
    pub struct Combinations<I: Iterator> { /* private fields */ }
    Expand description

    An iterator to iterate through all the k-length combinations in an iterator.

    See .combinations() for more information.

    -

    Implementations§

    source§

    impl<I: Iterator> Combinations<I>

    source

    pub fn k(&self) -> usize

    Returns the length of a combination produced by this iterator.

    +

    Implementations§

    source§

    impl<I: Iterator> Combinations<I>

    source

    pub fn k(&self) -> usize

    Returns the length of a combination produced by this iterator.

    source

    pub fn n(&self) -> usize

    Returns the (current) length of the pool from which combination elements are selected. This value can change between invocations of next.

    Trait Implementations§

    source§

    impl<I> Clone for Combinations<I>
    where I: Clone + Iterator, I::Item: 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<I> Debug for Combinations<I>
    where I: Iterator + Debug, - I::Item: Debug,

    source§

    fn fmt(&self, f: &mut Formatter<'_>) -> Result

    Formats the value using the given formatter. Read more
    source§

    impl<I> Iterator for Combinations<I>
    where + I::Item: Debug,

    source§

    fn fmt(&self, f: &mut Formatter<'_>) -> Result

    Formats the value using the given formatter. Read more
    source§

    impl<I> Iterator for Combinations<I>
    where I: Iterator, - I::Item: Clone,

    §

    type Item = Vec<<I as Iterator>::Item>

    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 next_chunk<const N: usize>( + I::Item: Clone,

    §

    type Item = Vec<<I as Iterator>::Item>

    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 nth(&mut self, n: usize) -> Option<Self::Item>

    Returns the nth element of the iterator. 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 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 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,

    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.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, @@ -186,7 +186,7 @@ greater than or equal to those of another. 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> FusedIterator for Combinations<I>
    where +function. Read more

    source§

    impl<I> FusedIterator for Combinations<I>
    where I: Iterator, I::Item: Clone,

    Auto Trait Implementations§

    §

    impl<I> Freeze for Combinations<I>
    where I: Freeze,

    §

    impl<I> RefUnwindSafe for Combinations<I>
    where @@ -215,86 +215,87 @@ otherwise. Right variant of Either<Self, Self> otherwise. Read more

    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> Itertools for T
    where - T: Iterator + ?Sized,

    source§

    fn interleave<J>(self, other: J) -> Interleave<Self, J::IntoIter> ⓘ
    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> Itertools for T
    where + T: Iterator + ?Sized,

    source§

    fn interleave<J>(self, other: J) -> Interleave<Self, J::IntoIter> ⓘ
    where J: IntoIterator<Item = Self::Item>, - Self: Sized,

    Alternate elements from two iterators until both have run out. Read more
    source§

    fn interleave_shortest<J>( + Self: Sized,

    Alternate elements from two iterators until both have run out. Read more
    source§

    fn interleave_shortest<J>( self, other: J ) -> InterleaveShortest<Self, J::IntoIter> ⓘ
    where J: IntoIterator<Item = Self::Item>, Self: Sized,

    Alternate elements from two iterators until at least one of them has run -out. Read more
    source§

    fn intersperse(self, element: Self::Item) -> Intersperse<Self>
    where +out. Read more

    source§

    fn intersperse(self, element: Self::Item) -> Intersperse<Self>
    where Self: Sized, Self::Item: Clone,

    An iterator adaptor to insert a particular value -between each element of the adapted iterator. Read more
    source§

    fn intersperse_with<F>(self, element: F) -> IntersperseWith<Self, F> ⓘ
    where +between each element of the adapted iterator. Read more

    source§

    fn intersperse_with<F>(self, element: F) -> IntersperseWith<Self, F> ⓘ
    where Self: Sized, F: FnMut() -> Self::Item,

    An iterator adaptor to insert a particular value created by a function -between each element of the adapted iterator. Read more
    source§

    fn zip_longest<J>(self, other: J) -> ZipLongest<Self, J::IntoIter> ⓘ
    where +between each element of the adapted iterator. Read more

    source§

    fn get<R>(self, index: R) -> R::Output
    where + Self: Sized, + R: IteratorIndex<Self>,

    Returns an iterator over a subsection of the iterator. Read more
    source§

    fn zip_longest<J>(self, other: J) -> ZipLongest<Self, J::IntoIter> ⓘ
    where J: IntoIterator, Self: Sized,

    Create an iterator which iterates over both this and the specified -iterator simultaneously, yielding pairs of two optional elements. Read more
    source§

    fn zip_eq<J>(self, other: J) -> ZipEq<Self, J::IntoIter> ⓘ
    where +iterator simultaneously, yielding pairs of two optional elements. Read more

    source§

    fn zip_eq<J>(self, other: J) -> ZipEq<Self, J::IntoIter> ⓘ
    where J: IntoIterator, Self: Sized,

    Create an iterator which iterates over both this and the specified -iterator simultaneously, yielding pairs of elements. Read more
    source§

    fn batching<B, F>(self, f: F) -> Batching<Self, F> ⓘ
    where +iterator simultaneously, yielding pairs of elements. Read more

    source§

    fn batching<B, F>(self, f: F) -> Batching<Self, F> ⓘ
    where F: FnMut(&mut Self) -> Option<B>, Self: Sized,

    A “meta iterator adaptor”. Its closure receives a reference to the iterator and may pick off as many elements as it likes, to produce the -next iterator element. Read more
    source§

    fn group_by<K, F>(self, key: F) -> GroupBy<K, Self, F>
    where +next iterator element. Read more

    source§

    fn chunk_by<K, F>(self, key: F) -> ChunkBy<K, Self, F>
    where Self: Sized, F: FnMut(&Self::Item) -> K, K: PartialEq,

    Return an iterable that can group iterator elements. Consecutive elements that map to the same key (“runs”), are assigned -to the same group. Read more
    source§

    fn chunks(self, size: usize) -> IntoChunks<Self>
    where - Self: Sized,

    Return an iterable that can chunk the iterator. Read more
    source§

    fn tuple_windows<T>(self) -> TupleWindows<Self, T> ⓘ
    where +to the same group. Read more

    source§

    fn group_by<K, F>(self, key: F) -> ChunkBy<K, Self, F>
    where + Self: Sized, + F: FnMut(&Self::Item) -> K, + K: PartialEq,

    👎Deprecated since 0.13.0: Use .chunk_by() instead
    See .chunk_by().
    source§

    fn chunks(self, size: usize) -> IntoChunks<Self>
    where + Self: Sized,

    Return an iterable that can chunk the iterator. Read more
    source§

    fn tuple_windows<T>(self) -> TupleWindows<Self, T> ⓘ
    where Self: Sized + Iterator<Item = T::Item>, T: HomogeneousTuple, T::Item: Clone,

    Return an iterator over all contiguous windows producing tuples of -a specific size (up to 12). Read more
    source§

    fn circular_tuple_windows<T>(self) -> CircularTupleWindows<Self, T> ⓘ
    where +a specific size (up to 12). Read more

    source§

    fn circular_tuple_windows<T>(self) -> CircularTupleWindows<Self, T> ⓘ
    where Self: Sized + Clone + Iterator<Item = T::Item> + ExactSizeIterator, T: TupleCollect + Clone, T::Item: Clone,

    Return an iterator over all windows, wrapping back to the first elements when the window would otherwise exceed the length of the -iterator, producing tuples of a specific size (up to 12). Read more
    source§

    fn tuples<T>(self) -> Tuples<Self, T> ⓘ
    where +iterator, producing tuples of a specific size (up to 12). Read more

    source§

    fn tuples<T>(self) -> Tuples<Self, T> ⓘ
    where Self: Sized + Iterator<Item = T::Item>, T: HomogeneousTuple,

    Return an iterator that groups the items in tuples of a specific size -(up to 12). Read more
    source§

    fn tee(self) -> (Tee<Self>, Tee<Self>)
    where +(up to 12). Read more

    source§

    fn tee(self) -> (Tee<Self>, Tee<Self>)
    where Self: Sized, Self::Item: Clone,

    Split into an iterator pair that both yield all elements from -the original iterator. Read more
    source§

    fn step(self, n: usize) -> Step<Self> ⓘ
    where - Self: Sized,

    👎Deprecated since 0.8.0: Use std .step_by() instead
    Return an iterator adaptor that steps n elements in the base iterator -for each iteration. Read more
    source§

    fn map_into<R>(self) -> MapInto<Self, R>
    where +the original iterator. Read more

    source§

    fn map_into<R>(self) -> MapInto<Self, R>
    where Self: Sized, - Self::Item: Into<R>,

    Convert each item of the iterator using the Into trait. Read more
    source§

    fn map_results<F, T, U, E>(self, f: F) -> MapOk<Self, F>
    where - Self: Iterator<Item = Result<T, E>> + Sized, - F: FnMut(T) -> U,

    👎Deprecated since 0.10.0: Use .map_ok() instead
    See .map_ok().
    source§

    fn map_ok<F, T, U, E>(self, f: F) -> MapOk<Self, F>
    where + Self::Item: Into<R>,

    Convert each item of the iterator using the Into trait. Read more
    source§

    fn map_ok<F, T, U, E>(self, f: F) -> MapOk<Self, F>
    where Self: Iterator<Item = Result<T, E>> + Sized, F: FnMut(T) -> U,

    Return an iterator adaptor that applies the provided closure to every Result::Ok value. Result::Err values are -unchanged. Read more
    source§

    fn filter_ok<F, T, E>(self, f: F) -> FilterOk<Self, F> ⓘ
    where +unchanged. Read more

    source§

    fn filter_ok<F, T, E>(self, f: F) -> FilterOk<Self, F> ⓘ
    where Self: Iterator<Item = Result<T, E>> + Sized, F: FnMut(&T) -> bool,

    Return an iterator adaptor that filters every Result::Ok value with the provided closure. Result::Err values are -unchanged. Read more
    source§

    fn filter_map_ok<F, T, U, E>(self, f: F) -> FilterMapOk<Self, F> ⓘ
    where +unchanged. Read more

    source§

    fn filter_map_ok<F, T, U, E>(self, f: F) -> FilterMapOk<Self, F> ⓘ
    where Self: Iterator<Item = Result<T, E>> + Sized, F: FnMut(T) -> Option<U>,

    Return an iterator adaptor that filters and transforms every Result::Ok value with the provided closure. Result::Err -values are unchanged. Read more
    source§

    fn flatten_ok<T, E>(self) -> FlattenOk<Self, T, E> ⓘ
    where +values are unchanged. Read more

    source§

    fn flatten_ok<T, E>(self) -> FlattenOk<Self, T, E> ⓘ
    where Self: Iterator<Item = Result<T, E>> + Sized, T: IntoIterator,

    Return an iterator adaptor that flattens every Result::Ok value into -a series of Result::Ok values. Result::Err values are unchanged. Read more
    source§

    fn process_results<F, T, E, R>(self, processor: F) -> Result<R, E>
    where +a series of Result::Ok values. Result::Err values are unchanged. Read more

    source§

    fn process_results<F, T, E, R>(self, processor: F) -> Result<R, E>
    where Self: Iterator<Item = Result<T, E>> + Sized, F: FnOnce(ProcessResults<'_, Self, E>) -> R,

    “Lift” a function of the values of the current iterator so as to process -an iterator of Result values instead. Read more
    source§

    fn merge<J>(self, other: J) -> Merge<Self, J::IntoIter>
    where +an iterator of Result values instead. Read more

    source§

    fn merge<J>(self, other: J) -> Merge<Self, J::IntoIter>
    where Self: Sized, Self::Item: PartialOrd, J: IntoIterator<Item = Self::Item>,

    Return an iterator adaptor that merges the two base iterators in ascending order. If both base iterators are sorted (ascending), the -result is sorted. Read more
    source§

    fn merge_by<J, F>(self, other: J, is_first: F) -> MergeBy<Self, J::IntoIter, F> ⓘ
    where +result is sorted. Read more

    source§

    fn merge_by<J, F>(self, other: J, is_first: F) -> MergeBy<Self, J::IntoIter, F> ⓘ
    where Self: Sized, J: IntoIterator<Item = Self::Item>, F: FnMut(&Self::Item, &Self::Item) -> bool,

    Return an iterator adaptor that merges the two base iterators in order. -This is much like .merge() but allows for a custom ordering. Read more
    source§

    fn merge_join_by<J, F, T>( +This is much like .merge() but allows for a custom ordering. Read more

    source§

    fn merge_join_by<J, F, T>( self, other: J, cmp_fn: F @@ -302,285 +303,296 @@ This is much like IntoIterator, F: FnMut(&Self::Item, &J::Item) -> T, Self: Sized,

    Create an iterator that merges items from both this and the specified -iterator in ascending order. Read more
    source§

    fn kmerge(self) -> KMerge<<Self::Item as IntoIterator>::IntoIter>
    where +iterator in ascending order. Read more

    source§

    fn kmerge(self) -> KMerge<<Self::Item as IntoIterator>::IntoIter>
    where Self: Sized, Self::Item: IntoIterator, <Self::Item as IntoIterator>::Item: PartialOrd,

    Return an iterator adaptor that flattens an iterator of iterators by -merging them in ascending order. Read more
    source§

    fn kmerge_by<F>( +merging them in ascending order. Read more

    source§

    fn kmerge_by<F>( self, first: F ) -> KMergeBy<<Self::Item as IntoIterator>::IntoIter, F> ⓘ
    where Self: Sized, Self::Item: IntoIterator, F: FnMut(&<Self::Item as IntoIterator>::Item, &<Self::Item as IntoIterator>::Item) -> bool,

    Return an iterator adaptor that flattens an iterator of iterators by -merging them according to the given closure. Read more
    source§

    fn cartesian_product<J>(self, other: J) -> Product<Self, J::IntoIter> ⓘ
    where +merging them according to the given closure. Read more

    source§

    fn cartesian_product<J>(self, other: J) -> Product<Self, J::IntoIter> ⓘ
    where Self: Sized, Self::Item: Clone, J: IntoIterator, J::IntoIter: Clone,

    Return an iterator adaptor that iterates over the cartesian product of -the element sets of two iterators self and J. Read more
    source§

    fn multi_cartesian_product( +the element sets of two iterators self and J. Read more

    source§

    fn multi_cartesian_product( self ) -> MultiProduct<<Self::Item as IntoIterator>::IntoIter> ⓘ
    where Self: Sized, Self::Item: IntoIterator, <Self::Item as IntoIterator>::IntoIter: Clone, <Self::Item as IntoIterator>::Item: Clone,

    Return an iterator adaptor that iterates over the cartesian product of -all subiterators returned by meta-iterator self. Read more
    source§

    fn coalesce<F>(self, f: F) -> Coalesce<Self, F>
    where +all subiterators returned by meta-iterator self. Read more

    source§

    fn coalesce<F>(self, f: F) -> Coalesce<Self, F>
    where Self: Sized, F: FnMut(Self::Item, Self::Item) -> Result<Self::Item, (Self::Item, Self::Item)>,

    Return an iterator adaptor that uses the passed-in closure to -optionally merge together consecutive elements. Read more
    source§

    fn dedup(self) -> Dedup<Self>
    where +optionally merge together consecutive elements. Read more

    source§

    fn dedup(self) -> Dedup<Self>
    where Self: Sized, Self::Item: PartialEq,

    Remove duplicates from sections of consecutive identical elements. -If the iterator is sorted, all elements will be unique. Read more
    source§

    fn dedup_by<Cmp>(self, cmp: Cmp) -> DedupBy<Self, Cmp>
    where +If the iterator is sorted, all elements will be unique. Read more

    source§

    fn dedup_by<Cmp>(self, cmp: Cmp) -> DedupBy<Self, Cmp>
    where Self: Sized, Cmp: FnMut(&Self::Item, &Self::Item) -> bool,

    Remove duplicates from sections of consecutive identical elements, determining equality using a comparison function. -If the iterator is sorted, all elements will be unique. Read more
    source§

    fn dedup_with_count(self) -> DedupWithCount<Self>
    where +If the iterator is sorted, all elements will be unique. Read more

    source§

    fn dedup_with_count(self) -> DedupWithCount<Self>
    where Self: Sized,

    Remove duplicates from sections of consecutive identical elements, while keeping a count of how many repeated elements were present. -If the iterator is sorted, all elements will be unique. Read more
    source§

    fn dedup_by_with_count<Cmp>(self, cmp: Cmp) -> DedupByWithCount<Self, Cmp>
    where +If the iterator is sorted, all elements will be unique. Read more

    source§

    fn dedup_by_with_count<Cmp>(self, cmp: Cmp) -> DedupByWithCount<Self, Cmp>
    where Self: Sized, Cmp: FnMut(&Self::Item, &Self::Item) -> bool,

    Remove duplicates from sections of consecutive identical elements, while keeping a count of how many repeated elements were present. This will determine equality using a comparison function. -If the iterator is sorted, all elements will be unique. Read more
    source§

    fn duplicates(self) -> Duplicates<Self>
    where +If the iterator is sorted, all elements will be unique. Read more

    source§

    fn duplicates(self) -> Duplicates<Self>
    where Self: Sized, Self::Item: Eq + Hash,

    Return an iterator adaptor that produces elements that appear more than once during the -iteration. Duplicates are detected using hash and equality. Read more
    source§

    fn duplicates_by<V, F>(self, f: F) -> DuplicatesBy<Self, V, F>
    where +iteration. Duplicates are detected using hash and equality. Read more

    source§

    fn duplicates_by<V, F>(self, f: F) -> DuplicatesBy<Self, V, F>
    where Self: Sized, V: Eq + Hash, F: FnMut(&Self::Item) -> V,

    Return an iterator adaptor that produces elements that appear more than once during the -iteration. Duplicates are detected using hash and equality. Read more
    source§

    fn unique(self) -> Unique<Self> ⓘ
    where +iteration. Duplicates are detected using hash and equality. Read more

    source§

    fn unique(self) -> Unique<Self> ⓘ
    where Self: Sized, Self::Item: Clone + Eq + Hash,

    Return an iterator adaptor that filters out elements that have already been produced once during the iteration. Duplicates -are detected using hash and equality. Read more
    source§

    fn unique_by<V, F>(self, f: F) -> UniqueBy<Self, V, F> ⓘ
    where +are detected using hash and equality. Read more

    source§

    fn unique_by<V, F>(self, f: F) -> UniqueBy<Self, V, F> ⓘ
    where Self: Sized, V: Eq + Hash, F: FnMut(&Self::Item) -> V,

    Return an iterator adaptor that filters out elements that have -already been produced once during the iteration. Read more
    source§

    fn peeking_take_while<F>(&mut self, accept: F) -> PeekingTakeWhile<'_, Self, F> ⓘ
    where +already been produced once during the iteration. Read more

    source§

    fn peeking_take_while<F>(&mut self, accept: F) -> PeekingTakeWhile<'_, Self, F> ⓘ
    where Self: Sized + PeekingNext, F: FnMut(&Self::Item) -> bool,

    Return an iterator adaptor that borrows from this iterator and -takes items while the closure accept returns true. Read more
    source§

    fn take_while_ref<F>(&mut self, accept: F) -> TakeWhileRef<'_, Self, F> ⓘ
    where +takes items while the closure accept returns true. Read more

    source§

    fn take_while_ref<F>(&mut self, accept: F) -> TakeWhileRef<'_, Self, F> ⓘ
    where Self: Clone, F: FnMut(&Self::Item) -> bool,

    Return an iterator adaptor that borrows from a Clone-able iterator -to only pick off elements while the predicate accept returns true. Read more
    source§

    fn take_while_inclusive<F>(self, accept: F) -> TakeWhileInclusive<Self, F> ⓘ
    where +to only pick off elements while the predicate accept returns true. Read more

    source§

    fn take_while_inclusive<F>(self, accept: F) -> TakeWhileInclusive<Self, F> ⓘ
    where Self: Sized, F: FnMut(&Self::Item) -> bool,

    Returns an iterator adaptor that consumes elements while the given predicate is true, including the element for which the predicate -first returned false. Read more
    source§

    fn while_some<A>(self) -> WhileSome<Self> ⓘ
    where +first returned false. Read more

    source§

    fn while_some<A>(self) -> WhileSome<Self> ⓘ
    where Self: Sized + Iterator<Item = Option<A>>,

    Return an iterator adaptor that filters Option<A> iterator elements -and produces A. Stops on the first None encountered. Read more
    source§

    fn tuple_combinations<T>(self) -> TupleCombinations<Self, T> ⓘ
    where +and produces A. Stops on the first None encountered. Read more

    source§

    fn tuple_combinations<T>(self) -> TupleCombinations<Self, T> ⓘ
    where Self: Sized + Clone, Self::Item: Clone, T: HasCombination<Self>,

    Return an iterator adaptor that iterates over the combinations of the -elements from an iterator. Read more
    source§

    fn combinations(self, k: usize) -> Combinations<Self> ⓘ
    where +elements from an iterator. Read more

    source§

    fn combinations(self, k: usize) -> Combinations<Self> ⓘ
    where Self: Sized, Self::Item: Clone,

    Return an iterator adaptor that iterates over the k-length combinations of -the elements from an iterator. Read more
    source§

    fn combinations_with_replacement( +the elements from an iterator. Read more

    source§

    fn combinations_with_replacement( self, k: usize ) -> CombinationsWithReplacement<Self> ⓘ
    where Self: Sized, Self::Item: Clone,

    Return an iterator that iterates over the k-length combinations of -the elements from an iterator, with replacement. Read more
    source§

    fn permutations(self, k: usize) -> Permutations<Self> ⓘ
    where +the elements from an iterator, with replacement. Read more

    source§

    fn permutations(self, k: usize) -> Permutations<Self> ⓘ
    where Self: Sized, Self::Item: Clone,

    Return an iterator adaptor that iterates over all k-permutations of the -elements from an iterator. Read more
    source§

    fn powerset(self) -> Powerset<Self> ⓘ
    where +elements from an iterator. Read more

    source§

    fn powerset(self) -> Powerset<Self> ⓘ
    where Self: Sized, Self::Item: Clone,

    Return an iterator that iterates through the powerset of the elements from an -iterator. Read more
    source§

    fn pad_using<F>(self, min: usize, f: F) -> PadUsing<Self, F> ⓘ
    where +iterator. Read more

    source§

    fn pad_using<F>(self, min: usize, f: F) -> PadUsing<Self, F> ⓘ
    where Self: Sized, F: FnMut(usize) -> Self::Item,

    Return an iterator adaptor that pads the sequence to a minimum length of -min by filling missing elements using a closure f. Read more
    source§

    fn with_position(self) -> WithPosition<Self> ⓘ
    where +min by filling missing elements using a closure f. Read more

    source§

    fn with_position(self) -> WithPosition<Self> ⓘ
    where Self: Sized,

    Return an iterator adaptor that combines each element with a Position to -ease special-case handling of the first or last elements. Read more
    source§

    fn positions<P>(self, predicate: P) -> Positions<Self, P> ⓘ
    where +ease special-case handling of the first or last elements. Read more

    source§

    fn positions<P>(self, predicate: P) -> Positions<Self, P> ⓘ
    where Self: Sized, P: FnMut(Self::Item) -> bool,

    Return an iterator adaptor that yields the indices of all elements -satisfying a predicate, counted from the start of the iterator. Read more
    source§

    fn update<F>(self, updater: F) -> Update<Self, F> ⓘ
    where +satisfying a predicate, counted from the start of the iterator. Read more

    source§

    fn update<F>(self, updater: F) -> Update<Self, F> ⓘ
    where Self: Sized, F: FnMut(&mut Self::Item),

    Return an iterator adaptor that applies a mutating function -to each element before yielding it. Read more
    source§

    fn next_tuple<T>(&mut self) -> Option<T>
    where +to each element before yielding it. Read more

    source§

    fn next_tuple<T>(&mut self) -> Option<T>
    where Self: Sized + Iterator<Item = T::Item>, T: HomogeneousTuple,

    Advances the iterator and returns the next items grouped in a tuple of -a specific size (up to 12). Read more
    source§

    fn collect_tuple<T>(self) -> Option<T>
    where +a specific size (up to 12). Read more

    source§

    fn collect_tuple<T>(self) -> Option<T>
    where Self: Sized + Iterator<Item = T::Item>, T: HomogeneousTuple,

    Collects all items from the iterator into a tuple of a specific size -(up to 12). Read more
    source§

    fn find_position<P>(&mut self, pred: P) -> Option<(usize, Self::Item)>
    where - P: FnMut(&Self::Item) -> bool,

    Find the position and value of the first element satisfying a predicate. Read more
    source§

    fn find_or_last<P>(self, predicate: P) -> Option<Self::Item>
    where +(up to 12). Read more

    source§

    fn find_position<P>(&mut self, pred: P) -> Option<(usize, Self::Item)>
    where + P: FnMut(&Self::Item) -> bool,

    Find the position and value of the first element satisfying a predicate. Read more
    source§

    fn find_or_last<P>(self, predicate: P) -> Option<Self::Item>
    where Self: Sized, - P: FnMut(&Self::Item) -> bool,

    Find the value of the first element satisfying a predicate or return the last element, if any. Read more
    source§

    fn find_or_first<P>(self, predicate: P) -> Option<Self::Item>
    where + P: FnMut(&Self::Item) -> bool,

    Find the value of the first element satisfying a predicate or return the last element, if any. Read more
    source§

    fn find_or_first<P>(self, predicate: P) -> Option<Self::Item>
    where Self: Sized, - P: FnMut(&Self::Item) -> bool,

    Find the value of the first element satisfying a predicate or return the first element, if any. Read more
    source§

    fn contains<Q>(&mut self, query: &Q) -> bool
    where + P: FnMut(&Self::Item) -> bool,

    Find the value of the first element satisfying a predicate or return the first element, if any. Read more
    source§

    fn contains<Q>(&mut self, query: &Q) -> bool
    where Self: Sized, Self::Item: Borrow<Q>, - Q: PartialEq,

    Returns true if the given item is present in this iterator. Read more
    source§

    fn all_equal(&mut self) -> bool
    where + Q: PartialEq,

    Returns true if the given item is present in this iterator. Read more
    source§

    fn all_equal(&mut self) -> bool
    where Self: Sized, - Self::Item: PartialEq,

    Check whether all elements compare equal. Read more
    source§

    fn all_equal_value( + Self::Item: PartialEq,

    Check whether all elements compare equal. Read more
    source§

    fn all_equal_value( &mut self ) -> Result<Self::Item, Option<(Self::Item, Self::Item)>>
    where Self: Sized, Self::Item: PartialEq,

    If there are elements and they are all equal, return a single copy of that element. If there are no elements, return an Error containing None. If there are elements and they are not all equal, return a tuple containing the first -two non-equal elements found. Read more
    source§

    fn all_unique(&mut self) -> bool
    where +two non-equal elements found. Read more

    source§

    fn all_unique(&mut self) -> bool
    where Self: Sized, - Self::Item: Eq + Hash,

    Check whether all elements are unique (non equal). Read more
    source§

    fn dropping(self, n: usize) -> Self
    where + Self::Item: Eq + Hash,

    Check whether all elements are unique (non equal). Read more
    source§

    fn dropping(self, n: usize) -> Self
    where Self: Sized,

    Consume the first n elements from the iterator eagerly, -and return the same iterator again. Read more
    source§

    fn dropping_back(self, n: usize) -> Self
    where +and return the same iterator again. Read more

    source§

    fn dropping_back(self, n: usize) -> Self
    where Self: Sized + DoubleEndedIterator,

    Consume the last n elements from the iterator eagerly, -and return the same iterator again. Read more
    source§

    fn foreach<F>(self, f: F)
    where - F: FnMut(Self::Item), - Self: Sized,

    👎Deprecated since 0.8.0: Use .for_each() instead
    Run the closure f eagerly on each element of the iterator. Read more
    source§

    fn concat(self) -> Self::Item
    where +and return the same iterator again. Read more

    source§

    fn concat(self) -> Self::Item
    where Self: Sized, - Self::Item: Extend<<<Self as Iterator>::Item as IntoIterator>::Item> + IntoIterator + Default,

    Combine all an iterator’s elements into one element by using Extend. Read more
    source§

    fn collect_vec(self) -> Vec<Self::Item>
    where + Self::Item: Extend<<<Self as Iterator>::Item as IntoIterator>::Item> + IntoIterator + Default,

    Combine all an iterator’s elements into one element by using Extend. Read more
    source§

    fn collect_vec(self) -> Vec<Self::Item>
    where Self: Sized,

    .collect_vec() is simply a type specialization of Iterator::collect, -for convenience.
    source§

    fn try_collect<T, U, E>(self) -> Result<U, E>
    where +for convenience.

    source§

    fn try_collect<T, U, E>(self) -> Result<U, E>
    where Self: Sized + Iterator<Item = Result<T, E>>, Result<U, E>: FromIterator<Result<T, E>>,

    .try_collect() is more convenient way of writing -.collect::<Result<_, _>>() Read more
    source§

    fn set_from<'a, A: 'a, J>(&mut self, from: J) -> usize
    where +.collect::<Result<_, _>>() Read more

    source§

    fn set_from<'a, A: 'a, J>(&mut self, from: J) -> usize
    where Self: Iterator<Item = &'a mut A>, J: IntoIterator<Item = A>,

    Assign to each reference in self from the from iterator, -stopping at the shortest of the two iterators. Read more
    source§

    fn join(&mut self, sep: &str) -> String
    where - Self::Item: Display,

    Combine all iterator elements into one String, separated by sep. Read more
    source§

    fn format(self, sep: &str) -> Format<'_, Self>
    where - Self: Sized,

    Format all iterator elements, separated by sep. Read more
    source§

    fn format_with<F>(self, sep: &str, format: F) -> FormatWith<'_, Self, F>
    where +stopping at the shortest of the two iterators. Read more

    source§

    fn join(&mut self, sep: &str) -> String
    where + Self::Item: Display,

    Combine all iterator elements into one String, separated by sep. Read more
    source§

    fn format(self, sep: &str) -> Format<'_, Self>
    where + Self: Sized,

    Format all iterator elements, separated by sep. Read more
    source§

    fn format_with<F>(self, sep: &str, format: F) -> FormatWith<'_, Self, F>
    where Self: Sized, - F: FnMut(Self::Item, &mut dyn FnMut(&dyn Display) -> Result) -> Result,

    Format all iterator elements, separated by sep. Read more
    source§

    fn fold_results<A, E, B, F>(&mut self, start: B, f: F) -> Result<B, E>
    where + F: FnMut(Self::Item, &mut dyn FnMut(&dyn Display) -> Result) -> Result,

    Format all iterator elements, separated by sep. Read more
    source§

    fn fold_ok<A, E, B, F>(&mut self, start: B, f: F) -> Result<B, E>
    where Self: Iterator<Item = Result<A, E>>, - F: FnMut(B, A) -> B,

    👎Deprecated since 0.10.0: Use .fold_ok() instead
    See .fold_ok().
    source§

    fn fold_ok<A, E, B, F>(&mut self, start: B, f: F) -> Result<B, E>
    where - Self: Iterator<Item = Result<A, E>>, - F: FnMut(B, A) -> B,

    Fold Result values from an iterator. Read more
    source§

    fn fold_options<A, B, F>(&mut self, start: B, f: F) -> Option<B>
    where + F: FnMut(B, A) -> B,

    Fold Result values from an iterator. Read more
    source§

    fn fold_options<A, B, F>(&mut self, start: B, f: F) -> Option<B>
    where Self: Iterator<Item = Option<A>>, - F: FnMut(B, A) -> B,

    Fold Option values from an iterator. Read more
    source§

    fn fold1<F>(self, f: F) -> Option<Self::Item>
    where + F: FnMut(B, A) -> B,

    Fold Option values from an iterator. Read more
    source§

    fn fold1<F>(self, f: F) -> Option<Self::Item>
    where F: FnMut(Self::Item, Self::Item) -> Self::Item, - Self: Sized,

    👎Deprecated since 0.10.2: Use Iterator::reduce instead
    Accumulator of the elements in the iterator. Read more
    source§

    fn tree_fold1<F>(self, f: F) -> Option<Self::Item>
    where + Self: Sized,

    👎Deprecated since 0.10.2: Use Iterator::reduce instead
    Accumulator of the elements in the iterator. Read more
    source§

    fn tree_reduce<F>(self, f: F) -> Option<Self::Item>
    where F: FnMut(Self::Item, Self::Item) -> Self::Item, - Self: Sized,

    Accumulate the elements in the iterator in a tree-like manner. Read more
    source§

    fn fold_while<B, F>(&mut self, init: B, f: F) -> FoldWhile<B>
    where + Self: Sized,

    Accumulate the elements in the iterator in a tree-like manner. Read more
    source§

    fn tree_fold1<F>(self, f: F) -> Option<Self::Item>
    where + F: FnMut(Self::Item, Self::Item) -> Self::Item, + Self: Sized,

    👎Deprecated since 0.13.0: Use .tree_reduce() instead
    See .tree_reduce().
    source§

    fn fold_while<B, F>(&mut self, init: B, f: F) -> FoldWhile<B>
    where Self: Sized, - F: FnMut(B, Self::Item) -> FoldWhile<B>,

    An iterator method that applies a function, producing a single, final value. Read more
    source§

    fn sum1<S>(self) -> Option<S>
    where + F: FnMut(B, Self::Item) -> FoldWhile<B>,

    An iterator method that applies a function, producing a single, final value. Read more
    source§

    fn sum1<S>(self) -> Option<S>
    where Self: Sized, - S: Sum<Self::Item>,

    Iterate over the entire iterator and add all the elements. Read more
    source§

    fn product1<P>(self) -> Option<P>
    where + S: Sum<Self::Item>,

    Iterate over the entire iterator and add all the elements. Read more
    source§

    fn product1<P>(self) -> Option<P>
    where Self: Sized, - P: Product<Self::Item>,

    Iterate over the entire iterator and multiply all the elements. Read more
    source§

    fn sorted_unstable(self) -> IntoIter<Self::Item> ⓘ
    where + P: Product<Self::Item>,

    Iterate over the entire iterator and multiply all the elements. Read more
    source§

    fn sorted_unstable(self) -> IntoIter<Self::Item> ⓘ
    where Self: Sized, - Self::Item: Ord,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_unstable_by<F>(self, cmp: F) -> IntoIter<Self::Item> ⓘ
    where + Self::Item: Ord,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_unstable_by<F>(self, cmp: F) -> IntoIter<Self::Item> ⓘ
    where Self: Sized, - F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_unstable_by_key<K, F>(self, f: F) -> IntoIter<Self::Item> ⓘ
    where + F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_unstable_by_key<K, F>(self, f: F) -> IntoIter<Self::Item> ⓘ
    where Self: Sized, K: Ord, - F: FnMut(&Self::Item) -> K,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted(self) -> IntoIter<Self::Item> ⓘ
    where + F: FnMut(&Self::Item) -> K,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted(self) -> IntoIter<Self::Item> ⓘ
    where Self: Sized, - Self::Item: Ord,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_by<F>(self, cmp: F) -> IntoIter<Self::Item> ⓘ
    where + Self::Item: Ord,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_by<F>(self, cmp: F) -> IntoIter<Self::Item> ⓘ
    where Self: Sized, - F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_by_key<K, F>(self, f: F) -> IntoIter<Self::Item> ⓘ
    where + F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_by_key<K, F>(self, f: F) -> IntoIter<Self::Item> ⓘ
    where Self: Sized, K: Ord, - F: FnMut(&Self::Item) -> K,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_by_cached_key<K, F>(self, f: F) -> IntoIter<Self::Item> ⓘ
    where + F: FnMut(&Self::Item) -> K,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_by_cached_key<K, F>(self, f: F) -> IntoIter<Self::Item> ⓘ
    where Self: Sized, K: Ord, F: FnMut(&Self::Item) -> K,

    Sort all iterator elements into a new iterator in ascending order. The key function is -called exactly once per key. Read more
    source§

    fn k_smallest(self, k: usize) -> IntoIter<Self::Item> ⓘ
    where +called exactly once per key. Read more

    source§

    fn k_smallest(self, k: usize) -> IntoIter<Self::Item> ⓘ
    where Self: Sized, - Self::Item: Ord,

    Sort the k smallest elements into a new iterator, in ascending order. Read more
    source§

    fn partition_map<A, B, F, L, R>(self, predicate: F) -> (A, B)
    where + Self::Item: Ord,

    Sort the k smallest elements into a new iterator, in ascending order. Read more
    source§

    fn k_smallest_by<F>(self, k: usize, cmp: F) -> IntoIter<Self::Item> ⓘ
    where + Self: Sized, + F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Sort the k smallest elements into a new iterator using the provided comparison. Read more
    source§

    fn k_smallest_by_key<F, K>(self, k: usize, key: F) -> IntoIter<Self::Item> ⓘ
    where + Self: Sized, + F: FnMut(&Self::Item) -> K, + K: Ord,

    Return the elements producing the k smallest outputs of the provided function. Read more
    source§

    fn k_largest(self, k: usize) -> IntoIter<Self::Item> ⓘ
    where + Self: Sized, + Self::Item: Ord,

    Sort the k largest elements into a new iterator, in descending order. Read more
    source§

    fn k_largest_by<F>(self, k: usize, cmp: F) -> IntoIter<Self::Item> ⓘ
    where + Self: Sized, + F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Sort the k largest elements into a new iterator using the provided comparison. Read more
    source§

    fn k_largest_by_key<F, K>(self, k: usize, key: F) -> IntoIter<Self::Item> ⓘ
    where + Self: Sized, + F: FnMut(&Self::Item) -> K, + K: Ord,

    Return the elements producing the k largest outputs of the provided function. Read more
    source§

    fn tail(self, n: usize) -> IntoIter<Self::Item> ⓘ
    where + Self: Sized,

    Consumes the iterator and return an iterator of the last n elements. Read more
    source§

    fn partition_map<A, B, F, L, R>(self, predicate: F) -> (A, B)
    where Self: Sized, F: FnMut(Self::Item) -> Either<L, R>, A: Default + Extend<L>, B: Default + Extend<R>,

    Collect all iterator elements into one of two partitions. Unlike Iterator::partition, each partition may -have a distinct type. Read more
    source§

    fn partition_result<A, B, T, E>(self) -> (A, B)
    where +have a distinct type. Read more

    source§

    fn partition_result<A, B, T, E>(self) -> (A, B)
    where Self: Iterator<Item = Result<T, E>> + Sized, A: Default + Extend<T>, B: Default + Extend<E>,

    Partition a sequence of Results into one list of all the Ok elements -and another list of all the Err elements. Read more
    source§

    fn into_group_map<K, V>(self) -> HashMap<K, Vec<V>>
    where +and another list of all the Err elements. Read more

    source§

    fn into_group_map<K, V>(self) -> HashMap<K, Vec<V>>
    where Self: Iterator<Item = (K, V)> + Sized, K: Hash + Eq,

    Return a HashMap of keys mapped to Vecs of values. Keys and values -are taken from (Key, Value) tuple pairs yielded by the input iterator. Read more
    source§

    fn into_group_map_by<K, V, F>(self, f: F) -> HashMap<K, Vec<V>>
    where +are taken from (Key, Value) tuple pairs yielded by the input iterator. Read more

    source§

    fn into_group_map_by<K, V, F>(self, f: F) -> HashMap<K, Vec<V>>
    where Self: Iterator<Item = V> + Sized, K: Hash + Eq, - F: Fn(&V) -> K,

    Return an Iterator on a HashMap. Keys mapped to Vecs of values. The key is specified -in the closure. Read more
    source§

    fn into_grouping_map<K, V>(self) -> GroupingMap<Self>
    where + F: FnMut(&V) -> K,

    Return an Iterator on a HashMap. Keys mapped to Vecs of values. The key is specified +in the closure. Read more
    source§

    fn into_grouping_map<K, V>(self) -> GroupingMap<Self>
    where Self: Iterator<Item = (K, V)> + Sized, K: Hash + Eq,

    Constructs a GroupingMap to be used later with one of the efficient -group-and-fold operations it allows to perform. Read more
    source§

    fn into_grouping_map_by<K, V, F>(self, key_mapper: F) -> GroupingMapBy<Self, F>
    where +group-and-fold operations it allows to perform. Read more

    source§

    fn into_grouping_map_by<K, V, F>(self, key_mapper: F) -> GroupingMapBy<Self, F>
    where Self: Iterator<Item = V> + Sized, K: Hash + Eq, F: FnMut(&V) -> K,

    Constructs a GroupingMap to be used later with one of the efficient -group-and-fold operations it allows to perform. Read more
    source§

    fn min_set(self) -> Vec<Self::Item>
    where +group-and-fold operations it allows to perform. Read more

    source§

    fn min_set(self) -> Vec<Self::Item>
    where Self: Sized, - Self::Item: Ord,

    Return all minimum elements of an iterator. Read more
    source§

    fn min_set_by<F>(self, compare: F) -> Vec<Self::Item>
    where + Self::Item: Ord,

    Return all minimum elements of an iterator. Read more
    source§

    fn min_set_by<F>(self, compare: F) -> Vec<Self::Item>
    where Self: Sized, F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Return all minimum elements of an iterator, as determined by -the specified function. Read more
    source§

    fn min_set_by_key<K, F>(self, key: F) -> Vec<Self::Item>
    where +the specified function. Read more

    source§

    fn min_set_by_key<K, F>(self, key: F) -> Vec<Self::Item>
    where Self: Sized, K: Ord, F: FnMut(&Self::Item) -> K,

    Return all minimum elements of an iterator, as determined by -the specified function. Read more
    source§

    fn max_set(self) -> Vec<Self::Item>
    where +the specified function. Read more

    source§

    fn max_set(self) -> Vec<Self::Item>
    where Self: Sized, - Self::Item: Ord,

    Return all maximum elements of an iterator. Read more
    source§

    fn max_set_by<F>(self, compare: F) -> Vec<Self::Item>
    where + Self::Item: Ord,

    Return all maximum elements of an iterator. Read more
    source§

    fn max_set_by<F>(self, compare: F) -> Vec<Self::Item>
    where Self: Sized, F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Return all maximum elements of an iterator, as determined by -the specified function. Read more
    source§

    fn max_set_by_key<K, F>(self, key: F) -> Vec<Self::Item>
    where +the specified function. Read more

    source§

    fn max_set_by_key<K, F>(self, key: F) -> Vec<Self::Item>
    where Self: Sized, K: Ord, F: FnMut(&Self::Item) -> K,

    Return all maximum elements of an iterator, as determined by -the specified function. Read more
    source§

    fn minmax(self) -> MinMaxResult<Self::Item>
    where +the specified function. Read more

    source§

    fn minmax(self) -> MinMaxResult<Self::Item>
    where Self: Sized, - Self::Item: PartialOrd,

    Return the minimum and maximum elements in the iterator. Read more
    source§

    fn minmax_by_key<K, F>(self, key: F) -> MinMaxResult<Self::Item>
    where + Self::Item: PartialOrd,

    Return the minimum and maximum elements in the iterator. Read more
    source§

    fn minmax_by_key<K, F>(self, key: F) -> MinMaxResult<Self::Item>
    where Self: Sized, K: PartialOrd, F: FnMut(&Self::Item) -> K,

    Return the minimum and maximum element of an iterator, as determined by -the specified function. Read more
    source§

    fn minmax_by<F>(self, compare: F) -> MinMaxResult<Self::Item>
    where +the specified function. Read more

    source§

    fn minmax_by<F>(self, compare: F) -> MinMaxResult<Self::Item>
    where Self: Sized, F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Return the minimum and maximum element of an iterator, as determined by -the specified comparison function. Read more
    source§

    fn position_max(self) -> Option<usize>
    where +the specified comparison function. Read more

    source§

    fn position_max(self) -> Option<usize>
    where Self: Sized, - Self::Item: Ord,

    Return the position of the maximum element in the iterator. Read more
    source§

    fn position_max_by_key<K, F>(self, key: F) -> Option<usize>
    where + Self::Item: Ord,

    Return the position of the maximum element in the iterator. Read more
    source§

    fn position_max_by_key<K, F>(self, key: F) -> Option<usize>
    where Self: Sized, K: Ord, F: FnMut(&Self::Item) -> K,

    Return the position of the maximum element in the iterator, as -determined by the specified function. Read more
    source§

    fn position_max_by<F>(self, compare: F) -> Option<usize>
    where +determined by the specified function. Read more

    source§

    fn position_max_by<F>(self, compare: F) -> Option<usize>
    where Self: Sized, F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Return the position of the maximum element in the iterator, as -determined by the specified comparison function. Read more
    source§

    fn position_min(self) -> Option<usize>
    where +determined by the specified comparison function. Read more

    source§

    fn position_min(self) -> Option<usize>
    where Self: Sized, - Self::Item: Ord,

    Return the position of the minimum element in the iterator. Read more
    source§

    fn position_min_by_key<K, F>(self, key: F) -> Option<usize>
    where + Self::Item: Ord,

    Return the position of the minimum element in the iterator. Read more
    source§

    fn position_min_by_key<K, F>(self, key: F) -> Option<usize>
    where Self: Sized, K: Ord, F: FnMut(&Self::Item) -> K,

    Return the position of the minimum element in the iterator, as -determined by the specified function. Read more
    source§

    fn position_min_by<F>(self, compare: F) -> Option<usize>
    where +determined by the specified function. Read more

    source§

    fn position_min_by<F>(self, compare: F) -> Option<usize>
    where Self: Sized, F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Return the position of the minimum element in the iterator, as -determined by the specified comparison function. Read more
    source§

    fn position_minmax(self) -> MinMaxResult<usize>
    where +determined by the specified comparison function. Read more

    source§

    fn position_minmax(self) -> MinMaxResult<usize>
    where Self: Sized, Self::Item: PartialOrd,

    Return the positions of the minimum and maximum elements in -the iterator. Read more
    source§

    fn position_minmax_by_key<K, F>(self, key: F) -> MinMaxResult<usize>
    where +the iterator. Read more

    source§

    fn position_minmax_by_key<K, F>(self, key: F) -> MinMaxResult<usize>
    where Self: Sized, K: PartialOrd, F: FnMut(&Self::Item) -> K,

    Return the postions of the minimum and maximum elements of an -iterator, as determined by the specified function. Read more
    source§

    fn position_minmax_by<F>(self, compare: F) -> MinMaxResult<usize>
    where +iterator, as determined by the specified function. Read more

    source§

    fn position_minmax_by<F>(self, compare: F) -> MinMaxResult<usize>
    where Self: Sized, F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Return the postions of the minimum and maximum elements of an -iterator, as determined by the specified comparison function. Read more
    source§

    fn exactly_one(self) -> Result<Self::Item, ExactlyOneError<Self>>
    where +iterator, as determined by the specified comparison function. Read more

    source§

    fn exactly_one(self) -> Result<Self::Item, ExactlyOneError<Self>>
    where Self: Sized,

    If the iterator yields exactly one element, that element will be returned, otherwise an error will be returned containing an iterator that has the same output as the input -iterator. Read more
    source§

    fn at_most_one(self) -> Result<Option<Self::Item>, ExactlyOneError<Self>>
    where - Self: Sized,

    If the iterator yields no elements, Ok(None) will be returned. If the iterator yields +iterator. Read more
    source§

    fn at_most_one(self) -> Result<Option<Self::Item>, ExactlyOneError<Self>>
    where + Self: Sized,

    If the iterator yields no elements, Ok(None) will be returned. If the iterator yields exactly one element, that element will be returned, otherwise an error will be returned -containing an iterator that has the same output as the input iterator. Read more
    source§

    fn multipeek(self) -> MultiPeek<Self> ⓘ
    where +containing an iterator that has the same output as the input iterator. Read more

    source§

    fn multipeek(self) -> MultiPeek<Self> ⓘ
    where Self: Sized,

    An iterator adaptor that allows the user to peek at multiple .next() -values without advancing the base iterator. Read more
    source§

    fn counts(self) -> HashMap<Self::Item, usize>
    where +values without advancing the base iterator. Read more

    source§

    fn counts(self) -> HashMap<Self::Item, usize>
    where Self: Sized, Self::Item: Eq + Hash,

    Collect the items in this iterator and return a HashMap which contains each item that appears in the iterator and the number -of times it appears. Read more
    source§

    fn counts_by<K, F>(self, f: F) -> HashMap<K, usize>
    where +of times it appears. Read more

    source§

    fn counts_by<K, F>(self, f: F) -> HashMap<K, usize>
    where Self: Sized, K: Eq + Hash, F: FnMut(Self::Item) -> K,

    Collect the items in this iterator and return a HashMap which contains each item that appears in the iterator and the number of times it appears, -determining identity using a keying function. Read more
    source§

    fn multiunzip<FromI>(self) -> FromI
    where - Self: Sized + MultiUnzip<FromI>,

    Converts an iterator of tuples into a tuple of containers. Read more
    source§

    fn try_len(&self) -> Result<usize, (usize, Option<usize>)>

    Returns the length of the iterator if one exists. +determining identity using a keying function. Read more
    source§

    fn multiunzip<FromI>(self) -> FromI
    where + Self: Sized + MultiUnzip<FromI>,

    Converts an iterator of tuples into a tuple of containers. Read more
    source§

    fn try_len(&self) -> Result<usize, (usize, Option<usize>)>

    Returns the length of the iterator if one exists. Otherwise return self.size_hint(). Read more
    source§

    impl<T> 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 + 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/itertools/structs/struct.CombinationsWithReplacement.html b/itertools/structs/struct.CombinationsWithReplacement.html index 28a8f0361..86bcd7955 100644 --- a/itertools/structs/struct.CombinationsWithReplacement.html +++ b/itertools/structs/struct.CombinationsWithReplacement.html @@ -1,4 +1,4 @@ -CombinationsWithReplacement in itertools::structs - Rust
    +CombinationsWithReplacement in itertools::structs - Rust

    Struct itertools::structs::CombinationsWithReplacement

    source · 
    pub struct CombinationsWithReplacement<I>
    where
     I: Iterator,
     I::Item: Clone,
    { /* private fields */ }
    Expand description

    An iterator to iterate through all the n-length combinations in an iterator, with replacement.

    @@ -8,13 +8,13 @@ for more information.

    I: Iterator + Clone, I::Item: Clone,
    source§

    fn clone(&self) -> CombinationsWithReplacement<I> ⓘ

    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<I> Debug for CombinationsWithReplacement<I>
    where I: Iterator + Debug, - I::Item: Debug + Clone,

    source§

    fn fmt(&self, f: &mut Formatter<'_>) -> Result

    Formats the value using the given formatter. Read more
    source§

    impl<I> Iterator for CombinationsWithReplacement<I>
    where + I::Item: Debug + Clone,

    source§

    fn fmt(&self, f: &mut Formatter<'_>) -> Result

    Formats the value using the given formatter. Read more
    source§

    impl<I> Iterator for CombinationsWithReplacement<I>
    where I: Iterator, - I::Item: Clone,

    §

    type Item = Vec<<I as Iterator>::Item>

    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 next_chunk<const N: usize>( + I::Item: Clone,

    §

    type Item = Vec<<I as Iterator>::Item>

    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 nth(&mut self, n: usize) -> Option<Self::Item>

    Returns the nth element of the iterator. 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 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 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,

    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.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, @@ -186,7 +186,7 @@ greater than or equal to those of another. 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> FusedIterator for CombinationsWithReplacement<I>
    where +function. Read more

    source§

    impl<I> FusedIterator for CombinationsWithReplacement<I>
    where I: Iterator, I::Item: Clone,

    Auto Trait Implementations§

    §

    impl<I> Freeze for CombinationsWithReplacement<I>
    where I: Freeze,

    §

    impl<I> RefUnwindSafe for CombinationsWithReplacement<I>
    where @@ -215,86 +215,87 @@ otherwise. Right variant of Either<Self, Self> otherwise. Read more

    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> Itertools for T
    where - T: Iterator + ?Sized,

    source§

    fn interleave<J>(self, other: J) -> Interleave<Self, J::IntoIter> ⓘ
    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> Itertools for T
    where + T: Iterator + ?Sized,

    source§

    fn interleave<J>(self, other: J) -> Interleave<Self, J::IntoIter> ⓘ
    where J: IntoIterator<Item = Self::Item>, - Self: Sized,

    Alternate elements from two iterators until both have run out. Read more
    source§

    fn interleave_shortest<J>( + Self: Sized,

    Alternate elements from two iterators until both have run out. Read more
    source§

    fn interleave_shortest<J>( self, other: J ) -> InterleaveShortest<Self, J::IntoIter> ⓘ
    where J: IntoIterator<Item = Self::Item>, Self: Sized,

    Alternate elements from two iterators until at least one of them has run -out. Read more
    source§

    fn intersperse(self, element: Self::Item) -> Intersperse<Self>
    where +out. Read more

    source§

    fn intersperse(self, element: Self::Item) -> Intersperse<Self>
    where Self: Sized, Self::Item: Clone,

    An iterator adaptor to insert a particular value -between each element of the adapted iterator. Read more
    source§

    fn intersperse_with<F>(self, element: F) -> IntersperseWith<Self, F> ⓘ
    where +between each element of the adapted iterator. Read more

    source§

    fn intersperse_with<F>(self, element: F) -> IntersperseWith<Self, F> ⓘ
    where Self: Sized, F: FnMut() -> Self::Item,

    An iterator adaptor to insert a particular value created by a function -between each element of the adapted iterator. Read more
    source§

    fn zip_longest<J>(self, other: J) -> ZipLongest<Self, J::IntoIter> ⓘ
    where +between each element of the adapted iterator. Read more

    source§

    fn get<R>(self, index: R) -> R::Output
    where + Self: Sized, + R: IteratorIndex<Self>,

    Returns an iterator over a subsection of the iterator. Read more
    source§

    fn zip_longest<J>(self, other: J) -> ZipLongest<Self, J::IntoIter> ⓘ
    where J: IntoIterator, Self: Sized,

    Create an iterator which iterates over both this and the specified -iterator simultaneously, yielding pairs of two optional elements. Read more
    source§

    fn zip_eq<J>(self, other: J) -> ZipEq<Self, J::IntoIter> ⓘ
    where +iterator simultaneously, yielding pairs of two optional elements. Read more

    source§

    fn zip_eq<J>(self, other: J) -> ZipEq<Self, J::IntoIter> ⓘ
    where J: IntoIterator, Self: Sized,

    Create an iterator which iterates over both this and the specified -iterator simultaneously, yielding pairs of elements. Read more
    source§

    fn batching<B, F>(self, f: F) -> Batching<Self, F> ⓘ
    where +iterator simultaneously, yielding pairs of elements. Read more

    source§

    fn batching<B, F>(self, f: F) -> Batching<Self, F> ⓘ
    where F: FnMut(&mut Self) -> Option<B>, Self: Sized,

    A “meta iterator adaptor”. Its closure receives a reference to the iterator and may pick off as many elements as it likes, to produce the -next iterator element. Read more
    source§

    fn group_by<K, F>(self, key: F) -> GroupBy<K, Self, F>
    where +next iterator element. Read more

    source§

    fn chunk_by<K, F>(self, key: F) -> ChunkBy<K, Self, F>
    where Self: Sized, F: FnMut(&Self::Item) -> K, K: PartialEq,

    Return an iterable that can group iterator elements. Consecutive elements that map to the same key (“runs”), are assigned -to the same group. Read more
    source§

    fn chunks(self, size: usize) -> IntoChunks<Self>
    where - Self: Sized,

    Return an iterable that can chunk the iterator. Read more
    source§

    fn tuple_windows<T>(self) -> TupleWindows<Self, T> ⓘ
    where +to the same group. Read more

    source§

    fn group_by<K, F>(self, key: F) -> ChunkBy<K, Self, F>
    where + Self: Sized, + F: FnMut(&Self::Item) -> K, + K: PartialEq,

    👎Deprecated since 0.13.0: Use .chunk_by() instead
    See .chunk_by().
    source§

    fn chunks(self, size: usize) -> IntoChunks<Self>
    where + Self: Sized,

    Return an iterable that can chunk the iterator. Read more
    source§

    fn tuple_windows<T>(self) -> TupleWindows<Self, T> ⓘ
    where Self: Sized + Iterator<Item = T::Item>, T: HomogeneousTuple, T::Item: Clone,

    Return an iterator over all contiguous windows producing tuples of -a specific size (up to 12). Read more
    source§

    fn circular_tuple_windows<T>(self) -> CircularTupleWindows<Self, T> ⓘ
    where +a specific size (up to 12). Read more

    source§

    fn circular_tuple_windows<T>(self) -> CircularTupleWindows<Self, T> ⓘ
    where Self: Sized + Clone + Iterator<Item = T::Item> + ExactSizeIterator, T: TupleCollect + Clone, T::Item: Clone,

    Return an iterator over all windows, wrapping back to the first elements when the window would otherwise exceed the length of the -iterator, producing tuples of a specific size (up to 12). Read more
    source§

    fn tuples<T>(self) -> Tuples<Self, T> ⓘ
    where +iterator, producing tuples of a specific size (up to 12). Read more

    source§

    fn tuples<T>(self) -> Tuples<Self, T> ⓘ
    where Self: Sized + Iterator<Item = T::Item>, T: HomogeneousTuple,

    Return an iterator that groups the items in tuples of a specific size -(up to 12). Read more
    source§

    fn tee(self) -> (Tee<Self>, Tee<Self>)
    where +(up to 12). Read more

    source§

    fn tee(self) -> (Tee<Self>, Tee<Self>)
    where Self: Sized, Self::Item: Clone,

    Split into an iterator pair that both yield all elements from -the original iterator. Read more
    source§

    fn step(self, n: usize) -> Step<Self> ⓘ
    where - Self: Sized,

    👎Deprecated since 0.8.0: Use std .step_by() instead
    Return an iterator adaptor that steps n elements in the base iterator -for each iteration. Read more
    source§

    fn map_into<R>(self) -> MapInto<Self, R>
    where +the original iterator. Read more

    source§

    fn map_into<R>(self) -> MapInto<Self, R>
    where Self: Sized, - Self::Item: Into<R>,

    Convert each item of the iterator using the Into trait. Read more
    source§

    fn map_results<F, T, U, E>(self, f: F) -> MapOk<Self, F>
    where - Self: Iterator<Item = Result<T, E>> + Sized, - F: FnMut(T) -> U,

    👎Deprecated since 0.10.0: Use .map_ok() instead
    See .map_ok().
    source§

    fn map_ok<F, T, U, E>(self, f: F) -> MapOk<Self, F>
    where + Self::Item: Into<R>,

    Convert each item of the iterator using the Into trait. Read more
    source§

    fn map_ok<F, T, U, E>(self, f: F) -> MapOk<Self, F>
    where Self: Iterator<Item = Result<T, E>> + Sized, F: FnMut(T) -> U,

    Return an iterator adaptor that applies the provided closure to every Result::Ok value. Result::Err values are -unchanged. Read more
    source§

    fn filter_ok<F, T, E>(self, f: F) -> FilterOk<Self, F> ⓘ
    where +unchanged. Read more

    source§

    fn filter_ok<F, T, E>(self, f: F) -> FilterOk<Self, F> ⓘ
    where Self: Iterator<Item = Result<T, E>> + Sized, F: FnMut(&T) -> bool,

    Return an iterator adaptor that filters every Result::Ok value with the provided closure. Result::Err values are -unchanged. Read more
    source§

    fn filter_map_ok<F, T, U, E>(self, f: F) -> FilterMapOk<Self, F> ⓘ
    where +unchanged. Read more

    source§

    fn filter_map_ok<F, T, U, E>(self, f: F) -> FilterMapOk<Self, F> ⓘ
    where Self: Iterator<Item = Result<T, E>> + Sized, F: FnMut(T) -> Option<U>,

    Return an iterator adaptor that filters and transforms every Result::Ok value with the provided closure. Result::Err -values are unchanged. Read more
    source§

    fn flatten_ok<T, E>(self) -> FlattenOk<Self, T, E> ⓘ
    where +values are unchanged. Read more

    source§

    fn flatten_ok<T, E>(self) -> FlattenOk<Self, T, E> ⓘ
    where Self: Iterator<Item = Result<T, E>> + Sized, T: IntoIterator,

    Return an iterator adaptor that flattens every Result::Ok value into -a series of Result::Ok values. Result::Err values are unchanged. Read more
    source§

    fn process_results<F, T, E, R>(self, processor: F) -> Result<R, E>
    where +a series of Result::Ok values. Result::Err values are unchanged. Read more

    source§

    fn process_results<F, T, E, R>(self, processor: F) -> Result<R, E>
    where Self: Iterator<Item = Result<T, E>> + Sized, F: FnOnce(ProcessResults<'_, Self, E>) -> R,

    “Lift” a function of the values of the current iterator so as to process -an iterator of Result values instead. Read more
    source§

    fn merge<J>(self, other: J) -> Merge<Self, J::IntoIter>
    where +an iterator of Result values instead. Read more

    source§

    fn merge<J>(self, other: J) -> Merge<Self, J::IntoIter>
    where Self: Sized, Self::Item: PartialOrd, J: IntoIterator<Item = Self::Item>,

    Return an iterator adaptor that merges the two base iterators in ascending order. If both base iterators are sorted (ascending), the -result is sorted. Read more
    source§

    fn merge_by<J, F>(self, other: J, is_first: F) -> MergeBy<Self, J::IntoIter, F> ⓘ
    where +result is sorted. Read more

    source§

    fn merge_by<J, F>(self, other: J, is_first: F) -> MergeBy<Self, J::IntoIter, F> ⓘ
    where Self: Sized, J: IntoIterator<Item = Self::Item>, F: FnMut(&Self::Item, &Self::Item) -> bool,

    Return an iterator adaptor that merges the two base iterators in order. -This is much like .merge() but allows for a custom ordering. Read more
    source§

    fn merge_join_by<J, F, T>( +This is much like .merge() but allows for a custom ordering. Read more

    source§

    fn merge_join_by<J, F, T>( self, other: J, cmp_fn: F @@ -302,285 +303,296 @@ This is much like IntoIterator, F: FnMut(&Self::Item, &J::Item) -> T, Self: Sized,

    Create an iterator that merges items from both this and the specified -iterator in ascending order. Read more
    source§

    fn kmerge(self) -> KMerge<<Self::Item as IntoIterator>::IntoIter>
    where +iterator in ascending order. Read more

    source§

    fn kmerge(self) -> KMerge<<Self::Item as IntoIterator>::IntoIter>
    where Self: Sized, Self::Item: IntoIterator, <Self::Item as IntoIterator>::Item: PartialOrd,

    Return an iterator adaptor that flattens an iterator of iterators by -merging them in ascending order. Read more
    source§

    fn kmerge_by<F>( +merging them in ascending order. Read more

    source§

    fn kmerge_by<F>( self, first: F ) -> KMergeBy<<Self::Item as IntoIterator>::IntoIter, F> ⓘ
    where Self: Sized, Self::Item: IntoIterator, F: FnMut(&<Self::Item as IntoIterator>::Item, &<Self::Item as IntoIterator>::Item) -> bool,

    Return an iterator adaptor that flattens an iterator of iterators by -merging them according to the given closure. Read more
    source§

    fn cartesian_product<J>(self, other: J) -> Product<Self, J::IntoIter> ⓘ
    where +merging them according to the given closure. Read more

    source§

    fn cartesian_product<J>(self, other: J) -> Product<Self, J::IntoIter> ⓘ
    where Self: Sized, Self::Item: Clone, J: IntoIterator, J::IntoIter: Clone,

    Return an iterator adaptor that iterates over the cartesian product of -the element sets of two iterators self and J. Read more
    source§

    fn multi_cartesian_product( +the element sets of two iterators self and J. Read more

    source§

    fn multi_cartesian_product( self ) -> MultiProduct<<Self::Item as IntoIterator>::IntoIter> ⓘ
    where Self: Sized, Self::Item: IntoIterator, <Self::Item as IntoIterator>::IntoIter: Clone, <Self::Item as IntoIterator>::Item: Clone,

    Return an iterator adaptor that iterates over the cartesian product of -all subiterators returned by meta-iterator self. Read more
    source§

    fn coalesce<F>(self, f: F) -> Coalesce<Self, F>
    where +all subiterators returned by meta-iterator self. Read more

    source§

    fn coalesce<F>(self, f: F) -> Coalesce<Self, F>
    where Self: Sized, F: FnMut(Self::Item, Self::Item) -> Result<Self::Item, (Self::Item, Self::Item)>,

    Return an iterator adaptor that uses the passed-in closure to -optionally merge together consecutive elements. Read more
    source§

    fn dedup(self) -> Dedup<Self>
    where +optionally merge together consecutive elements. Read more

    source§

    fn dedup(self) -> Dedup<Self>
    where Self: Sized, Self::Item: PartialEq,

    Remove duplicates from sections of consecutive identical elements. -If the iterator is sorted, all elements will be unique. Read more
    source§

    fn dedup_by<Cmp>(self, cmp: Cmp) -> DedupBy<Self, Cmp>
    where +If the iterator is sorted, all elements will be unique. Read more

    source§

    fn dedup_by<Cmp>(self, cmp: Cmp) -> DedupBy<Self, Cmp>
    where Self: Sized, Cmp: FnMut(&Self::Item, &Self::Item) -> bool,

    Remove duplicates from sections of consecutive identical elements, determining equality using a comparison function. -If the iterator is sorted, all elements will be unique. Read more
    source§

    fn dedup_with_count(self) -> DedupWithCount<Self>
    where +If the iterator is sorted, all elements will be unique. Read more

    source§

    fn dedup_with_count(self) -> DedupWithCount<Self>
    where Self: Sized,

    Remove duplicates from sections of consecutive identical elements, while keeping a count of how many repeated elements were present. -If the iterator is sorted, all elements will be unique. Read more
    source§

    fn dedup_by_with_count<Cmp>(self, cmp: Cmp) -> DedupByWithCount<Self, Cmp>
    where +If the iterator is sorted, all elements will be unique. Read more

    source§

    fn dedup_by_with_count<Cmp>(self, cmp: Cmp) -> DedupByWithCount<Self, Cmp>
    where Self: Sized, Cmp: FnMut(&Self::Item, &Self::Item) -> bool,

    Remove duplicates from sections of consecutive identical elements, while keeping a count of how many repeated elements were present. This will determine equality using a comparison function. -If the iterator is sorted, all elements will be unique. Read more
    source§

    fn duplicates(self) -> Duplicates<Self>
    where +If the iterator is sorted, all elements will be unique. Read more

    source§

    fn duplicates(self) -> Duplicates<Self>
    where Self: Sized, Self::Item: Eq + Hash,

    Return an iterator adaptor that produces elements that appear more than once during the -iteration. Duplicates are detected using hash and equality. Read more
    source§

    fn duplicates_by<V, F>(self, f: F) -> DuplicatesBy<Self, V, F>
    where +iteration. Duplicates are detected using hash and equality. Read more

    source§

    fn duplicates_by<V, F>(self, f: F) -> DuplicatesBy<Self, V, F>
    where Self: Sized, V: Eq + Hash, F: FnMut(&Self::Item) -> V,

    Return an iterator adaptor that produces elements that appear more than once during the -iteration. Duplicates are detected using hash and equality. Read more
    source§

    fn unique(self) -> Unique<Self> ⓘ
    where +iteration. Duplicates are detected using hash and equality. Read more

    source§

    fn unique(self) -> Unique<Self> ⓘ
    where Self: Sized, Self::Item: Clone + Eq + Hash,

    Return an iterator adaptor that filters out elements that have already been produced once during the iteration. Duplicates -are detected using hash and equality. Read more
    source§

    fn unique_by<V, F>(self, f: F) -> UniqueBy<Self, V, F> ⓘ
    where +are detected using hash and equality. Read more

    source§

    fn unique_by<V, F>(self, f: F) -> UniqueBy<Self, V, F> ⓘ
    where Self: Sized, V: Eq + Hash, F: FnMut(&Self::Item) -> V,

    Return an iterator adaptor that filters out elements that have -already been produced once during the iteration. Read more
    source§

    fn peeking_take_while<F>(&mut self, accept: F) -> PeekingTakeWhile<'_, Self, F> ⓘ
    where +already been produced once during the iteration. Read more

    source§

    fn peeking_take_while<F>(&mut self, accept: F) -> PeekingTakeWhile<'_, Self, F> ⓘ
    where Self: Sized + PeekingNext, F: FnMut(&Self::Item) -> bool,

    Return an iterator adaptor that borrows from this iterator and -takes items while the closure accept returns true. Read more
    source§

    fn take_while_ref<F>(&mut self, accept: F) -> TakeWhileRef<'_, Self, F> ⓘ
    where +takes items while the closure accept returns true. Read more

    source§

    fn take_while_ref<F>(&mut self, accept: F) -> TakeWhileRef<'_, Self, F> ⓘ
    where Self: Clone, F: FnMut(&Self::Item) -> bool,

    Return an iterator adaptor that borrows from a Clone-able iterator -to only pick off elements while the predicate accept returns true. Read more
    source§

    fn take_while_inclusive<F>(self, accept: F) -> TakeWhileInclusive<Self, F> ⓘ
    where +to only pick off elements while the predicate accept returns true. Read more

    source§

    fn take_while_inclusive<F>(self, accept: F) -> TakeWhileInclusive<Self, F> ⓘ
    where Self: Sized, F: FnMut(&Self::Item) -> bool,

    Returns an iterator adaptor that consumes elements while the given predicate is true, including the element for which the predicate -first returned false. Read more
    source§

    fn while_some<A>(self) -> WhileSome<Self> ⓘ
    where +first returned false. Read more

    source§

    fn while_some<A>(self) -> WhileSome<Self> ⓘ
    where Self: Sized + Iterator<Item = Option<A>>,

    Return an iterator adaptor that filters Option<A> iterator elements -and produces A. Stops on the first None encountered. Read more
    source§

    fn tuple_combinations<T>(self) -> TupleCombinations<Self, T> ⓘ
    where +and produces A. Stops on the first None encountered. Read more

    source§

    fn tuple_combinations<T>(self) -> TupleCombinations<Self, T> ⓘ
    where Self: Sized + Clone, Self::Item: Clone, T: HasCombination<Self>,

    Return an iterator adaptor that iterates over the combinations of the -elements from an iterator. Read more
    source§

    fn combinations(self, k: usize) -> Combinations<Self> ⓘ
    where +elements from an iterator. Read more

    source§

    fn combinations(self, k: usize) -> Combinations<Self> ⓘ
    where Self: Sized, Self::Item: Clone,

    Return an iterator adaptor that iterates over the k-length combinations of -the elements from an iterator. Read more
    source§

    fn combinations_with_replacement( +the elements from an iterator. Read more

    source§

    fn combinations_with_replacement( self, k: usize ) -> CombinationsWithReplacement<Self> ⓘ
    where Self: Sized, Self::Item: Clone,

    Return an iterator that iterates over the k-length combinations of -the elements from an iterator, with replacement. Read more
    source§

    fn permutations(self, k: usize) -> Permutations<Self> ⓘ
    where +the elements from an iterator, with replacement. Read more

    source§

    fn permutations(self, k: usize) -> Permutations<Self> ⓘ
    where Self: Sized, Self::Item: Clone,

    Return an iterator adaptor that iterates over all k-permutations of the -elements from an iterator. Read more
    source§

    fn powerset(self) -> Powerset<Self> ⓘ
    where +elements from an iterator. Read more

    source§

    fn powerset(self) -> Powerset<Self> ⓘ
    where Self: Sized, Self::Item: Clone,

    Return an iterator that iterates through the powerset of the elements from an -iterator. Read more
    source§

    fn pad_using<F>(self, min: usize, f: F) -> PadUsing<Self, F> ⓘ
    where +iterator. Read more

    source§

    fn pad_using<F>(self, min: usize, f: F) -> PadUsing<Self, F> ⓘ
    where Self: Sized, F: FnMut(usize) -> Self::Item,

    Return an iterator adaptor that pads the sequence to a minimum length of -min by filling missing elements using a closure f. Read more
    source§

    fn with_position(self) -> WithPosition<Self> ⓘ
    where +min by filling missing elements using a closure f. Read more

    source§

    fn with_position(self) -> WithPosition<Self> ⓘ
    where Self: Sized,

    Return an iterator adaptor that combines each element with a Position to -ease special-case handling of the first or last elements. Read more
    source§

    fn positions<P>(self, predicate: P) -> Positions<Self, P> ⓘ
    where +ease special-case handling of the first or last elements. Read more

    source§

    fn positions<P>(self, predicate: P) -> Positions<Self, P> ⓘ
    where Self: Sized, P: FnMut(Self::Item) -> bool,

    Return an iterator adaptor that yields the indices of all elements -satisfying a predicate, counted from the start of the iterator. Read more
    source§

    fn update<F>(self, updater: F) -> Update<Self, F> ⓘ
    where +satisfying a predicate, counted from the start of the iterator. Read more

    source§

    fn update<F>(self, updater: F) -> Update<Self, F> ⓘ
    where Self: Sized, F: FnMut(&mut Self::Item),

    Return an iterator adaptor that applies a mutating function -to each element before yielding it. Read more
    source§

    fn next_tuple<T>(&mut self) -> Option<T>
    where +to each element before yielding it. Read more

    source§

    fn next_tuple<T>(&mut self) -> Option<T>
    where Self: Sized + Iterator<Item = T::Item>, T: HomogeneousTuple,

    Advances the iterator and returns the next items grouped in a tuple of -a specific size (up to 12). Read more
    source§

    fn collect_tuple<T>(self) -> Option<T>
    where +a specific size (up to 12). Read more

    source§

    fn collect_tuple<T>(self) -> Option<T>
    where Self: Sized + Iterator<Item = T::Item>, T: HomogeneousTuple,

    Collects all items from the iterator into a tuple of a specific size -(up to 12). Read more
    source§

    fn find_position<P>(&mut self, pred: P) -> Option<(usize, Self::Item)>
    where - P: FnMut(&Self::Item) -> bool,

    Find the position and value of the first element satisfying a predicate. Read more
    source§

    fn find_or_last<P>(self, predicate: P) -> Option<Self::Item>
    where +(up to 12). Read more

    source§

    fn find_position<P>(&mut self, pred: P) -> Option<(usize, Self::Item)>
    where + P: FnMut(&Self::Item) -> bool,

    Find the position and value of the first element satisfying a predicate. Read more
    source§

    fn find_or_last<P>(self, predicate: P) -> Option<Self::Item>
    where Self: Sized, - P: FnMut(&Self::Item) -> bool,

    Find the value of the first element satisfying a predicate or return the last element, if any. Read more
    source§

    fn find_or_first<P>(self, predicate: P) -> Option<Self::Item>
    where + P: FnMut(&Self::Item) -> bool,

    Find the value of the first element satisfying a predicate or return the last element, if any. Read more
    source§

    fn find_or_first<P>(self, predicate: P) -> Option<Self::Item>
    where Self: Sized, - P: FnMut(&Self::Item) -> bool,

    Find the value of the first element satisfying a predicate or return the first element, if any. Read more
    source§

    fn contains<Q>(&mut self, query: &Q) -> bool
    where + P: FnMut(&Self::Item) -> bool,

    Find the value of the first element satisfying a predicate or return the first element, if any. Read more
    source§

    fn contains<Q>(&mut self, query: &Q) -> bool
    where Self: Sized, Self::Item: Borrow<Q>, - Q: PartialEq,

    Returns true if the given item is present in this iterator. Read more
    source§

    fn all_equal(&mut self) -> bool
    where + Q: PartialEq,

    Returns true if the given item is present in this iterator. Read more
    source§

    fn all_equal(&mut self) -> bool
    where Self: Sized, - Self::Item: PartialEq,

    Check whether all elements compare equal. Read more
    source§

    fn all_equal_value( + Self::Item: PartialEq,

    Check whether all elements compare equal. Read more
    source§

    fn all_equal_value( &mut self ) -> Result<Self::Item, Option<(Self::Item, Self::Item)>>
    where Self: Sized, Self::Item: PartialEq,

    If there are elements and they are all equal, return a single copy of that element. If there are no elements, return an Error containing None. If there are elements and they are not all equal, return a tuple containing the first -two non-equal elements found. Read more
    source§

    fn all_unique(&mut self) -> bool
    where +two non-equal elements found. Read more

    source§

    fn all_unique(&mut self) -> bool
    where Self: Sized, - Self::Item: Eq + Hash,

    Check whether all elements are unique (non equal). Read more
    source§

    fn dropping(self, n: usize) -> Self
    where + Self::Item: Eq + Hash,

    Check whether all elements are unique (non equal). Read more
    source§

    fn dropping(self, n: usize) -> Self
    where Self: Sized,

    Consume the first n elements from the iterator eagerly, -and return the same iterator again. Read more
    source§

    fn dropping_back(self, n: usize) -> Self
    where +and return the same iterator again. Read more

    source§

    fn dropping_back(self, n: usize) -> Self
    where Self: Sized + DoubleEndedIterator,

    Consume the last n elements from the iterator eagerly, -and return the same iterator again. Read more
    source§

    fn foreach<F>(self, f: F)
    where - F: FnMut(Self::Item), - Self: Sized,

    👎Deprecated since 0.8.0: Use .for_each() instead
    Run the closure f eagerly on each element of the iterator. Read more
    source§

    fn concat(self) -> Self::Item
    where +and return the same iterator again. Read more

    source§

    fn concat(self) -> Self::Item
    where Self: Sized, - Self::Item: Extend<<<Self as Iterator>::Item as IntoIterator>::Item> + IntoIterator + Default,

    Combine all an iterator’s elements into one element by using Extend. Read more
    source§

    fn collect_vec(self) -> Vec<Self::Item>
    where + Self::Item: Extend<<<Self as Iterator>::Item as IntoIterator>::Item> + IntoIterator + Default,

    Combine all an iterator’s elements into one element by using Extend. Read more
    source§

    fn collect_vec(self) -> Vec<Self::Item>
    where Self: Sized,

    .collect_vec() is simply a type specialization of Iterator::collect, -for convenience.
    source§

    fn try_collect<T, U, E>(self) -> Result<U, E>
    where +for convenience.

    source§

    fn try_collect<T, U, E>(self) -> Result<U, E>
    where Self: Sized + Iterator<Item = Result<T, E>>, Result<U, E>: FromIterator<Result<T, E>>,

    .try_collect() is more convenient way of writing -.collect::<Result<_, _>>() Read more
    source§

    fn set_from<'a, A: 'a, J>(&mut self, from: J) -> usize
    where +.collect::<Result<_, _>>() Read more

    source§

    fn set_from<'a, A: 'a, J>(&mut self, from: J) -> usize
    where Self: Iterator<Item = &'a mut A>, J: IntoIterator<Item = A>,

    Assign to each reference in self from the from iterator, -stopping at the shortest of the two iterators. Read more
    source§

    fn join(&mut self, sep: &str) -> String
    where - Self::Item: Display,

    Combine all iterator elements into one String, separated by sep. Read more
    source§

    fn format(self, sep: &str) -> Format<'_, Self>
    where - Self: Sized,

    Format all iterator elements, separated by sep. Read more
    source§

    fn format_with<F>(self, sep: &str, format: F) -> FormatWith<'_, Self, F>
    where +stopping at the shortest of the two iterators. Read more

    source§

    fn join(&mut self, sep: &str) -> String
    where + Self::Item: Display,

    Combine all iterator elements into one String, separated by sep. Read more
    source§

    fn format(self, sep: &str) -> Format<'_, Self>
    where + Self: Sized,

    Format all iterator elements, separated by sep. Read more
    source§

    fn format_with<F>(self, sep: &str, format: F) -> FormatWith<'_, Self, F>
    where Self: Sized, - F: FnMut(Self::Item, &mut dyn FnMut(&dyn Display) -> Result) -> Result,

    Format all iterator elements, separated by sep. Read more
    source§

    fn fold_results<A, E, B, F>(&mut self, start: B, f: F) -> Result<B, E>
    where + F: FnMut(Self::Item, &mut dyn FnMut(&dyn Display) -> Result) -> Result,

    Format all iterator elements, separated by sep. Read more
    source§

    fn fold_ok<A, E, B, F>(&mut self, start: B, f: F) -> Result<B, E>
    where Self: Iterator<Item = Result<A, E>>, - F: FnMut(B, A) -> B,

    👎Deprecated since 0.10.0: Use .fold_ok() instead
    See .fold_ok().
    source§

    fn fold_ok<A, E, B, F>(&mut self, start: B, f: F) -> Result<B, E>
    where - Self: Iterator<Item = Result<A, E>>, - F: FnMut(B, A) -> B,

    Fold Result values from an iterator. Read more
    source§

    fn fold_options<A, B, F>(&mut self, start: B, f: F) -> Option<B>
    where + F: FnMut(B, A) -> B,

    Fold Result values from an iterator. Read more
    source§

    fn fold_options<A, B, F>(&mut self, start: B, f: F) -> Option<B>
    where Self: Iterator<Item = Option<A>>, - F: FnMut(B, A) -> B,

    Fold Option values from an iterator. Read more
    source§

    fn fold1<F>(self, f: F) -> Option<Self::Item>
    where + F: FnMut(B, A) -> B,

    Fold Option values from an iterator. Read more
    source§

    fn fold1<F>(self, f: F) -> Option<Self::Item>
    where F: FnMut(Self::Item, Self::Item) -> Self::Item, - Self: Sized,

    👎Deprecated since 0.10.2: Use Iterator::reduce instead
    Accumulator of the elements in the iterator. Read more
    source§

    fn tree_fold1<F>(self, f: F) -> Option<Self::Item>
    where + Self: Sized,

    👎Deprecated since 0.10.2: Use Iterator::reduce instead
    Accumulator of the elements in the iterator. Read more
    source§

    fn tree_reduce<F>(self, f: F) -> Option<Self::Item>
    where F: FnMut(Self::Item, Self::Item) -> Self::Item, - Self: Sized,

    Accumulate the elements in the iterator in a tree-like manner. Read more
    source§

    fn fold_while<B, F>(&mut self, init: B, f: F) -> FoldWhile<B>
    where + Self: Sized,

    Accumulate the elements in the iterator in a tree-like manner. Read more
    source§

    fn tree_fold1<F>(self, f: F) -> Option<Self::Item>
    where + F: FnMut(Self::Item, Self::Item) -> Self::Item, + Self: Sized,

    👎Deprecated since 0.13.0: Use .tree_reduce() instead
    See .tree_reduce().
    source§

    fn fold_while<B, F>(&mut self, init: B, f: F) -> FoldWhile<B>
    where Self: Sized, - F: FnMut(B, Self::Item) -> FoldWhile<B>,

    An iterator method that applies a function, producing a single, final value. Read more
    source§

    fn sum1<S>(self) -> Option<S>
    where + F: FnMut(B, Self::Item) -> FoldWhile<B>,

    An iterator method that applies a function, producing a single, final value. Read more
    source§

    fn sum1<S>(self) -> Option<S>
    where Self: Sized, - S: Sum<Self::Item>,

    Iterate over the entire iterator and add all the elements. Read more
    source§

    fn product1<P>(self) -> Option<P>
    where + S: Sum<Self::Item>,

    Iterate over the entire iterator and add all the elements. Read more
    source§

    fn product1<P>(self) -> Option<P>
    where Self: Sized, - P: Product<Self::Item>,

    Iterate over the entire iterator and multiply all the elements. Read more
    source§

    fn sorted_unstable(self) -> IntoIter<Self::Item> ⓘ
    where + P: Product<Self::Item>,

    Iterate over the entire iterator and multiply all the elements. Read more
    source§

    fn sorted_unstable(self) -> IntoIter<Self::Item> ⓘ
    where Self: Sized, - Self::Item: Ord,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_unstable_by<F>(self, cmp: F) -> IntoIter<Self::Item> ⓘ
    where + Self::Item: Ord,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_unstable_by<F>(self, cmp: F) -> IntoIter<Self::Item> ⓘ
    where Self: Sized, - F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_unstable_by_key<K, F>(self, f: F) -> IntoIter<Self::Item> ⓘ
    where + F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_unstable_by_key<K, F>(self, f: F) -> IntoIter<Self::Item> ⓘ
    where Self: Sized, K: Ord, - F: FnMut(&Self::Item) -> K,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted(self) -> IntoIter<Self::Item> ⓘ
    where + F: FnMut(&Self::Item) -> K,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted(self) -> IntoIter<Self::Item> ⓘ
    where Self: Sized, - Self::Item: Ord,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_by<F>(self, cmp: F) -> IntoIter<Self::Item> ⓘ
    where + Self::Item: Ord,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_by<F>(self, cmp: F) -> IntoIter<Self::Item> ⓘ
    where Self: Sized, - F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_by_key<K, F>(self, f: F) -> IntoIter<Self::Item> ⓘ
    where + F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_by_key<K, F>(self, f: F) -> IntoIter<Self::Item> ⓘ
    where Self: Sized, K: Ord, - F: FnMut(&Self::Item) -> K,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_by_cached_key<K, F>(self, f: F) -> IntoIter<Self::Item> ⓘ
    where + F: FnMut(&Self::Item) -> K,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_by_cached_key<K, F>(self, f: F) -> IntoIter<Self::Item> ⓘ
    where Self: Sized, K: Ord, F: FnMut(&Self::Item) -> K,

    Sort all iterator elements into a new iterator in ascending order. The key function is -called exactly once per key. Read more
    source§

    fn k_smallest(self, k: usize) -> IntoIter<Self::Item> ⓘ
    where +called exactly once per key. Read more

    source§

    fn k_smallest(self, k: usize) -> IntoIter<Self::Item> ⓘ
    where Self: Sized, - Self::Item: Ord,

    Sort the k smallest elements into a new iterator, in ascending order. Read more
    source§

    fn partition_map<A, B, F, L, R>(self, predicate: F) -> (A, B)
    where + Self::Item: Ord,

    Sort the k smallest elements into a new iterator, in ascending order. Read more
    source§

    fn k_smallest_by<F>(self, k: usize, cmp: F) -> IntoIter<Self::Item> ⓘ
    where + Self: Sized, + F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Sort the k smallest elements into a new iterator using the provided comparison. Read more
    source§

    fn k_smallest_by_key<F, K>(self, k: usize, key: F) -> IntoIter<Self::Item> ⓘ
    where + Self: Sized, + F: FnMut(&Self::Item) -> K, + K: Ord,

    Return the elements producing the k smallest outputs of the provided function. Read more
    source§

    fn k_largest(self, k: usize) -> IntoIter<Self::Item> ⓘ
    where + Self: Sized, + Self::Item: Ord,

    Sort the k largest elements into a new iterator, in descending order. Read more
    source§

    fn k_largest_by<F>(self, k: usize, cmp: F) -> IntoIter<Self::Item> ⓘ
    where + Self: Sized, + F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Sort the k largest elements into a new iterator using the provided comparison. Read more
    source§

    fn k_largest_by_key<F, K>(self, k: usize, key: F) -> IntoIter<Self::Item> ⓘ
    where + Self: Sized, + F: FnMut(&Self::Item) -> K, + K: Ord,

    Return the elements producing the k largest outputs of the provided function. Read more
    source§

    fn tail(self, n: usize) -> IntoIter<Self::Item> ⓘ
    where + Self: Sized,

    Consumes the iterator and return an iterator of the last n elements. Read more
    source§

    fn partition_map<A, B, F, L, R>(self, predicate: F) -> (A, B)
    where Self: Sized, F: FnMut(Self::Item) -> Either<L, R>, A: Default + Extend<L>, B: Default + Extend<R>,

    Collect all iterator elements into one of two partitions. Unlike Iterator::partition, each partition may -have a distinct type. Read more
    source§

    fn partition_result<A, B, T, E>(self) -> (A, B)
    where +have a distinct type. Read more

    source§

    fn partition_result<A, B, T, E>(self) -> (A, B)
    where Self: Iterator<Item = Result<T, E>> + Sized, A: Default + Extend<T>, B: Default + Extend<E>,

    Partition a sequence of Results into one list of all the Ok elements -and another list of all the Err elements. Read more
    source§

    fn into_group_map<K, V>(self) -> HashMap<K, Vec<V>>
    where +and another list of all the Err elements. Read more

    source§

    fn into_group_map<K, V>(self) -> HashMap<K, Vec<V>>
    where Self: Iterator<Item = (K, V)> + Sized, K: Hash + Eq,

    Return a HashMap of keys mapped to Vecs of values. Keys and values -are taken from (Key, Value) tuple pairs yielded by the input iterator. Read more
    source§

    fn into_group_map_by<K, V, F>(self, f: F) -> HashMap<K, Vec<V>>
    where +are taken from (Key, Value) tuple pairs yielded by the input iterator. Read more

    source§

    fn into_group_map_by<K, V, F>(self, f: F) -> HashMap<K, Vec<V>>
    where Self: Iterator<Item = V> + Sized, K: Hash + Eq, - F: Fn(&V) -> K,

    Return an Iterator on a HashMap. Keys mapped to Vecs of values. The key is specified -in the closure. Read more
    source§

    fn into_grouping_map<K, V>(self) -> GroupingMap<Self>
    where + F: FnMut(&V) -> K,

    Return an Iterator on a HashMap. Keys mapped to Vecs of values. The key is specified +in the closure. Read more
    source§

    fn into_grouping_map<K, V>(self) -> GroupingMap<Self>
    where Self: Iterator<Item = (K, V)> + Sized, K: Hash + Eq,

    Constructs a GroupingMap to be used later with one of the efficient -group-and-fold operations it allows to perform. Read more
    source§

    fn into_grouping_map_by<K, V, F>(self, key_mapper: F) -> GroupingMapBy<Self, F>
    where +group-and-fold operations it allows to perform. Read more

    source§

    fn into_grouping_map_by<K, V, F>(self, key_mapper: F) -> GroupingMapBy<Self, F>
    where Self: Iterator<Item = V> + Sized, K: Hash + Eq, F: FnMut(&V) -> K,

    Constructs a GroupingMap to be used later with one of the efficient -group-and-fold operations it allows to perform. Read more
    source§

    fn min_set(self) -> Vec<Self::Item>
    where +group-and-fold operations it allows to perform. Read more

    source§

    fn min_set(self) -> Vec<Self::Item>
    where Self: Sized, - Self::Item: Ord,

    Return all minimum elements of an iterator. Read more
    source§

    fn min_set_by<F>(self, compare: F) -> Vec<Self::Item>
    where + Self::Item: Ord,

    Return all minimum elements of an iterator. Read more
    source§

    fn min_set_by<F>(self, compare: F) -> Vec<Self::Item>
    where Self: Sized, F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Return all minimum elements of an iterator, as determined by -the specified function. Read more
    source§

    fn min_set_by_key<K, F>(self, key: F) -> Vec<Self::Item>
    where +the specified function. Read more

    source§

    fn min_set_by_key<K, F>(self, key: F) -> Vec<Self::Item>
    where Self: Sized, K: Ord, F: FnMut(&Self::Item) -> K,

    Return all minimum elements of an iterator, as determined by -the specified function. Read more
    source§

    fn max_set(self) -> Vec<Self::Item>
    where +the specified function. Read more

    source§

    fn max_set(self) -> Vec<Self::Item>
    where Self: Sized, - Self::Item: Ord,

    Return all maximum elements of an iterator. Read more
    source§

    fn max_set_by<F>(self, compare: F) -> Vec<Self::Item>
    where + Self::Item: Ord,

    Return all maximum elements of an iterator. Read more
    source§

    fn max_set_by<F>(self, compare: F) -> Vec<Self::Item>
    where Self: Sized, F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Return all maximum elements of an iterator, as determined by -the specified function. Read more
    source§

    fn max_set_by_key<K, F>(self, key: F) -> Vec<Self::Item>
    where +the specified function. Read more

    source§

    fn max_set_by_key<K, F>(self, key: F) -> Vec<Self::Item>
    where Self: Sized, K: Ord, F: FnMut(&Self::Item) -> K,

    Return all maximum elements of an iterator, as determined by -the specified function. Read more
    source§

    fn minmax(self) -> MinMaxResult<Self::Item>
    where +the specified function. Read more

    source§

    fn minmax(self) -> MinMaxResult<Self::Item>
    where Self: Sized, - Self::Item: PartialOrd,

    Return the minimum and maximum elements in the iterator. Read more
    source§

    fn minmax_by_key<K, F>(self, key: F) -> MinMaxResult<Self::Item>
    where + Self::Item: PartialOrd,

    Return the minimum and maximum elements in the iterator. Read more
    source§

    fn minmax_by_key<K, F>(self, key: F) -> MinMaxResult<Self::Item>
    where Self: Sized, K: PartialOrd, F: FnMut(&Self::Item) -> K,

    Return the minimum and maximum element of an iterator, as determined by -the specified function. Read more
    source§

    fn minmax_by<F>(self, compare: F) -> MinMaxResult<Self::Item>
    where +the specified function. Read more

    source§

    fn minmax_by<F>(self, compare: F) -> MinMaxResult<Self::Item>
    where Self: Sized, F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Return the minimum and maximum element of an iterator, as determined by -the specified comparison function. Read more
    source§

    fn position_max(self) -> Option<usize>
    where +the specified comparison function. Read more

    source§

    fn position_max(self) -> Option<usize>
    where Self: Sized, - Self::Item: Ord,

    Return the position of the maximum element in the iterator. Read more
    source§

    fn position_max_by_key<K, F>(self, key: F) -> Option<usize>
    where + Self::Item: Ord,

    Return the position of the maximum element in the iterator. Read more
    source§

    fn position_max_by_key<K, F>(self, key: F) -> Option<usize>
    where Self: Sized, K: Ord, F: FnMut(&Self::Item) -> K,

    Return the position of the maximum element in the iterator, as -determined by the specified function. Read more
    source§

    fn position_max_by<F>(self, compare: F) -> Option<usize>
    where +determined by the specified function. Read more

    source§

    fn position_max_by<F>(self, compare: F) -> Option<usize>
    where Self: Sized, F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Return the position of the maximum element in the iterator, as -determined by the specified comparison function. Read more
    source§

    fn position_min(self) -> Option<usize>
    where +determined by the specified comparison function. Read more

    source§

    fn position_min(self) -> Option<usize>
    where Self: Sized, - Self::Item: Ord,

    Return the position of the minimum element in the iterator. Read more
    source§

    fn position_min_by_key<K, F>(self, key: F) -> Option<usize>
    where + Self::Item: Ord,

    Return the position of the minimum element in the iterator. Read more
    source§

    fn position_min_by_key<K, F>(self, key: F) -> Option<usize>
    where Self: Sized, K: Ord, F: FnMut(&Self::Item) -> K,

    Return the position of the minimum element in the iterator, as -determined by the specified function. Read more
    source§

    fn position_min_by<F>(self, compare: F) -> Option<usize>
    where +determined by the specified function. Read more

    source§

    fn position_min_by<F>(self, compare: F) -> Option<usize>
    where Self: Sized, F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Return the position of the minimum element in the iterator, as -determined by the specified comparison function. Read more
    source§

    fn position_minmax(self) -> MinMaxResult<usize>
    where +determined by the specified comparison function. Read more

    source§

    fn position_minmax(self) -> MinMaxResult<usize>
    where Self: Sized, Self::Item: PartialOrd,

    Return the positions of the minimum and maximum elements in -the iterator. Read more
    source§

    fn position_minmax_by_key<K, F>(self, key: F) -> MinMaxResult<usize>
    where +the iterator. Read more

    source§

    fn position_minmax_by_key<K, F>(self, key: F) -> MinMaxResult<usize>
    where Self: Sized, K: PartialOrd, F: FnMut(&Self::Item) -> K,

    Return the postions of the minimum and maximum elements of an -iterator, as determined by the specified function. Read more
    source§

    fn position_minmax_by<F>(self, compare: F) -> MinMaxResult<usize>
    where +iterator, as determined by the specified function. Read more

    source§

    fn position_minmax_by<F>(self, compare: F) -> MinMaxResult<usize>
    where Self: Sized, F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Return the postions of the minimum and maximum elements of an -iterator, as determined by the specified comparison function. Read more
    source§

    fn exactly_one(self) -> Result<Self::Item, ExactlyOneError<Self>>
    where +iterator, as determined by the specified comparison function. Read more

    source§

    fn exactly_one(self) -> Result<Self::Item, ExactlyOneError<Self>>
    where Self: Sized,

    If the iterator yields exactly one element, that element will be returned, otherwise an error will be returned containing an iterator that has the same output as the input -iterator. Read more
    source§

    fn at_most_one(self) -> Result<Option<Self::Item>, ExactlyOneError<Self>>
    where - Self: Sized,

    If the iterator yields no elements, Ok(None) will be returned. If the iterator yields +iterator. Read more
    source§

    fn at_most_one(self) -> Result<Option<Self::Item>, ExactlyOneError<Self>>
    where + Self: Sized,

    If the iterator yields no elements, Ok(None) will be returned. If the iterator yields exactly one element, that element will be returned, otherwise an error will be returned -containing an iterator that has the same output as the input iterator. Read more
    source§

    fn multipeek(self) -> MultiPeek<Self> ⓘ
    where +containing an iterator that has the same output as the input iterator. Read more

    source§

    fn multipeek(self) -> MultiPeek<Self> ⓘ
    where Self: Sized,

    An iterator adaptor that allows the user to peek at multiple .next() -values without advancing the base iterator. Read more
    source§

    fn counts(self) -> HashMap<Self::Item, usize>
    where +values without advancing the base iterator. Read more

    source§

    fn counts(self) -> HashMap<Self::Item, usize>
    where Self: Sized, Self::Item: Eq + Hash,

    Collect the items in this iterator and return a HashMap which contains each item that appears in the iterator and the number -of times it appears. Read more
    source§

    fn counts_by<K, F>(self, f: F) -> HashMap<K, usize>
    where +of times it appears. Read more

    source§

    fn counts_by<K, F>(self, f: F) -> HashMap<K, usize>
    where Self: Sized, K: Eq + Hash, F: FnMut(Self::Item) -> K,

    Collect the items in this iterator and return a HashMap which contains each item that appears in the iterator and the number of times it appears, -determining identity using a keying function. Read more
    source§

    fn multiunzip<FromI>(self) -> FromI
    where - Self: Sized + MultiUnzip<FromI>,

    Converts an iterator of tuples into a tuple of containers. Read more
    source§

    fn try_len(&self) -> Result<usize, (usize, Option<usize>)>

    Returns the length of the iterator if one exists. +determining identity using a keying function. Read more
    source§

    fn multiunzip<FromI>(self) -> FromI
    where + Self: Sized + MultiUnzip<FromI>,

    Converts an iterator of tuples into a tuple of containers. Read more
    source§

    fn try_len(&self) -> Result<usize, (usize, Option<usize>)>

    Returns the length of the iterator if one exists. Otherwise return self.size_hint(). Read more
    source§

    impl<T> 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 + 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/itertools/structs/struct.ConsTuples.html b/itertools/structs/struct.ConsTuples.html index 583cd54b2..415d07738 100644 --- a/itertools/structs/struct.ConsTuples.html +++ b/itertools/structs/struct.ConsTuples.html @@ -1,820 +1,12 @@ -ConsTuples in itertools::structs - Rust
    -

    Struct itertools::structs::ConsTuples

    source · 
    pub struct ConsTuples<I, J>
    where
+ConsTuples in itertools::structs - Rust
    
+    
    Struct itertools::structs::ConsTuples
    source · 
    pub struct ConsTuples<I, J>
    where
     I: Iterator<Item = J>,
    { /* private fields */ }
    Expand description
    An iterator that maps an iterator of tuples like
 ((A, B), C) to an iterator of (A, B, C).
    
 
    Used by the iproduct!() macro.
    
-
    Trait Implementations§
    source§
    impl<I, J> Clone for ConsTuples<I, J>
    where
-    I: Clone + Iterator<Item = J>,
    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<I, J: Debug> Debug for ConsTuples<I, J>
    where
-    I: Iterator<Item = J> + Debug,
    source§
    fn fmt(&self, f: &mut Formatter<'_>) -> Result
    Formats the value using the given formatter. Read more
    source§
    impl<X, Iter, B, C, D, E, F, G, H, I, J, K, L> DoubleEndedIterator for ConsTuples<Iter, ((B, C, D, E, F, G, H, I, J, K, L), X)>
    where
-    Iter: DoubleEndedIterator<Item = ((B, C, D, E, F, G, H, I, J, K, L), X)>,
    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<X, Iter, C, D, E, F, G, H, I, J, K, L> DoubleEndedIterator for ConsTuples<Iter, ((C, D, E, F, G, H, I, J, K, L), X)>
    where
-    Iter: DoubleEndedIterator<Item = ((C, D, E, F, G, H, I, J, K, L), X)>,
    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<X, Iter, D, E, F, G, H, I, J, K, L> DoubleEndedIterator for ConsTuples<Iter, ((D, E, F, G, H, I, J, K, L), X)>
    where
-    Iter: DoubleEndedIterator<Item = ((D, E, F, G, H, I, J, K, L), X)>,
    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<X, Iter, E, F, G, H, I, J, K, L> DoubleEndedIterator for ConsTuples<Iter, ((E, F, G, H, I, J, K, L), X)>
    where
-    Iter: DoubleEndedIterator<Item = ((E, F, G, H, I, J, K, L), X)>,
    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<X, Iter, F, G, H, I, J, K, L> DoubleEndedIterator for ConsTuples<Iter, ((F, G, H, I, J, K, L), X)>
    where
-    Iter: DoubleEndedIterator<Item = ((F, G, H, I, J, K, L), X)>,
    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<X, Iter, G, H, I, J, K, L> DoubleEndedIterator for ConsTuples<Iter, ((G, H, I, J, K, L), X)>
    where
-    Iter: DoubleEndedIterator<Item = ((G, H, I, J, K, L), X)>,
    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<X, Iter, H, I, J, K, L> DoubleEndedIterator for ConsTuples<Iter, ((H, I, J, K, L), X)>
    where
-    Iter: DoubleEndedIterator<Item = ((H, I, J, K, L), X)>,
    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<X, Iter, I, J, K, L> DoubleEndedIterator for ConsTuples<Iter, ((I, J, K, L), X)>
    where
-    Iter: DoubleEndedIterator<Item = ((I, J, K, L), X)>,
    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<X, Iter, J, K, L> DoubleEndedIterator for ConsTuples<Iter, ((J, K, L), X)>
    where
-    Iter: DoubleEndedIterator<Item = ((J, K, L), X)>,
    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<X, Iter, K, L> DoubleEndedIterator for ConsTuples<Iter, ((K, L), X)>
    where
-    Iter: DoubleEndedIterator<Item = ((K, L), X)>,
    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<X, Iter, B, C, D, E, F, G, H, I, J, K, L> Iterator for ConsTuples<Iter, ((B, C, D, E, F, G, H, I, J, K, L), X)>
    where
-    Iter: Iterator<Item = ((B, C, D, E, F, G, H, I, J, K, L), X)>,
    §
    type Item = (B, C, D, E, F, G, H, I, J, K, L, X)
    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<Acc, Fold>(self, accum: Acc, f: Fold) -> Acc
    where
-    Fold: FnMut(Acc, Self::Item) -> Acc,
    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<X, Iter, C, D, E, F, G, H, I, J, K, L> Iterator for ConsTuples<Iter, ((C, D, E, F, G, H, I, J, K, L), X)>
    where
-    Iter: Iterator<Item = ((C, D, E, F, G, H, I, J, K, L), X)>,
    §
    type Item = (C, D, E, F, G, H, I, J, K, L, X)
    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<Acc, Fold>(self, accum: Acc, f: Fold) -> Acc
    where
-    Fold: FnMut(Acc, Self::Item) -> Acc,
    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<X, Iter, D, E, F, G, H, I, J, K, L> Iterator for ConsTuples<Iter, ((D, E, F, G, H, I, J, K, L), X)>
    where
-    Iter: Iterator<Item = ((D, E, F, G, H, I, J, K, L), X)>,
    §
    type Item = (D, E, F, G, H, I, J, K, L, X)
    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<Acc, Fold>(self, accum: Acc, f: Fold) -> Acc
    where
-    Fold: FnMut(Acc, Self::Item) -> Acc,
    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<X, Iter, E, F, G, H, I, J, K, L> Iterator for ConsTuples<Iter, ((E, F, G, H, I, J, K, L), X)>
    where
-    Iter: Iterator<Item = ((E, F, G, H, I, J, K, L), X)>,
    §
    type Item = (E, F, G, H, I, J, K, L, X)
    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<Acc, Fold>(self, accum: Acc, f: Fold) -> Acc
    where
-    Fold: FnMut(Acc, Self::Item) -> Acc,
    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<X, Iter, F, G, H, I, J, K, L> Iterator for ConsTuples<Iter, ((F, G, H, I, J, K, L), X)>
    where
-    Iter: Iterator<Item = ((F, G, H, I, J, K, L), X)>,
    §
    type Item = (F, G, H, I, J, K, L, X)
    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<Acc, Fold>(self, accum: Acc, f: Fold) -> Acc
    where
+
    Trait Implementations§
    source§
    impl<I, J> Clone for ConsTuples<I, J>
    where
+    I: Clone + Iterator<Item = J>,
    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<I, J: Debug> Debug for ConsTuples<I, J>
    where
+    I: Iterator<Item = J> + Debug,
    source§
    fn fmt(&self, f: &mut Formatter<'_>) -> Result
    Formats the value using the given formatter. Read more
    source§
    impl<X, Iter, B, C, D, E, F, G, H, I, J, K, L> Iterator for ConsTuples<Iter, ((B, C, D, E, F, G, H, I, J, K, L), X)>
    where
+    Iter: Iterator<Item = ((B, C, D, E, F, G, H, I, J, K, L), X)>,
    §
    type Item = (B, C, D, E, F, G, H, I, J, K, L, X)
    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<Acc, Fold>(self, accum: Acc, f: Fold) -> Acc
    where
     Fold: FnMut(Acc, Self::Item) -> Acc,
    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
@@ -990,83 +182,83 @@ greater than or equal to those of another. 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<X, Iter, G, H, I, J, K, L> Iterator for ConsTuples<Iter, ((G, H, I, J, K, L), X)>
    where
-    Iter: Iterator<Item = ((G, H, I, J, K, L), X)>,
    §
    type Item = (G, H, I, J, K, L, X)
    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<Acc, Fold>(self, accum: Acc, f: Fold) -> Acc
    where
+function. Read more
    source§
    impl<X, Iter, C, D, E, F, G, H, I, J, K, L> Iterator for ConsTuples<Iter, ((C, D, E, F, G, H, I, J, K, L), X)>
    where
+    Iter: Iterator<Item = ((C, D, E, F, G, H, I, J, K, L), X)>,
    §
    type Item = (C, D, E, F, G, H, I, J, K, L, X)
    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<Acc, Fold>(self, accum: Acc, f: Fold) -> Acc
    where
     Fold: FnMut(Acc, Self::Item) -> Acc,
    Folds every element into an accumulator by applying an operation,
-returning the final result. Read more
    source§
    fn next_chunk<const N: usize>(
+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,
    🔬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
+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
+    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
+    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
+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
+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
+    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
+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
+    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
+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
+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
+    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
+    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
+    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
+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
+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
+    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
+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
+    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
+    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,
    🔬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
+    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
+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
+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
+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>(
+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
@@ -1074,16 +266,16 @@ operation. 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
+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
+    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
+    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
+    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>(
+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 @@ -1091,159 +283,159 @@ the first non-none result. 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 +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 + 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 +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 +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 +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 +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 + 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 + 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 + 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 + 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 + 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 +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 +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 +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 +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 +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 +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 +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 +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 +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 +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 + 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<X, Iter, H, I, J, K, L> Iterator for ConsTuples<Iter, ((H, I, J, K, L), X)>
    where - Iter: Iterator<Item = ((H, I, J, K, L), X)>,

    §

    type Item = (H, I, J, K, L, X)

    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<Acc, Fold>(self, accum: Acc, f: Fold) -> Acc
    where +function. Read more

    source§

    impl<X, Iter, D, E, F, G, H, I, J, K, L> Iterator for ConsTuples<Iter, ((D, E, F, G, H, I, J, K, L), X)>
    where + Iter: Iterator<Item = ((D, E, F, G, H, I, J, K, L), X)>,

    §

    type Item = (D, E, F, G, H, I, J, K, L, X)

    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<Acc, Fold>(self, accum: Acc, f: Fold) -> Acc
    where Fold: FnMut(Acc, Self::Item) -> Acc,

    Folds every element into an accumulator by applying an operation, -returning the final result. Read more
    source§

    fn next_chunk<const N: usize>( +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,

    🔬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 +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 + 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 + 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 +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 +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 + 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 +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 + 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 +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 +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 + 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 + 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 + 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 +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 +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 + 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 +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 + 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 + 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,

    🔬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 + 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 +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 +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 +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>( +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 @@ -1251,16 +443,16 @@ operation. 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 +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 + 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 + 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 + 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>( +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 @@ -1268,84 +460,84 @@ the first non-none result. 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 +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 + 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 +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 +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 +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 +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 + 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 + 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 + 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 + 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 + 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 +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 +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 +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 +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 +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 +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 +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 +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 +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 +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 + 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<X, Iter, I, J, K, L> Iterator for ConsTuples<Iter, ((I, J, K, L), X)>
    where - Iter: Iterator<Item = ((I, J, K, L), X)>,

    §

    type Item = (I, J, K, L, X)

    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<Acc, Fold>(self, accum: Acc, f: Fold) -> Acc
    where +function. Read more

    source§

    impl<X, Iter, E, F, G, H, I, J, K, L> Iterator for ConsTuples<Iter, ((E, F, G, H, I, J, K, L), X)>
    where + Iter: Iterator<Item = ((E, F, G, H, I, J, K, L), X)>,

    §

    type Item = (E, F, G, H, I, J, K, L, X)

    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<Acc, Fold>(self, accum: Acc, f: Fold) -> Acc
    where Fold: FnMut(Acc, Self::Item) -> Acc,

    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 @@ -1521,8 +713,185 @@ greater than or equal to those of another. 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<X, Iter, J, K, L> Iterator for ConsTuples<Iter, ((J, K, L), X)>
    where - Iter: Iterator<Item = ((J, K, L), X)>,

    §

    type Item = (J, K, L, X)

    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<Acc, Fold>(self, accum: Acc, f: Fold) -> Acc
    where +function. Read more

    source§

    impl<X, Iter, F, G, H, I, J, K, L> Iterator for ConsTuples<Iter, ((F, G, H, I, J, K, L), X)>
    where + Iter: Iterator<Item = ((F, G, H, I, J, K, L), X)>,

    §

    type Item = (F, G, H, I, J, K, L, X)

    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<Acc, Fold>(self, accum: Acc, f: Fold) -> Acc
    where + Fold: FnMut(Acc, Self::Item) -> Acc,

    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<X, Iter, G, H, I, J, K, L> Iterator for ConsTuples<Iter, ((G, H, I, J, K, L), X)>
    where + Iter: Iterator<Item = ((G, H, I, J, K, L), X)>,

    §

    type Item = (G, H, I, J, K, L, X)

    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<Acc, Fold>(self, accum: Acc, f: Fold) -> Acc
    where Fold: FnMut(Acc, Self::Item) -> Acc,

    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 @@ -1698,8 +1067,539 @@ greater than or equal to those of another. 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<X, Iter, K, L> Iterator for ConsTuples<Iter, ((K, L), X)>
    where - Iter: Iterator<Item = ((K, L), X)>,

    §

    type Item = (K, L, X)

    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<Acc, Fold>(self, accum: Acc, f: Fold) -> Acc
    where +function. Read more

    source§

    impl<X, Iter, H, I, J, K, L> Iterator for ConsTuples<Iter, ((H, I, J, K, L), X)>
    where + Iter: Iterator<Item = ((H, I, J, K, L), X)>,

    §

    type Item = (H, I, J, K, L, X)

    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<Acc, Fold>(self, accum: Acc, f: Fold) -> Acc
    where + Fold: FnMut(Acc, Self::Item) -> Acc,

    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<X, Iter, I, J, K, L> Iterator for ConsTuples<Iter, ((I, J, K, L), X)>
    where + Iter: Iterator<Item = ((I, J, K, L), X)>,

    §

    type Item = (I, J, K, L, X)

    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<Acc, Fold>(self, accum: Acc, f: Fold) -> Acc
    where + Fold: FnMut(Acc, Self::Item) -> Acc,

    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<X, Iter, J, K, L> Iterator for ConsTuples<Iter, ((J, K, L), X)>
    where + Iter: Iterator<Item = ((J, K, L), X)>,

    §

    type Item = (J, K, L, X)

    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<Acc, Fold>(self, accum: Acc, f: Fold) -> Acc
    where + Fold: FnMut(Acc, Self::Item) -> Acc,

    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<X, Iter, K, L> Iterator for ConsTuples<Iter, ((K, L), X)>
    where + Iter: Iterator<Item = ((K, L), X)>,

    §

    type Item = (K, L, X)

    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<Acc, Fold>(self, accum: Acc, f: Fold) -> Acc
    where Fold: FnMut(Acc, Self::Item) -> Acc,

    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 @@ -1897,86 +1797,87 @@ otherwise. Right variant of Either<Self, Self> otherwise. Read more

    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> Itertools for T
    where - T: Iterator + ?Sized,

    source§

    fn interleave<J>(self, other: J) -> Interleave<Self, J::IntoIter> ⓘ
    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> Itertools for T
    where + T: Iterator + ?Sized,

    source§

    fn interleave<J>(self, other: J) -> Interleave<Self, J::IntoIter> ⓘ
    where J: IntoIterator<Item = Self::Item>, - Self: Sized,

    Alternate elements from two iterators until both have run out. Read more
    source§

    fn interleave_shortest<J>( + Self: Sized,

    Alternate elements from two iterators until both have run out. Read more
    source§

    fn interleave_shortest<J>( self, other: J ) -> InterleaveShortest<Self, J::IntoIter> ⓘ
    where J: IntoIterator<Item = Self::Item>, Self: Sized,

    Alternate elements from two iterators until at least one of them has run -out. Read more
    source§

    fn intersperse(self, element: Self::Item) -> Intersperse<Self>
    where +out. Read more

    source§

    fn intersperse(self, element: Self::Item) -> Intersperse<Self>
    where Self: Sized, Self::Item: Clone,

    An iterator adaptor to insert a particular value -between each element of the adapted iterator. Read more
    source§

    fn intersperse_with<F>(self, element: F) -> IntersperseWith<Self, F> ⓘ
    where +between each element of the adapted iterator. Read more

    source§

    fn intersperse_with<F>(self, element: F) -> IntersperseWith<Self, F> ⓘ
    where Self: Sized, F: FnMut() -> Self::Item,

    An iterator adaptor to insert a particular value created by a function -between each element of the adapted iterator. Read more
    source§

    fn zip_longest<J>(self, other: J) -> ZipLongest<Self, J::IntoIter> ⓘ
    where +between each element of the adapted iterator. Read more

    source§

    fn get<R>(self, index: R) -> R::Output
    where + Self: Sized, + R: IteratorIndex<Self>,

    Returns an iterator over a subsection of the iterator. Read more
    source§

    fn zip_longest<J>(self, other: J) -> ZipLongest<Self, J::IntoIter> ⓘ
    where J: IntoIterator, Self: Sized,

    Create an iterator which iterates over both this and the specified -iterator simultaneously, yielding pairs of two optional elements. Read more
    source§

    fn zip_eq<J>(self, other: J) -> ZipEq<Self, J::IntoIter> ⓘ
    where +iterator simultaneously, yielding pairs of two optional elements. Read more

    source§

    fn zip_eq<J>(self, other: J) -> ZipEq<Self, J::IntoIter> ⓘ
    where J: IntoIterator, Self: Sized,

    Create an iterator which iterates over both this and the specified -iterator simultaneously, yielding pairs of elements. Read more
    source§

    fn batching<B, F>(self, f: F) -> Batching<Self, F> ⓘ
    where +iterator simultaneously, yielding pairs of elements. Read more

    source§

    fn batching<B, F>(self, f: F) -> Batching<Self, F> ⓘ
    where F: FnMut(&mut Self) -> Option<B>, Self: Sized,

    A “meta iterator adaptor”. Its closure receives a reference to the iterator and may pick off as many elements as it likes, to produce the -next iterator element. Read more
    source§

    fn group_by<K, F>(self, key: F) -> GroupBy<K, Self, F>
    where +next iterator element. Read more

    source§

    fn chunk_by<K, F>(self, key: F) -> ChunkBy<K, Self, F>
    where Self: Sized, F: FnMut(&Self::Item) -> K, K: PartialEq,

    Return an iterable that can group iterator elements. Consecutive elements that map to the same key (“runs”), are assigned -to the same group. Read more
    source§

    fn chunks(self, size: usize) -> IntoChunks<Self>
    where - Self: Sized,

    Return an iterable that can chunk the iterator. Read more
    source§

    fn tuple_windows<T>(self) -> TupleWindows<Self, T> ⓘ
    where +to the same group. Read more

    source§

    fn group_by<K, F>(self, key: F) -> ChunkBy<K, Self, F>
    where + Self: Sized, + F: FnMut(&Self::Item) -> K, + K: PartialEq,

    👎Deprecated since 0.13.0: Use .chunk_by() instead
    See .chunk_by().
    source§

    fn chunks(self, size: usize) -> IntoChunks<Self>
    where + Self: Sized,

    Return an iterable that can chunk the iterator. Read more
    source§

    fn tuple_windows<T>(self) -> TupleWindows<Self, T> ⓘ
    where Self: Sized + Iterator<Item = T::Item>, T: HomogeneousTuple, T::Item: Clone,

    Return an iterator over all contiguous windows producing tuples of -a specific size (up to 12). Read more
    source§

    fn circular_tuple_windows<T>(self) -> CircularTupleWindows<Self, T> ⓘ
    where +a specific size (up to 12). Read more

    source§

    fn circular_tuple_windows<T>(self) -> CircularTupleWindows<Self, T> ⓘ
    where Self: Sized + Clone + Iterator<Item = T::Item> + ExactSizeIterator, T: TupleCollect + Clone, T::Item: Clone,

    Return an iterator over all windows, wrapping back to the first elements when the window would otherwise exceed the length of the -iterator, producing tuples of a specific size (up to 12). Read more
    source§

    fn tuples<T>(self) -> Tuples<Self, T> ⓘ
    where +iterator, producing tuples of a specific size (up to 12). Read more

    source§

    fn tuples<T>(self) -> Tuples<Self, T> ⓘ
    where Self: Sized + Iterator<Item = T::Item>, T: HomogeneousTuple,

    Return an iterator that groups the items in tuples of a specific size -(up to 12). Read more
    source§

    fn tee(self) -> (Tee<Self>, Tee<Self>)
    where +(up to 12). Read more

    source§

    fn tee(self) -> (Tee<Self>, Tee<Self>)
    where Self: Sized, Self::Item: Clone,

    Split into an iterator pair that both yield all elements from -the original iterator. Read more
    source§

    fn step(self, n: usize) -> Step<Self> ⓘ
    where - Self: Sized,

    👎Deprecated since 0.8.0: Use std .step_by() instead
    Return an iterator adaptor that steps n elements in the base iterator -for each iteration. Read more
    source§

    fn map_into<R>(self) -> MapInto<Self, R>
    where +the original iterator. Read more

    source§

    fn map_into<R>(self) -> MapInto<Self, R>
    where Self: Sized, - Self::Item: Into<R>,

    Convert each item of the iterator using the Into trait. Read more
    source§

    fn map_results<F, T, U, E>(self, f: F) -> MapOk<Self, F>
    where - Self: Iterator<Item = Result<T, E>> + Sized, - F: FnMut(T) -> U,

    👎Deprecated since 0.10.0: Use .map_ok() instead
    See .map_ok().
    source§

    fn map_ok<F, T, U, E>(self, f: F) -> MapOk<Self, F>
    where + Self::Item: Into<R>,

    Convert each item of the iterator using the Into trait. Read more
    source§

    fn map_ok<F, T, U, E>(self, f: F) -> MapOk<Self, F>
    where Self: Iterator<Item = Result<T, E>> + Sized, F: FnMut(T) -> U,

    Return an iterator adaptor that applies the provided closure to every Result::Ok value. Result::Err values are -unchanged. Read more
    source§

    fn filter_ok<F, T, E>(self, f: F) -> FilterOk<Self, F> ⓘ
    where +unchanged. Read more

    source§

    fn filter_ok<F, T, E>(self, f: F) -> FilterOk<Self, F> ⓘ
    where Self: Iterator<Item = Result<T, E>> + Sized, F: FnMut(&T) -> bool,

    Return an iterator adaptor that filters every Result::Ok value with the provided closure. Result::Err values are -unchanged. Read more
    source§

    fn filter_map_ok<F, T, U, E>(self, f: F) -> FilterMapOk<Self, F> ⓘ
    where +unchanged. Read more

    source§

    fn filter_map_ok<F, T, U, E>(self, f: F) -> FilterMapOk<Self, F> ⓘ
    where Self: Iterator<Item = Result<T, E>> + Sized, F: FnMut(T) -> Option<U>,

    Return an iterator adaptor that filters and transforms every Result::Ok value with the provided closure. Result::Err -values are unchanged. Read more
    source§

    fn flatten_ok<T, E>(self) -> FlattenOk<Self, T, E> ⓘ
    where +values are unchanged. Read more

    source§

    fn flatten_ok<T, E>(self) -> FlattenOk<Self, T, E> ⓘ
    where Self: Iterator<Item = Result<T, E>> + Sized, T: IntoIterator,

    Return an iterator adaptor that flattens every Result::Ok value into -a series of Result::Ok values. Result::Err values are unchanged. Read more
    source§

    fn process_results<F, T, E, R>(self, processor: F) -> Result<R, E>
    where +a series of Result::Ok values. Result::Err values are unchanged. Read more

    source§

    fn process_results<F, T, E, R>(self, processor: F) -> Result<R, E>
    where Self: Iterator<Item = Result<T, E>> + Sized, F: FnOnce(ProcessResults<'_, Self, E>) -> R,

    “Lift” a function of the values of the current iterator so as to process -an iterator of Result values instead. Read more
    source§

    fn merge<J>(self, other: J) -> Merge<Self, J::IntoIter>
    where +an iterator of Result values instead. Read more

    source§

    fn merge<J>(self, other: J) -> Merge<Self, J::IntoIter>
    where Self: Sized, Self::Item: PartialOrd, J: IntoIterator<Item = Self::Item>,

    Return an iterator adaptor that merges the two base iterators in ascending order. If both base iterators are sorted (ascending), the -result is sorted. Read more
    source§

    fn merge_by<J, F>(self, other: J, is_first: F) -> MergeBy<Self, J::IntoIter, F> ⓘ
    where +result is sorted. Read more

    source§

    fn merge_by<J, F>(self, other: J, is_first: F) -> MergeBy<Self, J::IntoIter, F> ⓘ
    where Self: Sized, J: IntoIterator<Item = Self::Item>, F: FnMut(&Self::Item, &Self::Item) -> bool,

    Return an iterator adaptor that merges the two base iterators in order. -This is much like .merge() but allows for a custom ordering. Read more
    source§

    fn merge_join_by<J, F, T>( +This is much like .merge() but allows for a custom ordering. Read more

    source§

    fn merge_join_by<J, F, T>( self, other: J, cmp_fn: F @@ -1984,284 +1885,295 @@ This is much like IntoIterator, F: FnMut(&Self::Item, &J::Item) -> T, Self: Sized,

    Create an iterator that merges items from both this and the specified -iterator in ascending order. Read more
    source§

    fn kmerge(self) -> KMerge<<Self::Item as IntoIterator>::IntoIter>
    where +iterator in ascending order. Read more

    source§

    fn kmerge(self) -> KMerge<<Self::Item as IntoIterator>::IntoIter>
    where Self: Sized, Self::Item: IntoIterator, <Self::Item as IntoIterator>::Item: PartialOrd,

    Return an iterator adaptor that flattens an iterator of iterators by -merging them in ascending order. Read more
    source§

    fn kmerge_by<F>( +merging them in ascending order. Read more

    source§

    fn kmerge_by<F>( self, first: F ) -> KMergeBy<<Self::Item as IntoIterator>::IntoIter, F> ⓘ
    where Self: Sized, Self::Item: IntoIterator, F: FnMut(&<Self::Item as IntoIterator>::Item, &<Self::Item as IntoIterator>::Item) -> bool,

    Return an iterator adaptor that flattens an iterator of iterators by -merging them according to the given closure. Read more
    source§

    fn cartesian_product<J>(self, other: J) -> Product<Self, J::IntoIter> ⓘ
    where +merging them according to the given closure. Read more

    source§

    fn cartesian_product<J>(self, other: J) -> Product<Self, J::IntoIter> ⓘ
    where Self: Sized, Self::Item: Clone, J: IntoIterator, J::IntoIter: Clone,

    Return an iterator adaptor that iterates over the cartesian product of -the element sets of two iterators self and J. Read more
    source§

    fn multi_cartesian_product( +the element sets of two iterators self and J. Read more

    source§

    fn multi_cartesian_product( self ) -> MultiProduct<<Self::Item as IntoIterator>::IntoIter> ⓘ
    where Self: Sized, Self::Item: IntoIterator, <Self::Item as IntoIterator>::IntoIter: Clone, <Self::Item as IntoIterator>::Item: Clone,

    Return an iterator adaptor that iterates over the cartesian product of -all subiterators returned by meta-iterator self. Read more
    source§

    fn coalesce<F>(self, f: F) -> Coalesce<Self, F>
    where +all subiterators returned by meta-iterator self. Read more

    source§

    fn coalesce<F>(self, f: F) -> Coalesce<Self, F>
    where Self: Sized, F: FnMut(Self::Item, Self::Item) -> Result<Self::Item, (Self::Item, Self::Item)>,

    Return an iterator adaptor that uses the passed-in closure to -optionally merge together consecutive elements. Read more
    source§

    fn dedup(self) -> Dedup<Self>
    where +optionally merge together consecutive elements. Read more

    source§

    fn dedup(self) -> Dedup<Self>
    where Self: Sized, Self::Item: PartialEq,

    Remove duplicates from sections of consecutive identical elements. -If the iterator is sorted, all elements will be unique. Read more
    source§

    fn dedup_by<Cmp>(self, cmp: Cmp) -> DedupBy<Self, Cmp>
    where +If the iterator is sorted, all elements will be unique. Read more

    source§

    fn dedup_by<Cmp>(self, cmp: Cmp) -> DedupBy<Self, Cmp>
    where Self: Sized, Cmp: FnMut(&Self::Item, &Self::Item) -> bool,

    Remove duplicates from sections of consecutive identical elements, determining equality using a comparison function. -If the iterator is sorted, all elements will be unique. Read more
    source§

    fn dedup_with_count(self) -> DedupWithCount<Self>
    where +If the iterator is sorted, all elements will be unique. Read more

    source§

    fn dedup_with_count(self) -> DedupWithCount<Self>
    where Self: Sized,

    Remove duplicates from sections of consecutive identical elements, while keeping a count of how many repeated elements were present. -If the iterator is sorted, all elements will be unique. Read more
    source§

    fn dedup_by_with_count<Cmp>(self, cmp: Cmp) -> DedupByWithCount<Self, Cmp>
    where +If the iterator is sorted, all elements will be unique. Read more

    source§

    fn dedup_by_with_count<Cmp>(self, cmp: Cmp) -> DedupByWithCount<Self, Cmp>
    where Self: Sized, Cmp: FnMut(&Self::Item, &Self::Item) -> bool,

    Remove duplicates from sections of consecutive identical elements, while keeping a count of how many repeated elements were present. This will determine equality using a comparison function. -If the iterator is sorted, all elements will be unique. Read more
    source§

    fn duplicates(self) -> Duplicates<Self>
    where +If the iterator is sorted, all elements will be unique. Read more

    source§

    fn duplicates(self) -> Duplicates<Self>
    where Self: Sized, Self::Item: Eq + Hash,

    Return an iterator adaptor that produces elements that appear more than once during the -iteration. Duplicates are detected using hash and equality. Read more
    source§

    fn duplicates_by<V, F>(self, f: F) -> DuplicatesBy<Self, V, F>
    where +iteration. Duplicates are detected using hash and equality. Read more

    source§

    fn duplicates_by<V, F>(self, f: F) -> DuplicatesBy<Self, V, F>
    where Self: Sized, V: Eq + Hash, F: FnMut(&Self::Item) -> V,

    Return an iterator adaptor that produces elements that appear more than once during the -iteration. Duplicates are detected using hash and equality. Read more
    source§

    fn unique(self) -> Unique<Self> ⓘ
    where +iteration. Duplicates are detected using hash and equality. Read more

    source§

    fn unique(self) -> Unique<Self> ⓘ
    where Self: Sized, Self::Item: Clone + Eq + Hash,

    Return an iterator adaptor that filters out elements that have already been produced once during the iteration. Duplicates -are detected using hash and equality. Read more
    source§

    fn unique_by<V, F>(self, f: F) -> UniqueBy<Self, V, F> ⓘ
    where +are detected using hash and equality. Read more

    source§

    fn unique_by<V, F>(self, f: F) -> UniqueBy<Self, V, F> ⓘ
    where Self: Sized, V: Eq + Hash, F: FnMut(&Self::Item) -> V,

    Return an iterator adaptor that filters out elements that have -already been produced once during the iteration. Read more
    source§

    fn peeking_take_while<F>(&mut self, accept: F) -> PeekingTakeWhile<'_, Self, F> ⓘ
    where +already been produced once during the iteration. Read more

    source§

    fn peeking_take_while<F>(&mut self, accept: F) -> PeekingTakeWhile<'_, Self, F> ⓘ
    where Self: Sized + PeekingNext, F: FnMut(&Self::Item) -> bool,

    Return an iterator adaptor that borrows from this iterator and -takes items while the closure accept returns true. Read more
    source§

    fn take_while_ref<F>(&mut self, accept: F) -> TakeWhileRef<'_, Self, F> ⓘ
    where +takes items while the closure accept returns true. Read more

    source§

    fn take_while_ref<F>(&mut self, accept: F) -> TakeWhileRef<'_, Self, F> ⓘ
    where Self: Clone, F: FnMut(&Self::Item) -> bool,

    Return an iterator adaptor that borrows from a Clone-able iterator -to only pick off elements while the predicate accept returns true. Read more
    source§

    fn take_while_inclusive<F>(self, accept: F) -> TakeWhileInclusive<Self, F> ⓘ
    where +to only pick off elements while the predicate accept returns true. Read more

    source§

    fn take_while_inclusive<F>(self, accept: F) -> TakeWhileInclusive<Self, F> ⓘ
    where Self: Sized, F: FnMut(&Self::Item) -> bool,

    Returns an iterator adaptor that consumes elements while the given predicate is true, including the element for which the predicate -first returned false. Read more
    source§

    fn while_some<A>(self) -> WhileSome<Self> ⓘ
    where +first returned false. Read more

    source§

    fn while_some<A>(self) -> WhileSome<Self> ⓘ
    where Self: Sized + Iterator<Item = Option<A>>,

    Return an iterator adaptor that filters Option<A> iterator elements -and produces A. Stops on the first None encountered. Read more
    source§

    fn tuple_combinations<T>(self) -> TupleCombinations<Self, T> ⓘ
    where +and produces A. Stops on the first None encountered. Read more

    source§

    fn tuple_combinations<T>(self) -> TupleCombinations<Self, T> ⓘ
    where Self: Sized + Clone, Self::Item: Clone, T: HasCombination<Self>,

    Return an iterator adaptor that iterates over the combinations of the -elements from an iterator. Read more
    source§

    fn combinations(self, k: usize) -> Combinations<Self> ⓘ
    where +elements from an iterator. Read more

    source§

    fn combinations(self, k: usize) -> Combinations<Self> ⓘ
    where Self: Sized, Self::Item: Clone,

    Return an iterator adaptor that iterates over the k-length combinations of -the elements from an iterator. Read more
    source§

    fn combinations_with_replacement( +the elements from an iterator. Read more

    source§

    fn combinations_with_replacement( self, k: usize ) -> CombinationsWithReplacement<Self> ⓘ
    where Self: Sized, Self::Item: Clone,

    Return an iterator that iterates over the k-length combinations of -the elements from an iterator, with replacement. Read more
    source§

    fn permutations(self, k: usize) -> Permutations<Self> ⓘ
    where +the elements from an iterator, with replacement. Read more

    source§

    fn permutations(self, k: usize) -> Permutations<Self> ⓘ
    where Self: Sized, Self::Item: Clone,

    Return an iterator adaptor that iterates over all k-permutations of the -elements from an iterator. Read more
    source§

    fn powerset(self) -> Powerset<Self> ⓘ
    where +elements from an iterator. Read more

    source§

    fn powerset(self) -> Powerset<Self> ⓘ
    where Self: Sized, Self::Item: Clone,

    Return an iterator that iterates through the powerset of the elements from an -iterator. Read more
    source§

    fn pad_using<F>(self, min: usize, f: F) -> PadUsing<Self, F> ⓘ
    where +iterator. Read more

    source§

    fn pad_using<F>(self, min: usize, f: F) -> PadUsing<Self, F> ⓘ
    where Self: Sized, F: FnMut(usize) -> Self::Item,

    Return an iterator adaptor that pads the sequence to a minimum length of -min by filling missing elements using a closure f. Read more
    source§

    fn with_position(self) -> WithPosition<Self> ⓘ
    where +min by filling missing elements using a closure f. Read more

    source§

    fn with_position(self) -> WithPosition<Self> ⓘ
    where Self: Sized,

    Return an iterator adaptor that combines each element with a Position to -ease special-case handling of the first or last elements. Read more
    source§

    fn positions<P>(self, predicate: P) -> Positions<Self, P> ⓘ
    where +ease special-case handling of the first or last elements. Read more

    source§

    fn positions<P>(self, predicate: P) -> Positions<Self, P> ⓘ
    where Self: Sized, P: FnMut(Self::Item) -> bool,

    Return an iterator adaptor that yields the indices of all elements -satisfying a predicate, counted from the start of the iterator. Read more
    source§

    fn update<F>(self, updater: F) -> Update<Self, F> ⓘ
    where +satisfying a predicate, counted from the start of the iterator. Read more

    source§

    fn update<F>(self, updater: F) -> Update<Self, F> ⓘ
    where Self: Sized, F: FnMut(&mut Self::Item),

    Return an iterator adaptor that applies a mutating function -to each element before yielding it. Read more
    source§

    fn next_tuple<T>(&mut self) -> Option<T>
    where +to each element before yielding it. Read more

    source§

    fn next_tuple<T>(&mut self) -> Option<T>
    where Self: Sized + Iterator<Item = T::Item>, T: HomogeneousTuple,

    Advances the iterator and returns the next items grouped in a tuple of -a specific size (up to 12). Read more
    source§

    fn collect_tuple<T>(self) -> Option<T>
    where +a specific size (up to 12). Read more

    source§

    fn collect_tuple<T>(self) -> Option<T>
    where Self: Sized + Iterator<Item = T::Item>, T: HomogeneousTuple,

    Collects all items from the iterator into a tuple of a specific size -(up to 12). Read more
    source§

    fn find_position<P>(&mut self, pred: P) -> Option<(usize, Self::Item)>
    where - P: FnMut(&Self::Item) -> bool,

    Find the position and value of the first element satisfying a predicate. Read more
    source§

    fn find_or_last<P>(self, predicate: P) -> Option<Self::Item>
    where +(up to 12). Read more

    source§

    fn find_position<P>(&mut self, pred: P) -> Option<(usize, Self::Item)>
    where + P: FnMut(&Self::Item) -> bool,

    Find the position and value of the first element satisfying a predicate. Read more
    source§

    fn find_or_last<P>(self, predicate: P) -> Option<Self::Item>
    where Self: Sized, - P: FnMut(&Self::Item) -> bool,

    Find the value of the first element satisfying a predicate or return the last element, if any. Read more
    source§

    fn find_or_first<P>(self, predicate: P) -> Option<Self::Item>
    where + P: FnMut(&Self::Item) -> bool,

    Find the value of the first element satisfying a predicate or return the last element, if any. Read more
    source§

    fn find_or_first<P>(self, predicate: P) -> Option<Self::Item>
    where Self: Sized, - P: FnMut(&Self::Item) -> bool,

    Find the value of the first element satisfying a predicate or return the first element, if any. Read more
    source§

    fn contains<Q>(&mut self, query: &Q) -> bool
    where + P: FnMut(&Self::Item) -> bool,

    Find the value of the first element satisfying a predicate or return the first element, if any. Read more
    source§

    fn contains<Q>(&mut self, query: &Q) -> bool
    where Self: Sized, Self::Item: Borrow<Q>, - Q: PartialEq,

    Returns true if the given item is present in this iterator. Read more
    source§

    fn all_equal(&mut self) -> bool
    where + Q: PartialEq,

    Returns true if the given item is present in this iterator. Read more
    source§

    fn all_equal(&mut self) -> bool
    where Self: Sized, - Self::Item: PartialEq,

    Check whether all elements compare equal. Read more
    source§

    fn all_equal_value( + Self::Item: PartialEq,

    Check whether all elements compare equal. Read more
    source§

    fn all_equal_value( &mut self ) -> Result<Self::Item, Option<(Self::Item, Self::Item)>>
    where Self: Sized, Self::Item: PartialEq,

    If there are elements and they are all equal, return a single copy of that element. If there are no elements, return an Error containing None. If there are elements and they are not all equal, return a tuple containing the first -two non-equal elements found. Read more
    source§

    fn all_unique(&mut self) -> bool
    where +two non-equal elements found. Read more

    source§

    fn all_unique(&mut self) -> bool
    where Self: Sized, - Self::Item: Eq + Hash,

    Check whether all elements are unique (non equal). Read more
    source§

    fn dropping(self, n: usize) -> Self
    where + Self::Item: Eq + Hash,

    Check whether all elements are unique (non equal). Read more
    source§

    fn dropping(self, n: usize) -> Self
    where Self: Sized,

    Consume the first n elements from the iterator eagerly, -and return the same iterator again. Read more
    source§

    fn dropping_back(self, n: usize) -> Self
    where +and return the same iterator again. Read more

    source§

    fn dropping_back(self, n: usize) -> Self
    where Self: Sized + DoubleEndedIterator,

    Consume the last n elements from the iterator eagerly, -and return the same iterator again. Read more
    source§

    fn foreach<F>(self, f: F)
    where - F: FnMut(Self::Item), - Self: Sized,

    👎Deprecated since 0.8.0: Use .for_each() instead
    Run the closure f eagerly on each element of the iterator. Read more
    source§

    fn concat(self) -> Self::Item
    where +and return the same iterator again. Read more

    source§

    fn concat(self) -> Self::Item
    where Self: Sized, - Self::Item: Extend<<<Self as Iterator>::Item as IntoIterator>::Item> + IntoIterator + Default,

    Combine all an iterator’s elements into one element by using Extend. Read more
    source§

    fn collect_vec(self) -> Vec<Self::Item>
    where + Self::Item: Extend<<<Self as Iterator>::Item as IntoIterator>::Item> + IntoIterator + Default,

    Combine all an iterator’s elements into one element by using Extend. Read more
    source§

    fn collect_vec(self) -> Vec<Self::Item>
    where Self: Sized,

    .collect_vec() is simply a type specialization of Iterator::collect, -for convenience.
    source§

    fn try_collect<T, U, E>(self) -> Result<U, E>
    where +for convenience.

    source§

    fn try_collect<T, U, E>(self) -> Result<U, E>
    where Self: Sized + Iterator<Item = Result<T, E>>, Result<U, E>: FromIterator<Result<T, E>>,

    .try_collect() is more convenient way of writing -.collect::<Result<_, _>>() Read more
    source§

    fn set_from<'a, A: 'a, J>(&mut self, from: J) -> usize
    where +.collect::<Result<_, _>>() Read more

    source§

    fn set_from<'a, A: 'a, J>(&mut self, from: J) -> usize
    where Self: Iterator<Item = &'a mut A>, J: IntoIterator<Item = A>,

    Assign to each reference in self from the from iterator, -stopping at the shortest of the two iterators. Read more
    source§

    fn join(&mut self, sep: &str) -> String
    where - Self::Item: Display,

    Combine all iterator elements into one String, separated by sep. Read more
    source§

    fn format(self, sep: &str) -> Format<'_, Self>
    where - Self: Sized,

    Format all iterator elements, separated by sep. Read more
    source§

    fn format_with<F>(self, sep: &str, format: F) -> FormatWith<'_, Self, F>
    where +stopping at the shortest of the two iterators. Read more

    source§

    fn join(&mut self, sep: &str) -> String
    where + Self::Item: Display,

    Combine all iterator elements into one String, separated by sep. Read more
    source§

    fn format(self, sep: &str) -> Format<'_, Self>
    where + Self: Sized,

    Format all iterator elements, separated by sep. Read more
    source§

    fn format_with<F>(self, sep: &str, format: F) -> FormatWith<'_, Self, F>
    where Self: Sized, - F: FnMut(Self::Item, &mut dyn FnMut(&dyn Display) -> Result) -> Result,

    Format all iterator elements, separated by sep. Read more
    source§

    fn fold_results<A, E, B, F>(&mut self, start: B, f: F) -> Result<B, E>
    where + F: FnMut(Self::Item, &mut dyn FnMut(&dyn Display) -> Result) -> Result,

    Format all iterator elements, separated by sep. Read more
    source§

    fn fold_ok<A, E, B, F>(&mut self, start: B, f: F) -> Result<B, E>
    where Self: Iterator<Item = Result<A, E>>, - F: FnMut(B, A) -> B,

    👎Deprecated since 0.10.0: Use .fold_ok() instead
    See .fold_ok().
    source§

    fn fold_ok<A, E, B, F>(&mut self, start: B, f: F) -> Result<B, E>
    where - Self: Iterator<Item = Result<A, E>>, - F: FnMut(B, A) -> B,

    Fold Result values from an iterator. Read more
    source§

    fn fold_options<A, B, F>(&mut self, start: B, f: F) -> Option<B>
    where + F: FnMut(B, A) -> B,

    Fold Result values from an iterator. Read more
    source§

    fn fold_options<A, B, F>(&mut self, start: B, f: F) -> Option<B>
    where Self: Iterator<Item = Option<A>>, - F: FnMut(B, A) -> B,

    Fold Option values from an iterator. Read more
    source§

    fn fold1<F>(self, f: F) -> Option<Self::Item>
    where + F: FnMut(B, A) -> B,

    Fold Option values from an iterator. Read more
    source§

    fn fold1<F>(self, f: F) -> Option<Self::Item>
    where F: FnMut(Self::Item, Self::Item) -> Self::Item, - Self: Sized,

    👎Deprecated since 0.10.2: Use Iterator::reduce instead
    Accumulator of the elements in the iterator. Read more
    source§

    fn tree_fold1<F>(self, f: F) -> Option<Self::Item>
    where + Self: Sized,

    👎Deprecated since 0.10.2: Use Iterator::reduce instead
    Accumulator of the elements in the iterator. Read more
    source§

    fn tree_reduce<F>(self, f: F) -> Option<Self::Item>
    where F: FnMut(Self::Item, Self::Item) -> Self::Item, - Self: Sized,

    Accumulate the elements in the iterator in a tree-like manner. Read more
    source§

    fn fold_while<B, F>(&mut self, init: B, f: F) -> FoldWhile<B>
    where + Self: Sized,

    Accumulate the elements in the iterator in a tree-like manner. Read more
    source§

    fn tree_fold1<F>(self, f: F) -> Option<Self::Item>
    where + F: FnMut(Self::Item, Self::Item) -> Self::Item, + Self: Sized,

    👎Deprecated since 0.13.0: Use .tree_reduce() instead
    See .tree_reduce().
    source§

    fn fold_while<B, F>(&mut self, init: B, f: F) -> FoldWhile<B>
    where Self: Sized, - F: FnMut(B, Self::Item) -> FoldWhile<B>,

    An iterator method that applies a function, producing a single, final value. Read more
    source§

    fn sum1<S>(self) -> Option<S>
    where + F: FnMut(B, Self::Item) -> FoldWhile<B>,

    An iterator method that applies a function, producing a single, final value. Read more
    source§

    fn sum1<S>(self) -> Option<S>
    where Self: Sized, - S: Sum<Self::Item>,

    Iterate over the entire iterator and add all the elements. Read more
    source§

    fn product1<P>(self) -> Option<P>
    where + S: Sum<Self::Item>,

    Iterate over the entire iterator and add all the elements. Read more
    source§

    fn product1<P>(self) -> Option<P>
    where Self: Sized, - P: Product<Self::Item>,

    Iterate over the entire iterator and multiply all the elements. Read more
    source§

    fn sorted_unstable(self) -> IntoIter<Self::Item> ⓘ
    where + P: Product<Self::Item>,

    Iterate over the entire iterator and multiply all the elements. Read more
    source§

    fn sorted_unstable(self) -> IntoIter<Self::Item> ⓘ
    where Self: Sized, - Self::Item: Ord,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_unstable_by<F>(self, cmp: F) -> IntoIter<Self::Item> ⓘ
    where + Self::Item: Ord,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_unstable_by<F>(self, cmp: F) -> IntoIter<Self::Item> ⓘ
    where Self: Sized, - F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_unstable_by_key<K, F>(self, f: F) -> IntoIter<Self::Item> ⓘ
    where + F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_unstable_by_key<K, F>(self, f: F) -> IntoIter<Self::Item> ⓘ
    where Self: Sized, K: Ord, - F: FnMut(&Self::Item) -> K,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted(self) -> IntoIter<Self::Item> ⓘ
    where + F: FnMut(&Self::Item) -> K,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted(self) -> IntoIter<Self::Item> ⓘ
    where Self: Sized, - Self::Item: Ord,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_by<F>(self, cmp: F) -> IntoIter<Self::Item> ⓘ
    where + Self::Item: Ord,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_by<F>(self, cmp: F) -> IntoIter<Self::Item> ⓘ
    where Self: Sized, - F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_by_key<K, F>(self, f: F) -> IntoIter<Self::Item> ⓘ
    where + F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_by_key<K, F>(self, f: F) -> IntoIter<Self::Item> ⓘ
    where Self: Sized, K: Ord, - F: FnMut(&Self::Item) -> K,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_by_cached_key<K, F>(self, f: F) -> IntoIter<Self::Item> ⓘ
    where + F: FnMut(&Self::Item) -> K,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_by_cached_key<K, F>(self, f: F) -> IntoIter<Self::Item> ⓘ
    where Self: Sized, K: Ord, F: FnMut(&Self::Item) -> K,

    Sort all iterator elements into a new iterator in ascending order. The key function is -called exactly once per key. Read more
    source§

    fn k_smallest(self, k: usize) -> IntoIter<Self::Item> ⓘ
    where +called exactly once per key. Read more

    source§

    fn k_smallest(self, k: usize) -> IntoIter<Self::Item> ⓘ
    where Self: Sized, - Self::Item: Ord,

    Sort the k smallest elements into a new iterator, in ascending order. Read more
    source§

    fn partition_map<A, B, F, L, R>(self, predicate: F) -> (A, B)
    where + Self::Item: Ord,

    Sort the k smallest elements into a new iterator, in ascending order. Read more
    source§

    fn k_smallest_by<F>(self, k: usize, cmp: F) -> IntoIter<Self::Item> ⓘ
    where + Self: Sized, + F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Sort the k smallest elements into a new iterator using the provided comparison. Read more
    source§

    fn k_smallest_by_key<F, K>(self, k: usize, key: F) -> IntoIter<Self::Item> ⓘ
    where + Self: Sized, + F: FnMut(&Self::Item) -> K, + K: Ord,

    Return the elements producing the k smallest outputs of the provided function. Read more
    source§

    fn k_largest(self, k: usize) -> IntoIter<Self::Item> ⓘ
    where + Self: Sized, + Self::Item: Ord,

    Sort the k largest elements into a new iterator, in descending order. Read more
    source§

    fn k_largest_by<F>(self, k: usize, cmp: F) -> IntoIter<Self::Item> ⓘ
    where + Self: Sized, + F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Sort the k largest elements into a new iterator using the provided comparison. Read more
    source§

    fn k_largest_by_key<F, K>(self, k: usize, key: F) -> IntoIter<Self::Item> ⓘ
    where + Self: Sized, + F: FnMut(&Self::Item) -> K, + K: Ord,

    Return the elements producing the k largest outputs of the provided function. Read more
    source§

    fn tail(self, n: usize) -> IntoIter<Self::Item> ⓘ
    where + Self: Sized,

    Consumes the iterator and return an iterator of the last n elements. Read more
    source§

    fn partition_map<A, B, F, L, R>(self, predicate: F) -> (A, B)
    where Self: Sized, F: FnMut(Self::Item) -> Either<L, R>, A: Default + Extend<L>, B: Default + Extend<R>,

    Collect all iterator elements into one of two partitions. Unlike Iterator::partition, each partition may -have a distinct type. Read more
    source§

    fn partition_result<A, B, T, E>(self) -> (A, B)
    where +have a distinct type. Read more

    source§

    fn partition_result<A, B, T, E>(self) -> (A, B)
    where Self: Iterator<Item = Result<T, E>> + Sized, A: Default + Extend<T>, B: Default + Extend<E>,

    Partition a sequence of Results into one list of all the Ok elements -and another list of all the Err elements. Read more
    source§

    fn into_group_map<K, V>(self) -> HashMap<K, Vec<V>>
    where +and another list of all the Err elements. Read more

    source§

    fn into_group_map<K, V>(self) -> HashMap<K, Vec<V>>
    where Self: Iterator<Item = (K, V)> + Sized, K: Hash + Eq,

    Return a HashMap of keys mapped to Vecs of values. Keys and values -are taken from (Key, Value) tuple pairs yielded by the input iterator. Read more
    source§

    fn into_group_map_by<K, V, F>(self, f: F) -> HashMap<K, Vec<V>>
    where +are taken from (Key, Value) tuple pairs yielded by the input iterator. Read more

    source§

    fn into_group_map_by<K, V, F>(self, f: F) -> HashMap<K, Vec<V>>
    where Self: Iterator<Item = V> + Sized, K: Hash + Eq, - F: Fn(&V) -> K,

    Return an Iterator on a HashMap. Keys mapped to Vecs of values. The key is specified -in the closure. Read more
    source§

    fn into_grouping_map<K, V>(self) -> GroupingMap<Self>
    where + F: FnMut(&V) -> K,

    Return an Iterator on a HashMap. Keys mapped to Vecs of values. The key is specified +in the closure. Read more
    source§

    fn into_grouping_map<K, V>(self) -> GroupingMap<Self>
    where Self: Iterator<Item = (K, V)> + Sized, K: Hash + Eq,

    Constructs a GroupingMap to be used later with one of the efficient -group-and-fold operations it allows to perform. Read more
    source§

    fn into_grouping_map_by<K, V, F>(self, key_mapper: F) -> GroupingMapBy<Self, F>
    where +group-and-fold operations it allows to perform. Read more

    source§

    fn into_grouping_map_by<K, V, F>(self, key_mapper: F) -> GroupingMapBy<Self, F>
    where Self: Iterator<Item = V> + Sized, K: Hash + Eq, F: FnMut(&V) -> K,

    Constructs a GroupingMap to be used later with one of the efficient -group-and-fold operations it allows to perform. Read more
    source§

    fn min_set(self) -> Vec<Self::Item>
    where +group-and-fold operations it allows to perform. Read more

    source§

    fn min_set(self) -> Vec<Self::Item>
    where Self: Sized, - Self::Item: Ord,

    Return all minimum elements of an iterator. Read more
    source§

    fn min_set_by<F>(self, compare: F) -> Vec<Self::Item>
    where + Self::Item: Ord,

    Return all minimum elements of an iterator. Read more
    source§

    fn min_set_by<F>(self, compare: F) -> Vec<Self::Item>
    where Self: Sized, F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Return all minimum elements of an iterator, as determined by -the specified function. Read more
    source§

    fn min_set_by_key<K, F>(self, key: F) -> Vec<Self::Item>
    where +the specified function. Read more

    source§

    fn min_set_by_key<K, F>(self, key: F) -> Vec<Self::Item>
    where Self: Sized, K: Ord, F: FnMut(&Self::Item) -> K,

    Return all minimum elements of an iterator, as determined by -the specified function. Read more
    source§

    fn max_set(self) -> Vec<Self::Item>
    where +the specified function. Read more

    source§

    fn max_set(self) -> Vec<Self::Item>
    where Self: Sized, - Self::Item: Ord,

    Return all maximum elements of an iterator. Read more
    source§

    fn max_set_by<F>(self, compare: F) -> Vec<Self::Item>
    where + Self::Item: Ord,

    Return all maximum elements of an iterator. Read more
    source§

    fn max_set_by<F>(self, compare: F) -> Vec<Self::Item>
    where Self: Sized, F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Return all maximum elements of an iterator, as determined by -the specified function. Read more
    source§

    fn max_set_by_key<K, F>(self, key: F) -> Vec<Self::Item>
    where +the specified function. Read more

    source§

    fn max_set_by_key<K, F>(self, key: F) -> Vec<Self::Item>
    where Self: Sized, K: Ord, F: FnMut(&Self::Item) -> K,

    Return all maximum elements of an iterator, as determined by -the specified function. Read more
    source§

    fn minmax(self) -> MinMaxResult<Self::Item>
    where +the specified function. Read more

    source§

    fn minmax(self) -> MinMaxResult<Self::Item>
    where Self: Sized, - Self::Item: PartialOrd,

    Return the minimum and maximum elements in the iterator. Read more
    source§

    fn minmax_by_key<K, F>(self, key: F) -> MinMaxResult<Self::Item>
    where + Self::Item: PartialOrd,

    Return the minimum and maximum elements in the iterator. Read more
    source§

    fn minmax_by_key<K, F>(self, key: F) -> MinMaxResult<Self::Item>
    where Self: Sized, K: PartialOrd, F: FnMut(&Self::Item) -> K,

    Return the minimum and maximum element of an iterator, as determined by -the specified function. Read more
    source§

    fn minmax_by<F>(self, compare: F) -> MinMaxResult<Self::Item>
    where +the specified function. Read more

    source§

    fn minmax_by<F>(self, compare: F) -> MinMaxResult<Self::Item>
    where Self: Sized, F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Return the minimum and maximum element of an iterator, as determined by -the specified comparison function. Read more
    source§

    fn position_max(self) -> Option<usize>
    where +the specified comparison function. Read more

    source§

    fn position_max(self) -> Option<usize>
    where Self: Sized, - Self::Item: Ord,

    Return the position of the maximum element in the iterator. Read more
    source§

    fn position_max_by_key<K, F>(self, key: F) -> Option<usize>
    where + Self::Item: Ord,

    Return the position of the maximum element in the iterator. Read more
    source§

    fn position_max_by_key<K, F>(self, key: F) -> Option<usize>
    where Self: Sized, K: Ord, F: FnMut(&Self::Item) -> K,

    Return the position of the maximum element in the iterator, as -determined by the specified function. Read more
    source§

    fn position_max_by<F>(self, compare: F) -> Option<usize>
    where +determined by the specified function. Read more

    source§

    fn position_max_by<F>(self, compare: F) -> Option<usize>
    where Self: Sized, F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Return the position of the maximum element in the iterator, as -determined by the specified comparison function. Read more
    source§

    fn position_min(self) -> Option<usize>
    where +determined by the specified comparison function. Read more

    source§

    fn position_min(self) -> Option<usize>
    where Self: Sized, - Self::Item: Ord,

    Return the position of the minimum element in the iterator. Read more
    source§

    fn position_min_by_key<K, F>(self, key: F) -> Option<usize>
    where + Self::Item: Ord,

    Return the position of the minimum element in the iterator. Read more
    source§

    fn position_min_by_key<K, F>(self, key: F) -> Option<usize>
    where Self: Sized, K: Ord, F: FnMut(&Self::Item) -> K,

    Return the position of the minimum element in the iterator, as -determined by the specified function. Read more
    source§

    fn position_min_by<F>(self, compare: F) -> Option<usize>
    where +determined by the specified function. Read more

    source§

    fn position_min_by<F>(self, compare: F) -> Option<usize>
    where Self: Sized, F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Return the position of the minimum element in the iterator, as -determined by the specified comparison function. Read more
    source§

    fn position_minmax(self) -> MinMaxResult<usize>
    where +determined by the specified comparison function. Read more

    source§

    fn position_minmax(self) -> MinMaxResult<usize>
    where Self: Sized, Self::Item: PartialOrd,

    Return the positions of the minimum and maximum elements in -the iterator. Read more
    source§

    fn position_minmax_by_key<K, F>(self, key: F) -> MinMaxResult<usize>
    where +the iterator. Read more

    source§

    fn position_minmax_by_key<K, F>(self, key: F) -> MinMaxResult<usize>
    where Self: Sized, K: PartialOrd, F: FnMut(&Self::Item) -> K,

    Return the postions of the minimum and maximum elements of an -iterator, as determined by the specified function. Read more
    source§

    fn position_minmax_by<F>(self, compare: F) -> MinMaxResult<usize>
    where +iterator, as determined by the specified function. Read more

    source§

    fn position_minmax_by<F>(self, compare: F) -> MinMaxResult<usize>
    where Self: Sized, F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Return the postions of the minimum and maximum elements of an -iterator, as determined by the specified comparison function. Read more
    source§

    fn exactly_one(self) -> Result<Self::Item, ExactlyOneError<Self>>
    where +iterator, as determined by the specified comparison function. Read more

    source§

    fn exactly_one(self) -> Result<Self::Item, ExactlyOneError<Self>>
    where Self: Sized,

    If the iterator yields exactly one element, that element will be returned, otherwise an error will be returned containing an iterator that has the same output as the input -iterator. Read more
    source§

    fn at_most_one(self) -> Result<Option<Self::Item>, ExactlyOneError<Self>>
    where - Self: Sized,

    If the iterator yields no elements, Ok(None) will be returned. If the iterator yields +iterator. Read more
    source§

    fn at_most_one(self) -> Result<Option<Self::Item>, ExactlyOneError<Self>>
    where + Self: Sized,

    If the iterator yields no elements, Ok(None) will be returned. If the iterator yields exactly one element, that element will be returned, otherwise an error will be returned -containing an iterator that has the same output as the input iterator. Read more
    source§

    fn multipeek(self) -> MultiPeek<Self> ⓘ
    where +containing an iterator that has the same output as the input iterator. Read more

    source§

    fn multipeek(self) -> MultiPeek<Self> ⓘ
    where Self: Sized,

    An iterator adaptor that allows the user to peek at multiple .next() -values without advancing the base iterator. Read more
    source§

    fn counts(self) -> HashMap<Self::Item, usize>
    where +values without advancing the base iterator. Read more

    source§

    fn counts(self) -> HashMap<Self::Item, usize>
    where Self: Sized, Self::Item: Eq + Hash,

    Collect the items in this iterator and return a HashMap which contains each item that appears in the iterator and the number -of times it appears. Read more
    source§

    fn counts_by<K, F>(self, f: F) -> HashMap<K, usize>
    where +of times it appears. Read more

    source§

    fn counts_by<K, F>(self, f: F) -> HashMap<K, usize>
    where Self: Sized, K: Eq + Hash, F: FnMut(Self::Item) -> K,

    Collect the items in this iterator and return a HashMap which contains each item that appears in the iterator and the number of times it appears, -determining identity using a keying function. Read more
    source§

    fn multiunzip<FromI>(self) -> FromI
    where - Self: Sized + MultiUnzip<FromI>,

    Converts an iterator of tuples into a tuple of containers. Read more
    source§

    fn try_len(&self) -> Result<usize, (usize, Option<usize>)>

    Returns the length of the iterator if one exists. +determining identity using a keying function. Read more
    source§

    fn multiunzip<FromI>(self) -> FromI
    where + Self: Sized + MultiUnzip<FromI>,

    Converts an iterator of tuples into a tuple of containers. Read more
    source§

    fn try_len(&self) -> Result<usize, (usize, Option<usize>)>

    Returns the length of the iterator if one exists. Otherwise return self.size_hint(). Read more
    source§

    impl<IT> MultiUnzip<()> for IT
    where IT: Iterator<Item = ()>,

    source§

    fn multiunzip(self)

    Unzip this iterator into multiple collections.
    source§

    impl<IT, A, FromA> MultiUnzip<(FromA,)> for IT
    where IT: Iterator<Item = (A,)>, @@ -2364,4 +2276,4 @@ Otherwise return self.size_hint(). (FromA, FromB, FromC, FromD, FromE, FromF, FromG, FromH, FromI, FromJ, FromK, FromL)

    Unzip this iterator into multiple collections.
    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 + 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/itertools/structs/struct.ExactlyOneError.html b/itertools/structs/struct.ExactlyOneError.html index ca34dbad2..04b07c116 100644 --- a/itertools/structs/struct.ExactlyOneError.html +++ b/itertools/structs/struct.ExactlyOneError.html @@ -1,4 +1,4 @@ -ExactlyOneError in itertools::structs - Rust
    +ExactlyOneError in itertools::structs - Rust

    Struct itertools::structs::ExactlyOneError

    source · 
    pub struct ExactlyOneError<I>
    where
     I: Iterator,
    { /* private fields */ }
    Expand description

    Iterator returned for the error case of Itertools::exactly_one() This iterator yields exactly the same elements as the input iterator.

    @@ -219,86 +219,87 @@ otherwise. Right variant of Either<Self, Self> otherwise. Read more
    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> Itertools for T
    where - T: Iterator + ?Sized,

    source§

    fn interleave<J>(self, other: J) -> Interleave<Self, J::IntoIter> ⓘ
    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> Itertools for T
    where + T: Iterator + ?Sized,

    source§

    fn interleave<J>(self, other: J) -> Interleave<Self, J::IntoIter> ⓘ
    where J: IntoIterator<Item = Self::Item>, - Self: Sized,

    Alternate elements from two iterators until both have run out. Read more
    source§

    fn interleave_shortest<J>( + Self: Sized,

    Alternate elements from two iterators until both have run out. Read more
    source§

    fn interleave_shortest<J>( self, other: J ) -> InterleaveShortest<Self, J::IntoIter> ⓘ
    where J: IntoIterator<Item = Self::Item>, Self: Sized,

    Alternate elements from two iterators until at least one of them has run -out. Read more
    source§

    fn intersperse(self, element: Self::Item) -> Intersperse<Self>
    where +out. Read more

    source§

    fn intersperse(self, element: Self::Item) -> Intersperse<Self>
    where Self: Sized, Self::Item: Clone,

    An iterator adaptor to insert a particular value -between each element of the adapted iterator. Read more
    source§

    fn intersperse_with<F>(self, element: F) -> IntersperseWith<Self, F> ⓘ
    where +between each element of the adapted iterator. Read more

    source§

    fn intersperse_with<F>(self, element: F) -> IntersperseWith<Self, F> ⓘ
    where Self: Sized, F: FnMut() -> Self::Item,

    An iterator adaptor to insert a particular value created by a function -between each element of the adapted iterator. Read more
    source§

    fn zip_longest<J>(self, other: J) -> ZipLongest<Self, J::IntoIter> ⓘ
    where +between each element of the adapted iterator. Read more

    source§

    fn get<R>(self, index: R) -> R::Output
    where + Self: Sized, + R: IteratorIndex<Self>,

    Returns an iterator over a subsection of the iterator. Read more
    source§

    fn zip_longest<J>(self, other: J) -> ZipLongest<Self, J::IntoIter> ⓘ
    where J: IntoIterator, Self: Sized,

    Create an iterator which iterates over both this and the specified -iterator simultaneously, yielding pairs of two optional elements. Read more
    source§

    fn zip_eq<J>(self, other: J) -> ZipEq<Self, J::IntoIter> ⓘ
    where +iterator simultaneously, yielding pairs of two optional elements. Read more

    source§

    fn zip_eq<J>(self, other: J) -> ZipEq<Self, J::IntoIter> ⓘ
    where J: IntoIterator, Self: Sized,

    Create an iterator which iterates over both this and the specified -iterator simultaneously, yielding pairs of elements. Read more
    source§

    fn batching<B, F>(self, f: F) -> Batching<Self, F> ⓘ
    where +iterator simultaneously, yielding pairs of elements. Read more

    source§

    fn batching<B, F>(self, f: F) -> Batching<Self, F> ⓘ
    where F: FnMut(&mut Self) -> Option<B>, Self: Sized,

    A “meta iterator adaptor”. Its closure receives a reference to the iterator and may pick off as many elements as it likes, to produce the -next iterator element. Read more
    source§

    fn group_by<K, F>(self, key: F) -> GroupBy<K, Self, F>
    where +next iterator element. Read more

    source§

    fn chunk_by<K, F>(self, key: F) -> ChunkBy<K, Self, F>
    where Self: Sized, F: FnMut(&Self::Item) -> K, K: PartialEq,

    Return an iterable that can group iterator elements. Consecutive elements that map to the same key (“runs”), are assigned -to the same group. Read more
    source§

    fn chunks(self, size: usize) -> IntoChunks<Self>
    where - Self: Sized,

    Return an iterable that can chunk the iterator. Read more
    source§

    fn tuple_windows<T>(self) -> TupleWindows<Self, T> ⓘ
    where +to the same group. Read more

    source§

    fn group_by<K, F>(self, key: F) -> ChunkBy<K, Self, F>
    where + Self: Sized, + F: FnMut(&Self::Item) -> K, + K: PartialEq,

    👎Deprecated since 0.13.0: Use .chunk_by() instead
    See .chunk_by().
    source§

    fn chunks(self, size: usize) -> IntoChunks<Self>
    where + Self: Sized,

    Return an iterable that can chunk the iterator. Read more
    source§

    fn tuple_windows<T>(self) -> TupleWindows<Self, T> ⓘ
    where Self: Sized + Iterator<Item = T::Item>, T: HomogeneousTuple, T::Item: Clone,

    Return an iterator over all contiguous windows producing tuples of -a specific size (up to 12). Read more
    source§

    fn circular_tuple_windows<T>(self) -> CircularTupleWindows<Self, T> ⓘ
    where +a specific size (up to 12). Read more

    source§

    fn circular_tuple_windows<T>(self) -> CircularTupleWindows<Self, T> ⓘ
    where Self: Sized + Clone + Iterator<Item = T::Item> + ExactSizeIterator, T: TupleCollect + Clone, T::Item: Clone,

    Return an iterator over all windows, wrapping back to the first elements when the window would otherwise exceed the length of the -iterator, producing tuples of a specific size (up to 12). Read more
    source§

    fn tuples<T>(self) -> Tuples<Self, T> ⓘ
    where +iterator, producing tuples of a specific size (up to 12). Read more

    source§

    fn tuples<T>(self) -> Tuples<Self, T> ⓘ
    where Self: Sized + Iterator<Item = T::Item>, T: HomogeneousTuple,

    Return an iterator that groups the items in tuples of a specific size -(up to 12). Read more
    source§

    fn tee(self) -> (Tee<Self>, Tee<Self>)
    where +(up to 12). Read more

    source§

    fn tee(self) -> (Tee<Self>, Tee<Self>)
    where Self: Sized, Self::Item: Clone,

    Split into an iterator pair that both yield all elements from -the original iterator. Read more
    source§

    fn step(self, n: usize) -> Step<Self> ⓘ
    where - Self: Sized,

    👎Deprecated since 0.8.0: Use std .step_by() instead
    Return an iterator adaptor that steps n elements in the base iterator -for each iteration. Read more
    source§

    fn map_into<R>(self) -> MapInto<Self, R>
    where +the original iterator. Read more

    source§

    fn map_into<R>(self) -> MapInto<Self, R>
    where Self: Sized, - Self::Item: Into<R>,

    Convert each item of the iterator using the Into trait. Read more
    source§

    fn map_results<F, T, U, E>(self, f: F) -> MapOk<Self, F>
    where - Self: Iterator<Item = Result<T, E>> + Sized, - F: FnMut(T) -> U,

    👎Deprecated since 0.10.0: Use .map_ok() instead
    See .map_ok().
    source§

    fn map_ok<F, T, U, E>(self, f: F) -> MapOk<Self, F>
    where + Self::Item: Into<R>,

    Convert each item of the iterator using the Into trait. Read more
    source§

    fn map_ok<F, T, U, E>(self, f: F) -> MapOk<Self, F>
    where Self: Iterator<Item = Result<T, E>> + Sized, F: FnMut(T) -> U,

    Return an iterator adaptor that applies the provided closure to every Result::Ok value. Result::Err values are -unchanged. Read more
    source§

    fn filter_ok<F, T, E>(self, f: F) -> FilterOk<Self, F> ⓘ
    where +unchanged. Read more

    source§

    fn filter_ok<F, T, E>(self, f: F) -> FilterOk<Self, F> ⓘ
    where Self: Iterator<Item = Result<T, E>> + Sized, F: FnMut(&T) -> bool,

    Return an iterator adaptor that filters every Result::Ok value with the provided closure. Result::Err values are -unchanged. Read more
    source§

    fn filter_map_ok<F, T, U, E>(self, f: F) -> FilterMapOk<Self, F> ⓘ
    where +unchanged. Read more

    source§

    fn filter_map_ok<F, T, U, E>(self, f: F) -> FilterMapOk<Self, F> ⓘ
    where Self: Iterator<Item = Result<T, E>> + Sized, F: FnMut(T) -> Option<U>,

    Return an iterator adaptor that filters and transforms every Result::Ok value with the provided closure. Result::Err -values are unchanged. Read more
    source§

    fn flatten_ok<T, E>(self) -> FlattenOk<Self, T, E> ⓘ
    where +values are unchanged. Read more

    source§

    fn flatten_ok<T, E>(self) -> FlattenOk<Self, T, E> ⓘ
    where Self: Iterator<Item = Result<T, E>> + Sized, T: IntoIterator,

    Return an iterator adaptor that flattens every Result::Ok value into -a series of Result::Ok values. Result::Err values are unchanged. Read more
    source§

    fn process_results<F, T, E, R>(self, processor: F) -> Result<R, E>
    where +a series of Result::Ok values. Result::Err values are unchanged. Read more

    source§

    fn process_results<F, T, E, R>(self, processor: F) -> Result<R, E>
    where Self: Iterator<Item = Result<T, E>> + Sized, F: FnOnce(ProcessResults<'_, Self, E>) -> R,

    “Lift” a function of the values of the current iterator so as to process -an iterator of Result values instead. Read more
    source§

    fn merge<J>(self, other: J) -> Merge<Self, J::IntoIter>
    where +an iterator of Result values instead. Read more

    source§

    fn merge<J>(self, other: J) -> Merge<Self, J::IntoIter>
    where Self: Sized, Self::Item: PartialOrd, J: IntoIterator<Item = Self::Item>,

    Return an iterator adaptor that merges the two base iterators in ascending order. If both base iterators are sorted (ascending), the -result is sorted. Read more
    source§

    fn merge_by<J, F>(self, other: J, is_first: F) -> MergeBy<Self, J::IntoIter, F> ⓘ
    where +result is sorted. Read more

    source§

    fn merge_by<J, F>(self, other: J, is_first: F) -> MergeBy<Self, J::IntoIter, F> ⓘ
    where Self: Sized, J: IntoIterator<Item = Self::Item>, F: FnMut(&Self::Item, &Self::Item) -> bool,

    Return an iterator adaptor that merges the two base iterators in order. -This is much like .merge() but allows for a custom ordering. Read more
    source§

    fn merge_join_by<J, F, T>( +This is much like .merge() but allows for a custom ordering. Read more

    source§

    fn merge_join_by<J, F, T>( self, other: J, cmp_fn: F @@ -306,284 +307,295 @@ This is much like IntoIterator, F: FnMut(&Self::Item, &J::Item) -> T, Self: Sized,

    Create an iterator that merges items from both this and the specified -iterator in ascending order. Read more
    source§

    fn kmerge(self) -> KMerge<<Self::Item as IntoIterator>::IntoIter>
    where +iterator in ascending order. Read more

    source§

    fn kmerge(self) -> KMerge<<Self::Item as IntoIterator>::IntoIter>
    where Self: Sized, Self::Item: IntoIterator, <Self::Item as IntoIterator>::Item: PartialOrd,

    Return an iterator adaptor that flattens an iterator of iterators by -merging them in ascending order. Read more
    source§

    fn kmerge_by<F>( +merging them in ascending order. Read more

    source§

    fn kmerge_by<F>( self, first: F ) -> KMergeBy<<Self::Item as IntoIterator>::IntoIter, F> ⓘ
    where Self: Sized, Self::Item: IntoIterator, F: FnMut(&<Self::Item as IntoIterator>::Item, &<Self::Item as IntoIterator>::Item) -> bool,

    Return an iterator adaptor that flattens an iterator of iterators by -merging them according to the given closure. Read more
    source§

    fn cartesian_product<J>(self, other: J) -> Product<Self, J::IntoIter> ⓘ
    where +merging them according to the given closure. Read more

    source§

    fn cartesian_product<J>(self, other: J) -> Product<Self, J::IntoIter> ⓘ
    where Self: Sized, Self::Item: Clone, J: IntoIterator, J::IntoIter: Clone,

    Return an iterator adaptor that iterates over the cartesian product of -the element sets of two iterators self and J. Read more
    source§

    fn multi_cartesian_product( +the element sets of two iterators self and J. Read more

    source§

    fn multi_cartesian_product( self ) -> MultiProduct<<Self::Item as IntoIterator>::IntoIter> ⓘ
    where Self: Sized, Self::Item: IntoIterator, <Self::Item as IntoIterator>::IntoIter: Clone, <Self::Item as IntoIterator>::Item: Clone,

    Return an iterator adaptor that iterates over the cartesian product of -all subiterators returned by meta-iterator self. Read more
    source§

    fn coalesce<F>(self, f: F) -> Coalesce<Self, F>
    where +all subiterators returned by meta-iterator self. Read more

    source§

    fn coalesce<F>(self, f: F) -> Coalesce<Self, F>
    where Self: Sized, F: FnMut(Self::Item, Self::Item) -> Result<Self::Item, (Self::Item, Self::Item)>,

    Return an iterator adaptor that uses the passed-in closure to -optionally merge together consecutive elements. Read more
    source§

    fn dedup(self) -> Dedup<Self>
    where +optionally merge together consecutive elements. Read more

    source§

    fn dedup(self) -> Dedup<Self>
    where Self: Sized, Self::Item: PartialEq,

    Remove duplicates from sections of consecutive identical elements. -If the iterator is sorted, all elements will be unique. Read more
    source§

    fn dedup_by<Cmp>(self, cmp: Cmp) -> DedupBy<Self, Cmp>
    where +If the iterator is sorted, all elements will be unique. Read more

    source§

    fn dedup_by<Cmp>(self, cmp: Cmp) -> DedupBy<Self, Cmp>
    where Self: Sized, Cmp: FnMut(&Self::Item, &Self::Item) -> bool,

    Remove duplicates from sections of consecutive identical elements, determining equality using a comparison function. -If the iterator is sorted, all elements will be unique. Read more
    source§

    fn dedup_with_count(self) -> DedupWithCount<Self>
    where +If the iterator is sorted, all elements will be unique. Read more

    source§

    fn dedup_with_count(self) -> DedupWithCount<Self>
    where Self: Sized,

    Remove duplicates from sections of consecutive identical elements, while keeping a count of how many repeated elements were present. -If the iterator is sorted, all elements will be unique. Read more
    source§

    fn dedup_by_with_count<Cmp>(self, cmp: Cmp) -> DedupByWithCount<Self, Cmp>
    where +If the iterator is sorted, all elements will be unique. Read more

    source§

    fn dedup_by_with_count<Cmp>(self, cmp: Cmp) -> DedupByWithCount<Self, Cmp>
    where Self: Sized, Cmp: FnMut(&Self::Item, &Self::Item) -> bool,

    Remove duplicates from sections of consecutive identical elements, while keeping a count of how many repeated elements were present. This will determine equality using a comparison function. -If the iterator is sorted, all elements will be unique. Read more
    source§

    fn duplicates(self) -> Duplicates<Self>
    where +If the iterator is sorted, all elements will be unique. Read more

    source§

    fn duplicates(self) -> Duplicates<Self>
    where Self: Sized, Self::Item: Eq + Hash,

    Return an iterator adaptor that produces elements that appear more than once during the -iteration. Duplicates are detected using hash and equality. Read more
    source§

    fn duplicates_by<V, F>(self, f: F) -> DuplicatesBy<Self, V, F>
    where +iteration. Duplicates are detected using hash and equality. Read more

    source§

    fn duplicates_by<V, F>(self, f: F) -> DuplicatesBy<Self, V, F>
    where Self: Sized, V: Eq + Hash, F: FnMut(&Self::Item) -> V,

    Return an iterator adaptor that produces elements that appear more than once during the -iteration. Duplicates are detected using hash and equality. Read more
    source§

    fn unique(self) -> Unique<Self> ⓘ
    where +iteration. Duplicates are detected using hash and equality. Read more

    source§

    fn unique(self) -> Unique<Self> ⓘ
    where Self: Sized, Self::Item: Clone + Eq + Hash,

    Return an iterator adaptor that filters out elements that have already been produced once during the iteration. Duplicates -are detected using hash and equality. Read more
    source§

    fn unique_by<V, F>(self, f: F) -> UniqueBy<Self, V, F> ⓘ
    where +are detected using hash and equality. Read more

    source§

    fn unique_by<V, F>(self, f: F) -> UniqueBy<Self, V, F> ⓘ
    where Self: Sized, V: Eq + Hash, F: FnMut(&Self::Item) -> V,

    Return an iterator adaptor that filters out elements that have -already been produced once during the iteration. Read more
    source§

    fn peeking_take_while<F>(&mut self, accept: F) -> PeekingTakeWhile<'_, Self, F> ⓘ
    where +already been produced once during the iteration. Read more

    source§

    fn peeking_take_while<F>(&mut self, accept: F) -> PeekingTakeWhile<'_, Self, F> ⓘ
    where Self: Sized + PeekingNext, F: FnMut(&Self::Item) -> bool,

    Return an iterator adaptor that borrows from this iterator and -takes items while the closure accept returns true. Read more
    source§

    fn take_while_ref<F>(&mut self, accept: F) -> TakeWhileRef<'_, Self, F> ⓘ
    where +takes items while the closure accept returns true. Read more

    source§

    fn take_while_ref<F>(&mut self, accept: F) -> TakeWhileRef<'_, Self, F> ⓘ
    where Self: Clone, F: FnMut(&Self::Item) -> bool,

    Return an iterator adaptor that borrows from a Clone-able iterator -to only pick off elements while the predicate accept returns true. Read more
    source§

    fn take_while_inclusive<F>(self, accept: F) -> TakeWhileInclusive<Self, F> ⓘ
    where +to only pick off elements while the predicate accept returns true. Read more

    source§

    fn take_while_inclusive<F>(self, accept: F) -> TakeWhileInclusive<Self, F> ⓘ
    where Self: Sized, F: FnMut(&Self::Item) -> bool,

    Returns an iterator adaptor that consumes elements while the given predicate is true, including the element for which the predicate -first returned false. Read more
    source§

    fn while_some<A>(self) -> WhileSome<Self> ⓘ
    where +first returned false. Read more

    source§

    fn while_some<A>(self) -> WhileSome<Self> ⓘ
    where Self: Sized + Iterator<Item = Option<A>>,

    Return an iterator adaptor that filters Option<A> iterator elements -and produces A. Stops on the first None encountered. Read more
    source§

    fn tuple_combinations<T>(self) -> TupleCombinations<Self, T> ⓘ
    where +and produces A. Stops on the first None encountered. Read more

    source§

    fn tuple_combinations<T>(self) -> TupleCombinations<Self, T> ⓘ
    where Self: Sized + Clone, Self::Item: Clone, T: HasCombination<Self>,

    Return an iterator adaptor that iterates over the combinations of the -elements from an iterator. Read more
    source§

    fn combinations(self, k: usize) -> Combinations<Self> ⓘ
    where +elements from an iterator. Read more

    source§

    fn combinations(self, k: usize) -> Combinations<Self> ⓘ
    where Self: Sized, Self::Item: Clone,

    Return an iterator adaptor that iterates over the k-length combinations of -the elements from an iterator. Read more
    source§

    fn combinations_with_replacement( +the elements from an iterator. Read more

    source§

    fn combinations_with_replacement( self, k: usize ) -> CombinationsWithReplacement<Self> ⓘ
    where Self: Sized, Self::Item: Clone,

    Return an iterator that iterates over the k-length combinations of -the elements from an iterator, with replacement. Read more
    source§

    fn permutations(self, k: usize) -> Permutations<Self> ⓘ
    where +the elements from an iterator, with replacement. Read more

    source§

    fn permutations(self, k: usize) -> Permutations<Self> ⓘ
    where Self: Sized, Self::Item: Clone,

    Return an iterator adaptor that iterates over all k-permutations of the -elements from an iterator. Read more
    source§

    fn powerset(self) -> Powerset<Self> ⓘ
    where +elements from an iterator. Read more

    source§

    fn powerset(self) -> Powerset<Self> ⓘ
    where Self: Sized, Self::Item: Clone,

    Return an iterator that iterates through the powerset of the elements from an -iterator. Read more
    source§

    fn pad_using<F>(self, min: usize, f: F) -> PadUsing<Self, F> ⓘ
    where +iterator. Read more

    source§

    fn pad_using<F>(self, min: usize, f: F) -> PadUsing<Self, F> ⓘ
    where Self: Sized, F: FnMut(usize) -> Self::Item,

    Return an iterator adaptor that pads the sequence to a minimum length of -min by filling missing elements using a closure f. Read more
    source§

    fn with_position(self) -> WithPosition<Self> ⓘ
    where +min by filling missing elements using a closure f. Read more

    source§

    fn with_position(self) -> WithPosition<Self> ⓘ
    where Self: Sized,

    Return an iterator adaptor that combines each element with a Position to -ease special-case handling of the first or last elements. Read more
    source§

    fn positions<P>(self, predicate: P) -> Positions<Self, P> ⓘ
    where +ease special-case handling of the first or last elements. Read more

    source§

    fn positions<P>(self, predicate: P) -> Positions<Self, P> ⓘ
    where Self: Sized, P: FnMut(Self::Item) -> bool,

    Return an iterator adaptor that yields the indices of all elements -satisfying a predicate, counted from the start of the iterator. Read more
    source§

    fn update<F>(self, updater: F) -> Update<Self, F> ⓘ
    where +satisfying a predicate, counted from the start of the iterator. Read more

    source§

    fn update<F>(self, updater: F) -> Update<Self, F> ⓘ
    where Self: Sized, F: FnMut(&mut Self::Item),

    Return an iterator adaptor that applies a mutating function -to each element before yielding it. Read more
    source§

    fn next_tuple<T>(&mut self) -> Option<T>
    where +to each element before yielding it. Read more

    source§

    fn next_tuple<T>(&mut self) -> Option<T>
    where Self: Sized + Iterator<Item = T::Item>, T: HomogeneousTuple,

    Advances the iterator and returns the next items grouped in a tuple of -a specific size (up to 12). Read more
    source§

    fn collect_tuple<T>(self) -> Option<T>
    where +a specific size (up to 12). Read more

    source§

    fn collect_tuple<T>(self) -> Option<T>
    where Self: Sized + Iterator<Item = T::Item>, T: HomogeneousTuple,

    Collects all items from the iterator into a tuple of a specific size -(up to 12). Read more
    source§

    fn find_position<P>(&mut self, pred: P) -> Option<(usize, Self::Item)>
    where - P: FnMut(&Self::Item) -> bool,

    Find the position and value of the first element satisfying a predicate. Read more
    source§

    fn find_or_last<P>(self, predicate: P) -> Option<Self::Item>
    where +(up to 12). Read more

    source§

    fn find_position<P>(&mut self, pred: P) -> Option<(usize, Self::Item)>
    where + P: FnMut(&Self::Item) -> bool,

    Find the position and value of the first element satisfying a predicate. Read more
    source§

    fn find_or_last<P>(self, predicate: P) -> Option<Self::Item>
    where Self: Sized, - P: FnMut(&Self::Item) -> bool,

    Find the value of the first element satisfying a predicate or return the last element, if any. Read more
    source§

    fn find_or_first<P>(self, predicate: P) -> Option<Self::Item>
    where + P: FnMut(&Self::Item) -> bool,

    Find the value of the first element satisfying a predicate or return the last element, if any. Read more
    source§

    fn find_or_first<P>(self, predicate: P) -> Option<Self::Item>
    where Self: Sized, - P: FnMut(&Self::Item) -> bool,

    Find the value of the first element satisfying a predicate or return the first element, if any. Read more
    source§

    fn contains<Q>(&mut self, query: &Q) -> bool
    where + P: FnMut(&Self::Item) -> bool,

    Find the value of the first element satisfying a predicate or return the first element, if any. Read more
    source§

    fn contains<Q>(&mut self, query: &Q) -> bool
    where Self: Sized, Self::Item: Borrow<Q>, - Q: PartialEq,

    Returns true if the given item is present in this iterator. Read more
    source§

    fn all_equal(&mut self) -> bool
    where + Q: PartialEq,

    Returns true if the given item is present in this iterator. Read more
    source§

    fn all_equal(&mut self) -> bool
    where Self: Sized, - Self::Item: PartialEq,

    Check whether all elements compare equal. Read more
    source§

    fn all_equal_value( + Self::Item: PartialEq,

    Check whether all elements compare equal. Read more
    source§

    fn all_equal_value( &mut self ) -> Result<Self::Item, Option<(Self::Item, Self::Item)>>
    where Self: Sized, Self::Item: PartialEq,

    If there are elements and they are all equal, return a single copy of that element. If there are no elements, return an Error containing None. If there are elements and they are not all equal, return a tuple containing the first -two non-equal elements found. Read more
    source§

    fn all_unique(&mut self) -> bool
    where +two non-equal elements found. Read more

    source§

    fn all_unique(&mut self) -> bool
    where Self: Sized, - Self::Item: Eq + Hash,

    Check whether all elements are unique (non equal). Read more
    source§

    fn dropping(self, n: usize) -> Self
    where + Self::Item: Eq + Hash,

    Check whether all elements are unique (non equal). Read more
    source§

    fn dropping(self, n: usize) -> Self
    where Self: Sized,

    Consume the first n elements from the iterator eagerly, -and return the same iterator again. Read more
    source§

    fn dropping_back(self, n: usize) -> Self
    where +and return the same iterator again. Read more

    source§

    fn dropping_back(self, n: usize) -> Self
    where Self: Sized + DoubleEndedIterator,

    Consume the last n elements from the iterator eagerly, -and return the same iterator again. Read more
    source§

    fn foreach<F>(self, f: F)
    where - F: FnMut(Self::Item), - Self: Sized,

    👎Deprecated since 0.8.0: Use .for_each() instead
    Run the closure f eagerly on each element of the iterator. Read more
    source§

    fn concat(self) -> Self::Item
    where +and return the same iterator again. Read more

    source§

    fn concat(self) -> Self::Item
    where Self: Sized, - Self::Item: Extend<<<Self as Iterator>::Item as IntoIterator>::Item> + IntoIterator + Default,

    Combine all an iterator’s elements into one element by using Extend. Read more
    source§

    fn collect_vec(self) -> Vec<Self::Item>
    where + Self::Item: Extend<<<Self as Iterator>::Item as IntoIterator>::Item> + IntoIterator + Default,

    Combine all an iterator’s elements into one element by using Extend. Read more
    source§

    fn collect_vec(self) -> Vec<Self::Item>
    where Self: Sized,

    .collect_vec() is simply a type specialization of Iterator::collect, -for convenience.
    source§

    fn try_collect<T, U, E>(self) -> Result<U, E>
    where +for convenience.

    source§

    fn try_collect<T, U, E>(self) -> Result<U, E>
    where Self: Sized + Iterator<Item = Result<T, E>>, Result<U, E>: FromIterator<Result<T, E>>,

    .try_collect() is more convenient way of writing -.collect::<Result<_, _>>() Read more
    source§

    fn set_from<'a, A: 'a, J>(&mut self, from: J) -> usize
    where +.collect::<Result<_, _>>() Read more

    source§

    fn set_from<'a, A: 'a, J>(&mut self, from: J) -> usize
    where Self: Iterator<Item = &'a mut A>, J: IntoIterator<Item = A>,

    Assign to each reference in self from the from iterator, -stopping at the shortest of the two iterators. Read more
    source§

    fn join(&mut self, sep: &str) -> String
    where - Self::Item: Display,

    Combine all iterator elements into one String, separated by sep. Read more
    source§

    fn format(self, sep: &str) -> Format<'_, Self>
    where - Self: Sized,

    Format all iterator elements, separated by sep. Read more
    source§

    fn format_with<F>(self, sep: &str, format: F) -> FormatWith<'_, Self, F>
    where +stopping at the shortest of the two iterators. Read more

    source§

    fn join(&mut self, sep: &str) -> String
    where + Self::Item: Display,

    Combine all iterator elements into one String, separated by sep. Read more
    source§

    fn format(self, sep: &str) -> Format<'_, Self>
    where + Self: Sized,

    Format all iterator elements, separated by sep. Read more
    source§

    fn format_with<F>(self, sep: &str, format: F) -> FormatWith<'_, Self, F>
    where Self: Sized, - F: FnMut(Self::Item, &mut dyn FnMut(&dyn Display) -> Result) -> Result,

    Format all iterator elements, separated by sep. Read more
    source§

    fn fold_results<A, E, B, F>(&mut self, start: B, f: F) -> Result<B, E>
    where + F: FnMut(Self::Item, &mut dyn FnMut(&dyn Display) -> Result) -> Result,

    Format all iterator elements, separated by sep. Read more
    source§

    fn fold_ok<A, E, B, F>(&mut self, start: B, f: F) -> Result<B, E>
    where Self: Iterator<Item = Result<A, E>>, - F: FnMut(B, A) -> B,

    👎Deprecated since 0.10.0: Use .fold_ok() instead
    See .fold_ok().
    source§

    fn fold_ok<A, E, B, F>(&mut self, start: B, f: F) -> Result<B, E>
    where - Self: Iterator<Item = Result<A, E>>, - F: FnMut(B, A) -> B,

    Fold Result values from an iterator. Read more
    source§

    fn fold_options<A, B, F>(&mut self, start: B, f: F) -> Option<B>
    where + F: FnMut(B, A) -> B,

    Fold Result values from an iterator. Read more
    source§

    fn fold_options<A, B, F>(&mut self, start: B, f: F) -> Option<B>
    where Self: Iterator<Item = Option<A>>, - F: FnMut(B, A) -> B,

    Fold Option values from an iterator. Read more
    source§

    fn fold1<F>(self, f: F) -> Option<Self::Item>
    where + F: FnMut(B, A) -> B,

    Fold Option values from an iterator. Read more
    source§

    fn fold1<F>(self, f: F) -> Option<Self::Item>
    where F: FnMut(Self::Item, Self::Item) -> Self::Item, - Self: Sized,

    👎Deprecated since 0.10.2: Use Iterator::reduce instead
    Accumulator of the elements in the iterator. Read more
    source§

    fn tree_fold1<F>(self, f: F) -> Option<Self::Item>
    where + Self: Sized,

    👎Deprecated since 0.10.2: Use Iterator::reduce instead
    Accumulator of the elements in the iterator. Read more
    source§

    fn tree_reduce<F>(self, f: F) -> Option<Self::Item>
    where F: FnMut(Self::Item, Self::Item) -> Self::Item, - Self: Sized,

    Accumulate the elements in the iterator in a tree-like manner. Read more
    source§

    fn fold_while<B, F>(&mut self, init: B, f: F) -> FoldWhile<B>
    where + Self: Sized,

    Accumulate the elements in the iterator in a tree-like manner. Read more
    source§

    fn tree_fold1<F>(self, f: F) -> Option<Self::Item>
    where + F: FnMut(Self::Item, Self::Item) -> Self::Item, + Self: Sized,

    👎Deprecated since 0.13.0: Use .tree_reduce() instead
    See .tree_reduce().
    source§

    fn fold_while<B, F>(&mut self, init: B, f: F) -> FoldWhile<B>
    where Self: Sized, - F: FnMut(B, Self::Item) -> FoldWhile<B>,

    An iterator method that applies a function, producing a single, final value. Read more
    source§

    fn sum1<S>(self) -> Option<S>
    where + F: FnMut(B, Self::Item) -> FoldWhile<B>,

    An iterator method that applies a function, producing a single, final value. Read more
    source§

    fn sum1<S>(self) -> Option<S>
    where Self: Sized, - S: Sum<Self::Item>,

    Iterate over the entire iterator and add all the elements. Read more
    source§

    fn product1<P>(self) -> Option<P>
    where + S: Sum<Self::Item>,

    Iterate over the entire iterator and add all the elements. Read more
    source§

    fn product1<P>(self) -> Option<P>
    where Self: Sized, - P: Product<Self::Item>,

    Iterate over the entire iterator and multiply all the elements. Read more
    source§

    fn sorted_unstable(self) -> IntoIter<Self::Item> ⓘ
    where + P: Product<Self::Item>,

    Iterate over the entire iterator and multiply all the elements. Read more
    source§

    fn sorted_unstable(self) -> IntoIter<Self::Item> ⓘ
    where Self: Sized, - Self::Item: Ord,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_unstable_by<F>(self, cmp: F) -> IntoIter<Self::Item> ⓘ
    where + Self::Item: Ord,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_unstable_by<F>(self, cmp: F) -> IntoIter<Self::Item> ⓘ
    where Self: Sized, - F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_unstable_by_key<K, F>(self, f: F) -> IntoIter<Self::Item> ⓘ
    where + F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_unstable_by_key<K, F>(self, f: F) -> IntoIter<Self::Item> ⓘ
    where Self: Sized, K: Ord, - F: FnMut(&Self::Item) -> K,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted(self) -> IntoIter<Self::Item> ⓘ
    where + F: FnMut(&Self::Item) -> K,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted(self) -> IntoIter<Self::Item> ⓘ
    where Self: Sized, - Self::Item: Ord,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_by<F>(self, cmp: F) -> IntoIter<Self::Item> ⓘ
    where + Self::Item: Ord,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_by<F>(self, cmp: F) -> IntoIter<Self::Item> ⓘ
    where Self: Sized, - F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_by_key<K, F>(self, f: F) -> IntoIter<Self::Item> ⓘ
    where + F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_by_key<K, F>(self, f: F) -> IntoIter<Self::Item> ⓘ
    where Self: Sized, K: Ord, - F: FnMut(&Self::Item) -> K,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_by_cached_key<K, F>(self, f: F) -> IntoIter<Self::Item> ⓘ
    where + F: FnMut(&Self::Item) -> K,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_by_cached_key<K, F>(self, f: F) -> IntoIter<Self::Item> ⓘ
    where Self: Sized, K: Ord, F: FnMut(&Self::Item) -> K,

    Sort all iterator elements into a new iterator in ascending order. The key function is -called exactly once per key. Read more
    source§

    fn k_smallest(self, k: usize) -> IntoIter<Self::Item> ⓘ
    where +called exactly once per key. Read more

    source§

    fn k_smallest(self, k: usize) -> IntoIter<Self::Item> ⓘ
    where Self: Sized, - Self::Item: Ord,

    Sort the k smallest elements into a new iterator, in ascending order. Read more
    source§

    fn partition_map<A, B, F, L, R>(self, predicate: F) -> (A, B)
    where + Self::Item: Ord,

    Sort the k smallest elements into a new iterator, in ascending order. Read more
    source§

    fn k_smallest_by<F>(self, k: usize, cmp: F) -> IntoIter<Self::Item> ⓘ
    where + Self: Sized, + F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Sort the k smallest elements into a new iterator using the provided comparison. Read more
    source§

    fn k_smallest_by_key<F, K>(self, k: usize, key: F) -> IntoIter<Self::Item> ⓘ
    where + Self: Sized, + F: FnMut(&Self::Item) -> K, + K: Ord,

    Return the elements producing the k smallest outputs of the provided function. Read more
    source§

    fn k_largest(self, k: usize) -> IntoIter<Self::Item> ⓘ
    where + Self: Sized, + Self::Item: Ord,

    Sort the k largest elements into a new iterator, in descending order. Read more
    source§

    fn k_largest_by<F>(self, k: usize, cmp: F) -> IntoIter<Self::Item> ⓘ
    where + Self: Sized, + F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Sort the k largest elements into a new iterator using the provided comparison. Read more
    source§

    fn k_largest_by_key<F, K>(self, k: usize, key: F) -> IntoIter<Self::Item> ⓘ
    where + Self: Sized, + F: FnMut(&Self::Item) -> K, + K: Ord,

    Return the elements producing the k largest outputs of the provided function. Read more
    source§

    fn tail(self, n: usize) -> IntoIter<Self::Item> ⓘ
    where + Self: Sized,

    Consumes the iterator and return an iterator of the last n elements. Read more
    source§

    fn partition_map<A, B, F, L, R>(self, predicate: F) -> (A, B)
    where Self: Sized, F: FnMut(Self::Item) -> Either<L, R>, A: Default + Extend<L>, B: Default + Extend<R>,

    Collect all iterator elements into one of two partitions. Unlike Iterator::partition, each partition may -have a distinct type. Read more
    source§

    fn partition_result<A, B, T, E>(self) -> (A, B)
    where +have a distinct type. Read more

    source§

    fn partition_result<A, B, T, E>(self) -> (A, B)
    where Self: Iterator<Item = Result<T, E>> + Sized, A: Default + Extend<T>, B: Default + Extend<E>,

    Partition a sequence of Results into one list of all the Ok elements -and another list of all the Err elements. Read more
    source§

    fn into_group_map<K, V>(self) -> HashMap<K, Vec<V>>
    where +and another list of all the Err elements. Read more

    source§

    fn into_group_map<K, V>(self) -> HashMap<K, Vec<V>>
    where Self: Iterator<Item = (K, V)> + Sized, K: Hash + Eq,

    Return a HashMap of keys mapped to Vecs of values. Keys and values -are taken from (Key, Value) tuple pairs yielded by the input iterator. Read more
    source§

    fn into_group_map_by<K, V, F>(self, f: F) -> HashMap<K, Vec<V>>
    where +are taken from (Key, Value) tuple pairs yielded by the input iterator. Read more

    source§

    fn into_group_map_by<K, V, F>(self, f: F) -> HashMap<K, Vec<V>>
    where Self: Iterator<Item = V> + Sized, K: Hash + Eq, - F: Fn(&V) -> K,

    Return an Iterator on a HashMap. Keys mapped to Vecs of values. The key is specified -in the closure. Read more
    source§

    fn into_grouping_map<K, V>(self) -> GroupingMap<Self>
    where + F: FnMut(&V) -> K,

    Return an Iterator on a HashMap. Keys mapped to Vecs of values. The key is specified +in the closure. Read more
    source§

    fn into_grouping_map<K, V>(self) -> GroupingMap<Self>
    where Self: Iterator<Item = (K, V)> + Sized, K: Hash + Eq,

    Constructs a GroupingMap to be used later with one of the efficient -group-and-fold operations it allows to perform. Read more
    source§

    fn into_grouping_map_by<K, V, F>(self, key_mapper: F) -> GroupingMapBy<Self, F>
    where +group-and-fold operations it allows to perform. Read more

    source§

    fn into_grouping_map_by<K, V, F>(self, key_mapper: F) -> GroupingMapBy<Self, F>
    where Self: Iterator<Item = V> + Sized, K: Hash + Eq, F: FnMut(&V) -> K,

    Constructs a GroupingMap to be used later with one of the efficient -group-and-fold operations it allows to perform. Read more
    source§

    fn min_set(self) -> Vec<Self::Item>
    where +group-and-fold operations it allows to perform. Read more

    source§

    fn min_set(self) -> Vec<Self::Item>
    where Self: Sized, - Self::Item: Ord,

    Return all minimum elements of an iterator. Read more
    source§

    fn min_set_by<F>(self, compare: F) -> Vec<Self::Item>
    where + Self::Item: Ord,

    Return all minimum elements of an iterator. Read more
    source§

    fn min_set_by<F>(self, compare: F) -> Vec<Self::Item>
    where Self: Sized, F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Return all minimum elements of an iterator, as determined by -the specified function. Read more
    source§

    fn min_set_by_key<K, F>(self, key: F) -> Vec<Self::Item>
    where +the specified function. Read more

    source§

    fn min_set_by_key<K, F>(self, key: F) -> Vec<Self::Item>
    where Self: Sized, K: Ord, F: FnMut(&Self::Item) -> K,

    Return all minimum elements of an iterator, as determined by -the specified function. Read more
    source§

    fn max_set(self) -> Vec<Self::Item>
    where +the specified function. Read more

    source§

    fn max_set(self) -> Vec<Self::Item>
    where Self: Sized, - Self::Item: Ord,

    Return all maximum elements of an iterator. Read more
    source§

    fn max_set_by<F>(self, compare: F) -> Vec<Self::Item>
    where + Self::Item: Ord,

    Return all maximum elements of an iterator. Read more
    source§

    fn max_set_by<F>(self, compare: F) -> Vec<Self::Item>
    where Self: Sized, F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Return all maximum elements of an iterator, as determined by -the specified function. Read more
    source§

    fn max_set_by_key<K, F>(self, key: F) -> Vec<Self::Item>
    where +the specified function. Read more

    source§

    fn max_set_by_key<K, F>(self, key: F) -> Vec<Self::Item>
    where Self: Sized, K: Ord, F: FnMut(&Self::Item) -> K,

    Return all maximum elements of an iterator, as determined by -the specified function. Read more
    source§

    fn minmax(self) -> MinMaxResult<Self::Item>
    where +the specified function. Read more

    source§

    fn minmax(self) -> MinMaxResult<Self::Item>
    where Self: Sized, - Self::Item: PartialOrd,

    Return the minimum and maximum elements in the iterator. Read more
    source§

    fn minmax_by_key<K, F>(self, key: F) -> MinMaxResult<Self::Item>
    where + Self::Item: PartialOrd,

    Return the minimum and maximum elements in the iterator. Read more
    source§

    fn minmax_by_key<K, F>(self, key: F) -> MinMaxResult<Self::Item>
    where Self: Sized, K: PartialOrd, F: FnMut(&Self::Item) -> K,

    Return the minimum and maximum element of an iterator, as determined by -the specified function. Read more
    source§

    fn minmax_by<F>(self, compare: F) -> MinMaxResult<Self::Item>
    where +the specified function. Read more

    source§

    fn minmax_by<F>(self, compare: F) -> MinMaxResult<Self::Item>
    where Self: Sized, F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Return the minimum and maximum element of an iterator, as determined by -the specified comparison function. Read more
    source§

    fn position_max(self) -> Option<usize>
    where +the specified comparison function. Read more

    source§

    fn position_max(self) -> Option<usize>
    where Self: Sized, - Self::Item: Ord,

    Return the position of the maximum element in the iterator. Read more
    source§

    fn position_max_by_key<K, F>(self, key: F) -> Option<usize>
    where + Self::Item: Ord,

    Return the position of the maximum element in the iterator. Read more
    source§

    fn position_max_by_key<K, F>(self, key: F) -> Option<usize>
    where Self: Sized, K: Ord, F: FnMut(&Self::Item) -> K,

    Return the position of the maximum element in the iterator, as -determined by the specified function. Read more
    source§

    fn position_max_by<F>(self, compare: F) -> Option<usize>
    where +determined by the specified function. Read more

    source§

    fn position_max_by<F>(self, compare: F) -> Option<usize>
    where Self: Sized, F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Return the position of the maximum element in the iterator, as -determined by the specified comparison function. Read more
    source§

    fn position_min(self) -> Option<usize>
    where +determined by the specified comparison function. Read more

    source§

    fn position_min(self) -> Option<usize>
    where Self: Sized, - Self::Item: Ord,

    Return the position of the minimum element in the iterator. Read more
    source§

    fn position_min_by_key<K, F>(self, key: F) -> Option<usize>
    where + Self::Item: Ord,

    Return the position of the minimum element in the iterator. Read more
    source§

    fn position_min_by_key<K, F>(self, key: F) -> Option<usize>
    where Self: Sized, K: Ord, F: FnMut(&Self::Item) -> K,

    Return the position of the minimum element in the iterator, as -determined by the specified function. Read more
    source§

    fn position_min_by<F>(self, compare: F) -> Option<usize>
    where +determined by the specified function. Read more

    source§

    fn position_min_by<F>(self, compare: F) -> Option<usize>
    where Self: Sized, F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Return the position of the minimum element in the iterator, as -determined by the specified comparison function. Read more
    source§

    fn position_minmax(self) -> MinMaxResult<usize>
    where +determined by the specified comparison function. Read more

    source§

    fn position_minmax(self) -> MinMaxResult<usize>
    where Self: Sized, Self::Item: PartialOrd,

    Return the positions of the minimum and maximum elements in -the iterator. Read more
    source§

    fn position_minmax_by_key<K, F>(self, key: F) -> MinMaxResult<usize>
    where +the iterator. Read more

    source§

    fn position_minmax_by_key<K, F>(self, key: F) -> MinMaxResult<usize>
    where Self: Sized, K: PartialOrd, F: FnMut(&Self::Item) -> K,

    Return the postions of the minimum and maximum elements of an -iterator, as determined by the specified function. Read more
    source§

    fn position_minmax_by<F>(self, compare: F) -> MinMaxResult<usize>
    where +iterator, as determined by the specified function. Read more

    source§

    fn position_minmax_by<F>(self, compare: F) -> MinMaxResult<usize>
    where Self: Sized, F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Return the postions of the minimum and maximum elements of an -iterator, as determined by the specified comparison function. Read more
    source§

    fn exactly_one(self) -> Result<Self::Item, ExactlyOneError<Self>>
    where +iterator, as determined by the specified comparison function. Read more

    source§

    fn exactly_one(self) -> Result<Self::Item, ExactlyOneError<Self>>
    where Self: Sized,

    If the iterator yields exactly one element, that element will be returned, otherwise an error will be returned containing an iterator that has the same output as the input -iterator. Read more
    source§

    fn at_most_one(self) -> Result<Option<Self::Item>, ExactlyOneError<Self>>
    where - Self: Sized,

    If the iterator yields no elements, Ok(None) will be returned. If the iterator yields +iterator. Read more
    source§

    fn at_most_one(self) -> Result<Option<Self::Item>, ExactlyOneError<Self>>
    where + Self: Sized,

    If the iterator yields no elements, Ok(None) will be returned. If the iterator yields exactly one element, that element will be returned, otherwise an error will be returned -containing an iterator that has the same output as the input iterator. Read more
    source§

    fn multipeek(self) -> MultiPeek<Self> ⓘ
    where +containing an iterator that has the same output as the input iterator. Read more

    source§

    fn multipeek(self) -> MultiPeek<Self> ⓘ
    where Self: Sized,

    An iterator adaptor that allows the user to peek at multiple .next() -values without advancing the base iterator. Read more
    source§

    fn counts(self) -> HashMap<Self::Item, usize>
    where +values without advancing the base iterator. Read more

    source§

    fn counts(self) -> HashMap<Self::Item, usize>
    where Self: Sized, Self::Item: Eq + Hash,

    Collect the items in this iterator and return a HashMap which contains each item that appears in the iterator and the number -of times it appears. Read more
    source§

    fn counts_by<K, F>(self, f: F) -> HashMap<K, usize>
    where +of times it appears. Read more

    source§

    fn counts_by<K, F>(self, f: F) -> HashMap<K, usize>
    where Self: Sized, K: Eq + Hash, F: FnMut(Self::Item) -> K,

    Collect the items in this iterator and return a HashMap which contains each item that appears in the iterator and the number of times it appears, -determining identity using a keying function. Read more
    source§

    fn multiunzip<FromI>(self) -> FromI
    where - Self: Sized + MultiUnzip<FromI>,

    Converts an iterator of tuples into a tuple of containers. Read more
    source§

    fn try_len(&self) -> Result<usize, (usize, Option<usize>)>

    Returns the length of the iterator if one exists. +determining identity using a keying function. Read more
    source§

    fn multiunzip<FromI>(self) -> FromI
    where + Self: Sized + MultiUnzip<FromI>,

    Converts an iterator of tuples into a tuple of containers. Read more
    source§

    fn try_len(&self) -> Result<usize, (usize, Option<usize>)>

    Returns the length of the iterator if one exists. Otherwise return self.size_hint(). Read more
    source§

    impl<IT> MultiUnzip<()> for IT
    where IT: Iterator<Item = ()>,

    source§

    fn multiunzip(self)

    Unzip this iterator into multiple collections.
    source§

    impl<IT, A, FromA> MultiUnzip<(FromA,)> for IT
    where IT: Iterator<Item = (A,)>, @@ -687,4 +699,4 @@ Otherwise return self.size_hint(). 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 + 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/itertools/structs/struct.FilterMapOk.html b/itertools/structs/struct.FilterMapOk.html index 5b55cc16c..5a86d14c7 100644 --- a/itertools/structs/struct.FilterMapOk.html +++ b/itertools/structs/struct.FilterMapOk.html @@ -1,12 +1,12 @@ -FilterMapOk in itertools::structs - Rust
    -

    Struct itertools::structs::FilterMapOk

    source · 
    pub struct FilterMapOk<I, F> { /* private fields */ }
    Expand description

    An iterator adapter to filter and apply a transformation on values within a nested Result::Ok.

    +FilterMapOk in itertools::structs - Rust
    +

    Struct itertools::structs::FilterMapOk

    source · 
    pub struct FilterMapOk<I, F> { /* private fields */ }
    Expand description

    An iterator adapter to filter and apply a transformation on values within a nested Result::Ok.

    See .filter_map_ok() for more information.

    -

    Trait Implementations§

    source§

    impl<I: Clone, F: Clone> Clone for FilterMapOk<I, F>

    source§

    fn clone(&self) -> FilterMapOk<I, F> ⓘ

    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<I, F> Debug for FilterMapOk<I, F>
    where - I: Debug,

    source§

    fn fmt(&self, f: &mut Formatter<'_>) -> Result

    Formats the value using the given formatter. Read more
    source§

    impl<I, F, T, U, E> Iterator for FilterMapOk<I, F>
    where +

    Trait Implementations§

    source§

    impl<I: Clone, F: Clone> Clone for FilterMapOk<I, F>

    source§

    fn clone(&self) -> FilterMapOk<I, F> ⓘ

    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<I, F> Debug for FilterMapOk<I, F>
    where + I: Debug,

    source§

    fn fmt(&self, f: &mut Formatter<'_>) -> Result

    Formats the value using the given formatter. Read more
    source§

    impl<I, F, T, U, E> Iterator for FilterMapOk<I, F>
    where I: Iterator<Item = Result<T, E>>, - F: FnMut(T) -> Option<U>,

    §

    type Item = Result<U, E>

    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<Acc, Fold>(self, init: Acc, fold_f: Fold) -> Acc
    where + F: FnMut(T) -> Option<U>,

    §

    type Item = Result<U, E>

    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<Acc, Fold>(self, init: Acc, fold_f: Fold) -> Acc
    where Fold: FnMut(Acc, Self::Item) -> Acc,

    Folds every element into an accumulator by applying an operation, -returning the final result. Read more
    source§

    fn collect<C>(self) -> C
    where +returning the final result. 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 @@ -179,7 +179,7 @@ greater than or equal to those of another. 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, F, T, U, E> FusedIterator for FilterMapOk<I, F>
    where +function. Read more

    source§

    impl<I, F, T, U, E> FusedIterator for FilterMapOk<I, F>
    where I: FusedIterator<Item = Result<T, E>>, F: FnMut(T) -> Option<U>,

    Auto Trait Implementations§

    §

    impl<I, F> Freeze for FilterMapOk<I, F>
    where F: Freeze, @@ -209,86 +209,87 @@ otherwise. Right variant of Either<Self, Self> otherwise. Read more

    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> Itertools for T
    where - T: Iterator + ?Sized,

    source§

    fn interleave<J>(self, other: J) -> Interleave<Self, J::IntoIter> ⓘ
    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> Itertools for T
    where + T: Iterator + ?Sized,

    source§

    fn interleave<J>(self, other: J) -> Interleave<Self, J::IntoIter> ⓘ
    where J: IntoIterator<Item = Self::Item>, - Self: Sized,

    Alternate elements from two iterators until both have run out. Read more
    source§

    fn interleave_shortest<J>( + Self: Sized,

    Alternate elements from two iterators until both have run out. Read more
    source§

    fn interleave_shortest<J>( self, other: J ) -> InterleaveShortest<Self, J::IntoIter> ⓘ
    where J: IntoIterator<Item = Self::Item>, Self: Sized,

    Alternate elements from two iterators until at least one of them has run -out. Read more
    source§

    fn intersperse(self, element: Self::Item) -> Intersperse<Self>
    where +out. Read more

    source§

    fn intersperse(self, element: Self::Item) -> Intersperse<Self>
    where Self: Sized, Self::Item: Clone,

    An iterator adaptor to insert a particular value -between each element of the adapted iterator. Read more
    source§

    fn intersperse_with<F>(self, element: F) -> IntersperseWith<Self, F> ⓘ
    where +between each element of the adapted iterator. Read more

    source§

    fn intersperse_with<F>(self, element: F) -> IntersperseWith<Self, F> ⓘ
    where Self: Sized, F: FnMut() -> Self::Item,

    An iterator adaptor to insert a particular value created by a function -between each element of the adapted iterator. Read more
    source§

    fn zip_longest<J>(self, other: J) -> ZipLongest<Self, J::IntoIter> ⓘ
    where +between each element of the adapted iterator. Read more

    source§

    fn get<R>(self, index: R) -> R::Output
    where + Self: Sized, + R: IteratorIndex<Self>,

    Returns an iterator over a subsection of the iterator. Read more
    source§

    fn zip_longest<J>(self, other: J) -> ZipLongest<Self, J::IntoIter> ⓘ
    where J: IntoIterator, Self: Sized,

    Create an iterator which iterates over both this and the specified -iterator simultaneously, yielding pairs of two optional elements. Read more
    source§

    fn zip_eq<J>(self, other: J) -> ZipEq<Self, J::IntoIter> ⓘ
    where +iterator simultaneously, yielding pairs of two optional elements. Read more

    source§

    fn zip_eq<J>(self, other: J) -> ZipEq<Self, J::IntoIter> ⓘ
    where J: IntoIterator, Self: Sized,

    Create an iterator which iterates over both this and the specified -iterator simultaneously, yielding pairs of elements. Read more
    source§

    fn batching<B, F>(self, f: F) -> Batching<Self, F> ⓘ
    where +iterator simultaneously, yielding pairs of elements. Read more

    source§

    fn batching<B, F>(self, f: F) -> Batching<Self, F> ⓘ
    where F: FnMut(&mut Self) -> Option<B>, Self: Sized,

    A “meta iterator adaptor”. Its closure receives a reference to the iterator and may pick off as many elements as it likes, to produce the -next iterator element. Read more
    source§

    fn group_by<K, F>(self, key: F) -> GroupBy<K, Self, F>
    where +next iterator element. Read more

    source§

    fn chunk_by<K, F>(self, key: F) -> ChunkBy<K, Self, F>
    where Self: Sized, F: FnMut(&Self::Item) -> K, K: PartialEq,

    Return an iterable that can group iterator elements. Consecutive elements that map to the same key (“runs”), are assigned -to the same group. Read more
    source§

    fn chunks(self, size: usize) -> IntoChunks<Self>
    where - Self: Sized,

    Return an iterable that can chunk the iterator. Read more
    source§

    fn tuple_windows<T>(self) -> TupleWindows<Self, T> ⓘ
    where +to the same group. Read more

    source§

    fn group_by<K, F>(self, key: F) -> ChunkBy<K, Self, F>
    where + Self: Sized, + F: FnMut(&Self::Item) -> K, + K: PartialEq,

    👎Deprecated since 0.13.0: Use .chunk_by() instead
    See .chunk_by().
    source§

    fn chunks(self, size: usize) -> IntoChunks<Self>
    where + Self: Sized,

    Return an iterable that can chunk the iterator. Read more
    source§

    fn tuple_windows<T>(self) -> TupleWindows<Self, T> ⓘ
    where Self: Sized + Iterator<Item = T::Item>, T: HomogeneousTuple, T::Item: Clone,

    Return an iterator over all contiguous windows producing tuples of -a specific size (up to 12). Read more
    source§

    fn circular_tuple_windows<T>(self) -> CircularTupleWindows<Self, T> ⓘ
    where +a specific size (up to 12). Read more

    source§

    fn circular_tuple_windows<T>(self) -> CircularTupleWindows<Self, T> ⓘ
    where Self: Sized + Clone + Iterator<Item = T::Item> + ExactSizeIterator, T: TupleCollect + Clone, T::Item: Clone,

    Return an iterator over all windows, wrapping back to the first elements when the window would otherwise exceed the length of the -iterator, producing tuples of a specific size (up to 12). Read more
    source§

    fn tuples<T>(self) -> Tuples<Self, T> ⓘ
    where +iterator, producing tuples of a specific size (up to 12). Read more

    source§

    fn tuples<T>(self) -> Tuples<Self, T> ⓘ
    where Self: Sized + Iterator<Item = T::Item>, T: HomogeneousTuple,

    Return an iterator that groups the items in tuples of a specific size -(up to 12). Read more
    source§

    fn tee(self) -> (Tee<Self>, Tee<Self>)
    where +(up to 12). Read more

    source§

    fn tee(self) -> (Tee<Self>, Tee<Self>)
    where Self: Sized, Self::Item: Clone,

    Split into an iterator pair that both yield all elements from -the original iterator. Read more
    source§

    fn step(self, n: usize) -> Step<Self> ⓘ
    where - Self: Sized,

    👎Deprecated since 0.8.0: Use std .step_by() instead
    Return an iterator adaptor that steps n elements in the base iterator -for each iteration. Read more
    source§

    fn map_into<R>(self) -> MapInto<Self, R>
    where +the original iterator. Read more

    source§

    fn map_into<R>(self) -> MapInto<Self, R>
    where Self: Sized, - Self::Item: Into<R>,

    Convert each item of the iterator using the Into trait. Read more
    source§

    fn map_results<F, T, U, E>(self, f: F) -> MapOk<Self, F>
    where - Self: Iterator<Item = Result<T, E>> + Sized, - F: FnMut(T) -> U,

    👎Deprecated since 0.10.0: Use .map_ok() instead
    See .map_ok().
    source§

    fn map_ok<F, T, U, E>(self, f: F) -> MapOk<Self, F>
    where + Self::Item: Into<R>,

    Convert each item of the iterator using the Into trait. Read more
    source§

    fn map_ok<F, T, U, E>(self, f: F) -> MapOk<Self, F>
    where Self: Iterator<Item = Result<T, E>> + Sized, F: FnMut(T) -> U,

    Return an iterator adaptor that applies the provided closure to every Result::Ok value. Result::Err values are -unchanged. Read more
    source§

    fn filter_ok<F, T, E>(self, f: F) -> FilterOk<Self, F> ⓘ
    where +unchanged. Read more

    source§

    fn filter_ok<F, T, E>(self, f: F) -> FilterOk<Self, F> ⓘ
    where Self: Iterator<Item = Result<T, E>> + Sized, F: FnMut(&T) -> bool,

    Return an iterator adaptor that filters every Result::Ok value with the provided closure. Result::Err values are -unchanged. Read more
    source§

    fn filter_map_ok<F, T, U, E>(self, f: F) -> FilterMapOk<Self, F> ⓘ
    where +unchanged. Read more

    source§

    fn filter_map_ok<F, T, U, E>(self, f: F) -> FilterMapOk<Self, F> ⓘ
    where Self: Iterator<Item = Result<T, E>> + Sized, F: FnMut(T) -> Option<U>,

    Return an iterator adaptor that filters and transforms every Result::Ok value with the provided closure. Result::Err -values are unchanged. Read more
    source§

    fn flatten_ok<T, E>(self) -> FlattenOk<Self, T, E> ⓘ
    where +values are unchanged. Read more

    source§

    fn flatten_ok<T, E>(self) -> FlattenOk<Self, T, E> ⓘ
    where Self: Iterator<Item = Result<T, E>> + Sized, T: IntoIterator,

    Return an iterator adaptor that flattens every Result::Ok value into -a series of Result::Ok values. Result::Err values are unchanged. Read more
    source§

    fn process_results<F, T, E, R>(self, processor: F) -> Result<R, E>
    where +a series of Result::Ok values. Result::Err values are unchanged. Read more

    source§

    fn process_results<F, T, E, R>(self, processor: F) -> Result<R, E>
    where Self: Iterator<Item = Result<T, E>> + Sized, F: FnOnce(ProcessResults<'_, Self, E>) -> R,

    “Lift” a function of the values of the current iterator so as to process -an iterator of Result values instead. Read more
    source§

    fn merge<J>(self, other: J) -> Merge<Self, J::IntoIter>
    where +an iterator of Result values instead. Read more

    source§

    fn merge<J>(self, other: J) -> Merge<Self, J::IntoIter>
    where Self: Sized, Self::Item: PartialOrd, J: IntoIterator<Item = Self::Item>,

    Return an iterator adaptor that merges the two base iterators in ascending order. If both base iterators are sorted (ascending), the -result is sorted. Read more
    source§

    fn merge_by<J, F>(self, other: J, is_first: F) -> MergeBy<Self, J::IntoIter, F> ⓘ
    where +result is sorted. Read more

    source§

    fn merge_by<J, F>(self, other: J, is_first: F) -> MergeBy<Self, J::IntoIter, F> ⓘ
    where Self: Sized, J: IntoIterator<Item = Self::Item>, F: FnMut(&Self::Item, &Self::Item) -> bool,

    Return an iterator adaptor that merges the two base iterators in order. -This is much like .merge() but allows for a custom ordering. Read more
    source§

    fn merge_join_by<J, F, T>( +This is much like .merge() but allows for a custom ordering. Read more

    source§

    fn merge_join_by<J, F, T>( self, other: J, cmp_fn: F @@ -296,285 +297,296 @@ This is much like IntoIterator, F: FnMut(&Self::Item, &J::Item) -> T, Self: Sized,

    Create an iterator that merges items from both this and the specified -iterator in ascending order. Read more
    source§

    fn kmerge(self) -> KMerge<<Self::Item as IntoIterator>::IntoIter>
    where +iterator in ascending order. Read more

    source§

    fn kmerge(self) -> KMerge<<Self::Item as IntoIterator>::IntoIter>
    where Self: Sized, Self::Item: IntoIterator, <Self::Item as IntoIterator>::Item: PartialOrd,

    Return an iterator adaptor that flattens an iterator of iterators by -merging them in ascending order. Read more
    source§

    fn kmerge_by<F>( +merging them in ascending order. Read more

    source§

    fn kmerge_by<F>( self, first: F ) -> KMergeBy<<Self::Item as IntoIterator>::IntoIter, F> ⓘ
    where Self: Sized, Self::Item: IntoIterator, F: FnMut(&<Self::Item as IntoIterator>::Item, &<Self::Item as IntoIterator>::Item) -> bool,

    Return an iterator adaptor that flattens an iterator of iterators by -merging them according to the given closure. Read more
    source§

    fn cartesian_product<J>(self, other: J) -> Product<Self, J::IntoIter> ⓘ
    where +merging them according to the given closure. Read more

    source§

    fn cartesian_product<J>(self, other: J) -> Product<Self, J::IntoIter> ⓘ
    where Self: Sized, Self::Item: Clone, J: IntoIterator, J::IntoIter: Clone,

    Return an iterator adaptor that iterates over the cartesian product of -the element sets of two iterators self and J. Read more
    source§

    fn multi_cartesian_product( +the element sets of two iterators self and J. Read more

    source§

    fn multi_cartesian_product( self ) -> MultiProduct<<Self::Item as IntoIterator>::IntoIter> ⓘ
    where Self: Sized, Self::Item: IntoIterator, <Self::Item as IntoIterator>::IntoIter: Clone, <Self::Item as IntoIterator>::Item: Clone,

    Return an iterator adaptor that iterates over the cartesian product of -all subiterators returned by meta-iterator self. Read more
    source§

    fn coalesce<F>(self, f: F) -> Coalesce<Self, F>
    where +all subiterators returned by meta-iterator self. Read more

    source§

    fn coalesce<F>(self, f: F) -> Coalesce<Self, F>
    where Self: Sized, F: FnMut(Self::Item, Self::Item) -> Result<Self::Item, (Self::Item, Self::Item)>,

    Return an iterator adaptor that uses the passed-in closure to -optionally merge together consecutive elements. Read more
    source§

    fn dedup(self) -> Dedup<Self>
    where +optionally merge together consecutive elements. Read more

    source§

    fn dedup(self) -> Dedup<Self>
    where Self: Sized, Self::Item: PartialEq,

    Remove duplicates from sections of consecutive identical elements. -If the iterator is sorted, all elements will be unique. Read more
    source§

    fn dedup_by<Cmp>(self, cmp: Cmp) -> DedupBy<Self, Cmp>
    where +If the iterator is sorted, all elements will be unique. Read more

    source§

    fn dedup_by<Cmp>(self, cmp: Cmp) -> DedupBy<Self, Cmp>
    where Self: Sized, Cmp: FnMut(&Self::Item, &Self::Item) -> bool,

    Remove duplicates from sections of consecutive identical elements, determining equality using a comparison function. -If the iterator is sorted, all elements will be unique. Read more
    source§

    fn dedup_with_count(self) -> DedupWithCount<Self>
    where +If the iterator is sorted, all elements will be unique. Read more

    source§

    fn dedup_with_count(self) -> DedupWithCount<Self>
    where Self: Sized,

    Remove duplicates from sections of consecutive identical elements, while keeping a count of how many repeated elements were present. -If the iterator is sorted, all elements will be unique. Read more
    source§

    fn dedup_by_with_count<Cmp>(self, cmp: Cmp) -> DedupByWithCount<Self, Cmp>
    where +If the iterator is sorted, all elements will be unique. Read more

    source§

    fn dedup_by_with_count<Cmp>(self, cmp: Cmp) -> DedupByWithCount<Self, Cmp>
    where Self: Sized, Cmp: FnMut(&Self::Item, &Self::Item) -> bool,

    Remove duplicates from sections of consecutive identical elements, while keeping a count of how many repeated elements were present. This will determine equality using a comparison function. -If the iterator is sorted, all elements will be unique. Read more
    source§

    fn duplicates(self) -> Duplicates<Self>
    where +If the iterator is sorted, all elements will be unique. Read more

    source§

    fn duplicates(self) -> Duplicates<Self>
    where Self: Sized, Self::Item: Eq + Hash,

    Return an iterator adaptor that produces elements that appear more than once during the -iteration. Duplicates are detected using hash and equality. Read more
    source§

    fn duplicates_by<V, F>(self, f: F) -> DuplicatesBy<Self, V, F>
    where +iteration. Duplicates are detected using hash and equality. Read more

    source§

    fn duplicates_by<V, F>(self, f: F) -> DuplicatesBy<Self, V, F>
    where Self: Sized, V: Eq + Hash, F: FnMut(&Self::Item) -> V,

    Return an iterator adaptor that produces elements that appear more than once during the -iteration. Duplicates are detected using hash and equality. Read more
    source§

    fn unique(self) -> Unique<Self> ⓘ
    where +iteration. Duplicates are detected using hash and equality. Read more

    source§

    fn unique(self) -> Unique<Self> ⓘ
    where Self: Sized, Self::Item: Clone + Eq + Hash,

    Return an iterator adaptor that filters out elements that have already been produced once during the iteration. Duplicates -are detected using hash and equality. Read more
    source§

    fn unique_by<V, F>(self, f: F) -> UniqueBy<Self, V, F> ⓘ
    where +are detected using hash and equality. Read more

    source§

    fn unique_by<V, F>(self, f: F) -> UniqueBy<Self, V, F> ⓘ
    where Self: Sized, V: Eq + Hash, F: FnMut(&Self::Item) -> V,

    Return an iterator adaptor that filters out elements that have -already been produced once during the iteration. Read more
    source§

    fn peeking_take_while<F>(&mut self, accept: F) -> PeekingTakeWhile<'_, Self, F> ⓘ
    where +already been produced once during the iteration. Read more

    source§

    fn peeking_take_while<F>(&mut self, accept: F) -> PeekingTakeWhile<'_, Self, F> ⓘ
    where Self: Sized + PeekingNext, F: FnMut(&Self::Item) -> bool,

    Return an iterator adaptor that borrows from this iterator and -takes items while the closure accept returns true. Read more
    source§

    fn take_while_ref<F>(&mut self, accept: F) -> TakeWhileRef<'_, Self, F> ⓘ
    where +takes items while the closure accept returns true. Read more

    source§

    fn take_while_ref<F>(&mut self, accept: F) -> TakeWhileRef<'_, Self, F> ⓘ
    where Self: Clone, F: FnMut(&Self::Item) -> bool,

    Return an iterator adaptor that borrows from a Clone-able iterator -to only pick off elements while the predicate accept returns true. Read more
    source§

    fn take_while_inclusive<F>(self, accept: F) -> TakeWhileInclusive<Self, F> ⓘ
    where +to only pick off elements while the predicate accept returns true. Read more

    source§

    fn take_while_inclusive<F>(self, accept: F) -> TakeWhileInclusive<Self, F> ⓘ
    where Self: Sized, F: FnMut(&Self::Item) -> bool,

    Returns an iterator adaptor that consumes elements while the given predicate is true, including the element for which the predicate -first returned false. Read more
    source§

    fn while_some<A>(self) -> WhileSome<Self> ⓘ
    where +first returned false. Read more

    source§

    fn while_some<A>(self) -> WhileSome<Self> ⓘ
    where Self: Sized + Iterator<Item = Option<A>>,

    Return an iterator adaptor that filters Option<A> iterator elements -and produces A. Stops on the first None encountered. Read more
    source§

    fn tuple_combinations<T>(self) -> TupleCombinations<Self, T> ⓘ
    where +and produces A. Stops on the first None encountered. Read more

    source§

    fn tuple_combinations<T>(self) -> TupleCombinations<Self, T> ⓘ
    where Self: Sized + Clone, Self::Item: Clone, T: HasCombination<Self>,

    Return an iterator adaptor that iterates over the combinations of the -elements from an iterator. Read more
    source§

    fn combinations(self, k: usize) -> Combinations<Self> ⓘ
    where +elements from an iterator. Read more

    source§

    fn combinations(self, k: usize) -> Combinations<Self> ⓘ
    where Self: Sized, Self::Item: Clone,

    Return an iterator adaptor that iterates over the k-length combinations of -the elements from an iterator. Read more
    source§

    fn combinations_with_replacement( +the elements from an iterator. Read more

    source§

    fn combinations_with_replacement( self, k: usize ) -> CombinationsWithReplacement<Self> ⓘ
    where Self: Sized, Self::Item: Clone,

    Return an iterator that iterates over the k-length combinations of -the elements from an iterator, with replacement. Read more
    source§

    fn permutations(self, k: usize) -> Permutations<Self> ⓘ
    where +the elements from an iterator, with replacement. Read more

    source§

    fn permutations(self, k: usize) -> Permutations<Self> ⓘ
    where Self: Sized, Self::Item: Clone,

    Return an iterator adaptor that iterates over all k-permutations of the -elements from an iterator. Read more
    source§

    fn powerset(self) -> Powerset<Self> ⓘ
    where +elements from an iterator. Read more

    source§

    fn powerset(self) -> Powerset<Self> ⓘ
    where Self: Sized, Self::Item: Clone,

    Return an iterator that iterates through the powerset of the elements from an -iterator. Read more
    source§

    fn pad_using<F>(self, min: usize, f: F) -> PadUsing<Self, F> ⓘ
    where +iterator. Read more

    source§

    fn pad_using<F>(self, min: usize, f: F) -> PadUsing<Self, F> ⓘ
    where Self: Sized, F: FnMut(usize) -> Self::Item,

    Return an iterator adaptor that pads the sequence to a minimum length of -min by filling missing elements using a closure f. Read more
    source§

    fn with_position(self) -> WithPosition<Self> ⓘ
    where +min by filling missing elements using a closure f. Read more

    source§

    fn with_position(self) -> WithPosition<Self> ⓘ
    where Self: Sized,

    Return an iterator adaptor that combines each element with a Position to -ease special-case handling of the first or last elements. Read more
    source§

    fn positions<P>(self, predicate: P) -> Positions<Self, P> ⓘ
    where +ease special-case handling of the first or last elements. Read more

    source§

    fn positions<P>(self, predicate: P) -> Positions<Self, P> ⓘ
    where Self: Sized, P: FnMut(Self::Item) -> bool,

    Return an iterator adaptor that yields the indices of all elements -satisfying a predicate, counted from the start of the iterator. Read more
    source§

    fn update<F>(self, updater: F) -> Update<Self, F> ⓘ
    where +satisfying a predicate, counted from the start of the iterator. Read more

    source§

    fn update<F>(self, updater: F) -> Update<Self, F> ⓘ
    where Self: Sized, F: FnMut(&mut Self::Item),

    Return an iterator adaptor that applies a mutating function -to each element before yielding it. Read more
    source§

    fn next_tuple<T>(&mut self) -> Option<T>
    where +to each element before yielding it. Read more

    source§

    fn next_tuple<T>(&mut self) -> Option<T>
    where Self: Sized + Iterator<Item = T::Item>, T: HomogeneousTuple,

    Advances the iterator and returns the next items grouped in a tuple of -a specific size (up to 12). Read more
    source§

    fn collect_tuple<T>(self) -> Option<T>
    where +a specific size (up to 12). Read more

    source§

    fn collect_tuple<T>(self) -> Option<T>
    where Self: Sized + Iterator<Item = T::Item>, T: HomogeneousTuple,

    Collects all items from the iterator into a tuple of a specific size -(up to 12). Read more
    source§

    fn find_position<P>(&mut self, pred: P) -> Option<(usize, Self::Item)>
    where - P: FnMut(&Self::Item) -> bool,

    Find the position and value of the first element satisfying a predicate. Read more
    source§

    fn find_or_last<P>(self, predicate: P) -> Option<Self::Item>
    where +(up to 12). Read more

    source§

    fn find_position<P>(&mut self, pred: P) -> Option<(usize, Self::Item)>
    where + P: FnMut(&Self::Item) -> bool,

    Find the position and value of the first element satisfying a predicate. Read more
    source§

    fn find_or_last<P>(self, predicate: P) -> Option<Self::Item>
    where Self: Sized, - P: FnMut(&Self::Item) -> bool,

    Find the value of the first element satisfying a predicate or return the last element, if any. Read more
    source§

    fn find_or_first<P>(self, predicate: P) -> Option<Self::Item>
    where + P: FnMut(&Self::Item) -> bool,

    Find the value of the first element satisfying a predicate or return the last element, if any. Read more
    source§

    fn find_or_first<P>(self, predicate: P) -> Option<Self::Item>
    where Self: Sized, - P: FnMut(&Self::Item) -> bool,

    Find the value of the first element satisfying a predicate or return the first element, if any. Read more
    source§

    fn contains<Q>(&mut self, query: &Q) -> bool
    where + P: FnMut(&Self::Item) -> bool,

    Find the value of the first element satisfying a predicate or return the first element, if any. Read more
    source§

    fn contains<Q>(&mut self, query: &Q) -> bool
    where Self: Sized, Self::Item: Borrow<Q>, - Q: PartialEq,

    Returns true if the given item is present in this iterator. Read more
    source§

    fn all_equal(&mut self) -> bool
    where + Q: PartialEq,

    Returns true if the given item is present in this iterator. Read more
    source§

    fn all_equal(&mut self) -> bool
    where Self: Sized, - Self::Item: PartialEq,

    Check whether all elements compare equal. Read more
    source§

    fn all_equal_value( + Self::Item: PartialEq,

    Check whether all elements compare equal. Read more
    source§

    fn all_equal_value( &mut self ) -> Result<Self::Item, Option<(Self::Item, Self::Item)>>
    where Self: Sized, Self::Item: PartialEq,

    If there are elements and they are all equal, return a single copy of that element. If there are no elements, return an Error containing None. If there are elements and they are not all equal, return a tuple containing the first -two non-equal elements found. Read more
    source§

    fn all_unique(&mut self) -> bool
    where +two non-equal elements found. Read more

    source§

    fn all_unique(&mut self) -> bool
    where Self: Sized, - Self::Item: Eq + Hash,

    Check whether all elements are unique (non equal). Read more
    source§

    fn dropping(self, n: usize) -> Self
    where + Self::Item: Eq + Hash,

    Check whether all elements are unique (non equal). Read more
    source§

    fn dropping(self, n: usize) -> Self
    where Self: Sized,

    Consume the first n elements from the iterator eagerly, -and return the same iterator again. Read more
    source§

    fn dropping_back(self, n: usize) -> Self
    where +and return the same iterator again. Read more

    source§

    fn dropping_back(self, n: usize) -> Self
    where Self: Sized + DoubleEndedIterator,

    Consume the last n elements from the iterator eagerly, -and return the same iterator again. Read more
    source§

    fn foreach<F>(self, f: F)
    where - F: FnMut(Self::Item), - Self: Sized,

    👎Deprecated since 0.8.0: Use .for_each() instead
    Run the closure f eagerly on each element of the iterator. Read more
    source§

    fn concat(self) -> Self::Item
    where +and return the same iterator again. Read more

    source§

    fn concat(self) -> Self::Item
    where Self: Sized, - Self::Item: Extend<<<Self as Iterator>::Item as IntoIterator>::Item> + IntoIterator + Default,

    Combine all an iterator’s elements into one element by using Extend. Read more
    source§

    fn collect_vec(self) -> Vec<Self::Item>
    where + Self::Item: Extend<<<Self as Iterator>::Item as IntoIterator>::Item> + IntoIterator + Default,

    Combine all an iterator’s elements into one element by using Extend. Read more
    source§

    fn collect_vec(self) -> Vec<Self::Item>
    where Self: Sized,

    .collect_vec() is simply a type specialization of Iterator::collect, -for convenience.
    source§

    fn try_collect<T, U, E>(self) -> Result<U, E>
    where +for convenience.

    source§

    fn try_collect<T, U, E>(self) -> Result<U, E>
    where Self: Sized + Iterator<Item = Result<T, E>>, Result<U, E>: FromIterator<Result<T, E>>,

    .try_collect() is more convenient way of writing -.collect::<Result<_, _>>() Read more
    source§

    fn set_from<'a, A: 'a, J>(&mut self, from: J) -> usize
    where +.collect::<Result<_, _>>() Read more

    source§

    fn set_from<'a, A: 'a, J>(&mut self, from: J) -> usize
    where Self: Iterator<Item = &'a mut A>, J: IntoIterator<Item = A>,

    Assign to each reference in self from the from iterator, -stopping at the shortest of the two iterators. Read more
    source§

    fn join(&mut self, sep: &str) -> String
    where - Self::Item: Display,

    Combine all iterator elements into one String, separated by sep. Read more
    source§

    fn format(self, sep: &str) -> Format<'_, Self>
    where - Self: Sized,

    Format all iterator elements, separated by sep. Read more
    source§

    fn format_with<F>(self, sep: &str, format: F) -> FormatWith<'_, Self, F>
    where +stopping at the shortest of the two iterators. Read more

    source§

    fn join(&mut self, sep: &str) -> String
    where + Self::Item: Display,

    Combine all iterator elements into one String, separated by sep. Read more
    source§

    fn format(self, sep: &str) -> Format<'_, Self>
    where + Self: Sized,

    Format all iterator elements, separated by sep. Read more
    source§

    fn format_with<F>(self, sep: &str, format: F) -> FormatWith<'_, Self, F>
    where Self: Sized, - F: FnMut(Self::Item, &mut dyn FnMut(&dyn Display) -> Result) -> Result,

    Format all iterator elements, separated by sep. Read more
    source§

    fn fold_results<A, E, B, F>(&mut self, start: B, f: F) -> Result<B, E>
    where + F: FnMut(Self::Item, &mut dyn FnMut(&dyn Display) -> Result) -> Result,

    Format all iterator elements, separated by sep. Read more
    source§

    fn fold_ok<A, E, B, F>(&mut self, start: B, f: F) -> Result<B, E>
    where Self: Iterator<Item = Result<A, E>>, - F: FnMut(B, A) -> B,

    👎Deprecated since 0.10.0: Use .fold_ok() instead
    See .fold_ok().
    source§

    fn fold_ok<A, E, B, F>(&mut self, start: B, f: F) -> Result<B, E>
    where - Self: Iterator<Item = Result<A, E>>, - F: FnMut(B, A) -> B,

    Fold Result values from an iterator. Read more
    source§

    fn fold_options<A, B, F>(&mut self, start: B, f: F) -> Option<B>
    where + F: FnMut(B, A) -> B,

    Fold Result values from an iterator. Read more
    source§

    fn fold_options<A, B, F>(&mut self, start: B, f: F) -> Option<B>
    where Self: Iterator<Item = Option<A>>, - F: FnMut(B, A) -> B,

    Fold Option values from an iterator. Read more
    source§

    fn fold1<F>(self, f: F) -> Option<Self::Item>
    where + F: FnMut(B, A) -> B,

    Fold Option values from an iterator. Read more
    source§

    fn fold1<F>(self, f: F) -> Option<Self::Item>
    where F: FnMut(Self::Item, Self::Item) -> Self::Item, - Self: Sized,

    👎Deprecated since 0.10.2: Use Iterator::reduce instead
    Accumulator of the elements in the iterator. Read more
    source§

    fn tree_fold1<F>(self, f: F) -> Option<Self::Item>
    where + Self: Sized,

    👎Deprecated since 0.10.2: Use Iterator::reduce instead
    Accumulator of the elements in the iterator. Read more
    source§

    fn tree_reduce<F>(self, f: F) -> Option<Self::Item>
    where F: FnMut(Self::Item, Self::Item) -> Self::Item, - Self: Sized,

    Accumulate the elements in the iterator in a tree-like manner. Read more
    source§

    fn fold_while<B, F>(&mut self, init: B, f: F) -> FoldWhile<B>
    where + Self: Sized,

    Accumulate the elements in the iterator in a tree-like manner. Read more
    source§

    fn tree_fold1<F>(self, f: F) -> Option<Self::Item>
    where + F: FnMut(Self::Item, Self::Item) -> Self::Item, + Self: Sized,

    👎Deprecated since 0.13.0: Use .tree_reduce() instead
    See .tree_reduce().
    source§

    fn fold_while<B, F>(&mut self, init: B, f: F) -> FoldWhile<B>
    where Self: Sized, - F: FnMut(B, Self::Item) -> FoldWhile<B>,

    An iterator method that applies a function, producing a single, final value. Read more
    source§

    fn sum1<S>(self) -> Option<S>
    where + F: FnMut(B, Self::Item) -> FoldWhile<B>,

    An iterator method that applies a function, producing a single, final value. Read more
    source§

    fn sum1<S>(self) -> Option<S>
    where Self: Sized, - S: Sum<Self::Item>,

    Iterate over the entire iterator and add all the elements. Read more
    source§

    fn product1<P>(self) -> Option<P>
    where + S: Sum<Self::Item>,

    Iterate over the entire iterator and add all the elements. Read more
    source§

    fn product1<P>(self) -> Option<P>
    where Self: Sized, - P: Product<Self::Item>,

    Iterate over the entire iterator and multiply all the elements. Read more
    source§

    fn sorted_unstable(self) -> IntoIter<Self::Item> ⓘ
    where + P: Product<Self::Item>,

    Iterate over the entire iterator and multiply all the elements. Read more
    source§

    fn sorted_unstable(self) -> IntoIter<Self::Item> ⓘ
    where Self: Sized, - Self::Item: Ord,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_unstable_by<F>(self, cmp: F) -> IntoIter<Self::Item> ⓘ
    where + Self::Item: Ord,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_unstable_by<F>(self, cmp: F) -> IntoIter<Self::Item> ⓘ
    where Self: Sized, - F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_unstable_by_key<K, F>(self, f: F) -> IntoIter<Self::Item> ⓘ
    where + F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_unstable_by_key<K, F>(self, f: F) -> IntoIter<Self::Item> ⓘ
    where Self: Sized, K: Ord, - F: FnMut(&Self::Item) -> K,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted(self) -> IntoIter<Self::Item> ⓘ
    where + F: FnMut(&Self::Item) -> K,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted(self) -> IntoIter<Self::Item> ⓘ
    where Self: Sized, - Self::Item: Ord,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_by<F>(self, cmp: F) -> IntoIter<Self::Item> ⓘ
    where + Self::Item: Ord,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_by<F>(self, cmp: F) -> IntoIter<Self::Item> ⓘ
    where Self: Sized, - F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_by_key<K, F>(self, f: F) -> IntoIter<Self::Item> ⓘ
    where + F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_by_key<K, F>(self, f: F) -> IntoIter<Self::Item> ⓘ
    where Self: Sized, K: Ord, - F: FnMut(&Self::Item) -> K,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_by_cached_key<K, F>(self, f: F) -> IntoIter<Self::Item> ⓘ
    where + F: FnMut(&Self::Item) -> K,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_by_cached_key<K, F>(self, f: F) -> IntoIter<Self::Item> ⓘ
    where Self: Sized, K: Ord, F: FnMut(&Self::Item) -> K,

    Sort all iterator elements into a new iterator in ascending order. The key function is -called exactly once per key. Read more
    source§

    fn k_smallest(self, k: usize) -> IntoIter<Self::Item> ⓘ
    where +called exactly once per key. Read more

    source§

    fn k_smallest(self, k: usize) -> IntoIter<Self::Item> ⓘ
    where Self: Sized, - Self::Item: Ord,

    Sort the k smallest elements into a new iterator, in ascending order. Read more
    source§

    fn partition_map<A, B, F, L, R>(self, predicate: F) -> (A, B)
    where + Self::Item: Ord,

    Sort the k smallest elements into a new iterator, in ascending order. Read more
    source§

    fn k_smallest_by<F>(self, k: usize, cmp: F) -> IntoIter<Self::Item> ⓘ
    where + Self: Sized, + F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Sort the k smallest elements into a new iterator using the provided comparison. Read more
    source§

    fn k_smallest_by_key<F, K>(self, k: usize, key: F) -> IntoIter<Self::Item> ⓘ
    where + Self: Sized, + F: FnMut(&Self::Item) -> K, + K: Ord,

    Return the elements producing the k smallest outputs of the provided function. Read more
    source§

    fn k_largest(self, k: usize) -> IntoIter<Self::Item> ⓘ
    where + Self: Sized, + Self::Item: Ord,

    Sort the k largest elements into a new iterator, in descending order. Read more
    source§

    fn k_largest_by<F>(self, k: usize, cmp: F) -> IntoIter<Self::Item> ⓘ
    where + Self: Sized, + F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Sort the k largest elements into a new iterator using the provided comparison. Read more
    source§

    fn k_largest_by_key<F, K>(self, k: usize, key: F) -> IntoIter<Self::Item> ⓘ
    where + Self: Sized, + F: FnMut(&Self::Item) -> K, + K: Ord,

    Return the elements producing the k largest outputs of the provided function. Read more
    source§

    fn tail(self, n: usize) -> IntoIter<Self::Item> ⓘ
    where + Self: Sized,

    Consumes the iterator and return an iterator of the last n elements. Read more
    source§

    fn partition_map<A, B, F, L, R>(self, predicate: F) -> (A, B)
    where Self: Sized, F: FnMut(Self::Item) -> Either<L, R>, A: Default + Extend<L>, B: Default + Extend<R>,

    Collect all iterator elements into one of two partitions. Unlike Iterator::partition, each partition may -have a distinct type. Read more
    source§

    fn partition_result<A, B, T, E>(self) -> (A, B)
    where +have a distinct type. Read more

    source§

    fn partition_result<A, B, T, E>(self) -> (A, B)
    where Self: Iterator<Item = Result<T, E>> + Sized, A: Default + Extend<T>, B: Default + Extend<E>,

    Partition a sequence of Results into one list of all the Ok elements -and another list of all the Err elements. Read more
    source§

    fn into_group_map<K, V>(self) -> HashMap<K, Vec<V>>
    where +and another list of all the Err elements. Read more

    source§

    fn into_group_map<K, V>(self) -> HashMap<K, Vec<V>>
    where Self: Iterator<Item = (K, V)> + Sized, K: Hash + Eq,

    Return a HashMap of keys mapped to Vecs of values. Keys and values -are taken from (Key, Value) tuple pairs yielded by the input iterator. Read more
    source§

    fn into_group_map_by<K, V, F>(self, f: F) -> HashMap<K, Vec<V>>
    where +are taken from (Key, Value) tuple pairs yielded by the input iterator. Read more

    source§

    fn into_group_map_by<K, V, F>(self, f: F) -> HashMap<K, Vec<V>>
    where Self: Iterator<Item = V> + Sized, K: Hash + Eq, - F: Fn(&V) -> K,

    Return an Iterator on a HashMap. Keys mapped to Vecs of values. The key is specified -in the closure. Read more
    source§

    fn into_grouping_map<K, V>(self) -> GroupingMap<Self>
    where + F: FnMut(&V) -> K,

    Return an Iterator on a HashMap. Keys mapped to Vecs of values. The key is specified +in the closure. Read more
    source§

    fn into_grouping_map<K, V>(self) -> GroupingMap<Self>
    where Self: Iterator<Item = (K, V)> + Sized, K: Hash + Eq,

    Constructs a GroupingMap to be used later with one of the efficient -group-and-fold operations it allows to perform. Read more
    source§

    fn into_grouping_map_by<K, V, F>(self, key_mapper: F) -> GroupingMapBy<Self, F>
    where +group-and-fold operations it allows to perform. Read more

    source§

    fn into_grouping_map_by<K, V, F>(self, key_mapper: F) -> GroupingMapBy<Self, F>
    where Self: Iterator<Item = V> + Sized, K: Hash + Eq, F: FnMut(&V) -> K,

    Constructs a GroupingMap to be used later with one of the efficient -group-and-fold operations it allows to perform. Read more
    source§

    fn min_set(self) -> Vec<Self::Item>
    where +group-and-fold operations it allows to perform. Read more

    source§

    fn min_set(self) -> Vec<Self::Item>
    where Self: Sized, - Self::Item: Ord,

    Return all minimum elements of an iterator. Read more
    source§

    fn min_set_by<F>(self, compare: F) -> Vec<Self::Item>
    where + Self::Item: Ord,

    Return all minimum elements of an iterator. Read more
    source§

    fn min_set_by<F>(self, compare: F) -> Vec<Self::Item>
    where Self: Sized, F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Return all minimum elements of an iterator, as determined by -the specified function. Read more
    source§

    fn min_set_by_key<K, F>(self, key: F) -> Vec<Self::Item>
    where +the specified function. Read more

    source§

    fn min_set_by_key<K, F>(self, key: F) -> Vec<Self::Item>
    where Self: Sized, K: Ord, F: FnMut(&Self::Item) -> K,

    Return all minimum elements of an iterator, as determined by -the specified function. Read more
    source§

    fn max_set(self) -> Vec<Self::Item>
    where +the specified function. Read more

    source§

    fn max_set(self) -> Vec<Self::Item>
    where Self: Sized, - Self::Item: Ord,

    Return all maximum elements of an iterator. Read more
    source§

    fn max_set_by<F>(self, compare: F) -> Vec<Self::Item>
    where + Self::Item: Ord,

    Return all maximum elements of an iterator. Read more
    source§

    fn max_set_by<F>(self, compare: F) -> Vec<Self::Item>
    where Self: Sized, F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Return all maximum elements of an iterator, as determined by -the specified function. Read more
    source§

    fn max_set_by_key<K, F>(self, key: F) -> Vec<Self::Item>
    where +the specified function. Read more

    source§

    fn max_set_by_key<K, F>(self, key: F) -> Vec<Self::Item>
    where Self: Sized, K: Ord, F: FnMut(&Self::Item) -> K,

    Return all maximum elements of an iterator, as determined by -the specified function. Read more
    source§

    fn minmax(self) -> MinMaxResult<Self::Item>
    where +the specified function. Read more

    source§

    fn minmax(self) -> MinMaxResult<Self::Item>
    where Self: Sized, - Self::Item: PartialOrd,

    Return the minimum and maximum elements in the iterator. Read more
    source§

    fn minmax_by_key<K, F>(self, key: F) -> MinMaxResult<Self::Item>
    where + Self::Item: PartialOrd,

    Return the minimum and maximum elements in the iterator. Read more
    source§

    fn minmax_by_key<K, F>(self, key: F) -> MinMaxResult<Self::Item>
    where Self: Sized, K: PartialOrd, F: FnMut(&Self::Item) -> K,

    Return the minimum and maximum element of an iterator, as determined by -the specified function. Read more
    source§

    fn minmax_by<F>(self, compare: F) -> MinMaxResult<Self::Item>
    where +the specified function. Read more

    source§

    fn minmax_by<F>(self, compare: F) -> MinMaxResult<Self::Item>
    where Self: Sized, F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Return the minimum and maximum element of an iterator, as determined by -the specified comparison function. Read more
    source§

    fn position_max(self) -> Option<usize>
    where +the specified comparison function. Read more

    source§

    fn position_max(self) -> Option<usize>
    where Self: Sized, - Self::Item: Ord,

    Return the position of the maximum element in the iterator. Read more
    source§

    fn position_max_by_key<K, F>(self, key: F) -> Option<usize>
    where + Self::Item: Ord,

    Return the position of the maximum element in the iterator. Read more
    source§

    fn position_max_by_key<K, F>(self, key: F) -> Option<usize>
    where Self: Sized, K: Ord, F: FnMut(&Self::Item) -> K,

    Return the position of the maximum element in the iterator, as -determined by the specified function. Read more
    source§

    fn position_max_by<F>(self, compare: F) -> Option<usize>
    where +determined by the specified function. Read more

    source§

    fn position_max_by<F>(self, compare: F) -> Option<usize>
    where Self: Sized, F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Return the position of the maximum element in the iterator, as -determined by the specified comparison function. Read more
    source§

    fn position_min(self) -> Option<usize>
    where +determined by the specified comparison function. Read more

    source§

    fn position_min(self) -> Option<usize>
    where Self: Sized, - Self::Item: Ord,

    Return the position of the minimum element in the iterator. Read more
    source§

    fn position_min_by_key<K, F>(self, key: F) -> Option<usize>
    where + Self::Item: Ord,

    Return the position of the minimum element in the iterator. Read more
    source§

    fn position_min_by_key<K, F>(self, key: F) -> Option<usize>
    where Self: Sized, K: Ord, F: FnMut(&Self::Item) -> K,

    Return the position of the minimum element in the iterator, as -determined by the specified function. Read more
    source§

    fn position_min_by<F>(self, compare: F) -> Option<usize>
    where +determined by the specified function. Read more

    source§

    fn position_min_by<F>(self, compare: F) -> Option<usize>
    where Self: Sized, F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Return the position of the minimum element in the iterator, as -determined by the specified comparison function. Read more
    source§

    fn position_minmax(self) -> MinMaxResult<usize>
    where +determined by the specified comparison function. Read more

    source§

    fn position_minmax(self) -> MinMaxResult<usize>
    where Self: Sized, Self::Item: PartialOrd,

    Return the positions of the minimum and maximum elements in -the iterator. Read more
    source§

    fn position_minmax_by_key<K, F>(self, key: F) -> MinMaxResult<usize>
    where +the iterator. Read more

    source§

    fn position_minmax_by_key<K, F>(self, key: F) -> MinMaxResult<usize>
    where Self: Sized, K: PartialOrd, F: FnMut(&Self::Item) -> K,

    Return the postions of the minimum and maximum elements of an -iterator, as determined by the specified function. Read more
    source§

    fn position_minmax_by<F>(self, compare: F) -> MinMaxResult<usize>
    where +iterator, as determined by the specified function. Read more

    source§

    fn position_minmax_by<F>(self, compare: F) -> MinMaxResult<usize>
    where Self: Sized, F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Return the postions of the minimum and maximum elements of an -iterator, as determined by the specified comparison function. Read more
    source§

    fn exactly_one(self) -> Result<Self::Item, ExactlyOneError<Self>>
    where +iterator, as determined by the specified comparison function. Read more

    source§

    fn exactly_one(self) -> Result<Self::Item, ExactlyOneError<Self>>
    where Self: Sized,

    If the iterator yields exactly one element, that element will be returned, otherwise an error will be returned containing an iterator that has the same output as the input -iterator. Read more
    source§

    fn at_most_one(self) -> Result<Option<Self::Item>, ExactlyOneError<Self>>
    where - Self: Sized,

    If the iterator yields no elements, Ok(None) will be returned. If the iterator yields +iterator. Read more
    source§

    fn at_most_one(self) -> Result<Option<Self::Item>, ExactlyOneError<Self>>
    where + Self: Sized,

    If the iterator yields no elements, Ok(None) will be returned. If the iterator yields exactly one element, that element will be returned, otherwise an error will be returned -containing an iterator that has the same output as the input iterator. Read more
    source§

    fn multipeek(self) -> MultiPeek<Self> ⓘ
    where +containing an iterator that has the same output as the input iterator. Read more

    source§

    fn multipeek(self) -> MultiPeek<Self> ⓘ
    where Self: Sized,

    An iterator adaptor that allows the user to peek at multiple .next() -values without advancing the base iterator. Read more
    source§

    fn counts(self) -> HashMap<Self::Item, usize>
    where +values without advancing the base iterator. Read more

    source§

    fn counts(self) -> HashMap<Self::Item, usize>
    where Self: Sized, Self::Item: Eq + Hash,

    Collect the items in this iterator and return a HashMap which contains each item that appears in the iterator and the number -of times it appears. Read more
    source§

    fn counts_by<K, F>(self, f: F) -> HashMap<K, usize>
    where +of times it appears. Read more

    source§

    fn counts_by<K, F>(self, f: F) -> HashMap<K, usize>
    where Self: Sized, K: Eq + Hash, F: FnMut(Self::Item) -> K,

    Collect the items in this iterator and return a HashMap which contains each item that appears in the iterator and the number of times it appears, -determining identity using a keying function. Read more
    source§

    fn multiunzip<FromI>(self) -> FromI
    where - Self: Sized + MultiUnzip<FromI>,

    Converts an iterator of tuples into a tuple of containers. Read more
    source§

    fn try_len(&self) -> Result<usize, (usize, Option<usize>)>

    Returns the length of the iterator if one exists. +determining identity using a keying function. Read more
    source§

    fn multiunzip<FromI>(self) -> FromI
    where + Self: Sized + MultiUnzip<FromI>,

    Converts an iterator of tuples into a tuple of containers. Read more
    source§

    fn try_len(&self) -> Result<usize, (usize, Option<usize>)>

    Returns the length of the iterator if one exists. Otherwise return self.size_hint(). Read more
    source§

    impl<T> 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 + 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/itertools/structs/struct.FilterOk.html b/itertools/structs/struct.FilterOk.html index 5bddc5cb8..dca175c13 100644 --- a/itertools/structs/struct.FilterOk.html +++ b/itertools/structs/struct.FilterOk.html @@ -1,12 +1,12 @@ -FilterOk in itertools::structs - Rust
    -

    Struct itertools::structs::FilterOk

    source · 
    pub struct FilterOk<I, F> { /* private fields */ }
    Expand description

    An iterator adapter to filter values within a nested Result::Ok.

    +FilterOk in itertools::structs - Rust
    +

    Struct itertools::structs::FilterOk

    source · 
    pub struct FilterOk<I, F> { /* private fields */ }
    Expand description

    An iterator adapter to filter values within a nested Result::Ok.

    See .filter_ok() for more information.

    -

    Trait Implementations§

    source§

    impl<I: Clone, F: Clone> Clone for FilterOk<I, F>

    source§

    fn clone(&self) -> FilterOk<I, F> ⓘ

    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<I, F> Debug for FilterOk<I, F>
    where - I: Debug,

    source§

    fn fmt(&self, f: &mut Formatter<'_>) -> Result

    Formats the value using the given formatter. Read more
    source§

    impl<I, F, T, E> Iterator for FilterOk<I, F>
    where +

    Trait Implementations§

    source§

    impl<I: Clone, F: Clone> Clone for FilterOk<I, F>

    source§

    fn clone(&self) -> FilterOk<I, F> ⓘ

    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<I, F> Debug for FilterOk<I, F>
    where + I: Debug,

    source§

    fn fmt(&self, f: &mut Formatter<'_>) -> Result

    Formats the value using the given formatter. Read more
    source§

    impl<I, F, T, E> Iterator for FilterOk<I, F>
    where I: Iterator<Item = Result<T, E>>, - F: FnMut(&T) -> bool,

    §

    type Item = Result<T, E>

    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<Acc, Fold>(self, init: Acc, fold_f: Fold) -> Acc
    where + F: FnMut(&T) -> bool,

    §

    type Item = Result<T, E>

    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<Acc, Fold>(self, init: Acc, fold_f: Fold) -> Acc
    where Fold: FnMut(Acc, Self::Item) -> Acc,

    Folds every element into an accumulator by applying an operation, -returning the final result. Read more
    source§

    fn collect<C>(self) -> C
    where +returning the final result. 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 @@ -179,7 +179,7 @@ greater than or equal to those of another. 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, F, T, E> FusedIterator for FilterOk<I, F>
    where +function. Read more

    source§

    impl<I, F, T, E> FusedIterator for FilterOk<I, F>
    where I: FusedIterator<Item = Result<T, E>>, F: FnMut(&T) -> bool,

    Auto Trait Implementations§

    §

    impl<I, F> Freeze for FilterOk<I, F>
    where F: Freeze, @@ -209,86 +209,87 @@ otherwise. Right variant of Either<Self, Self> otherwise. Read more

    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> Itertools for T
    where - T: Iterator + ?Sized,

    source§

    fn interleave<J>(self, other: J) -> Interleave<Self, J::IntoIter> ⓘ
    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> Itertools for T
    where + T: Iterator + ?Sized,

    source§

    fn interleave<J>(self, other: J) -> Interleave<Self, J::IntoIter> ⓘ
    where J: IntoIterator<Item = Self::Item>, - Self: Sized,

    Alternate elements from two iterators until both have run out. Read more
    source§

    fn interleave_shortest<J>( + Self: Sized,

    Alternate elements from two iterators until both have run out. Read more
    source§

    fn interleave_shortest<J>( self, other: J ) -> InterleaveShortest<Self, J::IntoIter> ⓘ
    where J: IntoIterator<Item = Self::Item>, Self: Sized,

    Alternate elements from two iterators until at least one of them has run -out. Read more
    source§

    fn intersperse(self, element: Self::Item) -> Intersperse<Self>
    where +out. Read more

    source§

    fn intersperse(self, element: Self::Item) -> Intersperse<Self>
    where Self: Sized, Self::Item: Clone,

    An iterator adaptor to insert a particular value -between each element of the adapted iterator. Read more
    source§

    fn intersperse_with<F>(self, element: F) -> IntersperseWith<Self, F> ⓘ
    where +between each element of the adapted iterator. Read more

    source§

    fn intersperse_with<F>(self, element: F) -> IntersperseWith<Self, F> ⓘ
    where Self: Sized, F: FnMut() -> Self::Item,

    An iterator adaptor to insert a particular value created by a function -between each element of the adapted iterator. Read more
    source§

    fn zip_longest<J>(self, other: J) -> ZipLongest<Self, J::IntoIter> ⓘ
    where +between each element of the adapted iterator. Read more

    source§

    fn get<R>(self, index: R) -> R::Output
    where + Self: Sized, + R: IteratorIndex<Self>,

    Returns an iterator over a subsection of the iterator. Read more
    source§

    fn zip_longest<J>(self, other: J) -> ZipLongest<Self, J::IntoIter> ⓘ
    where J: IntoIterator, Self: Sized,

    Create an iterator which iterates over both this and the specified -iterator simultaneously, yielding pairs of two optional elements. Read more
    source§

    fn zip_eq<J>(self, other: J) -> ZipEq<Self, J::IntoIter> ⓘ
    where +iterator simultaneously, yielding pairs of two optional elements. Read more

    source§

    fn zip_eq<J>(self, other: J) -> ZipEq<Self, J::IntoIter> ⓘ
    where J: IntoIterator, Self: Sized,

    Create an iterator which iterates over both this and the specified -iterator simultaneously, yielding pairs of elements. Read more
    source§

    fn batching<B, F>(self, f: F) -> Batching<Self, F> ⓘ
    where +iterator simultaneously, yielding pairs of elements. Read more

    source§

    fn batching<B, F>(self, f: F) -> Batching<Self, F> ⓘ
    where F: FnMut(&mut Self) -> Option<B>, Self: Sized,

    A “meta iterator adaptor”. Its closure receives a reference to the iterator and may pick off as many elements as it likes, to produce the -next iterator element. Read more
    source§

    fn group_by<K, F>(self, key: F) -> GroupBy<K, Self, F>
    where +next iterator element. Read more

    source§

    fn chunk_by<K, F>(self, key: F) -> ChunkBy<K, Self, F>
    where Self: Sized, F: FnMut(&Self::Item) -> K, K: PartialEq,

    Return an iterable that can group iterator elements. Consecutive elements that map to the same key (“runs”), are assigned -to the same group. Read more
    source§

    fn chunks(self, size: usize) -> IntoChunks<Self>
    where - Self: Sized,

    Return an iterable that can chunk the iterator. Read more
    source§

    fn tuple_windows<T>(self) -> TupleWindows<Self, T> ⓘ
    where +to the same group. Read more

    source§

    fn group_by<K, F>(self, key: F) -> ChunkBy<K, Self, F>
    where + Self: Sized, + F: FnMut(&Self::Item) -> K, + K: PartialEq,

    👎Deprecated since 0.13.0: Use .chunk_by() instead
    See .chunk_by().
    source§

    fn chunks(self, size: usize) -> IntoChunks<Self>
    where + Self: Sized,

    Return an iterable that can chunk the iterator. Read more
    source§

    fn tuple_windows<T>(self) -> TupleWindows<Self, T> ⓘ
    where Self: Sized + Iterator<Item = T::Item>, T: HomogeneousTuple, T::Item: Clone,

    Return an iterator over all contiguous windows producing tuples of -a specific size (up to 12). Read more
    source§

    fn circular_tuple_windows<T>(self) -> CircularTupleWindows<Self, T> ⓘ
    where +a specific size (up to 12). Read more

    source§

    fn circular_tuple_windows<T>(self) -> CircularTupleWindows<Self, T> ⓘ
    where Self: Sized + Clone + Iterator<Item = T::Item> + ExactSizeIterator, T: TupleCollect + Clone, T::Item: Clone,

    Return an iterator over all windows, wrapping back to the first elements when the window would otherwise exceed the length of the -iterator, producing tuples of a specific size (up to 12). Read more
    source§

    fn tuples<T>(self) -> Tuples<Self, T> ⓘ
    where +iterator, producing tuples of a specific size (up to 12). Read more

    source§

    fn tuples<T>(self) -> Tuples<Self, T> ⓘ
    where Self: Sized + Iterator<Item = T::Item>, T: HomogeneousTuple,

    Return an iterator that groups the items in tuples of a specific size -(up to 12). Read more
    source§

    fn tee(self) -> (Tee<Self>, Tee<Self>)
    where +(up to 12). Read more

    source§

    fn tee(self) -> (Tee<Self>, Tee<Self>)
    where Self: Sized, Self::Item: Clone,

    Split into an iterator pair that both yield all elements from -the original iterator. Read more
    source§

    fn step(self, n: usize) -> Step<Self> ⓘ
    where - Self: Sized,

    👎Deprecated since 0.8.0: Use std .step_by() instead
    Return an iterator adaptor that steps n elements in the base iterator -for each iteration. Read more
    source§

    fn map_into<R>(self) -> MapInto<Self, R>
    where +the original iterator. Read more

    source§

    fn map_into<R>(self) -> MapInto<Self, R>
    where Self: Sized, - Self::Item: Into<R>,

    Convert each item of the iterator using the Into trait. Read more
    source§

    fn map_results<F, T, U, E>(self, f: F) -> MapOk<Self, F>
    where - Self: Iterator<Item = Result<T, E>> + Sized, - F: FnMut(T) -> U,

    👎Deprecated since 0.10.0: Use .map_ok() instead
    See .map_ok().
    source§

    fn map_ok<F, T, U, E>(self, f: F) -> MapOk<Self, F>
    where + Self::Item: Into<R>,

    Convert each item of the iterator using the Into trait. Read more
    source§

    fn map_ok<F, T, U, E>(self, f: F) -> MapOk<Self, F>
    where Self: Iterator<Item = Result<T, E>> + Sized, F: FnMut(T) -> U,

    Return an iterator adaptor that applies the provided closure to every Result::Ok value. Result::Err values are -unchanged. Read more
    source§

    fn filter_ok<F, T, E>(self, f: F) -> FilterOk<Self, F> ⓘ
    where +unchanged. Read more

    source§

    fn filter_ok<F, T, E>(self, f: F) -> FilterOk<Self, F> ⓘ
    where Self: Iterator<Item = Result<T, E>> + Sized, F: FnMut(&T) -> bool,

    Return an iterator adaptor that filters every Result::Ok value with the provided closure. Result::Err values are -unchanged. Read more
    source§

    fn filter_map_ok<F, T, U, E>(self, f: F) -> FilterMapOk<Self, F> ⓘ
    where +unchanged. Read more

    source§

    fn filter_map_ok<F, T, U, E>(self, f: F) -> FilterMapOk<Self, F> ⓘ
    where Self: Iterator<Item = Result<T, E>> + Sized, F: FnMut(T) -> Option<U>,

    Return an iterator adaptor that filters and transforms every Result::Ok value with the provided closure. Result::Err -values are unchanged. Read more
    source§

    fn flatten_ok<T, E>(self) -> FlattenOk<Self, T, E> ⓘ
    where +values are unchanged. Read more

    source§

    fn flatten_ok<T, E>(self) -> FlattenOk<Self, T, E> ⓘ
    where Self: Iterator<Item = Result<T, E>> + Sized, T: IntoIterator,

    Return an iterator adaptor that flattens every Result::Ok value into -a series of Result::Ok values. Result::Err values are unchanged. Read more
    source§

    fn process_results<F, T, E, R>(self, processor: F) -> Result<R, E>
    where +a series of Result::Ok values. Result::Err values are unchanged. Read more

    source§

    fn process_results<F, T, E, R>(self, processor: F) -> Result<R, E>
    where Self: Iterator<Item = Result<T, E>> + Sized, F: FnOnce(ProcessResults<'_, Self, E>) -> R,

    “Lift” a function of the values of the current iterator so as to process -an iterator of Result values instead. Read more
    source§

    fn merge<J>(self, other: J) -> Merge<Self, J::IntoIter>
    where +an iterator of Result values instead. Read more

    source§

    fn merge<J>(self, other: J) -> Merge<Self, J::IntoIter>
    where Self: Sized, Self::Item: PartialOrd, J: IntoIterator<Item = Self::Item>,

    Return an iterator adaptor that merges the two base iterators in ascending order. If both base iterators are sorted (ascending), the -result is sorted. Read more
    source§

    fn merge_by<J, F>(self, other: J, is_first: F) -> MergeBy<Self, J::IntoIter, F> ⓘ
    where +result is sorted. Read more

    source§

    fn merge_by<J, F>(self, other: J, is_first: F) -> MergeBy<Self, J::IntoIter, F> ⓘ
    where Self: Sized, J: IntoIterator<Item = Self::Item>, F: FnMut(&Self::Item, &Self::Item) -> bool,

    Return an iterator adaptor that merges the two base iterators in order. -This is much like .merge() but allows for a custom ordering. Read more
    source§

    fn merge_join_by<J, F, T>( +This is much like .merge() but allows for a custom ordering. Read more

    source§

    fn merge_join_by<J, F, T>( self, other: J, cmp_fn: F @@ -296,285 +297,296 @@ This is much like IntoIterator, F: FnMut(&Self::Item, &J::Item) -> T, Self: Sized,

    Create an iterator that merges items from both this and the specified -iterator in ascending order. Read more
    source§

    fn kmerge(self) -> KMerge<<Self::Item as IntoIterator>::IntoIter>
    where +iterator in ascending order. Read more

    source§

    fn kmerge(self) -> KMerge<<Self::Item as IntoIterator>::IntoIter>
    where Self: Sized, Self::Item: IntoIterator, <Self::Item as IntoIterator>::Item: PartialOrd,

    Return an iterator adaptor that flattens an iterator of iterators by -merging them in ascending order. Read more
    source§

    fn kmerge_by<F>( +merging them in ascending order. Read more

    source§

    fn kmerge_by<F>( self, first: F ) -> KMergeBy<<Self::Item as IntoIterator>::IntoIter, F> ⓘ
    where Self: Sized, Self::Item: IntoIterator, F: FnMut(&<Self::Item as IntoIterator>::Item, &<Self::Item as IntoIterator>::Item) -> bool,

    Return an iterator adaptor that flattens an iterator of iterators by -merging them according to the given closure. Read more
    source§

    fn cartesian_product<J>(self, other: J) -> Product<Self, J::IntoIter> ⓘ
    where +merging them according to the given closure. Read more

    source§

    fn cartesian_product<J>(self, other: J) -> Product<Self, J::IntoIter> ⓘ
    where Self: Sized, Self::Item: Clone, J: IntoIterator, J::IntoIter: Clone,

    Return an iterator adaptor that iterates over the cartesian product of -the element sets of two iterators self and J. Read more
    source§

    fn multi_cartesian_product( +the element sets of two iterators self and J. Read more

    source§

    fn multi_cartesian_product( self ) -> MultiProduct<<Self::Item as IntoIterator>::IntoIter> ⓘ
    where Self: Sized, Self::Item: IntoIterator, <Self::Item as IntoIterator>::IntoIter: Clone, <Self::Item as IntoIterator>::Item: Clone,

    Return an iterator adaptor that iterates over the cartesian product of -all subiterators returned by meta-iterator self. Read more
    source§

    fn coalesce<F>(self, f: F) -> Coalesce<Self, F>
    where +all subiterators returned by meta-iterator self. Read more

    source§

    fn coalesce<F>(self, f: F) -> Coalesce<Self, F>
    where Self: Sized, F: FnMut(Self::Item, Self::Item) -> Result<Self::Item, (Self::Item, Self::Item)>,

    Return an iterator adaptor that uses the passed-in closure to -optionally merge together consecutive elements. Read more
    source§

    fn dedup(self) -> Dedup<Self>
    where +optionally merge together consecutive elements. Read more

    source§

    fn dedup(self) -> Dedup<Self>
    where Self: Sized, Self::Item: PartialEq,

    Remove duplicates from sections of consecutive identical elements. -If the iterator is sorted, all elements will be unique. Read more
    source§

    fn dedup_by<Cmp>(self, cmp: Cmp) -> DedupBy<Self, Cmp>
    where +If the iterator is sorted, all elements will be unique. Read more

    source§

    fn dedup_by<Cmp>(self, cmp: Cmp) -> DedupBy<Self, Cmp>
    where Self: Sized, Cmp: FnMut(&Self::Item, &Self::Item) -> bool,

    Remove duplicates from sections of consecutive identical elements, determining equality using a comparison function. -If the iterator is sorted, all elements will be unique. Read more
    source§

    fn dedup_with_count(self) -> DedupWithCount<Self>
    where +If the iterator is sorted, all elements will be unique. Read more

    source§

    fn dedup_with_count(self) -> DedupWithCount<Self>
    where Self: Sized,

    Remove duplicates from sections of consecutive identical elements, while keeping a count of how many repeated elements were present. -If the iterator is sorted, all elements will be unique. Read more
    source§

    fn dedup_by_with_count<Cmp>(self, cmp: Cmp) -> DedupByWithCount<Self, Cmp>
    where +If the iterator is sorted, all elements will be unique. Read more

    source§

    fn dedup_by_with_count<Cmp>(self, cmp: Cmp) -> DedupByWithCount<Self, Cmp>
    where Self: Sized, Cmp: FnMut(&Self::Item, &Self::Item) -> bool,

    Remove duplicates from sections of consecutive identical elements, while keeping a count of how many repeated elements were present. This will determine equality using a comparison function. -If the iterator is sorted, all elements will be unique. Read more
    source§

    fn duplicates(self) -> Duplicates<Self>
    where +If the iterator is sorted, all elements will be unique. Read more

    source§

    fn duplicates(self) -> Duplicates<Self>
    where Self: Sized, Self::Item: Eq + Hash,

    Return an iterator adaptor that produces elements that appear more than once during the -iteration. Duplicates are detected using hash and equality. Read more
    source§

    fn duplicates_by<V, F>(self, f: F) -> DuplicatesBy<Self, V, F>
    where +iteration. Duplicates are detected using hash and equality. Read more

    source§

    fn duplicates_by<V, F>(self, f: F) -> DuplicatesBy<Self, V, F>
    where Self: Sized, V: Eq + Hash, F: FnMut(&Self::Item) -> V,

    Return an iterator adaptor that produces elements that appear more than once during the -iteration. Duplicates are detected using hash and equality. Read more
    source§

    fn unique(self) -> Unique<Self> ⓘ
    where +iteration. Duplicates are detected using hash and equality. Read more

    source§

    fn unique(self) -> Unique<Self> ⓘ
    where Self: Sized, Self::Item: Clone + Eq + Hash,

    Return an iterator adaptor that filters out elements that have already been produced once during the iteration. Duplicates -are detected using hash and equality. Read more
    source§

    fn unique_by<V, F>(self, f: F) -> UniqueBy<Self, V, F> ⓘ
    where +are detected using hash and equality. Read more

    source§

    fn unique_by<V, F>(self, f: F) -> UniqueBy<Self, V, F> ⓘ
    where Self: Sized, V: Eq + Hash, F: FnMut(&Self::Item) -> V,

    Return an iterator adaptor that filters out elements that have -already been produced once during the iteration. Read more
    source§

    fn peeking_take_while<F>(&mut self, accept: F) -> PeekingTakeWhile<'_, Self, F> ⓘ
    where +already been produced once during the iteration. Read more

    source§

    fn peeking_take_while<F>(&mut self, accept: F) -> PeekingTakeWhile<'_, Self, F> ⓘ
    where Self: Sized + PeekingNext, F: FnMut(&Self::Item) -> bool,

    Return an iterator adaptor that borrows from this iterator and -takes items while the closure accept returns true. Read more
    source§

    fn take_while_ref<F>(&mut self, accept: F) -> TakeWhileRef<'_, Self, F> ⓘ
    where +takes items while the closure accept returns true. Read more

    source§

    fn take_while_ref<F>(&mut self, accept: F) -> TakeWhileRef<'_, Self, F> ⓘ
    where Self: Clone, F: FnMut(&Self::Item) -> bool,

    Return an iterator adaptor that borrows from a Clone-able iterator -to only pick off elements while the predicate accept returns true. Read more
    source§

    fn take_while_inclusive<F>(self, accept: F) -> TakeWhileInclusive<Self, F> ⓘ
    where +to only pick off elements while the predicate accept returns true. Read more

    source§

    fn take_while_inclusive<F>(self, accept: F) -> TakeWhileInclusive<Self, F> ⓘ
    where Self: Sized, F: FnMut(&Self::Item) -> bool,

    Returns an iterator adaptor that consumes elements while the given predicate is true, including the element for which the predicate -first returned false. Read more
    source§

    fn while_some<A>(self) -> WhileSome<Self> ⓘ
    where +first returned false. Read more

    source§

    fn while_some<A>(self) -> WhileSome<Self> ⓘ
    where Self: Sized + Iterator<Item = Option<A>>,

    Return an iterator adaptor that filters Option<A> iterator elements -and produces A. Stops on the first None encountered. Read more
    source§

    fn tuple_combinations<T>(self) -> TupleCombinations<Self, T> ⓘ
    where +and produces A. Stops on the first None encountered. Read more

    source§

    fn tuple_combinations<T>(self) -> TupleCombinations<Self, T> ⓘ
    where Self: Sized + Clone, Self::Item: Clone, T: HasCombination<Self>,

    Return an iterator adaptor that iterates over the combinations of the -elements from an iterator. Read more
    source§

    fn combinations(self, k: usize) -> Combinations<Self> ⓘ
    where +elements from an iterator. Read more

    source§

    fn combinations(self, k: usize) -> Combinations<Self> ⓘ
    where Self: Sized, Self::Item: Clone,

    Return an iterator adaptor that iterates over the k-length combinations of -the elements from an iterator. Read more
    source§

    fn combinations_with_replacement( +the elements from an iterator. Read more

    source§

    fn combinations_with_replacement( self, k: usize ) -> CombinationsWithReplacement<Self> ⓘ
    where Self: Sized, Self::Item: Clone,

    Return an iterator that iterates over the k-length combinations of -the elements from an iterator, with replacement. Read more
    source§

    fn permutations(self, k: usize) -> Permutations<Self> ⓘ
    where +the elements from an iterator, with replacement. Read more

    source§

    fn permutations(self, k: usize) -> Permutations<Self> ⓘ
    where Self: Sized, Self::Item: Clone,

    Return an iterator adaptor that iterates over all k-permutations of the -elements from an iterator. Read more
    source§

    fn powerset(self) -> Powerset<Self> ⓘ
    where +elements from an iterator. Read more

    source§

    fn powerset(self) -> Powerset<Self> ⓘ
    where Self: Sized, Self::Item: Clone,

    Return an iterator that iterates through the powerset of the elements from an -iterator. Read more
    source§

    fn pad_using<F>(self, min: usize, f: F) -> PadUsing<Self, F> ⓘ
    where +iterator. Read more

    source§

    fn pad_using<F>(self, min: usize, f: F) -> PadUsing<Self, F> ⓘ
    where Self: Sized, F: FnMut(usize) -> Self::Item,

    Return an iterator adaptor that pads the sequence to a minimum length of -min by filling missing elements using a closure f. Read more
    source§

    fn with_position(self) -> WithPosition<Self> ⓘ
    where +min by filling missing elements using a closure f. Read more

    source§

    fn with_position(self) -> WithPosition<Self> ⓘ
    where Self: Sized,

    Return an iterator adaptor that combines each element with a Position to -ease special-case handling of the first or last elements. Read more
    source§

    fn positions<P>(self, predicate: P) -> Positions<Self, P> ⓘ
    where +ease special-case handling of the first or last elements. Read more

    source§

    fn positions<P>(self, predicate: P) -> Positions<Self, P> ⓘ
    where Self: Sized, P: FnMut(Self::Item) -> bool,

    Return an iterator adaptor that yields the indices of all elements -satisfying a predicate, counted from the start of the iterator. Read more
    source§

    fn update<F>(self, updater: F) -> Update<Self, F> ⓘ
    where +satisfying a predicate, counted from the start of the iterator. Read more

    source§

    fn update<F>(self, updater: F) -> Update<Self, F> ⓘ
    where Self: Sized, F: FnMut(&mut Self::Item),

    Return an iterator adaptor that applies a mutating function -to each element before yielding it. Read more
    source§

    fn next_tuple<T>(&mut self) -> Option<T>
    where +to each element before yielding it. Read more

    source§

    fn next_tuple<T>(&mut self) -> Option<T>
    where Self: Sized + Iterator<Item = T::Item>, T: HomogeneousTuple,

    Advances the iterator and returns the next items grouped in a tuple of -a specific size (up to 12). Read more
    source§

    fn collect_tuple<T>(self) -> Option<T>
    where +a specific size (up to 12). Read more

    source§

    fn collect_tuple<T>(self) -> Option<T>
    where Self: Sized + Iterator<Item = T::Item>, T: HomogeneousTuple,

    Collects all items from the iterator into a tuple of a specific size -(up to 12). Read more
    source§

    fn find_position<P>(&mut self, pred: P) -> Option<(usize, Self::Item)>
    where - P: FnMut(&Self::Item) -> bool,

    Find the position and value of the first element satisfying a predicate. Read more
    source§

    fn find_or_last<P>(self, predicate: P) -> Option<Self::Item>
    where +(up to 12). Read more

    source§

    fn find_position<P>(&mut self, pred: P) -> Option<(usize, Self::Item)>
    where + P: FnMut(&Self::Item) -> bool,

    Find the position and value of the first element satisfying a predicate. Read more
    source§

    fn find_or_last<P>(self, predicate: P) -> Option<Self::Item>
    where Self: Sized, - P: FnMut(&Self::Item) -> bool,

    Find the value of the first element satisfying a predicate or return the last element, if any. Read more
    source§

    fn find_or_first<P>(self, predicate: P) -> Option<Self::Item>
    where + P: FnMut(&Self::Item) -> bool,

    Find the value of the first element satisfying a predicate or return the last element, if any. Read more
    source§

    fn find_or_first<P>(self, predicate: P) -> Option<Self::Item>
    where Self: Sized, - P: FnMut(&Self::Item) -> bool,

    Find the value of the first element satisfying a predicate or return the first element, if any. Read more
    source§

    fn contains<Q>(&mut self, query: &Q) -> bool
    where + P: FnMut(&Self::Item) -> bool,

    Find the value of the first element satisfying a predicate or return the first element, if any. Read more
    source§

    fn contains<Q>(&mut self, query: &Q) -> bool
    where Self: Sized, Self::Item: Borrow<Q>, - Q: PartialEq,

    Returns true if the given item is present in this iterator. Read more
    source§

    fn all_equal(&mut self) -> bool
    where + Q: PartialEq,

    Returns true if the given item is present in this iterator. Read more
    source§

    fn all_equal(&mut self) -> bool
    where Self: Sized, - Self::Item: PartialEq,

    Check whether all elements compare equal. Read more
    source§

    fn all_equal_value( + Self::Item: PartialEq,

    Check whether all elements compare equal. Read more
    source§

    fn all_equal_value( &mut self ) -> Result<Self::Item, Option<(Self::Item, Self::Item)>>
    where Self: Sized, Self::Item: PartialEq,

    If there are elements and they are all equal, return a single copy of that element. If there are no elements, return an Error containing None. If there are elements and they are not all equal, return a tuple containing the first -two non-equal elements found. Read more
    source§

    fn all_unique(&mut self) -> bool
    where +two non-equal elements found. Read more

    source§

    fn all_unique(&mut self) -> bool
    where Self: Sized, - Self::Item: Eq + Hash,

    Check whether all elements are unique (non equal). Read more
    source§

    fn dropping(self, n: usize) -> Self
    where + Self::Item: Eq + Hash,

    Check whether all elements are unique (non equal). Read more
    source§

    fn dropping(self, n: usize) -> Self
    where Self: Sized,

    Consume the first n elements from the iterator eagerly, -and return the same iterator again. Read more
    source§

    fn dropping_back(self, n: usize) -> Self
    where +and return the same iterator again. Read more

    source§

    fn dropping_back(self, n: usize) -> Self
    where Self: Sized + DoubleEndedIterator,

    Consume the last n elements from the iterator eagerly, -and return the same iterator again. Read more
    source§

    fn foreach<F>(self, f: F)
    where - F: FnMut(Self::Item), - Self: Sized,

    👎Deprecated since 0.8.0: Use .for_each() instead
    Run the closure f eagerly on each element of the iterator. Read more
    source§

    fn concat(self) -> Self::Item
    where +and return the same iterator again. Read more

    source§

    fn concat(self) -> Self::Item
    where Self: Sized, - Self::Item: Extend<<<Self as Iterator>::Item as IntoIterator>::Item> + IntoIterator + Default,

    Combine all an iterator’s elements into one element by using Extend. Read more
    source§

    fn collect_vec(self) -> Vec<Self::Item>
    where + Self::Item: Extend<<<Self as Iterator>::Item as IntoIterator>::Item> + IntoIterator + Default,

    Combine all an iterator’s elements into one element by using Extend. Read more
    source§

    fn collect_vec(self) -> Vec<Self::Item>
    where Self: Sized,

    .collect_vec() is simply a type specialization of Iterator::collect, -for convenience.
    source§

    fn try_collect<T, U, E>(self) -> Result<U, E>
    where +for convenience.

    source§

    fn try_collect<T, U, E>(self) -> Result<U, E>
    where Self: Sized + Iterator<Item = Result<T, E>>, Result<U, E>: FromIterator<Result<T, E>>,

    .try_collect() is more convenient way of writing -.collect::<Result<_, _>>() Read more
    source§

    fn set_from<'a, A: 'a, J>(&mut self, from: J) -> usize
    where +.collect::<Result<_, _>>() Read more

    source§

    fn set_from<'a, A: 'a, J>(&mut self, from: J) -> usize
    where Self: Iterator<Item = &'a mut A>, J: IntoIterator<Item = A>,

    Assign to each reference in self from the from iterator, -stopping at the shortest of the two iterators. Read more
    source§

    fn join(&mut self, sep: &str) -> String
    where - Self::Item: Display,

    Combine all iterator elements into one String, separated by sep. Read more
    source§

    fn format(self, sep: &str) -> Format<'_, Self>
    where - Self: Sized,

    Format all iterator elements, separated by sep. Read more
    source§

    fn format_with<F>(self, sep: &str, format: F) -> FormatWith<'_, Self, F>
    where +stopping at the shortest of the two iterators. Read more

    source§

    fn join(&mut self, sep: &str) -> String
    where + Self::Item: Display,

    Combine all iterator elements into one String, separated by sep. Read more
    source§

    fn format(self, sep: &str) -> Format<'_, Self>
    where + Self: Sized,

    Format all iterator elements, separated by sep. Read more
    source§

    fn format_with<F>(self, sep: &str, format: F) -> FormatWith<'_, Self, F>
    where Self: Sized, - F: FnMut(Self::Item, &mut dyn FnMut(&dyn Display) -> Result) -> Result,

    Format all iterator elements, separated by sep. Read more
    source§

    fn fold_results<A, E, B, F>(&mut self, start: B, f: F) -> Result<B, E>
    where + F: FnMut(Self::Item, &mut dyn FnMut(&dyn Display) -> Result) -> Result,

    Format all iterator elements, separated by sep. Read more
    source§

    fn fold_ok<A, E, B, F>(&mut self, start: B, f: F) -> Result<B, E>
    where Self: Iterator<Item = Result<A, E>>, - F: FnMut(B, A) -> B,

    👎Deprecated since 0.10.0: Use .fold_ok() instead
    See .fold_ok().
    source§

    fn fold_ok<A, E, B, F>(&mut self, start: B, f: F) -> Result<B, E>
    where - Self: Iterator<Item = Result<A, E>>, - F: FnMut(B, A) -> B,

    Fold Result values from an iterator. Read more
    source§

    fn fold_options<A, B, F>(&mut self, start: B, f: F) -> Option<B>
    where + F: FnMut(B, A) -> B,

    Fold Result values from an iterator. Read more
    source§

    fn fold_options<A, B, F>(&mut self, start: B, f: F) -> Option<B>
    where Self: Iterator<Item = Option<A>>, - F: FnMut(B, A) -> B,

    Fold Option values from an iterator. Read more
    source§

    fn fold1<F>(self, f: F) -> Option<Self::Item>
    where + F: FnMut(B, A) -> B,

    Fold Option values from an iterator. Read more
    source§

    fn fold1<F>(self, f: F) -> Option<Self::Item>
    where F: FnMut(Self::Item, Self::Item) -> Self::Item, - Self: Sized,

    👎Deprecated since 0.10.2: Use Iterator::reduce instead
    Accumulator of the elements in the iterator. Read more
    source§

    fn tree_fold1<F>(self, f: F) -> Option<Self::Item>
    where + Self: Sized,

    👎Deprecated since 0.10.2: Use Iterator::reduce instead
    Accumulator of the elements in the iterator. Read more
    source§

    fn tree_reduce<F>(self, f: F) -> Option<Self::Item>
    where F: FnMut(Self::Item, Self::Item) -> Self::Item, - Self: Sized,

    Accumulate the elements in the iterator in a tree-like manner. Read more
    source§

    fn fold_while<B, F>(&mut self, init: B, f: F) -> FoldWhile<B>
    where + Self: Sized,

    Accumulate the elements in the iterator in a tree-like manner. Read more
    source§

    fn tree_fold1<F>(self, f: F) -> Option<Self::Item>
    where + F: FnMut(Self::Item, Self::Item) -> Self::Item, + Self: Sized,

    👎Deprecated since 0.13.0: Use .tree_reduce() instead
    See .tree_reduce().
    source§

    fn fold_while<B, F>(&mut self, init: B, f: F) -> FoldWhile<B>
    where Self: Sized, - F: FnMut(B, Self::Item) -> FoldWhile<B>,

    An iterator method that applies a function, producing a single, final value. Read more
    source§

    fn sum1<S>(self) -> Option<S>
    where + F: FnMut(B, Self::Item) -> FoldWhile<B>,

    An iterator method that applies a function, producing a single, final value. Read more
    source§

    fn sum1<S>(self) -> Option<S>
    where Self: Sized, - S: Sum<Self::Item>,

    Iterate over the entire iterator and add all the elements. Read more
    source§

    fn product1<P>(self) -> Option<P>
    where + S: Sum<Self::Item>,

    Iterate over the entire iterator and add all the elements. Read more
    source§

    fn product1<P>(self) -> Option<P>
    where Self: Sized, - P: Product<Self::Item>,

    Iterate over the entire iterator and multiply all the elements. Read more
    source§

    fn sorted_unstable(self) -> IntoIter<Self::Item> ⓘ
    where + P: Product<Self::Item>,

    Iterate over the entire iterator and multiply all the elements. Read more
    source§

    fn sorted_unstable(self) -> IntoIter<Self::Item> ⓘ
    where Self: Sized, - Self::Item: Ord,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_unstable_by<F>(self, cmp: F) -> IntoIter<Self::Item> ⓘ
    where + Self::Item: Ord,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_unstable_by<F>(self, cmp: F) -> IntoIter<Self::Item> ⓘ
    where Self: Sized, - F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_unstable_by_key<K, F>(self, f: F) -> IntoIter<Self::Item> ⓘ
    where + F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_unstable_by_key<K, F>(self, f: F) -> IntoIter<Self::Item> ⓘ
    where Self: Sized, K: Ord, - F: FnMut(&Self::Item) -> K,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted(self) -> IntoIter<Self::Item> ⓘ
    where + F: FnMut(&Self::Item) -> K,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted(self) -> IntoIter<Self::Item> ⓘ
    where Self: Sized, - Self::Item: Ord,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_by<F>(self, cmp: F) -> IntoIter<Self::Item> ⓘ
    where + Self::Item: Ord,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_by<F>(self, cmp: F) -> IntoIter<Self::Item> ⓘ
    where Self: Sized, - F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_by_key<K, F>(self, f: F) -> IntoIter<Self::Item> ⓘ
    where + F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_by_key<K, F>(self, f: F) -> IntoIter<Self::Item> ⓘ
    where Self: Sized, K: Ord, - F: FnMut(&Self::Item) -> K,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_by_cached_key<K, F>(self, f: F) -> IntoIter<Self::Item> ⓘ
    where + F: FnMut(&Self::Item) -> K,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_by_cached_key<K, F>(self, f: F) -> IntoIter<Self::Item> ⓘ
    where Self: Sized, K: Ord, F: FnMut(&Self::Item) -> K,

    Sort all iterator elements into a new iterator in ascending order. The key function is -called exactly once per key. Read more
    source§

    fn k_smallest(self, k: usize) -> IntoIter<Self::Item> ⓘ
    where +called exactly once per key. Read more

    source§

    fn k_smallest(self, k: usize) -> IntoIter<Self::Item> ⓘ
    where Self: Sized, - Self::Item: Ord,

    Sort the k smallest elements into a new iterator, in ascending order. Read more
    source§

    fn partition_map<A, B, F, L, R>(self, predicate: F) -> (A, B)
    where + Self::Item: Ord,

    Sort the k smallest elements into a new iterator, in ascending order. Read more
    source§

    fn k_smallest_by<F>(self, k: usize, cmp: F) -> IntoIter<Self::Item> ⓘ
    where + Self: Sized, + F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Sort the k smallest elements into a new iterator using the provided comparison. Read more
    source§

    fn k_smallest_by_key<F, K>(self, k: usize, key: F) -> IntoIter<Self::Item> ⓘ
    where + Self: Sized, + F: FnMut(&Self::Item) -> K, + K: Ord,

    Return the elements producing the k smallest outputs of the provided function. Read more
    source§

    fn k_largest(self, k: usize) -> IntoIter<Self::Item> ⓘ
    where + Self: Sized, + Self::Item: Ord,

    Sort the k largest elements into a new iterator, in descending order. Read more
    source§

    fn k_largest_by<F>(self, k: usize, cmp: F) -> IntoIter<Self::Item> ⓘ
    where + Self: Sized, + F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Sort the k largest elements into a new iterator using the provided comparison. Read more
    source§

    fn k_largest_by_key<F, K>(self, k: usize, key: F) -> IntoIter<Self::Item> ⓘ
    where + Self: Sized, + F: FnMut(&Self::Item) -> K, + K: Ord,

    Return the elements producing the k largest outputs of the provided function. Read more
    source§

    fn tail(self, n: usize) -> IntoIter<Self::Item> ⓘ
    where + Self: Sized,

    Consumes the iterator and return an iterator of the last n elements. Read more
    source§

    fn partition_map<A, B, F, L, R>(self, predicate: F) -> (A, B)
    where Self: Sized, F: FnMut(Self::Item) -> Either<L, R>, A: Default + Extend<L>, B: Default + Extend<R>,

    Collect all iterator elements into one of two partitions. Unlike Iterator::partition, each partition may -have a distinct type. Read more
    source§

    fn partition_result<A, B, T, E>(self) -> (A, B)
    where +have a distinct type. Read more

    source§

    fn partition_result<A, B, T, E>(self) -> (A, B)
    where Self: Iterator<Item = Result<T, E>> + Sized, A: Default + Extend<T>, B: Default + Extend<E>,

    Partition a sequence of Results into one list of all the Ok elements -and another list of all the Err elements. Read more
    source§

    fn into_group_map<K, V>(self) -> HashMap<K, Vec<V>>
    where +and another list of all the Err elements. Read more

    source§

    fn into_group_map<K, V>(self) -> HashMap<K, Vec<V>>
    where Self: Iterator<Item = (K, V)> + Sized, K: Hash + Eq,

    Return a HashMap of keys mapped to Vecs of values. Keys and values -are taken from (Key, Value) tuple pairs yielded by the input iterator. Read more
    source§

    fn into_group_map_by<K, V, F>(self, f: F) -> HashMap<K, Vec<V>>
    where +are taken from (Key, Value) tuple pairs yielded by the input iterator. Read more

    source§

    fn into_group_map_by<K, V, F>(self, f: F) -> HashMap<K, Vec<V>>
    where Self: Iterator<Item = V> + Sized, K: Hash + Eq, - F: Fn(&V) -> K,

    Return an Iterator on a HashMap. Keys mapped to Vecs of values. The key is specified -in the closure. Read more
    source§

    fn into_grouping_map<K, V>(self) -> GroupingMap<Self>
    where + F: FnMut(&V) -> K,

    Return an Iterator on a HashMap. Keys mapped to Vecs of values. The key is specified +in the closure. Read more
    source§

    fn into_grouping_map<K, V>(self) -> GroupingMap<Self>
    where Self: Iterator<Item = (K, V)> + Sized, K: Hash + Eq,

    Constructs a GroupingMap to be used later with one of the efficient -group-and-fold operations it allows to perform. Read more
    source§

    fn into_grouping_map_by<K, V, F>(self, key_mapper: F) -> GroupingMapBy<Self, F>
    where +group-and-fold operations it allows to perform. Read more

    source§

    fn into_grouping_map_by<K, V, F>(self, key_mapper: F) -> GroupingMapBy<Self, F>
    where Self: Iterator<Item = V> + Sized, K: Hash + Eq, F: FnMut(&V) -> K,

    Constructs a GroupingMap to be used later with one of the efficient -group-and-fold operations it allows to perform. Read more
    source§

    fn min_set(self) -> Vec<Self::Item>
    where +group-and-fold operations it allows to perform. Read more

    source§

    fn min_set(self) -> Vec<Self::Item>
    where Self: Sized, - Self::Item: Ord,

    Return all minimum elements of an iterator. Read more
    source§

    fn min_set_by<F>(self, compare: F) -> Vec<Self::Item>
    where + Self::Item: Ord,

    Return all minimum elements of an iterator. Read more
    source§

    fn min_set_by<F>(self, compare: F) -> Vec<Self::Item>
    where Self: Sized, F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Return all minimum elements of an iterator, as determined by -the specified function. Read more
    source§

    fn min_set_by_key<K, F>(self, key: F) -> Vec<Self::Item>
    where +the specified function. Read more

    source§

    fn min_set_by_key<K, F>(self, key: F) -> Vec<Self::Item>
    where Self: Sized, K: Ord, F: FnMut(&Self::Item) -> K,

    Return all minimum elements of an iterator, as determined by -the specified function. Read more
    source§

    fn max_set(self) -> Vec<Self::Item>
    where +the specified function. Read more

    source§

    fn max_set(self) -> Vec<Self::Item>
    where Self: Sized, - Self::Item: Ord,

    Return all maximum elements of an iterator. Read more
    source§

    fn max_set_by<F>(self, compare: F) -> Vec<Self::Item>
    where + Self::Item: Ord,

    Return all maximum elements of an iterator. Read more
    source§

    fn max_set_by<F>(self, compare: F) -> Vec<Self::Item>
    where Self: Sized, F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Return all maximum elements of an iterator, as determined by -the specified function. Read more
    source§

    fn max_set_by_key<K, F>(self, key: F) -> Vec<Self::Item>
    where +the specified function. Read more

    source§

    fn max_set_by_key<K, F>(self, key: F) -> Vec<Self::Item>
    where Self: Sized, K: Ord, F: FnMut(&Self::Item) -> K,

    Return all maximum elements of an iterator, as determined by -the specified function. Read more
    source§

    fn minmax(self) -> MinMaxResult<Self::Item>
    where +the specified function. Read more

    source§

    fn minmax(self) -> MinMaxResult<Self::Item>
    where Self: Sized, - Self::Item: PartialOrd,

    Return the minimum and maximum elements in the iterator. Read more
    source§

    fn minmax_by_key<K, F>(self, key: F) -> MinMaxResult<Self::Item>
    where + Self::Item: PartialOrd,

    Return the minimum and maximum elements in the iterator. Read more
    source§

    fn minmax_by_key<K, F>(self, key: F) -> MinMaxResult<Self::Item>
    where Self: Sized, K: PartialOrd, F: FnMut(&Self::Item) -> K,

    Return the minimum and maximum element of an iterator, as determined by -the specified function. Read more
    source§

    fn minmax_by<F>(self, compare: F) -> MinMaxResult<Self::Item>
    where +the specified function. Read more

    source§

    fn minmax_by<F>(self, compare: F) -> MinMaxResult<Self::Item>
    where Self: Sized, F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Return the minimum and maximum element of an iterator, as determined by -the specified comparison function. Read more
    source§

    fn position_max(self) -> Option<usize>
    where +the specified comparison function. Read more

    source§

    fn position_max(self) -> Option<usize>
    where Self: Sized, - Self::Item: Ord,

    Return the position of the maximum element in the iterator. Read more
    source§

    fn position_max_by_key<K, F>(self, key: F) -> Option<usize>
    where + Self::Item: Ord,

    Return the position of the maximum element in the iterator. Read more
    source§

    fn position_max_by_key<K, F>(self, key: F) -> Option<usize>
    where Self: Sized, K: Ord, F: FnMut(&Self::Item) -> K,

    Return the position of the maximum element in the iterator, as -determined by the specified function. Read more
    source§

    fn position_max_by<F>(self, compare: F) -> Option<usize>
    where +determined by the specified function. Read more

    source§

    fn position_max_by<F>(self, compare: F) -> Option<usize>
    where Self: Sized, F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Return the position of the maximum element in the iterator, as -determined by the specified comparison function. Read more
    source§

    fn position_min(self) -> Option<usize>
    where +determined by the specified comparison function. Read more

    source§

    fn position_min(self) -> Option<usize>
    where Self: Sized, - Self::Item: Ord,

    Return the position of the minimum element in the iterator. Read more
    source§

    fn position_min_by_key<K, F>(self, key: F) -> Option<usize>
    where + Self::Item: Ord,

    Return the position of the minimum element in the iterator. Read more
    source§

    fn position_min_by_key<K, F>(self, key: F) -> Option<usize>
    where Self: Sized, K: Ord, F: FnMut(&Self::Item) -> K,

    Return the position of the minimum element in the iterator, as -determined by the specified function. Read more
    source§

    fn position_min_by<F>(self, compare: F) -> Option<usize>
    where +determined by the specified function. Read more

    source§

    fn position_min_by<F>(self, compare: F) -> Option<usize>
    where Self: Sized, F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Return the position of the minimum element in the iterator, as -determined by the specified comparison function. Read more
    source§

    fn position_minmax(self) -> MinMaxResult<usize>
    where +determined by the specified comparison function. Read more

    source§

    fn position_minmax(self) -> MinMaxResult<usize>
    where Self: Sized, Self::Item: PartialOrd,

    Return the positions of the minimum and maximum elements in -the iterator. Read more
    source§

    fn position_minmax_by_key<K, F>(self, key: F) -> MinMaxResult<usize>
    where +the iterator. Read more

    source§

    fn position_minmax_by_key<K, F>(self, key: F) -> MinMaxResult<usize>
    where Self: Sized, K: PartialOrd, F: FnMut(&Self::Item) -> K,

    Return the postions of the minimum and maximum elements of an -iterator, as determined by the specified function. Read more
    source§

    fn position_minmax_by<F>(self, compare: F) -> MinMaxResult<usize>
    where +iterator, as determined by the specified function. Read more

    source§

    fn position_minmax_by<F>(self, compare: F) -> MinMaxResult<usize>
    where Self: Sized, F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Return the postions of the minimum and maximum elements of an -iterator, as determined by the specified comparison function. Read more
    source§

    fn exactly_one(self) -> Result<Self::Item, ExactlyOneError<Self>>
    where +iterator, as determined by the specified comparison function. Read more

    source§

    fn exactly_one(self) -> Result<Self::Item, ExactlyOneError<Self>>
    where Self: Sized,

    If the iterator yields exactly one element, that element will be returned, otherwise an error will be returned containing an iterator that has the same output as the input -iterator. Read more
    source§

    fn at_most_one(self) -> Result<Option<Self::Item>, ExactlyOneError<Self>>
    where - Self: Sized,

    If the iterator yields no elements, Ok(None) will be returned. If the iterator yields +iterator. Read more
    source§

    fn at_most_one(self) -> Result<Option<Self::Item>, ExactlyOneError<Self>>
    where + Self: Sized,

    If the iterator yields no elements, Ok(None) will be returned. If the iterator yields exactly one element, that element will be returned, otherwise an error will be returned -containing an iterator that has the same output as the input iterator. Read more
    source§

    fn multipeek(self) -> MultiPeek<Self> ⓘ
    where +containing an iterator that has the same output as the input iterator. Read more

    source§

    fn multipeek(self) -> MultiPeek<Self> ⓘ
    where Self: Sized,

    An iterator adaptor that allows the user to peek at multiple .next() -values without advancing the base iterator. Read more
    source§

    fn counts(self) -> HashMap<Self::Item, usize>
    where +values without advancing the base iterator. Read more

    source§

    fn counts(self) -> HashMap<Self::Item, usize>
    where Self: Sized, Self::Item: Eq + Hash,

    Collect the items in this iterator and return a HashMap which contains each item that appears in the iterator and the number -of times it appears. Read more
    source§

    fn counts_by<K, F>(self, f: F) -> HashMap<K, usize>
    where +of times it appears. Read more

    source§

    fn counts_by<K, F>(self, f: F) -> HashMap<K, usize>
    where Self: Sized, K: Eq + Hash, F: FnMut(Self::Item) -> K,

    Collect the items in this iterator and return a HashMap which contains each item that appears in the iterator and the number of times it appears, -determining identity using a keying function. Read more
    source§

    fn multiunzip<FromI>(self) -> FromI
    where - Self: Sized + MultiUnzip<FromI>,

    Converts an iterator of tuples into a tuple of containers. Read more
    source§

    fn try_len(&self) -> Result<usize, (usize, Option<usize>)>

    Returns the length of the iterator if one exists. +determining identity using a keying function. Read more
    source§

    fn multiunzip<FromI>(self) -> FromI
    where + Self: Sized + MultiUnzip<FromI>,

    Converts an iterator of tuples into a tuple of containers. Read more
    source§

    fn try_len(&self) -> Result<usize, (usize, Option<usize>)>

    Returns the length of the iterator if one exists. Otherwise return self.size_hint(). Read more
    source§

    impl<T> 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 + 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/itertools/structs/struct.FlattenOk.html b/itertools/structs/struct.FlattenOk.html index 0f2f40520..4233934e6 100644 --- a/itertools/structs/struct.FlattenOk.html +++ b/itertools/structs/struct.FlattenOk.html @@ -1,30 +1,33 @@ -FlattenOk in itertools::structs - Rust
    +FlattenOk in itertools::structs - Rust

    Struct itertools::structs::FlattenOk

    source · 
    pub struct FlattenOk<I, T, E>
    where
     I: Iterator<Item = Result<T, E>>,
     T: IntoIterator,
    { /* private fields */ }
    Expand description

    An iterator adaptor that flattens Result::Ok values and allows Result::Err values through unchanged.

    See .flatten_ok() for more information.

    -

    Trait Implementations§

    source§

    impl<I, T, E> Clone for FlattenOk<I, T, E>
    where +

    Trait Implementations§

    source§

    impl<I, T, E> Clone for FlattenOk<I, T, E>
    where I: Iterator<Item = Result<T, E>> + Clone, T: IntoIterator, - T::IntoIter: 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<I, T, E> Debug for FlattenOk<I, T, E>
    where + T::IntoIter: 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<I, T, E> Debug for FlattenOk<I, T, E>
    where I: Iterator<Item = Result<T, E>> + Debug, T: IntoIterator, - T::IntoIter: Debug,

    source§

    fn fmt(&self, f: &mut Formatter<'_>) -> Result

    Formats the value using the given formatter. Read more
    source§

    impl<I, T, E> DoubleEndedIterator for FlattenOk<I, T, E>
    where + T::IntoIter: Debug,

    source§

    fn fmt(&self, f: &mut Formatter<'_>) -> Result

    Formats the value using the given formatter. Read more
    source§

    impl<I, T, E> DoubleEndedIterator for FlattenOk<I, T, E>
    where I: DoubleEndedIterator<Item = Result<T, E>>, T: IntoIterator, - T::IntoIter: DoubleEndedIterator,

    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 + T::IntoIter: DoubleEndedIterator,

    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 + 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
    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 +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, - 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, E> Iterator for FlattenOk<I, T, E>
    where + 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, E> Iterator for FlattenOk<I, T, E>
    where I: Iterator<Item = Result<T, E>>, - T: IntoIterator,

    §

    type Item = Result<<T as IntoIterator>::Item, E>

    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>( + T: IntoIterator,

    §

    type Item = Result<<T as IntoIterator>::Item, E>

    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 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 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 @@ -94,10 +97,7 @@ successfully, producing a single, final value. 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 +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>( @@ -201,7 +201,7 @@ greater than or equal to those of another. 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, E> FusedIterator for FlattenOk<I, T, E>
    where +function. Read more
    source§

    impl<I, T, E> FusedIterator for FlattenOk<I, T, E>
    where I: FusedIterator<Item = Result<T, E>>, T: IntoIterator,

    Only the iterator being flattened needs to implement FusedIterator.

    Auto Trait Implementations§

    §

    impl<I, T, E> Freeze for FlattenOk<I, T, E>
    where @@ -232,86 +232,87 @@ otherwise. Right variant of Either<Self, Self> otherwise. Read more

    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> Itertools for T
    where - T: Iterator + ?Sized,

    source§

    fn interleave<J>(self, other: J) -> Interleave<Self, J::IntoIter> ⓘ
    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> Itertools for T
    where + T: Iterator + ?Sized,

    source§

    fn interleave<J>(self, other: J) -> Interleave<Self, J::IntoIter> ⓘ
    where J: IntoIterator<Item = Self::Item>, - Self: Sized,

    Alternate elements from two iterators until both have run out. Read more
    source§

    fn interleave_shortest<J>( + Self: Sized,

    Alternate elements from two iterators until both have run out. Read more
    source§

    fn interleave_shortest<J>( self, other: J ) -> InterleaveShortest<Self, J::IntoIter> ⓘ
    where J: IntoIterator<Item = Self::Item>, Self: Sized,

    Alternate elements from two iterators until at least one of them has run -out. Read more
    source§

    fn intersperse(self, element: Self::Item) -> Intersperse<Self>
    where +out. Read more

    source§

    fn intersperse(self, element: Self::Item) -> Intersperse<Self>
    where Self: Sized, Self::Item: Clone,

    An iterator adaptor to insert a particular value -between each element of the adapted iterator. Read more
    source§

    fn intersperse_with<F>(self, element: F) -> IntersperseWith<Self, F> ⓘ
    where +between each element of the adapted iterator. Read more

    source§

    fn intersperse_with<F>(self, element: F) -> IntersperseWith<Self, F> ⓘ
    where Self: Sized, F: FnMut() -> Self::Item,

    An iterator adaptor to insert a particular value created by a function -between each element of the adapted iterator. Read more
    source§

    fn zip_longest<J>(self, other: J) -> ZipLongest<Self, J::IntoIter> ⓘ
    where +between each element of the adapted iterator. Read more

    source§

    fn get<R>(self, index: R) -> R::Output
    where + Self: Sized, + R: IteratorIndex<Self>,

    Returns an iterator over a subsection of the iterator. Read more
    source§

    fn zip_longest<J>(self, other: J) -> ZipLongest<Self, J::IntoIter> ⓘ
    where J: IntoIterator, Self: Sized,

    Create an iterator which iterates over both this and the specified -iterator simultaneously, yielding pairs of two optional elements. Read more
    source§

    fn zip_eq<J>(self, other: J) -> ZipEq<Self, J::IntoIter> ⓘ
    where +iterator simultaneously, yielding pairs of two optional elements. Read more

    source§

    fn zip_eq<J>(self, other: J) -> ZipEq<Self, J::IntoIter> ⓘ
    where J: IntoIterator, Self: Sized,

    Create an iterator which iterates over both this and the specified -iterator simultaneously, yielding pairs of elements. Read more
    source§

    fn batching<B, F>(self, f: F) -> Batching<Self, F> ⓘ
    where +iterator simultaneously, yielding pairs of elements. Read more

    source§

    fn batching<B, F>(self, f: F) -> Batching<Self, F> ⓘ
    where F: FnMut(&mut Self) -> Option<B>, Self: Sized,

    A “meta iterator adaptor”. Its closure receives a reference to the iterator and may pick off as many elements as it likes, to produce the -next iterator element. Read more
    source§

    fn group_by<K, F>(self, key: F) -> GroupBy<K, Self, F>
    where +next iterator element. Read more

    source§

    fn chunk_by<K, F>(self, key: F) -> ChunkBy<K, Self, F>
    where Self: Sized, F: FnMut(&Self::Item) -> K, K: PartialEq,

    Return an iterable that can group iterator elements. Consecutive elements that map to the same key (“runs”), are assigned -to the same group. Read more
    source§

    fn chunks(self, size: usize) -> IntoChunks<Self>
    where - Self: Sized,

    Return an iterable that can chunk the iterator. Read more
    source§

    fn tuple_windows<T>(self) -> TupleWindows<Self, T> ⓘ
    where +to the same group. Read more

    source§

    fn group_by<K, F>(self, key: F) -> ChunkBy<K, Self, F>
    where + Self: Sized, + F: FnMut(&Self::Item) -> K, + K: PartialEq,

    👎Deprecated since 0.13.0: Use .chunk_by() instead
    See .chunk_by().
    source§

    fn chunks(self, size: usize) -> IntoChunks<Self>
    where + Self: Sized,

    Return an iterable that can chunk the iterator. Read more
    source§

    fn tuple_windows<T>(self) -> TupleWindows<Self, T> ⓘ
    where Self: Sized + Iterator<Item = T::Item>, T: HomogeneousTuple, T::Item: Clone,

    Return an iterator over all contiguous windows producing tuples of -a specific size (up to 12). Read more
    source§

    fn circular_tuple_windows<T>(self) -> CircularTupleWindows<Self, T> ⓘ
    where +a specific size (up to 12). Read more

    source§

    fn circular_tuple_windows<T>(self) -> CircularTupleWindows<Self, T> ⓘ
    where Self: Sized + Clone + Iterator<Item = T::Item> + ExactSizeIterator, T: TupleCollect + Clone, T::Item: Clone,

    Return an iterator over all windows, wrapping back to the first elements when the window would otherwise exceed the length of the -iterator, producing tuples of a specific size (up to 12). Read more
    source§

    fn tuples<T>(self) -> Tuples<Self, T> ⓘ
    where +iterator, producing tuples of a specific size (up to 12). Read more

    source§

    fn tuples<T>(self) -> Tuples<Self, T> ⓘ
    where Self: Sized + Iterator<Item = T::Item>, T: HomogeneousTuple,

    Return an iterator that groups the items in tuples of a specific size -(up to 12). Read more
    source§

    fn tee(self) -> (Tee<Self>, Tee<Self>)
    where +(up to 12). Read more

    source§

    fn tee(self) -> (Tee<Self>, Tee<Self>)
    where Self: Sized, Self::Item: Clone,

    Split into an iterator pair that both yield all elements from -the original iterator. Read more
    source§

    fn step(self, n: usize) -> Step<Self> ⓘ
    where - Self: Sized,

    👎Deprecated since 0.8.0: Use std .step_by() instead
    Return an iterator adaptor that steps n elements in the base iterator -for each iteration. Read more
    source§

    fn map_into<R>(self) -> MapInto<Self, R>
    where +the original iterator. Read more

    source§

    fn map_into<R>(self) -> MapInto<Self, R>
    where Self: Sized, - Self::Item: Into<R>,

    Convert each item of the iterator using the Into trait. Read more
    source§

    fn map_results<F, T, U, E>(self, f: F) -> MapOk<Self, F>
    where - Self: Iterator<Item = Result<T, E>> + Sized, - F: FnMut(T) -> U,

    👎Deprecated since 0.10.0: Use .map_ok() instead
    See .map_ok().
    source§

    fn map_ok<F, T, U, E>(self, f: F) -> MapOk<Self, F>
    where + Self::Item: Into<R>,

    Convert each item of the iterator using the Into trait. Read more
    source§

    fn map_ok<F, T, U, E>(self, f: F) -> MapOk<Self, F>
    where Self: Iterator<Item = Result<T, E>> + Sized, F: FnMut(T) -> U,

    Return an iterator adaptor that applies the provided closure to every Result::Ok value. Result::Err values are -unchanged. Read more
    source§

    fn filter_ok<F, T, E>(self, f: F) -> FilterOk<Self, F> ⓘ
    where +unchanged. Read more

    source§

    fn filter_ok<F, T, E>(self, f: F) -> FilterOk<Self, F> ⓘ
    where Self: Iterator<Item = Result<T, E>> + Sized, F: FnMut(&T) -> bool,

    Return an iterator adaptor that filters every Result::Ok value with the provided closure. Result::Err values are -unchanged. Read more
    source§

    fn filter_map_ok<F, T, U, E>(self, f: F) -> FilterMapOk<Self, F> ⓘ
    where +unchanged. Read more

    source§

    fn filter_map_ok<F, T, U, E>(self, f: F) -> FilterMapOk<Self, F> ⓘ
    where Self: Iterator<Item = Result<T, E>> + Sized, F: FnMut(T) -> Option<U>,

    Return an iterator adaptor that filters and transforms every Result::Ok value with the provided closure. Result::Err -values are unchanged. Read more
    source§

    fn flatten_ok<T, E>(self) -> FlattenOk<Self, T, E> ⓘ
    where +values are unchanged. Read more

    source§

    fn flatten_ok<T, E>(self) -> FlattenOk<Self, T, E> ⓘ
    where Self: Iterator<Item = Result<T, E>> + Sized, T: IntoIterator,

    Return an iterator adaptor that flattens every Result::Ok value into -a series of Result::Ok values. Result::Err values are unchanged. Read more
    source§

    fn process_results<F, T, E, R>(self, processor: F) -> Result<R, E>
    where +a series of Result::Ok values. Result::Err values are unchanged. Read more

    source§

    fn process_results<F, T, E, R>(self, processor: F) -> Result<R, E>
    where Self: Iterator<Item = Result<T, E>> + Sized, F: FnOnce(ProcessResults<'_, Self, E>) -> R,

    “Lift” a function of the values of the current iterator so as to process -an iterator of Result values instead. Read more
    source§

    fn merge<J>(self, other: J) -> Merge<Self, J::IntoIter>
    where +an iterator of Result values instead. Read more

    source§

    fn merge<J>(self, other: J) -> Merge<Self, J::IntoIter>
    where Self: Sized, Self::Item: PartialOrd, J: IntoIterator<Item = Self::Item>,

    Return an iterator adaptor that merges the two base iterators in ascending order. If both base iterators are sorted (ascending), the -result is sorted. Read more
    source§

    fn merge_by<J, F>(self, other: J, is_first: F) -> MergeBy<Self, J::IntoIter, F> ⓘ
    where +result is sorted. Read more

    source§

    fn merge_by<J, F>(self, other: J, is_first: F) -> MergeBy<Self, J::IntoIter, F> ⓘ
    where Self: Sized, J: IntoIterator<Item = Self::Item>, F: FnMut(&Self::Item, &Self::Item) -> bool,

    Return an iterator adaptor that merges the two base iterators in order. -This is much like .merge() but allows for a custom ordering. Read more
    source§

    fn merge_join_by<J, F, T>( +This is much like .merge() but allows for a custom ordering. Read more

    source§

    fn merge_join_by<J, F, T>( self, other: J, cmp_fn: F @@ -319,285 +320,296 @@ This is much like IntoIterator, F: FnMut(&Self::Item, &J::Item) -> T, Self: Sized,

    Create an iterator that merges items from both this and the specified -iterator in ascending order. Read more
    source§

    fn kmerge(self) -> KMerge<<Self::Item as IntoIterator>::IntoIter>
    where +iterator in ascending order. Read more

    source§

    fn kmerge(self) -> KMerge<<Self::Item as IntoIterator>::IntoIter>
    where Self: Sized, Self::Item: IntoIterator, <Self::Item as IntoIterator>::Item: PartialOrd,

    Return an iterator adaptor that flattens an iterator of iterators by -merging them in ascending order. Read more
    source§

    fn kmerge_by<F>( +merging them in ascending order. Read more

    source§

    fn kmerge_by<F>( self, first: F ) -> KMergeBy<<Self::Item as IntoIterator>::IntoIter, F> ⓘ
    where Self: Sized, Self::Item: IntoIterator, F: FnMut(&<Self::Item as IntoIterator>::Item, &<Self::Item as IntoIterator>::Item) -> bool,

    Return an iterator adaptor that flattens an iterator of iterators by -merging them according to the given closure. Read more
    source§

    fn cartesian_product<J>(self, other: J) -> Product<Self, J::IntoIter> ⓘ
    where +merging them according to the given closure. Read more

    source§

    fn cartesian_product<J>(self, other: J) -> Product<Self, J::IntoIter> ⓘ
    where Self: Sized, Self::Item: Clone, J: IntoIterator, J::IntoIter: Clone,

    Return an iterator adaptor that iterates over the cartesian product of -the element sets of two iterators self and J. Read more
    source§

    fn multi_cartesian_product( +the element sets of two iterators self and J. Read more

    source§

    fn multi_cartesian_product( self ) -> MultiProduct<<Self::Item as IntoIterator>::IntoIter> ⓘ
    where Self: Sized, Self::Item: IntoIterator, <Self::Item as IntoIterator>::IntoIter: Clone, <Self::Item as IntoIterator>::Item: Clone,

    Return an iterator adaptor that iterates over the cartesian product of -all subiterators returned by meta-iterator self. Read more
    source§

    fn coalesce<F>(self, f: F) -> Coalesce<Self, F>
    where +all subiterators returned by meta-iterator self. Read more

    source§

    fn coalesce<F>(self, f: F) -> Coalesce<Self, F>
    where Self: Sized, F: FnMut(Self::Item, Self::Item) -> Result<Self::Item, (Self::Item, Self::Item)>,

    Return an iterator adaptor that uses the passed-in closure to -optionally merge together consecutive elements. Read more
    source§

    fn dedup(self) -> Dedup<Self>
    where +optionally merge together consecutive elements. Read more

    source§

    fn dedup(self) -> Dedup<Self>
    where Self: Sized, Self::Item: PartialEq,

    Remove duplicates from sections of consecutive identical elements. -If the iterator is sorted, all elements will be unique. Read more
    source§

    fn dedup_by<Cmp>(self, cmp: Cmp) -> DedupBy<Self, Cmp>
    where +If the iterator is sorted, all elements will be unique. Read more

    source§

    fn dedup_by<Cmp>(self, cmp: Cmp) -> DedupBy<Self, Cmp>
    where Self: Sized, Cmp: FnMut(&Self::Item, &Self::Item) -> bool,

    Remove duplicates from sections of consecutive identical elements, determining equality using a comparison function. -If the iterator is sorted, all elements will be unique. Read more
    source§

    fn dedup_with_count(self) -> DedupWithCount<Self>
    where +If the iterator is sorted, all elements will be unique. Read more

    source§

    fn dedup_with_count(self) -> DedupWithCount<Self>
    where Self: Sized,

    Remove duplicates from sections of consecutive identical elements, while keeping a count of how many repeated elements were present. -If the iterator is sorted, all elements will be unique. Read more
    source§

    fn dedup_by_with_count<Cmp>(self, cmp: Cmp) -> DedupByWithCount<Self, Cmp>
    where +If the iterator is sorted, all elements will be unique. Read more

    source§

    fn dedup_by_with_count<Cmp>(self, cmp: Cmp) -> DedupByWithCount<Self, Cmp>
    where Self: Sized, Cmp: FnMut(&Self::Item, &Self::Item) -> bool,

    Remove duplicates from sections of consecutive identical elements, while keeping a count of how many repeated elements were present. This will determine equality using a comparison function. -If the iterator is sorted, all elements will be unique. Read more
    source§

    fn duplicates(self) -> Duplicates<Self>
    where +If the iterator is sorted, all elements will be unique. Read more

    source§

    fn duplicates(self) -> Duplicates<Self>
    where Self: Sized, Self::Item: Eq + Hash,

    Return an iterator adaptor that produces elements that appear more than once during the -iteration. Duplicates are detected using hash and equality. Read more
    source§

    fn duplicates_by<V, F>(self, f: F) -> DuplicatesBy<Self, V, F>
    where +iteration. Duplicates are detected using hash and equality. Read more

    source§

    fn duplicates_by<V, F>(self, f: F) -> DuplicatesBy<Self, V, F>
    where Self: Sized, V: Eq + Hash, F: FnMut(&Self::Item) -> V,

    Return an iterator adaptor that produces elements that appear more than once during the -iteration. Duplicates are detected using hash and equality. Read more
    source§

    fn unique(self) -> Unique<Self> ⓘ
    where +iteration. Duplicates are detected using hash and equality. Read more

    source§

    fn unique(self) -> Unique<Self> ⓘ
    where Self: Sized, Self::Item: Clone + Eq + Hash,

    Return an iterator adaptor that filters out elements that have already been produced once during the iteration. Duplicates -are detected using hash and equality. Read more
    source§

    fn unique_by<V, F>(self, f: F) -> UniqueBy<Self, V, F> ⓘ
    where +are detected using hash and equality. Read more

    source§

    fn unique_by<V, F>(self, f: F) -> UniqueBy<Self, V, F> ⓘ
    where Self: Sized, V: Eq + Hash, F: FnMut(&Self::Item) -> V,

    Return an iterator adaptor that filters out elements that have -already been produced once during the iteration. Read more
    source§

    fn peeking_take_while<F>(&mut self, accept: F) -> PeekingTakeWhile<'_, Self, F> ⓘ
    where +already been produced once during the iteration. Read more

    source§

    fn peeking_take_while<F>(&mut self, accept: F) -> PeekingTakeWhile<'_, Self, F> ⓘ
    where Self: Sized + PeekingNext, F: FnMut(&Self::Item) -> bool,

    Return an iterator adaptor that borrows from this iterator and -takes items while the closure accept returns true. Read more
    source§

    fn take_while_ref<F>(&mut self, accept: F) -> TakeWhileRef<'_, Self, F> ⓘ
    where +takes items while the closure accept returns true. Read more

    source§

    fn take_while_ref<F>(&mut self, accept: F) -> TakeWhileRef<'_, Self, F> ⓘ
    where Self: Clone, F: FnMut(&Self::Item) -> bool,

    Return an iterator adaptor that borrows from a Clone-able iterator -to only pick off elements while the predicate accept returns true. Read more
    source§

    fn take_while_inclusive<F>(self, accept: F) -> TakeWhileInclusive<Self, F> ⓘ
    where +to only pick off elements while the predicate accept returns true. Read more

    source§

    fn take_while_inclusive<F>(self, accept: F) -> TakeWhileInclusive<Self, F> ⓘ
    where Self: Sized, F: FnMut(&Self::Item) -> bool,

    Returns an iterator adaptor that consumes elements while the given predicate is true, including the element for which the predicate -first returned false. Read more
    source§

    fn while_some<A>(self) -> WhileSome<Self> ⓘ
    where +first returned false. Read more

    source§

    fn while_some<A>(self) -> WhileSome<Self> ⓘ
    where Self: Sized + Iterator<Item = Option<A>>,

    Return an iterator adaptor that filters Option<A> iterator elements -and produces A. Stops on the first None encountered. Read more
    source§

    fn tuple_combinations<T>(self) -> TupleCombinations<Self, T> ⓘ
    where +and produces A. Stops on the first None encountered. Read more

    source§

    fn tuple_combinations<T>(self) -> TupleCombinations<Self, T> ⓘ
    where Self: Sized + Clone, Self::Item: Clone, T: HasCombination<Self>,

    Return an iterator adaptor that iterates over the combinations of the -elements from an iterator. Read more
    source§

    fn combinations(self, k: usize) -> Combinations<Self> ⓘ
    where +elements from an iterator. Read more

    source§

    fn combinations(self, k: usize) -> Combinations<Self> ⓘ
    where Self: Sized, Self::Item: Clone,

    Return an iterator adaptor that iterates over the k-length combinations of -the elements from an iterator. Read more
    source§

    fn combinations_with_replacement( +the elements from an iterator. Read more

    source§

    fn combinations_with_replacement( self, k: usize ) -> CombinationsWithReplacement<Self> ⓘ
    where Self: Sized, Self::Item: Clone,

    Return an iterator that iterates over the k-length combinations of -the elements from an iterator, with replacement. Read more
    source§

    fn permutations(self, k: usize) -> Permutations<Self> ⓘ
    where +the elements from an iterator, with replacement. Read more

    source§

    fn permutations(self, k: usize) -> Permutations<Self> ⓘ
    where Self: Sized, Self::Item: Clone,

    Return an iterator adaptor that iterates over all k-permutations of the -elements from an iterator. Read more
    source§

    fn powerset(self) -> Powerset<Self> ⓘ
    where +elements from an iterator. Read more

    source§

    fn powerset(self) -> Powerset<Self> ⓘ
    where Self: Sized, Self::Item: Clone,

    Return an iterator that iterates through the powerset of the elements from an -iterator. Read more
    source§

    fn pad_using<F>(self, min: usize, f: F) -> PadUsing<Self, F> ⓘ
    where +iterator. Read more

    source§

    fn pad_using<F>(self, min: usize, f: F) -> PadUsing<Self, F> ⓘ
    where Self: Sized, F: FnMut(usize) -> Self::Item,

    Return an iterator adaptor that pads the sequence to a minimum length of -min by filling missing elements using a closure f. Read more
    source§

    fn with_position(self) -> WithPosition<Self> ⓘ
    where +min by filling missing elements using a closure f. Read more

    source§

    fn with_position(self) -> WithPosition<Self> ⓘ
    where Self: Sized,

    Return an iterator adaptor that combines each element with a Position to -ease special-case handling of the first or last elements. Read more
    source§

    fn positions<P>(self, predicate: P) -> Positions<Self, P> ⓘ
    where +ease special-case handling of the first or last elements. Read more

    source§

    fn positions<P>(self, predicate: P) -> Positions<Self, P> ⓘ
    where Self: Sized, P: FnMut(Self::Item) -> bool,

    Return an iterator adaptor that yields the indices of all elements -satisfying a predicate, counted from the start of the iterator. Read more
    source§

    fn update<F>(self, updater: F) -> Update<Self, F> ⓘ
    where +satisfying a predicate, counted from the start of the iterator. Read more

    source§

    fn update<F>(self, updater: F) -> Update<Self, F> ⓘ
    where Self: Sized, F: FnMut(&mut Self::Item),

    Return an iterator adaptor that applies a mutating function -to each element before yielding it. Read more
    source§

    fn next_tuple<T>(&mut self) -> Option<T>
    where +to each element before yielding it. Read more

    source§

    fn next_tuple<T>(&mut self) -> Option<T>
    where Self: Sized + Iterator<Item = T::Item>, T: HomogeneousTuple,

    Advances the iterator and returns the next items grouped in a tuple of -a specific size (up to 12). Read more
    source§

    fn collect_tuple<T>(self) -> Option<T>
    where +a specific size (up to 12). Read more

    source§

    fn collect_tuple<T>(self) -> Option<T>
    where Self: Sized + Iterator<Item = T::Item>, T: HomogeneousTuple,

    Collects all items from the iterator into a tuple of a specific size -(up to 12). Read more
    source§

    fn find_position<P>(&mut self, pred: P) -> Option<(usize, Self::Item)>
    where - P: FnMut(&Self::Item) -> bool,

    Find the position and value of the first element satisfying a predicate. Read more
    source§

    fn find_or_last<P>(self, predicate: P) -> Option<Self::Item>
    where +(up to 12). Read more

    source§

    fn find_position<P>(&mut self, pred: P) -> Option<(usize, Self::Item)>
    where + P: FnMut(&Self::Item) -> bool,

    Find the position and value of the first element satisfying a predicate. Read more
    source§

    fn find_or_last<P>(self, predicate: P) -> Option<Self::Item>
    where Self: Sized, - P: FnMut(&Self::Item) -> bool,

    Find the value of the first element satisfying a predicate or return the last element, if any. Read more
    source§

    fn find_or_first<P>(self, predicate: P) -> Option<Self::Item>
    where + P: FnMut(&Self::Item) -> bool,

    Find the value of the first element satisfying a predicate or return the last element, if any. Read more
    source§

    fn find_or_first<P>(self, predicate: P) -> Option<Self::Item>
    where Self: Sized, - P: FnMut(&Self::Item) -> bool,

    Find the value of the first element satisfying a predicate or return the first element, if any. Read more
    source§

    fn contains<Q>(&mut self, query: &Q) -> bool
    where + P: FnMut(&Self::Item) -> bool,

    Find the value of the first element satisfying a predicate or return the first element, if any. Read more
    source§

    fn contains<Q>(&mut self, query: &Q) -> bool
    where Self: Sized, Self::Item: Borrow<Q>, - Q: PartialEq,

    Returns true if the given item is present in this iterator. Read more
    source§

    fn all_equal(&mut self) -> bool
    where + Q: PartialEq,

    Returns true if the given item is present in this iterator. Read more
    source§

    fn all_equal(&mut self) -> bool
    where Self: Sized, - Self::Item: PartialEq,

    Check whether all elements compare equal. Read more
    source§

    fn all_equal_value( + Self::Item: PartialEq,

    Check whether all elements compare equal. Read more
    source§

    fn all_equal_value( &mut self ) -> Result<Self::Item, Option<(Self::Item, Self::Item)>>
    where Self: Sized, Self::Item: PartialEq,

    If there are elements and they are all equal, return a single copy of that element. If there are no elements, return an Error containing None. If there are elements and they are not all equal, return a tuple containing the first -two non-equal elements found. Read more
    source§

    fn all_unique(&mut self) -> bool
    where +two non-equal elements found. Read more

    source§

    fn all_unique(&mut self) -> bool
    where Self: Sized, - Self::Item: Eq + Hash,

    Check whether all elements are unique (non equal). Read more
    source§

    fn dropping(self, n: usize) -> Self
    where + Self::Item: Eq + Hash,

    Check whether all elements are unique (non equal). Read more
    source§

    fn dropping(self, n: usize) -> Self
    where Self: Sized,

    Consume the first n elements from the iterator eagerly, -and return the same iterator again. Read more
    source§

    fn dropping_back(self, n: usize) -> Self
    where +and return the same iterator again. Read more

    source§

    fn dropping_back(self, n: usize) -> Self
    where Self: Sized + DoubleEndedIterator,

    Consume the last n elements from the iterator eagerly, -and return the same iterator again. Read more
    source§

    fn foreach<F>(self, f: F)
    where - F: FnMut(Self::Item), - Self: Sized,

    👎Deprecated since 0.8.0: Use .for_each() instead
    Run the closure f eagerly on each element of the iterator. Read more
    source§

    fn concat(self) -> Self::Item
    where +and return the same iterator again. Read more

    source§

    fn concat(self) -> Self::Item
    where Self: Sized, - Self::Item: Extend<<<Self as Iterator>::Item as IntoIterator>::Item> + IntoIterator + Default,

    Combine all an iterator’s elements into one element by using Extend. Read more
    source§

    fn collect_vec(self) -> Vec<Self::Item>
    where + Self::Item: Extend<<<Self as Iterator>::Item as IntoIterator>::Item> + IntoIterator + Default,

    Combine all an iterator’s elements into one element by using Extend. Read more
    source§

    fn collect_vec(self) -> Vec<Self::Item>
    where Self: Sized,

    .collect_vec() is simply a type specialization of Iterator::collect, -for convenience.
    source§

    fn try_collect<T, U, E>(self) -> Result<U, E>
    where +for convenience.

    source§

    fn try_collect<T, U, E>(self) -> Result<U, E>
    where Self: Sized + Iterator<Item = Result<T, E>>, Result<U, E>: FromIterator<Result<T, E>>,

    .try_collect() is more convenient way of writing -.collect::<Result<_, _>>() Read more
    source§

    fn set_from<'a, A: 'a, J>(&mut self, from: J) -> usize
    where +.collect::<Result<_, _>>() Read more

    source§

    fn set_from<'a, A: 'a, J>(&mut self, from: J) -> usize
    where Self: Iterator<Item = &'a mut A>, J: IntoIterator<Item = A>,

    Assign to each reference in self from the from iterator, -stopping at the shortest of the two iterators. Read more
    source§

    fn join(&mut self, sep: &str) -> String
    where - Self::Item: Display,

    Combine all iterator elements into one String, separated by sep. Read more
    source§

    fn format(self, sep: &str) -> Format<'_, Self>
    where - Self: Sized,

    Format all iterator elements, separated by sep. Read more
    source§

    fn format_with<F>(self, sep: &str, format: F) -> FormatWith<'_, Self, F>
    where +stopping at the shortest of the two iterators. Read more

    source§

    fn join(&mut self, sep: &str) -> String
    where + Self::Item: Display,

    Combine all iterator elements into one String, separated by sep. Read more
    source§

    fn format(self, sep: &str) -> Format<'_, Self>
    where + Self: Sized,

    Format all iterator elements, separated by sep. Read more
    source§

    fn format_with<F>(self, sep: &str, format: F) -> FormatWith<'_, Self, F>
    where Self: Sized, - F: FnMut(Self::Item, &mut dyn FnMut(&dyn Display) -> Result) -> Result,

    Format all iterator elements, separated by sep. Read more
    source§

    fn fold_results<A, E, B, F>(&mut self, start: B, f: F) -> Result<B, E>
    where + F: FnMut(Self::Item, &mut dyn FnMut(&dyn Display) -> Result) -> Result,

    Format all iterator elements, separated by sep. Read more
    source§

    fn fold_ok<A, E, B, F>(&mut self, start: B, f: F) -> Result<B, E>
    where Self: Iterator<Item = Result<A, E>>, - F: FnMut(B, A) -> B,

    👎Deprecated since 0.10.0: Use .fold_ok() instead
    See .fold_ok().
    source§

    fn fold_ok<A, E, B, F>(&mut self, start: B, f: F) -> Result<B, E>
    where - Self: Iterator<Item = Result<A, E>>, - F: FnMut(B, A) -> B,

    Fold Result values from an iterator. Read more
    source§

    fn fold_options<A, B, F>(&mut self, start: B, f: F) -> Option<B>
    where + F: FnMut(B, A) -> B,

    Fold Result values from an iterator. Read more
    source§

    fn fold_options<A, B, F>(&mut self, start: B, f: F) -> Option<B>
    where Self: Iterator<Item = Option<A>>, - F: FnMut(B, A) -> B,

    Fold Option values from an iterator. Read more
    source§

    fn fold1<F>(self, f: F) -> Option<Self::Item>
    where + F: FnMut(B, A) -> B,

    Fold Option values from an iterator. Read more
    source§

    fn fold1<F>(self, f: F) -> Option<Self::Item>
    where F: FnMut(Self::Item, Self::Item) -> Self::Item, - Self: Sized,

    👎Deprecated since 0.10.2: Use Iterator::reduce instead
    Accumulator of the elements in the iterator. Read more
    source§

    fn tree_fold1<F>(self, f: F) -> Option<Self::Item>
    where + Self: Sized,

    👎Deprecated since 0.10.2: Use Iterator::reduce instead
    Accumulator of the elements in the iterator. Read more
    source§

    fn tree_reduce<F>(self, f: F) -> Option<Self::Item>
    where F: FnMut(Self::Item, Self::Item) -> Self::Item, - Self: Sized,

    Accumulate the elements in the iterator in a tree-like manner. Read more
    source§

    fn fold_while<B, F>(&mut self, init: B, f: F) -> FoldWhile<B>
    where + Self: Sized,

    Accumulate the elements in the iterator in a tree-like manner. Read more
    source§

    fn tree_fold1<F>(self, f: F) -> Option<Self::Item>
    where + F: FnMut(Self::Item, Self::Item) -> Self::Item, + Self: Sized,

    👎Deprecated since 0.13.0: Use .tree_reduce() instead
    See .tree_reduce().
    source§

    fn fold_while<B, F>(&mut self, init: B, f: F) -> FoldWhile<B>
    where Self: Sized, - F: FnMut(B, Self::Item) -> FoldWhile<B>,

    An iterator method that applies a function, producing a single, final value. Read more
    source§

    fn sum1<S>(self) -> Option<S>
    where + F: FnMut(B, Self::Item) -> FoldWhile<B>,

    An iterator method that applies a function, producing a single, final value. Read more
    source§

    fn sum1<S>(self) -> Option<S>
    where Self: Sized, - S: Sum<Self::Item>,

    Iterate over the entire iterator and add all the elements. Read more
    source§

    fn product1<P>(self) -> Option<P>
    where + S: Sum<Self::Item>,

    Iterate over the entire iterator and add all the elements. Read more
    source§

    fn product1<P>(self) -> Option<P>
    where Self: Sized, - P: Product<Self::Item>,

    Iterate over the entire iterator and multiply all the elements. Read more
    source§

    fn sorted_unstable(self) -> IntoIter<Self::Item> ⓘ
    where + P: Product<Self::Item>,

    Iterate over the entire iterator and multiply all the elements. Read more
    source§

    fn sorted_unstable(self) -> IntoIter<Self::Item> ⓘ
    where Self: Sized, - Self::Item: Ord,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_unstable_by<F>(self, cmp: F) -> IntoIter<Self::Item> ⓘ
    where + Self::Item: Ord,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_unstable_by<F>(self, cmp: F) -> IntoIter<Self::Item> ⓘ
    where Self: Sized, - F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_unstable_by_key<K, F>(self, f: F) -> IntoIter<Self::Item> ⓘ
    where + F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_unstable_by_key<K, F>(self, f: F) -> IntoIter<Self::Item> ⓘ
    where Self: Sized, K: Ord, - F: FnMut(&Self::Item) -> K,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted(self) -> IntoIter<Self::Item> ⓘ
    where + F: FnMut(&Self::Item) -> K,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted(self) -> IntoIter<Self::Item> ⓘ
    where Self: Sized, - Self::Item: Ord,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_by<F>(self, cmp: F) -> IntoIter<Self::Item> ⓘ
    where + Self::Item: Ord,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_by<F>(self, cmp: F) -> IntoIter<Self::Item> ⓘ
    where Self: Sized, - F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_by_key<K, F>(self, f: F) -> IntoIter<Self::Item> ⓘ
    where + F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_by_key<K, F>(self, f: F) -> IntoIter<Self::Item> ⓘ
    where Self: Sized, K: Ord, - F: FnMut(&Self::Item) -> K,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_by_cached_key<K, F>(self, f: F) -> IntoIter<Self::Item> ⓘ
    where + F: FnMut(&Self::Item) -> K,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_by_cached_key<K, F>(self, f: F) -> IntoIter<Self::Item> ⓘ
    where Self: Sized, K: Ord, F: FnMut(&Self::Item) -> K,

    Sort all iterator elements into a new iterator in ascending order. The key function is -called exactly once per key. Read more
    source§

    fn k_smallest(self, k: usize) -> IntoIter<Self::Item> ⓘ
    where +called exactly once per key. Read more

    source§

    fn k_smallest(self, k: usize) -> IntoIter<Self::Item> ⓘ
    where Self: Sized, - Self::Item: Ord,

    Sort the k smallest elements into a new iterator, in ascending order. Read more
    source§

    fn partition_map<A, B, F, L, R>(self, predicate: F) -> (A, B)
    where + Self::Item: Ord,

    Sort the k smallest elements into a new iterator, in ascending order. Read more
    source§

    fn k_smallest_by<F>(self, k: usize, cmp: F) -> IntoIter<Self::Item> ⓘ
    where + Self: Sized, + F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Sort the k smallest elements into a new iterator using the provided comparison. Read more
    source§

    fn k_smallest_by_key<F, K>(self, k: usize, key: F) -> IntoIter<Self::Item> ⓘ
    where + Self: Sized, + F: FnMut(&Self::Item) -> K, + K: Ord,

    Return the elements producing the k smallest outputs of the provided function. Read more
    source§

    fn k_largest(self, k: usize) -> IntoIter<Self::Item> ⓘ
    where + Self: Sized, + Self::Item: Ord,

    Sort the k largest elements into a new iterator, in descending order. Read more
    source§

    fn k_largest_by<F>(self, k: usize, cmp: F) -> IntoIter<Self::Item> ⓘ
    where + Self: Sized, + F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Sort the k largest elements into a new iterator using the provided comparison. Read more
    source§

    fn k_largest_by_key<F, K>(self, k: usize, key: F) -> IntoIter<Self::Item> ⓘ
    where + Self: Sized, + F: FnMut(&Self::Item) -> K, + K: Ord,

    Return the elements producing the k largest outputs of the provided function. Read more
    source§

    fn tail(self, n: usize) -> IntoIter<Self::Item> ⓘ
    where + Self: Sized,

    Consumes the iterator and return an iterator of the last n elements. Read more
    source§

    fn partition_map<A, B, F, L, R>(self, predicate: F) -> (A, B)
    where Self: Sized, F: FnMut(Self::Item) -> Either<L, R>, A: Default + Extend<L>, B: Default + Extend<R>,

    Collect all iterator elements into one of two partitions. Unlike Iterator::partition, each partition may -have a distinct type. Read more
    source§

    fn partition_result<A, B, T, E>(self) -> (A, B)
    where +have a distinct type. Read more

    source§

    fn partition_result<A, B, T, E>(self) -> (A, B)
    where Self: Iterator<Item = Result<T, E>> + Sized, A: Default + Extend<T>, B: Default + Extend<E>,

    Partition a sequence of Results into one list of all the Ok elements -and another list of all the Err elements. Read more
    source§

    fn into_group_map<K, V>(self) -> HashMap<K, Vec<V>>
    where +and another list of all the Err elements. Read more

    source§

    fn into_group_map<K, V>(self) -> HashMap<K, Vec<V>>
    where Self: Iterator<Item = (K, V)> + Sized, K: Hash + Eq,

    Return a HashMap of keys mapped to Vecs of values. Keys and values -are taken from (Key, Value) tuple pairs yielded by the input iterator. Read more
    source§

    fn into_group_map_by<K, V, F>(self, f: F) -> HashMap<K, Vec<V>>
    where +are taken from (Key, Value) tuple pairs yielded by the input iterator. Read more

    source§

    fn into_group_map_by<K, V, F>(self, f: F) -> HashMap<K, Vec<V>>
    where Self: Iterator<Item = V> + Sized, K: Hash + Eq, - F: Fn(&V) -> K,

    Return an Iterator on a HashMap. Keys mapped to Vecs of values. The key is specified -in the closure. Read more
    source§

    fn into_grouping_map<K, V>(self) -> GroupingMap<Self>
    where + F: FnMut(&V) -> K,

    Return an Iterator on a HashMap. Keys mapped to Vecs of values. The key is specified +in the closure. Read more
    source§

    fn into_grouping_map<K, V>(self) -> GroupingMap<Self>
    where Self: Iterator<Item = (K, V)> + Sized, K: Hash + Eq,

    Constructs a GroupingMap to be used later with one of the efficient -group-and-fold operations it allows to perform. Read more
    source§

    fn into_grouping_map_by<K, V, F>(self, key_mapper: F) -> GroupingMapBy<Self, F>
    where +group-and-fold operations it allows to perform. Read more

    source§

    fn into_grouping_map_by<K, V, F>(self, key_mapper: F) -> GroupingMapBy<Self, F>
    where Self: Iterator<Item = V> + Sized, K: Hash + Eq, F: FnMut(&V) -> K,

    Constructs a GroupingMap to be used later with one of the efficient -group-and-fold operations it allows to perform. Read more
    source§

    fn min_set(self) -> Vec<Self::Item>
    where +group-and-fold operations it allows to perform. Read more

    source§

    fn min_set(self) -> Vec<Self::Item>
    where Self: Sized, - Self::Item: Ord,

    Return all minimum elements of an iterator. Read more
    source§

    fn min_set_by<F>(self, compare: F) -> Vec<Self::Item>
    where + Self::Item: Ord,

    Return all minimum elements of an iterator. Read more
    source§

    fn min_set_by<F>(self, compare: F) -> Vec<Self::Item>
    where Self: Sized, F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Return all minimum elements of an iterator, as determined by -the specified function. Read more
    source§

    fn min_set_by_key<K, F>(self, key: F) -> Vec<Self::Item>
    where +the specified function. Read more

    source§

    fn min_set_by_key<K, F>(self, key: F) -> Vec<Self::Item>
    where Self: Sized, K: Ord, F: FnMut(&Self::Item) -> K,

    Return all minimum elements of an iterator, as determined by -the specified function. Read more
    source§

    fn max_set(self) -> Vec<Self::Item>
    where +the specified function. Read more

    source§

    fn max_set(self) -> Vec<Self::Item>
    where Self: Sized, - Self::Item: Ord,

    Return all maximum elements of an iterator. Read more
    source§

    fn max_set_by<F>(self, compare: F) -> Vec<Self::Item>
    where + Self::Item: Ord,

    Return all maximum elements of an iterator. Read more
    source§

    fn max_set_by<F>(self, compare: F) -> Vec<Self::Item>
    where Self: Sized, F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Return all maximum elements of an iterator, as determined by -the specified function. Read more
    source§

    fn max_set_by_key<K, F>(self, key: F) -> Vec<Self::Item>
    where +the specified function. Read more

    source§

    fn max_set_by_key<K, F>(self, key: F) -> Vec<Self::Item>
    where Self: Sized, K: Ord, F: FnMut(&Self::Item) -> K,

    Return all maximum elements of an iterator, as determined by -the specified function. Read more
    source§

    fn minmax(self) -> MinMaxResult<Self::Item>
    where +the specified function. Read more

    source§

    fn minmax(self) -> MinMaxResult<Self::Item>
    where Self: Sized, - Self::Item: PartialOrd,

    Return the minimum and maximum elements in the iterator. Read more
    source§

    fn minmax_by_key<K, F>(self, key: F) -> MinMaxResult<Self::Item>
    where + Self::Item: PartialOrd,

    Return the minimum and maximum elements in the iterator. Read more
    source§

    fn minmax_by_key<K, F>(self, key: F) -> MinMaxResult<Self::Item>
    where Self: Sized, K: PartialOrd, F: FnMut(&Self::Item) -> K,

    Return the minimum and maximum element of an iterator, as determined by -the specified function. Read more
    source§

    fn minmax_by<F>(self, compare: F) -> MinMaxResult<Self::Item>
    where +the specified function. Read more

    source§

    fn minmax_by<F>(self, compare: F) -> MinMaxResult<Self::Item>
    where Self: Sized, F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Return the minimum and maximum element of an iterator, as determined by -the specified comparison function. Read more
    source§

    fn position_max(self) -> Option<usize>
    where +the specified comparison function. Read more

    source§

    fn position_max(self) -> Option<usize>
    where Self: Sized, - Self::Item: Ord,

    Return the position of the maximum element in the iterator. Read more
    source§

    fn position_max_by_key<K, F>(self, key: F) -> Option<usize>
    where + Self::Item: Ord,

    Return the position of the maximum element in the iterator. Read more
    source§

    fn position_max_by_key<K, F>(self, key: F) -> Option<usize>
    where Self: Sized, K: Ord, F: FnMut(&Self::Item) -> K,

    Return the position of the maximum element in the iterator, as -determined by the specified function. Read more
    source§

    fn position_max_by<F>(self, compare: F) -> Option<usize>
    where +determined by the specified function. Read more

    source§

    fn position_max_by<F>(self, compare: F) -> Option<usize>
    where Self: Sized, F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Return the position of the maximum element in the iterator, as -determined by the specified comparison function. Read more
    source§

    fn position_min(self) -> Option<usize>
    where +determined by the specified comparison function. Read more

    source§

    fn position_min(self) -> Option<usize>
    where Self: Sized, - Self::Item: Ord,

    Return the position of the minimum element in the iterator. Read more
    source§

    fn position_min_by_key<K, F>(self, key: F) -> Option<usize>
    where + Self::Item: Ord,

    Return the position of the minimum element in the iterator. Read more
    source§

    fn position_min_by_key<K, F>(self, key: F) -> Option<usize>
    where Self: Sized, K: Ord, F: FnMut(&Self::Item) -> K,

    Return the position of the minimum element in the iterator, as -determined by the specified function. Read more
    source§

    fn position_min_by<F>(self, compare: F) -> Option<usize>
    where +determined by the specified function. Read more

    source§

    fn position_min_by<F>(self, compare: F) -> Option<usize>
    where Self: Sized, F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Return the position of the minimum element in the iterator, as -determined by the specified comparison function. Read more
    source§

    fn position_minmax(self) -> MinMaxResult<usize>
    where +determined by the specified comparison function. Read more

    source§

    fn position_minmax(self) -> MinMaxResult<usize>
    where Self: Sized, Self::Item: PartialOrd,

    Return the positions of the minimum and maximum elements in -the iterator. Read more
    source§

    fn position_minmax_by_key<K, F>(self, key: F) -> MinMaxResult<usize>
    where +the iterator. Read more

    source§

    fn position_minmax_by_key<K, F>(self, key: F) -> MinMaxResult<usize>
    where Self: Sized, K: PartialOrd, F: FnMut(&Self::Item) -> K,

    Return the postions of the minimum and maximum elements of an -iterator, as determined by the specified function. Read more
    source§

    fn position_minmax_by<F>(self, compare: F) -> MinMaxResult<usize>
    where +iterator, as determined by the specified function. Read more

    source§

    fn position_minmax_by<F>(self, compare: F) -> MinMaxResult<usize>
    where Self: Sized, F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Return the postions of the minimum and maximum elements of an -iterator, as determined by the specified comparison function. Read more
    source§

    fn exactly_one(self) -> Result<Self::Item, ExactlyOneError<Self>>
    where +iterator, as determined by the specified comparison function. Read more

    source§

    fn exactly_one(self) -> Result<Self::Item, ExactlyOneError<Self>>
    where Self: Sized,

    If the iterator yields exactly one element, that element will be returned, otherwise an error will be returned containing an iterator that has the same output as the input -iterator. Read more
    source§

    fn at_most_one(self) -> Result<Option<Self::Item>, ExactlyOneError<Self>>
    where - Self: Sized,

    If the iterator yields no elements, Ok(None) will be returned. If the iterator yields +iterator. Read more
    source§

    fn at_most_one(self) -> Result<Option<Self::Item>, ExactlyOneError<Self>>
    where + Self: Sized,

    If the iterator yields no elements, Ok(None) will be returned. If the iterator yields exactly one element, that element will be returned, otherwise an error will be returned -containing an iterator that has the same output as the input iterator. Read more
    source§

    fn multipeek(self) -> MultiPeek<Self> ⓘ
    where +containing an iterator that has the same output as the input iterator. Read more

    source§

    fn multipeek(self) -> MultiPeek<Self> ⓘ
    where Self: Sized,

    An iterator adaptor that allows the user to peek at multiple .next() -values without advancing the base iterator. Read more
    source§

    fn counts(self) -> HashMap<Self::Item, usize>
    where +values without advancing the base iterator. Read more

    source§

    fn counts(self) -> HashMap<Self::Item, usize>
    where Self: Sized, Self::Item: Eq + Hash,

    Collect the items in this iterator and return a HashMap which contains each item that appears in the iterator and the number -of times it appears. Read more
    source§

    fn counts_by<K, F>(self, f: F) -> HashMap<K, usize>
    where +of times it appears. Read more

    source§

    fn counts_by<K, F>(self, f: F) -> HashMap<K, usize>
    where Self: Sized, K: Eq + Hash, F: FnMut(Self::Item) -> K,

    Collect the items in this iterator and return a HashMap which contains each item that appears in the iterator and the number of times it appears, -determining identity using a keying function. Read more
    source§

    fn multiunzip<FromI>(self) -> FromI
    where - Self: Sized + MultiUnzip<FromI>,

    Converts an iterator of tuples into a tuple of containers. Read more
    source§

    fn try_len(&self) -> Result<usize, (usize, Option<usize>)>

    Returns the length of the iterator if one exists. +determining identity using a keying function. Read more
    source§

    fn multiunzip<FromI>(self) -> FromI
    where + Self: Sized + MultiUnzip<FromI>,

    Converts an iterator of tuples into a tuple of containers. Read more
    source§

    fn try_len(&self) -> Result<usize, (usize, Option<usize>)>

    Returns the length of the iterator if one exists. Otherwise return self.size_hint(). Read more
    source§

    impl<T> 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 + 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/itertools/structs/struct.Format.html b/itertools/structs/struct.Format.html index 68be60506..fc095d610 100644 --- a/itertools/structs/struct.Format.html +++ b/itertools/structs/struct.Format.html @@ -1,29 +1,29 @@ -Format in itertools::structs - Rust
    +Format in itertools::structs - Rust

    Struct itertools::structs::Format

    source · 
    pub struct Format<'a, I> { /* private fields */ }
    Expand description

    Format all iterator elements lazily, separated by sep.

    The format value can only be formatted once, after that the iterator is exhausted.

    See .format() for more information.

    -

    Trait Implementations§

    source§

    impl<'a, I> Binary for Format<'a, I>
    where +

    Trait Implementations§

    source§

    impl<'a, I> Binary for Format<'a, I>
    where I: Iterator, - I::Item: Binary,

    source§

    fn fmt(&self, f: &mut Formatter<'_>) -> Result

    Formats the value using the given formatter.
    source§

    impl<'a, I> Clone for Format<'a, I>
    where - I: 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<'a, I> Debug for Format<'a, I>
    where + I::Item: Binary,

    source§

    fn fmt(&self, f: &mut Formatter<'_>) -> Result

    Formats the value using the given formatter.
    source§

    impl<'a, I> Clone for Format<'a, I>
    where + I: 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<'a, I> Debug for Format<'a, I>
    where I: Iterator, - I::Item: Debug,

    source§

    fn fmt(&self, f: &mut Formatter<'_>) -> Result

    Formats the value using the given formatter. Read more
    source§

    impl<'a, I> Display for Format<'a, I>
    where + I::Item: Debug,

    source§

    fn fmt(&self, f: &mut Formatter<'_>) -> Result

    Formats the value using the given formatter. Read more
    source§

    impl<'a, I> Display for Format<'a, I>
    where I: Iterator, - I::Item: Display,

    source§

    fn fmt(&self, f: &mut Formatter<'_>) -> Result

    Formats the value using the given formatter. Read more
    source§

    impl<'a, I> LowerExp for Format<'a, I>
    where + I::Item: Display,

    source§

    fn fmt(&self, f: &mut Formatter<'_>) -> Result

    Formats the value using the given formatter. Read more
    source§

    impl<'a, I> LowerExp for Format<'a, I>
    where I: Iterator, - I::Item: LowerExp,

    source§

    fn fmt(&self, f: &mut Formatter<'_>) -> Result

    Formats the value using the given formatter.
    source§

    impl<'a, I> LowerHex for Format<'a, I>
    where + I::Item: LowerExp,

    source§

    fn fmt(&self, f: &mut Formatter<'_>) -> Result

    Formats the value using the given formatter.
    source§

    impl<'a, I> LowerHex for Format<'a, I>
    where I: Iterator, - I::Item: LowerHex,

    source§

    fn fmt(&self, f: &mut Formatter<'_>) -> Result

    Formats the value using the given formatter.
    source§

    impl<'a, I> Octal for Format<'a, I>
    where + I::Item: LowerHex,

    source§

    fn fmt(&self, f: &mut Formatter<'_>) -> Result

    Formats the value using the given formatter.
    source§

    impl<'a, I> Octal for Format<'a, I>
    where I: Iterator, - I::Item: Octal,

    source§

    fn fmt(&self, f: &mut Formatter<'_>) -> Result

    Formats the value using the given formatter.
    source§

    impl<'a, I> Pointer for Format<'a, I>
    where + I::Item: Octal,

    source§

    fn fmt(&self, f: &mut Formatter<'_>) -> Result

    Formats the value using the given formatter.
    source§

    impl<'a, I> Pointer for Format<'a, I>
    where I: Iterator, - I::Item: Pointer,

    source§

    fn fmt(&self, f: &mut Formatter<'_>) -> Result

    Formats the value using the given formatter.
    source§

    impl<'a, I> UpperExp for Format<'a, I>
    where + I::Item: Pointer,

    source§

    fn fmt(&self, f: &mut Formatter<'_>) -> Result

    Formats the value using the given formatter.
    source§

    impl<'a, I> UpperExp for Format<'a, I>
    where I: Iterator, - I::Item: UpperExp,

    source§

    fn fmt(&self, f: &mut Formatter<'_>) -> Result

    Formats the value using the given formatter.
    source§

    impl<'a, I> UpperHex for Format<'a, I>
    where + I::Item: UpperExp,

    source§

    fn fmt(&self, f: &mut Formatter<'_>) -> Result

    Formats the value using the given formatter.
    source§

    impl<'a, I> UpperHex for Format<'a, I>
    where I: Iterator, - I::Item: UpperHex,

    source§

    fn fmt(&self, f: &mut Formatter<'_>) -> Result

    Formats the value using the given formatter.

    Auto Trait Implementations§

    §

    impl<'a, I> !Freeze for Format<'a, I>

    §

    impl<'a, I> !RefUnwindSafe for Format<'a, I>

    §

    impl<'a, I> Send for Format<'a, I>
    where + I::Item: UpperHex,

    source§

    fn fmt(&self, f: &mut Formatter<'_>) -> Result

    Formats the value using the given formatter.

    Auto Trait Implementations§

    §

    impl<'a, I> !Freeze for Format<'a, I>

    §

    impl<'a, I> !RefUnwindSafe for Format<'a, I>

    §

    impl<'a, I> Send for Format<'a, I>
    where I: Send,

    §

    impl<'a, I> !Sync for Format<'a, I>

    §

    impl<'a, I> Unpin for Format<'a, I>
    where I: Unpin,

    §

    impl<'a, I> UnwindSafe for Format<'a, I>
    where I: UnwindSafe,

    Blanket Implementations§

    source§

    impl<T> Any for T
    where diff --git a/itertools/structs/struct.FormatWith.html b/itertools/structs/struct.FormatWith.html index 494ef5013..a6ddffd34 100644 --- a/itertools/structs/struct.FormatWith.html +++ b/itertools/structs/struct.FormatWith.html @@ -1,12 +1,14 @@ -FormatWith in itertools::structs - Rust
    +FormatWith in itertools::structs - Rust

    Struct itertools::structs::FormatWith

    source · 
    pub struct FormatWith<'a, I, F> { /* private fields */ }
    Expand description

    Format all iterator elements lazily, separated by sep.

    The format value can only be formatted once, after that the iterator is exhausted.

    See .format_with() for more information.

    -

    Trait Implementations§

    source§

    impl<'a, I, F> Clone for FormatWith<'a, I, F>
    where - (I, F): 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<'a, I, F> Display for FormatWith<'a, I, F>
    where +

    Trait Implementations§

    source§

    impl<'a, I, F> Clone for FormatWith<'a, I, F>
    where + (I, F): 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<'a, I, F> Debug for FormatWith<'a, I, F>
    where I: Iterator, - F: FnMut(I::Item, &mut dyn FnMut(&dyn Display) -> Result) -> Result,

    source§

    fn fmt(&self, f: &mut Formatter<'_>) -> Result

    Formats the value using the given formatter. Read more

    Auto Trait Implementations§

    §

    impl<'a, I, F> !Freeze for FormatWith<'a, I, F>

    §

    impl<'a, I, F> !RefUnwindSafe for FormatWith<'a, I, F>

    §

    impl<'a, I, F> Send for FormatWith<'a, I, F>
    where + F: FnMut(I::Item, &mut dyn FnMut(&dyn Display) -> Result) -> Result,

    source§

    fn fmt(&self, f: &mut Formatter<'_>) -> Result

    Formats the value using the given formatter. Read more
    source§

    impl<'a, I, F> Display for FormatWith<'a, I, F>
    where + I: Iterator, + F: FnMut(I::Item, &mut dyn FnMut(&dyn Display) -> Result) -> Result,

    source§

    fn fmt(&self, f: &mut Formatter<'_>) -> Result

    Formats the value using the given formatter. Read more

    Auto Trait Implementations§

    §

    impl<'a, I, F> !Freeze for FormatWith<'a, I, F>

    §

    impl<'a, I, F> !RefUnwindSafe for FormatWith<'a, I, F>

    §

    impl<'a, I, F> Send for FormatWith<'a, I, F>
    where F: Send, I: Send,

    §

    impl<'a, I, F> !Sync for FormatWith<'a, I, F>

    §

    impl<'a, I, F> Unpin for FormatWith<'a, I, F>
    where F: Unpin, diff --git a/itertools/structs/struct.Group.html b/itertools/structs/struct.Group.html index 61ef729b6..1dfee7ca4 100644 --- a/itertools/structs/struct.Group.html +++ b/itertools/structs/struct.Group.html @@ -1,17 +1,17 @@ -Group in itertools::structs - Rust
    -

    Struct itertools::structs::Group

    source · 
    pub struct Group<'a, K, I, F>
    where
+Group in itertools::structs - Rust
    
+    
    Struct itertools::structs::Group
    source · 
    pub struct Group<'a, K, I, F>
    where
     I: Iterator + 'a,
     I::Item: 'a,
     K: 'a,
     F: 'a,
    { /* private fields */ }
    Expand description
    An iterator for the elements in a single group.
    
 
    Iterator element type is I::Item.
    
-
    Trait Implementations§
    source§
    impl<'a, K, I, F> Drop for Group<'a, K, I, F>
    where
+
    Trait Implementations§
    source§
    impl<'a, K, I, F> Drop for Group<'a, K, I, F>
    where
     I: Iterator,
-    I::Item: 'a,
    source§
    fn drop(&mut self)
    Executes the destructor for this type. Read more
    source§
    impl<'a, K, I, F> Iterator for Group<'a, K, I, F>
    where
+    I::Item: 'a,
    source§
    fn drop(&mut self)
    Executes the destructor for this type. Read more
    source§
    impl<'a, K, I, F> Iterator for Group<'a, K, I, F>
    where
     I: Iterator,
     I::Item: 'a,
     F: FnMut(&I::Item) -> K,
-    K: PartialEq,
    §
    type Item = <I as Iterator>::Item
    The type of the elements being iterated over.
    source§
    fn next(&mut self) -> Option<Self::Item>
    Advances the iterator and returns the next value. Read more
    source§
    fn next_chunk<const N: usize>(
+    K: PartialEq,

    §

    type Item = <I as Iterator>::Item

    The type of the elements being iterated over.
    source§

    fn next(&mut self) -> Option<Self::Item>

    Advances the iterator and returns the next value. Read more
    source§

    fn next_chunk<const N: usize>( &mut self ) -> Result<[Self::Item; N], IntoIter<Self::Item, N>>
    where Self: Sized,

    🔬This is a nightly-only experimental API. (iter_next_chunk)
    Advances the iterator and returns an array containing the next N values. Read more
    1.0.0 · source§

    fn size_hint(&self) -> (usize, Option<usize>)

    Returns the bounds on the remaining length of the iterator. Read more
    1.0.0 · source§

    fn count(self) -> usize
    where @@ -206,86 +206,87 @@ otherwise. Right variant of Either<Self, Self> otherwise. Read more

    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> Itertools for T
    where - T: Iterator + ?Sized,

    source§

    fn interleave<J>(self, other: J) -> Interleave<Self, J::IntoIter> ⓘ
    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> Itertools for T
    where + T: Iterator + ?Sized,

    source§

    fn interleave<J>(self, other: J) -> Interleave<Self, J::IntoIter> ⓘ
    where J: IntoIterator<Item = Self::Item>, - Self: Sized,

    Alternate elements from two iterators until both have run out. Read more
    source§

    fn interleave_shortest<J>( + Self: Sized,

    Alternate elements from two iterators until both have run out. Read more
    source§

    fn interleave_shortest<J>( self, other: J ) -> InterleaveShortest<Self, J::IntoIter> ⓘ
    where J: IntoIterator<Item = Self::Item>, Self: Sized,

    Alternate elements from two iterators until at least one of them has run -out. Read more
    source§

    fn intersperse(self, element: Self::Item) -> Intersperse<Self>
    where +out. Read more

    source§

    fn intersperse(self, element: Self::Item) -> Intersperse<Self>
    where Self: Sized, Self::Item: Clone,

    An iterator adaptor to insert a particular value -between each element of the adapted iterator. Read more
    source§

    fn intersperse_with<F>(self, element: F) -> IntersperseWith<Self, F> ⓘ
    where +between each element of the adapted iterator. Read more

    source§

    fn intersperse_with<F>(self, element: F) -> IntersperseWith<Self, F> ⓘ
    where Self: Sized, F: FnMut() -> Self::Item,

    An iterator adaptor to insert a particular value created by a function -between each element of the adapted iterator. Read more
    source§

    fn zip_longest<J>(self, other: J) -> ZipLongest<Self, J::IntoIter> ⓘ
    where +between each element of the adapted iterator. Read more

    source§

    fn get<R>(self, index: R) -> R::Output
    where + Self: Sized, + R: IteratorIndex<Self>,

    Returns an iterator over a subsection of the iterator. Read more
    source§

    fn zip_longest<J>(self, other: J) -> ZipLongest<Self, J::IntoIter> ⓘ
    where J: IntoIterator, Self: Sized,

    Create an iterator which iterates over both this and the specified -iterator simultaneously, yielding pairs of two optional elements. Read more
    source§

    fn zip_eq<J>(self, other: J) -> ZipEq<Self, J::IntoIter> ⓘ
    where +iterator simultaneously, yielding pairs of two optional elements. Read more

    source§

    fn zip_eq<J>(self, other: J) -> ZipEq<Self, J::IntoIter> ⓘ
    where J: IntoIterator, Self: Sized,

    Create an iterator which iterates over both this and the specified -iterator simultaneously, yielding pairs of elements. Read more
    source§

    fn batching<B, F>(self, f: F) -> Batching<Self, F> ⓘ
    where +iterator simultaneously, yielding pairs of elements. Read more

    source§

    fn batching<B, F>(self, f: F) -> Batching<Self, F> ⓘ
    where F: FnMut(&mut Self) -> Option<B>, Self: Sized,

    A “meta iterator adaptor”. Its closure receives a reference to the iterator and may pick off as many elements as it likes, to produce the -next iterator element. Read more
    source§

    fn group_by<K, F>(self, key: F) -> GroupBy<K, Self, F>
    where +next iterator element. Read more

    source§

    fn chunk_by<K, F>(self, key: F) -> ChunkBy<K, Self, F>
    where Self: Sized, F: FnMut(&Self::Item) -> K, K: PartialEq,

    Return an iterable that can group iterator elements. Consecutive elements that map to the same key (“runs”), are assigned -to the same group. Read more
    source§

    fn chunks(self, size: usize) -> IntoChunks<Self>
    where - Self: Sized,

    Return an iterable that can chunk the iterator. Read more
    source§

    fn tuple_windows<T>(self) -> TupleWindows<Self, T> ⓘ
    where +to the same group. Read more

    source§

    fn group_by<K, F>(self, key: F) -> ChunkBy<K, Self, F>
    where + Self: Sized, + F: FnMut(&Self::Item) -> K, + K: PartialEq,

    👎Deprecated since 0.13.0: Use .chunk_by() instead
    See .chunk_by().
    source§

    fn chunks(self, size: usize) -> IntoChunks<Self>
    where + Self: Sized,

    Return an iterable that can chunk the iterator. Read more
    source§

    fn tuple_windows<T>(self) -> TupleWindows<Self, T> ⓘ
    where Self: Sized + Iterator<Item = T::Item>, T: HomogeneousTuple, T::Item: Clone,

    Return an iterator over all contiguous windows producing tuples of -a specific size (up to 12). Read more
    source§

    fn circular_tuple_windows<T>(self) -> CircularTupleWindows<Self, T> ⓘ
    where +a specific size (up to 12). Read more

    source§

    fn circular_tuple_windows<T>(self) -> CircularTupleWindows<Self, T> ⓘ
    where Self: Sized + Clone + Iterator<Item = T::Item> + ExactSizeIterator, T: TupleCollect + Clone, T::Item: Clone,

    Return an iterator over all windows, wrapping back to the first elements when the window would otherwise exceed the length of the -iterator, producing tuples of a specific size (up to 12). Read more
    source§

    fn tuples<T>(self) -> Tuples<Self, T> ⓘ
    where +iterator, producing tuples of a specific size (up to 12). Read more

    source§

    fn tuples<T>(self) -> Tuples<Self, T> ⓘ
    where Self: Sized + Iterator<Item = T::Item>, T: HomogeneousTuple,

    Return an iterator that groups the items in tuples of a specific size -(up to 12). Read more
    source§

    fn tee(self) -> (Tee<Self>, Tee<Self>)
    where +(up to 12). Read more

    source§

    fn tee(self) -> (Tee<Self>, Tee<Self>)
    where Self: Sized, Self::Item: Clone,

    Split into an iterator pair that both yield all elements from -the original iterator. Read more
    source§

    fn step(self, n: usize) -> Step<Self> ⓘ
    where - Self: Sized,

    👎Deprecated since 0.8.0: Use std .step_by() instead
    Return an iterator adaptor that steps n elements in the base iterator -for each iteration. Read more
    source§

    fn map_into<R>(self) -> MapInto<Self, R>
    where +the original iterator. Read more

    source§

    fn map_into<R>(self) -> MapInto<Self, R>
    where Self: Sized, - Self::Item: Into<R>,

    Convert each item of the iterator using the Into trait. Read more
    source§

    fn map_results<F, T, U, E>(self, f: F) -> MapOk<Self, F>
    where - Self: Iterator<Item = Result<T, E>> + Sized, - F: FnMut(T) -> U,

    👎Deprecated since 0.10.0: Use .map_ok() instead
    See .map_ok().
    source§

    fn map_ok<F, T, U, E>(self, f: F) -> MapOk<Self, F>
    where + Self::Item: Into<R>,

    Convert each item of the iterator using the Into trait. Read more
    source§

    fn map_ok<F, T, U, E>(self, f: F) -> MapOk<Self, F>
    where Self: Iterator<Item = Result<T, E>> + Sized, F: FnMut(T) -> U,

    Return an iterator adaptor that applies the provided closure to every Result::Ok value. Result::Err values are -unchanged. Read more
    source§

    fn filter_ok<F, T, E>(self, f: F) -> FilterOk<Self, F> ⓘ
    where +unchanged. Read more

    source§

    fn filter_ok<F, T, E>(self, f: F) -> FilterOk<Self, F> ⓘ
    where Self: Iterator<Item = Result<T, E>> + Sized, F: FnMut(&T) -> bool,

    Return an iterator adaptor that filters every Result::Ok value with the provided closure. Result::Err values are -unchanged. Read more
    source§

    fn filter_map_ok<F, T, U, E>(self, f: F) -> FilterMapOk<Self, F> ⓘ
    where +unchanged. Read more

    source§

    fn filter_map_ok<F, T, U, E>(self, f: F) -> FilterMapOk<Self, F> ⓘ
    where Self: Iterator<Item = Result<T, E>> + Sized, F: FnMut(T) -> Option<U>,

    Return an iterator adaptor that filters and transforms every Result::Ok value with the provided closure. Result::Err -values are unchanged. Read more
    source§

    fn flatten_ok<T, E>(self) -> FlattenOk<Self, T, E> ⓘ
    where +values are unchanged. Read more

    source§

    fn flatten_ok<T, E>(self) -> FlattenOk<Self, T, E> ⓘ
    where Self: Iterator<Item = Result<T, E>> + Sized, T: IntoIterator,

    Return an iterator adaptor that flattens every Result::Ok value into -a series of Result::Ok values. Result::Err values are unchanged. Read more
    source§

    fn process_results<F, T, E, R>(self, processor: F) -> Result<R, E>
    where +a series of Result::Ok values. Result::Err values are unchanged. Read more

    source§

    fn process_results<F, T, E, R>(self, processor: F) -> Result<R, E>
    where Self: Iterator<Item = Result<T, E>> + Sized, F: FnOnce(ProcessResults<'_, Self, E>) -> R,

    “Lift” a function of the values of the current iterator so as to process -an iterator of Result values instead. Read more
    source§

    fn merge<J>(self, other: J) -> Merge<Self, J::IntoIter>
    where +an iterator of Result values instead. Read more

    source§

    fn merge<J>(self, other: J) -> Merge<Self, J::IntoIter>
    where Self: Sized, Self::Item: PartialOrd, J: IntoIterator<Item = Self::Item>,

    Return an iterator adaptor that merges the two base iterators in ascending order. If both base iterators are sorted (ascending), the -result is sorted. Read more
    source§

    fn merge_by<J, F>(self, other: J, is_first: F) -> MergeBy<Self, J::IntoIter, F> ⓘ
    where +result is sorted. Read more

    source§

    fn merge_by<J, F>(self, other: J, is_first: F) -> MergeBy<Self, J::IntoIter, F> ⓘ
    where Self: Sized, J: IntoIterator<Item = Self::Item>, F: FnMut(&Self::Item, &Self::Item) -> bool,

    Return an iterator adaptor that merges the two base iterators in order. -This is much like .merge() but allows for a custom ordering. Read more
    source§

    fn merge_join_by<J, F, T>( +This is much like .merge() but allows for a custom ordering. Read more

    source§

    fn merge_join_by<J, F, T>( self, other: J, cmp_fn: F @@ -293,284 +294,295 @@ This is much like IntoIterator, F: FnMut(&Self::Item, &J::Item) -> T, Self: Sized,

    Create an iterator that merges items from both this and the specified -iterator in ascending order. Read more
    source§

    fn kmerge(self) -> KMerge<<Self::Item as IntoIterator>::IntoIter>
    where +iterator in ascending order. Read more

    source§

    fn kmerge(self) -> KMerge<<Self::Item as IntoIterator>::IntoIter>
    where Self: Sized, Self::Item: IntoIterator, <Self::Item as IntoIterator>::Item: PartialOrd,

    Return an iterator adaptor that flattens an iterator of iterators by -merging them in ascending order. Read more
    source§

    fn kmerge_by<F>( +merging them in ascending order. Read more

    source§

    fn kmerge_by<F>( self, first: F ) -> KMergeBy<<Self::Item as IntoIterator>::IntoIter, F> ⓘ
    where Self: Sized, Self::Item: IntoIterator, F: FnMut(&<Self::Item as IntoIterator>::Item, &<Self::Item as IntoIterator>::Item) -> bool,

    Return an iterator adaptor that flattens an iterator of iterators by -merging them according to the given closure. Read more
    source§

    fn cartesian_product<J>(self, other: J) -> Product<Self, J::IntoIter> ⓘ
    where +merging them according to the given closure. Read more

    source§

    fn cartesian_product<J>(self, other: J) -> Product<Self, J::IntoIter> ⓘ
    where Self: Sized, Self::Item: Clone, J: IntoIterator, J::IntoIter: Clone,

    Return an iterator adaptor that iterates over the cartesian product of -the element sets of two iterators self and J. Read more
    source§

    fn multi_cartesian_product( +the element sets of two iterators self and J. Read more

    source§

    fn multi_cartesian_product( self ) -> MultiProduct<<Self::Item as IntoIterator>::IntoIter> ⓘ
    where Self: Sized, Self::Item: IntoIterator, <Self::Item as IntoIterator>::IntoIter: Clone, <Self::Item as IntoIterator>::Item: Clone,

    Return an iterator adaptor that iterates over the cartesian product of -all subiterators returned by meta-iterator self. Read more
    source§

    fn coalesce<F>(self, f: F) -> Coalesce<Self, F>
    where +all subiterators returned by meta-iterator self. Read more

    source§

    fn coalesce<F>(self, f: F) -> Coalesce<Self, F>
    where Self: Sized, F: FnMut(Self::Item, Self::Item) -> Result<Self::Item, (Self::Item, Self::Item)>,

    Return an iterator adaptor that uses the passed-in closure to -optionally merge together consecutive elements. Read more
    source§

    fn dedup(self) -> Dedup<Self>
    where +optionally merge together consecutive elements. Read more

    source§

    fn dedup(self) -> Dedup<Self>
    where Self: Sized, Self::Item: PartialEq,

    Remove duplicates from sections of consecutive identical elements. -If the iterator is sorted, all elements will be unique. Read more
    source§

    fn dedup_by<Cmp>(self, cmp: Cmp) -> DedupBy<Self, Cmp>
    where +If the iterator is sorted, all elements will be unique. Read more

    source§

    fn dedup_by<Cmp>(self, cmp: Cmp) -> DedupBy<Self, Cmp>
    where Self: Sized, Cmp: FnMut(&Self::Item, &Self::Item) -> bool,

    Remove duplicates from sections of consecutive identical elements, determining equality using a comparison function. -If the iterator is sorted, all elements will be unique. Read more
    source§

    fn dedup_with_count(self) -> DedupWithCount<Self>
    where +If the iterator is sorted, all elements will be unique. Read more

    source§

    fn dedup_with_count(self) -> DedupWithCount<Self>
    where Self: Sized,

    Remove duplicates from sections of consecutive identical elements, while keeping a count of how many repeated elements were present. -If the iterator is sorted, all elements will be unique. Read more
    source§

    fn dedup_by_with_count<Cmp>(self, cmp: Cmp) -> DedupByWithCount<Self, Cmp>
    where +If the iterator is sorted, all elements will be unique. Read more

    source§

    fn dedup_by_with_count<Cmp>(self, cmp: Cmp) -> DedupByWithCount<Self, Cmp>
    where Self: Sized, Cmp: FnMut(&Self::Item, &Self::Item) -> bool,

    Remove duplicates from sections of consecutive identical elements, while keeping a count of how many repeated elements were present. This will determine equality using a comparison function. -If the iterator is sorted, all elements will be unique. Read more
    source§

    fn duplicates(self) -> Duplicates<Self>
    where +If the iterator is sorted, all elements will be unique. Read more

    source§

    fn duplicates(self) -> Duplicates<Self>
    where Self: Sized, Self::Item: Eq + Hash,

    Return an iterator adaptor that produces elements that appear more than once during the -iteration. Duplicates are detected using hash and equality. Read more
    source§

    fn duplicates_by<V, F>(self, f: F) -> DuplicatesBy<Self, V, F>
    where +iteration. Duplicates are detected using hash and equality. Read more

    source§

    fn duplicates_by<V, F>(self, f: F) -> DuplicatesBy<Self, V, F>
    where Self: Sized, V: Eq + Hash, F: FnMut(&Self::Item) -> V,

    Return an iterator adaptor that produces elements that appear more than once during the -iteration. Duplicates are detected using hash and equality. Read more
    source§

    fn unique(self) -> Unique<Self> ⓘ
    where +iteration. Duplicates are detected using hash and equality. Read more

    source§

    fn unique(self) -> Unique<Self> ⓘ
    where Self: Sized, Self::Item: Clone + Eq + Hash,

    Return an iterator adaptor that filters out elements that have already been produced once during the iteration. Duplicates -are detected using hash and equality. Read more
    source§

    fn unique_by<V, F>(self, f: F) -> UniqueBy<Self, V, F> ⓘ
    where +are detected using hash and equality. Read more

    source§

    fn unique_by<V, F>(self, f: F) -> UniqueBy<Self, V, F> ⓘ
    where Self: Sized, V: Eq + Hash, F: FnMut(&Self::Item) -> V,

    Return an iterator adaptor that filters out elements that have -already been produced once during the iteration. Read more
    source§

    fn peeking_take_while<F>(&mut self, accept: F) -> PeekingTakeWhile<'_, Self, F> ⓘ
    where +already been produced once during the iteration. Read more

    source§

    fn peeking_take_while<F>(&mut self, accept: F) -> PeekingTakeWhile<'_, Self, F> ⓘ
    where Self: Sized + PeekingNext, F: FnMut(&Self::Item) -> bool,

    Return an iterator adaptor that borrows from this iterator and -takes items while the closure accept returns true. Read more
    source§

    fn take_while_ref<F>(&mut self, accept: F) -> TakeWhileRef<'_, Self, F> ⓘ
    where +takes items while the closure accept returns true. Read more

    source§

    fn take_while_ref<F>(&mut self, accept: F) -> TakeWhileRef<'_, Self, F> ⓘ
    where Self: Clone, F: FnMut(&Self::Item) -> bool,

    Return an iterator adaptor that borrows from a Clone-able iterator -to only pick off elements while the predicate accept returns true. Read more
    source§

    fn take_while_inclusive<F>(self, accept: F) -> TakeWhileInclusive<Self, F> ⓘ
    where +to only pick off elements while the predicate accept returns true. Read more

    source§

    fn take_while_inclusive<F>(self, accept: F) -> TakeWhileInclusive<Self, F> ⓘ
    where Self: Sized, F: FnMut(&Self::Item) -> bool,

    Returns an iterator adaptor that consumes elements while the given predicate is true, including the element for which the predicate -first returned false. Read more
    source§

    fn while_some<A>(self) -> WhileSome<Self> ⓘ
    where +first returned false. Read more

    source§

    fn while_some<A>(self) -> WhileSome<Self> ⓘ
    where Self: Sized + Iterator<Item = Option<A>>,

    Return an iterator adaptor that filters Option<A> iterator elements -and produces A. Stops on the first None encountered. Read more
    source§

    fn tuple_combinations<T>(self) -> TupleCombinations<Self, T> ⓘ
    where +and produces A. Stops on the first None encountered. Read more

    source§

    fn tuple_combinations<T>(self) -> TupleCombinations<Self, T> ⓘ
    where Self: Sized + Clone, Self::Item: Clone, T: HasCombination<Self>,

    Return an iterator adaptor that iterates over the combinations of the -elements from an iterator. Read more
    source§

    fn combinations(self, k: usize) -> Combinations<Self> ⓘ
    where +elements from an iterator. Read more

    source§

    fn combinations(self, k: usize) -> Combinations<Self> ⓘ
    where Self: Sized, Self::Item: Clone,

    Return an iterator adaptor that iterates over the k-length combinations of -the elements from an iterator. Read more
    source§

    fn combinations_with_replacement( +the elements from an iterator. Read more

    source§

    fn combinations_with_replacement( self, k: usize ) -> CombinationsWithReplacement<Self> ⓘ
    where Self: Sized, Self::Item: Clone,

    Return an iterator that iterates over the k-length combinations of -the elements from an iterator, with replacement. Read more
    source§

    fn permutations(self, k: usize) -> Permutations<Self> ⓘ
    where +the elements from an iterator, with replacement. Read more

    source§

    fn permutations(self, k: usize) -> Permutations<Self> ⓘ
    where Self: Sized, Self::Item: Clone,

    Return an iterator adaptor that iterates over all k-permutations of the -elements from an iterator. Read more
    source§

    fn powerset(self) -> Powerset<Self> ⓘ
    where +elements from an iterator. Read more

    source§

    fn powerset(self) -> Powerset<Self> ⓘ
    where Self: Sized, Self::Item: Clone,

    Return an iterator that iterates through the powerset of the elements from an -iterator. Read more
    source§

    fn pad_using<F>(self, min: usize, f: F) -> PadUsing<Self, F> ⓘ
    where +iterator. Read more

    source§

    fn pad_using<F>(self, min: usize, f: F) -> PadUsing<Self, F> ⓘ
    where Self: Sized, F: FnMut(usize) -> Self::Item,

    Return an iterator adaptor that pads the sequence to a minimum length of -min by filling missing elements using a closure f. Read more
    source§

    fn with_position(self) -> WithPosition<Self> ⓘ
    where +min by filling missing elements using a closure f. Read more

    source§

    fn with_position(self) -> WithPosition<Self> ⓘ
    where Self: Sized,

    Return an iterator adaptor that combines each element with a Position to -ease special-case handling of the first or last elements. Read more
    source§

    fn positions<P>(self, predicate: P) -> Positions<Self, P> ⓘ
    where +ease special-case handling of the first or last elements. Read more

    source§

    fn positions<P>(self, predicate: P) -> Positions<Self, P> ⓘ
    where Self: Sized, P: FnMut(Self::Item) -> bool,

    Return an iterator adaptor that yields the indices of all elements -satisfying a predicate, counted from the start of the iterator. Read more
    source§

    fn update<F>(self, updater: F) -> Update<Self, F> ⓘ
    where +satisfying a predicate, counted from the start of the iterator. Read more

    source§

    fn update<F>(self, updater: F) -> Update<Self, F> ⓘ
    where Self: Sized, F: FnMut(&mut Self::Item),

    Return an iterator adaptor that applies a mutating function -to each element before yielding it. Read more
    source§

    fn next_tuple<T>(&mut self) -> Option<T>
    where +to each element before yielding it. Read more

    source§

    fn next_tuple<T>(&mut self) -> Option<T>
    where Self: Sized + Iterator<Item = T::Item>, T: HomogeneousTuple,

    Advances the iterator and returns the next items grouped in a tuple of -a specific size (up to 12). Read more
    source§

    fn collect_tuple<T>(self) -> Option<T>
    where +a specific size (up to 12). Read more

    source§

    fn collect_tuple<T>(self) -> Option<T>
    where Self: Sized + Iterator<Item = T::Item>, T: HomogeneousTuple,

    Collects all items from the iterator into a tuple of a specific size -(up to 12). Read more
    source§

    fn find_position<P>(&mut self, pred: P) -> Option<(usize, Self::Item)>
    where - P: FnMut(&Self::Item) -> bool,

    Find the position and value of the first element satisfying a predicate. Read more
    source§

    fn find_or_last<P>(self, predicate: P) -> Option<Self::Item>
    where +(up to 12). Read more

    source§

    fn find_position<P>(&mut self, pred: P) -> Option<(usize, Self::Item)>
    where + P: FnMut(&Self::Item) -> bool,

    Find the position and value of the first element satisfying a predicate. Read more
    source§

    fn find_or_last<P>(self, predicate: P) -> Option<Self::Item>
    where Self: Sized, - P: FnMut(&Self::Item) -> bool,

    Find the value of the first element satisfying a predicate or return the last element, if any. Read more
    source§

    fn find_or_first<P>(self, predicate: P) -> Option<Self::Item>
    where + P: FnMut(&Self::Item) -> bool,

    Find the value of the first element satisfying a predicate or return the last element, if any. Read more
    source§

    fn find_or_first<P>(self, predicate: P) -> Option<Self::Item>
    where Self: Sized, - P: FnMut(&Self::Item) -> bool,

    Find the value of the first element satisfying a predicate or return the first element, if any. Read more
    source§

    fn contains<Q>(&mut self, query: &Q) -> bool
    where + P: FnMut(&Self::Item) -> bool,

    Find the value of the first element satisfying a predicate or return the first element, if any. Read more
    source§

    fn contains<Q>(&mut self, query: &Q) -> bool
    where Self: Sized, Self::Item: Borrow<Q>, - Q: PartialEq,

    Returns true if the given item is present in this iterator. Read more
    source§

    fn all_equal(&mut self) -> bool
    where + Q: PartialEq,

    Returns true if the given item is present in this iterator. Read more
    source§

    fn all_equal(&mut self) -> bool
    where Self: Sized, - Self::Item: PartialEq,

    Check whether all elements compare equal. Read more
    source§

    fn all_equal_value( + Self::Item: PartialEq,

    Check whether all elements compare equal. Read more
    source§

    fn all_equal_value( &mut self ) -> Result<Self::Item, Option<(Self::Item, Self::Item)>>
    where Self: Sized, Self::Item: PartialEq,

    If there are elements and they are all equal, return a single copy of that element. If there are no elements, return an Error containing None. If there are elements and they are not all equal, return a tuple containing the first -two non-equal elements found. Read more
    source§

    fn all_unique(&mut self) -> bool
    where +two non-equal elements found. Read more

    source§

    fn all_unique(&mut self) -> bool
    where Self: Sized, - Self::Item: Eq + Hash,

    Check whether all elements are unique (non equal). Read more
    source§

    fn dropping(self, n: usize) -> Self
    where + Self::Item: Eq + Hash,

    Check whether all elements are unique (non equal). Read more
    source§

    fn dropping(self, n: usize) -> Self
    where Self: Sized,

    Consume the first n elements from the iterator eagerly, -and return the same iterator again. Read more
    source§

    fn dropping_back(self, n: usize) -> Self
    where +and return the same iterator again. Read more

    source§

    fn dropping_back(self, n: usize) -> Self
    where Self: Sized + DoubleEndedIterator,

    Consume the last n elements from the iterator eagerly, -and return the same iterator again. Read more
    source§

    fn foreach<F>(self, f: F)
    where - F: FnMut(Self::Item), - Self: Sized,

    👎Deprecated since 0.8.0: Use .for_each() instead
    Run the closure f eagerly on each element of the iterator. Read more
    source§

    fn concat(self) -> Self::Item
    where +and return the same iterator again. Read more

    source§

    fn concat(self) -> Self::Item
    where Self: Sized, - Self::Item: Extend<<<Self as Iterator>::Item as IntoIterator>::Item> + IntoIterator + Default,

    Combine all an iterator’s elements into one element by using Extend. Read more
    source§

    fn collect_vec(self) -> Vec<Self::Item>
    where + Self::Item: Extend<<<Self as Iterator>::Item as IntoIterator>::Item> + IntoIterator + Default,

    Combine all an iterator’s elements into one element by using Extend. Read more
    source§

    fn collect_vec(self) -> Vec<Self::Item>
    where Self: Sized,

    .collect_vec() is simply a type specialization of Iterator::collect, -for convenience.
    source§

    fn try_collect<T, U, E>(self) -> Result<U, E>
    where +for convenience.

    source§

    fn try_collect<T, U, E>(self) -> Result<U, E>
    where Self: Sized + Iterator<Item = Result<T, E>>, Result<U, E>: FromIterator<Result<T, E>>,

    .try_collect() is more convenient way of writing -.collect::<Result<_, _>>() Read more
    source§

    fn set_from<'a, A: 'a, J>(&mut self, from: J) -> usize
    where +.collect::<Result<_, _>>() Read more

    source§

    fn set_from<'a, A: 'a, J>(&mut self, from: J) -> usize
    where Self: Iterator<Item = &'a mut A>, J: IntoIterator<Item = A>,

    Assign to each reference in self from the from iterator, -stopping at the shortest of the two iterators. Read more
    source§

    fn join(&mut self, sep: &str) -> String
    where - Self::Item: Display,

    Combine all iterator elements into one String, separated by sep. Read more
    source§

    fn format(self, sep: &str) -> Format<'_, Self>
    where - Self: Sized,

    Format all iterator elements, separated by sep. Read more
    source§

    fn format_with<F>(self, sep: &str, format: F) -> FormatWith<'_, Self, F>
    where +stopping at the shortest of the two iterators. Read more

    source§

    fn join(&mut self, sep: &str) -> String
    where + Self::Item: Display,

    Combine all iterator elements into one String, separated by sep. Read more
    source§

    fn format(self, sep: &str) -> Format<'_, Self>
    where + Self: Sized,

    Format all iterator elements, separated by sep. Read more
    source§

    fn format_with<F>(self, sep: &str, format: F) -> FormatWith<'_, Self, F>
    where Self: Sized, - F: FnMut(Self::Item, &mut dyn FnMut(&dyn Display) -> Result) -> Result,

    Format all iterator elements, separated by sep. Read more
    source§

    fn fold_results<A, E, B, F>(&mut self, start: B, f: F) -> Result<B, E>
    where + F: FnMut(Self::Item, &mut dyn FnMut(&dyn Display) -> Result) -> Result,

    Format all iterator elements, separated by sep. Read more
    source§

    fn fold_ok<A, E, B, F>(&mut self, start: B, f: F) -> Result<B, E>
    where Self: Iterator<Item = Result<A, E>>, - F: FnMut(B, A) -> B,

    👎Deprecated since 0.10.0: Use .fold_ok() instead
    See .fold_ok().
    source§

    fn fold_ok<A, E, B, F>(&mut self, start: B, f: F) -> Result<B, E>
    where - Self: Iterator<Item = Result<A, E>>, - F: FnMut(B, A) -> B,

    Fold Result values from an iterator. Read more
    source§

    fn fold_options<A, B, F>(&mut self, start: B, f: F) -> Option<B>
    where + F: FnMut(B, A) -> B,

    Fold Result values from an iterator. Read more
    source§

    fn fold_options<A, B, F>(&mut self, start: B, f: F) -> Option<B>
    where Self: Iterator<Item = Option<A>>, - F: FnMut(B, A) -> B,

    Fold Option values from an iterator. Read more
    source§

    fn fold1<F>(self, f: F) -> Option<Self::Item>
    where + F: FnMut(B, A) -> B,

    Fold Option values from an iterator. Read more
    source§

    fn fold1<F>(self, f: F) -> Option<Self::Item>
    where F: FnMut(Self::Item, Self::Item) -> Self::Item, - Self: Sized,

    👎Deprecated since 0.10.2: Use Iterator::reduce instead
    Accumulator of the elements in the iterator. Read more
    source§

    fn tree_fold1<F>(self, f: F) -> Option<Self::Item>
    where + Self: Sized,

    👎Deprecated since 0.10.2: Use Iterator::reduce instead
    Accumulator of the elements in the iterator. Read more
    source§

    fn tree_reduce<F>(self, f: F) -> Option<Self::Item>
    where F: FnMut(Self::Item, Self::Item) -> Self::Item, - Self: Sized,

    Accumulate the elements in the iterator in a tree-like manner. Read more
    source§

    fn fold_while<B, F>(&mut self, init: B, f: F) -> FoldWhile<B>
    where + Self: Sized,

    Accumulate the elements in the iterator in a tree-like manner. Read more
    source§

    fn tree_fold1<F>(self, f: F) -> Option<Self::Item>
    where + F: FnMut(Self::Item, Self::Item) -> Self::Item, + Self: Sized,

    👎Deprecated since 0.13.0: Use .tree_reduce() instead
    See .tree_reduce().
    source§

    fn fold_while<B, F>(&mut self, init: B, f: F) -> FoldWhile<B>
    where Self: Sized, - F: FnMut(B, Self::Item) -> FoldWhile<B>,

    An iterator method that applies a function, producing a single, final value. Read more
    source§

    fn sum1<S>(self) -> Option<S>
    where + F: FnMut(B, Self::Item) -> FoldWhile<B>,

    An iterator method that applies a function, producing a single, final value. Read more
    source§

    fn sum1<S>(self) -> Option<S>
    where Self: Sized, - S: Sum<Self::Item>,

    Iterate over the entire iterator and add all the elements. Read more
    source§

    fn product1<P>(self) -> Option<P>
    where + S: Sum<Self::Item>,

    Iterate over the entire iterator and add all the elements. Read more
    source§

    fn product1<P>(self) -> Option<P>
    where Self: Sized, - P: Product<Self::Item>,

    Iterate over the entire iterator and multiply all the elements. Read more
    source§

    fn sorted_unstable(self) -> IntoIter<Self::Item> ⓘ
    where + P: Product<Self::Item>,

    Iterate over the entire iterator and multiply all the elements. Read more
    source§

    fn sorted_unstable(self) -> IntoIter<Self::Item> ⓘ
    where Self: Sized, - Self::Item: Ord,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_unstable_by<F>(self, cmp: F) -> IntoIter<Self::Item> ⓘ
    where + Self::Item: Ord,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_unstable_by<F>(self, cmp: F) -> IntoIter<Self::Item> ⓘ
    where Self: Sized, - F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_unstable_by_key<K, F>(self, f: F) -> IntoIter<Self::Item> ⓘ
    where + F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_unstable_by_key<K, F>(self, f: F) -> IntoIter<Self::Item> ⓘ
    where Self: Sized, K: Ord, - F: FnMut(&Self::Item) -> K,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted(self) -> IntoIter<Self::Item> ⓘ
    where + F: FnMut(&Self::Item) -> K,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted(self) -> IntoIter<Self::Item> ⓘ
    where Self: Sized, - Self::Item: Ord,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_by<F>(self, cmp: F) -> IntoIter<Self::Item> ⓘ
    where + Self::Item: Ord,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_by<F>(self, cmp: F) -> IntoIter<Self::Item> ⓘ
    where Self: Sized, - F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_by_key<K, F>(self, f: F) -> IntoIter<Self::Item> ⓘ
    where + F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_by_key<K, F>(self, f: F) -> IntoIter<Self::Item> ⓘ
    where Self: Sized, K: Ord, - F: FnMut(&Self::Item) -> K,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_by_cached_key<K, F>(self, f: F) -> IntoIter<Self::Item> ⓘ
    where + F: FnMut(&Self::Item) -> K,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_by_cached_key<K, F>(self, f: F) -> IntoIter<Self::Item> ⓘ
    where Self: Sized, K: Ord, F: FnMut(&Self::Item) -> K,

    Sort all iterator elements into a new iterator in ascending order. The key function is -called exactly once per key. Read more
    source§

    fn k_smallest(self, k: usize) -> IntoIter<Self::Item> ⓘ
    where +called exactly once per key. Read more

    source§

    fn k_smallest(self, k: usize) -> IntoIter<Self::Item> ⓘ
    where Self: Sized, - Self::Item: Ord,

    Sort the k smallest elements into a new iterator, in ascending order. Read more
    source§

    fn partition_map<A, B, F, L, R>(self, predicate: F) -> (A, B)
    where + Self::Item: Ord,

    Sort the k smallest elements into a new iterator, in ascending order. Read more
    source§

    fn k_smallest_by<F>(self, k: usize, cmp: F) -> IntoIter<Self::Item> ⓘ
    where + Self: Sized, + F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Sort the k smallest elements into a new iterator using the provided comparison. Read more
    source§

    fn k_smallest_by_key<F, K>(self, k: usize, key: F) -> IntoIter<Self::Item> ⓘ
    where + Self: Sized, + F: FnMut(&Self::Item) -> K, + K: Ord,

    Return the elements producing the k smallest outputs of the provided function. Read more
    source§

    fn k_largest(self, k: usize) -> IntoIter<Self::Item> ⓘ
    where + Self: Sized, + Self::Item: Ord,

    Sort the k largest elements into a new iterator, in descending order. Read more
    source§

    fn k_largest_by<F>(self, k: usize, cmp: F) -> IntoIter<Self::Item> ⓘ
    where + Self: Sized, + F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Sort the k largest elements into a new iterator using the provided comparison. Read more
    source§

    fn k_largest_by_key<F, K>(self, k: usize, key: F) -> IntoIter<Self::Item> ⓘ
    where + Self: Sized, + F: FnMut(&Self::Item) -> K, + K: Ord,

    Return the elements producing the k largest outputs of the provided function. Read more
    source§

    fn tail(self, n: usize) -> IntoIter<Self::Item> ⓘ
    where + Self: Sized,

    Consumes the iterator and return an iterator of the last n elements. Read more
    source§

    fn partition_map<A, B, F, L, R>(self, predicate: F) -> (A, B)
    where Self: Sized, F: FnMut(Self::Item) -> Either<L, R>, A: Default + Extend<L>, B: Default + Extend<R>,

    Collect all iterator elements into one of two partitions. Unlike Iterator::partition, each partition may -have a distinct type. Read more
    source§

    fn partition_result<A, B, T, E>(self) -> (A, B)
    where +have a distinct type. Read more

    source§

    fn partition_result<A, B, T, E>(self) -> (A, B)
    where Self: Iterator<Item = Result<T, E>> + Sized, A: Default + Extend<T>, B: Default + Extend<E>,

    Partition a sequence of Results into one list of all the Ok elements -and another list of all the Err elements. Read more
    source§

    fn into_group_map<K, V>(self) -> HashMap<K, Vec<V>>
    where +and another list of all the Err elements. Read more

    source§

    fn into_group_map<K, V>(self) -> HashMap<K, Vec<V>>
    where Self: Iterator<Item = (K, V)> + Sized, K: Hash + Eq,

    Return a HashMap of keys mapped to Vecs of values. Keys and values -are taken from (Key, Value) tuple pairs yielded by the input iterator. Read more
    source§

    fn into_group_map_by<K, V, F>(self, f: F) -> HashMap<K, Vec<V>>
    where +are taken from (Key, Value) tuple pairs yielded by the input iterator. Read more

    source§

    fn into_group_map_by<K, V, F>(self, f: F) -> HashMap<K, Vec<V>>
    where Self: Iterator<Item = V> + Sized, K: Hash + Eq, - F: Fn(&V) -> K,

    Return an Iterator on a HashMap. Keys mapped to Vecs of values. The key is specified -in the closure. Read more
    source§

    fn into_grouping_map<K, V>(self) -> GroupingMap<Self>
    where + F: FnMut(&V) -> K,

    Return an Iterator on a HashMap. Keys mapped to Vecs of values. The key is specified +in the closure. Read more
    source§

    fn into_grouping_map<K, V>(self) -> GroupingMap<Self>
    where Self: Iterator<Item = (K, V)> + Sized, K: Hash + Eq,

    Constructs a GroupingMap to be used later with one of the efficient -group-and-fold operations it allows to perform. Read more
    source§

    fn into_grouping_map_by<K, V, F>(self, key_mapper: F) -> GroupingMapBy<Self, F>
    where +group-and-fold operations it allows to perform. Read more

    source§

    fn into_grouping_map_by<K, V, F>(self, key_mapper: F) -> GroupingMapBy<Self, F>
    where Self: Iterator<Item = V> + Sized, K: Hash + Eq, F: FnMut(&V) -> K,

    Constructs a GroupingMap to be used later with one of the efficient -group-and-fold operations it allows to perform. Read more
    source§

    fn min_set(self) -> Vec<Self::Item>
    where +group-and-fold operations it allows to perform. Read more

    source§

    fn min_set(self) -> Vec<Self::Item>
    where Self: Sized, - Self::Item: Ord,

    Return all minimum elements of an iterator. Read more
    source§

    fn min_set_by<F>(self, compare: F) -> Vec<Self::Item>
    where + Self::Item: Ord,

    Return all minimum elements of an iterator. Read more
    source§

    fn min_set_by<F>(self, compare: F) -> Vec<Self::Item>
    where Self: Sized, F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Return all minimum elements of an iterator, as determined by -the specified function. Read more
    source§

    fn min_set_by_key<K, F>(self, key: F) -> Vec<Self::Item>
    where +the specified function. Read more

    source§

    fn min_set_by_key<K, F>(self, key: F) -> Vec<Self::Item>
    where Self: Sized, K: Ord, F: FnMut(&Self::Item) -> K,

    Return all minimum elements of an iterator, as determined by -the specified function. Read more
    source§

    fn max_set(self) -> Vec<Self::Item>
    where +the specified function. Read more

    source§

    fn max_set(self) -> Vec<Self::Item>
    where Self: Sized, - Self::Item: Ord,

    Return all maximum elements of an iterator. Read more
    source§

    fn max_set_by<F>(self, compare: F) -> Vec<Self::Item>
    where + Self::Item: Ord,

    Return all maximum elements of an iterator. Read more
    source§

    fn max_set_by<F>(self, compare: F) -> Vec<Self::Item>
    where Self: Sized, F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Return all maximum elements of an iterator, as determined by -the specified function. Read more
    source§

    fn max_set_by_key<K, F>(self, key: F) -> Vec<Self::Item>
    where +the specified function. Read more

    source§

    fn max_set_by_key<K, F>(self, key: F) -> Vec<Self::Item>
    where Self: Sized, K: Ord, F: FnMut(&Self::Item) -> K,

    Return all maximum elements of an iterator, as determined by -the specified function. Read more
    source§

    fn minmax(self) -> MinMaxResult<Self::Item>
    where +the specified function. Read more

    source§

    fn minmax(self) -> MinMaxResult<Self::Item>
    where Self: Sized, - Self::Item: PartialOrd,

    Return the minimum and maximum elements in the iterator. Read more
    source§

    fn minmax_by_key<K, F>(self, key: F) -> MinMaxResult<Self::Item>
    where + Self::Item: PartialOrd,

    Return the minimum and maximum elements in the iterator. Read more
    source§

    fn minmax_by_key<K, F>(self, key: F) -> MinMaxResult<Self::Item>
    where Self: Sized, K: PartialOrd, F: FnMut(&Self::Item) -> K,

    Return the minimum and maximum element of an iterator, as determined by -the specified function. Read more
    source§

    fn minmax_by<F>(self, compare: F) -> MinMaxResult<Self::Item>
    where +the specified function. Read more

    source§

    fn minmax_by<F>(self, compare: F) -> MinMaxResult<Self::Item>
    where Self: Sized, F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Return the minimum and maximum element of an iterator, as determined by -the specified comparison function. Read more
    source§

    fn position_max(self) -> Option<usize>
    where +the specified comparison function. Read more

    source§

    fn position_max(self) -> Option<usize>
    where Self: Sized, - Self::Item: Ord,

    Return the position of the maximum element in the iterator. Read more
    source§

    fn position_max_by_key<K, F>(self, key: F) -> Option<usize>
    where + Self::Item: Ord,

    Return the position of the maximum element in the iterator. Read more
    source§

    fn position_max_by_key<K, F>(self, key: F) -> Option<usize>
    where Self: Sized, K: Ord, F: FnMut(&Self::Item) -> K,

    Return the position of the maximum element in the iterator, as -determined by the specified function. Read more
    source§

    fn position_max_by<F>(self, compare: F) -> Option<usize>
    where +determined by the specified function. Read more

    source§

    fn position_max_by<F>(self, compare: F) -> Option<usize>
    where Self: Sized, F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Return the position of the maximum element in the iterator, as -determined by the specified comparison function. Read more
    source§

    fn position_min(self) -> Option<usize>
    where +determined by the specified comparison function. Read more

    source§

    fn position_min(self) -> Option<usize>
    where Self: Sized, - Self::Item: Ord,

    Return the position of the minimum element in the iterator. Read more
    source§

    fn position_min_by_key<K, F>(self, key: F) -> Option<usize>
    where + Self::Item: Ord,

    Return the position of the minimum element in the iterator. Read more
    source§

    fn position_min_by_key<K, F>(self, key: F) -> Option<usize>
    where Self: Sized, K: Ord, F: FnMut(&Self::Item) -> K,

    Return the position of the minimum element in the iterator, as -determined by the specified function. Read more
    source§

    fn position_min_by<F>(self, compare: F) -> Option<usize>
    where +determined by the specified function. Read more

    source§

    fn position_min_by<F>(self, compare: F) -> Option<usize>
    where Self: Sized, F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Return the position of the minimum element in the iterator, as -determined by the specified comparison function. Read more
    source§

    fn position_minmax(self) -> MinMaxResult<usize>
    where +determined by the specified comparison function. Read more

    source§

    fn position_minmax(self) -> MinMaxResult<usize>
    where Self: Sized, Self::Item: PartialOrd,

    Return the positions of the minimum and maximum elements in -the iterator. Read more
    source§

    fn position_minmax_by_key<K, F>(self, key: F) -> MinMaxResult<usize>
    where +the iterator. Read more

    source§

    fn position_minmax_by_key<K, F>(self, key: F) -> MinMaxResult<usize>
    where Self: Sized, K: PartialOrd, F: FnMut(&Self::Item) -> K,

    Return the postions of the minimum and maximum elements of an -iterator, as determined by the specified function. Read more
    source§

    fn position_minmax_by<F>(self, compare: F) -> MinMaxResult<usize>
    where +iterator, as determined by the specified function. Read more

    source§

    fn position_minmax_by<F>(self, compare: F) -> MinMaxResult<usize>
    where Self: Sized, F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Return the postions of the minimum and maximum elements of an -iterator, as determined by the specified comparison function. Read more
    source§

    fn exactly_one(self) -> Result<Self::Item, ExactlyOneError<Self>>
    where +iterator, as determined by the specified comparison function. Read more

    source§

    fn exactly_one(self) -> Result<Self::Item, ExactlyOneError<Self>>
    where Self: Sized,

    If the iterator yields exactly one element, that element will be returned, otherwise an error will be returned containing an iterator that has the same output as the input -iterator. Read more
    source§

    fn at_most_one(self) -> Result<Option<Self::Item>, ExactlyOneError<Self>>
    where - Self: Sized,

    If the iterator yields no elements, Ok(None) will be returned. If the iterator yields +iterator. Read more
    source§

    fn at_most_one(self) -> Result<Option<Self::Item>, ExactlyOneError<Self>>
    where + Self: Sized,

    If the iterator yields no elements, Ok(None) will be returned. If the iterator yields exactly one element, that element will be returned, otherwise an error will be returned -containing an iterator that has the same output as the input iterator. Read more
    source§

    fn multipeek(self) -> MultiPeek<Self> ⓘ
    where +containing an iterator that has the same output as the input iterator. Read more

    source§

    fn multipeek(self) -> MultiPeek<Self> ⓘ
    where Self: Sized,

    An iterator adaptor that allows the user to peek at multiple .next() -values without advancing the base iterator. Read more
    source§

    fn counts(self) -> HashMap<Self::Item, usize>
    where +values without advancing the base iterator. Read more

    source§

    fn counts(self) -> HashMap<Self::Item, usize>
    where Self: Sized, Self::Item: Eq + Hash,

    Collect the items in this iterator and return a HashMap which contains each item that appears in the iterator and the number -of times it appears. Read more
    source§

    fn counts_by<K, F>(self, f: F) -> HashMap<K, usize>
    where +of times it appears. Read more

    source§

    fn counts_by<K, F>(self, f: F) -> HashMap<K, usize>
    where Self: Sized, K: Eq + Hash, F: FnMut(Self::Item) -> K,

    Collect the items in this iterator and return a HashMap which contains each item that appears in the iterator and the number of times it appears, -determining identity using a keying function. Read more
    source§

    fn multiunzip<FromI>(self) -> FromI
    where - Self: Sized + MultiUnzip<FromI>,

    Converts an iterator of tuples into a tuple of containers. Read more
    source§

    fn try_len(&self) -> Result<usize, (usize, Option<usize>)>

    Returns the length of the iterator if one exists. +determining identity using a keying function. Read more
    source§

    fn multiunzip<FromI>(self) -> FromI
    where + Self: Sized + MultiUnzip<FromI>,

    Converts an iterator of tuples into a tuple of containers. Read more
    source§

    fn try_len(&self) -> Result<usize, (usize, Option<usize>)>

    Returns the length of the iterator if one exists. Otherwise return self.size_hint(). Read more
    source§

    impl<IT> MultiUnzip<()> for IT
    where IT: Iterator<Item = ()>,

    source§

    fn multiunzip(self)

    Unzip this iterator into multiple collections.
    source§

    impl<IT, A, FromA> MultiUnzip<(FromA,)> for IT
    where IT: Iterator<Item = (A,)>, @@ -672,4 +684,4 @@ Otherwise return self.size_hint(). (FromA, FromB, FromC, FromD, FromE, FromF, FromG, FromH, FromI, FromJ, FromK, FromL)

    Unzip this iterator into multiple collections.
    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 + 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/itertools/structs/struct.GroupingMap.html b/itertools/structs/struct.GroupingMap.html index 2fead35e7..aa0459201 100644 --- a/itertools/structs/struct.GroupingMap.html +++ b/itertools/structs/struct.GroupingMap.html @@ -1,11 +1,11 @@ -GroupingMap in itertools::structs - Rust
    -

    Struct itertools::structs::GroupingMap

    source · 
    pub struct GroupingMap<I> { /* private fields */ }
    Expand description

    GroupingMap is an intermediate struct for efficient group-and-fold operations. +GroupingMap in itertools::structs - Rust

    +

    Struct itertools::structs::GroupingMap

    source · 
    pub struct GroupingMap<I> { /* private fields */ }
    Expand description

    GroupingMap is an intermediate struct for efficient group-and-fold operations. It groups elements by their key and at the same time fold each group using some aggregating operation.

    No method on this struct performs temporary allocations.

    -

    Implementations§

    source§

    impl<I, K, V> GroupingMap<I>
    where +

    Implementations§

    source§

    impl<I, K, V> GroupingMap<I>
    where I: Iterator<Item = (K, V)>, - K: Hash + Eq,

    source

    pub fn aggregate<FO, R>(self, operation: FO) -> HashMap<K, R>
    where + K: Hash + Eq,

    source

    pub fn aggregate<FO, R>(self, operation: FO) -> HashMap<K, R>
    where FO: FnMut(Option<R>, &K, V) -> Option<R>,

    This is the generic way to perform any operation on a GroupingMap. It’s suggested to use this method only to implement custom operations when the already provided ones are not enough.

    @@ -42,7 +42,7 @@ accumulator then there won’t be an entry associated to that group’s key.

    assert_eq!(lookup.get(&2), None); // 10 resets the accumulator and nothing is summed afterward assert_eq!(lookup[&3], 7); assert_eq!(lookup.len(), 3); // The final keys are only 0, 1 and 2
    -
    source

    pub fn fold_with<FI, FO, R>(self, init: FI, operation: FO) -> HashMap<K, R>
    where +

    source

    pub fn fold_with<FI, FO, R>(self, init: FI, operation: FO) -> HashMap<K, R>
    where FI: FnMut(&K, &V) -> R, FO: FnMut(R, &K, V) -> R,

    Groups elements from the GroupingMap source by key and applies operation to the elements of each group sequentially, passing the previously accumulated value, a reference to the key @@ -74,7 +74,7 @@ and the current element as arguments, and stores the results in a new map.

    assert_eq!(lookup[&1].acc, 1 + 4 + 7); assert_eq!(lookup[&2].acc, 2 + 5); assert_eq!(lookup.len(), 3);
    -
    source

    pub fn fold<FO, R>(self, init: R, operation: FO) -> HashMap<K, R>
    where +

    source

    pub fn fold<FO, R>(self, init: R, operation: FO) -> HashMap<K, R>
    where R: Clone, FO: FnMut(R, &K, V) -> R,

    Groups elements from the GroupingMap source by key and applies operation to the elements of each group sequentially, passing the previously accumulated value, a reference to the key @@ -98,7 +98,7 @@ and the current element as arguments, and stores the results in a new map.

    assert_eq!(lookup[&1], 1 + 4 + 7); assert_eq!(lookup[&2], 2 + 5); assert_eq!(lookup.len(), 3);
    -
    source

    pub fn fold_first<FO>(self, operation: FO) -> HashMap<K, V>
    where +

    source

    pub fn reduce<FO>(self, operation: FO) -> HashMap<K, V>
    where FO: FnMut(V, &K, V) -> V,

    Groups elements from the GroupingMap source by key and applies operation to the elements of each group sequentially, passing the previously accumulated value, a reference to the key and the current element as arguments, and stores the results in a new map.

    @@ -115,13 +115,15 @@ and the current element as arguments, and stores the results in a new map.

    let lookup = (1..=7) .into_grouping_map_by(|&n| n % 3) - .fold_first(|acc, _key, val| acc + val); + .reduce(|acc, _key, val| acc + val); assert_eq!(lookup[&0], 3 + 6); assert_eq!(lookup[&1], 1 + 4 + 7); assert_eq!(lookup[&2], 2 + 5); assert_eq!(lookup.len(), 3);
    -
    source

    pub fn collect<C>(self) -> HashMap<K, C>
    where +

    source

    pub fn fold_first<FO>(self, operation: FO) -> HashMap<K, V>
    where + FO: FnMut(V, &K, V) -> V,

    👎Deprecated since 0.13.0: Use .reduce() instead

    See .reduce().

    +
    source

    pub fn collect<C>(self) -> HashMap<K, C>
    where C: Default + Extend<V>,

    Groups elements from the GroupingMap source by key and collects the elements of each group in an instance of C. The iteration order is preserved when inserting elements.

    Return a HashMap associating the key of each group with the collection containing that group’s elements.

    @@ -137,7 +139,7 @@ an instance of C. The iteration order is preserved when inserting e assert_eq!(lookup[&1], vec![1, 4].into_iter().collect::<HashSet<_>>()); assert_eq!(lookup[&2], vec![2, 5].into_iter().collect::<HashSet<_>>()); assert_eq!(lookup.len(), 3);
    -
    source

    pub fn max(self) -> HashMap<K, V>
    where +

    source

    pub fn max(self) -> HashMap<K, V>
    where V: Ord,

    Groups elements from the GroupingMap source by key and finds the maximum of each group.

    If several elements are equally maximum, the last element is picked.

    Returns a HashMap associating the key of each group with the maximum of that group’s elements.

    @@ -152,7 +154,7 @@ an instance of C. The iteration order is preserved when inserting e assert_eq!(lookup[&1], 7); assert_eq!(lookup[&2], 8); assert_eq!(lookup.len(), 3);
    -
    source

    pub fn max_by<F>(self, compare: F) -> HashMap<K, V>
    where +

    source

    pub fn max_by<F>(self, compare: F) -> HashMap<K, V>
    where F: FnMut(&K, &V, &V) -> Ordering,

    Groups elements from the GroupingMap source by key and finds the maximum of each group with respect to the specified comparison function.

    If several elements are equally maximum, the last element is picked.

    @@ -168,7 +170,7 @@ with respect to the specified comparison function.

    assert_eq!(lookup[&1], 1); assert_eq!(lookup[&2], 5); assert_eq!(lookup.len(), 3);
    -
    source

    pub fn max_by_key<F, CK>(self, f: F) -> HashMap<K, V>
    where +

    source

    pub fn max_by_key<F, CK>(self, f: F) -> HashMap<K, V>
    where F: FnMut(&K, &V) -> CK, CK: Ord,

    Groups elements from the GroupingMap source by key and finds the element of each group that gives the maximum from the specified function.

    @@ -185,7 +187,7 @@ that gives the maximum from the specified function.

    assert_eq!(lookup[&1], 7); assert_eq!(lookup[&2], 5); assert_eq!(lookup.len(), 3);
    -
    source

    pub fn min(self) -> HashMap<K, V>
    where +

    source

    pub fn min(self) -> HashMap<K, V>
    where V: Ord,

    Groups elements from the GroupingMap source by key and finds the minimum of each group.

    If several elements are equally minimum, the first element is picked.

    Returns a HashMap associating the key of each group with the minimum of that group’s elements.

    @@ -200,7 +202,7 @@ that gives the maximum from the specified function.

    assert_eq!(lookup[&1], 1); assert_eq!(lookup[&2], 5); assert_eq!(lookup.len(), 3);
    -
    source

    pub fn min_by<F>(self, compare: F) -> HashMap<K, V>
    where +

    source

    pub fn min_by<F>(self, compare: F) -> HashMap<K, V>
    where F: FnMut(&K, &V, &V) -> Ordering,

    Groups elements from the GroupingMap source by key and finds the minimum of each group with respect to the specified comparison function.

    If several elements are equally minimum, the first element is picked.

    @@ -216,7 +218,7 @@ with respect to the specified comparison function.

    assert_eq!(lookup[&1], 7); assert_eq!(lookup[&2], 8); assert_eq!(lookup.len(), 3);
    -
    source

    pub fn min_by_key<F, CK>(self, f: F) -> HashMap<K, V>
    where +

    source

    pub fn min_by_key<F, CK>(self, f: F) -> HashMap<K, V>
    where F: FnMut(&K, &V) -> CK, CK: Ord,

    Groups elements from the GroupingMap source by key and finds the element of each group that gives the minimum from the specified function.

    @@ -233,12 +235,12 @@ that gives the minimum from the specified function.

    assert_eq!(lookup[&1], 4); assert_eq!(lookup[&2], 8); assert_eq!(lookup.len(), 3);
    -
    source

    pub fn minmax(self) -> HashMap<K, MinMaxResult<V>>
    where +

    source

    pub fn minmax(self) -> HashMap<K, MinMaxResult<V>>
    where V: Ord,

    Groups elements from the GroupingMap source by key and find the maximum and minimum of each group.

    If several elements are equally maximum, the last element is picked. If several elements are equally minimum, the first element is picked.

    -

    See .minmax() for the non-grouping version.

    +

    See Itertools::minmax for the non-grouping version.

    Differences from the non grouping version:

    • It never produces a MinMaxResult::NoElements
      • @@ -257,7 +259,7 @@ If several elements are equally minimum, the first element is picked.

      assert_eq!(lookup[&1], MinMax(1, 7)); assert_eq!(lookup[&2], OneElement(5)); assert_eq!(lookup.len(), 3);
    -
    source

    pub fn minmax_by<F>(self, compare: F) -> HashMap<K, MinMaxResult<V>>
    where +

    source

    pub fn minmax_by<F>(self, compare: F) -> HashMap<K, MinMaxResult<V>>
    where F: FnMut(&K, &V, &V) -> Ordering,

    Groups elements from the GroupingMap source by key and find the maximum and minimum of each group with respect to the specified comparison function.

    If several elements are equally maximum, the last element is picked. @@ -276,7 +278,7 @@ If several elements are equally minimum, the first element is picked.

    assert_eq!(lookup[&1], MinMax(7, 1)); assert_eq!(lookup[&2], OneElement(5)); assert_eq!(lookup.len(), 3);
    -
    source

    pub fn minmax_by_key<F, CK>(self, f: F) -> HashMap<K, MinMaxResult<V>>
    where +

    source

    pub fn minmax_by_key<F, CK>(self, f: F) -> HashMap<K, MinMaxResult<V>>
    where F: FnMut(&K, &V) -> CK, CK: Ord,

    Groups elements from the GroupingMap source by key and find the elements of each group that gives the minimum and maximum from the specified function.

    @@ -296,9 +298,9 @@ If several elements are equally minimum, the first element is picked.

    assert_eq!(lookup[&1], MinMax(4, 7)); assert_eq!(lookup[&2], OneElement(5)); assert_eq!(lookup.len(), 3);
    -
    source

    pub fn sum(self) -> HashMap<K, V>
    where +

    source

    pub fn sum(self) -> HashMap<K, V>
    where V: Add<V, Output = V>,

    Groups elements from the GroupingMap source by key and sums them.

    -

    This is just a shorthand for self.fold_first(|acc, _, val| acc + val). +

    This is just a shorthand for self.reduce(|acc, _, val| acc + val). It is more limited than Iterator::sum since it doesn’t use the Sum trait.

    Returns a HashMap associating the key of each group with the sum of that group’s elements.

    @@ -312,9 +314,9 @@ It is more limited than Iterator::sum since it doesn’t use the assert_eq!(lookup[&1], 1 + 4 + 7); assert_eq!(lookup[&2], 5 + 8); assert_eq!(lookup.len(), 3);
    -
    source

    pub fn product(self) -> HashMap<K, V>
    where +

    source

    pub fn product(self) -> HashMap<K, V>
    where V: Mul<V, Output = V>,

    Groups elements from the GroupingMap source by key and multiply them.

    -

    This is just a shorthand for self.fold_first(|acc, _, val| acc * val). +

    This is just a shorthand for self.reduce(|acc, _, val| acc * val). It is more limited than Iterator::product since it doesn’t use the Product trait.

    Returns a HashMap associating the key of each group with the product of that group’s elements.

    @@ -328,7 +330,7 @@ It is more limited than Iterator::product since it doesn’t use th assert_eq!(lookup[&1], 1 * 4 * 7); assert_eq!(lookup[&2], 5 * 8); assert_eq!(lookup.len(), 3);
    -

    Trait Implementations§

    source§

    impl<I: Clone> Clone for GroupingMap<I>

    source§

    fn clone(&self) -> GroupingMap<I>

    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<I: Debug> Debug for GroupingMap<I>

    source§

    fn fmt(&self, f: &mut Formatter<'_>) -> Result

    Formats the value using the given formatter. Read more

    Auto Trait Implementations§

    §

    impl<I> Freeze for GroupingMap<I>
    where +

    Trait Implementations§

    source§

    impl<I: Clone> Clone for GroupingMap<I>

    source§

    fn clone(&self) -> GroupingMap<I>

    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<I: Debug> Debug for GroupingMap<I>

    source§

    fn fmt(&self, f: &mut Formatter<'_>) -> Result

    Formats the value using the given formatter. Read more

    Auto Trait Implementations§

    §

    impl<I> Freeze for GroupingMap<I>
    where I: Freeze,

    §

    impl<I> RefUnwindSafe for GroupingMap<I>
    where I: RefUnwindSafe,

    §

    impl<I> Send for GroupingMap<I>
    where I: Send,

    §

    impl<I> Sync for GroupingMap<I>
    where diff --git a/itertools/structs/struct.Groups.html b/itertools/structs/struct.Groups.html index 536e7946e..c03a03df4 100644 --- a/itertools/structs/struct.Groups.html +++ b/itertools/structs/struct.Groups.html @@ -1,17 +1,17 @@ -Groups in itertools::structs - Rust
    -

    Struct itertools::structs::Groups

    source · 
    pub struct Groups<'a, K, I, F>
    where
+Groups in itertools::structs - Rust
    
+    
    Struct itertools::structs::Groups
    source · 
    pub struct Groups<'a, K, I, F>
    where
     I: Iterator + 'a,
     I::Item: 'a,
     K: 'a,
     F: 'a,
    { /* private fields */ }
    Expand description
    An iterator that yields the Group iterators.
    
 
    Iterator element type is (K, Group):
 the group’s key K and the group’s iterator.
    
-
    See .group_by() for more information.
    
-
    Trait Implementations§
    source§
    impl<'a, K, I, F> Iterator for Groups<'a, K, I, F>
    where
+
    See .chunk_by() for more information.
    
+
    Trait Implementations§
    source§
    impl<'a, K, I, F> Iterator for Groups<'a, K, I, F>
    where
     I: Iterator,
     I::Item: 'a,
     F: FnMut(&I::Item) -> K,
-    K: PartialEq,
    §
    type Item = (K, Group<'a, K, I, F>)
    The type of the elements being iterated over.
    source§
    fn next(&mut self) -> Option<Self::Item>
    Advances the iterator and returns the next value. Read more
    source§
    fn next_chunk<const N: usize>(
+    K: PartialEq,

    §

    type Item = (K, Group<'a, K, I, F>)

    The type of the elements being iterated over.
    source§

    fn next(&mut self) -> Option<Self::Item>

    Advances the iterator and returns the next value. Read more
    source§

    fn next_chunk<const N: usize>( &mut self ) -> Result<[Self::Item; N], IntoIter<Self::Item, N>>
    where Self: Sized,

    🔬This is a nightly-only experimental API. (iter_next_chunk)
    Advances the iterator and returns an array containing the next N values. Read more
    1.0.0 · source§

    fn size_hint(&self) -> (usize, Option<usize>)

    Returns the bounds on the remaining length of the iterator. Read more
    1.0.0 · source§

    fn count(self) -> usize
    where @@ -204,86 +204,87 @@ otherwise. Right variant of Either<Self, Self> otherwise. Read more

    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> Itertools for T
    where - T: Iterator + ?Sized,

    source§

    fn interleave<J>(self, other: J) -> Interleave<Self, J::IntoIter> ⓘ
    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> Itertools for T
    where + T: Iterator + ?Sized,

    source§

    fn interleave<J>(self, other: J) -> Interleave<Self, J::IntoIter> ⓘ
    where J: IntoIterator<Item = Self::Item>, - Self: Sized,

    Alternate elements from two iterators until both have run out. Read more
    source§

    fn interleave_shortest<J>( + Self: Sized,

    Alternate elements from two iterators until both have run out. Read more
    source§

    fn interleave_shortest<J>( self, other: J ) -> InterleaveShortest<Self, J::IntoIter> ⓘ
    where J: IntoIterator<Item = Self::Item>, Self: Sized,

    Alternate elements from two iterators until at least one of them has run -out. Read more
    source§

    fn intersperse(self, element: Self::Item) -> Intersperse<Self>
    where +out. Read more

    source§

    fn intersperse(self, element: Self::Item) -> Intersperse<Self>
    where Self: Sized, Self::Item: Clone,

    An iterator adaptor to insert a particular value -between each element of the adapted iterator. Read more
    source§

    fn intersperse_with<F>(self, element: F) -> IntersperseWith<Self, F> ⓘ
    where +between each element of the adapted iterator. Read more

    source§

    fn intersperse_with<F>(self, element: F) -> IntersperseWith<Self, F> ⓘ
    where Self: Sized, F: FnMut() -> Self::Item,

    An iterator adaptor to insert a particular value created by a function -between each element of the adapted iterator. Read more
    source§

    fn zip_longest<J>(self, other: J) -> ZipLongest<Self, J::IntoIter> ⓘ
    where +between each element of the adapted iterator. Read more

    source§

    fn get<R>(self, index: R) -> R::Output
    where + Self: Sized, + R: IteratorIndex<Self>,

    Returns an iterator over a subsection of the iterator. Read more
    source§

    fn zip_longest<J>(self, other: J) -> ZipLongest<Self, J::IntoIter> ⓘ
    where J: IntoIterator, Self: Sized,

    Create an iterator which iterates over both this and the specified -iterator simultaneously, yielding pairs of two optional elements. Read more
    source§

    fn zip_eq<J>(self, other: J) -> ZipEq<Self, J::IntoIter> ⓘ
    where +iterator simultaneously, yielding pairs of two optional elements. Read more

    source§

    fn zip_eq<J>(self, other: J) -> ZipEq<Self, J::IntoIter> ⓘ
    where J: IntoIterator, Self: Sized,

    Create an iterator which iterates over both this and the specified -iterator simultaneously, yielding pairs of elements. Read more
    source§

    fn batching<B, F>(self, f: F) -> Batching<Self, F> ⓘ
    where +iterator simultaneously, yielding pairs of elements. Read more

    source§

    fn batching<B, F>(self, f: F) -> Batching<Self, F> ⓘ
    where F: FnMut(&mut Self) -> Option<B>, Self: Sized,

    A “meta iterator adaptor”. Its closure receives a reference to the iterator and may pick off as many elements as it likes, to produce the -next iterator element. Read more
    source§

    fn group_by<K, F>(self, key: F) -> GroupBy<K, Self, F>
    where +next iterator element. Read more

    source§

    fn chunk_by<K, F>(self, key: F) -> ChunkBy<K, Self, F>
    where Self: Sized, F: FnMut(&Self::Item) -> K, K: PartialEq,

    Return an iterable that can group iterator elements. Consecutive elements that map to the same key (“runs”), are assigned -to the same group. Read more
    source§

    fn chunks(self, size: usize) -> IntoChunks<Self>
    where - Self: Sized,

    Return an iterable that can chunk the iterator. Read more
    source§

    fn tuple_windows<T>(self) -> TupleWindows<Self, T> ⓘ
    where +to the same group. Read more

    source§

    fn group_by<K, F>(self, key: F) -> ChunkBy<K, Self, F>
    where + Self: Sized, + F: FnMut(&Self::Item) -> K, + K: PartialEq,

    👎Deprecated since 0.13.0: Use .chunk_by() instead
    See .chunk_by().
    source§

    fn chunks(self, size: usize) -> IntoChunks<Self>
    where + Self: Sized,

    Return an iterable that can chunk the iterator. Read more
    source§

    fn tuple_windows<T>(self) -> TupleWindows<Self, T> ⓘ
    where Self: Sized + Iterator<Item = T::Item>, T: HomogeneousTuple, T::Item: Clone,

    Return an iterator over all contiguous windows producing tuples of -a specific size (up to 12). Read more
    source§

    fn circular_tuple_windows<T>(self) -> CircularTupleWindows<Self, T> ⓘ
    where +a specific size (up to 12). Read more

    source§

    fn circular_tuple_windows<T>(self) -> CircularTupleWindows<Self, T> ⓘ
    where Self: Sized + Clone + Iterator<Item = T::Item> + ExactSizeIterator, T: TupleCollect + Clone, T::Item: Clone,

    Return an iterator over all windows, wrapping back to the first elements when the window would otherwise exceed the length of the -iterator, producing tuples of a specific size (up to 12). Read more
    source§

    fn tuples<T>(self) -> Tuples<Self, T> ⓘ
    where +iterator, producing tuples of a specific size (up to 12). Read more

    source§

    fn tuples<T>(self) -> Tuples<Self, T> ⓘ
    where Self: Sized + Iterator<Item = T::Item>, T: HomogeneousTuple,

    Return an iterator that groups the items in tuples of a specific size -(up to 12). Read more
    source§

    fn tee(self) -> (Tee<Self>, Tee<Self>)
    where +(up to 12). Read more

    source§

    fn tee(self) -> (Tee<Self>, Tee<Self>)
    where Self: Sized, Self::Item: Clone,

    Split into an iterator pair that both yield all elements from -the original iterator. Read more
    source§

    fn step(self, n: usize) -> Step<Self> ⓘ
    where - Self: Sized,

    👎Deprecated since 0.8.0: Use std .step_by() instead
    Return an iterator adaptor that steps n elements in the base iterator -for each iteration. Read more
    source§

    fn map_into<R>(self) -> MapInto<Self, R>
    where +the original iterator. Read more

    source§

    fn map_into<R>(self) -> MapInto<Self, R>
    where Self: Sized, - Self::Item: Into<R>,

    Convert each item of the iterator using the Into trait. Read more
    source§

    fn map_results<F, T, U, E>(self, f: F) -> MapOk<Self, F>
    where - Self: Iterator<Item = Result<T, E>> + Sized, - F: FnMut(T) -> U,

    👎Deprecated since 0.10.0: Use .map_ok() instead
    See .map_ok().
    source§

    fn map_ok<F, T, U, E>(self, f: F) -> MapOk<Self, F>
    where + Self::Item: Into<R>,

    Convert each item of the iterator using the Into trait. Read more
    source§

    fn map_ok<F, T, U, E>(self, f: F) -> MapOk<Self, F>
    where Self: Iterator<Item = Result<T, E>> + Sized, F: FnMut(T) -> U,

    Return an iterator adaptor that applies the provided closure to every Result::Ok value. Result::Err values are -unchanged. Read more
    source§

    fn filter_ok<F, T, E>(self, f: F) -> FilterOk<Self, F> ⓘ
    where +unchanged. Read more

    source§

    fn filter_ok<F, T, E>(self, f: F) -> FilterOk<Self, F> ⓘ
    where Self: Iterator<Item = Result<T, E>> + Sized, F: FnMut(&T) -> bool,

    Return an iterator adaptor that filters every Result::Ok value with the provided closure. Result::Err values are -unchanged. Read more
    source§

    fn filter_map_ok<F, T, U, E>(self, f: F) -> FilterMapOk<Self, F> ⓘ
    where +unchanged. Read more

    source§

    fn filter_map_ok<F, T, U, E>(self, f: F) -> FilterMapOk<Self, F> ⓘ
    where Self: Iterator<Item = Result<T, E>> + Sized, F: FnMut(T) -> Option<U>,

    Return an iterator adaptor that filters and transforms every Result::Ok value with the provided closure. Result::Err -values are unchanged. Read more
    source§

    fn flatten_ok<T, E>(self) -> FlattenOk<Self, T, E> ⓘ
    where +values are unchanged. Read more

    source§

    fn flatten_ok<T, E>(self) -> FlattenOk<Self, T, E> ⓘ
    where Self: Iterator<Item = Result<T, E>> + Sized, T: IntoIterator,

    Return an iterator adaptor that flattens every Result::Ok value into -a series of Result::Ok values. Result::Err values are unchanged. Read more
    source§

    fn process_results<F, T, E, R>(self, processor: F) -> Result<R, E>
    where +a series of Result::Ok values. Result::Err values are unchanged. Read more

    source§

    fn process_results<F, T, E, R>(self, processor: F) -> Result<R, E>
    where Self: Iterator<Item = Result<T, E>> + Sized, F: FnOnce(ProcessResults<'_, Self, E>) -> R,

    “Lift” a function of the values of the current iterator so as to process -an iterator of Result values instead. Read more
    source§

    fn merge<J>(self, other: J) -> Merge<Self, J::IntoIter>
    where +an iterator of Result values instead. Read more

    source§

    fn merge<J>(self, other: J) -> Merge<Self, J::IntoIter>
    where Self: Sized, Self::Item: PartialOrd, J: IntoIterator<Item = Self::Item>,

    Return an iterator adaptor that merges the two base iterators in ascending order. If both base iterators are sorted (ascending), the -result is sorted. Read more
    source§

    fn merge_by<J, F>(self, other: J, is_first: F) -> MergeBy<Self, J::IntoIter, F> ⓘ
    where +result is sorted. Read more

    source§

    fn merge_by<J, F>(self, other: J, is_first: F) -> MergeBy<Self, J::IntoIter, F> ⓘ
    where Self: Sized, J: IntoIterator<Item = Self::Item>, F: FnMut(&Self::Item, &Self::Item) -> bool,

    Return an iterator adaptor that merges the two base iterators in order. -This is much like .merge() but allows for a custom ordering. Read more
    source§

    fn merge_join_by<J, F, T>( +This is much like .merge() but allows for a custom ordering. Read more

    source§

    fn merge_join_by<J, F, T>( self, other: J, cmp_fn: F @@ -291,287 +292,298 @@ This is much like IntoIterator, F: FnMut(&Self::Item, &J::Item) -> T, Self: Sized,

    Create an iterator that merges items from both this and the specified -iterator in ascending order. Read more
    source§

    fn kmerge(self) -> KMerge<<Self::Item as IntoIterator>::IntoIter>
    where +iterator in ascending order. Read more

    source§

    fn kmerge(self) -> KMerge<<Self::Item as IntoIterator>::IntoIter>
    where Self: Sized, Self::Item: IntoIterator, <Self::Item as IntoIterator>::Item: PartialOrd,

    Return an iterator adaptor that flattens an iterator of iterators by -merging them in ascending order. Read more
    source§

    fn kmerge_by<F>( +merging them in ascending order. Read more

    source§

    fn kmerge_by<F>( self, first: F ) -> KMergeBy<<Self::Item as IntoIterator>::IntoIter, F> ⓘ
    where Self: Sized, Self::Item: IntoIterator, F: FnMut(&<Self::Item as IntoIterator>::Item, &<Self::Item as IntoIterator>::Item) -> bool,

    Return an iterator adaptor that flattens an iterator of iterators by -merging them according to the given closure. Read more
    source§

    fn cartesian_product<J>(self, other: J) -> Product<Self, J::IntoIter> ⓘ
    where +merging them according to the given closure. Read more

    source§

    fn cartesian_product<J>(self, other: J) -> Product<Self, J::IntoIter> ⓘ
    where Self: Sized, Self::Item: Clone, J: IntoIterator, J::IntoIter: Clone,

    Return an iterator adaptor that iterates over the cartesian product of -the element sets of two iterators self and J. Read more
    source§

    fn multi_cartesian_product( +the element sets of two iterators self and J. Read more

    source§

    fn multi_cartesian_product( self ) -> MultiProduct<<Self::Item as IntoIterator>::IntoIter> ⓘ
    where Self: Sized, Self::Item: IntoIterator, <Self::Item as IntoIterator>::IntoIter: Clone, <Self::Item as IntoIterator>::Item: Clone,

    Return an iterator adaptor that iterates over the cartesian product of -all subiterators returned by meta-iterator self. Read more
    source§

    fn coalesce<F>(self, f: F) -> Coalesce<Self, F>
    where +all subiterators returned by meta-iterator self. Read more

    source§

    fn coalesce<F>(self, f: F) -> Coalesce<Self, F>
    where Self: Sized, F: FnMut(Self::Item, Self::Item) -> Result<Self::Item, (Self::Item, Self::Item)>,

    Return an iterator adaptor that uses the passed-in closure to -optionally merge together consecutive elements. Read more
    source§

    fn dedup(self) -> Dedup<Self>
    where +optionally merge together consecutive elements. Read more

    source§

    fn dedup(self) -> Dedup<Self>
    where Self: Sized, Self::Item: PartialEq,

    Remove duplicates from sections of consecutive identical elements. -If the iterator is sorted, all elements will be unique. Read more
    source§

    fn dedup_by<Cmp>(self, cmp: Cmp) -> DedupBy<Self, Cmp>
    where +If the iterator is sorted, all elements will be unique. Read more

    source§

    fn dedup_by<Cmp>(self, cmp: Cmp) -> DedupBy<Self, Cmp>
    where Self: Sized, Cmp: FnMut(&Self::Item, &Self::Item) -> bool,

    Remove duplicates from sections of consecutive identical elements, determining equality using a comparison function. -If the iterator is sorted, all elements will be unique. Read more
    source§

    fn dedup_with_count(self) -> DedupWithCount<Self>
    where +If the iterator is sorted, all elements will be unique. Read more

    source§

    fn dedup_with_count(self) -> DedupWithCount<Self>
    where Self: Sized,

    Remove duplicates from sections of consecutive identical elements, while keeping a count of how many repeated elements were present. -If the iterator is sorted, all elements will be unique. Read more
    source§

    fn dedup_by_with_count<Cmp>(self, cmp: Cmp) -> DedupByWithCount<Self, Cmp>
    where +If the iterator is sorted, all elements will be unique. Read more

    source§

    fn dedup_by_with_count<Cmp>(self, cmp: Cmp) -> DedupByWithCount<Self, Cmp>
    where Self: Sized, Cmp: FnMut(&Self::Item, &Self::Item) -> bool,

    Remove duplicates from sections of consecutive identical elements, while keeping a count of how many repeated elements were present. This will determine equality using a comparison function. -If the iterator is sorted, all elements will be unique. Read more
    source§

    fn duplicates(self) -> Duplicates<Self>
    where +If the iterator is sorted, all elements will be unique. Read more

    source§

    fn duplicates(self) -> Duplicates<Self>
    where Self: Sized, Self::Item: Eq + Hash,

    Return an iterator adaptor that produces elements that appear more than once during the -iteration. Duplicates are detected using hash and equality. Read more
    source§

    fn duplicates_by<V, F>(self, f: F) -> DuplicatesBy<Self, V, F>
    where +iteration. Duplicates are detected using hash and equality. Read more

    source§

    fn duplicates_by<V, F>(self, f: F) -> DuplicatesBy<Self, V, F>
    where Self: Sized, V: Eq + Hash, F: FnMut(&Self::Item) -> V,

    Return an iterator adaptor that produces elements that appear more than once during the -iteration. Duplicates are detected using hash and equality. Read more
    source§

    fn unique(self) -> Unique<Self> ⓘ
    where +iteration. Duplicates are detected using hash and equality. Read more

    source§

    fn unique(self) -> Unique<Self> ⓘ
    where Self: Sized, Self::Item: Clone + Eq + Hash,

    Return an iterator adaptor that filters out elements that have already been produced once during the iteration. Duplicates -are detected using hash and equality. Read more
    source§

    fn unique_by<V, F>(self, f: F) -> UniqueBy<Self, V, F> ⓘ
    where +are detected using hash and equality. Read more

    source§

    fn unique_by<V, F>(self, f: F) -> UniqueBy<Self, V, F> ⓘ
    where Self: Sized, V: Eq + Hash, F: FnMut(&Self::Item) -> V,

    Return an iterator adaptor that filters out elements that have -already been produced once during the iteration. Read more
    source§

    fn peeking_take_while<F>(&mut self, accept: F) -> PeekingTakeWhile<'_, Self, F> ⓘ
    where +already been produced once during the iteration. Read more

    source§

    fn peeking_take_while<F>(&mut self, accept: F) -> PeekingTakeWhile<'_, Self, F> ⓘ
    where Self: Sized + PeekingNext, F: FnMut(&Self::Item) -> bool,

    Return an iterator adaptor that borrows from this iterator and -takes items while the closure accept returns true. Read more
    source§

    fn take_while_ref<F>(&mut self, accept: F) -> TakeWhileRef<'_, Self, F> ⓘ
    where +takes items while the closure accept returns true. Read more

    source§

    fn take_while_ref<F>(&mut self, accept: F) -> TakeWhileRef<'_, Self, F> ⓘ
    where Self: Clone, F: FnMut(&Self::Item) -> bool,

    Return an iterator adaptor that borrows from a Clone-able iterator -to only pick off elements while the predicate accept returns true. Read more
    source§

    fn take_while_inclusive<F>(self, accept: F) -> TakeWhileInclusive<Self, F> ⓘ
    where +to only pick off elements while the predicate accept returns true. Read more

    source§

    fn take_while_inclusive<F>(self, accept: F) -> TakeWhileInclusive<Self, F> ⓘ
    where Self: Sized, F: FnMut(&Self::Item) -> bool,

    Returns an iterator adaptor that consumes elements while the given predicate is true, including the element for which the predicate -first returned false. Read more
    source§

    fn while_some<A>(self) -> WhileSome<Self> ⓘ
    where +first returned false. Read more

    source§

    fn while_some<A>(self) -> WhileSome<Self> ⓘ
    where Self: Sized + Iterator<Item = Option<A>>,

    Return an iterator adaptor that filters Option<A> iterator elements -and produces A. Stops on the first None encountered. Read more
    source§

    fn tuple_combinations<T>(self) -> TupleCombinations<Self, T> ⓘ
    where +and produces A. Stops on the first None encountered. Read more

    source§

    fn tuple_combinations<T>(self) -> TupleCombinations<Self, T> ⓘ
    where Self: Sized + Clone, Self::Item: Clone, T: HasCombination<Self>,

    Return an iterator adaptor that iterates over the combinations of the -elements from an iterator. Read more
    source§

    fn combinations(self, k: usize) -> Combinations<Self> ⓘ
    where +elements from an iterator. Read more

    source§

    fn combinations(self, k: usize) -> Combinations<Self> ⓘ
    where Self: Sized, Self::Item: Clone,

    Return an iterator adaptor that iterates over the k-length combinations of -the elements from an iterator. Read more
    source§

    fn combinations_with_replacement( +the elements from an iterator. Read more

    source§

    fn combinations_with_replacement( self, k: usize ) -> CombinationsWithReplacement<Self> ⓘ
    where Self: Sized, Self::Item: Clone,

    Return an iterator that iterates over the k-length combinations of -the elements from an iterator, with replacement. Read more
    source§

    fn permutations(self, k: usize) -> Permutations<Self> ⓘ
    where +the elements from an iterator, with replacement. Read more

    source§

    fn permutations(self, k: usize) -> Permutations<Self> ⓘ
    where Self: Sized, Self::Item: Clone,

    Return an iterator adaptor that iterates over all k-permutations of the -elements from an iterator. Read more
    source§

    fn powerset(self) -> Powerset<Self> ⓘ
    where +elements from an iterator. Read more

    source§

    fn powerset(self) -> Powerset<Self> ⓘ
    where Self: Sized, Self::Item: Clone,

    Return an iterator that iterates through the powerset of the elements from an -iterator. Read more
    source§

    fn pad_using<F>(self, min: usize, f: F) -> PadUsing<Self, F> ⓘ
    where +iterator. Read more

    source§

    fn pad_using<F>(self, min: usize, f: F) -> PadUsing<Self, F> ⓘ
    where Self: Sized, F: FnMut(usize) -> Self::Item,

    Return an iterator adaptor that pads the sequence to a minimum length of -min by filling missing elements using a closure f. Read more
    source§

    fn with_position(self) -> WithPosition<Self> ⓘ
    where +min by filling missing elements using a closure f. Read more

    source§

    fn with_position(self) -> WithPosition<Self> ⓘ
    where Self: Sized,

    Return an iterator adaptor that combines each element with a Position to -ease special-case handling of the first or last elements. Read more
    source§

    fn positions<P>(self, predicate: P) -> Positions<Self, P> ⓘ
    where +ease special-case handling of the first or last elements. Read more

    source§

    fn positions<P>(self, predicate: P) -> Positions<Self, P> ⓘ
    where Self: Sized, P: FnMut(Self::Item) -> bool,

    Return an iterator adaptor that yields the indices of all elements -satisfying a predicate, counted from the start of the iterator. Read more
    source§

    fn update<F>(self, updater: F) -> Update<Self, F> ⓘ
    where +satisfying a predicate, counted from the start of the iterator. Read more

    source§

    fn update<F>(self, updater: F) -> Update<Self, F> ⓘ
    where Self: Sized, F: FnMut(&mut Self::Item),

    Return an iterator adaptor that applies a mutating function -to each element before yielding it. Read more
    source§

    fn next_tuple<T>(&mut self) -> Option<T>
    where +to each element before yielding it. Read more

    source§

    fn next_tuple<T>(&mut self) -> Option<T>
    where Self: Sized + Iterator<Item = T::Item>, T: HomogeneousTuple,

    Advances the iterator and returns the next items grouped in a tuple of -a specific size (up to 12). Read more
    source§

    fn collect_tuple<T>(self) -> Option<T>
    where +a specific size (up to 12). Read more

    source§

    fn collect_tuple<T>(self) -> Option<T>
    where Self: Sized + Iterator<Item = T::Item>, T: HomogeneousTuple,

    Collects all items from the iterator into a tuple of a specific size -(up to 12). Read more
    source§

    fn find_position<P>(&mut self, pred: P) -> Option<(usize, Self::Item)>
    where - P: FnMut(&Self::Item) -> bool,

    Find the position and value of the first element satisfying a predicate. Read more
    source§

    fn find_or_last<P>(self, predicate: P) -> Option<Self::Item>
    where +(up to 12). Read more

    source§

    fn find_position<P>(&mut self, pred: P) -> Option<(usize, Self::Item)>
    where + P: FnMut(&Self::Item) -> bool,

    Find the position and value of the first element satisfying a predicate. Read more
    source§

    fn find_or_last<P>(self, predicate: P) -> Option<Self::Item>
    where Self: Sized, - P: FnMut(&Self::Item) -> bool,

    Find the value of the first element satisfying a predicate or return the last element, if any. Read more
    source§

    fn find_or_first<P>(self, predicate: P) -> Option<Self::Item>
    where + P: FnMut(&Self::Item) -> bool,

    Find the value of the first element satisfying a predicate or return the last element, if any. Read more
    source§

    fn find_or_first<P>(self, predicate: P) -> Option<Self::Item>
    where Self: Sized, - P: FnMut(&Self::Item) -> bool,

    Find the value of the first element satisfying a predicate or return the first element, if any. Read more
    source§

    fn contains<Q>(&mut self, query: &Q) -> bool
    where + P: FnMut(&Self::Item) -> bool,

    Find the value of the first element satisfying a predicate or return the first element, if any. Read more
    source§

    fn contains<Q>(&mut self, query: &Q) -> bool
    where Self: Sized, Self::Item: Borrow<Q>, - Q: PartialEq,

    Returns true if the given item is present in this iterator. Read more
    source§

    fn all_equal(&mut self) -> bool
    where + Q: PartialEq,

    Returns true if the given item is present in this iterator. Read more
    source§

    fn all_equal(&mut self) -> bool
    where Self: Sized, - Self::Item: PartialEq,

    Check whether all elements compare equal. Read more
    source§

    fn all_equal_value( + Self::Item: PartialEq,

    Check whether all elements compare equal. Read more
    source§

    fn all_equal_value( &mut self ) -> Result<Self::Item, Option<(Self::Item, Self::Item)>>
    where Self: Sized, Self::Item: PartialEq,

    If there are elements and they are all equal, return a single copy of that element. If there are no elements, return an Error containing None. If there are elements and they are not all equal, return a tuple containing the first -two non-equal elements found. Read more
    source§

    fn all_unique(&mut self) -> bool
    where +two non-equal elements found. Read more

    source§

    fn all_unique(&mut self) -> bool
    where Self: Sized, - Self::Item: Eq + Hash,

    Check whether all elements are unique (non equal). Read more
    source§

    fn dropping(self, n: usize) -> Self
    where + Self::Item: Eq + Hash,

    Check whether all elements are unique (non equal). Read more
    source§

    fn dropping(self, n: usize) -> Self
    where Self: Sized,

    Consume the first n elements from the iterator eagerly, -and return the same iterator again. Read more
    source§

    fn dropping_back(self, n: usize) -> Self
    where +and return the same iterator again. Read more

    source§

    fn dropping_back(self, n: usize) -> Self
    where Self: Sized + DoubleEndedIterator,

    Consume the last n elements from the iterator eagerly, -and return the same iterator again. Read more
    source§

    fn foreach<F>(self, f: F)
    where - F: FnMut(Self::Item), - Self: Sized,

    👎Deprecated since 0.8.0: Use .for_each() instead
    Run the closure f eagerly on each element of the iterator. Read more
    source§

    fn concat(self) -> Self::Item
    where +and return the same iterator again. Read more

    source§

    fn concat(self) -> Self::Item
    where Self: Sized, - Self::Item: Extend<<<Self as Iterator>::Item as IntoIterator>::Item> + IntoIterator + Default,

    Combine all an iterator’s elements into one element by using Extend. Read more
    source§

    fn collect_vec(self) -> Vec<Self::Item>
    where + Self::Item: Extend<<<Self as Iterator>::Item as IntoIterator>::Item> + IntoIterator + Default,

    Combine all an iterator’s elements into one element by using Extend. Read more
    source§

    fn collect_vec(self) -> Vec<Self::Item>
    where Self: Sized,

    .collect_vec() is simply a type specialization of Iterator::collect, -for convenience.
    source§

    fn try_collect<T, U, E>(self) -> Result<U, E>
    where +for convenience.

    source§

    fn try_collect<T, U, E>(self) -> Result<U, E>
    where Self: Sized + Iterator<Item = Result<T, E>>, Result<U, E>: FromIterator<Result<T, E>>,

    .try_collect() is more convenient way of writing -.collect::<Result<_, _>>() Read more
    source§

    fn set_from<'a, A: 'a, J>(&mut self, from: J) -> usize
    where +.collect::<Result<_, _>>() Read more

    source§

    fn set_from<'a, A: 'a, J>(&mut self, from: J) -> usize
    where Self: Iterator<Item = &'a mut A>, J: IntoIterator<Item = A>,

    Assign to each reference in self from the from iterator, -stopping at the shortest of the two iterators. Read more
    source§

    fn join(&mut self, sep: &str) -> String
    where - Self::Item: Display,

    Combine all iterator elements into one String, separated by sep. Read more
    source§

    fn format(self, sep: &str) -> Format<'_, Self>
    where - Self: Sized,

    Format all iterator elements, separated by sep. Read more
    source§

    fn format_with<F>(self, sep: &str, format: F) -> FormatWith<'_, Self, F>
    where +stopping at the shortest of the two iterators. Read more

    source§

    fn join(&mut self, sep: &str) -> String
    where + Self::Item: Display,

    Combine all iterator elements into one String, separated by sep. Read more
    source§

    fn format(self, sep: &str) -> Format<'_, Self>
    where + Self: Sized,

    Format all iterator elements, separated by sep. Read more
    source§

    fn format_with<F>(self, sep: &str, format: F) -> FormatWith<'_, Self, F>
    where Self: Sized, - F: FnMut(Self::Item, &mut dyn FnMut(&dyn Display) -> Result) -> Result,

    Format all iterator elements, separated by sep. Read more
    source§

    fn fold_results<A, E, B, F>(&mut self, start: B, f: F) -> Result<B, E>
    where + F: FnMut(Self::Item, &mut dyn FnMut(&dyn Display) -> Result) -> Result,

    Format all iterator elements, separated by sep. Read more
    source§

    fn fold_ok<A, E, B, F>(&mut self, start: B, f: F) -> Result<B, E>
    where Self: Iterator<Item = Result<A, E>>, - F: FnMut(B, A) -> B,

    👎Deprecated since 0.10.0: Use .fold_ok() instead
    See .fold_ok().
    source§

    fn fold_ok<A, E, B, F>(&mut self, start: B, f: F) -> Result<B, E>
    where - Self: Iterator<Item = Result<A, E>>, - F: FnMut(B, A) -> B,

    Fold Result values from an iterator. Read more
    source§

    fn fold_options<A, B, F>(&mut self, start: B, f: F) -> Option<B>
    where + F: FnMut(B, A) -> B,

    Fold Result values from an iterator. Read more
    source§

    fn fold_options<A, B, F>(&mut self, start: B, f: F) -> Option<B>
    where Self: Iterator<Item = Option<A>>, - F: FnMut(B, A) -> B,

    Fold Option values from an iterator. Read more
    source§

    fn fold1<F>(self, f: F) -> Option<Self::Item>
    where + F: FnMut(B, A) -> B,

    Fold Option values from an iterator. Read more
    source§

    fn fold1<F>(self, f: F) -> Option<Self::Item>
    where F: FnMut(Self::Item, Self::Item) -> Self::Item, - Self: Sized,

    👎Deprecated since 0.10.2: Use Iterator::reduce instead
    Accumulator of the elements in the iterator. Read more
    source§

    fn tree_fold1<F>(self, f: F) -> Option<Self::Item>
    where + Self: Sized,

    👎Deprecated since 0.10.2: Use Iterator::reduce instead
    Accumulator of the elements in the iterator. Read more
    source§

    fn tree_reduce<F>(self, f: F) -> Option<Self::Item>
    where F: FnMut(Self::Item, Self::Item) -> Self::Item, - Self: Sized,

    Accumulate the elements in the iterator in a tree-like manner. Read more
    source§

    fn fold_while<B, F>(&mut self, init: B, f: F) -> FoldWhile<B>
    where + Self: Sized,

    Accumulate the elements in the iterator in a tree-like manner. Read more
    source§

    fn tree_fold1<F>(self, f: F) -> Option<Self::Item>
    where + F: FnMut(Self::Item, Self::Item) -> Self::Item, + Self: Sized,

    👎Deprecated since 0.13.0: Use .tree_reduce() instead
    See .tree_reduce().
    source§

    fn fold_while<B, F>(&mut self, init: B, f: F) -> FoldWhile<B>
    where Self: Sized, - F: FnMut(B, Self::Item) -> FoldWhile<B>,

    An iterator method that applies a function, producing a single, final value. Read more
    source§

    fn sum1<S>(self) -> Option<S>
    where + F: FnMut(B, Self::Item) -> FoldWhile<B>,

    An iterator method that applies a function, producing a single, final value. Read more
    source§

    fn sum1<S>(self) -> Option<S>
    where Self: Sized, - S: Sum<Self::Item>,

    Iterate over the entire iterator and add all the elements. Read more
    source§

    fn product1<P>(self) -> Option<P>
    where + S: Sum<Self::Item>,

    Iterate over the entire iterator and add all the elements. Read more
    source§

    fn product1<P>(self) -> Option<P>
    where Self: Sized, - P: Product<Self::Item>,

    Iterate over the entire iterator and multiply all the elements. Read more
    source§

    fn sorted_unstable(self) -> IntoIter<Self::Item> ⓘ
    where + P: Product<Self::Item>,

    Iterate over the entire iterator and multiply all the elements. Read more
    source§

    fn sorted_unstable(self) -> IntoIter<Self::Item> ⓘ
    where Self: Sized, - Self::Item: Ord,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_unstable_by<F>(self, cmp: F) -> IntoIter<Self::Item> ⓘ
    where + Self::Item: Ord,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_unstable_by<F>(self, cmp: F) -> IntoIter<Self::Item> ⓘ
    where Self: Sized, - F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_unstable_by_key<K, F>(self, f: F) -> IntoIter<Self::Item> ⓘ
    where + F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_unstable_by_key<K, F>(self, f: F) -> IntoIter<Self::Item> ⓘ
    where Self: Sized, K: Ord, - F: FnMut(&Self::Item) -> K,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted(self) -> IntoIter<Self::Item> ⓘ
    where + F: FnMut(&Self::Item) -> K,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted(self) -> IntoIter<Self::Item> ⓘ
    where Self: Sized, - Self::Item: Ord,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_by<F>(self, cmp: F) -> IntoIter<Self::Item> ⓘ
    where + Self::Item: Ord,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_by<F>(self, cmp: F) -> IntoIter<Self::Item> ⓘ
    where Self: Sized, - F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_by_key<K, F>(self, f: F) -> IntoIter<Self::Item> ⓘ
    where + F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_by_key<K, F>(self, f: F) -> IntoIter<Self::Item> ⓘ
    where Self: Sized, K: Ord, - F: FnMut(&Self::Item) -> K,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_by_cached_key<K, F>(self, f: F) -> IntoIter<Self::Item> ⓘ
    where + F: FnMut(&Self::Item) -> K,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_by_cached_key<K, F>(self, f: F) -> IntoIter<Self::Item> ⓘ
    where Self: Sized, K: Ord, F: FnMut(&Self::Item) -> K,

    Sort all iterator elements into a new iterator in ascending order. The key function is -called exactly once per key. Read more
    source§

    fn k_smallest(self, k: usize) -> IntoIter<Self::Item> ⓘ
    where +called exactly once per key. Read more

    source§

    fn k_smallest(self, k: usize) -> IntoIter<Self::Item> ⓘ
    where Self: Sized, - Self::Item: Ord,

    Sort the k smallest elements into a new iterator, in ascending order. Read more
    source§

    fn partition_map<A, B, F, L, R>(self, predicate: F) -> (A, B)
    where + Self::Item: Ord,

    Sort the k smallest elements into a new iterator, in ascending order. Read more
    source§

    fn k_smallest_by<F>(self, k: usize, cmp: F) -> IntoIter<Self::Item> ⓘ
    where + Self: Sized, + F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Sort the k smallest elements into a new iterator using the provided comparison. Read more
    source§

    fn k_smallest_by_key<F, K>(self, k: usize, key: F) -> IntoIter<Self::Item> ⓘ
    where + Self: Sized, + F: FnMut(&Self::Item) -> K, + K: Ord,

    Return the elements producing the k smallest outputs of the provided function. Read more
    source§

    fn k_largest(self, k: usize) -> IntoIter<Self::Item> ⓘ
    where + Self: Sized, + Self::Item: Ord,

    Sort the k largest elements into a new iterator, in descending order. Read more
    source§

    fn k_largest_by<F>(self, k: usize, cmp: F) -> IntoIter<Self::Item> ⓘ
    where + Self: Sized, + F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Sort the k largest elements into a new iterator using the provided comparison. Read more
    source§

    fn k_largest_by_key<F, K>(self, k: usize, key: F) -> IntoIter<Self::Item> ⓘ
    where + Self: Sized, + F: FnMut(&Self::Item) -> K, + K: Ord,

    Return the elements producing the k largest outputs of the provided function. Read more
    source§

    fn tail(self, n: usize) -> IntoIter<Self::Item> ⓘ
    where + Self: Sized,

    Consumes the iterator and return an iterator of the last n elements. Read more
    source§

    fn partition_map<A, B, F, L, R>(self, predicate: F) -> (A, B)
    where Self: Sized, F: FnMut(Self::Item) -> Either<L, R>, A: Default + Extend<L>, B: Default + Extend<R>,

    Collect all iterator elements into one of two partitions. Unlike Iterator::partition, each partition may -have a distinct type. Read more
    source§

    fn partition_result<A, B, T, E>(self) -> (A, B)
    where +have a distinct type. Read more

    source§

    fn partition_result<A, B, T, E>(self) -> (A, B)
    where Self: Iterator<Item = Result<T, E>> + Sized, A: Default + Extend<T>, B: Default + Extend<E>,

    Partition a sequence of Results into one list of all the Ok elements -and another list of all the Err elements. Read more
    source§

    fn into_group_map<K, V>(self) -> HashMap<K, Vec<V>>
    where +and another list of all the Err elements. Read more

    source§

    fn into_group_map<K, V>(self) -> HashMap<K, Vec<V>>
    where Self: Iterator<Item = (K, V)> + Sized, K: Hash + Eq,

    Return a HashMap of keys mapped to Vecs of values. Keys and values -are taken from (Key, Value) tuple pairs yielded by the input iterator. Read more
    source§

    fn into_group_map_by<K, V, F>(self, f: F) -> HashMap<K, Vec<V>>
    where +are taken from (Key, Value) tuple pairs yielded by the input iterator. Read more

    source§

    fn into_group_map_by<K, V, F>(self, f: F) -> HashMap<K, Vec<V>>
    where Self: Iterator<Item = V> + Sized, K: Hash + Eq, - F: Fn(&V) -> K,

    Return an Iterator on a HashMap. Keys mapped to Vecs of values. The key is specified -in the closure. Read more
    source§

    fn into_grouping_map<K, V>(self) -> GroupingMap<Self>
    where + F: FnMut(&V) -> K,

    Return an Iterator on a HashMap. Keys mapped to Vecs of values. The key is specified +in the closure. Read more
    source§

    fn into_grouping_map<K, V>(self) -> GroupingMap<Self>
    where Self: Iterator<Item = (K, V)> + Sized, K: Hash + Eq,

    Constructs a GroupingMap to be used later with one of the efficient -group-and-fold operations it allows to perform. Read more
    source§

    fn into_grouping_map_by<K, V, F>(self, key_mapper: F) -> GroupingMapBy<Self, F>
    where +group-and-fold operations it allows to perform. Read more

    source§

    fn into_grouping_map_by<K, V, F>(self, key_mapper: F) -> GroupingMapBy<Self, F>
    where Self: Iterator<Item = V> + Sized, K: Hash + Eq, F: FnMut(&V) -> K,

    Constructs a GroupingMap to be used later with one of the efficient -group-and-fold operations it allows to perform. Read more
    source§

    fn min_set(self) -> Vec<Self::Item>
    where +group-and-fold operations it allows to perform. Read more

    source§

    fn min_set(self) -> Vec<Self::Item>
    where Self: Sized, - Self::Item: Ord,

    Return all minimum elements of an iterator. Read more
    source§

    fn min_set_by<F>(self, compare: F) -> Vec<Self::Item>
    where + Self::Item: Ord,

    Return all minimum elements of an iterator. Read more
    source§

    fn min_set_by<F>(self, compare: F) -> Vec<Self::Item>
    where Self: Sized, F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Return all minimum elements of an iterator, as determined by -the specified function. Read more
    source§

    fn min_set_by_key<K, F>(self, key: F) -> Vec<Self::Item>
    where +the specified function. Read more

    source§

    fn min_set_by_key<K, F>(self, key: F) -> Vec<Self::Item>
    where Self: Sized, K: Ord, F: FnMut(&Self::Item) -> K,

    Return all minimum elements of an iterator, as determined by -the specified function. Read more
    source§

    fn max_set(self) -> Vec<Self::Item>
    where +the specified function. Read more

    source§

    fn max_set(self) -> Vec<Self::Item>
    where Self: Sized, - Self::Item: Ord,

    Return all maximum elements of an iterator. Read more
    source§

    fn max_set_by<F>(self, compare: F) -> Vec<Self::Item>
    where + Self::Item: Ord,

    Return all maximum elements of an iterator. Read more
    source§

    fn max_set_by<F>(self, compare: F) -> Vec<Self::Item>
    where Self: Sized, F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Return all maximum elements of an iterator, as determined by -the specified function. Read more
    source§

    fn max_set_by_key<K, F>(self, key: F) -> Vec<Self::Item>
    where +the specified function. Read more

    source§

    fn max_set_by_key<K, F>(self, key: F) -> Vec<Self::Item>
    where Self: Sized, K: Ord, F: FnMut(&Self::Item) -> K,

    Return all maximum elements of an iterator, as determined by -the specified function. Read more
    source§

    fn minmax(self) -> MinMaxResult<Self::Item>
    where +the specified function. Read more

    source§

    fn minmax(self) -> MinMaxResult<Self::Item>
    where Self: Sized, - Self::Item: PartialOrd,

    Return the minimum and maximum elements in the iterator. Read more
    source§

    fn minmax_by_key<K, F>(self, key: F) -> MinMaxResult<Self::Item>
    where + Self::Item: PartialOrd,

    Return the minimum and maximum elements in the iterator. Read more
    source§

    fn minmax_by_key<K, F>(self, key: F) -> MinMaxResult<Self::Item>
    where Self: Sized, K: PartialOrd, F: FnMut(&Self::Item) -> K,

    Return the minimum and maximum element of an iterator, as determined by -the specified function. Read more
    source§

    fn minmax_by<F>(self, compare: F) -> MinMaxResult<Self::Item>
    where +the specified function. Read more

    source§

    fn minmax_by<F>(self, compare: F) -> MinMaxResult<Self::Item>
    where Self: Sized, F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Return the minimum and maximum element of an iterator, as determined by -the specified comparison function. Read more
    source§

    fn position_max(self) -> Option<usize>
    where +the specified comparison function. Read more

    source§

    fn position_max(self) -> Option<usize>
    where Self: Sized, - Self::Item: Ord,

    Return the position of the maximum element in the iterator. Read more
    source§

    fn position_max_by_key<K, F>(self, key: F) -> Option<usize>
    where + Self::Item: Ord,

    Return the position of the maximum element in the iterator. Read more
    source§

    fn position_max_by_key<K, F>(self, key: F) -> Option<usize>
    where Self: Sized, K: Ord, F: FnMut(&Self::Item) -> K,

    Return the position of the maximum element in the iterator, as -determined by the specified function. Read more
    source§

    fn position_max_by<F>(self, compare: F) -> Option<usize>
    where +determined by the specified function. Read more

    source§

    fn position_max_by<F>(self, compare: F) -> Option<usize>
    where Self: Sized, F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Return the position of the maximum element in the iterator, as -determined by the specified comparison function. Read more
    source§

    fn position_min(self) -> Option<usize>
    where +determined by the specified comparison function. Read more

    source§

    fn position_min(self) -> Option<usize>
    where Self: Sized, - Self::Item: Ord,

    Return the position of the minimum element in the iterator. Read more
    source§

    fn position_min_by_key<K, F>(self, key: F) -> Option<usize>
    where + Self::Item: Ord,

    Return the position of the minimum element in the iterator. Read more
    source§

    fn position_min_by_key<K, F>(self, key: F) -> Option<usize>
    where Self: Sized, K: Ord, F: FnMut(&Self::Item) -> K,

    Return the position of the minimum element in the iterator, as -determined by the specified function. Read more
    source§

    fn position_min_by<F>(self, compare: F) -> Option<usize>
    where +determined by the specified function. Read more

    source§

    fn position_min_by<F>(self, compare: F) -> Option<usize>
    where Self: Sized, F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Return the position of the minimum element in the iterator, as -determined by the specified comparison function. Read more
    source§

    fn position_minmax(self) -> MinMaxResult<usize>
    where +determined by the specified comparison function. Read more

    source§

    fn position_minmax(self) -> MinMaxResult<usize>
    where Self: Sized, Self::Item: PartialOrd,

    Return the positions of the minimum and maximum elements in -the iterator. Read more
    source§

    fn position_minmax_by_key<K, F>(self, key: F) -> MinMaxResult<usize>
    where +the iterator. Read more

    source§

    fn position_minmax_by_key<K, F>(self, key: F) -> MinMaxResult<usize>
    where Self: Sized, K: PartialOrd, F: FnMut(&Self::Item) -> K,

    Return the postions of the minimum and maximum elements of an -iterator, as determined by the specified function. Read more
    source§

    fn position_minmax_by<F>(self, compare: F) -> MinMaxResult<usize>
    where +iterator, as determined by the specified function. Read more

    source§

    fn position_minmax_by<F>(self, compare: F) -> MinMaxResult<usize>
    where Self: Sized, F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Return the postions of the minimum and maximum elements of an -iterator, as determined by the specified comparison function. Read more
    source§

    fn exactly_one(self) -> Result<Self::Item, ExactlyOneError<Self>>
    where +iterator, as determined by the specified comparison function. Read more

    source§

    fn exactly_one(self) -> Result<Self::Item, ExactlyOneError<Self>>
    where Self: Sized,

    If the iterator yields exactly one element, that element will be returned, otherwise an error will be returned containing an iterator that has the same output as the input -iterator. Read more
    source§

    fn at_most_one(self) -> Result<Option<Self::Item>, ExactlyOneError<Self>>
    where - Self: Sized,

    If the iterator yields no elements, Ok(None) will be returned. If the iterator yields +iterator. Read more
    source§

    fn at_most_one(self) -> Result<Option<Self::Item>, ExactlyOneError<Self>>
    where + Self: Sized,

    If the iterator yields no elements, Ok(None) will be returned. If the iterator yields exactly one element, that element will be returned, otherwise an error will be returned -containing an iterator that has the same output as the input iterator. Read more
    source§

    fn multipeek(self) -> MultiPeek<Self> ⓘ
    where +containing an iterator that has the same output as the input iterator. Read more

    source§

    fn multipeek(self) -> MultiPeek<Self> ⓘ
    where Self: Sized,

    An iterator adaptor that allows the user to peek at multiple .next() -values without advancing the base iterator. Read more
    source§

    fn counts(self) -> HashMap<Self::Item, usize>
    where +values without advancing the base iterator. Read more

    source§

    fn counts(self) -> HashMap<Self::Item, usize>
    where Self: Sized, Self::Item: Eq + Hash,

    Collect the items in this iterator and return a HashMap which contains each item that appears in the iterator and the number -of times it appears. Read more
    source§

    fn counts_by<K, F>(self, f: F) -> HashMap<K, usize>
    where +of times it appears. Read more

    source§

    fn counts_by<K, F>(self, f: F) -> HashMap<K, usize>
    where Self: Sized, K: Eq + Hash, F: FnMut(Self::Item) -> K,

    Collect the items in this iterator and return a HashMap which contains each item that appears in the iterator and the number of times it appears, -determining identity using a keying function. Read more
    source§

    fn multiunzip<FromI>(self) -> FromI
    where - Self: Sized + MultiUnzip<FromI>,

    Converts an iterator of tuples into a tuple of containers. Read more
    source§

    fn try_len(&self) -> Result<usize, (usize, Option<usize>)>

    Returns the length of the iterator if one exists. +determining identity using a keying function. Read more
    source§

    fn multiunzip<FromI>(self) -> FromI
    where + Self: Sized + MultiUnzip<FromI>,

    Converts an iterator of tuples into a tuple of containers. Read more
    source§

    fn try_len(&self) -> Result<usize, (usize, Option<usize>)>

    Returns the length of the iterator if one exists. Otherwise return self.size_hint(). Read more
    source§

    impl<IT, A, FromA, B, FromB> MultiUnzip<(FromA, FromB)> for IT
    where IT: Iterator<Item = (A, B)>, FromA: Default + Extend<A>, FromB: Default + Extend<B>,

    source§

    fn multiunzip(self) -> (FromA, FromB)

    Unzip this iterator into multiple collections.
    source§

    impl<T, U> TryFrom<U> for 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 + 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/itertools/structs/struct.Interleave.html b/itertools/structs/struct.Interleave.html index e3c3f3aff..256b086ec 100644 --- a/itertools/structs/struct.Interleave.html +++ b/itertools/structs/struct.Interleave.html @@ -1,11 +1,11 @@ -Interleave in itertools::structs - Rust
    -

    Struct itertools::structs::Interleave

    source · 
    pub struct Interleave<I, J> { /* private fields */ }
    Expand description

    An iterator adaptor that alternates elements from two iterators until both +Interleave in itertools::structs - Rust

    +

    Struct itertools::structs::Interleave

    source · 
    pub struct Interleave<I, J> { /* private fields */ }
    Expand description

    An iterator adaptor that alternates elements from two iterators until both run out.

    This iterator is fused.

    See .interleave() for more information.

    -

    Trait Implementations§

    source§

    impl<I: Clone, J: Clone> Clone for Interleave<I, J>

    source§

    fn clone(&self) -> Interleave<I, J> ⓘ

    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<I: Debug, J: Debug> Debug for Interleave<I, J>

    source§

    fn fmt(&self, f: &mut Formatter<'_>) -> Result

    Formats the value using the given formatter. Read more
    source§

    impl<I, J> Iterator for Interleave<I, J>
    where +

    Trait Implementations§

    source§

    impl<I: Clone, J: Clone> Clone for Interleave<I, J>

    source§

    fn clone(&self) -> Interleave<I, J> ⓘ

    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<I: Debug, J: Debug> Debug for Interleave<I, J>

    source§

    fn fmt(&self, f: &mut Formatter<'_>) -> Result

    Formats the value using the given formatter. Read more
    source§

    impl<I, J> Iterator for Interleave<I, J>
    where I: Iterator, - J: Iterator<Item = I::Item>,

    §

    type Item = <I as Iterator>::Item

    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 + J: Iterator<Item = I::Item>,

    §

    type Item = <I as Iterator>::Item

    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 @@ -181,7 +181,7 @@ greater than or equal to those of another. 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, J> FusedIterator for Interleave<I, J>
    where +function. Read more
    source§

    impl<I, J> FusedIterator for Interleave<I, J>
    where I: Iterator, J: Iterator<Item = I::Item>,

    Auto Trait Implementations§

    §

    impl<I, J> Freeze for Interleave<I, J>
    where I: Freeze, @@ -211,86 +211,87 @@ otherwise. Right variant of Either<Self, Self> otherwise. Read more

    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> Itertools for T
    where - T: Iterator + ?Sized,

    source§

    fn interleave<J>(self, other: J) -> Interleave<Self, J::IntoIter> ⓘ
    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> Itertools for T
    where + T: Iterator + ?Sized,

    source§

    fn interleave<J>(self, other: J) -> Interleave<Self, J::IntoIter> ⓘ
    where J: IntoIterator<Item = Self::Item>, - Self: Sized,

    Alternate elements from two iterators until both have run out. Read more
    source§

    fn interleave_shortest<J>( + Self: Sized,

    Alternate elements from two iterators until both have run out. Read more
    source§

    fn interleave_shortest<J>( self, other: J ) -> InterleaveShortest<Self, J::IntoIter> ⓘ
    where J: IntoIterator<Item = Self::Item>, Self: Sized,

    Alternate elements from two iterators until at least one of them has run -out. Read more
    source§

    fn intersperse(self, element: Self::Item) -> Intersperse<Self>
    where +out. Read more

    source§

    fn intersperse(self, element: Self::Item) -> Intersperse<Self>
    where Self: Sized, Self::Item: Clone,

    An iterator adaptor to insert a particular value -between each element of the adapted iterator. Read more
    source§

    fn intersperse_with<F>(self, element: F) -> IntersperseWith<Self, F> ⓘ
    where +between each element of the adapted iterator. Read more

    source§

    fn intersperse_with<F>(self, element: F) -> IntersperseWith<Self, F> ⓘ
    where Self: Sized, F: FnMut() -> Self::Item,

    An iterator adaptor to insert a particular value created by a function -between each element of the adapted iterator. Read more
    source§

    fn zip_longest<J>(self, other: J) -> ZipLongest<Self, J::IntoIter> ⓘ
    where +between each element of the adapted iterator. Read more

    source§

    fn get<R>(self, index: R) -> R::Output
    where + Self: Sized, + R: IteratorIndex<Self>,

    Returns an iterator over a subsection of the iterator. Read more
    source§

    fn zip_longest<J>(self, other: J) -> ZipLongest<Self, J::IntoIter> ⓘ
    where J: IntoIterator, Self: Sized,

    Create an iterator which iterates over both this and the specified -iterator simultaneously, yielding pairs of two optional elements. Read more
    source§

    fn zip_eq<J>(self, other: J) -> ZipEq<Self, J::IntoIter> ⓘ
    where +iterator simultaneously, yielding pairs of two optional elements. Read more

    source§

    fn zip_eq<J>(self, other: J) -> ZipEq<Self, J::IntoIter> ⓘ
    where J: IntoIterator, Self: Sized,

    Create an iterator which iterates over both this and the specified -iterator simultaneously, yielding pairs of elements. Read more
    source§

    fn batching<B, F>(self, f: F) -> Batching<Self, F> ⓘ
    where +iterator simultaneously, yielding pairs of elements. Read more

    source§

    fn batching<B, F>(self, f: F) -> Batching<Self, F> ⓘ
    where F: FnMut(&mut Self) -> Option<B>, Self: Sized,

    A “meta iterator adaptor”. Its closure receives a reference to the iterator and may pick off as many elements as it likes, to produce the -next iterator element. Read more
    source§

    fn group_by<K, F>(self, key: F) -> GroupBy<K, Self, F>
    where +next iterator element. Read more

    source§

    fn chunk_by<K, F>(self, key: F) -> ChunkBy<K, Self, F>
    where Self: Sized, F: FnMut(&Self::Item) -> K, K: PartialEq,

    Return an iterable that can group iterator elements. Consecutive elements that map to the same key (“runs”), are assigned -to the same group. Read more
    source§

    fn chunks(self, size: usize) -> IntoChunks<Self>
    where - Self: Sized,

    Return an iterable that can chunk the iterator. Read more
    source§

    fn tuple_windows<T>(self) -> TupleWindows<Self, T> ⓘ
    where +to the same group. Read more

    source§

    fn group_by<K, F>(self, key: F) -> ChunkBy<K, Self, F>
    where + Self: Sized, + F: FnMut(&Self::Item) -> K, + K: PartialEq,

    👎Deprecated since 0.13.0: Use .chunk_by() instead
    See .chunk_by().
    source§

    fn chunks(self, size: usize) -> IntoChunks<Self>
    where + Self: Sized,

    Return an iterable that can chunk the iterator. Read more
    source§

    fn tuple_windows<T>(self) -> TupleWindows<Self, T> ⓘ
    where Self: Sized + Iterator<Item = T::Item>, T: HomogeneousTuple, T::Item: Clone,

    Return an iterator over all contiguous windows producing tuples of -a specific size (up to 12). Read more
    source§

    fn circular_tuple_windows<T>(self) -> CircularTupleWindows<Self, T> ⓘ
    where +a specific size (up to 12). Read more

    source§

    fn circular_tuple_windows<T>(self) -> CircularTupleWindows<Self, T> ⓘ
    where Self: Sized + Clone + Iterator<Item = T::Item> + ExactSizeIterator, T: TupleCollect + Clone, T::Item: Clone,

    Return an iterator over all windows, wrapping back to the first elements when the window would otherwise exceed the length of the -iterator, producing tuples of a specific size (up to 12). Read more
    source§

    fn tuples<T>(self) -> Tuples<Self, T> ⓘ
    where +iterator, producing tuples of a specific size (up to 12). Read more

    source§

    fn tuples<T>(self) -> Tuples<Self, T> ⓘ
    where Self: Sized + Iterator<Item = T::Item>, T: HomogeneousTuple,

    Return an iterator that groups the items in tuples of a specific size -(up to 12). Read more
    source§

    fn tee(self) -> (Tee<Self>, Tee<Self>)
    where +(up to 12). Read more

    source§

    fn tee(self) -> (Tee<Self>, Tee<Self>)
    where Self: Sized, Self::Item: Clone,

    Split into an iterator pair that both yield all elements from -the original iterator. Read more
    source§

    fn step(self, n: usize) -> Step<Self> ⓘ
    where - Self: Sized,

    👎Deprecated since 0.8.0: Use std .step_by() instead
    Return an iterator adaptor that steps n elements in the base iterator -for each iteration. Read more
    source§

    fn map_into<R>(self) -> MapInto<Self, R>
    where +the original iterator. Read more

    source§

    fn map_into<R>(self) -> MapInto<Self, R>
    where Self: Sized, - Self::Item: Into<R>,

    Convert each item of the iterator using the Into trait. Read more
    source§

    fn map_results<F, T, U, E>(self, f: F) -> MapOk<Self, F>
    where - Self: Iterator<Item = Result<T, E>> + Sized, - F: FnMut(T) -> U,

    👎Deprecated since 0.10.0: Use .map_ok() instead
    See .map_ok().
    source§

    fn map_ok<F, T, U, E>(self, f: F) -> MapOk<Self, F>
    where + Self::Item: Into<R>,

    Convert each item of the iterator using the Into trait. Read more
    source§

    fn map_ok<F, T, U, E>(self, f: F) -> MapOk<Self, F>
    where Self: Iterator<Item = Result<T, E>> + Sized, F: FnMut(T) -> U,

    Return an iterator adaptor that applies the provided closure to every Result::Ok value. Result::Err values are -unchanged. Read more
    source§

    fn filter_ok<F, T, E>(self, f: F) -> FilterOk<Self, F> ⓘ
    where +unchanged. Read more

    source§

    fn filter_ok<F, T, E>(self, f: F) -> FilterOk<Self, F> ⓘ
    where Self: Iterator<Item = Result<T, E>> + Sized, F: FnMut(&T) -> bool,

    Return an iterator adaptor that filters every Result::Ok value with the provided closure. Result::Err values are -unchanged. Read more
    source§

    fn filter_map_ok<F, T, U, E>(self, f: F) -> FilterMapOk<Self, F> ⓘ
    where +unchanged. Read more

    source§

    fn filter_map_ok<F, T, U, E>(self, f: F) -> FilterMapOk<Self, F> ⓘ
    where Self: Iterator<Item = Result<T, E>> + Sized, F: FnMut(T) -> Option<U>,

    Return an iterator adaptor that filters and transforms every Result::Ok value with the provided closure. Result::Err -values are unchanged. Read more
    source§

    fn flatten_ok<T, E>(self) -> FlattenOk<Self, T, E> ⓘ
    where +values are unchanged. Read more

    source§

    fn flatten_ok<T, E>(self) -> FlattenOk<Self, T, E> ⓘ
    where Self: Iterator<Item = Result<T, E>> + Sized, T: IntoIterator,

    Return an iterator adaptor that flattens every Result::Ok value into -a series of Result::Ok values. Result::Err values are unchanged. Read more
    source§

    fn process_results<F, T, E, R>(self, processor: F) -> Result<R, E>
    where +a series of Result::Ok values. Result::Err values are unchanged. Read more

    source§

    fn process_results<F, T, E, R>(self, processor: F) -> Result<R, E>
    where Self: Iterator<Item = Result<T, E>> + Sized, F: FnOnce(ProcessResults<'_, Self, E>) -> R,

    “Lift” a function of the values of the current iterator so as to process -an iterator of Result values instead. Read more
    source§

    fn merge<J>(self, other: J) -> Merge<Self, J::IntoIter>
    where +an iterator of Result values instead. Read more

    source§

    fn merge<J>(self, other: J) -> Merge<Self, J::IntoIter>
    where Self: Sized, Self::Item: PartialOrd, J: IntoIterator<Item = Self::Item>,

    Return an iterator adaptor that merges the two base iterators in ascending order. If both base iterators are sorted (ascending), the -result is sorted. Read more
    source§

    fn merge_by<J, F>(self, other: J, is_first: F) -> MergeBy<Self, J::IntoIter, F> ⓘ
    where +result is sorted. Read more

    source§

    fn merge_by<J, F>(self, other: J, is_first: F) -> MergeBy<Self, J::IntoIter, F> ⓘ
    where Self: Sized, J: IntoIterator<Item = Self::Item>, F: FnMut(&Self::Item, &Self::Item) -> bool,

    Return an iterator adaptor that merges the two base iterators in order. -This is much like .merge() but allows for a custom ordering. Read more
    source§

    fn merge_join_by<J, F, T>( +This is much like .merge() but allows for a custom ordering. Read more

    source§

    fn merge_join_by<J, F, T>( self, other: J, cmp_fn: F @@ -298,284 +299,295 @@ This is much like IntoIterator, F: FnMut(&Self::Item, &J::Item) -> T, Self: Sized,

    Create an iterator that merges items from both this and the specified -iterator in ascending order. Read more
    source§

    fn kmerge(self) -> KMerge<<Self::Item as IntoIterator>::IntoIter>
    where +iterator in ascending order. Read more

    source§

    fn kmerge(self) -> KMerge<<Self::Item as IntoIterator>::IntoIter>
    where Self: Sized, Self::Item: IntoIterator, <Self::Item as IntoIterator>::Item: PartialOrd,

    Return an iterator adaptor that flattens an iterator of iterators by -merging them in ascending order. Read more
    source§

    fn kmerge_by<F>( +merging them in ascending order. Read more

    source§

    fn kmerge_by<F>( self, first: F ) -> KMergeBy<<Self::Item as IntoIterator>::IntoIter, F> ⓘ
    where Self: Sized, Self::Item: IntoIterator, F: FnMut(&<Self::Item as IntoIterator>::Item, &<Self::Item as IntoIterator>::Item) -> bool,

    Return an iterator adaptor that flattens an iterator of iterators by -merging them according to the given closure. Read more
    source§

    fn cartesian_product<J>(self, other: J) -> Product<Self, J::IntoIter> ⓘ
    where +merging them according to the given closure. Read more

    source§

    fn cartesian_product<J>(self, other: J) -> Product<Self, J::IntoIter> ⓘ
    where Self: Sized, Self::Item: Clone, J: IntoIterator, J::IntoIter: Clone,

    Return an iterator adaptor that iterates over the cartesian product of -the element sets of two iterators self and J. Read more
    source§

    fn multi_cartesian_product( +the element sets of two iterators self and J. Read more

    source§

    fn multi_cartesian_product( self ) -> MultiProduct<<Self::Item as IntoIterator>::IntoIter> ⓘ
    where Self: Sized, Self::Item: IntoIterator, <Self::Item as IntoIterator>::IntoIter: Clone, <Self::Item as IntoIterator>::Item: Clone,

    Return an iterator adaptor that iterates over the cartesian product of -all subiterators returned by meta-iterator self. Read more
    source§

    fn coalesce<F>(self, f: F) -> Coalesce<Self, F>
    where +all subiterators returned by meta-iterator self. Read more

    source§

    fn coalesce<F>(self, f: F) -> Coalesce<Self, F>
    where Self: Sized, F: FnMut(Self::Item, Self::Item) -> Result<Self::Item, (Self::Item, Self::Item)>,

    Return an iterator adaptor that uses the passed-in closure to -optionally merge together consecutive elements. Read more
    source§

    fn dedup(self) -> Dedup<Self>
    where +optionally merge together consecutive elements. Read more

    source§

    fn dedup(self) -> Dedup<Self>
    where Self: Sized, Self::Item: PartialEq,

    Remove duplicates from sections of consecutive identical elements. -If the iterator is sorted, all elements will be unique. Read more
    source§

    fn dedup_by<Cmp>(self, cmp: Cmp) -> DedupBy<Self, Cmp>
    where +If the iterator is sorted, all elements will be unique. Read more

    source§

    fn dedup_by<Cmp>(self, cmp: Cmp) -> DedupBy<Self, Cmp>
    where Self: Sized, Cmp: FnMut(&Self::Item, &Self::Item) -> bool,

    Remove duplicates from sections of consecutive identical elements, determining equality using a comparison function. -If the iterator is sorted, all elements will be unique. Read more
    source§

    fn dedup_with_count(self) -> DedupWithCount<Self>
    where +If the iterator is sorted, all elements will be unique. Read more

    source§

    fn dedup_with_count(self) -> DedupWithCount<Self>
    where Self: Sized,

    Remove duplicates from sections of consecutive identical elements, while keeping a count of how many repeated elements were present. -If the iterator is sorted, all elements will be unique. Read more
    source§

    fn dedup_by_with_count<Cmp>(self, cmp: Cmp) -> DedupByWithCount<Self, Cmp>
    where +If the iterator is sorted, all elements will be unique. Read more

    source§

    fn dedup_by_with_count<Cmp>(self, cmp: Cmp) -> DedupByWithCount<Self, Cmp>
    where Self: Sized, Cmp: FnMut(&Self::Item, &Self::Item) -> bool,

    Remove duplicates from sections of consecutive identical elements, while keeping a count of how many repeated elements were present. This will determine equality using a comparison function. -If the iterator is sorted, all elements will be unique. Read more
    source§

    fn duplicates(self) -> Duplicates<Self>
    where +If the iterator is sorted, all elements will be unique. Read more

    source§

    fn duplicates(self) -> Duplicates<Self>
    where Self: Sized, Self::Item: Eq + Hash,

    Return an iterator adaptor that produces elements that appear more than once during the -iteration. Duplicates are detected using hash and equality. Read more
    source§

    fn duplicates_by<V, F>(self, f: F) -> DuplicatesBy<Self, V, F>
    where +iteration. Duplicates are detected using hash and equality. Read more

    source§

    fn duplicates_by<V, F>(self, f: F) -> DuplicatesBy<Self, V, F>
    where Self: Sized, V: Eq + Hash, F: FnMut(&Self::Item) -> V,

    Return an iterator adaptor that produces elements that appear more than once during the -iteration. Duplicates are detected using hash and equality. Read more
    source§

    fn unique(self) -> Unique<Self> ⓘ
    where +iteration. Duplicates are detected using hash and equality. Read more

    source§

    fn unique(self) -> Unique<Self> ⓘ
    where Self: Sized, Self::Item: Clone + Eq + Hash,

    Return an iterator adaptor that filters out elements that have already been produced once during the iteration. Duplicates -are detected using hash and equality. Read more
    source§

    fn unique_by<V, F>(self, f: F) -> UniqueBy<Self, V, F> ⓘ
    where +are detected using hash and equality. Read more

    source§

    fn unique_by<V, F>(self, f: F) -> UniqueBy<Self, V, F> ⓘ
    where Self: Sized, V: Eq + Hash, F: FnMut(&Self::Item) -> V,

    Return an iterator adaptor that filters out elements that have -already been produced once during the iteration. Read more
    source§

    fn peeking_take_while<F>(&mut self, accept: F) -> PeekingTakeWhile<'_, Self, F> ⓘ
    where +already been produced once during the iteration. Read more

    source§

    fn peeking_take_while<F>(&mut self, accept: F) -> PeekingTakeWhile<'_, Self, F> ⓘ
    where Self: Sized + PeekingNext, F: FnMut(&Self::Item) -> bool,

    Return an iterator adaptor that borrows from this iterator and -takes items while the closure accept returns true. Read more
    source§

    fn take_while_ref<F>(&mut self, accept: F) -> TakeWhileRef<'_, Self, F> ⓘ
    where +takes items while the closure accept returns true. Read more

    source§

    fn take_while_ref<F>(&mut self, accept: F) -> TakeWhileRef<'_, Self, F> ⓘ
    where Self: Clone, F: FnMut(&Self::Item) -> bool,

    Return an iterator adaptor that borrows from a Clone-able iterator -to only pick off elements while the predicate accept returns true. Read more
    source§

    fn take_while_inclusive<F>(self, accept: F) -> TakeWhileInclusive<Self, F> ⓘ
    where +to only pick off elements while the predicate accept returns true. Read more

    source§

    fn take_while_inclusive<F>(self, accept: F) -> TakeWhileInclusive<Self, F> ⓘ
    where Self: Sized, F: FnMut(&Self::Item) -> bool,

    Returns an iterator adaptor that consumes elements while the given predicate is true, including the element for which the predicate -first returned false. Read more
    source§

    fn while_some<A>(self) -> WhileSome<Self> ⓘ
    where +first returned false. Read more

    source§

    fn while_some<A>(self) -> WhileSome<Self> ⓘ
    where Self: Sized + Iterator<Item = Option<A>>,

    Return an iterator adaptor that filters Option<A> iterator elements -and produces A. Stops on the first None encountered. Read more
    source§

    fn tuple_combinations<T>(self) -> TupleCombinations<Self, T> ⓘ
    where +and produces A. Stops on the first None encountered. Read more

    source§

    fn tuple_combinations<T>(self) -> TupleCombinations<Self, T> ⓘ
    where Self: Sized + Clone, Self::Item: Clone, T: HasCombination<Self>,

    Return an iterator adaptor that iterates over the combinations of the -elements from an iterator. Read more
    source§

    fn combinations(self, k: usize) -> Combinations<Self> ⓘ
    where +elements from an iterator. Read more

    source§

    fn combinations(self, k: usize) -> Combinations<Self> ⓘ
    where Self: Sized, Self::Item: Clone,

    Return an iterator adaptor that iterates over the k-length combinations of -the elements from an iterator. Read more
    source§

    fn combinations_with_replacement( +the elements from an iterator. Read more

    source§

    fn combinations_with_replacement( self, k: usize ) -> CombinationsWithReplacement<Self> ⓘ
    where Self: Sized, Self::Item: Clone,

    Return an iterator that iterates over the k-length combinations of -the elements from an iterator, with replacement. Read more
    source§

    fn permutations(self, k: usize) -> Permutations<Self> ⓘ
    where +the elements from an iterator, with replacement. Read more

    source§

    fn permutations(self, k: usize) -> Permutations<Self> ⓘ
    where Self: Sized, Self::Item: Clone,

    Return an iterator adaptor that iterates over all k-permutations of the -elements from an iterator. Read more
    source§

    fn powerset(self) -> Powerset<Self> ⓘ
    where +elements from an iterator. Read more

    source§

    fn powerset(self) -> Powerset<Self> ⓘ
    where Self: Sized, Self::Item: Clone,

    Return an iterator that iterates through the powerset of the elements from an -iterator. Read more
    source§

    fn pad_using<F>(self, min: usize, f: F) -> PadUsing<Self, F> ⓘ
    where +iterator. Read more

    source§

    fn pad_using<F>(self, min: usize, f: F) -> PadUsing<Self, F> ⓘ
    where Self: Sized, F: FnMut(usize) -> Self::Item,

    Return an iterator adaptor that pads the sequence to a minimum length of -min by filling missing elements using a closure f. Read more
    source§

    fn with_position(self) -> WithPosition<Self> ⓘ
    where +min by filling missing elements using a closure f. Read more

    source§

    fn with_position(self) -> WithPosition<Self> ⓘ
    where Self: Sized,

    Return an iterator adaptor that combines each element with a Position to -ease special-case handling of the first or last elements. Read more
    source§

    fn positions<P>(self, predicate: P) -> Positions<Self, P> ⓘ
    where +ease special-case handling of the first or last elements. Read more

    source§

    fn positions<P>(self, predicate: P) -> Positions<Self, P> ⓘ
    where Self: Sized, P: FnMut(Self::Item) -> bool,

    Return an iterator adaptor that yields the indices of all elements -satisfying a predicate, counted from the start of the iterator. Read more
    source§

    fn update<F>(self, updater: F) -> Update<Self, F> ⓘ
    where +satisfying a predicate, counted from the start of the iterator. Read more

    source§

    fn update<F>(self, updater: F) -> Update<Self, F> ⓘ
    where Self: Sized, F: FnMut(&mut Self::Item),

    Return an iterator adaptor that applies a mutating function -to each element before yielding it. Read more
    source§

    fn next_tuple<T>(&mut self) -> Option<T>
    where +to each element before yielding it. Read more

    source§

    fn next_tuple<T>(&mut self) -> Option<T>
    where Self: Sized + Iterator<Item = T::Item>, T: HomogeneousTuple,

    Advances the iterator and returns the next items grouped in a tuple of -a specific size (up to 12). Read more
    source§

    fn collect_tuple<T>(self) -> Option<T>
    where +a specific size (up to 12). Read more

    source§

    fn collect_tuple<T>(self) -> Option<T>
    where Self: Sized + Iterator<Item = T::Item>, T: HomogeneousTuple,

    Collects all items from the iterator into a tuple of a specific size -(up to 12). Read more
    source§

    fn find_position<P>(&mut self, pred: P) -> Option<(usize, Self::Item)>
    where - P: FnMut(&Self::Item) -> bool,

    Find the position and value of the first element satisfying a predicate. Read more
    source§

    fn find_or_last<P>(self, predicate: P) -> Option<Self::Item>
    where +(up to 12). Read more

    source§

    fn find_position<P>(&mut self, pred: P) -> Option<(usize, Self::Item)>
    where + P: FnMut(&Self::Item) -> bool,

    Find the position and value of the first element satisfying a predicate. Read more
    source§

    fn find_or_last<P>(self, predicate: P) -> Option<Self::Item>
    where Self: Sized, - P: FnMut(&Self::Item) -> bool,

    Find the value of the first element satisfying a predicate or return the last element, if any. Read more
    source§

    fn find_or_first<P>(self, predicate: P) -> Option<Self::Item>
    where + P: FnMut(&Self::Item) -> bool,

    Find the value of the first element satisfying a predicate or return the last element, if any. Read more
    source§

    fn find_or_first<P>(self, predicate: P) -> Option<Self::Item>
    where Self: Sized, - P: FnMut(&Self::Item) -> bool,

    Find the value of the first element satisfying a predicate or return the first element, if any. Read more
    source§

    fn contains<Q>(&mut self, query: &Q) -> bool
    where + P: FnMut(&Self::Item) -> bool,

    Find the value of the first element satisfying a predicate or return the first element, if any. Read more
    source§

    fn contains<Q>(&mut self, query: &Q) -> bool
    where Self: Sized, Self::Item: Borrow<Q>, - Q: PartialEq,

    Returns true if the given item is present in this iterator. Read more
    source§

    fn all_equal(&mut self) -> bool
    where + Q: PartialEq,

    Returns true if the given item is present in this iterator. Read more
    source§

    fn all_equal(&mut self) -> bool
    where Self: Sized, - Self::Item: PartialEq,

    Check whether all elements compare equal. Read more
    source§

    fn all_equal_value( + Self::Item: PartialEq,

    Check whether all elements compare equal. Read more
    source§

    fn all_equal_value( &mut self ) -> Result<Self::Item, Option<(Self::Item, Self::Item)>>
    where Self: Sized, Self::Item: PartialEq,

    If there are elements and they are all equal, return a single copy of that element. If there are no elements, return an Error containing None. If there are elements and they are not all equal, return a tuple containing the first -two non-equal elements found. Read more
    source§

    fn all_unique(&mut self) -> bool
    where +two non-equal elements found. Read more

    source§

    fn all_unique(&mut self) -> bool
    where Self: Sized, - Self::Item: Eq + Hash,

    Check whether all elements are unique (non equal). Read more
    source§

    fn dropping(self, n: usize) -> Self
    where + Self::Item: Eq + Hash,

    Check whether all elements are unique (non equal). Read more
    source§

    fn dropping(self, n: usize) -> Self
    where Self: Sized,

    Consume the first n elements from the iterator eagerly, -and return the same iterator again. Read more
    source§

    fn dropping_back(self, n: usize) -> Self
    where +and return the same iterator again. Read more

    source§

    fn dropping_back(self, n: usize) -> Self
    where Self: Sized + DoubleEndedIterator,

    Consume the last n elements from the iterator eagerly, -and return the same iterator again. Read more
    source§

    fn foreach<F>(self, f: F)
    where - F: FnMut(Self::Item), - Self: Sized,

    👎Deprecated since 0.8.0: Use .for_each() instead
    Run the closure f eagerly on each element of the iterator. Read more
    source§

    fn concat(self) -> Self::Item
    where +and return the same iterator again. Read more

    source§

    fn concat(self) -> Self::Item
    where Self: Sized, - Self::Item: Extend<<<Self as Iterator>::Item as IntoIterator>::Item> + IntoIterator + Default,

    Combine all an iterator’s elements into one element by using Extend. Read more
    source§

    fn collect_vec(self) -> Vec<Self::Item>
    where + Self::Item: Extend<<<Self as Iterator>::Item as IntoIterator>::Item> + IntoIterator + Default,

    Combine all an iterator’s elements into one element by using Extend. Read more
    source§

    fn collect_vec(self) -> Vec<Self::Item>
    where Self: Sized,

    .collect_vec() is simply a type specialization of Iterator::collect, -for convenience.
    source§

    fn try_collect<T, U, E>(self) -> Result<U, E>
    where +for convenience.

    source§

    fn try_collect<T, U, E>(self) -> Result<U, E>
    where Self: Sized + Iterator<Item = Result<T, E>>, Result<U, E>: FromIterator<Result<T, E>>,

    .try_collect() is more convenient way of writing -.collect::<Result<_, _>>() Read more
    source§

    fn set_from<'a, A: 'a, J>(&mut self, from: J) -> usize
    where +.collect::<Result<_, _>>() Read more

    source§

    fn set_from<'a, A: 'a, J>(&mut self, from: J) -> usize
    where Self: Iterator<Item = &'a mut A>, J: IntoIterator<Item = A>,

    Assign to each reference in self from the from iterator, -stopping at the shortest of the two iterators. Read more
    source§

    fn join(&mut self, sep: &str) -> String
    where - Self::Item: Display,

    Combine all iterator elements into one String, separated by sep. Read more
    source§

    fn format(self, sep: &str) -> Format<'_, Self>
    where - Self: Sized,

    Format all iterator elements, separated by sep. Read more
    source§

    fn format_with<F>(self, sep: &str, format: F) -> FormatWith<'_, Self, F>
    where +stopping at the shortest of the two iterators. Read more

    source§

    fn join(&mut self, sep: &str) -> String
    where + Self::Item: Display,

    Combine all iterator elements into one String, separated by sep. Read more
    source§

    fn format(self, sep: &str) -> Format<'_, Self>
    where + Self: Sized,

    Format all iterator elements, separated by sep. Read more
    source§

    fn format_with<F>(self, sep: &str, format: F) -> FormatWith<'_, Self, F>
    where Self: Sized, - F: FnMut(Self::Item, &mut dyn FnMut(&dyn Display) -> Result) -> Result,

    Format all iterator elements, separated by sep. Read more
    source§

    fn fold_results<A, E, B, F>(&mut self, start: B, f: F) -> Result<B, E>
    where + F: FnMut(Self::Item, &mut dyn FnMut(&dyn Display) -> Result) -> Result,

    Format all iterator elements, separated by sep. Read more
    source§

    fn fold_ok<A, E, B, F>(&mut self, start: B, f: F) -> Result<B, E>
    where Self: Iterator<Item = Result<A, E>>, - F: FnMut(B, A) -> B,

    👎Deprecated since 0.10.0: Use .fold_ok() instead
    See .fold_ok().
    source§

    fn fold_ok<A, E, B, F>(&mut self, start: B, f: F) -> Result<B, E>
    where - Self: Iterator<Item = Result<A, E>>, - F: FnMut(B, A) -> B,

    Fold Result values from an iterator. Read more
    source§

    fn fold_options<A, B, F>(&mut self, start: B, f: F) -> Option<B>
    where + F: FnMut(B, A) -> B,

    Fold Result values from an iterator. Read more
    source§

    fn fold_options<A, B, F>(&mut self, start: B, f: F) -> Option<B>
    where Self: Iterator<Item = Option<A>>, - F: FnMut(B, A) -> B,

    Fold Option values from an iterator. Read more
    source§

    fn fold1<F>(self, f: F) -> Option<Self::Item>
    where + F: FnMut(B, A) -> B,

    Fold Option values from an iterator. Read more
    source§

    fn fold1<F>(self, f: F) -> Option<Self::Item>
    where F: FnMut(Self::Item, Self::Item) -> Self::Item, - Self: Sized,

    👎Deprecated since 0.10.2: Use Iterator::reduce instead
    Accumulator of the elements in the iterator. Read more
    source§

    fn tree_fold1<F>(self, f: F) -> Option<Self::Item>
    where + Self: Sized,

    👎Deprecated since 0.10.2: Use Iterator::reduce instead
    Accumulator of the elements in the iterator. Read more
    source§

    fn tree_reduce<F>(self, f: F) -> Option<Self::Item>
    where F: FnMut(Self::Item, Self::Item) -> Self::Item, - Self: Sized,

    Accumulate the elements in the iterator in a tree-like manner. Read more
    source§

    fn fold_while<B, F>(&mut self, init: B, f: F) -> FoldWhile<B>
    where + Self: Sized,

    Accumulate the elements in the iterator in a tree-like manner. Read more
    source§

    fn tree_fold1<F>(self, f: F) -> Option<Self::Item>
    where + F: FnMut(Self::Item, Self::Item) -> Self::Item, + Self: Sized,

    👎Deprecated since 0.13.0: Use .tree_reduce() instead
    See .tree_reduce().
    source§

    fn fold_while<B, F>(&mut self, init: B, f: F) -> FoldWhile<B>
    where Self: Sized, - F: FnMut(B, Self::Item) -> FoldWhile<B>,

    An iterator method that applies a function, producing a single, final value. Read more
    source§

    fn sum1<S>(self) -> Option<S>
    where + F: FnMut(B, Self::Item) -> FoldWhile<B>,

    An iterator method that applies a function, producing a single, final value. Read more
    source§

    fn sum1<S>(self) -> Option<S>
    where Self: Sized, - S: Sum<Self::Item>,

    Iterate over the entire iterator and add all the elements. Read more
    source§

    fn product1<P>(self) -> Option<P>
    where + S: Sum<Self::Item>,

    Iterate over the entire iterator and add all the elements. Read more
    source§

    fn product1<P>(self) -> Option<P>
    where Self: Sized, - P: Product<Self::Item>,

    Iterate over the entire iterator and multiply all the elements. Read more
    source§

    fn sorted_unstable(self) -> IntoIter<Self::Item> ⓘ
    where + P: Product<Self::Item>,

    Iterate over the entire iterator and multiply all the elements. Read more
    source§

    fn sorted_unstable(self) -> IntoIter<Self::Item> ⓘ
    where Self: Sized, - Self::Item: Ord,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_unstable_by<F>(self, cmp: F) -> IntoIter<Self::Item> ⓘ
    where + Self::Item: Ord,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_unstable_by<F>(self, cmp: F) -> IntoIter<Self::Item> ⓘ
    where Self: Sized, - F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_unstable_by_key<K, F>(self, f: F) -> IntoIter<Self::Item> ⓘ
    where + F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_unstable_by_key<K, F>(self, f: F) -> IntoIter<Self::Item> ⓘ
    where Self: Sized, K: Ord, - F: FnMut(&Self::Item) -> K,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted(self) -> IntoIter<Self::Item> ⓘ
    where + F: FnMut(&Self::Item) -> K,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted(self) -> IntoIter<Self::Item> ⓘ
    where Self: Sized, - Self::Item: Ord,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_by<F>(self, cmp: F) -> IntoIter<Self::Item> ⓘ
    where + Self::Item: Ord,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_by<F>(self, cmp: F) -> IntoIter<Self::Item> ⓘ
    where Self: Sized, - F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_by_key<K, F>(self, f: F) -> IntoIter<Self::Item> ⓘ
    where + F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_by_key<K, F>(self, f: F) -> IntoIter<Self::Item> ⓘ
    where Self: Sized, K: Ord, - F: FnMut(&Self::Item) -> K,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_by_cached_key<K, F>(self, f: F) -> IntoIter<Self::Item> ⓘ
    where + F: FnMut(&Self::Item) -> K,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_by_cached_key<K, F>(self, f: F) -> IntoIter<Self::Item> ⓘ
    where Self: Sized, K: Ord, F: FnMut(&Self::Item) -> K,

    Sort all iterator elements into a new iterator in ascending order. The key function is -called exactly once per key. Read more
    source§

    fn k_smallest(self, k: usize) -> IntoIter<Self::Item> ⓘ
    where +called exactly once per key. Read more

    source§

    fn k_smallest(self, k: usize) -> IntoIter<Self::Item> ⓘ
    where Self: Sized, - Self::Item: Ord,

    Sort the k smallest elements into a new iterator, in ascending order. Read more
    source§

    fn partition_map<A, B, F, L, R>(self, predicate: F) -> (A, B)
    where + Self::Item: Ord,

    Sort the k smallest elements into a new iterator, in ascending order. Read more
    source§

    fn k_smallest_by<F>(self, k: usize, cmp: F) -> IntoIter<Self::Item> ⓘ
    where + Self: Sized, + F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Sort the k smallest elements into a new iterator using the provided comparison. Read more
    source§

    fn k_smallest_by_key<F, K>(self, k: usize, key: F) -> IntoIter<Self::Item> ⓘ
    where + Self: Sized, + F: FnMut(&Self::Item) -> K, + K: Ord,

    Return the elements producing the k smallest outputs of the provided function. Read more
    source§

    fn k_largest(self, k: usize) -> IntoIter<Self::Item> ⓘ
    where + Self: Sized, + Self::Item: Ord,

    Sort the k largest elements into a new iterator, in descending order. Read more
    source§

    fn k_largest_by<F>(self, k: usize, cmp: F) -> IntoIter<Self::Item> ⓘ
    where + Self: Sized, + F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Sort the k largest elements into a new iterator using the provided comparison. Read more
    source§

    fn k_largest_by_key<F, K>(self, k: usize, key: F) -> IntoIter<Self::Item> ⓘ
    where + Self: Sized, + F: FnMut(&Self::Item) -> K, + K: Ord,

    Return the elements producing the k largest outputs of the provided function. Read more
    source§

    fn tail(self, n: usize) -> IntoIter<Self::Item> ⓘ
    where + Self: Sized,

    Consumes the iterator and return an iterator of the last n elements. Read more
    source§

    fn partition_map<A, B, F, L, R>(self, predicate: F) -> (A, B)
    where Self: Sized, F: FnMut(Self::Item) -> Either<L, R>, A: Default + Extend<L>, B: Default + Extend<R>,

    Collect all iterator elements into one of two partitions. Unlike Iterator::partition, each partition may -have a distinct type. Read more
    source§

    fn partition_result<A, B, T, E>(self) -> (A, B)
    where +have a distinct type. Read more

    source§

    fn partition_result<A, B, T, E>(self) -> (A, B)
    where Self: Iterator<Item = Result<T, E>> + Sized, A: Default + Extend<T>, B: Default + Extend<E>,

    Partition a sequence of Results into one list of all the Ok elements -and another list of all the Err elements. Read more
    source§

    fn into_group_map<K, V>(self) -> HashMap<K, Vec<V>>
    where +and another list of all the Err elements. Read more

    source§

    fn into_group_map<K, V>(self) -> HashMap<K, Vec<V>>
    where Self: Iterator<Item = (K, V)> + Sized, K: Hash + Eq,

    Return a HashMap of keys mapped to Vecs of values. Keys and values -are taken from (Key, Value) tuple pairs yielded by the input iterator. Read more
    source§

    fn into_group_map_by<K, V, F>(self, f: F) -> HashMap<K, Vec<V>>
    where +are taken from (Key, Value) tuple pairs yielded by the input iterator. Read more

    source§

    fn into_group_map_by<K, V, F>(self, f: F) -> HashMap<K, Vec<V>>
    where Self: Iterator<Item = V> + Sized, K: Hash + Eq, - F: Fn(&V) -> K,

    Return an Iterator on a HashMap. Keys mapped to Vecs of values. The key is specified -in the closure. Read more
    source§

    fn into_grouping_map<K, V>(self) -> GroupingMap<Self>
    where + F: FnMut(&V) -> K,

    Return an Iterator on a HashMap. Keys mapped to Vecs of values. The key is specified +in the closure. Read more
    source§

    fn into_grouping_map<K, V>(self) -> GroupingMap<Self>
    where Self: Iterator<Item = (K, V)> + Sized, K: Hash + Eq,

    Constructs a GroupingMap to be used later with one of the efficient -group-and-fold operations it allows to perform. Read more
    source§

    fn into_grouping_map_by<K, V, F>(self, key_mapper: F) -> GroupingMapBy<Self, F>
    where +group-and-fold operations it allows to perform. Read more

    source§

    fn into_grouping_map_by<K, V, F>(self, key_mapper: F) -> GroupingMapBy<Self, F>
    where Self: Iterator<Item = V> + Sized, K: Hash + Eq, F: FnMut(&V) -> K,

    Constructs a GroupingMap to be used later with one of the efficient -group-and-fold operations it allows to perform. Read more
    source§

    fn min_set(self) -> Vec<Self::Item>
    where +group-and-fold operations it allows to perform. Read more

    source§

    fn min_set(self) -> Vec<Self::Item>
    where Self: Sized, - Self::Item: Ord,

    Return all minimum elements of an iterator. Read more
    source§

    fn min_set_by<F>(self, compare: F) -> Vec<Self::Item>
    where + Self::Item: Ord,

    Return all minimum elements of an iterator. Read more
    source§

    fn min_set_by<F>(self, compare: F) -> Vec<Self::Item>
    where Self: Sized, F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Return all minimum elements of an iterator, as determined by -the specified function. Read more
    source§

    fn min_set_by_key<K, F>(self, key: F) -> Vec<Self::Item>
    where +the specified function. Read more

    source§

    fn min_set_by_key<K, F>(self, key: F) -> Vec<Self::Item>
    where Self: Sized, K: Ord, F: FnMut(&Self::Item) -> K,

    Return all minimum elements of an iterator, as determined by -the specified function. Read more
    source§

    fn max_set(self) -> Vec<Self::Item>
    where +the specified function. Read more

    source§

    fn max_set(self) -> Vec<Self::Item>
    where Self: Sized, - Self::Item: Ord,

    Return all maximum elements of an iterator. Read more
    source§

    fn max_set_by<F>(self, compare: F) -> Vec<Self::Item>
    where + Self::Item: Ord,

    Return all maximum elements of an iterator. Read more
    source§

    fn max_set_by<F>(self, compare: F) -> Vec<Self::Item>
    where Self: Sized, F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Return all maximum elements of an iterator, as determined by -the specified function. Read more
    source§

    fn max_set_by_key<K, F>(self, key: F) -> Vec<Self::Item>
    where +the specified function. Read more

    source§

    fn max_set_by_key<K, F>(self, key: F) -> Vec<Self::Item>
    where Self: Sized, K: Ord, F: FnMut(&Self::Item) -> K,

    Return all maximum elements of an iterator, as determined by -the specified function. Read more
    source§

    fn minmax(self) -> MinMaxResult<Self::Item>
    where +the specified function. Read more

    source§

    fn minmax(self) -> MinMaxResult<Self::Item>
    where Self: Sized, - Self::Item: PartialOrd,

    Return the minimum and maximum elements in the iterator. Read more
    source§

    fn minmax_by_key<K, F>(self, key: F) -> MinMaxResult<Self::Item>
    where + Self::Item: PartialOrd,

    Return the minimum and maximum elements in the iterator. Read more
    source§

    fn minmax_by_key<K, F>(self, key: F) -> MinMaxResult<Self::Item>
    where Self: Sized, K: PartialOrd, F: FnMut(&Self::Item) -> K,

    Return the minimum and maximum element of an iterator, as determined by -the specified function. Read more
    source§

    fn minmax_by<F>(self, compare: F) -> MinMaxResult<Self::Item>
    where +the specified function. Read more

    source§

    fn minmax_by<F>(self, compare: F) -> MinMaxResult<Self::Item>
    where Self: Sized, F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Return the minimum and maximum element of an iterator, as determined by -the specified comparison function. Read more
    source§

    fn position_max(self) -> Option<usize>
    where +the specified comparison function. Read more

    source§

    fn position_max(self) -> Option<usize>
    where Self: Sized, - Self::Item: Ord,

    Return the position of the maximum element in the iterator. Read more
    source§

    fn position_max_by_key<K, F>(self, key: F) -> Option<usize>
    where + Self::Item: Ord,

    Return the position of the maximum element in the iterator. Read more
    source§

    fn position_max_by_key<K, F>(self, key: F) -> Option<usize>
    where Self: Sized, K: Ord, F: FnMut(&Self::Item) -> K,

    Return the position of the maximum element in the iterator, as -determined by the specified function. Read more
    source§

    fn position_max_by<F>(self, compare: F) -> Option<usize>
    where +determined by the specified function. Read more

    source§

    fn position_max_by<F>(self, compare: F) -> Option<usize>
    where Self: Sized, F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Return the position of the maximum element in the iterator, as -determined by the specified comparison function. Read more
    source§

    fn position_min(self) -> Option<usize>
    where +determined by the specified comparison function. Read more

    source§

    fn position_min(self) -> Option<usize>
    where Self: Sized, - Self::Item: Ord,

    Return the position of the minimum element in the iterator. Read more
    source§

    fn position_min_by_key<K, F>(self, key: F) -> Option<usize>
    where + Self::Item: Ord,

    Return the position of the minimum element in the iterator. Read more
    source§

    fn position_min_by_key<K, F>(self, key: F) -> Option<usize>
    where Self: Sized, K: Ord, F: FnMut(&Self::Item) -> K,

    Return the position of the minimum element in the iterator, as -determined by the specified function. Read more
    source§

    fn position_min_by<F>(self, compare: F) -> Option<usize>
    where +determined by the specified function. Read more

    source§

    fn position_min_by<F>(self, compare: F) -> Option<usize>
    where Self: Sized, F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Return the position of the minimum element in the iterator, as -determined by the specified comparison function. Read more
    source§

    fn position_minmax(self) -> MinMaxResult<usize>
    where +determined by the specified comparison function. Read more

    source§

    fn position_minmax(self) -> MinMaxResult<usize>
    where Self: Sized, Self::Item: PartialOrd,

    Return the positions of the minimum and maximum elements in -the iterator. Read more
    source§

    fn position_minmax_by_key<K, F>(self, key: F) -> MinMaxResult<usize>
    where +the iterator. Read more

    source§

    fn position_minmax_by_key<K, F>(self, key: F) -> MinMaxResult<usize>
    where Self: Sized, K: PartialOrd, F: FnMut(&Self::Item) -> K,

    Return the postions of the minimum and maximum elements of an -iterator, as determined by the specified function. Read more
    source§

    fn position_minmax_by<F>(self, compare: F) -> MinMaxResult<usize>
    where +iterator, as determined by the specified function. Read more

    source§

    fn position_minmax_by<F>(self, compare: F) -> MinMaxResult<usize>
    where Self: Sized, F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Return the postions of the minimum and maximum elements of an -iterator, as determined by the specified comparison function. Read more
    source§

    fn exactly_one(self) -> Result<Self::Item, ExactlyOneError<Self>>
    where +iterator, as determined by the specified comparison function. Read more

    source§

    fn exactly_one(self) -> Result<Self::Item, ExactlyOneError<Self>>
    where Self: Sized,

    If the iterator yields exactly one element, that element will be returned, otherwise an error will be returned containing an iterator that has the same output as the input -iterator. Read more
    source§

    fn at_most_one(self) -> Result<Option<Self::Item>, ExactlyOneError<Self>>
    where - Self: Sized,

    If the iterator yields no elements, Ok(None) will be returned. If the iterator yields +iterator. Read more
    source§

    fn at_most_one(self) -> Result<Option<Self::Item>, ExactlyOneError<Self>>
    where + Self: Sized,

    If the iterator yields no elements, Ok(None) will be returned. If the iterator yields exactly one element, that element will be returned, otherwise an error will be returned -containing an iterator that has the same output as the input iterator. Read more
    source§

    fn multipeek(self) -> MultiPeek<Self> ⓘ
    where +containing an iterator that has the same output as the input iterator. Read more

    source§

    fn multipeek(self) -> MultiPeek<Self> ⓘ
    where Self: Sized,

    An iterator adaptor that allows the user to peek at multiple .next() -values without advancing the base iterator. Read more
    source§

    fn counts(self) -> HashMap<Self::Item, usize>
    where +values without advancing the base iterator. Read more

    source§

    fn counts(self) -> HashMap<Self::Item, usize>
    where Self: Sized, Self::Item: Eq + Hash,

    Collect the items in this iterator and return a HashMap which contains each item that appears in the iterator and the number -of times it appears. Read more
    source§

    fn counts_by<K, F>(self, f: F) -> HashMap<K, usize>
    where +of times it appears. Read more

    source§

    fn counts_by<K, F>(self, f: F) -> HashMap<K, usize>
    where Self: Sized, K: Eq + Hash, F: FnMut(Self::Item) -> K,

    Collect the items in this iterator and return a HashMap which contains each item that appears in the iterator and the number of times it appears, -determining identity using a keying function. Read more
    source§

    fn multiunzip<FromI>(self) -> FromI
    where - Self: Sized + MultiUnzip<FromI>,

    Converts an iterator of tuples into a tuple of containers. Read more
    source§

    fn try_len(&self) -> Result<usize, (usize, Option<usize>)>

    Returns the length of the iterator if one exists. +determining identity using a keying function. Read more
    source§

    fn multiunzip<FromI>(self) -> FromI
    where + Self: Sized + MultiUnzip<FromI>,

    Converts an iterator of tuples into a tuple of containers. Read more
    source§

    fn try_len(&self) -> Result<usize, (usize, Option<usize>)>

    Returns the length of the iterator if one exists. Otherwise return self.size_hint(). Read more
    source§

    impl<IT> MultiUnzip<()> for IT
    where IT: Iterator<Item = ()>,

    source§

    fn multiunzip(self)

    Unzip this iterator into multiple collections.
    source§

    impl<IT, A, FromA> MultiUnzip<(FromA,)> for IT
    where IT: Iterator<Item = (A,)>, @@ -678,4 +690,4 @@ Otherwise return self.size_hint(). (FromA, FromB, FromC, FromD, FromE, FromF, FromG, FromH, FromI, FromJ, FromK, FromL)

    Unzip this iterator into multiple collections.
    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 + 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/itertools/structs/struct.InterleaveShortest.html b/itertools/structs/struct.InterleaveShortest.html index 7de2850d6..6063bb22d 100644 --- a/itertools/structs/struct.InterleaveShortest.html +++ b/itertools/structs/struct.InterleaveShortest.html @@ -1,18 +1,18 @@ -InterleaveShortest in itertools::structs - Rust
    -

    Struct itertools::structs::InterleaveShortest

    source · 
    pub struct InterleaveShortest<I, J>
    where
+InterleaveShortest in itertools::structs - Rust
    
+    
    Struct itertools::structs::InterleaveShortest
    source · 
    pub struct InterleaveShortest<I, J>
    where
     I: Iterator,
     J: Iterator<Item = I::Item>,
    { /* private fields */ }
    Expand description
    An iterator adaptor that alternates elements from the two iterators until
 one of them runs out.
    
 
    This iterator is fused.
    
 
    See .interleave_shortest()
 for more information.
    
-
    Trait Implementations§
    source§
    impl<I, J> Clone for InterleaveShortest<I, J>
    where
+
    Trait Implementations§
    source§
    impl<I, J> Clone for InterleaveShortest<I, J>
    where
     I: Iterator + Clone,
-    J: Iterator<Item = I::Item> + Clone,
    source§
    fn clone(&self) -> InterleaveShortest<I, J> ⓘ
    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<I, J> Debug for InterleaveShortest<I, J>
    where
+    J: Iterator<Item = I::Item> + Clone,
    source§
    fn clone(&self) -> InterleaveShortest<I, J> ⓘ
    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<I, J> Debug for InterleaveShortest<I, J>
    where
     I: Iterator + Debug,
-    J: Iterator<Item = I::Item> + Debug,
    source§
    fn fmt(&self, f: &mut Formatter<'_>) -> Result
    Formats the value using the given formatter. Read more
    source§
    impl<I, J> Iterator for InterleaveShortest<I, J>
    where
+    J: Iterator<Item = I::Item> + Debug,
    source§
    fn fmt(&self, f: &mut Formatter<'_>) -> Result
    Formats the value using the given formatter. Read more
    source§
    impl<I, J> Iterator for InterleaveShortest<I, J>
    where
     I: Iterator,
-    J: Iterator<Item = I::Item>,
    §
    type Item = <I as Iterator>::Item
    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
+    J: Iterator<Item = I::Item>,
    §
    type Item = <I as Iterator>::Item
    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
@@ -188,7 +188,7 @@ greater than or equal to those of another. 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, J> FusedIterator for InterleaveShortest<I, J>
    where
+function. Read more
    source§
    impl<I, J> FusedIterator for InterleaveShortest<I, J>
    where
     I: FusedIterator,
     J: FusedIterator<Item = I::Item>,

    Auto Trait Implementations§

    §

    impl<I, J> Freeze for InterleaveShortest<I, J>
    where I: Freeze, @@ -218,86 +218,87 @@ otherwise. Right variant of Either<Self, Self> otherwise. Read more

    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> Itertools for T
    where - T: Iterator + ?Sized,

    source§

    fn interleave<J>(self, other: J) -> Interleave<Self, J::IntoIter> ⓘ
    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> Itertools for T
    where + T: Iterator + ?Sized,

    source§

    fn interleave<J>(self, other: J) -> Interleave<Self, J::IntoIter> ⓘ
    where J: IntoIterator<Item = Self::Item>, - Self: Sized,

    Alternate elements from two iterators until both have run out. Read more
    source§

    fn interleave_shortest<J>( + Self: Sized,

    Alternate elements from two iterators until both have run out. Read more
    source§

    fn interleave_shortest<J>( self, other: J ) -> InterleaveShortest<Self, J::IntoIter> ⓘ
    where J: IntoIterator<Item = Self::Item>, Self: Sized,

    Alternate elements from two iterators until at least one of them has run -out. Read more
    source§

    fn intersperse(self, element: Self::Item) -> Intersperse<Self>
    where +out. Read more

    source§

    fn intersperse(self, element: Self::Item) -> Intersperse<Self>
    where Self: Sized, Self::Item: Clone,

    An iterator adaptor to insert a particular value -between each element of the adapted iterator. Read more
    source§

    fn intersperse_with<F>(self, element: F) -> IntersperseWith<Self, F> ⓘ
    where +between each element of the adapted iterator. Read more

    source§

    fn intersperse_with<F>(self, element: F) -> IntersperseWith<Self, F> ⓘ
    where Self: Sized, F: FnMut() -> Self::Item,

    An iterator adaptor to insert a particular value created by a function -between each element of the adapted iterator. Read more
    source§

    fn zip_longest<J>(self, other: J) -> ZipLongest<Self, J::IntoIter> ⓘ
    where +between each element of the adapted iterator. Read more

    source§

    fn get<R>(self, index: R) -> R::Output
    where + Self: Sized, + R: IteratorIndex<Self>,

    Returns an iterator over a subsection of the iterator. Read more
    source§

    fn zip_longest<J>(self, other: J) -> ZipLongest<Self, J::IntoIter> ⓘ
    where J: IntoIterator, Self: Sized,

    Create an iterator which iterates over both this and the specified -iterator simultaneously, yielding pairs of two optional elements. Read more
    source§

    fn zip_eq<J>(self, other: J) -> ZipEq<Self, J::IntoIter> ⓘ
    where +iterator simultaneously, yielding pairs of two optional elements. Read more

    source§

    fn zip_eq<J>(self, other: J) -> ZipEq<Self, J::IntoIter> ⓘ
    where J: IntoIterator, Self: Sized,

    Create an iterator which iterates over both this and the specified -iterator simultaneously, yielding pairs of elements. Read more
    source§

    fn batching<B, F>(self, f: F) -> Batching<Self, F> ⓘ
    where +iterator simultaneously, yielding pairs of elements. Read more

    source§

    fn batching<B, F>(self, f: F) -> Batching<Self, F> ⓘ
    where F: FnMut(&mut Self) -> Option<B>, Self: Sized,

    A “meta iterator adaptor”. Its closure receives a reference to the iterator and may pick off as many elements as it likes, to produce the -next iterator element. Read more
    source§

    fn group_by<K, F>(self, key: F) -> GroupBy<K, Self, F>
    where +next iterator element. Read more

    source§

    fn chunk_by<K, F>(self, key: F) -> ChunkBy<K, Self, F>
    where Self: Sized, F: FnMut(&Self::Item) -> K, K: PartialEq,

    Return an iterable that can group iterator elements. Consecutive elements that map to the same key (“runs”), are assigned -to the same group. Read more
    source§

    fn chunks(self, size: usize) -> IntoChunks<Self>
    where - Self: Sized,

    Return an iterable that can chunk the iterator. Read more
    source§

    fn tuple_windows<T>(self) -> TupleWindows<Self, T> ⓘ
    where +to the same group. Read more

    source§

    fn group_by<K, F>(self, key: F) -> ChunkBy<K, Self, F>
    where + Self: Sized, + F: FnMut(&Self::Item) -> K, + K: PartialEq,

    👎Deprecated since 0.13.0: Use .chunk_by() instead
    See .chunk_by().
    source§

    fn chunks(self, size: usize) -> IntoChunks<Self>
    where + Self: Sized,

    Return an iterable that can chunk the iterator. Read more
    source§

    fn tuple_windows<T>(self) -> TupleWindows<Self, T> ⓘ
    where Self: Sized + Iterator<Item = T::Item>, T: HomogeneousTuple, T::Item: Clone,

    Return an iterator over all contiguous windows producing tuples of -a specific size (up to 12). Read more
    source§

    fn circular_tuple_windows<T>(self) -> CircularTupleWindows<Self, T> ⓘ
    where +a specific size (up to 12). Read more

    source§

    fn circular_tuple_windows<T>(self) -> CircularTupleWindows<Self, T> ⓘ
    where Self: Sized + Clone + Iterator<Item = T::Item> + ExactSizeIterator, T: TupleCollect + Clone, T::Item: Clone,

    Return an iterator over all windows, wrapping back to the first elements when the window would otherwise exceed the length of the -iterator, producing tuples of a specific size (up to 12). Read more
    source§

    fn tuples<T>(self) -> Tuples<Self, T> ⓘ
    where +iterator, producing tuples of a specific size (up to 12). Read more

    source§

    fn tuples<T>(self) -> Tuples<Self, T> ⓘ
    where Self: Sized + Iterator<Item = T::Item>, T: HomogeneousTuple,

    Return an iterator that groups the items in tuples of a specific size -(up to 12). Read more
    source§

    fn tee(self) -> (Tee<Self>, Tee<Self>)
    where +(up to 12). Read more

    source§

    fn tee(self) -> (Tee<Self>, Tee<Self>)
    where Self: Sized, Self::Item: Clone,

    Split into an iterator pair that both yield all elements from -the original iterator. Read more
    source§

    fn step(self, n: usize) -> Step<Self> ⓘ
    where - Self: Sized,

    👎Deprecated since 0.8.0: Use std .step_by() instead
    Return an iterator adaptor that steps n elements in the base iterator -for each iteration. Read more
    source§

    fn map_into<R>(self) -> MapInto<Self, R>
    where +the original iterator. Read more

    source§

    fn map_into<R>(self) -> MapInto<Self, R>
    where Self: Sized, - Self::Item: Into<R>,

    Convert each item of the iterator using the Into trait. Read more
    source§

    fn map_results<F, T, U, E>(self, f: F) -> MapOk<Self, F>
    where - Self: Iterator<Item = Result<T, E>> + Sized, - F: FnMut(T) -> U,

    👎Deprecated since 0.10.0: Use .map_ok() instead
    See .map_ok().
    source§

    fn map_ok<F, T, U, E>(self, f: F) -> MapOk<Self, F>
    where + Self::Item: Into<R>,

    Convert each item of the iterator using the Into trait. Read more
    source§

    fn map_ok<F, T, U, E>(self, f: F) -> MapOk<Self, F>
    where Self: Iterator<Item = Result<T, E>> + Sized, F: FnMut(T) -> U,

    Return an iterator adaptor that applies the provided closure to every Result::Ok value. Result::Err values are -unchanged. Read more
    source§

    fn filter_ok<F, T, E>(self, f: F) -> FilterOk<Self, F> ⓘ
    where +unchanged. Read more

    source§

    fn filter_ok<F, T, E>(self, f: F) -> FilterOk<Self, F> ⓘ
    where Self: Iterator<Item = Result<T, E>> + Sized, F: FnMut(&T) -> bool,

    Return an iterator adaptor that filters every Result::Ok value with the provided closure. Result::Err values are -unchanged. Read more
    source§

    fn filter_map_ok<F, T, U, E>(self, f: F) -> FilterMapOk<Self, F> ⓘ
    where +unchanged. Read more

    source§

    fn filter_map_ok<F, T, U, E>(self, f: F) -> FilterMapOk<Self, F> ⓘ
    where Self: Iterator<Item = Result<T, E>> + Sized, F: FnMut(T) -> Option<U>,

    Return an iterator adaptor that filters and transforms every Result::Ok value with the provided closure. Result::Err -values are unchanged. Read more
    source§

    fn flatten_ok<T, E>(self) -> FlattenOk<Self, T, E> ⓘ
    where +values are unchanged. Read more

    source§

    fn flatten_ok<T, E>(self) -> FlattenOk<Self, T, E> ⓘ
    where Self: Iterator<Item = Result<T, E>> + Sized, T: IntoIterator,

    Return an iterator adaptor that flattens every Result::Ok value into -a series of Result::Ok values. Result::Err values are unchanged. Read more
    source§

    fn process_results<F, T, E, R>(self, processor: F) -> Result<R, E>
    where +a series of Result::Ok values. Result::Err values are unchanged. Read more

    source§

    fn process_results<F, T, E, R>(self, processor: F) -> Result<R, E>
    where Self: Iterator<Item = Result<T, E>> + Sized, F: FnOnce(ProcessResults<'_, Self, E>) -> R,

    “Lift” a function of the values of the current iterator so as to process -an iterator of Result values instead. Read more
    source§

    fn merge<J>(self, other: J) -> Merge<Self, J::IntoIter>
    where +an iterator of Result values instead. Read more

    source§

    fn merge<J>(self, other: J) -> Merge<Self, J::IntoIter>
    where Self: Sized, Self::Item: PartialOrd, J: IntoIterator<Item = Self::Item>,

    Return an iterator adaptor that merges the two base iterators in ascending order. If both base iterators are sorted (ascending), the -result is sorted. Read more
    source§

    fn merge_by<J, F>(self, other: J, is_first: F) -> MergeBy<Self, J::IntoIter, F> ⓘ
    where +result is sorted. Read more

    source§

    fn merge_by<J, F>(self, other: J, is_first: F) -> MergeBy<Self, J::IntoIter, F> ⓘ
    where Self: Sized, J: IntoIterator<Item = Self::Item>, F: FnMut(&Self::Item, &Self::Item) -> bool,

    Return an iterator adaptor that merges the two base iterators in order. -This is much like .merge() but allows for a custom ordering. Read more
    source§

    fn merge_join_by<J, F, T>( +This is much like .merge() but allows for a custom ordering. Read more

    source§

    fn merge_join_by<J, F, T>( self, other: J, cmp_fn: F @@ -305,284 +306,295 @@ This is much like IntoIterator, F: FnMut(&Self::Item, &J::Item) -> T, Self: Sized,

    Create an iterator that merges items from both this and the specified -iterator in ascending order. Read more
    source§

    fn kmerge(self) -> KMerge<<Self::Item as IntoIterator>::IntoIter>
    where +iterator in ascending order. Read more

    source§

    fn kmerge(self) -> KMerge<<Self::Item as IntoIterator>::IntoIter>
    where Self: Sized, Self::Item: IntoIterator, <Self::Item as IntoIterator>::Item: PartialOrd,

    Return an iterator adaptor that flattens an iterator of iterators by -merging them in ascending order. Read more
    source§

    fn kmerge_by<F>( +merging them in ascending order. Read more

    source§

    fn kmerge_by<F>( self, first: F ) -> KMergeBy<<Self::Item as IntoIterator>::IntoIter, F> ⓘ
    where Self: Sized, Self::Item: IntoIterator, F: FnMut(&<Self::Item as IntoIterator>::Item, &<Self::Item as IntoIterator>::Item) -> bool,

    Return an iterator adaptor that flattens an iterator of iterators by -merging them according to the given closure. Read more
    source§

    fn cartesian_product<J>(self, other: J) -> Product<Self, J::IntoIter> ⓘ
    where +merging them according to the given closure. Read more

    source§

    fn cartesian_product<J>(self, other: J) -> Product<Self, J::IntoIter> ⓘ
    where Self: Sized, Self::Item: Clone, J: IntoIterator, J::IntoIter: Clone,

    Return an iterator adaptor that iterates over the cartesian product of -the element sets of two iterators self and J. Read more
    source§

    fn multi_cartesian_product( +the element sets of two iterators self and J. Read more

    source§

    fn multi_cartesian_product( self ) -> MultiProduct<<Self::Item as IntoIterator>::IntoIter> ⓘ
    where Self: Sized, Self::Item: IntoIterator, <Self::Item as IntoIterator>::IntoIter: Clone, <Self::Item as IntoIterator>::Item: Clone,

    Return an iterator adaptor that iterates over the cartesian product of -all subiterators returned by meta-iterator self. Read more
    source§

    fn coalesce<F>(self, f: F) -> Coalesce<Self, F>
    where +all subiterators returned by meta-iterator self. Read more

    source§

    fn coalesce<F>(self, f: F) -> Coalesce<Self, F>
    where Self: Sized, F: FnMut(Self::Item, Self::Item) -> Result<Self::Item, (Self::Item, Self::Item)>,

    Return an iterator adaptor that uses the passed-in closure to -optionally merge together consecutive elements. Read more
    source§

    fn dedup(self) -> Dedup<Self>
    where +optionally merge together consecutive elements. Read more

    source§

    fn dedup(self) -> Dedup<Self>
    where Self: Sized, Self::Item: PartialEq,

    Remove duplicates from sections of consecutive identical elements. -If the iterator is sorted, all elements will be unique. Read more
    source§

    fn dedup_by<Cmp>(self, cmp: Cmp) -> DedupBy<Self, Cmp>
    where +If the iterator is sorted, all elements will be unique. Read more

    source§

    fn dedup_by<Cmp>(self, cmp: Cmp) -> DedupBy<Self, Cmp>
    where Self: Sized, Cmp: FnMut(&Self::Item, &Self::Item) -> bool,

    Remove duplicates from sections of consecutive identical elements, determining equality using a comparison function. -If the iterator is sorted, all elements will be unique. Read more
    source§

    fn dedup_with_count(self) -> DedupWithCount<Self>
    where +If the iterator is sorted, all elements will be unique. Read more

    source§

    fn dedup_with_count(self) -> DedupWithCount<Self>
    where Self: Sized,

    Remove duplicates from sections of consecutive identical elements, while keeping a count of how many repeated elements were present. -If the iterator is sorted, all elements will be unique. Read more
    source§

    fn dedup_by_with_count<Cmp>(self, cmp: Cmp) -> DedupByWithCount<Self, Cmp>
    where +If the iterator is sorted, all elements will be unique. Read more

    source§

    fn dedup_by_with_count<Cmp>(self, cmp: Cmp) -> DedupByWithCount<Self, Cmp>
    where Self: Sized, Cmp: FnMut(&Self::Item, &Self::Item) -> bool,

    Remove duplicates from sections of consecutive identical elements, while keeping a count of how many repeated elements were present. This will determine equality using a comparison function. -If the iterator is sorted, all elements will be unique. Read more
    source§

    fn duplicates(self) -> Duplicates<Self>
    where +If the iterator is sorted, all elements will be unique. Read more

    source§

    fn duplicates(self) -> Duplicates<Self>
    where Self: Sized, Self::Item: Eq + Hash,

    Return an iterator adaptor that produces elements that appear more than once during the -iteration. Duplicates are detected using hash and equality. Read more
    source§

    fn duplicates_by<V, F>(self, f: F) -> DuplicatesBy<Self, V, F>
    where +iteration. Duplicates are detected using hash and equality. Read more

    source§

    fn duplicates_by<V, F>(self, f: F) -> DuplicatesBy<Self, V, F>
    where Self: Sized, V: Eq + Hash, F: FnMut(&Self::Item) -> V,

    Return an iterator adaptor that produces elements that appear more than once during the -iteration. Duplicates are detected using hash and equality. Read more
    source§

    fn unique(self) -> Unique<Self> ⓘ
    where +iteration. Duplicates are detected using hash and equality. Read more

    source§

    fn unique(self) -> Unique<Self> ⓘ
    where Self: Sized, Self::Item: Clone + Eq + Hash,

    Return an iterator adaptor that filters out elements that have already been produced once during the iteration. Duplicates -are detected using hash and equality. Read more
    source§

    fn unique_by<V, F>(self, f: F) -> UniqueBy<Self, V, F> ⓘ
    where +are detected using hash and equality. Read more

    source§

    fn unique_by<V, F>(self, f: F) -> UniqueBy<Self, V, F> ⓘ
    where Self: Sized, V: Eq + Hash, F: FnMut(&Self::Item) -> V,

    Return an iterator adaptor that filters out elements that have -already been produced once during the iteration. Read more
    source§

    fn peeking_take_while<F>(&mut self, accept: F) -> PeekingTakeWhile<'_, Self, F> ⓘ
    where +already been produced once during the iteration. Read more

    source§

    fn peeking_take_while<F>(&mut self, accept: F) -> PeekingTakeWhile<'_, Self, F> ⓘ
    where Self: Sized + PeekingNext, F: FnMut(&Self::Item) -> bool,

    Return an iterator adaptor that borrows from this iterator and -takes items while the closure accept returns true. Read more
    source§

    fn take_while_ref<F>(&mut self, accept: F) -> TakeWhileRef<'_, Self, F> ⓘ
    where +takes items while the closure accept returns true. Read more

    source§

    fn take_while_ref<F>(&mut self, accept: F) -> TakeWhileRef<'_, Self, F> ⓘ
    where Self: Clone, F: FnMut(&Self::Item) -> bool,

    Return an iterator adaptor that borrows from a Clone-able iterator -to only pick off elements while the predicate accept returns true. Read more
    source§

    fn take_while_inclusive<F>(self, accept: F) -> TakeWhileInclusive<Self, F> ⓘ
    where +to only pick off elements while the predicate accept returns true. Read more

    source§

    fn take_while_inclusive<F>(self, accept: F) -> TakeWhileInclusive<Self, F> ⓘ
    where Self: Sized, F: FnMut(&Self::Item) -> bool,

    Returns an iterator adaptor that consumes elements while the given predicate is true, including the element for which the predicate -first returned false. Read more
    source§

    fn while_some<A>(self) -> WhileSome<Self> ⓘ
    where +first returned false. Read more

    source§

    fn while_some<A>(self) -> WhileSome<Self> ⓘ
    where Self: Sized + Iterator<Item = Option<A>>,

    Return an iterator adaptor that filters Option<A> iterator elements -and produces A. Stops on the first None encountered. Read more
    source§

    fn tuple_combinations<T>(self) -> TupleCombinations<Self, T> ⓘ
    where +and produces A. Stops on the first None encountered. Read more

    source§

    fn tuple_combinations<T>(self) -> TupleCombinations<Self, T> ⓘ
    where Self: Sized + Clone, Self::Item: Clone, T: HasCombination<Self>,

    Return an iterator adaptor that iterates over the combinations of the -elements from an iterator. Read more
    source§

    fn combinations(self, k: usize) -> Combinations<Self> ⓘ
    where +elements from an iterator. Read more

    source§

    fn combinations(self, k: usize) -> Combinations<Self> ⓘ
    where Self: Sized, Self::Item: Clone,

    Return an iterator adaptor that iterates over the k-length combinations of -the elements from an iterator. Read more
    source§

    fn combinations_with_replacement( +the elements from an iterator. Read more

    source§

    fn combinations_with_replacement( self, k: usize ) -> CombinationsWithReplacement<Self> ⓘ
    where Self: Sized, Self::Item: Clone,

    Return an iterator that iterates over the k-length combinations of -the elements from an iterator, with replacement. Read more
    source§

    fn permutations(self, k: usize) -> Permutations<Self> ⓘ
    where +the elements from an iterator, with replacement. Read more

    source§

    fn permutations(self, k: usize) -> Permutations<Self> ⓘ
    where Self: Sized, Self::Item: Clone,

    Return an iterator adaptor that iterates over all k-permutations of the -elements from an iterator. Read more
    source§

    fn powerset(self) -> Powerset<Self> ⓘ
    where +elements from an iterator. Read more

    source§

    fn powerset(self) -> Powerset<Self> ⓘ
    where Self: Sized, Self::Item: Clone,

    Return an iterator that iterates through the powerset of the elements from an -iterator. Read more
    source§

    fn pad_using<F>(self, min: usize, f: F) -> PadUsing<Self, F> ⓘ
    where +iterator. Read more

    source§

    fn pad_using<F>(self, min: usize, f: F) -> PadUsing<Self, F> ⓘ
    where Self: Sized, F: FnMut(usize) -> Self::Item,

    Return an iterator adaptor that pads the sequence to a minimum length of -min by filling missing elements using a closure f. Read more
    source§

    fn with_position(self) -> WithPosition<Self> ⓘ
    where +min by filling missing elements using a closure f. Read more

    source§

    fn with_position(self) -> WithPosition<Self> ⓘ
    where Self: Sized,

    Return an iterator adaptor that combines each element with a Position to -ease special-case handling of the first or last elements. Read more
    source§

    fn positions<P>(self, predicate: P) -> Positions<Self, P> ⓘ
    where +ease special-case handling of the first or last elements. Read more

    source§

    fn positions<P>(self, predicate: P) -> Positions<Self, P> ⓘ
    where Self: Sized, P: FnMut(Self::Item) -> bool,

    Return an iterator adaptor that yields the indices of all elements -satisfying a predicate, counted from the start of the iterator. Read more
    source§

    fn update<F>(self, updater: F) -> Update<Self, F> ⓘ
    where +satisfying a predicate, counted from the start of the iterator. Read more

    source§

    fn update<F>(self, updater: F) -> Update<Self, F> ⓘ
    where Self: Sized, F: FnMut(&mut Self::Item),

    Return an iterator adaptor that applies a mutating function -to each element before yielding it. Read more
    source§

    fn next_tuple<T>(&mut self) -> Option<T>
    where +to each element before yielding it. Read more

    source§

    fn next_tuple<T>(&mut self) -> Option<T>
    where Self: Sized + Iterator<Item = T::Item>, T: HomogeneousTuple,

    Advances the iterator and returns the next items grouped in a tuple of -a specific size (up to 12). Read more
    source§

    fn collect_tuple<T>(self) -> Option<T>
    where +a specific size (up to 12). Read more

    source§

    fn collect_tuple<T>(self) -> Option<T>
    where Self: Sized + Iterator<Item = T::Item>, T: HomogeneousTuple,

    Collects all items from the iterator into a tuple of a specific size -(up to 12). Read more
    source§

    fn find_position<P>(&mut self, pred: P) -> Option<(usize, Self::Item)>
    where - P: FnMut(&Self::Item) -> bool,

    Find the position and value of the first element satisfying a predicate. Read more
    source§

    fn find_or_last<P>(self, predicate: P) -> Option<Self::Item>
    where +(up to 12). Read more

    source§

    fn find_position<P>(&mut self, pred: P) -> Option<(usize, Self::Item)>
    where + P: FnMut(&Self::Item) -> bool,

    Find the position and value of the first element satisfying a predicate. Read more
    source§

    fn find_or_last<P>(self, predicate: P) -> Option<Self::Item>
    where Self: Sized, - P: FnMut(&Self::Item) -> bool,

    Find the value of the first element satisfying a predicate or return the last element, if any. Read more
    source§

    fn find_or_first<P>(self, predicate: P) -> Option<Self::Item>
    where + P: FnMut(&Self::Item) -> bool,

    Find the value of the first element satisfying a predicate or return the last element, if any. Read more
    source§

    fn find_or_first<P>(self, predicate: P) -> Option<Self::Item>
    where Self: Sized, - P: FnMut(&Self::Item) -> bool,

    Find the value of the first element satisfying a predicate or return the first element, if any. Read more
    source§

    fn contains<Q>(&mut self, query: &Q) -> bool
    where + P: FnMut(&Self::Item) -> bool,

    Find the value of the first element satisfying a predicate or return the first element, if any. Read more
    source§

    fn contains<Q>(&mut self, query: &Q) -> bool
    where Self: Sized, Self::Item: Borrow<Q>, - Q: PartialEq,

    Returns true if the given item is present in this iterator. Read more
    source§

    fn all_equal(&mut self) -> bool
    where + Q: PartialEq,

    Returns true if the given item is present in this iterator. Read more
    source§

    fn all_equal(&mut self) -> bool
    where Self: Sized, - Self::Item: PartialEq,

    Check whether all elements compare equal. Read more
    source§

    fn all_equal_value( + Self::Item: PartialEq,

    Check whether all elements compare equal. Read more
    source§

    fn all_equal_value( &mut self ) -> Result<Self::Item, Option<(Self::Item, Self::Item)>>
    where Self: Sized, Self::Item: PartialEq,

    If there are elements and they are all equal, return a single copy of that element. If there are no elements, return an Error containing None. If there are elements and they are not all equal, return a tuple containing the first -two non-equal elements found. Read more
    source§

    fn all_unique(&mut self) -> bool
    where +two non-equal elements found. Read more

    source§

    fn all_unique(&mut self) -> bool
    where Self: Sized, - Self::Item: Eq + Hash,

    Check whether all elements are unique (non equal). Read more
    source§

    fn dropping(self, n: usize) -> Self
    where + Self::Item: Eq + Hash,

    Check whether all elements are unique (non equal). Read more
    source§

    fn dropping(self, n: usize) -> Self
    where Self: Sized,

    Consume the first n elements from the iterator eagerly, -and return the same iterator again. Read more
    source§

    fn dropping_back(self, n: usize) -> Self
    where +and return the same iterator again. Read more

    source§

    fn dropping_back(self, n: usize) -> Self
    where Self: Sized + DoubleEndedIterator,

    Consume the last n elements from the iterator eagerly, -and return the same iterator again. Read more
    source§

    fn foreach<F>(self, f: F)
    where - F: FnMut(Self::Item), - Self: Sized,

    👎Deprecated since 0.8.0: Use .for_each() instead
    Run the closure f eagerly on each element of the iterator. Read more
    source§

    fn concat(self) -> Self::Item
    where +and return the same iterator again. Read more

    source§

    fn concat(self) -> Self::Item
    where Self: Sized, - Self::Item: Extend<<<Self as Iterator>::Item as IntoIterator>::Item> + IntoIterator + Default,

    Combine all an iterator’s elements into one element by using Extend. Read more
    source§

    fn collect_vec(self) -> Vec<Self::Item>
    where + Self::Item: Extend<<<Self as Iterator>::Item as IntoIterator>::Item> + IntoIterator + Default,

    Combine all an iterator’s elements into one element by using Extend. Read more
    source§

    fn collect_vec(self) -> Vec<Self::Item>
    where Self: Sized,

    .collect_vec() is simply a type specialization of Iterator::collect, -for convenience.
    source§

    fn try_collect<T, U, E>(self) -> Result<U, E>
    where +for convenience.

    source§

    fn try_collect<T, U, E>(self) -> Result<U, E>
    where Self: Sized + Iterator<Item = Result<T, E>>, Result<U, E>: FromIterator<Result<T, E>>,

    .try_collect() is more convenient way of writing -.collect::<Result<_, _>>() Read more
    source§

    fn set_from<'a, A: 'a, J>(&mut self, from: J) -> usize
    where +.collect::<Result<_, _>>() Read more

    source§

    fn set_from<'a, A: 'a, J>(&mut self, from: J) -> usize
    where Self: Iterator<Item = &'a mut A>, J: IntoIterator<Item = A>,

    Assign to each reference in self from the from iterator, -stopping at the shortest of the two iterators. Read more
    source§

    fn join(&mut self, sep: &str) -> String
    where - Self::Item: Display,

    Combine all iterator elements into one String, separated by sep. Read more
    source§

    fn format(self, sep: &str) -> Format<'_, Self>
    where - Self: Sized,

    Format all iterator elements, separated by sep. Read more
    source§

    fn format_with<F>(self, sep: &str, format: F) -> FormatWith<'_, Self, F>
    where +stopping at the shortest of the two iterators. Read more

    source§

    fn join(&mut self, sep: &str) -> String
    where + Self::Item: Display,

    Combine all iterator elements into one String, separated by sep. Read more
    source§

    fn format(self, sep: &str) -> Format<'_, Self>
    where + Self: Sized,

    Format all iterator elements, separated by sep. Read more
    source§

    fn format_with<F>(self, sep: &str, format: F) -> FormatWith<'_, Self, F>
    where Self: Sized, - F: FnMut(Self::Item, &mut dyn FnMut(&dyn Display) -> Result) -> Result,

    Format all iterator elements, separated by sep. Read more
    source§

    fn fold_results<A, E, B, F>(&mut self, start: B, f: F) -> Result<B, E>
    where + F: FnMut(Self::Item, &mut dyn FnMut(&dyn Display) -> Result) -> Result,

    Format all iterator elements, separated by sep. Read more
    source§

    fn fold_ok<A, E, B, F>(&mut self, start: B, f: F) -> Result<B, E>
    where Self: Iterator<Item = Result<A, E>>, - F: FnMut(B, A) -> B,

    👎Deprecated since 0.10.0: Use .fold_ok() instead
    See .fold_ok().
    source§

    fn fold_ok<A, E, B, F>(&mut self, start: B, f: F) -> Result<B, E>
    where - Self: Iterator<Item = Result<A, E>>, - F: FnMut(B, A) -> B,

    Fold Result values from an iterator. Read more
    source§

    fn fold_options<A, B, F>(&mut self, start: B, f: F) -> Option<B>
    where + F: FnMut(B, A) -> B,

    Fold Result values from an iterator. Read more
    source§

    fn fold_options<A, B, F>(&mut self, start: B, f: F) -> Option<B>
    where Self: Iterator<Item = Option<A>>, - F: FnMut(B, A) -> B,

    Fold Option values from an iterator. Read more
    source§

    fn fold1<F>(self, f: F) -> Option<Self::Item>
    where + F: FnMut(B, A) -> B,

    Fold Option values from an iterator. Read more
    source§

    fn fold1<F>(self, f: F) -> Option<Self::Item>
    where F: FnMut(Self::Item, Self::Item) -> Self::Item, - Self: Sized,

    👎Deprecated since 0.10.2: Use Iterator::reduce instead
    Accumulator of the elements in the iterator. Read more
    source§

    fn tree_fold1<F>(self, f: F) -> Option<Self::Item>
    where + Self: Sized,

    👎Deprecated since 0.10.2: Use Iterator::reduce instead
    Accumulator of the elements in the iterator. Read more
    source§

    fn tree_reduce<F>(self, f: F) -> Option<Self::Item>
    where F: FnMut(Self::Item, Self::Item) -> Self::Item, - Self: Sized,

    Accumulate the elements in the iterator in a tree-like manner. Read more
    source§

    fn fold_while<B, F>(&mut self, init: B, f: F) -> FoldWhile<B>
    where + Self: Sized,

    Accumulate the elements in the iterator in a tree-like manner. Read more
    source§

    fn tree_fold1<F>(self, f: F) -> Option<Self::Item>
    where + F: FnMut(Self::Item, Self::Item) -> Self::Item, + Self: Sized,

    👎Deprecated since 0.13.0: Use .tree_reduce() instead
    See .tree_reduce().
    source§

    fn fold_while<B, F>(&mut self, init: B, f: F) -> FoldWhile<B>
    where Self: Sized, - F: FnMut(B, Self::Item) -> FoldWhile<B>,

    An iterator method that applies a function, producing a single, final value. Read more
    source§

    fn sum1<S>(self) -> Option<S>
    where + F: FnMut(B, Self::Item) -> FoldWhile<B>,

    An iterator method that applies a function, producing a single, final value. Read more
    source§

    fn sum1<S>(self) -> Option<S>
    where Self: Sized, - S: Sum<Self::Item>,

    Iterate over the entire iterator and add all the elements. Read more
    source§

    fn product1<P>(self) -> Option<P>
    where + S: Sum<Self::Item>,

    Iterate over the entire iterator and add all the elements. Read more
    source§

    fn product1<P>(self) -> Option<P>
    where Self: Sized, - P: Product<Self::Item>,

    Iterate over the entire iterator and multiply all the elements. Read more
    source§

    fn sorted_unstable(self) -> IntoIter<Self::Item> ⓘ
    where + P: Product<Self::Item>,

    Iterate over the entire iterator and multiply all the elements. Read more
    source§

    fn sorted_unstable(self) -> IntoIter<Self::Item> ⓘ
    where Self: Sized, - Self::Item: Ord,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_unstable_by<F>(self, cmp: F) -> IntoIter<Self::Item> ⓘ
    where + Self::Item: Ord,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_unstable_by<F>(self, cmp: F) -> IntoIter<Self::Item> ⓘ
    where Self: Sized, - F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_unstable_by_key<K, F>(self, f: F) -> IntoIter<Self::Item> ⓘ
    where + F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_unstable_by_key<K, F>(self, f: F) -> IntoIter<Self::Item> ⓘ
    where Self: Sized, K: Ord, - F: FnMut(&Self::Item) -> K,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted(self) -> IntoIter<Self::Item> ⓘ
    where + F: FnMut(&Self::Item) -> K,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted(self) -> IntoIter<Self::Item> ⓘ
    where Self: Sized, - Self::Item: Ord,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_by<F>(self, cmp: F) -> IntoIter<Self::Item> ⓘ
    where + Self::Item: Ord,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_by<F>(self, cmp: F) -> IntoIter<Self::Item> ⓘ
    where Self: Sized, - F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_by_key<K, F>(self, f: F) -> IntoIter<Self::Item> ⓘ
    where + F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_by_key<K, F>(self, f: F) -> IntoIter<Self::Item> ⓘ
    where Self: Sized, K: Ord, - F: FnMut(&Self::Item) -> K,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_by_cached_key<K, F>(self, f: F) -> IntoIter<Self::Item> ⓘ
    where + F: FnMut(&Self::Item) -> K,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_by_cached_key<K, F>(self, f: F) -> IntoIter<Self::Item> ⓘ
    where Self: Sized, K: Ord, F: FnMut(&Self::Item) -> K,

    Sort all iterator elements into a new iterator in ascending order. The key function is -called exactly once per key. Read more
    source§

    fn k_smallest(self, k: usize) -> IntoIter<Self::Item> ⓘ
    where +called exactly once per key. Read more

    source§

    fn k_smallest(self, k: usize) -> IntoIter<Self::Item> ⓘ
    where Self: Sized, - Self::Item: Ord,

    Sort the k smallest elements into a new iterator, in ascending order. Read more
    source§

    fn partition_map<A, B, F, L, R>(self, predicate: F) -> (A, B)
    where + Self::Item: Ord,

    Sort the k smallest elements into a new iterator, in ascending order. Read more
    source§

    fn k_smallest_by<F>(self, k: usize, cmp: F) -> IntoIter<Self::Item> ⓘ
    where + Self: Sized, + F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Sort the k smallest elements into a new iterator using the provided comparison. Read more
    source§

    fn k_smallest_by_key<F, K>(self, k: usize, key: F) -> IntoIter<Self::Item> ⓘ
    where + Self: Sized, + F: FnMut(&Self::Item) -> K, + K: Ord,

    Return the elements producing the k smallest outputs of the provided function. Read more
    source§

    fn k_largest(self, k: usize) -> IntoIter<Self::Item> ⓘ
    where + Self: Sized, + Self::Item: Ord,

    Sort the k largest elements into a new iterator, in descending order. Read more
    source§

    fn k_largest_by<F>(self, k: usize, cmp: F) -> IntoIter<Self::Item> ⓘ
    where + Self: Sized, + F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Sort the k largest elements into a new iterator using the provided comparison. Read more
    source§

    fn k_largest_by_key<F, K>(self, k: usize, key: F) -> IntoIter<Self::Item> ⓘ
    where + Self: Sized, + F: FnMut(&Self::Item) -> K, + K: Ord,

    Return the elements producing the k largest outputs of the provided function. Read more
    source§

    fn tail(self, n: usize) -> IntoIter<Self::Item> ⓘ
    where + Self: Sized,

    Consumes the iterator and return an iterator of the last n elements. Read more
    source§

    fn partition_map<A, B, F, L, R>(self, predicate: F) -> (A, B)
    where Self: Sized, F: FnMut(Self::Item) -> Either<L, R>, A: Default + Extend<L>, B: Default + Extend<R>,

    Collect all iterator elements into one of two partitions. Unlike Iterator::partition, each partition may -have a distinct type. Read more
    source§

    fn partition_result<A, B, T, E>(self) -> (A, B)
    where +have a distinct type. Read more

    source§

    fn partition_result<A, B, T, E>(self) -> (A, B)
    where Self: Iterator<Item = Result<T, E>> + Sized, A: Default + Extend<T>, B: Default + Extend<E>,

    Partition a sequence of Results into one list of all the Ok elements -and another list of all the Err elements. Read more
    source§

    fn into_group_map<K, V>(self) -> HashMap<K, Vec<V>>
    where +and another list of all the Err elements. Read more

    source§

    fn into_group_map<K, V>(self) -> HashMap<K, Vec<V>>
    where Self: Iterator<Item = (K, V)> + Sized, K: Hash + Eq,

    Return a HashMap of keys mapped to Vecs of values. Keys and values -are taken from (Key, Value) tuple pairs yielded by the input iterator. Read more
    source§

    fn into_group_map_by<K, V, F>(self, f: F) -> HashMap<K, Vec<V>>
    where +are taken from (Key, Value) tuple pairs yielded by the input iterator. Read more

    source§

    fn into_group_map_by<K, V, F>(self, f: F) -> HashMap<K, Vec<V>>
    where Self: Iterator<Item = V> + Sized, K: Hash + Eq, - F: Fn(&V) -> K,

    Return an Iterator on a HashMap. Keys mapped to Vecs of values. The key is specified -in the closure. Read more
    source§

    fn into_grouping_map<K, V>(self) -> GroupingMap<Self>
    where + F: FnMut(&V) -> K,

    Return an Iterator on a HashMap. Keys mapped to Vecs of values. The key is specified +in the closure. Read more
    source§

    fn into_grouping_map<K, V>(self) -> GroupingMap<Self>
    where Self: Iterator<Item = (K, V)> + Sized, K: Hash + Eq,

    Constructs a GroupingMap to be used later with one of the efficient -group-and-fold operations it allows to perform. Read more
    source§

    fn into_grouping_map_by<K, V, F>(self, key_mapper: F) -> GroupingMapBy<Self, F>
    where +group-and-fold operations it allows to perform. Read more

    source§

    fn into_grouping_map_by<K, V, F>(self, key_mapper: F) -> GroupingMapBy<Self, F>
    where Self: Iterator<Item = V> + Sized, K: Hash + Eq, F: FnMut(&V) -> K,

    Constructs a GroupingMap to be used later with one of the efficient -group-and-fold operations it allows to perform. Read more
    source§

    fn min_set(self) -> Vec<Self::Item>
    where +group-and-fold operations it allows to perform. Read more

    source§

    fn min_set(self) -> Vec<Self::Item>
    where Self: Sized, - Self::Item: Ord,

    Return all minimum elements of an iterator. Read more
    source§

    fn min_set_by<F>(self, compare: F) -> Vec<Self::Item>
    where + Self::Item: Ord,

    Return all minimum elements of an iterator. Read more
    source§

    fn min_set_by<F>(self, compare: F) -> Vec<Self::Item>
    where Self: Sized, F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Return all minimum elements of an iterator, as determined by -the specified function. Read more
    source§

    fn min_set_by_key<K, F>(self, key: F) -> Vec<Self::Item>
    where +the specified function. Read more

    source§

    fn min_set_by_key<K, F>(self, key: F) -> Vec<Self::Item>
    where Self: Sized, K: Ord, F: FnMut(&Self::Item) -> K,

    Return all minimum elements of an iterator, as determined by -the specified function. Read more
    source§

    fn max_set(self) -> Vec<Self::Item>
    where +the specified function. Read more

    source§

    fn max_set(self) -> Vec<Self::Item>
    where Self: Sized, - Self::Item: Ord,

    Return all maximum elements of an iterator. Read more
    source§

    fn max_set_by<F>(self, compare: F) -> Vec<Self::Item>
    where + Self::Item: Ord,

    Return all maximum elements of an iterator. Read more
    source§

    fn max_set_by<F>(self, compare: F) -> Vec<Self::Item>
    where Self: Sized, F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Return all maximum elements of an iterator, as determined by -the specified function. Read more
    source§

    fn max_set_by_key<K, F>(self, key: F) -> Vec<Self::Item>
    where +the specified function. Read more

    source§

    fn max_set_by_key<K, F>(self, key: F) -> Vec<Self::Item>
    where Self: Sized, K: Ord, F: FnMut(&Self::Item) -> K,

    Return all maximum elements of an iterator, as determined by -the specified function. Read more
    source§

    fn minmax(self) -> MinMaxResult<Self::Item>
    where +the specified function. Read more

    source§

    fn minmax(self) -> MinMaxResult<Self::Item>
    where Self: Sized, - Self::Item: PartialOrd,

    Return the minimum and maximum elements in the iterator. Read more
    source§

    fn minmax_by_key<K, F>(self, key: F) -> MinMaxResult<Self::Item>
    where + Self::Item: PartialOrd,

    Return the minimum and maximum elements in the iterator. Read more
    source§

    fn minmax_by_key<K, F>(self, key: F) -> MinMaxResult<Self::Item>
    where Self: Sized, K: PartialOrd, F: FnMut(&Self::Item) -> K,

    Return the minimum and maximum element of an iterator, as determined by -the specified function. Read more
    source§

    fn minmax_by<F>(self, compare: F) -> MinMaxResult<Self::Item>
    where +the specified function. Read more

    source§

    fn minmax_by<F>(self, compare: F) -> MinMaxResult<Self::Item>
    where Self: Sized, F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Return the minimum and maximum element of an iterator, as determined by -the specified comparison function. Read more
    source§

    fn position_max(self) -> Option<usize>
    where +the specified comparison function. Read more

    source§

    fn position_max(self) -> Option<usize>
    where Self: Sized, - Self::Item: Ord,

    Return the position of the maximum element in the iterator. Read more
    source§

    fn position_max_by_key<K, F>(self, key: F) -> Option<usize>
    where + Self::Item: Ord,

    Return the position of the maximum element in the iterator. Read more
    source§

    fn position_max_by_key<K, F>(self, key: F) -> Option<usize>
    where Self: Sized, K: Ord, F: FnMut(&Self::Item) -> K,

    Return the position of the maximum element in the iterator, as -determined by the specified function. Read more
    source§

    fn position_max_by<F>(self, compare: F) -> Option<usize>
    where +determined by the specified function. Read more

    source§

    fn position_max_by<F>(self, compare: F) -> Option<usize>
    where Self: Sized, F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Return the position of the maximum element in the iterator, as -determined by the specified comparison function. Read more
    source§

    fn position_min(self) -> Option<usize>
    where +determined by the specified comparison function. Read more

    source§

    fn position_min(self) -> Option<usize>
    where Self: Sized, - Self::Item: Ord,

    Return the position of the minimum element in the iterator. Read more
    source§

    fn position_min_by_key<K, F>(self, key: F) -> Option<usize>
    where + Self::Item: Ord,

    Return the position of the minimum element in the iterator. Read more
    source§

    fn position_min_by_key<K, F>(self, key: F) -> Option<usize>
    where Self: Sized, K: Ord, F: FnMut(&Self::Item) -> K,

    Return the position of the minimum element in the iterator, as -determined by the specified function. Read more
    source§

    fn position_min_by<F>(self, compare: F) -> Option<usize>
    where +determined by the specified function. Read more

    source§

    fn position_min_by<F>(self, compare: F) -> Option<usize>
    where Self: Sized, F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Return the position of the minimum element in the iterator, as -determined by the specified comparison function. Read more
    source§

    fn position_minmax(self) -> MinMaxResult<usize>
    where +determined by the specified comparison function. Read more

    source§

    fn position_minmax(self) -> MinMaxResult<usize>
    where Self: Sized, Self::Item: PartialOrd,

    Return the positions of the minimum and maximum elements in -the iterator. Read more
    source§

    fn position_minmax_by_key<K, F>(self, key: F) -> MinMaxResult<usize>
    where +the iterator. Read more

    source§

    fn position_minmax_by_key<K, F>(self, key: F) -> MinMaxResult<usize>
    where Self: Sized, K: PartialOrd, F: FnMut(&Self::Item) -> K,

    Return the postions of the minimum and maximum elements of an -iterator, as determined by the specified function. Read more
    source§

    fn position_minmax_by<F>(self, compare: F) -> MinMaxResult<usize>
    where +iterator, as determined by the specified function. Read more

    source§

    fn position_minmax_by<F>(self, compare: F) -> MinMaxResult<usize>
    where Self: Sized, F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Return the postions of the minimum and maximum elements of an -iterator, as determined by the specified comparison function. Read more
    source§

    fn exactly_one(self) -> Result<Self::Item, ExactlyOneError<Self>>
    where +iterator, as determined by the specified comparison function. Read more

    source§

    fn exactly_one(self) -> Result<Self::Item, ExactlyOneError<Self>>
    where Self: Sized,

    If the iterator yields exactly one element, that element will be returned, otherwise an error will be returned containing an iterator that has the same output as the input -iterator. Read more
    source§

    fn at_most_one(self) -> Result<Option<Self::Item>, ExactlyOneError<Self>>
    where - Self: Sized,

    If the iterator yields no elements, Ok(None) will be returned. If the iterator yields +iterator. Read more
    source§

    fn at_most_one(self) -> Result<Option<Self::Item>, ExactlyOneError<Self>>
    where + Self: Sized,

    If the iterator yields no elements, Ok(None) will be returned. If the iterator yields exactly one element, that element will be returned, otherwise an error will be returned -containing an iterator that has the same output as the input iterator. Read more
    source§

    fn multipeek(self) -> MultiPeek<Self> ⓘ
    where +containing an iterator that has the same output as the input iterator. Read more

    source§

    fn multipeek(self) -> MultiPeek<Self> ⓘ
    where Self: Sized,

    An iterator adaptor that allows the user to peek at multiple .next() -values without advancing the base iterator. Read more
    source§

    fn counts(self) -> HashMap<Self::Item, usize>
    where +values without advancing the base iterator. Read more

    source§

    fn counts(self) -> HashMap<Self::Item, usize>
    where Self: Sized, Self::Item: Eq + Hash,

    Collect the items in this iterator and return a HashMap which contains each item that appears in the iterator and the number -of times it appears. Read more
    source§

    fn counts_by<K, F>(self, f: F) -> HashMap<K, usize>
    where +of times it appears. Read more

    source§

    fn counts_by<K, F>(self, f: F) -> HashMap<K, usize>
    where Self: Sized, K: Eq + Hash, F: FnMut(Self::Item) -> K,

    Collect the items in this iterator and return a HashMap which contains each item that appears in the iterator and the number of times it appears, -determining identity using a keying function. Read more
    source§

    fn multiunzip<FromI>(self) -> FromI
    where - Self: Sized + MultiUnzip<FromI>,

    Converts an iterator of tuples into a tuple of containers. Read more
    source§

    fn try_len(&self) -> Result<usize, (usize, Option<usize>)>

    Returns the length of the iterator if one exists. +determining identity using a keying function. Read more
    source§

    fn multiunzip<FromI>(self) -> FromI
    where + Self: Sized + MultiUnzip<FromI>,

    Converts an iterator of tuples into a tuple of containers. Read more
    source§

    fn try_len(&self) -> Result<usize, (usize, Option<usize>)>

    Returns the length of the iterator if one exists. Otherwise return self.size_hint(). Read more
    source§

    impl<IT> MultiUnzip<()> for IT
    where IT: Iterator<Item = ()>,

    source§

    fn multiunzip(self)

    Unzip this iterator into multiple collections.
    source§

    impl<IT, A, FromA> MultiUnzip<(FromA,)> for IT
    where IT: Iterator<Item = (A,)>, @@ -685,4 +697,4 @@ Otherwise return self.size_hint(). (FromA, FromB, FromC, FromD, FromE, FromF, FromG, FromH, FromI, FromJ, FromK, FromL)

    Unzip this iterator into multiple collections.
    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 + 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/itertools/structs/struct.IntersperseWith.html b/itertools/structs/struct.IntersperseWith.html index f7817a38c..9c77e561d 100644 --- a/itertools/structs/struct.IntersperseWith.html +++ b/itertools/structs/struct.IntersperseWith.html @@ -1,4 +1,4 @@ -IntersperseWith in itertools::structs - Rust
    +IntersperseWith in itertools::structs - Rust

    Struct itertools::structs::IntersperseWith

    source · 
    pub struct IntersperseWith<I, ElemF>
    where
     I: Iterator,
    { /* private fields */ }
    Expand description

    An iterator adaptor to insert a particular value created by a function between each element of the adapted iterator.

    @@ -224,86 +224,87 @@ otherwise. Right variant of Either<Self, Self> otherwise. Read more
    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> Itertools for T
    where - T: Iterator + ?Sized,

    source§

    fn interleave<J>(self, other: J) -> Interleave<Self, J::IntoIter> ⓘ
    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> Itertools for T
    where + T: Iterator + ?Sized,

    source§

    fn interleave<J>(self, other: J) -> Interleave<Self, J::IntoIter> ⓘ
    where J: IntoIterator<Item = Self::Item>, - Self: Sized,

    Alternate elements from two iterators until both have run out. Read more
    source§

    fn interleave_shortest<J>( + Self: Sized,

    Alternate elements from two iterators until both have run out. Read more
    source§

    fn interleave_shortest<J>( self, other: J ) -> InterleaveShortest<Self, J::IntoIter> ⓘ
    where J: IntoIterator<Item = Self::Item>, Self: Sized,

    Alternate elements from two iterators until at least one of them has run -out. Read more
    source§

    fn intersperse(self, element: Self::Item) -> Intersperse<Self>
    where +out. Read more

    source§

    fn intersperse(self, element: Self::Item) -> Intersperse<Self>
    where Self: Sized, Self::Item: Clone,

    An iterator adaptor to insert a particular value -between each element of the adapted iterator. Read more
    source§

    fn intersperse_with<F>(self, element: F) -> IntersperseWith<Self, F> ⓘ
    where +between each element of the adapted iterator. Read more

    source§

    fn intersperse_with<F>(self, element: F) -> IntersperseWith<Self, F> ⓘ
    where Self: Sized, F: FnMut() -> Self::Item,

    An iterator adaptor to insert a particular value created by a function -between each element of the adapted iterator. Read more
    source§

    fn zip_longest<J>(self, other: J) -> ZipLongest<Self, J::IntoIter> ⓘ
    where +between each element of the adapted iterator. Read more

    source§

    fn get<R>(self, index: R) -> R::Output
    where + Self: Sized, + R: IteratorIndex<Self>,

    Returns an iterator over a subsection of the iterator. Read more
    source§

    fn zip_longest<J>(self, other: J) -> ZipLongest<Self, J::IntoIter> ⓘ
    where J: IntoIterator, Self: Sized,

    Create an iterator which iterates over both this and the specified -iterator simultaneously, yielding pairs of two optional elements. Read more
    source§

    fn zip_eq<J>(self, other: J) -> ZipEq<Self, J::IntoIter> ⓘ
    where +iterator simultaneously, yielding pairs of two optional elements. Read more

    source§

    fn zip_eq<J>(self, other: J) -> ZipEq<Self, J::IntoIter> ⓘ
    where J: IntoIterator, Self: Sized,

    Create an iterator which iterates over both this and the specified -iterator simultaneously, yielding pairs of elements. Read more
    source§

    fn batching<B, F>(self, f: F) -> Batching<Self, F> ⓘ
    where +iterator simultaneously, yielding pairs of elements. Read more

    source§

    fn batching<B, F>(self, f: F) -> Batching<Self, F> ⓘ
    where F: FnMut(&mut Self) -> Option<B>, Self: Sized,

    A “meta iterator adaptor”. Its closure receives a reference to the iterator and may pick off as many elements as it likes, to produce the -next iterator element. Read more
    source§

    fn group_by<K, F>(self, key: F) -> GroupBy<K, Self, F>
    where +next iterator element. Read more

    source§

    fn chunk_by<K, F>(self, key: F) -> ChunkBy<K, Self, F>
    where Self: Sized, F: FnMut(&Self::Item) -> K, K: PartialEq,

    Return an iterable that can group iterator elements. Consecutive elements that map to the same key (“runs”), are assigned -to the same group. Read more
    source§

    fn chunks(self, size: usize) -> IntoChunks<Self>
    where - Self: Sized,

    Return an iterable that can chunk the iterator. Read more
    source§

    fn tuple_windows<T>(self) -> TupleWindows<Self, T> ⓘ
    where +to the same group. Read more

    source§

    fn group_by<K, F>(self, key: F) -> ChunkBy<K, Self, F>
    where + Self: Sized, + F: FnMut(&Self::Item) -> K, + K: PartialEq,

    👎Deprecated since 0.13.0: Use .chunk_by() instead
    See .chunk_by().
    source§

    fn chunks(self, size: usize) -> IntoChunks<Self>
    where + Self: Sized,

    Return an iterable that can chunk the iterator. Read more
    source§

    fn tuple_windows<T>(self) -> TupleWindows<Self, T> ⓘ
    where Self: Sized + Iterator<Item = T::Item>, T: HomogeneousTuple, T::Item: Clone,

    Return an iterator over all contiguous windows producing tuples of -a specific size (up to 12). Read more
    source§

    fn circular_tuple_windows<T>(self) -> CircularTupleWindows<Self, T> ⓘ
    where +a specific size (up to 12). Read more

    source§

    fn circular_tuple_windows<T>(self) -> CircularTupleWindows<Self, T> ⓘ
    where Self: Sized + Clone + Iterator<Item = T::Item> + ExactSizeIterator, T: TupleCollect + Clone, T::Item: Clone,

    Return an iterator over all windows, wrapping back to the first elements when the window would otherwise exceed the length of the -iterator, producing tuples of a specific size (up to 12). Read more
    source§

    fn tuples<T>(self) -> Tuples<Self, T> ⓘ
    where +iterator, producing tuples of a specific size (up to 12). Read more

    source§

    fn tuples<T>(self) -> Tuples<Self, T> ⓘ
    where Self: Sized + Iterator<Item = T::Item>, T: HomogeneousTuple,

    Return an iterator that groups the items in tuples of a specific size -(up to 12). Read more
    source§

    fn tee(self) -> (Tee<Self>, Tee<Self>)
    where +(up to 12). Read more

    source§

    fn tee(self) -> (Tee<Self>, Tee<Self>)
    where Self: Sized, Self::Item: Clone,

    Split into an iterator pair that both yield all elements from -the original iterator. Read more
    source§

    fn step(self, n: usize) -> Step<Self> ⓘ
    where - Self: Sized,

    👎Deprecated since 0.8.0: Use std .step_by() instead
    Return an iterator adaptor that steps n elements in the base iterator -for each iteration. Read more
    source§

    fn map_into<R>(self) -> MapInto<Self, R>
    where +the original iterator. Read more

    source§

    fn map_into<R>(self) -> MapInto<Self, R>
    where Self: Sized, - Self::Item: Into<R>,

    Convert each item of the iterator using the Into trait. Read more
    source§

    fn map_results<F, T, U, E>(self, f: F) -> MapOk<Self, F>
    where - Self: Iterator<Item = Result<T, E>> + Sized, - F: FnMut(T) -> U,

    👎Deprecated since 0.10.0: Use .map_ok() instead
    See .map_ok().
    source§

    fn map_ok<F, T, U, E>(self, f: F) -> MapOk<Self, F>
    where + Self::Item: Into<R>,

    Convert each item of the iterator using the Into trait. Read more
    source§

    fn map_ok<F, T, U, E>(self, f: F) -> MapOk<Self, F>
    where Self: Iterator<Item = Result<T, E>> + Sized, F: FnMut(T) -> U,

    Return an iterator adaptor that applies the provided closure to every Result::Ok value. Result::Err values are -unchanged. Read more
    source§

    fn filter_ok<F, T, E>(self, f: F) -> FilterOk<Self, F> ⓘ
    where +unchanged. Read more

    source§

    fn filter_ok<F, T, E>(self, f: F) -> FilterOk<Self, F> ⓘ
    where Self: Iterator<Item = Result<T, E>> + Sized, F: FnMut(&T) -> bool,

    Return an iterator adaptor that filters every Result::Ok value with the provided closure. Result::Err values are -unchanged. Read more
    source§

    fn filter_map_ok<F, T, U, E>(self, f: F) -> FilterMapOk<Self, F> ⓘ
    where +unchanged. Read more

    source§

    fn filter_map_ok<F, T, U, E>(self, f: F) -> FilterMapOk<Self, F> ⓘ
    where Self: Iterator<Item = Result<T, E>> + Sized, F: FnMut(T) -> Option<U>,

    Return an iterator adaptor that filters and transforms every Result::Ok value with the provided closure. Result::Err -values are unchanged. Read more
    source§

    fn flatten_ok<T, E>(self) -> FlattenOk<Self, T, E> ⓘ
    where +values are unchanged. Read more

    source§

    fn flatten_ok<T, E>(self) -> FlattenOk<Self, T, E> ⓘ
    where Self: Iterator<Item = Result<T, E>> + Sized, T: IntoIterator,

    Return an iterator adaptor that flattens every Result::Ok value into -a series of Result::Ok values. Result::Err values are unchanged. Read more
    source§

    fn process_results<F, T, E, R>(self, processor: F) -> Result<R, E>
    where +a series of Result::Ok values. Result::Err values are unchanged. Read more

    source§

    fn process_results<F, T, E, R>(self, processor: F) -> Result<R, E>
    where Self: Iterator<Item = Result<T, E>> + Sized, F: FnOnce(ProcessResults<'_, Self, E>) -> R,

    “Lift” a function of the values of the current iterator so as to process -an iterator of Result values instead. Read more
    source§

    fn merge<J>(self, other: J) -> Merge<Self, J::IntoIter>
    where +an iterator of Result values instead. Read more

    source§

    fn merge<J>(self, other: J) -> Merge<Self, J::IntoIter>
    where Self: Sized, Self::Item: PartialOrd, J: IntoIterator<Item = Self::Item>,

    Return an iterator adaptor that merges the two base iterators in ascending order. If both base iterators are sorted (ascending), the -result is sorted. Read more
    source§

    fn merge_by<J, F>(self, other: J, is_first: F) -> MergeBy<Self, J::IntoIter, F> ⓘ
    where +result is sorted. Read more

    source§

    fn merge_by<J, F>(self, other: J, is_first: F) -> MergeBy<Self, J::IntoIter, F> ⓘ
    where Self: Sized, J: IntoIterator<Item = Self::Item>, F: FnMut(&Self::Item, &Self::Item) -> bool,

    Return an iterator adaptor that merges the two base iterators in order. -This is much like .merge() but allows for a custom ordering. Read more
    source§

    fn merge_join_by<J, F, T>( +This is much like .merge() but allows for a custom ordering. Read more

    source§

    fn merge_join_by<J, F, T>( self, other: J, cmp_fn: F @@ -311,284 +312,295 @@ This is much like IntoIterator, F: FnMut(&Self::Item, &J::Item) -> T, Self: Sized,

    Create an iterator that merges items from both this and the specified -iterator in ascending order. Read more
    source§

    fn kmerge(self) -> KMerge<<Self::Item as IntoIterator>::IntoIter>
    where +iterator in ascending order. Read more

    source§

    fn kmerge(self) -> KMerge<<Self::Item as IntoIterator>::IntoIter>
    where Self: Sized, Self::Item: IntoIterator, <Self::Item as IntoIterator>::Item: PartialOrd,

    Return an iterator adaptor that flattens an iterator of iterators by -merging them in ascending order. Read more
    source§

    fn kmerge_by<F>( +merging them in ascending order. Read more

    source§

    fn kmerge_by<F>( self, first: F ) -> KMergeBy<<Self::Item as IntoIterator>::IntoIter, F> ⓘ
    where Self: Sized, Self::Item: IntoIterator, F: FnMut(&<Self::Item as IntoIterator>::Item, &<Self::Item as IntoIterator>::Item) -> bool,

    Return an iterator adaptor that flattens an iterator of iterators by -merging them according to the given closure. Read more
    source§

    fn cartesian_product<J>(self, other: J) -> Product<Self, J::IntoIter> ⓘ
    where +merging them according to the given closure. Read more

    source§

    fn cartesian_product<J>(self, other: J) -> Product<Self, J::IntoIter> ⓘ
    where Self: Sized, Self::Item: Clone, J: IntoIterator, J::IntoIter: Clone,

    Return an iterator adaptor that iterates over the cartesian product of -the element sets of two iterators self and J. Read more
    source§

    fn multi_cartesian_product( +the element sets of two iterators self and J. Read more

    source§

    fn multi_cartesian_product( self ) -> MultiProduct<<Self::Item as IntoIterator>::IntoIter> ⓘ
    where Self: Sized, Self::Item: IntoIterator, <Self::Item as IntoIterator>::IntoIter: Clone, <Self::Item as IntoIterator>::Item: Clone,

    Return an iterator adaptor that iterates over the cartesian product of -all subiterators returned by meta-iterator self. Read more
    source§

    fn coalesce<F>(self, f: F) -> Coalesce<Self, F>
    where +all subiterators returned by meta-iterator self. Read more

    source§

    fn coalesce<F>(self, f: F) -> Coalesce<Self, F>
    where Self: Sized, F: FnMut(Self::Item, Self::Item) -> Result<Self::Item, (Self::Item, Self::Item)>,

    Return an iterator adaptor that uses the passed-in closure to -optionally merge together consecutive elements. Read more
    source§

    fn dedup(self) -> Dedup<Self>
    where +optionally merge together consecutive elements. Read more

    source§

    fn dedup(self) -> Dedup<Self>
    where Self: Sized, Self::Item: PartialEq,

    Remove duplicates from sections of consecutive identical elements. -If the iterator is sorted, all elements will be unique. Read more
    source§

    fn dedup_by<Cmp>(self, cmp: Cmp) -> DedupBy<Self, Cmp>
    where +If the iterator is sorted, all elements will be unique. Read more

    source§

    fn dedup_by<Cmp>(self, cmp: Cmp) -> DedupBy<Self, Cmp>
    where Self: Sized, Cmp: FnMut(&Self::Item, &Self::Item) -> bool,

    Remove duplicates from sections of consecutive identical elements, determining equality using a comparison function. -If the iterator is sorted, all elements will be unique. Read more
    source§

    fn dedup_with_count(self) -> DedupWithCount<Self>
    where +If the iterator is sorted, all elements will be unique. Read more

    source§

    fn dedup_with_count(self) -> DedupWithCount<Self>
    where Self: Sized,

    Remove duplicates from sections of consecutive identical elements, while keeping a count of how many repeated elements were present. -If the iterator is sorted, all elements will be unique. Read more
    source§

    fn dedup_by_with_count<Cmp>(self, cmp: Cmp) -> DedupByWithCount<Self, Cmp>
    where +If the iterator is sorted, all elements will be unique. Read more

    source§

    fn dedup_by_with_count<Cmp>(self, cmp: Cmp) -> DedupByWithCount<Self, Cmp>
    where Self: Sized, Cmp: FnMut(&Self::Item, &Self::Item) -> bool,

    Remove duplicates from sections of consecutive identical elements, while keeping a count of how many repeated elements were present. This will determine equality using a comparison function. -If the iterator is sorted, all elements will be unique. Read more
    source§

    fn duplicates(self) -> Duplicates<Self>
    where +If the iterator is sorted, all elements will be unique. Read more

    source§

    fn duplicates(self) -> Duplicates<Self>
    where Self: Sized, Self::Item: Eq + Hash,

    Return an iterator adaptor that produces elements that appear more than once during the -iteration. Duplicates are detected using hash and equality. Read more
    source§

    fn duplicates_by<V, F>(self, f: F) -> DuplicatesBy<Self, V, F>
    where +iteration. Duplicates are detected using hash and equality. Read more

    source§

    fn duplicates_by<V, F>(self, f: F) -> DuplicatesBy<Self, V, F>
    where Self: Sized, V: Eq + Hash, F: FnMut(&Self::Item) -> V,

    Return an iterator adaptor that produces elements that appear more than once during the -iteration. Duplicates are detected using hash and equality. Read more
    source§

    fn unique(self) -> Unique<Self> ⓘ
    where +iteration. Duplicates are detected using hash and equality. Read more

    source§

    fn unique(self) -> Unique<Self> ⓘ
    where Self: Sized, Self::Item: Clone + Eq + Hash,

    Return an iterator adaptor that filters out elements that have already been produced once during the iteration. Duplicates -are detected using hash and equality. Read more
    source§

    fn unique_by<V, F>(self, f: F) -> UniqueBy<Self, V, F> ⓘ
    where +are detected using hash and equality. Read more

    source§

    fn unique_by<V, F>(self, f: F) -> UniqueBy<Self, V, F> ⓘ
    where Self: Sized, V: Eq + Hash, F: FnMut(&Self::Item) -> V,

    Return an iterator adaptor that filters out elements that have -already been produced once during the iteration. Read more
    source§

    fn peeking_take_while<F>(&mut self, accept: F) -> PeekingTakeWhile<'_, Self, F> ⓘ
    where +already been produced once during the iteration. Read more

    source§

    fn peeking_take_while<F>(&mut self, accept: F) -> PeekingTakeWhile<'_, Self, F> ⓘ
    where Self: Sized + PeekingNext, F: FnMut(&Self::Item) -> bool,

    Return an iterator adaptor that borrows from this iterator and -takes items while the closure accept returns true. Read more
    source§

    fn take_while_ref<F>(&mut self, accept: F) -> TakeWhileRef<'_, Self, F> ⓘ
    where +takes items while the closure accept returns true. Read more

    source§

    fn take_while_ref<F>(&mut self, accept: F) -> TakeWhileRef<'_, Self, F> ⓘ
    where Self: Clone, F: FnMut(&Self::Item) -> bool,

    Return an iterator adaptor that borrows from a Clone-able iterator -to only pick off elements while the predicate accept returns true. Read more
    source§

    fn take_while_inclusive<F>(self, accept: F) -> TakeWhileInclusive<Self, F> ⓘ
    where +to only pick off elements while the predicate accept returns true. Read more

    source§

    fn take_while_inclusive<F>(self, accept: F) -> TakeWhileInclusive<Self, F> ⓘ
    where Self: Sized, F: FnMut(&Self::Item) -> bool,

    Returns an iterator adaptor that consumes elements while the given predicate is true, including the element for which the predicate -first returned false. Read more
    source§

    fn while_some<A>(self) -> WhileSome<Self> ⓘ
    where +first returned false. Read more

    source§

    fn while_some<A>(self) -> WhileSome<Self> ⓘ
    where Self: Sized + Iterator<Item = Option<A>>,

    Return an iterator adaptor that filters Option<A> iterator elements -and produces A. Stops on the first None encountered. Read more
    source§

    fn tuple_combinations<T>(self) -> TupleCombinations<Self, T> ⓘ
    where +and produces A. Stops on the first None encountered. Read more

    source§

    fn tuple_combinations<T>(self) -> TupleCombinations<Self, T> ⓘ
    where Self: Sized + Clone, Self::Item: Clone, T: HasCombination<Self>,

    Return an iterator adaptor that iterates over the combinations of the -elements from an iterator. Read more
    source§

    fn combinations(self, k: usize) -> Combinations<Self> ⓘ
    where +elements from an iterator. Read more

    source§

    fn combinations(self, k: usize) -> Combinations<Self> ⓘ
    where Self: Sized, Self::Item: Clone,

    Return an iterator adaptor that iterates over the k-length combinations of -the elements from an iterator. Read more
    source§

    fn combinations_with_replacement( +the elements from an iterator. Read more

    source§

    fn combinations_with_replacement( self, k: usize ) -> CombinationsWithReplacement<Self> ⓘ
    where Self: Sized, Self::Item: Clone,

    Return an iterator that iterates over the k-length combinations of -the elements from an iterator, with replacement. Read more
    source§

    fn permutations(self, k: usize) -> Permutations<Self> ⓘ
    where +the elements from an iterator, with replacement. Read more

    source§

    fn permutations(self, k: usize) -> Permutations<Self> ⓘ
    where Self: Sized, Self::Item: Clone,

    Return an iterator adaptor that iterates over all k-permutations of the -elements from an iterator. Read more
    source§

    fn powerset(self) -> Powerset<Self> ⓘ
    where +elements from an iterator. Read more

    source§

    fn powerset(self) -> Powerset<Self> ⓘ
    where Self: Sized, Self::Item: Clone,

    Return an iterator that iterates through the powerset of the elements from an -iterator. Read more
    source§

    fn pad_using<F>(self, min: usize, f: F) -> PadUsing<Self, F> ⓘ
    where +iterator. Read more

    source§

    fn pad_using<F>(self, min: usize, f: F) -> PadUsing<Self, F> ⓘ
    where Self: Sized, F: FnMut(usize) -> Self::Item,

    Return an iterator adaptor that pads the sequence to a minimum length of -min by filling missing elements using a closure f. Read more
    source§

    fn with_position(self) -> WithPosition<Self> ⓘ
    where +min by filling missing elements using a closure f. Read more

    source§

    fn with_position(self) -> WithPosition<Self> ⓘ
    where Self: Sized,

    Return an iterator adaptor that combines each element with a Position to -ease special-case handling of the first or last elements. Read more
    source§

    fn positions<P>(self, predicate: P) -> Positions<Self, P> ⓘ
    where +ease special-case handling of the first or last elements. Read more

    source§

    fn positions<P>(self, predicate: P) -> Positions<Self, P> ⓘ
    where Self: Sized, P: FnMut(Self::Item) -> bool,

    Return an iterator adaptor that yields the indices of all elements -satisfying a predicate, counted from the start of the iterator. Read more
    source§

    fn update<F>(self, updater: F) -> Update<Self, F> ⓘ
    where +satisfying a predicate, counted from the start of the iterator. Read more

    source§

    fn update<F>(self, updater: F) -> Update<Self, F> ⓘ
    where Self: Sized, F: FnMut(&mut Self::Item),

    Return an iterator adaptor that applies a mutating function -to each element before yielding it. Read more
    source§

    fn next_tuple<T>(&mut self) -> Option<T>
    where +to each element before yielding it. Read more

    source§

    fn next_tuple<T>(&mut self) -> Option<T>
    where Self: Sized + Iterator<Item = T::Item>, T: HomogeneousTuple,

    Advances the iterator and returns the next items grouped in a tuple of -a specific size (up to 12). Read more
    source§

    fn collect_tuple<T>(self) -> Option<T>
    where +a specific size (up to 12). Read more

    source§

    fn collect_tuple<T>(self) -> Option<T>
    where Self: Sized + Iterator<Item = T::Item>, T: HomogeneousTuple,

    Collects all items from the iterator into a tuple of a specific size -(up to 12). Read more
    source§

    fn find_position<P>(&mut self, pred: P) -> Option<(usize, Self::Item)>
    where - P: FnMut(&Self::Item) -> bool,

    Find the position and value of the first element satisfying a predicate. Read more
    source§

    fn find_or_last<P>(self, predicate: P) -> Option<Self::Item>
    where +(up to 12). Read more

    source§

    fn find_position<P>(&mut self, pred: P) -> Option<(usize, Self::Item)>
    where + P: FnMut(&Self::Item) -> bool,

    Find the position and value of the first element satisfying a predicate. Read more
    source§

    fn find_or_last<P>(self, predicate: P) -> Option<Self::Item>
    where Self: Sized, - P: FnMut(&Self::Item) -> bool,

    Find the value of the first element satisfying a predicate or return the last element, if any. Read more
    source§

    fn find_or_first<P>(self, predicate: P) -> Option<Self::Item>
    where + P: FnMut(&Self::Item) -> bool,

    Find the value of the first element satisfying a predicate or return the last element, if any. Read more
    source§

    fn find_or_first<P>(self, predicate: P) -> Option<Self::Item>
    where Self: Sized, - P: FnMut(&Self::Item) -> bool,

    Find the value of the first element satisfying a predicate or return the first element, if any. Read more
    source§

    fn contains<Q>(&mut self, query: &Q) -> bool
    where + P: FnMut(&Self::Item) -> bool,

    Find the value of the first element satisfying a predicate or return the first element, if any. Read more
    source§

    fn contains<Q>(&mut self, query: &Q) -> bool
    where Self: Sized, Self::Item: Borrow<Q>, - Q: PartialEq,

    Returns true if the given item is present in this iterator. Read more
    source§

    fn all_equal(&mut self) -> bool
    where + Q: PartialEq,

    Returns true if the given item is present in this iterator. Read more
    source§

    fn all_equal(&mut self) -> bool
    where Self: Sized, - Self::Item: PartialEq,

    Check whether all elements compare equal. Read more
    source§

    fn all_equal_value( + Self::Item: PartialEq,

    Check whether all elements compare equal. Read more
    source§

    fn all_equal_value( &mut self ) -> Result<Self::Item, Option<(Self::Item, Self::Item)>>
    where Self: Sized, Self::Item: PartialEq,

    If there are elements and they are all equal, return a single copy of that element. If there are no elements, return an Error containing None. If there are elements and they are not all equal, return a tuple containing the first -two non-equal elements found. Read more
    source§

    fn all_unique(&mut self) -> bool
    where +two non-equal elements found. Read more

    source§

    fn all_unique(&mut self) -> bool
    where Self: Sized, - Self::Item: Eq + Hash,

    Check whether all elements are unique (non equal). Read more
    source§

    fn dropping(self, n: usize) -> Self
    where + Self::Item: Eq + Hash,

    Check whether all elements are unique (non equal). Read more
    source§

    fn dropping(self, n: usize) -> Self
    where Self: Sized,

    Consume the first n elements from the iterator eagerly, -and return the same iterator again. Read more
    source§

    fn dropping_back(self, n: usize) -> Self
    where +and return the same iterator again. Read more

    source§

    fn dropping_back(self, n: usize) -> Self
    where Self: Sized + DoubleEndedIterator,

    Consume the last n elements from the iterator eagerly, -and return the same iterator again. Read more
    source§

    fn foreach<F>(self, f: F)
    where - F: FnMut(Self::Item), - Self: Sized,

    👎Deprecated since 0.8.0: Use .for_each() instead
    Run the closure f eagerly on each element of the iterator. Read more
    source§

    fn concat(self) -> Self::Item
    where +and return the same iterator again. Read more

    source§

    fn concat(self) -> Self::Item
    where Self: Sized, - Self::Item: Extend<<<Self as Iterator>::Item as IntoIterator>::Item> + IntoIterator + Default,

    Combine all an iterator’s elements into one element by using Extend. Read more
    source§

    fn collect_vec(self) -> Vec<Self::Item>
    where + Self::Item: Extend<<<Self as Iterator>::Item as IntoIterator>::Item> + IntoIterator + Default,

    Combine all an iterator’s elements into one element by using Extend. Read more
    source§

    fn collect_vec(self) -> Vec<Self::Item>
    where Self: Sized,

    .collect_vec() is simply a type specialization of Iterator::collect, -for convenience.
    source§

    fn try_collect<T, U, E>(self) -> Result<U, E>
    where +for convenience.

    source§

    fn try_collect<T, U, E>(self) -> Result<U, E>
    where Self: Sized + Iterator<Item = Result<T, E>>, Result<U, E>: FromIterator<Result<T, E>>,

    .try_collect() is more convenient way of writing -.collect::<Result<_, _>>() Read more
    source§

    fn set_from<'a, A: 'a, J>(&mut self, from: J) -> usize
    where +.collect::<Result<_, _>>() Read more

    source§

    fn set_from<'a, A: 'a, J>(&mut self, from: J) -> usize
    where Self: Iterator<Item = &'a mut A>, J: IntoIterator<Item = A>,

    Assign to each reference in self from the from iterator, -stopping at the shortest of the two iterators. Read more
    source§

    fn join(&mut self, sep: &str) -> String
    where - Self::Item: Display,

    Combine all iterator elements into one String, separated by sep. Read more
    source§

    fn format(self, sep: &str) -> Format<'_, Self>
    where - Self: Sized,

    Format all iterator elements, separated by sep. Read more
    source§

    fn format_with<F>(self, sep: &str, format: F) -> FormatWith<'_, Self, F>
    where +stopping at the shortest of the two iterators. Read more

    source§

    fn join(&mut self, sep: &str) -> String
    where + Self::Item: Display,

    Combine all iterator elements into one String, separated by sep. Read more
    source§

    fn format(self, sep: &str) -> Format<'_, Self>
    where + Self: Sized,

    Format all iterator elements, separated by sep. Read more
    source§

    fn format_with<F>(self, sep: &str, format: F) -> FormatWith<'_, Self, F>
    where Self: Sized, - F: FnMut(Self::Item, &mut dyn FnMut(&dyn Display) -> Result) -> Result,

    Format all iterator elements, separated by sep. Read more
    source§

    fn fold_results<A, E, B, F>(&mut self, start: B, f: F) -> Result<B, E>
    where + F: FnMut(Self::Item, &mut dyn FnMut(&dyn Display) -> Result) -> Result,

    Format all iterator elements, separated by sep. Read more
    source§

    fn fold_ok<A, E, B, F>(&mut self, start: B, f: F) -> Result<B, E>
    where Self: Iterator<Item = Result<A, E>>, - F: FnMut(B, A) -> B,

    👎Deprecated since 0.10.0: Use .fold_ok() instead
    See .fold_ok().
    source§

    fn fold_ok<A, E, B, F>(&mut self, start: B, f: F) -> Result<B, E>
    where - Self: Iterator<Item = Result<A, E>>, - F: FnMut(B, A) -> B,

    Fold Result values from an iterator. Read more
    source§

    fn fold_options<A, B, F>(&mut self, start: B, f: F) -> Option<B>
    where + F: FnMut(B, A) -> B,

    Fold Result values from an iterator. Read more
    source§

    fn fold_options<A, B, F>(&mut self, start: B, f: F) -> Option<B>
    where Self: Iterator<Item = Option<A>>, - F: FnMut(B, A) -> B,

    Fold Option values from an iterator. Read more
    source§

    fn fold1<F>(self, f: F) -> Option<Self::Item>
    where + F: FnMut(B, A) -> B,

    Fold Option values from an iterator. Read more
    source§

    fn fold1<F>(self, f: F) -> Option<Self::Item>
    where F: FnMut(Self::Item, Self::Item) -> Self::Item, - Self: Sized,

    👎Deprecated since 0.10.2: Use Iterator::reduce instead
    Accumulator of the elements in the iterator. Read more
    source§

    fn tree_fold1<F>(self, f: F) -> Option<Self::Item>
    where + Self: Sized,

    👎Deprecated since 0.10.2: Use Iterator::reduce instead
    Accumulator of the elements in the iterator. Read more
    source§

    fn tree_reduce<F>(self, f: F) -> Option<Self::Item>
    where F: FnMut(Self::Item, Self::Item) -> Self::Item, - Self: Sized,

    Accumulate the elements in the iterator in a tree-like manner. Read more
    source§

    fn fold_while<B, F>(&mut self, init: B, f: F) -> FoldWhile<B>
    where + Self: Sized,

    Accumulate the elements in the iterator in a tree-like manner. Read more
    source§

    fn tree_fold1<F>(self, f: F) -> Option<Self::Item>
    where + F: FnMut(Self::Item, Self::Item) -> Self::Item, + Self: Sized,

    👎Deprecated since 0.13.0: Use .tree_reduce() instead
    See .tree_reduce().
    source§

    fn fold_while<B, F>(&mut self, init: B, f: F) -> FoldWhile<B>
    where Self: Sized, - F: FnMut(B, Self::Item) -> FoldWhile<B>,

    An iterator method that applies a function, producing a single, final value. Read more
    source§

    fn sum1<S>(self) -> Option<S>
    where + F: FnMut(B, Self::Item) -> FoldWhile<B>,

    An iterator method that applies a function, producing a single, final value. Read more
    source§

    fn sum1<S>(self) -> Option<S>
    where Self: Sized, - S: Sum<Self::Item>,

    Iterate over the entire iterator and add all the elements. Read more
    source§

    fn product1<P>(self) -> Option<P>
    where + S: Sum<Self::Item>,

    Iterate over the entire iterator and add all the elements. Read more
    source§

    fn product1<P>(self) -> Option<P>
    where Self: Sized, - P: Product<Self::Item>,

    Iterate over the entire iterator and multiply all the elements. Read more
    source§

    fn sorted_unstable(self) -> IntoIter<Self::Item> ⓘ
    where + P: Product<Self::Item>,

    Iterate over the entire iterator and multiply all the elements. Read more
    source§

    fn sorted_unstable(self) -> IntoIter<Self::Item> ⓘ
    where Self: Sized, - Self::Item: Ord,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_unstable_by<F>(self, cmp: F) -> IntoIter<Self::Item> ⓘ
    where + Self::Item: Ord,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_unstable_by<F>(self, cmp: F) -> IntoIter<Self::Item> ⓘ
    where Self: Sized, - F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_unstable_by_key<K, F>(self, f: F) -> IntoIter<Self::Item> ⓘ
    where + F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_unstable_by_key<K, F>(self, f: F) -> IntoIter<Self::Item> ⓘ
    where Self: Sized, K: Ord, - F: FnMut(&Self::Item) -> K,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted(self) -> IntoIter<Self::Item> ⓘ
    where + F: FnMut(&Self::Item) -> K,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted(self) -> IntoIter<Self::Item> ⓘ
    where Self: Sized, - Self::Item: Ord,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_by<F>(self, cmp: F) -> IntoIter<Self::Item> ⓘ
    where + Self::Item: Ord,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_by<F>(self, cmp: F) -> IntoIter<Self::Item> ⓘ
    where Self: Sized, - F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_by_key<K, F>(self, f: F) -> IntoIter<Self::Item> ⓘ
    where + F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_by_key<K, F>(self, f: F) -> IntoIter<Self::Item> ⓘ
    where Self: Sized, K: Ord, - F: FnMut(&Self::Item) -> K,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_by_cached_key<K, F>(self, f: F) -> IntoIter<Self::Item> ⓘ
    where + F: FnMut(&Self::Item) -> K,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_by_cached_key<K, F>(self, f: F) -> IntoIter<Self::Item> ⓘ
    where Self: Sized, K: Ord, F: FnMut(&Self::Item) -> K,

    Sort all iterator elements into a new iterator in ascending order. The key function is -called exactly once per key. Read more
    source§

    fn k_smallest(self, k: usize) -> IntoIter<Self::Item> ⓘ
    where +called exactly once per key. Read more

    source§

    fn k_smallest(self, k: usize) -> IntoIter<Self::Item> ⓘ
    where Self: Sized, - Self::Item: Ord,

    Sort the k smallest elements into a new iterator, in ascending order. Read more
    source§

    fn partition_map<A, B, F, L, R>(self, predicate: F) -> (A, B)
    where + Self::Item: Ord,

    Sort the k smallest elements into a new iterator, in ascending order. Read more
    source§

    fn k_smallest_by<F>(self, k: usize, cmp: F) -> IntoIter<Self::Item> ⓘ
    where + Self: Sized, + F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Sort the k smallest elements into a new iterator using the provided comparison. Read more
    source§

    fn k_smallest_by_key<F, K>(self, k: usize, key: F) -> IntoIter<Self::Item> ⓘ
    where + Self: Sized, + F: FnMut(&Self::Item) -> K, + K: Ord,

    Return the elements producing the k smallest outputs of the provided function. Read more
    source§

    fn k_largest(self, k: usize) -> IntoIter<Self::Item> ⓘ
    where + Self: Sized, + Self::Item: Ord,

    Sort the k largest elements into a new iterator, in descending order. Read more
    source§

    fn k_largest_by<F>(self, k: usize, cmp: F) -> IntoIter<Self::Item> ⓘ
    where + Self: Sized, + F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Sort the k largest elements into a new iterator using the provided comparison. Read more
    source§

    fn k_largest_by_key<F, K>(self, k: usize, key: F) -> IntoIter<Self::Item> ⓘ
    where + Self: Sized, + F: FnMut(&Self::Item) -> K, + K: Ord,

    Return the elements producing the k largest outputs of the provided function. Read more
    source§

    fn tail(self, n: usize) -> IntoIter<Self::Item> ⓘ
    where + Self: Sized,

    Consumes the iterator and return an iterator of the last n elements. Read more
    source§

    fn partition_map<A, B, F, L, R>(self, predicate: F) -> (A, B)
    where Self: Sized, F: FnMut(Self::Item) -> Either<L, R>, A: Default + Extend<L>, B: Default + Extend<R>,

    Collect all iterator elements into one of two partitions. Unlike Iterator::partition, each partition may -have a distinct type. Read more
    source§

    fn partition_result<A, B, T, E>(self) -> (A, B)
    where +have a distinct type. Read more

    source§

    fn partition_result<A, B, T, E>(self) -> (A, B)
    where Self: Iterator<Item = Result<T, E>> + Sized, A: Default + Extend<T>, B: Default + Extend<E>,

    Partition a sequence of Results into one list of all the Ok elements -and another list of all the Err elements. Read more
    source§

    fn into_group_map<K, V>(self) -> HashMap<K, Vec<V>>
    where +and another list of all the Err elements. Read more

    source§

    fn into_group_map<K, V>(self) -> HashMap<K, Vec<V>>
    where Self: Iterator<Item = (K, V)> + Sized, K: Hash + Eq,

    Return a HashMap of keys mapped to Vecs of values. Keys and values -are taken from (Key, Value) tuple pairs yielded by the input iterator. Read more
    source§

    fn into_group_map_by<K, V, F>(self, f: F) -> HashMap<K, Vec<V>>
    where +are taken from (Key, Value) tuple pairs yielded by the input iterator. Read more

    source§

    fn into_group_map_by<K, V, F>(self, f: F) -> HashMap<K, Vec<V>>
    where Self: Iterator<Item = V> + Sized, K: Hash + Eq, - F: Fn(&V) -> K,

    Return an Iterator on a HashMap. Keys mapped to Vecs of values. The key is specified -in the closure. Read more
    source§

    fn into_grouping_map<K, V>(self) -> GroupingMap<Self>
    where + F: FnMut(&V) -> K,

    Return an Iterator on a HashMap. Keys mapped to Vecs of values. The key is specified +in the closure. Read more
    source§

    fn into_grouping_map<K, V>(self) -> GroupingMap<Self>
    where Self: Iterator<Item = (K, V)> + Sized, K: Hash + Eq,

    Constructs a GroupingMap to be used later with one of the efficient -group-and-fold operations it allows to perform. Read more
    source§

    fn into_grouping_map_by<K, V, F>(self, key_mapper: F) -> GroupingMapBy<Self, F>
    where +group-and-fold operations it allows to perform. Read more

    source§

    fn into_grouping_map_by<K, V, F>(self, key_mapper: F) -> GroupingMapBy<Self, F>
    where Self: Iterator<Item = V> + Sized, K: Hash + Eq, F: FnMut(&V) -> K,

    Constructs a GroupingMap to be used later with one of the efficient -group-and-fold operations it allows to perform. Read more
    source§

    fn min_set(self) -> Vec<Self::Item>
    where +group-and-fold operations it allows to perform. Read more

    source§

    fn min_set(self) -> Vec<Self::Item>
    where Self: Sized, - Self::Item: Ord,

    Return all minimum elements of an iterator. Read more
    source§

    fn min_set_by<F>(self, compare: F) -> Vec<Self::Item>
    where + Self::Item: Ord,

    Return all minimum elements of an iterator. Read more
    source§

    fn min_set_by<F>(self, compare: F) -> Vec<Self::Item>
    where Self: Sized, F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Return all minimum elements of an iterator, as determined by -the specified function. Read more
    source§

    fn min_set_by_key<K, F>(self, key: F) -> Vec<Self::Item>
    where +the specified function. Read more

    source§

    fn min_set_by_key<K, F>(self, key: F) -> Vec<Self::Item>
    where Self: Sized, K: Ord, F: FnMut(&Self::Item) -> K,

    Return all minimum elements of an iterator, as determined by -the specified function. Read more
    source§

    fn max_set(self) -> Vec<Self::Item>
    where +the specified function. Read more

    source§

    fn max_set(self) -> Vec<Self::Item>
    where Self: Sized, - Self::Item: Ord,

    Return all maximum elements of an iterator. Read more
    source§

    fn max_set_by<F>(self, compare: F) -> Vec<Self::Item>
    where + Self::Item: Ord,

    Return all maximum elements of an iterator. Read more
    source§

    fn max_set_by<F>(self, compare: F) -> Vec<Self::Item>
    where Self: Sized, F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Return all maximum elements of an iterator, as determined by -the specified function. Read more
    source§

    fn max_set_by_key<K, F>(self, key: F) -> Vec<Self::Item>
    where +the specified function. Read more

    source§

    fn max_set_by_key<K, F>(self, key: F) -> Vec<Self::Item>
    where Self: Sized, K: Ord, F: FnMut(&Self::Item) -> K,

    Return all maximum elements of an iterator, as determined by -the specified function. Read more
    source§

    fn minmax(self) -> MinMaxResult<Self::Item>
    where +the specified function. Read more

    source§

    fn minmax(self) -> MinMaxResult<Self::Item>
    where Self: Sized, - Self::Item: PartialOrd,

    Return the minimum and maximum elements in the iterator. Read more
    source§

    fn minmax_by_key<K, F>(self, key: F) -> MinMaxResult<Self::Item>
    where + Self::Item: PartialOrd,

    Return the minimum and maximum elements in the iterator. Read more
    source§

    fn minmax_by_key<K, F>(self, key: F) -> MinMaxResult<Self::Item>
    where Self: Sized, K: PartialOrd, F: FnMut(&Self::Item) -> K,

    Return the minimum and maximum element of an iterator, as determined by -the specified function. Read more
    source§

    fn minmax_by<F>(self, compare: F) -> MinMaxResult<Self::Item>
    where +the specified function. Read more

    source§

    fn minmax_by<F>(self, compare: F) -> MinMaxResult<Self::Item>
    where Self: Sized, F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Return the minimum and maximum element of an iterator, as determined by -the specified comparison function. Read more
    source§

    fn position_max(self) -> Option<usize>
    where +the specified comparison function. Read more

    source§

    fn position_max(self) -> Option<usize>
    where Self: Sized, - Self::Item: Ord,

    Return the position of the maximum element in the iterator. Read more
    source§

    fn position_max_by_key<K, F>(self, key: F) -> Option<usize>
    where + Self::Item: Ord,

    Return the position of the maximum element in the iterator. Read more
    source§

    fn position_max_by_key<K, F>(self, key: F) -> Option<usize>
    where Self: Sized, K: Ord, F: FnMut(&Self::Item) -> K,

    Return the position of the maximum element in the iterator, as -determined by the specified function. Read more
    source§

    fn position_max_by<F>(self, compare: F) -> Option<usize>
    where +determined by the specified function. Read more

    source§

    fn position_max_by<F>(self, compare: F) -> Option<usize>
    where Self: Sized, F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Return the position of the maximum element in the iterator, as -determined by the specified comparison function. Read more
    source§

    fn position_min(self) -> Option<usize>
    where +determined by the specified comparison function. Read more

    source§

    fn position_min(self) -> Option<usize>
    where Self: Sized, - Self::Item: Ord,

    Return the position of the minimum element in the iterator. Read more
    source§

    fn position_min_by_key<K, F>(self, key: F) -> Option<usize>
    where + Self::Item: Ord,

    Return the position of the minimum element in the iterator. Read more
    source§

    fn position_min_by_key<K, F>(self, key: F) -> Option<usize>
    where Self: Sized, K: Ord, F: FnMut(&Self::Item) -> K,

    Return the position of the minimum element in the iterator, as -determined by the specified function. Read more
    source§

    fn position_min_by<F>(self, compare: F) -> Option<usize>
    where +determined by the specified function. Read more

    source§

    fn position_min_by<F>(self, compare: F) -> Option<usize>
    where Self: Sized, F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Return the position of the minimum element in the iterator, as -determined by the specified comparison function. Read more
    source§

    fn position_minmax(self) -> MinMaxResult<usize>
    where +determined by the specified comparison function. Read more

    source§

    fn position_minmax(self) -> MinMaxResult<usize>
    where Self: Sized, Self::Item: PartialOrd,

    Return the positions of the minimum and maximum elements in -the iterator. Read more
    source§

    fn position_minmax_by_key<K, F>(self, key: F) -> MinMaxResult<usize>
    where +the iterator. Read more

    source§

    fn position_minmax_by_key<K, F>(self, key: F) -> MinMaxResult<usize>
    where Self: Sized, K: PartialOrd, F: FnMut(&Self::Item) -> K,

    Return the postions of the minimum and maximum elements of an -iterator, as determined by the specified function. Read more
    source§

    fn position_minmax_by<F>(self, compare: F) -> MinMaxResult<usize>
    where +iterator, as determined by the specified function. Read more

    source§

    fn position_minmax_by<F>(self, compare: F) -> MinMaxResult<usize>
    where Self: Sized, F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Return the postions of the minimum and maximum elements of an -iterator, as determined by the specified comparison function. Read more
    source§

    fn exactly_one(self) -> Result<Self::Item, ExactlyOneError<Self>>
    where +iterator, as determined by the specified comparison function. Read more

    source§

    fn exactly_one(self) -> Result<Self::Item, ExactlyOneError<Self>>
    where Self: Sized,

    If the iterator yields exactly one element, that element will be returned, otherwise an error will be returned containing an iterator that has the same output as the input -iterator. Read more
    source§

    fn at_most_one(self) -> Result<Option<Self::Item>, ExactlyOneError<Self>>
    where - Self: Sized,

    If the iterator yields no elements, Ok(None) will be returned. If the iterator yields +iterator. Read more
    source§

    fn at_most_one(self) -> Result<Option<Self::Item>, ExactlyOneError<Self>>
    where + Self: Sized,

    If the iterator yields no elements, Ok(None) will be returned. If the iterator yields exactly one element, that element will be returned, otherwise an error will be returned -containing an iterator that has the same output as the input iterator. Read more
    source§

    fn multipeek(self) -> MultiPeek<Self> ⓘ
    where +containing an iterator that has the same output as the input iterator. Read more

    source§

    fn multipeek(self) -> MultiPeek<Self> ⓘ
    where Self: Sized,

    An iterator adaptor that allows the user to peek at multiple .next() -values without advancing the base iterator. Read more
    source§

    fn counts(self) -> HashMap<Self::Item, usize>
    where +values without advancing the base iterator. Read more

    source§

    fn counts(self) -> HashMap<Self::Item, usize>
    where Self: Sized, Self::Item: Eq + Hash,

    Collect the items in this iterator and return a HashMap which contains each item that appears in the iterator and the number -of times it appears. Read more
    source§

    fn counts_by<K, F>(self, f: F) -> HashMap<K, usize>
    where +of times it appears. Read more

    source§

    fn counts_by<K, F>(self, f: F) -> HashMap<K, usize>
    where Self: Sized, K: Eq + Hash, F: FnMut(Self::Item) -> K,

    Collect the items in this iterator and return a HashMap which contains each item that appears in the iterator and the number of times it appears, -determining identity using a keying function. Read more
    source§

    fn multiunzip<FromI>(self) -> FromI
    where - Self: Sized + MultiUnzip<FromI>,

    Converts an iterator of tuples into a tuple of containers. Read more
    source§

    fn try_len(&self) -> Result<usize, (usize, Option<usize>)>

    Returns the length of the iterator if one exists. +determining identity using a keying function. Read more
    source§

    fn multiunzip<FromI>(self) -> FromI
    where + Self: Sized + MultiUnzip<FromI>,

    Converts an iterator of tuples into a tuple of containers. Read more
    source§

    fn try_len(&self) -> Result<usize, (usize, Option<usize>)>

    Returns the length of the iterator if one exists. Otherwise return self.size_hint(). Read more
    source§

    impl<IT> MultiUnzip<()> for IT
    where IT: Iterator<Item = ()>,

    source§

    fn multiunzip(self)

    Unzip this iterator into multiple collections.
    source§

    impl<IT, A, FromA> MultiUnzip<(FromA,)> for IT
    where IT: Iterator<Item = (A,)>, @@ -691,4 +703,4 @@ Otherwise return self.size_hint(). (FromA, FromB, FromC, FromD, FromE, FromF, FromG, FromH, FromI, FromJ, FromK, FromL)

    Unzip this iterator into multiple collections.
    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 + 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/itertools/structs/struct.IntoChunks.html b/itertools/structs/struct.IntoChunks.html index 5984692f3..5825e9404 100644 --- a/itertools/structs/struct.IntoChunks.html +++ b/itertools/structs/struct.IntoChunks.html @@ -1,7 +1,7 @@ -IntoChunks in itertools::structs - Rust
    -

    Struct itertools::structs::IntoChunks

    source · 
    pub struct IntoChunks<I>
    where
+IntoChunks in itertools::structs - Rust
    
+    
    Struct itertools::structs::IntoChunks
    source · 
    pub struct IntoChunks<I>
    where
     I: Iterator,
    { /* private fields */ }
    Expand description
    ChunkLazy is the storage for a lazy chunking operation.
    
-
    IntoChunks behaves just like GroupBy: it is iterable, and
+
    IntoChunks behaves just like ChunkBy: it is iterable, and
 it only buffers if several chunk iterators are alive at the same time.
    
 
    This type implements IntoIterator (it is not an iterator
 itself), because the chunk iterators need to borrow from this
@@ -9,11 +9,11 @@ value. It should be stored in a local variable or temporary and
 iterated.
    
 
    Iterator element type is Chunk, each chunk’s iterator.
    
 
    See .chunks() for more information.
    
-
    Trait Implementations§
    source§
    impl<I> Clone for IntoChunks<I>
    where
+
    Trait Implementations§
    source§
    impl<I> Clone for IntoChunks<I>
    where
     I: Clone + Iterator,
-    I::Item: 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<'a, I> IntoIterator for &'a IntoChunks<I>
    where
+    I::Item: 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<'a, I> IntoIterator for &'a IntoChunks<I>
    where
     I: Iterator,
-    I::Item: 'a,
    §
    type Item = Chunk<'a, I>
    The type of the elements being iterated over.
    §
    type IntoIter = Chunks<'a, I>
    Which kind of iterator are we turning this into?
    source§
    fn into_iter(self) -> Self::IntoIter
    Creates an iterator from a value. Read more
    Auto Trait Implementations§
    §
    impl<I> !Freeze for IntoChunks<I>
    §
    impl<I> !RefUnwindSafe for IntoChunks<I>
    §
    impl<I> Send for IntoChunks<I>
    where
+    I::Item: 'a,
    §
    type Item = Chunk<'a, I>
    The type of the elements being iterated over.
    §
    type IntoIter = Chunks<'a, I>
    Which kind of iterator are we turning this into?
    source§
    fn into_iter(self) -> Self::IntoIter
    Creates an iterator from a value. Read more
    Auto Trait Implementations§
    §
    impl<I> !Freeze for IntoChunks<I>
    §
    impl<I> !RefUnwindSafe for IntoChunks<I>
    §
    impl<I> Send for IntoChunks<I>
    where
     I: Send,
     <I as Iterator>::Item: Send,
    §
    impl<I> !Sync for IntoChunks<I>
    §
    impl<I> Unpin for IntoChunks<I>
    where
     I: Unpin,
diff --git a/itertools/structs/struct.Iterate.html b/itertools/structs/struct.Iterate.html
index 8dd9c2822..a5f54f160 100644
--- a/itertools/structs/struct.Iterate.html
+++ b/itertools/structs/struct.Iterate.html
@@ -1,10 +1,10 @@
-Iterate in itertools::structs - Rust
    
-    
    Struct itertools::structs::Iterate
    source · 
    pub struct Iterate<St, F> { /* private fields */ }
    Expand description
    An iterator that infinitely applies function to value and yields results.
    
+Iterate in itertools::structs - Rust
    
+    
    Struct itertools::structs::Iterate
    source · 
    pub struct Iterate<St, F> { /* private fields */ }
    Expand description
    An iterator that infinitely applies function to value and yields results.
    
 
    This struct is created by the iterate() function.
 See its documentation for more.
    
-
    Trait Implementations§
    source§
    impl<St: Clone, F: Clone> Clone for Iterate<St, F>
    source§
    fn clone(&self) -> Iterate<St, F> ⓘ
    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<St, F> Debug for Iterate<St, F>
    where
-    St: Debug,
    source§
    fn fmt(&self, f: &mut Formatter<'_>) -> Result
    Formats the value using the given formatter. Read more
    source§
    impl<St, F> Iterator for Iterate<St, F>
    where
-    F: FnMut(&St) -> St,
    §
    type Item = St
    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>(
+
    Trait Implementations§
    source§
    impl<St: Clone, F: Clone> Clone for Iterate<St, F>
    source§
    fn clone(&self) -> Iterate<St, F> ⓘ
    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<St, F> Debug for Iterate<St, F>
    where
+    St: Debug,
    source§
    fn fmt(&self, f: &mut Formatter<'_>) -> Result
    Formats the value using the given formatter. Read more
    source§
    impl<St, F> Iterator for Iterate<St, F>
    where
+    F: FnMut(&St) -> St,
    §
    type Item = St
    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
@@ -209,86 +209,87 @@ otherwise. Right variant of Either<Self, Self>
 otherwise. Read more
    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> Itertools for T
    where
-    T: Iterator + ?Sized,
    source§
    fn interleave<J>(self, other: J) -> Interleave<Self, J::IntoIter> ⓘ
    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> Itertools for T
    where
+    T: Iterator + ?Sized,
    source§
    fn interleave<J>(self, other: J) -> Interleave<Self, J::IntoIter> ⓘ
    where
     J: IntoIterator<Item = Self::Item>,
-    Self: Sized,
    Alternate elements from two iterators until both have run out. Read more
    source§
    fn interleave_shortest<J>(
+    Self: Sized,
    Alternate elements from two iterators until both have run out. Read more
    source§
    fn interleave_shortest<J>(
     self,
     other: J
 ) -> InterleaveShortest<Self, J::IntoIter> ⓘ
    where
     J: IntoIterator<Item = Self::Item>,
     Self: Sized,
    Alternate elements from two iterators until at least one of them has run
-out. Read more
    source§
    fn intersperse(self, element: Self::Item) -> Intersperse<Self>
    where
+out. Read more
    source§
    fn intersperse(self, element: Self::Item) -> Intersperse<Self>
    where
     Self: Sized,
     Self::Item: Clone,
    An iterator adaptor to insert a particular value
-between each element of the adapted iterator. Read more
    source§
    fn intersperse_with<F>(self, element: F) -> IntersperseWith<Self, F> ⓘ
    where
+between each element of the adapted iterator. Read more
    source§
    fn intersperse_with<F>(self, element: F) -> IntersperseWith<Self, F> ⓘ
    where
     Self: Sized,
     F: FnMut() -> Self::Item,
    An iterator adaptor to insert a particular value created by a function
-between each element of the adapted iterator. Read more
    source§
    fn zip_longest<J>(self, other: J) -> ZipLongest<Self, J::IntoIter> ⓘ
    where
+between each element of the adapted iterator. Read more
    source§
    fn get<R>(self, index: R) -> R::Output
    where
+    Self: Sized,
+    R: IteratorIndex<Self>,
    Returns an iterator over a subsection of the iterator. Read more
    source§
    fn zip_longest<J>(self, other: J) -> ZipLongest<Self, J::IntoIter> ⓘ
    where
     J: IntoIterator,
     Self: Sized,
    Create an iterator which iterates over both this and the specified
-iterator simultaneously, yielding pairs of two optional elements. Read more
    source§
    fn zip_eq<J>(self, other: J) -> ZipEq<Self, J::IntoIter> ⓘ
    where
+iterator simultaneously, yielding pairs of two optional elements. Read more
    source§
    fn zip_eq<J>(self, other: J) -> ZipEq<Self, J::IntoIter> ⓘ
    where
     J: IntoIterator,
     Self: Sized,
    Create an iterator which iterates over both this and the specified
-iterator simultaneously, yielding pairs of elements. Read more
    source§
    fn batching<B, F>(self, f: F) -> Batching<Self, F> ⓘ
    where
+iterator simultaneously, yielding pairs of elements. Read more
    source§
    fn batching<B, F>(self, f: F) -> Batching<Self, F> ⓘ
    where
     F: FnMut(&mut Self) -> Option<B>,
     Self: Sized,
    A “meta iterator adaptor”. Its closure receives a reference to the
 iterator and may pick off as many elements as it likes, to produce the
-next iterator element. Read more
    source§
    fn group_by<K, F>(self, key: F) -> GroupBy<K, Self, F>
    where
+next iterator element. Read more
    source§
    fn chunk_by<K, F>(self, key: F) -> ChunkBy<K, Self, F>
    where
     Self: Sized,
     F: FnMut(&Self::Item) -> K,
     K: PartialEq,
    Return an iterable that can group iterator elements.
 Consecutive elements that map to the same key (“runs”), are assigned
-to the same group. Read more
    source§
    fn chunks(self, size: usize) -> IntoChunks<Self>
    where
-    Self: Sized,
    Return an iterable that can chunk the iterator. Read more
    source§
    fn tuple_windows<T>(self) -> TupleWindows<Self, T> ⓘ
    where
+to the same group. Read more
    source§
    fn group_by<K, F>(self, key: F) -> ChunkBy<K, Self, F>
    where
+    Self: Sized,
+    F: FnMut(&Self::Item) -> K,
+    K: PartialEq,
    👎Deprecated since 0.13.0: Use .chunk_by() instead
    See .chunk_by().
    source§
    fn chunks(self, size: usize) -> IntoChunks<Self>
    where
+    Self: Sized,
    Return an iterable that can chunk the iterator. Read more
    source§
    fn tuple_windows<T>(self) -> TupleWindows<Self, T> ⓘ
    where
     Self: Sized + Iterator<Item = T::Item>,
     T: HomogeneousTuple,
     T::Item: Clone,
    Return an iterator over all contiguous windows producing tuples of
-a specific size (up to 12). Read more
    source§
    fn circular_tuple_windows<T>(self) -> CircularTupleWindows<Self, T> ⓘ
    where
+a specific size (up to 12). Read more
    source§
    fn circular_tuple_windows<T>(self) -> CircularTupleWindows<Self, T> ⓘ
    where
     Self: Sized + Clone + Iterator<Item = T::Item> + ExactSizeIterator,
     T: TupleCollect + Clone,
     T::Item: Clone,
    Return an iterator over all windows, wrapping back to the first
 elements when the window would otherwise exceed the length of the
-iterator, producing tuples of a specific size (up to 12). Read more
    source§
    fn tuples<T>(self) -> Tuples<Self, T> ⓘ
    where
+iterator, producing tuples of a specific size (up to 12). Read more
    source§
    fn tuples<T>(self) -> Tuples<Self, T> ⓘ
    where
     Self: Sized + Iterator<Item = T::Item>,
     T: HomogeneousTuple,
    Return an iterator that groups the items in tuples of a specific size
-(up to 12). Read more
    source§
    fn tee(self) -> (Tee<Self>, Tee<Self>)
    where
+(up to 12). Read more
    source§
    fn tee(self) -> (Tee<Self>, Tee<Self>)
    where
     Self: Sized,
     Self::Item: Clone,
    Split into an iterator pair that both yield all elements from
-the original iterator. Read more
    source§
    fn step(self, n: usize) -> Step<Self> ⓘ
    where
-    Self: Sized,
    👎Deprecated since 0.8.0: Use std .step_by() instead
    Return an iterator adaptor that steps n elements in the base iterator
-for each iteration. Read more
    source§
    fn map_into<R>(self) -> MapInto<Self, R>
    where
+the original iterator. Read more
    source§
    fn map_into<R>(self) -> MapInto<Self, R>
    where
     Self: Sized,
-    Self::Item: Into<R>,
    Convert each item of the iterator using the Into trait. Read more
    source§
    fn map_results<F, T, U, E>(self, f: F) -> MapOk<Self, F>
    where
-    Self: Iterator<Item = Result<T, E>> + Sized,
-    F: FnMut(T) -> U,
    👎Deprecated since 0.10.0: Use .map_ok() instead
    See .map_ok().
    source§
    fn map_ok<F, T, U, E>(self, f: F) -> MapOk<Self, F>
    where
+    Self::Item: Into<R>,
    Convert each item of the iterator using the Into trait. Read more
    source§
    fn map_ok<F, T, U, E>(self, f: F) -> MapOk<Self, F>
    where
     Self: Iterator<Item = Result<T, E>> + Sized,
     F: FnMut(T) -> U,
    Return an iterator adaptor that applies the provided closure
 to every Result::Ok value. Result::Err values are
-unchanged. Read more
    source§
    fn filter_ok<F, T, E>(self, f: F) -> FilterOk<Self, F> ⓘ
    where
+unchanged. Read more
    source§
    fn filter_ok<F, T, E>(self, f: F) -> FilterOk<Self, F> ⓘ
    where
     Self: Iterator<Item = Result<T, E>> + Sized,
     F: FnMut(&T) -> bool,
    Return an iterator adaptor that filters every Result::Ok
 value with the provided closure. Result::Err values are
-unchanged. Read more
    source§
    fn filter_map_ok<F, T, U, E>(self, f: F) -> FilterMapOk<Self, F> ⓘ
    where
+unchanged. Read more
    source§
    fn filter_map_ok<F, T, U, E>(self, f: F) -> FilterMapOk<Self, F> ⓘ
    where
     Self: Iterator<Item = Result<T, E>> + Sized,
     F: FnMut(T) -> Option<U>,
    Return an iterator adaptor that filters and transforms every
 Result::Ok value with the provided closure. Result::Err
-values are unchanged. Read more
    source§
    fn flatten_ok<T, E>(self) -> FlattenOk<Self, T, E> ⓘ
    where
+values are unchanged. Read more
    source§
    fn flatten_ok<T, E>(self) -> FlattenOk<Self, T, E> ⓘ
    where
     Self: Iterator<Item = Result<T, E>> + Sized,
     T: IntoIterator,
    Return an iterator adaptor that flattens every Result::Ok value into
-a series of Result::Ok values. Result::Err values are unchanged. Read more
    source§
    fn process_results<F, T, E, R>(self, processor: F) -> Result<R, E>
    where
+a series of Result::Ok values. Result::Err values are unchanged. Read more
    source§
    fn process_results<F, T, E, R>(self, processor: F) -> Result<R, E>
    where
     Self: Iterator<Item = Result<T, E>> + Sized,
     F: FnOnce(ProcessResults<'_, Self, E>) -> R,
    “Lift” a function of the values of the current iterator so as to process
-an iterator of Result values instead. Read more
    source§
    fn merge<J>(self, other: J) -> Merge<Self, J::IntoIter>
    where
+an iterator of Result values instead. Read more
    source§
    fn merge<J>(self, other: J) -> Merge<Self, J::IntoIter>
    where
     Self: Sized,
     Self::Item: PartialOrd,
     J: IntoIterator<Item = Self::Item>,
    Return an iterator adaptor that merges the two base iterators in
 ascending order.  If both base iterators are sorted (ascending), the
-result is sorted. Read more
    source§
    fn merge_by<J, F>(self, other: J, is_first: F) -> MergeBy<Self, J::IntoIter, F> ⓘ
    where
+result is sorted. Read more
    source§
    fn merge_by<J, F>(self, other: J, is_first: F) -> MergeBy<Self, J::IntoIter, F> ⓘ
    where
     Self: Sized,
     J: IntoIterator<Item = Self::Item>,
     F: FnMut(&Self::Item, &Self::Item) -> bool,
    Return an iterator adaptor that merges the two base iterators in order.
-This is much like .merge() but allows for a custom ordering. Read more
    source§
    fn merge_join_by<J, F, T>(
+This is much like .merge() but allows for a custom ordering. Read more
    source§
    fn merge_join_by<J, F, T>(
     self,
     other: J,
     cmp_fn: F
@@ -296,284 +297,295 @@ This is much like IntoIterator,
     F: FnMut(&Self::Item, &J::Item) -> T,
     Self: Sized,
    Create an iterator that merges items from both this and the specified
-iterator in ascending order. Read more
    source§
    fn kmerge(self) -> KMerge<<Self::Item as IntoIterator>::IntoIter>
    where
+iterator in ascending order. Read more
    source§
    fn kmerge(self) -> KMerge<<Self::Item as IntoIterator>::IntoIter>
    where
     Self: Sized,
     Self::Item: IntoIterator,
     <Self::Item as IntoIterator>::Item: PartialOrd,
    Return an iterator adaptor that flattens an iterator of iterators by
-merging them in ascending order. Read more
    source§
    fn kmerge_by<F>(
+merging them in ascending order. Read more
    source§
    fn kmerge_by<F>(
     self,
     first: F
 ) -> KMergeBy<<Self::Item as IntoIterator>::IntoIter, F> ⓘ
    where
     Self: Sized,
     Self::Item: IntoIterator,
     F: FnMut(&<Self::Item as IntoIterator>::Item, &<Self::Item as IntoIterator>::Item) -> bool,
    Return an iterator adaptor that flattens an iterator of iterators by
-merging them according to the given closure. Read more
    source§
    fn cartesian_product<J>(self, other: J) -> Product<Self, J::IntoIter> ⓘ
    where
+merging them according to the given closure. Read more
    source§
    fn cartesian_product<J>(self, other: J) -> Product<Self, J::IntoIter> ⓘ
    where
     Self: Sized,
     Self::Item: Clone,
     J: IntoIterator,
     J::IntoIter: Clone,
    Return an iterator adaptor that iterates over the cartesian product of
-the element sets of two iterators self and J. Read more
    source§
    fn multi_cartesian_product(
+the element sets of two iterators self and J. Read more
    source§
    fn multi_cartesian_product(
     self
 ) -> MultiProduct<<Self::Item as IntoIterator>::IntoIter> ⓘ
    where
     Self: Sized,
     Self::Item: IntoIterator,
     <Self::Item as IntoIterator>::IntoIter: Clone,
     <Self::Item as IntoIterator>::Item: Clone,
    Return an iterator adaptor that iterates over the cartesian product of
-all subiterators returned by meta-iterator self. Read more
    source§
    fn coalesce<F>(self, f: F) -> Coalesce<Self, F>
    where
+all subiterators returned by meta-iterator self. Read more
    source§
    fn coalesce<F>(self, f: F) -> Coalesce<Self, F>
    where
     Self: Sized,
     F: FnMut(Self::Item, Self::Item) -> Result<Self::Item, (Self::Item, Self::Item)>,
    Return an iterator adaptor that uses the passed-in closure to
-optionally merge together consecutive elements. Read more
    source§
    fn dedup(self) -> Dedup<Self>
    where
+optionally merge together consecutive elements. Read more
    source§
    fn dedup(self) -> Dedup<Self>
    where
     Self: Sized,
     Self::Item: PartialEq,
    Remove duplicates from sections of consecutive identical elements.
-If the iterator is sorted, all elements will be unique. Read more
    source§
    fn dedup_by<Cmp>(self, cmp: Cmp) -> DedupBy<Self, Cmp>
    where
+If the iterator is sorted, all elements will be unique. Read more
    source§
    fn dedup_by<Cmp>(self, cmp: Cmp) -> DedupBy<Self, Cmp>
    where
     Self: Sized,
     Cmp: FnMut(&Self::Item, &Self::Item) -> bool,
    Remove duplicates from sections of consecutive identical elements,
 determining equality using a comparison function.
-If the iterator is sorted, all elements will be unique. Read more
    source§
    fn dedup_with_count(self) -> DedupWithCount<Self>
    where
+If the iterator is sorted, all elements will be unique. Read more
    source§
    fn dedup_with_count(self) -> DedupWithCount<Self>
    where
     Self: Sized,
    Remove duplicates from sections of consecutive identical elements, while keeping a count of
 how many repeated elements were present.
-If the iterator is sorted, all elements will be unique. Read more
    source§
    fn dedup_by_with_count<Cmp>(self, cmp: Cmp) -> DedupByWithCount<Self, Cmp>
    where
+If the iterator is sorted, all elements will be unique. Read more
    source§
    fn dedup_by_with_count<Cmp>(self, cmp: Cmp) -> DedupByWithCount<Self, Cmp>
    where
     Self: Sized,
     Cmp: FnMut(&Self::Item, &Self::Item) -> bool,
    Remove duplicates from sections of consecutive identical elements, while keeping a count of
 how many repeated elements were present.
 This will determine equality using a comparison function.
-If the iterator is sorted, all elements will be unique. Read more
    source§
    fn duplicates(self) -> Duplicates<Self>
    where
+If the iterator is sorted, all elements will be unique. Read more
    source§
    fn duplicates(self) -> Duplicates<Self>
    where
     Self: Sized,
     Self::Item: Eq + Hash,
    Return an iterator adaptor that produces elements that appear more than once during the
-iteration. Duplicates are detected using hash and equality. Read more
    source§
    fn duplicates_by<V, F>(self, f: F) -> DuplicatesBy<Self, V, F>
    where
+iteration. Duplicates are detected using hash and equality. Read more
    source§
    fn duplicates_by<V, F>(self, f: F) -> DuplicatesBy<Self, V, F>
    where
     Self: Sized,
     V: Eq + Hash,
     F: FnMut(&Self::Item) -> V,
    Return an iterator adaptor that produces elements that appear more than once during the
-iteration. Duplicates are detected using hash and equality. Read more
    source§
    fn unique(self) -> Unique<Self> ⓘ
    where
+iteration. Duplicates are detected using hash and equality. Read more
    source§
    fn unique(self) -> Unique<Self> ⓘ
    where
     Self: Sized,
     Self::Item: Clone + Eq + Hash,
    Return an iterator adaptor that filters out elements that have
 already been produced once during the iteration. Duplicates
-are detected using hash and equality. Read more
    source§
    fn unique_by<V, F>(self, f: F) -> UniqueBy<Self, V, F> ⓘ
    where
+are detected using hash and equality. Read more
    source§
    fn unique_by<V, F>(self, f: F) -> UniqueBy<Self, V, F> ⓘ
    where
     Self: Sized,
     V: Eq + Hash,
     F: FnMut(&Self::Item) -> V,
    Return an iterator adaptor that filters out elements that have
-already been produced once during the iteration. Read more
    source§
    fn peeking_take_while<F>(&mut self, accept: F) -> PeekingTakeWhile<'_, Self, F> ⓘ
    where
+already been produced once during the iteration. Read more
    source§
    fn peeking_take_while<F>(&mut self, accept: F) -> PeekingTakeWhile<'_, Self, F> ⓘ
    where
     Self: Sized + PeekingNext,
     F: FnMut(&Self::Item) -> bool,
    Return an iterator adaptor that borrows from this iterator and
-takes items while the closure accept returns true. Read more
    source§
    fn take_while_ref<F>(&mut self, accept: F) -> TakeWhileRef<'_, Self, F> ⓘ
    where
+takes items while the closure accept returns true. Read more
    source§
    fn take_while_ref<F>(&mut self, accept: F) -> TakeWhileRef<'_, Self, F> ⓘ
    where
     Self: Clone,
     F: FnMut(&Self::Item) -> bool,
    Return an iterator adaptor that borrows from a Clone-able iterator
-to only pick off elements while the predicate accept returns true. Read more
    source§
    fn take_while_inclusive<F>(self, accept: F) -> TakeWhileInclusive<Self, F> ⓘ
    where
+to only pick off elements while the predicate accept returns true. Read more
    source§
    fn take_while_inclusive<F>(self, accept: F) -> TakeWhileInclusive<Self, F> ⓘ
    where
     Self: Sized,
     F: FnMut(&Self::Item) -> bool,
    Returns an iterator adaptor that consumes elements while the given
 predicate is true, including the element for which the predicate
-first returned false. Read more
    source§
    fn while_some<A>(self) -> WhileSome<Self> ⓘ
    where
+first returned false. Read more
    source§
    fn while_some<A>(self) -> WhileSome<Self> ⓘ
    where
     Self: Sized + Iterator<Item = Option<A>>,
    Return an iterator adaptor that filters Option<A> iterator elements
-and produces A. Stops on the first None encountered. Read more
    source§
    fn tuple_combinations<T>(self) -> TupleCombinations<Self, T> ⓘ
    where
+and produces A. Stops on the first None encountered. Read more
    source§
    fn tuple_combinations<T>(self) -> TupleCombinations<Self, T> ⓘ
    where
     Self: Sized + Clone,
     Self::Item: Clone,
     T: HasCombination<Self>,
    Return an iterator adaptor that iterates over the combinations of the
-elements from an iterator. Read more
    source§
    fn combinations(self, k: usize) -> Combinations<Self> ⓘ
    where
+elements from an iterator. Read more
    source§
    fn combinations(self, k: usize) -> Combinations<Self> ⓘ
    where
     Self: Sized,
     Self::Item: Clone,
    Return an iterator adaptor that iterates over the k-length combinations of
-the elements from an iterator. Read more
    source§
    fn combinations_with_replacement(
+the elements from an iterator. Read more
    source§

    fn combinations_with_replacement( self, k: usize ) -> CombinationsWithReplacement<Self> ⓘ
    where Self: Sized, Self::Item: Clone,

    Return an iterator that iterates over the k-length combinations of -the elements from an iterator, with replacement. Read more
    source§

    fn permutations(self, k: usize) -> Permutations<Self> ⓘ
    where +the elements from an iterator, with replacement. Read more

    source§

    fn permutations(self, k: usize) -> Permutations<Self> ⓘ
    where Self: Sized, Self::Item: Clone,

    Return an iterator adaptor that iterates over all k-permutations of the -elements from an iterator. Read more
    source§

    fn powerset(self) -> Powerset<Self> ⓘ
    where +elements from an iterator. Read more

    source§

    fn powerset(self) -> Powerset<Self> ⓘ
    where Self: Sized, Self::Item: Clone,

    Return an iterator that iterates through the powerset of the elements from an -iterator. Read more
    source§

    fn pad_using<F>(self, min: usize, f: F) -> PadUsing<Self, F> ⓘ
    where +iterator. Read more

    source§

    fn pad_using<F>(self, min: usize, f: F) -> PadUsing<Self, F> ⓘ
    where Self: Sized, F: FnMut(usize) -> Self::Item,

    Return an iterator adaptor that pads the sequence to a minimum length of -min by filling missing elements using a closure f. Read more
    source§

    fn with_position(self) -> WithPosition<Self> ⓘ
    where +min by filling missing elements using a closure f. Read more

    source§

    fn with_position(self) -> WithPosition<Self> ⓘ
    where Self: Sized,

    Return an iterator adaptor that combines each element with a Position to -ease special-case handling of the first or last elements. Read more
    source§

    fn positions<P>(self, predicate: P) -> Positions<Self, P> ⓘ
    where +ease special-case handling of the first or last elements. Read more

    source§

    fn positions<P>(self, predicate: P) -> Positions<Self, P> ⓘ
    where Self: Sized, P: FnMut(Self::Item) -> bool,

    Return an iterator adaptor that yields the indices of all elements -satisfying a predicate, counted from the start of the iterator. Read more
    source§

    fn update<F>(self, updater: F) -> Update<Self, F> ⓘ
    where +satisfying a predicate, counted from the start of the iterator. Read more

    source§

    fn update<F>(self, updater: F) -> Update<Self, F> ⓘ
    where Self: Sized, F: FnMut(&mut Self::Item),

    Return an iterator adaptor that applies a mutating function -to each element before yielding it. Read more
    source§

    fn next_tuple<T>(&mut self) -> Option<T>
    where +to each element before yielding it. Read more

    source§

    fn next_tuple<T>(&mut self) -> Option<T>
    where Self: Sized + Iterator<Item = T::Item>, T: HomogeneousTuple,

    Advances the iterator and returns the next items grouped in a tuple of -a specific size (up to 12). Read more
    source§

    fn collect_tuple<T>(self) -> Option<T>
    where +a specific size (up to 12). Read more

    source§

    fn collect_tuple<T>(self) -> Option<T>
    where Self: Sized + Iterator<Item = T::Item>, T: HomogeneousTuple,

    Collects all items from the iterator into a tuple of a specific size -(up to 12). Read more
    source§

    fn find_position<P>(&mut self, pred: P) -> Option<(usize, Self::Item)>
    where - P: FnMut(&Self::Item) -> bool,

    Find the position and value of the first element satisfying a predicate. Read more
    source§

    fn find_or_last<P>(self, predicate: P) -> Option<Self::Item>
    where +(up to 12). Read more

    source§

    fn find_position<P>(&mut self, pred: P) -> Option<(usize, Self::Item)>
    where + P: FnMut(&Self::Item) -> bool,

    Find the position and value of the first element satisfying a predicate. Read more
    source§

    fn find_or_last<P>(self, predicate: P) -> Option<Self::Item>
    where Self: Sized, - P: FnMut(&Self::Item) -> bool,

    Find the value of the first element satisfying a predicate or return the last element, if any. Read more
    source§

    fn find_or_first<P>(self, predicate: P) -> Option<Self::Item>
    where + P: FnMut(&Self::Item) -> bool,

    Find the value of the first element satisfying a predicate or return the last element, if any. Read more
    source§

    fn find_or_first<P>(self, predicate: P) -> Option<Self::Item>
    where Self: Sized, - P: FnMut(&Self::Item) -> bool,

    Find the value of the first element satisfying a predicate or return the first element, if any. Read more
    source§

    fn contains<Q>(&mut self, query: &Q) -> bool
    where + P: FnMut(&Self::Item) -> bool,

    Find the value of the first element satisfying a predicate or return the first element, if any. Read more
    source§

    fn contains<Q>(&mut self, query: &Q) -> bool
    where Self: Sized, Self::Item: Borrow<Q>, - Q: PartialEq,

    Returns true if the given item is present in this iterator. Read more
    source§

    fn all_equal(&mut self) -> bool
    where + Q: PartialEq,

    Returns true if the given item is present in this iterator. Read more
    source§

    fn all_equal(&mut self) -> bool
    where Self: Sized, - Self::Item: PartialEq,

    Check whether all elements compare equal. Read more
    source§

    fn all_equal_value( + Self::Item: PartialEq,

    Check whether all elements compare equal. Read more
    source§

    fn all_equal_value( &mut self ) -> Result<Self::Item, Option<(Self::Item, Self::Item)>>
    where Self: Sized, Self::Item: PartialEq,

    If there are elements and they are all equal, return a single copy of that element. If there are no elements, return an Error containing None. If there are elements and they are not all equal, return a tuple containing the first -two non-equal elements found. Read more
    source§

    fn all_unique(&mut self) -> bool
    where +two non-equal elements found. Read more

    source§

    fn all_unique(&mut self) -> bool
    where Self: Sized, - Self::Item: Eq + Hash,

    Check whether all elements are unique (non equal). Read more
    source§

    fn dropping(self, n: usize) -> Self
    where + Self::Item: Eq + Hash,

    Check whether all elements are unique (non equal). Read more
    source§

    fn dropping(self, n: usize) -> Self
    where Self: Sized,

    Consume the first n elements from the iterator eagerly, -and return the same iterator again. Read more
    source§

    fn dropping_back(self, n: usize) -> Self
    where +and return the same iterator again. Read more

    source§

    fn dropping_back(self, n: usize) -> Self
    where Self: Sized + DoubleEndedIterator,

    Consume the last n elements from the iterator eagerly, -and return the same iterator again. Read more
    source§

    fn foreach<F>(self, f: F)
    where - F: FnMut(Self::Item), - Self: Sized,

    👎Deprecated since 0.8.0: Use .for_each() instead
    Run the closure f eagerly on each element of the iterator. Read more
    source§

    fn concat(self) -> Self::Item
    where +and return the same iterator again. Read more

    source§

    fn concat(self) -> Self::Item
    where Self: Sized, - Self::Item: Extend<<<Self as Iterator>::Item as IntoIterator>::Item> + IntoIterator + Default,

    Combine all an iterator’s elements into one element by using Extend. Read more
    source§

    fn collect_vec(self) -> Vec<Self::Item>
    where + Self::Item: Extend<<<Self as Iterator>::Item as IntoIterator>::Item> + IntoIterator + Default,

    Combine all an iterator’s elements into one element by using Extend. Read more
    source§

    fn collect_vec(self) -> Vec<Self::Item>
    where Self: Sized,

    .collect_vec() is simply a type specialization of Iterator::collect, -for convenience.
    source§

    fn try_collect<T, U, E>(self) -> Result<U, E>
    where +for convenience.

    source§

    fn try_collect<T, U, E>(self) -> Result<U, E>
    where Self: Sized + Iterator<Item = Result<T, E>>, Result<U, E>: FromIterator<Result<T, E>>,

    .try_collect() is more convenient way of writing -.collect::<Result<_, _>>() Read more
    source§

    fn set_from<'a, A: 'a, J>(&mut self, from: J) -> usize
    where +.collect::<Result<_, _>>() Read more

    source§

    fn set_from<'a, A: 'a, J>(&mut self, from: J) -> usize
    where Self: Iterator<Item = &'a mut A>, J: IntoIterator<Item = A>,

    Assign to each reference in self from the from iterator, -stopping at the shortest of the two iterators. Read more
    source§

    fn join(&mut self, sep: &str) -> String
    where - Self::Item: Display,

    Combine all iterator elements into one String, separated by sep. Read more
    source§

    fn format(self, sep: &str) -> Format<'_, Self>
    where - Self: Sized,

    Format all iterator elements, separated by sep. Read more
    source§

    fn format_with<F>(self, sep: &str, format: F) -> FormatWith<'_, Self, F>
    where +stopping at the shortest of the two iterators. Read more

    source§

    fn join(&mut self, sep: &str) -> String
    where + Self::Item: Display,

    Combine all iterator elements into one String, separated by sep. Read more
    source§

    fn format(self, sep: &str) -> Format<'_, Self>
    where + Self: Sized,

    Format all iterator elements, separated by sep. Read more
    source§

    fn format_with<F>(self, sep: &str, format: F) -> FormatWith<'_, Self, F>
    where Self: Sized, - F: FnMut(Self::Item, &mut dyn FnMut(&dyn Display) -> Result) -> Result,

    Format all iterator elements, separated by sep. Read more
    source§

    fn fold_results<A, E, B, F>(&mut self, start: B, f: F) -> Result<B, E>
    where + F: FnMut(Self::Item, &mut dyn FnMut(&dyn Display) -> Result) -> Result,

    Format all iterator elements, separated by sep. Read more
    source§

    fn fold_ok<A, E, B, F>(&mut self, start: B, f: F) -> Result<B, E>
    where Self: Iterator<Item = Result<A, E>>, - F: FnMut(B, A) -> B,

    👎Deprecated since 0.10.0: Use .fold_ok() instead
    See .fold_ok().
    source§

    fn fold_ok<A, E, B, F>(&mut self, start: B, f: F) -> Result<B, E>
    where - Self: Iterator<Item = Result<A, E>>, - F: FnMut(B, A) -> B,

    Fold Result values from an iterator. Read more
    source§

    fn fold_options<A, B, F>(&mut self, start: B, f: F) -> Option<B>
    where + F: FnMut(B, A) -> B,

    Fold Result values from an iterator. Read more
    source§

    fn fold_options<A, B, F>(&mut self, start: B, f: F) -> Option<B>
    where Self: Iterator<Item = Option<A>>, - F: FnMut(B, A) -> B,

    Fold Option values from an iterator. Read more
    source§

    fn fold1<F>(self, f: F) -> Option<Self::Item>
    where + F: FnMut(B, A) -> B,

    Fold Option values from an iterator. Read more
    source§

    fn fold1<F>(self, f: F) -> Option<Self::Item>
    where F: FnMut(Self::Item, Self::Item) -> Self::Item, - Self: Sized,

    👎Deprecated since 0.10.2: Use Iterator::reduce instead
    Accumulator of the elements in the iterator. Read more
    source§

    fn tree_fold1<F>(self, f: F) -> Option<Self::Item>
    where + Self: Sized,

    👎Deprecated since 0.10.2: Use Iterator::reduce instead
    Accumulator of the elements in the iterator. Read more
    source§

    fn tree_reduce<F>(self, f: F) -> Option<Self::Item>
    where F: FnMut(Self::Item, Self::Item) -> Self::Item, - Self: Sized,

    Accumulate the elements in the iterator in a tree-like manner. Read more
    source§

    fn fold_while<B, F>(&mut self, init: B, f: F) -> FoldWhile<B>
    where + Self: Sized,

    Accumulate the elements in the iterator in a tree-like manner. Read more
    source§

    fn tree_fold1<F>(self, f: F) -> Option<Self::Item>
    where + F: FnMut(Self::Item, Self::Item) -> Self::Item, + Self: Sized,

    👎Deprecated since 0.13.0: Use .tree_reduce() instead
    See .tree_reduce().
    source§

    fn fold_while<B, F>(&mut self, init: B, f: F) -> FoldWhile<B>
    where Self: Sized, - F: FnMut(B, Self::Item) -> FoldWhile<B>,

    An iterator method that applies a function, producing a single, final value. Read more
    source§

    fn sum1<S>(self) -> Option<S>
    where + F: FnMut(B, Self::Item) -> FoldWhile<B>,

    An iterator method that applies a function, producing a single, final value. Read more
    source§

    fn sum1<S>(self) -> Option<S>
    where Self: Sized, - S: Sum<Self::Item>,

    Iterate over the entire iterator and add all the elements. Read more
    source§

    fn product1<P>(self) -> Option<P>
    where + S: Sum<Self::Item>,

    Iterate over the entire iterator and add all the elements. Read more
    source§

    fn product1<P>(self) -> Option<P>
    where Self: Sized, - P: Product<Self::Item>,

    Iterate over the entire iterator and multiply all the elements. Read more
    source§

    fn sorted_unstable(self) -> IntoIter<Self::Item> ⓘ
    where + P: Product<Self::Item>,

    Iterate over the entire iterator and multiply all the elements. Read more
    source§

    fn sorted_unstable(self) -> IntoIter<Self::Item> ⓘ
    where Self: Sized, - Self::Item: Ord,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_unstable_by<F>(self, cmp: F) -> IntoIter<Self::Item> ⓘ
    where + Self::Item: Ord,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_unstable_by<F>(self, cmp: F) -> IntoIter<Self::Item> ⓘ
    where Self: Sized, - F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_unstable_by_key<K, F>(self, f: F) -> IntoIter<Self::Item> ⓘ
    where + F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_unstable_by_key<K, F>(self, f: F) -> IntoIter<Self::Item> ⓘ
    where Self: Sized, K: Ord, - F: FnMut(&Self::Item) -> K,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted(self) -> IntoIter<Self::Item> ⓘ
    where + F: FnMut(&Self::Item) -> K,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted(self) -> IntoIter<Self::Item> ⓘ
    where Self: Sized, - Self::Item: Ord,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_by<F>(self, cmp: F) -> IntoIter<Self::Item> ⓘ
    where + Self::Item: Ord,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_by<F>(self, cmp: F) -> IntoIter<Self::Item> ⓘ
    where Self: Sized, - F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_by_key<K, F>(self, f: F) -> IntoIter<Self::Item> ⓘ
    where + F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_by_key<K, F>(self, f: F) -> IntoIter<Self::Item> ⓘ
    where Self: Sized, K: Ord, - F: FnMut(&Self::Item) -> K,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_by_cached_key<K, F>(self, f: F) -> IntoIter<Self::Item> ⓘ
    where + F: FnMut(&Self::Item) -> K,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_by_cached_key<K, F>(self, f: F) -> IntoIter<Self::Item> ⓘ
    where Self: Sized, K: Ord, F: FnMut(&Self::Item) -> K,

    Sort all iterator elements into a new iterator in ascending order. The key function is -called exactly once per key. Read more
    source§

    fn k_smallest(self, k: usize) -> IntoIter<Self::Item> ⓘ
    where +called exactly once per key. Read more

    source§

    fn k_smallest(self, k: usize) -> IntoIter<Self::Item> ⓘ
    where Self: Sized, - Self::Item: Ord,

    Sort the k smallest elements into a new iterator, in ascending order. Read more
    source§

    fn partition_map<A, B, F, L, R>(self, predicate: F) -> (A, B)
    where + Self::Item: Ord,

    Sort the k smallest elements into a new iterator, in ascending order. Read more
    source§

    fn k_smallest_by<F>(self, k: usize, cmp: F) -> IntoIter<Self::Item> ⓘ
    where + Self: Sized, + F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Sort the k smallest elements into a new iterator using the provided comparison. Read more
    source§

    fn k_smallest_by_key<F, K>(self, k: usize, key: F) -> IntoIter<Self::Item> ⓘ
    where + Self: Sized, + F: FnMut(&Self::Item) -> K, + K: Ord,

    Return the elements producing the k smallest outputs of the provided function. Read more
    source§

    fn k_largest(self, k: usize) -> IntoIter<Self::Item> ⓘ
    where + Self: Sized, + Self::Item: Ord,

    Sort the k largest elements into a new iterator, in descending order. Read more
    source§

    fn k_largest_by<F>(self, k: usize, cmp: F) -> IntoIter<Self::Item> ⓘ
    where + Self: Sized, + F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Sort the k largest elements into a new iterator using the provided comparison. Read more
    source§

    fn k_largest_by_key<F, K>(self, k: usize, key: F) -> IntoIter<Self::Item> ⓘ
    where + Self: Sized, + F: FnMut(&Self::Item) -> K, + K: Ord,

    Return the elements producing the k largest outputs of the provided function. Read more
    source§

    fn tail(self, n: usize) -> IntoIter<Self::Item> ⓘ
    where + Self: Sized,

    Consumes the iterator and return an iterator of the last n elements. Read more
    source§

    fn partition_map<A, B, F, L, R>(self, predicate: F) -> (A, B)
    where Self: Sized, F: FnMut(Self::Item) -> Either<L, R>, A: Default + Extend<L>, B: Default + Extend<R>,

    Collect all iterator elements into one of two partitions. Unlike Iterator::partition, each partition may -have a distinct type. Read more
    source§

    fn partition_result<A, B, T, E>(self) -> (A, B)
    where +have a distinct type. Read more

    source§

    fn partition_result<A, B, T, E>(self) -> (A, B)
    where Self: Iterator<Item = Result<T, E>> + Sized, A: Default + Extend<T>, B: Default + Extend<E>,

    Partition a sequence of Results into one list of all the Ok elements -and another list of all the Err elements. Read more
    source§

    fn into_group_map<K, V>(self) -> HashMap<K, Vec<V>>
    where +and another list of all the Err elements. Read more

    source§

    fn into_group_map<K, V>(self) -> HashMap<K, Vec<V>>
    where Self: Iterator<Item = (K, V)> + Sized, K: Hash + Eq,

    Return a HashMap of keys mapped to Vecs of values. Keys and values -are taken from (Key, Value) tuple pairs yielded by the input iterator. Read more
    source§

    fn into_group_map_by<K, V, F>(self, f: F) -> HashMap<K, Vec<V>>
    where +are taken from (Key, Value) tuple pairs yielded by the input iterator. Read more

    source§

    fn into_group_map_by<K, V, F>(self, f: F) -> HashMap<K, Vec<V>>
    where Self: Iterator<Item = V> + Sized, K: Hash + Eq, - F: Fn(&V) -> K,

    Return an Iterator on a HashMap. Keys mapped to Vecs of values. The key is specified -in the closure. Read more
    source§

    fn into_grouping_map<K, V>(self) -> GroupingMap<Self>
    where + F: FnMut(&V) -> K,

    Return an Iterator on a HashMap. Keys mapped to Vecs of values. The key is specified +in the closure. Read more
    source§

    fn into_grouping_map<K, V>(self) -> GroupingMap<Self>
    where Self: Iterator<Item = (K, V)> + Sized, K: Hash + Eq,

    Constructs a GroupingMap to be used later with one of the efficient -group-and-fold operations it allows to perform. Read more
    source§

    fn into_grouping_map_by<K, V, F>(self, key_mapper: F) -> GroupingMapBy<Self, F>
    where +group-and-fold operations it allows to perform. Read more

    source§

    fn into_grouping_map_by<K, V, F>(self, key_mapper: F) -> GroupingMapBy<Self, F>
    where Self: Iterator<Item = V> + Sized, K: Hash + Eq, F: FnMut(&V) -> K,

    Constructs a GroupingMap to be used later with one of the efficient -group-and-fold operations it allows to perform. Read more
    source§

    fn min_set(self) -> Vec<Self::Item>
    where +group-and-fold operations it allows to perform. Read more

    source§

    fn min_set(self) -> Vec<Self::Item>
    where Self: Sized, - Self::Item: Ord,

    Return all minimum elements of an iterator. Read more
    source§

    fn min_set_by<F>(self, compare: F) -> Vec<Self::Item>
    where + Self::Item: Ord,

    Return all minimum elements of an iterator. Read more
    source§

    fn min_set_by<F>(self, compare: F) -> Vec<Self::Item>
    where Self: Sized, F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Return all minimum elements of an iterator, as determined by -the specified function. Read more
    source§

    fn min_set_by_key<K, F>(self, key: F) -> Vec<Self::Item>
    where +the specified function. Read more

    source§

    fn min_set_by_key<K, F>(self, key: F) -> Vec<Self::Item>
    where Self: Sized, K: Ord, F: FnMut(&Self::Item) -> K,

    Return all minimum elements of an iterator, as determined by -the specified function. Read more
    source§

    fn max_set(self) -> Vec<Self::Item>
    where +the specified function. Read more

    source§

    fn max_set(self) -> Vec<Self::Item>
    where Self: Sized, - Self::Item: Ord,

    Return all maximum elements of an iterator. Read more
    source§

    fn max_set_by<F>(self, compare: F) -> Vec<Self::Item>
    where + Self::Item: Ord,

    Return all maximum elements of an iterator. Read more
    source§

    fn max_set_by<F>(self, compare: F) -> Vec<Self::Item>
    where Self: Sized, F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Return all maximum elements of an iterator, as determined by -the specified function. Read more
    source§

    fn max_set_by_key<K, F>(self, key: F) -> Vec<Self::Item>
    where +the specified function. Read more

    source§

    fn max_set_by_key<K, F>(self, key: F) -> Vec<Self::Item>
    where Self: Sized, K: Ord, F: FnMut(&Self::Item) -> K,

    Return all maximum elements of an iterator, as determined by -the specified function. Read more
    source§

    fn minmax(self) -> MinMaxResult<Self::Item>
    where +the specified function. Read more

    source§

    fn minmax(self) -> MinMaxResult<Self::Item>
    where Self: Sized, - Self::Item: PartialOrd,

    Return the minimum and maximum elements in the iterator. Read more
    source§

    fn minmax_by_key<K, F>(self, key: F) -> MinMaxResult<Self::Item>
    where + Self::Item: PartialOrd,

    Return the minimum and maximum elements in the iterator. Read more
    source§

    fn minmax_by_key<K, F>(self, key: F) -> MinMaxResult<Self::Item>
    where Self: Sized, K: PartialOrd, F: FnMut(&Self::Item) -> K,

    Return the minimum and maximum element of an iterator, as determined by -the specified function. Read more
    source§

    fn minmax_by<F>(self, compare: F) -> MinMaxResult<Self::Item>
    where +the specified function. Read more

    source§

    fn minmax_by<F>(self, compare: F) -> MinMaxResult<Self::Item>
    where Self: Sized, F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Return the minimum and maximum element of an iterator, as determined by -the specified comparison function. Read more
    source§

    fn position_max(self) -> Option<usize>
    where +the specified comparison function. Read more

    source§

    fn position_max(self) -> Option<usize>
    where Self: Sized, - Self::Item: Ord,

    Return the position of the maximum element in the iterator. Read more
    source§

    fn position_max_by_key<K, F>(self, key: F) -> Option<usize>
    where + Self::Item: Ord,

    Return the position of the maximum element in the iterator. Read more
    source§

    fn position_max_by_key<K, F>(self, key: F) -> Option<usize>
    where Self: Sized, K: Ord, F: FnMut(&Self::Item) -> K,

    Return the position of the maximum element in the iterator, as -determined by the specified function. Read more
    source§

    fn position_max_by<F>(self, compare: F) -> Option<usize>
    where +determined by the specified function. Read more

    source§

    fn position_max_by<F>(self, compare: F) -> Option<usize>
    where Self: Sized, F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Return the position of the maximum element in the iterator, as -determined by the specified comparison function. Read more
    source§

    fn position_min(self) -> Option<usize>
    where +determined by the specified comparison function. Read more

    source§

    fn position_min(self) -> Option<usize>
    where Self: Sized, - Self::Item: Ord,

    Return the position of the minimum element in the iterator. Read more
    source§

    fn position_min_by_key<K, F>(self, key: F) -> Option<usize>
    where + Self::Item: Ord,

    Return the position of the minimum element in the iterator. Read more
    source§

    fn position_min_by_key<K, F>(self, key: F) -> Option<usize>
    where Self: Sized, K: Ord, F: FnMut(&Self::Item) -> K,

    Return the position of the minimum element in the iterator, as -determined by the specified function. Read more
    source§

    fn position_min_by<F>(self, compare: F) -> Option<usize>
    where +determined by the specified function. Read more

    source§

    fn position_min_by<F>(self, compare: F) -> Option<usize>
    where Self: Sized, F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Return the position of the minimum element in the iterator, as -determined by the specified comparison function. Read more
    source§

    fn position_minmax(self) -> MinMaxResult<usize>
    where +determined by the specified comparison function. Read more

    source§

    fn position_minmax(self) -> MinMaxResult<usize>
    where Self: Sized, Self::Item: PartialOrd,

    Return the positions of the minimum and maximum elements in -the iterator. Read more
    source§

    fn position_minmax_by_key<K, F>(self, key: F) -> MinMaxResult<usize>
    where +the iterator. Read more

    source§

    fn position_minmax_by_key<K, F>(self, key: F) -> MinMaxResult<usize>
    where Self: Sized, K: PartialOrd, F: FnMut(&Self::Item) -> K,

    Return the postions of the minimum and maximum elements of an -iterator, as determined by the specified function. Read more
    source§

    fn position_minmax_by<F>(self, compare: F) -> MinMaxResult<usize>
    where +iterator, as determined by the specified function. Read more

    source§

    fn position_minmax_by<F>(self, compare: F) -> MinMaxResult<usize>
    where Self: Sized, F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Return the postions of the minimum and maximum elements of an -iterator, as determined by the specified comparison function. Read more
    source§

    fn exactly_one(self) -> Result<Self::Item, ExactlyOneError<Self>>
    where +iterator, as determined by the specified comparison function. Read more

    source§

    fn exactly_one(self) -> Result<Self::Item, ExactlyOneError<Self>>
    where Self: Sized,

    If the iterator yields exactly one element, that element will be returned, otherwise an error will be returned containing an iterator that has the same output as the input -iterator. Read more
    source§

    fn at_most_one(self) -> Result<Option<Self::Item>, ExactlyOneError<Self>>
    where - Self: Sized,

    If the iterator yields no elements, Ok(None) will be returned. If the iterator yields +iterator. Read more
    source§

    fn at_most_one(self) -> Result<Option<Self::Item>, ExactlyOneError<Self>>
    where + Self: Sized,

    If the iterator yields no elements, Ok(None) will be returned. If the iterator yields exactly one element, that element will be returned, otherwise an error will be returned -containing an iterator that has the same output as the input iterator. Read more
    source§

    fn multipeek(self) -> MultiPeek<Self> ⓘ
    where +containing an iterator that has the same output as the input iterator. Read more

    source§

    fn multipeek(self) -> MultiPeek<Self> ⓘ
    where Self: Sized,

    An iterator adaptor that allows the user to peek at multiple .next() -values without advancing the base iterator. Read more
    source§

    fn counts(self) -> HashMap<Self::Item, usize>
    where +values without advancing the base iterator. Read more

    source§

    fn counts(self) -> HashMap<Self::Item, usize>
    where Self: Sized, Self::Item: Eq + Hash,

    Collect the items in this iterator and return a HashMap which contains each item that appears in the iterator and the number -of times it appears. Read more
    source§

    fn counts_by<K, F>(self, f: F) -> HashMap<K, usize>
    where +of times it appears. Read more

    source§

    fn counts_by<K, F>(self, f: F) -> HashMap<K, usize>
    where Self: Sized, K: Eq + Hash, F: FnMut(Self::Item) -> K,

    Collect the items in this iterator and return a HashMap which contains each item that appears in the iterator and the number of times it appears, -determining identity using a keying function. Read more
    source§

    fn multiunzip<FromI>(self) -> FromI
    where - Self: Sized + MultiUnzip<FromI>,

    Converts an iterator of tuples into a tuple of containers. Read more
    source§

    fn try_len(&self) -> Result<usize, (usize, Option<usize>)>

    Returns the length of the iterator if one exists. +determining identity using a keying function. Read more
    source§

    fn multiunzip<FromI>(self) -> FromI
    where + Self: Sized + MultiUnzip<FromI>,

    Converts an iterator of tuples into a tuple of containers. Read more
    source§

    fn try_len(&self) -> Result<usize, (usize, Option<usize>)>

    Returns the length of the iterator if one exists. Otherwise return self.size_hint(). Read more
    source§

    impl<IT> MultiUnzip<()> for IT
    where IT: Iterator<Item = ()>,

    source§

    fn multiunzip(self)

    Unzip this iterator into multiple collections.
    source§

    impl<IT, A, FromA> MultiUnzip<(FromA,)> for IT
    where IT: Iterator<Item = (A,)>, @@ -676,4 +688,4 @@ Otherwise return self.size_hint(). (FromA, FromB, FromC, FromD, FromE, FromF, FromG, FromH, FromI, FromJ, FromK, FromL)

    Unzip this iterator into multiple collections.
    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 + 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/itertools/structs/struct.KMergeBy.html b/itertools/structs/struct.KMergeBy.html index 990816d9f..7d88c5f79 100644 --- a/itertools/structs/struct.KMergeBy.html +++ b/itertools/structs/struct.KMergeBy.html @@ -1,4 +1,4 @@ -KMergeBy in itertools::structs - Rust
    +KMergeBy in itertools::structs - Rust

    Struct itertools::structs::KMergeBy

    source · 
    pub struct KMergeBy<I, F>
    where
     I: Iterator,
    { /* private fields */ }
    Expand description

    An iterator adaptor that merges an abitrary number of base iterators according to an ordering function.

    @@ -223,86 +223,87 @@ otherwise. Right variant of Either<Self, Self> otherwise. Read more
    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> Itertools for T
    where - T: Iterator + ?Sized,

    source§

    fn interleave<J>(self, other: J) -> Interleave<Self, J::IntoIter> ⓘ
    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> Itertools for T
    where + T: Iterator + ?Sized,

    source§

    fn interleave<J>(self, other: J) -> Interleave<Self, J::IntoIter> ⓘ
    where J: IntoIterator<Item = Self::Item>, - Self: Sized,

    Alternate elements from two iterators until both have run out. Read more
    source§

    fn interleave_shortest<J>( + Self: Sized,

    Alternate elements from two iterators until both have run out. Read more
    source§

    fn interleave_shortest<J>( self, other: J ) -> InterleaveShortest<Self, J::IntoIter> ⓘ
    where J: IntoIterator<Item = Self::Item>, Self: Sized,

    Alternate elements from two iterators until at least one of them has run -out. Read more
    source§

    fn intersperse(self, element: Self::Item) -> Intersperse<Self>
    where +out. Read more

    source§

    fn intersperse(self, element: Self::Item) -> Intersperse<Self>
    where Self: Sized, Self::Item: Clone,

    An iterator adaptor to insert a particular value -between each element of the adapted iterator. Read more
    source§

    fn intersperse_with<F>(self, element: F) -> IntersperseWith<Self, F> ⓘ
    where +between each element of the adapted iterator. Read more

    source§

    fn intersperse_with<F>(self, element: F) -> IntersperseWith<Self, F> ⓘ
    where Self: Sized, F: FnMut() -> Self::Item,

    An iterator adaptor to insert a particular value created by a function -between each element of the adapted iterator. Read more
    source§

    fn zip_longest<J>(self, other: J) -> ZipLongest<Self, J::IntoIter> ⓘ
    where +between each element of the adapted iterator. Read more

    source§

    fn get<R>(self, index: R) -> R::Output
    where + Self: Sized, + R: IteratorIndex<Self>,

    Returns an iterator over a subsection of the iterator. Read more
    source§

    fn zip_longest<J>(self, other: J) -> ZipLongest<Self, J::IntoIter> ⓘ
    where J: IntoIterator, Self: Sized,

    Create an iterator which iterates over both this and the specified -iterator simultaneously, yielding pairs of two optional elements. Read more
    source§

    fn zip_eq<J>(self, other: J) -> ZipEq<Self, J::IntoIter> ⓘ
    where +iterator simultaneously, yielding pairs of two optional elements. Read more

    source§

    fn zip_eq<J>(self, other: J) -> ZipEq<Self, J::IntoIter> ⓘ
    where J: IntoIterator, Self: Sized,

    Create an iterator which iterates over both this and the specified -iterator simultaneously, yielding pairs of elements. Read more
    source§

    fn batching<B, F>(self, f: F) -> Batching<Self, F> ⓘ
    where +iterator simultaneously, yielding pairs of elements. Read more

    source§

    fn batching<B, F>(self, f: F) -> Batching<Self, F> ⓘ
    where F: FnMut(&mut Self) -> Option<B>, Self: Sized,

    A “meta iterator adaptor”. Its closure receives a reference to the iterator and may pick off as many elements as it likes, to produce the -next iterator element. Read more
    source§

    fn group_by<K, F>(self, key: F) -> GroupBy<K, Self, F>
    where +next iterator element. Read more

    source§

    fn chunk_by<K, F>(self, key: F) -> ChunkBy<K, Self, F>
    where Self: Sized, F: FnMut(&Self::Item) -> K, K: PartialEq,

    Return an iterable that can group iterator elements. Consecutive elements that map to the same key (“runs”), are assigned -to the same group. Read more
    source§

    fn chunks(self, size: usize) -> IntoChunks<Self>
    where - Self: Sized,

    Return an iterable that can chunk the iterator. Read more
    source§

    fn tuple_windows<T>(self) -> TupleWindows<Self, T> ⓘ
    where +to the same group. Read more

    source§

    fn group_by<K, F>(self, key: F) -> ChunkBy<K, Self, F>
    where + Self: Sized, + F: FnMut(&Self::Item) -> K, + K: PartialEq,

    👎Deprecated since 0.13.0: Use .chunk_by() instead
    See .chunk_by().
    source§

    fn chunks(self, size: usize) -> IntoChunks<Self>
    where + Self: Sized,

    Return an iterable that can chunk the iterator. Read more
    source§

    fn tuple_windows<T>(self) -> TupleWindows<Self, T> ⓘ
    where Self: Sized + Iterator<Item = T::Item>, T: HomogeneousTuple, T::Item: Clone,

    Return an iterator over all contiguous windows producing tuples of -a specific size (up to 12). Read more
    source§

    fn circular_tuple_windows<T>(self) -> CircularTupleWindows<Self, T> ⓘ
    where +a specific size (up to 12). Read more

    source§

    fn circular_tuple_windows<T>(self) -> CircularTupleWindows<Self, T> ⓘ
    where Self: Sized + Clone + Iterator<Item = T::Item> + ExactSizeIterator, T: TupleCollect + Clone, T::Item: Clone,

    Return an iterator over all windows, wrapping back to the first elements when the window would otherwise exceed the length of the -iterator, producing tuples of a specific size (up to 12). Read more
    source§

    fn tuples<T>(self) -> Tuples<Self, T> ⓘ
    where +iterator, producing tuples of a specific size (up to 12). Read more

    source§

    fn tuples<T>(self) -> Tuples<Self, T> ⓘ
    where Self: Sized + Iterator<Item = T::Item>, T: HomogeneousTuple,

    Return an iterator that groups the items in tuples of a specific size -(up to 12). Read more
    source§

    fn tee(self) -> (Tee<Self>, Tee<Self>)
    where +(up to 12). Read more

    source§

    fn tee(self) -> (Tee<Self>, Tee<Self>)
    where Self: Sized, Self::Item: Clone,

    Split into an iterator pair that both yield all elements from -the original iterator. Read more
    source§

    fn step(self, n: usize) -> Step<Self> ⓘ
    where - Self: Sized,

    👎Deprecated since 0.8.0: Use std .step_by() instead
    Return an iterator adaptor that steps n elements in the base iterator -for each iteration. Read more
    source§

    fn map_into<R>(self) -> MapInto<Self, R>
    where +the original iterator. Read more

    source§

    fn map_into<R>(self) -> MapInto<Self, R>
    where Self: Sized, - Self::Item: Into<R>,

    Convert each item of the iterator using the Into trait. Read more
    source§

    fn map_results<F, T, U, E>(self, f: F) -> MapOk<Self, F>
    where - Self: Iterator<Item = Result<T, E>> + Sized, - F: FnMut(T) -> U,

    👎Deprecated since 0.10.0: Use .map_ok() instead
    See .map_ok().
    source§

    fn map_ok<F, T, U, E>(self, f: F) -> MapOk<Self, F>
    where + Self::Item: Into<R>,

    Convert each item of the iterator using the Into trait. Read more
    source§

    fn map_ok<F, T, U, E>(self, f: F) -> MapOk<Self, F>
    where Self: Iterator<Item = Result<T, E>> + Sized, F: FnMut(T) -> U,

    Return an iterator adaptor that applies the provided closure to every Result::Ok value. Result::Err values are -unchanged. Read more
    source§

    fn filter_ok<F, T, E>(self, f: F) -> FilterOk<Self, F> ⓘ
    where +unchanged. Read more

    source§

    fn filter_ok<F, T, E>(self, f: F) -> FilterOk<Self, F> ⓘ
    where Self: Iterator<Item = Result<T, E>> + Sized, F: FnMut(&T) -> bool,

    Return an iterator adaptor that filters every Result::Ok value with the provided closure. Result::Err values are -unchanged. Read more
    source§

    fn filter_map_ok<F, T, U, E>(self, f: F) -> FilterMapOk<Self, F> ⓘ
    where +unchanged. Read more

    source§

    fn filter_map_ok<F, T, U, E>(self, f: F) -> FilterMapOk<Self, F> ⓘ
    where Self: Iterator<Item = Result<T, E>> + Sized, F: FnMut(T) -> Option<U>,

    Return an iterator adaptor that filters and transforms every Result::Ok value with the provided closure. Result::Err -values are unchanged. Read more
    source§

    fn flatten_ok<T, E>(self) -> FlattenOk<Self, T, E> ⓘ
    where +values are unchanged. Read more

    source§

    fn flatten_ok<T, E>(self) -> FlattenOk<Self, T, E> ⓘ
    where Self: Iterator<Item = Result<T, E>> + Sized, T: IntoIterator,

    Return an iterator adaptor that flattens every Result::Ok value into -a series of Result::Ok values. Result::Err values are unchanged. Read more
    source§

    fn process_results<F, T, E, R>(self, processor: F) -> Result<R, E>
    where +a series of Result::Ok values. Result::Err values are unchanged. Read more

    source§

    fn process_results<F, T, E, R>(self, processor: F) -> Result<R, E>
    where Self: Iterator<Item = Result<T, E>> + Sized, F: FnOnce(ProcessResults<'_, Self, E>) -> R,

    “Lift” a function of the values of the current iterator so as to process -an iterator of Result values instead. Read more
    source§

    fn merge<J>(self, other: J) -> Merge<Self, J::IntoIter>
    where +an iterator of Result values instead. Read more

    source§

    fn merge<J>(self, other: J) -> Merge<Self, J::IntoIter>
    where Self: Sized, Self::Item: PartialOrd, J: IntoIterator<Item = Self::Item>,

    Return an iterator adaptor that merges the two base iterators in ascending order. If both base iterators are sorted (ascending), the -result is sorted. Read more
    source§

    fn merge_by<J, F>(self, other: J, is_first: F) -> MergeBy<Self, J::IntoIter, F> ⓘ
    where +result is sorted. Read more

    source§

    fn merge_by<J, F>(self, other: J, is_first: F) -> MergeBy<Self, J::IntoIter, F> ⓘ
    where Self: Sized, J: IntoIterator<Item = Self::Item>, F: FnMut(&Self::Item, &Self::Item) -> bool,

    Return an iterator adaptor that merges the two base iterators in order. -This is much like .merge() but allows for a custom ordering. Read more
    source§

    fn merge_join_by<J, F, T>( +This is much like .merge() but allows for a custom ordering. Read more

    source§

    fn merge_join_by<J, F, T>( self, other: J, cmp_fn: F @@ -310,284 +311,295 @@ This is much like IntoIterator, F: FnMut(&Self::Item, &J::Item) -> T, Self: Sized,

    Create an iterator that merges items from both this and the specified -iterator in ascending order. Read more
    source§

    fn kmerge(self) -> KMerge<<Self::Item as IntoIterator>::IntoIter>
    where +iterator in ascending order. Read more

    source§

    fn kmerge(self) -> KMerge<<Self::Item as IntoIterator>::IntoIter>
    where Self: Sized, Self::Item: IntoIterator, <Self::Item as IntoIterator>::Item: PartialOrd,

    Return an iterator adaptor that flattens an iterator of iterators by -merging them in ascending order. Read more
    source§

    fn kmerge_by<F>( +merging them in ascending order. Read more

    source§

    fn kmerge_by<F>( self, first: F ) -> KMergeBy<<Self::Item as IntoIterator>::IntoIter, F> ⓘ
    where Self: Sized, Self::Item: IntoIterator, F: FnMut(&<Self::Item as IntoIterator>::Item, &<Self::Item as IntoIterator>::Item) -> bool,

    Return an iterator adaptor that flattens an iterator of iterators by -merging them according to the given closure. Read more
    source§

    fn cartesian_product<J>(self, other: J) -> Product<Self, J::IntoIter> ⓘ
    where +merging them according to the given closure. Read more

    source§

    fn cartesian_product<J>(self, other: J) -> Product<Self, J::IntoIter> ⓘ
    where Self: Sized, Self::Item: Clone, J: IntoIterator, J::IntoIter: Clone,

    Return an iterator adaptor that iterates over the cartesian product of -the element sets of two iterators self and J. Read more
    source§

    fn multi_cartesian_product( +the element sets of two iterators self and J. Read more

    source§

    fn multi_cartesian_product( self ) -> MultiProduct<<Self::Item as IntoIterator>::IntoIter> ⓘ
    where Self: Sized, Self::Item: IntoIterator, <Self::Item as IntoIterator>::IntoIter: Clone, <Self::Item as IntoIterator>::Item: Clone,

    Return an iterator adaptor that iterates over the cartesian product of -all subiterators returned by meta-iterator self. Read more
    source§

    fn coalesce<F>(self, f: F) -> Coalesce<Self, F>
    where +all subiterators returned by meta-iterator self. Read more

    source§

    fn coalesce<F>(self, f: F) -> Coalesce<Self, F>
    where Self: Sized, F: FnMut(Self::Item, Self::Item) -> Result<Self::Item, (Self::Item, Self::Item)>,

    Return an iterator adaptor that uses the passed-in closure to -optionally merge together consecutive elements. Read more
    source§

    fn dedup(self) -> Dedup<Self>
    where +optionally merge together consecutive elements. Read more

    source§

    fn dedup(self) -> Dedup<Self>
    where Self: Sized, Self::Item: PartialEq,

    Remove duplicates from sections of consecutive identical elements. -If the iterator is sorted, all elements will be unique. Read more
    source§

    fn dedup_by<Cmp>(self, cmp: Cmp) -> DedupBy<Self, Cmp>
    where +If the iterator is sorted, all elements will be unique. Read more

    source§

    fn dedup_by<Cmp>(self, cmp: Cmp) -> DedupBy<Self, Cmp>
    where Self: Sized, Cmp: FnMut(&Self::Item, &Self::Item) -> bool,

    Remove duplicates from sections of consecutive identical elements, determining equality using a comparison function. -If the iterator is sorted, all elements will be unique. Read more
    source§

    fn dedup_with_count(self) -> DedupWithCount<Self>
    where +If the iterator is sorted, all elements will be unique. Read more

    source§

    fn dedup_with_count(self) -> DedupWithCount<Self>
    where Self: Sized,

    Remove duplicates from sections of consecutive identical elements, while keeping a count of how many repeated elements were present. -If the iterator is sorted, all elements will be unique. Read more
    source§

    fn dedup_by_with_count<Cmp>(self, cmp: Cmp) -> DedupByWithCount<Self, Cmp>
    where +If the iterator is sorted, all elements will be unique. Read more

    source§

    fn dedup_by_with_count<Cmp>(self, cmp: Cmp) -> DedupByWithCount<Self, Cmp>
    where Self: Sized, Cmp: FnMut(&Self::Item, &Self::Item) -> bool,

    Remove duplicates from sections of consecutive identical elements, while keeping a count of how many repeated elements were present. This will determine equality using a comparison function. -If the iterator is sorted, all elements will be unique. Read more
    source§

    fn duplicates(self) -> Duplicates<Self>
    where +If the iterator is sorted, all elements will be unique. Read more

    source§

    fn duplicates(self) -> Duplicates<Self>
    where Self: Sized, Self::Item: Eq + Hash,

    Return an iterator adaptor that produces elements that appear more than once during the -iteration. Duplicates are detected using hash and equality. Read more
    source§

    fn duplicates_by<V, F>(self, f: F) -> DuplicatesBy<Self, V, F>
    where +iteration. Duplicates are detected using hash and equality. Read more

    source§

    fn duplicates_by<V, F>(self, f: F) -> DuplicatesBy<Self, V, F>
    where Self: Sized, V: Eq + Hash, F: FnMut(&Self::Item) -> V,

    Return an iterator adaptor that produces elements that appear more than once during the -iteration. Duplicates are detected using hash and equality. Read more
    source§

    fn unique(self) -> Unique<Self> ⓘ
    where +iteration. Duplicates are detected using hash and equality. Read more

    source§

    fn unique(self) -> Unique<Self> ⓘ
    where Self: Sized, Self::Item: Clone + Eq + Hash,

    Return an iterator adaptor that filters out elements that have already been produced once during the iteration. Duplicates -are detected using hash and equality. Read more
    source§

    fn unique_by<V, F>(self, f: F) -> UniqueBy<Self, V, F> ⓘ
    where +are detected using hash and equality. Read more

    source§

    fn unique_by<V, F>(self, f: F) -> UniqueBy<Self, V, F> ⓘ
    where Self: Sized, V: Eq + Hash, F: FnMut(&Self::Item) -> V,

    Return an iterator adaptor that filters out elements that have -already been produced once during the iteration. Read more
    source§

    fn peeking_take_while<F>(&mut self, accept: F) -> PeekingTakeWhile<'_, Self, F> ⓘ
    where +already been produced once during the iteration. Read more

    source§

    fn peeking_take_while<F>(&mut self, accept: F) -> PeekingTakeWhile<'_, Self, F> ⓘ
    where Self: Sized + PeekingNext, F: FnMut(&Self::Item) -> bool,

    Return an iterator adaptor that borrows from this iterator and -takes items while the closure accept returns true. Read more
    source§

    fn take_while_ref<F>(&mut self, accept: F) -> TakeWhileRef<'_, Self, F> ⓘ
    where +takes items while the closure accept returns true. Read more

    source§

    fn take_while_ref<F>(&mut self, accept: F) -> TakeWhileRef<'_, Self, F> ⓘ
    where Self: Clone, F: FnMut(&Self::Item) -> bool,

    Return an iterator adaptor that borrows from a Clone-able iterator -to only pick off elements while the predicate accept returns true. Read more
    source§

    fn take_while_inclusive<F>(self, accept: F) -> TakeWhileInclusive<Self, F> ⓘ
    where +to only pick off elements while the predicate accept returns true. Read more

    source§

    fn take_while_inclusive<F>(self, accept: F) -> TakeWhileInclusive<Self, F> ⓘ
    where Self: Sized, F: FnMut(&Self::Item) -> bool,

    Returns an iterator adaptor that consumes elements while the given predicate is true, including the element for which the predicate -first returned false. Read more
    source§

    fn while_some<A>(self) -> WhileSome<Self> ⓘ
    where +first returned false. Read more

    source§

    fn while_some<A>(self) -> WhileSome<Self> ⓘ
    where Self: Sized + Iterator<Item = Option<A>>,

    Return an iterator adaptor that filters Option<A> iterator elements -and produces A. Stops on the first None encountered. Read more
    source§

    fn tuple_combinations<T>(self) -> TupleCombinations<Self, T> ⓘ
    where +and produces A. Stops on the first None encountered. Read more

    source§

    fn tuple_combinations<T>(self) -> TupleCombinations<Self, T> ⓘ
    where Self: Sized + Clone, Self::Item: Clone, T: HasCombination<Self>,

    Return an iterator adaptor that iterates over the combinations of the -elements from an iterator. Read more
    source§

    fn combinations(self, k: usize) -> Combinations<Self> ⓘ
    where +elements from an iterator. Read more

    source§

    fn combinations(self, k: usize) -> Combinations<Self> ⓘ
    where Self: Sized, Self::Item: Clone,

    Return an iterator adaptor that iterates over the k-length combinations of -the elements from an iterator. Read more
    source§

    fn combinations_with_replacement( +the elements from an iterator. Read more

    source§

    fn combinations_with_replacement( self, k: usize ) -> CombinationsWithReplacement<Self> ⓘ
    where Self: Sized, Self::Item: Clone,

    Return an iterator that iterates over the k-length combinations of -the elements from an iterator, with replacement. Read more
    source§

    fn permutations(self, k: usize) -> Permutations<Self> ⓘ
    where +the elements from an iterator, with replacement. Read more

    source§

    fn permutations(self, k: usize) -> Permutations<Self> ⓘ
    where Self: Sized, Self::Item: Clone,

    Return an iterator adaptor that iterates over all k-permutations of the -elements from an iterator. Read more
    source§

    fn powerset(self) -> Powerset<Self> ⓘ
    where +elements from an iterator. Read more

    source§

    fn powerset(self) -> Powerset<Self> ⓘ
    where Self: Sized, Self::Item: Clone,

    Return an iterator that iterates through the powerset of the elements from an -iterator. Read more
    source§

    fn pad_using<F>(self, min: usize, f: F) -> PadUsing<Self, F> ⓘ
    where +iterator. Read more

    source§

    fn pad_using<F>(self, min: usize, f: F) -> PadUsing<Self, F> ⓘ
    where Self: Sized, F: FnMut(usize) -> Self::Item,

    Return an iterator adaptor that pads the sequence to a minimum length of -min by filling missing elements using a closure f. Read more
    source§

    fn with_position(self) -> WithPosition<Self> ⓘ
    where +min by filling missing elements using a closure f. Read more

    source§

    fn with_position(self) -> WithPosition<Self> ⓘ
    where Self: Sized,

    Return an iterator adaptor that combines each element with a Position to -ease special-case handling of the first or last elements. Read more
    source§

    fn positions<P>(self, predicate: P) -> Positions<Self, P> ⓘ
    where +ease special-case handling of the first or last elements. Read more

    source§

    fn positions<P>(self, predicate: P) -> Positions<Self, P> ⓘ
    where Self: Sized, P: FnMut(Self::Item) -> bool,

    Return an iterator adaptor that yields the indices of all elements -satisfying a predicate, counted from the start of the iterator. Read more
    source§

    fn update<F>(self, updater: F) -> Update<Self, F> ⓘ
    where +satisfying a predicate, counted from the start of the iterator. Read more

    source§

    fn update<F>(self, updater: F) -> Update<Self, F> ⓘ
    where Self: Sized, F: FnMut(&mut Self::Item),

    Return an iterator adaptor that applies a mutating function -to each element before yielding it. Read more
    source§

    fn next_tuple<T>(&mut self) -> Option<T>
    where +to each element before yielding it. Read more

    source§

    fn next_tuple<T>(&mut self) -> Option<T>
    where Self: Sized + Iterator<Item = T::Item>, T: HomogeneousTuple,

    Advances the iterator and returns the next items grouped in a tuple of -a specific size (up to 12). Read more
    source§

    fn collect_tuple<T>(self) -> Option<T>
    where +a specific size (up to 12). Read more

    source§

    fn collect_tuple<T>(self) -> Option<T>
    where Self: Sized + Iterator<Item = T::Item>, T: HomogeneousTuple,

    Collects all items from the iterator into a tuple of a specific size -(up to 12). Read more
    source§

    fn find_position<P>(&mut self, pred: P) -> Option<(usize, Self::Item)>
    where - P: FnMut(&Self::Item) -> bool,

    Find the position and value of the first element satisfying a predicate. Read more
    source§

    fn find_or_last<P>(self, predicate: P) -> Option<Self::Item>
    where +(up to 12). Read more

    source§

    fn find_position<P>(&mut self, pred: P) -> Option<(usize, Self::Item)>
    where + P: FnMut(&Self::Item) -> bool,

    Find the position and value of the first element satisfying a predicate. Read more
    source§

    fn find_or_last<P>(self, predicate: P) -> Option<Self::Item>
    where Self: Sized, - P: FnMut(&Self::Item) -> bool,

    Find the value of the first element satisfying a predicate or return the last element, if any. Read more
    source§

    fn find_or_first<P>(self, predicate: P) -> Option<Self::Item>
    where + P: FnMut(&Self::Item) -> bool,

    Find the value of the first element satisfying a predicate or return the last element, if any. Read more
    source§

    fn find_or_first<P>(self, predicate: P) -> Option<Self::Item>
    where Self: Sized, - P: FnMut(&Self::Item) -> bool,

    Find the value of the first element satisfying a predicate or return the first element, if any. Read more
    source§

    fn contains<Q>(&mut self, query: &Q) -> bool
    where + P: FnMut(&Self::Item) -> bool,

    Find the value of the first element satisfying a predicate or return the first element, if any. Read more
    source§

    fn contains<Q>(&mut self, query: &Q) -> bool
    where Self: Sized, Self::Item: Borrow<Q>, - Q: PartialEq,

    Returns true if the given item is present in this iterator. Read more
    source§

    fn all_equal(&mut self) -> bool
    where + Q: PartialEq,

    Returns true if the given item is present in this iterator. Read more
    source§

    fn all_equal(&mut self) -> bool
    where Self: Sized, - Self::Item: PartialEq,

    Check whether all elements compare equal. Read more
    source§

    fn all_equal_value( + Self::Item: PartialEq,

    Check whether all elements compare equal. Read more
    source§

    fn all_equal_value( &mut self ) -> Result<Self::Item, Option<(Self::Item, Self::Item)>>
    where Self: Sized, Self::Item: PartialEq,

    If there are elements and they are all equal, return a single copy of that element. If there are no elements, return an Error containing None. If there are elements and they are not all equal, return a tuple containing the first -two non-equal elements found. Read more
    source§

    fn all_unique(&mut self) -> bool
    where +two non-equal elements found. Read more

    source§

    fn all_unique(&mut self) -> bool
    where Self: Sized, - Self::Item: Eq + Hash,

    Check whether all elements are unique (non equal). Read more
    source§

    fn dropping(self, n: usize) -> Self
    where + Self::Item: Eq + Hash,

    Check whether all elements are unique (non equal). Read more
    source§

    fn dropping(self, n: usize) -> Self
    where Self: Sized,

    Consume the first n elements from the iterator eagerly, -and return the same iterator again. Read more
    source§

    fn dropping_back(self, n: usize) -> Self
    where +and return the same iterator again. Read more

    source§

    fn dropping_back(self, n: usize) -> Self
    where Self: Sized + DoubleEndedIterator,

    Consume the last n elements from the iterator eagerly, -and return the same iterator again. Read more
    source§

    fn foreach<F>(self, f: F)
    where - F: FnMut(Self::Item), - Self: Sized,

    👎Deprecated since 0.8.0: Use .for_each() instead
    Run the closure f eagerly on each element of the iterator. Read more
    source§

    fn concat(self) -> Self::Item
    where +and return the same iterator again. Read more

    source§

    fn concat(self) -> Self::Item
    where Self: Sized, - Self::Item: Extend<<<Self as Iterator>::Item as IntoIterator>::Item> + IntoIterator + Default,

    Combine all an iterator’s elements into one element by using Extend. Read more
    source§

    fn collect_vec(self) -> Vec<Self::Item>
    where + Self::Item: Extend<<<Self as Iterator>::Item as IntoIterator>::Item> + IntoIterator + Default,

    Combine all an iterator’s elements into one element by using Extend. Read more
    source§

    fn collect_vec(self) -> Vec<Self::Item>
    where Self: Sized,

    .collect_vec() is simply a type specialization of Iterator::collect, -for convenience.
    source§

    fn try_collect<T, U, E>(self) -> Result<U, E>
    where +for convenience.

    source§

    fn try_collect<T, U, E>(self) -> Result<U, E>
    where Self: Sized + Iterator<Item = Result<T, E>>, Result<U, E>: FromIterator<Result<T, E>>,

    .try_collect() is more convenient way of writing -.collect::<Result<_, _>>() Read more
    source§

    fn set_from<'a, A: 'a, J>(&mut self, from: J) -> usize
    where +.collect::<Result<_, _>>() Read more

    source§

    fn set_from<'a, A: 'a, J>(&mut self, from: J) -> usize
    where Self: Iterator<Item = &'a mut A>, J: IntoIterator<Item = A>,

    Assign to each reference in self from the from iterator, -stopping at the shortest of the two iterators. Read more
    source§

    fn join(&mut self, sep: &str) -> String
    where - Self::Item: Display,

    Combine all iterator elements into one String, separated by sep. Read more
    source§

    fn format(self, sep: &str) -> Format<'_, Self>
    where - Self: Sized,

    Format all iterator elements, separated by sep. Read more
    source§

    fn format_with<F>(self, sep: &str, format: F) -> FormatWith<'_, Self, F>
    where +stopping at the shortest of the two iterators. Read more

    source§

    fn join(&mut self, sep: &str) -> String
    where + Self::Item: Display,

    Combine all iterator elements into one String, separated by sep. Read more
    source§

    fn format(self, sep: &str) -> Format<'_, Self>
    where + Self: Sized,

    Format all iterator elements, separated by sep. Read more
    source§

    fn format_with<F>(self, sep: &str, format: F) -> FormatWith<'_, Self, F>
    where Self: Sized, - F: FnMut(Self::Item, &mut dyn FnMut(&dyn Display) -> Result) -> Result,

    Format all iterator elements, separated by sep. Read more
    source§

    fn fold_results<A, E, B, F>(&mut self, start: B, f: F) -> Result<B, E>
    where + F: FnMut(Self::Item, &mut dyn FnMut(&dyn Display) -> Result) -> Result,

    Format all iterator elements, separated by sep. Read more
    source§

    fn fold_ok<A, E, B, F>(&mut self, start: B, f: F) -> Result<B, E>
    where Self: Iterator<Item = Result<A, E>>, - F: FnMut(B, A) -> B,

    👎Deprecated since 0.10.0: Use .fold_ok() instead
    See .fold_ok().
    source§

    fn fold_ok<A, E, B, F>(&mut self, start: B, f: F) -> Result<B, E>
    where - Self: Iterator<Item = Result<A, E>>, - F: FnMut(B, A) -> B,

    Fold Result values from an iterator. Read more
    source§

    fn fold_options<A, B, F>(&mut self, start: B, f: F) -> Option<B>
    where + F: FnMut(B, A) -> B,

    Fold Result values from an iterator. Read more
    source§

    fn fold_options<A, B, F>(&mut self, start: B, f: F) -> Option<B>
    where Self: Iterator<Item = Option<A>>, - F: FnMut(B, A) -> B,

    Fold Option values from an iterator. Read more
    source§

    fn fold1<F>(self, f: F) -> Option<Self::Item>
    where + F: FnMut(B, A) -> B,

    Fold Option values from an iterator. Read more
    source§

    fn fold1<F>(self, f: F) -> Option<Self::Item>
    where F: FnMut(Self::Item, Self::Item) -> Self::Item, - Self: Sized,

    👎Deprecated since 0.10.2: Use Iterator::reduce instead
    Accumulator of the elements in the iterator. Read more
    source§

    fn tree_fold1<F>(self, f: F) -> Option<Self::Item>
    where + Self: Sized,

    👎Deprecated since 0.10.2: Use Iterator::reduce instead
    Accumulator of the elements in the iterator. Read more
    source§

    fn tree_reduce<F>(self, f: F) -> Option<Self::Item>
    where F: FnMut(Self::Item, Self::Item) -> Self::Item, - Self: Sized,

    Accumulate the elements in the iterator in a tree-like manner. Read more
    source§

    fn fold_while<B, F>(&mut self, init: B, f: F) -> FoldWhile<B>
    where + Self: Sized,

    Accumulate the elements in the iterator in a tree-like manner. Read more
    source§

    fn tree_fold1<F>(self, f: F) -> Option<Self::Item>
    where + F: FnMut(Self::Item, Self::Item) -> Self::Item, + Self: Sized,

    👎Deprecated since 0.13.0: Use .tree_reduce() instead
    See .tree_reduce().
    source§

    fn fold_while<B, F>(&mut self, init: B, f: F) -> FoldWhile<B>
    where Self: Sized, - F: FnMut(B, Self::Item) -> FoldWhile<B>,

    An iterator method that applies a function, producing a single, final value. Read more
    source§

    fn sum1<S>(self) -> Option<S>
    where + F: FnMut(B, Self::Item) -> FoldWhile<B>,

    An iterator method that applies a function, producing a single, final value. Read more
    source§

    fn sum1<S>(self) -> Option<S>
    where Self: Sized, - S: Sum<Self::Item>,

    Iterate over the entire iterator and add all the elements. Read more
    source§

    fn product1<P>(self) -> Option<P>
    where + S: Sum<Self::Item>,

    Iterate over the entire iterator and add all the elements. Read more
    source§

    fn product1<P>(self) -> Option<P>
    where Self: Sized, - P: Product<Self::Item>,

    Iterate over the entire iterator and multiply all the elements. Read more
    source§

    fn sorted_unstable(self) -> IntoIter<Self::Item> ⓘ
    where + P: Product<Self::Item>,

    Iterate over the entire iterator and multiply all the elements. Read more
    source§

    fn sorted_unstable(self) -> IntoIter<Self::Item> ⓘ
    where Self: Sized, - Self::Item: Ord,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_unstable_by<F>(self, cmp: F) -> IntoIter<Self::Item> ⓘ
    where + Self::Item: Ord,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_unstable_by<F>(self, cmp: F) -> IntoIter<Self::Item> ⓘ
    where Self: Sized, - F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_unstable_by_key<K, F>(self, f: F) -> IntoIter<Self::Item> ⓘ
    where + F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_unstable_by_key<K, F>(self, f: F) -> IntoIter<Self::Item> ⓘ
    where Self: Sized, K: Ord, - F: FnMut(&Self::Item) -> K,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted(self) -> IntoIter<Self::Item> ⓘ
    where + F: FnMut(&Self::Item) -> K,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted(self) -> IntoIter<Self::Item> ⓘ
    where Self: Sized, - Self::Item: Ord,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_by<F>(self, cmp: F) -> IntoIter<Self::Item> ⓘ
    where + Self::Item: Ord,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_by<F>(self, cmp: F) -> IntoIter<Self::Item> ⓘ
    where Self: Sized, - F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_by_key<K, F>(self, f: F) -> IntoIter<Self::Item> ⓘ
    where + F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_by_key<K, F>(self, f: F) -> IntoIter<Self::Item> ⓘ
    where Self: Sized, K: Ord, - F: FnMut(&Self::Item) -> K,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_by_cached_key<K, F>(self, f: F) -> IntoIter<Self::Item> ⓘ
    where + F: FnMut(&Self::Item) -> K,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_by_cached_key<K, F>(self, f: F) -> IntoIter<Self::Item> ⓘ
    where Self: Sized, K: Ord, F: FnMut(&Self::Item) -> K,

    Sort all iterator elements into a new iterator in ascending order. The key function is -called exactly once per key. Read more
    source§

    fn k_smallest(self, k: usize) -> IntoIter<Self::Item> ⓘ
    where +called exactly once per key. Read more

    source§

    fn k_smallest(self, k: usize) -> IntoIter<Self::Item> ⓘ
    where Self: Sized, - Self::Item: Ord,

    Sort the k smallest elements into a new iterator, in ascending order. Read more
    source§

    fn partition_map<A, B, F, L, R>(self, predicate: F) -> (A, B)
    where + Self::Item: Ord,

    Sort the k smallest elements into a new iterator, in ascending order. Read more
    source§

    fn k_smallest_by<F>(self, k: usize, cmp: F) -> IntoIter<Self::Item> ⓘ
    where + Self: Sized, + F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Sort the k smallest elements into a new iterator using the provided comparison. Read more
    source§

    fn k_smallest_by_key<F, K>(self, k: usize, key: F) -> IntoIter<Self::Item> ⓘ
    where + Self: Sized, + F: FnMut(&Self::Item) -> K, + K: Ord,

    Return the elements producing the k smallest outputs of the provided function. Read more
    source§

    fn k_largest(self, k: usize) -> IntoIter<Self::Item> ⓘ
    where + Self: Sized, + Self::Item: Ord,

    Sort the k largest elements into a new iterator, in descending order. Read more
    source§

    fn k_largest_by<F>(self, k: usize, cmp: F) -> IntoIter<Self::Item> ⓘ
    where + Self: Sized, + F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Sort the k largest elements into a new iterator using the provided comparison. Read more
    source§

    fn k_largest_by_key<F, K>(self, k: usize, key: F) -> IntoIter<Self::Item> ⓘ
    where + Self: Sized, + F: FnMut(&Self::Item) -> K, + K: Ord,

    Return the elements producing the k largest outputs of the provided function. Read more
    source§

    fn tail(self, n: usize) -> IntoIter<Self::Item> ⓘ
    where + Self: Sized,

    Consumes the iterator and return an iterator of the last n elements. Read more
    source§

    fn partition_map<A, B, F, L, R>(self, predicate: F) -> (A, B)
    where Self: Sized, F: FnMut(Self::Item) -> Either<L, R>, A: Default + Extend<L>, B: Default + Extend<R>,

    Collect all iterator elements into one of two partitions. Unlike Iterator::partition, each partition may -have a distinct type. Read more
    source§

    fn partition_result<A, B, T, E>(self) -> (A, B)
    where +have a distinct type. Read more

    source§

    fn partition_result<A, B, T, E>(self) -> (A, B)
    where Self: Iterator<Item = Result<T, E>> + Sized, A: Default + Extend<T>, B: Default + Extend<E>,

    Partition a sequence of Results into one list of all the Ok elements -and another list of all the Err elements. Read more
    source§

    fn into_group_map<K, V>(self) -> HashMap<K, Vec<V>>
    where +and another list of all the Err elements. Read more

    source§

    fn into_group_map<K, V>(self) -> HashMap<K, Vec<V>>
    where Self: Iterator<Item = (K, V)> + Sized, K: Hash + Eq,

    Return a HashMap of keys mapped to Vecs of values. Keys and values -are taken from (Key, Value) tuple pairs yielded by the input iterator. Read more
    source§

    fn into_group_map_by<K, V, F>(self, f: F) -> HashMap<K, Vec<V>>
    where +are taken from (Key, Value) tuple pairs yielded by the input iterator. Read more

    source§

    fn into_group_map_by<K, V, F>(self, f: F) -> HashMap<K, Vec<V>>
    where Self: Iterator<Item = V> + Sized, K: Hash + Eq, - F: Fn(&V) -> K,

    Return an Iterator on a HashMap. Keys mapped to Vecs of values. The key is specified -in the closure. Read more
    source§

    fn into_grouping_map<K, V>(self) -> GroupingMap<Self>
    where + F: FnMut(&V) -> K,

    Return an Iterator on a HashMap. Keys mapped to Vecs of values. The key is specified +in the closure. Read more
    source§

    fn into_grouping_map<K, V>(self) -> GroupingMap<Self>
    where Self: Iterator<Item = (K, V)> + Sized, K: Hash + Eq,

    Constructs a GroupingMap to be used later with one of the efficient -group-and-fold operations it allows to perform. Read more
    source§

    fn into_grouping_map_by<K, V, F>(self, key_mapper: F) -> GroupingMapBy<Self, F>
    where +group-and-fold operations it allows to perform. Read more

    source§

    fn into_grouping_map_by<K, V, F>(self, key_mapper: F) -> GroupingMapBy<Self, F>
    where Self: Iterator<Item = V> + Sized, K: Hash + Eq, F: FnMut(&V) -> K,

    Constructs a GroupingMap to be used later with one of the efficient -group-and-fold operations it allows to perform. Read more
    source§

    fn min_set(self) -> Vec<Self::Item>
    where +group-and-fold operations it allows to perform. Read more

    source§

    fn min_set(self) -> Vec<Self::Item>
    where Self: Sized, - Self::Item: Ord,

    Return all minimum elements of an iterator. Read more
    source§

    fn min_set_by<F>(self, compare: F) -> Vec<Self::Item>
    where + Self::Item: Ord,

    Return all minimum elements of an iterator. Read more
    source§

    fn min_set_by<F>(self, compare: F) -> Vec<Self::Item>
    where Self: Sized, F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Return all minimum elements of an iterator, as determined by -the specified function. Read more
    source§

    fn min_set_by_key<K, F>(self, key: F) -> Vec<Self::Item>
    where +the specified function. Read more

    source§

    fn min_set_by_key<K, F>(self, key: F) -> Vec<Self::Item>
    where Self: Sized, K: Ord, F: FnMut(&Self::Item) -> K,

    Return all minimum elements of an iterator, as determined by -the specified function. Read more
    source§

    fn max_set(self) -> Vec<Self::Item>
    where +the specified function. Read more

    source§

    fn max_set(self) -> Vec<Self::Item>
    where Self: Sized, - Self::Item: Ord,

    Return all maximum elements of an iterator. Read more
    source§

    fn max_set_by<F>(self, compare: F) -> Vec<Self::Item>
    where + Self::Item: Ord,

    Return all maximum elements of an iterator. Read more
    source§

    fn max_set_by<F>(self, compare: F) -> Vec<Self::Item>
    where Self: Sized, F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Return all maximum elements of an iterator, as determined by -the specified function. Read more
    source§

    fn max_set_by_key<K, F>(self, key: F) -> Vec<Self::Item>
    where +the specified function. Read more

    source§

    fn max_set_by_key<K, F>(self, key: F) -> Vec<Self::Item>
    where Self: Sized, K: Ord, F: FnMut(&Self::Item) -> K,

    Return all maximum elements of an iterator, as determined by -the specified function. Read more
    source§

    fn minmax(self) -> MinMaxResult<Self::Item>
    where +the specified function. Read more

    source§

    fn minmax(self) -> MinMaxResult<Self::Item>
    where Self: Sized, - Self::Item: PartialOrd,

    Return the minimum and maximum elements in the iterator. Read more
    source§

    fn minmax_by_key<K, F>(self, key: F) -> MinMaxResult<Self::Item>
    where + Self::Item: PartialOrd,

    Return the minimum and maximum elements in the iterator. Read more
    source§

    fn minmax_by_key<K, F>(self, key: F) -> MinMaxResult<Self::Item>
    where Self: Sized, K: PartialOrd, F: FnMut(&Self::Item) -> K,

    Return the minimum and maximum element of an iterator, as determined by -the specified function. Read more
    source§

    fn minmax_by<F>(self, compare: F) -> MinMaxResult<Self::Item>
    where +the specified function. Read more

    source§

    fn minmax_by<F>(self, compare: F) -> MinMaxResult<Self::Item>
    where Self: Sized, F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Return the minimum and maximum element of an iterator, as determined by -the specified comparison function. Read more
    source§

    fn position_max(self) -> Option<usize>
    where +the specified comparison function. Read more

    source§

    fn position_max(self) -> Option<usize>
    where Self: Sized, - Self::Item: Ord,

    Return the position of the maximum element in the iterator. Read more
    source§

    fn position_max_by_key<K, F>(self, key: F) -> Option<usize>
    where + Self::Item: Ord,

    Return the position of the maximum element in the iterator. Read more
    source§

    fn position_max_by_key<K, F>(self, key: F) -> Option<usize>
    where Self: Sized, K: Ord, F: FnMut(&Self::Item) -> K,

    Return the position of the maximum element in the iterator, as -determined by the specified function. Read more
    source§

    fn position_max_by<F>(self, compare: F) -> Option<usize>
    where +determined by the specified function. Read more

    source§

    fn position_max_by<F>(self, compare: F) -> Option<usize>
    where Self: Sized, F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Return the position of the maximum element in the iterator, as -determined by the specified comparison function. Read more
    source§

    fn position_min(self) -> Option<usize>
    where +determined by the specified comparison function. Read more

    source§

    fn position_min(self) -> Option<usize>
    where Self: Sized, - Self::Item: Ord,

    Return the position of the minimum element in the iterator. Read more
    source§

    fn position_min_by_key<K, F>(self, key: F) -> Option<usize>
    where + Self::Item: Ord,

    Return the position of the minimum element in the iterator. Read more
    source§

    fn position_min_by_key<K, F>(self, key: F) -> Option<usize>
    where Self: Sized, K: Ord, F: FnMut(&Self::Item) -> K,

    Return the position of the minimum element in the iterator, as -determined by the specified function. Read more
    source§

    fn position_min_by<F>(self, compare: F) -> Option<usize>
    where +determined by the specified function. Read more

    source§

    fn position_min_by<F>(self, compare: F) -> Option<usize>
    where Self: Sized, F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Return the position of the minimum element in the iterator, as -determined by the specified comparison function. Read more
    source§

    fn position_minmax(self) -> MinMaxResult<usize>
    where +determined by the specified comparison function. Read more

    source§

    fn position_minmax(self) -> MinMaxResult<usize>
    where Self: Sized, Self::Item: PartialOrd,

    Return the positions of the minimum and maximum elements in -the iterator. Read more
    source§

    fn position_minmax_by_key<K, F>(self, key: F) -> MinMaxResult<usize>
    where +the iterator. Read more

    source§

    fn position_minmax_by_key<K, F>(self, key: F) -> MinMaxResult<usize>
    where Self: Sized, K: PartialOrd, F: FnMut(&Self::Item) -> K,

    Return the postions of the minimum and maximum elements of an -iterator, as determined by the specified function. Read more
    source§

    fn position_minmax_by<F>(self, compare: F) -> MinMaxResult<usize>
    where +iterator, as determined by the specified function. Read more

    source§

    fn position_minmax_by<F>(self, compare: F) -> MinMaxResult<usize>
    where Self: Sized, F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Return the postions of the minimum and maximum elements of an -iterator, as determined by the specified comparison function. Read more
    source§

    fn exactly_one(self) -> Result<Self::Item, ExactlyOneError<Self>>
    where +iterator, as determined by the specified comparison function. Read more

    source§

    fn exactly_one(self) -> Result<Self::Item, ExactlyOneError<Self>>
    where Self: Sized,

    If the iterator yields exactly one element, that element will be returned, otherwise an error will be returned containing an iterator that has the same output as the input -iterator. Read more
    source§

    fn at_most_one(self) -> Result<Option<Self::Item>, ExactlyOneError<Self>>
    where - Self: Sized,

    If the iterator yields no elements, Ok(None) will be returned. If the iterator yields +iterator. Read more
    source§

    fn at_most_one(self) -> Result<Option<Self::Item>, ExactlyOneError<Self>>
    where + Self: Sized,

    If the iterator yields no elements, Ok(None) will be returned. If the iterator yields exactly one element, that element will be returned, otherwise an error will be returned -containing an iterator that has the same output as the input iterator. Read more
    source§

    fn multipeek(self) -> MultiPeek<Self> ⓘ
    where +containing an iterator that has the same output as the input iterator. Read more

    source§

    fn multipeek(self) -> MultiPeek<Self> ⓘ
    where Self: Sized,

    An iterator adaptor that allows the user to peek at multiple .next() -values without advancing the base iterator. Read more
    source§

    fn counts(self) -> HashMap<Self::Item, usize>
    where +values without advancing the base iterator. Read more

    source§

    fn counts(self) -> HashMap<Self::Item, usize>
    where Self: Sized, Self::Item: Eq + Hash,

    Collect the items in this iterator and return a HashMap which contains each item that appears in the iterator and the number -of times it appears. Read more
    source§

    fn counts_by<K, F>(self, f: F) -> HashMap<K, usize>
    where +of times it appears. Read more

    source§

    fn counts_by<K, F>(self, f: F) -> HashMap<K, usize>
    where Self: Sized, K: Eq + Hash, F: FnMut(Self::Item) -> K,

    Collect the items in this iterator and return a HashMap which contains each item that appears in the iterator and the number of times it appears, -determining identity using a keying function. Read more
    source§

    fn multiunzip<FromI>(self) -> FromI
    where - Self: Sized + MultiUnzip<FromI>,

    Converts an iterator of tuples into a tuple of containers. Read more
    source§

    fn try_len(&self) -> Result<usize, (usize, Option<usize>)>

    Returns the length of the iterator if one exists. +determining identity using a keying function. Read more
    source§

    fn multiunzip<FromI>(self) -> FromI
    where + Self: Sized + MultiUnzip<FromI>,

    Converts an iterator of tuples into a tuple of containers. Read more
    source§

    fn try_len(&self) -> Result<usize, (usize, Option<usize>)>

    Returns the length of the iterator if one exists. Otherwise return self.size_hint(). Read more
    source§

    impl<IT> MultiUnzip<()> for IT
    where IT: Iterator<Item = ()>,

    source§

    fn multiunzip(self)

    Unzip this iterator into multiple collections.
    source§

    impl<IT, A, FromA> MultiUnzip<(FromA,)> for IT
    where IT: Iterator<Item = (A,)>, @@ -690,4 +702,4 @@ Otherwise return self.size_hint(). (FromA, FromB, FromC, FromD, FromE, FromF, FromG, FromH, FromI, FromJ, FromK, FromL)

    Unzip this iterator into multiple collections.
    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 + 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/itertools/structs/struct.MergeBy.html b/itertools/structs/struct.MergeBy.html index 52d0eb8db..0610fbd5d 100644 --- a/itertools/structs/struct.MergeBy.html +++ b/itertools/structs/struct.MergeBy.html @@ -1,4 +1,4 @@ -MergeBy in itertools::structs - Rust
    +MergeBy in itertools::structs - Rust

    Struct itertools::structs::MergeBy

    source · 
    pub struct MergeBy<I: Iterator, J: Iterator, F> { /* private fields */ }
    Expand description

    An iterator adaptor that merges the two base iterators in ascending order. If both base iterators are sorted (ascending), the result is sorted.

    Iterator element type is I::Item.

    @@ -12,13 +12,18 @@ If both base iterators are sorted (ascending), the result is sorted.

    I: Iterator + Debug, I::Item: Debug, J: Iterator + Debug, - J::Item: Debug,
    source§

    fn fmt(&self, f: &mut Formatter<'_>) -> Result

    Formats the value using the given formatter. Read more
    source§

    impl<I, J, F> Iterator for MergeBy<I, J, F>
    where + J::Item: Debug,

    source§

    fn fmt(&self, f: &mut Formatter<'_>) -> Result

    Formats the value using the given formatter. Read more
    source§

    impl<I, J, F> Iterator for MergeBy<I, J, F>
    where I: Iterator, J: Iterator, - F: OrderingOrBool<I::Item, J::Item>,

    §

    type Item = <F as OrderingOrBool<<I as Iterator>::Item, <J as Iterator>::Item>>::MergeResult

    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 last(self) -> Option<Self::Item>

    Consumes the iterator, returning the last element. Read more
    source§

    fn nth(&mut self, n: usize) -> Option<Self::Item>

    Returns the nth element of the iterator. Read more
    source§

    fn next_chunk<const N: usize>( + F: OrderingOrBool<I::Item, J::Item>,

    §

    type Item = <F as OrderingOrBool<<I as Iterator>::Item, <J as Iterator>::Item>>::MergeResult

    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 fold<B, G>(self, init: B, f: G) -> B
    where + Self: Sized, + G: FnMut(B, Self::Item) -> B,

    Folds every element into an accumulator by applying an operation, +returning the final result. Read more
    source§

    fn size_hint(&self) -> (usize, Option<usize>)

    Returns the bounds on the remaining length of the iterator. Read more
    source§

    fn nth(&mut self, n: usize) -> Option<Self::Item>

    Returns the nth element 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
    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,

    🔬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.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, @@ -83,10 +88,7 @@ successfully, producing a single, final value. 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 +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>( @@ -190,7 +192,7 @@ greater than or equal to those of another. 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, J, F> FusedIterator for MergeBy<I, J, F>
    where +function. Read more
    source§

    impl<I, J, F> FusedIterator for MergeBy<I, J, F>
    where I: Iterator, J: Iterator, F: OrderingOrBool<I::Item, J::Item>,

    Auto Trait Implementations§

    §

    impl<I, J, F> Freeze for MergeBy<I, J, F>
    where @@ -239,86 +241,87 @@ otherwise. Right variant of Either<Self, Self> otherwise. Read more

    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> Itertools for T
    where - T: Iterator + ?Sized,

    source§

    fn interleave<J>(self, other: J) -> Interleave<Self, J::IntoIter> ⓘ
    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> Itertools for T
    where + T: Iterator + ?Sized,

    source§

    fn interleave<J>(self, other: J) -> Interleave<Self, J::IntoIter> ⓘ
    where J: IntoIterator<Item = Self::Item>, - Self: Sized,

    Alternate elements from two iterators until both have run out. Read more
    source§

    fn interleave_shortest<J>( + Self: Sized,

    Alternate elements from two iterators until both have run out. Read more
    source§

    fn interleave_shortest<J>( self, other: J ) -> InterleaveShortest<Self, J::IntoIter> ⓘ
    where J: IntoIterator<Item = Self::Item>, Self: Sized,

    Alternate elements from two iterators until at least one of them has run -out. Read more
    source§

    fn intersperse(self, element: Self::Item) -> Intersperse<Self>
    where +out. Read more

    source§

    fn intersperse(self, element: Self::Item) -> Intersperse<Self>
    where Self: Sized, Self::Item: Clone,

    An iterator adaptor to insert a particular value -between each element of the adapted iterator. Read more
    source§

    fn intersperse_with<F>(self, element: F) -> IntersperseWith<Self, F> ⓘ
    where +between each element of the adapted iterator. Read more

    source§

    fn intersperse_with<F>(self, element: F) -> IntersperseWith<Self, F> ⓘ
    where Self: Sized, F: FnMut() -> Self::Item,

    An iterator adaptor to insert a particular value created by a function -between each element of the adapted iterator. Read more
    source§

    fn zip_longest<J>(self, other: J) -> ZipLongest<Self, J::IntoIter> ⓘ
    where +between each element of the adapted iterator. Read more

    source§

    fn get<R>(self, index: R) -> R::Output
    where + Self: Sized, + R: IteratorIndex<Self>,

    Returns an iterator over a subsection of the iterator. Read more
    source§

    fn zip_longest<J>(self, other: J) -> ZipLongest<Self, J::IntoIter> ⓘ
    where J: IntoIterator, Self: Sized,

    Create an iterator which iterates over both this and the specified -iterator simultaneously, yielding pairs of two optional elements. Read more
    source§

    fn zip_eq<J>(self, other: J) -> ZipEq<Self, J::IntoIter> ⓘ
    where +iterator simultaneously, yielding pairs of two optional elements. Read more

    source§

    fn zip_eq<J>(self, other: J) -> ZipEq<Self, J::IntoIter> ⓘ
    where J: IntoIterator, Self: Sized,

    Create an iterator which iterates over both this and the specified -iterator simultaneously, yielding pairs of elements. Read more
    source§

    fn batching<B, F>(self, f: F) -> Batching<Self, F> ⓘ
    where +iterator simultaneously, yielding pairs of elements. Read more

    source§

    fn batching<B, F>(self, f: F) -> Batching<Self, F> ⓘ
    where F: FnMut(&mut Self) -> Option<B>, Self: Sized,

    A “meta iterator adaptor”. Its closure receives a reference to the iterator and may pick off as many elements as it likes, to produce the -next iterator element. Read more
    source§

    fn group_by<K, F>(self, key: F) -> GroupBy<K, Self, F>
    where +next iterator element. Read more

    source§

    fn chunk_by<K, F>(self, key: F) -> ChunkBy<K, Self, F>
    where Self: Sized, F: FnMut(&Self::Item) -> K, K: PartialEq,

    Return an iterable that can group iterator elements. Consecutive elements that map to the same key (“runs”), are assigned -to the same group. Read more
    source§

    fn chunks(self, size: usize) -> IntoChunks<Self>
    where - Self: Sized,

    Return an iterable that can chunk the iterator. Read more
    source§

    fn tuple_windows<T>(self) -> TupleWindows<Self, T> ⓘ
    where +to the same group. Read more

    source§

    fn group_by<K, F>(self, key: F) -> ChunkBy<K, Self, F>
    where + Self: Sized, + F: FnMut(&Self::Item) -> K, + K: PartialEq,

    👎Deprecated since 0.13.0: Use .chunk_by() instead
    See .chunk_by().
    source§

    fn chunks(self, size: usize) -> IntoChunks<Self>
    where + Self: Sized,

    Return an iterable that can chunk the iterator. Read more
    source§

    fn tuple_windows<T>(self) -> TupleWindows<Self, T> ⓘ
    where Self: Sized + Iterator<Item = T::Item>, T: HomogeneousTuple, T::Item: Clone,

    Return an iterator over all contiguous windows producing tuples of -a specific size (up to 12). Read more
    source§

    fn circular_tuple_windows<T>(self) -> CircularTupleWindows<Self, T> ⓘ
    where +a specific size (up to 12). Read more

    source§

    fn circular_tuple_windows<T>(self) -> CircularTupleWindows<Self, T> ⓘ
    where Self: Sized + Clone + Iterator<Item = T::Item> + ExactSizeIterator, T: TupleCollect + Clone, T::Item: Clone,

    Return an iterator over all windows, wrapping back to the first elements when the window would otherwise exceed the length of the -iterator, producing tuples of a specific size (up to 12). Read more
    source§

    fn tuples<T>(self) -> Tuples<Self, T> ⓘ
    where +iterator, producing tuples of a specific size (up to 12). Read more

    source§

    fn tuples<T>(self) -> Tuples<Self, T> ⓘ
    where Self: Sized + Iterator<Item = T::Item>, T: HomogeneousTuple,

    Return an iterator that groups the items in tuples of a specific size -(up to 12). Read more
    source§

    fn tee(self) -> (Tee<Self>, Tee<Self>)
    where +(up to 12). Read more

    source§

    fn tee(self) -> (Tee<Self>, Tee<Self>)
    where Self: Sized, Self::Item: Clone,

    Split into an iterator pair that both yield all elements from -the original iterator. Read more
    source§

    fn step(self, n: usize) -> Step<Self> ⓘ
    where - Self: Sized,

    👎Deprecated since 0.8.0: Use std .step_by() instead
    Return an iterator adaptor that steps n elements in the base iterator -for each iteration. Read more
    source§

    fn map_into<R>(self) -> MapInto<Self, R>
    where +the original iterator. Read more

    source§

    fn map_into<R>(self) -> MapInto<Self, R>
    where Self: Sized, - Self::Item: Into<R>,

    Convert each item of the iterator using the Into trait. Read more
    source§

    fn map_results<F, T, U, E>(self, f: F) -> MapOk<Self, F>
    where - Self: Iterator<Item = Result<T, E>> + Sized, - F: FnMut(T) -> U,

    👎Deprecated since 0.10.0: Use .map_ok() instead
    See .map_ok().
    source§

    fn map_ok<F, T, U, E>(self, f: F) -> MapOk<Self, F>
    where + Self::Item: Into<R>,

    Convert each item of the iterator using the Into trait. Read more
    source§

    fn map_ok<F, T, U, E>(self, f: F) -> MapOk<Self, F>
    where Self: Iterator<Item = Result<T, E>> + Sized, F: FnMut(T) -> U,

    Return an iterator adaptor that applies the provided closure to every Result::Ok value. Result::Err values are -unchanged. Read more
    source§

    fn filter_ok<F, T, E>(self, f: F) -> FilterOk<Self, F> ⓘ
    where +unchanged. Read more

    source§

    fn filter_ok<F, T, E>(self, f: F) -> FilterOk<Self, F> ⓘ
    where Self: Iterator<Item = Result<T, E>> + Sized, F: FnMut(&T) -> bool,

    Return an iterator adaptor that filters every Result::Ok value with the provided closure. Result::Err values are -unchanged. Read more
    source§

    fn filter_map_ok<F, T, U, E>(self, f: F) -> FilterMapOk<Self, F> ⓘ
    where +unchanged. Read more

    source§

    fn filter_map_ok<F, T, U, E>(self, f: F) -> FilterMapOk<Self, F> ⓘ
    where Self: Iterator<Item = Result<T, E>> + Sized, F: FnMut(T) -> Option<U>,

    Return an iterator adaptor that filters and transforms every Result::Ok value with the provided closure. Result::Err -values are unchanged. Read more
    source§

    fn flatten_ok<T, E>(self) -> FlattenOk<Self, T, E> ⓘ
    where +values are unchanged. Read more

    source§

    fn flatten_ok<T, E>(self) -> FlattenOk<Self, T, E> ⓘ
    where Self: Iterator<Item = Result<T, E>> + Sized, T: IntoIterator,

    Return an iterator adaptor that flattens every Result::Ok value into -a series of Result::Ok values. Result::Err values are unchanged. Read more
    source§

    fn process_results<F, T, E, R>(self, processor: F) -> Result<R, E>
    where +a series of Result::Ok values. Result::Err values are unchanged. Read more

    source§

    fn process_results<F, T, E, R>(self, processor: F) -> Result<R, E>
    where Self: Iterator<Item = Result<T, E>> + Sized, F: FnOnce(ProcessResults<'_, Self, E>) -> R,

    “Lift” a function of the values of the current iterator so as to process -an iterator of Result values instead. Read more
    source§

    fn merge<J>(self, other: J) -> Merge<Self, J::IntoIter>
    where +an iterator of Result values instead. Read more

    source§

    fn merge<J>(self, other: J) -> Merge<Self, J::IntoIter>
    where Self: Sized, Self::Item: PartialOrd, J: IntoIterator<Item = Self::Item>,

    Return an iterator adaptor that merges the two base iterators in ascending order. If both base iterators are sorted (ascending), the -result is sorted. Read more
    source§

    fn merge_by<J, F>(self, other: J, is_first: F) -> MergeBy<Self, J::IntoIter, F> ⓘ
    where +result is sorted. Read more

    source§

    fn merge_by<J, F>(self, other: J, is_first: F) -> MergeBy<Self, J::IntoIter, F> ⓘ
    where Self: Sized, J: IntoIterator<Item = Self::Item>, F: FnMut(&Self::Item, &Self::Item) -> bool,

    Return an iterator adaptor that merges the two base iterators in order. -This is much like .merge() but allows for a custom ordering. Read more
    source§

    fn merge_join_by<J, F, T>( +This is much like .merge() but allows for a custom ordering. Read more

    source§

    fn merge_join_by<J, F, T>( self, other: J, cmp_fn: F @@ -326,284 +329,295 @@ This is much like IntoIterator, F: FnMut(&Self::Item, &J::Item) -> T, Self: Sized,

    Create an iterator that merges items from both this and the specified -iterator in ascending order. Read more
    source§

    fn kmerge(self) -> KMerge<<Self::Item as IntoIterator>::IntoIter>
    where +iterator in ascending order. Read more

    source§

    fn kmerge(self) -> KMerge<<Self::Item as IntoIterator>::IntoIter>
    where Self: Sized, Self::Item: IntoIterator, <Self::Item as IntoIterator>::Item: PartialOrd,

    Return an iterator adaptor that flattens an iterator of iterators by -merging them in ascending order. Read more
    source§

    fn kmerge_by<F>( +merging them in ascending order. Read more

    source§

    fn kmerge_by<F>( self, first: F ) -> KMergeBy<<Self::Item as IntoIterator>::IntoIter, F> ⓘ
    where Self: Sized, Self::Item: IntoIterator, F: FnMut(&<Self::Item as IntoIterator>::Item, &<Self::Item as IntoIterator>::Item) -> bool,

    Return an iterator adaptor that flattens an iterator of iterators by -merging them according to the given closure. Read more
    source§

    fn cartesian_product<J>(self, other: J) -> Product<Self, J::IntoIter> ⓘ
    where +merging them according to the given closure. Read more

    source§

    fn cartesian_product<J>(self, other: J) -> Product<Self, J::IntoIter> ⓘ
    where Self: Sized, Self::Item: Clone, J: IntoIterator, J::IntoIter: Clone,

    Return an iterator adaptor that iterates over the cartesian product of -the element sets of two iterators self and J. Read more
    source§

    fn multi_cartesian_product( +the element sets of two iterators self and J. Read more

    source§

    fn multi_cartesian_product( self ) -> MultiProduct<<Self::Item as IntoIterator>::IntoIter> ⓘ
    where Self: Sized, Self::Item: IntoIterator, <Self::Item as IntoIterator>::IntoIter: Clone, <Self::Item as IntoIterator>::Item: Clone,

    Return an iterator adaptor that iterates over the cartesian product of -all subiterators returned by meta-iterator self. Read more
    source§

    fn coalesce<F>(self, f: F) -> Coalesce<Self, F>
    where +all subiterators returned by meta-iterator self. Read more

    source§

    fn coalesce<F>(self, f: F) -> Coalesce<Self, F>
    where Self: Sized, F: FnMut(Self::Item, Self::Item) -> Result<Self::Item, (Self::Item, Self::Item)>,

    Return an iterator adaptor that uses the passed-in closure to -optionally merge together consecutive elements. Read more
    source§

    fn dedup(self) -> Dedup<Self>
    where +optionally merge together consecutive elements. Read more

    source§

    fn dedup(self) -> Dedup<Self>
    where Self: Sized, Self::Item: PartialEq,

    Remove duplicates from sections of consecutive identical elements. -If the iterator is sorted, all elements will be unique. Read more
    source§

    fn dedup_by<Cmp>(self, cmp: Cmp) -> DedupBy<Self, Cmp>
    where +If the iterator is sorted, all elements will be unique. Read more

    source§

    fn dedup_by<Cmp>(self, cmp: Cmp) -> DedupBy<Self, Cmp>
    where Self: Sized, Cmp: FnMut(&Self::Item, &Self::Item) -> bool,

    Remove duplicates from sections of consecutive identical elements, determining equality using a comparison function. -If the iterator is sorted, all elements will be unique. Read more
    source§

    fn dedup_with_count(self) -> DedupWithCount<Self>
    where +If the iterator is sorted, all elements will be unique. Read more

    source§

    fn dedup_with_count(self) -> DedupWithCount<Self>
    where Self: Sized,

    Remove duplicates from sections of consecutive identical elements, while keeping a count of how many repeated elements were present. -If the iterator is sorted, all elements will be unique. Read more
    source§

    fn dedup_by_with_count<Cmp>(self, cmp: Cmp) -> DedupByWithCount<Self, Cmp>
    where +If the iterator is sorted, all elements will be unique. Read more

    source§

    fn dedup_by_with_count<Cmp>(self, cmp: Cmp) -> DedupByWithCount<Self, Cmp>
    where Self: Sized, Cmp: FnMut(&Self::Item, &Self::Item) -> bool,

    Remove duplicates from sections of consecutive identical elements, while keeping a count of how many repeated elements were present. This will determine equality using a comparison function. -If the iterator is sorted, all elements will be unique. Read more
    source§

    fn duplicates(self) -> Duplicates<Self>
    where +If the iterator is sorted, all elements will be unique. Read more

    source§

    fn duplicates(self) -> Duplicates<Self>
    where Self: Sized, Self::Item: Eq + Hash,

    Return an iterator adaptor that produces elements that appear more than once during the -iteration. Duplicates are detected using hash and equality. Read more
    source§

    fn duplicates_by<V, F>(self, f: F) -> DuplicatesBy<Self, V, F>
    where +iteration. Duplicates are detected using hash and equality. Read more

    source§

    fn duplicates_by<V, F>(self, f: F) -> DuplicatesBy<Self, V, F>
    where Self: Sized, V: Eq + Hash, F: FnMut(&Self::Item) -> V,

    Return an iterator adaptor that produces elements that appear more than once during the -iteration. Duplicates are detected using hash and equality. Read more
    source§

    fn unique(self) -> Unique<Self> ⓘ
    where +iteration. Duplicates are detected using hash and equality. Read more

    source§

    fn unique(self) -> Unique<Self> ⓘ
    where Self: Sized, Self::Item: Clone + Eq + Hash,

    Return an iterator adaptor that filters out elements that have already been produced once during the iteration. Duplicates -are detected using hash and equality. Read more
    source§

    fn unique_by<V, F>(self, f: F) -> UniqueBy<Self, V, F> ⓘ
    where +are detected using hash and equality. Read more

    source§

    fn unique_by<V, F>(self, f: F) -> UniqueBy<Self, V, F> ⓘ
    where Self: Sized, V: Eq + Hash, F: FnMut(&Self::Item) -> V,

    Return an iterator adaptor that filters out elements that have -already been produced once during the iteration. Read more
    source§

    fn peeking_take_while<F>(&mut self, accept: F) -> PeekingTakeWhile<'_, Self, F> ⓘ
    where +already been produced once during the iteration. Read more

    source§

    fn peeking_take_while<F>(&mut self, accept: F) -> PeekingTakeWhile<'_, Self, F> ⓘ
    where Self: Sized + PeekingNext, F: FnMut(&Self::Item) -> bool,

    Return an iterator adaptor that borrows from this iterator and -takes items while the closure accept returns true. Read more
    source§

    fn take_while_ref<F>(&mut self, accept: F) -> TakeWhileRef<'_, Self, F> ⓘ
    where +takes items while the closure accept returns true. Read more

    source§

    fn take_while_ref<F>(&mut self, accept: F) -> TakeWhileRef<'_, Self, F> ⓘ
    where Self: Clone, F: FnMut(&Self::Item) -> bool,

    Return an iterator adaptor that borrows from a Clone-able iterator -to only pick off elements while the predicate accept returns true. Read more
    source§

    fn take_while_inclusive<F>(self, accept: F) -> TakeWhileInclusive<Self, F> ⓘ
    where +to only pick off elements while the predicate accept returns true. Read more

    source§

    fn take_while_inclusive<F>(self, accept: F) -> TakeWhileInclusive<Self, F> ⓘ
    where Self: Sized, F: FnMut(&Self::Item) -> bool,

    Returns an iterator adaptor that consumes elements while the given predicate is true, including the element for which the predicate -first returned false. Read more
    source§

    fn while_some<A>(self) -> WhileSome<Self> ⓘ
    where +first returned false. Read more

    source§

    fn while_some<A>(self) -> WhileSome<Self> ⓘ
    where Self: Sized + Iterator<Item = Option<A>>,

    Return an iterator adaptor that filters Option<A> iterator elements -and produces A. Stops on the first None encountered. Read more
    source§

    fn tuple_combinations<T>(self) -> TupleCombinations<Self, T> ⓘ
    where +and produces A. Stops on the first None encountered. Read more

    source§

    fn tuple_combinations<T>(self) -> TupleCombinations<Self, T> ⓘ
    where Self: Sized + Clone, Self::Item: Clone, T: HasCombination<Self>,

    Return an iterator adaptor that iterates over the combinations of the -elements from an iterator. Read more
    source§

    fn combinations(self, k: usize) -> Combinations<Self> ⓘ
    where +elements from an iterator. Read more

    source§

    fn combinations(self, k: usize) -> Combinations<Self> ⓘ
    where Self: Sized, Self::Item: Clone,

    Return an iterator adaptor that iterates over the k-length combinations of -the elements from an iterator. Read more
    source§

    fn combinations_with_replacement( +the elements from an iterator. Read more

    source§

    fn combinations_with_replacement( self, k: usize ) -> CombinationsWithReplacement<Self> ⓘ
    where Self: Sized, Self::Item: Clone,

    Return an iterator that iterates over the k-length combinations of -the elements from an iterator, with replacement. Read more
    source§

    fn permutations(self, k: usize) -> Permutations<Self> ⓘ
    where +the elements from an iterator, with replacement. Read more

    source§

    fn permutations(self, k: usize) -> Permutations<Self> ⓘ
    where Self: Sized, Self::Item: Clone,

    Return an iterator adaptor that iterates over all k-permutations of the -elements from an iterator. Read more
    source§

    fn powerset(self) -> Powerset<Self> ⓘ
    where +elements from an iterator. Read more

    source§

    fn powerset(self) -> Powerset<Self> ⓘ
    where Self: Sized, Self::Item: Clone,

    Return an iterator that iterates through the powerset of the elements from an -iterator. Read more
    source§

    fn pad_using<F>(self, min: usize, f: F) -> PadUsing<Self, F> ⓘ
    where +iterator. Read more

    source§

    fn pad_using<F>(self, min: usize, f: F) -> PadUsing<Self, F> ⓘ
    where Self: Sized, F: FnMut(usize) -> Self::Item,

    Return an iterator adaptor that pads the sequence to a minimum length of -min by filling missing elements using a closure f. Read more
    source§

    fn with_position(self) -> WithPosition<Self> ⓘ
    where +min by filling missing elements using a closure f. Read more

    source§

    fn with_position(self) -> WithPosition<Self> ⓘ
    where Self: Sized,

    Return an iterator adaptor that combines each element with a Position to -ease special-case handling of the first or last elements. Read more
    source§

    fn positions<P>(self, predicate: P) -> Positions<Self, P> ⓘ
    where +ease special-case handling of the first or last elements. Read more

    source§

    fn positions<P>(self, predicate: P) -> Positions<Self, P> ⓘ
    where Self: Sized, P: FnMut(Self::Item) -> bool,

    Return an iterator adaptor that yields the indices of all elements -satisfying a predicate, counted from the start of the iterator. Read more
    source§

    fn update<F>(self, updater: F) -> Update<Self, F> ⓘ
    where +satisfying a predicate, counted from the start of the iterator. Read more

    source§

    fn update<F>(self, updater: F) -> Update<Self, F> ⓘ
    where Self: Sized, F: FnMut(&mut Self::Item),

    Return an iterator adaptor that applies a mutating function -to each element before yielding it. Read more
    source§

    fn next_tuple<T>(&mut self) -> Option<T>
    where +to each element before yielding it. Read more

    source§

    fn next_tuple<T>(&mut self) -> Option<T>
    where Self: Sized + Iterator<Item = T::Item>, T: HomogeneousTuple,

    Advances the iterator and returns the next items grouped in a tuple of -a specific size (up to 12). Read more
    source§

    fn collect_tuple<T>(self) -> Option<T>
    where +a specific size (up to 12). Read more

    source§

    fn collect_tuple<T>(self) -> Option<T>
    where Self: Sized + Iterator<Item = T::Item>, T: HomogeneousTuple,

    Collects all items from the iterator into a tuple of a specific size -(up to 12). Read more
    source§

    fn find_position<P>(&mut self, pred: P) -> Option<(usize, Self::Item)>
    where - P: FnMut(&Self::Item) -> bool,

    Find the position and value of the first element satisfying a predicate. Read more
    source§

    fn find_or_last<P>(self, predicate: P) -> Option<Self::Item>
    where +(up to 12). Read more

    source§

    fn find_position<P>(&mut self, pred: P) -> Option<(usize, Self::Item)>
    where + P: FnMut(&Self::Item) -> bool,

    Find the position and value of the first element satisfying a predicate. Read more
    source§

    fn find_or_last<P>(self, predicate: P) -> Option<Self::Item>
    where Self: Sized, - P: FnMut(&Self::Item) -> bool,

    Find the value of the first element satisfying a predicate or return the last element, if any. Read more
    source§

    fn find_or_first<P>(self, predicate: P) -> Option<Self::Item>
    where + P: FnMut(&Self::Item) -> bool,

    Find the value of the first element satisfying a predicate or return the last element, if any. Read more
    source§

    fn find_or_first<P>(self, predicate: P) -> Option<Self::Item>
    where Self: Sized, - P: FnMut(&Self::Item) -> bool,

    Find the value of the first element satisfying a predicate or return the first element, if any. Read more
    source§

    fn contains<Q>(&mut self, query: &Q) -> bool
    where + P: FnMut(&Self::Item) -> bool,

    Find the value of the first element satisfying a predicate or return the first element, if any. Read more
    source§

    fn contains<Q>(&mut self, query: &Q) -> bool
    where Self: Sized, Self::Item: Borrow<Q>, - Q: PartialEq,

    Returns true if the given item is present in this iterator. Read more
    source§

    fn all_equal(&mut self) -> bool
    where + Q: PartialEq,

    Returns true if the given item is present in this iterator. Read more
    source§

    fn all_equal(&mut self) -> bool
    where Self: Sized, - Self::Item: PartialEq,

    Check whether all elements compare equal. Read more
    source§

    fn all_equal_value( + Self::Item: PartialEq,

    Check whether all elements compare equal. Read more
    source§

    fn all_equal_value( &mut self ) -> Result<Self::Item, Option<(Self::Item, Self::Item)>>
    where Self: Sized, Self::Item: PartialEq,

    If there are elements and they are all equal, return a single copy of that element. If there are no elements, return an Error containing None. If there are elements and they are not all equal, return a tuple containing the first -two non-equal elements found. Read more
    source§

    fn all_unique(&mut self) -> bool
    where +two non-equal elements found. Read more

    source§

    fn all_unique(&mut self) -> bool
    where Self: Sized, - Self::Item: Eq + Hash,

    Check whether all elements are unique (non equal). Read more
    source§

    fn dropping(self, n: usize) -> Self
    where + Self::Item: Eq + Hash,

    Check whether all elements are unique (non equal). Read more
    source§

    fn dropping(self, n: usize) -> Self
    where Self: Sized,

    Consume the first n elements from the iterator eagerly, -and return the same iterator again. Read more
    source§

    fn dropping_back(self, n: usize) -> Self
    where +and return the same iterator again. Read more

    source§

    fn dropping_back(self, n: usize) -> Self
    where Self: Sized + DoubleEndedIterator,

    Consume the last n elements from the iterator eagerly, -and return the same iterator again. Read more
    source§

    fn foreach<F>(self, f: F)
    where - F: FnMut(Self::Item), - Self: Sized,

    👎Deprecated since 0.8.0: Use .for_each() instead
    Run the closure f eagerly on each element of the iterator. Read more
    source§

    fn concat(self) -> Self::Item
    where +and return the same iterator again. Read more

    source§

    fn concat(self) -> Self::Item
    where Self: Sized, - Self::Item: Extend<<<Self as Iterator>::Item as IntoIterator>::Item> + IntoIterator + Default,

    Combine all an iterator’s elements into one element by using Extend. Read more
    source§

    fn collect_vec(self) -> Vec<Self::Item>
    where + Self::Item: Extend<<<Self as Iterator>::Item as IntoIterator>::Item> + IntoIterator + Default,

    Combine all an iterator’s elements into one element by using Extend. Read more
    source§

    fn collect_vec(self) -> Vec<Self::Item>
    where Self: Sized,

    .collect_vec() is simply a type specialization of Iterator::collect, -for convenience.
    source§

    fn try_collect<T, U, E>(self) -> Result<U, E>
    where +for convenience.

    source§

    fn try_collect<T, U, E>(self) -> Result<U, E>
    where Self: Sized + Iterator<Item = Result<T, E>>, Result<U, E>: FromIterator<Result<T, E>>,

    .try_collect() is more convenient way of writing -.collect::<Result<_, _>>() Read more
    source§

    fn set_from<'a, A: 'a, J>(&mut self, from: J) -> usize
    where +.collect::<Result<_, _>>() Read more

    source§

    fn set_from<'a, A: 'a, J>(&mut self, from: J) -> usize
    where Self: Iterator<Item = &'a mut A>, J: IntoIterator<Item = A>,

    Assign to each reference in self from the from iterator, -stopping at the shortest of the two iterators. Read more
    source§

    fn join(&mut self, sep: &str) -> String
    where - Self::Item: Display,

    Combine all iterator elements into one String, separated by sep. Read more
    source§

    fn format(self, sep: &str) -> Format<'_, Self>
    where - Self: Sized,

    Format all iterator elements, separated by sep. Read more
    source§

    fn format_with<F>(self, sep: &str, format: F) -> FormatWith<'_, Self, F>
    where +stopping at the shortest of the two iterators. Read more

    source§

    fn join(&mut self, sep: &str) -> String
    where + Self::Item: Display,

    Combine all iterator elements into one String, separated by sep. Read more
    source§

    fn format(self, sep: &str) -> Format<'_, Self>
    where + Self: Sized,

    Format all iterator elements, separated by sep. Read more
    source§

    fn format_with<F>(self, sep: &str, format: F) -> FormatWith<'_, Self, F>
    where Self: Sized, - F: FnMut(Self::Item, &mut dyn FnMut(&dyn Display) -> Result) -> Result,

    Format all iterator elements, separated by sep. Read more
    source§

    fn fold_results<A, E, B, F>(&mut self, start: B, f: F) -> Result<B, E>
    where + F: FnMut(Self::Item, &mut dyn FnMut(&dyn Display) -> Result) -> Result,

    Format all iterator elements, separated by sep. Read more
    source§

    fn fold_ok<A, E, B, F>(&mut self, start: B, f: F) -> Result<B, E>
    where Self: Iterator<Item = Result<A, E>>, - F: FnMut(B, A) -> B,

    👎Deprecated since 0.10.0: Use .fold_ok() instead
    See .fold_ok().
    source§

    fn fold_ok<A, E, B, F>(&mut self, start: B, f: F) -> Result<B, E>
    where - Self: Iterator<Item = Result<A, E>>, - F: FnMut(B, A) -> B,

    Fold Result values from an iterator. Read more
    source§

    fn fold_options<A, B, F>(&mut self, start: B, f: F) -> Option<B>
    where + F: FnMut(B, A) -> B,

    Fold Result values from an iterator. Read more
    source§

    fn fold_options<A, B, F>(&mut self, start: B, f: F) -> Option<B>
    where Self: Iterator<Item = Option<A>>, - F: FnMut(B, A) -> B,

    Fold Option values from an iterator. Read more
    source§

    fn fold1<F>(self, f: F) -> Option<Self::Item>
    where + F: FnMut(B, A) -> B,

    Fold Option values from an iterator. Read more
    source§

    fn fold1<F>(self, f: F) -> Option<Self::Item>
    where F: FnMut(Self::Item, Self::Item) -> Self::Item, - Self: Sized,

    👎Deprecated since 0.10.2: Use Iterator::reduce instead
    Accumulator of the elements in the iterator. Read more
    source§

    fn tree_fold1<F>(self, f: F) -> Option<Self::Item>
    where + Self: Sized,

    👎Deprecated since 0.10.2: Use Iterator::reduce instead
    Accumulator of the elements in the iterator. Read more
    source§

    fn tree_reduce<F>(self, f: F) -> Option<Self::Item>
    where F: FnMut(Self::Item, Self::Item) -> Self::Item, - Self: Sized,

    Accumulate the elements in the iterator in a tree-like manner. Read more
    source§

    fn fold_while<B, F>(&mut self, init: B, f: F) -> FoldWhile<B>
    where + Self: Sized,

    Accumulate the elements in the iterator in a tree-like manner. Read more
    source§

    fn tree_fold1<F>(self, f: F) -> Option<Self::Item>
    where + F: FnMut(Self::Item, Self::Item) -> Self::Item, + Self: Sized,

    👎Deprecated since 0.13.0: Use .tree_reduce() instead
    See .tree_reduce().
    source§

    fn fold_while<B, F>(&mut self, init: B, f: F) -> FoldWhile<B>
    where Self: Sized, - F: FnMut(B, Self::Item) -> FoldWhile<B>,

    An iterator method that applies a function, producing a single, final value. Read more
    source§

    fn sum1<S>(self) -> Option<S>
    where + F: FnMut(B, Self::Item) -> FoldWhile<B>,

    An iterator method that applies a function, producing a single, final value. Read more
    source§

    fn sum1<S>(self) -> Option<S>
    where Self: Sized, - S: Sum<Self::Item>,

    Iterate over the entire iterator and add all the elements. Read more
    source§

    fn product1<P>(self) -> Option<P>
    where + S: Sum<Self::Item>,

    Iterate over the entire iterator and add all the elements. Read more
    source§

    fn product1<P>(self) -> Option<P>
    where Self: Sized, - P: Product<Self::Item>,

    Iterate over the entire iterator and multiply all the elements. Read more
    source§

    fn sorted_unstable(self) -> IntoIter<Self::Item> ⓘ
    where + P: Product<Self::Item>,

    Iterate over the entire iterator and multiply all the elements. Read more
    source§

    fn sorted_unstable(self) -> IntoIter<Self::Item> ⓘ
    where Self: Sized, - Self::Item: Ord,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_unstable_by<F>(self, cmp: F) -> IntoIter<Self::Item> ⓘ
    where + Self::Item: Ord,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_unstable_by<F>(self, cmp: F) -> IntoIter<Self::Item> ⓘ
    where Self: Sized, - F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_unstable_by_key<K, F>(self, f: F) -> IntoIter<Self::Item> ⓘ
    where + F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_unstable_by_key<K, F>(self, f: F) -> IntoIter<Self::Item> ⓘ
    where Self: Sized, K: Ord, - F: FnMut(&Self::Item) -> K,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted(self) -> IntoIter<Self::Item> ⓘ
    where + F: FnMut(&Self::Item) -> K,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted(self) -> IntoIter<Self::Item> ⓘ
    where Self: Sized, - Self::Item: Ord,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_by<F>(self, cmp: F) -> IntoIter<Self::Item> ⓘ
    where + Self::Item: Ord,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_by<F>(self, cmp: F) -> IntoIter<Self::Item> ⓘ
    where Self: Sized, - F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_by_key<K, F>(self, f: F) -> IntoIter<Self::Item> ⓘ
    where + F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_by_key<K, F>(self, f: F) -> IntoIter<Self::Item> ⓘ
    where Self: Sized, K: Ord, - F: FnMut(&Self::Item) -> K,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_by_cached_key<K, F>(self, f: F) -> IntoIter<Self::Item> ⓘ
    where + F: FnMut(&Self::Item) -> K,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_by_cached_key<K, F>(self, f: F) -> IntoIter<Self::Item> ⓘ
    where Self: Sized, K: Ord, F: FnMut(&Self::Item) -> K,

    Sort all iterator elements into a new iterator in ascending order. The key function is -called exactly once per key. Read more
    source§

    fn k_smallest(self, k: usize) -> IntoIter<Self::Item> ⓘ
    where +called exactly once per key. Read more

    source§

    fn k_smallest(self, k: usize) -> IntoIter<Self::Item> ⓘ
    where Self: Sized, - Self::Item: Ord,

    Sort the k smallest elements into a new iterator, in ascending order. Read more
    source§

    fn partition_map<A, B, F, L, R>(self, predicate: F) -> (A, B)
    where + Self::Item: Ord,

    Sort the k smallest elements into a new iterator, in ascending order. Read more
    source§

    fn k_smallest_by<F>(self, k: usize, cmp: F) -> IntoIter<Self::Item> ⓘ
    where + Self: Sized, + F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Sort the k smallest elements into a new iterator using the provided comparison. Read more
    source§

    fn k_smallest_by_key<F, K>(self, k: usize, key: F) -> IntoIter<Self::Item> ⓘ
    where + Self: Sized, + F: FnMut(&Self::Item) -> K, + K: Ord,

    Return the elements producing the k smallest outputs of the provided function. Read more
    source§

    fn k_largest(self, k: usize) -> IntoIter<Self::Item> ⓘ
    where + Self: Sized, + Self::Item: Ord,

    Sort the k largest elements into a new iterator, in descending order. Read more
    source§

    fn k_largest_by<F>(self, k: usize, cmp: F) -> IntoIter<Self::Item> ⓘ
    where + Self: Sized, + F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Sort the k largest elements into a new iterator using the provided comparison. Read more
    source§

    fn k_largest_by_key<F, K>(self, k: usize, key: F) -> IntoIter<Self::Item> ⓘ
    where + Self: Sized, + F: FnMut(&Self::Item) -> K, + K: Ord,

    Return the elements producing the k largest outputs of the provided function. Read more
    source§

    fn tail(self, n: usize) -> IntoIter<Self::Item> ⓘ
    where + Self: Sized,

    Consumes the iterator and return an iterator of the last n elements. Read more
    source§

    fn partition_map<A, B, F, L, R>(self, predicate: F) -> (A, B)
    where Self: Sized, F: FnMut(Self::Item) -> Either<L, R>, A: Default + Extend<L>, B: Default + Extend<R>,

    Collect all iterator elements into one of two partitions. Unlike Iterator::partition, each partition may -have a distinct type. Read more
    source§

    fn partition_result<A, B, T, E>(self) -> (A, B)
    where +have a distinct type. Read more

    source§

    fn partition_result<A, B, T, E>(self) -> (A, B)
    where Self: Iterator<Item = Result<T, E>> + Sized, A: Default + Extend<T>, B: Default + Extend<E>,

    Partition a sequence of Results into one list of all the Ok elements -and another list of all the Err elements. Read more
    source§

    fn into_group_map<K, V>(self) -> HashMap<K, Vec<V>>
    where +and another list of all the Err elements. Read more

    source§

    fn into_group_map<K, V>(self) -> HashMap<K, Vec<V>>
    where Self: Iterator<Item = (K, V)> + Sized, K: Hash + Eq,

    Return a HashMap of keys mapped to Vecs of values. Keys and values -are taken from (Key, Value) tuple pairs yielded by the input iterator. Read more
    source§

    fn into_group_map_by<K, V, F>(self, f: F) -> HashMap<K, Vec<V>>
    where +are taken from (Key, Value) tuple pairs yielded by the input iterator. Read more

    source§

    fn into_group_map_by<K, V, F>(self, f: F) -> HashMap<K, Vec<V>>
    where Self: Iterator<Item = V> + Sized, K: Hash + Eq, - F: Fn(&V) -> K,

    Return an Iterator on a HashMap. Keys mapped to Vecs of values. The key is specified -in the closure. Read more
    source§

    fn into_grouping_map<K, V>(self) -> GroupingMap<Self>
    where + F: FnMut(&V) -> K,

    Return an Iterator on a HashMap. Keys mapped to Vecs of values. The key is specified +in the closure. Read more
    source§

    fn into_grouping_map<K, V>(self) -> GroupingMap<Self>
    where Self: Iterator<Item = (K, V)> + Sized, K: Hash + Eq,

    Constructs a GroupingMap to be used later with one of the efficient -group-and-fold operations it allows to perform. Read more
    source§

    fn into_grouping_map_by<K, V, F>(self, key_mapper: F) -> GroupingMapBy<Self, F>
    where +group-and-fold operations it allows to perform. Read more

    source§

    fn into_grouping_map_by<K, V, F>(self, key_mapper: F) -> GroupingMapBy<Self, F>
    where Self: Iterator<Item = V> + Sized, K: Hash + Eq, F: FnMut(&V) -> K,

    Constructs a GroupingMap to be used later with one of the efficient -group-and-fold operations it allows to perform. Read more
    source§

    fn min_set(self) -> Vec<Self::Item>
    where +group-and-fold operations it allows to perform. Read more

    source§

    fn min_set(self) -> Vec<Self::Item>
    where Self: Sized, - Self::Item: Ord,

    Return all minimum elements of an iterator. Read more
    source§

    fn min_set_by<F>(self, compare: F) -> Vec<Self::Item>
    where + Self::Item: Ord,

    Return all minimum elements of an iterator. Read more
    source§

    fn min_set_by<F>(self, compare: F) -> Vec<Self::Item>
    where Self: Sized, F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Return all minimum elements of an iterator, as determined by -the specified function. Read more
    source§

    fn min_set_by_key<K, F>(self, key: F) -> Vec<Self::Item>
    where +the specified function. Read more

    source§

    fn min_set_by_key<K, F>(self, key: F) -> Vec<Self::Item>
    where Self: Sized, K: Ord, F: FnMut(&Self::Item) -> K,

    Return all minimum elements of an iterator, as determined by -the specified function. Read more
    source§

    fn max_set(self) -> Vec<Self::Item>
    where +the specified function. Read more

    source§

    fn max_set(self) -> Vec<Self::Item>
    where Self: Sized, - Self::Item: Ord,

    Return all maximum elements of an iterator. Read more
    source§

    fn max_set_by<F>(self, compare: F) -> Vec<Self::Item>
    where + Self::Item: Ord,

    Return all maximum elements of an iterator. Read more
    source§

    fn max_set_by<F>(self, compare: F) -> Vec<Self::Item>
    where Self: Sized, F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Return all maximum elements of an iterator, as determined by -the specified function. Read more
    source§

    fn max_set_by_key<K, F>(self, key: F) -> Vec<Self::Item>
    where +the specified function. Read more

    source§

    fn max_set_by_key<K, F>(self, key: F) -> Vec<Self::Item>
    where Self: Sized, K: Ord, F: FnMut(&Self::Item) -> K,

    Return all maximum elements of an iterator, as determined by -the specified function. Read more
    source§

    fn minmax(self) -> MinMaxResult<Self::Item>
    where +the specified function. Read more

    source§

    fn minmax(self) -> MinMaxResult<Self::Item>
    where Self: Sized, - Self::Item: PartialOrd,

    Return the minimum and maximum elements in the iterator. Read more
    source§

    fn minmax_by_key<K, F>(self, key: F) -> MinMaxResult<Self::Item>
    where + Self::Item: PartialOrd,

    Return the minimum and maximum elements in the iterator. Read more
    source§

    fn minmax_by_key<K, F>(self, key: F) -> MinMaxResult<Self::Item>
    where Self: Sized, K: PartialOrd, F: FnMut(&Self::Item) -> K,

    Return the minimum and maximum element of an iterator, as determined by -the specified function. Read more
    source§

    fn minmax_by<F>(self, compare: F) -> MinMaxResult<Self::Item>
    where +the specified function. Read more

    source§

    fn minmax_by<F>(self, compare: F) -> MinMaxResult<Self::Item>
    where Self: Sized, F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Return the minimum and maximum element of an iterator, as determined by -the specified comparison function. Read more
    source§

    fn position_max(self) -> Option<usize>
    where +the specified comparison function. Read more

    source§

    fn position_max(self) -> Option<usize>
    where Self: Sized, - Self::Item: Ord,

    Return the position of the maximum element in the iterator. Read more
    source§

    fn position_max_by_key<K, F>(self, key: F) -> Option<usize>
    where + Self::Item: Ord,

    Return the position of the maximum element in the iterator. Read more
    source§

    fn position_max_by_key<K, F>(self, key: F) -> Option<usize>
    where Self: Sized, K: Ord, F: FnMut(&Self::Item) -> K,

    Return the position of the maximum element in the iterator, as -determined by the specified function. Read more
    source§

    fn position_max_by<F>(self, compare: F) -> Option<usize>
    where +determined by the specified function. Read more

    source§

    fn position_max_by<F>(self, compare: F) -> Option<usize>
    where Self: Sized, F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Return the position of the maximum element in the iterator, as -determined by the specified comparison function. Read more
    source§

    fn position_min(self) -> Option<usize>
    where +determined by the specified comparison function. Read more

    source§

    fn position_min(self) -> Option<usize>
    where Self: Sized, - Self::Item: Ord,

    Return the position of the minimum element in the iterator. Read more
    source§

    fn position_min_by_key<K, F>(self, key: F) -> Option<usize>
    where + Self::Item: Ord,

    Return the position of the minimum element in the iterator. Read more
    source§

    fn position_min_by_key<K, F>(self, key: F) -> Option<usize>
    where Self: Sized, K: Ord, F: FnMut(&Self::Item) -> K,

    Return the position of the minimum element in the iterator, as -determined by the specified function. Read more
    source§

    fn position_min_by<F>(self, compare: F) -> Option<usize>
    where +determined by the specified function. Read more

    source§

    fn position_min_by<F>(self, compare: F) -> Option<usize>
    where Self: Sized, F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Return the position of the minimum element in the iterator, as -determined by the specified comparison function. Read more
    source§

    fn position_minmax(self) -> MinMaxResult<usize>
    where +determined by the specified comparison function. Read more

    source§

    fn position_minmax(self) -> MinMaxResult<usize>
    where Self: Sized, Self::Item: PartialOrd,

    Return the positions of the minimum and maximum elements in -the iterator. Read more
    source§

    fn position_minmax_by_key<K, F>(self, key: F) -> MinMaxResult<usize>
    where +the iterator. Read more

    source§

    fn position_minmax_by_key<K, F>(self, key: F) -> MinMaxResult<usize>
    where Self: Sized, K: PartialOrd, F: FnMut(&Self::Item) -> K,

    Return the postions of the minimum and maximum elements of an -iterator, as determined by the specified function. Read more
    source§

    fn position_minmax_by<F>(self, compare: F) -> MinMaxResult<usize>
    where +iterator, as determined by the specified function. Read more

    source§

    fn position_minmax_by<F>(self, compare: F) -> MinMaxResult<usize>
    where Self: Sized, F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Return the postions of the minimum and maximum elements of an -iterator, as determined by the specified comparison function. Read more
    source§

    fn exactly_one(self) -> Result<Self::Item, ExactlyOneError<Self>>
    where +iterator, as determined by the specified comparison function. Read more

    source§

    fn exactly_one(self) -> Result<Self::Item, ExactlyOneError<Self>>
    where Self: Sized,

    If the iterator yields exactly one element, that element will be returned, otherwise an error will be returned containing an iterator that has the same output as the input -iterator. Read more
    source§

    fn at_most_one(self) -> Result<Option<Self::Item>, ExactlyOneError<Self>>
    where - Self: Sized,

    If the iterator yields no elements, Ok(None) will be returned. If the iterator yields +iterator. Read more
    source§

    fn at_most_one(self) -> Result<Option<Self::Item>, ExactlyOneError<Self>>
    where + Self: Sized,

    If the iterator yields no elements, Ok(None) will be returned. If the iterator yields exactly one element, that element will be returned, otherwise an error will be returned -containing an iterator that has the same output as the input iterator. Read more
    source§

    fn multipeek(self) -> MultiPeek<Self> ⓘ
    where +containing an iterator that has the same output as the input iterator. Read more

    source§

    fn multipeek(self) -> MultiPeek<Self> ⓘ
    where Self: Sized,

    An iterator adaptor that allows the user to peek at multiple .next() -values without advancing the base iterator. Read more
    source§

    fn counts(self) -> HashMap<Self::Item, usize>
    where +values without advancing the base iterator. Read more

    source§

    fn counts(self) -> HashMap<Self::Item, usize>
    where Self: Sized, Self::Item: Eq + Hash,

    Collect the items in this iterator and return a HashMap which contains each item that appears in the iterator and the number -of times it appears. Read more
    source§

    fn counts_by<K, F>(self, f: F) -> HashMap<K, usize>
    where +of times it appears. Read more

    source§

    fn counts_by<K, F>(self, f: F) -> HashMap<K, usize>
    where Self: Sized, K: Eq + Hash, F: FnMut(Self::Item) -> K,

    Collect the items in this iterator and return a HashMap which contains each item that appears in the iterator and the number of times it appears, -determining identity using a keying function. Read more
    source§

    fn multiunzip<FromI>(self) -> FromI
    where - Self: Sized + MultiUnzip<FromI>,

    Converts an iterator of tuples into a tuple of containers. Read more
    source§

    fn try_len(&self) -> Result<usize, (usize, Option<usize>)>

    Returns the length of the iterator if one exists. +determining identity using a keying function. Read more
    source§

    fn multiunzip<FromI>(self) -> FromI
    where + Self: Sized + MultiUnzip<FromI>,

    Converts an iterator of tuples into a tuple of containers. Read more
    source§

    fn try_len(&self) -> Result<usize, (usize, Option<usize>)>

    Returns the length of the iterator if one exists. Otherwise return self.size_hint(). Read more
    source§

    impl<IT> MultiUnzip<()> for IT
    where IT: Iterator<Item = ()>,

    source§

    fn multiunzip(self)

    Unzip this iterator into multiple collections.
    source§

    impl<IT, A, FromA> MultiUnzip<(FromA,)> for IT
    where IT: Iterator<Item = (A,)>, @@ -706,4 +720,4 @@ Otherwise return self.size_hint(). (FromA, FromB, FromC, FromD, FromE, FromF, FromG, FromH, FromI, FromJ, FromK, FromL)

    Unzip this iterator into multiple collections.
    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 + 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/itertools/structs/struct.MultiPeek.html b/itertools/structs/struct.MultiPeek.html index 4825304d0..94bd79c4c 100644 --- a/itertools/structs/struct.MultiPeek.html +++ b/itertools/structs/struct.MultiPeek.html @@ -1,4 +1,4 @@ -MultiPeek in itertools::structs - Rust
    +MultiPeek in itertools::structs - Rust

    Struct itertools::structs::MultiPeek

    source · 
    pub struct MultiPeek<I>
    where
     I: Iterator,
    { /* private fields */ }
    Expand description

    See multipeek() for more information.

    Implementations§

    source§

    impl<I> MultiPeek<I>
    where @@ -192,8 +192,8 @@ greater than or equal to those of another. Read more

    source§

    impl<I> PeekingNext for MultiPeek<I>
    where I: Iterator,

    source§

    fn peeking_next<F>(&mut self, accept: F) -> Option<Self::Item>
    where F: FnOnce(&Self::Item) -> bool,

    Pass a reference to the next iterator element to the closure accept; -if accept returns true, return it as the next element, -else None.

    Auto Trait Implementations§

    §

    impl<I> Freeze for MultiPeek<I>
    where +if accept returns true, return it as the next element, +else None.

    Auto Trait Implementations§

    §

    impl<I> Freeze for MultiPeek<I>
    where I: Freeze,

    §

    impl<I> RefUnwindSafe for MultiPeek<I>
    where I: RefUnwindSafe, <I as Iterator>::Item: RefUnwindSafe,

    §

    impl<I> Send for MultiPeek<I>
    where @@ -220,86 +220,87 @@ otherwise. Right variant of Either<Self, Self> otherwise. Read more

    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> Itertools for T
    where - T: Iterator + ?Sized,

    source§

    fn interleave<J>(self, other: J) -> Interleave<Self, J::IntoIter> ⓘ
    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> Itertools for T
    where + T: Iterator + ?Sized,

    source§

    fn interleave<J>(self, other: J) -> Interleave<Self, J::IntoIter> ⓘ
    where J: IntoIterator<Item = Self::Item>, - Self: Sized,

    Alternate elements from two iterators until both have run out. Read more
    source§

    fn interleave_shortest<J>( + Self: Sized,

    Alternate elements from two iterators until both have run out. Read more
    source§

    fn interleave_shortest<J>( self, other: J ) -> InterleaveShortest<Self, J::IntoIter> ⓘ
    where J: IntoIterator<Item = Self::Item>, Self: Sized,

    Alternate elements from two iterators until at least one of them has run -out. Read more
    source§

    fn intersperse(self, element: Self::Item) -> Intersperse<Self>
    where +out. Read more

    source§

    fn intersperse(self, element: Self::Item) -> Intersperse<Self>
    where Self: Sized, Self::Item: Clone,

    An iterator adaptor to insert a particular value -between each element of the adapted iterator. Read more
    source§

    fn intersperse_with<F>(self, element: F) -> IntersperseWith<Self, F> ⓘ
    where +between each element of the adapted iterator. Read more

    source§

    fn intersperse_with<F>(self, element: F) -> IntersperseWith<Self, F> ⓘ
    where Self: Sized, F: FnMut() -> Self::Item,

    An iterator adaptor to insert a particular value created by a function -between each element of the adapted iterator. Read more
    source§

    fn zip_longest<J>(self, other: J) -> ZipLongest<Self, J::IntoIter> ⓘ
    where +between each element of the adapted iterator. Read more

    source§

    fn get<R>(self, index: R) -> R::Output
    where + Self: Sized, + R: IteratorIndex<Self>,

    Returns an iterator over a subsection of the iterator. Read more
    source§

    fn zip_longest<J>(self, other: J) -> ZipLongest<Self, J::IntoIter> ⓘ
    where J: IntoIterator, Self: Sized,

    Create an iterator which iterates over both this and the specified -iterator simultaneously, yielding pairs of two optional elements. Read more
    source§

    fn zip_eq<J>(self, other: J) -> ZipEq<Self, J::IntoIter> ⓘ
    where +iterator simultaneously, yielding pairs of two optional elements. Read more

    source§

    fn zip_eq<J>(self, other: J) -> ZipEq<Self, J::IntoIter> ⓘ
    where J: IntoIterator, Self: Sized,

    Create an iterator which iterates over both this and the specified -iterator simultaneously, yielding pairs of elements. Read more
    source§

    fn batching<B, F>(self, f: F) -> Batching<Self, F> ⓘ
    where +iterator simultaneously, yielding pairs of elements. Read more

    source§

    fn batching<B, F>(self, f: F) -> Batching<Self, F> ⓘ
    where F: FnMut(&mut Self) -> Option<B>, Self: Sized,

    A “meta iterator adaptor”. Its closure receives a reference to the iterator and may pick off as many elements as it likes, to produce the -next iterator element. Read more
    source§

    fn group_by<K, F>(self, key: F) -> GroupBy<K, Self, F>
    where +next iterator element. Read more

    source§

    fn chunk_by<K, F>(self, key: F) -> ChunkBy<K, Self, F>
    where Self: Sized, F: FnMut(&Self::Item) -> K, K: PartialEq,

    Return an iterable that can group iterator elements. Consecutive elements that map to the same key (“runs”), are assigned -to the same group. Read more
    source§

    fn chunks(self, size: usize) -> IntoChunks<Self>
    where - Self: Sized,

    Return an iterable that can chunk the iterator. Read more
    source§

    fn tuple_windows<T>(self) -> TupleWindows<Self, T> ⓘ
    where +to the same group. Read more

    source§

    fn group_by<K, F>(self, key: F) -> ChunkBy<K, Self, F>
    where + Self: Sized, + F: FnMut(&Self::Item) -> K, + K: PartialEq,

    👎Deprecated since 0.13.0: Use .chunk_by() instead
    See .chunk_by().
    source§

    fn chunks(self, size: usize) -> IntoChunks<Self>
    where + Self: Sized,

    Return an iterable that can chunk the iterator. Read more
    source§

    fn tuple_windows<T>(self) -> TupleWindows<Self, T> ⓘ
    where Self: Sized + Iterator<Item = T::Item>, T: HomogeneousTuple, T::Item: Clone,

    Return an iterator over all contiguous windows producing tuples of -a specific size (up to 12). Read more
    source§

    fn circular_tuple_windows<T>(self) -> CircularTupleWindows<Self, T> ⓘ
    where +a specific size (up to 12). Read more

    source§

    fn circular_tuple_windows<T>(self) -> CircularTupleWindows<Self, T> ⓘ
    where Self: Sized + Clone + Iterator<Item = T::Item> + ExactSizeIterator, T: TupleCollect + Clone, T::Item: Clone,

    Return an iterator over all windows, wrapping back to the first elements when the window would otherwise exceed the length of the -iterator, producing tuples of a specific size (up to 12). Read more
    source§

    fn tuples<T>(self) -> Tuples<Self, T> ⓘ
    where +iterator, producing tuples of a specific size (up to 12). Read more

    source§

    fn tuples<T>(self) -> Tuples<Self, T> ⓘ
    where Self: Sized + Iterator<Item = T::Item>, T: HomogeneousTuple,

    Return an iterator that groups the items in tuples of a specific size -(up to 12). Read more
    source§

    fn tee(self) -> (Tee<Self>, Tee<Self>)
    where +(up to 12). Read more

    source§

    fn tee(self) -> (Tee<Self>, Tee<Self>)
    where Self: Sized, Self::Item: Clone,

    Split into an iterator pair that both yield all elements from -the original iterator. Read more
    source§

    fn step(self, n: usize) -> Step<Self> ⓘ
    where - Self: Sized,

    👎Deprecated since 0.8.0: Use std .step_by() instead
    Return an iterator adaptor that steps n elements in the base iterator -for each iteration. Read more
    source§

    fn map_into<R>(self) -> MapInto<Self, R>
    where +the original iterator. Read more

    source§

    fn map_into<R>(self) -> MapInto<Self, R>
    where Self: Sized, - Self::Item: Into<R>,

    Convert each item of the iterator using the Into trait. Read more
    source§

    fn map_results<F, T, U, E>(self, f: F) -> MapOk<Self, F>
    where - Self: Iterator<Item = Result<T, E>> + Sized, - F: FnMut(T) -> U,

    👎Deprecated since 0.10.0: Use .map_ok() instead
    See .map_ok().
    source§

    fn map_ok<F, T, U, E>(self, f: F) -> MapOk<Self, F>
    where + Self::Item: Into<R>,

    Convert each item of the iterator using the Into trait. Read more
    source§

    fn map_ok<F, T, U, E>(self, f: F) -> MapOk<Self, F>
    where Self: Iterator<Item = Result<T, E>> + Sized, F: FnMut(T) -> U,

    Return an iterator adaptor that applies the provided closure to every Result::Ok value. Result::Err values are -unchanged. Read more
    source§

    fn filter_ok<F, T, E>(self, f: F) -> FilterOk<Self, F> ⓘ
    where +unchanged. Read more

    source§

    fn filter_ok<F, T, E>(self, f: F) -> FilterOk<Self, F> ⓘ
    where Self: Iterator<Item = Result<T, E>> + Sized, F: FnMut(&T) -> bool,

    Return an iterator adaptor that filters every Result::Ok value with the provided closure. Result::Err values are -unchanged. Read more
    source§

    fn filter_map_ok<F, T, U, E>(self, f: F) -> FilterMapOk<Self, F> ⓘ
    where +unchanged. Read more

    source§

    fn filter_map_ok<F, T, U, E>(self, f: F) -> FilterMapOk<Self, F> ⓘ
    where Self: Iterator<Item = Result<T, E>> + Sized, F: FnMut(T) -> Option<U>,

    Return an iterator adaptor that filters and transforms every Result::Ok value with the provided closure. Result::Err -values are unchanged. Read more
    source§

    fn flatten_ok<T, E>(self) -> FlattenOk<Self, T, E> ⓘ
    where +values are unchanged. Read more

    source§

    fn flatten_ok<T, E>(self) -> FlattenOk<Self, T, E> ⓘ
    where Self: Iterator<Item = Result<T, E>> + Sized, T: IntoIterator,

    Return an iterator adaptor that flattens every Result::Ok value into -a series of Result::Ok values. Result::Err values are unchanged. Read more
    source§

    fn process_results<F, T, E, R>(self, processor: F) -> Result<R, E>
    where +a series of Result::Ok values. Result::Err values are unchanged. Read more

    source§

    fn process_results<F, T, E, R>(self, processor: F) -> Result<R, E>
    where Self: Iterator<Item = Result<T, E>> + Sized, F: FnOnce(ProcessResults<'_, Self, E>) -> R,

    “Lift” a function of the values of the current iterator so as to process -an iterator of Result values instead. Read more
    source§

    fn merge<J>(self, other: J) -> Merge<Self, J::IntoIter>
    where +an iterator of Result values instead. Read more

    source§

    fn merge<J>(self, other: J) -> Merge<Self, J::IntoIter>
    where Self: Sized, Self::Item: PartialOrd, J: IntoIterator<Item = Self::Item>,

    Return an iterator adaptor that merges the two base iterators in ascending order. If both base iterators are sorted (ascending), the -result is sorted. Read more
    source§

    fn merge_by<J, F>(self, other: J, is_first: F) -> MergeBy<Self, J::IntoIter, F> ⓘ
    where +result is sorted. Read more

    source§

    fn merge_by<J, F>(self, other: J, is_first: F) -> MergeBy<Self, J::IntoIter, F> ⓘ
    where Self: Sized, J: IntoIterator<Item = Self::Item>, F: FnMut(&Self::Item, &Self::Item) -> bool,

    Return an iterator adaptor that merges the two base iterators in order. -This is much like .merge() but allows for a custom ordering. Read more
    source§

    fn merge_join_by<J, F, T>( +This is much like .merge() but allows for a custom ordering. Read more

    source§

    fn merge_join_by<J, F, T>( self, other: J, cmp_fn: F @@ -307,284 +308,295 @@ This is much like IntoIterator, F: FnMut(&Self::Item, &J::Item) -> T, Self: Sized,

    Create an iterator that merges items from both this and the specified -iterator in ascending order. Read more
    source§

    fn kmerge(self) -> KMerge<<Self::Item as IntoIterator>::IntoIter>
    where +iterator in ascending order. Read more

    source§

    fn kmerge(self) -> KMerge<<Self::Item as IntoIterator>::IntoIter>
    where Self: Sized, Self::Item: IntoIterator, <Self::Item as IntoIterator>::Item: PartialOrd,

    Return an iterator adaptor that flattens an iterator of iterators by -merging them in ascending order. Read more
    source§

    fn kmerge_by<F>( +merging them in ascending order. Read more

    source§

    fn kmerge_by<F>( self, first: F ) -> KMergeBy<<Self::Item as IntoIterator>::IntoIter, F> ⓘ
    where Self: Sized, Self::Item: IntoIterator, F: FnMut(&<Self::Item as IntoIterator>::Item, &<Self::Item as IntoIterator>::Item) -> bool,

    Return an iterator adaptor that flattens an iterator of iterators by -merging them according to the given closure. Read more
    source§

    fn cartesian_product<J>(self, other: J) -> Product<Self, J::IntoIter> ⓘ
    where +merging them according to the given closure. Read more

    source§

    fn cartesian_product<J>(self, other: J) -> Product<Self, J::IntoIter> ⓘ
    where Self: Sized, Self::Item: Clone, J: IntoIterator, J::IntoIter: Clone,

    Return an iterator adaptor that iterates over the cartesian product of -the element sets of two iterators self and J. Read more
    source§

    fn multi_cartesian_product( +the element sets of two iterators self and J. Read more

    source§

    fn multi_cartesian_product( self ) -> MultiProduct<<Self::Item as IntoIterator>::IntoIter> ⓘ
    where Self: Sized, Self::Item: IntoIterator, <Self::Item as IntoIterator>::IntoIter: Clone, <Self::Item as IntoIterator>::Item: Clone,

    Return an iterator adaptor that iterates over the cartesian product of -all subiterators returned by meta-iterator self. Read more
    source§

    fn coalesce<F>(self, f: F) -> Coalesce<Self, F>
    where +all subiterators returned by meta-iterator self. Read more

    source§

    fn coalesce<F>(self, f: F) -> Coalesce<Self, F>
    where Self: Sized, F: FnMut(Self::Item, Self::Item) -> Result<Self::Item, (Self::Item, Self::Item)>,

    Return an iterator adaptor that uses the passed-in closure to -optionally merge together consecutive elements. Read more
    source§

    fn dedup(self) -> Dedup<Self>
    where +optionally merge together consecutive elements. Read more

    source§

    fn dedup(self) -> Dedup<Self>
    where Self: Sized, Self::Item: PartialEq,

    Remove duplicates from sections of consecutive identical elements. -If the iterator is sorted, all elements will be unique. Read more
    source§

    fn dedup_by<Cmp>(self, cmp: Cmp) -> DedupBy<Self, Cmp>
    where +If the iterator is sorted, all elements will be unique. Read more

    source§

    fn dedup_by<Cmp>(self, cmp: Cmp) -> DedupBy<Self, Cmp>
    where Self: Sized, Cmp: FnMut(&Self::Item, &Self::Item) -> bool,

    Remove duplicates from sections of consecutive identical elements, determining equality using a comparison function. -If the iterator is sorted, all elements will be unique. Read more
    source§

    fn dedup_with_count(self) -> DedupWithCount<Self>
    where +If the iterator is sorted, all elements will be unique. Read more

    source§

    fn dedup_with_count(self) -> DedupWithCount<Self>
    where Self: Sized,

    Remove duplicates from sections of consecutive identical elements, while keeping a count of how many repeated elements were present. -If the iterator is sorted, all elements will be unique. Read more
    source§

    fn dedup_by_with_count<Cmp>(self, cmp: Cmp) -> DedupByWithCount<Self, Cmp>
    where +If the iterator is sorted, all elements will be unique. Read more

    source§

    fn dedup_by_with_count<Cmp>(self, cmp: Cmp) -> DedupByWithCount<Self, Cmp>
    where Self: Sized, Cmp: FnMut(&Self::Item, &Self::Item) -> bool,

    Remove duplicates from sections of consecutive identical elements, while keeping a count of how many repeated elements were present. This will determine equality using a comparison function. -If the iterator is sorted, all elements will be unique. Read more
    source§

    fn duplicates(self) -> Duplicates<Self>
    where +If the iterator is sorted, all elements will be unique. Read more

    source§

    fn duplicates(self) -> Duplicates<Self>
    where Self: Sized, Self::Item: Eq + Hash,

    Return an iterator adaptor that produces elements that appear more than once during the -iteration. Duplicates are detected using hash and equality. Read more
    source§

    fn duplicates_by<V, F>(self, f: F) -> DuplicatesBy<Self, V, F>
    where +iteration. Duplicates are detected using hash and equality. Read more

    source§

    fn duplicates_by<V, F>(self, f: F) -> DuplicatesBy<Self, V, F>
    where Self: Sized, V: Eq + Hash, F: FnMut(&Self::Item) -> V,

    Return an iterator adaptor that produces elements that appear more than once during the -iteration. Duplicates are detected using hash and equality. Read more
    source§

    fn unique(self) -> Unique<Self> ⓘ
    where +iteration. Duplicates are detected using hash and equality. Read more

    source§

    fn unique(self) -> Unique<Self> ⓘ
    where Self: Sized, Self::Item: Clone + Eq + Hash,

    Return an iterator adaptor that filters out elements that have already been produced once during the iteration. Duplicates -are detected using hash and equality. Read more
    source§

    fn unique_by<V, F>(self, f: F) -> UniqueBy<Self, V, F> ⓘ
    where +are detected using hash and equality. Read more

    source§

    fn unique_by<V, F>(self, f: F) -> UniqueBy<Self, V, F> ⓘ
    where Self: Sized, V: Eq + Hash, F: FnMut(&Self::Item) -> V,

    Return an iterator adaptor that filters out elements that have -already been produced once during the iteration. Read more
    source§

    fn peeking_take_while<F>(&mut self, accept: F) -> PeekingTakeWhile<'_, Self, F> ⓘ
    where +already been produced once during the iteration. Read more

    source§

    fn peeking_take_while<F>(&mut self, accept: F) -> PeekingTakeWhile<'_, Self, F> ⓘ
    where Self: Sized + PeekingNext, F: FnMut(&Self::Item) -> bool,

    Return an iterator adaptor that borrows from this iterator and -takes items while the closure accept returns true. Read more
    source§

    fn take_while_ref<F>(&mut self, accept: F) -> TakeWhileRef<'_, Self, F> ⓘ
    where +takes items while the closure accept returns true. Read more

    source§

    fn take_while_ref<F>(&mut self, accept: F) -> TakeWhileRef<'_, Self, F> ⓘ
    where Self: Clone, F: FnMut(&Self::Item) -> bool,

    Return an iterator adaptor that borrows from a Clone-able iterator -to only pick off elements while the predicate accept returns true. Read more
    source§

    fn take_while_inclusive<F>(self, accept: F) -> TakeWhileInclusive<Self, F> ⓘ
    where +to only pick off elements while the predicate accept returns true. Read more

    source§

    fn take_while_inclusive<F>(self, accept: F) -> TakeWhileInclusive<Self, F> ⓘ
    where Self: Sized, F: FnMut(&Self::Item) -> bool,

    Returns an iterator adaptor that consumes elements while the given predicate is true, including the element for which the predicate -first returned false. Read more
    source§

    fn while_some<A>(self) -> WhileSome<Self> ⓘ
    where +first returned false. Read more

    source§

    fn while_some<A>(self) -> WhileSome<Self> ⓘ
    where Self: Sized + Iterator<Item = Option<A>>,

    Return an iterator adaptor that filters Option<A> iterator elements -and produces A. Stops on the first None encountered. Read more
    source§

    fn tuple_combinations<T>(self) -> TupleCombinations<Self, T> ⓘ
    where +and produces A. Stops on the first None encountered. Read more

    source§

    fn tuple_combinations<T>(self) -> TupleCombinations<Self, T> ⓘ
    where Self: Sized + Clone, Self::Item: Clone, T: HasCombination<Self>,

    Return an iterator adaptor that iterates over the combinations of the -elements from an iterator. Read more
    source§

    fn combinations(self, k: usize) -> Combinations<Self> ⓘ
    where +elements from an iterator. Read more

    source§

    fn combinations(self, k: usize) -> Combinations<Self> ⓘ
    where Self: Sized, Self::Item: Clone,

    Return an iterator adaptor that iterates over the k-length combinations of -the elements from an iterator. Read more
    source§

    fn combinations_with_replacement( +the elements from an iterator. Read more

    source§

    fn combinations_with_replacement( self, k: usize ) -> CombinationsWithReplacement<Self> ⓘ
    where Self: Sized, Self::Item: Clone,

    Return an iterator that iterates over the k-length combinations of -the elements from an iterator, with replacement. Read more
    source§

    fn permutations(self, k: usize) -> Permutations<Self> ⓘ
    where +the elements from an iterator, with replacement. Read more

    source§

    fn permutations(self, k: usize) -> Permutations<Self> ⓘ
    where Self: Sized, Self::Item: Clone,

    Return an iterator adaptor that iterates over all k-permutations of the -elements from an iterator. Read more
    source§

    fn powerset(self) -> Powerset<Self> ⓘ
    where +elements from an iterator. Read more

    source§

    fn powerset(self) -> Powerset<Self> ⓘ
    where Self: Sized, Self::Item: Clone,

    Return an iterator that iterates through the powerset of the elements from an -iterator. Read more
    source§

    fn pad_using<F>(self, min: usize, f: F) -> PadUsing<Self, F> ⓘ
    where +iterator. Read more

    source§

    fn pad_using<F>(self, min: usize, f: F) -> PadUsing<Self, F> ⓘ
    where Self: Sized, F: FnMut(usize) -> Self::Item,

    Return an iterator adaptor that pads the sequence to a minimum length of -min by filling missing elements using a closure f. Read more
    source§

    fn with_position(self) -> WithPosition<Self> ⓘ
    where +min by filling missing elements using a closure f. Read more

    source§

    fn with_position(self) -> WithPosition<Self> ⓘ
    where Self: Sized,

    Return an iterator adaptor that combines each element with a Position to -ease special-case handling of the first or last elements. Read more
    source§

    fn positions<P>(self, predicate: P) -> Positions<Self, P> ⓘ
    where +ease special-case handling of the first or last elements. Read more

    source§

    fn positions<P>(self, predicate: P) -> Positions<Self, P> ⓘ
    where Self: Sized, P: FnMut(Self::Item) -> bool,

    Return an iterator adaptor that yields the indices of all elements -satisfying a predicate, counted from the start of the iterator. Read more
    source§

    fn update<F>(self, updater: F) -> Update<Self, F> ⓘ
    where +satisfying a predicate, counted from the start of the iterator. Read more

    source§

    fn update<F>(self, updater: F) -> Update<Self, F> ⓘ
    where Self: Sized, F: FnMut(&mut Self::Item),

    Return an iterator adaptor that applies a mutating function -to each element before yielding it. Read more
    source§

    fn next_tuple<T>(&mut self) -> Option<T>
    where +to each element before yielding it. Read more

    source§

    fn next_tuple<T>(&mut self) -> Option<T>
    where Self: Sized + Iterator<Item = T::Item>, T: HomogeneousTuple,

    Advances the iterator and returns the next items grouped in a tuple of -a specific size (up to 12). Read more
    source§

    fn collect_tuple<T>(self) -> Option<T>
    where +a specific size (up to 12). Read more

    source§

    fn collect_tuple<T>(self) -> Option<T>
    where Self: Sized + Iterator<Item = T::Item>, T: HomogeneousTuple,

    Collects all items from the iterator into a tuple of a specific size -(up to 12). Read more
    source§

    fn find_position<P>(&mut self, pred: P) -> Option<(usize, Self::Item)>
    where - P: FnMut(&Self::Item) -> bool,

    Find the position and value of the first element satisfying a predicate. Read more
    source§

    fn find_or_last<P>(self, predicate: P) -> Option<Self::Item>
    where +(up to 12). Read more

    source§

    fn find_position<P>(&mut self, pred: P) -> Option<(usize, Self::Item)>
    where + P: FnMut(&Self::Item) -> bool,

    Find the position and value of the first element satisfying a predicate. Read more
    source§

    fn find_or_last<P>(self, predicate: P) -> Option<Self::Item>
    where Self: Sized, - P: FnMut(&Self::Item) -> bool,

    Find the value of the first element satisfying a predicate or return the last element, if any. Read more
    source§

    fn find_or_first<P>(self, predicate: P) -> Option<Self::Item>
    where + P: FnMut(&Self::Item) -> bool,

    Find the value of the first element satisfying a predicate or return the last element, if any. Read more
    source§

    fn find_or_first<P>(self, predicate: P) -> Option<Self::Item>
    where Self: Sized, - P: FnMut(&Self::Item) -> bool,

    Find the value of the first element satisfying a predicate or return the first element, if any. Read more
    source§

    fn contains<Q>(&mut self, query: &Q) -> bool
    where + P: FnMut(&Self::Item) -> bool,

    Find the value of the first element satisfying a predicate or return the first element, if any. Read more
    source§

    fn contains<Q>(&mut self, query: &Q) -> bool
    where Self: Sized, Self::Item: Borrow<Q>, - Q: PartialEq,

    Returns true if the given item is present in this iterator. Read more
    source§

    fn all_equal(&mut self) -> bool
    where + Q: PartialEq,

    Returns true if the given item is present in this iterator. Read more
    source§

    fn all_equal(&mut self) -> bool
    where Self: Sized, - Self::Item: PartialEq,

    Check whether all elements compare equal. Read more
    source§

    fn all_equal_value( + Self::Item: PartialEq,

    Check whether all elements compare equal. Read more
    source§

    fn all_equal_value( &mut self ) -> Result<Self::Item, Option<(Self::Item, Self::Item)>>
    where Self: Sized, Self::Item: PartialEq,

    If there are elements and they are all equal, return a single copy of that element. If there are no elements, return an Error containing None. If there are elements and they are not all equal, return a tuple containing the first -two non-equal elements found. Read more
    source§

    fn all_unique(&mut self) -> bool
    where +two non-equal elements found. Read more

    source§

    fn all_unique(&mut self) -> bool
    where Self: Sized, - Self::Item: Eq + Hash,

    Check whether all elements are unique (non equal). Read more
    source§

    fn dropping(self, n: usize) -> Self
    where + Self::Item: Eq + Hash,

    Check whether all elements are unique (non equal). Read more
    source§

    fn dropping(self, n: usize) -> Self
    where Self: Sized,

    Consume the first n elements from the iterator eagerly, -and return the same iterator again. Read more
    source§

    fn dropping_back(self, n: usize) -> Self
    where +and return the same iterator again. Read more

    source§

    fn dropping_back(self, n: usize) -> Self
    where Self: Sized + DoubleEndedIterator,

    Consume the last n elements from the iterator eagerly, -and return the same iterator again. Read more
    source§

    fn foreach<F>(self, f: F)
    where - F: FnMut(Self::Item), - Self: Sized,

    👎Deprecated since 0.8.0: Use .for_each() instead
    Run the closure f eagerly on each element of the iterator. Read more
    source§

    fn concat(self) -> Self::Item
    where +and return the same iterator again. Read more

    source§

    fn concat(self) -> Self::Item
    where Self: Sized, - Self::Item: Extend<<<Self as Iterator>::Item as IntoIterator>::Item> + IntoIterator + Default,

    Combine all an iterator’s elements into one element by using Extend. Read more
    source§

    fn collect_vec(self) -> Vec<Self::Item>
    where + Self::Item: Extend<<<Self as Iterator>::Item as IntoIterator>::Item> + IntoIterator + Default,

    Combine all an iterator’s elements into one element by using Extend. Read more
    source§

    fn collect_vec(self) -> Vec<Self::Item>
    where Self: Sized,

    .collect_vec() is simply a type specialization of Iterator::collect, -for convenience.
    source§

    fn try_collect<T, U, E>(self) -> Result<U, E>
    where +for convenience.

    source§

    fn try_collect<T, U, E>(self) -> Result<U, E>
    where Self: Sized + Iterator<Item = Result<T, E>>, Result<U, E>: FromIterator<Result<T, E>>,

    .try_collect() is more convenient way of writing -.collect::<Result<_, _>>() Read more
    source§

    fn set_from<'a, A: 'a, J>(&mut self, from: J) -> usize
    where +.collect::<Result<_, _>>() Read more

    source§

    fn set_from<'a, A: 'a, J>(&mut self, from: J) -> usize
    where Self: Iterator<Item = &'a mut A>, J: IntoIterator<Item = A>,

    Assign to each reference in self from the from iterator, -stopping at the shortest of the two iterators. Read more
    source§

    fn join(&mut self, sep: &str) -> String
    where - Self::Item: Display,

    Combine all iterator elements into one String, separated by sep. Read more
    source§

    fn format(self, sep: &str) -> Format<'_, Self>
    where - Self: Sized,

    Format all iterator elements, separated by sep. Read more
    source§

    fn format_with<F>(self, sep: &str, format: F) -> FormatWith<'_, Self, F>
    where +stopping at the shortest of the two iterators. Read more

    source§

    fn join(&mut self, sep: &str) -> String
    where + Self::Item: Display,

    Combine all iterator elements into one String, separated by sep. Read more
    source§

    fn format(self, sep: &str) -> Format<'_, Self>
    where + Self: Sized,

    Format all iterator elements, separated by sep. Read more
    source§

    fn format_with<F>(self, sep: &str, format: F) -> FormatWith<'_, Self, F>
    where Self: Sized, - F: FnMut(Self::Item, &mut dyn FnMut(&dyn Display) -> Result) -> Result,

    Format all iterator elements, separated by sep. Read more
    source§

    fn fold_results<A, E, B, F>(&mut self, start: B, f: F) -> Result<B, E>
    where + F: FnMut(Self::Item, &mut dyn FnMut(&dyn Display) -> Result) -> Result,

    Format all iterator elements, separated by sep. Read more
    source§

    fn fold_ok<A, E, B, F>(&mut self, start: B, f: F) -> Result<B, E>
    where Self: Iterator<Item = Result<A, E>>, - F: FnMut(B, A) -> B,

    👎Deprecated since 0.10.0: Use .fold_ok() instead
    See .fold_ok().
    source§

    fn fold_ok<A, E, B, F>(&mut self, start: B, f: F) -> Result<B, E>
    where - Self: Iterator<Item = Result<A, E>>, - F: FnMut(B, A) -> B,

    Fold Result values from an iterator. Read more
    source§

    fn fold_options<A, B, F>(&mut self, start: B, f: F) -> Option<B>
    where + F: FnMut(B, A) -> B,

    Fold Result values from an iterator. Read more
    source§

    fn fold_options<A, B, F>(&mut self, start: B, f: F) -> Option<B>
    where Self: Iterator<Item = Option<A>>, - F: FnMut(B, A) -> B,

    Fold Option values from an iterator. Read more
    source§

    fn fold1<F>(self, f: F) -> Option<Self::Item>
    where + F: FnMut(B, A) -> B,

    Fold Option values from an iterator. Read more
    source§

    fn fold1<F>(self, f: F) -> Option<Self::Item>
    where F: FnMut(Self::Item, Self::Item) -> Self::Item, - Self: Sized,

    👎Deprecated since 0.10.2: Use Iterator::reduce instead
    Accumulator of the elements in the iterator. Read more
    source§

    fn tree_fold1<F>(self, f: F) -> Option<Self::Item>
    where + Self: Sized,

    👎Deprecated since 0.10.2: Use Iterator::reduce instead
    Accumulator of the elements in the iterator. Read more
    source§

    fn tree_reduce<F>(self, f: F) -> Option<Self::Item>
    where F: FnMut(Self::Item, Self::Item) -> Self::Item, - Self: Sized,

    Accumulate the elements in the iterator in a tree-like manner. Read more
    source§

    fn fold_while<B, F>(&mut self, init: B, f: F) -> FoldWhile<B>
    where + Self: Sized,

    Accumulate the elements in the iterator in a tree-like manner. Read more
    source§

    fn tree_fold1<F>(self, f: F) -> Option<Self::Item>
    where + F: FnMut(Self::Item, Self::Item) -> Self::Item, + Self: Sized,

    👎Deprecated since 0.13.0: Use .tree_reduce() instead
    See .tree_reduce().
    source§

    fn fold_while<B, F>(&mut self, init: B, f: F) -> FoldWhile<B>
    where Self: Sized, - F: FnMut(B, Self::Item) -> FoldWhile<B>,

    An iterator method that applies a function, producing a single, final value. Read more
    source§

    fn sum1<S>(self) -> Option<S>
    where + F: FnMut(B, Self::Item) -> FoldWhile<B>,

    An iterator method that applies a function, producing a single, final value. Read more
    source§

    fn sum1<S>(self) -> Option<S>
    where Self: Sized, - S: Sum<Self::Item>,

    Iterate over the entire iterator and add all the elements. Read more
    source§

    fn product1<P>(self) -> Option<P>
    where + S: Sum<Self::Item>,

    Iterate over the entire iterator and add all the elements. Read more
    source§

    fn product1<P>(self) -> Option<P>
    where Self: Sized, - P: Product<Self::Item>,

    Iterate over the entire iterator and multiply all the elements. Read more
    source§

    fn sorted_unstable(self) -> IntoIter<Self::Item> ⓘ
    where + P: Product<Self::Item>,

    Iterate over the entire iterator and multiply all the elements. Read more
    source§

    fn sorted_unstable(self) -> IntoIter<Self::Item> ⓘ
    where Self: Sized, - Self::Item: Ord,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_unstable_by<F>(self, cmp: F) -> IntoIter<Self::Item> ⓘ
    where + Self::Item: Ord,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_unstable_by<F>(self, cmp: F) -> IntoIter<Self::Item> ⓘ
    where Self: Sized, - F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_unstable_by_key<K, F>(self, f: F) -> IntoIter<Self::Item> ⓘ
    where + F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_unstable_by_key<K, F>(self, f: F) -> IntoIter<Self::Item> ⓘ
    where Self: Sized, K: Ord, - F: FnMut(&Self::Item) -> K,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted(self) -> IntoIter<Self::Item> ⓘ
    where + F: FnMut(&Self::Item) -> K,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted(self) -> IntoIter<Self::Item> ⓘ
    where Self: Sized, - Self::Item: Ord,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_by<F>(self, cmp: F) -> IntoIter<Self::Item> ⓘ
    where + Self::Item: Ord,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_by<F>(self, cmp: F) -> IntoIter<Self::Item> ⓘ
    where Self: Sized, - F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_by_key<K, F>(self, f: F) -> IntoIter<Self::Item> ⓘ
    where + F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_by_key<K, F>(self, f: F) -> IntoIter<Self::Item> ⓘ
    where Self: Sized, K: Ord, - F: FnMut(&Self::Item) -> K,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_by_cached_key<K, F>(self, f: F) -> IntoIter<Self::Item> ⓘ
    where + F: FnMut(&Self::Item) -> K,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_by_cached_key<K, F>(self, f: F) -> IntoIter<Self::Item> ⓘ
    where Self: Sized, K: Ord, F: FnMut(&Self::Item) -> K,

    Sort all iterator elements into a new iterator in ascending order. The key function is -called exactly once per key. Read more
    source§

    fn k_smallest(self, k: usize) -> IntoIter<Self::Item> ⓘ
    where +called exactly once per key. Read more

    source§

    fn k_smallest(self, k: usize) -> IntoIter<Self::Item> ⓘ
    where Self: Sized, - Self::Item: Ord,

    Sort the k smallest elements into a new iterator, in ascending order. Read more
    source§

    fn partition_map<A, B, F, L, R>(self, predicate: F) -> (A, B)
    where + Self::Item: Ord,

    Sort the k smallest elements into a new iterator, in ascending order. Read more
    source§

    fn k_smallest_by<F>(self, k: usize, cmp: F) -> IntoIter<Self::Item> ⓘ
    where + Self: Sized, + F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Sort the k smallest elements into a new iterator using the provided comparison. Read more
    source§

    fn k_smallest_by_key<F, K>(self, k: usize, key: F) -> IntoIter<Self::Item> ⓘ
    where + Self: Sized, + F: FnMut(&Self::Item) -> K, + K: Ord,

    Return the elements producing the k smallest outputs of the provided function. Read more
    source§

    fn k_largest(self, k: usize) -> IntoIter<Self::Item> ⓘ
    where + Self: Sized, + Self::Item: Ord,

    Sort the k largest elements into a new iterator, in descending order. Read more
    source§

    fn k_largest_by<F>(self, k: usize, cmp: F) -> IntoIter<Self::Item> ⓘ
    where + Self: Sized, + F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Sort the k largest elements into a new iterator using the provided comparison. Read more
    source§

    fn k_largest_by_key<F, K>(self, k: usize, key: F) -> IntoIter<Self::Item> ⓘ
    where + Self: Sized, + F: FnMut(&Self::Item) -> K, + K: Ord,

    Return the elements producing the k largest outputs of the provided function. Read more
    source§

    fn tail(self, n: usize) -> IntoIter<Self::Item> ⓘ
    where + Self: Sized,

    Consumes the iterator and return an iterator of the last n elements. Read more
    source§

    fn partition_map<A, B, F, L, R>(self, predicate: F) -> (A, B)
    where Self: Sized, F: FnMut(Self::Item) -> Either<L, R>, A: Default + Extend<L>, B: Default + Extend<R>,

    Collect all iterator elements into one of two partitions. Unlike Iterator::partition, each partition may -have a distinct type. Read more
    source§

    fn partition_result<A, B, T, E>(self) -> (A, B)
    where +have a distinct type. Read more

    source§

    fn partition_result<A, B, T, E>(self) -> (A, B)
    where Self: Iterator<Item = Result<T, E>> + Sized, A: Default + Extend<T>, B: Default + Extend<E>,

    Partition a sequence of Results into one list of all the Ok elements -and another list of all the Err elements. Read more
    source§

    fn into_group_map<K, V>(self) -> HashMap<K, Vec<V>>
    where +and another list of all the Err elements. Read more

    source§

    fn into_group_map<K, V>(self) -> HashMap<K, Vec<V>>
    where Self: Iterator<Item = (K, V)> + Sized, K: Hash + Eq,

    Return a HashMap of keys mapped to Vecs of values. Keys and values -are taken from (Key, Value) tuple pairs yielded by the input iterator. Read more
    source§

    fn into_group_map_by<K, V, F>(self, f: F) -> HashMap<K, Vec<V>>
    where +are taken from (Key, Value) tuple pairs yielded by the input iterator. Read more

    source§

    fn into_group_map_by<K, V, F>(self, f: F) -> HashMap<K, Vec<V>>
    where Self: Iterator<Item = V> + Sized, K: Hash + Eq, - F: Fn(&V) -> K,

    Return an Iterator on a HashMap. Keys mapped to Vecs of values. The key is specified -in the closure. Read more
    source§

    fn into_grouping_map<K, V>(self) -> GroupingMap<Self>
    where + F: FnMut(&V) -> K,

    Return an Iterator on a HashMap. Keys mapped to Vecs of values. The key is specified +in the closure. Read more
    source§

    fn into_grouping_map<K, V>(self) -> GroupingMap<Self>
    where Self: Iterator<Item = (K, V)> + Sized, K: Hash + Eq,

    Constructs a GroupingMap to be used later with one of the efficient -group-and-fold operations it allows to perform. Read more
    source§

    fn into_grouping_map_by<K, V, F>(self, key_mapper: F) -> GroupingMapBy<Self, F>
    where +group-and-fold operations it allows to perform. Read more

    source§

    fn into_grouping_map_by<K, V, F>(self, key_mapper: F) -> GroupingMapBy<Self, F>
    where Self: Iterator<Item = V> + Sized, K: Hash + Eq, F: FnMut(&V) -> K,

    Constructs a GroupingMap to be used later with one of the efficient -group-and-fold operations it allows to perform. Read more
    source§

    fn min_set(self) -> Vec<Self::Item>
    where +group-and-fold operations it allows to perform. Read more

    source§

    fn min_set(self) -> Vec<Self::Item>
    where Self: Sized, - Self::Item: Ord,

    Return all minimum elements of an iterator. Read more
    source§

    fn min_set_by<F>(self, compare: F) -> Vec<Self::Item>
    where + Self::Item: Ord,

    Return all minimum elements of an iterator. Read more
    source§

    fn min_set_by<F>(self, compare: F) -> Vec<Self::Item>
    where Self: Sized, F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Return all minimum elements of an iterator, as determined by -the specified function. Read more
    source§

    fn min_set_by_key<K, F>(self, key: F) -> Vec<Self::Item>
    where +the specified function. Read more

    source§

    fn min_set_by_key<K, F>(self, key: F) -> Vec<Self::Item>
    where Self: Sized, K: Ord, F: FnMut(&Self::Item) -> K,

    Return all minimum elements of an iterator, as determined by -the specified function. Read more
    source§

    fn max_set(self) -> Vec<Self::Item>
    where +the specified function. Read more

    source§

    fn max_set(self) -> Vec<Self::Item>
    where Self: Sized, - Self::Item: Ord,

    Return all maximum elements of an iterator. Read more
    source§

    fn max_set_by<F>(self, compare: F) -> Vec<Self::Item>
    where + Self::Item: Ord,

    Return all maximum elements of an iterator. Read more
    source§

    fn max_set_by<F>(self, compare: F) -> Vec<Self::Item>
    where Self: Sized, F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Return all maximum elements of an iterator, as determined by -the specified function. Read more
    source§

    fn max_set_by_key<K, F>(self, key: F) -> Vec<Self::Item>
    where +the specified function. Read more

    source§

    fn max_set_by_key<K, F>(self, key: F) -> Vec<Self::Item>
    where Self: Sized, K: Ord, F: FnMut(&Self::Item) -> K,

    Return all maximum elements of an iterator, as determined by -the specified function. Read more
    source§

    fn minmax(self) -> MinMaxResult<Self::Item>
    where +the specified function. Read more

    source§

    fn minmax(self) -> MinMaxResult<Self::Item>
    where Self: Sized, - Self::Item: PartialOrd,

    Return the minimum and maximum elements in the iterator. Read more
    source§

    fn minmax_by_key<K, F>(self, key: F) -> MinMaxResult<Self::Item>
    where + Self::Item: PartialOrd,

    Return the minimum and maximum elements in the iterator. Read more
    source§

    fn minmax_by_key<K, F>(self, key: F) -> MinMaxResult<Self::Item>
    where Self: Sized, K: PartialOrd, F: FnMut(&Self::Item) -> K,

    Return the minimum and maximum element of an iterator, as determined by -the specified function. Read more
    source§

    fn minmax_by<F>(self, compare: F) -> MinMaxResult<Self::Item>
    where +the specified function. Read more

    source§

    fn minmax_by<F>(self, compare: F) -> MinMaxResult<Self::Item>
    where Self: Sized, F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Return the minimum and maximum element of an iterator, as determined by -the specified comparison function. Read more
    source§

    fn position_max(self) -> Option<usize>
    where +the specified comparison function. Read more

    source§

    fn position_max(self) -> Option<usize>
    where Self: Sized, - Self::Item: Ord,

    Return the position of the maximum element in the iterator. Read more
    source§

    fn position_max_by_key<K, F>(self, key: F) -> Option<usize>
    where + Self::Item: Ord,

    Return the position of the maximum element in the iterator. Read more
    source§

    fn position_max_by_key<K, F>(self, key: F) -> Option<usize>
    where Self: Sized, K: Ord, F: FnMut(&Self::Item) -> K,

    Return the position of the maximum element in the iterator, as -determined by the specified function. Read more
    source§

    fn position_max_by<F>(self, compare: F) -> Option<usize>
    where +determined by the specified function. Read more

    source§

    fn position_max_by<F>(self, compare: F) -> Option<usize>
    where Self: Sized, F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Return the position of the maximum element in the iterator, as -determined by the specified comparison function. Read more
    source§

    fn position_min(self) -> Option<usize>
    where +determined by the specified comparison function. Read more

    source§

    fn position_min(self) -> Option<usize>
    where Self: Sized, - Self::Item: Ord,

    Return the position of the minimum element in the iterator. Read more
    source§

    fn position_min_by_key<K, F>(self, key: F) -> Option<usize>
    where + Self::Item: Ord,

    Return the position of the minimum element in the iterator. Read more
    source§

    fn position_min_by_key<K, F>(self, key: F) -> Option<usize>
    where Self: Sized, K: Ord, F: FnMut(&Self::Item) -> K,

    Return the position of the minimum element in the iterator, as -determined by the specified function. Read more
    source§

    fn position_min_by<F>(self, compare: F) -> Option<usize>
    where +determined by the specified function. Read more

    source§

    fn position_min_by<F>(self, compare: F) -> Option<usize>
    where Self: Sized, F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Return the position of the minimum element in the iterator, as -determined by the specified comparison function. Read more
    source§

    fn position_minmax(self) -> MinMaxResult<usize>
    where +determined by the specified comparison function. Read more

    source§

    fn position_minmax(self) -> MinMaxResult<usize>
    where Self: Sized, Self::Item: PartialOrd,

    Return the positions of the minimum and maximum elements in -the iterator. Read more
    source§

    fn position_minmax_by_key<K, F>(self, key: F) -> MinMaxResult<usize>
    where +the iterator. Read more

    source§

    fn position_minmax_by_key<K, F>(self, key: F) -> MinMaxResult<usize>
    where Self: Sized, K: PartialOrd, F: FnMut(&Self::Item) -> K,

    Return the postions of the minimum and maximum elements of an -iterator, as determined by the specified function. Read more
    source§

    fn position_minmax_by<F>(self, compare: F) -> MinMaxResult<usize>
    where +iterator, as determined by the specified function. Read more

    source§

    fn position_minmax_by<F>(self, compare: F) -> MinMaxResult<usize>
    where Self: Sized, F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Return the postions of the minimum and maximum elements of an -iterator, as determined by the specified comparison function. Read more
    source§

    fn exactly_one(self) -> Result<Self::Item, ExactlyOneError<Self>>
    where +iterator, as determined by the specified comparison function. Read more

    source§

    fn exactly_one(self) -> Result<Self::Item, ExactlyOneError<Self>>
    where Self: Sized,

    If the iterator yields exactly one element, that element will be returned, otherwise an error will be returned containing an iterator that has the same output as the input -iterator. Read more
    source§

    fn at_most_one(self) -> Result<Option<Self::Item>, ExactlyOneError<Self>>
    where - Self: Sized,

    If the iterator yields no elements, Ok(None) will be returned. If the iterator yields +iterator. Read more
    source§

    fn at_most_one(self) -> Result<Option<Self::Item>, ExactlyOneError<Self>>
    where + Self: Sized,

    If the iterator yields no elements, Ok(None) will be returned. If the iterator yields exactly one element, that element will be returned, otherwise an error will be returned -containing an iterator that has the same output as the input iterator. Read more
    source§

    fn multipeek(self) -> MultiPeek<Self> ⓘ
    where +containing an iterator that has the same output as the input iterator. Read more

    source§

    fn multipeek(self) -> MultiPeek<Self> ⓘ
    where Self: Sized,

    An iterator adaptor that allows the user to peek at multiple .next() -values without advancing the base iterator. Read more
    source§

    fn counts(self) -> HashMap<Self::Item, usize>
    where +values without advancing the base iterator. Read more

    source§

    fn counts(self) -> HashMap<Self::Item, usize>
    where Self: Sized, Self::Item: Eq + Hash,

    Collect the items in this iterator and return a HashMap which contains each item that appears in the iterator and the number -of times it appears. Read more
    source§

    fn counts_by<K, F>(self, f: F) -> HashMap<K, usize>
    where +of times it appears. Read more

    source§

    fn counts_by<K, F>(self, f: F) -> HashMap<K, usize>
    where Self: Sized, K: Eq + Hash, F: FnMut(Self::Item) -> K,

    Collect the items in this iterator and return a HashMap which contains each item that appears in the iterator and the number of times it appears, -determining identity using a keying function. Read more
    source§

    fn multiunzip<FromI>(self) -> FromI
    where - Self: Sized + MultiUnzip<FromI>,

    Converts an iterator of tuples into a tuple of containers. Read more
    source§

    fn try_len(&self) -> Result<usize, (usize, Option<usize>)>

    Returns the length of the iterator if one exists. +determining identity using a keying function. Read more
    source§

    fn multiunzip<FromI>(self) -> FromI
    where + Self: Sized + MultiUnzip<FromI>,

    Converts an iterator of tuples into a tuple of containers. Read more
    source§

    fn try_len(&self) -> Result<usize, (usize, Option<usize>)>

    Returns the length of the iterator if one exists. Otherwise return self.size_hint(). Read more
    source§

    impl<IT> MultiUnzip<()> for IT
    where IT: Iterator<Item = ()>,

    source§

    fn multiunzip(self)

    Unzip this iterator into multiple collections.
    source§

    impl<IT, A, FromA> MultiUnzip<(FromA,)> for IT
    where IT: Iterator<Item = (A,)>, @@ -687,4 +699,4 @@ Otherwise return self.size_hint(). (FromA, FromB, FromC, FromD, FromE, FromF, FromG, FromH, FromI, FromJ, FromK, FromL)

    Unzip this iterator into multiple collections.
    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 + 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/itertools/structs/struct.MultiProduct.html b/itertools/structs/struct.MultiProduct.html index e14fd3158..fc5b5192a 100644 --- a/itertools/structs/struct.MultiProduct.html +++ b/itertools/structs/struct.MultiProduct.html @@ -1,19 +1,19 @@ -MultiProduct in itertools::structs - Rust
    -

    Struct itertools::structs::MultiProduct

    source · 
    pub struct MultiProduct<I>(/* private fields */)
+MultiProduct in itertools::structs - Rust
    
+    
    Struct itertools::structs::MultiProduct
    source · 
    pub struct MultiProduct<I>(/* private fields */)
 where
     I: Iterator + Clone,
     I::Item: Clone;
    Expand description
    An iterator adaptor that iterates over the cartesian product of
 multiple iterators of type I.
    
-
    An iterator element type is Vec<I>.
    
+
    An iterator element type is Vec<I::Item>.
    
 
    See .multi_cartesian_product()
 for more information.
    
-
    Trait Implementations§
    source§
    impl<I> Clone for MultiProduct<I>
    where
+
    Trait Implementations§
    source§
    impl<I> Clone for MultiProduct<I>
    where
     I: Iterator + Clone + Clone,
-    I::Item: Clone,
    source§
    fn clone(&self) -> MultiProduct<I> ⓘ
    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<I> Debug for MultiProduct<I>
    where
+    I::Item: Clone,
    source§
    fn clone(&self) -> MultiProduct<I> ⓘ
    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<I> Debug for MultiProduct<I>
    where
     I: Iterator + Clone + Debug,
-    I::Item: Clone + Debug,
    source§
    fn fmt(&self, f: &mut Formatter<'_>) -> Result
    Formats the value using the given formatter. Read more
    source§
    impl<I> Iterator for MultiProduct<I>
    where
+    I::Item: Clone + Debug,
    source§
    fn fmt(&self, f: &mut Formatter<'_>) -> Result
    Formats the value using the given formatter. Read more
    source§
    impl<I> Iterator for MultiProduct<I>
    where
     I: Iterator + Clone,
-    I::Item: Clone,
    §
    type Item = Vec<<I as Iterator>::Item>
    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 count(self) -> usize
    Consumes the iterator, counting the number of iterations and returning it. Read more
    source§
    fn size_hint(&self) -> (usize, Option<usize>)
    Returns the bounds on the remaining length of the iterator. Read more
    source§
    fn last(self) -> Option<Self::Item>
    Consumes the iterator, returning the last element. Read more
    source§
    fn next_chunk<const N: usize>(
+    I::Item: Clone,
    §
    type Item = Vec<<I as Iterator>::Item>
    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 count(self) -> usize
    Consumes the iterator, counting the number of iterations and returning it. Read more
    source§
    fn size_hint(&self) -> (usize, Option<usize>)
    Returns the bounds on the remaining length of the iterator. Read more
    source§
    fn last(self) -> Option<Self::Item>
    Consumes the iterator, returning the last element. 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.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
@@ -189,7 +189,9 @@ greater than or equal to those of another. 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<I> Freeze for MultiProduct<I>
    §
    impl<I> RefUnwindSafe for MultiProduct<I>
    where
+function. Read more
    source§
    impl<I> FusedIterator for MultiProduct<I>
    where
+    I: Iterator + Clone,
+    I::Item: Clone,

    Auto Trait Implementations§

    §

    impl<I> Freeze for MultiProduct<I>

    §

    impl<I> RefUnwindSafe for MultiProduct<I>
    where I: RefUnwindSafe, <I as Iterator>::Item: RefUnwindSafe,

    §

    impl<I> Send for MultiProduct<I>
    where I: Send, @@ -215,86 +217,87 @@ otherwise. Right variant of Either<Self, Self> otherwise. Read more

    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> Itertools for T
    where - T: Iterator + ?Sized,

    source§

    fn interleave<J>(self, other: J) -> Interleave<Self, J::IntoIter> ⓘ
    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> Itertools for T
    where + T: Iterator + ?Sized,

    source§

    fn interleave<J>(self, other: J) -> Interleave<Self, J::IntoIter> ⓘ
    where J: IntoIterator<Item = Self::Item>, - Self: Sized,

    Alternate elements from two iterators until both have run out. Read more
    source§

    fn interleave_shortest<J>( + Self: Sized,

    Alternate elements from two iterators until both have run out. Read more
    source§

    fn interleave_shortest<J>( self, other: J ) -> InterleaveShortest<Self, J::IntoIter> ⓘ
    where J: IntoIterator<Item = Self::Item>, Self: Sized,

    Alternate elements from two iterators until at least one of them has run -out. Read more
    source§

    fn intersperse(self, element: Self::Item) -> Intersperse<Self>
    where +out. Read more

    source§

    fn intersperse(self, element: Self::Item) -> Intersperse<Self>
    where Self: Sized, Self::Item: Clone,

    An iterator adaptor to insert a particular value -between each element of the adapted iterator. Read more
    source§

    fn intersperse_with<F>(self, element: F) -> IntersperseWith<Self, F> ⓘ
    where +between each element of the adapted iterator. Read more

    source§

    fn intersperse_with<F>(self, element: F) -> IntersperseWith<Self, F> ⓘ
    where Self: Sized, F: FnMut() -> Self::Item,

    An iterator adaptor to insert a particular value created by a function -between each element of the adapted iterator. Read more
    source§

    fn zip_longest<J>(self, other: J) -> ZipLongest<Self, J::IntoIter> ⓘ
    where +between each element of the adapted iterator. Read more

    source§

    fn get<R>(self, index: R) -> R::Output
    where + Self: Sized, + R: IteratorIndex<Self>,

    Returns an iterator over a subsection of the iterator. Read more
    source§

    fn zip_longest<J>(self, other: J) -> ZipLongest<Self, J::IntoIter> ⓘ
    where J: IntoIterator, Self: Sized,

    Create an iterator which iterates over both this and the specified -iterator simultaneously, yielding pairs of two optional elements. Read more
    source§

    fn zip_eq<J>(self, other: J) -> ZipEq<Self, J::IntoIter> ⓘ
    where +iterator simultaneously, yielding pairs of two optional elements. Read more

    source§

    fn zip_eq<J>(self, other: J) -> ZipEq<Self, J::IntoIter> ⓘ
    where J: IntoIterator, Self: Sized,

    Create an iterator which iterates over both this and the specified -iterator simultaneously, yielding pairs of elements. Read more
    source§

    fn batching<B, F>(self, f: F) -> Batching<Self, F> ⓘ
    where +iterator simultaneously, yielding pairs of elements. Read more

    source§

    fn batching<B, F>(self, f: F) -> Batching<Self, F> ⓘ
    where F: FnMut(&mut Self) -> Option<B>, Self: Sized,

    A “meta iterator adaptor”. Its closure receives a reference to the iterator and may pick off as many elements as it likes, to produce the -next iterator element. Read more
    source§

    fn group_by<K, F>(self, key: F) -> GroupBy<K, Self, F>
    where +next iterator element. Read more

    source§

    fn chunk_by<K, F>(self, key: F) -> ChunkBy<K, Self, F>
    where Self: Sized, F: FnMut(&Self::Item) -> K, K: PartialEq,

    Return an iterable that can group iterator elements. Consecutive elements that map to the same key (“runs”), are assigned -to the same group. Read more
    source§

    fn chunks(self, size: usize) -> IntoChunks<Self>
    where - Self: Sized,

    Return an iterable that can chunk the iterator. Read more
    source§

    fn tuple_windows<T>(self) -> TupleWindows<Self, T> ⓘ
    where +to the same group. Read more

    source§

    fn group_by<K, F>(self, key: F) -> ChunkBy<K, Self, F>
    where + Self: Sized, + F: FnMut(&Self::Item) -> K, + K: PartialEq,

    👎Deprecated since 0.13.0: Use .chunk_by() instead
    See .chunk_by().
    source§

    fn chunks(self, size: usize) -> IntoChunks<Self>
    where + Self: Sized,

    Return an iterable that can chunk the iterator. Read more
    source§

    fn tuple_windows<T>(self) -> TupleWindows<Self, T> ⓘ
    where Self: Sized + Iterator<Item = T::Item>, T: HomogeneousTuple, T::Item: Clone,

    Return an iterator over all contiguous windows producing tuples of -a specific size (up to 12). Read more
    source§

    fn circular_tuple_windows<T>(self) -> CircularTupleWindows<Self, T> ⓘ
    where +a specific size (up to 12). Read more

    source§

    fn circular_tuple_windows<T>(self) -> CircularTupleWindows<Self, T> ⓘ
    where Self: Sized + Clone + Iterator<Item = T::Item> + ExactSizeIterator, T: TupleCollect + Clone, T::Item: Clone,

    Return an iterator over all windows, wrapping back to the first elements when the window would otherwise exceed the length of the -iterator, producing tuples of a specific size (up to 12). Read more
    source§

    fn tuples<T>(self) -> Tuples<Self, T> ⓘ
    where +iterator, producing tuples of a specific size (up to 12). Read more

    source§

    fn tuples<T>(self) -> Tuples<Self, T> ⓘ
    where Self: Sized + Iterator<Item = T::Item>, T: HomogeneousTuple,

    Return an iterator that groups the items in tuples of a specific size -(up to 12). Read more
    source§

    fn tee(self) -> (Tee<Self>, Tee<Self>)
    where +(up to 12). Read more

    source§

    fn tee(self) -> (Tee<Self>, Tee<Self>)
    where Self: Sized, Self::Item: Clone,

    Split into an iterator pair that both yield all elements from -the original iterator. Read more
    source§

    fn step(self, n: usize) -> Step<Self> ⓘ
    where - Self: Sized,

    👎Deprecated since 0.8.0: Use std .step_by() instead
    Return an iterator adaptor that steps n elements in the base iterator -for each iteration. Read more
    source§

    fn map_into<R>(self) -> MapInto<Self, R>
    where +the original iterator. Read more

    source§

    fn map_into<R>(self) -> MapInto<Self, R>
    where Self: Sized, - Self::Item: Into<R>,

    Convert each item of the iterator using the Into trait. Read more
    source§

    fn map_results<F, T, U, E>(self, f: F) -> MapOk<Self, F>
    where - Self: Iterator<Item = Result<T, E>> + Sized, - F: FnMut(T) -> U,

    👎Deprecated since 0.10.0: Use .map_ok() instead
    See .map_ok().
    source§

    fn map_ok<F, T, U, E>(self, f: F) -> MapOk<Self, F>
    where + Self::Item: Into<R>,

    Convert each item of the iterator using the Into trait. Read more
    source§

    fn map_ok<F, T, U, E>(self, f: F) -> MapOk<Self, F>
    where Self: Iterator<Item = Result<T, E>> + Sized, F: FnMut(T) -> U,

    Return an iterator adaptor that applies the provided closure to every Result::Ok value. Result::Err values are -unchanged. Read more
    source§

    fn filter_ok<F, T, E>(self, f: F) -> FilterOk<Self, F> ⓘ
    where +unchanged. Read more

    source§

    fn filter_ok<F, T, E>(self, f: F) -> FilterOk<Self, F> ⓘ
    where Self: Iterator<Item = Result<T, E>> + Sized, F: FnMut(&T) -> bool,

    Return an iterator adaptor that filters every Result::Ok value with the provided closure. Result::Err values are -unchanged. Read more
    source§

    fn filter_map_ok<F, T, U, E>(self, f: F) -> FilterMapOk<Self, F> ⓘ
    where +unchanged. Read more

    source§

    fn filter_map_ok<F, T, U, E>(self, f: F) -> FilterMapOk<Self, F> ⓘ
    where Self: Iterator<Item = Result<T, E>> + Sized, F: FnMut(T) -> Option<U>,

    Return an iterator adaptor that filters and transforms every Result::Ok value with the provided closure. Result::Err -values are unchanged. Read more
    source§

    fn flatten_ok<T, E>(self) -> FlattenOk<Self, T, E> ⓘ
    where +values are unchanged. Read more

    source§

    fn flatten_ok<T, E>(self) -> FlattenOk<Self, T, E> ⓘ
    where Self: Iterator<Item = Result<T, E>> + Sized, T: IntoIterator,

    Return an iterator adaptor that flattens every Result::Ok value into -a series of Result::Ok values. Result::Err values are unchanged. Read more
    source§

    fn process_results<F, T, E, R>(self, processor: F) -> Result<R, E>
    where +a series of Result::Ok values. Result::Err values are unchanged. Read more

    source§

    fn process_results<F, T, E, R>(self, processor: F) -> Result<R, E>
    where Self: Iterator<Item = Result<T, E>> + Sized, F: FnOnce(ProcessResults<'_, Self, E>) -> R,

    “Lift” a function of the values of the current iterator so as to process -an iterator of Result values instead. Read more
    source§

    fn merge<J>(self, other: J) -> Merge<Self, J::IntoIter>
    where +an iterator of Result values instead. Read more

    source§

    fn merge<J>(self, other: J) -> Merge<Self, J::IntoIter>
    where Self: Sized, Self::Item: PartialOrd, J: IntoIterator<Item = Self::Item>,

    Return an iterator adaptor that merges the two base iterators in ascending order. If both base iterators are sorted (ascending), the -result is sorted. Read more
    source§

    fn merge_by<J, F>(self, other: J, is_first: F) -> MergeBy<Self, J::IntoIter, F> ⓘ
    where +result is sorted. Read more

    source§

    fn merge_by<J, F>(self, other: J, is_first: F) -> MergeBy<Self, J::IntoIter, F> ⓘ
    where Self: Sized, J: IntoIterator<Item = Self::Item>, F: FnMut(&Self::Item, &Self::Item) -> bool,

    Return an iterator adaptor that merges the two base iterators in order. -This is much like .merge() but allows for a custom ordering. Read more
    source§

    fn merge_join_by<J, F, T>( +This is much like .merge() but allows for a custom ordering. Read more

    source§

    fn merge_join_by<J, F, T>( self, other: J, cmp_fn: F @@ -302,285 +305,296 @@ This is much like IntoIterator, F: FnMut(&Self::Item, &J::Item) -> T, Self: Sized,

    Create an iterator that merges items from both this and the specified -iterator in ascending order. Read more
    source§

    fn kmerge(self) -> KMerge<<Self::Item as IntoIterator>::IntoIter>
    where +iterator in ascending order. Read more

    source§

    fn kmerge(self) -> KMerge<<Self::Item as IntoIterator>::IntoIter>
    where Self: Sized, Self::Item: IntoIterator, <Self::Item as IntoIterator>::Item: PartialOrd,

    Return an iterator adaptor that flattens an iterator of iterators by -merging them in ascending order. Read more
    source§

    fn kmerge_by<F>( +merging them in ascending order. Read more

    source§

    fn kmerge_by<F>( self, first: F ) -> KMergeBy<<Self::Item as IntoIterator>::IntoIter, F> ⓘ
    where Self: Sized, Self::Item: IntoIterator, F: FnMut(&<Self::Item as IntoIterator>::Item, &<Self::Item as IntoIterator>::Item) -> bool,

    Return an iterator adaptor that flattens an iterator of iterators by -merging them according to the given closure. Read more
    source§

    fn cartesian_product<J>(self, other: J) -> Product<Self, J::IntoIter> ⓘ
    where +merging them according to the given closure. Read more

    source§

    fn cartesian_product<J>(self, other: J) -> Product<Self, J::IntoIter> ⓘ
    where Self: Sized, Self::Item: Clone, J: IntoIterator, J::IntoIter: Clone,

    Return an iterator adaptor that iterates over the cartesian product of -the element sets of two iterators self and J. Read more
    source§

    fn multi_cartesian_product( +the element sets of two iterators self and J. Read more

    source§

    fn multi_cartesian_product( self ) -> MultiProduct<<Self::Item as IntoIterator>::IntoIter> ⓘ
    where Self: Sized, Self::Item: IntoIterator, <Self::Item as IntoIterator>::IntoIter: Clone, <Self::Item as IntoIterator>::Item: Clone,

    Return an iterator adaptor that iterates over the cartesian product of -all subiterators returned by meta-iterator self. Read more
    source§

    fn coalesce<F>(self, f: F) -> Coalesce<Self, F>
    where +all subiterators returned by meta-iterator self. Read more

    source§

    fn coalesce<F>(self, f: F) -> Coalesce<Self, F>
    where Self: Sized, F: FnMut(Self::Item, Self::Item) -> Result<Self::Item, (Self::Item, Self::Item)>,

    Return an iterator adaptor that uses the passed-in closure to -optionally merge together consecutive elements. Read more
    source§

    fn dedup(self) -> Dedup<Self>
    where +optionally merge together consecutive elements. Read more

    source§

    fn dedup(self) -> Dedup<Self>
    where Self: Sized, Self::Item: PartialEq,

    Remove duplicates from sections of consecutive identical elements. -If the iterator is sorted, all elements will be unique. Read more
    source§

    fn dedup_by<Cmp>(self, cmp: Cmp) -> DedupBy<Self, Cmp>
    where +If the iterator is sorted, all elements will be unique. Read more

    source§

    fn dedup_by<Cmp>(self, cmp: Cmp) -> DedupBy<Self, Cmp>
    where Self: Sized, Cmp: FnMut(&Self::Item, &Self::Item) -> bool,

    Remove duplicates from sections of consecutive identical elements, determining equality using a comparison function. -If the iterator is sorted, all elements will be unique. Read more
    source§

    fn dedup_with_count(self) -> DedupWithCount<Self>
    where +If the iterator is sorted, all elements will be unique. Read more

    source§

    fn dedup_with_count(self) -> DedupWithCount<Self>
    where Self: Sized,

    Remove duplicates from sections of consecutive identical elements, while keeping a count of how many repeated elements were present. -If the iterator is sorted, all elements will be unique. Read more
    source§

    fn dedup_by_with_count<Cmp>(self, cmp: Cmp) -> DedupByWithCount<Self, Cmp>
    where +If the iterator is sorted, all elements will be unique. Read more

    source§

    fn dedup_by_with_count<Cmp>(self, cmp: Cmp) -> DedupByWithCount<Self, Cmp>
    where Self: Sized, Cmp: FnMut(&Self::Item, &Self::Item) -> bool,

    Remove duplicates from sections of consecutive identical elements, while keeping a count of how many repeated elements were present. This will determine equality using a comparison function. -If the iterator is sorted, all elements will be unique. Read more
    source§

    fn duplicates(self) -> Duplicates<Self>
    where +If the iterator is sorted, all elements will be unique. Read more

    source§

    fn duplicates(self) -> Duplicates<Self>
    where Self: Sized, Self::Item: Eq + Hash,

    Return an iterator adaptor that produces elements that appear more than once during the -iteration. Duplicates are detected using hash and equality. Read more
    source§

    fn duplicates_by<V, F>(self, f: F) -> DuplicatesBy<Self, V, F>
    where +iteration. Duplicates are detected using hash and equality. Read more

    source§

    fn duplicates_by<V, F>(self, f: F) -> DuplicatesBy<Self, V, F>
    where Self: Sized, V: Eq + Hash, F: FnMut(&Self::Item) -> V,

    Return an iterator adaptor that produces elements that appear more than once during the -iteration. Duplicates are detected using hash and equality. Read more
    source§

    fn unique(self) -> Unique<Self> ⓘ
    where +iteration. Duplicates are detected using hash and equality. Read more

    source§

    fn unique(self) -> Unique<Self> ⓘ
    where Self: Sized, Self::Item: Clone + Eq + Hash,

    Return an iterator adaptor that filters out elements that have already been produced once during the iteration. Duplicates -are detected using hash and equality. Read more
    source§

    fn unique_by<V, F>(self, f: F) -> UniqueBy<Self, V, F> ⓘ
    where +are detected using hash and equality. Read more

    source§

    fn unique_by<V, F>(self, f: F) -> UniqueBy<Self, V, F> ⓘ
    where Self: Sized, V: Eq + Hash, F: FnMut(&Self::Item) -> V,

    Return an iterator adaptor that filters out elements that have -already been produced once during the iteration. Read more
    source§

    fn peeking_take_while<F>(&mut self, accept: F) -> PeekingTakeWhile<'_, Self, F> ⓘ
    where +already been produced once during the iteration. Read more

    source§

    fn peeking_take_while<F>(&mut self, accept: F) -> PeekingTakeWhile<'_, Self, F> ⓘ
    where Self: Sized + PeekingNext, F: FnMut(&Self::Item) -> bool,

    Return an iterator adaptor that borrows from this iterator and -takes items while the closure accept returns true. Read more
    source§

    fn take_while_ref<F>(&mut self, accept: F) -> TakeWhileRef<'_, Self, F> ⓘ
    where +takes items while the closure accept returns true. Read more

    source§

    fn take_while_ref<F>(&mut self, accept: F) -> TakeWhileRef<'_, Self, F> ⓘ
    where Self: Clone, F: FnMut(&Self::Item) -> bool,

    Return an iterator adaptor that borrows from a Clone-able iterator -to only pick off elements while the predicate accept returns true. Read more
    source§

    fn take_while_inclusive<F>(self, accept: F) -> TakeWhileInclusive<Self, F> ⓘ
    where +to only pick off elements while the predicate accept returns true. Read more

    source§

    fn take_while_inclusive<F>(self, accept: F) -> TakeWhileInclusive<Self, F> ⓘ
    where Self: Sized, F: FnMut(&Self::Item) -> bool,

    Returns an iterator adaptor that consumes elements while the given predicate is true, including the element for which the predicate -first returned false. Read more
    source§

    fn while_some<A>(self) -> WhileSome<Self> ⓘ
    where +first returned false. Read more

    source§

    fn while_some<A>(self) -> WhileSome<Self> ⓘ
    where Self: Sized + Iterator<Item = Option<A>>,

    Return an iterator adaptor that filters Option<A> iterator elements -and produces A. Stops on the first None encountered. Read more
    source§

    fn tuple_combinations<T>(self) -> TupleCombinations<Self, T> ⓘ
    where +and produces A. Stops on the first None encountered. Read more

    source§

    fn tuple_combinations<T>(self) -> TupleCombinations<Self, T> ⓘ
    where Self: Sized + Clone, Self::Item: Clone, T: HasCombination<Self>,

    Return an iterator adaptor that iterates over the combinations of the -elements from an iterator. Read more
    source§

    fn combinations(self, k: usize) -> Combinations<Self> ⓘ
    where +elements from an iterator. Read more

    source§

    fn combinations(self, k: usize) -> Combinations<Self> ⓘ
    where Self: Sized, Self::Item: Clone,

    Return an iterator adaptor that iterates over the k-length combinations of -the elements from an iterator. Read more
    source§

    fn combinations_with_replacement( +the elements from an iterator. Read more

    source§

    fn combinations_with_replacement( self, k: usize ) -> CombinationsWithReplacement<Self> ⓘ
    where Self: Sized, Self::Item: Clone,

    Return an iterator that iterates over the k-length combinations of -the elements from an iterator, with replacement. Read more
    source§

    fn permutations(self, k: usize) -> Permutations<Self> ⓘ
    where +the elements from an iterator, with replacement. Read more

    source§

    fn permutations(self, k: usize) -> Permutations<Self> ⓘ
    where Self: Sized, Self::Item: Clone,

    Return an iterator adaptor that iterates over all k-permutations of the -elements from an iterator. Read more
    source§

    fn powerset(self) -> Powerset<Self> ⓘ
    where +elements from an iterator. Read more

    source§

    fn powerset(self) -> Powerset<Self> ⓘ
    where Self: Sized, Self::Item: Clone,

    Return an iterator that iterates through the powerset of the elements from an -iterator. Read more
    source§

    fn pad_using<F>(self, min: usize, f: F) -> PadUsing<Self, F> ⓘ
    where +iterator. Read more

    source§

    fn pad_using<F>(self, min: usize, f: F) -> PadUsing<Self, F> ⓘ
    where Self: Sized, F: FnMut(usize) -> Self::Item,

    Return an iterator adaptor that pads the sequence to a minimum length of -min by filling missing elements using a closure f. Read more
    source§

    fn with_position(self) -> WithPosition<Self> ⓘ
    where +min by filling missing elements using a closure f. Read more

    source§

    fn with_position(self) -> WithPosition<Self> ⓘ
    where Self: Sized,

    Return an iterator adaptor that combines each element with a Position to -ease special-case handling of the first or last elements. Read more
    source§

    fn positions<P>(self, predicate: P) -> Positions<Self, P> ⓘ
    where +ease special-case handling of the first or last elements. Read more

    source§

    fn positions<P>(self, predicate: P) -> Positions<Self, P> ⓘ
    where Self: Sized, P: FnMut(Self::Item) -> bool,

    Return an iterator adaptor that yields the indices of all elements -satisfying a predicate, counted from the start of the iterator. Read more
    source§

    fn update<F>(self, updater: F) -> Update<Self, F> ⓘ
    where +satisfying a predicate, counted from the start of the iterator. Read more

    source§

    fn update<F>(self, updater: F) -> Update<Self, F> ⓘ
    where Self: Sized, F: FnMut(&mut Self::Item),

    Return an iterator adaptor that applies a mutating function -to each element before yielding it. Read more
    source§

    fn next_tuple<T>(&mut self) -> Option<T>
    where +to each element before yielding it. Read more

    source§

    fn next_tuple<T>(&mut self) -> Option<T>
    where Self: Sized + Iterator<Item = T::Item>, T: HomogeneousTuple,

    Advances the iterator and returns the next items grouped in a tuple of -a specific size (up to 12). Read more
    source§

    fn collect_tuple<T>(self) -> Option<T>
    where +a specific size (up to 12). Read more

    source§

    fn collect_tuple<T>(self) -> Option<T>
    where Self: Sized + Iterator<Item = T::Item>, T: HomogeneousTuple,

    Collects all items from the iterator into a tuple of a specific size -(up to 12). Read more
    source§

    fn find_position<P>(&mut self, pred: P) -> Option<(usize, Self::Item)>
    where - P: FnMut(&Self::Item) -> bool,

    Find the position and value of the first element satisfying a predicate. Read more
    source§

    fn find_or_last<P>(self, predicate: P) -> Option<Self::Item>
    where +(up to 12). Read more

    source§

    fn find_position<P>(&mut self, pred: P) -> Option<(usize, Self::Item)>
    where + P: FnMut(&Self::Item) -> bool,

    Find the position and value of the first element satisfying a predicate. Read more
    source§

    fn find_or_last<P>(self, predicate: P) -> Option<Self::Item>
    where Self: Sized, - P: FnMut(&Self::Item) -> bool,

    Find the value of the first element satisfying a predicate or return the last element, if any. Read more
    source§

    fn find_or_first<P>(self, predicate: P) -> Option<Self::Item>
    where + P: FnMut(&Self::Item) -> bool,

    Find the value of the first element satisfying a predicate or return the last element, if any. Read more
    source§

    fn find_or_first<P>(self, predicate: P) -> Option<Self::Item>
    where Self: Sized, - P: FnMut(&Self::Item) -> bool,

    Find the value of the first element satisfying a predicate or return the first element, if any. Read more
    source§

    fn contains<Q>(&mut self, query: &Q) -> bool
    where + P: FnMut(&Self::Item) -> bool,

    Find the value of the first element satisfying a predicate or return the first element, if any. Read more
    source§

    fn contains<Q>(&mut self, query: &Q) -> bool
    where Self: Sized, Self::Item: Borrow<Q>, - Q: PartialEq,

    Returns true if the given item is present in this iterator. Read more
    source§

    fn all_equal(&mut self) -> bool
    where + Q: PartialEq,

    Returns true if the given item is present in this iterator. Read more
    source§

    fn all_equal(&mut self) -> bool
    where Self: Sized, - Self::Item: PartialEq,

    Check whether all elements compare equal. Read more
    source§

    fn all_equal_value( + Self::Item: PartialEq,

    Check whether all elements compare equal. Read more
    source§

    fn all_equal_value( &mut self ) -> Result<Self::Item, Option<(Self::Item, Self::Item)>>
    where Self: Sized, Self::Item: PartialEq,

    If there are elements and they are all equal, return a single copy of that element. If there are no elements, return an Error containing None. If there are elements and they are not all equal, return a tuple containing the first -two non-equal elements found. Read more
    source§

    fn all_unique(&mut self) -> bool
    where +two non-equal elements found. Read more

    source§

    fn all_unique(&mut self) -> bool
    where Self: Sized, - Self::Item: Eq + Hash,

    Check whether all elements are unique (non equal). Read more
    source§

    fn dropping(self, n: usize) -> Self
    where + Self::Item: Eq + Hash,

    Check whether all elements are unique (non equal). Read more
    source§

    fn dropping(self, n: usize) -> Self
    where Self: Sized,

    Consume the first n elements from the iterator eagerly, -and return the same iterator again. Read more
    source§

    fn dropping_back(self, n: usize) -> Self
    where +and return the same iterator again. Read more

    source§

    fn dropping_back(self, n: usize) -> Self
    where Self: Sized + DoubleEndedIterator,

    Consume the last n elements from the iterator eagerly, -and return the same iterator again. Read more
    source§

    fn foreach<F>(self, f: F)
    where - F: FnMut(Self::Item), - Self: Sized,

    👎Deprecated since 0.8.0: Use .for_each() instead
    Run the closure f eagerly on each element of the iterator. Read more
    source§

    fn concat(self) -> Self::Item
    where +and return the same iterator again. Read more

    source§

    fn concat(self) -> Self::Item
    where Self: Sized, - Self::Item: Extend<<<Self as Iterator>::Item as IntoIterator>::Item> + IntoIterator + Default,

    Combine all an iterator’s elements into one element by using Extend. Read more
    source§

    fn collect_vec(self) -> Vec<Self::Item>
    where + Self::Item: Extend<<<Self as Iterator>::Item as IntoIterator>::Item> + IntoIterator + Default,

    Combine all an iterator’s elements into one element by using Extend. Read more
    source§

    fn collect_vec(self) -> Vec<Self::Item>
    where Self: Sized,

    .collect_vec() is simply a type specialization of Iterator::collect, -for convenience.
    source§

    fn try_collect<T, U, E>(self) -> Result<U, E>
    where +for convenience.

    source§

    fn try_collect<T, U, E>(self) -> Result<U, E>
    where Self: Sized + Iterator<Item = Result<T, E>>, Result<U, E>: FromIterator<Result<T, E>>,

    .try_collect() is more convenient way of writing -.collect::<Result<_, _>>() Read more
    source§

    fn set_from<'a, A: 'a, J>(&mut self, from: J) -> usize
    where +.collect::<Result<_, _>>() Read more

    source§

    fn set_from<'a, A: 'a, J>(&mut self, from: J) -> usize
    where Self: Iterator<Item = &'a mut A>, J: IntoIterator<Item = A>,

    Assign to each reference in self from the from iterator, -stopping at the shortest of the two iterators. Read more
    source§

    fn join(&mut self, sep: &str) -> String
    where - Self::Item: Display,

    Combine all iterator elements into one String, separated by sep. Read more
    source§

    fn format(self, sep: &str) -> Format<'_, Self>
    where - Self: Sized,

    Format all iterator elements, separated by sep. Read more
    source§

    fn format_with<F>(self, sep: &str, format: F) -> FormatWith<'_, Self, F>
    where +stopping at the shortest of the two iterators. Read more

    source§

    fn join(&mut self, sep: &str) -> String
    where + Self::Item: Display,

    Combine all iterator elements into one String, separated by sep. Read more
    source§

    fn format(self, sep: &str) -> Format<'_, Self>
    where + Self: Sized,

    Format all iterator elements, separated by sep. Read more
    source§

    fn format_with<F>(self, sep: &str, format: F) -> FormatWith<'_, Self, F>
    where Self: Sized, - F: FnMut(Self::Item, &mut dyn FnMut(&dyn Display) -> Result) -> Result,

    Format all iterator elements, separated by sep. Read more
    source§

    fn fold_results<A, E, B, F>(&mut self, start: B, f: F) -> Result<B, E>
    where + F: FnMut(Self::Item, &mut dyn FnMut(&dyn Display) -> Result) -> Result,

    Format all iterator elements, separated by sep. Read more
    source§

    fn fold_ok<A, E, B, F>(&mut self, start: B, f: F) -> Result<B, E>
    where Self: Iterator<Item = Result<A, E>>, - F: FnMut(B, A) -> B,

    👎Deprecated since 0.10.0: Use .fold_ok() instead
    See .fold_ok().
    source§

    fn fold_ok<A, E, B, F>(&mut self, start: B, f: F) -> Result<B, E>
    where - Self: Iterator<Item = Result<A, E>>, - F: FnMut(B, A) -> B,

    Fold Result values from an iterator. Read more
    source§

    fn fold_options<A, B, F>(&mut self, start: B, f: F) -> Option<B>
    where + F: FnMut(B, A) -> B,

    Fold Result values from an iterator. Read more
    source§

    fn fold_options<A, B, F>(&mut self, start: B, f: F) -> Option<B>
    where Self: Iterator<Item = Option<A>>, - F: FnMut(B, A) -> B,

    Fold Option values from an iterator. Read more
    source§

    fn fold1<F>(self, f: F) -> Option<Self::Item>
    where + F: FnMut(B, A) -> B,

    Fold Option values from an iterator. Read more
    source§

    fn fold1<F>(self, f: F) -> Option<Self::Item>
    where F: FnMut(Self::Item, Self::Item) -> Self::Item, - Self: Sized,

    👎Deprecated since 0.10.2: Use Iterator::reduce instead
    Accumulator of the elements in the iterator. Read more
    source§

    fn tree_fold1<F>(self, f: F) -> Option<Self::Item>
    where + Self: Sized,

    👎Deprecated since 0.10.2: Use Iterator::reduce instead
    Accumulator of the elements in the iterator. Read more
    source§

    fn tree_reduce<F>(self, f: F) -> Option<Self::Item>
    where F: FnMut(Self::Item, Self::Item) -> Self::Item, - Self: Sized,

    Accumulate the elements in the iterator in a tree-like manner. Read more
    source§

    fn fold_while<B, F>(&mut self, init: B, f: F) -> FoldWhile<B>
    where + Self: Sized,

    Accumulate the elements in the iterator in a tree-like manner. Read more
    source§

    fn tree_fold1<F>(self, f: F) -> Option<Self::Item>
    where + F: FnMut(Self::Item, Self::Item) -> Self::Item, + Self: Sized,

    👎Deprecated since 0.13.0: Use .tree_reduce() instead
    See .tree_reduce().
    source§

    fn fold_while<B, F>(&mut self, init: B, f: F) -> FoldWhile<B>
    where Self: Sized, - F: FnMut(B, Self::Item) -> FoldWhile<B>,

    An iterator method that applies a function, producing a single, final value. Read more
    source§

    fn sum1<S>(self) -> Option<S>
    where + F: FnMut(B, Self::Item) -> FoldWhile<B>,

    An iterator method that applies a function, producing a single, final value. Read more
    source§

    fn sum1<S>(self) -> Option<S>
    where Self: Sized, - S: Sum<Self::Item>,

    Iterate over the entire iterator and add all the elements. Read more
    source§

    fn product1<P>(self) -> Option<P>
    where + S: Sum<Self::Item>,

    Iterate over the entire iterator and add all the elements. Read more
    source§

    fn product1<P>(self) -> Option<P>
    where Self: Sized, - P: Product<Self::Item>,

    Iterate over the entire iterator and multiply all the elements. Read more
    source§

    fn sorted_unstable(self) -> IntoIter<Self::Item> ⓘ
    where + P: Product<Self::Item>,

    Iterate over the entire iterator and multiply all the elements. Read more
    source§

    fn sorted_unstable(self) -> IntoIter<Self::Item> ⓘ
    where Self: Sized, - Self::Item: Ord,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_unstable_by<F>(self, cmp: F) -> IntoIter<Self::Item> ⓘ
    where + Self::Item: Ord,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_unstable_by<F>(self, cmp: F) -> IntoIter<Self::Item> ⓘ
    where Self: Sized, - F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_unstable_by_key<K, F>(self, f: F) -> IntoIter<Self::Item> ⓘ
    where + F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_unstable_by_key<K, F>(self, f: F) -> IntoIter<Self::Item> ⓘ
    where Self: Sized, K: Ord, - F: FnMut(&Self::Item) -> K,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted(self) -> IntoIter<Self::Item> ⓘ
    where + F: FnMut(&Self::Item) -> K,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted(self) -> IntoIter<Self::Item> ⓘ
    where Self: Sized, - Self::Item: Ord,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_by<F>(self, cmp: F) -> IntoIter<Self::Item> ⓘ
    where + Self::Item: Ord,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_by<F>(self, cmp: F) -> IntoIter<Self::Item> ⓘ
    where Self: Sized, - F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_by_key<K, F>(self, f: F) -> IntoIter<Self::Item> ⓘ
    where + F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_by_key<K, F>(self, f: F) -> IntoIter<Self::Item> ⓘ
    where Self: Sized, K: Ord, - F: FnMut(&Self::Item) -> K,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_by_cached_key<K, F>(self, f: F) -> IntoIter<Self::Item> ⓘ
    where + F: FnMut(&Self::Item) -> K,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_by_cached_key<K, F>(self, f: F) -> IntoIter<Self::Item> ⓘ
    where Self: Sized, K: Ord, F: FnMut(&Self::Item) -> K,

    Sort all iterator elements into a new iterator in ascending order. The key function is -called exactly once per key. Read more
    source§

    fn k_smallest(self, k: usize) -> IntoIter<Self::Item> ⓘ
    where +called exactly once per key. Read more

    source§

    fn k_smallest(self, k: usize) -> IntoIter<Self::Item> ⓘ
    where Self: Sized, - Self::Item: Ord,

    Sort the k smallest elements into a new iterator, in ascending order. Read more
    source§

    fn partition_map<A, B, F, L, R>(self, predicate: F) -> (A, B)
    where + Self::Item: Ord,

    Sort the k smallest elements into a new iterator, in ascending order. Read more
    source§

    fn k_smallest_by<F>(self, k: usize, cmp: F) -> IntoIter<Self::Item> ⓘ
    where + Self: Sized, + F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Sort the k smallest elements into a new iterator using the provided comparison. Read more
    source§

    fn k_smallest_by_key<F, K>(self, k: usize, key: F) -> IntoIter<Self::Item> ⓘ
    where + Self: Sized, + F: FnMut(&Self::Item) -> K, + K: Ord,

    Return the elements producing the k smallest outputs of the provided function. Read more
    source§

    fn k_largest(self, k: usize) -> IntoIter<Self::Item> ⓘ
    where + Self: Sized, + Self::Item: Ord,

    Sort the k largest elements into a new iterator, in descending order. Read more
    source§

    fn k_largest_by<F>(self, k: usize, cmp: F) -> IntoIter<Self::Item> ⓘ
    where + Self: Sized, + F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Sort the k largest elements into a new iterator using the provided comparison. Read more
    source§

    fn k_largest_by_key<F, K>(self, k: usize, key: F) -> IntoIter<Self::Item> ⓘ
    where + Self: Sized, + F: FnMut(&Self::Item) -> K, + K: Ord,

    Return the elements producing the k largest outputs of the provided function. Read more
    source§

    fn tail(self, n: usize) -> IntoIter<Self::Item> ⓘ
    where + Self: Sized,

    Consumes the iterator and return an iterator of the last n elements. Read more
    source§

    fn partition_map<A, B, F, L, R>(self, predicate: F) -> (A, B)
    where Self: Sized, F: FnMut(Self::Item) -> Either<L, R>, A: Default + Extend<L>, B: Default + Extend<R>,

    Collect all iterator elements into one of two partitions. Unlike Iterator::partition, each partition may -have a distinct type. Read more
    source§

    fn partition_result<A, B, T, E>(self) -> (A, B)
    where +have a distinct type. Read more

    source§

    fn partition_result<A, B, T, E>(self) -> (A, B)
    where Self: Iterator<Item = Result<T, E>> + Sized, A: Default + Extend<T>, B: Default + Extend<E>,

    Partition a sequence of Results into one list of all the Ok elements -and another list of all the Err elements. Read more
    source§

    fn into_group_map<K, V>(self) -> HashMap<K, Vec<V>>
    where +and another list of all the Err elements. Read more

    source§

    fn into_group_map<K, V>(self) -> HashMap<K, Vec<V>>
    where Self: Iterator<Item = (K, V)> + Sized, K: Hash + Eq,

    Return a HashMap of keys mapped to Vecs of values. Keys and values -are taken from (Key, Value) tuple pairs yielded by the input iterator. Read more
    source§

    fn into_group_map_by<K, V, F>(self, f: F) -> HashMap<K, Vec<V>>
    where +are taken from (Key, Value) tuple pairs yielded by the input iterator. Read more

    source§

    fn into_group_map_by<K, V, F>(self, f: F) -> HashMap<K, Vec<V>>
    where Self: Iterator<Item = V> + Sized, K: Hash + Eq, - F: Fn(&V) -> K,

    Return an Iterator on a HashMap. Keys mapped to Vecs of values. The key is specified -in the closure. Read more
    source§

    fn into_grouping_map<K, V>(self) -> GroupingMap<Self>
    where + F: FnMut(&V) -> K,

    Return an Iterator on a HashMap. Keys mapped to Vecs of values. The key is specified +in the closure. Read more
    source§

    fn into_grouping_map<K, V>(self) -> GroupingMap<Self>
    where Self: Iterator<Item = (K, V)> + Sized, K: Hash + Eq,

    Constructs a GroupingMap to be used later with one of the efficient -group-and-fold operations it allows to perform. Read more
    source§

    fn into_grouping_map_by<K, V, F>(self, key_mapper: F) -> GroupingMapBy<Self, F>
    where +group-and-fold operations it allows to perform. Read more

    source§

    fn into_grouping_map_by<K, V, F>(self, key_mapper: F) -> GroupingMapBy<Self, F>
    where Self: Iterator<Item = V> + Sized, K: Hash + Eq, F: FnMut(&V) -> K,

    Constructs a GroupingMap to be used later with one of the efficient -group-and-fold operations it allows to perform. Read more
    source§

    fn min_set(self) -> Vec<Self::Item>
    where +group-and-fold operations it allows to perform. Read more

    source§

    fn min_set(self) -> Vec<Self::Item>
    where Self: Sized, - Self::Item: Ord,

    Return all minimum elements of an iterator. Read more
    source§

    fn min_set_by<F>(self, compare: F) -> Vec<Self::Item>
    where + Self::Item: Ord,

    Return all minimum elements of an iterator. Read more
    source§

    fn min_set_by<F>(self, compare: F) -> Vec<Self::Item>
    where Self: Sized, F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Return all minimum elements of an iterator, as determined by -the specified function. Read more
    source§

    fn min_set_by_key<K, F>(self, key: F) -> Vec<Self::Item>
    where +the specified function. Read more

    source§

    fn min_set_by_key<K, F>(self, key: F) -> Vec<Self::Item>
    where Self: Sized, K: Ord, F: FnMut(&Self::Item) -> K,

    Return all minimum elements of an iterator, as determined by -the specified function. Read more
    source§

    fn max_set(self) -> Vec<Self::Item>
    where +the specified function. Read more

    source§

    fn max_set(self) -> Vec<Self::Item>
    where Self: Sized, - Self::Item: Ord,

    Return all maximum elements of an iterator. Read more
    source§

    fn max_set_by<F>(self, compare: F) -> Vec<Self::Item>
    where + Self::Item: Ord,

    Return all maximum elements of an iterator. Read more
    source§

    fn max_set_by<F>(self, compare: F) -> Vec<Self::Item>
    where Self: Sized, F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Return all maximum elements of an iterator, as determined by -the specified function. Read more
    source§

    fn max_set_by_key<K, F>(self, key: F) -> Vec<Self::Item>
    where +the specified function. Read more

    source§

    fn max_set_by_key<K, F>(self, key: F) -> Vec<Self::Item>
    where Self: Sized, K: Ord, F: FnMut(&Self::Item) -> K,

    Return all maximum elements of an iterator, as determined by -the specified function. Read more
    source§

    fn minmax(self) -> MinMaxResult<Self::Item>
    where +the specified function. Read more

    source§

    fn minmax(self) -> MinMaxResult<Self::Item>
    where Self: Sized, - Self::Item: PartialOrd,

    Return the minimum and maximum elements in the iterator. Read more
    source§

    fn minmax_by_key<K, F>(self, key: F) -> MinMaxResult<Self::Item>
    where + Self::Item: PartialOrd,

    Return the minimum and maximum elements in the iterator. Read more
    source§

    fn minmax_by_key<K, F>(self, key: F) -> MinMaxResult<Self::Item>
    where Self: Sized, K: PartialOrd, F: FnMut(&Self::Item) -> K,

    Return the minimum and maximum element of an iterator, as determined by -the specified function. Read more
    source§

    fn minmax_by<F>(self, compare: F) -> MinMaxResult<Self::Item>
    where +the specified function. Read more

    source§

    fn minmax_by<F>(self, compare: F) -> MinMaxResult<Self::Item>
    where Self: Sized, F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Return the minimum and maximum element of an iterator, as determined by -the specified comparison function. Read more
    source§

    fn position_max(self) -> Option<usize>
    where +the specified comparison function. Read more

    source§

    fn position_max(self) -> Option<usize>
    where Self: Sized, - Self::Item: Ord,

    Return the position of the maximum element in the iterator. Read more
    source§

    fn position_max_by_key<K, F>(self, key: F) -> Option<usize>
    where + Self::Item: Ord,

    Return the position of the maximum element in the iterator. Read more
    source§

    fn position_max_by_key<K, F>(self, key: F) -> Option<usize>
    where Self: Sized, K: Ord, F: FnMut(&Self::Item) -> K,

    Return the position of the maximum element in the iterator, as -determined by the specified function. Read more
    source§

    fn position_max_by<F>(self, compare: F) -> Option<usize>
    where +determined by the specified function. Read more

    source§

    fn position_max_by<F>(self, compare: F) -> Option<usize>
    where Self: Sized, F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Return the position of the maximum element in the iterator, as -determined by the specified comparison function. Read more
    source§

    fn position_min(self) -> Option<usize>
    where +determined by the specified comparison function. Read more

    source§

    fn position_min(self) -> Option<usize>
    where Self: Sized, - Self::Item: Ord,

    Return the position of the minimum element in the iterator. Read more
    source§

    fn position_min_by_key<K, F>(self, key: F) -> Option<usize>
    where + Self::Item: Ord,

    Return the position of the minimum element in the iterator. Read more
    source§

    fn position_min_by_key<K, F>(self, key: F) -> Option<usize>
    where Self: Sized, K: Ord, F: FnMut(&Self::Item) -> K,

    Return the position of the minimum element in the iterator, as -determined by the specified function. Read more
    source§

    fn position_min_by<F>(self, compare: F) -> Option<usize>
    where +determined by the specified function. Read more

    source§

    fn position_min_by<F>(self, compare: F) -> Option<usize>
    where Self: Sized, F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Return the position of the minimum element in the iterator, as -determined by the specified comparison function. Read more
    source§

    fn position_minmax(self) -> MinMaxResult<usize>
    where +determined by the specified comparison function. Read more

    source§

    fn position_minmax(self) -> MinMaxResult<usize>
    where Self: Sized, Self::Item: PartialOrd,

    Return the positions of the minimum and maximum elements in -the iterator. Read more
    source§

    fn position_minmax_by_key<K, F>(self, key: F) -> MinMaxResult<usize>
    where +the iterator. Read more

    source§

    fn position_minmax_by_key<K, F>(self, key: F) -> MinMaxResult<usize>
    where Self: Sized, K: PartialOrd, F: FnMut(&Self::Item) -> K,

    Return the postions of the minimum and maximum elements of an -iterator, as determined by the specified function. Read more
    source§

    fn position_minmax_by<F>(self, compare: F) -> MinMaxResult<usize>
    where +iterator, as determined by the specified function. Read more

    source§

    fn position_minmax_by<F>(self, compare: F) -> MinMaxResult<usize>
    where Self: Sized, F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Return the postions of the minimum and maximum elements of an -iterator, as determined by the specified comparison function. Read more
    source§

    fn exactly_one(self) -> Result<Self::Item, ExactlyOneError<Self>>
    where +iterator, as determined by the specified comparison function. Read more

    source§

    fn exactly_one(self) -> Result<Self::Item, ExactlyOneError<Self>>
    where Self: Sized,

    If the iterator yields exactly one element, that element will be returned, otherwise an error will be returned containing an iterator that has the same output as the input -iterator. Read more
    source§

    fn at_most_one(self) -> Result<Option<Self::Item>, ExactlyOneError<Self>>
    where - Self: Sized,

    If the iterator yields no elements, Ok(None) will be returned. If the iterator yields +iterator. Read more
    source§

    fn at_most_one(self) -> Result<Option<Self::Item>, ExactlyOneError<Self>>
    where + Self: Sized,

    If the iterator yields no elements, Ok(None) will be returned. If the iterator yields exactly one element, that element will be returned, otherwise an error will be returned -containing an iterator that has the same output as the input iterator. Read more
    source§

    fn multipeek(self) -> MultiPeek<Self> ⓘ
    where +containing an iterator that has the same output as the input iterator. Read more

    source§

    fn multipeek(self) -> MultiPeek<Self> ⓘ
    where Self: Sized,

    An iterator adaptor that allows the user to peek at multiple .next() -values without advancing the base iterator. Read more
    source§

    fn counts(self) -> HashMap<Self::Item, usize>
    where +values without advancing the base iterator. Read more

    source§

    fn counts(self) -> HashMap<Self::Item, usize>
    where Self: Sized, Self::Item: Eq + Hash,

    Collect the items in this iterator and return a HashMap which contains each item that appears in the iterator and the number -of times it appears. Read more
    source§

    fn counts_by<K, F>(self, f: F) -> HashMap<K, usize>
    where +of times it appears. Read more

    source§

    fn counts_by<K, F>(self, f: F) -> HashMap<K, usize>
    where Self: Sized, K: Eq + Hash, F: FnMut(Self::Item) -> K,

    Collect the items in this iterator and return a HashMap which contains each item that appears in the iterator and the number of times it appears, -determining identity using a keying function. Read more
    source§

    fn multiunzip<FromI>(self) -> FromI
    where - Self: Sized + MultiUnzip<FromI>,

    Converts an iterator of tuples into a tuple of containers. Read more
    source§

    fn try_len(&self) -> Result<usize, (usize, Option<usize>)>

    Returns the length of the iterator if one exists. +determining identity using a keying function. Read more
    source§

    fn multiunzip<FromI>(self) -> FromI
    where + Self: Sized + MultiUnzip<FromI>,

    Converts an iterator of tuples into a tuple of containers. Read more
    source§

    fn try_len(&self) -> Result<usize, (usize, Option<usize>)>

    Returns the length of the iterator if one exists. Otherwise return self.size_hint(). Read more
    source§

    impl<T> 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 + 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/itertools/structs/struct.PadUsing.html b/itertools/structs/struct.PadUsing.html index 252c072ac..02ba88a55 100644 --- a/itertools/structs/struct.PadUsing.html +++ b/itertools/structs/struct.PadUsing.html @@ -1,4 +1,4 @@ -PadUsing in itertools::structs - Rust
    +PadUsing in itertools::structs - Rust

    Struct itertools::structs::PadUsing

    source · 
    pub struct PadUsing<I, F> { /* private fields */ }
    Expand description

    An iterator adaptor that pads a sequence to a minimum length by filling missing elements using a closure.

    Iterator element type is I::Item.

    @@ -224,86 +224,87 @@ otherwise. Right variant of Either<Self, Self> otherwise. Read more
    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> Itertools for T
    where - T: Iterator + ?Sized,

    source§

    fn interleave<J>(self, other: J) -> Interleave<Self, J::IntoIter> ⓘ
    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> Itertools for T
    where + T: Iterator + ?Sized,

    source§

    fn interleave<J>(self, other: J) -> Interleave<Self, J::IntoIter> ⓘ
    where J: IntoIterator<Item = Self::Item>, - Self: Sized,

    Alternate elements from two iterators until both have run out. Read more
    source§

    fn interleave_shortest<J>( + Self: Sized,

    Alternate elements from two iterators until both have run out. Read more
    source§

    fn interleave_shortest<J>( self, other: J ) -> InterleaveShortest<Self, J::IntoIter> ⓘ
    where J: IntoIterator<Item = Self::Item>, Self: Sized,

    Alternate elements from two iterators until at least one of them has run -out. Read more
    source§

    fn intersperse(self, element: Self::Item) -> Intersperse<Self>
    where +out. Read more

    source§

    fn intersperse(self, element: Self::Item) -> Intersperse<Self>
    where Self: Sized, Self::Item: Clone,

    An iterator adaptor to insert a particular value -between each element of the adapted iterator. Read more
    source§

    fn intersperse_with<F>(self, element: F) -> IntersperseWith<Self, F> ⓘ
    where +between each element of the adapted iterator. Read more

    source§

    fn intersperse_with<F>(self, element: F) -> IntersperseWith<Self, F> ⓘ
    where Self: Sized, F: FnMut() -> Self::Item,

    An iterator adaptor to insert a particular value created by a function -between each element of the adapted iterator. Read more
    source§

    fn zip_longest<J>(self, other: J) -> ZipLongest<Self, J::IntoIter> ⓘ
    where +between each element of the adapted iterator. Read more

    source§

    fn get<R>(self, index: R) -> R::Output
    where + Self: Sized, + R: IteratorIndex<Self>,

    Returns an iterator over a subsection of the iterator. Read more
    source§

    fn zip_longest<J>(self, other: J) -> ZipLongest<Self, J::IntoIter> ⓘ
    where J: IntoIterator, Self: Sized,

    Create an iterator which iterates over both this and the specified -iterator simultaneously, yielding pairs of two optional elements. Read more
    source§

    fn zip_eq<J>(self, other: J) -> ZipEq<Self, J::IntoIter> ⓘ
    where +iterator simultaneously, yielding pairs of two optional elements. Read more

    source§

    fn zip_eq<J>(self, other: J) -> ZipEq<Self, J::IntoIter> ⓘ
    where J: IntoIterator, Self: Sized,

    Create an iterator which iterates over both this and the specified -iterator simultaneously, yielding pairs of elements. Read more
    source§

    fn batching<B, F>(self, f: F) -> Batching<Self, F> ⓘ
    where +iterator simultaneously, yielding pairs of elements. Read more

    source§

    fn batching<B, F>(self, f: F) -> Batching<Self, F> ⓘ
    where F: FnMut(&mut Self) -> Option<B>, Self: Sized,

    A “meta iterator adaptor”. Its closure receives a reference to the iterator and may pick off as many elements as it likes, to produce the -next iterator element. Read more
    source§

    fn group_by<K, F>(self, key: F) -> GroupBy<K, Self, F>
    where +next iterator element. Read more

    source§

    fn chunk_by<K, F>(self, key: F) -> ChunkBy<K, Self, F>
    where Self: Sized, F: FnMut(&Self::Item) -> K, K: PartialEq,

    Return an iterable that can group iterator elements. Consecutive elements that map to the same key (“runs”), are assigned -to the same group. Read more
    source§

    fn chunks(self, size: usize) -> IntoChunks<Self>
    where - Self: Sized,

    Return an iterable that can chunk the iterator. Read more
    source§

    fn tuple_windows<T>(self) -> TupleWindows<Self, T> ⓘ
    where +to the same group. Read more

    source§

    fn group_by<K, F>(self, key: F) -> ChunkBy<K, Self, F>
    where + Self: Sized, + F: FnMut(&Self::Item) -> K, + K: PartialEq,

    👎Deprecated since 0.13.0: Use .chunk_by() instead
    See .chunk_by().
    source§

    fn chunks(self, size: usize) -> IntoChunks<Self>
    where + Self: Sized,

    Return an iterable that can chunk the iterator. Read more
    source§

    fn tuple_windows<T>(self) -> TupleWindows<Self, T> ⓘ
    where Self: Sized + Iterator<Item = T::Item>, T: HomogeneousTuple, T::Item: Clone,

    Return an iterator over all contiguous windows producing tuples of -a specific size (up to 12). Read more
    source§

    fn circular_tuple_windows<T>(self) -> CircularTupleWindows<Self, T> ⓘ
    where +a specific size (up to 12). Read more

    source§

    fn circular_tuple_windows<T>(self) -> CircularTupleWindows<Self, T> ⓘ
    where Self: Sized + Clone + Iterator<Item = T::Item> + ExactSizeIterator, T: TupleCollect + Clone, T::Item: Clone,

    Return an iterator over all windows, wrapping back to the first elements when the window would otherwise exceed the length of the -iterator, producing tuples of a specific size (up to 12). Read more
    source§

    fn tuples<T>(self) -> Tuples<Self, T> ⓘ
    where +iterator, producing tuples of a specific size (up to 12). Read more

    source§

    fn tuples<T>(self) -> Tuples<Self, T> ⓘ
    where Self: Sized + Iterator<Item = T::Item>, T: HomogeneousTuple,

    Return an iterator that groups the items in tuples of a specific size -(up to 12). Read more
    source§

    fn tee(self) -> (Tee<Self>, Tee<Self>)
    where +(up to 12). Read more

    source§

    fn tee(self) -> (Tee<Self>, Tee<Self>)
    where Self: Sized, Self::Item: Clone,

    Split into an iterator pair that both yield all elements from -the original iterator. Read more
    source§

    fn step(self, n: usize) -> Step<Self> ⓘ
    where - Self: Sized,

    👎Deprecated since 0.8.0: Use std .step_by() instead
    Return an iterator adaptor that steps n elements in the base iterator -for each iteration. Read more
    source§

    fn map_into<R>(self) -> MapInto<Self, R>
    where +the original iterator. Read more

    source§

    fn map_into<R>(self) -> MapInto<Self, R>
    where Self: Sized, - Self::Item: Into<R>,

    Convert each item of the iterator using the Into trait. Read more
    source§

    fn map_results<F, T, U, E>(self, f: F) -> MapOk<Self, F>
    where - Self: Iterator<Item = Result<T, E>> + Sized, - F: FnMut(T) -> U,

    👎Deprecated since 0.10.0: Use .map_ok() instead
    See .map_ok().
    source§

    fn map_ok<F, T, U, E>(self, f: F) -> MapOk<Self, F>
    where + Self::Item: Into<R>,

    Convert each item of the iterator using the Into trait. Read more
    source§

    fn map_ok<F, T, U, E>(self, f: F) -> MapOk<Self, F>
    where Self: Iterator<Item = Result<T, E>> + Sized, F: FnMut(T) -> U,

    Return an iterator adaptor that applies the provided closure to every Result::Ok value. Result::Err values are -unchanged. Read more
    source§

    fn filter_ok<F, T, E>(self, f: F) -> FilterOk<Self, F> ⓘ
    where +unchanged. Read more

    source§

    fn filter_ok<F, T, E>(self, f: F) -> FilterOk<Self, F> ⓘ
    where Self: Iterator<Item = Result<T, E>> + Sized, F: FnMut(&T) -> bool,

    Return an iterator adaptor that filters every Result::Ok value with the provided closure. Result::Err values are -unchanged. Read more
    source§

    fn filter_map_ok<F, T, U, E>(self, f: F) -> FilterMapOk<Self, F> ⓘ
    where +unchanged. Read more

    source§

    fn filter_map_ok<F, T, U, E>(self, f: F) -> FilterMapOk<Self, F> ⓘ
    where Self: Iterator<Item = Result<T, E>> + Sized, F: FnMut(T) -> Option<U>,

    Return an iterator adaptor that filters and transforms every Result::Ok value with the provided closure. Result::Err -values are unchanged. Read more
    source§

    fn flatten_ok<T, E>(self) -> FlattenOk<Self, T, E> ⓘ
    where +values are unchanged. Read more

    source§

    fn flatten_ok<T, E>(self) -> FlattenOk<Self, T, E> ⓘ
    where Self: Iterator<Item = Result<T, E>> + Sized, T: IntoIterator,

    Return an iterator adaptor that flattens every Result::Ok value into -a series of Result::Ok values. Result::Err values are unchanged. Read more
    source§

    fn process_results<F, T, E, R>(self, processor: F) -> Result<R, E>
    where +a series of Result::Ok values. Result::Err values are unchanged. Read more

    source§

    fn process_results<F, T, E, R>(self, processor: F) -> Result<R, E>
    where Self: Iterator<Item = Result<T, E>> + Sized, F: FnOnce(ProcessResults<'_, Self, E>) -> R,

    “Lift” a function of the values of the current iterator so as to process -an iterator of Result values instead. Read more
    source§

    fn merge<J>(self, other: J) -> Merge<Self, J::IntoIter>
    where +an iterator of Result values instead. Read more

    source§

    fn merge<J>(self, other: J) -> Merge<Self, J::IntoIter>
    where Self: Sized, Self::Item: PartialOrd, J: IntoIterator<Item = Self::Item>,

    Return an iterator adaptor that merges the two base iterators in ascending order. If both base iterators are sorted (ascending), the -result is sorted. Read more
    source§

    fn merge_by<J, F>(self, other: J, is_first: F) -> MergeBy<Self, J::IntoIter, F> ⓘ
    where +result is sorted. Read more

    source§

    fn merge_by<J, F>(self, other: J, is_first: F) -> MergeBy<Self, J::IntoIter, F> ⓘ
    where Self: Sized, J: IntoIterator<Item = Self::Item>, F: FnMut(&Self::Item, &Self::Item) -> bool,

    Return an iterator adaptor that merges the two base iterators in order. -This is much like .merge() but allows for a custom ordering. Read more
    source§

    fn merge_join_by<J, F, T>( +This is much like .merge() but allows for a custom ordering. Read more

    source§

    fn merge_join_by<J, F, T>( self, other: J, cmp_fn: F @@ -311,284 +312,295 @@ This is much like IntoIterator, F: FnMut(&Self::Item, &J::Item) -> T, Self: Sized,

    Create an iterator that merges items from both this and the specified -iterator in ascending order. Read more
    source§

    fn kmerge(self) -> KMerge<<Self::Item as IntoIterator>::IntoIter>
    where +iterator in ascending order. Read more

    source§

    fn kmerge(self) -> KMerge<<Self::Item as IntoIterator>::IntoIter>
    where Self: Sized, Self::Item: IntoIterator, <Self::Item as IntoIterator>::Item: PartialOrd,

    Return an iterator adaptor that flattens an iterator of iterators by -merging them in ascending order. Read more
    source§

    fn kmerge_by<F>( +merging them in ascending order. Read more

    source§

    fn kmerge_by<F>( self, first: F ) -> KMergeBy<<Self::Item as IntoIterator>::IntoIter, F> ⓘ
    where Self: Sized, Self::Item: IntoIterator, F: FnMut(&<Self::Item as IntoIterator>::Item, &<Self::Item as IntoIterator>::Item) -> bool,

    Return an iterator adaptor that flattens an iterator of iterators by -merging them according to the given closure. Read more
    source§

    fn cartesian_product<J>(self, other: J) -> Product<Self, J::IntoIter> ⓘ
    where +merging them according to the given closure. Read more

    source§

    fn cartesian_product<J>(self, other: J) -> Product<Self, J::IntoIter> ⓘ
    where Self: Sized, Self::Item: Clone, J: IntoIterator, J::IntoIter: Clone,

    Return an iterator adaptor that iterates over the cartesian product of -the element sets of two iterators self and J. Read more
    source§

    fn multi_cartesian_product( +the element sets of two iterators self and J. Read more

    source§

    fn multi_cartesian_product( self ) -> MultiProduct<<Self::Item as IntoIterator>::IntoIter> ⓘ
    where Self: Sized, Self::Item: IntoIterator, <Self::Item as IntoIterator>::IntoIter: Clone, <Self::Item as IntoIterator>::Item: Clone,

    Return an iterator adaptor that iterates over the cartesian product of -all subiterators returned by meta-iterator self. Read more
    source§

    fn coalesce<F>(self, f: F) -> Coalesce<Self, F>
    where +all subiterators returned by meta-iterator self. Read more

    source§

    fn coalesce<F>(self, f: F) -> Coalesce<Self, F>
    where Self: Sized, F: FnMut(Self::Item, Self::Item) -> Result<Self::Item, (Self::Item, Self::Item)>,

    Return an iterator adaptor that uses the passed-in closure to -optionally merge together consecutive elements. Read more
    source§

    fn dedup(self) -> Dedup<Self>
    where +optionally merge together consecutive elements. Read more

    source§

    fn dedup(self) -> Dedup<Self>
    where Self: Sized, Self::Item: PartialEq,

    Remove duplicates from sections of consecutive identical elements. -If the iterator is sorted, all elements will be unique. Read more
    source§

    fn dedup_by<Cmp>(self, cmp: Cmp) -> DedupBy<Self, Cmp>
    where +If the iterator is sorted, all elements will be unique. Read more

    source§

    fn dedup_by<Cmp>(self, cmp: Cmp) -> DedupBy<Self, Cmp>
    where Self: Sized, Cmp: FnMut(&Self::Item, &Self::Item) -> bool,

    Remove duplicates from sections of consecutive identical elements, determining equality using a comparison function. -If the iterator is sorted, all elements will be unique. Read more
    source§

    fn dedup_with_count(self) -> DedupWithCount<Self>
    where +If the iterator is sorted, all elements will be unique. Read more

    source§

    fn dedup_with_count(self) -> DedupWithCount<Self>
    where Self: Sized,

    Remove duplicates from sections of consecutive identical elements, while keeping a count of how many repeated elements were present. -If the iterator is sorted, all elements will be unique. Read more
    source§

    fn dedup_by_with_count<Cmp>(self, cmp: Cmp) -> DedupByWithCount<Self, Cmp>
    where +If the iterator is sorted, all elements will be unique. Read more

    source§

    fn dedup_by_with_count<Cmp>(self, cmp: Cmp) -> DedupByWithCount<Self, Cmp>
    where Self: Sized, Cmp: FnMut(&Self::Item, &Self::Item) -> bool,

    Remove duplicates from sections of consecutive identical elements, while keeping a count of how many repeated elements were present. This will determine equality using a comparison function. -If the iterator is sorted, all elements will be unique. Read more
    source§

    fn duplicates(self) -> Duplicates<Self>
    where +If the iterator is sorted, all elements will be unique. Read more

    source§

    fn duplicates(self) -> Duplicates<Self>
    where Self: Sized, Self::Item: Eq + Hash,

    Return an iterator adaptor that produces elements that appear more than once during the -iteration. Duplicates are detected using hash and equality. Read more
    source§

    fn duplicates_by<V, F>(self, f: F) -> DuplicatesBy<Self, V, F>
    where +iteration. Duplicates are detected using hash and equality. Read more

    source§

    fn duplicates_by<V, F>(self, f: F) -> DuplicatesBy<Self, V, F>
    where Self: Sized, V: Eq + Hash, F: FnMut(&Self::Item) -> V,

    Return an iterator adaptor that produces elements that appear more than once during the -iteration. Duplicates are detected using hash and equality. Read more
    source§

    fn unique(self) -> Unique<Self> ⓘ
    where +iteration. Duplicates are detected using hash and equality. Read more

    source§

    fn unique(self) -> Unique<Self> ⓘ
    where Self: Sized, Self::Item: Clone + Eq + Hash,

    Return an iterator adaptor that filters out elements that have already been produced once during the iteration. Duplicates -are detected using hash and equality. Read more
    source§

    fn unique_by<V, F>(self, f: F) -> UniqueBy<Self, V, F> ⓘ
    where +are detected using hash and equality. Read more

    source§

    fn unique_by<V, F>(self, f: F) -> UniqueBy<Self, V, F> ⓘ
    where Self: Sized, V: Eq + Hash, F: FnMut(&Self::Item) -> V,

    Return an iterator adaptor that filters out elements that have -already been produced once during the iteration. Read more
    source§

    fn peeking_take_while<F>(&mut self, accept: F) -> PeekingTakeWhile<'_, Self, F> ⓘ
    where +already been produced once during the iteration. Read more

    source§

    fn peeking_take_while<F>(&mut self, accept: F) -> PeekingTakeWhile<'_, Self, F> ⓘ
    where Self: Sized + PeekingNext, F: FnMut(&Self::Item) -> bool,

    Return an iterator adaptor that borrows from this iterator and -takes items while the closure accept returns true. Read more
    source§

    fn take_while_ref<F>(&mut self, accept: F) -> TakeWhileRef<'_, Self, F> ⓘ
    where +takes items while the closure accept returns true. Read more

    source§

    fn take_while_ref<F>(&mut self, accept: F) -> TakeWhileRef<'_, Self, F> ⓘ
    where Self: Clone, F: FnMut(&Self::Item) -> bool,

    Return an iterator adaptor that borrows from a Clone-able iterator -to only pick off elements while the predicate accept returns true. Read more
    source§

    fn take_while_inclusive<F>(self, accept: F) -> TakeWhileInclusive<Self, F> ⓘ
    where +to only pick off elements while the predicate accept returns true. Read more

    source§

    fn take_while_inclusive<F>(self, accept: F) -> TakeWhileInclusive<Self, F> ⓘ
    where Self: Sized, F: FnMut(&Self::Item) -> bool,

    Returns an iterator adaptor that consumes elements while the given predicate is true, including the element for which the predicate -first returned false. Read more
    source§

    fn while_some<A>(self) -> WhileSome<Self> ⓘ
    where +first returned false. Read more

    source§

    fn while_some<A>(self) -> WhileSome<Self> ⓘ
    where Self: Sized + Iterator<Item = Option<A>>,

    Return an iterator adaptor that filters Option<A> iterator elements -and produces A. Stops on the first None encountered. Read more
    source§

    fn tuple_combinations<T>(self) -> TupleCombinations<Self, T> ⓘ
    where +and produces A. Stops on the first None encountered. Read more

    source§

    fn tuple_combinations<T>(self) -> TupleCombinations<Self, T> ⓘ
    where Self: Sized + Clone, Self::Item: Clone, T: HasCombination<Self>,

    Return an iterator adaptor that iterates over the combinations of the -elements from an iterator. Read more
    source§

    fn combinations(self, k: usize) -> Combinations<Self> ⓘ
    where +elements from an iterator. Read more

    source§

    fn combinations(self, k: usize) -> Combinations<Self> ⓘ
    where Self: Sized, Self::Item: Clone,

    Return an iterator adaptor that iterates over the k-length combinations of -the elements from an iterator. Read more
    source§

    fn combinations_with_replacement( +the elements from an iterator. Read more

    source§

    fn combinations_with_replacement( self, k: usize ) -> CombinationsWithReplacement<Self> ⓘ
    where Self: Sized, Self::Item: Clone,

    Return an iterator that iterates over the k-length combinations of -the elements from an iterator, with replacement. Read more
    source§

    fn permutations(self, k: usize) -> Permutations<Self> ⓘ
    where +the elements from an iterator, with replacement. Read more

    source§

    fn permutations(self, k: usize) -> Permutations<Self> ⓘ
    where Self: Sized, Self::Item: Clone,

    Return an iterator adaptor that iterates over all k-permutations of the -elements from an iterator. Read more
    source§

    fn powerset(self) -> Powerset<Self> ⓘ
    where +elements from an iterator. Read more

    source§

    fn powerset(self) -> Powerset<Self> ⓘ
    where Self: Sized, Self::Item: Clone,

    Return an iterator that iterates through the powerset of the elements from an -iterator. Read more
    source§

    fn pad_using<F>(self, min: usize, f: F) -> PadUsing<Self, F> ⓘ
    where +iterator. Read more

    source§

    fn pad_using<F>(self, min: usize, f: F) -> PadUsing<Self, F> ⓘ
    where Self: Sized, F: FnMut(usize) -> Self::Item,

    Return an iterator adaptor that pads the sequence to a minimum length of -min by filling missing elements using a closure f. Read more
    source§

    fn with_position(self) -> WithPosition<Self> ⓘ
    where +min by filling missing elements using a closure f. Read more

    source§

    fn with_position(self) -> WithPosition<Self> ⓘ
    where Self: Sized,

    Return an iterator adaptor that combines each element with a Position to -ease special-case handling of the first or last elements. Read more
    source§

    fn positions<P>(self, predicate: P) -> Positions<Self, P> ⓘ
    where +ease special-case handling of the first or last elements. Read more

    source§

    fn positions<P>(self, predicate: P) -> Positions<Self, P> ⓘ
    where Self: Sized, P: FnMut(Self::Item) -> bool,

    Return an iterator adaptor that yields the indices of all elements -satisfying a predicate, counted from the start of the iterator. Read more
    source§

    fn update<F>(self, updater: F) -> Update<Self, F> ⓘ
    where +satisfying a predicate, counted from the start of the iterator. Read more

    source§

    fn update<F>(self, updater: F) -> Update<Self, F> ⓘ
    where Self: Sized, F: FnMut(&mut Self::Item),

    Return an iterator adaptor that applies a mutating function -to each element before yielding it. Read more
    source§

    fn next_tuple<T>(&mut self) -> Option<T>
    where +to each element before yielding it. Read more

    source§

    fn next_tuple<T>(&mut self) -> Option<T>
    where Self: Sized + Iterator<Item = T::Item>, T: HomogeneousTuple,

    Advances the iterator and returns the next items grouped in a tuple of -a specific size (up to 12). Read more
    source§

    fn collect_tuple<T>(self) -> Option<T>
    where +a specific size (up to 12). Read more

    source§

    fn collect_tuple<T>(self) -> Option<T>
    where Self: Sized + Iterator<Item = T::Item>, T: HomogeneousTuple,

    Collects all items from the iterator into a tuple of a specific size -(up to 12). Read more
    source§

    fn find_position<P>(&mut self, pred: P) -> Option<(usize, Self::Item)>
    where - P: FnMut(&Self::Item) -> bool,

    Find the position and value of the first element satisfying a predicate. Read more
    source§

    fn find_or_last<P>(self, predicate: P) -> Option<Self::Item>
    where +(up to 12). Read more

    source§

    fn find_position<P>(&mut self, pred: P) -> Option<(usize, Self::Item)>
    where + P: FnMut(&Self::Item) -> bool,

    Find the position and value of the first element satisfying a predicate. Read more
    source§

    fn find_or_last<P>(self, predicate: P) -> Option<Self::Item>
    where Self: Sized, - P: FnMut(&Self::Item) -> bool,

    Find the value of the first element satisfying a predicate or return the last element, if any. Read more
    source§

    fn find_or_first<P>(self, predicate: P) -> Option<Self::Item>
    where + P: FnMut(&Self::Item) -> bool,

    Find the value of the first element satisfying a predicate or return the last element, if any. Read more
    source§

    fn find_or_first<P>(self, predicate: P) -> Option<Self::Item>
    where Self: Sized, - P: FnMut(&Self::Item) -> bool,

    Find the value of the first element satisfying a predicate or return the first element, if any. Read more
    source§

    fn contains<Q>(&mut self, query: &Q) -> bool
    where + P: FnMut(&Self::Item) -> bool,

    Find the value of the first element satisfying a predicate or return the first element, if any. Read more
    source§

    fn contains<Q>(&mut self, query: &Q) -> bool
    where Self: Sized, Self::Item: Borrow<Q>, - Q: PartialEq,

    Returns true if the given item is present in this iterator. Read more
    source§

    fn all_equal(&mut self) -> bool
    where + Q: PartialEq,

    Returns true if the given item is present in this iterator. Read more
    source§

    fn all_equal(&mut self) -> bool
    where Self: Sized, - Self::Item: PartialEq,

    Check whether all elements compare equal. Read more
    source§

    fn all_equal_value( + Self::Item: PartialEq,

    Check whether all elements compare equal. Read more
    source§

    fn all_equal_value( &mut self ) -> Result<Self::Item, Option<(Self::Item, Self::Item)>>
    where Self: Sized, Self::Item: PartialEq,

    If there are elements and they are all equal, return a single copy of that element. If there are no elements, return an Error containing None. If there are elements and they are not all equal, return a tuple containing the first -two non-equal elements found. Read more
    source§

    fn all_unique(&mut self) -> bool
    where +two non-equal elements found. Read more

    source§

    fn all_unique(&mut self) -> bool
    where Self: Sized, - Self::Item: Eq + Hash,

    Check whether all elements are unique (non equal). Read more
    source§

    fn dropping(self, n: usize) -> Self
    where + Self::Item: Eq + Hash,

    Check whether all elements are unique (non equal). Read more
    source§

    fn dropping(self, n: usize) -> Self
    where Self: Sized,

    Consume the first n elements from the iterator eagerly, -and return the same iterator again. Read more
    source§

    fn dropping_back(self, n: usize) -> Self
    where +and return the same iterator again. Read more

    source§

    fn dropping_back(self, n: usize) -> Self
    where Self: Sized + DoubleEndedIterator,

    Consume the last n elements from the iterator eagerly, -and return the same iterator again. Read more
    source§

    fn foreach<F>(self, f: F)
    where - F: FnMut(Self::Item), - Self: Sized,

    👎Deprecated since 0.8.0: Use .for_each() instead
    Run the closure f eagerly on each element of the iterator. Read more
    source§

    fn concat(self) -> Self::Item
    where +and return the same iterator again. Read more

    source§

    fn concat(self) -> Self::Item
    where Self: Sized, - Self::Item: Extend<<<Self as Iterator>::Item as IntoIterator>::Item> + IntoIterator + Default,

    Combine all an iterator’s elements into one element by using Extend. Read more
    source§

    fn collect_vec(self) -> Vec<Self::Item>
    where + Self::Item: Extend<<<Self as Iterator>::Item as IntoIterator>::Item> + IntoIterator + Default,

    Combine all an iterator’s elements into one element by using Extend. Read more
    source§

    fn collect_vec(self) -> Vec<Self::Item>
    where Self: Sized,

    .collect_vec() is simply a type specialization of Iterator::collect, -for convenience.
    source§

    fn try_collect<T, U, E>(self) -> Result<U, E>
    where +for convenience.

    source§

    fn try_collect<T, U, E>(self) -> Result<U, E>
    where Self: Sized + Iterator<Item = Result<T, E>>, Result<U, E>: FromIterator<Result<T, E>>,

    .try_collect() is more convenient way of writing -.collect::<Result<_, _>>() Read more
    source§

    fn set_from<'a, A: 'a, J>(&mut self, from: J) -> usize
    where +.collect::<Result<_, _>>() Read more

    source§

    fn set_from<'a, A: 'a, J>(&mut self, from: J) -> usize
    where Self: Iterator<Item = &'a mut A>, J: IntoIterator<Item = A>,

    Assign to each reference in self from the from iterator, -stopping at the shortest of the two iterators. Read more
    source§

    fn join(&mut self, sep: &str) -> String
    where - Self::Item: Display,

    Combine all iterator elements into one String, separated by sep. Read more
    source§

    fn format(self, sep: &str) -> Format<'_, Self>
    where - Self: Sized,

    Format all iterator elements, separated by sep. Read more
    source§

    fn format_with<F>(self, sep: &str, format: F) -> FormatWith<'_, Self, F>
    where +stopping at the shortest of the two iterators. Read more

    source§

    fn join(&mut self, sep: &str) -> String
    where + Self::Item: Display,

    Combine all iterator elements into one String, separated by sep. Read more
    source§

    fn format(self, sep: &str) -> Format<'_, Self>
    where + Self: Sized,

    Format all iterator elements, separated by sep. Read more
    source§

    fn format_with<F>(self, sep: &str, format: F) -> FormatWith<'_, Self, F>
    where Self: Sized, - F: FnMut(Self::Item, &mut dyn FnMut(&dyn Display) -> Result) -> Result,

    Format all iterator elements, separated by sep. Read more
    source§

    fn fold_results<A, E, B, F>(&mut self, start: B, f: F) -> Result<B, E>
    where + F: FnMut(Self::Item, &mut dyn FnMut(&dyn Display) -> Result) -> Result,

    Format all iterator elements, separated by sep. Read more
    source§

    fn fold_ok<A, E, B, F>(&mut self, start: B, f: F) -> Result<B, E>
    where Self: Iterator<Item = Result<A, E>>, - F: FnMut(B, A) -> B,

    👎Deprecated since 0.10.0: Use .fold_ok() instead
    See .fold_ok().
    source§

    fn fold_ok<A, E, B, F>(&mut self, start: B, f: F) -> Result<B, E>
    where - Self: Iterator<Item = Result<A, E>>, - F: FnMut(B, A) -> B,

    Fold Result values from an iterator. Read more
    source§

    fn fold_options<A, B, F>(&mut self, start: B, f: F) -> Option<B>
    where + F: FnMut(B, A) -> B,

    Fold Result values from an iterator. Read more
    source§

    fn fold_options<A, B, F>(&mut self, start: B, f: F) -> Option<B>
    where Self: Iterator<Item = Option<A>>, - F: FnMut(B, A) -> B,

    Fold Option values from an iterator. Read more
    source§

    fn fold1<F>(self, f: F) -> Option<Self::Item>
    where + F: FnMut(B, A) -> B,

    Fold Option values from an iterator. Read more
    source§

    fn fold1<F>(self, f: F) -> Option<Self::Item>
    where F: FnMut(Self::Item, Self::Item) -> Self::Item, - Self: Sized,

    👎Deprecated since 0.10.2: Use Iterator::reduce instead
    Accumulator of the elements in the iterator. Read more
    source§

    fn tree_fold1<F>(self, f: F) -> Option<Self::Item>
    where + Self: Sized,

    👎Deprecated since 0.10.2: Use Iterator::reduce instead
    Accumulator of the elements in the iterator. Read more
    source§

    fn tree_reduce<F>(self, f: F) -> Option<Self::Item>
    where F: FnMut(Self::Item, Self::Item) -> Self::Item, - Self: Sized,

    Accumulate the elements in the iterator in a tree-like manner. Read more
    source§

    fn fold_while<B, F>(&mut self, init: B, f: F) -> FoldWhile<B>
    where + Self: Sized,

    Accumulate the elements in the iterator in a tree-like manner. Read more
    source§

    fn tree_fold1<F>(self, f: F) -> Option<Self::Item>
    where + F: FnMut(Self::Item, Self::Item) -> Self::Item, + Self: Sized,

    👎Deprecated since 0.13.0: Use .tree_reduce() instead
    See .tree_reduce().
    source§

    fn fold_while<B, F>(&mut self, init: B, f: F) -> FoldWhile<B>
    where Self: Sized, - F: FnMut(B, Self::Item) -> FoldWhile<B>,

    An iterator method that applies a function, producing a single, final value. Read more
    source§

    fn sum1<S>(self) -> Option<S>
    where + F: FnMut(B, Self::Item) -> FoldWhile<B>,

    An iterator method that applies a function, producing a single, final value. Read more
    source§

    fn sum1<S>(self) -> Option<S>
    where Self: Sized, - S: Sum<Self::Item>,

    Iterate over the entire iterator and add all the elements. Read more
    source§

    fn product1<P>(self) -> Option<P>
    where + S: Sum<Self::Item>,

    Iterate over the entire iterator and add all the elements. Read more
    source§

    fn product1<P>(self) -> Option<P>
    where Self: Sized, - P: Product<Self::Item>,

    Iterate over the entire iterator and multiply all the elements. Read more
    source§

    fn sorted_unstable(self) -> IntoIter<Self::Item> ⓘ
    where + P: Product<Self::Item>,

    Iterate over the entire iterator and multiply all the elements. Read more
    source§

    fn sorted_unstable(self) -> IntoIter<Self::Item> ⓘ
    where Self: Sized, - Self::Item: Ord,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_unstable_by<F>(self, cmp: F) -> IntoIter<Self::Item> ⓘ
    where + Self::Item: Ord,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_unstable_by<F>(self, cmp: F) -> IntoIter<Self::Item> ⓘ
    where Self: Sized, - F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_unstable_by_key<K, F>(self, f: F) -> IntoIter<Self::Item> ⓘ
    where + F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_unstable_by_key<K, F>(self, f: F) -> IntoIter<Self::Item> ⓘ
    where Self: Sized, K: Ord, - F: FnMut(&Self::Item) -> K,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted(self) -> IntoIter<Self::Item> ⓘ
    where + F: FnMut(&Self::Item) -> K,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted(self) -> IntoIter<Self::Item> ⓘ
    where Self: Sized, - Self::Item: Ord,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_by<F>(self, cmp: F) -> IntoIter<Self::Item> ⓘ
    where + Self::Item: Ord,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_by<F>(self, cmp: F) -> IntoIter<Self::Item> ⓘ
    where Self: Sized, - F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_by_key<K, F>(self, f: F) -> IntoIter<Self::Item> ⓘ
    where + F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_by_key<K, F>(self, f: F) -> IntoIter<Self::Item> ⓘ
    where Self: Sized, K: Ord, - F: FnMut(&Self::Item) -> K,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_by_cached_key<K, F>(self, f: F) -> IntoIter<Self::Item> ⓘ
    where + F: FnMut(&Self::Item) -> K,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_by_cached_key<K, F>(self, f: F) -> IntoIter<Self::Item> ⓘ
    where Self: Sized, K: Ord, F: FnMut(&Self::Item) -> K,

    Sort all iterator elements into a new iterator in ascending order. The key function is -called exactly once per key. Read more
    source§

    fn k_smallest(self, k: usize) -> IntoIter<Self::Item> ⓘ
    where +called exactly once per key. Read more

    source§

    fn k_smallest(self, k: usize) -> IntoIter<Self::Item> ⓘ
    where Self: Sized, - Self::Item: Ord,

    Sort the k smallest elements into a new iterator, in ascending order. Read more
    source§

    fn partition_map<A, B, F, L, R>(self, predicate: F) -> (A, B)
    where + Self::Item: Ord,

    Sort the k smallest elements into a new iterator, in ascending order. Read more
    source§

    fn k_smallest_by<F>(self, k: usize, cmp: F) -> IntoIter<Self::Item> ⓘ
    where + Self: Sized, + F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Sort the k smallest elements into a new iterator using the provided comparison. Read more
    source§

    fn k_smallest_by_key<F, K>(self, k: usize, key: F) -> IntoIter<Self::Item> ⓘ
    where + Self: Sized, + F: FnMut(&Self::Item) -> K, + K: Ord,

    Return the elements producing the k smallest outputs of the provided function. Read more
    source§

    fn k_largest(self, k: usize) -> IntoIter<Self::Item> ⓘ
    where + Self: Sized, + Self::Item: Ord,

    Sort the k largest elements into a new iterator, in descending order. Read more
    source§

    fn k_largest_by<F>(self, k: usize, cmp: F) -> IntoIter<Self::Item> ⓘ
    where + Self: Sized, + F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Sort the k largest elements into a new iterator using the provided comparison. Read more
    source§

    fn k_largest_by_key<F, K>(self, k: usize, key: F) -> IntoIter<Self::Item> ⓘ
    where + Self: Sized, + F: FnMut(&Self::Item) -> K, + K: Ord,

    Return the elements producing the k largest outputs of the provided function. Read more
    source§

    fn tail(self, n: usize) -> IntoIter<Self::Item> ⓘ
    where + Self: Sized,

    Consumes the iterator and return an iterator of the last n elements. Read more
    source§

    fn partition_map<A, B, F, L, R>(self, predicate: F) -> (A, B)
    where Self: Sized, F: FnMut(Self::Item) -> Either<L, R>, A: Default + Extend<L>, B: Default + Extend<R>,

    Collect all iterator elements into one of two partitions. Unlike Iterator::partition, each partition may -have a distinct type. Read more
    source§

    fn partition_result<A, B, T, E>(self) -> (A, B)
    where +have a distinct type. Read more

    source§

    fn partition_result<A, B, T, E>(self) -> (A, B)
    where Self: Iterator<Item = Result<T, E>> + Sized, A: Default + Extend<T>, B: Default + Extend<E>,

    Partition a sequence of Results into one list of all the Ok elements -and another list of all the Err elements. Read more
    source§

    fn into_group_map<K, V>(self) -> HashMap<K, Vec<V>>
    where +and another list of all the Err elements. Read more

    source§

    fn into_group_map<K, V>(self) -> HashMap<K, Vec<V>>
    where Self: Iterator<Item = (K, V)> + Sized, K: Hash + Eq,

    Return a HashMap of keys mapped to Vecs of values. Keys and values -are taken from (Key, Value) tuple pairs yielded by the input iterator. Read more
    source§

    fn into_group_map_by<K, V, F>(self, f: F) -> HashMap<K, Vec<V>>
    where +are taken from (Key, Value) tuple pairs yielded by the input iterator. Read more

    source§

    fn into_group_map_by<K, V, F>(self, f: F) -> HashMap<K, Vec<V>>
    where Self: Iterator<Item = V> + Sized, K: Hash + Eq, - F: Fn(&V) -> K,

    Return an Iterator on a HashMap. Keys mapped to Vecs of values. The key is specified -in the closure. Read more
    source§

    fn into_grouping_map<K, V>(self) -> GroupingMap<Self>
    where + F: FnMut(&V) -> K,

    Return an Iterator on a HashMap. Keys mapped to Vecs of values. The key is specified +in the closure. Read more
    source§

    fn into_grouping_map<K, V>(self) -> GroupingMap<Self>
    where Self: Iterator<Item = (K, V)> + Sized, K: Hash + Eq,

    Constructs a GroupingMap to be used later with one of the efficient -group-and-fold operations it allows to perform. Read more
    source§

    fn into_grouping_map_by<K, V, F>(self, key_mapper: F) -> GroupingMapBy<Self, F>
    where +group-and-fold operations it allows to perform. Read more

    source§

    fn into_grouping_map_by<K, V, F>(self, key_mapper: F) -> GroupingMapBy<Self, F>
    where Self: Iterator<Item = V> + Sized, K: Hash + Eq, F: FnMut(&V) -> K,

    Constructs a GroupingMap to be used later with one of the efficient -group-and-fold operations it allows to perform. Read more
    source§

    fn min_set(self) -> Vec<Self::Item>
    where +group-and-fold operations it allows to perform. Read more

    source§

    fn min_set(self) -> Vec<Self::Item>
    where Self: Sized, - Self::Item: Ord,

    Return all minimum elements of an iterator. Read more
    source§

    fn min_set_by<F>(self, compare: F) -> Vec<Self::Item>
    where + Self::Item: Ord,

    Return all minimum elements of an iterator. Read more
    source§

    fn min_set_by<F>(self, compare: F) -> Vec<Self::Item>
    where Self: Sized, F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Return all minimum elements of an iterator, as determined by -the specified function. Read more
    source§

    fn min_set_by_key<K, F>(self, key: F) -> Vec<Self::Item>
    where +the specified function. Read more

    source§

    fn min_set_by_key<K, F>(self, key: F) -> Vec<Self::Item>
    where Self: Sized, K: Ord, F: FnMut(&Self::Item) -> K,

    Return all minimum elements of an iterator, as determined by -the specified function. Read more
    source§

    fn max_set(self) -> Vec<Self::Item>
    where +the specified function. Read more

    source§

    fn max_set(self) -> Vec<Self::Item>
    where Self: Sized, - Self::Item: Ord,

    Return all maximum elements of an iterator. Read more
    source§

    fn max_set_by<F>(self, compare: F) -> Vec<Self::Item>
    where + Self::Item: Ord,

    Return all maximum elements of an iterator. Read more
    source§

    fn max_set_by<F>(self, compare: F) -> Vec<Self::Item>
    where Self: Sized, F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Return all maximum elements of an iterator, as determined by -the specified function. Read more
    source§

    fn max_set_by_key<K, F>(self, key: F) -> Vec<Self::Item>
    where +the specified function. Read more

    source§

    fn max_set_by_key<K, F>(self, key: F) -> Vec<Self::Item>
    where Self: Sized, K: Ord, F: FnMut(&Self::Item) -> K,

    Return all maximum elements of an iterator, as determined by -the specified function. Read more
    source§

    fn minmax(self) -> MinMaxResult<Self::Item>
    where +the specified function. Read more

    source§

    fn minmax(self) -> MinMaxResult<Self::Item>
    where Self: Sized, - Self::Item: PartialOrd,

    Return the minimum and maximum elements in the iterator. Read more
    source§

    fn minmax_by_key<K, F>(self, key: F) -> MinMaxResult<Self::Item>
    where + Self::Item: PartialOrd,

    Return the minimum and maximum elements in the iterator. Read more
    source§

    fn minmax_by_key<K, F>(self, key: F) -> MinMaxResult<Self::Item>
    where Self: Sized, K: PartialOrd, F: FnMut(&Self::Item) -> K,

    Return the minimum and maximum element of an iterator, as determined by -the specified function. Read more
    source§

    fn minmax_by<F>(self, compare: F) -> MinMaxResult<Self::Item>
    where +the specified function. Read more

    source§

    fn minmax_by<F>(self, compare: F) -> MinMaxResult<Self::Item>
    where Self: Sized, F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Return the minimum and maximum element of an iterator, as determined by -the specified comparison function. Read more
    source§

    fn position_max(self) -> Option<usize>
    where +the specified comparison function. Read more

    source§

    fn position_max(self) -> Option<usize>
    where Self: Sized, - Self::Item: Ord,

    Return the position of the maximum element in the iterator. Read more
    source§

    fn position_max_by_key<K, F>(self, key: F) -> Option<usize>
    where + Self::Item: Ord,

    Return the position of the maximum element in the iterator. Read more
    source§

    fn position_max_by_key<K, F>(self, key: F) -> Option<usize>
    where Self: Sized, K: Ord, F: FnMut(&Self::Item) -> K,

    Return the position of the maximum element in the iterator, as -determined by the specified function. Read more
    source§

    fn position_max_by<F>(self, compare: F) -> Option<usize>
    where +determined by the specified function. Read more

    source§

    fn position_max_by<F>(self, compare: F) -> Option<usize>
    where Self: Sized, F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Return the position of the maximum element in the iterator, as -determined by the specified comparison function. Read more
    source§

    fn position_min(self) -> Option<usize>
    where +determined by the specified comparison function. Read more

    source§

    fn position_min(self) -> Option<usize>
    where Self: Sized, - Self::Item: Ord,

    Return the position of the minimum element in the iterator. Read more
    source§

    fn position_min_by_key<K, F>(self, key: F) -> Option<usize>
    where + Self::Item: Ord,

    Return the position of the minimum element in the iterator. Read more
    source§

    fn position_min_by_key<K, F>(self, key: F) -> Option<usize>
    where Self: Sized, K: Ord, F: FnMut(&Self::Item) -> K,

    Return the position of the minimum element in the iterator, as -determined by the specified function. Read more
    source§

    fn position_min_by<F>(self, compare: F) -> Option<usize>
    where +determined by the specified function. Read more

    source§

    fn position_min_by<F>(self, compare: F) -> Option<usize>
    where Self: Sized, F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Return the position of the minimum element in the iterator, as -determined by the specified comparison function. Read more
    source§

    fn position_minmax(self) -> MinMaxResult<usize>
    where +determined by the specified comparison function. Read more

    source§

    fn position_minmax(self) -> MinMaxResult<usize>
    where Self: Sized, Self::Item: PartialOrd,

    Return the positions of the minimum and maximum elements in -the iterator. Read more
    source§

    fn position_minmax_by_key<K, F>(self, key: F) -> MinMaxResult<usize>
    where +the iterator. Read more

    source§

    fn position_minmax_by_key<K, F>(self, key: F) -> MinMaxResult<usize>
    where Self: Sized, K: PartialOrd, F: FnMut(&Self::Item) -> K,

    Return the postions of the minimum and maximum elements of an -iterator, as determined by the specified function. Read more
    source§

    fn position_minmax_by<F>(self, compare: F) -> MinMaxResult<usize>
    where +iterator, as determined by the specified function. Read more

    source§

    fn position_minmax_by<F>(self, compare: F) -> MinMaxResult<usize>
    where Self: Sized, F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Return the postions of the minimum and maximum elements of an -iterator, as determined by the specified comparison function. Read more
    source§

    fn exactly_one(self) -> Result<Self::Item, ExactlyOneError<Self>>
    where +iterator, as determined by the specified comparison function. Read more

    source§

    fn exactly_one(self) -> Result<Self::Item, ExactlyOneError<Self>>
    where Self: Sized,

    If the iterator yields exactly one element, that element will be returned, otherwise an error will be returned containing an iterator that has the same output as the input -iterator. Read more
    source§

    fn at_most_one(self) -> Result<Option<Self::Item>, ExactlyOneError<Self>>
    where - Self: Sized,

    If the iterator yields no elements, Ok(None) will be returned. If the iterator yields +iterator. Read more
    source§

    fn at_most_one(self) -> Result<Option<Self::Item>, ExactlyOneError<Self>>
    where + Self: Sized,

    If the iterator yields no elements, Ok(None) will be returned. If the iterator yields exactly one element, that element will be returned, otherwise an error will be returned -containing an iterator that has the same output as the input iterator. Read more
    source§

    fn multipeek(self) -> MultiPeek<Self> ⓘ
    where +containing an iterator that has the same output as the input iterator. Read more

    source§

    fn multipeek(self) -> MultiPeek<Self> ⓘ
    where Self: Sized,

    An iterator adaptor that allows the user to peek at multiple .next() -values without advancing the base iterator. Read more
    source§

    fn counts(self) -> HashMap<Self::Item, usize>
    where +values without advancing the base iterator. Read more

    source§

    fn counts(self) -> HashMap<Self::Item, usize>
    where Self: Sized, Self::Item: Eq + Hash,

    Collect the items in this iterator and return a HashMap which contains each item that appears in the iterator and the number -of times it appears. Read more
    source§

    fn counts_by<K, F>(self, f: F) -> HashMap<K, usize>
    where +of times it appears. Read more

    source§

    fn counts_by<K, F>(self, f: F) -> HashMap<K, usize>
    where Self: Sized, K: Eq + Hash, F: FnMut(Self::Item) -> K,

    Collect the items in this iterator and return a HashMap which contains each item that appears in the iterator and the number of times it appears, -determining identity using a keying function. Read more
    source§

    fn multiunzip<FromI>(self) -> FromI
    where - Self: Sized + MultiUnzip<FromI>,

    Converts an iterator of tuples into a tuple of containers. Read more
    source§

    fn try_len(&self) -> Result<usize, (usize, Option<usize>)>

    Returns the length of the iterator if one exists. +determining identity using a keying function. Read more
    source§

    fn multiunzip<FromI>(self) -> FromI
    where + Self: Sized + MultiUnzip<FromI>,

    Converts an iterator of tuples into a tuple of containers. Read more
    source§

    fn try_len(&self) -> Result<usize, (usize, Option<usize>)>

    Returns the length of the iterator if one exists. Otherwise return self.size_hint(). Read more
    source§

    impl<IT> MultiUnzip<()> for IT
    where IT: Iterator<Item = ()>,

    source§

    fn multiunzip(self)

    Unzip this iterator into multiple collections.
    source§

    impl<IT, A, FromA> MultiUnzip<(FromA,)> for IT
    where IT: Iterator<Item = (A,)>, @@ -691,4 +703,4 @@ Otherwise return self.size_hint(). (FromA, FromB, FromC, FromD, FromE, FromF, FromG, FromH, FromI, FromJ, FromK, FromL)

    Unzip this iterator into multiple collections.
    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 + 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/itertools/structs/struct.PeekNth.html b/itertools/structs/struct.PeekNth.html index 7d4862be7..242be60db 100644 --- a/itertools/structs/struct.PeekNth.html +++ b/itertools/structs/struct.PeekNth.html @@ -1,9 +1,9 @@ -PeekNth in itertools::structs - Rust
    +PeekNth in itertools::structs - Rust

    Struct itertools::structs::PeekNth

    source · 
    pub struct PeekNth<I>
    where
     I: Iterator,
    { /* private fields */ }
    Expand description

    See peek_nth() for more information.

    Implementations§

    source§

    impl<I> PeekNth<I>
    where - I: Iterator,

    source

    pub fn peek(&mut self) -> Option<&I::Item>

    Works exactly like the peek method in std::iter::Peekable

    -
    source

    pub fn peek_mut(&mut self) -> Option<&mut I::Item>

    Works exactly like the peek_mut method in std::iter::Peekable

    + I: Iterator,
    source

    pub fn peek(&mut self) -> Option<&I::Item>

    Works exactly like the peek method in std::iter::Peekable.

    +
    source

    pub fn peek_mut(&mut self) -> Option<&mut I::Item>

    Works exactly like the peek_mut method in std::iter::Peekable.

    source

    pub fn peek_nth(&mut self, n: usize) -> Option<&I::Item>

    Returns a reference to the nth value without advancing the iterator.

    §Examples

    Basic usage:

    @@ -55,10 +55,10 @@
    source

    pub fn next_if( &mut self, func: impl FnOnce(&I::Item) -> bool -) -> Option<I::Item>

    Works exactly like the next_if method in std::iter::Peekable

    +) -> Option<I::Item>

    Works exactly like the next_if method in std::iter::Peekable.

    source

    pub fn next_if_eq<T>(&mut self, expected: &T) -> Option<I::Item>
    where T: ?Sized, - I::Item: PartialEq<T>,

    Works exactly like the next_if_eq method in std::iter::Peekable

    + I::Item: PartialEq<T>,

    Works exactly like the next_if_eq method in std::iter::Peekable.

    Trait Implementations§

    source§

    impl<I> Clone for PeekNth<I>
    where I: Iterator + Clone, I::Item: Clone,

    source§

    fn clone(&self) -> PeekNth<I> ⓘ

    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<I> Debug for PeekNth<I>
    where @@ -244,8 +244,8 @@ greater than or equal to those of another. Read more

    source§

    impl<I> PeekingNext for PeekNth<I>
    where I: Iterator,

    source§

    fn peeking_next<F>(&mut self, accept: F) -> Option<Self::Item>
    where F: FnOnce(&Self::Item) -> bool,

    Pass a reference to the next iterator element to the closure accept; -if accept returns true, return it as the next element, -else None.

    Auto Trait Implementations§

    §

    impl<I> Freeze for PeekNth<I>
    where +if accept returns true, return it as the next element, +else None.

    Auto Trait Implementations§

    §

    impl<I> Freeze for PeekNth<I>
    where I: Freeze,

    §

    impl<I> RefUnwindSafe for PeekNth<I>
    where I: RefUnwindSafe, <I as Iterator>::Item: RefUnwindSafe,

    §

    impl<I> Send for PeekNth<I>
    where @@ -272,86 +272,87 @@ otherwise. Right variant of Either<Self, Self> otherwise. Read more

    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> Itertools for T
    where - T: Iterator + ?Sized,

    source§

    fn interleave<J>(self, other: J) -> Interleave<Self, J::IntoIter> ⓘ
    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> Itertools for T
    where + T: Iterator + ?Sized,

    source§

    fn interleave<J>(self, other: J) -> Interleave<Self, J::IntoIter> ⓘ
    where J: IntoIterator<Item = Self::Item>, - Self: Sized,

    Alternate elements from two iterators until both have run out. Read more
    source§

    fn interleave_shortest<J>( + Self: Sized,

    Alternate elements from two iterators until both have run out. Read more
    source§

    fn interleave_shortest<J>( self, other: J ) -> InterleaveShortest<Self, J::IntoIter> ⓘ
    where J: IntoIterator<Item = Self::Item>, Self: Sized,

    Alternate elements from two iterators until at least one of them has run -out. Read more
    source§

    fn intersperse(self, element: Self::Item) -> Intersperse<Self>
    where +out. Read more

    source§

    fn intersperse(self, element: Self::Item) -> Intersperse<Self>
    where Self: Sized, Self::Item: Clone,

    An iterator adaptor to insert a particular value -between each element of the adapted iterator. Read more
    source§

    fn intersperse_with<F>(self, element: F) -> IntersperseWith<Self, F> ⓘ
    where +between each element of the adapted iterator. Read more

    source§

    fn intersperse_with<F>(self, element: F) -> IntersperseWith<Self, F> ⓘ
    where Self: Sized, F: FnMut() -> Self::Item,

    An iterator adaptor to insert a particular value created by a function -between each element of the adapted iterator. Read more
    source§

    fn zip_longest<J>(self, other: J) -> ZipLongest<Self, J::IntoIter> ⓘ
    where +between each element of the adapted iterator. Read more

    source§

    fn get<R>(self, index: R) -> R::Output
    where + Self: Sized, + R: IteratorIndex<Self>,

    Returns an iterator over a subsection of the iterator. Read more
    source§

    fn zip_longest<J>(self, other: J) -> ZipLongest<Self, J::IntoIter> ⓘ
    where J: IntoIterator, Self: Sized,

    Create an iterator which iterates over both this and the specified -iterator simultaneously, yielding pairs of two optional elements. Read more
    source§

    fn zip_eq<J>(self, other: J) -> ZipEq<Self, J::IntoIter> ⓘ
    where +iterator simultaneously, yielding pairs of two optional elements. Read more

    source§

    fn zip_eq<J>(self, other: J) -> ZipEq<Self, J::IntoIter> ⓘ
    where J: IntoIterator, Self: Sized,

    Create an iterator which iterates over both this and the specified -iterator simultaneously, yielding pairs of elements. Read more
    source§

    fn batching<B, F>(self, f: F) -> Batching<Self, F> ⓘ
    where +iterator simultaneously, yielding pairs of elements. Read more

    source§

    fn batching<B, F>(self, f: F) -> Batching<Self, F> ⓘ
    where F: FnMut(&mut Self) -> Option<B>, Self: Sized,

    A “meta iterator adaptor”. Its closure receives a reference to the iterator and may pick off as many elements as it likes, to produce the -next iterator element. Read more
    source§

    fn group_by<K, F>(self, key: F) -> GroupBy<K, Self, F>
    where +next iterator element. Read more

    source§

    fn chunk_by<K, F>(self, key: F) -> ChunkBy<K, Self, F>
    where Self: Sized, F: FnMut(&Self::Item) -> K, K: PartialEq,

    Return an iterable that can group iterator elements. Consecutive elements that map to the same key (“runs”), are assigned -to the same group. Read more
    source§

    fn chunks(self, size: usize) -> IntoChunks<Self>
    where - Self: Sized,

    Return an iterable that can chunk the iterator. Read more
    source§

    fn tuple_windows<T>(self) -> TupleWindows<Self, T> ⓘ
    where +to the same group. Read more

    source§

    fn group_by<K, F>(self, key: F) -> ChunkBy<K, Self, F>
    where + Self: Sized, + F: FnMut(&Self::Item) -> K, + K: PartialEq,

    👎Deprecated since 0.13.0: Use .chunk_by() instead
    See .chunk_by().
    source§

    fn chunks(self, size: usize) -> IntoChunks<Self>
    where + Self: Sized,

    Return an iterable that can chunk the iterator. Read more
    source§

    fn tuple_windows<T>(self) -> TupleWindows<Self, T> ⓘ
    where Self: Sized + Iterator<Item = T::Item>, T: HomogeneousTuple, T::Item: Clone,

    Return an iterator over all contiguous windows producing tuples of -a specific size (up to 12). Read more
    source§

    fn circular_tuple_windows<T>(self) -> CircularTupleWindows<Self, T> ⓘ
    where +a specific size (up to 12). Read more

    source§

    fn circular_tuple_windows<T>(self) -> CircularTupleWindows<Self, T> ⓘ
    where Self: Sized + Clone + Iterator<Item = T::Item> + ExactSizeIterator, T: TupleCollect + Clone, T::Item: Clone,

    Return an iterator over all windows, wrapping back to the first elements when the window would otherwise exceed the length of the -iterator, producing tuples of a specific size (up to 12). Read more
    source§

    fn tuples<T>(self) -> Tuples<Self, T> ⓘ
    where +iterator, producing tuples of a specific size (up to 12). Read more

    source§

    fn tuples<T>(self) -> Tuples<Self, T> ⓘ
    where Self: Sized + Iterator<Item = T::Item>, T: HomogeneousTuple,

    Return an iterator that groups the items in tuples of a specific size -(up to 12). Read more
    source§

    fn tee(self) -> (Tee<Self>, Tee<Self>)
    where +(up to 12). Read more

    source§

    fn tee(self) -> (Tee<Self>, Tee<Self>)
    where Self: Sized, Self::Item: Clone,

    Split into an iterator pair that both yield all elements from -the original iterator. Read more
    source§

    fn step(self, n: usize) -> Step<Self> ⓘ
    where - Self: Sized,

    👎Deprecated since 0.8.0: Use std .step_by() instead
    Return an iterator adaptor that steps n elements in the base iterator -for each iteration. Read more
    source§

    fn map_into<R>(self) -> MapInto<Self, R>
    where +the original iterator. Read more

    source§

    fn map_into<R>(self) -> MapInto<Self, R>
    where Self: Sized, - Self::Item: Into<R>,

    Convert each item of the iterator using the Into trait. Read more
    source§

    fn map_results<F, T, U, E>(self, f: F) -> MapOk<Self, F>
    where - Self: Iterator<Item = Result<T, E>> + Sized, - F: FnMut(T) -> U,

    👎Deprecated since 0.10.0: Use .map_ok() instead
    See .map_ok().
    source§

    fn map_ok<F, T, U, E>(self, f: F) -> MapOk<Self, F>
    where + Self::Item: Into<R>,

    Convert each item of the iterator using the Into trait. Read more
    source§

    fn map_ok<F, T, U, E>(self, f: F) -> MapOk<Self, F>
    where Self: Iterator<Item = Result<T, E>> + Sized, F: FnMut(T) -> U,

    Return an iterator adaptor that applies the provided closure to every Result::Ok value. Result::Err values are -unchanged. Read more
    source§

    fn filter_ok<F, T, E>(self, f: F) -> FilterOk<Self, F> ⓘ
    where +unchanged. Read more

    source§

    fn filter_ok<F, T, E>(self, f: F) -> FilterOk<Self, F> ⓘ
    where Self: Iterator<Item = Result<T, E>> + Sized, F: FnMut(&T) -> bool,

    Return an iterator adaptor that filters every Result::Ok value with the provided closure. Result::Err values are -unchanged. Read more
    source§

    fn filter_map_ok<F, T, U, E>(self, f: F) -> FilterMapOk<Self, F> ⓘ
    where +unchanged. Read more

    source§

    fn filter_map_ok<F, T, U, E>(self, f: F) -> FilterMapOk<Self, F> ⓘ
    where Self: Iterator<Item = Result<T, E>> + Sized, F: FnMut(T) -> Option<U>,

    Return an iterator adaptor that filters and transforms every Result::Ok value with the provided closure. Result::Err -values are unchanged. Read more
    source§

    fn flatten_ok<T, E>(self) -> FlattenOk<Self, T, E> ⓘ
    where +values are unchanged. Read more

    source§

    fn flatten_ok<T, E>(self) -> FlattenOk<Self, T, E> ⓘ
    where Self: Iterator<Item = Result<T, E>> + Sized, T: IntoIterator,

    Return an iterator adaptor that flattens every Result::Ok value into -a series of Result::Ok values. Result::Err values are unchanged. Read more
    source§

    fn process_results<F, T, E, R>(self, processor: F) -> Result<R, E>
    where +a series of Result::Ok values. Result::Err values are unchanged. Read more

    source§

    fn process_results<F, T, E, R>(self, processor: F) -> Result<R, E>
    where Self: Iterator<Item = Result<T, E>> + Sized, F: FnOnce(ProcessResults<'_, Self, E>) -> R,

    “Lift” a function of the values of the current iterator so as to process -an iterator of Result values instead. Read more
    source§

    fn merge<J>(self, other: J) -> Merge<Self, J::IntoIter>
    where +an iterator of Result values instead. Read more

    source§

    fn merge<J>(self, other: J) -> Merge<Self, J::IntoIter>
    where Self: Sized, Self::Item: PartialOrd, J: IntoIterator<Item = Self::Item>,

    Return an iterator adaptor that merges the two base iterators in ascending order. If both base iterators are sorted (ascending), the -result is sorted. Read more
    source§

    fn merge_by<J, F>(self, other: J, is_first: F) -> MergeBy<Self, J::IntoIter, F> ⓘ
    where +result is sorted. Read more

    source§

    fn merge_by<J, F>(self, other: J, is_first: F) -> MergeBy<Self, J::IntoIter, F> ⓘ
    where Self: Sized, J: IntoIterator<Item = Self::Item>, F: FnMut(&Self::Item, &Self::Item) -> bool,

    Return an iterator adaptor that merges the two base iterators in order. -This is much like .merge() but allows for a custom ordering. Read more
    source§

    fn merge_join_by<J, F, T>( +This is much like .merge() but allows for a custom ordering. Read more

    source§

    fn merge_join_by<J, F, T>( self, other: J, cmp_fn: F @@ -359,284 +360,295 @@ This is much like IntoIterator, F: FnMut(&Self::Item, &J::Item) -> T, Self: Sized,

    Create an iterator that merges items from both this and the specified -iterator in ascending order. Read more
    source§

    fn kmerge(self) -> KMerge<<Self::Item as IntoIterator>::IntoIter>
    where +iterator in ascending order. Read more

    source§

    fn kmerge(self) -> KMerge<<Self::Item as IntoIterator>::IntoIter>
    where Self: Sized, Self::Item: IntoIterator, <Self::Item as IntoIterator>::Item: PartialOrd,

    Return an iterator adaptor that flattens an iterator of iterators by -merging them in ascending order. Read more
    source§

    fn kmerge_by<F>( +merging them in ascending order. Read more

    source§

    fn kmerge_by<F>( self, first: F ) -> KMergeBy<<Self::Item as IntoIterator>::IntoIter, F> ⓘ
    where Self: Sized, Self::Item: IntoIterator, F: FnMut(&<Self::Item as IntoIterator>::Item, &<Self::Item as IntoIterator>::Item) -> bool,

    Return an iterator adaptor that flattens an iterator of iterators by -merging them according to the given closure. Read more
    source§

    fn cartesian_product<J>(self, other: J) -> Product<Self, J::IntoIter> ⓘ
    where +merging them according to the given closure. Read more

    source§

    fn cartesian_product<J>(self, other: J) -> Product<Self, J::IntoIter> ⓘ
    where Self: Sized, Self::Item: Clone, J: IntoIterator, J::IntoIter: Clone,

    Return an iterator adaptor that iterates over the cartesian product of -the element sets of two iterators self and J. Read more
    source§

    fn multi_cartesian_product( +the element sets of two iterators self and J. Read more

    source§

    fn multi_cartesian_product( self ) -> MultiProduct<<Self::Item as IntoIterator>::IntoIter> ⓘ
    where Self: Sized, Self::Item: IntoIterator, <Self::Item as IntoIterator>::IntoIter: Clone, <Self::Item as IntoIterator>::Item: Clone,

    Return an iterator adaptor that iterates over the cartesian product of -all subiterators returned by meta-iterator self. Read more
    source§

    fn coalesce<F>(self, f: F) -> Coalesce<Self, F>
    where +all subiterators returned by meta-iterator self. Read more

    source§

    fn coalesce<F>(self, f: F) -> Coalesce<Self, F>
    where Self: Sized, F: FnMut(Self::Item, Self::Item) -> Result<Self::Item, (Self::Item, Self::Item)>,

    Return an iterator adaptor that uses the passed-in closure to -optionally merge together consecutive elements. Read more
    source§

    fn dedup(self) -> Dedup<Self>
    where +optionally merge together consecutive elements. Read more

    source§

    fn dedup(self) -> Dedup<Self>
    where Self: Sized, Self::Item: PartialEq,

    Remove duplicates from sections of consecutive identical elements. -If the iterator is sorted, all elements will be unique. Read more
    source§

    fn dedup_by<Cmp>(self, cmp: Cmp) -> DedupBy<Self, Cmp>
    where +If the iterator is sorted, all elements will be unique. Read more

    source§

    fn dedup_by<Cmp>(self, cmp: Cmp) -> DedupBy<Self, Cmp>
    where Self: Sized, Cmp: FnMut(&Self::Item, &Self::Item) -> bool,

    Remove duplicates from sections of consecutive identical elements, determining equality using a comparison function. -If the iterator is sorted, all elements will be unique. Read more
    source§

    fn dedup_with_count(self) -> DedupWithCount<Self>
    where +If the iterator is sorted, all elements will be unique. Read more

    source§

    fn dedup_with_count(self) -> DedupWithCount<Self>
    where Self: Sized,

    Remove duplicates from sections of consecutive identical elements, while keeping a count of how many repeated elements were present. -If the iterator is sorted, all elements will be unique. Read more
    source§

    fn dedup_by_with_count<Cmp>(self, cmp: Cmp) -> DedupByWithCount<Self, Cmp>
    where +If the iterator is sorted, all elements will be unique. Read more

    source§

    fn dedup_by_with_count<Cmp>(self, cmp: Cmp) -> DedupByWithCount<Self, Cmp>
    where Self: Sized, Cmp: FnMut(&Self::Item, &Self::Item) -> bool,

    Remove duplicates from sections of consecutive identical elements, while keeping a count of how many repeated elements were present. This will determine equality using a comparison function. -If the iterator is sorted, all elements will be unique. Read more
    source§

    fn duplicates(self) -> Duplicates<Self>
    where +If the iterator is sorted, all elements will be unique. Read more

    source§

    fn duplicates(self) -> Duplicates<Self>
    where Self: Sized, Self::Item: Eq + Hash,

    Return an iterator adaptor that produces elements that appear more than once during the -iteration. Duplicates are detected using hash and equality. Read more
    source§

    fn duplicates_by<V, F>(self, f: F) -> DuplicatesBy<Self, V, F>
    where +iteration. Duplicates are detected using hash and equality. Read more

    source§

    fn duplicates_by<V, F>(self, f: F) -> DuplicatesBy<Self, V, F>
    where Self: Sized, V: Eq + Hash, F: FnMut(&Self::Item) -> V,

    Return an iterator adaptor that produces elements that appear more than once during the -iteration. Duplicates are detected using hash and equality. Read more
    source§

    fn unique(self) -> Unique<Self> ⓘ
    where +iteration. Duplicates are detected using hash and equality. Read more

    source§

    fn unique(self) -> Unique<Self> ⓘ
    where Self: Sized, Self::Item: Clone + Eq + Hash,

    Return an iterator adaptor that filters out elements that have already been produced once during the iteration. Duplicates -are detected using hash and equality. Read more
    source§

    fn unique_by<V, F>(self, f: F) -> UniqueBy<Self, V, F> ⓘ
    where +are detected using hash and equality. Read more

    source§

    fn unique_by<V, F>(self, f: F) -> UniqueBy<Self, V, F> ⓘ
    where Self: Sized, V: Eq + Hash, F: FnMut(&Self::Item) -> V,

    Return an iterator adaptor that filters out elements that have -already been produced once during the iteration. Read more
    source§

    fn peeking_take_while<F>(&mut self, accept: F) -> PeekingTakeWhile<'_, Self, F> ⓘ
    where +already been produced once during the iteration. Read more

    source§

    fn peeking_take_while<F>(&mut self, accept: F) -> PeekingTakeWhile<'_, Self, F> ⓘ
    where Self: Sized + PeekingNext, F: FnMut(&Self::Item) -> bool,

    Return an iterator adaptor that borrows from this iterator and -takes items while the closure accept returns true. Read more
    source§

    fn take_while_ref<F>(&mut self, accept: F) -> TakeWhileRef<'_, Self, F> ⓘ
    where +takes items while the closure accept returns true. Read more

    source§

    fn take_while_ref<F>(&mut self, accept: F) -> TakeWhileRef<'_, Self, F> ⓘ
    where Self: Clone, F: FnMut(&Self::Item) -> bool,

    Return an iterator adaptor that borrows from a Clone-able iterator -to only pick off elements while the predicate accept returns true. Read more
    source§

    fn take_while_inclusive<F>(self, accept: F) -> TakeWhileInclusive<Self, F> ⓘ
    where +to only pick off elements while the predicate accept returns true. Read more

    source§

    fn take_while_inclusive<F>(self, accept: F) -> TakeWhileInclusive<Self, F> ⓘ
    where Self: Sized, F: FnMut(&Self::Item) -> bool,

    Returns an iterator adaptor that consumes elements while the given predicate is true, including the element for which the predicate -first returned false. Read more
    source§

    fn while_some<A>(self) -> WhileSome<Self> ⓘ
    where +first returned false. Read more

    source§

    fn while_some<A>(self) -> WhileSome<Self> ⓘ
    where Self: Sized + Iterator<Item = Option<A>>,

    Return an iterator adaptor that filters Option<A> iterator elements -and produces A. Stops on the first None encountered. Read more
    source§

    fn tuple_combinations<T>(self) -> TupleCombinations<Self, T> ⓘ
    where +and produces A. Stops on the first None encountered. Read more

    source§

    fn tuple_combinations<T>(self) -> TupleCombinations<Self, T> ⓘ
    where Self: Sized + Clone, Self::Item: Clone, T: HasCombination<Self>,

    Return an iterator adaptor that iterates over the combinations of the -elements from an iterator. Read more
    source§

    fn combinations(self, k: usize) -> Combinations<Self> ⓘ
    where +elements from an iterator. Read more

    source§

    fn combinations(self, k: usize) -> Combinations<Self> ⓘ
    where Self: Sized, Self::Item: Clone,

    Return an iterator adaptor that iterates over the k-length combinations of -the elements from an iterator. Read more
    source§

    fn combinations_with_replacement( +the elements from an iterator. Read more

    source§

    fn combinations_with_replacement( self, k: usize ) -> CombinationsWithReplacement<Self> ⓘ
    where Self: Sized, Self::Item: Clone,

    Return an iterator that iterates over the k-length combinations of -the elements from an iterator, with replacement. Read more
    source§

    fn permutations(self, k: usize) -> Permutations<Self> ⓘ
    where +the elements from an iterator, with replacement. Read more

    source§

    fn permutations(self, k: usize) -> Permutations<Self> ⓘ
    where Self: Sized, Self::Item: Clone,

    Return an iterator adaptor that iterates over all k-permutations of the -elements from an iterator. Read more
    source§

    fn powerset(self) -> Powerset<Self> ⓘ
    where +elements from an iterator. Read more

    source§

    fn powerset(self) -> Powerset<Self> ⓘ
    where Self: Sized, Self::Item: Clone,

    Return an iterator that iterates through the powerset of the elements from an -iterator. Read more
    source§

    fn pad_using<F>(self, min: usize, f: F) -> PadUsing<Self, F> ⓘ
    where +iterator. Read more

    source§

    fn pad_using<F>(self, min: usize, f: F) -> PadUsing<Self, F> ⓘ
    where Self: Sized, F: FnMut(usize) -> Self::Item,

    Return an iterator adaptor that pads the sequence to a minimum length of -min by filling missing elements using a closure f. Read more
    source§

    fn with_position(self) -> WithPosition<Self> ⓘ
    where +min by filling missing elements using a closure f. Read more

    source§

    fn with_position(self) -> WithPosition<Self> ⓘ
    where Self: Sized,

    Return an iterator adaptor that combines each element with a Position to -ease special-case handling of the first or last elements. Read more
    source§

    fn positions<P>(self, predicate: P) -> Positions<Self, P> ⓘ
    where +ease special-case handling of the first or last elements. Read more

    source§

    fn positions<P>(self, predicate: P) -> Positions<Self, P> ⓘ
    where Self: Sized, P: FnMut(Self::Item) -> bool,

    Return an iterator adaptor that yields the indices of all elements -satisfying a predicate, counted from the start of the iterator. Read more
    source§

    fn update<F>(self, updater: F) -> Update<Self, F> ⓘ
    where +satisfying a predicate, counted from the start of the iterator. Read more

    source§

    fn update<F>(self, updater: F) -> Update<Self, F> ⓘ
    where Self: Sized, F: FnMut(&mut Self::Item),

    Return an iterator adaptor that applies a mutating function -to each element before yielding it. Read more
    source§

    fn next_tuple<T>(&mut self) -> Option<T>
    where +to each element before yielding it. Read more

    source§

    fn next_tuple<T>(&mut self) -> Option<T>
    where Self: Sized + Iterator<Item = T::Item>, T: HomogeneousTuple,

    Advances the iterator and returns the next items grouped in a tuple of -a specific size (up to 12). Read more
    source§

    fn collect_tuple<T>(self) -> Option<T>
    where +a specific size (up to 12). Read more

    source§

    fn collect_tuple<T>(self) -> Option<T>
    where Self: Sized + Iterator<Item = T::Item>, T: HomogeneousTuple,

    Collects all items from the iterator into a tuple of a specific size -(up to 12). Read more
    source§

    fn find_position<P>(&mut self, pred: P) -> Option<(usize, Self::Item)>
    where - P: FnMut(&Self::Item) -> bool,

    Find the position and value of the first element satisfying a predicate. Read more
    source§

    fn find_or_last<P>(self, predicate: P) -> Option<Self::Item>
    where +(up to 12). Read more

    source§

    fn find_position<P>(&mut self, pred: P) -> Option<(usize, Self::Item)>
    where + P: FnMut(&Self::Item) -> bool,

    Find the position and value of the first element satisfying a predicate. Read more
    source§

    fn find_or_last<P>(self, predicate: P) -> Option<Self::Item>
    where Self: Sized, - P: FnMut(&Self::Item) -> bool,

    Find the value of the first element satisfying a predicate or return the last element, if any. Read more
    source§

    fn find_or_first<P>(self, predicate: P) -> Option<Self::Item>
    where + P: FnMut(&Self::Item) -> bool,

    Find the value of the first element satisfying a predicate or return the last element, if any. Read more
    source§

    fn find_or_first<P>(self, predicate: P) -> Option<Self::Item>
    where Self: Sized, - P: FnMut(&Self::Item) -> bool,

    Find the value of the first element satisfying a predicate or return the first element, if any. Read more
    source§

    fn contains<Q>(&mut self, query: &Q) -> bool
    where + P: FnMut(&Self::Item) -> bool,

    Find the value of the first element satisfying a predicate or return the first element, if any. Read more
    source§

    fn contains<Q>(&mut self, query: &Q) -> bool
    where Self: Sized, Self::Item: Borrow<Q>, - Q: PartialEq,

    Returns true if the given item is present in this iterator. Read more
    source§

    fn all_equal(&mut self) -> bool
    where + Q: PartialEq,

    Returns true if the given item is present in this iterator. Read more
    source§

    fn all_equal(&mut self) -> bool
    where Self: Sized, - Self::Item: PartialEq,

    Check whether all elements compare equal. Read more
    source§

    fn all_equal_value( + Self::Item: PartialEq,

    Check whether all elements compare equal. Read more
    source§

    fn all_equal_value( &mut self ) -> Result<Self::Item, Option<(Self::Item, Self::Item)>>
    where Self: Sized, Self::Item: PartialEq,

    If there are elements and they are all equal, return a single copy of that element. If there are no elements, return an Error containing None. If there are elements and they are not all equal, return a tuple containing the first -two non-equal elements found. Read more
    source§

    fn all_unique(&mut self) -> bool
    where +two non-equal elements found. Read more

    source§

    fn all_unique(&mut self) -> bool
    where Self: Sized, - Self::Item: Eq + Hash,

    Check whether all elements are unique (non equal). Read more
    source§

    fn dropping(self, n: usize) -> Self
    where + Self::Item: Eq + Hash,

    Check whether all elements are unique (non equal). Read more
    source§

    fn dropping(self, n: usize) -> Self
    where Self: Sized,

    Consume the first n elements from the iterator eagerly, -and return the same iterator again. Read more
    source§

    fn dropping_back(self, n: usize) -> Self
    where +and return the same iterator again. Read more

    source§

    fn dropping_back(self, n: usize) -> Self
    where Self: Sized + DoubleEndedIterator,

    Consume the last n elements from the iterator eagerly, -and return the same iterator again. Read more
    source§

    fn foreach<F>(self, f: F)
    where - F: FnMut(Self::Item), - Self: Sized,

    👎Deprecated since 0.8.0: Use .for_each() instead
    Run the closure f eagerly on each element of the iterator. Read more
    source§

    fn concat(self) -> Self::Item
    where +and return the same iterator again. Read more

    source§

    fn concat(self) -> Self::Item
    where Self: Sized, - Self::Item: Extend<<<Self as Iterator>::Item as IntoIterator>::Item> + IntoIterator + Default,

    Combine all an iterator’s elements into one element by using Extend. Read more
    source§

    fn collect_vec(self) -> Vec<Self::Item>
    where + Self::Item: Extend<<<Self as Iterator>::Item as IntoIterator>::Item> + IntoIterator + Default,

    Combine all an iterator’s elements into one element by using Extend. Read more
    source§

    fn collect_vec(self) -> Vec<Self::Item>
    where Self: Sized,

    .collect_vec() is simply a type specialization of Iterator::collect, -for convenience.
    source§

    fn try_collect<T, U, E>(self) -> Result<U, E>
    where +for convenience.

    source§

    fn try_collect<T, U, E>(self) -> Result<U, E>
    where Self: Sized + Iterator<Item = Result<T, E>>, Result<U, E>: FromIterator<Result<T, E>>,

    .try_collect() is more convenient way of writing -.collect::<Result<_, _>>() Read more
    source§

    fn set_from<'a, A: 'a, J>(&mut self, from: J) -> usize
    where +.collect::<Result<_, _>>() Read more

    source§

    fn set_from<'a, A: 'a, J>(&mut self, from: J) -> usize
    where Self: Iterator<Item = &'a mut A>, J: IntoIterator<Item = A>,

    Assign to each reference in self from the from iterator, -stopping at the shortest of the two iterators. Read more
    source§

    fn join(&mut self, sep: &str) -> String
    where - Self::Item: Display,

    Combine all iterator elements into one String, separated by sep. Read more
    source§

    fn format(self, sep: &str) -> Format<'_, Self>
    where - Self: Sized,

    Format all iterator elements, separated by sep. Read more
    source§

    fn format_with<F>(self, sep: &str, format: F) -> FormatWith<'_, Self, F>
    where +stopping at the shortest of the two iterators. Read more

    source§

    fn join(&mut self, sep: &str) -> String
    where + Self::Item: Display,

    Combine all iterator elements into one String, separated by sep. Read more
    source§

    fn format(self, sep: &str) -> Format<'_, Self>
    where + Self: Sized,

    Format all iterator elements, separated by sep. Read more
    source§

    fn format_with<F>(self, sep: &str, format: F) -> FormatWith<'_, Self, F>
    where Self: Sized, - F: FnMut(Self::Item, &mut dyn FnMut(&dyn Display) -> Result) -> Result,

    Format all iterator elements, separated by sep. Read more
    source§

    fn fold_results<A, E, B, F>(&mut self, start: B, f: F) -> Result<B, E>
    where + F: FnMut(Self::Item, &mut dyn FnMut(&dyn Display) -> Result) -> Result,

    Format all iterator elements, separated by sep. Read more
    source§

    fn fold_ok<A, E, B, F>(&mut self, start: B, f: F) -> Result<B, E>
    where Self: Iterator<Item = Result<A, E>>, - F: FnMut(B, A) -> B,

    👎Deprecated since 0.10.0: Use .fold_ok() instead
    See .fold_ok().
    source§

    fn fold_ok<A, E, B, F>(&mut self, start: B, f: F) -> Result<B, E>
    where - Self: Iterator<Item = Result<A, E>>, - F: FnMut(B, A) -> B,

    Fold Result values from an iterator. Read more
    source§

    fn fold_options<A, B, F>(&mut self, start: B, f: F) -> Option<B>
    where + F: FnMut(B, A) -> B,

    Fold Result values from an iterator. Read more
    source§

    fn fold_options<A, B, F>(&mut self, start: B, f: F) -> Option<B>
    where Self: Iterator<Item = Option<A>>, - F: FnMut(B, A) -> B,

    Fold Option values from an iterator. Read more
    source§

    fn fold1<F>(self, f: F) -> Option<Self::Item>
    where + F: FnMut(B, A) -> B,

    Fold Option values from an iterator. Read more
    source§

    fn fold1<F>(self, f: F) -> Option<Self::Item>
    where F: FnMut(Self::Item, Self::Item) -> Self::Item, - Self: Sized,

    👎Deprecated since 0.10.2: Use Iterator::reduce instead
    Accumulator of the elements in the iterator. Read more
    source§

    fn tree_fold1<F>(self, f: F) -> Option<Self::Item>
    where + Self: Sized,

    👎Deprecated since 0.10.2: Use Iterator::reduce instead
    Accumulator of the elements in the iterator. Read more
    source§

    fn tree_reduce<F>(self, f: F) -> Option<Self::Item>
    where F: FnMut(Self::Item, Self::Item) -> Self::Item, - Self: Sized,

    Accumulate the elements in the iterator in a tree-like manner. Read more
    source§

    fn fold_while<B, F>(&mut self, init: B, f: F) -> FoldWhile<B>
    where + Self: Sized,

    Accumulate the elements in the iterator in a tree-like manner. Read more
    source§

    fn tree_fold1<F>(self, f: F) -> Option<Self::Item>
    where + F: FnMut(Self::Item, Self::Item) -> Self::Item, + Self: Sized,

    👎Deprecated since 0.13.0: Use .tree_reduce() instead
    See .tree_reduce().
    source§

    fn fold_while<B, F>(&mut self, init: B, f: F) -> FoldWhile<B>
    where Self: Sized, - F: FnMut(B, Self::Item) -> FoldWhile<B>,

    An iterator method that applies a function, producing a single, final value. Read more
    source§

    fn sum1<S>(self) -> Option<S>
    where + F: FnMut(B, Self::Item) -> FoldWhile<B>,

    An iterator method that applies a function, producing a single, final value. Read more
    source§

    fn sum1<S>(self) -> Option<S>
    where Self: Sized, - S: Sum<Self::Item>,

    Iterate over the entire iterator and add all the elements. Read more
    source§

    fn product1<P>(self) -> Option<P>
    where + S: Sum<Self::Item>,

    Iterate over the entire iterator and add all the elements. Read more
    source§

    fn product1<P>(self) -> Option<P>
    where Self: Sized, - P: Product<Self::Item>,

    Iterate over the entire iterator and multiply all the elements. Read more
    source§

    fn sorted_unstable(self) -> IntoIter<Self::Item> ⓘ
    where + P: Product<Self::Item>,

    Iterate over the entire iterator and multiply all the elements. Read more
    source§

    fn sorted_unstable(self) -> IntoIter<Self::Item> ⓘ
    where Self: Sized, - Self::Item: Ord,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_unstable_by<F>(self, cmp: F) -> IntoIter<Self::Item> ⓘ
    where + Self::Item: Ord,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_unstable_by<F>(self, cmp: F) -> IntoIter<Self::Item> ⓘ
    where Self: Sized, - F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_unstable_by_key<K, F>(self, f: F) -> IntoIter<Self::Item> ⓘ
    where + F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_unstable_by_key<K, F>(self, f: F) -> IntoIter<Self::Item> ⓘ
    where Self: Sized, K: Ord, - F: FnMut(&Self::Item) -> K,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted(self) -> IntoIter<Self::Item> ⓘ
    where + F: FnMut(&Self::Item) -> K,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted(self) -> IntoIter<Self::Item> ⓘ
    where Self: Sized, - Self::Item: Ord,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_by<F>(self, cmp: F) -> IntoIter<Self::Item> ⓘ
    where + Self::Item: Ord,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_by<F>(self, cmp: F) -> IntoIter<Self::Item> ⓘ
    where Self: Sized, - F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_by_key<K, F>(self, f: F) -> IntoIter<Self::Item> ⓘ
    where + F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_by_key<K, F>(self, f: F) -> IntoIter<Self::Item> ⓘ
    where Self: Sized, K: Ord, - F: FnMut(&Self::Item) -> K,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_by_cached_key<K, F>(self, f: F) -> IntoIter<Self::Item> ⓘ
    where + F: FnMut(&Self::Item) -> K,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_by_cached_key<K, F>(self, f: F) -> IntoIter<Self::Item> ⓘ
    where Self: Sized, K: Ord, F: FnMut(&Self::Item) -> K,

    Sort all iterator elements into a new iterator in ascending order. The key function is -called exactly once per key. Read more
    source§

    fn k_smallest(self, k: usize) -> IntoIter<Self::Item> ⓘ
    where +called exactly once per key. Read more

    source§

    fn k_smallest(self, k: usize) -> IntoIter<Self::Item> ⓘ
    where Self: Sized, - Self::Item: Ord,

    Sort the k smallest elements into a new iterator, in ascending order. Read more
    source§

    fn partition_map<A, B, F, L, R>(self, predicate: F) -> (A, B)
    where + Self::Item: Ord,

    Sort the k smallest elements into a new iterator, in ascending order. Read more
    source§

    fn k_smallest_by<F>(self, k: usize, cmp: F) -> IntoIter<Self::Item> ⓘ
    where + Self: Sized, + F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Sort the k smallest elements into a new iterator using the provided comparison. Read more
    source§

    fn k_smallest_by_key<F, K>(self, k: usize, key: F) -> IntoIter<Self::Item> ⓘ
    where + Self: Sized, + F: FnMut(&Self::Item) -> K, + K: Ord,

    Return the elements producing the k smallest outputs of the provided function. Read more
    source§

    fn k_largest(self, k: usize) -> IntoIter<Self::Item> ⓘ
    where + Self: Sized, + Self::Item: Ord,

    Sort the k largest elements into a new iterator, in descending order. Read more
    source§

    fn k_largest_by<F>(self, k: usize, cmp: F) -> IntoIter<Self::Item> ⓘ
    where + Self: Sized, + F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Sort the k largest elements into a new iterator using the provided comparison. Read more
    source§

    fn k_largest_by_key<F, K>(self, k: usize, key: F) -> IntoIter<Self::Item> ⓘ
    where + Self: Sized, + F: FnMut(&Self::Item) -> K, + K: Ord,

    Return the elements producing the k largest outputs of the provided function. Read more
    source§

    fn tail(self, n: usize) -> IntoIter<Self::Item> ⓘ
    where + Self: Sized,

    Consumes the iterator and return an iterator of the last n elements. Read more
    source§

    fn partition_map<A, B, F, L, R>(self, predicate: F) -> (A, B)
    where Self: Sized, F: FnMut(Self::Item) -> Either<L, R>, A: Default + Extend<L>, B: Default + Extend<R>,

    Collect all iterator elements into one of two partitions. Unlike Iterator::partition, each partition may -have a distinct type. Read more
    source§

    fn partition_result<A, B, T, E>(self) -> (A, B)
    where +have a distinct type. Read more

    source§

    fn partition_result<A, B, T, E>(self) -> (A, B)
    where Self: Iterator<Item = Result<T, E>> + Sized, A: Default + Extend<T>, B: Default + Extend<E>,

    Partition a sequence of Results into one list of all the Ok elements -and another list of all the Err elements. Read more
    source§

    fn into_group_map<K, V>(self) -> HashMap<K, Vec<V>>
    where +and another list of all the Err elements. Read more

    source§

    fn into_group_map<K, V>(self) -> HashMap<K, Vec<V>>
    where Self: Iterator<Item = (K, V)> + Sized, K: Hash + Eq,

    Return a HashMap of keys mapped to Vecs of values. Keys and values -are taken from (Key, Value) tuple pairs yielded by the input iterator. Read more
    source§

    fn into_group_map_by<K, V, F>(self, f: F) -> HashMap<K, Vec<V>>
    where +are taken from (Key, Value) tuple pairs yielded by the input iterator. Read more

    source§

    fn into_group_map_by<K, V, F>(self, f: F) -> HashMap<K, Vec<V>>
    where Self: Iterator<Item = V> + Sized, K: Hash + Eq, - F: Fn(&V) -> K,

    Return an Iterator on a HashMap. Keys mapped to Vecs of values. The key is specified -in the closure. Read more
    source§

    fn into_grouping_map<K, V>(self) -> GroupingMap<Self>
    where + F: FnMut(&V) -> K,

    Return an Iterator on a HashMap. Keys mapped to Vecs of values. The key is specified +in the closure. Read more
    source§

    fn into_grouping_map<K, V>(self) -> GroupingMap<Self>
    where Self: Iterator<Item = (K, V)> + Sized, K: Hash + Eq,

    Constructs a GroupingMap to be used later with one of the efficient -group-and-fold operations it allows to perform. Read more
    source§

    fn into_grouping_map_by<K, V, F>(self, key_mapper: F) -> GroupingMapBy<Self, F>
    where +group-and-fold operations it allows to perform. Read more

    source§

    fn into_grouping_map_by<K, V, F>(self, key_mapper: F) -> GroupingMapBy<Self, F>
    where Self: Iterator<Item = V> + Sized, K: Hash + Eq, F: FnMut(&V) -> K,

    Constructs a GroupingMap to be used later with one of the efficient -group-and-fold operations it allows to perform. Read more
    source§

    fn min_set(self) -> Vec<Self::Item>
    where +group-and-fold operations it allows to perform. Read more

    source§

    fn min_set(self) -> Vec<Self::Item>
    where Self: Sized, - Self::Item: Ord,

    Return all minimum elements of an iterator. Read more
    source§

    fn min_set_by<F>(self, compare: F) -> Vec<Self::Item>
    where + Self::Item: Ord,

    Return all minimum elements of an iterator. Read more
    source§

    fn min_set_by<F>(self, compare: F) -> Vec<Self::Item>
    where Self: Sized, F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Return all minimum elements of an iterator, as determined by -the specified function. Read more
    source§

    fn min_set_by_key<K, F>(self, key: F) -> Vec<Self::Item>
    where +the specified function. Read more

    source§

    fn min_set_by_key<K, F>(self, key: F) -> Vec<Self::Item>
    where Self: Sized, K: Ord, F: FnMut(&Self::Item) -> K,

    Return all minimum elements of an iterator, as determined by -the specified function. Read more
    source§

    fn max_set(self) -> Vec<Self::Item>
    where +the specified function. Read more

    source§

    fn max_set(self) -> Vec<Self::Item>
    where Self: Sized, - Self::Item: Ord,

    Return all maximum elements of an iterator. Read more
    source§

    fn max_set_by<F>(self, compare: F) -> Vec<Self::Item>
    where + Self::Item: Ord,

    Return all maximum elements of an iterator. Read more
    source§

    fn max_set_by<F>(self, compare: F) -> Vec<Self::Item>
    where Self: Sized, F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Return all maximum elements of an iterator, as determined by -the specified function. Read more
    source§

    fn max_set_by_key<K, F>(self, key: F) -> Vec<Self::Item>
    where +the specified function. Read more

    source§

    fn max_set_by_key<K, F>(self, key: F) -> Vec<Self::Item>
    where Self: Sized, K: Ord, F: FnMut(&Self::Item) -> K,

    Return all maximum elements of an iterator, as determined by -the specified function. Read more
    source§

    fn minmax(self) -> MinMaxResult<Self::Item>
    where +the specified function. Read more

    source§

    fn minmax(self) -> MinMaxResult<Self::Item>
    where Self: Sized, - Self::Item: PartialOrd,

    Return the minimum and maximum elements in the iterator. Read more
    source§

    fn minmax_by_key<K, F>(self, key: F) -> MinMaxResult<Self::Item>
    where + Self::Item: PartialOrd,

    Return the minimum and maximum elements in the iterator. Read more
    source§

    fn minmax_by_key<K, F>(self, key: F) -> MinMaxResult<Self::Item>
    where Self: Sized, K: PartialOrd, F: FnMut(&Self::Item) -> K,

    Return the minimum and maximum element of an iterator, as determined by -the specified function. Read more
    source§

    fn minmax_by<F>(self, compare: F) -> MinMaxResult<Self::Item>
    where +the specified function. Read more

    source§

    fn minmax_by<F>(self, compare: F) -> MinMaxResult<Self::Item>
    where Self: Sized, F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Return the minimum and maximum element of an iterator, as determined by -the specified comparison function. Read more
    source§

    fn position_max(self) -> Option<usize>
    where +the specified comparison function. Read more

    source§

    fn position_max(self) -> Option<usize>
    where Self: Sized, - Self::Item: Ord,

    Return the position of the maximum element in the iterator. Read more
    source§

    fn position_max_by_key<K, F>(self, key: F) -> Option<usize>
    where + Self::Item: Ord,

    Return the position of the maximum element in the iterator. Read more
    source§

    fn position_max_by_key<K, F>(self, key: F) -> Option<usize>
    where Self: Sized, K: Ord, F: FnMut(&Self::Item) -> K,

    Return the position of the maximum element in the iterator, as -determined by the specified function. Read more
    source§

    fn position_max_by<F>(self, compare: F) -> Option<usize>
    where +determined by the specified function. Read more

    source§

    fn position_max_by<F>(self, compare: F) -> Option<usize>
    where Self: Sized, F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Return the position of the maximum element in the iterator, as -determined by the specified comparison function. Read more
    source§

    fn position_min(self) -> Option<usize>
    where +determined by the specified comparison function. Read more

    source§

    fn position_min(self) -> Option<usize>
    where Self: Sized, - Self::Item: Ord,

    Return the position of the minimum element in the iterator. Read more
    source§

    fn position_min_by_key<K, F>(self, key: F) -> Option<usize>
    where + Self::Item: Ord,

    Return the position of the minimum element in the iterator. Read more
    source§

    fn position_min_by_key<K, F>(self, key: F) -> Option<usize>
    where Self: Sized, K: Ord, F: FnMut(&Self::Item) -> K,

    Return the position of the minimum element in the iterator, as -determined by the specified function. Read more
    source§

    fn position_min_by<F>(self, compare: F) -> Option<usize>
    where +determined by the specified function. Read more

    source§

    fn position_min_by<F>(self, compare: F) -> Option<usize>
    where Self: Sized, F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Return the position of the minimum element in the iterator, as -determined by the specified comparison function. Read more
    source§

    fn position_minmax(self) -> MinMaxResult<usize>
    where +determined by the specified comparison function. Read more

    source§

    fn position_minmax(self) -> MinMaxResult<usize>
    where Self: Sized, Self::Item: PartialOrd,

    Return the positions of the minimum and maximum elements in -the iterator. Read more
    source§

    fn position_minmax_by_key<K, F>(self, key: F) -> MinMaxResult<usize>
    where +the iterator. Read more

    source§

    fn position_minmax_by_key<K, F>(self, key: F) -> MinMaxResult<usize>
    where Self: Sized, K: PartialOrd, F: FnMut(&Self::Item) -> K,

    Return the postions of the minimum and maximum elements of an -iterator, as determined by the specified function. Read more
    source§

    fn position_minmax_by<F>(self, compare: F) -> MinMaxResult<usize>
    where +iterator, as determined by the specified function. Read more

    source§

    fn position_minmax_by<F>(self, compare: F) -> MinMaxResult<usize>
    where Self: Sized, F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Return the postions of the minimum and maximum elements of an -iterator, as determined by the specified comparison function. Read more
    source§

    fn exactly_one(self) -> Result<Self::Item, ExactlyOneError<Self>>
    where +iterator, as determined by the specified comparison function. Read more

    source§

    fn exactly_one(self) -> Result<Self::Item, ExactlyOneError<Self>>
    where Self: Sized,

    If the iterator yields exactly one element, that element will be returned, otherwise an error will be returned containing an iterator that has the same output as the input -iterator. Read more
    source§

    fn at_most_one(self) -> Result<Option<Self::Item>, ExactlyOneError<Self>>
    where - Self: Sized,

    If the iterator yields no elements, Ok(None) will be returned. If the iterator yields +iterator. Read more
    source§

    fn at_most_one(self) -> Result<Option<Self::Item>, ExactlyOneError<Self>>
    where + Self: Sized,

    If the iterator yields no elements, Ok(None) will be returned. If the iterator yields exactly one element, that element will be returned, otherwise an error will be returned -containing an iterator that has the same output as the input iterator. Read more
    source§

    fn multipeek(self) -> MultiPeek<Self> ⓘ
    where +containing an iterator that has the same output as the input iterator. Read more

    source§

    fn multipeek(self) -> MultiPeek<Self> ⓘ
    where Self: Sized,

    An iterator adaptor that allows the user to peek at multiple .next() -values without advancing the base iterator. Read more
    source§

    fn counts(self) -> HashMap<Self::Item, usize>
    where +values without advancing the base iterator. Read more

    source§

    fn counts(self) -> HashMap<Self::Item, usize>
    where Self: Sized, Self::Item: Eq + Hash,

    Collect the items in this iterator and return a HashMap which contains each item that appears in the iterator and the number -of times it appears. Read more
    source§

    fn counts_by<K, F>(self, f: F) -> HashMap<K, usize>
    where +of times it appears. Read more

    source§

    fn counts_by<K, F>(self, f: F) -> HashMap<K, usize>
    where Self: Sized, K: Eq + Hash, F: FnMut(Self::Item) -> K,

    Collect the items in this iterator and return a HashMap which contains each item that appears in the iterator and the number of times it appears, -determining identity using a keying function. Read more
    source§

    fn multiunzip<FromI>(self) -> FromI
    where - Self: Sized + MultiUnzip<FromI>,

    Converts an iterator of tuples into a tuple of containers. Read more
    source§

    fn try_len(&self) -> Result<usize, (usize, Option<usize>)>

    Returns the length of the iterator if one exists. +determining identity using a keying function. Read more
    source§

    fn multiunzip<FromI>(self) -> FromI
    where + Self: Sized + MultiUnzip<FromI>,

    Converts an iterator of tuples into a tuple of containers. Read more
    source§

    fn try_len(&self) -> Result<usize, (usize, Option<usize>)>

    Returns the length of the iterator if one exists. Otherwise return self.size_hint(). Read more
    source§

    impl<IT> MultiUnzip<()> for IT
    where IT: Iterator<Item = ()>,

    source§

    fn multiunzip(self)

    Unzip this iterator into multiple collections.
    source§

    impl<IT, A, FromA> MultiUnzip<(FromA,)> for IT
    where IT: Iterator<Item = (A,)>, @@ -739,4 +751,4 @@ Otherwise return self.size_hint(). (FromA, FromB, FromC, FromD, FromE, FromF, FromG, FromH, FromI, FromJ, FromK, FromL)

    Unzip this iterator into multiple collections.
    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 + 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/itertools/structs/struct.PeekingTakeWhile.html b/itertools/structs/struct.PeekingTakeWhile.html index 588b5fa17..26d0ad1ca 100644 --- a/itertools/structs/struct.PeekingTakeWhile.html +++ b/itertools/structs/struct.PeekingTakeWhile.html @@ -1,4 +1,4 @@ -PeekingTakeWhile in itertools::structs - Rust
    +PeekingTakeWhile in itertools::structs - Rust

    Struct itertools::structs::PeekingTakeWhile

    source · 
    pub struct PeekingTakeWhile<'a, I, F>
    where
     I: Iterator + 'a,
    { /* private fields */ }
    Expand description

    An iterator adaptor that takes items while a closure returns true.

    See .peeking_take_while() @@ -187,8 +187,8 @@ function. PeekingNext, F: FnMut(&I::Item) -> bool,

    source§

    fn peeking_next<G>(&mut self, g: G) -> Option<Self::Item>
    where G: FnOnce(&Self::Item) -> bool,

    Pass a reference to the next iterator element to the closure accept; -if accept returns true, return it as the next element, -else None.

    Auto Trait Implementations§

    §

    impl<'a, I, F> Freeze for PeekingTakeWhile<'a, I, F>
    where +if accept returns true, return it as the next element, +else None.

    Auto Trait Implementations§

    §

    impl<'a, I, F> Freeze for PeekingTakeWhile<'a, I, F>
    where F: Freeze,

    §

    impl<'a, I, F> RefUnwindSafe for PeekingTakeWhile<'a, I, F>
    where F: RefUnwindSafe, I: RefUnwindSafe,

    §

    impl<'a, I, F> Send for PeekingTakeWhile<'a, I, F>
    where @@ -212,86 +212,87 @@ otherwise. Right variant of Either<Self, Self> otherwise. Read more

    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> Itertools for T
    where - T: Iterator + ?Sized,

    source§

    fn interleave<J>(self, other: J) -> Interleave<Self, J::IntoIter> ⓘ
    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> Itertools for T
    where + T: Iterator + ?Sized,

    source§

    fn interleave<J>(self, other: J) -> Interleave<Self, J::IntoIter> ⓘ
    where J: IntoIterator<Item = Self::Item>, - Self: Sized,

    Alternate elements from two iterators until both have run out. Read more
    source§

    fn interleave_shortest<J>( + Self: Sized,

    Alternate elements from two iterators until both have run out. Read more
    source§

    fn interleave_shortest<J>( self, other: J ) -> InterleaveShortest<Self, J::IntoIter> ⓘ
    where J: IntoIterator<Item = Self::Item>, Self: Sized,

    Alternate elements from two iterators until at least one of them has run -out. Read more
    source§

    fn intersperse(self, element: Self::Item) -> Intersperse<Self>
    where +out. Read more

    source§

    fn intersperse(self, element: Self::Item) -> Intersperse<Self>
    where Self: Sized, Self::Item: Clone,

    An iterator adaptor to insert a particular value -between each element of the adapted iterator. Read more
    source§

    fn intersperse_with<F>(self, element: F) -> IntersperseWith<Self, F> ⓘ
    where +between each element of the adapted iterator. Read more

    source§

    fn intersperse_with<F>(self, element: F) -> IntersperseWith<Self, F> ⓘ
    where Self: Sized, F: FnMut() -> Self::Item,

    An iterator adaptor to insert a particular value created by a function -between each element of the adapted iterator. Read more
    source§

    fn zip_longest<J>(self, other: J) -> ZipLongest<Self, J::IntoIter> ⓘ
    where +between each element of the adapted iterator. Read more

    source§

    fn get<R>(self, index: R) -> R::Output
    where + Self: Sized, + R: IteratorIndex<Self>,

    Returns an iterator over a subsection of the iterator. Read more
    source§

    fn zip_longest<J>(self, other: J) -> ZipLongest<Self, J::IntoIter> ⓘ
    where J: IntoIterator, Self: Sized,

    Create an iterator which iterates over both this and the specified -iterator simultaneously, yielding pairs of two optional elements. Read more
    source§

    fn zip_eq<J>(self, other: J) -> ZipEq<Self, J::IntoIter> ⓘ
    where +iterator simultaneously, yielding pairs of two optional elements. Read more

    source§

    fn zip_eq<J>(self, other: J) -> ZipEq<Self, J::IntoIter> ⓘ
    where J: IntoIterator, Self: Sized,

    Create an iterator which iterates over both this and the specified -iterator simultaneously, yielding pairs of elements. Read more
    source§

    fn batching<B, F>(self, f: F) -> Batching<Self, F> ⓘ
    where +iterator simultaneously, yielding pairs of elements. Read more

    source§

    fn batching<B, F>(self, f: F) -> Batching<Self, F> ⓘ
    where F: FnMut(&mut Self) -> Option<B>, Self: Sized,

    A “meta iterator adaptor”. Its closure receives a reference to the iterator and may pick off as many elements as it likes, to produce the -next iterator element. Read more
    source§

    fn group_by<K, F>(self, key: F) -> GroupBy<K, Self, F>
    where +next iterator element. Read more

    source§

    fn chunk_by<K, F>(self, key: F) -> ChunkBy<K, Self, F>
    where Self: Sized, F: FnMut(&Self::Item) -> K, K: PartialEq,

    Return an iterable that can group iterator elements. Consecutive elements that map to the same key (“runs”), are assigned -to the same group. Read more
    source§

    fn chunks(self, size: usize) -> IntoChunks<Self>
    where - Self: Sized,

    Return an iterable that can chunk the iterator. Read more
    source§

    fn tuple_windows<T>(self) -> TupleWindows<Self, T> ⓘ
    where +to the same group. Read more

    source§

    fn group_by<K, F>(self, key: F) -> ChunkBy<K, Self, F>
    where + Self: Sized, + F: FnMut(&Self::Item) -> K, + K: PartialEq,

    👎Deprecated since 0.13.0: Use .chunk_by() instead
    See .chunk_by().
    source§

    fn chunks(self, size: usize) -> IntoChunks<Self>
    where + Self: Sized,

    Return an iterable that can chunk the iterator. Read more
    source§

    fn tuple_windows<T>(self) -> TupleWindows<Self, T> ⓘ
    where Self: Sized + Iterator<Item = T::Item>, T: HomogeneousTuple, T::Item: Clone,

    Return an iterator over all contiguous windows producing tuples of -a specific size (up to 12). Read more
    source§

    fn circular_tuple_windows<T>(self) -> CircularTupleWindows<Self, T> ⓘ
    where +a specific size (up to 12). Read more

    source§

    fn circular_tuple_windows<T>(self) -> CircularTupleWindows<Self, T> ⓘ
    where Self: Sized + Clone + Iterator<Item = T::Item> + ExactSizeIterator, T: TupleCollect + Clone, T::Item: Clone,

    Return an iterator over all windows, wrapping back to the first elements when the window would otherwise exceed the length of the -iterator, producing tuples of a specific size (up to 12). Read more
    source§

    fn tuples<T>(self) -> Tuples<Self, T> ⓘ
    where +iterator, producing tuples of a specific size (up to 12). Read more

    source§

    fn tuples<T>(self) -> Tuples<Self, T> ⓘ
    where Self: Sized + Iterator<Item = T::Item>, T: HomogeneousTuple,

    Return an iterator that groups the items in tuples of a specific size -(up to 12). Read more
    source§

    fn tee(self) -> (Tee<Self>, Tee<Self>)
    where +(up to 12). Read more

    source§

    fn tee(self) -> (Tee<Self>, Tee<Self>)
    where Self: Sized, Self::Item: Clone,

    Split into an iterator pair that both yield all elements from -the original iterator. Read more
    source§

    fn step(self, n: usize) -> Step<Self> ⓘ
    where - Self: Sized,

    👎Deprecated since 0.8.0: Use std .step_by() instead
    Return an iterator adaptor that steps n elements in the base iterator -for each iteration. Read more
    source§

    fn map_into<R>(self) -> MapInto<Self, R>
    where +the original iterator. Read more

    source§

    fn map_into<R>(self) -> MapInto<Self, R>
    where Self: Sized, - Self::Item: Into<R>,

    Convert each item of the iterator using the Into trait. Read more
    source§

    fn map_results<F, T, U, E>(self, f: F) -> MapOk<Self, F>
    where - Self: Iterator<Item = Result<T, E>> + Sized, - F: FnMut(T) -> U,

    👎Deprecated since 0.10.0: Use .map_ok() instead
    See .map_ok().
    source§

    fn map_ok<F, T, U, E>(self, f: F) -> MapOk<Self, F>
    where + Self::Item: Into<R>,

    Convert each item of the iterator using the Into trait. Read more
    source§

    fn map_ok<F, T, U, E>(self, f: F) -> MapOk<Self, F>
    where Self: Iterator<Item = Result<T, E>> + Sized, F: FnMut(T) -> U,

    Return an iterator adaptor that applies the provided closure to every Result::Ok value. Result::Err values are -unchanged. Read more
    source§

    fn filter_ok<F, T, E>(self, f: F) -> FilterOk<Self, F> ⓘ
    where +unchanged. Read more

    source§

    fn filter_ok<F, T, E>(self, f: F) -> FilterOk<Self, F> ⓘ
    where Self: Iterator<Item = Result<T, E>> + Sized, F: FnMut(&T) -> bool,

    Return an iterator adaptor that filters every Result::Ok value with the provided closure. Result::Err values are -unchanged. Read more
    source§

    fn filter_map_ok<F, T, U, E>(self, f: F) -> FilterMapOk<Self, F> ⓘ
    where +unchanged. Read more

    source§

    fn filter_map_ok<F, T, U, E>(self, f: F) -> FilterMapOk<Self, F> ⓘ
    where Self: Iterator<Item = Result<T, E>> + Sized, F: FnMut(T) -> Option<U>,

    Return an iterator adaptor that filters and transforms every Result::Ok value with the provided closure. Result::Err -values are unchanged. Read more
    source§

    fn flatten_ok<T, E>(self) -> FlattenOk<Self, T, E> ⓘ
    where +values are unchanged. Read more

    source§

    fn flatten_ok<T, E>(self) -> FlattenOk<Self, T, E> ⓘ
    where Self: Iterator<Item = Result<T, E>> + Sized, T: IntoIterator,

    Return an iterator adaptor that flattens every Result::Ok value into -a series of Result::Ok values. Result::Err values are unchanged. Read more
    source§

    fn process_results<F, T, E, R>(self, processor: F) -> Result<R, E>
    where +a series of Result::Ok values. Result::Err values are unchanged. Read more

    source§

    fn process_results<F, T, E, R>(self, processor: F) -> Result<R, E>
    where Self: Iterator<Item = Result<T, E>> + Sized, F: FnOnce(ProcessResults<'_, Self, E>) -> R,

    “Lift” a function of the values of the current iterator so as to process -an iterator of Result values instead. Read more
    source§

    fn merge<J>(self, other: J) -> Merge<Self, J::IntoIter>
    where +an iterator of Result values instead. Read more

    source§

    fn merge<J>(self, other: J) -> Merge<Self, J::IntoIter>
    where Self: Sized, Self::Item: PartialOrd, J: IntoIterator<Item = Self::Item>,

    Return an iterator adaptor that merges the two base iterators in ascending order. If both base iterators are sorted (ascending), the -result is sorted. Read more
    source§

    fn merge_by<J, F>(self, other: J, is_first: F) -> MergeBy<Self, J::IntoIter, F> ⓘ
    where +result is sorted. Read more

    source§

    fn merge_by<J, F>(self, other: J, is_first: F) -> MergeBy<Self, J::IntoIter, F> ⓘ
    where Self: Sized, J: IntoIterator<Item = Self::Item>, F: FnMut(&Self::Item, &Self::Item) -> bool,

    Return an iterator adaptor that merges the two base iterators in order. -This is much like .merge() but allows for a custom ordering. Read more
    source§

    fn merge_join_by<J, F, T>( +This is much like .merge() but allows for a custom ordering. Read more

    source§

    fn merge_join_by<J, F, T>( self, other: J, cmp_fn: F @@ -299,284 +300,295 @@ This is much like IntoIterator, F: FnMut(&Self::Item, &J::Item) -> T, Self: Sized,

    Create an iterator that merges items from both this and the specified -iterator in ascending order. Read more
    source§

    fn kmerge(self) -> KMerge<<Self::Item as IntoIterator>::IntoIter>
    where +iterator in ascending order. Read more

    source§

    fn kmerge(self) -> KMerge<<Self::Item as IntoIterator>::IntoIter>
    where Self: Sized, Self::Item: IntoIterator, <Self::Item as IntoIterator>::Item: PartialOrd,

    Return an iterator adaptor that flattens an iterator of iterators by -merging them in ascending order. Read more
    source§

    fn kmerge_by<F>( +merging them in ascending order. Read more

    source§

    fn kmerge_by<F>( self, first: F ) -> KMergeBy<<Self::Item as IntoIterator>::IntoIter, F> ⓘ
    where Self: Sized, Self::Item: IntoIterator, F: FnMut(&<Self::Item as IntoIterator>::Item, &<Self::Item as IntoIterator>::Item) -> bool,

    Return an iterator adaptor that flattens an iterator of iterators by -merging them according to the given closure. Read more
    source§

    fn cartesian_product<J>(self, other: J) -> Product<Self, J::IntoIter> ⓘ
    where +merging them according to the given closure. Read more

    source§

    fn cartesian_product<J>(self, other: J) -> Product<Self, J::IntoIter> ⓘ
    where Self: Sized, Self::Item: Clone, J: IntoIterator, J::IntoIter: Clone,

    Return an iterator adaptor that iterates over the cartesian product of -the element sets of two iterators self and J. Read more
    source§

    fn multi_cartesian_product( +the element sets of two iterators self and J. Read more

    source§

    fn multi_cartesian_product( self ) -> MultiProduct<<Self::Item as IntoIterator>::IntoIter> ⓘ
    where Self: Sized, Self::Item: IntoIterator, <Self::Item as IntoIterator>::IntoIter: Clone, <Self::Item as IntoIterator>::Item: Clone,

    Return an iterator adaptor that iterates over the cartesian product of -all subiterators returned by meta-iterator self. Read more
    source§

    fn coalesce<F>(self, f: F) -> Coalesce<Self, F>
    where +all subiterators returned by meta-iterator self. Read more

    source§

    fn coalesce<F>(self, f: F) -> Coalesce<Self, F>
    where Self: Sized, F: FnMut(Self::Item, Self::Item) -> Result<Self::Item, (Self::Item, Self::Item)>,

    Return an iterator adaptor that uses the passed-in closure to -optionally merge together consecutive elements. Read more
    source§

    fn dedup(self) -> Dedup<Self>
    where +optionally merge together consecutive elements. Read more

    source§

    fn dedup(self) -> Dedup<Self>
    where Self: Sized, Self::Item: PartialEq,

    Remove duplicates from sections of consecutive identical elements. -If the iterator is sorted, all elements will be unique. Read more
    source§

    fn dedup_by<Cmp>(self, cmp: Cmp) -> DedupBy<Self, Cmp>
    where +If the iterator is sorted, all elements will be unique. Read more

    source§

    fn dedup_by<Cmp>(self, cmp: Cmp) -> DedupBy<Self, Cmp>
    where Self: Sized, Cmp: FnMut(&Self::Item, &Self::Item) -> bool,

    Remove duplicates from sections of consecutive identical elements, determining equality using a comparison function. -If the iterator is sorted, all elements will be unique. Read more
    source§

    fn dedup_with_count(self) -> DedupWithCount<Self>
    where +If the iterator is sorted, all elements will be unique. Read more

    source§

    fn dedup_with_count(self) -> DedupWithCount<Self>
    where Self: Sized,

    Remove duplicates from sections of consecutive identical elements, while keeping a count of how many repeated elements were present. -If the iterator is sorted, all elements will be unique. Read more
    source§

    fn dedup_by_with_count<Cmp>(self, cmp: Cmp) -> DedupByWithCount<Self, Cmp>
    where +If the iterator is sorted, all elements will be unique. Read more

    source§

    fn dedup_by_with_count<Cmp>(self, cmp: Cmp) -> DedupByWithCount<Self, Cmp>
    where Self: Sized, Cmp: FnMut(&Self::Item, &Self::Item) -> bool,

    Remove duplicates from sections of consecutive identical elements, while keeping a count of how many repeated elements were present. This will determine equality using a comparison function. -If the iterator is sorted, all elements will be unique. Read more
    source§

    fn duplicates(self) -> Duplicates<Self>
    where +If the iterator is sorted, all elements will be unique. Read more

    source§

    fn duplicates(self) -> Duplicates<Self>
    where Self: Sized, Self::Item: Eq + Hash,

    Return an iterator adaptor that produces elements that appear more than once during the -iteration. Duplicates are detected using hash and equality. Read more
    source§

    fn duplicates_by<V, F>(self, f: F) -> DuplicatesBy<Self, V, F>
    where +iteration. Duplicates are detected using hash and equality. Read more

    source§

    fn duplicates_by<V, F>(self, f: F) -> DuplicatesBy<Self, V, F>
    where Self: Sized, V: Eq + Hash, F: FnMut(&Self::Item) -> V,

    Return an iterator adaptor that produces elements that appear more than once during the -iteration. Duplicates are detected using hash and equality. Read more
    source§

    fn unique(self) -> Unique<Self> ⓘ
    where +iteration. Duplicates are detected using hash and equality. Read more

    source§

    fn unique(self) -> Unique<Self> ⓘ
    where Self: Sized, Self::Item: Clone + Eq + Hash,

    Return an iterator adaptor that filters out elements that have already been produced once during the iteration. Duplicates -are detected using hash and equality. Read more
    source§

    fn unique_by<V, F>(self, f: F) -> UniqueBy<Self, V, F> ⓘ
    where +are detected using hash and equality. Read more

    source§

    fn unique_by<V, F>(self, f: F) -> UniqueBy<Self, V, F> ⓘ
    where Self: Sized, V: Eq + Hash, F: FnMut(&Self::Item) -> V,

    Return an iterator adaptor that filters out elements that have -already been produced once during the iteration. Read more
    source§

    fn peeking_take_while<F>(&mut self, accept: F) -> PeekingTakeWhile<'_, Self, F> ⓘ
    where +already been produced once during the iteration. Read more

    source§

    fn peeking_take_while<F>(&mut self, accept: F) -> PeekingTakeWhile<'_, Self, F> ⓘ
    where Self: Sized + PeekingNext, F: FnMut(&Self::Item) -> bool,

    Return an iterator adaptor that borrows from this iterator and -takes items while the closure accept returns true. Read more
    source§

    fn take_while_ref<F>(&mut self, accept: F) -> TakeWhileRef<'_, Self, F> ⓘ
    where +takes items while the closure accept returns true. Read more

    source§

    fn take_while_ref<F>(&mut self, accept: F) -> TakeWhileRef<'_, Self, F> ⓘ
    where Self: Clone, F: FnMut(&Self::Item) -> bool,

    Return an iterator adaptor that borrows from a Clone-able iterator -to only pick off elements while the predicate accept returns true. Read more
    source§

    fn take_while_inclusive<F>(self, accept: F) -> TakeWhileInclusive<Self, F> ⓘ
    where +to only pick off elements while the predicate accept returns true. Read more

    source§

    fn take_while_inclusive<F>(self, accept: F) -> TakeWhileInclusive<Self, F> ⓘ
    where Self: Sized, F: FnMut(&Self::Item) -> bool,

    Returns an iterator adaptor that consumes elements while the given predicate is true, including the element for which the predicate -first returned false. Read more
    source§

    fn while_some<A>(self) -> WhileSome<Self> ⓘ
    where +first returned false. Read more

    source§

    fn while_some<A>(self) -> WhileSome<Self> ⓘ
    where Self: Sized + Iterator<Item = Option<A>>,

    Return an iterator adaptor that filters Option<A> iterator elements -and produces A. Stops on the first None encountered. Read more
    source§

    fn tuple_combinations<T>(self) -> TupleCombinations<Self, T> ⓘ
    where +and produces A. Stops on the first None encountered. Read more

    source§

    fn tuple_combinations<T>(self) -> TupleCombinations<Self, T> ⓘ
    where Self: Sized + Clone, Self::Item: Clone, T: HasCombination<Self>,

    Return an iterator adaptor that iterates over the combinations of the -elements from an iterator. Read more
    source§

    fn combinations(self, k: usize) -> Combinations<Self> ⓘ
    where +elements from an iterator. Read more

    source§

    fn combinations(self, k: usize) -> Combinations<Self> ⓘ
    where Self: Sized, Self::Item: Clone,

    Return an iterator adaptor that iterates over the k-length combinations of -the elements from an iterator. Read more
    source§

    fn combinations_with_replacement( +the elements from an iterator. Read more

    source§

    fn combinations_with_replacement( self, k: usize ) -> CombinationsWithReplacement<Self> ⓘ
    where Self: Sized, Self::Item: Clone,

    Return an iterator that iterates over the k-length combinations of -the elements from an iterator, with replacement. Read more
    source§

    fn permutations(self, k: usize) -> Permutations<Self> ⓘ
    where +the elements from an iterator, with replacement. Read more

    source§

    fn permutations(self, k: usize) -> Permutations<Self> ⓘ
    where Self: Sized, Self::Item: Clone,

    Return an iterator adaptor that iterates over all k-permutations of the -elements from an iterator. Read more
    source§

    fn powerset(self) -> Powerset<Self> ⓘ
    where +elements from an iterator. Read more

    source§

    fn powerset(self) -> Powerset<Self> ⓘ
    where Self: Sized, Self::Item: Clone,

    Return an iterator that iterates through the powerset of the elements from an -iterator. Read more
    source§

    fn pad_using<F>(self, min: usize, f: F) -> PadUsing<Self, F> ⓘ
    where +iterator. Read more

    source§

    fn pad_using<F>(self, min: usize, f: F) -> PadUsing<Self, F> ⓘ
    where Self: Sized, F: FnMut(usize) -> Self::Item,

    Return an iterator adaptor that pads the sequence to a minimum length of -min by filling missing elements using a closure f. Read more
    source§

    fn with_position(self) -> WithPosition<Self> ⓘ
    where +min by filling missing elements using a closure f. Read more

    source§

    fn with_position(self) -> WithPosition<Self> ⓘ
    where Self: Sized,

    Return an iterator adaptor that combines each element with a Position to -ease special-case handling of the first or last elements. Read more
    source§

    fn positions<P>(self, predicate: P) -> Positions<Self, P> ⓘ
    where +ease special-case handling of the first or last elements. Read more

    source§

    fn positions<P>(self, predicate: P) -> Positions<Self, P> ⓘ
    where Self: Sized, P: FnMut(Self::Item) -> bool,

    Return an iterator adaptor that yields the indices of all elements -satisfying a predicate, counted from the start of the iterator. Read more
    source§

    fn update<F>(self, updater: F) -> Update<Self, F> ⓘ
    where +satisfying a predicate, counted from the start of the iterator. Read more

    source§

    fn update<F>(self, updater: F) -> Update<Self, F> ⓘ
    where Self: Sized, F: FnMut(&mut Self::Item),

    Return an iterator adaptor that applies a mutating function -to each element before yielding it. Read more
    source§

    fn next_tuple<T>(&mut self) -> Option<T>
    where +to each element before yielding it. Read more

    source§

    fn next_tuple<T>(&mut self) -> Option<T>
    where Self: Sized + Iterator<Item = T::Item>, T: HomogeneousTuple,

    Advances the iterator and returns the next items grouped in a tuple of -a specific size (up to 12). Read more
    source§

    fn collect_tuple<T>(self) -> Option<T>
    where +a specific size (up to 12). Read more

    source§

    fn collect_tuple<T>(self) -> Option<T>
    where Self: Sized + Iterator<Item = T::Item>, T: HomogeneousTuple,

    Collects all items from the iterator into a tuple of a specific size -(up to 12). Read more
    source§

    fn find_position<P>(&mut self, pred: P) -> Option<(usize, Self::Item)>
    where - P: FnMut(&Self::Item) -> bool,

    Find the position and value of the first element satisfying a predicate. Read more
    source§

    fn find_or_last<P>(self, predicate: P) -> Option<Self::Item>
    where +(up to 12). Read more

    source§

    fn find_position<P>(&mut self, pred: P) -> Option<(usize, Self::Item)>
    where + P: FnMut(&Self::Item) -> bool,

    Find the position and value of the first element satisfying a predicate. Read more
    source§

    fn find_or_last<P>(self, predicate: P) -> Option<Self::Item>
    where Self: Sized, - P: FnMut(&Self::Item) -> bool,

    Find the value of the first element satisfying a predicate or return the last element, if any. Read more
    source§

    fn find_or_first<P>(self, predicate: P) -> Option<Self::Item>
    where + P: FnMut(&Self::Item) -> bool,

    Find the value of the first element satisfying a predicate or return the last element, if any. Read more
    source§

    fn find_or_first<P>(self, predicate: P) -> Option<Self::Item>
    where Self: Sized, - P: FnMut(&Self::Item) -> bool,

    Find the value of the first element satisfying a predicate or return the first element, if any. Read more
    source§

    fn contains<Q>(&mut self, query: &Q) -> bool
    where + P: FnMut(&Self::Item) -> bool,

    Find the value of the first element satisfying a predicate or return the first element, if any. Read more
    source§

    fn contains<Q>(&mut self, query: &Q) -> bool
    where Self: Sized, Self::Item: Borrow<Q>, - Q: PartialEq,

    Returns true if the given item is present in this iterator. Read more
    source§

    fn all_equal(&mut self) -> bool
    where + Q: PartialEq,

    Returns true if the given item is present in this iterator. Read more
    source§

    fn all_equal(&mut self) -> bool
    where Self: Sized, - Self::Item: PartialEq,

    Check whether all elements compare equal. Read more
    source§

    fn all_equal_value( + Self::Item: PartialEq,

    Check whether all elements compare equal. Read more
    source§

    fn all_equal_value( &mut self ) -> Result<Self::Item, Option<(Self::Item, Self::Item)>>
    where Self: Sized, Self::Item: PartialEq,

    If there are elements and they are all equal, return a single copy of that element. If there are no elements, return an Error containing None. If there are elements and they are not all equal, return a tuple containing the first -two non-equal elements found. Read more
    source§

    fn all_unique(&mut self) -> bool
    where +two non-equal elements found. Read more

    source§

    fn all_unique(&mut self) -> bool
    where Self: Sized, - Self::Item: Eq + Hash,

    Check whether all elements are unique (non equal). Read more
    source§

    fn dropping(self, n: usize) -> Self
    where + Self::Item: Eq + Hash,

    Check whether all elements are unique (non equal). Read more
    source§

    fn dropping(self, n: usize) -> Self
    where Self: Sized,

    Consume the first n elements from the iterator eagerly, -and return the same iterator again. Read more
    source§

    fn dropping_back(self, n: usize) -> Self
    where +and return the same iterator again. Read more

    source§

    fn dropping_back(self, n: usize) -> Self
    where Self: Sized + DoubleEndedIterator,

    Consume the last n elements from the iterator eagerly, -and return the same iterator again. Read more
    source§

    fn foreach<F>(self, f: F)
    where - F: FnMut(Self::Item), - Self: Sized,

    👎Deprecated since 0.8.0: Use .for_each() instead
    Run the closure f eagerly on each element of the iterator. Read more
    source§

    fn concat(self) -> Self::Item
    where +and return the same iterator again. Read more

    source§

    fn concat(self) -> Self::Item
    where Self: Sized, - Self::Item: Extend<<<Self as Iterator>::Item as IntoIterator>::Item> + IntoIterator + Default,

    Combine all an iterator’s elements into one element by using Extend. Read more
    source§

    fn collect_vec(self) -> Vec<Self::Item>
    where + Self::Item: Extend<<<Self as Iterator>::Item as IntoIterator>::Item> + IntoIterator + Default,

    Combine all an iterator’s elements into one element by using Extend. Read more
    source§

    fn collect_vec(self) -> Vec<Self::Item>
    where Self: Sized,

    .collect_vec() is simply a type specialization of Iterator::collect, -for convenience.
    source§

    fn try_collect<T, U, E>(self) -> Result<U, E>
    where +for convenience.

    source§

    fn try_collect<T, U, E>(self) -> Result<U, E>
    where Self: Sized + Iterator<Item = Result<T, E>>, Result<U, E>: FromIterator<Result<T, E>>,

    .try_collect() is more convenient way of writing -.collect::<Result<_, _>>() Read more
    source§

    fn set_from<'a, A: 'a, J>(&mut self, from: J) -> usize
    where +.collect::<Result<_, _>>() Read more

    source§

    fn set_from<'a, A: 'a, J>(&mut self, from: J) -> usize
    where Self: Iterator<Item = &'a mut A>, J: IntoIterator<Item = A>,

    Assign to each reference in self from the from iterator, -stopping at the shortest of the two iterators. Read more
    source§

    fn join(&mut self, sep: &str) -> String
    where - Self::Item: Display,

    Combine all iterator elements into one String, separated by sep. Read more
    source§

    fn format(self, sep: &str) -> Format<'_, Self>
    where - Self: Sized,

    Format all iterator elements, separated by sep. Read more
    source§

    fn format_with<F>(self, sep: &str, format: F) -> FormatWith<'_, Self, F>
    where +stopping at the shortest of the two iterators. Read more

    source§

    fn join(&mut self, sep: &str) -> String
    where + Self::Item: Display,

    Combine all iterator elements into one String, separated by sep. Read more
    source§

    fn format(self, sep: &str) -> Format<'_, Self>
    where + Self: Sized,

    Format all iterator elements, separated by sep. Read more
    source§

    fn format_with<F>(self, sep: &str, format: F) -> FormatWith<'_, Self, F>
    where Self: Sized, - F: FnMut(Self::Item, &mut dyn FnMut(&dyn Display) -> Result) -> Result,

    Format all iterator elements, separated by sep. Read more
    source§

    fn fold_results<A, E, B, F>(&mut self, start: B, f: F) -> Result<B, E>
    where + F: FnMut(Self::Item, &mut dyn FnMut(&dyn Display) -> Result) -> Result,

    Format all iterator elements, separated by sep. Read more
    source§

    fn fold_ok<A, E, B, F>(&mut self, start: B, f: F) -> Result<B, E>
    where Self: Iterator<Item = Result<A, E>>, - F: FnMut(B, A) -> B,

    👎Deprecated since 0.10.0: Use .fold_ok() instead
    See .fold_ok().
    source§

    fn fold_ok<A, E, B, F>(&mut self, start: B, f: F) -> Result<B, E>
    where - Self: Iterator<Item = Result<A, E>>, - F: FnMut(B, A) -> B,

    Fold Result values from an iterator. Read more
    source§

    fn fold_options<A, B, F>(&mut self, start: B, f: F) -> Option<B>
    where + F: FnMut(B, A) -> B,

    Fold Result values from an iterator. Read more
    source§

    fn fold_options<A, B, F>(&mut self, start: B, f: F) -> Option<B>
    where Self: Iterator<Item = Option<A>>, - F: FnMut(B, A) -> B,

    Fold Option values from an iterator. Read more
    source§

    fn fold1<F>(self, f: F) -> Option<Self::Item>
    where + F: FnMut(B, A) -> B,

    Fold Option values from an iterator. Read more
    source§

    fn fold1<F>(self, f: F) -> Option<Self::Item>
    where F: FnMut(Self::Item, Self::Item) -> Self::Item, - Self: Sized,

    👎Deprecated since 0.10.2: Use Iterator::reduce instead
    Accumulator of the elements in the iterator. Read more
    source§

    fn tree_fold1<F>(self, f: F) -> Option<Self::Item>
    where + Self: Sized,

    👎Deprecated since 0.10.2: Use Iterator::reduce instead
    Accumulator of the elements in the iterator. Read more
    source§

    fn tree_reduce<F>(self, f: F) -> Option<Self::Item>
    where F: FnMut(Self::Item, Self::Item) -> Self::Item, - Self: Sized,

    Accumulate the elements in the iterator in a tree-like manner. Read more
    source§

    fn fold_while<B, F>(&mut self, init: B, f: F) -> FoldWhile<B>
    where + Self: Sized,

    Accumulate the elements in the iterator in a tree-like manner. Read more
    source§

    fn tree_fold1<F>(self, f: F) -> Option<Self::Item>
    where + F: FnMut(Self::Item, Self::Item) -> Self::Item, + Self: Sized,

    👎Deprecated since 0.13.0: Use .tree_reduce() instead
    See .tree_reduce().
    source§

    fn fold_while<B, F>(&mut self, init: B, f: F) -> FoldWhile<B>
    where Self: Sized, - F: FnMut(B, Self::Item) -> FoldWhile<B>,

    An iterator method that applies a function, producing a single, final value. Read more
    source§

    fn sum1<S>(self) -> Option<S>
    where + F: FnMut(B, Self::Item) -> FoldWhile<B>,

    An iterator method that applies a function, producing a single, final value. Read more
    source§

    fn sum1<S>(self) -> Option<S>
    where Self: Sized, - S: Sum<Self::Item>,

    Iterate over the entire iterator and add all the elements. Read more
    source§

    fn product1<P>(self) -> Option<P>
    where + S: Sum<Self::Item>,

    Iterate over the entire iterator and add all the elements. Read more
    source§

    fn product1<P>(self) -> Option<P>
    where Self: Sized, - P: Product<Self::Item>,

    Iterate over the entire iterator and multiply all the elements. Read more
    source§

    fn sorted_unstable(self) -> IntoIter<Self::Item> ⓘ
    where + P: Product<Self::Item>,

    Iterate over the entire iterator and multiply all the elements. Read more
    source§

    fn sorted_unstable(self) -> IntoIter<Self::Item> ⓘ
    where Self: Sized, - Self::Item: Ord,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_unstable_by<F>(self, cmp: F) -> IntoIter<Self::Item> ⓘ
    where + Self::Item: Ord,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_unstable_by<F>(self, cmp: F) -> IntoIter<Self::Item> ⓘ
    where Self: Sized, - F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_unstable_by_key<K, F>(self, f: F) -> IntoIter<Self::Item> ⓘ
    where + F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_unstable_by_key<K, F>(self, f: F) -> IntoIter<Self::Item> ⓘ
    where Self: Sized, K: Ord, - F: FnMut(&Self::Item) -> K,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted(self) -> IntoIter<Self::Item> ⓘ
    where + F: FnMut(&Self::Item) -> K,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted(self) -> IntoIter<Self::Item> ⓘ
    where Self: Sized, - Self::Item: Ord,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_by<F>(self, cmp: F) -> IntoIter<Self::Item> ⓘ
    where + Self::Item: Ord,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_by<F>(self, cmp: F) -> IntoIter<Self::Item> ⓘ
    where Self: Sized, - F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_by_key<K, F>(self, f: F) -> IntoIter<Self::Item> ⓘ
    where + F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_by_key<K, F>(self, f: F) -> IntoIter<Self::Item> ⓘ
    where Self: Sized, K: Ord, - F: FnMut(&Self::Item) -> K,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_by_cached_key<K, F>(self, f: F) -> IntoIter<Self::Item> ⓘ
    where + F: FnMut(&Self::Item) -> K,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_by_cached_key<K, F>(self, f: F) -> IntoIter<Self::Item> ⓘ
    where Self: Sized, K: Ord, F: FnMut(&Self::Item) -> K,

    Sort all iterator elements into a new iterator in ascending order. The key function is -called exactly once per key. Read more
    source§

    fn k_smallest(self, k: usize) -> IntoIter<Self::Item> ⓘ
    where +called exactly once per key. Read more

    source§

    fn k_smallest(self, k: usize) -> IntoIter<Self::Item> ⓘ
    where Self: Sized, - Self::Item: Ord,

    Sort the k smallest elements into a new iterator, in ascending order. Read more
    source§

    fn partition_map<A, B, F, L, R>(self, predicate: F) -> (A, B)
    where + Self::Item: Ord,

    Sort the k smallest elements into a new iterator, in ascending order. Read more
    source§

    fn k_smallest_by<F>(self, k: usize, cmp: F) -> IntoIter<Self::Item> ⓘ
    where + Self: Sized, + F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Sort the k smallest elements into a new iterator using the provided comparison. Read more
    source§

    fn k_smallest_by_key<F, K>(self, k: usize, key: F) -> IntoIter<Self::Item> ⓘ
    where + Self: Sized, + F: FnMut(&Self::Item) -> K, + K: Ord,

    Return the elements producing the k smallest outputs of the provided function. Read more
    source§

    fn k_largest(self, k: usize) -> IntoIter<Self::Item> ⓘ
    where + Self: Sized, + Self::Item: Ord,

    Sort the k largest elements into a new iterator, in descending order. Read more
    source§

    fn k_largest_by<F>(self, k: usize, cmp: F) -> IntoIter<Self::Item> ⓘ
    where + Self: Sized, + F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Sort the k largest elements into a new iterator using the provided comparison. Read more
    source§

    fn k_largest_by_key<F, K>(self, k: usize, key: F) -> IntoIter<Self::Item> ⓘ
    where + Self: Sized, + F: FnMut(&Self::Item) -> K, + K: Ord,

    Return the elements producing the k largest outputs of the provided function. Read more
    source§

    fn tail(self, n: usize) -> IntoIter<Self::Item> ⓘ
    where + Self: Sized,

    Consumes the iterator and return an iterator of the last n elements. Read more
    source§

    fn partition_map<A, B, F, L, R>(self, predicate: F) -> (A, B)
    where Self: Sized, F: FnMut(Self::Item) -> Either<L, R>, A: Default + Extend<L>, B: Default + Extend<R>,

    Collect all iterator elements into one of two partitions. Unlike Iterator::partition, each partition may -have a distinct type. Read more
    source§

    fn partition_result<A, B, T, E>(self) -> (A, B)
    where +have a distinct type. Read more

    source§

    fn partition_result<A, B, T, E>(self) -> (A, B)
    where Self: Iterator<Item = Result<T, E>> + Sized, A: Default + Extend<T>, B: Default + Extend<E>,

    Partition a sequence of Results into one list of all the Ok elements -and another list of all the Err elements. Read more
    source§

    fn into_group_map<K, V>(self) -> HashMap<K, Vec<V>>
    where +and another list of all the Err elements. Read more

    source§

    fn into_group_map<K, V>(self) -> HashMap<K, Vec<V>>
    where Self: Iterator<Item = (K, V)> + Sized, K: Hash + Eq,

    Return a HashMap of keys mapped to Vecs of values. Keys and values -are taken from (Key, Value) tuple pairs yielded by the input iterator. Read more
    source§

    fn into_group_map_by<K, V, F>(self, f: F) -> HashMap<K, Vec<V>>
    where +are taken from (Key, Value) tuple pairs yielded by the input iterator. Read more

    source§

    fn into_group_map_by<K, V, F>(self, f: F) -> HashMap<K, Vec<V>>
    where Self: Iterator<Item = V> + Sized, K: Hash + Eq, - F: Fn(&V) -> K,

    Return an Iterator on a HashMap. Keys mapped to Vecs of values. The key is specified -in the closure. Read more
    source§

    fn into_grouping_map<K, V>(self) -> GroupingMap<Self>
    where + F: FnMut(&V) -> K,

    Return an Iterator on a HashMap. Keys mapped to Vecs of values. The key is specified +in the closure. Read more
    source§

    fn into_grouping_map<K, V>(self) -> GroupingMap<Self>
    where Self: Iterator<Item = (K, V)> + Sized, K: Hash + Eq,

    Constructs a GroupingMap to be used later with one of the efficient -group-and-fold operations it allows to perform. Read more
    source§

    fn into_grouping_map_by<K, V, F>(self, key_mapper: F) -> GroupingMapBy<Self, F>
    where +group-and-fold operations it allows to perform. Read more

    source§

    fn into_grouping_map_by<K, V, F>(self, key_mapper: F) -> GroupingMapBy<Self, F>
    where Self: Iterator<Item = V> + Sized, K: Hash + Eq, F: FnMut(&V) -> K,

    Constructs a GroupingMap to be used later with one of the efficient -group-and-fold operations it allows to perform. Read more
    source§

    fn min_set(self) -> Vec<Self::Item>
    where +group-and-fold operations it allows to perform. Read more

    source§

    fn min_set(self) -> Vec<Self::Item>
    where Self: Sized, - Self::Item: Ord,

    Return all minimum elements of an iterator. Read more
    source§

    fn min_set_by<F>(self, compare: F) -> Vec<Self::Item>
    where + Self::Item: Ord,

    Return all minimum elements of an iterator. Read more
    source§

    fn min_set_by<F>(self, compare: F) -> Vec<Self::Item>
    where Self: Sized, F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Return all minimum elements of an iterator, as determined by -the specified function. Read more
    source§

    fn min_set_by_key<K, F>(self, key: F) -> Vec<Self::Item>
    where +the specified function. Read more

    source§

    fn min_set_by_key<K, F>(self, key: F) -> Vec<Self::Item>
    where Self: Sized, K: Ord, F: FnMut(&Self::Item) -> K,

    Return all minimum elements of an iterator, as determined by -the specified function. Read more
    source§

    fn max_set(self) -> Vec<Self::Item>
    where +the specified function. Read more

    source§

    fn max_set(self) -> Vec<Self::Item>
    where Self: Sized, - Self::Item: Ord,

    Return all maximum elements of an iterator. Read more
    source§

    fn max_set_by<F>(self, compare: F) -> Vec<Self::Item>
    where + Self::Item: Ord,

    Return all maximum elements of an iterator. Read more
    source§

    fn max_set_by<F>(self, compare: F) -> Vec<Self::Item>
    where Self: Sized, F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Return all maximum elements of an iterator, as determined by -the specified function. Read more
    source§

    fn max_set_by_key<K, F>(self, key: F) -> Vec<Self::Item>
    where +the specified function. Read more

    source§

    fn max_set_by_key<K, F>(self, key: F) -> Vec<Self::Item>
    where Self: Sized, K: Ord, F: FnMut(&Self::Item) -> K,

    Return all maximum elements of an iterator, as determined by -the specified function. Read more
    source§

    fn minmax(self) -> MinMaxResult<Self::Item>
    where +the specified function. Read more

    source§

    fn minmax(self) -> MinMaxResult<Self::Item>
    where Self: Sized, - Self::Item: PartialOrd,

    Return the minimum and maximum elements in the iterator. Read more
    source§

    fn minmax_by_key<K, F>(self, key: F) -> MinMaxResult<Self::Item>
    where + Self::Item: PartialOrd,

    Return the minimum and maximum elements in the iterator. Read more
    source§

    fn minmax_by_key<K, F>(self, key: F) -> MinMaxResult<Self::Item>
    where Self: Sized, K: PartialOrd, F: FnMut(&Self::Item) -> K,

    Return the minimum and maximum element of an iterator, as determined by -the specified function. Read more
    source§

    fn minmax_by<F>(self, compare: F) -> MinMaxResult<Self::Item>
    where +the specified function. Read more

    source§

    fn minmax_by<F>(self, compare: F) -> MinMaxResult<Self::Item>
    where Self: Sized, F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Return the minimum and maximum element of an iterator, as determined by -the specified comparison function. Read more
    source§

    fn position_max(self) -> Option<usize>
    where +the specified comparison function. Read more

    source§

    fn position_max(self) -> Option<usize>
    where Self: Sized, - Self::Item: Ord,

    Return the position of the maximum element in the iterator. Read more
    source§

    fn position_max_by_key<K, F>(self, key: F) -> Option<usize>
    where + Self::Item: Ord,

    Return the position of the maximum element in the iterator. Read more
    source§

    fn position_max_by_key<K, F>(self, key: F) -> Option<usize>
    where Self: Sized, K: Ord, F: FnMut(&Self::Item) -> K,

    Return the position of the maximum element in the iterator, as -determined by the specified function. Read more
    source§

    fn position_max_by<F>(self, compare: F) -> Option<usize>
    where +determined by the specified function. Read more

    source§

    fn position_max_by<F>(self, compare: F) -> Option<usize>
    where Self: Sized, F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Return the position of the maximum element in the iterator, as -determined by the specified comparison function. Read more
    source§

    fn position_min(self) -> Option<usize>
    where +determined by the specified comparison function. Read more

    source§

    fn position_min(self) -> Option<usize>
    where Self: Sized, - Self::Item: Ord,

    Return the position of the minimum element in the iterator. Read more
    source§

    fn position_min_by_key<K, F>(self, key: F) -> Option<usize>
    where + Self::Item: Ord,

    Return the position of the minimum element in the iterator. Read more
    source§

    fn position_min_by_key<K, F>(self, key: F) -> Option<usize>
    where Self: Sized, K: Ord, F: FnMut(&Self::Item) -> K,

    Return the position of the minimum element in the iterator, as -determined by the specified function. Read more
    source§

    fn position_min_by<F>(self, compare: F) -> Option<usize>
    where +determined by the specified function. Read more

    source§

    fn position_min_by<F>(self, compare: F) -> Option<usize>
    where Self: Sized, F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Return the position of the minimum element in the iterator, as -determined by the specified comparison function. Read more
    source§

    fn position_minmax(self) -> MinMaxResult<usize>
    where +determined by the specified comparison function. Read more

    source§

    fn position_minmax(self) -> MinMaxResult<usize>
    where Self: Sized, Self::Item: PartialOrd,

    Return the positions of the minimum and maximum elements in -the iterator. Read more
    source§

    fn position_minmax_by_key<K, F>(self, key: F) -> MinMaxResult<usize>
    where +the iterator. Read more

    source§

    fn position_minmax_by_key<K, F>(self, key: F) -> MinMaxResult<usize>
    where Self: Sized, K: PartialOrd, F: FnMut(&Self::Item) -> K,

    Return the postions of the minimum and maximum elements of an -iterator, as determined by the specified function. Read more
    source§

    fn position_minmax_by<F>(self, compare: F) -> MinMaxResult<usize>
    where +iterator, as determined by the specified function. Read more

    source§

    fn position_minmax_by<F>(self, compare: F) -> MinMaxResult<usize>
    where Self: Sized, F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Return the postions of the minimum and maximum elements of an -iterator, as determined by the specified comparison function. Read more
    source§

    fn exactly_one(self) -> Result<Self::Item, ExactlyOneError<Self>>
    where +iterator, as determined by the specified comparison function. Read more

    source§

    fn exactly_one(self) -> Result<Self::Item, ExactlyOneError<Self>>
    where Self: Sized,

    If the iterator yields exactly one element, that element will be returned, otherwise an error will be returned containing an iterator that has the same output as the input -iterator. Read more
    source§

    fn at_most_one(self) -> Result<Option<Self::Item>, ExactlyOneError<Self>>
    where - Self: Sized,

    If the iterator yields no elements, Ok(None) will be returned. If the iterator yields +iterator. Read more
    source§

    fn at_most_one(self) -> Result<Option<Self::Item>, ExactlyOneError<Self>>
    where + Self: Sized,

    If the iterator yields no elements, Ok(None) will be returned. If the iterator yields exactly one element, that element will be returned, otherwise an error will be returned -containing an iterator that has the same output as the input iterator. Read more
    source§

    fn multipeek(self) -> MultiPeek<Self> ⓘ
    where +containing an iterator that has the same output as the input iterator. Read more

    source§

    fn multipeek(self) -> MultiPeek<Self> ⓘ
    where Self: Sized,

    An iterator adaptor that allows the user to peek at multiple .next() -values without advancing the base iterator. Read more
    source§

    fn counts(self) -> HashMap<Self::Item, usize>
    where +values without advancing the base iterator. Read more

    source§

    fn counts(self) -> HashMap<Self::Item, usize>
    where Self: Sized, Self::Item: Eq + Hash,

    Collect the items in this iterator and return a HashMap which contains each item that appears in the iterator and the number -of times it appears. Read more
    source§

    fn counts_by<K, F>(self, f: F) -> HashMap<K, usize>
    where +of times it appears. Read more

    source§

    fn counts_by<K, F>(self, f: F) -> HashMap<K, usize>
    where Self: Sized, K: Eq + Hash, F: FnMut(Self::Item) -> K,

    Collect the items in this iterator and return a HashMap which contains each item that appears in the iterator and the number of times it appears, -determining identity using a keying function. Read more
    source§

    fn multiunzip<FromI>(self) -> FromI
    where - Self: Sized + MultiUnzip<FromI>,

    Converts an iterator of tuples into a tuple of containers. Read more
    source§

    fn try_len(&self) -> Result<usize, (usize, Option<usize>)>

    Returns the length of the iterator if one exists. +determining identity using a keying function. Read more
    source§

    fn multiunzip<FromI>(self) -> FromI
    where + Self: Sized + MultiUnzip<FromI>,

    Converts an iterator of tuples into a tuple of containers. Read more
    source§

    fn try_len(&self) -> Result<usize, (usize, Option<usize>)>

    Returns the length of the iterator if one exists. Otherwise return self.size_hint(). Read more
    source§

    impl<IT> MultiUnzip<()> for IT
    where IT: Iterator<Item = ()>,

    source§

    fn multiunzip(self)

    Unzip this iterator into multiple collections.
    source§

    impl<IT, A, FromA> MultiUnzip<(FromA,)> for IT
    where IT: Iterator<Item = (A,)>, @@ -678,4 +690,4 @@ Otherwise return self.size_hint(). (FromA, FromB, FromC, FromD, FromE, FromF, FromG, FromH, FromI, FromJ, FromK, FromL)

    Unzip this iterator into multiple collections.
    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 + 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/itertools/structs/struct.Permutations.html b/itertools/structs/struct.Permutations.html index d655f27f5..60c36421f 100644 --- a/itertools/structs/struct.Permutations.html +++ b/itertools/structs/struct.Permutations.html @@ -1,4 +1,4 @@ -Permutations in itertools::structs - Rust
    +Permutations in itertools::structs - Rust

    Struct itertools::structs::Permutations

    source · 
    pub struct Permutations<I: Iterator> { /* private fields */ }
    Expand description

    An iterator adaptor that iterates through all the k-permutations of the elements from an iterator.

    See .permutations() for @@ -214,86 +214,87 @@ otherwise. Right variant of Either<Self, Self> otherwise. Read more

    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> Itertools for T
    where - T: Iterator + ?Sized,

    source§

    fn interleave<J>(self, other: J) -> Interleave<Self, J::IntoIter> ⓘ
    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> Itertools for T
    where + T: Iterator + ?Sized,

    source§

    fn interleave<J>(self, other: J) -> Interleave<Self, J::IntoIter> ⓘ
    where J: IntoIterator<Item = Self::Item>, - Self: Sized,

    Alternate elements from two iterators until both have run out. Read more
    source§

    fn interleave_shortest<J>( + Self: Sized,

    Alternate elements from two iterators until both have run out. Read more
    source§

    fn interleave_shortest<J>( self, other: J ) -> InterleaveShortest<Self, J::IntoIter> ⓘ
    where J: IntoIterator<Item = Self::Item>, Self: Sized,

    Alternate elements from two iterators until at least one of them has run -out. Read more
    source§

    fn intersperse(self, element: Self::Item) -> Intersperse<Self>
    where +out. Read more

    source§

    fn intersperse(self, element: Self::Item) -> Intersperse<Self>
    where Self: Sized, Self::Item: Clone,

    An iterator adaptor to insert a particular value -between each element of the adapted iterator. Read more
    source§

    fn intersperse_with<F>(self, element: F) -> IntersperseWith<Self, F> ⓘ
    where +between each element of the adapted iterator. Read more

    source§

    fn intersperse_with<F>(self, element: F) -> IntersperseWith<Self, F> ⓘ
    where Self: Sized, F: FnMut() -> Self::Item,

    An iterator adaptor to insert a particular value created by a function -between each element of the adapted iterator. Read more
    source§

    fn zip_longest<J>(self, other: J) -> ZipLongest<Self, J::IntoIter> ⓘ
    where +between each element of the adapted iterator. Read more

    source§

    fn get<R>(self, index: R) -> R::Output
    where + Self: Sized, + R: IteratorIndex<Self>,

    Returns an iterator over a subsection of the iterator. Read more
    source§

    fn zip_longest<J>(self, other: J) -> ZipLongest<Self, J::IntoIter> ⓘ
    where J: IntoIterator, Self: Sized,

    Create an iterator which iterates over both this and the specified -iterator simultaneously, yielding pairs of two optional elements. Read more
    source§

    fn zip_eq<J>(self, other: J) -> ZipEq<Self, J::IntoIter> ⓘ
    where +iterator simultaneously, yielding pairs of two optional elements. Read more

    source§

    fn zip_eq<J>(self, other: J) -> ZipEq<Self, J::IntoIter> ⓘ
    where J: IntoIterator, Self: Sized,

    Create an iterator which iterates over both this and the specified -iterator simultaneously, yielding pairs of elements. Read more
    source§

    fn batching<B, F>(self, f: F) -> Batching<Self, F> ⓘ
    where +iterator simultaneously, yielding pairs of elements. Read more

    source§

    fn batching<B, F>(self, f: F) -> Batching<Self, F> ⓘ
    where F: FnMut(&mut Self) -> Option<B>, Self: Sized,

    A “meta iterator adaptor”. Its closure receives a reference to the iterator and may pick off as many elements as it likes, to produce the -next iterator element. Read more
    source§

    fn group_by<K, F>(self, key: F) -> GroupBy<K, Self, F>
    where +next iterator element. Read more

    source§

    fn chunk_by<K, F>(self, key: F) -> ChunkBy<K, Self, F>
    where Self: Sized, F: FnMut(&Self::Item) -> K, K: PartialEq,

    Return an iterable that can group iterator elements. Consecutive elements that map to the same key (“runs”), are assigned -to the same group. Read more
    source§

    fn chunks(self, size: usize) -> IntoChunks<Self>
    where - Self: Sized,

    Return an iterable that can chunk the iterator. Read more
    source§

    fn tuple_windows<T>(self) -> TupleWindows<Self, T> ⓘ
    where +to the same group. Read more

    source§

    fn group_by<K, F>(self, key: F) -> ChunkBy<K, Self, F>
    where + Self: Sized, + F: FnMut(&Self::Item) -> K, + K: PartialEq,

    👎Deprecated since 0.13.0: Use .chunk_by() instead
    See .chunk_by().
    source§

    fn chunks(self, size: usize) -> IntoChunks<Self>
    where + Self: Sized,

    Return an iterable that can chunk the iterator. Read more
    source§

    fn tuple_windows<T>(self) -> TupleWindows<Self, T> ⓘ
    where Self: Sized + Iterator<Item = T::Item>, T: HomogeneousTuple, T::Item: Clone,

    Return an iterator over all contiguous windows producing tuples of -a specific size (up to 12). Read more
    source§

    fn circular_tuple_windows<T>(self) -> CircularTupleWindows<Self, T> ⓘ
    where +a specific size (up to 12). Read more

    source§

    fn circular_tuple_windows<T>(self) -> CircularTupleWindows<Self, T> ⓘ
    where Self: Sized + Clone + Iterator<Item = T::Item> + ExactSizeIterator, T: TupleCollect + Clone, T::Item: Clone,

    Return an iterator over all windows, wrapping back to the first elements when the window would otherwise exceed the length of the -iterator, producing tuples of a specific size (up to 12). Read more
    source§

    fn tuples<T>(self) -> Tuples<Self, T> ⓘ
    where +iterator, producing tuples of a specific size (up to 12). Read more

    source§

    fn tuples<T>(self) -> Tuples<Self, T> ⓘ
    where Self: Sized + Iterator<Item = T::Item>, T: HomogeneousTuple,

    Return an iterator that groups the items in tuples of a specific size -(up to 12). Read more
    source§

    fn tee(self) -> (Tee<Self>, Tee<Self>)
    where +(up to 12). Read more

    source§

    fn tee(self) -> (Tee<Self>, Tee<Self>)
    where Self: Sized, Self::Item: Clone,

    Split into an iterator pair that both yield all elements from -the original iterator. Read more
    source§

    fn step(self, n: usize) -> Step<Self> ⓘ
    where - Self: Sized,

    👎Deprecated since 0.8.0: Use std .step_by() instead
    Return an iterator adaptor that steps n elements in the base iterator -for each iteration. Read more
    source§

    fn map_into<R>(self) -> MapInto<Self, R>
    where +the original iterator. Read more

    source§

    fn map_into<R>(self) -> MapInto<Self, R>
    where Self: Sized, - Self::Item: Into<R>,

    Convert each item of the iterator using the Into trait. Read more
    source§

    fn map_results<F, T, U, E>(self, f: F) -> MapOk<Self, F>
    where - Self: Iterator<Item = Result<T, E>> + Sized, - F: FnMut(T) -> U,

    👎Deprecated since 0.10.0: Use .map_ok() instead
    See .map_ok().
    source§

    fn map_ok<F, T, U, E>(self, f: F) -> MapOk<Self, F>
    where + Self::Item: Into<R>,

    Convert each item of the iterator using the Into trait. Read more
    source§

    fn map_ok<F, T, U, E>(self, f: F) -> MapOk<Self, F>
    where Self: Iterator<Item = Result<T, E>> + Sized, F: FnMut(T) -> U,

    Return an iterator adaptor that applies the provided closure to every Result::Ok value. Result::Err values are -unchanged. Read more
    source§

    fn filter_ok<F, T, E>(self, f: F) -> FilterOk<Self, F> ⓘ
    where +unchanged. Read more

    source§

    fn filter_ok<F, T, E>(self, f: F) -> FilterOk<Self, F> ⓘ
    where Self: Iterator<Item = Result<T, E>> + Sized, F: FnMut(&T) -> bool,

    Return an iterator adaptor that filters every Result::Ok value with the provided closure. Result::Err values are -unchanged. Read more
    source§

    fn filter_map_ok<F, T, U, E>(self, f: F) -> FilterMapOk<Self, F> ⓘ
    where +unchanged. Read more

    source§

    fn filter_map_ok<F, T, U, E>(self, f: F) -> FilterMapOk<Self, F> ⓘ
    where Self: Iterator<Item = Result<T, E>> + Sized, F: FnMut(T) -> Option<U>,

    Return an iterator adaptor that filters and transforms every Result::Ok value with the provided closure. Result::Err -values are unchanged. Read more
    source§

    fn flatten_ok<T, E>(self) -> FlattenOk<Self, T, E> ⓘ
    where +values are unchanged. Read more

    source§

    fn flatten_ok<T, E>(self) -> FlattenOk<Self, T, E> ⓘ
    where Self: Iterator<Item = Result<T, E>> + Sized, T: IntoIterator,

    Return an iterator adaptor that flattens every Result::Ok value into -a series of Result::Ok values. Result::Err values are unchanged. Read more
    source§

    fn process_results<F, T, E, R>(self, processor: F) -> Result<R, E>
    where +a series of Result::Ok values. Result::Err values are unchanged. Read more

    source§

    fn process_results<F, T, E, R>(self, processor: F) -> Result<R, E>
    where Self: Iterator<Item = Result<T, E>> + Sized, F: FnOnce(ProcessResults<'_, Self, E>) -> R,

    “Lift” a function of the values of the current iterator so as to process -an iterator of Result values instead. Read more
    source§

    fn merge<J>(self, other: J) -> Merge<Self, J::IntoIter>
    where +an iterator of Result values instead. Read more

    source§

    fn merge<J>(self, other: J) -> Merge<Self, J::IntoIter>
    where Self: Sized, Self::Item: PartialOrd, J: IntoIterator<Item = Self::Item>,

    Return an iterator adaptor that merges the two base iterators in ascending order. If both base iterators are sorted (ascending), the -result is sorted. Read more
    source§

    fn merge_by<J, F>(self, other: J, is_first: F) -> MergeBy<Self, J::IntoIter, F> ⓘ
    where +result is sorted. Read more

    source§

    fn merge_by<J, F>(self, other: J, is_first: F) -> MergeBy<Self, J::IntoIter, F> ⓘ
    where Self: Sized, J: IntoIterator<Item = Self::Item>, F: FnMut(&Self::Item, &Self::Item) -> bool,

    Return an iterator adaptor that merges the two base iterators in order. -This is much like .merge() but allows for a custom ordering. Read more
    source§

    fn merge_join_by<J, F, T>( +This is much like .merge() but allows for a custom ordering. Read more

    source§

    fn merge_join_by<J, F, T>( self, other: J, cmp_fn: F @@ -301,285 +302,296 @@ This is much like IntoIterator, F: FnMut(&Self::Item, &J::Item) -> T, Self: Sized,

    Create an iterator that merges items from both this and the specified -iterator in ascending order. Read more
    source§

    fn kmerge(self) -> KMerge<<Self::Item as IntoIterator>::IntoIter>
    where +iterator in ascending order. Read more

    source§

    fn kmerge(self) -> KMerge<<Self::Item as IntoIterator>::IntoIter>
    where Self: Sized, Self::Item: IntoIterator, <Self::Item as IntoIterator>::Item: PartialOrd,

    Return an iterator adaptor that flattens an iterator of iterators by -merging them in ascending order. Read more
    source§

    fn kmerge_by<F>( +merging them in ascending order. Read more

    source§

    fn kmerge_by<F>( self, first: F ) -> KMergeBy<<Self::Item as IntoIterator>::IntoIter, F> ⓘ
    where Self: Sized, Self::Item: IntoIterator, F: FnMut(&<Self::Item as IntoIterator>::Item, &<Self::Item as IntoIterator>::Item) -> bool,

    Return an iterator adaptor that flattens an iterator of iterators by -merging them according to the given closure. Read more
    source§

    fn cartesian_product<J>(self, other: J) -> Product<Self, J::IntoIter> ⓘ
    where +merging them according to the given closure. Read more

    source§

    fn cartesian_product<J>(self, other: J) -> Product<Self, J::IntoIter> ⓘ
    where Self: Sized, Self::Item: Clone, J: IntoIterator, J::IntoIter: Clone,

    Return an iterator adaptor that iterates over the cartesian product of -the element sets of two iterators self and J. Read more
    source§

    fn multi_cartesian_product( +the element sets of two iterators self and J. Read more

    source§

    fn multi_cartesian_product( self ) -> MultiProduct<<Self::Item as IntoIterator>::IntoIter> ⓘ
    where Self: Sized, Self::Item: IntoIterator, <Self::Item as IntoIterator>::IntoIter: Clone, <Self::Item as IntoIterator>::Item: Clone,

    Return an iterator adaptor that iterates over the cartesian product of -all subiterators returned by meta-iterator self. Read more
    source§

    fn coalesce<F>(self, f: F) -> Coalesce<Self, F>
    where +all subiterators returned by meta-iterator self. Read more

    source§

    fn coalesce<F>(self, f: F) -> Coalesce<Self, F>
    where Self: Sized, F: FnMut(Self::Item, Self::Item) -> Result<Self::Item, (Self::Item, Self::Item)>,

    Return an iterator adaptor that uses the passed-in closure to -optionally merge together consecutive elements. Read more
    source§

    fn dedup(self) -> Dedup<Self>
    where +optionally merge together consecutive elements. Read more

    source§

    fn dedup(self) -> Dedup<Self>
    where Self: Sized, Self::Item: PartialEq,

    Remove duplicates from sections of consecutive identical elements. -If the iterator is sorted, all elements will be unique. Read more
    source§

    fn dedup_by<Cmp>(self, cmp: Cmp) -> DedupBy<Self, Cmp>
    where +If the iterator is sorted, all elements will be unique. Read more

    source§

    fn dedup_by<Cmp>(self, cmp: Cmp) -> DedupBy<Self, Cmp>
    where Self: Sized, Cmp: FnMut(&Self::Item, &Self::Item) -> bool,

    Remove duplicates from sections of consecutive identical elements, determining equality using a comparison function. -If the iterator is sorted, all elements will be unique. Read more
    source§

    fn dedup_with_count(self) -> DedupWithCount<Self>
    where +If the iterator is sorted, all elements will be unique. Read more

    source§

    fn dedup_with_count(self) -> DedupWithCount<Self>
    where Self: Sized,

    Remove duplicates from sections of consecutive identical elements, while keeping a count of how many repeated elements were present. -If the iterator is sorted, all elements will be unique. Read more
    source§

    fn dedup_by_with_count<Cmp>(self, cmp: Cmp) -> DedupByWithCount<Self, Cmp>
    where +If the iterator is sorted, all elements will be unique. Read more

    source§

    fn dedup_by_with_count<Cmp>(self, cmp: Cmp) -> DedupByWithCount<Self, Cmp>
    where Self: Sized, Cmp: FnMut(&Self::Item, &Self::Item) -> bool,

    Remove duplicates from sections of consecutive identical elements, while keeping a count of how many repeated elements were present. This will determine equality using a comparison function. -If the iterator is sorted, all elements will be unique. Read more
    source§

    fn duplicates(self) -> Duplicates<Self>
    where +If the iterator is sorted, all elements will be unique. Read more

    source§

    fn duplicates(self) -> Duplicates<Self>
    where Self: Sized, Self::Item: Eq + Hash,

    Return an iterator adaptor that produces elements that appear more than once during the -iteration. Duplicates are detected using hash and equality. Read more
    source§

    fn duplicates_by<V, F>(self, f: F) -> DuplicatesBy<Self, V, F>
    where +iteration. Duplicates are detected using hash and equality. Read more

    source§

    fn duplicates_by<V, F>(self, f: F) -> DuplicatesBy<Self, V, F>
    where Self: Sized, V: Eq + Hash, F: FnMut(&Self::Item) -> V,

    Return an iterator adaptor that produces elements that appear more than once during the -iteration. Duplicates are detected using hash and equality. Read more
    source§

    fn unique(self) -> Unique<Self> ⓘ
    where +iteration. Duplicates are detected using hash and equality. Read more

    source§

    fn unique(self) -> Unique<Self> ⓘ
    where Self: Sized, Self::Item: Clone + Eq + Hash,

    Return an iterator adaptor that filters out elements that have already been produced once during the iteration. Duplicates -are detected using hash and equality. Read more
    source§

    fn unique_by<V, F>(self, f: F) -> UniqueBy<Self, V, F> ⓘ
    where +are detected using hash and equality. Read more

    source§

    fn unique_by<V, F>(self, f: F) -> UniqueBy<Self, V, F> ⓘ
    where Self: Sized, V: Eq + Hash, F: FnMut(&Self::Item) -> V,

    Return an iterator adaptor that filters out elements that have -already been produced once during the iteration. Read more
    source§

    fn peeking_take_while<F>(&mut self, accept: F) -> PeekingTakeWhile<'_, Self, F> ⓘ
    where +already been produced once during the iteration. Read more

    source§

    fn peeking_take_while<F>(&mut self, accept: F) -> PeekingTakeWhile<'_, Self, F> ⓘ
    where Self: Sized + PeekingNext, F: FnMut(&Self::Item) -> bool,

    Return an iterator adaptor that borrows from this iterator and -takes items while the closure accept returns true. Read more
    source§

    fn take_while_ref<F>(&mut self, accept: F) -> TakeWhileRef<'_, Self, F> ⓘ
    where +takes items while the closure accept returns true. Read more

    source§

    fn take_while_ref<F>(&mut self, accept: F) -> TakeWhileRef<'_, Self, F> ⓘ
    where Self: Clone, F: FnMut(&Self::Item) -> bool,

    Return an iterator adaptor that borrows from a Clone-able iterator -to only pick off elements while the predicate accept returns true. Read more
    source§

    fn take_while_inclusive<F>(self, accept: F) -> TakeWhileInclusive<Self, F> ⓘ
    where +to only pick off elements while the predicate accept returns true. Read more

    source§

    fn take_while_inclusive<F>(self, accept: F) -> TakeWhileInclusive<Self, F> ⓘ
    where Self: Sized, F: FnMut(&Self::Item) -> bool,

    Returns an iterator adaptor that consumes elements while the given predicate is true, including the element for which the predicate -first returned false. Read more
    source§

    fn while_some<A>(self) -> WhileSome<Self> ⓘ
    where +first returned false. Read more

    source§

    fn while_some<A>(self) -> WhileSome<Self> ⓘ
    where Self: Sized + Iterator<Item = Option<A>>,

    Return an iterator adaptor that filters Option<A> iterator elements -and produces A. Stops on the first None encountered. Read more
    source§

    fn tuple_combinations<T>(self) -> TupleCombinations<Self, T> ⓘ
    where +and produces A. Stops on the first None encountered. Read more

    source§

    fn tuple_combinations<T>(self) -> TupleCombinations<Self, T> ⓘ
    where Self: Sized + Clone, Self::Item: Clone, T: HasCombination<Self>,

    Return an iterator adaptor that iterates over the combinations of the -elements from an iterator. Read more
    source§

    fn combinations(self, k: usize) -> Combinations<Self> ⓘ
    where +elements from an iterator. Read more

    source§

    fn combinations(self, k: usize) -> Combinations<Self> ⓘ
    where Self: Sized, Self::Item: Clone,

    Return an iterator adaptor that iterates over the k-length combinations of -the elements from an iterator. Read more
    source§

    fn combinations_with_replacement( +the elements from an iterator. Read more

    source§

    fn combinations_with_replacement( self, k: usize ) -> CombinationsWithReplacement<Self> ⓘ
    where Self: Sized, Self::Item: Clone,

    Return an iterator that iterates over the k-length combinations of -the elements from an iterator, with replacement. Read more
    source§

    fn permutations(self, k: usize) -> Permutations<Self> ⓘ
    where +the elements from an iterator, with replacement. Read more

    source§

    fn permutations(self, k: usize) -> Permutations<Self> ⓘ
    where Self: Sized, Self::Item: Clone,

    Return an iterator adaptor that iterates over all k-permutations of the -elements from an iterator. Read more
    source§

    fn powerset(self) -> Powerset<Self> ⓘ
    where +elements from an iterator. Read more

    source§

    fn powerset(self) -> Powerset<Self> ⓘ
    where Self: Sized, Self::Item: Clone,

    Return an iterator that iterates through the powerset of the elements from an -iterator. Read more
    source§

    fn pad_using<F>(self, min: usize, f: F) -> PadUsing<Self, F> ⓘ
    where +iterator. Read more

    source§

    fn pad_using<F>(self, min: usize, f: F) -> PadUsing<Self, F> ⓘ
    where Self: Sized, F: FnMut(usize) -> Self::Item,

    Return an iterator adaptor that pads the sequence to a minimum length of -min by filling missing elements using a closure f. Read more
    source§

    fn with_position(self) -> WithPosition<Self> ⓘ
    where +min by filling missing elements using a closure f. Read more

    source§

    fn with_position(self) -> WithPosition<Self> ⓘ
    where Self: Sized,

    Return an iterator adaptor that combines each element with a Position to -ease special-case handling of the first or last elements. Read more
    source§

    fn positions<P>(self, predicate: P) -> Positions<Self, P> ⓘ
    where +ease special-case handling of the first or last elements. Read more

    source§

    fn positions<P>(self, predicate: P) -> Positions<Self, P> ⓘ
    where Self: Sized, P: FnMut(Self::Item) -> bool,

    Return an iterator adaptor that yields the indices of all elements -satisfying a predicate, counted from the start of the iterator. Read more
    source§

    fn update<F>(self, updater: F) -> Update<Self, F> ⓘ
    where +satisfying a predicate, counted from the start of the iterator. Read more

    source§

    fn update<F>(self, updater: F) -> Update<Self, F> ⓘ
    where Self: Sized, F: FnMut(&mut Self::Item),

    Return an iterator adaptor that applies a mutating function -to each element before yielding it. Read more
    source§

    fn next_tuple<T>(&mut self) -> Option<T>
    where +to each element before yielding it. Read more

    source§

    fn next_tuple<T>(&mut self) -> Option<T>
    where Self: Sized + Iterator<Item = T::Item>, T: HomogeneousTuple,

    Advances the iterator and returns the next items grouped in a tuple of -a specific size (up to 12). Read more
    source§

    fn collect_tuple<T>(self) -> Option<T>
    where +a specific size (up to 12). Read more

    source§

    fn collect_tuple<T>(self) -> Option<T>
    where Self: Sized + Iterator<Item = T::Item>, T: HomogeneousTuple,

    Collects all items from the iterator into a tuple of a specific size -(up to 12). Read more
    source§

    fn find_position<P>(&mut self, pred: P) -> Option<(usize, Self::Item)>
    where - P: FnMut(&Self::Item) -> bool,

    Find the position and value of the first element satisfying a predicate. Read more
    source§

    fn find_or_last<P>(self, predicate: P) -> Option<Self::Item>
    where +(up to 12). Read more

    source§

    fn find_position<P>(&mut self, pred: P) -> Option<(usize, Self::Item)>
    where + P: FnMut(&Self::Item) -> bool,

    Find the position and value of the first element satisfying a predicate. Read more
    source§

    fn find_or_last<P>(self, predicate: P) -> Option<Self::Item>
    where Self: Sized, - P: FnMut(&Self::Item) -> bool,

    Find the value of the first element satisfying a predicate or return the last element, if any. Read more
    source§

    fn find_or_first<P>(self, predicate: P) -> Option<Self::Item>
    where + P: FnMut(&Self::Item) -> bool,

    Find the value of the first element satisfying a predicate or return the last element, if any. Read more
    source§

    fn find_or_first<P>(self, predicate: P) -> Option<Self::Item>
    where Self: Sized, - P: FnMut(&Self::Item) -> bool,

    Find the value of the first element satisfying a predicate or return the first element, if any. Read more
    source§

    fn contains<Q>(&mut self, query: &Q) -> bool
    where + P: FnMut(&Self::Item) -> bool,

    Find the value of the first element satisfying a predicate or return the first element, if any. Read more
    source§

    fn contains<Q>(&mut self, query: &Q) -> bool
    where Self: Sized, Self::Item: Borrow<Q>, - Q: PartialEq,

    Returns true if the given item is present in this iterator. Read more
    source§

    fn all_equal(&mut self) -> bool
    where + Q: PartialEq,

    Returns true if the given item is present in this iterator. Read more
    source§

    fn all_equal(&mut self) -> bool
    where Self: Sized, - Self::Item: PartialEq,

    Check whether all elements compare equal. Read more
    source§

    fn all_equal_value( + Self::Item: PartialEq,

    Check whether all elements compare equal. Read more
    source§

    fn all_equal_value( &mut self ) -> Result<Self::Item, Option<(Self::Item, Self::Item)>>
    where Self: Sized, Self::Item: PartialEq,

    If there are elements and they are all equal, return a single copy of that element. If there are no elements, return an Error containing None. If there are elements and they are not all equal, return a tuple containing the first -two non-equal elements found. Read more
    source§

    fn all_unique(&mut self) -> bool
    where +two non-equal elements found. Read more

    source§

    fn all_unique(&mut self) -> bool
    where Self: Sized, - Self::Item: Eq + Hash,

    Check whether all elements are unique (non equal). Read more
    source§

    fn dropping(self, n: usize) -> Self
    where + Self::Item: Eq + Hash,

    Check whether all elements are unique (non equal). Read more
    source§

    fn dropping(self, n: usize) -> Self
    where Self: Sized,

    Consume the first n elements from the iterator eagerly, -and return the same iterator again. Read more
    source§

    fn dropping_back(self, n: usize) -> Self
    where +and return the same iterator again. Read more

    source§

    fn dropping_back(self, n: usize) -> Self
    where Self: Sized + DoubleEndedIterator,

    Consume the last n elements from the iterator eagerly, -and return the same iterator again. Read more
    source§

    fn foreach<F>(self, f: F)
    where - F: FnMut(Self::Item), - Self: Sized,

    👎Deprecated since 0.8.0: Use .for_each() instead
    Run the closure f eagerly on each element of the iterator. Read more
    source§

    fn concat(self) -> Self::Item
    where +and return the same iterator again. Read more

    source§

    fn concat(self) -> Self::Item
    where Self: Sized, - Self::Item: Extend<<<Self as Iterator>::Item as IntoIterator>::Item> + IntoIterator + Default,

    Combine all an iterator’s elements into one element by using Extend. Read more
    source§

    fn collect_vec(self) -> Vec<Self::Item>
    where + Self::Item: Extend<<<Self as Iterator>::Item as IntoIterator>::Item> + IntoIterator + Default,

    Combine all an iterator’s elements into one element by using Extend. Read more
    source§

    fn collect_vec(self) -> Vec<Self::Item>
    where Self: Sized,

    .collect_vec() is simply a type specialization of Iterator::collect, -for convenience.
    source§

    fn try_collect<T, U, E>(self) -> Result<U, E>
    where +for convenience.

    source§

    fn try_collect<T, U, E>(self) -> Result<U, E>
    where Self: Sized + Iterator<Item = Result<T, E>>, Result<U, E>: FromIterator<Result<T, E>>,

    .try_collect() is more convenient way of writing -.collect::<Result<_, _>>() Read more
    source§

    fn set_from<'a, A: 'a, J>(&mut self, from: J) -> usize
    where +.collect::<Result<_, _>>() Read more

    source§

    fn set_from<'a, A: 'a, J>(&mut self, from: J) -> usize
    where Self: Iterator<Item = &'a mut A>, J: IntoIterator<Item = A>,

    Assign to each reference in self from the from iterator, -stopping at the shortest of the two iterators. Read more
    source§

    fn join(&mut self, sep: &str) -> String
    where - Self::Item: Display,

    Combine all iterator elements into one String, separated by sep. Read more
    source§

    fn format(self, sep: &str) -> Format<'_, Self>
    where - Self: Sized,

    Format all iterator elements, separated by sep. Read more
    source§

    fn format_with<F>(self, sep: &str, format: F) -> FormatWith<'_, Self, F>
    where +stopping at the shortest of the two iterators. Read more

    source§

    fn join(&mut self, sep: &str) -> String
    where + Self::Item: Display,

    Combine all iterator elements into one String, separated by sep. Read more
    source§

    fn format(self, sep: &str) -> Format<'_, Self>
    where + Self: Sized,

    Format all iterator elements, separated by sep. Read more
    source§

    fn format_with<F>(self, sep: &str, format: F) -> FormatWith<'_, Self, F>
    where Self: Sized, - F: FnMut(Self::Item, &mut dyn FnMut(&dyn Display) -> Result) -> Result,

    Format all iterator elements, separated by sep. Read more
    source§

    fn fold_results<A, E, B, F>(&mut self, start: B, f: F) -> Result<B, E>
    where + F: FnMut(Self::Item, &mut dyn FnMut(&dyn Display) -> Result) -> Result,

    Format all iterator elements, separated by sep. Read more
    source§

    fn fold_ok<A, E, B, F>(&mut self, start: B, f: F) -> Result<B, E>
    where Self: Iterator<Item = Result<A, E>>, - F: FnMut(B, A) -> B,

    👎Deprecated since 0.10.0: Use .fold_ok() instead
    See .fold_ok().
    source§

    fn fold_ok<A, E, B, F>(&mut self, start: B, f: F) -> Result<B, E>
    where - Self: Iterator<Item = Result<A, E>>, - F: FnMut(B, A) -> B,

    Fold Result values from an iterator. Read more
    source§

    fn fold_options<A, B, F>(&mut self, start: B, f: F) -> Option<B>
    where + F: FnMut(B, A) -> B,

    Fold Result values from an iterator. Read more
    source§

    fn fold_options<A, B, F>(&mut self, start: B, f: F) -> Option<B>
    where Self: Iterator<Item = Option<A>>, - F: FnMut(B, A) -> B,

    Fold Option values from an iterator. Read more
    source§

    fn fold1<F>(self, f: F) -> Option<Self::Item>
    where + F: FnMut(B, A) -> B,

    Fold Option values from an iterator. Read more
    source§

    fn fold1<F>(self, f: F) -> Option<Self::Item>
    where F: FnMut(Self::Item, Self::Item) -> Self::Item, - Self: Sized,

    👎Deprecated since 0.10.2: Use Iterator::reduce instead
    Accumulator of the elements in the iterator. Read more
    source§

    fn tree_fold1<F>(self, f: F) -> Option<Self::Item>
    where + Self: Sized,

    👎Deprecated since 0.10.2: Use Iterator::reduce instead
    Accumulator of the elements in the iterator. Read more
    source§

    fn tree_reduce<F>(self, f: F) -> Option<Self::Item>
    where F: FnMut(Self::Item, Self::Item) -> Self::Item, - Self: Sized,

    Accumulate the elements in the iterator in a tree-like manner. Read more
    source§

    fn fold_while<B, F>(&mut self, init: B, f: F) -> FoldWhile<B>
    where + Self: Sized,

    Accumulate the elements in the iterator in a tree-like manner. Read more
    source§

    fn tree_fold1<F>(self, f: F) -> Option<Self::Item>
    where + F: FnMut(Self::Item, Self::Item) -> Self::Item, + Self: Sized,

    👎Deprecated since 0.13.0: Use .tree_reduce() instead
    See .tree_reduce().
    source§

    fn fold_while<B, F>(&mut self, init: B, f: F) -> FoldWhile<B>
    where Self: Sized, - F: FnMut(B, Self::Item) -> FoldWhile<B>,

    An iterator method that applies a function, producing a single, final value. Read more
    source§

    fn sum1<S>(self) -> Option<S>
    where + F: FnMut(B, Self::Item) -> FoldWhile<B>,

    An iterator method that applies a function, producing a single, final value. Read more
    source§

    fn sum1<S>(self) -> Option<S>
    where Self: Sized, - S: Sum<Self::Item>,

    Iterate over the entire iterator and add all the elements. Read more
    source§

    fn product1<P>(self) -> Option<P>
    where + S: Sum<Self::Item>,

    Iterate over the entire iterator and add all the elements. Read more
    source§

    fn product1<P>(self) -> Option<P>
    where Self: Sized, - P: Product<Self::Item>,

    Iterate over the entire iterator and multiply all the elements. Read more
    source§

    fn sorted_unstable(self) -> IntoIter<Self::Item> ⓘ
    where + P: Product<Self::Item>,

    Iterate over the entire iterator and multiply all the elements. Read more
    source§

    fn sorted_unstable(self) -> IntoIter<Self::Item> ⓘ
    where Self: Sized, - Self::Item: Ord,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_unstable_by<F>(self, cmp: F) -> IntoIter<Self::Item> ⓘ
    where + Self::Item: Ord,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_unstable_by<F>(self, cmp: F) -> IntoIter<Self::Item> ⓘ
    where Self: Sized, - F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_unstable_by_key<K, F>(self, f: F) -> IntoIter<Self::Item> ⓘ
    where + F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_unstable_by_key<K, F>(self, f: F) -> IntoIter<Self::Item> ⓘ
    where Self: Sized, K: Ord, - F: FnMut(&Self::Item) -> K,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted(self) -> IntoIter<Self::Item> ⓘ
    where + F: FnMut(&Self::Item) -> K,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted(self) -> IntoIter<Self::Item> ⓘ
    where Self: Sized, - Self::Item: Ord,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_by<F>(self, cmp: F) -> IntoIter<Self::Item> ⓘ
    where + Self::Item: Ord,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_by<F>(self, cmp: F) -> IntoIter<Self::Item> ⓘ
    where Self: Sized, - F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_by_key<K, F>(self, f: F) -> IntoIter<Self::Item> ⓘ
    where + F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_by_key<K, F>(self, f: F) -> IntoIter<Self::Item> ⓘ
    where Self: Sized, K: Ord, - F: FnMut(&Self::Item) -> K,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_by_cached_key<K, F>(self, f: F) -> IntoIter<Self::Item> ⓘ
    where + F: FnMut(&Self::Item) -> K,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_by_cached_key<K, F>(self, f: F) -> IntoIter<Self::Item> ⓘ
    where Self: Sized, K: Ord, F: FnMut(&Self::Item) -> K,

    Sort all iterator elements into a new iterator in ascending order. The key function is -called exactly once per key. Read more
    source§

    fn k_smallest(self, k: usize) -> IntoIter<Self::Item> ⓘ
    where +called exactly once per key. Read more

    source§

    fn k_smallest(self, k: usize) -> IntoIter<Self::Item> ⓘ
    where Self: Sized, - Self::Item: Ord,

    Sort the k smallest elements into a new iterator, in ascending order. Read more
    source§

    fn partition_map<A, B, F, L, R>(self, predicate: F) -> (A, B)
    where + Self::Item: Ord,

    Sort the k smallest elements into a new iterator, in ascending order. Read more
    source§

    fn k_smallest_by<F>(self, k: usize, cmp: F) -> IntoIter<Self::Item> ⓘ
    where + Self: Sized, + F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Sort the k smallest elements into a new iterator using the provided comparison. Read more
    source§

    fn k_smallest_by_key<F, K>(self, k: usize, key: F) -> IntoIter<Self::Item> ⓘ
    where + Self: Sized, + F: FnMut(&Self::Item) -> K, + K: Ord,

    Return the elements producing the k smallest outputs of the provided function. Read more
    source§

    fn k_largest(self, k: usize) -> IntoIter<Self::Item> ⓘ
    where + Self: Sized, + Self::Item: Ord,

    Sort the k largest elements into a new iterator, in descending order. Read more
    source§

    fn k_largest_by<F>(self, k: usize, cmp: F) -> IntoIter<Self::Item> ⓘ
    where + Self: Sized, + F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Sort the k largest elements into a new iterator using the provided comparison. Read more
    source§

    fn k_largest_by_key<F, K>(self, k: usize, key: F) -> IntoIter<Self::Item> ⓘ
    where + Self: Sized, + F: FnMut(&Self::Item) -> K, + K: Ord,

    Return the elements producing the k largest outputs of the provided function. Read more
    source§

    fn tail(self, n: usize) -> IntoIter<Self::Item> ⓘ
    where + Self: Sized,

    Consumes the iterator and return an iterator of the last n elements. Read more
    source§

    fn partition_map<A, B, F, L, R>(self, predicate: F) -> (A, B)
    where Self: Sized, F: FnMut(Self::Item) -> Either<L, R>, A: Default + Extend<L>, B: Default + Extend<R>,

    Collect all iterator elements into one of two partitions. Unlike Iterator::partition, each partition may -have a distinct type. Read more
    source§

    fn partition_result<A, B, T, E>(self) -> (A, B)
    where +have a distinct type. Read more

    source§

    fn partition_result<A, B, T, E>(self) -> (A, B)
    where Self: Iterator<Item = Result<T, E>> + Sized, A: Default + Extend<T>, B: Default + Extend<E>,

    Partition a sequence of Results into one list of all the Ok elements -and another list of all the Err elements. Read more
    source§

    fn into_group_map<K, V>(self) -> HashMap<K, Vec<V>>
    where +and another list of all the Err elements. Read more

    source§

    fn into_group_map<K, V>(self) -> HashMap<K, Vec<V>>
    where Self: Iterator<Item = (K, V)> + Sized, K: Hash + Eq,

    Return a HashMap of keys mapped to Vecs of values. Keys and values -are taken from (Key, Value) tuple pairs yielded by the input iterator. Read more
    source§

    fn into_group_map_by<K, V, F>(self, f: F) -> HashMap<K, Vec<V>>
    where +are taken from (Key, Value) tuple pairs yielded by the input iterator. Read more

    source§

    fn into_group_map_by<K, V, F>(self, f: F) -> HashMap<K, Vec<V>>
    where Self: Iterator<Item = V> + Sized, K: Hash + Eq, - F: Fn(&V) -> K,

    Return an Iterator on a HashMap. Keys mapped to Vecs of values. The key is specified -in the closure. Read more
    source§

    fn into_grouping_map<K, V>(self) -> GroupingMap<Self>
    where + F: FnMut(&V) -> K,

    Return an Iterator on a HashMap. Keys mapped to Vecs of values. The key is specified +in the closure. Read more
    source§

    fn into_grouping_map<K, V>(self) -> GroupingMap<Self>
    where Self: Iterator<Item = (K, V)> + Sized, K: Hash + Eq,

    Constructs a GroupingMap to be used later with one of the efficient -group-and-fold operations it allows to perform. Read more
    source§

    fn into_grouping_map_by<K, V, F>(self, key_mapper: F) -> GroupingMapBy<Self, F>
    where +group-and-fold operations it allows to perform. Read more

    source§

    fn into_grouping_map_by<K, V, F>(self, key_mapper: F) -> GroupingMapBy<Self, F>
    where Self: Iterator<Item = V> + Sized, K: Hash + Eq, F: FnMut(&V) -> K,

    Constructs a GroupingMap to be used later with one of the efficient -group-and-fold operations it allows to perform. Read more
    source§

    fn min_set(self) -> Vec<Self::Item>
    where +group-and-fold operations it allows to perform. Read more

    source§

    fn min_set(self) -> Vec<Self::Item>
    where Self: Sized, - Self::Item: Ord,

    Return all minimum elements of an iterator. Read more
    source§

    fn min_set_by<F>(self, compare: F) -> Vec<Self::Item>
    where + Self::Item: Ord,

    Return all minimum elements of an iterator. Read more
    source§

    fn min_set_by<F>(self, compare: F) -> Vec<Self::Item>
    where Self: Sized, F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Return all minimum elements of an iterator, as determined by -the specified function. Read more
    source§

    fn min_set_by_key<K, F>(self, key: F) -> Vec<Self::Item>
    where +the specified function. Read more

    source§

    fn min_set_by_key<K, F>(self, key: F) -> Vec<Self::Item>
    where Self: Sized, K: Ord, F: FnMut(&Self::Item) -> K,

    Return all minimum elements of an iterator, as determined by -the specified function. Read more
    source§

    fn max_set(self) -> Vec<Self::Item>
    where +the specified function. Read more

    source§

    fn max_set(self) -> Vec<Self::Item>
    where Self: Sized, - Self::Item: Ord,

    Return all maximum elements of an iterator. Read more
    source§

    fn max_set_by<F>(self, compare: F) -> Vec<Self::Item>
    where + Self::Item: Ord,

    Return all maximum elements of an iterator. Read more
    source§

    fn max_set_by<F>(self, compare: F) -> Vec<Self::Item>
    where Self: Sized, F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Return all maximum elements of an iterator, as determined by -the specified function. Read more
    source§

    fn max_set_by_key<K, F>(self, key: F) -> Vec<Self::Item>
    where +the specified function. Read more

    source§

    fn max_set_by_key<K, F>(self, key: F) -> Vec<Self::Item>
    where Self: Sized, K: Ord, F: FnMut(&Self::Item) -> K,

    Return all maximum elements of an iterator, as determined by -the specified function. Read more
    source§

    fn minmax(self) -> MinMaxResult<Self::Item>
    where +the specified function. Read more

    source§

    fn minmax(self) -> MinMaxResult<Self::Item>
    where Self: Sized, - Self::Item: PartialOrd,

    Return the minimum and maximum elements in the iterator. Read more
    source§

    fn minmax_by_key<K, F>(self, key: F) -> MinMaxResult<Self::Item>
    where + Self::Item: PartialOrd,

    Return the minimum and maximum elements in the iterator. Read more
    source§

    fn minmax_by_key<K, F>(self, key: F) -> MinMaxResult<Self::Item>
    where Self: Sized, K: PartialOrd, F: FnMut(&Self::Item) -> K,

    Return the minimum and maximum element of an iterator, as determined by -the specified function. Read more
    source§

    fn minmax_by<F>(self, compare: F) -> MinMaxResult<Self::Item>
    where +the specified function. Read more

    source§

    fn minmax_by<F>(self, compare: F) -> MinMaxResult<Self::Item>
    where Self: Sized, F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Return the minimum and maximum element of an iterator, as determined by -the specified comparison function. Read more
    source§

    fn position_max(self) -> Option<usize>
    where +the specified comparison function. Read more

    source§

    fn position_max(self) -> Option<usize>
    where Self: Sized, - Self::Item: Ord,

    Return the position of the maximum element in the iterator. Read more
    source§

    fn position_max_by_key<K, F>(self, key: F) -> Option<usize>
    where + Self::Item: Ord,

    Return the position of the maximum element in the iterator. Read more
    source§

    fn position_max_by_key<K, F>(self, key: F) -> Option<usize>
    where Self: Sized, K: Ord, F: FnMut(&Self::Item) -> K,

    Return the position of the maximum element in the iterator, as -determined by the specified function. Read more
    source§

    fn position_max_by<F>(self, compare: F) -> Option<usize>
    where +determined by the specified function. Read more

    source§

    fn position_max_by<F>(self, compare: F) -> Option<usize>
    where Self: Sized, F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Return the position of the maximum element in the iterator, as -determined by the specified comparison function. Read more
    source§

    fn position_min(self) -> Option<usize>
    where +determined by the specified comparison function. Read more

    source§

    fn position_min(self) -> Option<usize>
    where Self: Sized, - Self::Item: Ord,

    Return the position of the minimum element in the iterator. Read more
    source§

    fn position_min_by_key<K, F>(self, key: F) -> Option<usize>
    where + Self::Item: Ord,

    Return the position of the minimum element in the iterator. Read more
    source§

    fn position_min_by_key<K, F>(self, key: F) -> Option<usize>
    where Self: Sized, K: Ord, F: FnMut(&Self::Item) -> K,

    Return the position of the minimum element in the iterator, as -determined by the specified function. Read more
    source§

    fn position_min_by<F>(self, compare: F) -> Option<usize>
    where +determined by the specified function. Read more

    source§

    fn position_min_by<F>(self, compare: F) -> Option<usize>
    where Self: Sized, F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Return the position of the minimum element in the iterator, as -determined by the specified comparison function. Read more
    source§

    fn position_minmax(self) -> MinMaxResult<usize>
    where +determined by the specified comparison function. Read more

    source§

    fn position_minmax(self) -> MinMaxResult<usize>
    where Self: Sized, Self::Item: PartialOrd,

    Return the positions of the minimum and maximum elements in -the iterator. Read more
    source§

    fn position_minmax_by_key<K, F>(self, key: F) -> MinMaxResult<usize>
    where +the iterator. Read more

    source§

    fn position_minmax_by_key<K, F>(self, key: F) -> MinMaxResult<usize>
    where Self: Sized, K: PartialOrd, F: FnMut(&Self::Item) -> K,

    Return the postions of the minimum and maximum elements of an -iterator, as determined by the specified function. Read more
    source§

    fn position_minmax_by<F>(self, compare: F) -> MinMaxResult<usize>
    where +iterator, as determined by the specified function. Read more

    source§

    fn position_minmax_by<F>(self, compare: F) -> MinMaxResult<usize>
    where Self: Sized, F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Return the postions of the minimum and maximum elements of an -iterator, as determined by the specified comparison function. Read more
    source§

    fn exactly_one(self) -> Result<Self::Item, ExactlyOneError<Self>>
    where +iterator, as determined by the specified comparison function. Read more

    source§

    fn exactly_one(self) -> Result<Self::Item, ExactlyOneError<Self>>
    where Self: Sized,

    If the iterator yields exactly one element, that element will be returned, otherwise an error will be returned containing an iterator that has the same output as the input -iterator. Read more
    source§

    fn at_most_one(self) -> Result<Option<Self::Item>, ExactlyOneError<Self>>
    where - Self: Sized,

    If the iterator yields no elements, Ok(None) will be returned. If the iterator yields +iterator. Read more
    source§

    fn at_most_one(self) -> Result<Option<Self::Item>, ExactlyOneError<Self>>
    where + Self: Sized,

    If the iterator yields no elements, Ok(None) will be returned. If the iterator yields exactly one element, that element will be returned, otherwise an error will be returned -containing an iterator that has the same output as the input iterator. Read more
    source§

    fn multipeek(self) -> MultiPeek<Self> ⓘ
    where +containing an iterator that has the same output as the input iterator. Read more

    source§

    fn multipeek(self) -> MultiPeek<Self> ⓘ
    where Self: Sized,

    An iterator adaptor that allows the user to peek at multiple .next() -values without advancing the base iterator. Read more
    source§

    fn counts(self) -> HashMap<Self::Item, usize>
    where +values without advancing the base iterator. Read more

    source§

    fn counts(self) -> HashMap<Self::Item, usize>
    where Self: Sized, Self::Item: Eq + Hash,

    Collect the items in this iterator and return a HashMap which contains each item that appears in the iterator and the number -of times it appears. Read more
    source§

    fn counts_by<K, F>(self, f: F) -> HashMap<K, usize>
    where +of times it appears. Read more

    source§

    fn counts_by<K, F>(self, f: F) -> HashMap<K, usize>
    where Self: Sized, K: Eq + Hash, F: FnMut(Self::Item) -> K,

    Collect the items in this iterator and return a HashMap which contains each item that appears in the iterator and the number of times it appears, -determining identity using a keying function. Read more
    source§

    fn multiunzip<FromI>(self) -> FromI
    where - Self: Sized + MultiUnzip<FromI>,

    Converts an iterator of tuples into a tuple of containers. Read more
    source§

    fn try_len(&self) -> Result<usize, (usize, Option<usize>)>

    Returns the length of the iterator if one exists. +determining identity using a keying function. Read more
    source§

    fn multiunzip<FromI>(self) -> FromI
    where + Self: Sized + MultiUnzip<FromI>,

    Converts an iterator of tuples into a tuple of containers. Read more
    source§

    fn try_len(&self) -> Result<usize, (usize, Option<usize>)>

    Returns the length of the iterator if one exists. Otherwise return self.size_hint(). Read more
    source§

    impl<T> 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 + 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/itertools/structs/struct.Positions.html b/itertools/structs/struct.Positions.html index 196ecb48f..adb5660de 100644 --- a/itertools/structs/struct.Positions.html +++ b/itertools/structs/struct.Positions.html @@ -1,10 +1,10 @@ -Positions in itertools::structs - Rust
    -

    Struct itertools::structs::Positions

    source · 
    pub struct Positions<I, F> { /* private fields */ }
    Expand description

    An iterator adapter to get the positions of each element that matches a predicate.

    +Positions in itertools::structs - Rust
    +

    Struct itertools::structs::Positions

    source · 
    pub struct Positions<I, F> { /* private fields */ }
    Expand description

    An iterator adapter to get the positions of each element that matches a predicate.

    See .positions() for more information.

    -

    Trait Implementations§

    source§

    impl<I: Clone, F: Clone> Clone for Positions<I, F>

    source§

    fn clone(&self) -> Positions<I, F> ⓘ

    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<I, F> Debug for Positions<I, F>
    where - I: Debug,

    source§

    fn fmt(&self, f: &mut Formatter<'_>) -> Result

    Formats the value using the given formatter. Read more
    source§

    impl<I, F> DoubleEndedIterator for Positions<I, F>
    where +

    Trait Implementations§

    source§

    impl<I: Clone, F: Clone> Clone for Positions<I, F>

    source§

    fn clone(&self) -> Positions<I, F> ⓘ

    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<I, F> Debug for Positions<I, F>
    where + I: Debug,

    source§

    fn fmt(&self, f: &mut Formatter<'_>) -> Result

    Formats the value using the given formatter. Read more
    source§

    impl<I, F> DoubleEndedIterator for Positions<I, F>
    where I: DoubleEndedIterator + ExactSizeIterator, - F: FnMut(I::Item) -> bool,

    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, G>(self, init: B, func: G) -> B
    where + F: FnMut(I::Item) -> bool,

    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, G>(self, init: B, func: G) -> B
    where G: 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, @@ -12,9 +12,9 @@ final value, starting from the back. 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<I, F> Iterator for Positions<I, F>
    where + P: FnMut(&Self::Item) -> bool,

    Searches for an element of an iterator from the back that satisfies a predicate. Read more
    source§

    impl<I, F> Iterator for Positions<I, F>
    where I: Iterator, - F: FnMut(I::Item) -> bool,

    §

    type Item = usize

    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, G>(self, init: B, func: G) -> B
    where + F: FnMut(I::Item) -> bool,

    §

    type Item = usize

    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, G>(self, init: B, func: G) -> B
    where G: 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 @@ -190,7 +190,7 @@ greater than or equal to those of another. 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, F> FusedIterator for Positions<I, F>
    where +function. Read more
    source§

    impl<I, F> FusedIterator for Positions<I, F>
    where I: FusedIterator, F: FnMut(I::Item) -> bool,

    Auto Trait Implementations§

    §

    impl<I, F> Freeze for Positions<I, F>
    where F: Freeze, @@ -220,86 +220,87 @@ otherwise. Right variant of Either<Self, Self> otherwise. Read more

    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> Itertools for T
    where - T: Iterator + ?Sized,

    source§

    fn interleave<J>(self, other: J) -> Interleave<Self, J::IntoIter> ⓘ
    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> Itertools for T
    where + T: Iterator + ?Sized,

    source§

    fn interleave<J>(self, other: J) -> Interleave<Self, J::IntoIter> ⓘ
    where J: IntoIterator<Item = Self::Item>, - Self: Sized,

    Alternate elements from two iterators until both have run out. Read more
    source§

    fn interleave_shortest<J>( + Self: Sized,

    Alternate elements from two iterators until both have run out. Read more
    source§

    fn interleave_shortest<J>( self, other: J ) -> InterleaveShortest<Self, J::IntoIter> ⓘ
    where J: IntoIterator<Item = Self::Item>, Self: Sized,

    Alternate elements from two iterators until at least one of them has run -out. Read more
    source§

    fn intersperse(self, element: Self::Item) -> Intersperse<Self>
    where +out. Read more

    source§

    fn intersperse(self, element: Self::Item) -> Intersperse<Self>
    where Self: Sized, Self::Item: Clone,

    An iterator adaptor to insert a particular value -between each element of the adapted iterator. Read more
    source§

    fn intersperse_with<F>(self, element: F) -> IntersperseWith<Self, F> ⓘ
    where +between each element of the adapted iterator. Read more

    source§

    fn intersperse_with<F>(self, element: F) -> IntersperseWith<Self, F> ⓘ
    where Self: Sized, F: FnMut() -> Self::Item,

    An iterator adaptor to insert a particular value created by a function -between each element of the adapted iterator. Read more
    source§

    fn zip_longest<J>(self, other: J) -> ZipLongest<Self, J::IntoIter> ⓘ
    where +between each element of the adapted iterator. Read more

    source§

    fn get<R>(self, index: R) -> R::Output
    where + Self: Sized, + R: IteratorIndex<Self>,

    Returns an iterator over a subsection of the iterator. Read more
    source§

    fn zip_longest<J>(self, other: J) -> ZipLongest<Self, J::IntoIter> ⓘ
    where J: IntoIterator, Self: Sized,

    Create an iterator which iterates over both this and the specified -iterator simultaneously, yielding pairs of two optional elements. Read more
    source§

    fn zip_eq<J>(self, other: J) -> ZipEq<Self, J::IntoIter> ⓘ
    where +iterator simultaneously, yielding pairs of two optional elements. Read more

    source§

    fn zip_eq<J>(self, other: J) -> ZipEq<Self, J::IntoIter> ⓘ
    where J: IntoIterator, Self: Sized,

    Create an iterator which iterates over both this and the specified -iterator simultaneously, yielding pairs of elements. Read more
    source§

    fn batching<B, F>(self, f: F) -> Batching<Self, F> ⓘ
    where +iterator simultaneously, yielding pairs of elements. Read more

    source§

    fn batching<B, F>(self, f: F) -> Batching<Self, F> ⓘ
    where F: FnMut(&mut Self) -> Option<B>, Self: Sized,

    A “meta iterator adaptor”. Its closure receives a reference to the iterator and may pick off as many elements as it likes, to produce the -next iterator element. Read more
    source§

    fn group_by<K, F>(self, key: F) -> GroupBy<K, Self, F>
    where +next iterator element. Read more

    source§

    fn chunk_by<K, F>(self, key: F) -> ChunkBy<K, Self, F>
    where Self: Sized, F: FnMut(&Self::Item) -> K, K: PartialEq,

    Return an iterable that can group iterator elements. Consecutive elements that map to the same key (“runs”), are assigned -to the same group. Read more
    source§

    fn chunks(self, size: usize) -> IntoChunks<Self>
    where - Self: Sized,

    Return an iterable that can chunk the iterator. Read more
    source§

    fn tuple_windows<T>(self) -> TupleWindows<Self, T> ⓘ
    where +to the same group. Read more

    source§

    fn group_by<K, F>(self, key: F) -> ChunkBy<K, Self, F>
    where + Self: Sized, + F: FnMut(&Self::Item) -> K, + K: PartialEq,

    👎Deprecated since 0.13.0: Use .chunk_by() instead
    See .chunk_by().
    source§

    fn chunks(self, size: usize) -> IntoChunks<Self>
    where + Self: Sized,

    Return an iterable that can chunk the iterator. Read more
    source§

    fn tuple_windows<T>(self) -> TupleWindows<Self, T> ⓘ
    where Self: Sized + Iterator<Item = T::Item>, T: HomogeneousTuple, T::Item: Clone,

    Return an iterator over all contiguous windows producing tuples of -a specific size (up to 12). Read more
    source§

    fn circular_tuple_windows<T>(self) -> CircularTupleWindows<Self, T> ⓘ
    where +a specific size (up to 12). Read more

    source§

    fn circular_tuple_windows<T>(self) -> CircularTupleWindows<Self, T> ⓘ
    where Self: Sized + Clone + Iterator<Item = T::Item> + ExactSizeIterator, T: TupleCollect + Clone, T::Item: Clone,

    Return an iterator over all windows, wrapping back to the first elements when the window would otherwise exceed the length of the -iterator, producing tuples of a specific size (up to 12). Read more
    source§

    fn tuples<T>(self) -> Tuples<Self, T> ⓘ
    where +iterator, producing tuples of a specific size (up to 12). Read more

    source§

    fn tuples<T>(self) -> Tuples<Self, T> ⓘ
    where Self: Sized + Iterator<Item = T::Item>, T: HomogeneousTuple,

    Return an iterator that groups the items in tuples of a specific size -(up to 12). Read more
    source§

    fn tee(self) -> (Tee<Self>, Tee<Self>)
    where +(up to 12). Read more

    source§

    fn tee(self) -> (Tee<Self>, Tee<Self>)
    where Self: Sized, Self::Item: Clone,

    Split into an iterator pair that both yield all elements from -the original iterator. Read more
    source§

    fn step(self, n: usize) -> Step<Self> ⓘ
    where - Self: Sized,

    👎Deprecated since 0.8.0: Use std .step_by() instead
    Return an iterator adaptor that steps n elements in the base iterator -for each iteration. Read more
    source§

    fn map_into<R>(self) -> MapInto<Self, R>
    where +the original iterator. Read more

    source§

    fn map_into<R>(self) -> MapInto<Self, R>
    where Self: Sized, - Self::Item: Into<R>,

    Convert each item of the iterator using the Into trait. Read more
    source§

    fn map_results<F, T, U, E>(self, f: F) -> MapOk<Self, F>
    where - Self: Iterator<Item = Result<T, E>> + Sized, - F: FnMut(T) -> U,

    👎Deprecated since 0.10.0: Use .map_ok() instead
    See .map_ok().
    source§

    fn map_ok<F, T, U, E>(self, f: F) -> MapOk<Self, F>
    where + Self::Item: Into<R>,

    Convert each item of the iterator using the Into trait. Read more
    source§

    fn map_ok<F, T, U, E>(self, f: F) -> MapOk<Self, F>
    where Self: Iterator<Item = Result<T, E>> + Sized, F: FnMut(T) -> U,

    Return an iterator adaptor that applies the provided closure to every Result::Ok value. Result::Err values are -unchanged. Read more
    source§

    fn filter_ok<F, T, E>(self, f: F) -> FilterOk<Self, F> ⓘ
    where +unchanged. Read more

    source§

    fn filter_ok<F, T, E>(self, f: F) -> FilterOk<Self, F> ⓘ
    where Self: Iterator<Item = Result<T, E>> + Sized, F: FnMut(&T) -> bool,

    Return an iterator adaptor that filters every Result::Ok value with the provided closure. Result::Err values are -unchanged. Read more
    source§

    fn filter_map_ok<F, T, U, E>(self, f: F) -> FilterMapOk<Self, F> ⓘ
    where +unchanged. Read more

    source§

    fn filter_map_ok<F, T, U, E>(self, f: F) -> FilterMapOk<Self, F> ⓘ
    where Self: Iterator<Item = Result<T, E>> + Sized, F: FnMut(T) -> Option<U>,

    Return an iterator adaptor that filters and transforms every Result::Ok value with the provided closure. Result::Err -values are unchanged. Read more
    source§

    fn flatten_ok<T, E>(self) -> FlattenOk<Self, T, E> ⓘ
    where +values are unchanged. Read more

    source§

    fn flatten_ok<T, E>(self) -> FlattenOk<Self, T, E> ⓘ
    where Self: Iterator<Item = Result<T, E>> + Sized, T: IntoIterator,

    Return an iterator adaptor that flattens every Result::Ok value into -a series of Result::Ok values. Result::Err values are unchanged. Read more
    source§

    fn process_results<F, T, E, R>(self, processor: F) -> Result<R, E>
    where +a series of Result::Ok values. Result::Err values are unchanged. Read more

    source§

    fn process_results<F, T, E, R>(self, processor: F) -> Result<R, E>
    where Self: Iterator<Item = Result<T, E>> + Sized, F: FnOnce(ProcessResults<'_, Self, E>) -> R,

    “Lift” a function of the values of the current iterator so as to process -an iterator of Result values instead. Read more
    source§

    fn merge<J>(self, other: J) -> Merge<Self, J::IntoIter>
    where +an iterator of Result values instead. Read more

    source§

    fn merge<J>(self, other: J) -> Merge<Self, J::IntoIter>
    where Self: Sized, Self::Item: PartialOrd, J: IntoIterator<Item = Self::Item>,

    Return an iterator adaptor that merges the two base iterators in ascending order. If both base iterators are sorted (ascending), the -result is sorted. Read more
    source§

    fn merge_by<J, F>(self, other: J, is_first: F) -> MergeBy<Self, J::IntoIter, F> ⓘ
    where +result is sorted. Read more

    source§

    fn merge_by<J, F>(self, other: J, is_first: F) -> MergeBy<Self, J::IntoIter, F> ⓘ
    where Self: Sized, J: IntoIterator<Item = Self::Item>, F: FnMut(&Self::Item, &Self::Item) -> bool,

    Return an iterator adaptor that merges the two base iterators in order. -This is much like .merge() but allows for a custom ordering. Read more
    source§

    fn merge_join_by<J, F, T>( +This is much like .merge() but allows for a custom ordering. Read more

    source§

    fn merge_join_by<J, F, T>( self, other: J, cmp_fn: F @@ -307,285 +308,296 @@ This is much like IntoIterator, F: FnMut(&Self::Item, &J::Item) -> T, Self: Sized,

    Create an iterator that merges items from both this and the specified -iterator in ascending order. Read more
    source§

    fn kmerge(self) -> KMerge<<Self::Item as IntoIterator>::IntoIter>
    where +iterator in ascending order. Read more

    source§

    fn kmerge(self) -> KMerge<<Self::Item as IntoIterator>::IntoIter>
    where Self: Sized, Self::Item: IntoIterator, <Self::Item as IntoIterator>::Item: PartialOrd,

    Return an iterator adaptor that flattens an iterator of iterators by -merging them in ascending order. Read more
    source§

    fn kmerge_by<F>( +merging them in ascending order. Read more

    source§

    fn kmerge_by<F>( self, first: F ) -> KMergeBy<<Self::Item as IntoIterator>::IntoIter, F> ⓘ
    where Self: Sized, Self::Item: IntoIterator, F: FnMut(&<Self::Item as IntoIterator>::Item, &<Self::Item as IntoIterator>::Item) -> bool,

    Return an iterator adaptor that flattens an iterator of iterators by -merging them according to the given closure. Read more
    source§

    fn cartesian_product<J>(self, other: J) -> Product<Self, J::IntoIter> ⓘ
    where +merging them according to the given closure. Read more

    source§

    fn cartesian_product<J>(self, other: J) -> Product<Self, J::IntoIter> ⓘ
    where Self: Sized, Self::Item: Clone, J: IntoIterator, J::IntoIter: Clone,

    Return an iterator adaptor that iterates over the cartesian product of -the element sets of two iterators self and J. Read more
    source§

    fn multi_cartesian_product( +the element sets of two iterators self and J. Read more

    source§

    fn multi_cartesian_product( self ) -> MultiProduct<<Self::Item as IntoIterator>::IntoIter> ⓘ
    where Self: Sized, Self::Item: IntoIterator, <Self::Item as IntoIterator>::IntoIter: Clone, <Self::Item as IntoIterator>::Item: Clone,

    Return an iterator adaptor that iterates over the cartesian product of -all subiterators returned by meta-iterator self. Read more
    source§

    fn coalesce<F>(self, f: F) -> Coalesce<Self, F>
    where +all subiterators returned by meta-iterator self. Read more

    source§

    fn coalesce<F>(self, f: F) -> Coalesce<Self, F>
    where Self: Sized, F: FnMut(Self::Item, Self::Item) -> Result<Self::Item, (Self::Item, Self::Item)>,

    Return an iterator adaptor that uses the passed-in closure to -optionally merge together consecutive elements. Read more
    source§

    fn dedup(self) -> Dedup<Self>
    where +optionally merge together consecutive elements. Read more

    source§

    fn dedup(self) -> Dedup<Self>
    where Self: Sized, Self::Item: PartialEq,

    Remove duplicates from sections of consecutive identical elements. -If the iterator is sorted, all elements will be unique. Read more
    source§

    fn dedup_by<Cmp>(self, cmp: Cmp) -> DedupBy<Self, Cmp>
    where +If the iterator is sorted, all elements will be unique. Read more

    source§

    fn dedup_by<Cmp>(self, cmp: Cmp) -> DedupBy<Self, Cmp>
    where Self: Sized, Cmp: FnMut(&Self::Item, &Self::Item) -> bool,

    Remove duplicates from sections of consecutive identical elements, determining equality using a comparison function. -If the iterator is sorted, all elements will be unique. Read more
    source§

    fn dedup_with_count(self) -> DedupWithCount<Self>
    where +If the iterator is sorted, all elements will be unique. Read more

    source§

    fn dedup_with_count(self) -> DedupWithCount<Self>
    where Self: Sized,

    Remove duplicates from sections of consecutive identical elements, while keeping a count of how many repeated elements were present. -If the iterator is sorted, all elements will be unique. Read more
    source§

    fn dedup_by_with_count<Cmp>(self, cmp: Cmp) -> DedupByWithCount<Self, Cmp>
    where +If the iterator is sorted, all elements will be unique. Read more

    source§

    fn dedup_by_with_count<Cmp>(self, cmp: Cmp) -> DedupByWithCount<Self, Cmp>
    where Self: Sized, Cmp: FnMut(&Self::Item, &Self::Item) -> bool,

    Remove duplicates from sections of consecutive identical elements, while keeping a count of how many repeated elements were present. This will determine equality using a comparison function. -If the iterator is sorted, all elements will be unique. Read more
    source§

    fn duplicates(self) -> Duplicates<Self>
    where +If the iterator is sorted, all elements will be unique. Read more

    source§

    fn duplicates(self) -> Duplicates<Self>
    where Self: Sized, Self::Item: Eq + Hash,

    Return an iterator adaptor that produces elements that appear more than once during the -iteration. Duplicates are detected using hash and equality. Read more
    source§

    fn duplicates_by<V, F>(self, f: F) -> DuplicatesBy<Self, V, F>
    where +iteration. Duplicates are detected using hash and equality. Read more

    source§

    fn duplicates_by<V, F>(self, f: F) -> DuplicatesBy<Self, V, F>
    where Self: Sized, V: Eq + Hash, F: FnMut(&Self::Item) -> V,

    Return an iterator adaptor that produces elements that appear more than once during the -iteration. Duplicates are detected using hash and equality. Read more
    source§

    fn unique(self) -> Unique<Self> ⓘ
    where +iteration. Duplicates are detected using hash and equality. Read more

    source§

    fn unique(self) -> Unique<Self> ⓘ
    where Self: Sized, Self::Item: Clone + Eq + Hash,

    Return an iterator adaptor that filters out elements that have already been produced once during the iteration. Duplicates -are detected using hash and equality. Read more
    source§

    fn unique_by<V, F>(self, f: F) -> UniqueBy<Self, V, F> ⓘ
    where +are detected using hash and equality. Read more

    source§

    fn unique_by<V, F>(self, f: F) -> UniqueBy<Self, V, F> ⓘ
    where Self: Sized, V: Eq + Hash, F: FnMut(&Self::Item) -> V,

    Return an iterator adaptor that filters out elements that have -already been produced once during the iteration. Read more
    source§

    fn peeking_take_while<F>(&mut self, accept: F) -> PeekingTakeWhile<'_, Self, F> ⓘ
    where +already been produced once during the iteration. Read more

    source§

    fn peeking_take_while<F>(&mut self, accept: F) -> PeekingTakeWhile<'_, Self, F> ⓘ
    where Self: Sized + PeekingNext, F: FnMut(&Self::Item) -> bool,

    Return an iterator adaptor that borrows from this iterator and -takes items while the closure accept returns true. Read more
    source§

    fn take_while_ref<F>(&mut self, accept: F) -> TakeWhileRef<'_, Self, F> ⓘ
    where +takes items while the closure accept returns true. Read more

    source§

    fn take_while_ref<F>(&mut self, accept: F) -> TakeWhileRef<'_, Self, F> ⓘ
    where Self: Clone, F: FnMut(&Self::Item) -> bool,

    Return an iterator adaptor that borrows from a Clone-able iterator -to only pick off elements while the predicate accept returns true. Read more
    source§

    fn take_while_inclusive<F>(self, accept: F) -> TakeWhileInclusive<Self, F> ⓘ
    where +to only pick off elements while the predicate accept returns true. Read more

    source§

    fn take_while_inclusive<F>(self, accept: F) -> TakeWhileInclusive<Self, F> ⓘ
    where Self: Sized, F: FnMut(&Self::Item) -> bool,

    Returns an iterator adaptor that consumes elements while the given predicate is true, including the element for which the predicate -first returned false. Read more
    source§

    fn while_some<A>(self) -> WhileSome<Self> ⓘ
    where +first returned false. Read more

    source§

    fn while_some<A>(self) -> WhileSome<Self> ⓘ
    where Self: Sized + Iterator<Item = Option<A>>,

    Return an iterator adaptor that filters Option<A> iterator elements -and produces A. Stops on the first None encountered. Read more
    source§

    fn tuple_combinations<T>(self) -> TupleCombinations<Self, T> ⓘ
    where +and produces A. Stops on the first None encountered. Read more

    source§

    fn tuple_combinations<T>(self) -> TupleCombinations<Self, T> ⓘ
    where Self: Sized + Clone, Self::Item: Clone, T: HasCombination<Self>,

    Return an iterator adaptor that iterates over the combinations of the -elements from an iterator. Read more
    source§

    fn combinations(self, k: usize) -> Combinations<Self> ⓘ
    where +elements from an iterator. Read more

    source§

    fn combinations(self, k: usize) -> Combinations<Self> ⓘ
    where Self: Sized, Self::Item: Clone,

    Return an iterator adaptor that iterates over the k-length combinations of -the elements from an iterator. Read more
    source§

    fn combinations_with_replacement( +the elements from an iterator. Read more

    source§

    fn combinations_with_replacement( self, k: usize ) -> CombinationsWithReplacement<Self> ⓘ
    where Self: Sized, Self::Item: Clone,

    Return an iterator that iterates over the k-length combinations of -the elements from an iterator, with replacement. Read more
    source§

    fn permutations(self, k: usize) -> Permutations<Self> ⓘ
    where +the elements from an iterator, with replacement. Read more

    source§

    fn permutations(self, k: usize) -> Permutations<Self> ⓘ
    where Self: Sized, Self::Item: Clone,

    Return an iterator adaptor that iterates over all k-permutations of the -elements from an iterator. Read more
    source§

    fn powerset(self) -> Powerset<Self> ⓘ
    where +elements from an iterator. Read more

    source§

    fn powerset(self) -> Powerset<Self> ⓘ
    where Self: Sized, Self::Item: Clone,

    Return an iterator that iterates through the powerset of the elements from an -iterator. Read more
    source§

    fn pad_using<F>(self, min: usize, f: F) -> PadUsing<Self, F> ⓘ
    where +iterator. Read more

    source§

    fn pad_using<F>(self, min: usize, f: F) -> PadUsing<Self, F> ⓘ
    where Self: Sized, F: FnMut(usize) -> Self::Item,

    Return an iterator adaptor that pads the sequence to a minimum length of -min by filling missing elements using a closure f. Read more
    source§

    fn with_position(self) -> WithPosition<Self> ⓘ
    where +min by filling missing elements using a closure f. Read more

    source§

    fn with_position(self) -> WithPosition<Self> ⓘ
    where Self: Sized,

    Return an iterator adaptor that combines each element with a Position to -ease special-case handling of the first or last elements. Read more
    source§

    fn positions<P>(self, predicate: P) -> Positions<Self, P> ⓘ
    where +ease special-case handling of the first or last elements. Read more

    source§

    fn positions<P>(self, predicate: P) -> Positions<Self, P> ⓘ
    where Self: Sized, P: FnMut(Self::Item) -> bool,

    Return an iterator adaptor that yields the indices of all elements -satisfying a predicate, counted from the start of the iterator. Read more
    source§

    fn update<F>(self, updater: F) -> Update<Self, F> ⓘ
    where +satisfying a predicate, counted from the start of the iterator. Read more

    source§

    fn update<F>(self, updater: F) -> Update<Self, F> ⓘ
    where Self: Sized, F: FnMut(&mut Self::Item),

    Return an iterator adaptor that applies a mutating function -to each element before yielding it. Read more
    source§

    fn next_tuple<T>(&mut self) -> Option<T>
    where +to each element before yielding it. Read more

    source§

    fn next_tuple<T>(&mut self) -> Option<T>
    where Self: Sized + Iterator<Item = T::Item>, T: HomogeneousTuple,

    Advances the iterator and returns the next items grouped in a tuple of -a specific size (up to 12). Read more
    source§

    fn collect_tuple<T>(self) -> Option<T>
    where +a specific size (up to 12). Read more

    source§

    fn collect_tuple<T>(self) -> Option<T>
    where Self: Sized + Iterator<Item = T::Item>, T: HomogeneousTuple,

    Collects all items from the iterator into a tuple of a specific size -(up to 12). Read more
    source§

    fn find_position<P>(&mut self, pred: P) -> Option<(usize, Self::Item)>
    where - P: FnMut(&Self::Item) -> bool,

    Find the position and value of the first element satisfying a predicate. Read more
    source§

    fn find_or_last<P>(self, predicate: P) -> Option<Self::Item>
    where +(up to 12). Read more

    source§

    fn find_position<P>(&mut self, pred: P) -> Option<(usize, Self::Item)>
    where + P: FnMut(&Self::Item) -> bool,

    Find the position and value of the first element satisfying a predicate. Read more
    source§

    fn find_or_last<P>(self, predicate: P) -> Option<Self::Item>
    where Self: Sized, - P: FnMut(&Self::Item) -> bool,

    Find the value of the first element satisfying a predicate or return the last element, if any. Read more
    source§

    fn find_or_first<P>(self, predicate: P) -> Option<Self::Item>
    where + P: FnMut(&Self::Item) -> bool,

    Find the value of the first element satisfying a predicate or return the last element, if any. Read more
    source§

    fn find_or_first<P>(self, predicate: P) -> Option<Self::Item>
    where Self: Sized, - P: FnMut(&Self::Item) -> bool,

    Find the value of the first element satisfying a predicate or return the first element, if any. Read more
    source§

    fn contains<Q>(&mut self, query: &Q) -> bool
    where + P: FnMut(&Self::Item) -> bool,

    Find the value of the first element satisfying a predicate or return the first element, if any. Read more
    source§

    fn contains<Q>(&mut self, query: &Q) -> bool
    where Self: Sized, Self::Item: Borrow<Q>, - Q: PartialEq,

    Returns true if the given item is present in this iterator. Read more
    source§

    fn all_equal(&mut self) -> bool
    where + Q: PartialEq,

    Returns true if the given item is present in this iterator. Read more
    source§

    fn all_equal(&mut self) -> bool
    where Self: Sized, - Self::Item: PartialEq,

    Check whether all elements compare equal. Read more
    source§

    fn all_equal_value( + Self::Item: PartialEq,

    Check whether all elements compare equal. Read more
    source§

    fn all_equal_value( &mut self ) -> Result<Self::Item, Option<(Self::Item, Self::Item)>>
    where Self: Sized, Self::Item: PartialEq,

    If there are elements and they are all equal, return a single copy of that element. If there are no elements, return an Error containing None. If there are elements and they are not all equal, return a tuple containing the first -two non-equal elements found. Read more
    source§

    fn all_unique(&mut self) -> bool
    where +two non-equal elements found. Read more

    source§

    fn all_unique(&mut self) -> bool
    where Self: Sized, - Self::Item: Eq + Hash,

    Check whether all elements are unique (non equal). Read more
    source§

    fn dropping(self, n: usize) -> Self
    where + Self::Item: Eq + Hash,

    Check whether all elements are unique (non equal). Read more
    source§

    fn dropping(self, n: usize) -> Self
    where Self: Sized,

    Consume the first n elements from the iterator eagerly, -and return the same iterator again. Read more
    source§

    fn dropping_back(self, n: usize) -> Self
    where +and return the same iterator again. Read more

    source§

    fn dropping_back(self, n: usize) -> Self
    where Self: Sized + DoubleEndedIterator,

    Consume the last n elements from the iterator eagerly, -and return the same iterator again. Read more
    source§

    fn foreach<F>(self, f: F)
    where - F: FnMut(Self::Item), - Self: Sized,

    👎Deprecated since 0.8.0: Use .for_each() instead
    Run the closure f eagerly on each element of the iterator. Read more
    source§

    fn concat(self) -> Self::Item
    where +and return the same iterator again. Read more

    source§

    fn concat(self) -> Self::Item
    where Self: Sized, - Self::Item: Extend<<<Self as Iterator>::Item as IntoIterator>::Item> + IntoIterator + Default,

    Combine all an iterator’s elements into one element by using Extend. Read more
    source§

    fn collect_vec(self) -> Vec<Self::Item>
    where + Self::Item: Extend<<<Self as Iterator>::Item as IntoIterator>::Item> + IntoIterator + Default,

    Combine all an iterator’s elements into one element by using Extend. Read more
    source§

    fn collect_vec(self) -> Vec<Self::Item>
    where Self: Sized,

    .collect_vec() is simply a type specialization of Iterator::collect, -for convenience.
    source§

    fn try_collect<T, U, E>(self) -> Result<U, E>
    where +for convenience.

    source§

    fn try_collect<T, U, E>(self) -> Result<U, E>
    where Self: Sized + Iterator<Item = Result<T, E>>, Result<U, E>: FromIterator<Result<T, E>>,

    .try_collect() is more convenient way of writing -.collect::<Result<_, _>>() Read more
    source§

    fn set_from<'a, A: 'a, J>(&mut self, from: J) -> usize
    where +.collect::<Result<_, _>>() Read more

    source§

    fn set_from<'a, A: 'a, J>(&mut self, from: J) -> usize
    where Self: Iterator<Item = &'a mut A>, J: IntoIterator<Item = A>,

    Assign to each reference in self from the from iterator, -stopping at the shortest of the two iterators. Read more
    source§

    fn join(&mut self, sep: &str) -> String
    where - Self::Item: Display,

    Combine all iterator elements into one String, separated by sep. Read more
    source§

    fn format(self, sep: &str) -> Format<'_, Self>
    where - Self: Sized,

    Format all iterator elements, separated by sep. Read more
    source§

    fn format_with<F>(self, sep: &str, format: F) -> FormatWith<'_, Self, F>
    where +stopping at the shortest of the two iterators. Read more

    source§

    fn join(&mut self, sep: &str) -> String
    where + Self::Item: Display,

    Combine all iterator elements into one String, separated by sep. Read more
    source§

    fn format(self, sep: &str) -> Format<'_, Self>
    where + Self: Sized,

    Format all iterator elements, separated by sep. Read more
    source§

    fn format_with<F>(self, sep: &str, format: F) -> FormatWith<'_, Self, F>
    where Self: Sized, - F: FnMut(Self::Item, &mut dyn FnMut(&dyn Display) -> Result) -> Result,

    Format all iterator elements, separated by sep. Read more
    source§

    fn fold_results<A, E, B, F>(&mut self, start: B, f: F) -> Result<B, E>
    where + F: FnMut(Self::Item, &mut dyn FnMut(&dyn Display) -> Result) -> Result,

    Format all iterator elements, separated by sep. Read more
    source§

    fn fold_ok<A, E, B, F>(&mut self, start: B, f: F) -> Result<B, E>
    where Self: Iterator<Item = Result<A, E>>, - F: FnMut(B, A) -> B,

    👎Deprecated since 0.10.0: Use .fold_ok() instead
    See .fold_ok().
    source§

    fn fold_ok<A, E, B, F>(&mut self, start: B, f: F) -> Result<B, E>
    where - Self: Iterator<Item = Result<A, E>>, - F: FnMut(B, A) -> B,

    Fold Result values from an iterator. Read more
    source§

    fn fold_options<A, B, F>(&mut self, start: B, f: F) -> Option<B>
    where + F: FnMut(B, A) -> B,

    Fold Result values from an iterator. Read more
    source§

    fn fold_options<A, B, F>(&mut self, start: B, f: F) -> Option<B>
    where Self: Iterator<Item = Option<A>>, - F: FnMut(B, A) -> B,

    Fold Option values from an iterator. Read more
    source§

    fn fold1<F>(self, f: F) -> Option<Self::Item>
    where + F: FnMut(B, A) -> B,

    Fold Option values from an iterator. Read more
    source§

    fn fold1<F>(self, f: F) -> Option<Self::Item>
    where F: FnMut(Self::Item, Self::Item) -> Self::Item, - Self: Sized,

    👎Deprecated since 0.10.2: Use Iterator::reduce instead
    Accumulator of the elements in the iterator. Read more
    source§

    fn tree_fold1<F>(self, f: F) -> Option<Self::Item>
    where + Self: Sized,

    👎Deprecated since 0.10.2: Use Iterator::reduce instead
    Accumulator of the elements in the iterator. Read more
    source§

    fn tree_reduce<F>(self, f: F) -> Option<Self::Item>
    where F: FnMut(Self::Item, Self::Item) -> Self::Item, - Self: Sized,

    Accumulate the elements in the iterator in a tree-like manner. Read more
    source§

    fn fold_while<B, F>(&mut self, init: B, f: F) -> FoldWhile<B>
    where + Self: Sized,

    Accumulate the elements in the iterator in a tree-like manner. Read more
    source§

    fn tree_fold1<F>(self, f: F) -> Option<Self::Item>
    where + F: FnMut(Self::Item, Self::Item) -> Self::Item, + Self: Sized,

    👎Deprecated since 0.13.0: Use .tree_reduce() instead
    See .tree_reduce().
    source§

    fn fold_while<B, F>(&mut self, init: B, f: F) -> FoldWhile<B>
    where Self: Sized, - F: FnMut(B, Self::Item) -> FoldWhile<B>,

    An iterator method that applies a function, producing a single, final value. Read more
    source§

    fn sum1<S>(self) -> Option<S>
    where + F: FnMut(B, Self::Item) -> FoldWhile<B>,

    An iterator method that applies a function, producing a single, final value. Read more
    source§

    fn sum1<S>(self) -> Option<S>
    where Self: Sized, - S: Sum<Self::Item>,

    Iterate over the entire iterator and add all the elements. Read more
    source§

    fn product1<P>(self) -> Option<P>
    where + S: Sum<Self::Item>,

    Iterate over the entire iterator and add all the elements. Read more
    source§

    fn product1<P>(self) -> Option<P>
    where Self: Sized, - P: Product<Self::Item>,

    Iterate over the entire iterator and multiply all the elements. Read more
    source§

    fn sorted_unstable(self) -> IntoIter<Self::Item> ⓘ
    where + P: Product<Self::Item>,

    Iterate over the entire iterator and multiply all the elements. Read more
    source§

    fn sorted_unstable(self) -> IntoIter<Self::Item> ⓘ
    where Self: Sized, - Self::Item: Ord,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_unstable_by<F>(self, cmp: F) -> IntoIter<Self::Item> ⓘ
    where + Self::Item: Ord,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_unstable_by<F>(self, cmp: F) -> IntoIter<Self::Item> ⓘ
    where Self: Sized, - F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_unstable_by_key<K, F>(self, f: F) -> IntoIter<Self::Item> ⓘ
    where + F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_unstable_by_key<K, F>(self, f: F) -> IntoIter<Self::Item> ⓘ
    where Self: Sized, K: Ord, - F: FnMut(&Self::Item) -> K,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted(self) -> IntoIter<Self::Item> ⓘ
    where + F: FnMut(&Self::Item) -> K,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted(self) -> IntoIter<Self::Item> ⓘ
    where Self: Sized, - Self::Item: Ord,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_by<F>(self, cmp: F) -> IntoIter<Self::Item> ⓘ
    where + Self::Item: Ord,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_by<F>(self, cmp: F) -> IntoIter<Self::Item> ⓘ
    where Self: Sized, - F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_by_key<K, F>(self, f: F) -> IntoIter<Self::Item> ⓘ
    where + F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_by_key<K, F>(self, f: F) -> IntoIter<Self::Item> ⓘ
    where Self: Sized, K: Ord, - F: FnMut(&Self::Item) -> K,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_by_cached_key<K, F>(self, f: F) -> IntoIter<Self::Item> ⓘ
    where + F: FnMut(&Self::Item) -> K,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_by_cached_key<K, F>(self, f: F) -> IntoIter<Self::Item> ⓘ
    where Self: Sized, K: Ord, F: FnMut(&Self::Item) -> K,

    Sort all iterator elements into a new iterator in ascending order. The key function is -called exactly once per key. Read more
    source§

    fn k_smallest(self, k: usize) -> IntoIter<Self::Item> ⓘ
    where +called exactly once per key. Read more

    source§

    fn k_smallest(self, k: usize) -> IntoIter<Self::Item> ⓘ
    where Self: Sized, - Self::Item: Ord,

    Sort the k smallest elements into a new iterator, in ascending order. Read more
    source§

    fn partition_map<A, B, F, L, R>(self, predicate: F) -> (A, B)
    where + Self::Item: Ord,

    Sort the k smallest elements into a new iterator, in ascending order. Read more
    source§

    fn k_smallest_by<F>(self, k: usize, cmp: F) -> IntoIter<Self::Item> ⓘ
    where + Self: Sized, + F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Sort the k smallest elements into a new iterator using the provided comparison. Read more
    source§

    fn k_smallest_by_key<F, K>(self, k: usize, key: F) -> IntoIter<Self::Item> ⓘ
    where + Self: Sized, + F: FnMut(&Self::Item) -> K, + K: Ord,

    Return the elements producing the k smallest outputs of the provided function. Read more
    source§

    fn k_largest(self, k: usize) -> IntoIter<Self::Item> ⓘ
    where + Self: Sized, + Self::Item: Ord,

    Sort the k largest elements into a new iterator, in descending order. Read more
    source§

    fn k_largest_by<F>(self, k: usize, cmp: F) -> IntoIter<Self::Item> ⓘ
    where + Self: Sized, + F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Sort the k largest elements into a new iterator using the provided comparison. Read more
    source§

    fn k_largest_by_key<F, K>(self, k: usize, key: F) -> IntoIter<Self::Item> ⓘ
    where + Self: Sized, + F: FnMut(&Self::Item) -> K, + K: Ord,

    Return the elements producing the k largest outputs of the provided function. Read more
    source§

    fn tail(self, n: usize) -> IntoIter<Self::Item> ⓘ
    where + Self: Sized,

    Consumes the iterator and return an iterator of the last n elements. Read more
    source§

    fn partition_map<A, B, F, L, R>(self, predicate: F) -> (A, B)
    where Self: Sized, F: FnMut(Self::Item) -> Either<L, R>, A: Default + Extend<L>, B: Default + Extend<R>,

    Collect all iterator elements into one of two partitions. Unlike Iterator::partition, each partition may -have a distinct type. Read more
    source§

    fn partition_result<A, B, T, E>(self) -> (A, B)
    where +have a distinct type. Read more

    source§

    fn partition_result<A, B, T, E>(self) -> (A, B)
    where Self: Iterator<Item = Result<T, E>> + Sized, A: Default + Extend<T>, B: Default + Extend<E>,

    Partition a sequence of Results into one list of all the Ok elements -and another list of all the Err elements. Read more
    source§

    fn into_group_map<K, V>(self) -> HashMap<K, Vec<V>>
    where +and another list of all the Err elements. Read more

    source§

    fn into_group_map<K, V>(self) -> HashMap<K, Vec<V>>
    where Self: Iterator<Item = (K, V)> + Sized, K: Hash + Eq,

    Return a HashMap of keys mapped to Vecs of values. Keys and values -are taken from (Key, Value) tuple pairs yielded by the input iterator. Read more
    source§

    fn into_group_map_by<K, V, F>(self, f: F) -> HashMap<K, Vec<V>>
    where +are taken from (Key, Value) tuple pairs yielded by the input iterator. Read more

    source§

    fn into_group_map_by<K, V, F>(self, f: F) -> HashMap<K, Vec<V>>
    where Self: Iterator<Item = V> + Sized, K: Hash + Eq, - F: Fn(&V) -> K,

    Return an Iterator on a HashMap. Keys mapped to Vecs of values. The key is specified -in the closure. Read more
    source§

    fn into_grouping_map<K, V>(self) -> GroupingMap<Self>
    where + F: FnMut(&V) -> K,

    Return an Iterator on a HashMap. Keys mapped to Vecs of values. The key is specified +in the closure. Read more
    source§

    fn into_grouping_map<K, V>(self) -> GroupingMap<Self>
    where Self: Iterator<Item = (K, V)> + Sized, K: Hash + Eq,

    Constructs a GroupingMap to be used later with one of the efficient -group-and-fold operations it allows to perform. Read more
    source§

    fn into_grouping_map_by<K, V, F>(self, key_mapper: F) -> GroupingMapBy<Self, F>
    where +group-and-fold operations it allows to perform. Read more

    source§

    fn into_grouping_map_by<K, V, F>(self, key_mapper: F) -> GroupingMapBy<Self, F>
    where Self: Iterator<Item = V> + Sized, K: Hash + Eq, F: FnMut(&V) -> K,

    Constructs a GroupingMap to be used later with one of the efficient -group-and-fold operations it allows to perform. Read more
    source§

    fn min_set(self) -> Vec<Self::Item>
    where +group-and-fold operations it allows to perform. Read more

    source§

    fn min_set(self) -> Vec<Self::Item>
    where Self: Sized, - Self::Item: Ord,

    Return all minimum elements of an iterator. Read more
    source§

    fn min_set_by<F>(self, compare: F) -> Vec<Self::Item>
    where + Self::Item: Ord,

    Return all minimum elements of an iterator. Read more
    source§

    fn min_set_by<F>(self, compare: F) -> Vec<Self::Item>
    where Self: Sized, F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Return all minimum elements of an iterator, as determined by -the specified function. Read more
    source§

    fn min_set_by_key<K, F>(self, key: F) -> Vec<Self::Item>
    where +the specified function. Read more

    source§

    fn min_set_by_key<K, F>(self, key: F) -> Vec<Self::Item>
    where Self: Sized, K: Ord, F: FnMut(&Self::Item) -> K,

    Return all minimum elements of an iterator, as determined by -the specified function. Read more
    source§

    fn max_set(self) -> Vec<Self::Item>
    where +the specified function. Read more

    source§

    fn max_set(self) -> Vec<Self::Item>
    where Self: Sized, - Self::Item: Ord,

    Return all maximum elements of an iterator. Read more
    source§

    fn max_set_by<F>(self, compare: F) -> Vec<Self::Item>
    where + Self::Item: Ord,

    Return all maximum elements of an iterator. Read more
    source§

    fn max_set_by<F>(self, compare: F) -> Vec<Self::Item>
    where Self: Sized, F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Return all maximum elements of an iterator, as determined by -the specified function. Read more
    source§

    fn max_set_by_key<K, F>(self, key: F) -> Vec<Self::Item>
    where +the specified function. Read more

    source§

    fn max_set_by_key<K, F>(self, key: F) -> Vec<Self::Item>
    where Self: Sized, K: Ord, F: FnMut(&Self::Item) -> K,

    Return all maximum elements of an iterator, as determined by -the specified function. Read more
    source§

    fn minmax(self) -> MinMaxResult<Self::Item>
    where +the specified function. Read more

    source§

    fn minmax(self) -> MinMaxResult<Self::Item>
    where Self: Sized, - Self::Item: PartialOrd,

    Return the minimum and maximum elements in the iterator. Read more
    source§

    fn minmax_by_key<K, F>(self, key: F) -> MinMaxResult<Self::Item>
    where + Self::Item: PartialOrd,

    Return the minimum and maximum elements in the iterator. Read more
    source§

    fn minmax_by_key<K, F>(self, key: F) -> MinMaxResult<Self::Item>
    where Self: Sized, K: PartialOrd, F: FnMut(&Self::Item) -> K,

    Return the minimum and maximum element of an iterator, as determined by -the specified function. Read more
    source§

    fn minmax_by<F>(self, compare: F) -> MinMaxResult<Self::Item>
    where +the specified function. Read more

    source§

    fn minmax_by<F>(self, compare: F) -> MinMaxResult<Self::Item>
    where Self: Sized, F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Return the minimum and maximum element of an iterator, as determined by -the specified comparison function. Read more
    source§

    fn position_max(self) -> Option<usize>
    where +the specified comparison function. Read more

    source§

    fn position_max(self) -> Option<usize>
    where Self: Sized, - Self::Item: Ord,

    Return the position of the maximum element in the iterator. Read more
    source§

    fn position_max_by_key<K, F>(self, key: F) -> Option<usize>
    where + Self::Item: Ord,

    Return the position of the maximum element in the iterator. Read more
    source§

    fn position_max_by_key<K, F>(self, key: F) -> Option<usize>
    where Self: Sized, K: Ord, F: FnMut(&Self::Item) -> K,

    Return the position of the maximum element in the iterator, as -determined by the specified function. Read more
    source§

    fn position_max_by<F>(self, compare: F) -> Option<usize>
    where +determined by the specified function. Read more

    source§

    fn position_max_by<F>(self, compare: F) -> Option<usize>
    where Self: Sized, F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Return the position of the maximum element in the iterator, as -determined by the specified comparison function. Read more
    source§

    fn position_min(self) -> Option<usize>
    where +determined by the specified comparison function. Read more

    source§

    fn position_min(self) -> Option<usize>
    where Self: Sized, - Self::Item: Ord,

    Return the position of the minimum element in the iterator. Read more
    source§

    fn position_min_by_key<K, F>(self, key: F) -> Option<usize>
    where + Self::Item: Ord,

    Return the position of the minimum element in the iterator. Read more
    source§

    fn position_min_by_key<K, F>(self, key: F) -> Option<usize>
    where Self: Sized, K: Ord, F: FnMut(&Self::Item) -> K,

    Return the position of the minimum element in the iterator, as -determined by the specified function. Read more
    source§

    fn position_min_by<F>(self, compare: F) -> Option<usize>
    where +determined by the specified function. Read more

    source§

    fn position_min_by<F>(self, compare: F) -> Option<usize>
    where Self: Sized, F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Return the position of the minimum element in the iterator, as -determined by the specified comparison function. Read more
    source§

    fn position_minmax(self) -> MinMaxResult<usize>
    where +determined by the specified comparison function. Read more

    source§

    fn position_minmax(self) -> MinMaxResult<usize>
    where Self: Sized, Self::Item: PartialOrd,

    Return the positions of the minimum and maximum elements in -the iterator. Read more
    source§

    fn position_minmax_by_key<K, F>(self, key: F) -> MinMaxResult<usize>
    where +the iterator. Read more

    source§

    fn position_minmax_by_key<K, F>(self, key: F) -> MinMaxResult<usize>
    where Self: Sized, K: PartialOrd, F: FnMut(&Self::Item) -> K,

    Return the postions of the minimum and maximum elements of an -iterator, as determined by the specified function. Read more
    source§

    fn position_minmax_by<F>(self, compare: F) -> MinMaxResult<usize>
    where +iterator, as determined by the specified function. Read more

    source§

    fn position_minmax_by<F>(self, compare: F) -> MinMaxResult<usize>
    where Self: Sized, F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Return the postions of the minimum and maximum elements of an -iterator, as determined by the specified comparison function. Read more
    source§

    fn exactly_one(self) -> Result<Self::Item, ExactlyOneError<Self>>
    where +iterator, as determined by the specified comparison function. Read more

    source§

    fn exactly_one(self) -> Result<Self::Item, ExactlyOneError<Self>>
    where Self: Sized,

    If the iterator yields exactly one element, that element will be returned, otherwise an error will be returned containing an iterator that has the same output as the input -iterator. Read more
    source§

    fn at_most_one(self) -> Result<Option<Self::Item>, ExactlyOneError<Self>>
    where - Self: Sized,

    If the iterator yields no elements, Ok(None) will be returned. If the iterator yields +iterator. Read more
    source§

    fn at_most_one(self) -> Result<Option<Self::Item>, ExactlyOneError<Self>>
    where + Self: Sized,

    If the iterator yields no elements, Ok(None) will be returned. If the iterator yields exactly one element, that element will be returned, otherwise an error will be returned -containing an iterator that has the same output as the input iterator. Read more
    source§

    fn multipeek(self) -> MultiPeek<Self> ⓘ
    where +containing an iterator that has the same output as the input iterator. Read more

    source§

    fn multipeek(self) -> MultiPeek<Self> ⓘ
    where Self: Sized,

    An iterator adaptor that allows the user to peek at multiple .next() -values without advancing the base iterator. Read more
    source§

    fn counts(self) -> HashMap<Self::Item, usize>
    where +values without advancing the base iterator. Read more

    source§

    fn counts(self) -> HashMap<Self::Item, usize>
    where Self: Sized, Self::Item: Eq + Hash,

    Collect the items in this iterator and return a HashMap which contains each item that appears in the iterator and the number -of times it appears. Read more
    source§

    fn counts_by<K, F>(self, f: F) -> HashMap<K, usize>
    where +of times it appears. Read more

    source§

    fn counts_by<K, F>(self, f: F) -> HashMap<K, usize>
    where Self: Sized, K: Eq + Hash, F: FnMut(Self::Item) -> K,

    Collect the items in this iterator and return a HashMap which contains each item that appears in the iterator and the number of times it appears, -determining identity using a keying function. Read more
    source§

    fn multiunzip<FromI>(self) -> FromI
    where - Self: Sized + MultiUnzip<FromI>,

    Converts an iterator of tuples into a tuple of containers. Read more
    source§

    fn try_len(&self) -> Result<usize, (usize, Option<usize>)>

    Returns the length of the iterator if one exists. +determining identity using a keying function. Read more
    source§

    fn multiunzip<FromI>(self) -> FromI
    where + Self: Sized + MultiUnzip<FromI>,

    Converts an iterator of tuples into a tuple of containers. Read more
    source§

    fn try_len(&self) -> Result<usize, (usize, Option<usize>)>

    Returns the length of the iterator if one exists. Otherwise return self.size_hint(). Read more
    source§

    impl<T> 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 + 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/itertools/structs/struct.Powerset.html b/itertools/structs/struct.Powerset.html index 918c0e3c3..119b54930 100644 --- a/itertools/structs/struct.Powerset.html +++ b/itertools/structs/struct.Powerset.html @@ -1,20 +1,20 @@ -Powerset in itertools::structs - Rust
    -

    Struct itertools::structs::Powerset

    source · 
    pub struct Powerset<I: Iterator> { /* private fields */ }
    Expand description

    An iterator to iterate through the powerset of the elements from an iterator.

    +Powerset in itertools::structs - Rust
    +

    Struct itertools::structs::Powerset

    source · 
    pub struct Powerset<I: Iterator> { /* private fields */ }
    Expand description

    An iterator to iterate through the powerset of the elements from an iterator.

    See .powerset() for more information.

    -

    Trait Implementations§

    source§

    impl<I> Clone for Powerset<I>
    where +

    Trait Implementations§

    source§

    impl<I> Clone for Powerset<I>
    where I: Clone + Iterator, - I::Item: 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<I> Debug for Powerset<I>
    where + I::Item: 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<I> Debug for Powerset<I>
    where I: Iterator + Debug, - I::Item: Debug,

    source§

    fn fmt(&self, f: &mut Formatter<'_>) -> Result

    Formats the value using the given formatter. Read more
    source§

    impl<I> Iterator for Powerset<I>
    where + I::Item: Debug,

    source§

    fn fmt(&self, f: &mut Formatter<'_>) -> Result

    Formats the value using the given formatter. Read more
    source§

    impl<I> Iterator for Powerset<I>
    where I: Iterator, - I::Item: Clone,

    §

    type Item = Vec<<I as Iterator>::Item>

    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 fold<B, F>(self, init: B, f: F) -> B
    where + I::Item: Clone,

    §

    type Item = Vec<<I as Iterator>::Item>

    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 nth(&mut self, n: usize) -> Option<Self::Item>

    Returns the nth element of the iterator. 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 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 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,

    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.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, @@ -183,7 +183,7 @@ greater than or equal to those of another. 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> FusedIterator for Powerset<I>
    where +function. Read more

    source§

    impl<I> FusedIterator for Powerset<I>
    where I: Iterator, I::Item: Clone,

    Auto Trait Implementations§

    §

    impl<I> Freeze for Powerset<I>
    where I: Freeze,

    §

    impl<I> RefUnwindSafe for Powerset<I>
    where @@ -212,86 +212,87 @@ otherwise. Right variant of Either<Self, Self> otherwise. Read more

    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> Itertools for T
    where - T: Iterator + ?Sized,

    source§

    fn interleave<J>(self, other: J) -> Interleave<Self, J::IntoIter> ⓘ
    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> Itertools for T
    where + T: Iterator + ?Sized,

    source§

    fn interleave<J>(self, other: J) -> Interleave<Self, J::IntoIter> ⓘ
    where J: IntoIterator<Item = Self::Item>, - Self: Sized,

    Alternate elements from two iterators until both have run out. Read more
    source§

    fn interleave_shortest<J>( + Self: Sized,

    Alternate elements from two iterators until both have run out. Read more
    source§

    fn interleave_shortest<J>( self, other: J ) -> InterleaveShortest<Self, J::IntoIter> ⓘ
    where J: IntoIterator<Item = Self::Item>, Self: Sized,

    Alternate elements from two iterators until at least one of them has run -out. Read more
    source§

    fn intersperse(self, element: Self::Item) -> Intersperse<Self>
    where +out. Read more

    source§

    fn intersperse(self, element: Self::Item) -> Intersperse<Self>
    where Self: Sized, Self::Item: Clone,

    An iterator adaptor to insert a particular value -between each element of the adapted iterator. Read more
    source§

    fn intersperse_with<F>(self, element: F) -> IntersperseWith<Self, F> ⓘ
    where +between each element of the adapted iterator. Read more

    source§

    fn intersperse_with<F>(self, element: F) -> IntersperseWith<Self, F> ⓘ
    where Self: Sized, F: FnMut() -> Self::Item,

    An iterator adaptor to insert a particular value created by a function -between each element of the adapted iterator. Read more
    source§

    fn zip_longest<J>(self, other: J) -> ZipLongest<Self, J::IntoIter> ⓘ
    where +between each element of the adapted iterator. Read more

    source§

    fn get<R>(self, index: R) -> R::Output
    where + Self: Sized, + R: IteratorIndex<Self>,

    Returns an iterator over a subsection of the iterator. Read more
    source§

    fn zip_longest<J>(self, other: J) -> ZipLongest<Self, J::IntoIter> ⓘ
    where J: IntoIterator, Self: Sized,

    Create an iterator which iterates over both this and the specified -iterator simultaneously, yielding pairs of two optional elements. Read more
    source§

    fn zip_eq<J>(self, other: J) -> ZipEq<Self, J::IntoIter> ⓘ
    where +iterator simultaneously, yielding pairs of two optional elements. Read more

    source§

    fn zip_eq<J>(self, other: J) -> ZipEq<Self, J::IntoIter> ⓘ
    where J: IntoIterator, Self: Sized,

    Create an iterator which iterates over both this and the specified -iterator simultaneously, yielding pairs of elements. Read more
    source§

    fn batching<B, F>(self, f: F) -> Batching<Self, F> ⓘ
    where +iterator simultaneously, yielding pairs of elements. Read more

    source§

    fn batching<B, F>(self, f: F) -> Batching<Self, F> ⓘ
    where F: FnMut(&mut Self) -> Option<B>, Self: Sized,

    A “meta iterator adaptor”. Its closure receives a reference to the iterator and may pick off as many elements as it likes, to produce the -next iterator element. Read more
    source§

    fn group_by<K, F>(self, key: F) -> GroupBy<K, Self, F>
    where +next iterator element. Read more

    source§

    fn chunk_by<K, F>(self, key: F) -> ChunkBy<K, Self, F>
    where Self: Sized, F: FnMut(&Self::Item) -> K, K: PartialEq,

    Return an iterable that can group iterator elements. Consecutive elements that map to the same key (“runs”), are assigned -to the same group. Read more
    source§

    fn chunks(self, size: usize) -> IntoChunks<Self>
    where - Self: Sized,

    Return an iterable that can chunk the iterator. Read more
    source§

    fn tuple_windows<T>(self) -> TupleWindows<Self, T> ⓘ
    where +to the same group. Read more

    source§

    fn group_by<K, F>(self, key: F) -> ChunkBy<K, Self, F>
    where + Self: Sized, + F: FnMut(&Self::Item) -> K, + K: PartialEq,

    👎Deprecated since 0.13.0: Use .chunk_by() instead
    See .chunk_by().
    source§

    fn chunks(self, size: usize) -> IntoChunks<Self>
    where + Self: Sized,

    Return an iterable that can chunk the iterator. Read more
    source§

    fn tuple_windows<T>(self) -> TupleWindows<Self, T> ⓘ
    where Self: Sized + Iterator<Item = T::Item>, T: HomogeneousTuple, T::Item: Clone,

    Return an iterator over all contiguous windows producing tuples of -a specific size (up to 12). Read more
    source§

    fn circular_tuple_windows<T>(self) -> CircularTupleWindows<Self, T> ⓘ
    where +a specific size (up to 12). Read more

    source§

    fn circular_tuple_windows<T>(self) -> CircularTupleWindows<Self, T> ⓘ
    where Self: Sized + Clone + Iterator<Item = T::Item> + ExactSizeIterator, T: TupleCollect + Clone, T::Item: Clone,

    Return an iterator over all windows, wrapping back to the first elements when the window would otherwise exceed the length of the -iterator, producing tuples of a specific size (up to 12). Read more
    source§

    fn tuples<T>(self) -> Tuples<Self, T> ⓘ
    where +iterator, producing tuples of a specific size (up to 12). Read more

    source§

    fn tuples<T>(self) -> Tuples<Self, T> ⓘ
    where Self: Sized + Iterator<Item = T::Item>, T: HomogeneousTuple,

    Return an iterator that groups the items in tuples of a specific size -(up to 12). Read more
    source§

    fn tee(self) -> (Tee<Self>, Tee<Self>)
    where +(up to 12). Read more

    source§

    fn tee(self) -> (Tee<Self>, Tee<Self>)
    where Self: Sized, Self::Item: Clone,

    Split into an iterator pair that both yield all elements from -the original iterator. Read more
    source§

    fn step(self, n: usize) -> Step<Self> ⓘ
    where - Self: Sized,

    👎Deprecated since 0.8.0: Use std .step_by() instead
    Return an iterator adaptor that steps n elements in the base iterator -for each iteration. Read more
    source§

    fn map_into<R>(self) -> MapInto<Self, R>
    where +the original iterator. Read more

    source§

    fn map_into<R>(self) -> MapInto<Self, R>
    where Self: Sized, - Self::Item: Into<R>,

    Convert each item of the iterator using the Into trait. Read more
    source§

    fn map_results<F, T, U, E>(self, f: F) -> MapOk<Self, F>
    where - Self: Iterator<Item = Result<T, E>> + Sized, - F: FnMut(T) -> U,

    👎Deprecated since 0.10.0: Use .map_ok() instead
    See .map_ok().
    source§

    fn map_ok<F, T, U, E>(self, f: F) -> MapOk<Self, F>
    where + Self::Item: Into<R>,

    Convert each item of the iterator using the Into trait. Read more
    source§

    fn map_ok<F, T, U, E>(self, f: F) -> MapOk<Self, F>
    where Self: Iterator<Item = Result<T, E>> + Sized, F: FnMut(T) -> U,

    Return an iterator adaptor that applies the provided closure to every Result::Ok value. Result::Err values are -unchanged. Read more
    source§

    fn filter_ok<F, T, E>(self, f: F) -> FilterOk<Self, F> ⓘ
    where +unchanged. Read more

    source§

    fn filter_ok<F, T, E>(self, f: F) -> FilterOk<Self, F> ⓘ
    where Self: Iterator<Item = Result<T, E>> + Sized, F: FnMut(&T) -> bool,

    Return an iterator adaptor that filters every Result::Ok value with the provided closure. Result::Err values are -unchanged. Read more
    source§

    fn filter_map_ok<F, T, U, E>(self, f: F) -> FilterMapOk<Self, F> ⓘ
    where +unchanged. Read more

    source§

    fn filter_map_ok<F, T, U, E>(self, f: F) -> FilterMapOk<Self, F> ⓘ
    where Self: Iterator<Item = Result<T, E>> + Sized, F: FnMut(T) -> Option<U>,

    Return an iterator adaptor that filters and transforms every Result::Ok value with the provided closure. Result::Err -values are unchanged. Read more
    source§

    fn flatten_ok<T, E>(self) -> FlattenOk<Self, T, E> ⓘ
    where +values are unchanged. Read more

    source§

    fn flatten_ok<T, E>(self) -> FlattenOk<Self, T, E> ⓘ
    where Self: Iterator<Item = Result<T, E>> + Sized, T: IntoIterator,

    Return an iterator adaptor that flattens every Result::Ok value into -a series of Result::Ok values. Result::Err values are unchanged. Read more
    source§

    fn process_results<F, T, E, R>(self, processor: F) -> Result<R, E>
    where +a series of Result::Ok values. Result::Err values are unchanged. Read more

    source§

    fn process_results<F, T, E, R>(self, processor: F) -> Result<R, E>
    where Self: Iterator<Item = Result<T, E>> + Sized, F: FnOnce(ProcessResults<'_, Self, E>) -> R,

    “Lift” a function of the values of the current iterator so as to process -an iterator of Result values instead. Read more
    source§

    fn merge<J>(self, other: J) -> Merge<Self, J::IntoIter>
    where +an iterator of Result values instead. Read more

    source§

    fn merge<J>(self, other: J) -> Merge<Self, J::IntoIter>
    where Self: Sized, Self::Item: PartialOrd, J: IntoIterator<Item = Self::Item>,

    Return an iterator adaptor that merges the two base iterators in ascending order. If both base iterators are sorted (ascending), the -result is sorted. Read more
    source§

    fn merge_by<J, F>(self, other: J, is_first: F) -> MergeBy<Self, J::IntoIter, F> ⓘ
    where +result is sorted. Read more

    source§

    fn merge_by<J, F>(self, other: J, is_first: F) -> MergeBy<Self, J::IntoIter, F> ⓘ
    where Self: Sized, J: IntoIterator<Item = Self::Item>, F: FnMut(&Self::Item, &Self::Item) -> bool,

    Return an iterator adaptor that merges the two base iterators in order. -This is much like .merge() but allows for a custom ordering. Read more
    source§

    fn merge_join_by<J, F, T>( +This is much like .merge() but allows for a custom ordering. Read more

    source§

    fn merge_join_by<J, F, T>( self, other: J, cmp_fn: F @@ -299,285 +300,296 @@ This is much like IntoIterator, F: FnMut(&Self::Item, &J::Item) -> T, Self: Sized,

    Create an iterator that merges items from both this and the specified -iterator in ascending order. Read more
    source§

    fn kmerge(self) -> KMerge<<Self::Item as IntoIterator>::IntoIter>
    where +iterator in ascending order. Read more

    source§

    fn kmerge(self) -> KMerge<<Self::Item as IntoIterator>::IntoIter>
    where Self: Sized, Self::Item: IntoIterator, <Self::Item as IntoIterator>::Item: PartialOrd,

    Return an iterator adaptor that flattens an iterator of iterators by -merging them in ascending order. Read more
    source§

    fn kmerge_by<F>( +merging them in ascending order. Read more

    source§

    fn kmerge_by<F>( self, first: F ) -> KMergeBy<<Self::Item as IntoIterator>::IntoIter, F> ⓘ
    where Self: Sized, Self::Item: IntoIterator, F: FnMut(&<Self::Item as IntoIterator>::Item, &<Self::Item as IntoIterator>::Item) -> bool,

    Return an iterator adaptor that flattens an iterator of iterators by -merging them according to the given closure. Read more
    source§

    fn cartesian_product<J>(self, other: J) -> Product<Self, J::IntoIter> ⓘ
    where +merging them according to the given closure. Read more

    source§

    fn cartesian_product<J>(self, other: J) -> Product<Self, J::IntoIter> ⓘ
    where Self: Sized, Self::Item: Clone, J: IntoIterator, J::IntoIter: Clone,

    Return an iterator adaptor that iterates over the cartesian product of -the element sets of two iterators self and J. Read more
    source§

    fn multi_cartesian_product( +the element sets of two iterators self and J. Read more

    source§

    fn multi_cartesian_product( self ) -> MultiProduct<<Self::Item as IntoIterator>::IntoIter> ⓘ
    where Self: Sized, Self::Item: IntoIterator, <Self::Item as IntoIterator>::IntoIter: Clone, <Self::Item as IntoIterator>::Item: Clone,

    Return an iterator adaptor that iterates over the cartesian product of -all subiterators returned by meta-iterator self. Read more
    source§

    fn coalesce<F>(self, f: F) -> Coalesce<Self, F>
    where +all subiterators returned by meta-iterator self. Read more

    source§

    fn coalesce<F>(self, f: F) -> Coalesce<Self, F>
    where Self: Sized, F: FnMut(Self::Item, Self::Item) -> Result<Self::Item, (Self::Item, Self::Item)>,

    Return an iterator adaptor that uses the passed-in closure to -optionally merge together consecutive elements. Read more
    source§

    fn dedup(self) -> Dedup<Self>
    where +optionally merge together consecutive elements. Read more

    source§

    fn dedup(self) -> Dedup<Self>
    where Self: Sized, Self::Item: PartialEq,

    Remove duplicates from sections of consecutive identical elements. -If the iterator is sorted, all elements will be unique. Read more
    source§

    fn dedup_by<Cmp>(self, cmp: Cmp) -> DedupBy<Self, Cmp>
    where +If the iterator is sorted, all elements will be unique. Read more

    source§

    fn dedup_by<Cmp>(self, cmp: Cmp) -> DedupBy<Self, Cmp>
    where Self: Sized, Cmp: FnMut(&Self::Item, &Self::Item) -> bool,

    Remove duplicates from sections of consecutive identical elements, determining equality using a comparison function. -If the iterator is sorted, all elements will be unique. Read more
    source§

    fn dedup_with_count(self) -> DedupWithCount<Self>
    where +If the iterator is sorted, all elements will be unique. Read more

    source§

    fn dedup_with_count(self) -> DedupWithCount<Self>
    where Self: Sized,

    Remove duplicates from sections of consecutive identical elements, while keeping a count of how many repeated elements were present. -If the iterator is sorted, all elements will be unique. Read more
    source§

    fn dedup_by_with_count<Cmp>(self, cmp: Cmp) -> DedupByWithCount<Self, Cmp>
    where +If the iterator is sorted, all elements will be unique. Read more

    source§

    fn dedup_by_with_count<Cmp>(self, cmp: Cmp) -> DedupByWithCount<Self, Cmp>
    where Self: Sized, Cmp: FnMut(&Self::Item, &Self::Item) -> bool,

    Remove duplicates from sections of consecutive identical elements, while keeping a count of how many repeated elements were present. This will determine equality using a comparison function. -If the iterator is sorted, all elements will be unique. Read more
    source§

    fn duplicates(self) -> Duplicates<Self>
    where +If the iterator is sorted, all elements will be unique. Read more

    source§

    fn duplicates(self) -> Duplicates<Self>
    where Self: Sized, Self::Item: Eq + Hash,

    Return an iterator adaptor that produces elements that appear more than once during the -iteration. Duplicates are detected using hash and equality. Read more
    source§

    fn duplicates_by<V, F>(self, f: F) -> DuplicatesBy<Self, V, F>
    where +iteration. Duplicates are detected using hash and equality. Read more

    source§

    fn duplicates_by<V, F>(self, f: F) -> DuplicatesBy<Self, V, F>
    where Self: Sized, V: Eq + Hash, F: FnMut(&Self::Item) -> V,

    Return an iterator adaptor that produces elements that appear more than once during the -iteration. Duplicates are detected using hash and equality. Read more
    source§

    fn unique(self) -> Unique<Self> ⓘ
    where +iteration. Duplicates are detected using hash and equality. Read more

    source§

    fn unique(self) -> Unique<Self> ⓘ
    where Self: Sized, Self::Item: Clone + Eq + Hash,

    Return an iterator adaptor that filters out elements that have already been produced once during the iteration. Duplicates -are detected using hash and equality. Read more
    source§

    fn unique_by<V, F>(self, f: F) -> UniqueBy<Self, V, F> ⓘ
    where +are detected using hash and equality. Read more

    source§

    fn unique_by<V, F>(self, f: F) -> UniqueBy<Self, V, F> ⓘ
    where Self: Sized, V: Eq + Hash, F: FnMut(&Self::Item) -> V,

    Return an iterator adaptor that filters out elements that have -already been produced once during the iteration. Read more
    source§

    fn peeking_take_while<F>(&mut self, accept: F) -> PeekingTakeWhile<'_, Self, F> ⓘ
    where +already been produced once during the iteration. Read more

    source§

    fn peeking_take_while<F>(&mut self, accept: F) -> PeekingTakeWhile<'_, Self, F> ⓘ
    where Self: Sized + PeekingNext, F: FnMut(&Self::Item) -> bool,

    Return an iterator adaptor that borrows from this iterator and -takes items while the closure accept returns true. Read more
    source§

    fn take_while_ref<F>(&mut self, accept: F) -> TakeWhileRef<'_, Self, F> ⓘ
    where +takes items while the closure accept returns true. Read more

    source§

    fn take_while_ref<F>(&mut self, accept: F) -> TakeWhileRef<'_, Self, F> ⓘ
    where Self: Clone, F: FnMut(&Self::Item) -> bool,

    Return an iterator adaptor that borrows from a Clone-able iterator -to only pick off elements while the predicate accept returns true. Read more
    source§

    fn take_while_inclusive<F>(self, accept: F) -> TakeWhileInclusive<Self, F> ⓘ
    where +to only pick off elements while the predicate accept returns true. Read more

    source§

    fn take_while_inclusive<F>(self, accept: F) -> TakeWhileInclusive<Self, F> ⓘ
    where Self: Sized, F: FnMut(&Self::Item) -> bool,

    Returns an iterator adaptor that consumes elements while the given predicate is true, including the element for which the predicate -first returned false. Read more
    source§

    fn while_some<A>(self) -> WhileSome<Self> ⓘ
    where +first returned false. Read more

    source§

    fn while_some<A>(self) -> WhileSome<Self> ⓘ
    where Self: Sized + Iterator<Item = Option<A>>,

    Return an iterator adaptor that filters Option<A> iterator elements -and produces A. Stops on the first None encountered. Read more
    source§

    fn tuple_combinations<T>(self) -> TupleCombinations<Self, T> ⓘ
    where +and produces A. Stops on the first None encountered. Read more

    source§

    fn tuple_combinations<T>(self) -> TupleCombinations<Self, T> ⓘ
    where Self: Sized + Clone, Self::Item: Clone, T: HasCombination<Self>,

    Return an iterator adaptor that iterates over the combinations of the -elements from an iterator. Read more
    source§

    fn combinations(self, k: usize) -> Combinations<Self> ⓘ
    where +elements from an iterator. Read more

    source§

    fn combinations(self, k: usize) -> Combinations<Self> ⓘ
    where Self: Sized, Self::Item: Clone,

    Return an iterator adaptor that iterates over the k-length combinations of -the elements from an iterator. Read more
    source§

    fn combinations_with_replacement( +the elements from an iterator. Read more

    source§

    fn combinations_with_replacement( self, k: usize ) -> CombinationsWithReplacement<Self> ⓘ
    where Self: Sized, Self::Item: Clone,

    Return an iterator that iterates over the k-length combinations of -the elements from an iterator, with replacement. Read more
    source§

    fn permutations(self, k: usize) -> Permutations<Self> ⓘ
    where +the elements from an iterator, with replacement. Read more

    source§

    fn permutations(self, k: usize) -> Permutations<Self> ⓘ
    where Self: Sized, Self::Item: Clone,

    Return an iterator adaptor that iterates over all k-permutations of the -elements from an iterator. Read more
    source§

    fn powerset(self) -> Powerset<Self> ⓘ
    where +elements from an iterator. Read more

    source§

    fn powerset(self) -> Powerset<Self> ⓘ
    where Self: Sized, Self::Item: Clone,

    Return an iterator that iterates through the powerset of the elements from an -iterator. Read more
    source§

    fn pad_using<F>(self, min: usize, f: F) -> PadUsing<Self, F> ⓘ
    where +iterator. Read more

    source§

    fn pad_using<F>(self, min: usize, f: F) -> PadUsing<Self, F> ⓘ
    where Self: Sized, F: FnMut(usize) -> Self::Item,

    Return an iterator adaptor that pads the sequence to a minimum length of -min by filling missing elements using a closure f. Read more
    source§

    fn with_position(self) -> WithPosition<Self> ⓘ
    where +min by filling missing elements using a closure f. Read more

    source§

    fn with_position(self) -> WithPosition<Self> ⓘ
    where Self: Sized,

    Return an iterator adaptor that combines each element with a Position to -ease special-case handling of the first or last elements. Read more
    source§

    fn positions<P>(self, predicate: P) -> Positions<Self, P> ⓘ
    where +ease special-case handling of the first or last elements. Read more

    source§

    fn positions<P>(self, predicate: P) -> Positions<Self, P> ⓘ
    where Self: Sized, P: FnMut(Self::Item) -> bool,

    Return an iterator adaptor that yields the indices of all elements -satisfying a predicate, counted from the start of the iterator. Read more
    source§

    fn update<F>(self, updater: F) -> Update<Self, F> ⓘ
    where +satisfying a predicate, counted from the start of the iterator. Read more

    source§

    fn update<F>(self, updater: F) -> Update<Self, F> ⓘ
    where Self: Sized, F: FnMut(&mut Self::Item),

    Return an iterator adaptor that applies a mutating function -to each element before yielding it. Read more
    source§

    fn next_tuple<T>(&mut self) -> Option<T>
    where +to each element before yielding it. Read more

    source§

    fn next_tuple<T>(&mut self) -> Option<T>
    where Self: Sized + Iterator<Item = T::Item>, T: HomogeneousTuple,

    Advances the iterator and returns the next items grouped in a tuple of -a specific size (up to 12). Read more
    source§

    fn collect_tuple<T>(self) -> Option<T>
    where +a specific size (up to 12). Read more

    source§

    fn collect_tuple<T>(self) -> Option<T>
    where Self: Sized + Iterator<Item = T::Item>, T: HomogeneousTuple,

    Collects all items from the iterator into a tuple of a specific size -(up to 12). Read more
    source§

    fn find_position<P>(&mut self, pred: P) -> Option<(usize, Self::Item)>
    where - P: FnMut(&Self::Item) -> bool,

    Find the position and value of the first element satisfying a predicate. Read more
    source§

    fn find_or_last<P>(self, predicate: P) -> Option<Self::Item>
    where +(up to 12). Read more

    source§

    fn find_position<P>(&mut self, pred: P) -> Option<(usize, Self::Item)>
    where + P: FnMut(&Self::Item) -> bool,

    Find the position and value of the first element satisfying a predicate. Read more
    source§

    fn find_or_last<P>(self, predicate: P) -> Option<Self::Item>
    where Self: Sized, - P: FnMut(&Self::Item) -> bool,

    Find the value of the first element satisfying a predicate or return the last element, if any. Read more
    source§

    fn find_or_first<P>(self, predicate: P) -> Option<Self::Item>
    where + P: FnMut(&Self::Item) -> bool,

    Find the value of the first element satisfying a predicate or return the last element, if any. Read more
    source§

    fn find_or_first<P>(self, predicate: P) -> Option<Self::Item>
    where Self: Sized, - P: FnMut(&Self::Item) -> bool,

    Find the value of the first element satisfying a predicate or return the first element, if any. Read more
    source§

    fn contains<Q>(&mut self, query: &Q) -> bool
    where + P: FnMut(&Self::Item) -> bool,

    Find the value of the first element satisfying a predicate or return the first element, if any. Read more
    source§

    fn contains<Q>(&mut self, query: &Q) -> bool
    where Self: Sized, Self::Item: Borrow<Q>, - Q: PartialEq,

    Returns true if the given item is present in this iterator. Read more
    source§

    fn all_equal(&mut self) -> bool
    where + Q: PartialEq,

    Returns true if the given item is present in this iterator. Read more
    source§

    fn all_equal(&mut self) -> bool
    where Self: Sized, - Self::Item: PartialEq,

    Check whether all elements compare equal. Read more
    source§

    fn all_equal_value( + Self::Item: PartialEq,

    Check whether all elements compare equal. Read more
    source§

    fn all_equal_value( &mut self ) -> Result<Self::Item, Option<(Self::Item, Self::Item)>>
    where Self: Sized, Self::Item: PartialEq,

    If there are elements and they are all equal, return a single copy of that element. If there are no elements, return an Error containing None. If there are elements and they are not all equal, return a tuple containing the first -two non-equal elements found. Read more
    source§

    fn all_unique(&mut self) -> bool
    where +two non-equal elements found. Read more

    source§

    fn all_unique(&mut self) -> bool
    where Self: Sized, - Self::Item: Eq + Hash,

    Check whether all elements are unique (non equal). Read more
    source§

    fn dropping(self, n: usize) -> Self
    where + Self::Item: Eq + Hash,

    Check whether all elements are unique (non equal). Read more
    source§

    fn dropping(self, n: usize) -> Self
    where Self: Sized,

    Consume the first n elements from the iterator eagerly, -and return the same iterator again. Read more
    source§

    fn dropping_back(self, n: usize) -> Self
    where +and return the same iterator again. Read more

    source§

    fn dropping_back(self, n: usize) -> Self
    where Self: Sized + DoubleEndedIterator,

    Consume the last n elements from the iterator eagerly, -and return the same iterator again. Read more
    source§

    fn foreach<F>(self, f: F)
    where - F: FnMut(Self::Item), - Self: Sized,

    👎Deprecated since 0.8.0: Use .for_each() instead
    Run the closure f eagerly on each element of the iterator. Read more
    source§

    fn concat(self) -> Self::Item
    where +and return the same iterator again. Read more

    source§

    fn concat(self) -> Self::Item
    where Self: Sized, - Self::Item: Extend<<<Self as Iterator>::Item as IntoIterator>::Item> + IntoIterator + Default,

    Combine all an iterator’s elements into one element by using Extend. Read more
    source§

    fn collect_vec(self) -> Vec<Self::Item>
    where + Self::Item: Extend<<<Self as Iterator>::Item as IntoIterator>::Item> + IntoIterator + Default,

    Combine all an iterator’s elements into one element by using Extend. Read more
    source§

    fn collect_vec(self) -> Vec<Self::Item>
    where Self: Sized,

    .collect_vec() is simply a type specialization of Iterator::collect, -for convenience.
    source§

    fn try_collect<T, U, E>(self) -> Result<U, E>
    where +for convenience.

    source§

    fn try_collect<T, U, E>(self) -> Result<U, E>
    where Self: Sized + Iterator<Item = Result<T, E>>, Result<U, E>: FromIterator<Result<T, E>>,

    .try_collect() is more convenient way of writing -.collect::<Result<_, _>>() Read more
    source§

    fn set_from<'a, A: 'a, J>(&mut self, from: J) -> usize
    where +.collect::<Result<_, _>>() Read more

    source§

    fn set_from<'a, A: 'a, J>(&mut self, from: J) -> usize
    where Self: Iterator<Item = &'a mut A>, J: IntoIterator<Item = A>,

    Assign to each reference in self from the from iterator, -stopping at the shortest of the two iterators. Read more
    source§

    fn join(&mut self, sep: &str) -> String
    where - Self::Item: Display,

    Combine all iterator elements into one String, separated by sep. Read more
    source§

    fn format(self, sep: &str) -> Format<'_, Self>
    where - Self: Sized,

    Format all iterator elements, separated by sep. Read more
    source§

    fn format_with<F>(self, sep: &str, format: F) -> FormatWith<'_, Self, F>
    where +stopping at the shortest of the two iterators. Read more

    source§

    fn join(&mut self, sep: &str) -> String
    where + Self::Item: Display,

    Combine all iterator elements into one String, separated by sep. Read more
    source§

    fn format(self, sep: &str) -> Format<'_, Self>
    where + Self: Sized,

    Format all iterator elements, separated by sep. Read more
    source§

    fn format_with<F>(self, sep: &str, format: F) -> FormatWith<'_, Self, F>
    where Self: Sized, - F: FnMut(Self::Item, &mut dyn FnMut(&dyn Display) -> Result) -> Result,

    Format all iterator elements, separated by sep. Read more
    source§

    fn fold_results<A, E, B, F>(&mut self, start: B, f: F) -> Result<B, E>
    where + F: FnMut(Self::Item, &mut dyn FnMut(&dyn Display) -> Result) -> Result,

    Format all iterator elements, separated by sep. Read more
    source§

    fn fold_ok<A, E, B, F>(&mut self, start: B, f: F) -> Result<B, E>
    where Self: Iterator<Item = Result<A, E>>, - F: FnMut(B, A) -> B,

    👎Deprecated since 0.10.0: Use .fold_ok() instead
    See .fold_ok().
    source§

    fn fold_ok<A, E, B, F>(&mut self, start: B, f: F) -> Result<B, E>
    where - Self: Iterator<Item = Result<A, E>>, - F: FnMut(B, A) -> B,

    Fold Result values from an iterator. Read more
    source§

    fn fold_options<A, B, F>(&mut self, start: B, f: F) -> Option<B>
    where + F: FnMut(B, A) -> B,

    Fold Result values from an iterator. Read more
    source§

    fn fold_options<A, B, F>(&mut self, start: B, f: F) -> Option<B>
    where Self: Iterator<Item = Option<A>>, - F: FnMut(B, A) -> B,

    Fold Option values from an iterator. Read more
    source§

    fn fold1<F>(self, f: F) -> Option<Self::Item>
    where + F: FnMut(B, A) -> B,

    Fold Option values from an iterator. Read more
    source§

    fn fold1<F>(self, f: F) -> Option<Self::Item>
    where F: FnMut(Self::Item, Self::Item) -> Self::Item, - Self: Sized,

    👎Deprecated since 0.10.2: Use Iterator::reduce instead
    Accumulator of the elements in the iterator. Read more
    source§

    fn tree_fold1<F>(self, f: F) -> Option<Self::Item>
    where + Self: Sized,

    👎Deprecated since 0.10.2: Use Iterator::reduce instead
    Accumulator of the elements in the iterator. Read more
    source§

    fn tree_reduce<F>(self, f: F) -> Option<Self::Item>
    where F: FnMut(Self::Item, Self::Item) -> Self::Item, - Self: Sized,

    Accumulate the elements in the iterator in a tree-like manner. Read more
    source§

    fn fold_while<B, F>(&mut self, init: B, f: F) -> FoldWhile<B>
    where + Self: Sized,

    Accumulate the elements in the iterator in a tree-like manner. Read more
    source§

    fn tree_fold1<F>(self, f: F) -> Option<Self::Item>
    where + F: FnMut(Self::Item, Self::Item) -> Self::Item, + Self: Sized,

    👎Deprecated since 0.13.0: Use .tree_reduce() instead
    See .tree_reduce().
    source§

    fn fold_while<B, F>(&mut self, init: B, f: F) -> FoldWhile<B>
    where Self: Sized, - F: FnMut(B, Self::Item) -> FoldWhile<B>,

    An iterator method that applies a function, producing a single, final value. Read more
    source§

    fn sum1<S>(self) -> Option<S>
    where + F: FnMut(B, Self::Item) -> FoldWhile<B>,

    An iterator method that applies a function, producing a single, final value. Read more
    source§

    fn sum1<S>(self) -> Option<S>
    where Self: Sized, - S: Sum<Self::Item>,

    Iterate over the entire iterator and add all the elements. Read more
    source§

    fn product1<P>(self) -> Option<P>
    where + S: Sum<Self::Item>,

    Iterate over the entire iterator and add all the elements. Read more
    source§

    fn product1<P>(self) -> Option<P>
    where Self: Sized, - P: Product<Self::Item>,

    Iterate over the entire iterator and multiply all the elements. Read more
    source§

    fn sorted_unstable(self) -> IntoIter<Self::Item> ⓘ
    where + P: Product<Self::Item>,

    Iterate over the entire iterator and multiply all the elements. Read more
    source§

    fn sorted_unstable(self) -> IntoIter<Self::Item> ⓘ
    where Self: Sized, - Self::Item: Ord,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_unstable_by<F>(self, cmp: F) -> IntoIter<Self::Item> ⓘ
    where + Self::Item: Ord,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_unstable_by<F>(self, cmp: F) -> IntoIter<Self::Item> ⓘ
    where Self: Sized, - F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_unstable_by_key<K, F>(self, f: F) -> IntoIter<Self::Item> ⓘ
    where + F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_unstable_by_key<K, F>(self, f: F) -> IntoIter<Self::Item> ⓘ
    where Self: Sized, K: Ord, - F: FnMut(&Self::Item) -> K,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted(self) -> IntoIter<Self::Item> ⓘ
    where + F: FnMut(&Self::Item) -> K,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted(self) -> IntoIter<Self::Item> ⓘ
    where Self: Sized, - Self::Item: Ord,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_by<F>(self, cmp: F) -> IntoIter<Self::Item> ⓘ
    where + Self::Item: Ord,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_by<F>(self, cmp: F) -> IntoIter<Self::Item> ⓘ
    where Self: Sized, - F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_by_key<K, F>(self, f: F) -> IntoIter<Self::Item> ⓘ
    where + F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_by_key<K, F>(self, f: F) -> IntoIter<Self::Item> ⓘ
    where Self: Sized, K: Ord, - F: FnMut(&Self::Item) -> K,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_by_cached_key<K, F>(self, f: F) -> IntoIter<Self::Item> ⓘ
    where + F: FnMut(&Self::Item) -> K,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_by_cached_key<K, F>(self, f: F) -> IntoIter<Self::Item> ⓘ
    where Self: Sized, K: Ord, F: FnMut(&Self::Item) -> K,

    Sort all iterator elements into a new iterator in ascending order. The key function is -called exactly once per key. Read more
    source§

    fn k_smallest(self, k: usize) -> IntoIter<Self::Item> ⓘ
    where +called exactly once per key. Read more

    source§

    fn k_smallest(self, k: usize) -> IntoIter<Self::Item> ⓘ
    where Self: Sized, - Self::Item: Ord,

    Sort the k smallest elements into a new iterator, in ascending order. Read more
    source§

    fn partition_map<A, B, F, L, R>(self, predicate: F) -> (A, B)
    where + Self::Item: Ord,

    Sort the k smallest elements into a new iterator, in ascending order. Read more
    source§

    fn k_smallest_by<F>(self, k: usize, cmp: F) -> IntoIter<Self::Item> ⓘ
    where + Self: Sized, + F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Sort the k smallest elements into a new iterator using the provided comparison. Read more
    source§

    fn k_smallest_by_key<F, K>(self, k: usize, key: F) -> IntoIter<Self::Item> ⓘ
    where + Self: Sized, + F: FnMut(&Self::Item) -> K, + K: Ord,

    Return the elements producing the k smallest outputs of the provided function. Read more
    source§

    fn k_largest(self, k: usize) -> IntoIter<Self::Item> ⓘ
    where + Self: Sized, + Self::Item: Ord,

    Sort the k largest elements into a new iterator, in descending order. Read more
    source§

    fn k_largest_by<F>(self, k: usize, cmp: F) -> IntoIter<Self::Item> ⓘ
    where + Self: Sized, + F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Sort the k largest elements into a new iterator using the provided comparison. Read more
    source§

    fn k_largest_by_key<F, K>(self, k: usize, key: F) -> IntoIter<Self::Item> ⓘ
    where + Self: Sized, + F: FnMut(&Self::Item) -> K, + K: Ord,

    Return the elements producing the k largest outputs of the provided function. Read more
    source§

    fn tail(self, n: usize) -> IntoIter<Self::Item> ⓘ
    where + Self: Sized,

    Consumes the iterator and return an iterator of the last n elements. Read more
    source§

    fn partition_map<A, B, F, L, R>(self, predicate: F) -> (A, B)
    where Self: Sized, F: FnMut(Self::Item) -> Either<L, R>, A: Default + Extend<L>, B: Default + Extend<R>,

    Collect all iterator elements into one of two partitions. Unlike Iterator::partition, each partition may -have a distinct type. Read more
    source§

    fn partition_result<A, B, T, E>(self) -> (A, B)
    where +have a distinct type. Read more

    source§

    fn partition_result<A, B, T, E>(self) -> (A, B)
    where Self: Iterator<Item = Result<T, E>> + Sized, A: Default + Extend<T>, B: Default + Extend<E>,

    Partition a sequence of Results into one list of all the Ok elements -and another list of all the Err elements. Read more
    source§

    fn into_group_map<K, V>(self) -> HashMap<K, Vec<V>>
    where +and another list of all the Err elements. Read more

    source§

    fn into_group_map<K, V>(self) -> HashMap<K, Vec<V>>
    where Self: Iterator<Item = (K, V)> + Sized, K: Hash + Eq,

    Return a HashMap of keys mapped to Vecs of values. Keys and values -are taken from (Key, Value) tuple pairs yielded by the input iterator. Read more
    source§

    fn into_group_map_by<K, V, F>(self, f: F) -> HashMap<K, Vec<V>>
    where +are taken from (Key, Value) tuple pairs yielded by the input iterator. Read more

    source§

    fn into_group_map_by<K, V, F>(self, f: F) -> HashMap<K, Vec<V>>
    where Self: Iterator<Item = V> + Sized, K: Hash + Eq, - F: Fn(&V) -> K,

    Return an Iterator on a HashMap. Keys mapped to Vecs of values. The key is specified -in the closure. Read more
    source§

    fn into_grouping_map<K, V>(self) -> GroupingMap<Self>
    where + F: FnMut(&V) -> K,

    Return an Iterator on a HashMap. Keys mapped to Vecs of values. The key is specified +in the closure. Read more
    source§

    fn into_grouping_map<K, V>(self) -> GroupingMap<Self>
    where Self: Iterator<Item = (K, V)> + Sized, K: Hash + Eq,

    Constructs a GroupingMap to be used later with one of the efficient -group-and-fold operations it allows to perform. Read more
    source§

    fn into_grouping_map_by<K, V, F>(self, key_mapper: F) -> GroupingMapBy<Self, F>
    where +group-and-fold operations it allows to perform. Read more

    source§

    fn into_grouping_map_by<K, V, F>(self, key_mapper: F) -> GroupingMapBy<Self, F>
    where Self: Iterator<Item = V> + Sized, K: Hash + Eq, F: FnMut(&V) -> K,

    Constructs a GroupingMap to be used later with one of the efficient -group-and-fold operations it allows to perform. Read more
    source§

    fn min_set(self) -> Vec<Self::Item>
    where +group-and-fold operations it allows to perform. Read more

    source§

    fn min_set(self) -> Vec<Self::Item>
    where Self: Sized, - Self::Item: Ord,

    Return all minimum elements of an iterator. Read more
    source§

    fn min_set_by<F>(self, compare: F) -> Vec<Self::Item>
    where + Self::Item: Ord,

    Return all minimum elements of an iterator. Read more
    source§

    fn min_set_by<F>(self, compare: F) -> Vec<Self::Item>
    where Self: Sized, F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Return all minimum elements of an iterator, as determined by -the specified function. Read more
    source§

    fn min_set_by_key<K, F>(self, key: F) -> Vec<Self::Item>
    where +the specified function. Read more

    source§

    fn min_set_by_key<K, F>(self, key: F) -> Vec<Self::Item>
    where Self: Sized, K: Ord, F: FnMut(&Self::Item) -> K,

    Return all minimum elements of an iterator, as determined by -the specified function. Read more
    source§

    fn max_set(self) -> Vec<Self::Item>
    where +the specified function. Read more

    source§

    fn max_set(self) -> Vec<Self::Item>
    where Self: Sized, - Self::Item: Ord,

    Return all maximum elements of an iterator. Read more
    source§

    fn max_set_by<F>(self, compare: F) -> Vec<Self::Item>
    where + Self::Item: Ord,

    Return all maximum elements of an iterator. Read more
    source§

    fn max_set_by<F>(self, compare: F) -> Vec<Self::Item>
    where Self: Sized, F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Return all maximum elements of an iterator, as determined by -the specified function. Read more
    source§

    fn max_set_by_key<K, F>(self, key: F) -> Vec<Self::Item>
    where +the specified function. Read more

    source§

    fn max_set_by_key<K, F>(self, key: F) -> Vec<Self::Item>
    where Self: Sized, K: Ord, F: FnMut(&Self::Item) -> K,

    Return all maximum elements of an iterator, as determined by -the specified function. Read more
    source§

    fn minmax(self) -> MinMaxResult<Self::Item>
    where +the specified function. Read more

    source§

    fn minmax(self) -> MinMaxResult<Self::Item>
    where Self: Sized, - Self::Item: PartialOrd,

    Return the minimum and maximum elements in the iterator. Read more
    source§

    fn minmax_by_key<K, F>(self, key: F) -> MinMaxResult<Self::Item>
    where + Self::Item: PartialOrd,

    Return the minimum and maximum elements in the iterator. Read more
    source§

    fn minmax_by_key<K, F>(self, key: F) -> MinMaxResult<Self::Item>
    where Self: Sized, K: PartialOrd, F: FnMut(&Self::Item) -> K,

    Return the minimum and maximum element of an iterator, as determined by -the specified function. Read more
    source§

    fn minmax_by<F>(self, compare: F) -> MinMaxResult<Self::Item>
    where +the specified function. Read more

    source§

    fn minmax_by<F>(self, compare: F) -> MinMaxResult<Self::Item>
    where Self: Sized, F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Return the minimum and maximum element of an iterator, as determined by -the specified comparison function. Read more
    source§

    fn position_max(self) -> Option<usize>
    where +the specified comparison function. Read more

    source§

    fn position_max(self) -> Option<usize>
    where Self: Sized, - Self::Item: Ord,

    Return the position of the maximum element in the iterator. Read more
    source§

    fn position_max_by_key<K, F>(self, key: F) -> Option<usize>
    where + Self::Item: Ord,

    Return the position of the maximum element in the iterator. Read more
    source§

    fn position_max_by_key<K, F>(self, key: F) -> Option<usize>
    where Self: Sized, K: Ord, F: FnMut(&Self::Item) -> K,

    Return the position of the maximum element in the iterator, as -determined by the specified function. Read more
    source§

    fn position_max_by<F>(self, compare: F) -> Option<usize>
    where +determined by the specified function. Read more

    source§

    fn position_max_by<F>(self, compare: F) -> Option<usize>
    where Self: Sized, F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Return the position of the maximum element in the iterator, as -determined by the specified comparison function. Read more
    source§

    fn position_min(self) -> Option<usize>
    where +determined by the specified comparison function. Read more

    source§

    fn position_min(self) -> Option<usize>
    where Self: Sized, - Self::Item: Ord,

    Return the position of the minimum element in the iterator. Read more
    source§

    fn position_min_by_key<K, F>(self, key: F) -> Option<usize>
    where + Self::Item: Ord,

    Return the position of the minimum element in the iterator. Read more
    source§

    fn position_min_by_key<K, F>(self, key: F) -> Option<usize>
    where Self: Sized, K: Ord, F: FnMut(&Self::Item) -> K,

    Return the position of the minimum element in the iterator, as -determined by the specified function. Read more
    source§

    fn position_min_by<F>(self, compare: F) -> Option<usize>
    where +determined by the specified function. Read more

    source§

    fn position_min_by<F>(self, compare: F) -> Option<usize>
    where Self: Sized, F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Return the position of the minimum element in the iterator, as -determined by the specified comparison function. Read more
    source§

    fn position_minmax(self) -> MinMaxResult<usize>
    where +determined by the specified comparison function. Read more

    source§

    fn position_minmax(self) -> MinMaxResult<usize>
    where Self: Sized, Self::Item: PartialOrd,

    Return the positions of the minimum and maximum elements in -the iterator. Read more
    source§

    fn position_minmax_by_key<K, F>(self, key: F) -> MinMaxResult<usize>
    where +the iterator. Read more

    source§

    fn position_minmax_by_key<K, F>(self, key: F) -> MinMaxResult<usize>
    where Self: Sized, K: PartialOrd, F: FnMut(&Self::Item) -> K,

    Return the postions of the minimum and maximum elements of an -iterator, as determined by the specified function. Read more
    source§

    fn position_minmax_by<F>(self, compare: F) -> MinMaxResult<usize>
    where +iterator, as determined by the specified function. Read more

    source§

    fn position_minmax_by<F>(self, compare: F) -> MinMaxResult<usize>
    where Self: Sized, F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Return the postions of the minimum and maximum elements of an -iterator, as determined by the specified comparison function. Read more
    source§

    fn exactly_one(self) -> Result<Self::Item, ExactlyOneError<Self>>
    where +iterator, as determined by the specified comparison function. Read more

    source§

    fn exactly_one(self) -> Result<Self::Item, ExactlyOneError<Self>>
    where Self: Sized,

    If the iterator yields exactly one element, that element will be returned, otherwise an error will be returned containing an iterator that has the same output as the input -iterator. Read more
    source§

    fn at_most_one(self) -> Result<Option<Self::Item>, ExactlyOneError<Self>>
    where - Self: Sized,

    If the iterator yields no elements, Ok(None) will be returned. If the iterator yields +iterator. Read more
    source§

    fn at_most_one(self) -> Result<Option<Self::Item>, ExactlyOneError<Self>>
    where + Self: Sized,

    If the iterator yields no elements, Ok(None) will be returned. If the iterator yields exactly one element, that element will be returned, otherwise an error will be returned -containing an iterator that has the same output as the input iterator. Read more
    source§

    fn multipeek(self) -> MultiPeek<Self> ⓘ
    where +containing an iterator that has the same output as the input iterator. Read more

    source§

    fn multipeek(self) -> MultiPeek<Self> ⓘ
    where Self: Sized,

    An iterator adaptor that allows the user to peek at multiple .next() -values without advancing the base iterator. Read more
    source§

    fn counts(self) -> HashMap<Self::Item, usize>
    where +values without advancing the base iterator. Read more

    source§

    fn counts(self) -> HashMap<Self::Item, usize>
    where Self: Sized, Self::Item: Eq + Hash,

    Collect the items in this iterator and return a HashMap which contains each item that appears in the iterator and the number -of times it appears. Read more
    source§

    fn counts_by<K, F>(self, f: F) -> HashMap<K, usize>
    where +of times it appears. Read more

    source§

    fn counts_by<K, F>(self, f: F) -> HashMap<K, usize>
    where Self: Sized, K: Eq + Hash, F: FnMut(Self::Item) -> K,

    Collect the items in this iterator and return a HashMap which contains each item that appears in the iterator and the number of times it appears, -determining identity using a keying function. Read more
    source§

    fn multiunzip<FromI>(self) -> FromI
    where - Self: Sized + MultiUnzip<FromI>,

    Converts an iterator of tuples into a tuple of containers. Read more
    source§

    fn try_len(&self) -> Result<usize, (usize, Option<usize>)>

    Returns the length of the iterator if one exists. +determining identity using a keying function. Read more
    source§

    fn multiunzip<FromI>(self) -> FromI
    where + Self: Sized + MultiUnzip<FromI>,

    Converts an iterator of tuples into a tuple of containers. Read more
    source§

    fn try_len(&self) -> Result<usize, (usize, Option<usize>)>

    Returns the length of the iterator if one exists. Otherwise return self.size_hint(). Read more
    source§

    impl<T> 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 + 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/itertools/structs/struct.ProcessResults.html b/itertools/structs/struct.ProcessResults.html index f528fae95..ca820c964 100644 --- a/itertools/structs/struct.ProcessResults.html +++ b/itertools/structs/struct.ProcessResults.html @@ -1,10 +1,19 @@ -ProcessResults in itertools::structs - Rust
    +ProcessResults in itertools::structs - Rust

    Struct itertools::structs::ProcessResults

    source · 
    pub struct ProcessResults<'a, I, E: 'a> { /* private fields */ }
    Expand description

    An iterator that produces only the T values as long as the inner iterator produces Ok(T).

    Used by process_results, see its docs for more information.

    -

    Trait Implementations§

    source§

    impl<'a, I: Debug, E: Debug + 'a> Debug for ProcessResults<'a, I, E>

    source§

    fn fmt(&self, f: &mut Formatter<'_>) -> Result

    Formats the value using the given formatter. Read more
    source§

    impl<'a, I, T, E> Iterator for ProcessResults<'a, I, E>
    where - I: Iterator<Item = Result<T, E>>,

    §

    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 +

    Trait Implementations§

    source§

    impl<'a, I: Debug, E: Debug + 'a> Debug for ProcessResults<'a, I, E>

    source§

    fn fmt(&self, f: &mut Formatter<'_>) -> Result

    Formats the value using the given formatter. Read more
    source§

    impl<'a, I, T, E> DoubleEndedIterator for ProcessResults<'a, I, E>
    where + I: Iterator<Item = Result<T, E>> + DoubleEndedIterator,

    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, I, T, E> Iterator for ProcessResults<'a, I, E>
    where + I: Iterator<Item = Result<T, E>>,

    §

    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>( @@ -205,86 +214,87 @@ otherwise. Right variant of Either<Self, Self> otherwise. Read more

    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> Itertools for T
    where - T: Iterator + ?Sized,

    source§

    fn interleave<J>(self, other: J) -> Interleave<Self, J::IntoIter> ⓘ
    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> Itertools for T
    where + T: Iterator + ?Sized,

    source§

    fn interleave<J>(self, other: J) -> Interleave<Self, J::IntoIter> ⓘ
    where J: IntoIterator<Item = Self::Item>, - Self: Sized,

    Alternate elements from two iterators until both have run out. Read more
    source§

    fn interleave_shortest<J>( + Self: Sized,

    Alternate elements from two iterators until both have run out. Read more
    source§

    fn interleave_shortest<J>( self, other: J ) -> InterleaveShortest<Self, J::IntoIter> ⓘ
    where J: IntoIterator<Item = Self::Item>, Self: Sized,

    Alternate elements from two iterators until at least one of them has run -out. Read more
    source§

    fn intersperse(self, element: Self::Item) -> Intersperse<Self>
    where +out. Read more

    source§

    fn intersperse(self, element: Self::Item) -> Intersperse<Self>
    where Self: Sized, Self::Item: Clone,

    An iterator adaptor to insert a particular value -between each element of the adapted iterator. Read more
    source§

    fn intersperse_with<F>(self, element: F) -> IntersperseWith<Self, F> ⓘ
    where +between each element of the adapted iterator. Read more

    source§

    fn intersperse_with<F>(self, element: F) -> IntersperseWith<Self, F> ⓘ
    where Self: Sized, F: FnMut() -> Self::Item,

    An iterator adaptor to insert a particular value created by a function -between each element of the adapted iterator. Read more
    source§

    fn zip_longest<J>(self, other: J) -> ZipLongest<Self, J::IntoIter> ⓘ
    where +between each element of the adapted iterator. Read more

    source§

    fn get<R>(self, index: R) -> R::Output
    where + Self: Sized, + R: IteratorIndex<Self>,

    Returns an iterator over a subsection of the iterator. Read more
    source§

    fn zip_longest<J>(self, other: J) -> ZipLongest<Self, J::IntoIter> ⓘ
    where J: IntoIterator, Self: Sized,

    Create an iterator which iterates over both this and the specified -iterator simultaneously, yielding pairs of two optional elements. Read more
    source§

    fn zip_eq<J>(self, other: J) -> ZipEq<Self, J::IntoIter> ⓘ
    where +iterator simultaneously, yielding pairs of two optional elements. Read more

    source§

    fn zip_eq<J>(self, other: J) -> ZipEq<Self, J::IntoIter> ⓘ
    where J: IntoIterator, Self: Sized,

    Create an iterator which iterates over both this and the specified -iterator simultaneously, yielding pairs of elements. Read more
    source§

    fn batching<B, F>(self, f: F) -> Batching<Self, F> ⓘ
    where +iterator simultaneously, yielding pairs of elements. Read more

    source§

    fn batching<B, F>(self, f: F) -> Batching<Self, F> ⓘ
    where F: FnMut(&mut Self) -> Option<B>, Self: Sized,

    A “meta iterator adaptor”. Its closure receives a reference to the iterator and may pick off as many elements as it likes, to produce the -next iterator element. Read more
    source§

    fn group_by<K, F>(self, key: F) -> GroupBy<K, Self, F>
    where +next iterator element. Read more

    source§

    fn chunk_by<K, F>(self, key: F) -> ChunkBy<K, Self, F>
    where Self: Sized, F: FnMut(&Self::Item) -> K, K: PartialEq,

    Return an iterable that can group iterator elements. Consecutive elements that map to the same key (“runs”), are assigned -to the same group. Read more
    source§

    fn chunks(self, size: usize) -> IntoChunks<Self>
    where - Self: Sized,

    Return an iterable that can chunk the iterator. Read more
    source§

    fn tuple_windows<T>(self) -> TupleWindows<Self, T> ⓘ
    where +to the same group. Read more

    source§

    fn group_by<K, F>(self, key: F) -> ChunkBy<K, Self, F>
    where + Self: Sized, + F: FnMut(&Self::Item) -> K, + K: PartialEq,

    👎Deprecated since 0.13.0: Use .chunk_by() instead
    See .chunk_by().
    source§

    fn chunks(self, size: usize) -> IntoChunks<Self>
    where + Self: Sized,

    Return an iterable that can chunk the iterator. Read more
    source§

    fn tuple_windows<T>(self) -> TupleWindows<Self, T> ⓘ
    where Self: Sized + Iterator<Item = T::Item>, T: HomogeneousTuple, T::Item: Clone,

    Return an iterator over all contiguous windows producing tuples of -a specific size (up to 12). Read more
    source§

    fn circular_tuple_windows<T>(self) -> CircularTupleWindows<Self, T> ⓘ
    where +a specific size (up to 12). Read more

    source§

    fn circular_tuple_windows<T>(self) -> CircularTupleWindows<Self, T> ⓘ
    where Self: Sized + Clone + Iterator<Item = T::Item> + ExactSizeIterator, T: TupleCollect + Clone, T::Item: Clone,

    Return an iterator over all windows, wrapping back to the first elements when the window would otherwise exceed the length of the -iterator, producing tuples of a specific size (up to 12). Read more
    source§

    fn tuples<T>(self) -> Tuples<Self, T> ⓘ
    where +iterator, producing tuples of a specific size (up to 12). Read more

    source§

    fn tuples<T>(self) -> Tuples<Self, T> ⓘ
    where Self: Sized + Iterator<Item = T::Item>, T: HomogeneousTuple,

    Return an iterator that groups the items in tuples of a specific size -(up to 12). Read more
    source§

    fn tee(self) -> (Tee<Self>, Tee<Self>)
    where +(up to 12). Read more

    source§

    fn tee(self) -> (Tee<Self>, Tee<Self>)
    where Self: Sized, Self::Item: Clone,

    Split into an iterator pair that both yield all elements from -the original iterator. Read more
    source§

    fn step(self, n: usize) -> Step<Self> ⓘ
    where - Self: Sized,

    👎Deprecated since 0.8.0: Use std .step_by() instead
    Return an iterator adaptor that steps n elements in the base iterator -for each iteration. Read more
    source§

    fn map_into<R>(self) -> MapInto<Self, R>
    where +the original iterator. Read more

    source§

    fn map_into<R>(self) -> MapInto<Self, R>
    where Self: Sized, - Self::Item: Into<R>,

    Convert each item of the iterator using the Into trait. Read more
    source§

    fn map_results<F, T, U, E>(self, f: F) -> MapOk<Self, F>
    where - Self: Iterator<Item = Result<T, E>> + Sized, - F: FnMut(T) -> U,

    👎Deprecated since 0.10.0: Use .map_ok() instead
    See .map_ok().
    source§

    fn map_ok<F, T, U, E>(self, f: F) -> MapOk<Self, F>
    where + Self::Item: Into<R>,

    Convert each item of the iterator using the Into trait. Read more
    source§

    fn map_ok<F, T, U, E>(self, f: F) -> MapOk<Self, F>
    where Self: Iterator<Item = Result<T, E>> + Sized, F: FnMut(T) -> U,

    Return an iterator adaptor that applies the provided closure to every Result::Ok value. Result::Err values are -unchanged. Read more
    source§

    fn filter_ok<F, T, E>(self, f: F) -> FilterOk<Self, F> ⓘ
    where +unchanged. Read more

    source§

    fn filter_ok<F, T, E>(self, f: F) -> FilterOk<Self, F> ⓘ
    where Self: Iterator<Item = Result<T, E>> + Sized, F: FnMut(&T) -> bool,

    Return an iterator adaptor that filters every Result::Ok value with the provided closure. Result::Err values are -unchanged. Read more
    source§

    fn filter_map_ok<F, T, U, E>(self, f: F) -> FilterMapOk<Self, F> ⓘ
    where +unchanged. Read more

    source§

    fn filter_map_ok<F, T, U, E>(self, f: F) -> FilterMapOk<Self, F> ⓘ
    where Self: Iterator<Item = Result<T, E>> + Sized, F: FnMut(T) -> Option<U>,

    Return an iterator adaptor that filters and transforms every Result::Ok value with the provided closure. Result::Err -values are unchanged. Read more
    source§

    fn flatten_ok<T, E>(self) -> FlattenOk<Self, T, E> ⓘ
    where +values are unchanged. Read more

    source§

    fn flatten_ok<T, E>(self) -> FlattenOk<Self, T, E> ⓘ
    where Self: Iterator<Item = Result<T, E>> + Sized, T: IntoIterator,

    Return an iterator adaptor that flattens every Result::Ok value into -a series of Result::Ok values. Result::Err values are unchanged. Read more
    source§

    fn process_results<F, T, E, R>(self, processor: F) -> Result<R, E>
    where +a series of Result::Ok values. Result::Err values are unchanged. Read more

    source§

    fn process_results<F, T, E, R>(self, processor: F) -> Result<R, E>
    where Self: Iterator<Item = Result<T, E>> + Sized, F: FnOnce(ProcessResults<'_, Self, E>) -> R,

    “Lift” a function of the values of the current iterator so as to process -an iterator of Result values instead. Read more
    source§

    fn merge<J>(self, other: J) -> Merge<Self, J::IntoIter>
    where +an iterator of Result values instead. Read more

    source§

    fn merge<J>(self, other: J) -> Merge<Self, J::IntoIter>
    where Self: Sized, Self::Item: PartialOrd, J: IntoIterator<Item = Self::Item>,

    Return an iterator adaptor that merges the two base iterators in ascending order. If both base iterators are sorted (ascending), the -result is sorted. Read more
    source§

    fn merge_by<J, F>(self, other: J, is_first: F) -> MergeBy<Self, J::IntoIter, F> ⓘ
    where +result is sorted. Read more

    source§

    fn merge_by<J, F>(self, other: J, is_first: F) -> MergeBy<Self, J::IntoIter, F> ⓘ
    where Self: Sized, J: IntoIterator<Item = Self::Item>, F: FnMut(&Self::Item, &Self::Item) -> bool,

    Return an iterator adaptor that merges the two base iterators in order. -This is much like .merge() but allows for a custom ordering. Read more
    source§

    fn merge_join_by<J, F, T>( +This is much like .merge() but allows for a custom ordering. Read more

    source§

    fn merge_join_by<J, F, T>( self, other: J, cmp_fn: F @@ -292,284 +302,295 @@ This is much like IntoIterator, F: FnMut(&Self::Item, &J::Item) -> T, Self: Sized,

    Create an iterator that merges items from both this and the specified -iterator in ascending order. Read more
    source§

    fn kmerge(self) -> KMerge<<Self::Item as IntoIterator>::IntoIter>
    where +iterator in ascending order. Read more

    source§

    fn kmerge(self) -> KMerge<<Self::Item as IntoIterator>::IntoIter>
    where Self: Sized, Self::Item: IntoIterator, <Self::Item as IntoIterator>::Item: PartialOrd,

    Return an iterator adaptor that flattens an iterator of iterators by -merging them in ascending order. Read more
    source§

    fn kmerge_by<F>( +merging them in ascending order. Read more

    source§

    fn kmerge_by<F>( self, first: F ) -> KMergeBy<<Self::Item as IntoIterator>::IntoIter, F> ⓘ
    where Self: Sized, Self::Item: IntoIterator, F: FnMut(&<Self::Item as IntoIterator>::Item, &<Self::Item as IntoIterator>::Item) -> bool,

    Return an iterator adaptor that flattens an iterator of iterators by -merging them according to the given closure. Read more
    source§

    fn cartesian_product<J>(self, other: J) -> Product<Self, J::IntoIter> ⓘ
    where +merging them according to the given closure. Read more

    source§

    fn cartesian_product<J>(self, other: J) -> Product<Self, J::IntoIter> ⓘ
    where Self: Sized, Self::Item: Clone, J: IntoIterator, J::IntoIter: Clone,

    Return an iterator adaptor that iterates over the cartesian product of -the element sets of two iterators self and J. Read more
    source§

    fn multi_cartesian_product( +the element sets of two iterators self and J. Read more

    source§

    fn multi_cartesian_product( self ) -> MultiProduct<<Self::Item as IntoIterator>::IntoIter> ⓘ
    where Self: Sized, Self::Item: IntoIterator, <Self::Item as IntoIterator>::IntoIter: Clone, <Self::Item as IntoIterator>::Item: Clone,

    Return an iterator adaptor that iterates over the cartesian product of -all subiterators returned by meta-iterator self. Read more
    source§

    fn coalesce<F>(self, f: F) -> Coalesce<Self, F>
    where +all subiterators returned by meta-iterator self. Read more

    source§

    fn coalesce<F>(self, f: F) -> Coalesce<Self, F>
    where Self: Sized, F: FnMut(Self::Item, Self::Item) -> Result<Self::Item, (Self::Item, Self::Item)>,

    Return an iterator adaptor that uses the passed-in closure to -optionally merge together consecutive elements. Read more
    source§

    fn dedup(self) -> Dedup<Self>
    where +optionally merge together consecutive elements. Read more

    source§

    fn dedup(self) -> Dedup<Self>
    where Self: Sized, Self::Item: PartialEq,

    Remove duplicates from sections of consecutive identical elements. -If the iterator is sorted, all elements will be unique. Read more
    source§

    fn dedup_by<Cmp>(self, cmp: Cmp) -> DedupBy<Self, Cmp>
    where +If the iterator is sorted, all elements will be unique. Read more

    source§

    fn dedup_by<Cmp>(self, cmp: Cmp) -> DedupBy<Self, Cmp>
    where Self: Sized, Cmp: FnMut(&Self::Item, &Self::Item) -> bool,

    Remove duplicates from sections of consecutive identical elements, determining equality using a comparison function. -If the iterator is sorted, all elements will be unique. Read more
    source§

    fn dedup_with_count(self) -> DedupWithCount<Self>
    where +If the iterator is sorted, all elements will be unique. Read more

    source§

    fn dedup_with_count(self) -> DedupWithCount<Self>
    where Self: Sized,

    Remove duplicates from sections of consecutive identical elements, while keeping a count of how many repeated elements were present. -If the iterator is sorted, all elements will be unique. Read more
    source§

    fn dedup_by_with_count<Cmp>(self, cmp: Cmp) -> DedupByWithCount<Self, Cmp>
    where +If the iterator is sorted, all elements will be unique. Read more

    source§

    fn dedup_by_with_count<Cmp>(self, cmp: Cmp) -> DedupByWithCount<Self, Cmp>
    where Self: Sized, Cmp: FnMut(&Self::Item, &Self::Item) -> bool,

    Remove duplicates from sections of consecutive identical elements, while keeping a count of how many repeated elements were present. This will determine equality using a comparison function. -If the iterator is sorted, all elements will be unique. Read more
    source§

    fn duplicates(self) -> Duplicates<Self>
    where +If the iterator is sorted, all elements will be unique. Read more

    source§

    fn duplicates(self) -> Duplicates<Self>
    where Self: Sized, Self::Item: Eq + Hash,

    Return an iterator adaptor that produces elements that appear more than once during the -iteration. Duplicates are detected using hash and equality. Read more
    source§

    fn duplicates_by<V, F>(self, f: F) -> DuplicatesBy<Self, V, F>
    where +iteration. Duplicates are detected using hash and equality. Read more

    source§

    fn duplicates_by<V, F>(self, f: F) -> DuplicatesBy<Self, V, F>
    where Self: Sized, V: Eq + Hash, F: FnMut(&Self::Item) -> V,

    Return an iterator adaptor that produces elements that appear more than once during the -iteration. Duplicates are detected using hash and equality. Read more
    source§

    fn unique(self) -> Unique<Self> ⓘ
    where +iteration. Duplicates are detected using hash and equality. Read more

    source§

    fn unique(self) -> Unique<Self> ⓘ
    where Self: Sized, Self::Item: Clone + Eq + Hash,

    Return an iterator adaptor that filters out elements that have already been produced once during the iteration. Duplicates -are detected using hash and equality. Read more
    source§

    fn unique_by<V, F>(self, f: F) -> UniqueBy<Self, V, F> ⓘ
    where +are detected using hash and equality. Read more

    source§

    fn unique_by<V, F>(self, f: F) -> UniqueBy<Self, V, F> ⓘ
    where Self: Sized, V: Eq + Hash, F: FnMut(&Self::Item) -> V,

    Return an iterator adaptor that filters out elements that have -already been produced once during the iteration. Read more
    source§

    fn peeking_take_while<F>(&mut self, accept: F) -> PeekingTakeWhile<'_, Self, F> ⓘ
    where +already been produced once during the iteration. Read more

    source§

    fn peeking_take_while<F>(&mut self, accept: F) -> PeekingTakeWhile<'_, Self, F> ⓘ
    where Self: Sized + PeekingNext, F: FnMut(&Self::Item) -> bool,

    Return an iterator adaptor that borrows from this iterator and -takes items while the closure accept returns true. Read more
    source§

    fn take_while_ref<F>(&mut self, accept: F) -> TakeWhileRef<'_, Self, F> ⓘ
    where +takes items while the closure accept returns true. Read more

    source§

    fn take_while_ref<F>(&mut self, accept: F) -> TakeWhileRef<'_, Self, F> ⓘ
    where Self: Clone, F: FnMut(&Self::Item) -> bool,

    Return an iterator adaptor that borrows from a Clone-able iterator -to only pick off elements while the predicate accept returns true. Read more
    source§

    fn take_while_inclusive<F>(self, accept: F) -> TakeWhileInclusive<Self, F> ⓘ
    where +to only pick off elements while the predicate accept returns true. Read more

    source§

    fn take_while_inclusive<F>(self, accept: F) -> TakeWhileInclusive<Self, F> ⓘ
    where Self: Sized, F: FnMut(&Self::Item) -> bool,

    Returns an iterator adaptor that consumes elements while the given predicate is true, including the element for which the predicate -first returned false. Read more
    source§

    fn while_some<A>(self) -> WhileSome<Self> ⓘ
    where +first returned false. Read more

    source§

    fn while_some<A>(self) -> WhileSome<Self> ⓘ
    where Self: Sized + Iterator<Item = Option<A>>,

    Return an iterator adaptor that filters Option<A> iterator elements -and produces A. Stops on the first None encountered. Read more
    source§

    fn tuple_combinations<T>(self) -> TupleCombinations<Self, T> ⓘ
    where +and produces A. Stops on the first None encountered. Read more

    source§

    fn tuple_combinations<T>(self) -> TupleCombinations<Self, T> ⓘ
    where Self: Sized + Clone, Self::Item: Clone, T: HasCombination<Self>,

    Return an iterator adaptor that iterates over the combinations of the -elements from an iterator. Read more
    source§

    fn combinations(self, k: usize) -> Combinations<Self> ⓘ
    where +elements from an iterator. Read more

    source§

    fn combinations(self, k: usize) -> Combinations<Self> ⓘ
    where Self: Sized, Self::Item: Clone,

    Return an iterator adaptor that iterates over the k-length combinations of -the elements from an iterator. Read more
    source§

    fn combinations_with_replacement( +the elements from an iterator. Read more

    source§

    fn combinations_with_replacement( self, k: usize ) -> CombinationsWithReplacement<Self> ⓘ
    where Self: Sized, Self::Item: Clone,

    Return an iterator that iterates over the k-length combinations of -the elements from an iterator, with replacement. Read more
    source§

    fn permutations(self, k: usize) -> Permutations<Self> ⓘ
    where +the elements from an iterator, with replacement. Read more

    source§

    fn permutations(self, k: usize) -> Permutations<Self> ⓘ
    where Self: Sized, Self::Item: Clone,

    Return an iterator adaptor that iterates over all k-permutations of the -elements from an iterator. Read more
    source§

    fn powerset(self) -> Powerset<Self> ⓘ
    where +elements from an iterator. Read more

    source§

    fn powerset(self) -> Powerset<Self> ⓘ
    where Self: Sized, Self::Item: Clone,

    Return an iterator that iterates through the powerset of the elements from an -iterator. Read more
    source§

    fn pad_using<F>(self, min: usize, f: F) -> PadUsing<Self, F> ⓘ
    where +iterator. Read more

    source§

    fn pad_using<F>(self, min: usize, f: F) -> PadUsing<Self, F> ⓘ
    where Self: Sized, F: FnMut(usize) -> Self::Item,

    Return an iterator adaptor that pads the sequence to a minimum length of -min by filling missing elements using a closure f. Read more
    source§

    fn with_position(self) -> WithPosition<Self> ⓘ
    where +min by filling missing elements using a closure f. Read more

    source§

    fn with_position(self) -> WithPosition<Self> ⓘ
    where Self: Sized,

    Return an iterator adaptor that combines each element with a Position to -ease special-case handling of the first or last elements. Read more
    source§

    fn positions<P>(self, predicate: P) -> Positions<Self, P> ⓘ
    where +ease special-case handling of the first or last elements. Read more

    source§

    fn positions<P>(self, predicate: P) -> Positions<Self, P> ⓘ
    where Self: Sized, P: FnMut(Self::Item) -> bool,

    Return an iterator adaptor that yields the indices of all elements -satisfying a predicate, counted from the start of the iterator. Read more
    source§

    fn update<F>(self, updater: F) -> Update<Self, F> ⓘ
    where +satisfying a predicate, counted from the start of the iterator. Read more

    source§

    fn update<F>(self, updater: F) -> Update<Self, F> ⓘ
    where Self: Sized, F: FnMut(&mut Self::Item),

    Return an iterator adaptor that applies a mutating function -to each element before yielding it. Read more
    source§

    fn next_tuple<T>(&mut self) -> Option<T>
    where +to each element before yielding it. Read more

    source§

    fn next_tuple<T>(&mut self) -> Option<T>
    where Self: Sized + Iterator<Item = T::Item>, T: HomogeneousTuple,

    Advances the iterator and returns the next items grouped in a tuple of -a specific size (up to 12). Read more
    source§

    fn collect_tuple<T>(self) -> Option<T>
    where +a specific size (up to 12). Read more

    source§

    fn collect_tuple<T>(self) -> Option<T>
    where Self: Sized + Iterator<Item = T::Item>, T: HomogeneousTuple,

    Collects all items from the iterator into a tuple of a specific size -(up to 12). Read more
    source§

    fn find_position<P>(&mut self, pred: P) -> Option<(usize, Self::Item)>
    where - P: FnMut(&Self::Item) -> bool,

    Find the position and value of the first element satisfying a predicate. Read more
    source§

    fn find_or_last<P>(self, predicate: P) -> Option<Self::Item>
    where +(up to 12). Read more

    source§

    fn find_position<P>(&mut self, pred: P) -> Option<(usize, Self::Item)>
    where + P: FnMut(&Self::Item) -> bool,

    Find the position and value of the first element satisfying a predicate. Read more
    source§

    fn find_or_last<P>(self, predicate: P) -> Option<Self::Item>
    where Self: Sized, - P: FnMut(&Self::Item) -> bool,

    Find the value of the first element satisfying a predicate or return the last element, if any. Read more
    source§

    fn find_or_first<P>(self, predicate: P) -> Option<Self::Item>
    where + P: FnMut(&Self::Item) -> bool,

    Find the value of the first element satisfying a predicate or return the last element, if any. Read more
    source§

    fn find_or_first<P>(self, predicate: P) -> Option<Self::Item>
    where Self: Sized, - P: FnMut(&Self::Item) -> bool,

    Find the value of the first element satisfying a predicate or return the first element, if any. Read more
    source§

    fn contains<Q>(&mut self, query: &Q) -> bool
    where + P: FnMut(&Self::Item) -> bool,

    Find the value of the first element satisfying a predicate or return the first element, if any. Read more
    source§

    fn contains<Q>(&mut self, query: &Q) -> bool
    where Self: Sized, Self::Item: Borrow<Q>, - Q: PartialEq,

    Returns true if the given item is present in this iterator. Read more
    source§

    fn all_equal(&mut self) -> bool
    where + Q: PartialEq,

    Returns true if the given item is present in this iterator. Read more
    source§

    fn all_equal(&mut self) -> bool
    where Self: Sized, - Self::Item: PartialEq,

    Check whether all elements compare equal. Read more
    source§

    fn all_equal_value( + Self::Item: PartialEq,

    Check whether all elements compare equal. Read more
    source§

    fn all_equal_value( &mut self ) -> Result<Self::Item, Option<(Self::Item, Self::Item)>>
    where Self: Sized, Self::Item: PartialEq,

    If there are elements and they are all equal, return a single copy of that element. If there are no elements, return an Error containing None. If there are elements and they are not all equal, return a tuple containing the first -two non-equal elements found. Read more
    source§

    fn all_unique(&mut self) -> bool
    where +two non-equal elements found. Read more

    source§

    fn all_unique(&mut self) -> bool
    where Self: Sized, - Self::Item: Eq + Hash,

    Check whether all elements are unique (non equal). Read more
    source§

    fn dropping(self, n: usize) -> Self
    where + Self::Item: Eq + Hash,

    Check whether all elements are unique (non equal). Read more
    source§

    fn dropping(self, n: usize) -> Self
    where Self: Sized,

    Consume the first n elements from the iterator eagerly, -and return the same iterator again. Read more
    source§

    fn dropping_back(self, n: usize) -> Self
    where +and return the same iterator again. Read more

    source§

    fn dropping_back(self, n: usize) -> Self
    where Self: Sized + DoubleEndedIterator,

    Consume the last n elements from the iterator eagerly, -and return the same iterator again. Read more
    source§

    fn foreach<F>(self, f: F)
    where - F: FnMut(Self::Item), - Self: Sized,

    👎Deprecated since 0.8.0: Use .for_each() instead
    Run the closure f eagerly on each element of the iterator. Read more
    source§

    fn concat(self) -> Self::Item
    where +and return the same iterator again. Read more

    source§

    fn concat(self) -> Self::Item
    where Self: Sized, - Self::Item: Extend<<<Self as Iterator>::Item as IntoIterator>::Item> + IntoIterator + Default,

    Combine all an iterator’s elements into one element by using Extend. Read more
    source§

    fn collect_vec(self) -> Vec<Self::Item>
    where + Self::Item: Extend<<<Self as Iterator>::Item as IntoIterator>::Item> + IntoIterator + Default,

    Combine all an iterator’s elements into one element by using Extend. Read more
    source§

    fn collect_vec(self) -> Vec<Self::Item>
    where Self: Sized,

    .collect_vec() is simply a type specialization of Iterator::collect, -for convenience.
    source§

    fn try_collect<T, U, E>(self) -> Result<U, E>
    where +for convenience.

    source§

    fn try_collect<T, U, E>(self) -> Result<U, E>
    where Self: Sized + Iterator<Item = Result<T, E>>, Result<U, E>: FromIterator<Result<T, E>>,

    .try_collect() is more convenient way of writing -.collect::<Result<_, _>>() Read more
    source§

    fn set_from<'a, A: 'a, J>(&mut self, from: J) -> usize
    where +.collect::<Result<_, _>>() Read more

    source§

    fn set_from<'a, A: 'a, J>(&mut self, from: J) -> usize
    where Self: Iterator<Item = &'a mut A>, J: IntoIterator<Item = A>,

    Assign to each reference in self from the from iterator, -stopping at the shortest of the two iterators. Read more
    source§

    fn join(&mut self, sep: &str) -> String
    where - Self::Item: Display,

    Combine all iterator elements into one String, separated by sep. Read more
    source§

    fn format(self, sep: &str) -> Format<'_, Self>
    where - Self: Sized,

    Format all iterator elements, separated by sep. Read more
    source§

    fn format_with<F>(self, sep: &str, format: F) -> FormatWith<'_, Self, F>
    where +stopping at the shortest of the two iterators. Read more

    source§

    fn join(&mut self, sep: &str) -> String
    where + Self::Item: Display,

    Combine all iterator elements into one String, separated by sep. Read more
    source§

    fn format(self, sep: &str) -> Format<'_, Self>
    where + Self: Sized,

    Format all iterator elements, separated by sep. Read more
    source§

    fn format_with<F>(self, sep: &str, format: F) -> FormatWith<'_, Self, F>
    where Self: Sized, - F: FnMut(Self::Item, &mut dyn FnMut(&dyn Display) -> Result) -> Result,

    Format all iterator elements, separated by sep. Read more
    source§

    fn fold_results<A, E, B, F>(&mut self, start: B, f: F) -> Result<B, E>
    where + F: FnMut(Self::Item, &mut dyn FnMut(&dyn Display) -> Result) -> Result,

    Format all iterator elements, separated by sep. Read more
    source§

    fn fold_ok<A, E, B, F>(&mut self, start: B, f: F) -> Result<B, E>
    where Self: Iterator<Item = Result<A, E>>, - F: FnMut(B, A) -> B,

    👎Deprecated since 0.10.0: Use .fold_ok() instead
    See .fold_ok().
    source§

    fn fold_ok<A, E, B, F>(&mut self, start: B, f: F) -> Result<B, E>
    where - Self: Iterator<Item = Result<A, E>>, - F: FnMut(B, A) -> B,

    Fold Result values from an iterator. Read more
    source§

    fn fold_options<A, B, F>(&mut self, start: B, f: F) -> Option<B>
    where + F: FnMut(B, A) -> B,

    Fold Result values from an iterator. Read more
    source§

    fn fold_options<A, B, F>(&mut self, start: B, f: F) -> Option<B>
    where Self: Iterator<Item = Option<A>>, - F: FnMut(B, A) -> B,

    Fold Option values from an iterator. Read more
    source§

    fn fold1<F>(self, f: F) -> Option<Self::Item>
    where + F: FnMut(B, A) -> B,

    Fold Option values from an iterator. Read more
    source§

    fn fold1<F>(self, f: F) -> Option<Self::Item>
    where F: FnMut(Self::Item, Self::Item) -> Self::Item, - Self: Sized,

    👎Deprecated since 0.10.2: Use Iterator::reduce instead
    Accumulator of the elements in the iterator. Read more
    source§

    fn tree_fold1<F>(self, f: F) -> Option<Self::Item>
    where + Self: Sized,

    👎Deprecated since 0.10.2: Use Iterator::reduce instead
    Accumulator of the elements in the iterator. Read more
    source§

    fn tree_reduce<F>(self, f: F) -> Option<Self::Item>
    where F: FnMut(Self::Item, Self::Item) -> Self::Item, - Self: Sized,

    Accumulate the elements in the iterator in a tree-like manner. Read more
    source§

    fn fold_while<B, F>(&mut self, init: B, f: F) -> FoldWhile<B>
    where + Self: Sized,

    Accumulate the elements in the iterator in a tree-like manner. Read more
    source§

    fn tree_fold1<F>(self, f: F) -> Option<Self::Item>
    where + F: FnMut(Self::Item, Self::Item) -> Self::Item, + Self: Sized,

    👎Deprecated since 0.13.0: Use .tree_reduce() instead
    See .tree_reduce().
    source§

    fn fold_while<B, F>(&mut self, init: B, f: F) -> FoldWhile<B>
    where Self: Sized, - F: FnMut(B, Self::Item) -> FoldWhile<B>,

    An iterator method that applies a function, producing a single, final value. Read more
    source§

    fn sum1<S>(self) -> Option<S>
    where + F: FnMut(B, Self::Item) -> FoldWhile<B>,

    An iterator method that applies a function, producing a single, final value. Read more
    source§

    fn sum1<S>(self) -> Option<S>
    where Self: Sized, - S: Sum<Self::Item>,

    Iterate over the entire iterator and add all the elements. Read more
    source§

    fn product1<P>(self) -> Option<P>
    where + S: Sum<Self::Item>,

    Iterate over the entire iterator and add all the elements. Read more
    source§

    fn product1<P>(self) -> Option<P>
    where Self: Sized, - P: Product<Self::Item>,

    Iterate over the entire iterator and multiply all the elements. Read more
    source§

    fn sorted_unstable(self) -> IntoIter<Self::Item> ⓘ
    where + P: Product<Self::Item>,

    Iterate over the entire iterator and multiply all the elements. Read more
    source§

    fn sorted_unstable(self) -> IntoIter<Self::Item> ⓘ
    where Self: Sized, - Self::Item: Ord,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_unstable_by<F>(self, cmp: F) -> IntoIter<Self::Item> ⓘ
    where + Self::Item: Ord,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_unstable_by<F>(self, cmp: F) -> IntoIter<Self::Item> ⓘ
    where Self: Sized, - F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_unstable_by_key<K, F>(self, f: F) -> IntoIter<Self::Item> ⓘ
    where + F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_unstable_by_key<K, F>(self, f: F) -> IntoIter<Self::Item> ⓘ
    where Self: Sized, K: Ord, - F: FnMut(&Self::Item) -> K,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted(self) -> IntoIter<Self::Item> ⓘ
    where + F: FnMut(&Self::Item) -> K,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted(self) -> IntoIter<Self::Item> ⓘ
    where Self: Sized, - Self::Item: Ord,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_by<F>(self, cmp: F) -> IntoIter<Self::Item> ⓘ
    where + Self::Item: Ord,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_by<F>(self, cmp: F) -> IntoIter<Self::Item> ⓘ
    where Self: Sized, - F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_by_key<K, F>(self, f: F) -> IntoIter<Self::Item> ⓘ
    where + F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_by_key<K, F>(self, f: F) -> IntoIter<Self::Item> ⓘ
    where Self: Sized, K: Ord, - F: FnMut(&Self::Item) -> K,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_by_cached_key<K, F>(self, f: F) -> IntoIter<Self::Item> ⓘ
    where + F: FnMut(&Self::Item) -> K,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_by_cached_key<K, F>(self, f: F) -> IntoIter<Self::Item> ⓘ
    where Self: Sized, K: Ord, F: FnMut(&Self::Item) -> K,

    Sort all iterator elements into a new iterator in ascending order. The key function is -called exactly once per key. Read more
    source§

    fn k_smallest(self, k: usize) -> IntoIter<Self::Item> ⓘ
    where +called exactly once per key. Read more

    source§

    fn k_smallest(self, k: usize) -> IntoIter<Self::Item> ⓘ
    where Self: Sized, - Self::Item: Ord,

    Sort the k smallest elements into a new iterator, in ascending order. Read more
    source§

    fn partition_map<A, B, F, L, R>(self, predicate: F) -> (A, B)
    where + Self::Item: Ord,

    Sort the k smallest elements into a new iterator, in ascending order. Read more
    source§

    fn k_smallest_by<F>(self, k: usize, cmp: F) -> IntoIter<Self::Item> ⓘ
    where + Self: Sized, + F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Sort the k smallest elements into a new iterator using the provided comparison. Read more
    source§

    fn k_smallest_by_key<F, K>(self, k: usize, key: F) -> IntoIter<Self::Item> ⓘ
    where + Self: Sized, + F: FnMut(&Self::Item) -> K, + K: Ord,

    Return the elements producing the k smallest outputs of the provided function. Read more
    source§

    fn k_largest(self, k: usize) -> IntoIter<Self::Item> ⓘ
    where + Self: Sized, + Self::Item: Ord,

    Sort the k largest elements into a new iterator, in descending order. Read more
    source§

    fn k_largest_by<F>(self, k: usize, cmp: F) -> IntoIter<Self::Item> ⓘ
    where + Self: Sized, + F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Sort the k largest elements into a new iterator using the provided comparison. Read more
    source§

    fn k_largest_by_key<F, K>(self, k: usize, key: F) -> IntoIter<Self::Item> ⓘ
    where + Self: Sized, + F: FnMut(&Self::Item) -> K, + K: Ord,

    Return the elements producing the k largest outputs of the provided function. Read more
    source§

    fn tail(self, n: usize) -> IntoIter<Self::Item> ⓘ
    where + Self: Sized,

    Consumes the iterator and return an iterator of the last n elements. Read more
    source§

    fn partition_map<A, B, F, L, R>(self, predicate: F) -> (A, B)
    where Self: Sized, F: FnMut(Self::Item) -> Either<L, R>, A: Default + Extend<L>, B: Default + Extend<R>,

    Collect all iterator elements into one of two partitions. Unlike Iterator::partition, each partition may -have a distinct type. Read more
    source§

    fn partition_result<A, B, T, E>(self) -> (A, B)
    where +have a distinct type. Read more

    source§

    fn partition_result<A, B, T, E>(self) -> (A, B)
    where Self: Iterator<Item = Result<T, E>> + Sized, A: Default + Extend<T>, B: Default + Extend<E>,

    Partition a sequence of Results into one list of all the Ok elements -and another list of all the Err elements. Read more
    source§

    fn into_group_map<K, V>(self) -> HashMap<K, Vec<V>>
    where +and another list of all the Err elements. Read more

    source§

    fn into_group_map<K, V>(self) -> HashMap<K, Vec<V>>
    where Self: Iterator<Item = (K, V)> + Sized, K: Hash + Eq,

    Return a HashMap of keys mapped to Vecs of values. Keys and values -are taken from (Key, Value) tuple pairs yielded by the input iterator. Read more
    source§

    fn into_group_map_by<K, V, F>(self, f: F) -> HashMap<K, Vec<V>>
    where +are taken from (Key, Value) tuple pairs yielded by the input iterator. Read more

    source§

    fn into_group_map_by<K, V, F>(self, f: F) -> HashMap<K, Vec<V>>
    where Self: Iterator<Item = V> + Sized, K: Hash + Eq, - F: Fn(&V) -> K,

    Return an Iterator on a HashMap. Keys mapped to Vecs of values. The key is specified -in the closure. Read more
    source§

    fn into_grouping_map<K, V>(self) -> GroupingMap<Self>
    where + F: FnMut(&V) -> K,

    Return an Iterator on a HashMap. Keys mapped to Vecs of values. The key is specified +in the closure. Read more
    source§

    fn into_grouping_map<K, V>(self) -> GroupingMap<Self>
    where Self: Iterator<Item = (K, V)> + Sized, K: Hash + Eq,

    Constructs a GroupingMap to be used later with one of the efficient -group-and-fold operations it allows to perform. Read more
    source§

    fn into_grouping_map_by<K, V, F>(self, key_mapper: F) -> GroupingMapBy<Self, F>
    where +group-and-fold operations it allows to perform. Read more

    source§

    fn into_grouping_map_by<K, V, F>(self, key_mapper: F) -> GroupingMapBy<Self, F>
    where Self: Iterator<Item = V> + Sized, K: Hash + Eq, F: FnMut(&V) -> K,

    Constructs a GroupingMap to be used later with one of the efficient -group-and-fold operations it allows to perform. Read more
    source§

    fn min_set(self) -> Vec<Self::Item>
    where +group-and-fold operations it allows to perform. Read more

    source§

    fn min_set(self) -> Vec<Self::Item>
    where Self: Sized, - Self::Item: Ord,

    Return all minimum elements of an iterator. Read more
    source§

    fn min_set_by<F>(self, compare: F) -> Vec<Self::Item>
    where + Self::Item: Ord,

    Return all minimum elements of an iterator. Read more
    source§

    fn min_set_by<F>(self, compare: F) -> Vec<Self::Item>
    where Self: Sized, F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Return all minimum elements of an iterator, as determined by -the specified function. Read more
    source§

    fn min_set_by_key<K, F>(self, key: F) -> Vec<Self::Item>
    where +the specified function. Read more

    source§

    fn min_set_by_key<K, F>(self, key: F) -> Vec<Self::Item>
    where Self: Sized, K: Ord, F: FnMut(&Self::Item) -> K,

    Return all minimum elements of an iterator, as determined by -the specified function. Read more
    source§

    fn max_set(self) -> Vec<Self::Item>
    where +the specified function. Read more

    source§

    fn max_set(self) -> Vec<Self::Item>
    where Self: Sized, - Self::Item: Ord,

    Return all maximum elements of an iterator. Read more
    source§

    fn max_set_by<F>(self, compare: F) -> Vec<Self::Item>
    where + Self::Item: Ord,

    Return all maximum elements of an iterator. Read more
    source§

    fn max_set_by<F>(self, compare: F) -> Vec<Self::Item>
    where Self: Sized, F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Return all maximum elements of an iterator, as determined by -the specified function. Read more
    source§

    fn max_set_by_key<K, F>(self, key: F) -> Vec<Self::Item>
    where +the specified function. Read more

    source§

    fn max_set_by_key<K, F>(self, key: F) -> Vec<Self::Item>
    where Self: Sized, K: Ord, F: FnMut(&Self::Item) -> K,

    Return all maximum elements of an iterator, as determined by -the specified function. Read more
    source§

    fn minmax(self) -> MinMaxResult<Self::Item>
    where +the specified function. Read more

    source§

    fn minmax(self) -> MinMaxResult<Self::Item>
    where Self: Sized, - Self::Item: PartialOrd,

    Return the minimum and maximum elements in the iterator. Read more
    source§

    fn minmax_by_key<K, F>(self, key: F) -> MinMaxResult<Self::Item>
    where + Self::Item: PartialOrd,

    Return the minimum and maximum elements in the iterator. Read more
    source§

    fn minmax_by_key<K, F>(self, key: F) -> MinMaxResult<Self::Item>
    where Self: Sized, K: PartialOrd, F: FnMut(&Self::Item) -> K,

    Return the minimum and maximum element of an iterator, as determined by -the specified function. Read more
    source§

    fn minmax_by<F>(self, compare: F) -> MinMaxResult<Self::Item>
    where +the specified function. Read more

    source§

    fn minmax_by<F>(self, compare: F) -> MinMaxResult<Self::Item>
    where Self: Sized, F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Return the minimum and maximum element of an iterator, as determined by -the specified comparison function. Read more
    source§

    fn position_max(self) -> Option<usize>
    where +the specified comparison function. Read more

    source§

    fn position_max(self) -> Option<usize>
    where Self: Sized, - Self::Item: Ord,

    Return the position of the maximum element in the iterator. Read more
    source§

    fn position_max_by_key<K, F>(self, key: F) -> Option<usize>
    where + Self::Item: Ord,

    Return the position of the maximum element in the iterator. Read more
    source§

    fn position_max_by_key<K, F>(self, key: F) -> Option<usize>
    where Self: Sized, K: Ord, F: FnMut(&Self::Item) -> K,

    Return the position of the maximum element in the iterator, as -determined by the specified function. Read more
    source§

    fn position_max_by<F>(self, compare: F) -> Option<usize>
    where +determined by the specified function. Read more

    source§

    fn position_max_by<F>(self, compare: F) -> Option<usize>
    where Self: Sized, F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Return the position of the maximum element in the iterator, as -determined by the specified comparison function. Read more
    source§

    fn position_min(self) -> Option<usize>
    where +determined by the specified comparison function. Read more

    source§

    fn position_min(self) -> Option<usize>
    where Self: Sized, - Self::Item: Ord,

    Return the position of the minimum element in the iterator. Read more
    source§

    fn position_min_by_key<K, F>(self, key: F) -> Option<usize>
    where + Self::Item: Ord,

    Return the position of the minimum element in the iterator. Read more
    source§

    fn position_min_by_key<K, F>(self, key: F) -> Option<usize>
    where Self: Sized, K: Ord, F: FnMut(&Self::Item) -> K,

    Return the position of the minimum element in the iterator, as -determined by the specified function. Read more
    source§

    fn position_min_by<F>(self, compare: F) -> Option<usize>
    where +determined by the specified function. Read more

    source§

    fn position_min_by<F>(self, compare: F) -> Option<usize>
    where Self: Sized, F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Return the position of the minimum element in the iterator, as -determined by the specified comparison function. Read more
    source§

    fn position_minmax(self) -> MinMaxResult<usize>
    where +determined by the specified comparison function. Read more

    source§

    fn position_minmax(self) -> MinMaxResult<usize>
    where Self: Sized, Self::Item: PartialOrd,

    Return the positions of the minimum and maximum elements in -the iterator. Read more
    source§

    fn position_minmax_by_key<K, F>(self, key: F) -> MinMaxResult<usize>
    where +the iterator. Read more

    source§

    fn position_minmax_by_key<K, F>(self, key: F) -> MinMaxResult<usize>
    where Self: Sized, K: PartialOrd, F: FnMut(&Self::Item) -> K,

    Return the postions of the minimum and maximum elements of an -iterator, as determined by the specified function. Read more
    source§

    fn position_minmax_by<F>(self, compare: F) -> MinMaxResult<usize>
    where +iterator, as determined by the specified function. Read more

    source§

    fn position_minmax_by<F>(self, compare: F) -> MinMaxResult<usize>
    where Self: Sized, F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Return the postions of the minimum and maximum elements of an -iterator, as determined by the specified comparison function. Read more
    source§

    fn exactly_one(self) -> Result<Self::Item, ExactlyOneError<Self>>
    where +iterator, as determined by the specified comparison function. Read more

    source§

    fn exactly_one(self) -> Result<Self::Item, ExactlyOneError<Self>>
    where Self: Sized,

    If the iterator yields exactly one element, that element will be returned, otherwise an error will be returned containing an iterator that has the same output as the input -iterator. Read more
    source§

    fn at_most_one(self) -> Result<Option<Self::Item>, ExactlyOneError<Self>>
    where - Self: Sized,

    If the iterator yields no elements, Ok(None) will be returned. If the iterator yields +iterator. Read more
    source§

    fn at_most_one(self) -> Result<Option<Self::Item>, ExactlyOneError<Self>>
    where + Self: Sized,

    If the iterator yields no elements, Ok(None) will be returned. If the iterator yields exactly one element, that element will be returned, otherwise an error will be returned -containing an iterator that has the same output as the input iterator. Read more
    source§

    fn multipeek(self) -> MultiPeek<Self> ⓘ
    where +containing an iterator that has the same output as the input iterator. Read more

    source§

    fn multipeek(self) -> MultiPeek<Self> ⓘ
    where Self: Sized,

    An iterator adaptor that allows the user to peek at multiple .next() -values without advancing the base iterator. Read more
    source§

    fn counts(self) -> HashMap<Self::Item, usize>
    where +values without advancing the base iterator. Read more

    source§

    fn counts(self) -> HashMap<Self::Item, usize>
    where Self: Sized, Self::Item: Eq + Hash,

    Collect the items in this iterator and return a HashMap which contains each item that appears in the iterator and the number -of times it appears. Read more
    source§

    fn counts_by<K, F>(self, f: F) -> HashMap<K, usize>
    where +of times it appears. Read more

    source§

    fn counts_by<K, F>(self, f: F) -> HashMap<K, usize>
    where Self: Sized, K: Eq + Hash, F: FnMut(Self::Item) -> K,

    Collect the items in this iterator and return a HashMap which contains each item that appears in the iterator and the number of times it appears, -determining identity using a keying function. Read more
    source§

    fn multiunzip<FromI>(self) -> FromI
    where - Self: Sized + MultiUnzip<FromI>,

    Converts an iterator of tuples into a tuple of containers. Read more
    source§

    fn try_len(&self) -> Result<usize, (usize, Option<usize>)>

    Returns the length of the iterator if one exists. +determining identity using a keying function. Read more
    source§

    fn multiunzip<FromI>(self) -> FromI
    where + Self: Sized + MultiUnzip<FromI>,

    Converts an iterator of tuples into a tuple of containers. Read more
    source§

    fn try_len(&self) -> Result<usize, (usize, Option<usize>)>

    Returns the length of the iterator if one exists. Otherwise return self.size_hint(). Read more
    source§

    impl<IT> MultiUnzip<()> for IT
    where IT: Iterator<Item = ()>,

    source§

    fn multiunzip(self)

    Unzip this iterator into multiple collections.
    source§

    impl<IT, A, FromA> MultiUnzip<(FromA,)> for IT
    where IT: Iterator<Item = (A,)>, @@ -671,4 +692,4 @@ Otherwise return self.size_hint(). (FromA, FromB, FromC, FromD, FromE, FromF, FromG, FromH, FromI, FromJ, FromK, FromL)

    Unzip this iterator into multiple collections.
    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 + 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/itertools/structs/struct.Product.html b/itertools/structs/struct.Product.html index 6ca4032eb..438085bb4 100644 --- a/itertools/structs/struct.Product.html +++ b/itertools/structs/struct.Product.html @@ -1,17 +1,17 @@ -Product in itertools::structs - Rust
    -

    Struct itertools::structs::Product

    source · 
    pub struct Product<I, J>
    where
+Product in itertools::structs - Rust
    
+    
    Struct itertools::structs::Product
    source · 
    pub struct Product<I, J>
    where
     I: Iterator,
    { /* private fields */ }
    Expand description
    An iterator adaptor that iterates over the cartesian product of
 the element sets of two iterators I and J.
    
 
    Iterator element type is (I::Item, J::Item).
    
 
    See .cartesian_product() for more information.
    
-
    Trait Implementations§
    source§
    impl<I, J: Clone> Clone for Product<I, J>
    where
+
    Trait Implementations§
    source§
    impl<I, J: Clone> Clone for Product<I, J>
    where
     I: Iterator + Clone,
-    I::Item: Clone,
    source§
    fn clone(&self) -> Product<I, J> ⓘ
    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<I, J: Debug> Debug for Product<I, J>
    where
+    I::Item: Clone,
    source§
    fn clone(&self) -> Product<I, J> ⓘ
    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<I, J: Debug> Debug for Product<I, J>
    where
     I: Iterator + Debug,
-    I::Item: Debug,
    source§
    fn fmt(&self, f: &mut Formatter<'_>) -> Result
    Formats the value using the given formatter. Read more
    source§
    impl<I, J> Iterator for Product<I, J>
    where
+    I::Item: Debug,
    source§
    fn fmt(&self, f: &mut Formatter<'_>) -> Result
    Formats the value using the given formatter. Read more
    source§
    impl<I, J> Iterator for Product<I, J>
    where
     I: Iterator,
     J: Clone + Iterator,
-    I::Item: Clone,
    §
    type Item = (<I as Iterator>::Item, <J as Iterator>::Item)
    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<Acc, G>(self, accum: Acc, f: G) -> Acc
    where
+    I::Item: Clone,
    §
    type Item = (<I as Iterator>::Item, <J as Iterator>::Item)
    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<Acc, G>(self, accum: Acc, f: G) -> Acc
    where
     G: FnMut(Acc, Self::Item) -> Acc,
    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
@@ -187,7 +187,7 @@ greater than or equal to those of another. 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, J> FusedIterator for Product<I, J>
    where
+function. Read more
    source§
    impl<I, J> FusedIterator for Product<I, J>
    where
     I: FusedIterator,
     J: Clone + FusedIterator,
     I::Item: Clone,

    Auto Trait Implementations§

    §

    impl<I, J> Freeze for Product<I, J>
    where @@ -224,86 +224,87 @@ otherwise. Right variant of Either<Self, Self> otherwise. Read more

    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> Itertools for T
    where - T: Iterator + ?Sized,

    source§

    fn interleave<J>(self, other: J) -> Interleave<Self, J::IntoIter> ⓘ
    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> Itertools for T
    where + T: Iterator + ?Sized,

    source§

    fn interleave<J>(self, other: J) -> Interleave<Self, J::IntoIter> ⓘ
    where J: IntoIterator<Item = Self::Item>, - Self: Sized,

    Alternate elements from two iterators until both have run out. Read more
    source§

    fn interleave_shortest<J>( + Self: Sized,

    Alternate elements from two iterators until both have run out. Read more
    source§

    fn interleave_shortest<J>( self, other: J ) -> InterleaveShortest<Self, J::IntoIter> ⓘ
    where J: IntoIterator<Item = Self::Item>, Self: Sized,

    Alternate elements from two iterators until at least one of them has run -out. Read more
    source§

    fn intersperse(self, element: Self::Item) -> Intersperse<Self>
    where +out. Read more

    source§

    fn intersperse(self, element: Self::Item) -> Intersperse<Self>
    where Self: Sized, Self::Item: Clone,

    An iterator adaptor to insert a particular value -between each element of the adapted iterator. Read more
    source§

    fn intersperse_with<F>(self, element: F) -> IntersperseWith<Self, F> ⓘ
    where +between each element of the adapted iterator. Read more

    source§

    fn intersperse_with<F>(self, element: F) -> IntersperseWith<Self, F> ⓘ
    where Self: Sized, F: FnMut() -> Self::Item,

    An iterator adaptor to insert a particular value created by a function -between each element of the adapted iterator. Read more
    source§

    fn zip_longest<J>(self, other: J) -> ZipLongest<Self, J::IntoIter> ⓘ
    where +between each element of the adapted iterator. Read more

    source§

    fn get<R>(self, index: R) -> R::Output
    where + Self: Sized, + R: IteratorIndex<Self>,

    Returns an iterator over a subsection of the iterator. Read more
    source§

    fn zip_longest<J>(self, other: J) -> ZipLongest<Self, J::IntoIter> ⓘ
    where J: IntoIterator, Self: Sized,

    Create an iterator which iterates over both this and the specified -iterator simultaneously, yielding pairs of two optional elements. Read more
    source§

    fn zip_eq<J>(self, other: J) -> ZipEq<Self, J::IntoIter> ⓘ
    where +iterator simultaneously, yielding pairs of two optional elements. Read more

    source§

    fn zip_eq<J>(self, other: J) -> ZipEq<Self, J::IntoIter> ⓘ
    where J: IntoIterator, Self: Sized,

    Create an iterator which iterates over both this and the specified -iterator simultaneously, yielding pairs of elements. Read more
    source§

    fn batching<B, F>(self, f: F) -> Batching<Self, F> ⓘ
    where +iterator simultaneously, yielding pairs of elements. Read more

    source§

    fn batching<B, F>(self, f: F) -> Batching<Self, F> ⓘ
    where F: FnMut(&mut Self) -> Option<B>, Self: Sized,

    A “meta iterator adaptor”. Its closure receives a reference to the iterator and may pick off as many elements as it likes, to produce the -next iterator element. Read more
    source§

    fn group_by<K, F>(self, key: F) -> GroupBy<K, Self, F>
    where +next iterator element. Read more

    source§

    fn chunk_by<K, F>(self, key: F) -> ChunkBy<K, Self, F>
    where Self: Sized, F: FnMut(&Self::Item) -> K, K: PartialEq,

    Return an iterable that can group iterator elements. Consecutive elements that map to the same key (“runs”), are assigned -to the same group. Read more
    source§

    fn chunks(self, size: usize) -> IntoChunks<Self>
    where - Self: Sized,

    Return an iterable that can chunk the iterator. Read more
    source§

    fn tuple_windows<T>(self) -> TupleWindows<Self, T> ⓘ
    where +to the same group. Read more

    source§

    fn group_by<K, F>(self, key: F) -> ChunkBy<K, Self, F>
    where + Self: Sized, + F: FnMut(&Self::Item) -> K, + K: PartialEq,

    👎Deprecated since 0.13.0: Use .chunk_by() instead
    See .chunk_by().
    source§

    fn chunks(self, size: usize) -> IntoChunks<Self>
    where + Self: Sized,

    Return an iterable that can chunk the iterator. Read more
    source§

    fn tuple_windows<T>(self) -> TupleWindows<Self, T> ⓘ
    where Self: Sized + Iterator<Item = T::Item>, T: HomogeneousTuple, T::Item: Clone,

    Return an iterator over all contiguous windows producing tuples of -a specific size (up to 12). Read more
    source§

    fn circular_tuple_windows<T>(self) -> CircularTupleWindows<Self, T> ⓘ
    where +a specific size (up to 12). Read more

    source§

    fn circular_tuple_windows<T>(self) -> CircularTupleWindows<Self, T> ⓘ
    where Self: Sized + Clone + Iterator<Item = T::Item> + ExactSizeIterator, T: TupleCollect + Clone, T::Item: Clone,

    Return an iterator over all windows, wrapping back to the first elements when the window would otherwise exceed the length of the -iterator, producing tuples of a specific size (up to 12). Read more
    source§

    fn tuples<T>(self) -> Tuples<Self, T> ⓘ
    where +iterator, producing tuples of a specific size (up to 12). Read more

    source§

    fn tuples<T>(self) -> Tuples<Self, T> ⓘ
    where Self: Sized + Iterator<Item = T::Item>, T: HomogeneousTuple,

    Return an iterator that groups the items in tuples of a specific size -(up to 12). Read more
    source§

    fn tee(self) -> (Tee<Self>, Tee<Self>)
    where +(up to 12). Read more

    source§

    fn tee(self) -> (Tee<Self>, Tee<Self>)
    where Self: Sized, Self::Item: Clone,

    Split into an iterator pair that both yield all elements from -the original iterator. Read more
    source§

    fn step(self, n: usize) -> Step<Self> ⓘ
    where - Self: Sized,

    👎Deprecated since 0.8.0: Use std .step_by() instead
    Return an iterator adaptor that steps n elements in the base iterator -for each iteration. Read more
    source§

    fn map_into<R>(self) -> MapInto<Self, R>
    where +the original iterator. Read more

    source§

    fn map_into<R>(self) -> MapInto<Self, R>
    where Self: Sized, - Self::Item: Into<R>,

    Convert each item of the iterator using the Into trait. Read more
    source§

    fn map_results<F, T, U, E>(self, f: F) -> MapOk<Self, F>
    where - Self: Iterator<Item = Result<T, E>> + Sized, - F: FnMut(T) -> U,

    👎Deprecated since 0.10.0: Use .map_ok() instead
    See .map_ok().
    source§

    fn map_ok<F, T, U, E>(self, f: F) -> MapOk<Self, F>
    where + Self::Item: Into<R>,

    Convert each item of the iterator using the Into trait. Read more
    source§

    fn map_ok<F, T, U, E>(self, f: F) -> MapOk<Self, F>
    where Self: Iterator<Item = Result<T, E>> + Sized, F: FnMut(T) -> U,

    Return an iterator adaptor that applies the provided closure to every Result::Ok value. Result::Err values are -unchanged. Read more
    source§

    fn filter_ok<F, T, E>(self, f: F) -> FilterOk<Self, F> ⓘ
    where +unchanged. Read more

    source§

    fn filter_ok<F, T, E>(self, f: F) -> FilterOk<Self, F> ⓘ
    where Self: Iterator<Item = Result<T, E>> + Sized, F: FnMut(&T) -> bool,

    Return an iterator adaptor that filters every Result::Ok value with the provided closure. Result::Err values are -unchanged. Read more
    source§

    fn filter_map_ok<F, T, U, E>(self, f: F) -> FilterMapOk<Self, F> ⓘ
    where +unchanged. Read more

    source§

    fn filter_map_ok<F, T, U, E>(self, f: F) -> FilterMapOk<Self, F> ⓘ
    where Self: Iterator<Item = Result<T, E>> + Sized, F: FnMut(T) -> Option<U>,

    Return an iterator adaptor that filters and transforms every Result::Ok value with the provided closure. Result::Err -values are unchanged. Read more
    source§

    fn flatten_ok<T, E>(self) -> FlattenOk<Self, T, E> ⓘ
    where +values are unchanged. Read more

    source§

    fn flatten_ok<T, E>(self) -> FlattenOk<Self, T, E> ⓘ
    where Self: Iterator<Item = Result<T, E>> + Sized, T: IntoIterator,

    Return an iterator adaptor that flattens every Result::Ok value into -a series of Result::Ok values. Result::Err values are unchanged. Read more
    source§

    fn process_results<F, T, E, R>(self, processor: F) -> Result<R, E>
    where +a series of Result::Ok values. Result::Err values are unchanged. Read more

    source§

    fn process_results<F, T, E, R>(self, processor: F) -> Result<R, E>
    where Self: Iterator<Item = Result<T, E>> + Sized, F: FnOnce(ProcessResults<'_, Self, E>) -> R,

    “Lift” a function of the values of the current iterator so as to process -an iterator of Result values instead. Read more
    source§

    fn merge<J>(self, other: J) -> Merge<Self, J::IntoIter>
    where +an iterator of Result values instead. Read more

    source§

    fn merge<J>(self, other: J) -> Merge<Self, J::IntoIter>
    where Self: Sized, Self::Item: PartialOrd, J: IntoIterator<Item = Self::Item>,

    Return an iterator adaptor that merges the two base iterators in ascending order. If both base iterators are sorted (ascending), the -result is sorted. Read more
    source§

    fn merge_by<J, F>(self, other: J, is_first: F) -> MergeBy<Self, J::IntoIter, F> ⓘ
    where +result is sorted. Read more

    source§

    fn merge_by<J, F>(self, other: J, is_first: F) -> MergeBy<Self, J::IntoIter, F> ⓘ
    where Self: Sized, J: IntoIterator<Item = Self::Item>, F: FnMut(&Self::Item, &Self::Item) -> bool,

    Return an iterator adaptor that merges the two base iterators in order. -This is much like .merge() but allows for a custom ordering. Read more
    source§

    fn merge_join_by<J, F, T>( +This is much like .merge() but allows for a custom ordering. Read more

    source§

    fn merge_join_by<J, F, T>( self, other: J, cmp_fn: F @@ -311,288 +312,299 @@ This is much like IntoIterator, F: FnMut(&Self::Item, &J::Item) -> T, Self: Sized,

    Create an iterator that merges items from both this and the specified -iterator in ascending order. Read more
    source§

    fn kmerge(self) -> KMerge<<Self::Item as IntoIterator>::IntoIter>
    where +iterator in ascending order. Read more

    source§

    fn kmerge(self) -> KMerge<<Self::Item as IntoIterator>::IntoIter>
    where Self: Sized, Self::Item: IntoIterator, <Self::Item as IntoIterator>::Item: PartialOrd,

    Return an iterator adaptor that flattens an iterator of iterators by -merging them in ascending order. Read more
    source§

    fn kmerge_by<F>( +merging them in ascending order. Read more

    source§

    fn kmerge_by<F>( self, first: F ) -> KMergeBy<<Self::Item as IntoIterator>::IntoIter, F> ⓘ
    where Self: Sized, Self::Item: IntoIterator, F: FnMut(&<Self::Item as IntoIterator>::Item, &<Self::Item as IntoIterator>::Item) -> bool,

    Return an iterator adaptor that flattens an iterator of iterators by -merging them according to the given closure. Read more
    source§

    fn cartesian_product<J>(self, other: J) -> Product<Self, J::IntoIter> ⓘ
    where +merging them according to the given closure. Read more

    source§

    fn cartesian_product<J>(self, other: J) -> Product<Self, J::IntoIter> ⓘ
    where Self: Sized, Self::Item: Clone, J: IntoIterator, J::IntoIter: Clone,

    Return an iterator adaptor that iterates over the cartesian product of -the element sets of two iterators self and J. Read more
    source§

    fn multi_cartesian_product( +the element sets of two iterators self and J. Read more

    source§

    fn multi_cartesian_product( self ) -> MultiProduct<<Self::Item as IntoIterator>::IntoIter> ⓘ
    where Self: Sized, Self::Item: IntoIterator, <Self::Item as IntoIterator>::IntoIter: Clone, <Self::Item as IntoIterator>::Item: Clone,

    Return an iterator adaptor that iterates over the cartesian product of -all subiterators returned by meta-iterator self. Read more
    source§

    fn coalesce<F>(self, f: F) -> Coalesce<Self, F>
    where +all subiterators returned by meta-iterator self. Read more

    source§

    fn coalesce<F>(self, f: F) -> Coalesce<Self, F>
    where Self: Sized, F: FnMut(Self::Item, Self::Item) -> Result<Self::Item, (Self::Item, Self::Item)>,

    Return an iterator adaptor that uses the passed-in closure to -optionally merge together consecutive elements. Read more
    source§

    fn dedup(self) -> Dedup<Self>
    where +optionally merge together consecutive elements. Read more

    source§

    fn dedup(self) -> Dedup<Self>
    where Self: Sized, Self::Item: PartialEq,

    Remove duplicates from sections of consecutive identical elements. -If the iterator is sorted, all elements will be unique. Read more
    source§

    fn dedup_by<Cmp>(self, cmp: Cmp) -> DedupBy<Self, Cmp>
    where +If the iterator is sorted, all elements will be unique. Read more

    source§

    fn dedup_by<Cmp>(self, cmp: Cmp) -> DedupBy<Self, Cmp>
    where Self: Sized, Cmp: FnMut(&Self::Item, &Self::Item) -> bool,

    Remove duplicates from sections of consecutive identical elements, determining equality using a comparison function. -If the iterator is sorted, all elements will be unique. Read more
    source§

    fn dedup_with_count(self) -> DedupWithCount<Self>
    where +If the iterator is sorted, all elements will be unique. Read more

    source§

    fn dedup_with_count(self) -> DedupWithCount<Self>
    where Self: Sized,

    Remove duplicates from sections of consecutive identical elements, while keeping a count of how many repeated elements were present. -If the iterator is sorted, all elements will be unique. Read more
    source§

    fn dedup_by_with_count<Cmp>(self, cmp: Cmp) -> DedupByWithCount<Self, Cmp>
    where +If the iterator is sorted, all elements will be unique. Read more

    source§

    fn dedup_by_with_count<Cmp>(self, cmp: Cmp) -> DedupByWithCount<Self, Cmp>
    where Self: Sized, Cmp: FnMut(&Self::Item, &Self::Item) -> bool,

    Remove duplicates from sections of consecutive identical elements, while keeping a count of how many repeated elements were present. This will determine equality using a comparison function. -If the iterator is sorted, all elements will be unique. Read more
    source§

    fn duplicates(self) -> Duplicates<Self>
    where +If the iterator is sorted, all elements will be unique. Read more

    source§

    fn duplicates(self) -> Duplicates<Self>
    where Self: Sized, Self::Item: Eq + Hash,

    Return an iterator adaptor that produces elements that appear more than once during the -iteration. Duplicates are detected using hash and equality. Read more
    source§

    fn duplicates_by<V, F>(self, f: F) -> DuplicatesBy<Self, V, F>
    where +iteration. Duplicates are detected using hash and equality. Read more

    source§

    fn duplicates_by<V, F>(self, f: F) -> DuplicatesBy<Self, V, F>
    where Self: Sized, V: Eq + Hash, F: FnMut(&Self::Item) -> V,

    Return an iterator adaptor that produces elements that appear more than once during the -iteration. Duplicates are detected using hash and equality. Read more
    source§

    fn unique(self) -> Unique<Self> ⓘ
    where +iteration. Duplicates are detected using hash and equality. Read more

    source§

    fn unique(self) -> Unique<Self> ⓘ
    where Self: Sized, Self::Item: Clone + Eq + Hash,

    Return an iterator adaptor that filters out elements that have already been produced once during the iteration. Duplicates -are detected using hash and equality. Read more
    source§

    fn unique_by<V, F>(self, f: F) -> UniqueBy<Self, V, F> ⓘ
    where +are detected using hash and equality. Read more

    source§

    fn unique_by<V, F>(self, f: F) -> UniqueBy<Self, V, F> ⓘ
    where Self: Sized, V: Eq + Hash, F: FnMut(&Self::Item) -> V,

    Return an iterator adaptor that filters out elements that have -already been produced once during the iteration. Read more
    source§

    fn peeking_take_while<F>(&mut self, accept: F) -> PeekingTakeWhile<'_, Self, F> ⓘ
    where +already been produced once during the iteration. Read more

    source§

    fn peeking_take_while<F>(&mut self, accept: F) -> PeekingTakeWhile<'_, Self, F> ⓘ
    where Self: Sized + PeekingNext, F: FnMut(&Self::Item) -> bool,

    Return an iterator adaptor that borrows from this iterator and -takes items while the closure accept returns true. Read more
    source§

    fn take_while_ref<F>(&mut self, accept: F) -> TakeWhileRef<'_, Self, F> ⓘ
    where +takes items while the closure accept returns true. Read more

    source§

    fn take_while_ref<F>(&mut self, accept: F) -> TakeWhileRef<'_, Self, F> ⓘ
    where Self: Clone, F: FnMut(&Self::Item) -> bool,

    Return an iterator adaptor that borrows from a Clone-able iterator -to only pick off elements while the predicate accept returns true. Read more
    source§

    fn take_while_inclusive<F>(self, accept: F) -> TakeWhileInclusive<Self, F> ⓘ
    where +to only pick off elements while the predicate accept returns true. Read more

    source§

    fn take_while_inclusive<F>(self, accept: F) -> TakeWhileInclusive<Self, F> ⓘ
    where Self: Sized, F: FnMut(&Self::Item) -> bool,

    Returns an iterator adaptor that consumes elements while the given predicate is true, including the element for which the predicate -first returned false. Read more
    source§

    fn while_some<A>(self) -> WhileSome<Self> ⓘ
    where +first returned false. Read more

    source§

    fn while_some<A>(self) -> WhileSome<Self> ⓘ
    where Self: Sized + Iterator<Item = Option<A>>,

    Return an iterator adaptor that filters Option<A> iterator elements -and produces A. Stops on the first None encountered. Read more
    source§

    fn tuple_combinations<T>(self) -> TupleCombinations<Self, T> ⓘ
    where +and produces A. Stops on the first None encountered. Read more

    source§

    fn tuple_combinations<T>(self) -> TupleCombinations<Self, T> ⓘ
    where Self: Sized + Clone, Self::Item: Clone, T: HasCombination<Self>,

    Return an iterator adaptor that iterates over the combinations of the -elements from an iterator. Read more
    source§

    fn combinations(self, k: usize) -> Combinations<Self> ⓘ
    where +elements from an iterator. Read more

    source§

    fn combinations(self, k: usize) -> Combinations<Self> ⓘ
    where Self: Sized, Self::Item: Clone,

    Return an iterator adaptor that iterates over the k-length combinations of -the elements from an iterator. Read more
    source§

    fn combinations_with_replacement( +the elements from an iterator. Read more

    source§

    fn combinations_with_replacement( self, k: usize ) -> CombinationsWithReplacement<Self> ⓘ
    where Self: Sized, Self::Item: Clone,

    Return an iterator that iterates over the k-length combinations of -the elements from an iterator, with replacement. Read more
    source§

    fn permutations(self, k: usize) -> Permutations<Self> ⓘ
    where +the elements from an iterator, with replacement. Read more

    source§

    fn permutations(self, k: usize) -> Permutations<Self> ⓘ
    where Self: Sized, Self::Item: Clone,

    Return an iterator adaptor that iterates over all k-permutations of the -elements from an iterator. Read more
    source§

    fn powerset(self) -> Powerset<Self> ⓘ
    where +elements from an iterator. Read more

    source§

    fn powerset(self) -> Powerset<Self> ⓘ
    where Self: Sized, Self::Item: Clone,

    Return an iterator that iterates through the powerset of the elements from an -iterator. Read more
    source§

    fn pad_using<F>(self, min: usize, f: F) -> PadUsing<Self, F> ⓘ
    where +iterator. Read more

    source§

    fn pad_using<F>(self, min: usize, f: F) -> PadUsing<Self, F> ⓘ
    where Self: Sized, F: FnMut(usize) -> Self::Item,

    Return an iterator adaptor that pads the sequence to a minimum length of -min by filling missing elements using a closure f. Read more
    source§

    fn with_position(self) -> WithPosition<Self> ⓘ
    where +min by filling missing elements using a closure f. Read more

    source§

    fn with_position(self) -> WithPosition<Self> ⓘ
    where Self: Sized,

    Return an iterator adaptor that combines each element with a Position to -ease special-case handling of the first or last elements. Read more
    source§

    fn positions<P>(self, predicate: P) -> Positions<Self, P> ⓘ
    where +ease special-case handling of the first or last elements. Read more

    source§

    fn positions<P>(self, predicate: P) -> Positions<Self, P> ⓘ
    where Self: Sized, P: FnMut(Self::Item) -> bool,

    Return an iterator adaptor that yields the indices of all elements -satisfying a predicate, counted from the start of the iterator. Read more
    source§

    fn update<F>(self, updater: F) -> Update<Self, F> ⓘ
    where +satisfying a predicate, counted from the start of the iterator. Read more

    source§

    fn update<F>(self, updater: F) -> Update<Self, F> ⓘ
    where Self: Sized, F: FnMut(&mut Self::Item),

    Return an iterator adaptor that applies a mutating function -to each element before yielding it. Read more
    source§

    fn next_tuple<T>(&mut self) -> Option<T>
    where +to each element before yielding it. Read more

    source§

    fn next_tuple<T>(&mut self) -> Option<T>
    where Self: Sized + Iterator<Item = T::Item>, T: HomogeneousTuple,

    Advances the iterator and returns the next items grouped in a tuple of -a specific size (up to 12). Read more
    source§

    fn collect_tuple<T>(self) -> Option<T>
    where +a specific size (up to 12). Read more

    source§

    fn collect_tuple<T>(self) -> Option<T>
    where Self: Sized + Iterator<Item = T::Item>, T: HomogeneousTuple,

    Collects all items from the iterator into a tuple of a specific size -(up to 12). Read more
    source§

    fn find_position<P>(&mut self, pred: P) -> Option<(usize, Self::Item)>
    where - P: FnMut(&Self::Item) -> bool,

    Find the position and value of the first element satisfying a predicate. Read more
    source§

    fn find_or_last<P>(self, predicate: P) -> Option<Self::Item>
    where +(up to 12). Read more

    source§

    fn find_position<P>(&mut self, pred: P) -> Option<(usize, Self::Item)>
    where + P: FnMut(&Self::Item) -> bool,

    Find the position and value of the first element satisfying a predicate. Read more
    source§

    fn find_or_last<P>(self, predicate: P) -> Option<Self::Item>
    where Self: Sized, - P: FnMut(&Self::Item) -> bool,

    Find the value of the first element satisfying a predicate or return the last element, if any. Read more
    source§

    fn find_or_first<P>(self, predicate: P) -> Option<Self::Item>
    where + P: FnMut(&Self::Item) -> bool,

    Find the value of the first element satisfying a predicate or return the last element, if any. Read more
    source§

    fn find_or_first<P>(self, predicate: P) -> Option<Self::Item>
    where Self: Sized, - P: FnMut(&Self::Item) -> bool,

    Find the value of the first element satisfying a predicate or return the first element, if any. Read more
    source§

    fn contains<Q>(&mut self, query: &Q) -> bool
    where + P: FnMut(&Self::Item) -> bool,

    Find the value of the first element satisfying a predicate or return the first element, if any. Read more
    source§

    fn contains<Q>(&mut self, query: &Q) -> bool
    where Self: Sized, Self::Item: Borrow<Q>, - Q: PartialEq,

    Returns true if the given item is present in this iterator. Read more
    source§

    fn all_equal(&mut self) -> bool
    where + Q: PartialEq,

    Returns true if the given item is present in this iterator. Read more
    source§

    fn all_equal(&mut self) -> bool
    where Self: Sized, - Self::Item: PartialEq,

    Check whether all elements compare equal. Read more
    source§

    fn all_equal_value( + Self::Item: PartialEq,

    Check whether all elements compare equal. Read more
    source§

    fn all_equal_value( &mut self ) -> Result<Self::Item, Option<(Self::Item, Self::Item)>>
    where Self: Sized, Self::Item: PartialEq,

    If there are elements and they are all equal, return a single copy of that element. If there are no elements, return an Error containing None. If there are elements and they are not all equal, return a tuple containing the first -two non-equal elements found. Read more
    source§

    fn all_unique(&mut self) -> bool
    where +two non-equal elements found. Read more

    source§

    fn all_unique(&mut self) -> bool
    where Self: Sized, - Self::Item: Eq + Hash,

    Check whether all elements are unique (non equal). Read more
    source§

    fn dropping(self, n: usize) -> Self
    where + Self::Item: Eq + Hash,

    Check whether all elements are unique (non equal). Read more
    source§

    fn dropping(self, n: usize) -> Self
    where Self: Sized,

    Consume the first n elements from the iterator eagerly, -and return the same iterator again. Read more
    source§

    fn dropping_back(self, n: usize) -> Self
    where +and return the same iterator again. Read more

    source§

    fn dropping_back(self, n: usize) -> Self
    where Self: Sized + DoubleEndedIterator,

    Consume the last n elements from the iterator eagerly, -and return the same iterator again. Read more
    source§

    fn foreach<F>(self, f: F)
    where - F: FnMut(Self::Item), - Self: Sized,

    👎Deprecated since 0.8.0: Use .for_each() instead
    Run the closure f eagerly on each element of the iterator. Read more
    source§

    fn concat(self) -> Self::Item
    where +and return the same iterator again. Read more

    source§

    fn concat(self) -> Self::Item
    where Self: Sized, - Self::Item: Extend<<<Self as Iterator>::Item as IntoIterator>::Item> + IntoIterator + Default,

    Combine all an iterator’s elements into one element by using Extend. Read more
    source§

    fn collect_vec(self) -> Vec<Self::Item>
    where + Self::Item: Extend<<<Self as Iterator>::Item as IntoIterator>::Item> + IntoIterator + Default,

    Combine all an iterator’s elements into one element by using Extend. Read more
    source§

    fn collect_vec(self) -> Vec<Self::Item>
    where Self: Sized,

    .collect_vec() is simply a type specialization of Iterator::collect, -for convenience.
    source§

    fn try_collect<T, U, E>(self) -> Result<U, E>
    where +for convenience.

    source§

    fn try_collect<T, U, E>(self) -> Result<U, E>
    where Self: Sized + Iterator<Item = Result<T, E>>, Result<U, E>: FromIterator<Result<T, E>>,

    .try_collect() is more convenient way of writing -.collect::<Result<_, _>>() Read more
    source§

    fn set_from<'a, A: 'a, J>(&mut self, from: J) -> usize
    where +.collect::<Result<_, _>>() Read more

    source§

    fn set_from<'a, A: 'a, J>(&mut self, from: J) -> usize
    where Self: Iterator<Item = &'a mut A>, J: IntoIterator<Item = A>,

    Assign to each reference in self from the from iterator, -stopping at the shortest of the two iterators. Read more
    source§

    fn join(&mut self, sep: &str) -> String
    where - Self::Item: Display,

    Combine all iterator elements into one String, separated by sep. Read more
    source§

    fn format(self, sep: &str) -> Format<'_, Self>
    where - Self: Sized,

    Format all iterator elements, separated by sep. Read more
    source§

    fn format_with<F>(self, sep: &str, format: F) -> FormatWith<'_, Self, F>
    where +stopping at the shortest of the two iterators. Read more

    source§

    fn join(&mut self, sep: &str) -> String
    where + Self::Item: Display,

    Combine all iterator elements into one String, separated by sep. Read more
    source§

    fn format(self, sep: &str) -> Format<'_, Self>
    where + Self: Sized,

    Format all iterator elements, separated by sep. Read more
    source§

    fn format_with<F>(self, sep: &str, format: F) -> FormatWith<'_, Self, F>
    where Self: Sized, - F: FnMut(Self::Item, &mut dyn FnMut(&dyn Display) -> Result) -> Result,

    Format all iterator elements, separated by sep. Read more
    source§

    fn fold_results<A, E, B, F>(&mut self, start: B, f: F) -> Result<B, E>
    where + F: FnMut(Self::Item, &mut dyn FnMut(&dyn Display) -> Result) -> Result,

    Format all iterator elements, separated by sep. Read more
    source§

    fn fold_ok<A, E, B, F>(&mut self, start: B, f: F) -> Result<B, E>
    where Self: Iterator<Item = Result<A, E>>, - F: FnMut(B, A) -> B,

    👎Deprecated since 0.10.0: Use .fold_ok() instead
    See .fold_ok().
    source§

    fn fold_ok<A, E, B, F>(&mut self, start: B, f: F) -> Result<B, E>
    where - Self: Iterator<Item = Result<A, E>>, - F: FnMut(B, A) -> B,

    Fold Result values from an iterator. Read more
    source§

    fn fold_options<A, B, F>(&mut self, start: B, f: F) -> Option<B>
    where + F: FnMut(B, A) -> B,

    Fold Result values from an iterator. Read more
    source§

    fn fold_options<A, B, F>(&mut self, start: B, f: F) -> Option<B>
    where Self: Iterator<Item = Option<A>>, - F: FnMut(B, A) -> B,

    Fold Option values from an iterator. Read more
    source§

    fn fold1<F>(self, f: F) -> Option<Self::Item>
    where + F: FnMut(B, A) -> B,

    Fold Option values from an iterator. Read more
    source§

    fn fold1<F>(self, f: F) -> Option<Self::Item>
    where F: FnMut(Self::Item, Self::Item) -> Self::Item, - Self: Sized,

    👎Deprecated since 0.10.2: Use Iterator::reduce instead
    Accumulator of the elements in the iterator. Read more
    source§

    fn tree_fold1<F>(self, f: F) -> Option<Self::Item>
    where + Self: Sized,

    👎Deprecated since 0.10.2: Use Iterator::reduce instead
    Accumulator of the elements in the iterator. Read more
    source§

    fn tree_reduce<F>(self, f: F) -> Option<Self::Item>
    where F: FnMut(Self::Item, Self::Item) -> Self::Item, - Self: Sized,

    Accumulate the elements in the iterator in a tree-like manner. Read more
    source§

    fn fold_while<B, F>(&mut self, init: B, f: F) -> FoldWhile<B>
    where + Self: Sized,

    Accumulate the elements in the iterator in a tree-like manner. Read more
    source§

    fn tree_fold1<F>(self, f: F) -> Option<Self::Item>
    where + F: FnMut(Self::Item, Self::Item) -> Self::Item, + Self: Sized,

    👎Deprecated since 0.13.0: Use .tree_reduce() instead
    See .tree_reduce().
    source§

    fn fold_while<B, F>(&mut self, init: B, f: F) -> FoldWhile<B>
    where Self: Sized, - F: FnMut(B, Self::Item) -> FoldWhile<B>,

    An iterator method that applies a function, producing a single, final value. Read more
    source§

    fn sum1<S>(self) -> Option<S>
    where + F: FnMut(B, Self::Item) -> FoldWhile<B>,

    An iterator method that applies a function, producing a single, final value. Read more
    source§

    fn sum1<S>(self) -> Option<S>
    where Self: Sized, - S: Sum<Self::Item>,

    Iterate over the entire iterator and add all the elements. Read more
    source§

    fn product1<P>(self) -> Option<P>
    where + S: Sum<Self::Item>,

    Iterate over the entire iterator and add all the elements. Read more
    source§

    fn product1<P>(self) -> Option<P>
    where Self: Sized, - P: Product<Self::Item>,

    Iterate over the entire iterator and multiply all the elements. Read more
    source§

    fn sorted_unstable(self) -> IntoIter<Self::Item> ⓘ
    where + P: Product<Self::Item>,

    Iterate over the entire iterator and multiply all the elements. Read more
    source§

    fn sorted_unstable(self) -> IntoIter<Self::Item> ⓘ
    where Self: Sized, - Self::Item: Ord,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_unstable_by<F>(self, cmp: F) -> IntoIter<Self::Item> ⓘ
    where + Self::Item: Ord,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_unstable_by<F>(self, cmp: F) -> IntoIter<Self::Item> ⓘ
    where Self: Sized, - F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_unstable_by_key<K, F>(self, f: F) -> IntoIter<Self::Item> ⓘ
    where + F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_unstable_by_key<K, F>(self, f: F) -> IntoIter<Self::Item> ⓘ
    where Self: Sized, K: Ord, - F: FnMut(&Self::Item) -> K,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted(self) -> IntoIter<Self::Item> ⓘ
    where + F: FnMut(&Self::Item) -> K,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted(self) -> IntoIter<Self::Item> ⓘ
    where Self: Sized, - Self::Item: Ord,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_by<F>(self, cmp: F) -> IntoIter<Self::Item> ⓘ
    where + Self::Item: Ord,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_by<F>(self, cmp: F) -> IntoIter<Self::Item> ⓘ
    where Self: Sized, - F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_by_key<K, F>(self, f: F) -> IntoIter<Self::Item> ⓘ
    where + F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_by_key<K, F>(self, f: F) -> IntoIter<Self::Item> ⓘ
    where Self: Sized, K: Ord, - F: FnMut(&Self::Item) -> K,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_by_cached_key<K, F>(self, f: F) -> IntoIter<Self::Item> ⓘ
    where + F: FnMut(&Self::Item) -> K,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_by_cached_key<K, F>(self, f: F) -> IntoIter<Self::Item> ⓘ
    where Self: Sized, K: Ord, F: FnMut(&Self::Item) -> K,

    Sort all iterator elements into a new iterator in ascending order. The key function is -called exactly once per key. Read more
    source§

    fn k_smallest(self, k: usize) -> IntoIter<Self::Item> ⓘ
    where +called exactly once per key. Read more

    source§

    fn k_smallest(self, k: usize) -> IntoIter<Self::Item> ⓘ
    where Self: Sized, - Self::Item: Ord,

    Sort the k smallest elements into a new iterator, in ascending order. Read more
    source§

    fn partition_map<A, B, F, L, R>(self, predicate: F) -> (A, B)
    where + Self::Item: Ord,

    Sort the k smallest elements into a new iterator, in ascending order. Read more
    source§

    fn k_smallest_by<F>(self, k: usize, cmp: F) -> IntoIter<Self::Item> ⓘ
    where + Self: Sized, + F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Sort the k smallest elements into a new iterator using the provided comparison. Read more
    source§

    fn k_smallest_by_key<F, K>(self, k: usize, key: F) -> IntoIter<Self::Item> ⓘ
    where + Self: Sized, + F: FnMut(&Self::Item) -> K, + K: Ord,

    Return the elements producing the k smallest outputs of the provided function. Read more
    source§

    fn k_largest(self, k: usize) -> IntoIter<Self::Item> ⓘ
    where + Self: Sized, + Self::Item: Ord,

    Sort the k largest elements into a new iterator, in descending order. Read more
    source§

    fn k_largest_by<F>(self, k: usize, cmp: F) -> IntoIter<Self::Item> ⓘ
    where + Self: Sized, + F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Sort the k largest elements into a new iterator using the provided comparison. Read more
    source§

    fn k_largest_by_key<F, K>(self, k: usize, key: F) -> IntoIter<Self::Item> ⓘ
    where + Self: Sized, + F: FnMut(&Self::Item) -> K, + K: Ord,

    Return the elements producing the k largest outputs of the provided function. Read more
    source§

    fn tail(self, n: usize) -> IntoIter<Self::Item> ⓘ
    where + Self: Sized,

    Consumes the iterator and return an iterator of the last n elements. Read more
    source§

    fn partition_map<A, B, F, L, R>(self, predicate: F) -> (A, B)
    where Self: Sized, F: FnMut(Self::Item) -> Either<L, R>, A: Default + Extend<L>, B: Default + Extend<R>,

    Collect all iterator elements into one of two partitions. Unlike Iterator::partition, each partition may -have a distinct type. Read more
    source§

    fn partition_result<A, B, T, E>(self) -> (A, B)
    where +have a distinct type. Read more

    source§

    fn partition_result<A, B, T, E>(self) -> (A, B)
    where Self: Iterator<Item = Result<T, E>> + Sized, A: Default + Extend<T>, B: Default + Extend<E>,

    Partition a sequence of Results into one list of all the Ok elements -and another list of all the Err elements. Read more
    source§

    fn into_group_map<K, V>(self) -> HashMap<K, Vec<V>>
    where +and another list of all the Err elements. Read more

    source§

    fn into_group_map<K, V>(self) -> HashMap<K, Vec<V>>
    where Self: Iterator<Item = (K, V)> + Sized, K: Hash + Eq,

    Return a HashMap of keys mapped to Vecs of values. Keys and values -are taken from (Key, Value) tuple pairs yielded by the input iterator. Read more
    source§

    fn into_group_map_by<K, V, F>(self, f: F) -> HashMap<K, Vec<V>>
    where +are taken from (Key, Value) tuple pairs yielded by the input iterator. Read more

    source§

    fn into_group_map_by<K, V, F>(self, f: F) -> HashMap<K, Vec<V>>
    where Self: Iterator<Item = V> + Sized, K: Hash + Eq, - F: Fn(&V) -> K,

    Return an Iterator on a HashMap. Keys mapped to Vecs of values. The key is specified -in the closure. Read more
    source§

    fn into_grouping_map<K, V>(self) -> GroupingMap<Self>
    where + F: FnMut(&V) -> K,

    Return an Iterator on a HashMap. Keys mapped to Vecs of values. The key is specified +in the closure. Read more
    source§

    fn into_grouping_map<K, V>(self) -> GroupingMap<Self>
    where Self: Iterator<Item = (K, V)> + Sized, K: Hash + Eq,

    Constructs a GroupingMap to be used later with one of the efficient -group-and-fold operations it allows to perform. Read more
    source§

    fn into_grouping_map_by<K, V, F>(self, key_mapper: F) -> GroupingMapBy<Self, F>
    where +group-and-fold operations it allows to perform. Read more

    source§

    fn into_grouping_map_by<K, V, F>(self, key_mapper: F) -> GroupingMapBy<Self, F>
    where Self: Iterator<Item = V> + Sized, K: Hash + Eq, F: FnMut(&V) -> K,

    Constructs a GroupingMap to be used later with one of the efficient -group-and-fold operations it allows to perform. Read more
    source§

    fn min_set(self) -> Vec<Self::Item>
    where +group-and-fold operations it allows to perform. Read more

    source§

    fn min_set(self) -> Vec<Self::Item>
    where Self: Sized, - Self::Item: Ord,

    Return all minimum elements of an iterator. Read more
    source§

    fn min_set_by<F>(self, compare: F) -> Vec<Self::Item>
    where + Self::Item: Ord,

    Return all minimum elements of an iterator. Read more
    source§

    fn min_set_by<F>(self, compare: F) -> Vec<Self::Item>
    where Self: Sized, F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Return all minimum elements of an iterator, as determined by -the specified function. Read more
    source§

    fn min_set_by_key<K, F>(self, key: F) -> Vec<Self::Item>
    where +the specified function. Read more

    source§

    fn min_set_by_key<K, F>(self, key: F) -> Vec<Self::Item>
    where Self: Sized, K: Ord, F: FnMut(&Self::Item) -> K,

    Return all minimum elements of an iterator, as determined by -the specified function. Read more
    source§

    fn max_set(self) -> Vec<Self::Item>
    where +the specified function. Read more

    source§

    fn max_set(self) -> Vec<Self::Item>
    where Self: Sized, - Self::Item: Ord,

    Return all maximum elements of an iterator. Read more
    source§

    fn max_set_by<F>(self, compare: F) -> Vec<Self::Item>
    where + Self::Item: Ord,

    Return all maximum elements of an iterator. Read more
    source§

    fn max_set_by<F>(self, compare: F) -> Vec<Self::Item>
    where Self: Sized, F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Return all maximum elements of an iterator, as determined by -the specified function. Read more
    source§

    fn max_set_by_key<K, F>(self, key: F) -> Vec<Self::Item>
    where +the specified function. Read more

    source§

    fn max_set_by_key<K, F>(self, key: F) -> Vec<Self::Item>
    where Self: Sized, K: Ord, F: FnMut(&Self::Item) -> K,

    Return all maximum elements of an iterator, as determined by -the specified function. Read more
    source§

    fn minmax(self) -> MinMaxResult<Self::Item>
    where +the specified function. Read more

    source§

    fn minmax(self) -> MinMaxResult<Self::Item>
    where Self: Sized, - Self::Item: PartialOrd,

    Return the minimum and maximum elements in the iterator. Read more
    source§

    fn minmax_by_key<K, F>(self, key: F) -> MinMaxResult<Self::Item>
    where + Self::Item: PartialOrd,

    Return the minimum and maximum elements in the iterator. Read more
    source§

    fn minmax_by_key<K, F>(self, key: F) -> MinMaxResult<Self::Item>
    where Self: Sized, K: PartialOrd, F: FnMut(&Self::Item) -> K,

    Return the minimum and maximum element of an iterator, as determined by -the specified function. Read more
    source§

    fn minmax_by<F>(self, compare: F) -> MinMaxResult<Self::Item>
    where +the specified function. Read more

    source§

    fn minmax_by<F>(self, compare: F) -> MinMaxResult<Self::Item>
    where Self: Sized, F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Return the minimum and maximum element of an iterator, as determined by -the specified comparison function. Read more
    source§

    fn position_max(self) -> Option<usize>
    where +the specified comparison function. Read more

    source§

    fn position_max(self) -> Option<usize>
    where Self: Sized, - Self::Item: Ord,

    Return the position of the maximum element in the iterator. Read more
    source§

    fn position_max_by_key<K, F>(self, key: F) -> Option<usize>
    where + Self::Item: Ord,

    Return the position of the maximum element in the iterator. Read more
    source§

    fn position_max_by_key<K, F>(self, key: F) -> Option<usize>
    where Self: Sized, K: Ord, F: FnMut(&Self::Item) -> K,

    Return the position of the maximum element in the iterator, as -determined by the specified function. Read more
    source§

    fn position_max_by<F>(self, compare: F) -> Option<usize>
    where +determined by the specified function. Read more

    source§

    fn position_max_by<F>(self, compare: F) -> Option<usize>
    where Self: Sized, F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Return the position of the maximum element in the iterator, as -determined by the specified comparison function. Read more
    source§

    fn position_min(self) -> Option<usize>
    where +determined by the specified comparison function. Read more

    source§

    fn position_min(self) -> Option<usize>
    where Self: Sized, - Self::Item: Ord,

    Return the position of the minimum element in the iterator. Read more
    source§

    fn position_min_by_key<K, F>(self, key: F) -> Option<usize>
    where + Self::Item: Ord,

    Return the position of the minimum element in the iterator. Read more
    source§

    fn position_min_by_key<K, F>(self, key: F) -> Option<usize>
    where Self: Sized, K: Ord, F: FnMut(&Self::Item) -> K,

    Return the position of the minimum element in the iterator, as -determined by the specified function. Read more
    source§

    fn position_min_by<F>(self, compare: F) -> Option<usize>
    where +determined by the specified function. Read more

    source§

    fn position_min_by<F>(self, compare: F) -> Option<usize>
    where Self: Sized, F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Return the position of the minimum element in the iterator, as -determined by the specified comparison function. Read more
    source§

    fn position_minmax(self) -> MinMaxResult<usize>
    where +determined by the specified comparison function. Read more

    source§

    fn position_minmax(self) -> MinMaxResult<usize>
    where Self: Sized, Self::Item: PartialOrd,

    Return the positions of the minimum and maximum elements in -the iterator. Read more
    source§

    fn position_minmax_by_key<K, F>(self, key: F) -> MinMaxResult<usize>
    where +the iterator. Read more

    source§

    fn position_minmax_by_key<K, F>(self, key: F) -> MinMaxResult<usize>
    where Self: Sized, K: PartialOrd, F: FnMut(&Self::Item) -> K,

    Return the postions of the minimum and maximum elements of an -iterator, as determined by the specified function. Read more
    source§

    fn position_minmax_by<F>(self, compare: F) -> MinMaxResult<usize>
    where +iterator, as determined by the specified function. Read more

    source§

    fn position_minmax_by<F>(self, compare: F) -> MinMaxResult<usize>
    where Self: Sized, F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Return the postions of the minimum and maximum elements of an -iterator, as determined by the specified comparison function. Read more
    source§

    fn exactly_one(self) -> Result<Self::Item, ExactlyOneError<Self>>
    where +iterator, as determined by the specified comparison function. Read more

    source§

    fn exactly_one(self) -> Result<Self::Item, ExactlyOneError<Self>>
    where Self: Sized,

    If the iterator yields exactly one element, that element will be returned, otherwise an error will be returned containing an iterator that has the same output as the input -iterator. Read more
    source§

    fn at_most_one(self) -> Result<Option<Self::Item>, ExactlyOneError<Self>>
    where - Self: Sized,

    If the iterator yields no elements, Ok(None) will be returned. If the iterator yields +iterator. Read more
    source§

    fn at_most_one(self) -> Result<Option<Self::Item>, ExactlyOneError<Self>>
    where + Self: Sized,

    If the iterator yields no elements, Ok(None) will be returned. If the iterator yields exactly one element, that element will be returned, otherwise an error will be returned -containing an iterator that has the same output as the input iterator. Read more
    source§

    fn multipeek(self) -> MultiPeek<Self> ⓘ
    where +containing an iterator that has the same output as the input iterator. Read more

    source§

    fn multipeek(self) -> MultiPeek<Self> ⓘ
    where Self: Sized,

    An iterator adaptor that allows the user to peek at multiple .next() -values without advancing the base iterator. Read more
    source§

    fn counts(self) -> HashMap<Self::Item, usize>
    where +values without advancing the base iterator. Read more

    source§

    fn counts(self) -> HashMap<Self::Item, usize>
    where Self: Sized, Self::Item: Eq + Hash,

    Collect the items in this iterator and return a HashMap which contains each item that appears in the iterator and the number -of times it appears. Read more
    source§

    fn counts_by<K, F>(self, f: F) -> HashMap<K, usize>
    where +of times it appears. Read more

    source§

    fn counts_by<K, F>(self, f: F) -> HashMap<K, usize>
    where Self: Sized, K: Eq + Hash, F: FnMut(Self::Item) -> K,

    Collect the items in this iterator and return a HashMap which contains each item that appears in the iterator and the number of times it appears, -determining identity using a keying function. Read more
    source§

    fn multiunzip<FromI>(self) -> FromI
    where - Self: Sized + MultiUnzip<FromI>,

    Converts an iterator of tuples into a tuple of containers. Read more
    source§

    fn try_len(&self) -> Result<usize, (usize, Option<usize>)>

    Returns the length of the iterator if one exists. +determining identity using a keying function. Read more
    source§

    fn multiunzip<FromI>(self) -> FromI
    where + Self: Sized + MultiUnzip<FromI>,

    Converts an iterator of tuples into a tuple of containers. Read more
    source§

    fn try_len(&self) -> Result<usize, (usize, Option<usize>)>

    Returns the length of the iterator if one exists. Otherwise return self.size_hint(). Read more
    source§

    impl<IT, A, FromA, B, FromB> MultiUnzip<(FromA, FromB)> for IT
    where IT: Iterator<Item = (A, B)>, FromA: Default + Extend<A>, FromB: Default + Extend<B>,

    source§

    fn multiunzip(self) -> (FromA, FromB)

    Unzip this iterator into multiple collections.
    source§

    impl<T> 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 + 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/itertools/structs/struct.PutBack.html b/itertools/structs/struct.PutBack.html index 3054c94a5..eb67a646d 100644 --- a/itertools/structs/struct.PutBack.html +++ b/itertools/structs/struct.PutBack.html @@ -1,20 +1,20 @@ -PutBack in itertools::structs - Rust
    -

    Struct itertools::structs::PutBack

    source · 
    pub struct PutBack<I>
    where
+PutBack in itertools::structs - Rust
    
+    
    Struct itertools::structs::PutBack
    source · 
    pub struct PutBack<I>
    where
     I: Iterator,
    { /* private fields */ }
    Expand description
    An iterator adaptor that allows putting back a single
 item to the front of the iterator.
    
 
    Iterator element type is I::Item.
    
-
    Implementations§
    source§
    impl<I> PutBack<I>
    where
-    I: Iterator,
    source
    pub fn with_value(self, value: I::Item) -> Self
    put back value value (builder method)
    
-
    source
    pub fn into_parts(self) -> (Option<I::Item>, I)
    Split the PutBack into its parts.
    
-
    source
    pub fn put_back(&mut self, x: I::Item)
    Put back a single value to the front of the iterator.
    
-
    If a value is already in the put back slot, it is overwritten.
    
-
    Trait Implementations§
    source§
    impl<I> Clone for PutBack<I>
    where
+
    Implementations§
    source§
    impl<I> PutBack<I>
    where
+    I: Iterator,
    source
    pub fn with_value(self, value: I::Item) -> Self
    put back value value (builder method)
    
+
    source
    pub fn into_parts(self) -> (Option<I::Item>, I)
    Split the PutBack into its parts.
    
+
    source
    pub fn put_back(&mut self, x: I::Item) -> Option<I::Item>
    Put back a single value to the front of the iterator.
    
+
    If a value is already in the put back slot, it is returned.
    
+
    Trait Implementations§
    source§
    impl<I> Clone for PutBack<I>
    where
     I: Iterator + Clone,
-    I::Item: Clone,
    source§
    fn clone(&self) -> PutBack<I> ⓘ
    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<I> Debug for PutBack<I>
    where
+    I::Item: Clone,
    source§
    fn clone(&self) -> PutBack<I> ⓘ
    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<I> Debug for PutBack<I>
    where
     I: Iterator + Debug,
-    I::Item: Debug,
    source§
    fn fmt(&self, f: &mut Formatter<'_>) -> Result
    Formats the value using the given formatter. Read more
    source§
    impl<I> Iterator for PutBack<I>
    where
-    I: Iterator,
    §
    type Item = <I as Iterator>::Item
    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 last(self) -> Option<Self::Item>
    Consumes the iterator, returning the last element. Read more
    source§
    fn nth(&mut self, n: usize) -> Option<Self::Item>
    Returns the nth element of the iterator. Read more
    source§
    fn all<G>(&mut self, f: G) -> bool
    where
-    G: FnMut(Self::Item) -> bool,
    Tests if every element of the iterator matches a predicate. Read more
    source§
    fn fold<Acc, G>(self, init: Acc, f: G) -> Acc
    where
+    I::Item: Debug,
    source§
    fn fmt(&self, f: &mut Formatter<'_>) -> Result
    Formats the value using the given formatter. Read more
    source§
    impl<I> Iterator for PutBack<I>
    where
+    I: Iterator,
    §
    type Item = <I as Iterator>::Item
    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 last(self) -> Option<Self::Item>
    Consumes the iterator, returning the last element. Read more
    source§
    fn nth(&mut self, n: usize) -> Option<Self::Item>
    Returns the nth element of the iterator. Read more
    source§
    fn all<G>(&mut self, f: G) -> bool
    where
+    G: FnMut(Self::Item) -> bool,
    Tests if every element of the iterator matches a predicate. Read more
    source§
    fn fold<Acc, G>(self, init: Acc, f: G) -> Acc
    where
     G: FnMut(Acc, Self::Item) -> Acc,
    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
@@ -189,8 +189,8 @@ greater than or equal to those of another. Read more
    source§
    impl<I> PeekingNext for PutBack<I>
    where
     I: Iterator,
    source§
    fn peeking_next<F>(&mut self, accept: F) -> Option<Self::Item>
    where
     F: FnOnce(&Self::Item) -> bool,
    Pass a reference to the next iterator element to the closure accept;
-if accept returns true, return it as the next element,
-else None.
    Auto Trait Implementations§
    §
    impl<I> Freeze for PutBack<I>
    where
+if accept returns true, return it as the next element,
+else None.
    Auto Trait Implementations§
    §
    impl<I> Freeze for PutBack<I>
    where
     I: Freeze,
     <I as Iterator>::Item: Freeze,
    §
    impl<I> RefUnwindSafe for PutBack<I>
    where
     I: RefUnwindSafe,
@@ -218,86 +218,87 @@ otherwise. Right variant of Either<Self, Self>
 otherwise. Read more
    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> Itertools for T
    where
-    T: Iterator + ?Sized,
    source§
    fn interleave<J>(self, other: J) -> Interleave<Self, J::IntoIter> ⓘ
    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> Itertools for T
    where
+    T: Iterator + ?Sized,
    source§
    fn interleave<J>(self, other: J) -> Interleave<Self, J::IntoIter> ⓘ
    where
     J: IntoIterator<Item = Self::Item>,
-    Self: Sized,
    Alternate elements from two iterators until both have run out. Read more
    source§
    fn interleave_shortest<J>(
+    Self: Sized,
    Alternate elements from two iterators until both have run out. Read more
    source§
    fn interleave_shortest<J>(
     self,
     other: J
 ) -> InterleaveShortest<Self, J::IntoIter> ⓘ
    where
     J: IntoIterator<Item = Self::Item>,
     Self: Sized,
    Alternate elements from two iterators until at least one of them has run
-out. Read more
    source§
    fn intersperse(self, element: Self::Item) -> Intersperse<Self>
    where
+out. Read more
    source§
    fn intersperse(self, element: Self::Item) -> Intersperse<Self>
    where
     Self: Sized,
     Self::Item: Clone,
    An iterator adaptor to insert a particular value
-between each element of the adapted iterator. Read more
    source§
    fn intersperse_with<F>(self, element: F) -> IntersperseWith<Self, F> ⓘ
    where
+between each element of the adapted iterator. Read more
    source§
    fn intersperse_with<F>(self, element: F) -> IntersperseWith<Self, F> ⓘ
    where
     Self: Sized,
     F: FnMut() -> Self::Item,
    An iterator adaptor to insert a particular value created by a function
-between each element of the adapted iterator. Read more
    source§
    fn zip_longest<J>(self, other: J) -> ZipLongest<Self, J::IntoIter> ⓘ
    where
+between each element of the adapted iterator. Read more
    source§
    fn get<R>(self, index: R) -> R::Output
    where
+    Self: Sized,
+    R: IteratorIndex<Self>,
    Returns an iterator over a subsection of the iterator. Read more
    source§
    fn zip_longest<J>(self, other: J) -> ZipLongest<Self, J::IntoIter> ⓘ
    where
     J: IntoIterator,
     Self: Sized,
    Create an iterator which iterates over both this and the specified
-iterator simultaneously, yielding pairs of two optional elements. Read more
    source§
    fn zip_eq<J>(self, other: J) -> ZipEq<Self, J::IntoIter> ⓘ
    where
+iterator simultaneously, yielding pairs of two optional elements. Read more
    source§
    fn zip_eq<J>(self, other: J) -> ZipEq<Self, J::IntoIter> ⓘ
    where
     J: IntoIterator,
     Self: Sized,
    Create an iterator which iterates over both this and the specified
-iterator simultaneously, yielding pairs of elements. Read more
    source§
    fn batching<B, F>(self, f: F) -> Batching<Self, F> ⓘ
    where
+iterator simultaneously, yielding pairs of elements. Read more
    source§
    fn batching<B, F>(self, f: F) -> Batching<Self, F> ⓘ
    where
     F: FnMut(&mut Self) -> Option<B>,
     Self: Sized,
    A “meta iterator adaptor”. Its closure receives a reference to the
 iterator and may pick off as many elements as it likes, to produce the
-next iterator element. Read more
    source§
    fn group_by<K, F>(self, key: F) -> GroupBy<K, Self, F>
    where
+next iterator element. Read more
    source§
    fn chunk_by<K, F>(self, key: F) -> ChunkBy<K, Self, F>
    where
     Self: Sized,
     F: FnMut(&Self::Item) -> K,
     K: PartialEq,
    Return an iterable that can group iterator elements.
 Consecutive elements that map to the same key (“runs”), are assigned
-to the same group. Read more
    source§
    fn chunks(self, size: usize) -> IntoChunks<Self>
    where
-    Self: Sized,
    Return an iterable that can chunk the iterator. Read more
    source§
    fn tuple_windows<T>(self) -> TupleWindows<Self, T> ⓘ
    where
+to the same group. Read more
    source§
    fn group_by<K, F>(self, key: F) -> ChunkBy<K, Self, F>
    where
+    Self: Sized,
+    F: FnMut(&Self::Item) -> K,
+    K: PartialEq,
    👎Deprecated since 0.13.0: Use .chunk_by() instead
    See .chunk_by().
    source§
    fn chunks(self, size: usize) -> IntoChunks<Self>
    where
+    Self: Sized,
    Return an iterable that can chunk the iterator. Read more
    source§
    fn tuple_windows<T>(self) -> TupleWindows<Self, T> ⓘ
    where
     Self: Sized + Iterator<Item = T::Item>,
     T: HomogeneousTuple,
     T::Item: Clone,
    Return an iterator over all contiguous windows producing tuples of
-a specific size (up to 12). Read more
    source§
    fn circular_tuple_windows<T>(self) -> CircularTupleWindows<Self, T> ⓘ
    where
+a specific size (up to 12). Read more
    source§
    fn circular_tuple_windows<T>(self) -> CircularTupleWindows<Self, T> ⓘ
    where
     Self: Sized + Clone + Iterator<Item = T::Item> + ExactSizeIterator,
     T: TupleCollect + Clone,
     T::Item: Clone,
    Return an iterator over all windows, wrapping back to the first
 elements when the window would otherwise exceed the length of the
-iterator, producing tuples of a specific size (up to 12). Read more
    source§
    fn tuples<T>(self) -> Tuples<Self, T> ⓘ
    where
+iterator, producing tuples of a specific size (up to 12). Read more
    source§
    fn tuples<T>(self) -> Tuples<Self, T> ⓘ
    where
     Self: Sized + Iterator<Item = T::Item>,
     T: HomogeneousTuple,
    Return an iterator that groups the items in tuples of a specific size
-(up to 12). Read more
    source§
    fn tee(self) -> (Tee<Self>, Tee<Self>)
    where
+(up to 12). Read more
    source§
    fn tee(self) -> (Tee<Self>, Tee<Self>)
    where
     Self: Sized,
     Self::Item: Clone,
    Split into an iterator pair that both yield all elements from
-the original iterator. Read more
    source§
    fn step(self, n: usize) -> Step<Self> ⓘ
    where
-    Self: Sized,
    👎Deprecated since 0.8.0: Use std .step_by() instead
    Return an iterator adaptor that steps n elements in the base iterator
-for each iteration. Read more
    source§
    fn map_into<R>(self) -> MapInto<Self, R>
    where
+the original iterator. Read more
    source§
    fn map_into<R>(self) -> MapInto<Self, R>
    where
     Self: Sized,
-    Self::Item: Into<R>,
    Convert each item of the iterator using the Into trait. Read more
    source§
    fn map_results<F, T, U, E>(self, f: F) -> MapOk<Self, F>
    where
-    Self: Iterator<Item = Result<T, E>> + Sized,
-    F: FnMut(T) -> U,
    👎Deprecated since 0.10.0: Use .map_ok() instead
    See .map_ok().
    source§
    fn map_ok<F, T, U, E>(self, f: F) -> MapOk<Self, F>
    where
+    Self::Item: Into<R>,
    Convert each item of the iterator using the Into trait. Read more
    source§
    fn map_ok<F, T, U, E>(self, f: F) -> MapOk<Self, F>
    where
     Self: Iterator<Item = Result<T, E>> + Sized,
     F: FnMut(T) -> U,
    Return an iterator adaptor that applies the provided closure
 to every Result::Ok value. Result::Err values are
-unchanged. Read more
    source§
    fn filter_ok<F, T, E>(self, f: F) -> FilterOk<Self, F> ⓘ
    where
+unchanged. Read more
    source§
    fn filter_ok<F, T, E>(self, f: F) -> FilterOk<Self, F> ⓘ
    where
     Self: Iterator<Item = Result<T, E>> + Sized,
     F: FnMut(&T) -> bool,
    Return an iterator adaptor that filters every Result::Ok
 value with the provided closure. Result::Err values are
-unchanged. Read more
    source§
    fn filter_map_ok<F, T, U, E>(self, f: F) -> FilterMapOk<Self, F> ⓘ
    where
+unchanged. Read more
    source§
    fn filter_map_ok<F, T, U, E>(self, f: F) -> FilterMapOk<Self, F> ⓘ
    where
     Self: Iterator<Item = Result<T, E>> + Sized,
     F: FnMut(T) -> Option<U>,
    Return an iterator adaptor that filters and transforms every
 Result::Ok value with the provided closure. Result::Err
-values are unchanged. Read more
    source§
    fn flatten_ok<T, E>(self) -> FlattenOk<Self, T, E> ⓘ
    where
+values are unchanged. Read more
    source§
    fn flatten_ok<T, E>(self) -> FlattenOk<Self, T, E> ⓘ
    where
     Self: Iterator<Item = Result<T, E>> + Sized,
     T: IntoIterator,
    Return an iterator adaptor that flattens every Result::Ok value into
-a series of Result::Ok values. Result::Err values are unchanged. Read more
    source§
    fn process_results<F, T, E, R>(self, processor: F) -> Result<R, E>
    where
+a series of Result::Ok values. Result::Err values are unchanged. Read more
    source§
    fn process_results<F, T, E, R>(self, processor: F) -> Result<R, E>
    where
     Self: Iterator<Item = Result<T, E>> + Sized,
     F: FnOnce(ProcessResults<'_, Self, E>) -> R,
    “Lift” a function of the values of the current iterator so as to process
-an iterator of Result values instead. Read more
    source§
    fn merge<J>(self, other: J) -> Merge<Self, J::IntoIter>
    where
+an iterator of Result values instead. Read more
    source§
    fn merge<J>(self, other: J) -> Merge<Self, J::IntoIter>
    where
     Self: Sized,
     Self::Item: PartialOrd,
     J: IntoIterator<Item = Self::Item>,
    Return an iterator adaptor that merges the two base iterators in
 ascending order.  If both base iterators are sorted (ascending), the
-result is sorted. Read more
    source§
    fn merge_by<J, F>(self, other: J, is_first: F) -> MergeBy<Self, J::IntoIter, F> ⓘ
    where
+result is sorted. Read more
    source§
    fn merge_by<J, F>(self, other: J, is_first: F) -> MergeBy<Self, J::IntoIter, F> ⓘ
    where
     Self: Sized,
     J: IntoIterator<Item = Self::Item>,
     F: FnMut(&Self::Item, &Self::Item) -> bool,
    Return an iterator adaptor that merges the two base iterators in order.
-This is much like .merge() but allows for a custom ordering. Read more
    source§
    fn merge_join_by<J, F, T>(
+This is much like .merge() but allows for a custom ordering. Read more
    source§
    fn merge_join_by<J, F, T>(
     self,
     other: J,
     cmp_fn: F
@@ -305,284 +306,295 @@ This is much like IntoIterator,
     F: FnMut(&Self::Item, &J::Item) -> T,
     Self: Sized,
    Create an iterator that merges items from both this and the specified -iterator in ascending order. Read more
    source§

    fn kmerge(self) -> KMerge<<Self::Item as IntoIterator>::IntoIter>
    where +iterator in ascending order. Read more

    source§

    fn kmerge(self) -> KMerge<<Self::Item as IntoIterator>::IntoIter>
    where Self: Sized, Self::Item: IntoIterator, <Self::Item as IntoIterator>::Item: PartialOrd,

    Return an iterator adaptor that flattens an iterator of iterators by -merging them in ascending order. Read more
    source§

    fn kmerge_by<F>( +merging them in ascending order. Read more

    source§

    fn kmerge_by<F>( self, first: F ) -> KMergeBy<<Self::Item as IntoIterator>::IntoIter, F> ⓘ
    where Self: Sized, Self::Item: IntoIterator, F: FnMut(&<Self::Item as IntoIterator>::Item, &<Self::Item as IntoIterator>::Item) -> bool,

    Return an iterator adaptor that flattens an iterator of iterators by -merging them according to the given closure. Read more
    source§

    fn cartesian_product<J>(self, other: J) -> Product<Self, J::IntoIter> ⓘ
    where +merging them according to the given closure. Read more

    source§

    fn cartesian_product<J>(self, other: J) -> Product<Self, J::IntoIter> ⓘ
    where Self: Sized, Self::Item: Clone, J: IntoIterator, J::IntoIter: Clone,

    Return an iterator adaptor that iterates over the cartesian product of -the element sets of two iterators self and J. Read more
    source§

    fn multi_cartesian_product( +the element sets of two iterators self and J. Read more

    source§

    fn multi_cartesian_product( self ) -> MultiProduct<<Self::Item as IntoIterator>::IntoIter> ⓘ
    where Self: Sized, Self::Item: IntoIterator, <Self::Item as IntoIterator>::IntoIter: Clone, <Self::Item as IntoIterator>::Item: Clone,

    Return an iterator adaptor that iterates over the cartesian product of -all subiterators returned by meta-iterator self. Read more
    source§

    fn coalesce<F>(self, f: F) -> Coalesce<Self, F>
    where +all subiterators returned by meta-iterator self. Read more

    source§

    fn coalesce<F>(self, f: F) -> Coalesce<Self, F>
    where Self: Sized, F: FnMut(Self::Item, Self::Item) -> Result<Self::Item, (Self::Item, Self::Item)>,

    Return an iterator adaptor that uses the passed-in closure to -optionally merge together consecutive elements. Read more
    source§

    fn dedup(self) -> Dedup<Self>
    where +optionally merge together consecutive elements. Read more

    source§

    fn dedup(self) -> Dedup<Self>
    where Self: Sized, Self::Item: PartialEq,

    Remove duplicates from sections of consecutive identical elements. -If the iterator is sorted, all elements will be unique. Read more
    source§

    fn dedup_by<Cmp>(self, cmp: Cmp) -> DedupBy<Self, Cmp>
    where +If the iterator is sorted, all elements will be unique. Read more

    source§

    fn dedup_by<Cmp>(self, cmp: Cmp) -> DedupBy<Self, Cmp>
    where Self: Sized, Cmp: FnMut(&Self::Item, &Self::Item) -> bool,

    Remove duplicates from sections of consecutive identical elements, determining equality using a comparison function. -If the iterator is sorted, all elements will be unique. Read more
    source§

    fn dedup_with_count(self) -> DedupWithCount<Self>
    where +If the iterator is sorted, all elements will be unique. Read more

    source§

    fn dedup_with_count(self) -> DedupWithCount<Self>
    where Self: Sized,

    Remove duplicates from sections of consecutive identical elements, while keeping a count of how many repeated elements were present. -If the iterator is sorted, all elements will be unique. Read more
    source§

    fn dedup_by_with_count<Cmp>(self, cmp: Cmp) -> DedupByWithCount<Self, Cmp>
    where +If the iterator is sorted, all elements will be unique. Read more

    source§

    fn dedup_by_with_count<Cmp>(self, cmp: Cmp) -> DedupByWithCount<Self, Cmp>
    where Self: Sized, Cmp: FnMut(&Self::Item, &Self::Item) -> bool,

    Remove duplicates from sections of consecutive identical elements, while keeping a count of how many repeated elements were present. This will determine equality using a comparison function. -If the iterator is sorted, all elements will be unique. Read more
    source§

    fn duplicates(self) -> Duplicates<Self>
    where +If the iterator is sorted, all elements will be unique. Read more

    source§

    fn duplicates(self) -> Duplicates<Self>
    where Self: Sized, Self::Item: Eq + Hash,

    Return an iterator adaptor that produces elements that appear more than once during the -iteration. Duplicates are detected using hash and equality. Read more
    source§

    fn duplicates_by<V, F>(self, f: F) -> DuplicatesBy<Self, V, F>
    where +iteration. Duplicates are detected using hash and equality. Read more

    source§

    fn duplicates_by<V, F>(self, f: F) -> DuplicatesBy<Self, V, F>
    where Self: Sized, V: Eq + Hash, F: FnMut(&Self::Item) -> V,

    Return an iterator adaptor that produces elements that appear more than once during the -iteration. Duplicates are detected using hash and equality. Read more
    source§

    fn unique(self) -> Unique<Self> ⓘ
    where +iteration. Duplicates are detected using hash and equality. Read more

    source§

    fn unique(self) -> Unique<Self> ⓘ
    where Self: Sized, Self::Item: Clone + Eq + Hash,

    Return an iterator adaptor that filters out elements that have already been produced once during the iteration. Duplicates -are detected using hash and equality. Read more
    source§

    fn unique_by<V, F>(self, f: F) -> UniqueBy<Self, V, F> ⓘ
    where +are detected using hash and equality. Read more

    source§

    fn unique_by<V, F>(self, f: F) -> UniqueBy<Self, V, F> ⓘ
    where Self: Sized, V: Eq + Hash, F: FnMut(&Self::Item) -> V,

    Return an iterator adaptor that filters out elements that have -already been produced once during the iteration. Read more
    source§

    fn peeking_take_while<F>(&mut self, accept: F) -> PeekingTakeWhile<'_, Self, F> ⓘ
    where +already been produced once during the iteration. Read more

    source§

    fn peeking_take_while<F>(&mut self, accept: F) -> PeekingTakeWhile<'_, Self, F> ⓘ
    where Self: Sized + PeekingNext, F: FnMut(&Self::Item) -> bool,

    Return an iterator adaptor that borrows from this iterator and -takes items while the closure accept returns true. Read more
    source§

    fn take_while_ref<F>(&mut self, accept: F) -> TakeWhileRef<'_, Self, F> ⓘ
    where +takes items while the closure accept returns true. Read more

    source§

    fn take_while_ref<F>(&mut self, accept: F) -> TakeWhileRef<'_, Self, F> ⓘ
    where Self: Clone, F: FnMut(&Self::Item) -> bool,

    Return an iterator adaptor that borrows from a Clone-able iterator -to only pick off elements while the predicate accept returns true. Read more
    source§

    fn take_while_inclusive<F>(self, accept: F) -> TakeWhileInclusive<Self, F> ⓘ
    where +to only pick off elements while the predicate accept returns true. Read more

    source§

    fn take_while_inclusive<F>(self, accept: F) -> TakeWhileInclusive<Self, F> ⓘ
    where Self: Sized, F: FnMut(&Self::Item) -> bool,

    Returns an iterator adaptor that consumes elements while the given predicate is true, including the element for which the predicate -first returned false. Read more
    source§

    fn while_some<A>(self) -> WhileSome<Self> ⓘ
    where +first returned false. Read more

    source§

    fn while_some<A>(self) -> WhileSome<Self> ⓘ
    where Self: Sized + Iterator<Item = Option<A>>,

    Return an iterator adaptor that filters Option<A> iterator elements -and produces A. Stops on the first None encountered. Read more
    source§

    fn tuple_combinations<T>(self) -> TupleCombinations<Self, T> ⓘ
    where +and produces A. Stops on the first None encountered. Read more

    source§

    fn tuple_combinations<T>(self) -> TupleCombinations<Self, T> ⓘ
    where Self: Sized + Clone, Self::Item: Clone, T: HasCombination<Self>,

    Return an iterator adaptor that iterates over the combinations of the -elements from an iterator. Read more
    source§

    fn combinations(self, k: usize) -> Combinations<Self> ⓘ
    where +elements from an iterator. Read more

    source§

    fn combinations(self, k: usize) -> Combinations<Self> ⓘ
    where Self: Sized, Self::Item: Clone,

    Return an iterator adaptor that iterates over the k-length combinations of -the elements from an iterator. Read more
    source§

    fn combinations_with_replacement( +the elements from an iterator. Read more

    source§

    fn combinations_with_replacement( self, k: usize ) -> CombinationsWithReplacement<Self> ⓘ
    where Self: Sized, Self::Item: Clone,

    Return an iterator that iterates over the k-length combinations of -the elements from an iterator, with replacement. Read more
    source§

    fn permutations(self, k: usize) -> Permutations<Self> ⓘ
    where +the elements from an iterator, with replacement. Read more

    source§

    fn permutations(self, k: usize) -> Permutations<Self> ⓘ
    where Self: Sized, Self::Item: Clone,

    Return an iterator adaptor that iterates over all k-permutations of the -elements from an iterator. Read more
    source§

    fn powerset(self) -> Powerset<Self> ⓘ
    where +elements from an iterator. Read more

    source§

    fn powerset(self) -> Powerset<Self> ⓘ
    where Self: Sized, Self::Item: Clone,

    Return an iterator that iterates through the powerset of the elements from an -iterator. Read more
    source§

    fn pad_using<F>(self, min: usize, f: F) -> PadUsing<Self, F> ⓘ
    where +iterator. Read more

    source§

    fn pad_using<F>(self, min: usize, f: F) -> PadUsing<Self, F> ⓘ
    where Self: Sized, F: FnMut(usize) -> Self::Item,

    Return an iterator adaptor that pads the sequence to a minimum length of -min by filling missing elements using a closure f. Read more
    source§

    fn with_position(self) -> WithPosition<Self> ⓘ
    where +min by filling missing elements using a closure f. Read more

    source§

    fn with_position(self) -> WithPosition<Self> ⓘ
    where Self: Sized,

    Return an iterator adaptor that combines each element with a Position to -ease special-case handling of the first or last elements. Read more
    source§

    fn positions<P>(self, predicate: P) -> Positions<Self, P> ⓘ
    where +ease special-case handling of the first or last elements. Read more

    source§

    fn positions<P>(self, predicate: P) -> Positions<Self, P> ⓘ
    where Self: Sized, P: FnMut(Self::Item) -> bool,

    Return an iterator adaptor that yields the indices of all elements -satisfying a predicate, counted from the start of the iterator. Read more
    source§

    fn update<F>(self, updater: F) -> Update<Self, F> ⓘ
    where +satisfying a predicate, counted from the start of the iterator. Read more

    source§

    fn update<F>(self, updater: F) -> Update<Self, F> ⓘ
    where Self: Sized, F: FnMut(&mut Self::Item),

    Return an iterator adaptor that applies a mutating function -to each element before yielding it. Read more
    source§

    fn next_tuple<T>(&mut self) -> Option<T>
    where +to each element before yielding it. Read more

    source§

    fn next_tuple<T>(&mut self) -> Option<T>
    where Self: Sized + Iterator<Item = T::Item>, T: HomogeneousTuple,

    Advances the iterator and returns the next items grouped in a tuple of -a specific size (up to 12). Read more
    source§

    fn collect_tuple<T>(self) -> Option<T>
    where +a specific size (up to 12). Read more

    source§

    fn collect_tuple<T>(self) -> Option<T>
    where Self: Sized + Iterator<Item = T::Item>, T: HomogeneousTuple,

    Collects all items from the iterator into a tuple of a specific size -(up to 12). Read more
    source§

    fn find_position<P>(&mut self, pred: P) -> Option<(usize, Self::Item)>
    where - P: FnMut(&Self::Item) -> bool,

    Find the position and value of the first element satisfying a predicate. Read more
    source§

    fn find_or_last<P>(self, predicate: P) -> Option<Self::Item>
    where +(up to 12). Read more

    source§

    fn find_position<P>(&mut self, pred: P) -> Option<(usize, Self::Item)>
    where + P: FnMut(&Self::Item) -> bool,

    Find the position and value of the first element satisfying a predicate. Read more
    source§

    fn find_or_last<P>(self, predicate: P) -> Option<Self::Item>
    where Self: Sized, - P: FnMut(&Self::Item) -> bool,

    Find the value of the first element satisfying a predicate or return the last element, if any. Read more
    source§

    fn find_or_first<P>(self, predicate: P) -> Option<Self::Item>
    where + P: FnMut(&Self::Item) -> bool,

    Find the value of the first element satisfying a predicate or return the last element, if any. Read more
    source§

    fn find_or_first<P>(self, predicate: P) -> Option<Self::Item>
    where Self: Sized, - P: FnMut(&Self::Item) -> bool,

    Find the value of the first element satisfying a predicate or return the first element, if any. Read more
    source§

    fn contains<Q>(&mut self, query: &Q) -> bool
    where + P: FnMut(&Self::Item) -> bool,

    Find the value of the first element satisfying a predicate or return the first element, if any. Read more
    source§

    fn contains<Q>(&mut self, query: &Q) -> bool
    where Self: Sized, Self::Item: Borrow<Q>, - Q: PartialEq,

    Returns true if the given item is present in this iterator. Read more
    source§

    fn all_equal(&mut self) -> bool
    where + Q: PartialEq,

    Returns true if the given item is present in this iterator. Read more
    source§

    fn all_equal(&mut self) -> bool
    where Self: Sized, - Self::Item: PartialEq,

    Check whether all elements compare equal. Read more
    source§

    fn all_equal_value( + Self::Item: PartialEq,

    Check whether all elements compare equal. Read more
    source§

    fn all_equal_value( &mut self ) -> Result<Self::Item, Option<(Self::Item, Self::Item)>>
    where Self: Sized, Self::Item: PartialEq,

    If there are elements and they are all equal, return a single copy of that element. If there are no elements, return an Error containing None. If there are elements and they are not all equal, return a tuple containing the first -two non-equal elements found. Read more
    source§

    fn all_unique(&mut self) -> bool
    where +two non-equal elements found. Read more

    source§

    fn all_unique(&mut self) -> bool
    where Self: Sized, - Self::Item: Eq + Hash,

    Check whether all elements are unique (non equal). Read more
    source§

    fn dropping(self, n: usize) -> Self
    where + Self::Item: Eq + Hash,

    Check whether all elements are unique (non equal). Read more
    source§

    fn dropping(self, n: usize) -> Self
    where Self: Sized,

    Consume the first n elements from the iterator eagerly, -and return the same iterator again. Read more
    source§

    fn dropping_back(self, n: usize) -> Self
    where +and return the same iterator again. Read more

    source§

    fn dropping_back(self, n: usize) -> Self
    where Self: Sized + DoubleEndedIterator,

    Consume the last n elements from the iterator eagerly, -and return the same iterator again. Read more
    source§

    fn foreach<F>(self, f: F)
    where - F: FnMut(Self::Item), - Self: Sized,

    👎Deprecated since 0.8.0: Use .for_each() instead
    Run the closure f eagerly on each element of the iterator. Read more
    source§

    fn concat(self) -> Self::Item
    where +and return the same iterator again. Read more

    source§

    fn concat(self) -> Self::Item
    where Self: Sized, - Self::Item: Extend<<<Self as Iterator>::Item as IntoIterator>::Item> + IntoIterator + Default,

    Combine all an iterator’s elements into one element by using Extend. Read more
    source§

    fn collect_vec(self) -> Vec<Self::Item>
    where + Self::Item: Extend<<<Self as Iterator>::Item as IntoIterator>::Item> + IntoIterator + Default,

    Combine all an iterator’s elements into one element by using Extend. Read more
    source§

    fn collect_vec(self) -> Vec<Self::Item>
    where Self: Sized,

    .collect_vec() is simply a type specialization of Iterator::collect, -for convenience.
    source§

    fn try_collect<T, U, E>(self) -> Result<U, E>
    where +for convenience.

    source§

    fn try_collect<T, U, E>(self) -> Result<U, E>
    where Self: Sized + Iterator<Item = Result<T, E>>, Result<U, E>: FromIterator<Result<T, E>>,

    .try_collect() is more convenient way of writing -.collect::<Result<_, _>>() Read more
    source§

    fn set_from<'a, A: 'a, J>(&mut self, from: J) -> usize
    where +.collect::<Result<_, _>>() Read more

    source§

    fn set_from<'a, A: 'a, J>(&mut self, from: J) -> usize
    where Self: Iterator<Item = &'a mut A>, J: IntoIterator<Item = A>,

    Assign to each reference in self from the from iterator, -stopping at the shortest of the two iterators. Read more
    source§

    fn join(&mut self, sep: &str) -> String
    where - Self::Item: Display,

    Combine all iterator elements into one String, separated by sep. Read more
    source§

    fn format(self, sep: &str) -> Format<'_, Self>
    where - Self: Sized,

    Format all iterator elements, separated by sep. Read more
    source§

    fn format_with<F>(self, sep: &str, format: F) -> FormatWith<'_, Self, F>
    where +stopping at the shortest of the two iterators. Read more

    source§

    fn join(&mut self, sep: &str) -> String
    where + Self::Item: Display,

    Combine all iterator elements into one String, separated by sep. Read more
    source§

    fn format(self, sep: &str) -> Format<'_, Self>
    where + Self: Sized,

    Format all iterator elements, separated by sep. Read more
    source§

    fn format_with<F>(self, sep: &str, format: F) -> FormatWith<'_, Self, F>
    where Self: Sized, - F: FnMut(Self::Item, &mut dyn FnMut(&dyn Display) -> Result) -> Result,

    Format all iterator elements, separated by sep. Read more
    source§

    fn fold_results<A, E, B, F>(&mut self, start: B, f: F) -> Result<B, E>
    where + F: FnMut(Self::Item, &mut dyn FnMut(&dyn Display) -> Result) -> Result,

    Format all iterator elements, separated by sep. Read more
    source§

    fn fold_ok<A, E, B, F>(&mut self, start: B, f: F) -> Result<B, E>
    where Self: Iterator<Item = Result<A, E>>, - F: FnMut(B, A) -> B,

    👎Deprecated since 0.10.0: Use .fold_ok() instead
    See .fold_ok().
    source§

    fn fold_ok<A, E, B, F>(&mut self, start: B, f: F) -> Result<B, E>
    where - Self: Iterator<Item = Result<A, E>>, - F: FnMut(B, A) -> B,

    Fold Result values from an iterator. Read more
    source§

    fn fold_options<A, B, F>(&mut self, start: B, f: F) -> Option<B>
    where + F: FnMut(B, A) -> B,

    Fold Result values from an iterator. Read more
    source§

    fn fold_options<A, B, F>(&mut self, start: B, f: F) -> Option<B>
    where Self: Iterator<Item = Option<A>>, - F: FnMut(B, A) -> B,

    Fold Option values from an iterator. Read more
    source§

    fn fold1<F>(self, f: F) -> Option<Self::Item>
    where + F: FnMut(B, A) -> B,

    Fold Option values from an iterator. Read more
    source§

    fn fold1<F>(self, f: F) -> Option<Self::Item>
    where F: FnMut(Self::Item, Self::Item) -> Self::Item, - Self: Sized,

    👎Deprecated since 0.10.2: Use Iterator::reduce instead
    Accumulator of the elements in the iterator. Read more
    source§

    fn tree_fold1<F>(self, f: F) -> Option<Self::Item>
    where + Self: Sized,

    👎Deprecated since 0.10.2: Use Iterator::reduce instead
    Accumulator of the elements in the iterator. Read more
    source§

    fn tree_reduce<F>(self, f: F) -> Option<Self::Item>
    where F: FnMut(Self::Item, Self::Item) -> Self::Item, - Self: Sized,

    Accumulate the elements in the iterator in a tree-like manner. Read more
    source§

    fn fold_while<B, F>(&mut self, init: B, f: F) -> FoldWhile<B>
    where + Self: Sized,

    Accumulate the elements in the iterator in a tree-like manner. Read more
    source§

    fn tree_fold1<F>(self, f: F) -> Option<Self::Item>
    where + F: FnMut(Self::Item, Self::Item) -> Self::Item, + Self: Sized,

    👎Deprecated since 0.13.0: Use .tree_reduce() instead
    See .tree_reduce().
    source§

    fn fold_while<B, F>(&mut self, init: B, f: F) -> FoldWhile<B>
    where Self: Sized, - F: FnMut(B, Self::Item) -> FoldWhile<B>,

    An iterator method that applies a function, producing a single, final value. Read more
    source§

    fn sum1<S>(self) -> Option<S>
    where + F: FnMut(B, Self::Item) -> FoldWhile<B>,

    An iterator method that applies a function, producing a single, final value. Read more
    source§

    fn sum1<S>(self) -> Option<S>
    where Self: Sized, - S: Sum<Self::Item>,

    Iterate over the entire iterator and add all the elements. Read more
    source§

    fn product1<P>(self) -> Option<P>
    where + S: Sum<Self::Item>,

    Iterate over the entire iterator and add all the elements. Read more
    source§

    fn product1<P>(self) -> Option<P>
    where Self: Sized, - P: Product<Self::Item>,

    Iterate over the entire iterator and multiply all the elements. Read more
    source§

    fn sorted_unstable(self) -> IntoIter<Self::Item> ⓘ
    where + P: Product<Self::Item>,

    Iterate over the entire iterator and multiply all the elements. Read more
    source§

    fn sorted_unstable(self) -> IntoIter<Self::Item> ⓘ
    where Self: Sized, - Self::Item: Ord,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_unstable_by<F>(self, cmp: F) -> IntoIter<Self::Item> ⓘ
    where + Self::Item: Ord,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_unstable_by<F>(self, cmp: F) -> IntoIter<Self::Item> ⓘ
    where Self: Sized, - F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_unstable_by_key<K, F>(self, f: F) -> IntoIter<Self::Item> ⓘ
    where + F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_unstable_by_key<K, F>(self, f: F) -> IntoIter<Self::Item> ⓘ
    where Self: Sized, K: Ord, - F: FnMut(&Self::Item) -> K,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted(self) -> IntoIter<Self::Item> ⓘ
    where + F: FnMut(&Self::Item) -> K,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted(self) -> IntoIter<Self::Item> ⓘ
    where Self: Sized, - Self::Item: Ord,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_by<F>(self, cmp: F) -> IntoIter<Self::Item> ⓘ
    where + Self::Item: Ord,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_by<F>(self, cmp: F) -> IntoIter<Self::Item> ⓘ
    where Self: Sized, - F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_by_key<K, F>(self, f: F) -> IntoIter<Self::Item> ⓘ
    where + F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_by_key<K, F>(self, f: F) -> IntoIter<Self::Item> ⓘ
    where Self: Sized, K: Ord, - F: FnMut(&Self::Item) -> K,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_by_cached_key<K, F>(self, f: F) -> IntoIter<Self::Item> ⓘ
    where + F: FnMut(&Self::Item) -> K,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_by_cached_key<K, F>(self, f: F) -> IntoIter<Self::Item> ⓘ
    where Self: Sized, K: Ord, F: FnMut(&Self::Item) -> K,

    Sort all iterator elements into a new iterator in ascending order. The key function is -called exactly once per key. Read more
    source§

    fn k_smallest(self, k: usize) -> IntoIter<Self::Item> ⓘ
    where +called exactly once per key. Read more

    source§

    fn k_smallest(self, k: usize) -> IntoIter<Self::Item> ⓘ
    where Self: Sized, - Self::Item: Ord,

    Sort the k smallest elements into a new iterator, in ascending order. Read more
    source§

    fn partition_map<A, B, F, L, R>(self, predicate: F) -> (A, B)
    where + Self::Item: Ord,

    Sort the k smallest elements into a new iterator, in ascending order. Read more
    source§

    fn k_smallest_by<F>(self, k: usize, cmp: F) -> IntoIter<Self::Item> ⓘ
    where + Self: Sized, + F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Sort the k smallest elements into a new iterator using the provided comparison. Read more
    source§

    fn k_smallest_by_key<F, K>(self, k: usize, key: F) -> IntoIter<Self::Item> ⓘ
    where + Self: Sized, + F: FnMut(&Self::Item) -> K, + K: Ord,

    Return the elements producing the k smallest outputs of the provided function. Read more
    source§

    fn k_largest(self, k: usize) -> IntoIter<Self::Item> ⓘ
    where + Self: Sized, + Self::Item: Ord,

    Sort the k largest elements into a new iterator, in descending order. Read more
    source§

    fn k_largest_by<F>(self, k: usize, cmp: F) -> IntoIter<Self::Item> ⓘ
    where + Self: Sized, + F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Sort the k largest elements into a new iterator using the provided comparison. Read more
    source§

    fn k_largest_by_key<F, K>(self, k: usize, key: F) -> IntoIter<Self::Item> ⓘ
    where + Self: Sized, + F: FnMut(&Self::Item) -> K, + K: Ord,

    Return the elements producing the k largest outputs of the provided function. Read more
    source§

    fn tail(self, n: usize) -> IntoIter<Self::Item> ⓘ
    where + Self: Sized,

    Consumes the iterator and return an iterator of the last n elements. Read more
    source§

    fn partition_map<A, B, F, L, R>(self, predicate: F) -> (A, B)
    where Self: Sized, F: FnMut(Self::Item) -> Either<L, R>, A: Default + Extend<L>, B: Default + Extend<R>,

    Collect all iterator elements into one of two partitions. Unlike Iterator::partition, each partition may -have a distinct type. Read more
    source§

    fn partition_result<A, B, T, E>(self) -> (A, B)
    where +have a distinct type. Read more

    source§

    fn partition_result<A, B, T, E>(self) -> (A, B)
    where Self: Iterator<Item = Result<T, E>> + Sized, A: Default + Extend<T>, B: Default + Extend<E>,

    Partition a sequence of Results into one list of all the Ok elements -and another list of all the Err elements. Read more
    source§

    fn into_group_map<K, V>(self) -> HashMap<K, Vec<V>>
    where +and another list of all the Err elements. Read more

    source§

    fn into_group_map<K, V>(self) -> HashMap<K, Vec<V>>
    where Self: Iterator<Item = (K, V)> + Sized, K: Hash + Eq,

    Return a HashMap of keys mapped to Vecs of values. Keys and values -are taken from (Key, Value) tuple pairs yielded by the input iterator. Read more
    source§

    fn into_group_map_by<K, V, F>(self, f: F) -> HashMap<K, Vec<V>>
    where +are taken from (Key, Value) tuple pairs yielded by the input iterator. Read more

    source§

    fn into_group_map_by<K, V, F>(self, f: F) -> HashMap<K, Vec<V>>
    where Self: Iterator<Item = V> + Sized, K: Hash + Eq, - F: Fn(&V) -> K,

    Return an Iterator on a HashMap. Keys mapped to Vecs of values. The key is specified -in the closure. Read more
    source§

    fn into_grouping_map<K, V>(self) -> GroupingMap<Self>
    where + F: FnMut(&V) -> K,

    Return an Iterator on a HashMap. Keys mapped to Vecs of values. The key is specified +in the closure. Read more
    source§

    fn into_grouping_map<K, V>(self) -> GroupingMap<Self>
    where Self: Iterator<Item = (K, V)> + Sized, K: Hash + Eq,

    Constructs a GroupingMap to be used later with one of the efficient -group-and-fold operations it allows to perform. Read more
    source§

    fn into_grouping_map_by<K, V, F>(self, key_mapper: F) -> GroupingMapBy<Self, F>
    where +group-and-fold operations it allows to perform. Read more

    source§

    fn into_grouping_map_by<K, V, F>(self, key_mapper: F) -> GroupingMapBy<Self, F>
    where Self: Iterator<Item = V> + Sized, K: Hash + Eq, F: FnMut(&V) -> K,

    Constructs a GroupingMap to be used later with one of the efficient -group-and-fold operations it allows to perform. Read more
    source§

    fn min_set(self) -> Vec<Self::Item>
    where +group-and-fold operations it allows to perform. Read more

    source§

    fn min_set(self) -> Vec<Self::Item>
    where Self: Sized, - Self::Item: Ord,

    Return all minimum elements of an iterator. Read more
    source§

    fn min_set_by<F>(self, compare: F) -> Vec<Self::Item>
    where + Self::Item: Ord,

    Return all minimum elements of an iterator. Read more
    source§

    fn min_set_by<F>(self, compare: F) -> Vec<Self::Item>
    where Self: Sized, F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Return all minimum elements of an iterator, as determined by -the specified function. Read more
    source§

    fn min_set_by_key<K, F>(self, key: F) -> Vec<Self::Item>
    where +the specified function. Read more

    source§

    fn min_set_by_key<K, F>(self, key: F) -> Vec<Self::Item>
    where Self: Sized, K: Ord, F: FnMut(&Self::Item) -> K,

    Return all minimum elements of an iterator, as determined by -the specified function. Read more
    source§

    fn max_set(self) -> Vec<Self::Item>
    where +the specified function. Read more

    source§

    fn max_set(self) -> Vec<Self::Item>
    where Self: Sized, - Self::Item: Ord,

    Return all maximum elements of an iterator. Read more
    source§

    fn max_set_by<F>(self, compare: F) -> Vec<Self::Item>
    where + Self::Item: Ord,

    Return all maximum elements of an iterator. Read more
    source§

    fn max_set_by<F>(self, compare: F) -> Vec<Self::Item>
    where Self: Sized, F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Return all maximum elements of an iterator, as determined by -the specified function. Read more
    source§

    fn max_set_by_key<K, F>(self, key: F) -> Vec<Self::Item>
    where +the specified function. Read more

    source§

    fn max_set_by_key<K, F>(self, key: F) -> Vec<Self::Item>
    where Self: Sized, K: Ord, F: FnMut(&Self::Item) -> K,

    Return all maximum elements of an iterator, as determined by -the specified function. Read more
    source§

    fn minmax(self) -> MinMaxResult<Self::Item>
    where +the specified function. Read more

    source§

    fn minmax(self) -> MinMaxResult<Self::Item>
    where Self: Sized, - Self::Item: PartialOrd,

    Return the minimum and maximum elements in the iterator. Read more
    source§

    fn minmax_by_key<K, F>(self, key: F) -> MinMaxResult<Self::Item>
    where + Self::Item: PartialOrd,

    Return the minimum and maximum elements in the iterator. Read more
    source§

    fn minmax_by_key<K, F>(self, key: F) -> MinMaxResult<Self::Item>
    where Self: Sized, K: PartialOrd, F: FnMut(&Self::Item) -> K,

    Return the minimum and maximum element of an iterator, as determined by -the specified function. Read more
    source§

    fn minmax_by<F>(self, compare: F) -> MinMaxResult<Self::Item>
    where +the specified function. Read more

    source§

    fn minmax_by<F>(self, compare: F) -> MinMaxResult<Self::Item>
    where Self: Sized, F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Return the minimum and maximum element of an iterator, as determined by -the specified comparison function. Read more
    source§

    fn position_max(self) -> Option<usize>
    where +the specified comparison function. Read more

    source§

    fn position_max(self) -> Option<usize>
    where Self: Sized, - Self::Item: Ord,

    Return the position of the maximum element in the iterator. Read more
    source§

    fn position_max_by_key<K, F>(self, key: F) -> Option<usize>
    where + Self::Item: Ord,

    Return the position of the maximum element in the iterator. Read more
    source§

    fn position_max_by_key<K, F>(self, key: F) -> Option<usize>
    where Self: Sized, K: Ord, F: FnMut(&Self::Item) -> K,

    Return the position of the maximum element in the iterator, as -determined by the specified function. Read more
    source§

    fn position_max_by<F>(self, compare: F) -> Option<usize>
    where +determined by the specified function. Read more

    source§

    fn position_max_by<F>(self, compare: F) -> Option<usize>
    where Self: Sized, F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Return the position of the maximum element in the iterator, as -determined by the specified comparison function. Read more
    source§

    fn position_min(self) -> Option<usize>
    where +determined by the specified comparison function. Read more

    source§

    fn position_min(self) -> Option<usize>
    where Self: Sized, - Self::Item: Ord,

    Return the position of the minimum element in the iterator. Read more
    source§

    fn position_min_by_key<K, F>(self, key: F) -> Option<usize>
    where + Self::Item: Ord,

    Return the position of the minimum element in the iterator. Read more
    source§

    fn position_min_by_key<K, F>(self, key: F) -> Option<usize>
    where Self: Sized, K: Ord, F: FnMut(&Self::Item) -> K,

    Return the position of the minimum element in the iterator, as -determined by the specified function. Read more
    source§

    fn position_min_by<F>(self, compare: F) -> Option<usize>
    where +determined by the specified function. Read more

    source§

    fn position_min_by<F>(self, compare: F) -> Option<usize>
    where Self: Sized, F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Return the position of the minimum element in the iterator, as -determined by the specified comparison function. Read more
    source§

    fn position_minmax(self) -> MinMaxResult<usize>
    where +determined by the specified comparison function. Read more

    source§

    fn position_minmax(self) -> MinMaxResult<usize>
    where Self: Sized, Self::Item: PartialOrd,

    Return the positions of the minimum and maximum elements in -the iterator. Read more
    source§

    fn position_minmax_by_key<K, F>(self, key: F) -> MinMaxResult<usize>
    where +the iterator. Read more

    source§

    fn position_minmax_by_key<K, F>(self, key: F) -> MinMaxResult<usize>
    where Self: Sized, K: PartialOrd, F: FnMut(&Self::Item) -> K,

    Return the postions of the minimum and maximum elements of an -iterator, as determined by the specified function. Read more
    source§

    fn position_minmax_by<F>(self, compare: F) -> MinMaxResult<usize>
    where +iterator, as determined by the specified function. Read more

    source§

    fn position_minmax_by<F>(self, compare: F) -> MinMaxResult<usize>
    where Self: Sized, F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Return the postions of the minimum and maximum elements of an -iterator, as determined by the specified comparison function. Read more
    source§

    fn exactly_one(self) -> Result<Self::Item, ExactlyOneError<Self>>
    where +iterator, as determined by the specified comparison function. Read more

    source§

    fn exactly_one(self) -> Result<Self::Item, ExactlyOneError<Self>>
    where Self: Sized,

    If the iterator yields exactly one element, that element will be returned, otherwise an error will be returned containing an iterator that has the same output as the input -iterator. Read more
    source§

    fn at_most_one(self) -> Result<Option<Self::Item>, ExactlyOneError<Self>>
    where - Self: Sized,

    If the iterator yields no elements, Ok(None) will be returned. If the iterator yields +iterator. Read more
    source§

    fn at_most_one(self) -> Result<Option<Self::Item>, ExactlyOneError<Self>>
    where + Self: Sized,

    If the iterator yields no elements, Ok(None) will be returned. If the iterator yields exactly one element, that element will be returned, otherwise an error will be returned -containing an iterator that has the same output as the input iterator. Read more
    source§

    fn multipeek(self) -> MultiPeek<Self> ⓘ
    where +containing an iterator that has the same output as the input iterator. Read more

    source§

    fn multipeek(self) -> MultiPeek<Self> ⓘ
    where Self: Sized,

    An iterator adaptor that allows the user to peek at multiple .next() -values without advancing the base iterator. Read more
    source§

    fn counts(self) -> HashMap<Self::Item, usize>
    where +values without advancing the base iterator. Read more

    source§

    fn counts(self) -> HashMap<Self::Item, usize>
    where Self: Sized, Self::Item: Eq + Hash,

    Collect the items in this iterator and return a HashMap which contains each item that appears in the iterator and the number -of times it appears. Read more
    source§

    fn counts_by<K, F>(self, f: F) -> HashMap<K, usize>
    where +of times it appears. Read more

    source§

    fn counts_by<K, F>(self, f: F) -> HashMap<K, usize>
    where Self: Sized, K: Eq + Hash, F: FnMut(Self::Item) -> K,

    Collect the items in this iterator and return a HashMap which contains each item that appears in the iterator and the number of times it appears, -determining identity using a keying function. Read more
    source§

    fn multiunzip<FromI>(self) -> FromI
    where - Self: Sized + MultiUnzip<FromI>,

    Converts an iterator of tuples into a tuple of containers. Read more
    source§

    fn try_len(&self) -> Result<usize, (usize, Option<usize>)>

    Returns the length of the iterator if one exists. +determining identity using a keying function. Read more
    source§

    fn multiunzip<FromI>(self) -> FromI
    where + Self: Sized + MultiUnzip<FromI>,

    Converts an iterator of tuples into a tuple of containers. Read more
    source§

    fn try_len(&self) -> Result<usize, (usize, Option<usize>)>

    Returns the length of the iterator if one exists. Otherwise return self.size_hint(). Read more
    source§

    impl<IT> MultiUnzip<()> for IT
    where IT: Iterator<Item = ()>,

    source§

    fn multiunzip(self)

    Unzip this iterator into multiple collections.
    source§

    impl<IT, A, FromA> MultiUnzip<(FromA,)> for IT
    where IT: Iterator<Item = (A,)>, @@ -685,4 +697,4 @@ Otherwise return self.size_hint(). (FromA, FromB, FromC, FromD, FromE, FromF, FromG, FromH, FromI, FromJ, FromK, FromL)

    Unzip this iterator into multiple collections.
    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 + 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/itertools/structs/struct.PutBackN.html b/itertools/structs/struct.PutBackN.html index 7a5160878..155523143 100644 --- a/itertools/structs/struct.PutBackN.html +++ b/itertools/structs/struct.PutBackN.html @@ -1,9 +1,9 @@ -PutBackN in itertools::structs - Rust
    +PutBackN in itertools::structs - Rust

    Struct itertools::structs::PutBackN

    source · 
    pub struct PutBackN<I: Iterator> { /* private fields */ }
    Expand description

    An iterator adaptor that allows putting multiple items in front of the iterator.

    Iterator element type is I::Item.

    -

    Implementations§

    source§

    impl<I: Iterator> PutBackN<I>

    source

    pub fn put_back(&mut self, x: I::Item)

    Puts x in front of the iterator. -The values are yielded in order of the most recently put back +

    Implementations§

    source§

    impl<I: Iterator> PutBackN<I>

    source

    pub fn put_back(&mut self, x: I::Item)

    Puts x in front of the iterator.

    +

    The values are yielded in order of the most recently put back values first.

    use itertools::put_back_n;
@@ -16,7 +16,7 @@ it.put_back(0);
 assert!(itertools::equal(it, 0..5));

    Trait Implementations§

    source§

    impl<I: Clone + Iterator> Clone for PutBackN<I>
    where I::Item: Clone,

    source§

    fn clone(&self) -> PutBackN<I> ⓘ

    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<I: Debug + Iterator> Debug for PutBackN<I>
    where - I::Item: Debug,

    source§

    fn fmt(&self, f: &mut Formatter<'_>) -> Result

    Formats the value using the given formatter. Read more
    source§

    impl<I: Iterator> Iterator for PutBackN<I>

    §

    type Item = <I as Iterator>::Item

    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 + I::Item: Debug,

    source§

    fn fmt(&self, f: &mut Formatter<'_>) -> Result

    Formats the value using the given formatter. Read more
    source§

    impl<I: Iterator> Iterator for PutBackN<I>

    §

    type Item = <I as Iterator>::Item

    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 @@ -195,8 +195,8 @@ greater than or equal to those of another. Read more

    source§

    impl<I> PeekingNext for PutBackN<I>
    where I: Iterator,

    source§

    fn peeking_next<F>(&mut self, accept: F) -> Option<Self::Item>
    where F: FnOnce(&Self::Item) -> bool,

    Pass a reference to the next iterator element to the closure accept; -if accept returns true, return it as the next element, -else None.

    Auto Trait Implementations§

    §

    impl<I> Freeze for PutBackN<I>
    where +if accept returns true, return it as the next element, +else None.

    Auto Trait Implementations§

    §

    impl<I> Freeze for PutBackN<I>
    where I: Freeze,

    §

    impl<I> RefUnwindSafe for PutBackN<I>
    where I: RefUnwindSafe, <I as Iterator>::Item: RefUnwindSafe,

    §

    impl<I> Send for PutBackN<I>
    where @@ -223,86 +223,87 @@ otherwise. Right variant of Either<Self, Self> otherwise. Read more

    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> Itertools for T
    where - T: Iterator + ?Sized,

    source§

    fn interleave<J>(self, other: J) -> Interleave<Self, J::IntoIter> ⓘ
    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> Itertools for T
    where + T: Iterator + ?Sized,

    source§

    fn interleave<J>(self, other: J) -> Interleave<Self, J::IntoIter> ⓘ
    where J: IntoIterator<Item = Self::Item>, - Self: Sized,

    Alternate elements from two iterators until both have run out. Read more
    source§

    fn interleave_shortest<J>( + Self: Sized,

    Alternate elements from two iterators until both have run out. Read more
    source§

    fn interleave_shortest<J>( self, other: J ) -> InterleaveShortest<Self, J::IntoIter> ⓘ
    where J: IntoIterator<Item = Self::Item>, Self: Sized,

    Alternate elements from two iterators until at least one of them has run -out. Read more
    source§

    fn intersperse(self, element: Self::Item) -> Intersperse<Self>
    where +out. Read more

    source§

    fn intersperse(self, element: Self::Item) -> Intersperse<Self>
    where Self: Sized, Self::Item: Clone,

    An iterator adaptor to insert a particular value -between each element of the adapted iterator. Read more
    source§

    fn intersperse_with<F>(self, element: F) -> IntersperseWith<Self, F> ⓘ
    where +between each element of the adapted iterator. Read more

    source§

    fn intersperse_with<F>(self, element: F) -> IntersperseWith<Self, F> ⓘ
    where Self: Sized, F: FnMut() -> Self::Item,

    An iterator adaptor to insert a particular value created by a function -between each element of the adapted iterator. Read more
    source§

    fn zip_longest<J>(self, other: J) -> ZipLongest<Self, J::IntoIter> ⓘ
    where +between each element of the adapted iterator. Read more

    source§

    fn get<R>(self, index: R) -> R::Output
    where + Self: Sized, + R: IteratorIndex<Self>,

    Returns an iterator over a subsection of the iterator. Read more
    source§

    fn zip_longest<J>(self, other: J) -> ZipLongest<Self, J::IntoIter> ⓘ
    where J: IntoIterator, Self: Sized,

    Create an iterator which iterates over both this and the specified -iterator simultaneously, yielding pairs of two optional elements. Read more
    source§

    fn zip_eq<J>(self, other: J) -> ZipEq<Self, J::IntoIter> ⓘ
    where +iterator simultaneously, yielding pairs of two optional elements. Read more

    source§

    fn zip_eq<J>(self, other: J) -> ZipEq<Self, J::IntoIter> ⓘ
    where J: IntoIterator, Self: Sized,

    Create an iterator which iterates over both this and the specified -iterator simultaneously, yielding pairs of elements. Read more
    source§

    fn batching<B, F>(self, f: F) -> Batching<Self, F> ⓘ
    where +iterator simultaneously, yielding pairs of elements. Read more

    source§

    fn batching<B, F>(self, f: F) -> Batching<Self, F> ⓘ
    where F: FnMut(&mut Self) -> Option<B>, Self: Sized,

    A “meta iterator adaptor”. Its closure receives a reference to the iterator and may pick off as many elements as it likes, to produce the -next iterator element. Read more
    source§

    fn group_by<K, F>(self, key: F) -> GroupBy<K, Self, F>
    where +next iterator element. Read more

    source§

    fn chunk_by<K, F>(self, key: F) -> ChunkBy<K, Self, F>
    where Self: Sized, F: FnMut(&Self::Item) -> K, K: PartialEq,

    Return an iterable that can group iterator elements. Consecutive elements that map to the same key (“runs”), are assigned -to the same group. Read more
    source§

    fn chunks(self, size: usize) -> IntoChunks<Self>
    where - Self: Sized,

    Return an iterable that can chunk the iterator. Read more
    source§

    fn tuple_windows<T>(self) -> TupleWindows<Self, T> ⓘ
    where +to the same group. Read more

    source§

    fn group_by<K, F>(self, key: F) -> ChunkBy<K, Self, F>
    where + Self: Sized, + F: FnMut(&Self::Item) -> K, + K: PartialEq,

    👎Deprecated since 0.13.0: Use .chunk_by() instead
    See .chunk_by().
    source§

    fn chunks(self, size: usize) -> IntoChunks<Self>
    where + Self: Sized,

    Return an iterable that can chunk the iterator. Read more
    source§

    fn tuple_windows<T>(self) -> TupleWindows<Self, T> ⓘ
    where Self: Sized + Iterator<Item = T::Item>, T: HomogeneousTuple, T::Item: Clone,

    Return an iterator over all contiguous windows producing tuples of -a specific size (up to 12). Read more
    source§

    fn circular_tuple_windows<T>(self) -> CircularTupleWindows<Self, T> ⓘ
    where +a specific size (up to 12). Read more

    source§

    fn circular_tuple_windows<T>(self) -> CircularTupleWindows<Self, T> ⓘ
    where Self: Sized + Clone + Iterator<Item = T::Item> + ExactSizeIterator, T: TupleCollect + Clone, T::Item: Clone,

    Return an iterator over all windows, wrapping back to the first elements when the window would otherwise exceed the length of the -iterator, producing tuples of a specific size (up to 12). Read more
    source§

    fn tuples<T>(self) -> Tuples<Self, T> ⓘ
    where +iterator, producing tuples of a specific size (up to 12). Read more

    source§

    fn tuples<T>(self) -> Tuples<Self, T> ⓘ
    where Self: Sized + Iterator<Item = T::Item>, T: HomogeneousTuple,

    Return an iterator that groups the items in tuples of a specific size -(up to 12). Read more
    source§

    fn tee(self) -> (Tee<Self>, Tee<Self>)
    where +(up to 12). Read more

    source§

    fn tee(self) -> (Tee<Self>, Tee<Self>)
    where Self: Sized, Self::Item: Clone,

    Split into an iterator pair that both yield all elements from -the original iterator. Read more
    source§

    fn step(self, n: usize) -> Step<Self> ⓘ
    where - Self: Sized,

    👎Deprecated since 0.8.0: Use std .step_by() instead
    Return an iterator adaptor that steps n elements in the base iterator -for each iteration. Read more
    source§

    fn map_into<R>(self) -> MapInto<Self, R>
    where +the original iterator. Read more

    source§

    fn map_into<R>(self) -> MapInto<Self, R>
    where Self: Sized, - Self::Item: Into<R>,

    Convert each item of the iterator using the Into trait. Read more
    source§

    fn map_results<F, T, U, E>(self, f: F) -> MapOk<Self, F>
    where - Self: Iterator<Item = Result<T, E>> + Sized, - F: FnMut(T) -> U,

    👎Deprecated since 0.10.0: Use .map_ok() instead
    See .map_ok().
    source§

    fn map_ok<F, T, U, E>(self, f: F) -> MapOk<Self, F>
    where + Self::Item: Into<R>,

    Convert each item of the iterator using the Into trait. Read more
    source§

    fn map_ok<F, T, U, E>(self, f: F) -> MapOk<Self, F>
    where Self: Iterator<Item = Result<T, E>> + Sized, F: FnMut(T) -> U,

    Return an iterator adaptor that applies the provided closure to every Result::Ok value. Result::Err values are -unchanged. Read more
    source§

    fn filter_ok<F, T, E>(self, f: F) -> FilterOk<Self, F> ⓘ
    where +unchanged. Read more

    source§

    fn filter_ok<F, T, E>(self, f: F) -> FilterOk<Self, F> ⓘ
    where Self: Iterator<Item = Result<T, E>> + Sized, F: FnMut(&T) -> bool,

    Return an iterator adaptor that filters every Result::Ok value with the provided closure. Result::Err values are -unchanged. Read more
    source§

    fn filter_map_ok<F, T, U, E>(self, f: F) -> FilterMapOk<Self, F> ⓘ
    where +unchanged. Read more

    source§

    fn filter_map_ok<F, T, U, E>(self, f: F) -> FilterMapOk<Self, F> ⓘ
    where Self: Iterator<Item = Result<T, E>> + Sized, F: FnMut(T) -> Option<U>,

    Return an iterator adaptor that filters and transforms every Result::Ok value with the provided closure. Result::Err -values are unchanged. Read more
    source§

    fn flatten_ok<T, E>(self) -> FlattenOk<Self, T, E> ⓘ
    where +values are unchanged. Read more

    source§

    fn flatten_ok<T, E>(self) -> FlattenOk<Self, T, E> ⓘ
    where Self: Iterator<Item = Result<T, E>> + Sized, T: IntoIterator,

    Return an iterator adaptor that flattens every Result::Ok value into -a series of Result::Ok values. Result::Err values are unchanged. Read more
    source§

    fn process_results<F, T, E, R>(self, processor: F) -> Result<R, E>
    where +a series of Result::Ok values. Result::Err values are unchanged. Read more

    source§

    fn process_results<F, T, E, R>(self, processor: F) -> Result<R, E>
    where Self: Iterator<Item = Result<T, E>> + Sized, F: FnOnce(ProcessResults<'_, Self, E>) -> R,

    “Lift” a function of the values of the current iterator so as to process -an iterator of Result values instead. Read more
    source§

    fn merge<J>(self, other: J) -> Merge<Self, J::IntoIter>
    where +an iterator of Result values instead. Read more

    source§

    fn merge<J>(self, other: J) -> Merge<Self, J::IntoIter>
    where Self: Sized, Self::Item: PartialOrd, J: IntoIterator<Item = Self::Item>,

    Return an iterator adaptor that merges the two base iterators in ascending order. If both base iterators are sorted (ascending), the -result is sorted. Read more
    source§

    fn merge_by<J, F>(self, other: J, is_first: F) -> MergeBy<Self, J::IntoIter, F> ⓘ
    where +result is sorted. Read more

    source§

    fn merge_by<J, F>(self, other: J, is_first: F) -> MergeBy<Self, J::IntoIter, F> ⓘ
    where Self: Sized, J: IntoIterator<Item = Self::Item>, F: FnMut(&Self::Item, &Self::Item) -> bool,

    Return an iterator adaptor that merges the two base iterators in order. -This is much like .merge() but allows for a custom ordering. Read more
    source§

    fn merge_join_by<J, F, T>( +This is much like .merge() but allows for a custom ordering. Read more

    source§

    fn merge_join_by<J, F, T>( self, other: J, cmp_fn: F @@ -310,284 +311,295 @@ This is much like IntoIterator, F: FnMut(&Self::Item, &J::Item) -> T, Self: Sized,

    Create an iterator that merges items from both this and the specified -iterator in ascending order. Read more
    source§

    fn kmerge(self) -> KMerge<<Self::Item as IntoIterator>::IntoIter>
    where +iterator in ascending order. Read more

    source§

    fn kmerge(self) -> KMerge<<Self::Item as IntoIterator>::IntoIter>
    where Self: Sized, Self::Item: IntoIterator, <Self::Item as IntoIterator>::Item: PartialOrd,

    Return an iterator adaptor that flattens an iterator of iterators by -merging them in ascending order. Read more
    source§

    fn kmerge_by<F>( +merging them in ascending order. Read more

    source§

    fn kmerge_by<F>( self, first: F ) -> KMergeBy<<Self::Item as IntoIterator>::IntoIter, F> ⓘ
    where Self: Sized, Self::Item: IntoIterator, F: FnMut(&<Self::Item as IntoIterator>::Item, &<Self::Item as IntoIterator>::Item) -> bool,

    Return an iterator adaptor that flattens an iterator of iterators by -merging them according to the given closure. Read more
    source§

    fn cartesian_product<J>(self, other: J) -> Product<Self, J::IntoIter> ⓘ
    where +merging them according to the given closure. Read more

    source§

    fn cartesian_product<J>(self, other: J) -> Product<Self, J::IntoIter> ⓘ
    where Self: Sized, Self::Item: Clone, J: IntoIterator, J::IntoIter: Clone,

    Return an iterator adaptor that iterates over the cartesian product of -the element sets of two iterators self and J. Read more
    source§

    fn multi_cartesian_product( +the element sets of two iterators self and J. Read more

    source§

    fn multi_cartesian_product( self ) -> MultiProduct<<Self::Item as IntoIterator>::IntoIter> ⓘ
    where Self: Sized, Self::Item: IntoIterator, <Self::Item as IntoIterator>::IntoIter: Clone, <Self::Item as IntoIterator>::Item: Clone,

    Return an iterator adaptor that iterates over the cartesian product of -all subiterators returned by meta-iterator self. Read more
    source§

    fn coalesce<F>(self, f: F) -> Coalesce<Self, F>
    where +all subiterators returned by meta-iterator self. Read more

    source§

    fn coalesce<F>(self, f: F) -> Coalesce<Self, F>
    where Self: Sized, F: FnMut(Self::Item, Self::Item) -> Result<Self::Item, (Self::Item, Self::Item)>,

    Return an iterator adaptor that uses the passed-in closure to -optionally merge together consecutive elements. Read more
    source§

    fn dedup(self) -> Dedup<Self>
    where +optionally merge together consecutive elements. Read more

    source§

    fn dedup(self) -> Dedup<Self>
    where Self: Sized, Self::Item: PartialEq,

    Remove duplicates from sections of consecutive identical elements. -If the iterator is sorted, all elements will be unique. Read more
    source§

    fn dedup_by<Cmp>(self, cmp: Cmp) -> DedupBy<Self, Cmp>
    where +If the iterator is sorted, all elements will be unique. Read more

    source§

    fn dedup_by<Cmp>(self, cmp: Cmp) -> DedupBy<Self, Cmp>
    where Self: Sized, Cmp: FnMut(&Self::Item, &Self::Item) -> bool,

    Remove duplicates from sections of consecutive identical elements, determining equality using a comparison function. -If the iterator is sorted, all elements will be unique. Read more
    source§

    fn dedup_with_count(self) -> DedupWithCount<Self>
    where +If the iterator is sorted, all elements will be unique. Read more

    source§

    fn dedup_with_count(self) -> DedupWithCount<Self>
    where Self: Sized,

    Remove duplicates from sections of consecutive identical elements, while keeping a count of how many repeated elements were present. -If the iterator is sorted, all elements will be unique. Read more
    source§

    fn dedup_by_with_count<Cmp>(self, cmp: Cmp) -> DedupByWithCount<Self, Cmp>
    where +If the iterator is sorted, all elements will be unique. Read more

    source§

    fn dedup_by_with_count<Cmp>(self, cmp: Cmp) -> DedupByWithCount<Self, Cmp>
    where Self: Sized, Cmp: FnMut(&Self::Item, &Self::Item) -> bool,

    Remove duplicates from sections of consecutive identical elements, while keeping a count of how many repeated elements were present. This will determine equality using a comparison function. -If the iterator is sorted, all elements will be unique. Read more
    source§

    fn duplicates(self) -> Duplicates<Self>
    where +If the iterator is sorted, all elements will be unique. Read more

    source§

    fn duplicates(self) -> Duplicates<Self>
    where Self: Sized, Self::Item: Eq + Hash,

    Return an iterator adaptor that produces elements that appear more than once during the -iteration. Duplicates are detected using hash and equality. Read more
    source§

    fn duplicates_by<V, F>(self, f: F) -> DuplicatesBy<Self, V, F>
    where +iteration. Duplicates are detected using hash and equality. Read more

    source§

    fn duplicates_by<V, F>(self, f: F) -> DuplicatesBy<Self, V, F>
    where Self: Sized, V: Eq + Hash, F: FnMut(&Self::Item) -> V,

    Return an iterator adaptor that produces elements that appear more than once during the -iteration. Duplicates are detected using hash and equality. Read more
    source§

    fn unique(self) -> Unique<Self> ⓘ
    where +iteration. Duplicates are detected using hash and equality. Read more

    source§

    fn unique(self) -> Unique<Self> ⓘ
    where Self: Sized, Self::Item: Clone + Eq + Hash,

    Return an iterator adaptor that filters out elements that have already been produced once during the iteration. Duplicates -are detected using hash and equality. Read more
    source§

    fn unique_by<V, F>(self, f: F) -> UniqueBy<Self, V, F> ⓘ
    where +are detected using hash and equality. Read more

    source§

    fn unique_by<V, F>(self, f: F) -> UniqueBy<Self, V, F> ⓘ
    where Self: Sized, V: Eq + Hash, F: FnMut(&Self::Item) -> V,

    Return an iterator adaptor that filters out elements that have -already been produced once during the iteration. Read more
    source§

    fn peeking_take_while<F>(&mut self, accept: F) -> PeekingTakeWhile<'_, Self, F> ⓘ
    where +already been produced once during the iteration. Read more

    source§

    fn peeking_take_while<F>(&mut self, accept: F) -> PeekingTakeWhile<'_, Self, F> ⓘ
    where Self: Sized + PeekingNext, F: FnMut(&Self::Item) -> bool,

    Return an iterator adaptor that borrows from this iterator and -takes items while the closure accept returns true. Read more
    source§

    fn take_while_ref<F>(&mut self, accept: F) -> TakeWhileRef<'_, Self, F> ⓘ
    where +takes items while the closure accept returns true. Read more

    source§

    fn take_while_ref<F>(&mut self, accept: F) -> TakeWhileRef<'_, Self, F> ⓘ
    where Self: Clone, F: FnMut(&Self::Item) -> bool,

    Return an iterator adaptor that borrows from a Clone-able iterator -to only pick off elements while the predicate accept returns true. Read more
    source§

    fn take_while_inclusive<F>(self, accept: F) -> TakeWhileInclusive<Self, F> ⓘ
    where +to only pick off elements while the predicate accept returns true. Read more

    source§

    fn take_while_inclusive<F>(self, accept: F) -> TakeWhileInclusive<Self, F> ⓘ
    where Self: Sized, F: FnMut(&Self::Item) -> bool,

    Returns an iterator adaptor that consumes elements while the given predicate is true, including the element for which the predicate -first returned false. Read more
    source§

    fn while_some<A>(self) -> WhileSome<Self> ⓘ
    where +first returned false. Read more

    source§

    fn while_some<A>(self) -> WhileSome<Self> ⓘ
    where Self: Sized + Iterator<Item = Option<A>>,

    Return an iterator adaptor that filters Option<A> iterator elements -and produces A. Stops on the first None encountered. Read more
    source§

    fn tuple_combinations<T>(self) -> TupleCombinations<Self, T> ⓘ
    where +and produces A. Stops on the first None encountered. Read more

    source§

    fn tuple_combinations<T>(self) -> TupleCombinations<Self, T> ⓘ
    where Self: Sized + Clone, Self::Item: Clone, T: HasCombination<Self>,

    Return an iterator adaptor that iterates over the combinations of the -elements from an iterator. Read more
    source§

    fn combinations(self, k: usize) -> Combinations<Self> ⓘ
    where +elements from an iterator. Read more

    source§

    fn combinations(self, k: usize) -> Combinations<Self> ⓘ
    where Self: Sized, Self::Item: Clone,

    Return an iterator adaptor that iterates over the k-length combinations of -the elements from an iterator. Read more
    source§

    fn combinations_with_replacement( +the elements from an iterator. Read more

    source§

    fn combinations_with_replacement( self, k: usize ) -> CombinationsWithReplacement<Self> ⓘ
    where Self: Sized, Self::Item: Clone,

    Return an iterator that iterates over the k-length combinations of -the elements from an iterator, with replacement. Read more
    source§

    fn permutations(self, k: usize) -> Permutations<Self> ⓘ
    where +the elements from an iterator, with replacement. Read more

    source§

    fn permutations(self, k: usize) -> Permutations<Self> ⓘ
    where Self: Sized, Self::Item: Clone,

    Return an iterator adaptor that iterates over all k-permutations of the -elements from an iterator. Read more
    source§

    fn powerset(self) -> Powerset<Self> ⓘ
    where +elements from an iterator. Read more

    source§

    fn powerset(self) -> Powerset<Self> ⓘ
    where Self: Sized, Self::Item: Clone,

    Return an iterator that iterates through the powerset of the elements from an -iterator. Read more
    source§

    fn pad_using<F>(self, min: usize, f: F) -> PadUsing<Self, F> ⓘ
    where +iterator. Read more

    source§

    fn pad_using<F>(self, min: usize, f: F) -> PadUsing<Self, F> ⓘ
    where Self: Sized, F: FnMut(usize) -> Self::Item,

    Return an iterator adaptor that pads the sequence to a minimum length of -min by filling missing elements using a closure f. Read more
    source§

    fn with_position(self) -> WithPosition<Self> ⓘ
    where +min by filling missing elements using a closure f. Read more

    source§

    fn with_position(self) -> WithPosition<Self> ⓘ
    where Self: Sized,

    Return an iterator adaptor that combines each element with a Position to -ease special-case handling of the first or last elements. Read more
    source§

    fn positions<P>(self, predicate: P) -> Positions<Self, P> ⓘ
    where +ease special-case handling of the first or last elements. Read more

    source§

    fn positions<P>(self, predicate: P) -> Positions<Self, P> ⓘ
    where Self: Sized, P: FnMut(Self::Item) -> bool,

    Return an iterator adaptor that yields the indices of all elements -satisfying a predicate, counted from the start of the iterator. Read more
    source§

    fn update<F>(self, updater: F) -> Update<Self, F> ⓘ
    where +satisfying a predicate, counted from the start of the iterator. Read more

    source§

    fn update<F>(self, updater: F) -> Update<Self, F> ⓘ
    where Self: Sized, F: FnMut(&mut Self::Item),

    Return an iterator adaptor that applies a mutating function -to each element before yielding it. Read more
    source§

    fn next_tuple<T>(&mut self) -> Option<T>
    where +to each element before yielding it. Read more

    source§

    fn next_tuple<T>(&mut self) -> Option<T>
    where Self: Sized + Iterator<Item = T::Item>, T: HomogeneousTuple,

    Advances the iterator and returns the next items grouped in a tuple of -a specific size (up to 12). Read more
    source§

    fn collect_tuple<T>(self) -> Option<T>
    where +a specific size (up to 12). Read more

    source§

    fn collect_tuple<T>(self) -> Option<T>
    where Self: Sized + Iterator<Item = T::Item>, T: HomogeneousTuple,

    Collects all items from the iterator into a tuple of a specific size -(up to 12). Read more
    source§

    fn find_position<P>(&mut self, pred: P) -> Option<(usize, Self::Item)>
    where - P: FnMut(&Self::Item) -> bool,

    Find the position and value of the first element satisfying a predicate. Read more
    source§

    fn find_or_last<P>(self, predicate: P) -> Option<Self::Item>
    where +(up to 12). Read more

    source§

    fn find_position<P>(&mut self, pred: P) -> Option<(usize, Self::Item)>
    where + P: FnMut(&Self::Item) -> bool,

    Find the position and value of the first element satisfying a predicate. Read more
    source§

    fn find_or_last<P>(self, predicate: P) -> Option<Self::Item>
    where Self: Sized, - P: FnMut(&Self::Item) -> bool,

    Find the value of the first element satisfying a predicate or return the last element, if any. Read more
    source§

    fn find_or_first<P>(self, predicate: P) -> Option<Self::Item>
    where + P: FnMut(&Self::Item) -> bool,

    Find the value of the first element satisfying a predicate or return the last element, if any. Read more
    source§

    fn find_or_first<P>(self, predicate: P) -> Option<Self::Item>
    where Self: Sized, - P: FnMut(&Self::Item) -> bool,

    Find the value of the first element satisfying a predicate or return the first element, if any. Read more
    source§

    fn contains<Q>(&mut self, query: &Q) -> bool
    where + P: FnMut(&Self::Item) -> bool,

    Find the value of the first element satisfying a predicate or return the first element, if any. Read more
    source§

    fn contains<Q>(&mut self, query: &Q) -> bool
    where Self: Sized, Self::Item: Borrow<Q>, - Q: PartialEq,

    Returns true if the given item is present in this iterator. Read more
    source§

    fn all_equal(&mut self) -> bool
    where + Q: PartialEq,

    Returns true if the given item is present in this iterator. Read more
    source§

    fn all_equal(&mut self) -> bool
    where Self: Sized, - Self::Item: PartialEq,

    Check whether all elements compare equal. Read more
    source§

    fn all_equal_value( + Self::Item: PartialEq,

    Check whether all elements compare equal. Read more
    source§

    fn all_equal_value( &mut self ) -> Result<Self::Item, Option<(Self::Item, Self::Item)>>
    where Self: Sized, Self::Item: PartialEq,

    If there are elements and they are all equal, return a single copy of that element. If there are no elements, return an Error containing None. If there are elements and they are not all equal, return a tuple containing the first -two non-equal elements found. Read more
    source§

    fn all_unique(&mut self) -> bool
    where +two non-equal elements found. Read more

    source§

    fn all_unique(&mut self) -> bool
    where Self: Sized, - Self::Item: Eq + Hash,

    Check whether all elements are unique (non equal). Read more
    source§

    fn dropping(self, n: usize) -> Self
    where + Self::Item: Eq + Hash,

    Check whether all elements are unique (non equal). Read more
    source§

    fn dropping(self, n: usize) -> Self
    where Self: Sized,

    Consume the first n elements from the iterator eagerly, -and return the same iterator again. Read more
    source§

    fn dropping_back(self, n: usize) -> Self
    where +and return the same iterator again. Read more

    source§

    fn dropping_back(self, n: usize) -> Self
    where Self: Sized + DoubleEndedIterator,

    Consume the last n elements from the iterator eagerly, -and return the same iterator again. Read more
    source§

    fn foreach<F>(self, f: F)
    where - F: FnMut(Self::Item), - Self: Sized,

    👎Deprecated since 0.8.0: Use .for_each() instead
    Run the closure f eagerly on each element of the iterator. Read more
    source§

    fn concat(self) -> Self::Item
    where +and return the same iterator again. Read more

    source§

    fn concat(self) -> Self::Item
    where Self: Sized, - Self::Item: Extend<<<Self as Iterator>::Item as IntoIterator>::Item> + IntoIterator + Default,

    Combine all an iterator’s elements into one element by using Extend. Read more
    source§

    fn collect_vec(self) -> Vec<Self::Item>
    where + Self::Item: Extend<<<Self as Iterator>::Item as IntoIterator>::Item> + IntoIterator + Default,

    Combine all an iterator’s elements into one element by using Extend. Read more
    source§

    fn collect_vec(self) -> Vec<Self::Item>
    where Self: Sized,

    .collect_vec() is simply a type specialization of Iterator::collect, -for convenience.
    source§

    fn try_collect<T, U, E>(self) -> Result<U, E>
    where +for convenience.

    source§

    fn try_collect<T, U, E>(self) -> Result<U, E>
    where Self: Sized + Iterator<Item = Result<T, E>>, Result<U, E>: FromIterator<Result<T, E>>,

    .try_collect() is more convenient way of writing -.collect::<Result<_, _>>() Read more
    source§

    fn set_from<'a, A: 'a, J>(&mut self, from: J) -> usize
    where +.collect::<Result<_, _>>() Read more

    source§

    fn set_from<'a, A: 'a, J>(&mut self, from: J) -> usize
    where Self: Iterator<Item = &'a mut A>, J: IntoIterator<Item = A>,

    Assign to each reference in self from the from iterator, -stopping at the shortest of the two iterators. Read more
    source§

    fn join(&mut self, sep: &str) -> String
    where - Self::Item: Display,

    Combine all iterator elements into one String, separated by sep. Read more
    source§

    fn format(self, sep: &str) -> Format<'_, Self>
    where - Self: Sized,

    Format all iterator elements, separated by sep. Read more
    source§

    fn format_with<F>(self, sep: &str, format: F) -> FormatWith<'_, Self, F>
    where +stopping at the shortest of the two iterators. Read more

    source§

    fn join(&mut self, sep: &str) -> String
    where + Self::Item: Display,

    Combine all iterator elements into one String, separated by sep. Read more
    source§

    fn format(self, sep: &str) -> Format<'_, Self>
    where + Self: Sized,

    Format all iterator elements, separated by sep. Read more
    source§

    fn format_with<F>(self, sep: &str, format: F) -> FormatWith<'_, Self, F>
    where Self: Sized, - F: FnMut(Self::Item, &mut dyn FnMut(&dyn Display) -> Result) -> Result,

    Format all iterator elements, separated by sep. Read more
    source§

    fn fold_results<A, E, B, F>(&mut self, start: B, f: F) -> Result<B, E>
    where + F: FnMut(Self::Item, &mut dyn FnMut(&dyn Display) -> Result) -> Result,

    Format all iterator elements, separated by sep. Read more
    source§

    fn fold_ok<A, E, B, F>(&mut self, start: B, f: F) -> Result<B, E>
    where Self: Iterator<Item = Result<A, E>>, - F: FnMut(B, A) -> B,

    👎Deprecated since 0.10.0: Use .fold_ok() instead
    See .fold_ok().
    source§

    fn fold_ok<A, E, B, F>(&mut self, start: B, f: F) -> Result<B, E>
    where - Self: Iterator<Item = Result<A, E>>, - F: FnMut(B, A) -> B,

    Fold Result values from an iterator. Read more
    source§

    fn fold_options<A, B, F>(&mut self, start: B, f: F) -> Option<B>
    where + F: FnMut(B, A) -> B,

    Fold Result values from an iterator. Read more
    source§

    fn fold_options<A, B, F>(&mut self, start: B, f: F) -> Option<B>
    where Self: Iterator<Item = Option<A>>, - F: FnMut(B, A) -> B,

    Fold Option values from an iterator. Read more
    source§

    fn fold1<F>(self, f: F) -> Option<Self::Item>
    where + F: FnMut(B, A) -> B,

    Fold Option values from an iterator. Read more
    source§

    fn fold1<F>(self, f: F) -> Option<Self::Item>
    where F: FnMut(Self::Item, Self::Item) -> Self::Item, - Self: Sized,

    👎Deprecated since 0.10.2: Use Iterator::reduce instead
    Accumulator of the elements in the iterator. Read more
    source§

    fn tree_fold1<F>(self, f: F) -> Option<Self::Item>
    where + Self: Sized,

    👎Deprecated since 0.10.2: Use Iterator::reduce instead
    Accumulator of the elements in the iterator. Read more
    source§

    fn tree_reduce<F>(self, f: F) -> Option<Self::Item>
    where F: FnMut(Self::Item, Self::Item) -> Self::Item, - Self: Sized,

    Accumulate the elements in the iterator in a tree-like manner. Read more
    source§

    fn fold_while<B, F>(&mut self, init: B, f: F) -> FoldWhile<B>
    where + Self: Sized,

    Accumulate the elements in the iterator in a tree-like manner. Read more
    source§

    fn tree_fold1<F>(self, f: F) -> Option<Self::Item>
    where + F: FnMut(Self::Item, Self::Item) -> Self::Item, + Self: Sized,

    👎Deprecated since 0.13.0: Use .tree_reduce() instead
    See .tree_reduce().
    source§

    fn fold_while<B, F>(&mut self, init: B, f: F) -> FoldWhile<B>
    where Self: Sized, - F: FnMut(B, Self::Item) -> FoldWhile<B>,

    An iterator method that applies a function, producing a single, final value. Read more
    source§

    fn sum1<S>(self) -> Option<S>
    where + F: FnMut(B, Self::Item) -> FoldWhile<B>,

    An iterator method that applies a function, producing a single, final value. Read more
    source§

    fn sum1<S>(self) -> Option<S>
    where Self: Sized, - S: Sum<Self::Item>,

    Iterate over the entire iterator and add all the elements. Read more
    source§

    fn product1<P>(self) -> Option<P>
    where + S: Sum<Self::Item>,

    Iterate over the entire iterator and add all the elements. Read more
    source§

    fn product1<P>(self) -> Option<P>
    where Self: Sized, - P: Product<Self::Item>,

    Iterate over the entire iterator and multiply all the elements. Read more
    source§

    fn sorted_unstable(self) -> IntoIter<Self::Item> ⓘ
    where + P: Product<Self::Item>,

    Iterate over the entire iterator and multiply all the elements. Read more
    source§

    fn sorted_unstable(self) -> IntoIter<Self::Item> ⓘ
    where Self: Sized, - Self::Item: Ord,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_unstable_by<F>(self, cmp: F) -> IntoIter<Self::Item> ⓘ
    where + Self::Item: Ord,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_unstable_by<F>(self, cmp: F) -> IntoIter<Self::Item> ⓘ
    where Self: Sized, - F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_unstable_by_key<K, F>(self, f: F) -> IntoIter<Self::Item> ⓘ
    where + F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_unstable_by_key<K, F>(self, f: F) -> IntoIter<Self::Item> ⓘ
    where Self: Sized, K: Ord, - F: FnMut(&Self::Item) -> K,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted(self) -> IntoIter<Self::Item> ⓘ
    where + F: FnMut(&Self::Item) -> K,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted(self) -> IntoIter<Self::Item> ⓘ
    where Self: Sized, - Self::Item: Ord,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_by<F>(self, cmp: F) -> IntoIter<Self::Item> ⓘ
    where + Self::Item: Ord,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_by<F>(self, cmp: F) -> IntoIter<Self::Item> ⓘ
    where Self: Sized, - F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_by_key<K, F>(self, f: F) -> IntoIter<Self::Item> ⓘ
    where + F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_by_key<K, F>(self, f: F) -> IntoIter<Self::Item> ⓘ
    where Self: Sized, K: Ord, - F: FnMut(&Self::Item) -> K,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_by_cached_key<K, F>(self, f: F) -> IntoIter<Self::Item> ⓘ
    where + F: FnMut(&Self::Item) -> K,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_by_cached_key<K, F>(self, f: F) -> IntoIter<Self::Item> ⓘ
    where Self: Sized, K: Ord, F: FnMut(&Self::Item) -> K,

    Sort all iterator elements into a new iterator in ascending order. The key function is -called exactly once per key. Read more
    source§

    fn k_smallest(self, k: usize) -> IntoIter<Self::Item> ⓘ
    where +called exactly once per key. Read more

    source§

    fn k_smallest(self, k: usize) -> IntoIter<Self::Item> ⓘ
    where Self: Sized, - Self::Item: Ord,

    Sort the k smallest elements into a new iterator, in ascending order. Read more
    source§

    fn partition_map<A, B, F, L, R>(self, predicate: F) -> (A, B)
    where + Self::Item: Ord,

    Sort the k smallest elements into a new iterator, in ascending order. Read more
    source§

    fn k_smallest_by<F>(self, k: usize, cmp: F) -> IntoIter<Self::Item> ⓘ
    where + Self: Sized, + F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Sort the k smallest elements into a new iterator using the provided comparison. Read more
    source§

    fn k_smallest_by_key<F, K>(self, k: usize, key: F) -> IntoIter<Self::Item> ⓘ
    where + Self: Sized, + F: FnMut(&Self::Item) -> K, + K: Ord,

    Return the elements producing the k smallest outputs of the provided function. Read more
    source§

    fn k_largest(self, k: usize) -> IntoIter<Self::Item> ⓘ
    where + Self: Sized, + Self::Item: Ord,

    Sort the k largest elements into a new iterator, in descending order. Read more
    source§

    fn k_largest_by<F>(self, k: usize, cmp: F) -> IntoIter<Self::Item> ⓘ
    where + Self: Sized, + F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Sort the k largest elements into a new iterator using the provided comparison. Read more
    source§

    fn k_largest_by_key<F, K>(self, k: usize, key: F) -> IntoIter<Self::Item> ⓘ
    where + Self: Sized, + F: FnMut(&Self::Item) -> K, + K: Ord,

    Return the elements producing the k largest outputs of the provided function. Read more
    source§

    fn tail(self, n: usize) -> IntoIter<Self::Item> ⓘ
    where + Self: Sized,

    Consumes the iterator and return an iterator of the last n elements. Read more
    source§

    fn partition_map<A, B, F, L, R>(self, predicate: F) -> (A, B)
    where Self: Sized, F: FnMut(Self::Item) -> Either<L, R>, A: Default + Extend<L>, B: Default + Extend<R>,

    Collect all iterator elements into one of two partitions. Unlike Iterator::partition, each partition may -have a distinct type. Read more
    source§

    fn partition_result<A, B, T, E>(self) -> (A, B)
    where +have a distinct type. Read more

    source§

    fn partition_result<A, B, T, E>(self) -> (A, B)
    where Self: Iterator<Item = Result<T, E>> + Sized, A: Default + Extend<T>, B: Default + Extend<E>,

    Partition a sequence of Results into one list of all the Ok elements -and another list of all the Err elements. Read more
    source§

    fn into_group_map<K, V>(self) -> HashMap<K, Vec<V>>
    where +and another list of all the Err elements. Read more

    source§

    fn into_group_map<K, V>(self) -> HashMap<K, Vec<V>>
    where Self: Iterator<Item = (K, V)> + Sized, K: Hash + Eq,

    Return a HashMap of keys mapped to Vecs of values. Keys and values -are taken from (Key, Value) tuple pairs yielded by the input iterator. Read more
    source§

    fn into_group_map_by<K, V, F>(self, f: F) -> HashMap<K, Vec<V>>
    where +are taken from (Key, Value) tuple pairs yielded by the input iterator. Read more

    source§

    fn into_group_map_by<K, V, F>(self, f: F) -> HashMap<K, Vec<V>>
    where Self: Iterator<Item = V> + Sized, K: Hash + Eq, - F: Fn(&V) -> K,

    Return an Iterator on a HashMap. Keys mapped to Vecs of values. The key is specified -in the closure. Read more
    source§

    fn into_grouping_map<K, V>(self) -> GroupingMap<Self>
    where + F: FnMut(&V) -> K,

    Return an Iterator on a HashMap. Keys mapped to Vecs of values. The key is specified +in the closure. Read more
    source§

    fn into_grouping_map<K, V>(self) -> GroupingMap<Self>
    where Self: Iterator<Item = (K, V)> + Sized, K: Hash + Eq,

    Constructs a GroupingMap to be used later with one of the efficient -group-and-fold operations it allows to perform. Read more
    source§

    fn into_grouping_map_by<K, V, F>(self, key_mapper: F) -> GroupingMapBy<Self, F>
    where +group-and-fold operations it allows to perform. Read more

    source§

    fn into_grouping_map_by<K, V, F>(self, key_mapper: F) -> GroupingMapBy<Self, F>
    where Self: Iterator<Item = V> + Sized, K: Hash + Eq, F: FnMut(&V) -> K,

    Constructs a GroupingMap to be used later with one of the efficient -group-and-fold operations it allows to perform. Read more
    source§

    fn min_set(self) -> Vec<Self::Item>
    where +group-and-fold operations it allows to perform. Read more

    source§

    fn min_set(self) -> Vec<Self::Item>
    where Self: Sized, - Self::Item: Ord,

    Return all minimum elements of an iterator. Read more
    source§

    fn min_set_by<F>(self, compare: F) -> Vec<Self::Item>
    where + Self::Item: Ord,

    Return all minimum elements of an iterator. Read more
    source§

    fn min_set_by<F>(self, compare: F) -> Vec<Self::Item>
    where Self: Sized, F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Return all minimum elements of an iterator, as determined by -the specified function. Read more
    source§

    fn min_set_by_key<K, F>(self, key: F) -> Vec<Self::Item>
    where +the specified function. Read more

    source§

    fn min_set_by_key<K, F>(self, key: F) -> Vec<Self::Item>
    where Self: Sized, K: Ord, F: FnMut(&Self::Item) -> K,

    Return all minimum elements of an iterator, as determined by -the specified function. Read more
    source§

    fn max_set(self) -> Vec<Self::Item>
    where +the specified function. Read more

    source§

    fn max_set(self) -> Vec<Self::Item>
    where Self: Sized, - Self::Item: Ord,

    Return all maximum elements of an iterator. Read more
    source§

    fn max_set_by<F>(self, compare: F) -> Vec<Self::Item>
    where + Self::Item: Ord,

    Return all maximum elements of an iterator. Read more
    source§

    fn max_set_by<F>(self, compare: F) -> Vec<Self::Item>
    where Self: Sized, F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Return all maximum elements of an iterator, as determined by -the specified function. Read more
    source§

    fn max_set_by_key<K, F>(self, key: F) -> Vec<Self::Item>
    where +the specified function. Read more

    source§

    fn max_set_by_key<K, F>(self, key: F) -> Vec<Self::Item>
    where Self: Sized, K: Ord, F: FnMut(&Self::Item) -> K,

    Return all maximum elements of an iterator, as determined by -the specified function. Read more
    source§

    fn minmax(self) -> MinMaxResult<Self::Item>
    where +the specified function. Read more

    source§

    fn minmax(self) -> MinMaxResult<Self::Item>
    where Self: Sized, - Self::Item: PartialOrd,

    Return the minimum and maximum elements in the iterator. Read more
    source§

    fn minmax_by_key<K, F>(self, key: F) -> MinMaxResult<Self::Item>
    where + Self::Item: PartialOrd,

    Return the minimum and maximum elements in the iterator. Read more
    source§

    fn minmax_by_key<K, F>(self, key: F) -> MinMaxResult<Self::Item>
    where Self: Sized, K: PartialOrd, F: FnMut(&Self::Item) -> K,

    Return the minimum and maximum element of an iterator, as determined by -the specified function. Read more
    source§

    fn minmax_by<F>(self, compare: F) -> MinMaxResult<Self::Item>
    where +the specified function. Read more

    source§

    fn minmax_by<F>(self, compare: F) -> MinMaxResult<Self::Item>
    where Self: Sized, F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Return the minimum and maximum element of an iterator, as determined by -the specified comparison function. Read more
    source§

    fn position_max(self) -> Option<usize>
    where +the specified comparison function. Read more

    source§

    fn position_max(self) -> Option<usize>
    where Self: Sized, - Self::Item: Ord,

    Return the position of the maximum element in the iterator. Read more
    source§

    fn position_max_by_key<K, F>(self, key: F) -> Option<usize>
    where + Self::Item: Ord,

    Return the position of the maximum element in the iterator. Read more
    source§

    fn position_max_by_key<K, F>(self, key: F) -> Option<usize>
    where Self: Sized, K: Ord, F: FnMut(&Self::Item) -> K,

    Return the position of the maximum element in the iterator, as -determined by the specified function. Read more
    source§

    fn position_max_by<F>(self, compare: F) -> Option<usize>
    where +determined by the specified function. Read more

    source§

    fn position_max_by<F>(self, compare: F) -> Option<usize>
    where Self: Sized, F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Return the position of the maximum element in the iterator, as -determined by the specified comparison function. Read more
    source§

    fn position_min(self) -> Option<usize>
    where +determined by the specified comparison function. Read more

    source§

    fn position_min(self) -> Option<usize>
    where Self: Sized, - Self::Item: Ord,

    Return the position of the minimum element in the iterator. Read more
    source§

    fn position_min_by_key<K, F>(self, key: F) -> Option<usize>
    where + Self::Item: Ord,

    Return the position of the minimum element in the iterator. Read more
    source§

    fn position_min_by_key<K, F>(self, key: F) -> Option<usize>
    where Self: Sized, K: Ord, F: FnMut(&Self::Item) -> K,

    Return the position of the minimum element in the iterator, as -determined by the specified function. Read more
    source§

    fn position_min_by<F>(self, compare: F) -> Option<usize>
    where +determined by the specified function. Read more

    source§

    fn position_min_by<F>(self, compare: F) -> Option<usize>
    where Self: Sized, F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Return the position of the minimum element in the iterator, as -determined by the specified comparison function. Read more
    source§

    fn position_minmax(self) -> MinMaxResult<usize>
    where +determined by the specified comparison function. Read more

    source§

    fn position_minmax(self) -> MinMaxResult<usize>
    where Self: Sized, Self::Item: PartialOrd,

    Return the positions of the minimum and maximum elements in -the iterator. Read more
    source§

    fn position_minmax_by_key<K, F>(self, key: F) -> MinMaxResult<usize>
    where +the iterator. Read more

    source§

    fn position_minmax_by_key<K, F>(self, key: F) -> MinMaxResult<usize>
    where Self: Sized, K: PartialOrd, F: FnMut(&Self::Item) -> K,

    Return the postions of the minimum and maximum elements of an -iterator, as determined by the specified function. Read more
    source§

    fn position_minmax_by<F>(self, compare: F) -> MinMaxResult<usize>
    where +iterator, as determined by the specified function. Read more

    source§

    fn position_minmax_by<F>(self, compare: F) -> MinMaxResult<usize>
    where Self: Sized, F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Return the postions of the minimum and maximum elements of an -iterator, as determined by the specified comparison function. Read more
    source§

    fn exactly_one(self) -> Result<Self::Item, ExactlyOneError<Self>>
    where +iterator, as determined by the specified comparison function. Read more

    source§

    fn exactly_one(self) -> Result<Self::Item, ExactlyOneError<Self>>
    where Self: Sized,

    If the iterator yields exactly one element, that element will be returned, otherwise an error will be returned containing an iterator that has the same output as the input -iterator. Read more
    source§

    fn at_most_one(self) -> Result<Option<Self::Item>, ExactlyOneError<Self>>
    where - Self: Sized,

    If the iterator yields no elements, Ok(None) will be returned. If the iterator yields +iterator. Read more
    source§

    fn at_most_one(self) -> Result<Option<Self::Item>, ExactlyOneError<Self>>
    where + Self: Sized,

    If the iterator yields no elements, Ok(None) will be returned. If the iterator yields exactly one element, that element will be returned, otherwise an error will be returned -containing an iterator that has the same output as the input iterator. Read more
    source§

    fn multipeek(self) -> MultiPeek<Self> ⓘ
    where +containing an iterator that has the same output as the input iterator. Read more

    source§

    fn multipeek(self) -> MultiPeek<Self> ⓘ
    where Self: Sized,

    An iterator adaptor that allows the user to peek at multiple .next() -values without advancing the base iterator. Read more
    source§

    fn counts(self) -> HashMap<Self::Item, usize>
    where +values without advancing the base iterator. Read more

    source§

    fn counts(self) -> HashMap<Self::Item, usize>
    where Self: Sized, Self::Item: Eq + Hash,

    Collect the items in this iterator and return a HashMap which contains each item that appears in the iterator and the number -of times it appears. Read more
    source§

    fn counts_by<K, F>(self, f: F) -> HashMap<K, usize>
    where +of times it appears. Read more

    source§

    fn counts_by<K, F>(self, f: F) -> HashMap<K, usize>
    where Self: Sized, K: Eq + Hash, F: FnMut(Self::Item) -> K,

    Collect the items in this iterator and return a HashMap which contains each item that appears in the iterator and the number of times it appears, -determining identity using a keying function. Read more
    source§

    fn multiunzip<FromI>(self) -> FromI
    where - Self: Sized + MultiUnzip<FromI>,

    Converts an iterator of tuples into a tuple of containers. Read more
    source§

    fn try_len(&self) -> Result<usize, (usize, Option<usize>)>

    Returns the length of the iterator if one exists. +determining identity using a keying function. Read more
    source§

    fn multiunzip<FromI>(self) -> FromI
    where + Self: Sized + MultiUnzip<FromI>,

    Converts an iterator of tuples into a tuple of containers. Read more
    source§

    fn try_len(&self) -> Result<usize, (usize, Option<usize>)>

    Returns the length of the iterator if one exists. Otherwise return self.size_hint(). Read more
    source§

    impl<IT> MultiUnzip<()> for IT
    where IT: Iterator<Item = ()>,

    source§

    fn multiunzip(self)

    Unzip this iterator into multiple collections.
    source§

    impl<IT, A, FromA> MultiUnzip<(FromA,)> for IT
    where IT: Iterator<Item = (A,)>, @@ -690,4 +702,4 @@ Otherwise return self.size_hint(). (FromA, FromB, FromC, FromD, FromE, FromF, FromG, FromH, FromI, FromJ, FromK, FromL)

    Unzip this iterator into multiple collections.
    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 + 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/itertools/structs/struct.RcIter.html b/itertools/structs/struct.RcIter.html index 82caf14eb..8336b0806 100644 --- a/itertools/structs/struct.RcIter.html +++ b/itertools/structs/struct.RcIter.html @@ -1,4 +1,4 @@ -RcIter in itertools::structs - Rust
    +RcIter in itertools::structs - Rust

    Struct itertools::structs::RcIter

    source · 
    pub struct RcIter<I> {
     pub rciter: Rc<RefCell<I>>,
 }
    Expand description

    A wrapper for Rc<RefCell<I>>, that implements the Iterator trait.

    @@ -211,86 +211,87 @@ otherwise. Right variant of Either<Self, Self> otherwise. Read more
    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> Itertools for T
    where - T: Iterator + ?Sized,

    source§

    fn interleave<J>(self, other: J) -> Interleave<Self, J::IntoIter> ⓘ
    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> Itertools for T
    where + T: Iterator + ?Sized,

    source§

    fn interleave<J>(self, other: J) -> Interleave<Self, J::IntoIter> ⓘ
    where J: IntoIterator<Item = Self::Item>, - Self: Sized,

    Alternate elements from two iterators until both have run out. Read more
    source§

    fn interleave_shortest<J>( + Self: Sized,

    Alternate elements from two iterators until both have run out. Read more
    source§

    fn interleave_shortest<J>( self, other: J ) -> InterleaveShortest<Self, J::IntoIter> ⓘ
    where J: IntoIterator<Item = Self::Item>, Self: Sized,

    Alternate elements from two iterators until at least one of them has run -out. Read more
    source§

    fn intersperse(self, element: Self::Item) -> Intersperse<Self>
    where +out. Read more

    source§

    fn intersperse(self, element: Self::Item) -> Intersperse<Self>
    where Self: Sized, Self::Item: Clone,

    An iterator adaptor to insert a particular value -between each element of the adapted iterator. Read more
    source§

    fn intersperse_with<F>(self, element: F) -> IntersperseWith<Self, F> ⓘ
    where +between each element of the adapted iterator. Read more

    source§

    fn intersperse_with<F>(self, element: F) -> IntersperseWith<Self, F> ⓘ
    where Self: Sized, F: FnMut() -> Self::Item,

    An iterator adaptor to insert a particular value created by a function -between each element of the adapted iterator. Read more
    source§

    fn zip_longest<J>(self, other: J) -> ZipLongest<Self, J::IntoIter> ⓘ
    where +between each element of the adapted iterator. Read more

    source§

    fn get<R>(self, index: R) -> R::Output
    where + Self: Sized, + R: IteratorIndex<Self>,

    Returns an iterator over a subsection of the iterator. Read more
    source§

    fn zip_longest<J>(self, other: J) -> ZipLongest<Self, J::IntoIter> ⓘ
    where J: IntoIterator, Self: Sized,

    Create an iterator which iterates over both this and the specified -iterator simultaneously, yielding pairs of two optional elements. Read more
    source§

    fn zip_eq<J>(self, other: J) -> ZipEq<Self, J::IntoIter> ⓘ
    where +iterator simultaneously, yielding pairs of two optional elements. Read more

    source§

    fn zip_eq<J>(self, other: J) -> ZipEq<Self, J::IntoIter> ⓘ
    where J: IntoIterator, Self: Sized,

    Create an iterator which iterates over both this and the specified -iterator simultaneously, yielding pairs of elements. Read more
    source§

    fn batching<B, F>(self, f: F) -> Batching<Self, F> ⓘ
    where +iterator simultaneously, yielding pairs of elements. Read more

    source§

    fn batching<B, F>(self, f: F) -> Batching<Self, F> ⓘ
    where F: FnMut(&mut Self) -> Option<B>, Self: Sized,

    A “meta iterator adaptor”. Its closure receives a reference to the iterator and may pick off as many elements as it likes, to produce the -next iterator element. Read more
    source§

    fn group_by<K, F>(self, key: F) -> GroupBy<K, Self, F>
    where +next iterator element. Read more

    source§

    fn chunk_by<K, F>(self, key: F) -> ChunkBy<K, Self, F>
    where Self: Sized, F: FnMut(&Self::Item) -> K, K: PartialEq,

    Return an iterable that can group iterator elements. Consecutive elements that map to the same key (“runs”), are assigned -to the same group. Read more
    source§

    fn chunks(self, size: usize) -> IntoChunks<Self>
    where - Self: Sized,

    Return an iterable that can chunk the iterator. Read more
    source§

    fn tuple_windows<T>(self) -> TupleWindows<Self, T> ⓘ
    where +to the same group. Read more

    source§

    fn group_by<K, F>(self, key: F) -> ChunkBy<K, Self, F>
    where + Self: Sized, + F: FnMut(&Self::Item) -> K, + K: PartialEq,

    👎Deprecated since 0.13.0: Use .chunk_by() instead
    See .chunk_by().
    source§

    fn chunks(self, size: usize) -> IntoChunks<Self>
    where + Self: Sized,

    Return an iterable that can chunk the iterator. Read more
    source§

    fn tuple_windows<T>(self) -> TupleWindows<Self, T> ⓘ
    where Self: Sized + Iterator<Item = T::Item>, T: HomogeneousTuple, T::Item: Clone,

    Return an iterator over all contiguous windows producing tuples of -a specific size (up to 12). Read more
    source§

    fn circular_tuple_windows<T>(self) -> CircularTupleWindows<Self, T> ⓘ
    where +a specific size (up to 12). Read more

    source§

    fn circular_tuple_windows<T>(self) -> CircularTupleWindows<Self, T> ⓘ
    where Self: Sized + Clone + Iterator<Item = T::Item> + ExactSizeIterator, T: TupleCollect + Clone, T::Item: Clone,

    Return an iterator over all windows, wrapping back to the first elements when the window would otherwise exceed the length of the -iterator, producing tuples of a specific size (up to 12). Read more
    source§

    fn tuples<T>(self) -> Tuples<Self, T> ⓘ
    where +iterator, producing tuples of a specific size (up to 12). Read more

    source§

    fn tuples<T>(self) -> Tuples<Self, T> ⓘ
    where Self: Sized + Iterator<Item = T::Item>, T: HomogeneousTuple,

    Return an iterator that groups the items in tuples of a specific size -(up to 12). Read more
    source§

    fn tee(self) -> (Tee<Self>, Tee<Self>)
    where +(up to 12). Read more

    source§

    fn tee(self) -> (Tee<Self>, Tee<Self>)
    where Self: Sized, Self::Item: Clone,

    Split into an iterator pair that both yield all elements from -the original iterator. Read more
    source§

    fn step(self, n: usize) -> Step<Self> ⓘ
    where - Self: Sized,

    👎Deprecated since 0.8.0: Use std .step_by() instead
    Return an iterator adaptor that steps n elements in the base iterator -for each iteration. Read more
    source§

    fn map_into<R>(self) -> MapInto<Self, R>
    where +the original iterator. Read more

    source§

    fn map_into<R>(self) -> MapInto<Self, R>
    where Self: Sized, - Self::Item: Into<R>,

    Convert each item of the iterator using the Into trait. Read more
    source§

    fn map_results<F, T, U, E>(self, f: F) -> MapOk<Self, F>
    where - Self: Iterator<Item = Result<T, E>> + Sized, - F: FnMut(T) -> U,

    👎Deprecated since 0.10.0: Use .map_ok() instead
    See .map_ok().
    source§

    fn map_ok<F, T, U, E>(self, f: F) -> MapOk<Self, F>
    where + Self::Item: Into<R>,

    Convert each item of the iterator using the Into trait. Read more
    source§

    fn map_ok<F, T, U, E>(self, f: F) -> MapOk<Self, F>
    where Self: Iterator<Item = Result<T, E>> + Sized, F: FnMut(T) -> U,

    Return an iterator adaptor that applies the provided closure to every Result::Ok value. Result::Err values are -unchanged. Read more
    source§

    fn filter_ok<F, T, E>(self, f: F) -> FilterOk<Self, F> ⓘ
    where +unchanged. Read more

    source§

    fn filter_ok<F, T, E>(self, f: F) -> FilterOk<Self, F> ⓘ
    where Self: Iterator<Item = Result<T, E>> + Sized, F: FnMut(&T) -> bool,

    Return an iterator adaptor that filters every Result::Ok value with the provided closure. Result::Err values are -unchanged. Read more
    source§

    fn filter_map_ok<F, T, U, E>(self, f: F) -> FilterMapOk<Self, F> ⓘ
    where +unchanged. Read more

    source§

    fn filter_map_ok<F, T, U, E>(self, f: F) -> FilterMapOk<Self, F> ⓘ
    where Self: Iterator<Item = Result<T, E>> + Sized, F: FnMut(T) -> Option<U>,

    Return an iterator adaptor that filters and transforms every Result::Ok value with the provided closure. Result::Err -values are unchanged. Read more
    source§

    fn flatten_ok<T, E>(self) -> FlattenOk<Self, T, E> ⓘ
    where +values are unchanged. Read more

    source§

    fn flatten_ok<T, E>(self) -> FlattenOk<Self, T, E> ⓘ
    where Self: Iterator<Item = Result<T, E>> + Sized, T: IntoIterator,

    Return an iterator adaptor that flattens every Result::Ok value into -a series of Result::Ok values. Result::Err values are unchanged. Read more
    source§

    fn process_results<F, T, E, R>(self, processor: F) -> Result<R, E>
    where +a series of Result::Ok values. Result::Err values are unchanged. Read more

    source§

    fn process_results<F, T, E, R>(self, processor: F) -> Result<R, E>
    where Self: Iterator<Item = Result<T, E>> + Sized, F: FnOnce(ProcessResults<'_, Self, E>) -> R,

    “Lift” a function of the values of the current iterator so as to process -an iterator of Result values instead. Read more
    source§

    fn merge<J>(self, other: J) -> Merge<Self, J::IntoIter>
    where +an iterator of Result values instead. Read more

    source§

    fn merge<J>(self, other: J) -> Merge<Self, J::IntoIter>
    where Self: Sized, Self::Item: PartialOrd, J: IntoIterator<Item = Self::Item>,

    Return an iterator adaptor that merges the two base iterators in ascending order. If both base iterators are sorted (ascending), the -result is sorted. Read more
    source§

    fn merge_by<J, F>(self, other: J, is_first: F) -> MergeBy<Self, J::IntoIter, F> ⓘ
    where +result is sorted. Read more

    source§

    fn merge_by<J, F>(self, other: J, is_first: F) -> MergeBy<Self, J::IntoIter, F> ⓘ
    where Self: Sized, J: IntoIterator<Item = Self::Item>, F: FnMut(&Self::Item, &Self::Item) -> bool,

    Return an iterator adaptor that merges the two base iterators in order. -This is much like .merge() but allows for a custom ordering. Read more
    source§

    fn merge_join_by<J, F, T>( +This is much like .merge() but allows for a custom ordering. Read more

    source§

    fn merge_join_by<J, F, T>( self, other: J, cmp_fn: F @@ -298,284 +299,295 @@ This is much like IntoIterator, F: FnMut(&Self::Item, &J::Item) -> T, Self: Sized,

    Create an iterator that merges items from both this and the specified -iterator in ascending order. Read more
    source§

    fn kmerge(self) -> KMerge<<Self::Item as IntoIterator>::IntoIter>
    where +iterator in ascending order. Read more

    source§

    fn kmerge(self) -> KMerge<<Self::Item as IntoIterator>::IntoIter>
    where Self: Sized, Self::Item: IntoIterator, <Self::Item as IntoIterator>::Item: PartialOrd,

    Return an iterator adaptor that flattens an iterator of iterators by -merging them in ascending order. Read more
    source§

    fn kmerge_by<F>( +merging them in ascending order. Read more

    source§

    fn kmerge_by<F>( self, first: F ) -> KMergeBy<<Self::Item as IntoIterator>::IntoIter, F> ⓘ
    where Self: Sized, Self::Item: IntoIterator, F: FnMut(&<Self::Item as IntoIterator>::Item, &<Self::Item as IntoIterator>::Item) -> bool,

    Return an iterator adaptor that flattens an iterator of iterators by -merging them according to the given closure. Read more
    source§

    fn cartesian_product<J>(self, other: J) -> Product<Self, J::IntoIter> ⓘ
    where +merging them according to the given closure. Read more

    source§

    fn cartesian_product<J>(self, other: J) -> Product<Self, J::IntoIter> ⓘ
    where Self: Sized, Self::Item: Clone, J: IntoIterator, J::IntoIter: Clone,

    Return an iterator adaptor that iterates over the cartesian product of -the element sets of two iterators self and J. Read more
    source§

    fn multi_cartesian_product( +the element sets of two iterators self and J. Read more

    source§

    fn multi_cartesian_product( self ) -> MultiProduct<<Self::Item as IntoIterator>::IntoIter> ⓘ
    where Self: Sized, Self::Item: IntoIterator, <Self::Item as IntoIterator>::IntoIter: Clone, <Self::Item as IntoIterator>::Item: Clone,

    Return an iterator adaptor that iterates over the cartesian product of -all subiterators returned by meta-iterator self. Read more
    source§

    fn coalesce<F>(self, f: F) -> Coalesce<Self, F>
    where +all subiterators returned by meta-iterator self. Read more

    source§

    fn coalesce<F>(self, f: F) -> Coalesce<Self, F>
    where Self: Sized, F: FnMut(Self::Item, Self::Item) -> Result<Self::Item, (Self::Item, Self::Item)>,

    Return an iterator adaptor that uses the passed-in closure to -optionally merge together consecutive elements. Read more
    source§

    fn dedup(self) -> Dedup<Self>
    where +optionally merge together consecutive elements. Read more

    source§

    fn dedup(self) -> Dedup<Self>
    where Self: Sized, Self::Item: PartialEq,

    Remove duplicates from sections of consecutive identical elements. -If the iterator is sorted, all elements will be unique. Read more
    source§

    fn dedup_by<Cmp>(self, cmp: Cmp) -> DedupBy<Self, Cmp>
    where +If the iterator is sorted, all elements will be unique. Read more

    source§

    fn dedup_by<Cmp>(self, cmp: Cmp) -> DedupBy<Self, Cmp>
    where Self: Sized, Cmp: FnMut(&Self::Item, &Self::Item) -> bool,

    Remove duplicates from sections of consecutive identical elements, determining equality using a comparison function. -If the iterator is sorted, all elements will be unique. Read more
    source§

    fn dedup_with_count(self) -> DedupWithCount<Self>
    where +If the iterator is sorted, all elements will be unique. Read more

    source§

    fn dedup_with_count(self) -> DedupWithCount<Self>
    where Self: Sized,

    Remove duplicates from sections of consecutive identical elements, while keeping a count of how many repeated elements were present. -If the iterator is sorted, all elements will be unique. Read more
    source§

    fn dedup_by_with_count<Cmp>(self, cmp: Cmp) -> DedupByWithCount<Self, Cmp>
    where +If the iterator is sorted, all elements will be unique. Read more

    source§

    fn dedup_by_with_count<Cmp>(self, cmp: Cmp) -> DedupByWithCount<Self, Cmp>
    where Self: Sized, Cmp: FnMut(&Self::Item, &Self::Item) -> bool,

    Remove duplicates from sections of consecutive identical elements, while keeping a count of how many repeated elements were present. This will determine equality using a comparison function. -If the iterator is sorted, all elements will be unique. Read more
    source§

    fn duplicates(self) -> Duplicates<Self>
    where +If the iterator is sorted, all elements will be unique. Read more

    source§

    fn duplicates(self) -> Duplicates<Self>
    where Self: Sized, Self::Item: Eq + Hash,

    Return an iterator adaptor that produces elements that appear more than once during the -iteration. Duplicates are detected using hash and equality. Read more
    source§

    fn duplicates_by<V, F>(self, f: F) -> DuplicatesBy<Self, V, F>
    where +iteration. Duplicates are detected using hash and equality. Read more

    source§

    fn duplicates_by<V, F>(self, f: F) -> DuplicatesBy<Self, V, F>
    where Self: Sized, V: Eq + Hash, F: FnMut(&Self::Item) -> V,

    Return an iterator adaptor that produces elements that appear more than once during the -iteration. Duplicates are detected using hash and equality. Read more
    source§

    fn unique(self) -> Unique<Self> ⓘ
    where +iteration. Duplicates are detected using hash and equality. Read more

    source§

    fn unique(self) -> Unique<Self> ⓘ
    where Self: Sized, Self::Item: Clone + Eq + Hash,

    Return an iterator adaptor that filters out elements that have already been produced once during the iteration. Duplicates -are detected using hash and equality. Read more
    source§

    fn unique_by<V, F>(self, f: F) -> UniqueBy<Self, V, F> ⓘ
    where +are detected using hash and equality. Read more

    source§

    fn unique_by<V, F>(self, f: F) -> UniqueBy<Self, V, F> ⓘ
    where Self: Sized, V: Eq + Hash, F: FnMut(&Self::Item) -> V,

    Return an iterator adaptor that filters out elements that have -already been produced once during the iteration. Read more
    source§

    fn peeking_take_while<F>(&mut self, accept: F) -> PeekingTakeWhile<'_, Self, F> ⓘ
    where +already been produced once during the iteration. Read more

    source§

    fn peeking_take_while<F>(&mut self, accept: F) -> PeekingTakeWhile<'_, Self, F> ⓘ
    where Self: Sized + PeekingNext, F: FnMut(&Self::Item) -> bool,

    Return an iterator adaptor that borrows from this iterator and -takes items while the closure accept returns true. Read more
    source§

    fn take_while_ref<F>(&mut self, accept: F) -> TakeWhileRef<'_, Self, F> ⓘ
    where +takes items while the closure accept returns true. Read more

    source§

    fn take_while_ref<F>(&mut self, accept: F) -> TakeWhileRef<'_, Self, F> ⓘ
    where Self: Clone, F: FnMut(&Self::Item) -> bool,

    Return an iterator adaptor that borrows from a Clone-able iterator -to only pick off elements while the predicate accept returns true. Read more
    source§

    fn take_while_inclusive<F>(self, accept: F) -> TakeWhileInclusive<Self, F> ⓘ
    where +to only pick off elements while the predicate accept returns true. Read more

    source§

    fn take_while_inclusive<F>(self, accept: F) -> TakeWhileInclusive<Self, F> ⓘ
    where Self: Sized, F: FnMut(&Self::Item) -> bool,

    Returns an iterator adaptor that consumes elements while the given predicate is true, including the element for which the predicate -first returned false. Read more
    source§

    fn while_some<A>(self) -> WhileSome<Self> ⓘ
    where +first returned false. Read more

    source§

    fn while_some<A>(self) -> WhileSome<Self> ⓘ
    where Self: Sized + Iterator<Item = Option<A>>,

    Return an iterator adaptor that filters Option<A> iterator elements -and produces A. Stops on the first None encountered. Read more
    source§

    fn tuple_combinations<T>(self) -> TupleCombinations<Self, T> ⓘ
    where +and produces A. Stops on the first None encountered. Read more

    source§

    fn tuple_combinations<T>(self) -> TupleCombinations<Self, T> ⓘ
    where Self: Sized + Clone, Self::Item: Clone, T: HasCombination<Self>,

    Return an iterator adaptor that iterates over the combinations of the -elements from an iterator. Read more
    source§

    fn combinations(self, k: usize) -> Combinations<Self> ⓘ
    where +elements from an iterator. Read more

    source§

    fn combinations(self, k: usize) -> Combinations<Self> ⓘ
    where Self: Sized, Self::Item: Clone,

    Return an iterator adaptor that iterates over the k-length combinations of -the elements from an iterator. Read more
    source§

    fn combinations_with_replacement( +the elements from an iterator. Read more

    source§

    fn combinations_with_replacement( self, k: usize ) -> CombinationsWithReplacement<Self> ⓘ
    where Self: Sized, Self::Item: Clone,

    Return an iterator that iterates over the k-length combinations of -the elements from an iterator, with replacement. Read more
    source§

    fn permutations(self, k: usize) -> Permutations<Self> ⓘ
    where +the elements from an iterator, with replacement. Read more

    source§

    fn permutations(self, k: usize) -> Permutations<Self> ⓘ
    where Self: Sized, Self::Item: Clone,

    Return an iterator adaptor that iterates over all k-permutations of the -elements from an iterator. Read more
    source§

    fn powerset(self) -> Powerset<Self> ⓘ
    where +elements from an iterator. Read more

    source§

    fn powerset(self) -> Powerset<Self> ⓘ
    where Self: Sized, Self::Item: Clone,

    Return an iterator that iterates through the powerset of the elements from an -iterator. Read more
    source§

    fn pad_using<F>(self, min: usize, f: F) -> PadUsing<Self, F> ⓘ
    where +iterator. Read more

    source§

    fn pad_using<F>(self, min: usize, f: F) -> PadUsing<Self, F> ⓘ
    where Self: Sized, F: FnMut(usize) -> Self::Item,

    Return an iterator adaptor that pads the sequence to a minimum length of -min by filling missing elements using a closure f. Read more
    source§

    fn with_position(self) -> WithPosition<Self> ⓘ
    where +min by filling missing elements using a closure f. Read more

    source§

    fn with_position(self) -> WithPosition<Self> ⓘ
    where Self: Sized,

    Return an iterator adaptor that combines each element with a Position to -ease special-case handling of the first or last elements. Read more
    source§

    fn positions<P>(self, predicate: P) -> Positions<Self, P> ⓘ
    where +ease special-case handling of the first or last elements. Read more

    source§

    fn positions<P>(self, predicate: P) -> Positions<Self, P> ⓘ
    where Self: Sized, P: FnMut(Self::Item) -> bool,

    Return an iterator adaptor that yields the indices of all elements -satisfying a predicate, counted from the start of the iterator. Read more
    source§

    fn update<F>(self, updater: F) -> Update<Self, F> ⓘ
    where +satisfying a predicate, counted from the start of the iterator. Read more

    source§

    fn update<F>(self, updater: F) -> Update<Self, F> ⓘ
    where Self: Sized, F: FnMut(&mut Self::Item),

    Return an iterator adaptor that applies a mutating function -to each element before yielding it. Read more
    source§

    fn next_tuple<T>(&mut self) -> Option<T>
    where +to each element before yielding it. Read more

    source§

    fn next_tuple<T>(&mut self) -> Option<T>
    where Self: Sized + Iterator<Item = T::Item>, T: HomogeneousTuple,

    Advances the iterator and returns the next items grouped in a tuple of -a specific size (up to 12). Read more
    source§

    fn collect_tuple<T>(self) -> Option<T>
    where +a specific size (up to 12). Read more

    source§

    fn collect_tuple<T>(self) -> Option<T>
    where Self: Sized + Iterator<Item = T::Item>, T: HomogeneousTuple,

    Collects all items from the iterator into a tuple of a specific size -(up to 12). Read more
    source§

    fn find_position<P>(&mut self, pred: P) -> Option<(usize, Self::Item)>
    where - P: FnMut(&Self::Item) -> bool,

    Find the position and value of the first element satisfying a predicate. Read more
    source§

    fn find_or_last<P>(self, predicate: P) -> Option<Self::Item>
    where +(up to 12). Read more

    source§

    fn find_position<P>(&mut self, pred: P) -> Option<(usize, Self::Item)>
    where + P: FnMut(&Self::Item) -> bool,

    Find the position and value of the first element satisfying a predicate. Read more
    source§

    fn find_or_last<P>(self, predicate: P) -> Option<Self::Item>
    where Self: Sized, - P: FnMut(&Self::Item) -> bool,

    Find the value of the first element satisfying a predicate or return the last element, if any. Read more
    source§

    fn find_or_first<P>(self, predicate: P) -> Option<Self::Item>
    where + P: FnMut(&Self::Item) -> bool,

    Find the value of the first element satisfying a predicate or return the last element, if any. Read more
    source§

    fn find_or_first<P>(self, predicate: P) -> Option<Self::Item>
    where Self: Sized, - P: FnMut(&Self::Item) -> bool,

    Find the value of the first element satisfying a predicate or return the first element, if any. Read more
    source§

    fn contains<Q>(&mut self, query: &Q) -> bool
    where + P: FnMut(&Self::Item) -> bool,

    Find the value of the first element satisfying a predicate or return the first element, if any. Read more
    source§

    fn contains<Q>(&mut self, query: &Q) -> bool
    where Self: Sized, Self::Item: Borrow<Q>, - Q: PartialEq,

    Returns true if the given item is present in this iterator. Read more
    source§

    fn all_equal(&mut self) -> bool
    where + Q: PartialEq,

    Returns true if the given item is present in this iterator. Read more
    source§

    fn all_equal(&mut self) -> bool
    where Self: Sized, - Self::Item: PartialEq,

    Check whether all elements compare equal. Read more
    source§

    fn all_equal_value( + Self::Item: PartialEq,

    Check whether all elements compare equal. Read more
    source§

    fn all_equal_value( &mut self ) -> Result<Self::Item, Option<(Self::Item, Self::Item)>>
    where Self: Sized, Self::Item: PartialEq,

    If there are elements and they are all equal, return a single copy of that element. If there are no elements, return an Error containing None. If there are elements and they are not all equal, return a tuple containing the first -two non-equal elements found. Read more
    source§

    fn all_unique(&mut self) -> bool
    where +two non-equal elements found. Read more

    source§

    fn all_unique(&mut self) -> bool
    where Self: Sized, - Self::Item: Eq + Hash,

    Check whether all elements are unique (non equal). Read more
    source§

    fn dropping(self, n: usize) -> Self
    where + Self::Item: Eq + Hash,

    Check whether all elements are unique (non equal). Read more
    source§

    fn dropping(self, n: usize) -> Self
    where Self: Sized,

    Consume the first n elements from the iterator eagerly, -and return the same iterator again. Read more
    source§

    fn dropping_back(self, n: usize) -> Self
    where +and return the same iterator again. Read more

    source§

    fn dropping_back(self, n: usize) -> Self
    where Self: Sized + DoubleEndedIterator,

    Consume the last n elements from the iterator eagerly, -and return the same iterator again. Read more
    source§

    fn foreach<F>(self, f: F)
    where - F: FnMut(Self::Item), - Self: Sized,

    👎Deprecated since 0.8.0: Use .for_each() instead
    Run the closure f eagerly on each element of the iterator. Read more
    source§

    fn concat(self) -> Self::Item
    where +and return the same iterator again. Read more

    source§

    fn concat(self) -> Self::Item
    where Self: Sized, - Self::Item: Extend<<<Self as Iterator>::Item as IntoIterator>::Item> + IntoIterator + Default,

    Combine all an iterator’s elements into one element by using Extend. Read more
    source§

    fn collect_vec(self) -> Vec<Self::Item>
    where + Self::Item: Extend<<<Self as Iterator>::Item as IntoIterator>::Item> + IntoIterator + Default,

    Combine all an iterator’s elements into one element by using Extend. Read more
    source§

    fn collect_vec(self) -> Vec<Self::Item>
    where Self: Sized,

    .collect_vec() is simply a type specialization of Iterator::collect, -for convenience.
    source§

    fn try_collect<T, U, E>(self) -> Result<U, E>
    where +for convenience.

    source§

    fn try_collect<T, U, E>(self) -> Result<U, E>
    where Self: Sized + Iterator<Item = Result<T, E>>, Result<U, E>: FromIterator<Result<T, E>>,

    .try_collect() is more convenient way of writing -.collect::<Result<_, _>>() Read more
    source§

    fn set_from<'a, A: 'a, J>(&mut self, from: J) -> usize
    where +.collect::<Result<_, _>>() Read more

    source§

    fn set_from<'a, A: 'a, J>(&mut self, from: J) -> usize
    where Self: Iterator<Item = &'a mut A>, J: IntoIterator<Item = A>,

    Assign to each reference in self from the from iterator, -stopping at the shortest of the two iterators. Read more
    source§

    fn join(&mut self, sep: &str) -> String
    where - Self::Item: Display,

    Combine all iterator elements into one String, separated by sep. Read more
    source§

    fn format(self, sep: &str) -> Format<'_, Self>
    where - Self: Sized,

    Format all iterator elements, separated by sep. Read more
    source§

    fn format_with<F>(self, sep: &str, format: F) -> FormatWith<'_, Self, F>
    where +stopping at the shortest of the two iterators. Read more

    source§

    fn join(&mut self, sep: &str) -> String
    where + Self::Item: Display,

    Combine all iterator elements into one String, separated by sep. Read more
    source§

    fn format(self, sep: &str) -> Format<'_, Self>
    where + Self: Sized,

    Format all iterator elements, separated by sep. Read more
    source§

    fn format_with<F>(self, sep: &str, format: F) -> FormatWith<'_, Self, F>
    where Self: Sized, - F: FnMut(Self::Item, &mut dyn FnMut(&dyn Display) -> Result) -> Result,

    Format all iterator elements, separated by sep. Read more
    source§

    fn fold_results<A, E, B, F>(&mut self, start: B, f: F) -> Result<B, E>
    where + F: FnMut(Self::Item, &mut dyn FnMut(&dyn Display) -> Result) -> Result,

    Format all iterator elements, separated by sep. Read more
    source§

    fn fold_ok<A, E, B, F>(&mut self, start: B, f: F) -> Result<B, E>
    where Self: Iterator<Item = Result<A, E>>, - F: FnMut(B, A) -> B,

    👎Deprecated since 0.10.0: Use .fold_ok() instead
    See .fold_ok().
    source§

    fn fold_ok<A, E, B, F>(&mut self, start: B, f: F) -> Result<B, E>
    where - Self: Iterator<Item = Result<A, E>>, - F: FnMut(B, A) -> B,

    Fold Result values from an iterator. Read more
    source§

    fn fold_options<A, B, F>(&mut self, start: B, f: F) -> Option<B>
    where + F: FnMut(B, A) -> B,

    Fold Result values from an iterator. Read more
    source§

    fn fold_options<A, B, F>(&mut self, start: B, f: F) -> Option<B>
    where Self: Iterator<Item = Option<A>>, - F: FnMut(B, A) -> B,

    Fold Option values from an iterator. Read more
    source§

    fn fold1<F>(self, f: F) -> Option<Self::Item>
    where + F: FnMut(B, A) -> B,

    Fold Option values from an iterator. Read more
    source§

    fn fold1<F>(self, f: F) -> Option<Self::Item>
    where F: FnMut(Self::Item, Self::Item) -> Self::Item, - Self: Sized,

    👎Deprecated since 0.10.2: Use Iterator::reduce instead
    Accumulator of the elements in the iterator. Read more
    source§

    fn tree_fold1<F>(self, f: F) -> Option<Self::Item>
    where + Self: Sized,

    👎Deprecated since 0.10.2: Use Iterator::reduce instead
    Accumulator of the elements in the iterator. Read more
    source§

    fn tree_reduce<F>(self, f: F) -> Option<Self::Item>
    where F: FnMut(Self::Item, Self::Item) -> Self::Item, - Self: Sized,

    Accumulate the elements in the iterator in a tree-like manner. Read more
    source§

    fn fold_while<B, F>(&mut self, init: B, f: F) -> FoldWhile<B>
    where + Self: Sized,

    Accumulate the elements in the iterator in a tree-like manner. Read more
    source§

    fn tree_fold1<F>(self, f: F) -> Option<Self::Item>
    where + F: FnMut(Self::Item, Self::Item) -> Self::Item, + Self: Sized,

    👎Deprecated since 0.13.0: Use .tree_reduce() instead
    See .tree_reduce().
    source§

    fn fold_while<B, F>(&mut self, init: B, f: F) -> FoldWhile<B>
    where Self: Sized, - F: FnMut(B, Self::Item) -> FoldWhile<B>,

    An iterator method that applies a function, producing a single, final value. Read more
    source§

    fn sum1<S>(self) -> Option<S>
    where + F: FnMut(B, Self::Item) -> FoldWhile<B>,

    An iterator method that applies a function, producing a single, final value. Read more
    source§

    fn sum1<S>(self) -> Option<S>
    where Self: Sized, - S: Sum<Self::Item>,

    Iterate over the entire iterator and add all the elements. Read more
    source§

    fn product1<P>(self) -> Option<P>
    where + S: Sum<Self::Item>,

    Iterate over the entire iterator and add all the elements. Read more
    source§

    fn product1<P>(self) -> Option<P>
    where Self: Sized, - P: Product<Self::Item>,

    Iterate over the entire iterator and multiply all the elements. Read more
    source§

    fn sorted_unstable(self) -> IntoIter<Self::Item> ⓘ
    where + P: Product<Self::Item>,

    Iterate over the entire iterator and multiply all the elements. Read more
    source§

    fn sorted_unstable(self) -> IntoIter<Self::Item> ⓘ
    where Self: Sized, - Self::Item: Ord,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_unstable_by<F>(self, cmp: F) -> IntoIter<Self::Item> ⓘ
    where + Self::Item: Ord,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_unstable_by<F>(self, cmp: F) -> IntoIter<Self::Item> ⓘ
    where Self: Sized, - F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_unstable_by_key<K, F>(self, f: F) -> IntoIter<Self::Item> ⓘ
    where + F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_unstable_by_key<K, F>(self, f: F) -> IntoIter<Self::Item> ⓘ
    where Self: Sized, K: Ord, - F: FnMut(&Self::Item) -> K,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted(self) -> IntoIter<Self::Item> ⓘ
    where + F: FnMut(&Self::Item) -> K,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted(self) -> IntoIter<Self::Item> ⓘ
    where Self: Sized, - Self::Item: Ord,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_by<F>(self, cmp: F) -> IntoIter<Self::Item> ⓘ
    where + Self::Item: Ord,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_by<F>(self, cmp: F) -> IntoIter<Self::Item> ⓘ
    where Self: Sized, - F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_by_key<K, F>(self, f: F) -> IntoIter<Self::Item> ⓘ
    where + F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_by_key<K, F>(self, f: F) -> IntoIter<Self::Item> ⓘ
    where Self: Sized, K: Ord, - F: FnMut(&Self::Item) -> K,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_by_cached_key<K, F>(self, f: F) -> IntoIter<Self::Item> ⓘ
    where + F: FnMut(&Self::Item) -> K,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_by_cached_key<K, F>(self, f: F) -> IntoIter<Self::Item> ⓘ
    where Self: Sized, K: Ord, F: FnMut(&Self::Item) -> K,

    Sort all iterator elements into a new iterator in ascending order. The key function is -called exactly once per key. Read more
    source§

    fn k_smallest(self, k: usize) -> IntoIter<Self::Item> ⓘ
    where +called exactly once per key. Read more

    source§

    fn k_smallest(self, k: usize) -> IntoIter<Self::Item> ⓘ
    where Self: Sized, - Self::Item: Ord,

    Sort the k smallest elements into a new iterator, in ascending order. Read more
    source§

    fn partition_map<A, B, F, L, R>(self, predicate: F) -> (A, B)
    where + Self::Item: Ord,

    Sort the k smallest elements into a new iterator, in ascending order. Read more
    source§

    fn k_smallest_by<F>(self, k: usize, cmp: F) -> IntoIter<Self::Item> ⓘ
    where + Self: Sized, + F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Sort the k smallest elements into a new iterator using the provided comparison. Read more
    source§

    fn k_smallest_by_key<F, K>(self, k: usize, key: F) -> IntoIter<Self::Item> ⓘ
    where + Self: Sized, + F: FnMut(&Self::Item) -> K, + K: Ord,

    Return the elements producing the k smallest outputs of the provided function. Read more
    source§

    fn k_largest(self, k: usize) -> IntoIter<Self::Item> ⓘ
    where + Self: Sized, + Self::Item: Ord,

    Sort the k largest elements into a new iterator, in descending order. Read more
    source§

    fn k_largest_by<F>(self, k: usize, cmp: F) -> IntoIter<Self::Item> ⓘ
    where + Self: Sized, + F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Sort the k largest elements into a new iterator using the provided comparison. Read more
    source§

    fn k_largest_by_key<F, K>(self, k: usize, key: F) -> IntoIter<Self::Item> ⓘ
    where + Self: Sized, + F: FnMut(&Self::Item) -> K, + K: Ord,

    Return the elements producing the k largest outputs of the provided function. Read more
    source§

    fn tail(self, n: usize) -> IntoIter<Self::Item> ⓘ
    where + Self: Sized,

    Consumes the iterator and return an iterator of the last n elements. Read more
    source§

    fn partition_map<A, B, F, L, R>(self, predicate: F) -> (A, B)
    where Self: Sized, F: FnMut(Self::Item) -> Either<L, R>, A: Default + Extend<L>, B: Default + Extend<R>,

    Collect all iterator elements into one of two partitions. Unlike Iterator::partition, each partition may -have a distinct type. Read more
    source§

    fn partition_result<A, B, T, E>(self) -> (A, B)
    where +have a distinct type. Read more

    source§

    fn partition_result<A, B, T, E>(self) -> (A, B)
    where Self: Iterator<Item = Result<T, E>> + Sized, A: Default + Extend<T>, B: Default + Extend<E>,

    Partition a sequence of Results into one list of all the Ok elements -and another list of all the Err elements. Read more
    source§

    fn into_group_map<K, V>(self) -> HashMap<K, Vec<V>>
    where +and another list of all the Err elements. Read more

    source§

    fn into_group_map<K, V>(self) -> HashMap<K, Vec<V>>
    where Self: Iterator<Item = (K, V)> + Sized, K: Hash + Eq,

    Return a HashMap of keys mapped to Vecs of values. Keys and values -are taken from (Key, Value) tuple pairs yielded by the input iterator. Read more
    source§

    fn into_group_map_by<K, V, F>(self, f: F) -> HashMap<K, Vec<V>>
    where +are taken from (Key, Value) tuple pairs yielded by the input iterator. Read more

    source§

    fn into_group_map_by<K, V, F>(self, f: F) -> HashMap<K, Vec<V>>
    where Self: Iterator<Item = V> + Sized, K: Hash + Eq, - F: Fn(&V) -> K,

    Return an Iterator on a HashMap. Keys mapped to Vecs of values. The key is specified -in the closure. Read more
    source§

    fn into_grouping_map<K, V>(self) -> GroupingMap<Self>
    where + F: FnMut(&V) -> K,

    Return an Iterator on a HashMap. Keys mapped to Vecs of values. The key is specified +in the closure. Read more
    source§

    fn into_grouping_map<K, V>(self) -> GroupingMap<Self>
    where Self: Iterator<Item = (K, V)> + Sized, K: Hash + Eq,

    Constructs a GroupingMap to be used later with one of the efficient -group-and-fold operations it allows to perform. Read more
    source§

    fn into_grouping_map_by<K, V, F>(self, key_mapper: F) -> GroupingMapBy<Self, F>
    where +group-and-fold operations it allows to perform. Read more

    source§

    fn into_grouping_map_by<K, V, F>(self, key_mapper: F) -> GroupingMapBy<Self, F>
    where Self: Iterator<Item = V> + Sized, K: Hash + Eq, F: FnMut(&V) -> K,

    Constructs a GroupingMap to be used later with one of the efficient -group-and-fold operations it allows to perform. Read more
    source§

    fn min_set(self) -> Vec<Self::Item>
    where +group-and-fold operations it allows to perform. Read more

    source§

    fn min_set(self) -> Vec<Self::Item>
    where Self: Sized, - Self::Item: Ord,

    Return all minimum elements of an iterator. Read more
    source§

    fn min_set_by<F>(self, compare: F) -> Vec<Self::Item>
    where + Self::Item: Ord,

    Return all minimum elements of an iterator. Read more
    source§

    fn min_set_by<F>(self, compare: F) -> Vec<Self::Item>
    where Self: Sized, F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Return all minimum elements of an iterator, as determined by -the specified function. Read more
    source§

    fn min_set_by_key<K, F>(self, key: F) -> Vec<Self::Item>
    where +the specified function. Read more

    source§

    fn min_set_by_key<K, F>(self, key: F) -> Vec<Self::Item>
    where Self: Sized, K: Ord, F: FnMut(&Self::Item) -> K,

    Return all minimum elements of an iterator, as determined by -the specified function. Read more
    source§

    fn max_set(self) -> Vec<Self::Item>
    where +the specified function. Read more

    source§

    fn max_set(self) -> Vec<Self::Item>
    where Self: Sized, - Self::Item: Ord,

    Return all maximum elements of an iterator. Read more
    source§

    fn max_set_by<F>(self, compare: F) -> Vec<Self::Item>
    where + Self::Item: Ord,

    Return all maximum elements of an iterator. Read more
    source§

    fn max_set_by<F>(self, compare: F) -> Vec<Self::Item>
    where Self: Sized, F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Return all maximum elements of an iterator, as determined by -the specified function. Read more
    source§

    fn max_set_by_key<K, F>(self, key: F) -> Vec<Self::Item>
    where +the specified function. Read more

    source§

    fn max_set_by_key<K, F>(self, key: F) -> Vec<Self::Item>
    where Self: Sized, K: Ord, F: FnMut(&Self::Item) -> K,

    Return all maximum elements of an iterator, as determined by -the specified function. Read more
    source§

    fn minmax(self) -> MinMaxResult<Self::Item>
    where +the specified function. Read more

    source§

    fn minmax(self) -> MinMaxResult<Self::Item>
    where Self: Sized, - Self::Item: PartialOrd,

    Return the minimum and maximum elements in the iterator. Read more
    source§

    fn minmax_by_key<K, F>(self, key: F) -> MinMaxResult<Self::Item>
    where + Self::Item: PartialOrd,

    Return the minimum and maximum elements in the iterator. Read more
    source§

    fn minmax_by_key<K, F>(self, key: F) -> MinMaxResult<Self::Item>
    where Self: Sized, K: PartialOrd, F: FnMut(&Self::Item) -> K,

    Return the minimum and maximum element of an iterator, as determined by -the specified function. Read more
    source§

    fn minmax_by<F>(self, compare: F) -> MinMaxResult<Self::Item>
    where +the specified function. Read more

    source§

    fn minmax_by<F>(self, compare: F) -> MinMaxResult<Self::Item>
    where Self: Sized, F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Return the minimum and maximum element of an iterator, as determined by -the specified comparison function. Read more
    source§

    fn position_max(self) -> Option<usize>
    where +the specified comparison function. Read more

    source§

    fn position_max(self) -> Option<usize>
    where Self: Sized, - Self::Item: Ord,

    Return the position of the maximum element in the iterator. Read more
    source§

    fn position_max_by_key<K, F>(self, key: F) -> Option<usize>
    where + Self::Item: Ord,

    Return the position of the maximum element in the iterator. Read more
    source§

    fn position_max_by_key<K, F>(self, key: F) -> Option<usize>
    where Self: Sized, K: Ord, F: FnMut(&Self::Item) -> K,

    Return the position of the maximum element in the iterator, as -determined by the specified function. Read more
    source§

    fn position_max_by<F>(self, compare: F) -> Option<usize>
    where +determined by the specified function. Read more

    source§

    fn position_max_by<F>(self, compare: F) -> Option<usize>
    where Self: Sized, F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Return the position of the maximum element in the iterator, as -determined by the specified comparison function. Read more
    source§

    fn position_min(self) -> Option<usize>
    where +determined by the specified comparison function. Read more

    source§

    fn position_min(self) -> Option<usize>
    where Self: Sized, - Self::Item: Ord,

    Return the position of the minimum element in the iterator. Read more
    source§

    fn position_min_by_key<K, F>(self, key: F) -> Option<usize>
    where + Self::Item: Ord,

    Return the position of the minimum element in the iterator. Read more
    source§

    fn position_min_by_key<K, F>(self, key: F) -> Option<usize>
    where Self: Sized, K: Ord, F: FnMut(&Self::Item) -> K,

    Return the position of the minimum element in the iterator, as -determined by the specified function. Read more
    source§

    fn position_min_by<F>(self, compare: F) -> Option<usize>
    where +determined by the specified function. Read more

    source§

    fn position_min_by<F>(self, compare: F) -> Option<usize>
    where Self: Sized, F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Return the position of the minimum element in the iterator, as -determined by the specified comparison function. Read more
    source§

    fn position_minmax(self) -> MinMaxResult<usize>
    where +determined by the specified comparison function. Read more

    source§

    fn position_minmax(self) -> MinMaxResult<usize>
    where Self: Sized, Self::Item: PartialOrd,

    Return the positions of the minimum and maximum elements in -the iterator. Read more
    source§

    fn position_minmax_by_key<K, F>(self, key: F) -> MinMaxResult<usize>
    where +the iterator. Read more

    source§

    fn position_minmax_by_key<K, F>(self, key: F) -> MinMaxResult<usize>
    where Self: Sized, K: PartialOrd, F: FnMut(&Self::Item) -> K,

    Return the postions of the minimum and maximum elements of an -iterator, as determined by the specified function. Read more
    source§

    fn position_minmax_by<F>(self, compare: F) -> MinMaxResult<usize>
    where +iterator, as determined by the specified function. Read more

    source§

    fn position_minmax_by<F>(self, compare: F) -> MinMaxResult<usize>
    where Self: Sized, F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Return the postions of the minimum and maximum elements of an -iterator, as determined by the specified comparison function. Read more
    source§

    fn exactly_one(self) -> Result<Self::Item, ExactlyOneError<Self>>
    where +iterator, as determined by the specified comparison function. Read more

    source§

    fn exactly_one(self) -> Result<Self::Item, ExactlyOneError<Self>>
    where Self: Sized,

    If the iterator yields exactly one element, that element will be returned, otherwise an error will be returned containing an iterator that has the same output as the input -iterator. Read more
    source§

    fn at_most_one(self) -> Result<Option<Self::Item>, ExactlyOneError<Self>>
    where - Self: Sized,

    If the iterator yields no elements, Ok(None) will be returned. If the iterator yields +iterator. Read more
    source§

    fn at_most_one(self) -> Result<Option<Self::Item>, ExactlyOneError<Self>>
    where + Self: Sized,

    If the iterator yields no elements, Ok(None) will be returned. If the iterator yields exactly one element, that element will be returned, otherwise an error will be returned -containing an iterator that has the same output as the input iterator. Read more
    source§

    fn multipeek(self) -> MultiPeek<Self> ⓘ
    where +containing an iterator that has the same output as the input iterator. Read more

    source§

    fn multipeek(self) -> MultiPeek<Self> ⓘ
    where Self: Sized,

    An iterator adaptor that allows the user to peek at multiple .next() -values without advancing the base iterator. Read more
    source§

    fn counts(self) -> HashMap<Self::Item, usize>
    where +values without advancing the base iterator. Read more

    source§

    fn counts(self) -> HashMap<Self::Item, usize>
    where Self: Sized, Self::Item: Eq + Hash,

    Collect the items in this iterator and return a HashMap which contains each item that appears in the iterator and the number -of times it appears. Read more
    source§

    fn counts_by<K, F>(self, f: F) -> HashMap<K, usize>
    where +of times it appears. Read more

    source§

    fn counts_by<K, F>(self, f: F) -> HashMap<K, usize>
    where Self: Sized, K: Eq + Hash, F: FnMut(Self::Item) -> K,

    Collect the items in this iterator and return a HashMap which contains each item that appears in the iterator and the number of times it appears, -determining identity using a keying function. Read more
    source§

    fn multiunzip<FromI>(self) -> FromI
    where - Self: Sized + MultiUnzip<FromI>,

    Converts an iterator of tuples into a tuple of containers. Read more
    source§

    fn try_len(&self) -> Result<usize, (usize, Option<usize>)>

    Returns the length of the iterator if one exists. +determining identity using a keying function. Read more
    source§

    fn multiunzip<FromI>(self) -> FromI
    where + Self: Sized + MultiUnzip<FromI>,

    Converts an iterator of tuples into a tuple of containers. Read more
    source§

    fn try_len(&self) -> Result<usize, (usize, Option<usize>)>

    Returns the length of the iterator if one exists. Otherwise return self.size_hint(). Read more
    source§

    impl<IT> MultiUnzip<()> for IT
    where IT: Iterator<Item = ()>,

    source§

    fn multiunzip(self)

    Unzip this iterator into multiple collections.
    source§

    impl<IT, A, FromA> MultiUnzip<(FromA,)> for IT
    where IT: Iterator<Item = (A,)>, @@ -678,4 +690,4 @@ Otherwise return self.size_hint(). (FromA, FromB, FromC, FromD, FromE, FromF, FromG, FromH, FromI, FromJ, FromK, FromL)

    Unzip this iterator into multiple collections.
    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 + 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/itertools/structs/struct.RepeatCall.html b/itertools/structs/struct.RepeatCall.html deleted file mode 100644 index 3c9ccf5dd..000000000 --- a/itertools/structs/struct.RepeatCall.html +++ /dev/null @@ -1,670 +0,0 @@ -RepeatCall in itertools::structs - Rust
    -

    Struct itertools::structs::RepeatCall

    source · 
    pub struct RepeatCall<F> { /* private fields */ }
    👎Deprecated since 0.8.0: Use std repeat_with() instead
    Expand description

    See repeat_call for more information.

    -

    Trait Implementations§

    source§

    impl<F: Clone> Clone for RepeatCall<F>

    source§

    fn clone(&self) -> RepeatCall<F> ⓘ

    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<F> Debug for RepeatCall<F>

    source§

    fn fmt(&self, f: &mut Formatter<'_>) -> Result

    Formats the value using the given formatter. Read more
    source§

    impl<A, F> Iterator for RepeatCall<F>
    where - F: FnMut() -> A,

    §

    type Item = A

    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

    Auto Trait Implementations§

    §

    impl<F> Freeze for RepeatCall<F>
    where - F: Freeze,

    §

    impl<F> RefUnwindSafe for RepeatCall<F>
    where - F: RefUnwindSafe,

    §

    impl<F> Send for RepeatCall<F>
    where - F: Send,

    §

    impl<F> Sync for RepeatCall<F>
    where - F: Sync,

    §

    impl<F> Unpin for RepeatCall<F>
    where - F: Unpin,

    §

    impl<F> UnwindSafe for RepeatCall<F>
    where - F: 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> IntoEither for T

    source§

    fn into_either(self, into_left: bool) -> Either<Self, Self> ⓘ

    Converts self into a Left variant of Either<Self, Self> -if into_left is true. -Converts self into a Right variant of Either<Self, Self> -otherwise. Read more
    source§

    fn into_either_with<F>(self, into_left: F) -> Either<Self, Self> ⓘ
    where - F: FnOnce(&Self) -> bool,

    Converts self into a Left variant of Either<Self, Self> -if into_left(&self) returns true. -Converts self into a Right variant of Either<Self, Self> -otherwise. Read more
    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> Itertools for T
    where - T: Iterator + ?Sized,

    source§

    fn interleave<J>(self, other: J) -> Interleave<Self, J::IntoIter> ⓘ
    where - J: IntoIterator<Item = Self::Item>, - Self: Sized,

    Alternate elements from two iterators until both have run out. Read more
    source§

    fn interleave_shortest<J>( - self, - other: J -) -> InterleaveShortest<Self, J::IntoIter> ⓘ
    where - J: IntoIterator<Item = Self::Item>, - Self: Sized,

    Alternate elements from two iterators until at least one of them has run -out. Read more
    source§

    fn intersperse(self, element: Self::Item) -> Intersperse<Self>
    where - Self: Sized, - Self::Item: Clone,

    An iterator adaptor to insert a particular value -between each element of the adapted iterator. Read more
    source§

    fn intersperse_with<F>(self, element: F) -> IntersperseWith<Self, F> ⓘ
    where - Self: Sized, - F: FnMut() -> Self::Item,

    An iterator adaptor to insert a particular value created by a function -between each element of the adapted iterator. Read more
    source§

    fn zip_longest<J>(self, other: J) -> ZipLongest<Self, J::IntoIter> ⓘ
    where - J: IntoIterator, - Self: Sized,

    Create an iterator which iterates over both this and the specified -iterator simultaneously, yielding pairs of two optional elements. Read more
    source§

    fn zip_eq<J>(self, other: J) -> ZipEq<Self, J::IntoIter> ⓘ
    where - J: IntoIterator, - Self: Sized,

    Create an iterator which iterates over both this and the specified -iterator simultaneously, yielding pairs of elements. Read more
    source§

    fn batching<B, F>(self, f: F) -> Batching<Self, F> ⓘ
    where - F: FnMut(&mut Self) -> Option<B>, - Self: Sized,

    A “meta iterator adaptor”. Its closure receives a reference to the -iterator and may pick off as many elements as it likes, to produce the -next iterator element. Read more
    source§

    fn group_by<K, F>(self, key: F) -> GroupBy<K, Self, F>
    where - Self: Sized, - F: FnMut(&Self::Item) -> K, - K: PartialEq,

    Return an iterable that can group iterator elements. -Consecutive elements that map to the same key (“runs”), are assigned -to the same group. Read more
    source§

    fn chunks(self, size: usize) -> IntoChunks<Self>
    where - Self: Sized,

    Return an iterable that can chunk the iterator. Read more
    source§

    fn tuple_windows<T>(self) -> TupleWindows<Self, T> ⓘ
    where - Self: Sized + Iterator<Item = T::Item>, - T: HomogeneousTuple, - T::Item: Clone,

    Return an iterator over all contiguous windows producing tuples of -a specific size (up to 12). Read more
    source§

    fn circular_tuple_windows<T>(self) -> CircularTupleWindows<Self, T> ⓘ
    where - Self: Sized + Clone + Iterator<Item = T::Item> + ExactSizeIterator, - T: TupleCollect + Clone, - T::Item: Clone,

    Return an iterator over all windows, wrapping back to the first -elements when the window would otherwise exceed the length of the -iterator, producing tuples of a specific size (up to 12). Read more
    source§

    fn tuples<T>(self) -> Tuples<Self, T> ⓘ
    where - Self: Sized + Iterator<Item = T::Item>, - T: HomogeneousTuple,

    Return an iterator that groups the items in tuples of a specific size -(up to 12). Read more
    source§

    fn tee(self) -> (Tee<Self>, Tee<Self>)
    where - Self: Sized, - Self::Item: Clone,

    Split into an iterator pair that both yield all elements from -the original iterator. Read more
    source§

    fn step(self, n: usize) -> Step<Self> ⓘ
    where - Self: Sized,

    👎Deprecated since 0.8.0: Use std .step_by() instead
    Return an iterator adaptor that steps n elements in the base iterator -for each iteration. Read more
    source§

    fn map_into<R>(self) -> MapInto<Self, R>
    where - Self: Sized, - Self::Item: Into<R>,

    Convert each item of the iterator using the Into trait. Read more
    source§

    fn map_results<F, T, U, E>(self, f: F) -> MapOk<Self, F>
    where - Self: Iterator<Item = Result<T, E>> + Sized, - F: FnMut(T) -> U,

    👎Deprecated since 0.10.0: Use .map_ok() instead
    See .map_ok().
    source§

    fn map_ok<F, T, U, E>(self, f: F) -> MapOk<Self, F>
    where - Self: Iterator<Item = Result<T, E>> + Sized, - F: FnMut(T) -> U,

    Return an iterator adaptor that applies the provided closure -to every Result::Ok value. Result::Err values are -unchanged. Read more
    source§

    fn filter_ok<F, T, E>(self, f: F) -> FilterOk<Self, F> ⓘ
    where - Self: Iterator<Item = Result<T, E>> + Sized, - F: FnMut(&T) -> bool,

    Return an iterator adaptor that filters every Result::Ok -value with the provided closure. Result::Err values are -unchanged. Read more
    source§

    fn filter_map_ok<F, T, U, E>(self, f: F) -> FilterMapOk<Self, F> ⓘ
    where - Self: Iterator<Item = Result<T, E>> + Sized, - F: FnMut(T) -> Option<U>,

    Return an iterator adaptor that filters and transforms every -Result::Ok value with the provided closure. Result::Err -values are unchanged. Read more
    source§

    fn flatten_ok<T, E>(self) -> FlattenOk<Self, T, E> ⓘ
    where - Self: Iterator<Item = Result<T, E>> + Sized, - T: IntoIterator,

    Return an iterator adaptor that flattens every Result::Ok value into -a series of Result::Ok values. Result::Err values are unchanged. Read more
    source§

    fn process_results<F, T, E, R>(self, processor: F) -> Result<R, E>
    where - Self: Iterator<Item = Result<T, E>> + Sized, - F: FnOnce(ProcessResults<'_, Self, E>) -> R,

    “Lift” a function of the values of the current iterator so as to process -an iterator of Result values instead. Read more
    source§

    fn merge<J>(self, other: J) -> Merge<Self, J::IntoIter>
    where - Self: Sized, - Self::Item: PartialOrd, - J: IntoIterator<Item = Self::Item>,

    Return an iterator adaptor that merges the two base iterators in -ascending order. If both base iterators are sorted (ascending), the -result is sorted. Read more
    source§

    fn merge_by<J, F>(self, other: J, is_first: F) -> MergeBy<Self, J::IntoIter, F> ⓘ
    where - Self: Sized, - J: IntoIterator<Item = Self::Item>, - F: FnMut(&Self::Item, &Self::Item) -> bool,

    Return an iterator adaptor that merges the two base iterators in order. -This is much like .merge() but allows for a custom ordering. Read more
    source§

    fn merge_join_by<J, F, T>( - self, - other: J, - cmp_fn: F -) -> MergeJoinBy<Self, J::IntoIter, F>
    where - J: IntoIterator, - F: FnMut(&Self::Item, &J::Item) -> T, - Self: Sized,

    Create an iterator that merges items from both this and the specified -iterator in ascending order. Read more
    source§

    fn kmerge(self) -> KMerge<<Self::Item as IntoIterator>::IntoIter>
    where - Self: Sized, - Self::Item: IntoIterator, - <Self::Item as IntoIterator>::Item: PartialOrd,

    Return an iterator adaptor that flattens an iterator of iterators by -merging them in ascending order. Read more
    source§

    fn kmerge_by<F>( - self, - first: F -) -> KMergeBy<<Self::Item as IntoIterator>::IntoIter, F> ⓘ
    where - Self: Sized, - Self::Item: IntoIterator, - F: FnMut(&<Self::Item as IntoIterator>::Item, &<Self::Item as IntoIterator>::Item) -> bool,

    Return an iterator adaptor that flattens an iterator of iterators by -merging them according to the given closure. Read more
    source§

    fn cartesian_product<J>(self, other: J) -> Product<Self, J::IntoIter> ⓘ
    where - Self: Sized, - Self::Item: Clone, - J: IntoIterator, - J::IntoIter: Clone,

    Return an iterator adaptor that iterates over the cartesian product of -the element sets of two iterators self and J. Read more
    source§

    fn multi_cartesian_product( - self -) -> MultiProduct<<Self::Item as IntoIterator>::IntoIter> ⓘ
    where - Self: Sized, - Self::Item: IntoIterator, - <Self::Item as IntoIterator>::IntoIter: Clone, - <Self::Item as IntoIterator>::Item: Clone,

    Return an iterator adaptor that iterates over the cartesian product of -all subiterators returned by meta-iterator self. Read more
    source§

    fn coalesce<F>(self, f: F) -> Coalesce<Self, F>
    where - Self: Sized, - F: FnMut(Self::Item, Self::Item) -> Result<Self::Item, (Self::Item, Self::Item)>,

    Return an iterator adaptor that uses the passed-in closure to -optionally merge together consecutive elements. Read more
    source§

    fn dedup(self) -> Dedup<Self>
    where - Self: Sized, - Self::Item: PartialEq,

    Remove duplicates from sections of consecutive identical elements. -If the iterator is sorted, all elements will be unique. Read more
    source§

    fn dedup_by<Cmp>(self, cmp: Cmp) -> DedupBy<Self, Cmp>
    where - Self: Sized, - Cmp: FnMut(&Self::Item, &Self::Item) -> bool,

    Remove duplicates from sections of consecutive identical elements, -determining equality using a comparison function. -If the iterator is sorted, all elements will be unique. Read more
    source§

    fn dedup_with_count(self) -> DedupWithCount<Self>
    where - Self: Sized,

    Remove duplicates from sections of consecutive identical elements, while keeping a count of -how many repeated elements were present. -If the iterator is sorted, all elements will be unique. Read more
    source§

    fn dedup_by_with_count<Cmp>(self, cmp: Cmp) -> DedupByWithCount<Self, Cmp>
    where - Self: Sized, - Cmp: FnMut(&Self::Item, &Self::Item) -> bool,

    Remove duplicates from sections of consecutive identical elements, while keeping a count of -how many repeated elements were present. -This will determine equality using a comparison function. -If the iterator is sorted, all elements will be unique. Read more
    source§

    fn duplicates(self) -> Duplicates<Self>
    where - Self: Sized, - Self::Item: Eq + Hash,

    Return an iterator adaptor that produces elements that appear more than once during the -iteration. Duplicates are detected using hash and equality. Read more
    source§

    fn duplicates_by<V, F>(self, f: F) -> DuplicatesBy<Self, V, F>
    where - Self: Sized, - V: Eq + Hash, - F: FnMut(&Self::Item) -> V,

    Return an iterator adaptor that produces elements that appear more than once during the -iteration. Duplicates are detected using hash and equality. Read more
    source§

    fn unique(self) -> Unique<Self> ⓘ
    where - Self: Sized, - Self::Item: Clone + Eq + Hash,

    Return an iterator adaptor that filters out elements that have -already been produced once during the iteration. Duplicates -are detected using hash and equality. Read more
    source§

    fn unique_by<V, F>(self, f: F) -> UniqueBy<Self, V, F> ⓘ
    where - Self: Sized, - V: Eq + Hash, - F: FnMut(&Self::Item) -> V,

    Return an iterator adaptor that filters out elements that have -already been produced once during the iteration. Read more
    source§

    fn peeking_take_while<F>(&mut self, accept: F) -> PeekingTakeWhile<'_, Self, F> ⓘ
    where - Self: Sized + PeekingNext, - F: FnMut(&Self::Item) -> bool,

    Return an iterator adaptor that borrows from this iterator and -takes items while the closure accept returns true. Read more
    source§

    fn take_while_ref<F>(&mut self, accept: F) -> TakeWhileRef<'_, Self, F> ⓘ
    where - Self: Clone, - F: FnMut(&Self::Item) -> bool,

    Return an iterator adaptor that borrows from a Clone-able iterator -to only pick off elements while the predicate accept returns true. Read more
    source§

    fn take_while_inclusive<F>(self, accept: F) -> TakeWhileInclusive<Self, F> ⓘ
    where - Self: Sized, - F: FnMut(&Self::Item) -> bool,

    Returns an iterator adaptor that consumes elements while the given -predicate is true, including the element for which the predicate -first returned false. Read more
    source§

    fn while_some<A>(self) -> WhileSome<Self> ⓘ
    where - Self: Sized + Iterator<Item = Option<A>>,

    Return an iterator adaptor that filters Option<A> iterator elements -and produces A. Stops on the first None encountered. Read more
    source§

    fn tuple_combinations<T>(self) -> TupleCombinations<Self, T> ⓘ
    where - Self: Sized + Clone, - Self::Item: Clone, - T: HasCombination<Self>,

    Return an iterator adaptor that iterates over the combinations of the -elements from an iterator. Read more
    source§

    fn combinations(self, k: usize) -> Combinations<Self> ⓘ
    where - Self: Sized, - Self::Item: Clone,

    Return an iterator adaptor that iterates over the k-length combinations of -the elements from an iterator. Read more
    source§

    fn combinations_with_replacement( - self, - k: usize -) -> CombinationsWithReplacement<Self> ⓘ
    where - Self: Sized, - Self::Item: Clone,

    Return an iterator that iterates over the k-length combinations of -the elements from an iterator, with replacement. Read more
    source§

    fn permutations(self, k: usize) -> Permutations<Self> ⓘ
    where - Self: Sized, - Self::Item: Clone,

    Return an iterator adaptor that iterates over all k-permutations of the -elements from an iterator. Read more
    source§

    fn powerset(self) -> Powerset<Self> ⓘ
    where - Self: Sized, - Self::Item: Clone,

    Return an iterator that iterates through the powerset of the elements from an -iterator. Read more
    source§

    fn pad_using<F>(self, min: usize, f: F) -> PadUsing<Self, F> ⓘ
    where - Self: Sized, - F: FnMut(usize) -> Self::Item,

    Return an iterator adaptor that pads the sequence to a minimum length of -min by filling missing elements using a closure f. Read more
    source§

    fn with_position(self) -> WithPosition<Self> ⓘ
    where - Self: Sized,

    Return an iterator adaptor that combines each element with a Position to -ease special-case handling of the first or last elements. Read more
    source§

    fn positions<P>(self, predicate: P) -> Positions<Self, P> ⓘ
    where - Self: Sized, - P: FnMut(Self::Item) -> bool,

    Return an iterator adaptor that yields the indices of all elements -satisfying a predicate, counted from the start of the iterator. Read more
    source§

    fn update<F>(self, updater: F) -> Update<Self, F> ⓘ
    where - Self: Sized, - F: FnMut(&mut Self::Item),

    Return an iterator adaptor that applies a mutating function -to each element before yielding it. Read more
    source§

    fn next_tuple<T>(&mut self) -> Option<T>
    where - Self: Sized + Iterator<Item = T::Item>, - T: HomogeneousTuple,

    Advances the iterator and returns the next items grouped in a tuple of -a specific size (up to 12). Read more
    source§

    fn collect_tuple<T>(self) -> Option<T>
    where - Self: Sized + Iterator<Item = T::Item>, - T: HomogeneousTuple,

    Collects all items from the iterator into a tuple of a specific size -(up to 12). Read more
    source§

    fn find_position<P>(&mut self, pred: P) -> Option<(usize, Self::Item)>
    where - P: FnMut(&Self::Item) -> bool,

    Find the position and value of the first element satisfying a predicate. Read more
    source§

    fn find_or_last<P>(self, predicate: P) -> Option<Self::Item>
    where - Self: Sized, - P: FnMut(&Self::Item) -> bool,

    Find the value of the first element satisfying a predicate or return the last element, if any. Read more
    source§

    fn find_or_first<P>(self, predicate: P) -> Option<Self::Item>
    where - Self: Sized, - P: FnMut(&Self::Item) -> bool,

    Find the value of the first element satisfying a predicate or return the first element, if any. Read more
    source§

    fn contains<Q>(&mut self, query: &Q) -> bool
    where - Self: Sized, - Self::Item: Borrow<Q>, - Q: PartialEq,

    Returns true if the given item is present in this iterator. Read more
    source§

    fn all_equal(&mut self) -> bool
    where - Self: Sized, - Self::Item: PartialEq,

    Check whether all elements compare equal. Read more
    source§

    fn all_equal_value( - &mut self -) -> Result<Self::Item, Option<(Self::Item, Self::Item)>>
    where - Self: Sized, - Self::Item: PartialEq,

    If there are elements and they are all equal, return a single copy of that element. -If there are no elements, return an Error containing None. -If there are elements and they are not all equal, return a tuple containing the first -two non-equal elements found. Read more
    source§

    fn all_unique(&mut self) -> bool
    where - Self: Sized, - Self::Item: Eq + Hash,

    Check whether all elements are unique (non equal). Read more
    source§

    fn dropping(self, n: usize) -> Self
    where - Self: Sized,

    Consume the first n elements from the iterator eagerly, -and return the same iterator again. Read more
    source§

    fn dropping_back(self, n: usize) -> Self
    where - Self: Sized + DoubleEndedIterator,

    Consume the last n elements from the iterator eagerly, -and return the same iterator again. Read more
    source§

    fn foreach<F>(self, f: F)
    where - F: FnMut(Self::Item), - Self: Sized,

    👎Deprecated since 0.8.0: Use .for_each() instead
    Run the closure f eagerly on each element of the iterator. Read more
    source§

    fn concat(self) -> Self::Item
    where - Self: Sized, - Self::Item: Extend<<<Self as Iterator>::Item as IntoIterator>::Item> + IntoIterator + Default,

    Combine all an iterator’s elements into one element by using Extend. Read more
    source§

    fn collect_vec(self) -> Vec<Self::Item>
    where - Self: Sized,

    .collect_vec() is simply a type specialization of Iterator::collect, -for convenience.
    source§

    fn try_collect<T, U, E>(self) -> Result<U, E>
    where - Self: Sized + Iterator<Item = Result<T, E>>, - Result<U, E>: FromIterator<Result<T, E>>,

    .try_collect() is more convenient way of writing -.collect::<Result<_, _>>() Read more
    source§

    fn set_from<'a, A: 'a, J>(&mut self, from: J) -> usize
    where - Self: Iterator<Item = &'a mut A>, - J: IntoIterator<Item = A>,

    Assign to each reference in self from the from iterator, -stopping at the shortest of the two iterators. Read more
    source§

    fn join(&mut self, sep: &str) -> String
    where - Self::Item: Display,

    Combine all iterator elements into one String, separated by sep. Read more
    source§

    fn format(self, sep: &str) -> Format<'_, Self>
    where - Self: Sized,

    Format all iterator elements, separated by sep. Read more
    source§

    fn format_with<F>(self, sep: &str, format: F) -> FormatWith<'_, Self, F>
    where - Self: Sized, - F: FnMut(Self::Item, &mut dyn FnMut(&dyn Display) -> Result) -> Result,

    Format all iterator elements, separated by sep. Read more
    source§

    fn fold_results<A, E, B, F>(&mut self, start: B, f: F) -> Result<B, E>
    where - Self: Iterator<Item = Result<A, E>>, - F: FnMut(B, A) -> B,

    👎Deprecated since 0.10.0: Use .fold_ok() instead
    See .fold_ok().
    source§

    fn fold_ok<A, E, B, F>(&mut self, start: B, f: F) -> Result<B, E>
    where - Self: Iterator<Item = Result<A, E>>, - F: FnMut(B, A) -> B,

    Fold Result values from an iterator. Read more
    source§

    fn fold_options<A, B, F>(&mut self, start: B, f: F) -> Option<B>
    where - Self: Iterator<Item = Option<A>>, - F: FnMut(B, A) -> B,

    Fold Option values from an iterator. Read more
    source§

    fn fold1<F>(self, f: F) -> Option<Self::Item>
    where - F: FnMut(Self::Item, Self::Item) -> Self::Item, - Self: Sized,

    👎Deprecated since 0.10.2: Use Iterator::reduce instead
    Accumulator of the elements in the iterator. Read more
    source§

    fn tree_fold1<F>(self, f: F) -> Option<Self::Item>
    where - F: FnMut(Self::Item, Self::Item) -> Self::Item, - Self: Sized,

    Accumulate the elements in the iterator in a tree-like manner. Read more
    source§

    fn fold_while<B, F>(&mut self, init: B, f: F) -> FoldWhile<B>
    where - Self: Sized, - F: FnMut(B, Self::Item) -> FoldWhile<B>,

    An iterator method that applies a function, producing a single, final value. Read more
    source§

    fn sum1<S>(self) -> Option<S>
    where - Self: Sized, - S: Sum<Self::Item>,

    Iterate over the entire iterator and add all the elements. Read more
    source§

    fn product1<P>(self) -> Option<P>
    where - Self: Sized, - P: Product<Self::Item>,

    Iterate over the entire iterator and multiply all the elements. Read more
    source§

    fn sorted_unstable(self) -> IntoIter<Self::Item> ⓘ
    where - Self: Sized, - Self::Item: Ord,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_unstable_by<F>(self, cmp: F) -> IntoIter<Self::Item> ⓘ
    where - Self: Sized, - F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_unstable_by_key<K, F>(self, f: F) -> IntoIter<Self::Item> ⓘ
    where - Self: Sized, - K: Ord, - F: FnMut(&Self::Item) -> K,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted(self) -> IntoIter<Self::Item> ⓘ
    where - Self: Sized, - Self::Item: Ord,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_by<F>(self, cmp: F) -> IntoIter<Self::Item> ⓘ
    where - Self: Sized, - F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_by_key<K, F>(self, f: F) -> IntoIter<Self::Item> ⓘ
    where - Self: Sized, - K: Ord, - F: FnMut(&Self::Item) -> K,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_by_cached_key<K, F>(self, f: F) -> IntoIter<Self::Item> ⓘ
    where - Self: Sized, - K: Ord, - F: FnMut(&Self::Item) -> K,

    Sort all iterator elements into a new iterator in ascending order. The key function is -called exactly once per key. Read more
    source§

    fn k_smallest(self, k: usize) -> IntoIter<Self::Item> ⓘ
    where - Self: Sized, - Self::Item: Ord,

    Sort the k smallest elements into a new iterator, in ascending order. Read more
    source§

    fn partition_map<A, B, F, L, R>(self, predicate: F) -> (A, B)
    where - Self: Sized, - F: FnMut(Self::Item) -> Either<L, R>, - A: Default + Extend<L>, - B: Default + Extend<R>,

    Collect all iterator elements into one of two -partitions. Unlike Iterator::partition, each partition may -have a distinct type. Read more
    source§

    fn partition_result<A, B, T, E>(self) -> (A, B)
    where - Self: Iterator<Item = Result<T, E>> + Sized, - A: Default + Extend<T>, - B: Default + Extend<E>,

    Partition a sequence of Results into one list of all the Ok elements -and another list of all the Err elements. Read more
    source§

    fn into_group_map<K, V>(self) -> HashMap<K, Vec<V>>
    where - Self: Iterator<Item = (K, V)> + Sized, - K: Hash + Eq,

    Return a HashMap of keys mapped to Vecs of values. Keys and values -are taken from (Key, Value) tuple pairs yielded by the input iterator. Read more
    source§

    fn into_group_map_by<K, V, F>(self, f: F) -> HashMap<K, Vec<V>>
    where - Self: Iterator<Item = V> + Sized, - K: Hash + Eq, - F: Fn(&V) -> K,

    Return an Iterator on a HashMap. Keys mapped to Vecs of values. The key is specified -in the closure. Read more
    source§

    fn into_grouping_map<K, V>(self) -> GroupingMap<Self>
    where - Self: Iterator<Item = (K, V)> + Sized, - K: Hash + Eq,

    Constructs a GroupingMap to be used later with one of the efficient -group-and-fold operations it allows to perform. Read more
    source§

    fn into_grouping_map_by<K, V, F>(self, key_mapper: F) -> GroupingMapBy<Self, F>
    where - Self: Iterator<Item = V> + Sized, - K: Hash + Eq, - F: FnMut(&V) -> K,

    Constructs a GroupingMap to be used later with one of the efficient -group-and-fold operations it allows to perform. Read more
    source§

    fn min_set(self) -> Vec<Self::Item>
    where - Self: Sized, - Self::Item: Ord,

    Return all minimum elements of an iterator. Read more
    source§

    fn min_set_by<F>(self, compare: F) -> Vec<Self::Item>
    where - Self: Sized, - F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Return all minimum elements of an iterator, as determined by -the specified function. Read more
    source§

    fn min_set_by_key<K, F>(self, key: F) -> Vec<Self::Item>
    where - Self: Sized, - K: Ord, - F: FnMut(&Self::Item) -> K,

    Return all minimum elements of an iterator, as determined by -the specified function. Read more
    source§

    fn max_set(self) -> Vec<Self::Item>
    where - Self: Sized, - Self::Item: Ord,

    Return all maximum elements of an iterator. Read more
    source§

    fn max_set_by<F>(self, compare: F) -> Vec<Self::Item>
    where - Self: Sized, - F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Return all maximum elements of an iterator, as determined by -the specified function. Read more
    source§

    fn max_set_by_key<K, F>(self, key: F) -> Vec<Self::Item>
    where - Self: Sized, - K: Ord, - F: FnMut(&Self::Item) -> K,

    Return all maximum elements of an iterator, as determined by -the specified function. Read more
    source§

    fn minmax(self) -> MinMaxResult<Self::Item>
    where - Self: Sized, - Self::Item: PartialOrd,

    Return the minimum and maximum elements in the iterator. Read more
    source§

    fn minmax_by_key<K, F>(self, key: F) -> MinMaxResult<Self::Item>
    where - Self: Sized, - K: PartialOrd, - F: FnMut(&Self::Item) -> K,

    Return the minimum and maximum element of an iterator, as determined by -the specified function. Read more
    source§

    fn minmax_by<F>(self, compare: F) -> MinMaxResult<Self::Item>
    where - Self: Sized, - F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Return the minimum and maximum element of an iterator, as determined by -the specified comparison function. Read more
    source§

    fn position_max(self) -> Option<usize>
    where - Self: Sized, - Self::Item: Ord,

    Return the position of the maximum element in the iterator. Read more
    source§

    fn position_max_by_key<K, F>(self, key: F) -> Option<usize>
    where - Self: Sized, - K: Ord, - F: FnMut(&Self::Item) -> K,

    Return the position of the maximum element in the iterator, as -determined by the specified function. Read more
    source§

    fn position_max_by<F>(self, compare: F) -> Option<usize>
    where - Self: Sized, - F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Return the position of the maximum element in the iterator, as -determined by the specified comparison function. Read more
    source§

    fn position_min(self) -> Option<usize>
    where - Self: Sized, - Self::Item: Ord,

    Return the position of the minimum element in the iterator. Read more
    source§

    fn position_min_by_key<K, F>(self, key: F) -> Option<usize>
    where - Self: Sized, - K: Ord, - F: FnMut(&Self::Item) -> K,

    Return the position of the minimum element in the iterator, as -determined by the specified function. Read more
    source§

    fn position_min_by<F>(self, compare: F) -> Option<usize>
    where - Self: Sized, - F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Return the position of the minimum element in the iterator, as -determined by the specified comparison function. Read more
    source§

    fn position_minmax(self) -> MinMaxResult<usize>
    where - Self: Sized, - Self::Item: PartialOrd,

    Return the positions of the minimum and maximum elements in -the iterator. Read more
    source§

    fn position_minmax_by_key<K, F>(self, key: F) -> MinMaxResult<usize>
    where - Self: Sized, - K: PartialOrd, - F: FnMut(&Self::Item) -> K,

    Return the postions of the minimum and maximum elements of an -iterator, as determined by the specified function. Read more
    source§

    fn position_minmax_by<F>(self, compare: F) -> MinMaxResult<usize>
    where - Self: Sized, - F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Return the postions of the minimum and maximum elements of an -iterator, as determined by the specified comparison function. Read more
    source§

    fn exactly_one(self) -> Result<Self::Item, ExactlyOneError<Self>>
    where - Self: Sized,

    If the iterator yields exactly one element, that element will be returned, otherwise -an error will be returned containing an iterator that has the same output as the input -iterator. Read more
    source§

    fn at_most_one(self) -> Result<Option<Self::Item>, ExactlyOneError<Self>>
    where - Self: Sized,

    If the iterator yields no elements, Ok(None) will be returned. If the iterator yields -exactly one element, that element will be returned, otherwise an error will be returned -containing an iterator that has the same output as the input iterator. Read more
    source§

    fn multipeek(self) -> MultiPeek<Self> ⓘ
    where - Self: Sized,

    An iterator adaptor that allows the user to peek at multiple .next() -values without advancing the base iterator. Read more
    source§

    fn counts(self) -> HashMap<Self::Item, usize>
    where - Self: Sized, - Self::Item: Eq + Hash,

    Collect the items in this iterator and return a HashMap which -contains each item that appears in the iterator and the number -of times it appears. Read more
    source§

    fn counts_by<K, F>(self, f: F) -> HashMap<K, usize>
    where - Self: Sized, - K: Eq + Hash, - F: FnMut(Self::Item) -> K,

    Collect the items in this iterator and return a HashMap which -contains each item that appears in the iterator and the number -of times it appears, -determining identity using a keying function. Read more
    source§

    fn multiunzip<FromI>(self) -> FromI
    where - Self: Sized + MultiUnzip<FromI>,

    Converts an iterator of tuples into a tuple of containers. Read more
    source§

    fn try_len(&self) -> Result<usize, (usize, Option<usize>)>

    Returns the length of the iterator if one exists. -Otherwise return self.size_hint(). Read more
    source§

    impl<IT> MultiUnzip<()> for IT
    where - IT: Iterator<Item = ()>,

    source§

    fn multiunzip(self)

    Unzip this iterator into multiple collections.
    source§

    impl<IT, A, FromA> MultiUnzip<(FromA,)> for IT
    where - IT: Iterator<Item = (A,)>, - FromA: Default + Extend<A>,

    source§

    fn multiunzip(self) -> (FromA,)

    Unzip this iterator into multiple collections.
    source§

    impl<IT, A, FromA, B, FromB> MultiUnzip<(FromA, FromB)> for IT
    where - IT: Iterator<Item = (A, B)>, - FromA: Default + Extend<A>, - FromB: Default + Extend<B>,

    source§

    fn multiunzip(self) -> (FromA, FromB)

    Unzip this iterator into multiple collections.
    source§

    impl<IT, A, FromA, B, FromB, C, FromC> MultiUnzip<(FromA, FromB, FromC)> for IT
    where - IT: Iterator<Item = (A, B, C)>, - FromA: Default + Extend<A>, - FromB: Default + Extend<B>, - FromC: Default + Extend<C>,

    source§

    fn multiunzip(self) -> (FromA, FromB, FromC)

    Unzip this iterator into multiple collections.
    source§

    impl<IT, A, FromA, B, FromB, C, FromC, D, FromD> MultiUnzip<(FromA, FromB, FromC, FromD)> for IT
    where - IT: Iterator<Item = (A, B, C, D)>, - FromA: Default + Extend<A>, - FromB: Default + Extend<B>, - FromC: Default + Extend<C>, - FromD: Default + Extend<D>,

    source§

    fn multiunzip(self) -> (FromA, FromB, FromC, FromD)

    Unzip this iterator into multiple collections.
    source§

    impl<IT, A, FromA, B, FromB, C, FromC, D, FromD, E, FromE> MultiUnzip<(FromA, FromB, FromC, FromD, FromE)> for IT
    where - IT: Iterator<Item = (A, B, C, D, E)>, - FromA: Default + Extend<A>, - FromB: Default + Extend<B>, - FromC: Default + Extend<C>, - FromD: Default + Extend<D>, - FromE: Default + Extend<E>,

    source§

    fn multiunzip(self) -> (FromA, FromB, FromC, FromD, FromE)

    Unzip this iterator into multiple collections.
    source§

    impl<IT, A, FromA, B, FromB, C, FromC, D, FromD, E, FromE, F, FromF> MultiUnzip<(FromA, FromB, FromC, FromD, FromE, FromF)> for IT
    where - IT: Iterator<Item = (A, B, C, D, E, F)>, - FromA: Default + Extend<A>, - FromB: Default + Extend<B>, - FromC: Default + Extend<C>, - FromD: Default + Extend<D>, - FromE: Default + Extend<E>, - FromF: Default + Extend<F>,

    source§

    fn multiunzip(self) -> (FromA, FromB, FromC, FromD, FromE, FromF)

    Unzip this iterator into multiple collections.
    source§

    impl<IT, A, FromA, B, FromB, C, FromC, D, FromD, E, FromE, F, FromF, G, FromG> MultiUnzip<(FromA, FromB, FromC, FromD, FromE, FromF, FromG)> for IT
    where - IT: Iterator<Item = (A, B, C, D, E, F, G)>, - FromA: Default + Extend<A>, - FromB: Default + Extend<B>, - FromC: Default + Extend<C>, - FromD: Default + Extend<D>, - FromE: Default + Extend<E>, - FromF: Default + Extend<F>, - FromG: Default + Extend<G>,

    source§

    fn multiunzip(self) -> (FromA, FromB, FromC, FromD, FromE, FromF, FromG)

    Unzip this iterator into multiple collections.
    source§

    impl<IT, A, FromA, B, FromB, C, FromC, D, FromD, E, FromE, F, FromF, G, FromG, H, FromH> MultiUnzip<(FromA, FromB, FromC, FromD, FromE, FromF, FromG, FromH)> for IT
    where - IT: Iterator<Item = (A, B, C, D, E, F, G, H)>, - FromA: Default + Extend<A>, - FromB: Default + Extend<B>, - FromC: Default + Extend<C>, - FromD: Default + Extend<D>, - FromE: Default + Extend<E>, - FromF: Default + Extend<F>, - FromG: Default + Extend<G>, - FromH: Default + Extend<H>,

    source§

    fn multiunzip(self) -> (FromA, FromB, FromC, FromD, FromE, FromF, FromG, FromH)

    Unzip this iterator into multiple collections.
    source§

    impl<IT, A, FromA, B, FromB, C, FromC, D, FromD, E, FromE, F, FromF, G, FromG, H, FromH, I, FromI> MultiUnzip<(FromA, FromB, FromC, FromD, FromE, FromF, FromG, FromH, FromI)> for IT
    where - IT: Iterator<Item = (A, B, C, D, E, F, G, H, I)>, - FromA: Default + Extend<A>, - FromB: Default + Extend<B>, - FromC: Default + Extend<C>, - FromD: Default + Extend<D>, - FromE: Default + Extend<E>, - FromF: Default + Extend<F>, - FromG: Default + Extend<G>, - FromH: Default + Extend<H>, - FromI: Default + Extend<I>,

    source§

    fn multiunzip( - self -) -> (FromA, FromB, FromC, FromD, FromE, FromF, FromG, FromH, FromI)

    Unzip this iterator into multiple collections.
    source§

    impl<IT, A, FromA, B, FromB, C, FromC, D, FromD, E, FromE, F, FromF, G, FromG, H, FromH, I, FromI, J, FromJ> MultiUnzip<(FromA, FromB, FromC, FromD, FromE, FromF, FromG, FromH, FromI, FromJ)> for IT
    where - IT: Iterator<Item = (A, B, C, D, E, F, G, H, I, J)>, - FromA: Default + Extend<A>, - FromB: Default + Extend<B>, - FromC: Default + Extend<C>, - FromD: Default + Extend<D>, - FromE: Default + Extend<E>, - FromF: Default + Extend<F>, - FromG: Default + Extend<G>, - FromH: Default + Extend<H>, - FromI: Default + Extend<I>, - FromJ: Default + Extend<J>,

    source§

    fn multiunzip( - self -) -> (FromA, FromB, FromC, FromD, FromE, FromF, FromG, FromH, FromI, FromJ)

    Unzip this iterator into multiple collections.
    source§

    impl<IT, A, FromA, B, FromB, C, FromC, D, FromD, E, FromE, F, FromF, G, FromG, H, FromH, I, FromI, J, FromJ, K, FromK> MultiUnzip<(FromA, FromB, FromC, FromD, FromE, FromF, FromG, FromH, FromI, FromJ, FromK)> for IT
    where - IT: Iterator<Item = (A, B, C, D, E, F, G, H, I, J, K)>, - FromA: Default + Extend<A>, - FromB: Default + Extend<B>, - FromC: Default + Extend<C>, - FromD: Default + Extend<D>, - FromE: Default + Extend<E>, - FromF: Default + Extend<F>, - FromG: Default + Extend<G>, - FromH: Default + Extend<H>, - FromI: Default + Extend<I>, - FromJ: Default + Extend<J>, - FromK: Default + Extend<K>,

    source§

    fn multiunzip( - self -) -> (FromA, FromB, FromC, FromD, FromE, FromF, FromG, FromH, FromI, FromJ, FromK)

    Unzip this iterator into multiple collections.
    source§

    impl<IT, A, FromA, B, FromB, C, FromC, D, FromD, E, FromE, F, FromF, G, FromG, H, FromH, I, FromI, J, FromJ, K, FromK, L, FromL> MultiUnzip<(FromA, FromB, FromC, FromD, FromE, FromF, FromG, FromH, FromI, FromJ, FromK, FromL)> for IT
    where - IT: Iterator<Item = (A, B, C, D, E, F, G, H, I, J, K, L)>, - FromA: Default + Extend<A>, - FromB: Default + Extend<B>, - FromC: Default + Extend<C>, - FromD: Default + Extend<D>, - FromE: Default + Extend<E>, - FromF: Default + Extend<F>, - FromG: Default + Extend<G>, - FromH: Default + Extend<H>, - FromI: Default + Extend<I>, - FromJ: Default + Extend<J>, - FromK: Default + Extend<K>, - FromL: Default + Extend<L>,

    source§

    fn multiunzip( - self -) -> (FromA, FromB, FromC, FromD, FromE, FromF, FromG, FromH, FromI, FromJ, FromK, FromL)

    Unzip this iterator into multiple collections.
    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/itertools/structs/struct.RepeatN.html b/itertools/structs/struct.RepeatN.html index ed58521f5..e0dbefb20 100644 --- a/itertools/structs/struct.RepeatN.html +++ b/itertools/structs/struct.RepeatN.html @@ -1,4 +1,4 @@ -RepeatN in itertools::structs - Rust
    +RepeatN in itertools::structs - Rust

    Struct itertools::structs::RepeatN

    source · 
    pub struct RepeatN<A> { /* private fields */ }
    Expand description

    An iterator that produces n repetitions of an element.

    See repeat_n() for more information.

    Trait Implementations§

    source§

    impl<A: Clone> Clone for RepeatN<A>

    source§

    fn clone(&self) -> RepeatN<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 RepeatN<A>

    source§

    fn fmt(&self, f: &mut Formatter<'_>) -> Result

    Formats the value using the given formatter. Read more
    source§

    impl<A> DoubleEndedIterator for RepeatN<A>
    where @@ -200,8 +200,8 @@ greater than or equal to those of another. 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: Clone> PeekingNext for RepeatN<T>

    source§

    fn peeking_next<F>(&mut self, accept: F) -> Option<Self::Item>
    where F: FnOnce(&Self::Item) -> bool,

    Pass a reference to the next iterator element to the closure accept; -if accept returns true, return it as the next element, -else None.
    source§

    impl<A> FusedIterator for RepeatN<A>
    where +if accept returns true, return it as the next element, +else None.

    source§

    impl<A> FusedIterator for RepeatN<A>
    where A: Clone,

    Auto Trait Implementations§

    §

    impl<A> Freeze for RepeatN<A>
    where A: Freeze,

    §

    impl<A> RefUnwindSafe for RepeatN<A>
    where A: RefUnwindSafe,

    §

    impl<A> Send for RepeatN<A>
    where @@ -224,86 +224,87 @@ otherwise. Right variant of Either<Self, Self> otherwise. Read more

    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> Itertools for T
    where - T: Iterator + ?Sized,

    source§

    fn interleave<J>(self, other: J) -> Interleave<Self, J::IntoIter> ⓘ
    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> Itertools for T
    where + T: Iterator + ?Sized,

    source§

    fn interleave<J>(self, other: J) -> Interleave<Self, J::IntoIter> ⓘ
    where J: IntoIterator<Item = Self::Item>, - Self: Sized,

    Alternate elements from two iterators until both have run out. Read more
    source§

    fn interleave_shortest<J>( + Self: Sized,

    Alternate elements from two iterators until both have run out. Read more
    source§

    fn interleave_shortest<J>( self, other: J ) -> InterleaveShortest<Self, J::IntoIter> ⓘ
    where J: IntoIterator<Item = Self::Item>, Self: Sized,

    Alternate elements from two iterators until at least one of them has run -out. Read more
    source§

    fn intersperse(self, element: Self::Item) -> Intersperse<Self>
    where +out. Read more

    source§

    fn intersperse(self, element: Self::Item) -> Intersperse<Self>
    where Self: Sized, Self::Item: Clone,

    An iterator adaptor to insert a particular value -between each element of the adapted iterator. Read more
    source§

    fn intersperse_with<F>(self, element: F) -> IntersperseWith<Self, F> ⓘ
    where +between each element of the adapted iterator. Read more

    source§

    fn intersperse_with<F>(self, element: F) -> IntersperseWith<Self, F> ⓘ
    where Self: Sized, F: FnMut() -> Self::Item,

    An iterator adaptor to insert a particular value created by a function -between each element of the adapted iterator. Read more
    source§

    fn zip_longest<J>(self, other: J) -> ZipLongest<Self, J::IntoIter> ⓘ
    where +between each element of the adapted iterator. Read more

    source§

    fn get<R>(self, index: R) -> R::Output
    where + Self: Sized, + R: IteratorIndex<Self>,

    Returns an iterator over a subsection of the iterator. Read more
    source§

    fn zip_longest<J>(self, other: J) -> ZipLongest<Self, J::IntoIter> ⓘ
    where J: IntoIterator, Self: Sized,

    Create an iterator which iterates over both this and the specified -iterator simultaneously, yielding pairs of two optional elements. Read more
    source§

    fn zip_eq<J>(self, other: J) -> ZipEq<Self, J::IntoIter> ⓘ
    where +iterator simultaneously, yielding pairs of two optional elements. Read more

    source§

    fn zip_eq<J>(self, other: J) -> ZipEq<Self, J::IntoIter> ⓘ
    where J: IntoIterator, Self: Sized,

    Create an iterator which iterates over both this and the specified -iterator simultaneously, yielding pairs of elements. Read more
    source§

    fn batching<B, F>(self, f: F) -> Batching<Self, F> ⓘ
    where +iterator simultaneously, yielding pairs of elements. Read more

    source§

    fn batching<B, F>(self, f: F) -> Batching<Self, F> ⓘ
    where F: FnMut(&mut Self) -> Option<B>, Self: Sized,

    A “meta iterator adaptor”. Its closure receives a reference to the iterator and may pick off as many elements as it likes, to produce the -next iterator element. Read more
    source§

    fn group_by<K, F>(self, key: F) -> GroupBy<K, Self, F>
    where +next iterator element. Read more

    source§

    fn chunk_by<K, F>(self, key: F) -> ChunkBy<K, Self, F>
    where Self: Sized, F: FnMut(&Self::Item) -> K, K: PartialEq,

    Return an iterable that can group iterator elements. Consecutive elements that map to the same key (“runs”), are assigned -to the same group. Read more
    source§

    fn chunks(self, size: usize) -> IntoChunks<Self>
    where - Self: Sized,

    Return an iterable that can chunk the iterator. Read more
    source§

    fn tuple_windows<T>(self) -> TupleWindows<Self, T> ⓘ
    where +to the same group. Read more

    source§

    fn group_by<K, F>(self, key: F) -> ChunkBy<K, Self, F>
    where + Self: Sized, + F: FnMut(&Self::Item) -> K, + K: PartialEq,

    👎Deprecated since 0.13.0: Use .chunk_by() instead
    See .chunk_by().
    source§

    fn chunks(self, size: usize) -> IntoChunks<Self>
    where + Self: Sized,

    Return an iterable that can chunk the iterator. Read more
    source§

    fn tuple_windows<T>(self) -> TupleWindows<Self, T> ⓘ
    where Self: Sized + Iterator<Item = T::Item>, T: HomogeneousTuple, T::Item: Clone,

    Return an iterator over all contiguous windows producing tuples of -a specific size (up to 12). Read more
    source§

    fn circular_tuple_windows<T>(self) -> CircularTupleWindows<Self, T> ⓘ
    where +a specific size (up to 12). Read more

    source§

    fn circular_tuple_windows<T>(self) -> CircularTupleWindows<Self, T> ⓘ
    where Self: Sized + Clone + Iterator<Item = T::Item> + ExactSizeIterator, T: TupleCollect + Clone, T::Item: Clone,

    Return an iterator over all windows, wrapping back to the first elements when the window would otherwise exceed the length of the -iterator, producing tuples of a specific size (up to 12). Read more
    source§

    fn tuples<T>(self) -> Tuples<Self, T> ⓘ
    where +iterator, producing tuples of a specific size (up to 12). Read more

    source§

    fn tuples<T>(self) -> Tuples<Self, T> ⓘ
    where Self: Sized + Iterator<Item = T::Item>, T: HomogeneousTuple,

    Return an iterator that groups the items in tuples of a specific size -(up to 12). Read more
    source§

    fn tee(self) -> (Tee<Self>, Tee<Self>)
    where +(up to 12). Read more

    source§

    fn tee(self) -> (Tee<Self>, Tee<Self>)
    where Self: Sized, Self::Item: Clone,

    Split into an iterator pair that both yield all elements from -the original iterator. Read more
    source§

    fn step(self, n: usize) -> Step<Self> ⓘ
    where - Self: Sized,

    👎Deprecated since 0.8.0: Use std .step_by() instead
    Return an iterator adaptor that steps n elements in the base iterator -for each iteration. Read more
    source§

    fn map_into<R>(self) -> MapInto<Self, R>
    where +the original iterator. Read more

    source§

    fn map_into<R>(self) -> MapInto<Self, R>
    where Self: Sized, - Self::Item: Into<R>,

    Convert each item of the iterator using the Into trait. Read more
    source§

    fn map_results<F, T, U, E>(self, f: F) -> MapOk<Self, F>
    where - Self: Iterator<Item = Result<T, E>> + Sized, - F: FnMut(T) -> U,

    👎Deprecated since 0.10.0: Use .map_ok() instead
    See .map_ok().
    source§

    fn map_ok<F, T, U, E>(self, f: F) -> MapOk<Self, F>
    where + Self::Item: Into<R>,

    Convert each item of the iterator using the Into trait. Read more
    source§

    fn map_ok<F, T, U, E>(self, f: F) -> MapOk<Self, F>
    where Self: Iterator<Item = Result<T, E>> + Sized, F: FnMut(T) -> U,

    Return an iterator adaptor that applies the provided closure to every Result::Ok value. Result::Err values are -unchanged. Read more
    source§

    fn filter_ok<F, T, E>(self, f: F) -> FilterOk<Self, F> ⓘ
    where +unchanged. Read more

    source§

    fn filter_ok<F, T, E>(self, f: F) -> FilterOk<Self, F> ⓘ
    where Self: Iterator<Item = Result<T, E>> + Sized, F: FnMut(&T) -> bool,

    Return an iterator adaptor that filters every Result::Ok value with the provided closure. Result::Err values are -unchanged. Read more
    source§

    fn filter_map_ok<F, T, U, E>(self, f: F) -> FilterMapOk<Self, F> ⓘ
    where +unchanged. Read more

    source§

    fn filter_map_ok<F, T, U, E>(self, f: F) -> FilterMapOk<Self, F> ⓘ
    where Self: Iterator<Item = Result<T, E>> + Sized, F: FnMut(T) -> Option<U>,

    Return an iterator adaptor that filters and transforms every Result::Ok value with the provided closure. Result::Err -values are unchanged. Read more
    source§

    fn flatten_ok<T, E>(self) -> FlattenOk<Self, T, E> ⓘ
    where +values are unchanged. Read more

    source§

    fn flatten_ok<T, E>(self) -> FlattenOk<Self, T, E> ⓘ
    where Self: Iterator<Item = Result<T, E>> + Sized, T: IntoIterator,

    Return an iterator adaptor that flattens every Result::Ok value into -a series of Result::Ok values. Result::Err values are unchanged. Read more
    source§

    fn process_results<F, T, E, R>(self, processor: F) -> Result<R, E>
    where +a series of Result::Ok values. Result::Err values are unchanged. Read more

    source§

    fn process_results<F, T, E, R>(self, processor: F) -> Result<R, E>
    where Self: Iterator<Item = Result<T, E>> + Sized, F: FnOnce(ProcessResults<'_, Self, E>) -> R,

    “Lift” a function of the values of the current iterator so as to process -an iterator of Result values instead. Read more
    source§

    fn merge<J>(self, other: J) -> Merge<Self, J::IntoIter>
    where +an iterator of Result values instead. Read more

    source§

    fn merge<J>(self, other: J) -> Merge<Self, J::IntoIter>
    where Self: Sized, Self::Item: PartialOrd, J: IntoIterator<Item = Self::Item>,

    Return an iterator adaptor that merges the two base iterators in ascending order. If both base iterators are sorted (ascending), the -result is sorted. Read more
    source§

    fn merge_by<J, F>(self, other: J, is_first: F) -> MergeBy<Self, J::IntoIter, F> ⓘ
    where +result is sorted. Read more

    source§

    fn merge_by<J, F>(self, other: J, is_first: F) -> MergeBy<Self, J::IntoIter, F> ⓘ
    where Self: Sized, J: IntoIterator<Item = Self::Item>, F: FnMut(&Self::Item, &Self::Item) -> bool,

    Return an iterator adaptor that merges the two base iterators in order. -This is much like .merge() but allows for a custom ordering. Read more
    source§

    fn merge_join_by<J, F, T>( +This is much like .merge() but allows for a custom ordering. Read more

    source§

    fn merge_join_by<J, F, T>( self, other: J, cmp_fn: F @@ -311,284 +312,295 @@ This is much like IntoIterator, F: FnMut(&Self::Item, &J::Item) -> T, Self: Sized,

    Create an iterator that merges items from both this and the specified -iterator in ascending order. Read more
    source§

    fn kmerge(self) -> KMerge<<Self::Item as IntoIterator>::IntoIter>
    where +iterator in ascending order. Read more

    source§

    fn kmerge(self) -> KMerge<<Self::Item as IntoIterator>::IntoIter>
    where Self: Sized, Self::Item: IntoIterator, <Self::Item as IntoIterator>::Item: PartialOrd,

    Return an iterator adaptor that flattens an iterator of iterators by -merging them in ascending order. Read more
    source§

    fn kmerge_by<F>( +merging them in ascending order. Read more

    source§

    fn kmerge_by<F>( self, first: F ) -> KMergeBy<<Self::Item as IntoIterator>::IntoIter, F> ⓘ
    where Self: Sized, Self::Item: IntoIterator, F: FnMut(&<Self::Item as IntoIterator>::Item, &<Self::Item as IntoIterator>::Item) -> bool,

    Return an iterator adaptor that flattens an iterator of iterators by -merging them according to the given closure. Read more
    source§

    fn cartesian_product<J>(self, other: J) -> Product<Self, J::IntoIter> ⓘ
    where +merging them according to the given closure. Read more

    source§

    fn cartesian_product<J>(self, other: J) -> Product<Self, J::IntoIter> ⓘ
    where Self: Sized, Self::Item: Clone, J: IntoIterator, J::IntoIter: Clone,

    Return an iterator adaptor that iterates over the cartesian product of -the element sets of two iterators self and J. Read more
    source§

    fn multi_cartesian_product( +the element sets of two iterators self and J. Read more

    source§

    fn multi_cartesian_product( self ) -> MultiProduct<<Self::Item as IntoIterator>::IntoIter> ⓘ
    where Self: Sized, Self::Item: IntoIterator, <Self::Item as IntoIterator>::IntoIter: Clone, <Self::Item as IntoIterator>::Item: Clone,

    Return an iterator adaptor that iterates over the cartesian product of -all subiterators returned by meta-iterator self. Read more
    source§

    fn coalesce<F>(self, f: F) -> Coalesce<Self, F>
    where +all subiterators returned by meta-iterator self. Read more

    source§

    fn coalesce<F>(self, f: F) -> Coalesce<Self, F>
    where Self: Sized, F: FnMut(Self::Item, Self::Item) -> Result<Self::Item, (Self::Item, Self::Item)>,

    Return an iterator adaptor that uses the passed-in closure to -optionally merge together consecutive elements. Read more
    source§

    fn dedup(self) -> Dedup<Self>
    where +optionally merge together consecutive elements. Read more

    source§

    fn dedup(self) -> Dedup<Self>
    where Self: Sized, Self::Item: PartialEq,

    Remove duplicates from sections of consecutive identical elements. -If the iterator is sorted, all elements will be unique. Read more
    source§

    fn dedup_by<Cmp>(self, cmp: Cmp) -> DedupBy<Self, Cmp>
    where +If the iterator is sorted, all elements will be unique. Read more

    source§

    fn dedup_by<Cmp>(self, cmp: Cmp) -> DedupBy<Self, Cmp>
    where Self: Sized, Cmp: FnMut(&Self::Item, &Self::Item) -> bool,

    Remove duplicates from sections of consecutive identical elements, determining equality using a comparison function. -If the iterator is sorted, all elements will be unique. Read more
    source§

    fn dedup_with_count(self) -> DedupWithCount<Self>
    where +If the iterator is sorted, all elements will be unique. Read more

    source§

    fn dedup_with_count(self) -> DedupWithCount<Self>
    where Self: Sized,

    Remove duplicates from sections of consecutive identical elements, while keeping a count of how many repeated elements were present. -If the iterator is sorted, all elements will be unique. Read more
    source§

    fn dedup_by_with_count<Cmp>(self, cmp: Cmp) -> DedupByWithCount<Self, Cmp>
    where +If the iterator is sorted, all elements will be unique. Read more

    source§

    fn dedup_by_with_count<Cmp>(self, cmp: Cmp) -> DedupByWithCount<Self, Cmp>
    where Self: Sized, Cmp: FnMut(&Self::Item, &Self::Item) -> bool,

    Remove duplicates from sections of consecutive identical elements, while keeping a count of how many repeated elements were present. This will determine equality using a comparison function. -If the iterator is sorted, all elements will be unique. Read more
    source§

    fn duplicates(self) -> Duplicates<Self>
    where +If the iterator is sorted, all elements will be unique. Read more

    source§

    fn duplicates(self) -> Duplicates<Self>
    where Self: Sized, Self::Item: Eq + Hash,

    Return an iterator adaptor that produces elements that appear more than once during the -iteration. Duplicates are detected using hash and equality. Read more
    source§

    fn duplicates_by<V, F>(self, f: F) -> DuplicatesBy<Self, V, F>
    where +iteration. Duplicates are detected using hash and equality. Read more

    source§

    fn duplicates_by<V, F>(self, f: F) -> DuplicatesBy<Self, V, F>
    where Self: Sized, V: Eq + Hash, F: FnMut(&Self::Item) -> V,

    Return an iterator adaptor that produces elements that appear more than once during the -iteration. Duplicates are detected using hash and equality. Read more
    source§

    fn unique(self) -> Unique<Self> ⓘ
    where +iteration. Duplicates are detected using hash and equality. Read more

    source§

    fn unique(self) -> Unique<Self> ⓘ
    where Self: Sized, Self::Item: Clone + Eq + Hash,

    Return an iterator adaptor that filters out elements that have already been produced once during the iteration. Duplicates -are detected using hash and equality. Read more
    source§

    fn unique_by<V, F>(self, f: F) -> UniqueBy<Self, V, F> ⓘ
    where +are detected using hash and equality. Read more

    source§

    fn unique_by<V, F>(self, f: F) -> UniqueBy<Self, V, F> ⓘ
    where Self: Sized, V: Eq + Hash, F: FnMut(&Self::Item) -> V,

    Return an iterator adaptor that filters out elements that have -already been produced once during the iteration. Read more
    source§

    fn peeking_take_while<F>(&mut self, accept: F) -> PeekingTakeWhile<'_, Self, F> ⓘ
    where +already been produced once during the iteration. Read more

    source§

    fn peeking_take_while<F>(&mut self, accept: F) -> PeekingTakeWhile<'_, Self, F> ⓘ
    where Self: Sized + PeekingNext, F: FnMut(&Self::Item) -> bool,

    Return an iterator adaptor that borrows from this iterator and -takes items while the closure accept returns true. Read more
    source§

    fn take_while_ref<F>(&mut self, accept: F) -> TakeWhileRef<'_, Self, F> ⓘ
    where +takes items while the closure accept returns true. Read more

    source§

    fn take_while_ref<F>(&mut self, accept: F) -> TakeWhileRef<'_, Self, F> ⓘ
    where Self: Clone, F: FnMut(&Self::Item) -> bool,

    Return an iterator adaptor that borrows from a Clone-able iterator -to only pick off elements while the predicate accept returns true. Read more
    source§

    fn take_while_inclusive<F>(self, accept: F) -> TakeWhileInclusive<Self, F> ⓘ
    where +to only pick off elements while the predicate accept returns true. Read more

    source§

    fn take_while_inclusive<F>(self, accept: F) -> TakeWhileInclusive<Self, F> ⓘ
    where Self: Sized, F: FnMut(&Self::Item) -> bool,

    Returns an iterator adaptor that consumes elements while the given predicate is true, including the element for which the predicate -first returned false. Read more
    source§

    fn while_some<A>(self) -> WhileSome<Self> ⓘ
    where +first returned false. Read more

    source§

    fn while_some<A>(self) -> WhileSome<Self> ⓘ
    where Self: Sized + Iterator<Item = Option<A>>,

    Return an iterator adaptor that filters Option<A> iterator elements -and produces A. Stops on the first None encountered. Read more
    source§

    fn tuple_combinations<T>(self) -> TupleCombinations<Self, T> ⓘ
    where +and produces A. Stops on the first None encountered. Read more

    source§

    fn tuple_combinations<T>(self) -> TupleCombinations<Self, T> ⓘ
    where Self: Sized + Clone, Self::Item: Clone, T: HasCombination<Self>,

    Return an iterator adaptor that iterates over the combinations of the -elements from an iterator. Read more
    source§

    fn combinations(self, k: usize) -> Combinations<Self> ⓘ
    where +elements from an iterator. Read more

    source§

    fn combinations(self, k: usize) -> Combinations<Self> ⓘ
    where Self: Sized, Self::Item: Clone,

    Return an iterator adaptor that iterates over the k-length combinations of -the elements from an iterator. Read more
    source§

    fn combinations_with_replacement( +the elements from an iterator. Read more

    source§

    fn combinations_with_replacement( self, k: usize ) -> CombinationsWithReplacement<Self> ⓘ
    where Self: Sized, Self::Item: Clone,

    Return an iterator that iterates over the k-length combinations of -the elements from an iterator, with replacement. Read more
    source§

    fn permutations(self, k: usize) -> Permutations<Self> ⓘ
    where +the elements from an iterator, with replacement. Read more

    source§

    fn permutations(self, k: usize) -> Permutations<Self> ⓘ
    where Self: Sized, Self::Item: Clone,

    Return an iterator adaptor that iterates over all k-permutations of the -elements from an iterator. Read more
    source§

    fn powerset(self) -> Powerset<Self> ⓘ
    where +elements from an iterator. Read more

    source§

    fn powerset(self) -> Powerset<Self> ⓘ
    where Self: Sized, Self::Item: Clone,

    Return an iterator that iterates through the powerset of the elements from an -iterator. Read more
    source§

    fn pad_using<F>(self, min: usize, f: F) -> PadUsing<Self, F> ⓘ
    where +iterator. Read more

    source§

    fn pad_using<F>(self, min: usize, f: F) -> PadUsing<Self, F> ⓘ
    where Self: Sized, F: FnMut(usize) -> Self::Item,

    Return an iterator adaptor that pads the sequence to a minimum length of -min by filling missing elements using a closure f. Read more
    source§

    fn with_position(self) -> WithPosition<Self> ⓘ
    where +min by filling missing elements using a closure f. Read more

    source§

    fn with_position(self) -> WithPosition<Self> ⓘ
    where Self: Sized,

    Return an iterator adaptor that combines each element with a Position to -ease special-case handling of the first or last elements. Read more
    source§

    fn positions<P>(self, predicate: P) -> Positions<Self, P> ⓘ
    where +ease special-case handling of the first or last elements. Read more

    source§

    fn positions<P>(self, predicate: P) -> Positions<Self, P> ⓘ
    where Self: Sized, P: FnMut(Self::Item) -> bool,

    Return an iterator adaptor that yields the indices of all elements -satisfying a predicate, counted from the start of the iterator. Read more
    source§

    fn update<F>(self, updater: F) -> Update<Self, F> ⓘ
    where +satisfying a predicate, counted from the start of the iterator. Read more

    source§

    fn update<F>(self, updater: F) -> Update<Self, F> ⓘ
    where Self: Sized, F: FnMut(&mut Self::Item),

    Return an iterator adaptor that applies a mutating function -to each element before yielding it. Read more
    source§

    fn next_tuple<T>(&mut self) -> Option<T>
    where +to each element before yielding it. Read more

    source§

    fn next_tuple<T>(&mut self) -> Option<T>
    where Self: Sized + Iterator<Item = T::Item>, T: HomogeneousTuple,

    Advances the iterator and returns the next items grouped in a tuple of -a specific size (up to 12). Read more
    source§

    fn collect_tuple<T>(self) -> Option<T>
    where +a specific size (up to 12). Read more

    source§

    fn collect_tuple<T>(self) -> Option<T>
    where Self: Sized + Iterator<Item = T::Item>, T: HomogeneousTuple,

    Collects all items from the iterator into a tuple of a specific size -(up to 12). Read more
    source§

    fn find_position<P>(&mut self, pred: P) -> Option<(usize, Self::Item)>
    where - P: FnMut(&Self::Item) -> bool,

    Find the position and value of the first element satisfying a predicate. Read more
    source§

    fn find_or_last<P>(self, predicate: P) -> Option<Self::Item>
    where +(up to 12). Read more

    source§

    fn find_position<P>(&mut self, pred: P) -> Option<(usize, Self::Item)>
    where + P: FnMut(&Self::Item) -> bool,

    Find the position and value of the first element satisfying a predicate. Read more
    source§

    fn find_or_last<P>(self, predicate: P) -> Option<Self::Item>
    where Self: Sized, - P: FnMut(&Self::Item) -> bool,

    Find the value of the first element satisfying a predicate or return the last element, if any. Read more
    source§

    fn find_or_first<P>(self, predicate: P) -> Option<Self::Item>
    where + P: FnMut(&Self::Item) -> bool,

    Find the value of the first element satisfying a predicate or return the last element, if any. Read more
    source§

    fn find_or_first<P>(self, predicate: P) -> Option<Self::Item>
    where Self: Sized, - P: FnMut(&Self::Item) -> bool,

    Find the value of the first element satisfying a predicate or return the first element, if any. Read more
    source§

    fn contains<Q>(&mut self, query: &Q) -> bool
    where + P: FnMut(&Self::Item) -> bool,

    Find the value of the first element satisfying a predicate or return the first element, if any. Read more
    source§

    fn contains<Q>(&mut self, query: &Q) -> bool
    where Self: Sized, Self::Item: Borrow<Q>, - Q: PartialEq,

    Returns true if the given item is present in this iterator. Read more
    source§

    fn all_equal(&mut self) -> bool
    where + Q: PartialEq,

    Returns true if the given item is present in this iterator. Read more
    source§

    fn all_equal(&mut self) -> bool
    where Self: Sized, - Self::Item: PartialEq,

    Check whether all elements compare equal. Read more
    source§

    fn all_equal_value( + Self::Item: PartialEq,

    Check whether all elements compare equal. Read more
    source§

    fn all_equal_value( &mut self ) -> Result<Self::Item, Option<(Self::Item, Self::Item)>>
    where Self: Sized, Self::Item: PartialEq,

    If there are elements and they are all equal, return a single copy of that element. If there are no elements, return an Error containing None. If there are elements and they are not all equal, return a tuple containing the first -two non-equal elements found. Read more
    source§

    fn all_unique(&mut self) -> bool
    where +two non-equal elements found. Read more

    source§

    fn all_unique(&mut self) -> bool
    where Self: Sized, - Self::Item: Eq + Hash,

    Check whether all elements are unique (non equal). Read more
    source§

    fn dropping(self, n: usize) -> Self
    where + Self::Item: Eq + Hash,

    Check whether all elements are unique (non equal). Read more
    source§

    fn dropping(self, n: usize) -> Self
    where Self: Sized,

    Consume the first n elements from the iterator eagerly, -and return the same iterator again. Read more
    source§

    fn dropping_back(self, n: usize) -> Self
    where +and return the same iterator again. Read more

    source§

    fn dropping_back(self, n: usize) -> Self
    where Self: Sized + DoubleEndedIterator,

    Consume the last n elements from the iterator eagerly, -and return the same iterator again. Read more
    source§

    fn foreach<F>(self, f: F)
    where - F: FnMut(Self::Item), - Self: Sized,

    👎Deprecated since 0.8.0: Use .for_each() instead
    Run the closure f eagerly on each element of the iterator. Read more
    source§

    fn concat(self) -> Self::Item
    where +and return the same iterator again. Read more

    source§

    fn concat(self) -> Self::Item
    where Self: Sized, - Self::Item: Extend<<<Self as Iterator>::Item as IntoIterator>::Item> + IntoIterator + Default,

    Combine all an iterator’s elements into one element by using Extend. Read more
    source§

    fn collect_vec(self) -> Vec<Self::Item>
    where + Self::Item: Extend<<<Self as Iterator>::Item as IntoIterator>::Item> + IntoIterator + Default,

    Combine all an iterator’s elements into one element by using Extend. Read more
    source§

    fn collect_vec(self) -> Vec<Self::Item>
    where Self: Sized,

    .collect_vec() is simply a type specialization of Iterator::collect, -for convenience.
    source§

    fn try_collect<T, U, E>(self) -> Result<U, E>
    where +for convenience.

    source§

    fn try_collect<T, U, E>(self) -> Result<U, E>
    where Self: Sized + Iterator<Item = Result<T, E>>, Result<U, E>: FromIterator<Result<T, E>>,

    .try_collect() is more convenient way of writing -.collect::<Result<_, _>>() Read more
    source§

    fn set_from<'a, A: 'a, J>(&mut self, from: J) -> usize
    where +.collect::<Result<_, _>>() Read more

    source§

    fn set_from<'a, A: 'a, J>(&mut self, from: J) -> usize
    where Self: Iterator<Item = &'a mut A>, J: IntoIterator<Item = A>,

    Assign to each reference in self from the from iterator, -stopping at the shortest of the two iterators. Read more
    source§

    fn join(&mut self, sep: &str) -> String
    where - Self::Item: Display,

    Combine all iterator elements into one String, separated by sep. Read more
    source§

    fn format(self, sep: &str) -> Format<'_, Self>
    where - Self: Sized,

    Format all iterator elements, separated by sep. Read more
    source§

    fn format_with<F>(self, sep: &str, format: F) -> FormatWith<'_, Self, F>
    where +stopping at the shortest of the two iterators. Read more

    source§

    fn join(&mut self, sep: &str) -> String
    where + Self::Item: Display,

    Combine all iterator elements into one String, separated by sep. Read more
    source§

    fn format(self, sep: &str) -> Format<'_, Self>
    where + Self: Sized,

    Format all iterator elements, separated by sep. Read more
    source§

    fn format_with<F>(self, sep: &str, format: F) -> FormatWith<'_, Self, F>
    where Self: Sized, - F: FnMut(Self::Item, &mut dyn FnMut(&dyn Display) -> Result) -> Result,

    Format all iterator elements, separated by sep. Read more
    source§

    fn fold_results<A, E, B, F>(&mut self, start: B, f: F) -> Result<B, E>
    where + F: FnMut(Self::Item, &mut dyn FnMut(&dyn Display) -> Result) -> Result,

    Format all iterator elements, separated by sep. Read more
    source§

    fn fold_ok<A, E, B, F>(&mut self, start: B, f: F) -> Result<B, E>
    where Self: Iterator<Item = Result<A, E>>, - F: FnMut(B, A) -> B,

    👎Deprecated since 0.10.0: Use .fold_ok() instead
    See .fold_ok().
    source§

    fn fold_ok<A, E, B, F>(&mut self, start: B, f: F) -> Result<B, E>
    where - Self: Iterator<Item = Result<A, E>>, - F: FnMut(B, A) -> B,

    Fold Result values from an iterator. Read more
    source§

    fn fold_options<A, B, F>(&mut self, start: B, f: F) -> Option<B>
    where + F: FnMut(B, A) -> B,

    Fold Result values from an iterator. Read more
    source§

    fn fold_options<A, B, F>(&mut self, start: B, f: F) -> Option<B>
    where Self: Iterator<Item = Option<A>>, - F: FnMut(B, A) -> B,

    Fold Option values from an iterator. Read more
    source§

    fn fold1<F>(self, f: F) -> Option<Self::Item>
    where + F: FnMut(B, A) -> B,

    Fold Option values from an iterator. Read more
    source§

    fn fold1<F>(self, f: F) -> Option<Self::Item>
    where F: FnMut(Self::Item, Self::Item) -> Self::Item, - Self: Sized,

    👎Deprecated since 0.10.2: Use Iterator::reduce instead
    Accumulator of the elements in the iterator. Read more
    source§

    fn tree_fold1<F>(self, f: F) -> Option<Self::Item>
    where + Self: Sized,

    👎Deprecated since 0.10.2: Use Iterator::reduce instead
    Accumulator of the elements in the iterator. Read more
    source§

    fn tree_reduce<F>(self, f: F) -> Option<Self::Item>
    where F: FnMut(Self::Item, Self::Item) -> Self::Item, - Self: Sized,

    Accumulate the elements in the iterator in a tree-like manner. Read more
    source§

    fn fold_while<B, F>(&mut self, init: B, f: F) -> FoldWhile<B>
    where + Self: Sized,

    Accumulate the elements in the iterator in a tree-like manner. Read more
    source§

    fn tree_fold1<F>(self, f: F) -> Option<Self::Item>
    where + F: FnMut(Self::Item, Self::Item) -> Self::Item, + Self: Sized,

    👎Deprecated since 0.13.0: Use .tree_reduce() instead
    See .tree_reduce().
    source§

    fn fold_while<B, F>(&mut self, init: B, f: F) -> FoldWhile<B>
    where Self: Sized, - F: FnMut(B, Self::Item) -> FoldWhile<B>,

    An iterator method that applies a function, producing a single, final value. Read more
    source§

    fn sum1<S>(self) -> Option<S>
    where + F: FnMut(B, Self::Item) -> FoldWhile<B>,

    An iterator method that applies a function, producing a single, final value. Read more
    source§

    fn sum1<S>(self) -> Option<S>
    where Self: Sized, - S: Sum<Self::Item>,

    Iterate over the entire iterator and add all the elements. Read more
    source§

    fn product1<P>(self) -> Option<P>
    where + S: Sum<Self::Item>,

    Iterate over the entire iterator and add all the elements. Read more
    source§

    fn product1<P>(self) -> Option<P>
    where Self: Sized, - P: Product<Self::Item>,

    Iterate over the entire iterator and multiply all the elements. Read more
    source§

    fn sorted_unstable(self) -> IntoIter<Self::Item> ⓘ
    where + P: Product<Self::Item>,

    Iterate over the entire iterator and multiply all the elements. Read more
    source§

    fn sorted_unstable(self) -> IntoIter<Self::Item> ⓘ
    where Self: Sized, - Self::Item: Ord,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_unstable_by<F>(self, cmp: F) -> IntoIter<Self::Item> ⓘ
    where + Self::Item: Ord,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_unstable_by<F>(self, cmp: F) -> IntoIter<Self::Item> ⓘ
    where Self: Sized, - F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_unstable_by_key<K, F>(self, f: F) -> IntoIter<Self::Item> ⓘ
    where + F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_unstable_by_key<K, F>(self, f: F) -> IntoIter<Self::Item> ⓘ
    where Self: Sized, K: Ord, - F: FnMut(&Self::Item) -> K,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted(self) -> IntoIter<Self::Item> ⓘ
    where + F: FnMut(&Self::Item) -> K,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted(self) -> IntoIter<Self::Item> ⓘ
    where Self: Sized, - Self::Item: Ord,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_by<F>(self, cmp: F) -> IntoIter<Self::Item> ⓘ
    where + Self::Item: Ord,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_by<F>(self, cmp: F) -> IntoIter<Self::Item> ⓘ
    where Self: Sized, - F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_by_key<K, F>(self, f: F) -> IntoIter<Self::Item> ⓘ
    where + F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_by_key<K, F>(self, f: F) -> IntoIter<Self::Item> ⓘ
    where Self: Sized, K: Ord, - F: FnMut(&Self::Item) -> K,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_by_cached_key<K, F>(self, f: F) -> IntoIter<Self::Item> ⓘ
    where + F: FnMut(&Self::Item) -> K,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_by_cached_key<K, F>(self, f: F) -> IntoIter<Self::Item> ⓘ
    where Self: Sized, K: Ord, F: FnMut(&Self::Item) -> K,

    Sort all iterator elements into a new iterator in ascending order. The key function is -called exactly once per key. Read more
    source§

    fn k_smallest(self, k: usize) -> IntoIter<Self::Item> ⓘ
    where +called exactly once per key. Read more

    source§

    fn k_smallest(self, k: usize) -> IntoIter<Self::Item> ⓘ
    where Self: Sized, - Self::Item: Ord,

    Sort the k smallest elements into a new iterator, in ascending order. Read more
    source§

    fn partition_map<A, B, F, L, R>(self, predicate: F) -> (A, B)
    where + Self::Item: Ord,

    Sort the k smallest elements into a new iterator, in ascending order. Read more
    source§

    fn k_smallest_by<F>(self, k: usize, cmp: F) -> IntoIter<Self::Item> ⓘ
    where + Self: Sized, + F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Sort the k smallest elements into a new iterator using the provided comparison. Read more
    source§

    fn k_smallest_by_key<F, K>(self, k: usize, key: F) -> IntoIter<Self::Item> ⓘ
    where + Self: Sized, + F: FnMut(&Self::Item) -> K, + K: Ord,

    Return the elements producing the k smallest outputs of the provided function. Read more
    source§

    fn k_largest(self, k: usize) -> IntoIter<Self::Item> ⓘ
    where + Self: Sized, + Self::Item: Ord,

    Sort the k largest elements into a new iterator, in descending order. Read more
    source§

    fn k_largest_by<F>(self, k: usize, cmp: F) -> IntoIter<Self::Item> ⓘ
    where + Self: Sized, + F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Sort the k largest elements into a new iterator using the provided comparison. Read more
    source§

    fn k_largest_by_key<F, K>(self, k: usize, key: F) -> IntoIter<Self::Item> ⓘ
    where + Self: Sized, + F: FnMut(&Self::Item) -> K, + K: Ord,

    Return the elements producing the k largest outputs of the provided function. Read more
    source§

    fn tail(self, n: usize) -> IntoIter<Self::Item> ⓘ
    where + Self: Sized,

    Consumes the iterator and return an iterator of the last n elements. Read more
    source§

    fn partition_map<A, B, F, L, R>(self, predicate: F) -> (A, B)
    where Self: Sized, F: FnMut(Self::Item) -> Either<L, R>, A: Default + Extend<L>, B: Default + Extend<R>,

    Collect all iterator elements into one of two partitions. Unlike Iterator::partition, each partition may -have a distinct type. Read more
    source§

    fn partition_result<A, B, T, E>(self) -> (A, B)
    where +have a distinct type. Read more

    source§

    fn partition_result<A, B, T, E>(self) -> (A, B)
    where Self: Iterator<Item = Result<T, E>> + Sized, A: Default + Extend<T>, B: Default + Extend<E>,

    Partition a sequence of Results into one list of all the Ok elements -and another list of all the Err elements. Read more
    source§

    fn into_group_map<K, V>(self) -> HashMap<K, Vec<V>>
    where +and another list of all the Err elements. Read more

    source§

    fn into_group_map<K, V>(self) -> HashMap<K, Vec<V>>
    where Self: Iterator<Item = (K, V)> + Sized, K: Hash + Eq,

    Return a HashMap of keys mapped to Vecs of values. Keys and values -are taken from (Key, Value) tuple pairs yielded by the input iterator. Read more
    source§

    fn into_group_map_by<K, V, F>(self, f: F) -> HashMap<K, Vec<V>>
    where +are taken from (Key, Value) tuple pairs yielded by the input iterator. Read more

    source§

    fn into_group_map_by<K, V, F>(self, f: F) -> HashMap<K, Vec<V>>
    where Self: Iterator<Item = V> + Sized, K: Hash + Eq, - F: Fn(&V) -> K,

    Return an Iterator on a HashMap. Keys mapped to Vecs of values. The key is specified -in the closure. Read more
    source§

    fn into_grouping_map<K, V>(self) -> GroupingMap<Self>
    where + F: FnMut(&V) -> K,

    Return an Iterator on a HashMap. Keys mapped to Vecs of values. The key is specified +in the closure. Read more
    source§

    fn into_grouping_map<K, V>(self) -> GroupingMap<Self>
    where Self: Iterator<Item = (K, V)> + Sized, K: Hash + Eq,

    Constructs a GroupingMap to be used later with one of the efficient -group-and-fold operations it allows to perform. Read more
    source§

    fn into_grouping_map_by<K, V, F>(self, key_mapper: F) -> GroupingMapBy<Self, F>
    where +group-and-fold operations it allows to perform. Read more

    source§

    fn into_grouping_map_by<K, V, F>(self, key_mapper: F) -> GroupingMapBy<Self, F>
    where Self: Iterator<Item = V> + Sized, K: Hash + Eq, F: FnMut(&V) -> K,

    Constructs a GroupingMap to be used later with one of the efficient -group-and-fold operations it allows to perform. Read more
    source§

    fn min_set(self) -> Vec<Self::Item>
    where +group-and-fold operations it allows to perform. Read more

    source§

    fn min_set(self) -> Vec<Self::Item>
    where Self: Sized, - Self::Item: Ord,

    Return all minimum elements of an iterator. Read more
    source§

    fn min_set_by<F>(self, compare: F) -> Vec<Self::Item>
    where + Self::Item: Ord,

    Return all minimum elements of an iterator. Read more
    source§

    fn min_set_by<F>(self, compare: F) -> Vec<Self::Item>
    where Self: Sized, F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Return all minimum elements of an iterator, as determined by -the specified function. Read more
    source§

    fn min_set_by_key<K, F>(self, key: F) -> Vec<Self::Item>
    where +the specified function. Read more

    source§

    fn min_set_by_key<K, F>(self, key: F) -> Vec<Self::Item>
    where Self: Sized, K: Ord, F: FnMut(&Self::Item) -> K,

    Return all minimum elements of an iterator, as determined by -the specified function. Read more
    source§

    fn max_set(self) -> Vec<Self::Item>
    where +the specified function. Read more

    source§

    fn max_set(self) -> Vec<Self::Item>
    where Self: Sized, - Self::Item: Ord,

    Return all maximum elements of an iterator. Read more
    source§

    fn max_set_by<F>(self, compare: F) -> Vec<Self::Item>
    where + Self::Item: Ord,

    Return all maximum elements of an iterator. Read more
    source§

    fn max_set_by<F>(self, compare: F) -> Vec<Self::Item>
    where Self: Sized, F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Return all maximum elements of an iterator, as determined by -the specified function. Read more
    source§

    fn max_set_by_key<K, F>(self, key: F) -> Vec<Self::Item>
    where +the specified function. Read more

    source§

    fn max_set_by_key<K, F>(self, key: F) -> Vec<Self::Item>
    where Self: Sized, K: Ord, F: FnMut(&Self::Item) -> K,

    Return all maximum elements of an iterator, as determined by -the specified function. Read more
    source§

    fn minmax(self) -> MinMaxResult<Self::Item>
    where +the specified function. Read more

    source§

    fn minmax(self) -> MinMaxResult<Self::Item>
    where Self: Sized, - Self::Item: PartialOrd,

    Return the minimum and maximum elements in the iterator. Read more
    source§

    fn minmax_by_key<K, F>(self, key: F) -> MinMaxResult<Self::Item>
    where + Self::Item: PartialOrd,

    Return the minimum and maximum elements in the iterator. Read more
    source§

    fn minmax_by_key<K, F>(self, key: F) -> MinMaxResult<Self::Item>
    where Self: Sized, K: PartialOrd, F: FnMut(&Self::Item) -> K,

    Return the minimum and maximum element of an iterator, as determined by -the specified function. Read more
    source§

    fn minmax_by<F>(self, compare: F) -> MinMaxResult<Self::Item>
    where +the specified function. Read more

    source§

    fn minmax_by<F>(self, compare: F) -> MinMaxResult<Self::Item>
    where Self: Sized, F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Return the minimum and maximum element of an iterator, as determined by -the specified comparison function. Read more
    source§

    fn position_max(self) -> Option<usize>
    where +the specified comparison function. Read more

    source§

    fn position_max(self) -> Option<usize>
    where Self: Sized, - Self::Item: Ord,

    Return the position of the maximum element in the iterator. Read more
    source§

    fn position_max_by_key<K, F>(self, key: F) -> Option<usize>
    where + Self::Item: Ord,

    Return the position of the maximum element in the iterator. Read more
    source§

    fn position_max_by_key<K, F>(self, key: F) -> Option<usize>
    where Self: Sized, K: Ord, F: FnMut(&Self::Item) -> K,

    Return the position of the maximum element in the iterator, as -determined by the specified function. Read more
    source§

    fn position_max_by<F>(self, compare: F) -> Option<usize>
    where +determined by the specified function. Read more

    source§

    fn position_max_by<F>(self, compare: F) -> Option<usize>
    where Self: Sized, F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Return the position of the maximum element in the iterator, as -determined by the specified comparison function. Read more
    source§

    fn position_min(self) -> Option<usize>
    where +determined by the specified comparison function. Read more

    source§

    fn position_min(self) -> Option<usize>
    where Self: Sized, - Self::Item: Ord,

    Return the position of the minimum element in the iterator. Read more
    source§

    fn position_min_by_key<K, F>(self, key: F) -> Option<usize>
    where + Self::Item: Ord,

    Return the position of the minimum element in the iterator. Read more
    source§

    fn position_min_by_key<K, F>(self, key: F) -> Option<usize>
    where Self: Sized, K: Ord, F: FnMut(&Self::Item) -> K,

    Return the position of the minimum element in the iterator, as -determined by the specified function. Read more
    source§

    fn position_min_by<F>(self, compare: F) -> Option<usize>
    where +determined by the specified function. Read more

    source§

    fn position_min_by<F>(self, compare: F) -> Option<usize>
    where Self: Sized, F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Return the position of the minimum element in the iterator, as -determined by the specified comparison function. Read more
    source§

    fn position_minmax(self) -> MinMaxResult<usize>
    where +determined by the specified comparison function. Read more

    source§

    fn position_minmax(self) -> MinMaxResult<usize>
    where Self: Sized, Self::Item: PartialOrd,

    Return the positions of the minimum and maximum elements in -the iterator. Read more
    source§

    fn position_minmax_by_key<K, F>(self, key: F) -> MinMaxResult<usize>
    where +the iterator. Read more

    source§

    fn position_minmax_by_key<K, F>(self, key: F) -> MinMaxResult<usize>
    where Self: Sized, K: PartialOrd, F: FnMut(&Self::Item) -> K,

    Return the postions of the minimum and maximum elements of an -iterator, as determined by the specified function. Read more
    source§

    fn position_minmax_by<F>(self, compare: F) -> MinMaxResult<usize>
    where +iterator, as determined by the specified function. Read more

    source§

    fn position_minmax_by<F>(self, compare: F) -> MinMaxResult<usize>
    where Self: Sized, F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Return the postions of the minimum and maximum elements of an -iterator, as determined by the specified comparison function. Read more
    source§

    fn exactly_one(self) -> Result<Self::Item, ExactlyOneError<Self>>
    where +iterator, as determined by the specified comparison function. Read more

    source§

    fn exactly_one(self) -> Result<Self::Item, ExactlyOneError<Self>>
    where Self: Sized,

    If the iterator yields exactly one element, that element will be returned, otherwise an error will be returned containing an iterator that has the same output as the input -iterator. Read more
    source§

    fn at_most_one(self) -> Result<Option<Self::Item>, ExactlyOneError<Self>>
    where - Self: Sized,

    If the iterator yields no elements, Ok(None) will be returned. If the iterator yields +iterator. Read more
    source§

    fn at_most_one(self) -> Result<Option<Self::Item>, ExactlyOneError<Self>>
    where + Self: Sized,

    If the iterator yields no elements, Ok(None) will be returned. If the iterator yields exactly one element, that element will be returned, otherwise an error will be returned -containing an iterator that has the same output as the input iterator. Read more
    source§

    fn multipeek(self) -> MultiPeek<Self> ⓘ
    where +containing an iterator that has the same output as the input iterator. Read more

    source§

    fn multipeek(self) -> MultiPeek<Self> ⓘ
    where Self: Sized,

    An iterator adaptor that allows the user to peek at multiple .next() -values without advancing the base iterator. Read more
    source§

    fn counts(self) -> HashMap<Self::Item, usize>
    where +values without advancing the base iterator. Read more

    source§

    fn counts(self) -> HashMap<Self::Item, usize>
    where Self: Sized, Self::Item: Eq + Hash,

    Collect the items in this iterator and return a HashMap which contains each item that appears in the iterator and the number -of times it appears. Read more
    source§

    fn counts_by<K, F>(self, f: F) -> HashMap<K, usize>
    where +of times it appears. Read more

    source§

    fn counts_by<K, F>(self, f: F) -> HashMap<K, usize>
    where Self: Sized, K: Eq + Hash, F: FnMut(Self::Item) -> K,

    Collect the items in this iterator and return a HashMap which contains each item that appears in the iterator and the number of times it appears, -determining identity using a keying function. Read more
    source§

    fn multiunzip<FromI>(self) -> FromI
    where - Self: Sized + MultiUnzip<FromI>,

    Converts an iterator of tuples into a tuple of containers. Read more
    source§

    fn try_len(&self) -> Result<usize, (usize, Option<usize>)>

    Returns the length of the iterator if one exists. +determining identity using a keying function. Read more
    source§

    fn multiunzip<FromI>(self) -> FromI
    where + Self: Sized + MultiUnzip<FromI>,

    Converts an iterator of tuples into a tuple of containers. Read more
    source§

    fn try_len(&self) -> Result<usize, (usize, Option<usize>)>

    Returns the length of the iterator if one exists. Otherwise return self.size_hint(). Read more
    source§

    impl<IT> MultiUnzip<()> for IT
    where IT: Iterator<Item = ()>,

    source§

    fn multiunzip(self)

    Unzip this iterator into multiple collections.
    source§

    impl<IT, A, FromA> MultiUnzip<(FromA,)> for IT
    where IT: Iterator<Item = (A,)>, @@ -691,4 +703,4 @@ Otherwise return self.size_hint(). (FromA, FromB, FromC, FromD, FromE, FromF, FromG, FromH, FromI, FromJ, FromK, FromL)

    Unzip this iterator into multiple collections.
    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 + 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/itertools/structs/struct.Step.html b/itertools/structs/struct.Step.html deleted file mode 100644 index 598bec3e9..000000000 --- a/itertools/structs/struct.Step.html +++ /dev/null @@ -1,675 +0,0 @@ -Step in itertools::structs - Rust
    -

    Struct itertools::structs::Step

    source · 
    pub struct Step<I> { /* private fields */ }
    👎Deprecated since 0.8.0: Use std .step_by() instead
    Expand description

    An iterator adaptor that steps a number elements in the base iterator -for each iteration.

    -

    The iterator steps by yielding the next element from the base iterator, -then skipping forward n-1 elements.

    -

    See .step() for more information.

    -

    Trait Implementations§

    source§

    impl<I: Clone> Clone for Step<I>

    source§

    fn clone(&self) -> Step<I> ⓘ

    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<I: Debug> Debug for Step<I>

    source§

    fn fmt(&self, f: &mut Formatter<'_>) -> Result

    Formats the value using the given formatter. Read more
    source§

    impl<I> ExactSizeIterator for Step<I>
    where - I: ExactSizeIterator,

    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<I> Iterator for Step<I>
    where - I: Iterator,

    §

    type Item = <I as Iterator>::Item

    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

    Auto Trait Implementations§

    §

    impl<I> Freeze for Step<I>
    where - I: Freeze,

    §

    impl<I> RefUnwindSafe for Step<I>
    where - I: RefUnwindSafe,

    §

    impl<I> Send for Step<I>
    where - I: Send,

    §

    impl<I> Sync for Step<I>
    where - I: Sync,

    §

    impl<I> Unpin for Step<I>
    where - I: Unpin,

    §

    impl<I> UnwindSafe for Step<I>
    where - I: 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> IntoEither for T

    source§

    fn into_either(self, into_left: bool) -> Either<Self, Self> ⓘ

    Converts self into a Left variant of Either<Self, Self> -if into_left is true. -Converts self into a Right variant of Either<Self, Self> -otherwise. Read more
    source§

    fn into_either_with<F>(self, into_left: F) -> Either<Self, Self> ⓘ
    where - F: FnOnce(&Self) -> bool,

    Converts self into a Left variant of Either<Self, Self> -if into_left(&self) returns true. -Converts self into a Right variant of Either<Self, Self> -otherwise. Read more
    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> Itertools for T
    where - T: Iterator + ?Sized,

    source§

    fn interleave<J>(self, other: J) -> Interleave<Self, J::IntoIter> ⓘ
    where - J: IntoIterator<Item = Self::Item>, - Self: Sized,

    Alternate elements from two iterators until both have run out. Read more
    source§

    fn interleave_shortest<J>( - self, - other: J -) -> InterleaveShortest<Self, J::IntoIter> ⓘ
    where - J: IntoIterator<Item = Self::Item>, - Self: Sized,

    Alternate elements from two iterators until at least one of them has run -out. Read more
    source§

    fn intersperse(self, element: Self::Item) -> Intersperse<Self>
    where - Self: Sized, - Self::Item: Clone,

    An iterator adaptor to insert a particular value -between each element of the adapted iterator. Read more
    source§

    fn intersperse_with<F>(self, element: F) -> IntersperseWith<Self, F> ⓘ
    where - Self: Sized, - F: FnMut() -> Self::Item,

    An iterator adaptor to insert a particular value created by a function -between each element of the adapted iterator. Read more
    source§

    fn zip_longest<J>(self, other: J) -> ZipLongest<Self, J::IntoIter> ⓘ
    where - J: IntoIterator, - Self: Sized,

    Create an iterator which iterates over both this and the specified -iterator simultaneously, yielding pairs of two optional elements. Read more
    source§

    fn zip_eq<J>(self, other: J) -> ZipEq<Self, J::IntoIter> ⓘ
    where - J: IntoIterator, - Self: Sized,

    Create an iterator which iterates over both this and the specified -iterator simultaneously, yielding pairs of elements. Read more
    source§

    fn batching<B, F>(self, f: F) -> Batching<Self, F> ⓘ
    where - F: FnMut(&mut Self) -> Option<B>, - Self: Sized,

    A “meta iterator adaptor”. Its closure receives a reference to the -iterator and may pick off as many elements as it likes, to produce the -next iterator element. Read more
    source§

    fn group_by<K, F>(self, key: F) -> GroupBy<K, Self, F>
    where - Self: Sized, - F: FnMut(&Self::Item) -> K, - K: PartialEq,

    Return an iterable that can group iterator elements. -Consecutive elements that map to the same key (“runs”), are assigned -to the same group. Read more
    source§

    fn chunks(self, size: usize) -> IntoChunks<Self>
    where - Self: Sized,

    Return an iterable that can chunk the iterator. Read more
    source§

    fn tuple_windows<T>(self) -> TupleWindows<Self, T> ⓘ
    where - Self: Sized + Iterator<Item = T::Item>, - T: HomogeneousTuple, - T::Item: Clone,

    Return an iterator over all contiguous windows producing tuples of -a specific size (up to 12). Read more
    source§

    fn circular_tuple_windows<T>(self) -> CircularTupleWindows<Self, T> ⓘ
    where - Self: Sized + Clone + Iterator<Item = T::Item> + ExactSizeIterator, - T: TupleCollect + Clone, - T::Item: Clone,

    Return an iterator over all windows, wrapping back to the first -elements when the window would otherwise exceed the length of the -iterator, producing tuples of a specific size (up to 12). Read more
    source§

    fn tuples<T>(self) -> Tuples<Self, T> ⓘ
    where - Self: Sized + Iterator<Item = T::Item>, - T: HomogeneousTuple,

    Return an iterator that groups the items in tuples of a specific size -(up to 12). Read more
    source§

    fn tee(self) -> (Tee<Self>, Tee<Self>)
    where - Self: Sized, - Self::Item: Clone,

    Split into an iterator pair that both yield all elements from -the original iterator. Read more
    source§

    fn step(self, n: usize) -> Step<Self> ⓘ
    where - Self: Sized,

    👎Deprecated since 0.8.0: Use std .step_by() instead
    Return an iterator adaptor that steps n elements in the base iterator -for each iteration. Read more
    source§

    fn map_into<R>(self) -> MapInto<Self, R>
    where - Self: Sized, - Self::Item: Into<R>,

    Convert each item of the iterator using the Into trait. Read more
    source§

    fn map_results<F, T, U, E>(self, f: F) -> MapOk<Self, F>
    where - Self: Iterator<Item = Result<T, E>> + Sized, - F: FnMut(T) -> U,

    👎Deprecated since 0.10.0: Use .map_ok() instead
    See .map_ok().
    source§

    fn map_ok<F, T, U, E>(self, f: F) -> MapOk<Self, F>
    where - Self: Iterator<Item = Result<T, E>> + Sized, - F: FnMut(T) -> U,

    Return an iterator adaptor that applies the provided closure -to every Result::Ok value. Result::Err values are -unchanged. Read more
    source§

    fn filter_ok<F, T, E>(self, f: F) -> FilterOk<Self, F> ⓘ
    where - Self: Iterator<Item = Result<T, E>> + Sized, - F: FnMut(&T) -> bool,

    Return an iterator adaptor that filters every Result::Ok -value with the provided closure. Result::Err values are -unchanged. Read more
    source§

    fn filter_map_ok<F, T, U, E>(self, f: F) -> FilterMapOk<Self, F> ⓘ
    where - Self: Iterator<Item = Result<T, E>> + Sized, - F: FnMut(T) -> Option<U>,

    Return an iterator adaptor that filters and transforms every -Result::Ok value with the provided closure. Result::Err -values are unchanged. Read more
    source§

    fn flatten_ok<T, E>(self) -> FlattenOk<Self, T, E> ⓘ
    where - Self: Iterator<Item = Result<T, E>> + Sized, - T: IntoIterator,

    Return an iterator adaptor that flattens every Result::Ok value into -a series of Result::Ok values. Result::Err values are unchanged. Read more
    source§

    fn process_results<F, T, E, R>(self, processor: F) -> Result<R, E>
    where - Self: Iterator<Item = Result<T, E>> + Sized, - F: FnOnce(ProcessResults<'_, Self, E>) -> R,

    “Lift” a function of the values of the current iterator so as to process -an iterator of Result values instead. Read more
    source§

    fn merge<J>(self, other: J) -> Merge<Self, J::IntoIter>
    where - Self: Sized, - Self::Item: PartialOrd, - J: IntoIterator<Item = Self::Item>,

    Return an iterator adaptor that merges the two base iterators in -ascending order. If both base iterators are sorted (ascending), the -result is sorted. Read more
    source§

    fn merge_by<J, F>(self, other: J, is_first: F) -> MergeBy<Self, J::IntoIter, F> ⓘ
    where - Self: Sized, - J: IntoIterator<Item = Self::Item>, - F: FnMut(&Self::Item, &Self::Item) -> bool,

    Return an iterator adaptor that merges the two base iterators in order. -This is much like .merge() but allows for a custom ordering. Read more
    source§

    fn merge_join_by<J, F, T>( - self, - other: J, - cmp_fn: F -) -> MergeJoinBy<Self, J::IntoIter, F>
    where - J: IntoIterator, - F: FnMut(&Self::Item, &J::Item) -> T, - Self: Sized,

    Create an iterator that merges items from both this and the specified -iterator in ascending order. Read more
    source§

    fn kmerge(self) -> KMerge<<Self::Item as IntoIterator>::IntoIter>
    where - Self: Sized, - Self::Item: IntoIterator, - <Self::Item as IntoIterator>::Item: PartialOrd,

    Return an iterator adaptor that flattens an iterator of iterators by -merging them in ascending order. Read more
    source§

    fn kmerge_by<F>( - self, - first: F -) -> KMergeBy<<Self::Item as IntoIterator>::IntoIter, F> ⓘ
    where - Self: Sized, - Self::Item: IntoIterator, - F: FnMut(&<Self::Item as IntoIterator>::Item, &<Self::Item as IntoIterator>::Item) -> bool,

    Return an iterator adaptor that flattens an iterator of iterators by -merging them according to the given closure. Read more
    source§

    fn cartesian_product<J>(self, other: J) -> Product<Self, J::IntoIter> ⓘ
    where - Self: Sized, - Self::Item: Clone, - J: IntoIterator, - J::IntoIter: Clone,

    Return an iterator adaptor that iterates over the cartesian product of -the element sets of two iterators self and J. Read more
    source§

    fn multi_cartesian_product( - self -) -> MultiProduct<<Self::Item as IntoIterator>::IntoIter> ⓘ
    where - Self: Sized, - Self::Item: IntoIterator, - <Self::Item as IntoIterator>::IntoIter: Clone, - <Self::Item as IntoIterator>::Item: Clone,

    Return an iterator adaptor that iterates over the cartesian product of -all subiterators returned by meta-iterator self. Read more
    source§

    fn coalesce<F>(self, f: F) -> Coalesce<Self, F>
    where - Self: Sized, - F: FnMut(Self::Item, Self::Item) -> Result<Self::Item, (Self::Item, Self::Item)>,

    Return an iterator adaptor that uses the passed-in closure to -optionally merge together consecutive elements. Read more
    source§

    fn dedup(self) -> Dedup<Self>
    where - Self: Sized, - Self::Item: PartialEq,

    Remove duplicates from sections of consecutive identical elements. -If the iterator is sorted, all elements will be unique. Read more
    source§

    fn dedup_by<Cmp>(self, cmp: Cmp) -> DedupBy<Self, Cmp>
    where - Self: Sized, - Cmp: FnMut(&Self::Item, &Self::Item) -> bool,

    Remove duplicates from sections of consecutive identical elements, -determining equality using a comparison function. -If the iterator is sorted, all elements will be unique. Read more
    source§

    fn dedup_with_count(self) -> DedupWithCount<Self>
    where - Self: Sized,

    Remove duplicates from sections of consecutive identical elements, while keeping a count of -how many repeated elements were present. -If the iterator is sorted, all elements will be unique. Read more
    source§

    fn dedup_by_with_count<Cmp>(self, cmp: Cmp) -> DedupByWithCount<Self, Cmp>
    where - Self: Sized, - Cmp: FnMut(&Self::Item, &Self::Item) -> bool,

    Remove duplicates from sections of consecutive identical elements, while keeping a count of -how many repeated elements were present. -This will determine equality using a comparison function. -If the iterator is sorted, all elements will be unique. Read more
    source§

    fn duplicates(self) -> Duplicates<Self>
    where - Self: Sized, - Self::Item: Eq + Hash,

    Return an iterator adaptor that produces elements that appear more than once during the -iteration. Duplicates are detected using hash and equality. Read more
    source§

    fn duplicates_by<V, F>(self, f: F) -> DuplicatesBy<Self, V, F>
    where - Self: Sized, - V: Eq + Hash, - F: FnMut(&Self::Item) -> V,

    Return an iterator adaptor that produces elements that appear more than once during the -iteration. Duplicates are detected using hash and equality. Read more
    source§

    fn unique(self) -> Unique<Self> ⓘ
    where - Self: Sized, - Self::Item: Clone + Eq + Hash,

    Return an iterator adaptor that filters out elements that have -already been produced once during the iteration. Duplicates -are detected using hash and equality. Read more
    source§

    fn unique_by<V, F>(self, f: F) -> UniqueBy<Self, V, F> ⓘ
    where - Self: Sized, - V: Eq + Hash, - F: FnMut(&Self::Item) -> V,

    Return an iterator adaptor that filters out elements that have -already been produced once during the iteration. Read more
    source§

    fn peeking_take_while<F>(&mut self, accept: F) -> PeekingTakeWhile<'_, Self, F> ⓘ
    where - Self: Sized + PeekingNext, - F: FnMut(&Self::Item) -> bool,

    Return an iterator adaptor that borrows from this iterator and -takes items while the closure accept returns true. Read more
    source§

    fn take_while_ref<F>(&mut self, accept: F) -> TakeWhileRef<'_, Self, F> ⓘ
    where - Self: Clone, - F: FnMut(&Self::Item) -> bool,

    Return an iterator adaptor that borrows from a Clone-able iterator -to only pick off elements while the predicate accept returns true. Read more
    source§

    fn take_while_inclusive<F>(self, accept: F) -> TakeWhileInclusive<Self, F> ⓘ
    where - Self: Sized, - F: FnMut(&Self::Item) -> bool,

    Returns an iterator adaptor that consumes elements while the given -predicate is true, including the element for which the predicate -first returned false. Read more
    source§

    fn while_some<A>(self) -> WhileSome<Self> ⓘ
    where - Self: Sized + Iterator<Item = Option<A>>,

    Return an iterator adaptor that filters Option<A> iterator elements -and produces A. Stops on the first None encountered. Read more
    source§

    fn tuple_combinations<T>(self) -> TupleCombinations<Self, T> ⓘ
    where - Self: Sized + Clone, - Self::Item: Clone, - T: HasCombination<Self>,

    Return an iterator adaptor that iterates over the combinations of the -elements from an iterator. Read more
    source§

    fn combinations(self, k: usize) -> Combinations<Self> ⓘ
    where - Self: Sized, - Self::Item: Clone,

    Return an iterator adaptor that iterates over the k-length combinations of -the elements from an iterator. Read more
    source§

    fn combinations_with_replacement( - self, - k: usize -) -> CombinationsWithReplacement<Self> ⓘ
    where - Self: Sized, - Self::Item: Clone,

    Return an iterator that iterates over the k-length combinations of -the elements from an iterator, with replacement. Read more
    source§

    fn permutations(self, k: usize) -> Permutations<Self> ⓘ
    where - Self: Sized, - Self::Item: Clone,

    Return an iterator adaptor that iterates over all k-permutations of the -elements from an iterator. Read more
    source§

    fn powerset(self) -> Powerset<Self> ⓘ
    where - Self: Sized, - Self::Item: Clone,

    Return an iterator that iterates through the powerset of the elements from an -iterator. Read more
    source§

    fn pad_using<F>(self, min: usize, f: F) -> PadUsing<Self, F> ⓘ
    where - Self: Sized, - F: FnMut(usize) -> Self::Item,

    Return an iterator adaptor that pads the sequence to a minimum length of -min by filling missing elements using a closure f. Read more
    source§

    fn with_position(self) -> WithPosition<Self> ⓘ
    where - Self: Sized,

    Return an iterator adaptor that combines each element with a Position to -ease special-case handling of the first or last elements. Read more
    source§

    fn positions<P>(self, predicate: P) -> Positions<Self, P> ⓘ
    where - Self: Sized, - P: FnMut(Self::Item) -> bool,

    Return an iterator adaptor that yields the indices of all elements -satisfying a predicate, counted from the start of the iterator. Read more
    source§

    fn update<F>(self, updater: F) -> Update<Self, F> ⓘ
    where - Self: Sized, - F: FnMut(&mut Self::Item),

    Return an iterator adaptor that applies a mutating function -to each element before yielding it. Read more
    source§

    fn next_tuple<T>(&mut self) -> Option<T>
    where - Self: Sized + Iterator<Item = T::Item>, - T: HomogeneousTuple,

    Advances the iterator and returns the next items grouped in a tuple of -a specific size (up to 12). Read more
    source§

    fn collect_tuple<T>(self) -> Option<T>
    where - Self: Sized + Iterator<Item = T::Item>, - T: HomogeneousTuple,

    Collects all items from the iterator into a tuple of a specific size -(up to 12). Read more
    source§

    fn find_position<P>(&mut self, pred: P) -> Option<(usize, Self::Item)>
    where - P: FnMut(&Self::Item) -> bool,

    Find the position and value of the first element satisfying a predicate. Read more
    source§

    fn find_or_last<P>(self, predicate: P) -> Option<Self::Item>
    where - Self: Sized, - P: FnMut(&Self::Item) -> bool,

    Find the value of the first element satisfying a predicate or return the last element, if any. Read more
    source§

    fn find_or_first<P>(self, predicate: P) -> Option<Self::Item>
    where - Self: Sized, - P: FnMut(&Self::Item) -> bool,

    Find the value of the first element satisfying a predicate or return the first element, if any. Read more
    source§

    fn contains<Q>(&mut self, query: &Q) -> bool
    where - Self: Sized, - Self::Item: Borrow<Q>, - Q: PartialEq,

    Returns true if the given item is present in this iterator. Read more
    source§

    fn all_equal(&mut self) -> bool
    where - Self: Sized, - Self::Item: PartialEq,

    Check whether all elements compare equal. Read more
    source§

    fn all_equal_value( - &mut self -) -> Result<Self::Item, Option<(Self::Item, Self::Item)>>
    where - Self: Sized, - Self::Item: PartialEq,

    If there are elements and they are all equal, return a single copy of that element. -If there are no elements, return an Error containing None. -If there are elements and they are not all equal, return a tuple containing the first -two non-equal elements found. Read more
    source§

    fn all_unique(&mut self) -> bool
    where - Self: Sized, - Self::Item: Eq + Hash,

    Check whether all elements are unique (non equal). Read more
    source§

    fn dropping(self, n: usize) -> Self
    where - Self: Sized,

    Consume the first n elements from the iterator eagerly, -and return the same iterator again. Read more
    source§

    fn dropping_back(self, n: usize) -> Self
    where - Self: Sized + DoubleEndedIterator,

    Consume the last n elements from the iterator eagerly, -and return the same iterator again. Read more
    source§

    fn foreach<F>(self, f: F)
    where - F: FnMut(Self::Item), - Self: Sized,

    👎Deprecated since 0.8.0: Use .for_each() instead
    Run the closure f eagerly on each element of the iterator. Read more
    source§

    fn concat(self) -> Self::Item
    where - Self: Sized, - Self::Item: Extend<<<Self as Iterator>::Item as IntoIterator>::Item> + IntoIterator + Default,

    Combine all an iterator’s elements into one element by using Extend. Read more
    source§

    fn collect_vec(self) -> Vec<Self::Item>
    where - Self: Sized,

    .collect_vec() is simply a type specialization of Iterator::collect, -for convenience.
    source§

    fn try_collect<T, U, E>(self) -> Result<U, E>
    where - Self: Sized + Iterator<Item = Result<T, E>>, - Result<U, E>: FromIterator<Result<T, E>>,

    .try_collect() is more convenient way of writing -.collect::<Result<_, _>>() Read more
    source§

    fn set_from<'a, A: 'a, J>(&mut self, from: J) -> usize
    where - Self: Iterator<Item = &'a mut A>, - J: IntoIterator<Item = A>,

    Assign to each reference in self from the from iterator, -stopping at the shortest of the two iterators. Read more
    source§

    fn join(&mut self, sep: &str) -> String
    where - Self::Item: Display,

    Combine all iterator elements into one String, separated by sep. Read more
    source§

    fn format(self, sep: &str) -> Format<'_, Self>
    where - Self: Sized,

    Format all iterator elements, separated by sep. Read more
    source§

    fn format_with<F>(self, sep: &str, format: F) -> FormatWith<'_, Self, F>
    where - Self: Sized, - F: FnMut(Self::Item, &mut dyn FnMut(&dyn Display) -> Result) -> Result,

    Format all iterator elements, separated by sep. Read more
    source§

    fn fold_results<A, E, B, F>(&mut self, start: B, f: F) -> Result<B, E>
    where - Self: Iterator<Item = Result<A, E>>, - F: FnMut(B, A) -> B,

    👎Deprecated since 0.10.0: Use .fold_ok() instead
    See .fold_ok().
    source§

    fn fold_ok<A, E, B, F>(&mut self, start: B, f: F) -> Result<B, E>
    where - Self: Iterator<Item = Result<A, E>>, - F: FnMut(B, A) -> B,

    Fold Result values from an iterator. Read more
    source§

    fn fold_options<A, B, F>(&mut self, start: B, f: F) -> Option<B>
    where - Self: Iterator<Item = Option<A>>, - F: FnMut(B, A) -> B,

    Fold Option values from an iterator. Read more
    source§

    fn fold1<F>(self, f: F) -> Option<Self::Item>
    where - F: FnMut(Self::Item, Self::Item) -> Self::Item, - Self: Sized,

    👎Deprecated since 0.10.2: Use Iterator::reduce instead
    Accumulator of the elements in the iterator. Read more
    source§

    fn tree_fold1<F>(self, f: F) -> Option<Self::Item>
    where - F: FnMut(Self::Item, Self::Item) -> Self::Item, - Self: Sized,

    Accumulate the elements in the iterator in a tree-like manner. Read more
    source§

    fn fold_while<B, F>(&mut self, init: B, f: F) -> FoldWhile<B>
    where - Self: Sized, - F: FnMut(B, Self::Item) -> FoldWhile<B>,

    An iterator method that applies a function, producing a single, final value. Read more
    source§

    fn sum1<S>(self) -> Option<S>
    where - Self: Sized, - S: Sum<Self::Item>,

    Iterate over the entire iterator and add all the elements. Read more
    source§

    fn product1<P>(self) -> Option<P>
    where - Self: Sized, - P: Product<Self::Item>,

    Iterate over the entire iterator and multiply all the elements. Read more
    source§

    fn sorted_unstable(self) -> IntoIter<Self::Item> ⓘ
    where - Self: Sized, - Self::Item: Ord,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_unstable_by<F>(self, cmp: F) -> IntoIter<Self::Item> ⓘ
    where - Self: Sized, - F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_unstable_by_key<K, F>(self, f: F) -> IntoIter<Self::Item> ⓘ
    where - Self: Sized, - K: Ord, - F: FnMut(&Self::Item) -> K,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted(self) -> IntoIter<Self::Item> ⓘ
    where - Self: Sized, - Self::Item: Ord,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_by<F>(self, cmp: F) -> IntoIter<Self::Item> ⓘ
    where - Self: Sized, - F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_by_key<K, F>(self, f: F) -> IntoIter<Self::Item> ⓘ
    where - Self: Sized, - K: Ord, - F: FnMut(&Self::Item) -> K,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_by_cached_key<K, F>(self, f: F) -> IntoIter<Self::Item> ⓘ
    where - Self: Sized, - K: Ord, - F: FnMut(&Self::Item) -> K,

    Sort all iterator elements into a new iterator in ascending order. The key function is -called exactly once per key. Read more
    source§

    fn k_smallest(self, k: usize) -> IntoIter<Self::Item> ⓘ
    where - Self: Sized, - Self::Item: Ord,

    Sort the k smallest elements into a new iterator, in ascending order. Read more
    source§

    fn partition_map<A, B, F, L, R>(self, predicate: F) -> (A, B)
    where - Self: Sized, - F: FnMut(Self::Item) -> Either<L, R>, - A: Default + Extend<L>, - B: Default + Extend<R>,

    Collect all iterator elements into one of two -partitions. Unlike Iterator::partition, each partition may -have a distinct type. Read more
    source§

    fn partition_result<A, B, T, E>(self) -> (A, B)
    where - Self: Iterator<Item = Result<T, E>> + Sized, - A: Default + Extend<T>, - B: Default + Extend<E>,

    Partition a sequence of Results into one list of all the Ok elements -and another list of all the Err elements. Read more
    source§

    fn into_group_map<K, V>(self) -> HashMap<K, Vec<V>>
    where - Self: Iterator<Item = (K, V)> + Sized, - K: Hash + Eq,

    Return a HashMap of keys mapped to Vecs of values. Keys and values -are taken from (Key, Value) tuple pairs yielded by the input iterator. Read more
    source§

    fn into_group_map_by<K, V, F>(self, f: F) -> HashMap<K, Vec<V>>
    where - Self: Iterator<Item = V> + Sized, - K: Hash + Eq, - F: Fn(&V) -> K,

    Return an Iterator on a HashMap. Keys mapped to Vecs of values. The key is specified -in the closure. Read more
    source§

    fn into_grouping_map<K, V>(self) -> GroupingMap<Self>
    where - Self: Iterator<Item = (K, V)> + Sized, - K: Hash + Eq,

    Constructs a GroupingMap to be used later with one of the efficient -group-and-fold operations it allows to perform. Read more
    source§

    fn into_grouping_map_by<K, V, F>(self, key_mapper: F) -> GroupingMapBy<Self, F>
    where - Self: Iterator<Item = V> + Sized, - K: Hash + Eq, - F: FnMut(&V) -> K,

    Constructs a GroupingMap to be used later with one of the efficient -group-and-fold operations it allows to perform. Read more
    source§

    fn min_set(self) -> Vec<Self::Item>
    where - Self: Sized, - Self::Item: Ord,

    Return all minimum elements of an iterator. Read more
    source§

    fn min_set_by<F>(self, compare: F) -> Vec<Self::Item>
    where - Self: Sized, - F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Return all minimum elements of an iterator, as determined by -the specified function. Read more
    source§

    fn min_set_by_key<K, F>(self, key: F) -> Vec<Self::Item>
    where - Self: Sized, - K: Ord, - F: FnMut(&Self::Item) -> K,

    Return all minimum elements of an iterator, as determined by -the specified function. Read more
    source§

    fn max_set(self) -> Vec<Self::Item>
    where - Self: Sized, - Self::Item: Ord,

    Return all maximum elements of an iterator. Read more
    source§

    fn max_set_by<F>(self, compare: F) -> Vec<Self::Item>
    where - Self: Sized, - F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Return all maximum elements of an iterator, as determined by -the specified function. Read more
    source§

    fn max_set_by_key<K, F>(self, key: F) -> Vec<Self::Item>
    where - Self: Sized, - K: Ord, - F: FnMut(&Self::Item) -> K,

    Return all maximum elements of an iterator, as determined by -the specified function. Read more
    source§

    fn minmax(self) -> MinMaxResult<Self::Item>
    where - Self: Sized, - Self::Item: PartialOrd,

    Return the minimum and maximum elements in the iterator. Read more
    source§

    fn minmax_by_key<K, F>(self, key: F) -> MinMaxResult<Self::Item>
    where - Self: Sized, - K: PartialOrd, - F: FnMut(&Self::Item) -> K,

    Return the minimum and maximum element of an iterator, as determined by -the specified function. Read more
    source§

    fn minmax_by<F>(self, compare: F) -> MinMaxResult<Self::Item>
    where - Self: Sized, - F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Return the minimum and maximum element of an iterator, as determined by -the specified comparison function. Read more
    source§

    fn position_max(self) -> Option<usize>
    where - Self: Sized, - Self::Item: Ord,

    Return the position of the maximum element in the iterator. Read more
    source§

    fn position_max_by_key<K, F>(self, key: F) -> Option<usize>
    where - Self: Sized, - K: Ord, - F: FnMut(&Self::Item) -> K,

    Return the position of the maximum element in the iterator, as -determined by the specified function. Read more
    source§

    fn position_max_by<F>(self, compare: F) -> Option<usize>
    where - Self: Sized, - F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Return the position of the maximum element in the iterator, as -determined by the specified comparison function. Read more
    source§

    fn position_min(self) -> Option<usize>
    where - Self: Sized, - Self::Item: Ord,

    Return the position of the minimum element in the iterator. Read more
    source§

    fn position_min_by_key<K, F>(self, key: F) -> Option<usize>
    where - Self: Sized, - K: Ord, - F: FnMut(&Self::Item) -> K,

    Return the position of the minimum element in the iterator, as -determined by the specified function. Read more
    source§

    fn position_min_by<F>(self, compare: F) -> Option<usize>
    where - Self: Sized, - F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Return the position of the minimum element in the iterator, as -determined by the specified comparison function. Read more
    source§

    fn position_minmax(self) -> MinMaxResult<usize>
    where - Self: Sized, - Self::Item: PartialOrd,

    Return the positions of the minimum and maximum elements in -the iterator. Read more
    source§

    fn position_minmax_by_key<K, F>(self, key: F) -> MinMaxResult<usize>
    where - Self: Sized, - K: PartialOrd, - F: FnMut(&Self::Item) -> K,

    Return the postions of the minimum and maximum elements of an -iterator, as determined by the specified function. Read more
    source§

    fn position_minmax_by<F>(self, compare: F) -> MinMaxResult<usize>
    where - Self: Sized, - F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Return the postions of the minimum and maximum elements of an -iterator, as determined by the specified comparison function. Read more
    source§

    fn exactly_one(self) -> Result<Self::Item, ExactlyOneError<Self>>
    where - Self: Sized,

    If the iterator yields exactly one element, that element will be returned, otherwise -an error will be returned containing an iterator that has the same output as the input -iterator. Read more
    source§

    fn at_most_one(self) -> Result<Option<Self::Item>, ExactlyOneError<Self>>
    where - Self: Sized,

    If the iterator yields no elements, Ok(None) will be returned. If the iterator yields -exactly one element, that element will be returned, otherwise an error will be returned -containing an iterator that has the same output as the input iterator. Read more
    source§

    fn multipeek(self) -> MultiPeek<Self> ⓘ
    where - Self: Sized,

    An iterator adaptor that allows the user to peek at multiple .next() -values without advancing the base iterator. Read more
    source§

    fn counts(self) -> HashMap<Self::Item, usize>
    where - Self: Sized, - Self::Item: Eq + Hash,

    Collect the items in this iterator and return a HashMap which -contains each item that appears in the iterator and the number -of times it appears. Read more
    source§

    fn counts_by<K, F>(self, f: F) -> HashMap<K, usize>
    where - Self: Sized, - K: Eq + Hash, - F: FnMut(Self::Item) -> K,

    Collect the items in this iterator and return a HashMap which -contains each item that appears in the iterator and the number -of times it appears, -determining identity using a keying function. Read more
    source§

    fn multiunzip<FromI>(self) -> FromI
    where - Self: Sized + MultiUnzip<FromI>,

    Converts an iterator of tuples into a tuple of containers. Read more
    source§

    fn try_len(&self) -> Result<usize, (usize, Option<usize>)>

    Returns the length of the iterator if one exists. -Otherwise return self.size_hint(). Read more
    source§

    impl<IT> MultiUnzip<()> for IT
    where - IT: Iterator<Item = ()>,

    source§

    fn multiunzip(self)

    Unzip this iterator into multiple collections.
    source§

    impl<IT, A, FromA> MultiUnzip<(FromA,)> for IT
    where - IT: Iterator<Item = (A,)>, - FromA: Default + Extend<A>,

    source§

    fn multiunzip(self) -> (FromA,)

    Unzip this iterator into multiple collections.
    source§

    impl<IT, A, FromA, B, FromB> MultiUnzip<(FromA, FromB)> for IT
    where - IT: Iterator<Item = (A, B)>, - FromA: Default + Extend<A>, - FromB: Default + Extend<B>,

    source§

    fn multiunzip(self) -> (FromA, FromB)

    Unzip this iterator into multiple collections.
    source§

    impl<IT, A, FromA, B, FromB, C, FromC> MultiUnzip<(FromA, FromB, FromC)> for IT
    where - IT: Iterator<Item = (A, B, C)>, - FromA: Default + Extend<A>, - FromB: Default + Extend<B>, - FromC: Default + Extend<C>,

    source§

    fn multiunzip(self) -> (FromA, FromB, FromC)

    Unzip this iterator into multiple collections.
    source§

    impl<IT, A, FromA, B, FromB, C, FromC, D, FromD> MultiUnzip<(FromA, FromB, FromC, FromD)> for IT
    where - IT: Iterator<Item = (A, B, C, D)>, - FromA: Default + Extend<A>, - FromB: Default + Extend<B>, - FromC: Default + Extend<C>, - FromD: Default + Extend<D>,

    source§

    fn multiunzip(self) -> (FromA, FromB, FromC, FromD)

    Unzip this iterator into multiple collections.
    source§

    impl<IT, A, FromA, B, FromB, C, FromC, D, FromD, E, FromE> MultiUnzip<(FromA, FromB, FromC, FromD, FromE)> for IT
    where - IT: Iterator<Item = (A, B, C, D, E)>, - FromA: Default + Extend<A>, - FromB: Default + Extend<B>, - FromC: Default + Extend<C>, - FromD: Default + Extend<D>, - FromE: Default + Extend<E>,

    source§

    fn multiunzip(self) -> (FromA, FromB, FromC, FromD, FromE)

    Unzip this iterator into multiple collections.
    source§

    impl<IT, A, FromA, B, FromB, C, FromC, D, FromD, E, FromE, F, FromF> MultiUnzip<(FromA, FromB, FromC, FromD, FromE, FromF)> for IT
    where - IT: Iterator<Item = (A, B, C, D, E, F)>, - FromA: Default + Extend<A>, - FromB: Default + Extend<B>, - FromC: Default + Extend<C>, - FromD: Default + Extend<D>, - FromE: Default + Extend<E>, - FromF: Default + Extend<F>,

    source§

    fn multiunzip(self) -> (FromA, FromB, FromC, FromD, FromE, FromF)

    Unzip this iterator into multiple collections.
    source§

    impl<IT, A, FromA, B, FromB, C, FromC, D, FromD, E, FromE, F, FromF, G, FromG> MultiUnzip<(FromA, FromB, FromC, FromD, FromE, FromF, FromG)> for IT
    where - IT: Iterator<Item = (A, B, C, D, E, F, G)>, - FromA: Default + Extend<A>, - FromB: Default + Extend<B>, - FromC: Default + Extend<C>, - FromD: Default + Extend<D>, - FromE: Default + Extend<E>, - FromF: Default + Extend<F>, - FromG: Default + Extend<G>,

    source§

    fn multiunzip(self) -> (FromA, FromB, FromC, FromD, FromE, FromF, FromG)

    Unzip this iterator into multiple collections.
    source§

    impl<IT, A, FromA, B, FromB, C, FromC, D, FromD, E, FromE, F, FromF, G, FromG, H, FromH> MultiUnzip<(FromA, FromB, FromC, FromD, FromE, FromF, FromG, FromH)> for IT
    where - IT: Iterator<Item = (A, B, C, D, E, F, G, H)>, - FromA: Default + Extend<A>, - FromB: Default + Extend<B>, - FromC: Default + Extend<C>, - FromD: Default + Extend<D>, - FromE: Default + Extend<E>, - FromF: Default + Extend<F>, - FromG: Default + Extend<G>, - FromH: Default + Extend<H>,

    source§

    fn multiunzip(self) -> (FromA, FromB, FromC, FromD, FromE, FromF, FromG, FromH)

    Unzip this iterator into multiple collections.
    source§

    impl<IT, A, FromA, B, FromB, C, FromC, D, FromD, E, FromE, F, FromF, G, FromG, H, FromH, I, FromI> MultiUnzip<(FromA, FromB, FromC, FromD, FromE, FromF, FromG, FromH, FromI)> for IT
    where - IT: Iterator<Item = (A, B, C, D, E, F, G, H, I)>, - FromA: Default + Extend<A>, - FromB: Default + Extend<B>, - FromC: Default + Extend<C>, - FromD: Default + Extend<D>, - FromE: Default + Extend<E>, - FromF: Default + Extend<F>, - FromG: Default + Extend<G>, - FromH: Default + Extend<H>, - FromI: Default + Extend<I>,

    source§

    fn multiunzip( - self -) -> (FromA, FromB, FromC, FromD, FromE, FromF, FromG, FromH, FromI)

    Unzip this iterator into multiple collections.
    source§

    impl<IT, A, FromA, B, FromB, C, FromC, D, FromD, E, FromE, F, FromF, G, FromG, H, FromH, I, FromI, J, FromJ> MultiUnzip<(FromA, FromB, FromC, FromD, FromE, FromF, FromG, FromH, FromI, FromJ)> for IT
    where - IT: Iterator<Item = (A, B, C, D, E, F, G, H, I, J)>, - FromA: Default + Extend<A>, - FromB: Default + Extend<B>, - FromC: Default + Extend<C>, - FromD: Default + Extend<D>, - FromE: Default + Extend<E>, - FromF: Default + Extend<F>, - FromG: Default + Extend<G>, - FromH: Default + Extend<H>, - FromI: Default + Extend<I>, - FromJ: Default + Extend<J>,

    source§

    fn multiunzip( - self -) -> (FromA, FromB, FromC, FromD, FromE, FromF, FromG, FromH, FromI, FromJ)

    Unzip this iterator into multiple collections.
    source§

    impl<IT, A, FromA, B, FromB, C, FromC, D, FromD, E, FromE, F, FromF, G, FromG, H, FromH, I, FromI, J, FromJ, K, FromK> MultiUnzip<(FromA, FromB, FromC, FromD, FromE, FromF, FromG, FromH, FromI, FromJ, FromK)> for IT
    where - IT: Iterator<Item = (A, B, C, D, E, F, G, H, I, J, K)>, - FromA: Default + Extend<A>, - FromB: Default + Extend<B>, - FromC: Default + Extend<C>, - FromD: Default + Extend<D>, - FromE: Default + Extend<E>, - FromF: Default + Extend<F>, - FromG: Default + Extend<G>, - FromH: Default + Extend<H>, - FromI: Default + Extend<I>, - FromJ: Default + Extend<J>, - FromK: Default + Extend<K>,

    source§

    fn multiunzip( - self -) -> (FromA, FromB, FromC, FromD, FromE, FromF, FromG, FromH, FromI, FromJ, FromK)

    Unzip this iterator into multiple collections.
    source§

    impl<IT, A, FromA, B, FromB, C, FromC, D, FromD, E, FromE, F, FromF, G, FromG, H, FromH, I, FromI, J, FromJ, K, FromK, L, FromL> MultiUnzip<(FromA, FromB, FromC, FromD, FromE, FromF, FromG, FromH, FromI, FromJ, FromK, FromL)> for IT
    where - IT: Iterator<Item = (A, B, C, D, E, F, G, H, I, J, K, L)>, - FromA: Default + Extend<A>, - FromB: Default + Extend<B>, - FromC: Default + Extend<C>, - FromD: Default + Extend<D>, - FromE: Default + Extend<E>, - FromF: Default + Extend<F>, - FromG: Default + Extend<G>, - FromH: Default + Extend<H>, - FromI: Default + Extend<I>, - FromJ: Default + Extend<J>, - FromK: Default + Extend<K>, - FromL: Default + Extend<L>,

    source§

    fn multiunzip( - self -) -> (FromA, FromB, FromC, FromD, FromE, FromF, FromG, FromH, FromI, FromJ, FromK, FromL)

    Unzip this iterator into multiple collections.
    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/itertools/structs/struct.TakeWhileInclusive.html b/itertools/structs/struct.TakeWhileInclusive.html index 742e4d576..020ae75d4 100644 --- a/itertools/structs/struct.TakeWhileInclusive.html +++ b/itertools/structs/struct.TakeWhileInclusive.html @@ -1,13 +1,10 @@ -TakeWhileInclusive in itertools::structs - Rust
    +TakeWhileInclusive in itertools::structs - Rust

    Struct itertools::structs::TakeWhileInclusive

    source · 
    pub struct TakeWhileInclusive<I, F> { /* private fields */ }
    Expand description

    An iterator adaptor that consumes elements while the given predicate is true, including the element for which the predicate first returned false.

    See .take_while_inclusive() for more information.

    -

    Implementations§

    source§

    impl<I, F> TakeWhileInclusive<I, F>
    where - I: Iterator, - F: FnMut(&I::Item) -> bool,

    source

    pub fn new(iter: I, predicate: F) -> Self

    Create a new TakeWhileInclusive from an iterator and a predicate.

    -

    Trait Implementations§

    source§

    impl<I: Clone, F: Clone> Clone for TakeWhileInclusive<I, F>

    source§

    fn clone(&self) -> TakeWhileInclusive<I, F> ⓘ

    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<I, F> Debug for TakeWhileInclusive<I, F>
    where +

    Trait Implementations§

    source§

    impl<I: Clone, F: Clone> Clone for TakeWhileInclusive<I, F>

    source§

    fn clone(&self) -> TakeWhileInclusive<I, F> ⓘ

    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<I, F> Debug for TakeWhileInclusive<I, F>
    where I: Iterator + Debug,

    source§

    fn fmt(&self, f: &mut Formatter<'_>) -> Result

    Formats the value using the given formatter. Read more
    source§

    impl<I, F> Iterator for TakeWhileInclusive<I, F>
    where I: Iterator, F: FnMut(&I::Item) -> bool,

    §

    type Item = <I as Iterator>::Item

    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, Fold>(self, init: B, f: Fold) -> B
    where @@ -216,86 +213,87 @@ otherwise. Right variant of Either<Self, Self> otherwise. Read more

    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> Itertools for T
    where - T: Iterator + ?Sized,

    source§

    fn interleave<J>(self, other: J) -> Interleave<Self, J::IntoIter> ⓘ
    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> Itertools for T
    where + T: Iterator + ?Sized,

    source§

    fn interleave<J>(self, other: J) -> Interleave<Self, J::IntoIter> ⓘ
    where J: IntoIterator<Item = Self::Item>, - Self: Sized,

    Alternate elements from two iterators until both have run out. Read more
    source§

    fn interleave_shortest<J>( + Self: Sized,

    Alternate elements from two iterators until both have run out. Read more
    source§

    fn interleave_shortest<J>( self, other: J ) -> InterleaveShortest<Self, J::IntoIter> ⓘ
    where J: IntoIterator<Item = Self::Item>, Self: Sized,

    Alternate elements from two iterators until at least one of them has run -out. Read more
    source§

    fn intersperse(self, element: Self::Item) -> Intersperse<Self>
    where +out. Read more

    source§

    fn intersperse(self, element: Self::Item) -> Intersperse<Self>
    where Self: Sized, Self::Item: Clone,

    An iterator adaptor to insert a particular value -between each element of the adapted iterator. Read more
    source§

    fn intersperse_with<F>(self, element: F) -> IntersperseWith<Self, F> ⓘ
    where +between each element of the adapted iterator. Read more

    source§

    fn intersperse_with<F>(self, element: F) -> IntersperseWith<Self, F> ⓘ
    where Self: Sized, F: FnMut() -> Self::Item,

    An iterator adaptor to insert a particular value created by a function -between each element of the adapted iterator. Read more
    source§

    fn zip_longest<J>(self, other: J) -> ZipLongest<Self, J::IntoIter> ⓘ
    where +between each element of the adapted iterator. Read more

    source§

    fn get<R>(self, index: R) -> R::Output
    where + Self: Sized, + R: IteratorIndex<Self>,

    Returns an iterator over a subsection of the iterator. Read more
    source§

    fn zip_longest<J>(self, other: J) -> ZipLongest<Self, J::IntoIter> ⓘ
    where J: IntoIterator, Self: Sized,

    Create an iterator which iterates over both this and the specified -iterator simultaneously, yielding pairs of two optional elements. Read more
    source§

    fn zip_eq<J>(self, other: J) -> ZipEq<Self, J::IntoIter> ⓘ
    where +iterator simultaneously, yielding pairs of two optional elements. Read more

    source§

    fn zip_eq<J>(self, other: J) -> ZipEq<Self, J::IntoIter> ⓘ
    where J: IntoIterator, Self: Sized,

    Create an iterator which iterates over both this and the specified -iterator simultaneously, yielding pairs of elements. Read more
    source§

    fn batching<B, F>(self, f: F) -> Batching<Self, F> ⓘ
    where +iterator simultaneously, yielding pairs of elements. Read more

    source§

    fn batching<B, F>(self, f: F) -> Batching<Self, F> ⓘ
    where F: FnMut(&mut Self) -> Option<B>, Self: Sized,

    A “meta iterator adaptor”. Its closure receives a reference to the iterator and may pick off as many elements as it likes, to produce the -next iterator element. Read more
    source§

    fn group_by<K, F>(self, key: F) -> GroupBy<K, Self, F>
    where +next iterator element. Read more

    source§

    fn chunk_by<K, F>(self, key: F) -> ChunkBy<K, Self, F>
    where Self: Sized, F: FnMut(&Self::Item) -> K, K: PartialEq,

    Return an iterable that can group iterator elements. Consecutive elements that map to the same key (“runs”), are assigned -to the same group. Read more
    source§

    fn chunks(self, size: usize) -> IntoChunks<Self>
    where - Self: Sized,

    Return an iterable that can chunk the iterator. Read more
    source§

    fn tuple_windows<T>(self) -> TupleWindows<Self, T> ⓘ
    where +to the same group. Read more

    source§

    fn group_by<K, F>(self, key: F) -> ChunkBy<K, Self, F>
    where + Self: Sized, + F: FnMut(&Self::Item) -> K, + K: PartialEq,

    👎Deprecated since 0.13.0: Use .chunk_by() instead
    See .chunk_by().
    source§

    fn chunks(self, size: usize) -> IntoChunks<Self>
    where + Self: Sized,

    Return an iterable that can chunk the iterator. Read more
    source§

    fn tuple_windows<T>(self) -> TupleWindows<Self, T> ⓘ
    where Self: Sized + Iterator<Item = T::Item>, T: HomogeneousTuple, T::Item: Clone,

    Return an iterator over all contiguous windows producing tuples of -a specific size (up to 12). Read more
    source§

    fn circular_tuple_windows<T>(self) -> CircularTupleWindows<Self, T> ⓘ
    where +a specific size (up to 12). Read more

    source§

    fn circular_tuple_windows<T>(self) -> CircularTupleWindows<Self, T> ⓘ
    where Self: Sized + Clone + Iterator<Item = T::Item> + ExactSizeIterator, T: TupleCollect + Clone, T::Item: Clone,

    Return an iterator over all windows, wrapping back to the first elements when the window would otherwise exceed the length of the -iterator, producing tuples of a specific size (up to 12). Read more
    source§

    fn tuples<T>(self) -> Tuples<Self, T> ⓘ
    where +iterator, producing tuples of a specific size (up to 12). Read more

    source§

    fn tuples<T>(self) -> Tuples<Self, T> ⓘ
    where Self: Sized + Iterator<Item = T::Item>, T: HomogeneousTuple,

    Return an iterator that groups the items in tuples of a specific size -(up to 12). Read more
    source§

    fn tee(self) -> (Tee<Self>, Tee<Self>)
    where +(up to 12). Read more

    source§

    fn tee(self) -> (Tee<Self>, Tee<Self>)
    where Self: Sized, Self::Item: Clone,

    Split into an iterator pair that both yield all elements from -the original iterator. Read more
    source§

    fn step(self, n: usize) -> Step<Self> ⓘ
    where - Self: Sized,

    👎Deprecated since 0.8.0: Use std .step_by() instead
    Return an iterator adaptor that steps n elements in the base iterator -for each iteration. Read more
    source§

    fn map_into<R>(self) -> MapInto<Self, R>
    where +the original iterator. Read more

    source§

    fn map_into<R>(self) -> MapInto<Self, R>
    where Self: Sized, - Self::Item: Into<R>,

    Convert each item of the iterator using the Into trait. Read more
    source§

    fn map_results<F, T, U, E>(self, f: F) -> MapOk<Self, F>
    where - Self: Iterator<Item = Result<T, E>> + Sized, - F: FnMut(T) -> U,

    👎Deprecated since 0.10.0: Use .map_ok() instead
    See .map_ok().
    source§

    fn map_ok<F, T, U, E>(self, f: F) -> MapOk<Self, F>
    where + Self::Item: Into<R>,

    Convert each item of the iterator using the Into trait. Read more
    source§

    fn map_ok<F, T, U, E>(self, f: F) -> MapOk<Self, F>
    where Self: Iterator<Item = Result<T, E>> + Sized, F: FnMut(T) -> U,

    Return an iterator adaptor that applies the provided closure to every Result::Ok value. Result::Err values are -unchanged. Read more
    source§

    fn filter_ok<F, T, E>(self, f: F) -> FilterOk<Self, F> ⓘ
    where +unchanged. Read more

    source§

    fn filter_ok<F, T, E>(self, f: F) -> FilterOk<Self, F> ⓘ
    where Self: Iterator<Item = Result<T, E>> + Sized, F: FnMut(&T) -> bool,

    Return an iterator adaptor that filters every Result::Ok value with the provided closure. Result::Err values are -unchanged. Read more
    source§

    fn filter_map_ok<F, T, U, E>(self, f: F) -> FilterMapOk<Self, F> ⓘ
    where +unchanged. Read more

    source§

    fn filter_map_ok<F, T, U, E>(self, f: F) -> FilterMapOk<Self, F> ⓘ
    where Self: Iterator<Item = Result<T, E>> + Sized, F: FnMut(T) -> Option<U>,

    Return an iterator adaptor that filters and transforms every Result::Ok value with the provided closure. Result::Err -values are unchanged. Read more
    source§

    fn flatten_ok<T, E>(self) -> FlattenOk<Self, T, E> ⓘ
    where +values are unchanged. Read more

    source§

    fn flatten_ok<T, E>(self) -> FlattenOk<Self, T, E> ⓘ
    where Self: Iterator<Item = Result<T, E>> + Sized, T: IntoIterator,

    Return an iterator adaptor that flattens every Result::Ok value into -a series of Result::Ok values. Result::Err values are unchanged. Read more
    source§

    fn process_results<F, T, E, R>(self, processor: F) -> Result<R, E>
    where +a series of Result::Ok values. Result::Err values are unchanged. Read more

    source§

    fn process_results<F, T, E, R>(self, processor: F) -> Result<R, E>
    where Self: Iterator<Item = Result<T, E>> + Sized, F: FnOnce(ProcessResults<'_, Self, E>) -> R,

    “Lift” a function of the values of the current iterator so as to process -an iterator of Result values instead. Read more
    source§

    fn merge<J>(self, other: J) -> Merge<Self, J::IntoIter>
    where +an iterator of Result values instead. Read more

    source§

    fn merge<J>(self, other: J) -> Merge<Self, J::IntoIter>
    where Self: Sized, Self::Item: PartialOrd, J: IntoIterator<Item = Self::Item>,

    Return an iterator adaptor that merges the two base iterators in ascending order. If both base iterators are sorted (ascending), the -result is sorted. Read more
    source§

    fn merge_by<J, F>(self, other: J, is_first: F) -> MergeBy<Self, J::IntoIter, F> ⓘ
    where +result is sorted. Read more

    source§

    fn merge_by<J, F>(self, other: J, is_first: F) -> MergeBy<Self, J::IntoIter, F> ⓘ
    where Self: Sized, J: IntoIterator<Item = Self::Item>, F: FnMut(&Self::Item, &Self::Item) -> bool,

    Return an iterator adaptor that merges the two base iterators in order. -This is much like .merge() but allows for a custom ordering. Read more
    source§

    fn merge_join_by<J, F, T>( +This is much like .merge() but allows for a custom ordering. Read more

    source§

    fn merge_join_by<J, F, T>( self, other: J, cmp_fn: F @@ -303,284 +301,295 @@ This is much like IntoIterator, F: FnMut(&Self::Item, &J::Item) -> T, Self: Sized,

    Create an iterator that merges items from both this and the specified -iterator in ascending order. Read more
    source§

    fn kmerge(self) -> KMerge<<Self::Item as IntoIterator>::IntoIter>
    where +iterator in ascending order. Read more

    source§

    fn kmerge(self) -> KMerge<<Self::Item as IntoIterator>::IntoIter>
    where Self: Sized, Self::Item: IntoIterator, <Self::Item as IntoIterator>::Item: PartialOrd,

    Return an iterator adaptor that flattens an iterator of iterators by -merging them in ascending order. Read more
    source§

    fn kmerge_by<F>( +merging them in ascending order. Read more

    source§

    fn kmerge_by<F>( self, first: F ) -> KMergeBy<<Self::Item as IntoIterator>::IntoIter, F> ⓘ
    where Self: Sized, Self::Item: IntoIterator, F: FnMut(&<Self::Item as IntoIterator>::Item, &<Self::Item as IntoIterator>::Item) -> bool,

    Return an iterator adaptor that flattens an iterator of iterators by -merging them according to the given closure. Read more
    source§

    fn cartesian_product<J>(self, other: J) -> Product<Self, J::IntoIter> ⓘ
    where +merging them according to the given closure. Read more

    source§

    fn cartesian_product<J>(self, other: J) -> Product<Self, J::IntoIter> ⓘ
    where Self: Sized, Self::Item: Clone, J: IntoIterator, J::IntoIter: Clone,

    Return an iterator adaptor that iterates over the cartesian product of -the element sets of two iterators self and J. Read more
    source§

    fn multi_cartesian_product( +the element sets of two iterators self and J. Read more

    source§

    fn multi_cartesian_product( self ) -> MultiProduct<<Self::Item as IntoIterator>::IntoIter> ⓘ
    where Self: Sized, Self::Item: IntoIterator, <Self::Item as IntoIterator>::IntoIter: Clone, <Self::Item as IntoIterator>::Item: Clone,

    Return an iterator adaptor that iterates over the cartesian product of -all subiterators returned by meta-iterator self. Read more
    source§

    fn coalesce<F>(self, f: F) -> Coalesce<Self, F>
    where +all subiterators returned by meta-iterator self. Read more

    source§

    fn coalesce<F>(self, f: F) -> Coalesce<Self, F>
    where Self: Sized, F: FnMut(Self::Item, Self::Item) -> Result<Self::Item, (Self::Item, Self::Item)>,

    Return an iterator adaptor that uses the passed-in closure to -optionally merge together consecutive elements. Read more
    source§

    fn dedup(self) -> Dedup<Self>
    where +optionally merge together consecutive elements. Read more

    source§

    fn dedup(self) -> Dedup<Self>
    where Self: Sized, Self::Item: PartialEq,

    Remove duplicates from sections of consecutive identical elements. -If the iterator is sorted, all elements will be unique. Read more
    source§

    fn dedup_by<Cmp>(self, cmp: Cmp) -> DedupBy<Self, Cmp>
    where +If the iterator is sorted, all elements will be unique. Read more

    source§

    fn dedup_by<Cmp>(self, cmp: Cmp) -> DedupBy<Self, Cmp>
    where Self: Sized, Cmp: FnMut(&Self::Item, &Self::Item) -> bool,

    Remove duplicates from sections of consecutive identical elements, determining equality using a comparison function. -If the iterator is sorted, all elements will be unique. Read more
    source§

    fn dedup_with_count(self) -> DedupWithCount<Self>
    where +If the iterator is sorted, all elements will be unique. Read more

    source§

    fn dedup_with_count(self) -> DedupWithCount<Self>
    where Self: Sized,

    Remove duplicates from sections of consecutive identical elements, while keeping a count of how many repeated elements were present. -If the iterator is sorted, all elements will be unique. Read more
    source§

    fn dedup_by_with_count<Cmp>(self, cmp: Cmp) -> DedupByWithCount<Self, Cmp>
    where +If the iterator is sorted, all elements will be unique. Read more

    source§

    fn dedup_by_with_count<Cmp>(self, cmp: Cmp) -> DedupByWithCount<Self, Cmp>
    where Self: Sized, Cmp: FnMut(&Self::Item, &Self::Item) -> bool,

    Remove duplicates from sections of consecutive identical elements, while keeping a count of how many repeated elements were present. This will determine equality using a comparison function. -If the iterator is sorted, all elements will be unique. Read more
    source§

    fn duplicates(self) -> Duplicates<Self>
    where +If the iterator is sorted, all elements will be unique. Read more

    source§

    fn duplicates(self) -> Duplicates<Self>
    where Self: Sized, Self::Item: Eq + Hash,

    Return an iterator adaptor that produces elements that appear more than once during the -iteration. Duplicates are detected using hash and equality. Read more
    source§

    fn duplicates_by<V, F>(self, f: F) -> DuplicatesBy<Self, V, F>
    where +iteration. Duplicates are detected using hash and equality. Read more

    source§

    fn duplicates_by<V, F>(self, f: F) -> DuplicatesBy<Self, V, F>
    where Self: Sized, V: Eq + Hash, F: FnMut(&Self::Item) -> V,

    Return an iterator adaptor that produces elements that appear more than once during the -iteration. Duplicates are detected using hash and equality. Read more
    source§

    fn unique(self) -> Unique<Self> ⓘ
    where +iteration. Duplicates are detected using hash and equality. Read more

    source§

    fn unique(self) -> Unique<Self> ⓘ
    where Self: Sized, Self::Item: Clone + Eq + Hash,

    Return an iterator adaptor that filters out elements that have already been produced once during the iteration. Duplicates -are detected using hash and equality. Read more
    source§

    fn unique_by<V, F>(self, f: F) -> UniqueBy<Self, V, F> ⓘ
    where +are detected using hash and equality. Read more

    source§

    fn unique_by<V, F>(self, f: F) -> UniqueBy<Self, V, F> ⓘ
    where Self: Sized, V: Eq + Hash, F: FnMut(&Self::Item) -> V,

    Return an iterator adaptor that filters out elements that have -already been produced once during the iteration. Read more
    source§

    fn peeking_take_while<F>(&mut self, accept: F) -> PeekingTakeWhile<'_, Self, F> ⓘ
    where +already been produced once during the iteration. Read more

    source§

    fn peeking_take_while<F>(&mut self, accept: F) -> PeekingTakeWhile<'_, Self, F> ⓘ
    where Self: Sized + PeekingNext, F: FnMut(&Self::Item) -> bool,

    Return an iterator adaptor that borrows from this iterator and -takes items while the closure accept returns true. Read more
    source§

    fn take_while_ref<F>(&mut self, accept: F) -> TakeWhileRef<'_, Self, F> ⓘ
    where +takes items while the closure accept returns true. Read more

    source§

    fn take_while_ref<F>(&mut self, accept: F) -> TakeWhileRef<'_, Self, F> ⓘ
    where Self: Clone, F: FnMut(&Self::Item) -> bool,

    Return an iterator adaptor that borrows from a Clone-able iterator -to only pick off elements while the predicate accept returns true. Read more
    source§

    fn take_while_inclusive<F>(self, accept: F) -> TakeWhileInclusive<Self, F> ⓘ
    where +to only pick off elements while the predicate accept returns true. Read more

    source§

    fn take_while_inclusive<F>(self, accept: F) -> TakeWhileInclusive<Self, F> ⓘ
    where Self: Sized, F: FnMut(&Self::Item) -> bool,

    Returns an iterator adaptor that consumes elements while the given predicate is true, including the element for which the predicate -first returned false. Read more
    source§

    fn while_some<A>(self) -> WhileSome<Self> ⓘ
    where +first returned false. Read more

    source§

    fn while_some<A>(self) -> WhileSome<Self> ⓘ
    where Self: Sized + Iterator<Item = Option<A>>,

    Return an iterator adaptor that filters Option<A> iterator elements -and produces A. Stops on the first None encountered. Read more
    source§

    fn tuple_combinations<T>(self) -> TupleCombinations<Self, T> ⓘ
    where +and produces A. Stops on the first None encountered. Read more

    source§

    fn tuple_combinations<T>(self) -> TupleCombinations<Self, T> ⓘ
    where Self: Sized + Clone, Self::Item: Clone, T: HasCombination<Self>,

    Return an iterator adaptor that iterates over the combinations of the -elements from an iterator. Read more
    source§

    fn combinations(self, k: usize) -> Combinations<Self> ⓘ
    where +elements from an iterator. Read more

    source§

    fn combinations(self, k: usize) -> Combinations<Self> ⓘ
    where Self: Sized, Self::Item: Clone,

    Return an iterator adaptor that iterates over the k-length combinations of -the elements from an iterator. Read more
    source§

    fn combinations_with_replacement( +the elements from an iterator. Read more

    source§

    fn combinations_with_replacement( self, k: usize ) -> CombinationsWithReplacement<Self> ⓘ
    where Self: Sized, Self::Item: Clone,

    Return an iterator that iterates over the k-length combinations of -the elements from an iterator, with replacement. Read more
    source§

    fn permutations(self, k: usize) -> Permutations<Self> ⓘ
    where +the elements from an iterator, with replacement. Read more

    source§

    fn permutations(self, k: usize) -> Permutations<Self> ⓘ
    where Self: Sized, Self::Item: Clone,

    Return an iterator adaptor that iterates over all k-permutations of the -elements from an iterator. Read more
    source§

    fn powerset(self) -> Powerset<Self> ⓘ
    where +elements from an iterator. Read more

    source§

    fn powerset(self) -> Powerset<Self> ⓘ
    where Self: Sized, Self::Item: Clone,

    Return an iterator that iterates through the powerset of the elements from an -iterator. Read more
    source§

    fn pad_using<F>(self, min: usize, f: F) -> PadUsing<Self, F> ⓘ
    where +iterator. Read more

    source§

    fn pad_using<F>(self, min: usize, f: F) -> PadUsing<Self, F> ⓘ
    where Self: Sized, F: FnMut(usize) -> Self::Item,

    Return an iterator adaptor that pads the sequence to a minimum length of -min by filling missing elements using a closure f. Read more
    source§

    fn with_position(self) -> WithPosition<Self> ⓘ
    where +min by filling missing elements using a closure f. Read more

    source§

    fn with_position(self) -> WithPosition<Self> ⓘ
    where Self: Sized,

    Return an iterator adaptor that combines each element with a Position to -ease special-case handling of the first or last elements. Read more
    source§

    fn positions<P>(self, predicate: P) -> Positions<Self, P> ⓘ
    where +ease special-case handling of the first or last elements. Read more

    source§

    fn positions<P>(self, predicate: P) -> Positions<Self, P> ⓘ
    where Self: Sized, P: FnMut(Self::Item) -> bool,

    Return an iterator adaptor that yields the indices of all elements -satisfying a predicate, counted from the start of the iterator. Read more
    source§

    fn update<F>(self, updater: F) -> Update<Self, F> ⓘ
    where +satisfying a predicate, counted from the start of the iterator. Read more

    source§

    fn update<F>(self, updater: F) -> Update<Self, F> ⓘ
    where Self: Sized, F: FnMut(&mut Self::Item),

    Return an iterator adaptor that applies a mutating function -to each element before yielding it. Read more
    source§

    fn next_tuple<T>(&mut self) -> Option<T>
    where +to each element before yielding it. Read more

    source§

    fn next_tuple<T>(&mut self) -> Option<T>
    where Self: Sized + Iterator<Item = T::Item>, T: HomogeneousTuple,

    Advances the iterator and returns the next items grouped in a tuple of -a specific size (up to 12). Read more
    source§

    fn collect_tuple<T>(self) -> Option<T>
    where +a specific size (up to 12). Read more

    source§

    fn collect_tuple<T>(self) -> Option<T>
    where Self: Sized + Iterator<Item = T::Item>, T: HomogeneousTuple,

    Collects all items from the iterator into a tuple of a specific size -(up to 12). Read more
    source§

    fn find_position<P>(&mut self, pred: P) -> Option<(usize, Self::Item)>
    where - P: FnMut(&Self::Item) -> bool,

    Find the position and value of the first element satisfying a predicate. Read more
    source§

    fn find_or_last<P>(self, predicate: P) -> Option<Self::Item>
    where +(up to 12). Read more

    source§

    fn find_position<P>(&mut self, pred: P) -> Option<(usize, Self::Item)>
    where + P: FnMut(&Self::Item) -> bool,

    Find the position and value of the first element satisfying a predicate. Read more
    source§

    fn find_or_last<P>(self, predicate: P) -> Option<Self::Item>
    where Self: Sized, - P: FnMut(&Self::Item) -> bool,

    Find the value of the first element satisfying a predicate or return the last element, if any. Read more
    source§

    fn find_or_first<P>(self, predicate: P) -> Option<Self::Item>
    where + P: FnMut(&Self::Item) -> bool,

    Find the value of the first element satisfying a predicate or return the last element, if any. Read more
    source§

    fn find_or_first<P>(self, predicate: P) -> Option<Self::Item>
    where Self: Sized, - P: FnMut(&Self::Item) -> bool,

    Find the value of the first element satisfying a predicate or return the first element, if any. Read more
    source§

    fn contains<Q>(&mut self, query: &Q) -> bool
    where + P: FnMut(&Self::Item) -> bool,

    Find the value of the first element satisfying a predicate or return the first element, if any. Read more
    source§

    fn contains<Q>(&mut self, query: &Q) -> bool
    where Self: Sized, Self::Item: Borrow<Q>, - Q: PartialEq,

    Returns true if the given item is present in this iterator. Read more
    source§

    fn all_equal(&mut self) -> bool
    where + Q: PartialEq,

    Returns true if the given item is present in this iterator. Read more
    source§

    fn all_equal(&mut self) -> bool
    where Self: Sized, - Self::Item: PartialEq,

    Check whether all elements compare equal. Read more
    source§

    fn all_equal_value( + Self::Item: PartialEq,

    Check whether all elements compare equal. Read more
    source§

    fn all_equal_value( &mut self ) -> Result<Self::Item, Option<(Self::Item, Self::Item)>>
    where Self: Sized, Self::Item: PartialEq,

    If there are elements and they are all equal, return a single copy of that element. If there are no elements, return an Error containing None. If there are elements and they are not all equal, return a tuple containing the first -two non-equal elements found. Read more
    source§

    fn all_unique(&mut self) -> bool
    where +two non-equal elements found. Read more

    source§

    fn all_unique(&mut self) -> bool
    where Self: Sized, - Self::Item: Eq + Hash,

    Check whether all elements are unique (non equal). Read more
    source§

    fn dropping(self, n: usize) -> Self
    where + Self::Item: Eq + Hash,

    Check whether all elements are unique (non equal). Read more
    source§

    fn dropping(self, n: usize) -> Self
    where Self: Sized,

    Consume the first n elements from the iterator eagerly, -and return the same iterator again. Read more
    source§

    fn dropping_back(self, n: usize) -> Self
    where +and return the same iterator again. Read more

    source§

    fn dropping_back(self, n: usize) -> Self
    where Self: Sized + DoubleEndedIterator,

    Consume the last n elements from the iterator eagerly, -and return the same iterator again. Read more
    source§

    fn foreach<F>(self, f: F)
    where - F: FnMut(Self::Item), - Self: Sized,

    👎Deprecated since 0.8.0: Use .for_each() instead
    Run the closure f eagerly on each element of the iterator. Read more
    source§

    fn concat(self) -> Self::Item
    where +and return the same iterator again. Read more

    source§

    fn concat(self) -> Self::Item
    where Self: Sized, - Self::Item: Extend<<<Self as Iterator>::Item as IntoIterator>::Item> + IntoIterator + Default,

    Combine all an iterator’s elements into one element by using Extend. Read more
    source§

    fn collect_vec(self) -> Vec<Self::Item>
    where + Self::Item: Extend<<<Self as Iterator>::Item as IntoIterator>::Item> + IntoIterator + Default,

    Combine all an iterator’s elements into one element by using Extend. Read more
    source§

    fn collect_vec(self) -> Vec<Self::Item>
    where Self: Sized,

    .collect_vec() is simply a type specialization of Iterator::collect, -for convenience.
    source§

    fn try_collect<T, U, E>(self) -> Result<U, E>
    where +for convenience.

    source§

    fn try_collect<T, U, E>(self) -> Result<U, E>
    where Self: Sized + Iterator<Item = Result<T, E>>, Result<U, E>: FromIterator<Result<T, E>>,

    .try_collect() is more convenient way of writing -.collect::<Result<_, _>>() Read more
    source§

    fn set_from<'a, A: 'a, J>(&mut self, from: J) -> usize
    where +.collect::<Result<_, _>>() Read more

    source§

    fn set_from<'a, A: 'a, J>(&mut self, from: J) -> usize
    where Self: Iterator<Item = &'a mut A>, J: IntoIterator<Item = A>,

    Assign to each reference in self from the from iterator, -stopping at the shortest of the two iterators. Read more
    source§

    fn join(&mut self, sep: &str) -> String
    where - Self::Item: Display,

    Combine all iterator elements into one String, separated by sep. Read more
    source§

    fn format(self, sep: &str) -> Format<'_, Self>
    where - Self: Sized,

    Format all iterator elements, separated by sep. Read more
    source§

    fn format_with<F>(self, sep: &str, format: F) -> FormatWith<'_, Self, F>
    where +stopping at the shortest of the two iterators. Read more

    source§

    fn join(&mut self, sep: &str) -> String
    where + Self::Item: Display,

    Combine all iterator elements into one String, separated by sep. Read more
    source§

    fn format(self, sep: &str) -> Format<'_, Self>
    where + Self: Sized,

    Format all iterator elements, separated by sep. Read more
    source§

    fn format_with<F>(self, sep: &str, format: F) -> FormatWith<'_, Self, F>
    where Self: Sized, - F: FnMut(Self::Item, &mut dyn FnMut(&dyn Display) -> Result) -> Result,

    Format all iterator elements, separated by sep. Read more
    source§

    fn fold_results<A, E, B, F>(&mut self, start: B, f: F) -> Result<B, E>
    where + F: FnMut(Self::Item, &mut dyn FnMut(&dyn Display) -> Result) -> Result,

    Format all iterator elements, separated by sep. Read more
    source§

    fn fold_ok<A, E, B, F>(&mut self, start: B, f: F) -> Result<B, E>
    where Self: Iterator<Item = Result<A, E>>, - F: FnMut(B, A) -> B,

    👎Deprecated since 0.10.0: Use .fold_ok() instead
    See .fold_ok().
    source§

    fn fold_ok<A, E, B, F>(&mut self, start: B, f: F) -> Result<B, E>
    where - Self: Iterator<Item = Result<A, E>>, - F: FnMut(B, A) -> B,

    Fold Result values from an iterator. Read more
    source§

    fn fold_options<A, B, F>(&mut self, start: B, f: F) -> Option<B>
    where + F: FnMut(B, A) -> B,

    Fold Result values from an iterator. Read more
    source§

    fn fold_options<A, B, F>(&mut self, start: B, f: F) -> Option<B>
    where Self: Iterator<Item = Option<A>>, - F: FnMut(B, A) -> B,

    Fold Option values from an iterator. Read more
    source§

    fn fold1<F>(self, f: F) -> Option<Self::Item>
    where + F: FnMut(B, A) -> B,

    Fold Option values from an iterator. Read more
    source§

    fn fold1<F>(self, f: F) -> Option<Self::Item>
    where F: FnMut(Self::Item, Self::Item) -> Self::Item, - Self: Sized,

    👎Deprecated since 0.10.2: Use Iterator::reduce instead
    Accumulator of the elements in the iterator. Read more
    source§

    fn tree_fold1<F>(self, f: F) -> Option<Self::Item>
    where + Self: Sized,

    👎Deprecated since 0.10.2: Use Iterator::reduce instead
    Accumulator of the elements in the iterator. Read more
    source§

    fn tree_reduce<F>(self, f: F) -> Option<Self::Item>
    where F: FnMut(Self::Item, Self::Item) -> Self::Item, - Self: Sized,

    Accumulate the elements in the iterator in a tree-like manner. Read more
    source§

    fn fold_while<B, F>(&mut self, init: B, f: F) -> FoldWhile<B>
    where + Self: Sized,

    Accumulate the elements in the iterator in a tree-like manner. Read more
    source§

    fn tree_fold1<F>(self, f: F) -> Option<Self::Item>
    where + F: FnMut(Self::Item, Self::Item) -> Self::Item, + Self: Sized,

    👎Deprecated since 0.13.0: Use .tree_reduce() instead
    See .tree_reduce().
    source§

    fn fold_while<B, F>(&mut self, init: B, f: F) -> FoldWhile<B>
    where Self: Sized, - F: FnMut(B, Self::Item) -> FoldWhile<B>,

    An iterator method that applies a function, producing a single, final value. Read more
    source§

    fn sum1<S>(self) -> Option<S>
    where + F: FnMut(B, Self::Item) -> FoldWhile<B>,

    An iterator method that applies a function, producing a single, final value. Read more
    source§

    fn sum1<S>(self) -> Option<S>
    where Self: Sized, - S: Sum<Self::Item>,

    Iterate over the entire iterator and add all the elements. Read more
    source§

    fn product1<P>(self) -> Option<P>
    where + S: Sum<Self::Item>,

    Iterate over the entire iterator and add all the elements. Read more
    source§

    fn product1<P>(self) -> Option<P>
    where Self: Sized, - P: Product<Self::Item>,

    Iterate over the entire iterator and multiply all the elements. Read more
    source§

    fn sorted_unstable(self) -> IntoIter<Self::Item> ⓘ
    where + P: Product<Self::Item>,

    Iterate over the entire iterator and multiply all the elements. Read more
    source§

    fn sorted_unstable(self) -> IntoIter<Self::Item> ⓘ
    where Self: Sized, - Self::Item: Ord,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_unstable_by<F>(self, cmp: F) -> IntoIter<Self::Item> ⓘ
    where + Self::Item: Ord,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_unstable_by<F>(self, cmp: F) -> IntoIter<Self::Item> ⓘ
    where Self: Sized, - F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_unstable_by_key<K, F>(self, f: F) -> IntoIter<Self::Item> ⓘ
    where + F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_unstable_by_key<K, F>(self, f: F) -> IntoIter<Self::Item> ⓘ
    where Self: Sized, K: Ord, - F: FnMut(&Self::Item) -> K,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted(self) -> IntoIter<Self::Item> ⓘ
    where + F: FnMut(&Self::Item) -> K,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted(self) -> IntoIter<Self::Item> ⓘ
    where Self: Sized, - Self::Item: Ord,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_by<F>(self, cmp: F) -> IntoIter<Self::Item> ⓘ
    where + Self::Item: Ord,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_by<F>(self, cmp: F) -> IntoIter<Self::Item> ⓘ
    where Self: Sized, - F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_by_key<K, F>(self, f: F) -> IntoIter<Self::Item> ⓘ
    where + F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_by_key<K, F>(self, f: F) -> IntoIter<Self::Item> ⓘ
    where Self: Sized, K: Ord, - F: FnMut(&Self::Item) -> K,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_by_cached_key<K, F>(self, f: F) -> IntoIter<Self::Item> ⓘ
    where + F: FnMut(&Self::Item) -> K,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_by_cached_key<K, F>(self, f: F) -> IntoIter<Self::Item> ⓘ
    where Self: Sized, K: Ord, F: FnMut(&Self::Item) -> K,

    Sort all iterator elements into a new iterator in ascending order. The key function is -called exactly once per key. Read more
    source§

    fn k_smallest(self, k: usize) -> IntoIter<Self::Item> ⓘ
    where +called exactly once per key. Read more

    source§

    fn k_smallest(self, k: usize) -> IntoIter<Self::Item> ⓘ
    where Self: Sized, - Self::Item: Ord,

    Sort the k smallest elements into a new iterator, in ascending order. Read more
    source§

    fn partition_map<A, B, F, L, R>(self, predicate: F) -> (A, B)
    where + Self::Item: Ord,

    Sort the k smallest elements into a new iterator, in ascending order. Read more
    source§

    fn k_smallest_by<F>(self, k: usize, cmp: F) -> IntoIter<Self::Item> ⓘ
    where + Self: Sized, + F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Sort the k smallest elements into a new iterator using the provided comparison. Read more
    source§

    fn k_smallest_by_key<F, K>(self, k: usize, key: F) -> IntoIter<Self::Item> ⓘ
    where + Self: Sized, + F: FnMut(&Self::Item) -> K, + K: Ord,

    Return the elements producing the k smallest outputs of the provided function. Read more
    source§

    fn k_largest(self, k: usize) -> IntoIter<Self::Item> ⓘ
    where + Self: Sized, + Self::Item: Ord,

    Sort the k largest elements into a new iterator, in descending order. Read more
    source§

    fn k_largest_by<F>(self, k: usize, cmp: F) -> IntoIter<Self::Item> ⓘ
    where + Self: Sized, + F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Sort the k largest elements into a new iterator using the provided comparison. Read more
    source§

    fn k_largest_by_key<F, K>(self, k: usize, key: F) -> IntoIter<Self::Item> ⓘ
    where + Self: Sized, + F: FnMut(&Self::Item) -> K, + K: Ord,

    Return the elements producing the k largest outputs of the provided function. Read more
    source§

    fn tail(self, n: usize) -> IntoIter<Self::Item> ⓘ
    where + Self: Sized,

    Consumes the iterator and return an iterator of the last n elements. Read more
    source§

    fn partition_map<A, B, F, L, R>(self, predicate: F) -> (A, B)
    where Self: Sized, F: FnMut(Self::Item) -> Either<L, R>, A: Default + Extend<L>, B: Default + Extend<R>,

    Collect all iterator elements into one of two partitions. Unlike Iterator::partition, each partition may -have a distinct type. Read more
    source§

    fn partition_result<A, B, T, E>(self) -> (A, B)
    where +have a distinct type. Read more

    source§

    fn partition_result<A, B, T, E>(self) -> (A, B)
    where Self: Iterator<Item = Result<T, E>> + Sized, A: Default + Extend<T>, B: Default + Extend<E>,

    Partition a sequence of Results into one list of all the Ok elements -and another list of all the Err elements. Read more
    source§

    fn into_group_map<K, V>(self) -> HashMap<K, Vec<V>>
    where +and another list of all the Err elements. Read more

    source§

    fn into_group_map<K, V>(self) -> HashMap<K, Vec<V>>
    where Self: Iterator<Item = (K, V)> + Sized, K: Hash + Eq,

    Return a HashMap of keys mapped to Vecs of values. Keys and values -are taken from (Key, Value) tuple pairs yielded by the input iterator. Read more
    source§

    fn into_group_map_by<K, V, F>(self, f: F) -> HashMap<K, Vec<V>>
    where +are taken from (Key, Value) tuple pairs yielded by the input iterator. Read more

    source§

    fn into_group_map_by<K, V, F>(self, f: F) -> HashMap<K, Vec<V>>
    where Self: Iterator<Item = V> + Sized, K: Hash + Eq, - F: Fn(&V) -> K,

    Return an Iterator on a HashMap. Keys mapped to Vecs of values. The key is specified -in the closure. Read more
    source§

    fn into_grouping_map<K, V>(self) -> GroupingMap<Self>
    where + F: FnMut(&V) -> K,

    Return an Iterator on a HashMap. Keys mapped to Vecs of values. The key is specified +in the closure. Read more
    source§

    fn into_grouping_map<K, V>(self) -> GroupingMap<Self>
    where Self: Iterator<Item = (K, V)> + Sized, K: Hash + Eq,

    Constructs a GroupingMap to be used later with one of the efficient -group-and-fold operations it allows to perform. Read more
    source§

    fn into_grouping_map_by<K, V, F>(self, key_mapper: F) -> GroupingMapBy<Self, F>
    where +group-and-fold operations it allows to perform. Read more

    source§

    fn into_grouping_map_by<K, V, F>(self, key_mapper: F) -> GroupingMapBy<Self, F>
    where Self: Iterator<Item = V> + Sized, K: Hash + Eq, F: FnMut(&V) -> K,

    Constructs a GroupingMap to be used later with one of the efficient -group-and-fold operations it allows to perform. Read more
    source§

    fn min_set(self) -> Vec<Self::Item>
    where +group-and-fold operations it allows to perform. Read more

    source§

    fn min_set(self) -> Vec<Self::Item>
    where Self: Sized, - Self::Item: Ord,

    Return all minimum elements of an iterator. Read more
    source§

    fn min_set_by<F>(self, compare: F) -> Vec<Self::Item>
    where + Self::Item: Ord,

    Return all minimum elements of an iterator. Read more
    source§

    fn min_set_by<F>(self, compare: F) -> Vec<Self::Item>
    where Self: Sized, F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Return all minimum elements of an iterator, as determined by -the specified function. Read more
    source§

    fn min_set_by_key<K, F>(self, key: F) -> Vec<Self::Item>
    where +the specified function. Read more

    source§

    fn min_set_by_key<K, F>(self, key: F) -> Vec<Self::Item>
    where Self: Sized, K: Ord, F: FnMut(&Self::Item) -> K,

    Return all minimum elements of an iterator, as determined by -the specified function. Read more
    source§

    fn max_set(self) -> Vec<Self::Item>
    where +the specified function. Read more

    source§

    fn max_set(self) -> Vec<Self::Item>
    where Self: Sized, - Self::Item: Ord,

    Return all maximum elements of an iterator. Read more
    source§

    fn max_set_by<F>(self, compare: F) -> Vec<Self::Item>
    where + Self::Item: Ord,

    Return all maximum elements of an iterator. Read more
    source§

    fn max_set_by<F>(self, compare: F) -> Vec<Self::Item>
    where Self: Sized, F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Return all maximum elements of an iterator, as determined by -the specified function. Read more
    source§

    fn max_set_by_key<K, F>(self, key: F) -> Vec<Self::Item>
    where +the specified function. Read more

    source§

    fn max_set_by_key<K, F>(self, key: F) -> Vec<Self::Item>
    where Self: Sized, K: Ord, F: FnMut(&Self::Item) -> K,

    Return all maximum elements of an iterator, as determined by -the specified function. Read more
    source§

    fn minmax(self) -> MinMaxResult<Self::Item>
    where +the specified function. Read more

    source§

    fn minmax(self) -> MinMaxResult<Self::Item>
    where Self: Sized, - Self::Item: PartialOrd,

    Return the minimum and maximum elements in the iterator. Read more
    source§

    fn minmax_by_key<K, F>(self, key: F) -> MinMaxResult<Self::Item>
    where + Self::Item: PartialOrd,

    Return the minimum and maximum elements in the iterator. Read more
    source§

    fn minmax_by_key<K, F>(self, key: F) -> MinMaxResult<Self::Item>
    where Self: Sized, K: PartialOrd, F: FnMut(&Self::Item) -> K,

    Return the minimum and maximum element of an iterator, as determined by -the specified function. Read more
    source§

    fn minmax_by<F>(self, compare: F) -> MinMaxResult<Self::Item>
    where +the specified function. Read more

    source§

    fn minmax_by<F>(self, compare: F) -> MinMaxResult<Self::Item>
    where Self: Sized, F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Return the minimum and maximum element of an iterator, as determined by -the specified comparison function. Read more
    source§

    fn position_max(self) -> Option<usize>
    where +the specified comparison function. Read more

    source§

    fn position_max(self) -> Option<usize>
    where Self: Sized, - Self::Item: Ord,

    Return the position of the maximum element in the iterator. Read more
    source§

    fn position_max_by_key<K, F>(self, key: F) -> Option<usize>
    where + Self::Item: Ord,

    Return the position of the maximum element in the iterator. Read more
    source§

    fn position_max_by_key<K, F>(self, key: F) -> Option<usize>
    where Self: Sized, K: Ord, F: FnMut(&Self::Item) -> K,

    Return the position of the maximum element in the iterator, as -determined by the specified function. Read more
    source§

    fn position_max_by<F>(self, compare: F) -> Option<usize>
    where +determined by the specified function. Read more

    source§

    fn position_max_by<F>(self, compare: F) -> Option<usize>
    where Self: Sized, F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Return the position of the maximum element in the iterator, as -determined by the specified comparison function. Read more
    source§

    fn position_min(self) -> Option<usize>
    where +determined by the specified comparison function. Read more

    source§

    fn position_min(self) -> Option<usize>
    where Self: Sized, - Self::Item: Ord,

    Return the position of the minimum element in the iterator. Read more
    source§

    fn position_min_by_key<K, F>(self, key: F) -> Option<usize>
    where + Self::Item: Ord,

    Return the position of the minimum element in the iterator. Read more
    source§

    fn position_min_by_key<K, F>(self, key: F) -> Option<usize>
    where Self: Sized, K: Ord, F: FnMut(&Self::Item) -> K,

    Return the position of the minimum element in the iterator, as -determined by the specified function. Read more
    source§

    fn position_min_by<F>(self, compare: F) -> Option<usize>
    where +determined by the specified function. Read more

    source§

    fn position_min_by<F>(self, compare: F) -> Option<usize>
    where Self: Sized, F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Return the position of the minimum element in the iterator, as -determined by the specified comparison function. Read more
    source§

    fn position_minmax(self) -> MinMaxResult<usize>
    where +determined by the specified comparison function. Read more

    source§

    fn position_minmax(self) -> MinMaxResult<usize>
    where Self: Sized, Self::Item: PartialOrd,

    Return the positions of the minimum and maximum elements in -the iterator. Read more
    source§

    fn position_minmax_by_key<K, F>(self, key: F) -> MinMaxResult<usize>
    where +the iterator. Read more

    source§

    fn position_minmax_by_key<K, F>(self, key: F) -> MinMaxResult<usize>
    where Self: Sized, K: PartialOrd, F: FnMut(&Self::Item) -> K,

    Return the postions of the minimum and maximum elements of an -iterator, as determined by the specified function. Read more
    source§

    fn position_minmax_by<F>(self, compare: F) -> MinMaxResult<usize>
    where +iterator, as determined by the specified function. Read more

    source§

    fn position_minmax_by<F>(self, compare: F) -> MinMaxResult<usize>
    where Self: Sized, F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Return the postions of the minimum and maximum elements of an -iterator, as determined by the specified comparison function. Read more
    source§

    fn exactly_one(self) -> Result<Self::Item, ExactlyOneError<Self>>
    where +iterator, as determined by the specified comparison function. Read more

    source§

    fn exactly_one(self) -> Result<Self::Item, ExactlyOneError<Self>>
    where Self: Sized,

    If the iterator yields exactly one element, that element will be returned, otherwise an error will be returned containing an iterator that has the same output as the input -iterator. Read more
    source§

    fn at_most_one(self) -> Result<Option<Self::Item>, ExactlyOneError<Self>>
    where - Self: Sized,

    If the iterator yields no elements, Ok(None) will be returned. If the iterator yields +iterator. Read more
    source§

    fn at_most_one(self) -> Result<Option<Self::Item>, ExactlyOneError<Self>>
    where + Self: Sized,

    If the iterator yields no elements, Ok(None) will be returned. If the iterator yields exactly one element, that element will be returned, otherwise an error will be returned -containing an iterator that has the same output as the input iterator. Read more
    source§

    fn multipeek(self) -> MultiPeek<Self> ⓘ
    where +containing an iterator that has the same output as the input iterator. Read more

    source§

    fn multipeek(self) -> MultiPeek<Self> ⓘ
    where Self: Sized,

    An iterator adaptor that allows the user to peek at multiple .next() -values without advancing the base iterator. Read more
    source§

    fn counts(self) -> HashMap<Self::Item, usize>
    where +values without advancing the base iterator. Read more

    source§

    fn counts(self) -> HashMap<Self::Item, usize>
    where Self: Sized, Self::Item: Eq + Hash,

    Collect the items in this iterator and return a HashMap which contains each item that appears in the iterator and the number -of times it appears. Read more
    source§

    fn counts_by<K, F>(self, f: F) -> HashMap<K, usize>
    where +of times it appears. Read more

    source§

    fn counts_by<K, F>(self, f: F) -> HashMap<K, usize>
    where Self: Sized, K: Eq + Hash, F: FnMut(Self::Item) -> K,

    Collect the items in this iterator and return a HashMap which contains each item that appears in the iterator and the number of times it appears, -determining identity using a keying function. Read more
    source§

    fn multiunzip<FromI>(self) -> FromI
    where - Self: Sized + MultiUnzip<FromI>,

    Converts an iterator of tuples into a tuple of containers. Read more
    source§

    fn try_len(&self) -> Result<usize, (usize, Option<usize>)>

    Returns the length of the iterator if one exists. +determining identity using a keying function. Read more
    source§

    fn multiunzip<FromI>(self) -> FromI
    where + Self: Sized + MultiUnzip<FromI>,

    Converts an iterator of tuples into a tuple of containers. Read more
    source§

    fn try_len(&self) -> Result<usize, (usize, Option<usize>)>

    Returns the length of the iterator if one exists. Otherwise return self.size_hint(). Read more
    source§

    impl<IT> MultiUnzip<()> for IT
    where IT: Iterator<Item = ()>,

    source§

    fn multiunzip(self)

    Unzip this iterator into multiple collections.
    source§

    impl<IT, A, FromA> MultiUnzip<(FromA,)> for IT
    where IT: Iterator<Item = (A,)>, @@ -683,4 +692,4 @@ Otherwise return self.size_hint(). (FromA, FromB, FromC, FromD, FromE, FromF, FromG, FromH, FromI, FromJ, FromK, FromL)

    Unzip this iterator into multiple collections.
    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 + 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/itertools/structs/struct.TakeWhileRef.html b/itertools/structs/struct.TakeWhileRef.html index 4d7e28e31..5a256602c 100644 --- a/itertools/structs/struct.TakeWhileRef.html +++ b/itertools/structs/struct.TakeWhileRef.html @@ -1,11 +1,11 @@ -TakeWhileRef in itertools::structs - Rust
    -

    Struct itertools::structs::TakeWhileRef

    source · 
    pub struct TakeWhileRef<'a, I: 'a, F> { /* private fields */ }
    Expand description

    An iterator adaptor that borrows from a Clone-able iterator +TakeWhileRef in itertools::structs - Rust

    +

    Struct itertools::structs::TakeWhileRef

    source · 
    pub struct TakeWhileRef<'a, I: 'a, F> { /* private fields */ }
    Expand description

    An iterator adaptor that borrows from a Clone-able iterator to only pick off elements while the predicate returns true.

    See .take_while_ref() for more information.

    -

    Trait Implementations§

    source§

    impl<'a, I, F> Debug for TakeWhileRef<'a, I, F>
    where - I: Iterator + Debug,

    source§

    fn fmt(&self, f: &mut Formatter<'_>) -> Result

    Formats the value using the given formatter. Read more
    source§

    impl<'a, I, F> Iterator for TakeWhileRef<'a, I, F>
    where +

    Trait Implementations§

    source§

    impl<'a, I, F> Debug for TakeWhileRef<'a, I, F>
    where + I: Iterator + Debug,

    source§

    fn fmt(&self, f: &mut Formatter<'_>) -> Result

    Formats the value using the given formatter. Read more
    source§

    impl<'a, I, F> Iterator for TakeWhileRef<'a, I, F>
    where I: Iterator + Clone, - F: FnMut(&I::Item) -> bool,

    §

    type Item = <I as Iterator>::Item

    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>( + F: FnMut(&I::Item) -> bool,

    §

    type Item = <I as Iterator>::Item

    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 @@ -206,86 +206,87 @@ otherwise. Right variant of Either<Self, Self> otherwise. Read more

    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> Itertools for T
    where - T: Iterator + ?Sized,

    source§

    fn interleave<J>(self, other: J) -> Interleave<Self, J::IntoIter> ⓘ
    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> Itertools for T
    where + T: Iterator + ?Sized,

    source§

    fn interleave<J>(self, other: J) -> Interleave<Self, J::IntoIter> ⓘ
    where J: IntoIterator<Item = Self::Item>, - Self: Sized,

    Alternate elements from two iterators until both have run out. Read more
    source§

    fn interleave_shortest<J>( + Self: Sized,

    Alternate elements from two iterators until both have run out. Read more
    source§

    fn interleave_shortest<J>( self, other: J ) -> InterleaveShortest<Self, J::IntoIter> ⓘ
    where J: IntoIterator<Item = Self::Item>, Self: Sized,

    Alternate elements from two iterators until at least one of them has run -out. Read more
    source§

    fn intersperse(self, element: Self::Item) -> Intersperse<Self>
    where +out. Read more

    source§

    fn intersperse(self, element: Self::Item) -> Intersperse<Self>
    where Self: Sized, Self::Item: Clone,

    An iterator adaptor to insert a particular value -between each element of the adapted iterator. Read more
    source§

    fn intersperse_with<F>(self, element: F) -> IntersperseWith<Self, F> ⓘ
    where +between each element of the adapted iterator. Read more

    source§

    fn intersperse_with<F>(self, element: F) -> IntersperseWith<Self, F> ⓘ
    where Self: Sized, F: FnMut() -> Self::Item,

    An iterator adaptor to insert a particular value created by a function -between each element of the adapted iterator. Read more
    source§

    fn zip_longest<J>(self, other: J) -> ZipLongest<Self, J::IntoIter> ⓘ
    where +between each element of the adapted iterator. Read more

    source§

    fn get<R>(self, index: R) -> R::Output
    where + Self: Sized, + R: IteratorIndex<Self>,

    Returns an iterator over a subsection of the iterator. Read more
    source§

    fn zip_longest<J>(self, other: J) -> ZipLongest<Self, J::IntoIter> ⓘ
    where J: IntoIterator, Self: Sized,

    Create an iterator which iterates over both this and the specified -iterator simultaneously, yielding pairs of two optional elements. Read more
    source§

    fn zip_eq<J>(self, other: J) -> ZipEq<Self, J::IntoIter> ⓘ
    where +iterator simultaneously, yielding pairs of two optional elements. Read more

    source§

    fn zip_eq<J>(self, other: J) -> ZipEq<Self, J::IntoIter> ⓘ
    where J: IntoIterator, Self: Sized,

    Create an iterator which iterates over both this and the specified -iterator simultaneously, yielding pairs of elements. Read more
    source§

    fn batching<B, F>(self, f: F) -> Batching<Self, F> ⓘ
    where +iterator simultaneously, yielding pairs of elements. Read more

    source§

    fn batching<B, F>(self, f: F) -> Batching<Self, F> ⓘ
    where F: FnMut(&mut Self) -> Option<B>, Self: Sized,

    A “meta iterator adaptor”. Its closure receives a reference to the iterator and may pick off as many elements as it likes, to produce the -next iterator element. Read more
    source§

    fn group_by<K, F>(self, key: F) -> GroupBy<K, Self, F>
    where +next iterator element. Read more

    source§

    fn chunk_by<K, F>(self, key: F) -> ChunkBy<K, Self, F>
    where Self: Sized, F: FnMut(&Self::Item) -> K, K: PartialEq,

    Return an iterable that can group iterator elements. Consecutive elements that map to the same key (“runs”), are assigned -to the same group. Read more
    source§

    fn chunks(self, size: usize) -> IntoChunks<Self>
    where - Self: Sized,

    Return an iterable that can chunk the iterator. Read more
    source§

    fn tuple_windows<T>(self) -> TupleWindows<Self, T> ⓘ
    where +to the same group. Read more

    source§

    fn group_by<K, F>(self, key: F) -> ChunkBy<K, Self, F>
    where + Self: Sized, + F: FnMut(&Self::Item) -> K, + K: PartialEq,

    👎Deprecated since 0.13.0: Use .chunk_by() instead
    See .chunk_by().
    source§

    fn chunks(self, size: usize) -> IntoChunks<Self>
    where + Self: Sized,

    Return an iterable that can chunk the iterator. Read more
    source§

    fn tuple_windows<T>(self) -> TupleWindows<Self, T> ⓘ
    where Self: Sized + Iterator<Item = T::Item>, T: HomogeneousTuple, T::Item: Clone,

    Return an iterator over all contiguous windows producing tuples of -a specific size (up to 12). Read more
    source§

    fn circular_tuple_windows<T>(self) -> CircularTupleWindows<Self, T> ⓘ
    where +a specific size (up to 12). Read more

    source§

    fn circular_tuple_windows<T>(self) -> CircularTupleWindows<Self, T> ⓘ
    where Self: Sized + Clone + Iterator<Item = T::Item> + ExactSizeIterator, T: TupleCollect + Clone, T::Item: Clone,

    Return an iterator over all windows, wrapping back to the first elements when the window would otherwise exceed the length of the -iterator, producing tuples of a specific size (up to 12). Read more
    source§

    fn tuples<T>(self) -> Tuples<Self, T> ⓘ
    where +iterator, producing tuples of a specific size (up to 12). Read more

    source§

    fn tuples<T>(self) -> Tuples<Self, T> ⓘ
    where Self: Sized + Iterator<Item = T::Item>, T: HomogeneousTuple,

    Return an iterator that groups the items in tuples of a specific size -(up to 12). Read more
    source§

    fn tee(self) -> (Tee<Self>, Tee<Self>)
    where +(up to 12). Read more

    source§

    fn tee(self) -> (Tee<Self>, Tee<Self>)
    where Self: Sized, Self::Item: Clone,

    Split into an iterator pair that both yield all elements from -the original iterator. Read more
    source§

    fn step(self, n: usize) -> Step<Self> ⓘ
    where - Self: Sized,

    👎Deprecated since 0.8.0: Use std .step_by() instead
    Return an iterator adaptor that steps n elements in the base iterator -for each iteration. Read more
    source§

    fn map_into<R>(self) -> MapInto<Self, R>
    where +the original iterator. Read more

    source§

    fn map_into<R>(self) -> MapInto<Self, R>
    where Self: Sized, - Self::Item: Into<R>,

    Convert each item of the iterator using the Into trait. Read more
    source§

    fn map_results<F, T, U, E>(self, f: F) -> MapOk<Self, F>
    where - Self: Iterator<Item = Result<T, E>> + Sized, - F: FnMut(T) -> U,

    👎Deprecated since 0.10.0: Use .map_ok() instead
    See .map_ok().
    source§

    fn map_ok<F, T, U, E>(self, f: F) -> MapOk<Self, F>
    where + Self::Item: Into<R>,

    Convert each item of the iterator using the Into trait. Read more
    source§

    fn map_ok<F, T, U, E>(self, f: F) -> MapOk<Self, F>
    where Self: Iterator<Item = Result<T, E>> + Sized, F: FnMut(T) -> U,

    Return an iterator adaptor that applies the provided closure to every Result::Ok value. Result::Err values are -unchanged. Read more
    source§

    fn filter_ok<F, T, E>(self, f: F) -> FilterOk<Self, F> ⓘ
    where +unchanged. Read more

    source§

    fn filter_ok<F, T, E>(self, f: F) -> FilterOk<Self, F> ⓘ
    where Self: Iterator<Item = Result<T, E>> + Sized, F: FnMut(&T) -> bool,

    Return an iterator adaptor that filters every Result::Ok value with the provided closure. Result::Err values are -unchanged. Read more
    source§

    fn filter_map_ok<F, T, U, E>(self, f: F) -> FilterMapOk<Self, F> ⓘ
    where +unchanged. Read more

    source§

    fn filter_map_ok<F, T, U, E>(self, f: F) -> FilterMapOk<Self, F> ⓘ
    where Self: Iterator<Item = Result<T, E>> + Sized, F: FnMut(T) -> Option<U>,

    Return an iterator adaptor that filters and transforms every Result::Ok value with the provided closure. Result::Err -values are unchanged. Read more
    source§

    fn flatten_ok<T, E>(self) -> FlattenOk<Self, T, E> ⓘ
    where +values are unchanged. Read more

    source§

    fn flatten_ok<T, E>(self) -> FlattenOk<Self, T, E> ⓘ
    where Self: Iterator<Item = Result<T, E>> + Sized, T: IntoIterator,

    Return an iterator adaptor that flattens every Result::Ok value into -a series of Result::Ok values. Result::Err values are unchanged. Read more
    source§

    fn process_results<F, T, E, R>(self, processor: F) -> Result<R, E>
    where +a series of Result::Ok values. Result::Err values are unchanged. Read more

    source§

    fn process_results<F, T, E, R>(self, processor: F) -> Result<R, E>
    where Self: Iterator<Item = Result<T, E>> + Sized, F: FnOnce(ProcessResults<'_, Self, E>) -> R,

    “Lift” a function of the values of the current iterator so as to process -an iterator of Result values instead. Read more
    source§

    fn merge<J>(self, other: J) -> Merge<Self, J::IntoIter>
    where +an iterator of Result values instead. Read more

    source§

    fn merge<J>(self, other: J) -> Merge<Self, J::IntoIter>
    where Self: Sized, Self::Item: PartialOrd, J: IntoIterator<Item = Self::Item>,

    Return an iterator adaptor that merges the two base iterators in ascending order. If both base iterators are sorted (ascending), the -result is sorted. Read more
    source§

    fn merge_by<J, F>(self, other: J, is_first: F) -> MergeBy<Self, J::IntoIter, F> ⓘ
    where +result is sorted. Read more

    source§

    fn merge_by<J, F>(self, other: J, is_first: F) -> MergeBy<Self, J::IntoIter, F> ⓘ
    where Self: Sized, J: IntoIterator<Item = Self::Item>, F: FnMut(&Self::Item, &Self::Item) -> bool,

    Return an iterator adaptor that merges the two base iterators in order. -This is much like .merge() but allows for a custom ordering. Read more
    source§

    fn merge_join_by<J, F, T>( +This is much like .merge() but allows for a custom ordering. Read more

    source§

    fn merge_join_by<J, F, T>( self, other: J, cmp_fn: F @@ -293,284 +294,295 @@ This is much like IntoIterator, F: FnMut(&Self::Item, &J::Item) -> T, Self: Sized,

    Create an iterator that merges items from both this and the specified -iterator in ascending order. Read more
    source§

    fn kmerge(self) -> KMerge<<Self::Item as IntoIterator>::IntoIter>
    where +iterator in ascending order. Read more

    source§

    fn kmerge(self) -> KMerge<<Self::Item as IntoIterator>::IntoIter>
    where Self: Sized, Self::Item: IntoIterator, <Self::Item as IntoIterator>::Item: PartialOrd,

    Return an iterator adaptor that flattens an iterator of iterators by -merging them in ascending order. Read more
    source§

    fn kmerge_by<F>( +merging them in ascending order. Read more

    source§

    fn kmerge_by<F>( self, first: F ) -> KMergeBy<<Self::Item as IntoIterator>::IntoIter, F> ⓘ
    where Self: Sized, Self::Item: IntoIterator, F: FnMut(&<Self::Item as IntoIterator>::Item, &<Self::Item as IntoIterator>::Item) -> bool,

    Return an iterator adaptor that flattens an iterator of iterators by -merging them according to the given closure. Read more
    source§

    fn cartesian_product<J>(self, other: J) -> Product<Self, J::IntoIter> ⓘ
    where +merging them according to the given closure. Read more

    source§

    fn cartesian_product<J>(self, other: J) -> Product<Self, J::IntoIter> ⓘ
    where Self: Sized, Self::Item: Clone, J: IntoIterator, J::IntoIter: Clone,

    Return an iterator adaptor that iterates over the cartesian product of -the element sets of two iterators self and J. Read more
    source§

    fn multi_cartesian_product( +the element sets of two iterators self and J. Read more

    source§

    fn multi_cartesian_product( self ) -> MultiProduct<<Self::Item as IntoIterator>::IntoIter> ⓘ
    where Self: Sized, Self::Item: IntoIterator, <Self::Item as IntoIterator>::IntoIter: Clone, <Self::Item as IntoIterator>::Item: Clone,

    Return an iterator adaptor that iterates over the cartesian product of -all subiterators returned by meta-iterator self. Read more
    source§

    fn coalesce<F>(self, f: F) -> Coalesce<Self, F>
    where +all subiterators returned by meta-iterator self. Read more

    source§

    fn coalesce<F>(self, f: F) -> Coalesce<Self, F>
    where Self: Sized, F: FnMut(Self::Item, Self::Item) -> Result<Self::Item, (Self::Item, Self::Item)>,

    Return an iterator adaptor that uses the passed-in closure to -optionally merge together consecutive elements. Read more
    source§

    fn dedup(self) -> Dedup<Self>
    where +optionally merge together consecutive elements. Read more

    source§

    fn dedup(self) -> Dedup<Self>
    where Self: Sized, Self::Item: PartialEq,

    Remove duplicates from sections of consecutive identical elements. -If the iterator is sorted, all elements will be unique. Read more
    source§

    fn dedup_by<Cmp>(self, cmp: Cmp) -> DedupBy<Self, Cmp>
    where +If the iterator is sorted, all elements will be unique. Read more

    source§

    fn dedup_by<Cmp>(self, cmp: Cmp) -> DedupBy<Self, Cmp>
    where Self: Sized, Cmp: FnMut(&Self::Item, &Self::Item) -> bool,

    Remove duplicates from sections of consecutive identical elements, determining equality using a comparison function. -If the iterator is sorted, all elements will be unique. Read more
    source§

    fn dedup_with_count(self) -> DedupWithCount<Self>
    where +If the iterator is sorted, all elements will be unique. Read more

    source§

    fn dedup_with_count(self) -> DedupWithCount<Self>
    where Self: Sized,

    Remove duplicates from sections of consecutive identical elements, while keeping a count of how many repeated elements were present. -If the iterator is sorted, all elements will be unique. Read more
    source§

    fn dedup_by_with_count<Cmp>(self, cmp: Cmp) -> DedupByWithCount<Self, Cmp>
    where +If the iterator is sorted, all elements will be unique. Read more

    source§

    fn dedup_by_with_count<Cmp>(self, cmp: Cmp) -> DedupByWithCount<Self, Cmp>
    where Self: Sized, Cmp: FnMut(&Self::Item, &Self::Item) -> bool,

    Remove duplicates from sections of consecutive identical elements, while keeping a count of how many repeated elements were present. This will determine equality using a comparison function. -If the iterator is sorted, all elements will be unique. Read more
    source§

    fn duplicates(self) -> Duplicates<Self>
    where +If the iterator is sorted, all elements will be unique. Read more

    source§

    fn duplicates(self) -> Duplicates<Self>
    where Self: Sized, Self::Item: Eq + Hash,

    Return an iterator adaptor that produces elements that appear more than once during the -iteration. Duplicates are detected using hash and equality. Read more
    source§

    fn duplicates_by<V, F>(self, f: F) -> DuplicatesBy<Self, V, F>
    where +iteration. Duplicates are detected using hash and equality. Read more

    source§

    fn duplicates_by<V, F>(self, f: F) -> DuplicatesBy<Self, V, F>
    where Self: Sized, V: Eq + Hash, F: FnMut(&Self::Item) -> V,

    Return an iterator adaptor that produces elements that appear more than once during the -iteration. Duplicates are detected using hash and equality. Read more
    source§

    fn unique(self) -> Unique<Self> ⓘ
    where +iteration. Duplicates are detected using hash and equality. Read more

    source§

    fn unique(self) -> Unique<Self> ⓘ
    where Self: Sized, Self::Item: Clone + Eq + Hash,

    Return an iterator adaptor that filters out elements that have already been produced once during the iteration. Duplicates -are detected using hash and equality. Read more
    source§

    fn unique_by<V, F>(self, f: F) -> UniqueBy<Self, V, F> ⓘ
    where +are detected using hash and equality. Read more

    source§

    fn unique_by<V, F>(self, f: F) -> UniqueBy<Self, V, F> ⓘ
    where Self: Sized, V: Eq + Hash, F: FnMut(&Self::Item) -> V,

    Return an iterator adaptor that filters out elements that have -already been produced once during the iteration. Read more
    source§

    fn peeking_take_while<F>(&mut self, accept: F) -> PeekingTakeWhile<'_, Self, F> ⓘ
    where +already been produced once during the iteration. Read more

    source§

    fn peeking_take_while<F>(&mut self, accept: F) -> PeekingTakeWhile<'_, Self, F> ⓘ
    where Self: Sized + PeekingNext, F: FnMut(&Self::Item) -> bool,

    Return an iterator adaptor that borrows from this iterator and -takes items while the closure accept returns true. Read more
    source§

    fn take_while_ref<F>(&mut self, accept: F) -> TakeWhileRef<'_, Self, F> ⓘ
    where +takes items while the closure accept returns true. Read more

    source§

    fn take_while_ref<F>(&mut self, accept: F) -> TakeWhileRef<'_, Self, F> ⓘ
    where Self: Clone, F: FnMut(&Self::Item) -> bool,

    Return an iterator adaptor that borrows from a Clone-able iterator -to only pick off elements while the predicate accept returns true. Read more
    source§

    fn take_while_inclusive<F>(self, accept: F) -> TakeWhileInclusive<Self, F> ⓘ
    where +to only pick off elements while the predicate accept returns true. Read more

    source§

    fn take_while_inclusive<F>(self, accept: F) -> TakeWhileInclusive<Self, F> ⓘ
    where Self: Sized, F: FnMut(&Self::Item) -> bool,

    Returns an iterator adaptor that consumes elements while the given predicate is true, including the element for which the predicate -first returned false. Read more
    source§

    fn while_some<A>(self) -> WhileSome<Self> ⓘ
    where +first returned false. Read more

    source§

    fn while_some<A>(self) -> WhileSome<Self> ⓘ
    where Self: Sized + Iterator<Item = Option<A>>,

    Return an iterator adaptor that filters Option<A> iterator elements -and produces A. Stops on the first None encountered. Read more
    source§

    fn tuple_combinations<T>(self) -> TupleCombinations<Self, T> ⓘ
    where +and produces A. Stops on the first None encountered. Read more

    source§

    fn tuple_combinations<T>(self) -> TupleCombinations<Self, T> ⓘ
    where Self: Sized + Clone, Self::Item: Clone, T: HasCombination<Self>,

    Return an iterator adaptor that iterates over the combinations of the -elements from an iterator. Read more
    source§

    fn combinations(self, k: usize) -> Combinations<Self> ⓘ
    where +elements from an iterator. Read more

    source§

    fn combinations(self, k: usize) -> Combinations<Self> ⓘ
    where Self: Sized, Self::Item: Clone,

    Return an iterator adaptor that iterates over the k-length combinations of -the elements from an iterator. Read more
    source§

    fn combinations_with_replacement( +the elements from an iterator. Read more

    source§

    fn combinations_with_replacement( self, k: usize ) -> CombinationsWithReplacement<Self> ⓘ
    where Self: Sized, Self::Item: Clone,

    Return an iterator that iterates over the k-length combinations of -the elements from an iterator, with replacement. Read more
    source§

    fn permutations(self, k: usize) -> Permutations<Self> ⓘ
    where +the elements from an iterator, with replacement. Read more

    source§

    fn permutations(self, k: usize) -> Permutations<Self> ⓘ
    where Self: Sized, Self::Item: Clone,

    Return an iterator adaptor that iterates over all k-permutations of the -elements from an iterator. Read more
    source§

    fn powerset(self) -> Powerset<Self> ⓘ
    where +elements from an iterator. Read more

    source§

    fn powerset(self) -> Powerset<Self> ⓘ
    where Self: Sized, Self::Item: Clone,

    Return an iterator that iterates through the powerset of the elements from an -iterator. Read more
    source§

    fn pad_using<F>(self, min: usize, f: F) -> PadUsing<Self, F> ⓘ
    where +iterator. Read more

    source§

    fn pad_using<F>(self, min: usize, f: F) -> PadUsing<Self, F> ⓘ
    where Self: Sized, F: FnMut(usize) -> Self::Item,

    Return an iterator adaptor that pads the sequence to a minimum length of -min by filling missing elements using a closure f. Read more
    source§

    fn with_position(self) -> WithPosition<Self> ⓘ
    where +min by filling missing elements using a closure f. Read more

    source§

    fn with_position(self) -> WithPosition<Self> ⓘ
    where Self: Sized,

    Return an iterator adaptor that combines each element with a Position to -ease special-case handling of the first or last elements. Read more
    source§

    fn positions<P>(self, predicate: P) -> Positions<Self, P> ⓘ
    where +ease special-case handling of the first or last elements. Read more

    source§

    fn positions<P>(self, predicate: P) -> Positions<Self, P> ⓘ
    where Self: Sized, P: FnMut(Self::Item) -> bool,

    Return an iterator adaptor that yields the indices of all elements -satisfying a predicate, counted from the start of the iterator. Read more
    source§

    fn update<F>(self, updater: F) -> Update<Self, F> ⓘ
    where +satisfying a predicate, counted from the start of the iterator. Read more

    source§

    fn update<F>(self, updater: F) -> Update<Self, F> ⓘ
    where Self: Sized, F: FnMut(&mut Self::Item),

    Return an iterator adaptor that applies a mutating function -to each element before yielding it. Read more
    source§

    fn next_tuple<T>(&mut self) -> Option<T>
    where +to each element before yielding it. Read more

    source§

    fn next_tuple<T>(&mut self) -> Option<T>
    where Self: Sized + Iterator<Item = T::Item>, T: HomogeneousTuple,

    Advances the iterator and returns the next items grouped in a tuple of -a specific size (up to 12). Read more
    source§

    fn collect_tuple<T>(self) -> Option<T>
    where +a specific size (up to 12). Read more

    source§

    fn collect_tuple<T>(self) -> Option<T>
    where Self: Sized + Iterator<Item = T::Item>, T: HomogeneousTuple,

    Collects all items from the iterator into a tuple of a specific size -(up to 12). Read more
    source§

    fn find_position<P>(&mut self, pred: P) -> Option<(usize, Self::Item)>
    where - P: FnMut(&Self::Item) -> bool,

    Find the position and value of the first element satisfying a predicate. Read more
    source§

    fn find_or_last<P>(self, predicate: P) -> Option<Self::Item>
    where +(up to 12). Read more

    source§

    fn find_position<P>(&mut self, pred: P) -> Option<(usize, Self::Item)>
    where + P: FnMut(&Self::Item) -> bool,

    Find the position and value of the first element satisfying a predicate. Read more
    source§

    fn find_or_last<P>(self, predicate: P) -> Option<Self::Item>
    where Self: Sized, - P: FnMut(&Self::Item) -> bool,

    Find the value of the first element satisfying a predicate or return the last element, if any. Read more
    source§

    fn find_or_first<P>(self, predicate: P) -> Option<Self::Item>
    where + P: FnMut(&Self::Item) -> bool,

    Find the value of the first element satisfying a predicate or return the last element, if any. Read more
    source§

    fn find_or_first<P>(self, predicate: P) -> Option<Self::Item>
    where Self: Sized, - P: FnMut(&Self::Item) -> bool,

    Find the value of the first element satisfying a predicate or return the first element, if any. Read more
    source§

    fn contains<Q>(&mut self, query: &Q) -> bool
    where + P: FnMut(&Self::Item) -> bool,

    Find the value of the first element satisfying a predicate or return the first element, if any. Read more
    source§

    fn contains<Q>(&mut self, query: &Q) -> bool
    where Self: Sized, Self::Item: Borrow<Q>, - Q: PartialEq,

    Returns true if the given item is present in this iterator. Read more
    source§

    fn all_equal(&mut self) -> bool
    where + Q: PartialEq,

    Returns true if the given item is present in this iterator. Read more
    source§

    fn all_equal(&mut self) -> bool
    where Self: Sized, - Self::Item: PartialEq,

    Check whether all elements compare equal. Read more
    source§

    fn all_equal_value( + Self::Item: PartialEq,

    Check whether all elements compare equal. Read more
    source§

    fn all_equal_value( &mut self ) -> Result<Self::Item, Option<(Self::Item, Self::Item)>>
    where Self: Sized, Self::Item: PartialEq,

    If there are elements and they are all equal, return a single copy of that element. If there are no elements, return an Error containing None. If there are elements and they are not all equal, return a tuple containing the first -two non-equal elements found. Read more
    source§

    fn all_unique(&mut self) -> bool
    where +two non-equal elements found. Read more

    source§

    fn all_unique(&mut self) -> bool
    where Self: Sized, - Self::Item: Eq + Hash,

    Check whether all elements are unique (non equal). Read more
    source§

    fn dropping(self, n: usize) -> Self
    where + Self::Item: Eq + Hash,

    Check whether all elements are unique (non equal). Read more
    source§

    fn dropping(self, n: usize) -> Self
    where Self: Sized,

    Consume the first n elements from the iterator eagerly, -and return the same iterator again. Read more
    source§

    fn dropping_back(self, n: usize) -> Self
    where +and return the same iterator again. Read more

    source§

    fn dropping_back(self, n: usize) -> Self
    where Self: Sized + DoubleEndedIterator,

    Consume the last n elements from the iterator eagerly, -and return the same iterator again. Read more
    source§

    fn foreach<F>(self, f: F)
    where - F: FnMut(Self::Item), - Self: Sized,

    👎Deprecated since 0.8.0: Use .for_each() instead
    Run the closure f eagerly on each element of the iterator. Read more
    source§

    fn concat(self) -> Self::Item
    where +and return the same iterator again. Read more

    source§

    fn concat(self) -> Self::Item
    where Self: Sized, - Self::Item: Extend<<<Self as Iterator>::Item as IntoIterator>::Item> + IntoIterator + Default,

    Combine all an iterator’s elements into one element by using Extend. Read more
    source§

    fn collect_vec(self) -> Vec<Self::Item>
    where + Self::Item: Extend<<<Self as Iterator>::Item as IntoIterator>::Item> + IntoIterator + Default,

    Combine all an iterator’s elements into one element by using Extend. Read more
    source§

    fn collect_vec(self) -> Vec<Self::Item>
    where Self: Sized,

    .collect_vec() is simply a type specialization of Iterator::collect, -for convenience.
    source§

    fn try_collect<T, U, E>(self) -> Result<U, E>
    where +for convenience.

    source§

    fn try_collect<T, U, E>(self) -> Result<U, E>
    where Self: Sized + Iterator<Item = Result<T, E>>, Result<U, E>: FromIterator<Result<T, E>>,

    .try_collect() is more convenient way of writing -.collect::<Result<_, _>>() Read more
    source§

    fn set_from<'a, A: 'a, J>(&mut self, from: J) -> usize
    where +.collect::<Result<_, _>>() Read more

    source§

    fn set_from<'a, A: 'a, J>(&mut self, from: J) -> usize
    where Self: Iterator<Item = &'a mut A>, J: IntoIterator<Item = A>,

    Assign to each reference in self from the from iterator, -stopping at the shortest of the two iterators. Read more
    source§

    fn join(&mut self, sep: &str) -> String
    where - Self::Item: Display,

    Combine all iterator elements into one String, separated by sep. Read more
    source§

    fn format(self, sep: &str) -> Format<'_, Self>
    where - Self: Sized,

    Format all iterator elements, separated by sep. Read more
    source§

    fn format_with<F>(self, sep: &str, format: F) -> FormatWith<'_, Self, F>
    where +stopping at the shortest of the two iterators. Read more

    source§

    fn join(&mut self, sep: &str) -> String
    where + Self::Item: Display,

    Combine all iterator elements into one String, separated by sep. Read more
    source§

    fn format(self, sep: &str) -> Format<'_, Self>
    where + Self: Sized,

    Format all iterator elements, separated by sep. Read more
    source§

    fn format_with<F>(self, sep: &str, format: F) -> FormatWith<'_, Self, F>
    where Self: Sized, - F: FnMut(Self::Item, &mut dyn FnMut(&dyn Display) -> Result) -> Result,

    Format all iterator elements, separated by sep. Read more
    source§

    fn fold_results<A, E, B, F>(&mut self, start: B, f: F) -> Result<B, E>
    where + F: FnMut(Self::Item, &mut dyn FnMut(&dyn Display) -> Result) -> Result,

    Format all iterator elements, separated by sep. Read more
    source§

    fn fold_ok<A, E, B, F>(&mut self, start: B, f: F) -> Result<B, E>
    where Self: Iterator<Item = Result<A, E>>, - F: FnMut(B, A) -> B,

    👎Deprecated since 0.10.0: Use .fold_ok() instead
    See .fold_ok().
    source§

    fn fold_ok<A, E, B, F>(&mut self, start: B, f: F) -> Result<B, E>
    where - Self: Iterator<Item = Result<A, E>>, - F: FnMut(B, A) -> B,

    Fold Result values from an iterator. Read more
    source§

    fn fold_options<A, B, F>(&mut self, start: B, f: F) -> Option<B>
    where + F: FnMut(B, A) -> B,

    Fold Result values from an iterator. Read more
    source§

    fn fold_options<A, B, F>(&mut self, start: B, f: F) -> Option<B>
    where Self: Iterator<Item = Option<A>>, - F: FnMut(B, A) -> B,

    Fold Option values from an iterator. Read more
    source§

    fn fold1<F>(self, f: F) -> Option<Self::Item>
    where + F: FnMut(B, A) -> B,

    Fold Option values from an iterator. Read more
    source§

    fn fold1<F>(self, f: F) -> Option<Self::Item>
    where F: FnMut(Self::Item, Self::Item) -> Self::Item, - Self: Sized,

    👎Deprecated since 0.10.2: Use Iterator::reduce instead
    Accumulator of the elements in the iterator. Read more
    source§

    fn tree_fold1<F>(self, f: F) -> Option<Self::Item>
    where + Self: Sized,

    👎Deprecated since 0.10.2: Use Iterator::reduce instead
    Accumulator of the elements in the iterator. Read more
    source§

    fn tree_reduce<F>(self, f: F) -> Option<Self::Item>
    where F: FnMut(Self::Item, Self::Item) -> Self::Item, - Self: Sized,

    Accumulate the elements in the iterator in a tree-like manner. Read more
    source§

    fn fold_while<B, F>(&mut self, init: B, f: F) -> FoldWhile<B>
    where + Self: Sized,

    Accumulate the elements in the iterator in a tree-like manner. Read more
    source§

    fn tree_fold1<F>(self, f: F) -> Option<Self::Item>
    where + F: FnMut(Self::Item, Self::Item) -> Self::Item, + Self: Sized,

    👎Deprecated since 0.13.0: Use .tree_reduce() instead
    See .tree_reduce().
    source§

    fn fold_while<B, F>(&mut self, init: B, f: F) -> FoldWhile<B>
    where Self: Sized, - F: FnMut(B, Self::Item) -> FoldWhile<B>,

    An iterator method that applies a function, producing a single, final value. Read more
    source§

    fn sum1<S>(self) -> Option<S>
    where + F: FnMut(B, Self::Item) -> FoldWhile<B>,

    An iterator method that applies a function, producing a single, final value. Read more
    source§

    fn sum1<S>(self) -> Option<S>
    where Self: Sized, - S: Sum<Self::Item>,

    Iterate over the entire iterator and add all the elements. Read more
    source§

    fn product1<P>(self) -> Option<P>
    where + S: Sum<Self::Item>,

    Iterate over the entire iterator and add all the elements. Read more
    source§

    fn product1<P>(self) -> Option<P>
    where Self: Sized, - P: Product<Self::Item>,

    Iterate over the entire iterator and multiply all the elements. Read more
    source§

    fn sorted_unstable(self) -> IntoIter<Self::Item> ⓘ
    where + P: Product<Self::Item>,

    Iterate over the entire iterator and multiply all the elements. Read more
    source§

    fn sorted_unstable(self) -> IntoIter<Self::Item> ⓘ
    where Self: Sized, - Self::Item: Ord,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_unstable_by<F>(self, cmp: F) -> IntoIter<Self::Item> ⓘ
    where + Self::Item: Ord,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_unstable_by<F>(self, cmp: F) -> IntoIter<Self::Item> ⓘ
    where Self: Sized, - F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_unstable_by_key<K, F>(self, f: F) -> IntoIter<Self::Item> ⓘ
    where + F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_unstable_by_key<K, F>(self, f: F) -> IntoIter<Self::Item> ⓘ
    where Self: Sized, K: Ord, - F: FnMut(&Self::Item) -> K,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted(self) -> IntoIter<Self::Item> ⓘ
    where + F: FnMut(&Self::Item) -> K,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted(self) -> IntoIter<Self::Item> ⓘ
    where Self: Sized, - Self::Item: Ord,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_by<F>(self, cmp: F) -> IntoIter<Self::Item> ⓘ
    where + Self::Item: Ord,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_by<F>(self, cmp: F) -> IntoIter<Self::Item> ⓘ
    where Self: Sized, - F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_by_key<K, F>(self, f: F) -> IntoIter<Self::Item> ⓘ
    where + F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_by_key<K, F>(self, f: F) -> IntoIter<Self::Item> ⓘ
    where Self: Sized, K: Ord, - F: FnMut(&Self::Item) -> K,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_by_cached_key<K, F>(self, f: F) -> IntoIter<Self::Item> ⓘ
    where + F: FnMut(&Self::Item) -> K,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_by_cached_key<K, F>(self, f: F) -> IntoIter<Self::Item> ⓘ
    where Self: Sized, K: Ord, F: FnMut(&Self::Item) -> K,

    Sort all iterator elements into a new iterator in ascending order. The key function is -called exactly once per key. Read more
    source§

    fn k_smallest(self, k: usize) -> IntoIter<Self::Item> ⓘ
    where +called exactly once per key. Read more

    source§

    fn k_smallest(self, k: usize) -> IntoIter<Self::Item> ⓘ
    where Self: Sized, - Self::Item: Ord,

    Sort the k smallest elements into a new iterator, in ascending order. Read more
    source§

    fn partition_map<A, B, F, L, R>(self, predicate: F) -> (A, B)
    where + Self::Item: Ord,

    Sort the k smallest elements into a new iterator, in ascending order. Read more
    source§

    fn k_smallest_by<F>(self, k: usize, cmp: F) -> IntoIter<Self::Item> ⓘ
    where + Self: Sized, + F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Sort the k smallest elements into a new iterator using the provided comparison. Read more
    source§

    fn k_smallest_by_key<F, K>(self, k: usize, key: F) -> IntoIter<Self::Item> ⓘ
    where + Self: Sized, + F: FnMut(&Self::Item) -> K, + K: Ord,

    Return the elements producing the k smallest outputs of the provided function. Read more
    source§

    fn k_largest(self, k: usize) -> IntoIter<Self::Item> ⓘ
    where + Self: Sized, + Self::Item: Ord,

    Sort the k largest elements into a new iterator, in descending order. Read more
    source§

    fn k_largest_by<F>(self, k: usize, cmp: F) -> IntoIter<Self::Item> ⓘ
    where + Self: Sized, + F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Sort the k largest elements into a new iterator using the provided comparison. Read more
    source§

    fn k_largest_by_key<F, K>(self, k: usize, key: F) -> IntoIter<Self::Item> ⓘ
    where + Self: Sized, + F: FnMut(&Self::Item) -> K, + K: Ord,

    Return the elements producing the k largest outputs of the provided function. Read more
    source§

    fn tail(self, n: usize) -> IntoIter<Self::Item> ⓘ
    where + Self: Sized,

    Consumes the iterator and return an iterator of the last n elements. Read more
    source§

    fn partition_map<A, B, F, L, R>(self, predicate: F) -> (A, B)
    where Self: Sized, F: FnMut(Self::Item) -> Either<L, R>, A: Default + Extend<L>, B: Default + Extend<R>,

    Collect all iterator elements into one of two partitions. Unlike Iterator::partition, each partition may -have a distinct type. Read more
    source§

    fn partition_result<A, B, T, E>(self) -> (A, B)
    where +have a distinct type. Read more

    source§

    fn partition_result<A, B, T, E>(self) -> (A, B)
    where Self: Iterator<Item = Result<T, E>> + Sized, A: Default + Extend<T>, B: Default + Extend<E>,

    Partition a sequence of Results into one list of all the Ok elements -and another list of all the Err elements. Read more
    source§

    fn into_group_map<K, V>(self) -> HashMap<K, Vec<V>>
    where +and another list of all the Err elements. Read more

    source§

    fn into_group_map<K, V>(self) -> HashMap<K, Vec<V>>
    where Self: Iterator<Item = (K, V)> + Sized, K: Hash + Eq,

    Return a HashMap of keys mapped to Vecs of values. Keys and values -are taken from (Key, Value) tuple pairs yielded by the input iterator. Read more
    source§

    fn into_group_map_by<K, V, F>(self, f: F) -> HashMap<K, Vec<V>>
    where +are taken from (Key, Value) tuple pairs yielded by the input iterator. Read more

    source§

    fn into_group_map_by<K, V, F>(self, f: F) -> HashMap<K, Vec<V>>
    where Self: Iterator<Item = V> + Sized, K: Hash + Eq, - F: Fn(&V) -> K,

    Return an Iterator on a HashMap. Keys mapped to Vecs of values. The key is specified -in the closure. Read more
    source§

    fn into_grouping_map<K, V>(self) -> GroupingMap<Self>
    where + F: FnMut(&V) -> K,

    Return an Iterator on a HashMap. Keys mapped to Vecs of values. The key is specified +in the closure. Read more
    source§

    fn into_grouping_map<K, V>(self) -> GroupingMap<Self>
    where Self: Iterator<Item = (K, V)> + Sized, K: Hash + Eq,

    Constructs a GroupingMap to be used later with one of the efficient -group-and-fold operations it allows to perform. Read more
    source§

    fn into_grouping_map_by<K, V, F>(self, key_mapper: F) -> GroupingMapBy<Self, F>
    where +group-and-fold operations it allows to perform. Read more

    source§

    fn into_grouping_map_by<K, V, F>(self, key_mapper: F) -> GroupingMapBy<Self, F>
    where Self: Iterator<Item = V> + Sized, K: Hash + Eq, F: FnMut(&V) -> K,

    Constructs a GroupingMap to be used later with one of the efficient -group-and-fold operations it allows to perform. Read more
    source§

    fn min_set(self) -> Vec<Self::Item>
    where +group-and-fold operations it allows to perform. Read more

    source§

    fn min_set(self) -> Vec<Self::Item>
    where Self: Sized, - Self::Item: Ord,

    Return all minimum elements of an iterator. Read more
    source§

    fn min_set_by<F>(self, compare: F) -> Vec<Self::Item>
    where + Self::Item: Ord,

    Return all minimum elements of an iterator. Read more
    source§

    fn min_set_by<F>(self, compare: F) -> Vec<Self::Item>
    where Self: Sized, F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Return all minimum elements of an iterator, as determined by -the specified function. Read more
    source§

    fn min_set_by_key<K, F>(self, key: F) -> Vec<Self::Item>
    where +the specified function. Read more

    source§

    fn min_set_by_key<K, F>(self, key: F) -> Vec<Self::Item>
    where Self: Sized, K: Ord, F: FnMut(&Self::Item) -> K,

    Return all minimum elements of an iterator, as determined by -the specified function. Read more
    source§

    fn max_set(self) -> Vec<Self::Item>
    where +the specified function. Read more

    source§

    fn max_set(self) -> Vec<Self::Item>
    where Self: Sized, - Self::Item: Ord,

    Return all maximum elements of an iterator. Read more
    source§

    fn max_set_by<F>(self, compare: F) -> Vec<Self::Item>
    where + Self::Item: Ord,

    Return all maximum elements of an iterator. Read more
    source§

    fn max_set_by<F>(self, compare: F) -> Vec<Self::Item>
    where Self: Sized, F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Return all maximum elements of an iterator, as determined by -the specified function. Read more
    source§

    fn max_set_by_key<K, F>(self, key: F) -> Vec<Self::Item>
    where +the specified function. Read more

    source§

    fn max_set_by_key<K, F>(self, key: F) -> Vec<Self::Item>
    where Self: Sized, K: Ord, F: FnMut(&Self::Item) -> K,

    Return all maximum elements of an iterator, as determined by -the specified function. Read more
    source§

    fn minmax(self) -> MinMaxResult<Self::Item>
    where +the specified function. Read more

    source§

    fn minmax(self) -> MinMaxResult<Self::Item>
    where Self: Sized, - Self::Item: PartialOrd,

    Return the minimum and maximum elements in the iterator. Read more
    source§

    fn minmax_by_key<K, F>(self, key: F) -> MinMaxResult<Self::Item>
    where + Self::Item: PartialOrd,

    Return the minimum and maximum elements in the iterator. Read more
    source§

    fn minmax_by_key<K, F>(self, key: F) -> MinMaxResult<Self::Item>
    where Self: Sized, K: PartialOrd, F: FnMut(&Self::Item) -> K,

    Return the minimum and maximum element of an iterator, as determined by -the specified function. Read more
    source§

    fn minmax_by<F>(self, compare: F) -> MinMaxResult<Self::Item>
    where +the specified function. Read more

    source§

    fn minmax_by<F>(self, compare: F) -> MinMaxResult<Self::Item>
    where Self: Sized, F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Return the minimum and maximum element of an iterator, as determined by -the specified comparison function. Read more
    source§

    fn position_max(self) -> Option<usize>
    where +the specified comparison function. Read more

    source§

    fn position_max(self) -> Option<usize>
    where Self: Sized, - Self::Item: Ord,

    Return the position of the maximum element in the iterator. Read more
    source§

    fn position_max_by_key<K, F>(self, key: F) -> Option<usize>
    where + Self::Item: Ord,

    Return the position of the maximum element in the iterator. Read more
    source§

    fn position_max_by_key<K, F>(self, key: F) -> Option<usize>
    where Self: Sized, K: Ord, F: FnMut(&Self::Item) -> K,

    Return the position of the maximum element in the iterator, as -determined by the specified function. Read more
    source§

    fn position_max_by<F>(self, compare: F) -> Option<usize>
    where +determined by the specified function. Read more

    source§

    fn position_max_by<F>(self, compare: F) -> Option<usize>
    where Self: Sized, F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Return the position of the maximum element in the iterator, as -determined by the specified comparison function. Read more
    source§

    fn position_min(self) -> Option<usize>
    where +determined by the specified comparison function. Read more

    source§

    fn position_min(self) -> Option<usize>
    where Self: Sized, - Self::Item: Ord,

    Return the position of the minimum element in the iterator. Read more
    source§

    fn position_min_by_key<K, F>(self, key: F) -> Option<usize>
    where + Self::Item: Ord,

    Return the position of the minimum element in the iterator. Read more
    source§

    fn position_min_by_key<K, F>(self, key: F) -> Option<usize>
    where Self: Sized, K: Ord, F: FnMut(&Self::Item) -> K,

    Return the position of the minimum element in the iterator, as -determined by the specified function. Read more
    source§

    fn position_min_by<F>(self, compare: F) -> Option<usize>
    where +determined by the specified function. Read more

    source§

    fn position_min_by<F>(self, compare: F) -> Option<usize>
    where Self: Sized, F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Return the position of the minimum element in the iterator, as -determined by the specified comparison function. Read more
    source§

    fn position_minmax(self) -> MinMaxResult<usize>
    where +determined by the specified comparison function. Read more

    source§

    fn position_minmax(self) -> MinMaxResult<usize>
    where Self: Sized, Self::Item: PartialOrd,

    Return the positions of the minimum and maximum elements in -the iterator. Read more
    source§

    fn position_minmax_by_key<K, F>(self, key: F) -> MinMaxResult<usize>
    where +the iterator. Read more

    source§

    fn position_minmax_by_key<K, F>(self, key: F) -> MinMaxResult<usize>
    where Self: Sized, K: PartialOrd, F: FnMut(&Self::Item) -> K,

    Return the postions of the minimum and maximum elements of an -iterator, as determined by the specified function. Read more
    source§

    fn position_minmax_by<F>(self, compare: F) -> MinMaxResult<usize>
    where +iterator, as determined by the specified function. Read more

    source§

    fn position_minmax_by<F>(self, compare: F) -> MinMaxResult<usize>
    where Self: Sized, F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Return the postions of the minimum and maximum elements of an -iterator, as determined by the specified comparison function. Read more
    source§

    fn exactly_one(self) -> Result<Self::Item, ExactlyOneError<Self>>
    where +iterator, as determined by the specified comparison function. Read more

    source§

    fn exactly_one(self) -> Result<Self::Item, ExactlyOneError<Self>>
    where Self: Sized,

    If the iterator yields exactly one element, that element will be returned, otherwise an error will be returned containing an iterator that has the same output as the input -iterator. Read more
    source§

    fn at_most_one(self) -> Result<Option<Self::Item>, ExactlyOneError<Self>>
    where - Self: Sized,

    If the iterator yields no elements, Ok(None) will be returned. If the iterator yields +iterator. Read more
    source§

    fn at_most_one(self) -> Result<Option<Self::Item>, ExactlyOneError<Self>>
    where + Self: Sized,

    If the iterator yields no elements, Ok(None) will be returned. If the iterator yields exactly one element, that element will be returned, otherwise an error will be returned -containing an iterator that has the same output as the input iterator. Read more
    source§

    fn multipeek(self) -> MultiPeek<Self> ⓘ
    where +containing an iterator that has the same output as the input iterator. Read more

    source§

    fn multipeek(self) -> MultiPeek<Self> ⓘ
    where Self: Sized,

    An iterator adaptor that allows the user to peek at multiple .next() -values without advancing the base iterator. Read more
    source§

    fn counts(self) -> HashMap<Self::Item, usize>
    where +values without advancing the base iterator. Read more

    source§

    fn counts(self) -> HashMap<Self::Item, usize>
    where Self: Sized, Self::Item: Eq + Hash,

    Collect the items in this iterator and return a HashMap which contains each item that appears in the iterator and the number -of times it appears. Read more
    source§

    fn counts_by<K, F>(self, f: F) -> HashMap<K, usize>
    where +of times it appears. Read more

    source§

    fn counts_by<K, F>(self, f: F) -> HashMap<K, usize>
    where Self: Sized, K: Eq + Hash, F: FnMut(Self::Item) -> K,

    Collect the items in this iterator and return a HashMap which contains each item that appears in the iterator and the number of times it appears, -determining identity using a keying function. Read more
    source§

    fn multiunzip<FromI>(self) -> FromI
    where - Self: Sized + MultiUnzip<FromI>,

    Converts an iterator of tuples into a tuple of containers. Read more
    source§

    fn try_len(&self) -> Result<usize, (usize, Option<usize>)>

    Returns the length of the iterator if one exists. +determining identity using a keying function. Read more
    source§

    fn multiunzip<FromI>(self) -> FromI
    where + Self: Sized + MultiUnzip<FromI>,

    Converts an iterator of tuples into a tuple of containers. Read more
    source§

    fn try_len(&self) -> Result<usize, (usize, Option<usize>)>

    Returns the length of the iterator if one exists. Otherwise return self.size_hint(). Read more
    source§

    impl<IT> MultiUnzip<()> for IT
    where IT: Iterator<Item = ()>,

    source§

    fn multiunzip(self)

    Unzip this iterator into multiple collections.
    source§

    impl<IT, A, FromA> MultiUnzip<(FromA,)> for IT
    where IT: Iterator<Item = (A,)>, @@ -672,4 +684,4 @@ Otherwise return self.size_hint(). (FromA, FromB, FromC, FromD, FromE, FromF, FromG, FromH, FromI, FromJ, FromK, FromL)

    Unzip this iterator into multiple collections.
    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 + 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/itertools/structs/struct.Tee.html b/itertools/structs/struct.Tee.html index a7084beb0..52d5353e8 100644 --- a/itertools/structs/struct.Tee.html +++ b/itertools/structs/struct.Tee.html @@ -1,4 +1,4 @@ -Tee in itertools::structs - Rust
    +Tee in itertools::structs - Rust

    Struct itertools::structs::Tee

    source · 
    pub struct Tee<I>
    where
     I: Iterator,
    { /* private fields */ }
    Expand description

    One half of an iterator pair where both return the same elements.

    See .tee() for more information.

    @@ -201,86 +201,87 @@ otherwise. Right variant of Either<Self, Self> otherwise. Read more
    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> Itertools for T
    where - T: Iterator + ?Sized,

    source§

    fn interleave<J>(self, other: J) -> Interleave<Self, J::IntoIter> ⓘ
    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> Itertools for T
    where + T: Iterator + ?Sized,

    source§

    fn interleave<J>(self, other: J) -> Interleave<Self, J::IntoIter> ⓘ
    where J: IntoIterator<Item = Self::Item>, - Self: Sized,

    Alternate elements from two iterators until both have run out. Read more
    source§

    fn interleave_shortest<J>( + Self: Sized,

    Alternate elements from two iterators until both have run out. Read more
    source§

    fn interleave_shortest<J>( self, other: J ) -> InterleaveShortest<Self, J::IntoIter> ⓘ
    where J: IntoIterator<Item = Self::Item>, Self: Sized,

    Alternate elements from two iterators until at least one of them has run -out. Read more
    source§

    fn intersperse(self, element: Self::Item) -> Intersperse<Self>
    where +out. Read more

    source§

    fn intersperse(self, element: Self::Item) -> Intersperse<Self>
    where Self: Sized, Self::Item: Clone,

    An iterator adaptor to insert a particular value -between each element of the adapted iterator. Read more
    source§

    fn intersperse_with<F>(self, element: F) -> IntersperseWith<Self, F> ⓘ
    where +between each element of the adapted iterator. Read more

    source§

    fn intersperse_with<F>(self, element: F) -> IntersperseWith<Self, F> ⓘ
    where Self: Sized, F: FnMut() -> Self::Item,

    An iterator adaptor to insert a particular value created by a function -between each element of the adapted iterator. Read more
    source§

    fn zip_longest<J>(self, other: J) -> ZipLongest<Self, J::IntoIter> ⓘ
    where +between each element of the adapted iterator. Read more

    source§

    fn get<R>(self, index: R) -> R::Output
    where + Self: Sized, + R: IteratorIndex<Self>,

    Returns an iterator over a subsection of the iterator. Read more
    source§

    fn zip_longest<J>(self, other: J) -> ZipLongest<Self, J::IntoIter> ⓘ
    where J: IntoIterator, Self: Sized,

    Create an iterator which iterates over both this and the specified -iterator simultaneously, yielding pairs of two optional elements. Read more
    source§

    fn zip_eq<J>(self, other: J) -> ZipEq<Self, J::IntoIter> ⓘ
    where +iterator simultaneously, yielding pairs of two optional elements. Read more

    source§

    fn zip_eq<J>(self, other: J) -> ZipEq<Self, J::IntoIter> ⓘ
    where J: IntoIterator, Self: Sized,

    Create an iterator which iterates over both this and the specified -iterator simultaneously, yielding pairs of elements. Read more
    source§

    fn batching<B, F>(self, f: F) -> Batching<Self, F> ⓘ
    where +iterator simultaneously, yielding pairs of elements. Read more

    source§

    fn batching<B, F>(self, f: F) -> Batching<Self, F> ⓘ
    where F: FnMut(&mut Self) -> Option<B>, Self: Sized,

    A “meta iterator adaptor”. Its closure receives a reference to the iterator and may pick off as many elements as it likes, to produce the -next iterator element. Read more
    source§

    fn group_by<K, F>(self, key: F) -> GroupBy<K, Self, F>
    where +next iterator element. Read more

    source§

    fn chunk_by<K, F>(self, key: F) -> ChunkBy<K, Self, F>
    where Self: Sized, F: FnMut(&Self::Item) -> K, K: PartialEq,

    Return an iterable that can group iterator elements. Consecutive elements that map to the same key (“runs”), are assigned -to the same group. Read more
    source§

    fn chunks(self, size: usize) -> IntoChunks<Self>
    where - Self: Sized,

    Return an iterable that can chunk the iterator. Read more
    source§

    fn tuple_windows<T>(self) -> TupleWindows<Self, T> ⓘ
    where +to the same group. Read more

    source§

    fn group_by<K, F>(self, key: F) -> ChunkBy<K, Self, F>
    where + Self: Sized, + F: FnMut(&Self::Item) -> K, + K: PartialEq,

    👎Deprecated since 0.13.0: Use .chunk_by() instead
    See .chunk_by().
    source§

    fn chunks(self, size: usize) -> IntoChunks<Self>
    where + Self: Sized,

    Return an iterable that can chunk the iterator. Read more
    source§

    fn tuple_windows<T>(self) -> TupleWindows<Self, T> ⓘ
    where Self: Sized + Iterator<Item = T::Item>, T: HomogeneousTuple, T::Item: Clone,

    Return an iterator over all contiguous windows producing tuples of -a specific size (up to 12). Read more
    source§

    fn circular_tuple_windows<T>(self) -> CircularTupleWindows<Self, T> ⓘ
    where +a specific size (up to 12). Read more

    source§

    fn circular_tuple_windows<T>(self) -> CircularTupleWindows<Self, T> ⓘ
    where Self: Sized + Clone + Iterator<Item = T::Item> + ExactSizeIterator, T: TupleCollect + Clone, T::Item: Clone,

    Return an iterator over all windows, wrapping back to the first elements when the window would otherwise exceed the length of the -iterator, producing tuples of a specific size (up to 12). Read more
    source§

    fn tuples<T>(self) -> Tuples<Self, T> ⓘ
    where +iterator, producing tuples of a specific size (up to 12). Read more

    source§

    fn tuples<T>(self) -> Tuples<Self, T> ⓘ
    where Self: Sized + Iterator<Item = T::Item>, T: HomogeneousTuple,

    Return an iterator that groups the items in tuples of a specific size -(up to 12). Read more
    source§

    fn tee(self) -> (Tee<Self>, Tee<Self>)
    where +(up to 12). Read more

    source§

    fn tee(self) -> (Tee<Self>, Tee<Self>)
    where Self: Sized, Self::Item: Clone,

    Split into an iterator pair that both yield all elements from -the original iterator. Read more
    source§

    fn step(self, n: usize) -> Step<Self> ⓘ
    where - Self: Sized,

    👎Deprecated since 0.8.0: Use std .step_by() instead
    Return an iterator adaptor that steps n elements in the base iterator -for each iteration. Read more
    source§

    fn map_into<R>(self) -> MapInto<Self, R>
    where +the original iterator. Read more

    source§

    fn map_into<R>(self) -> MapInto<Self, R>
    where Self: Sized, - Self::Item: Into<R>,

    Convert each item of the iterator using the Into trait. Read more
    source§

    fn map_results<F, T, U, E>(self, f: F) -> MapOk<Self, F>
    where - Self: Iterator<Item = Result<T, E>> + Sized, - F: FnMut(T) -> U,

    👎Deprecated since 0.10.0: Use .map_ok() instead
    See .map_ok().
    source§

    fn map_ok<F, T, U, E>(self, f: F) -> MapOk<Self, F>
    where + Self::Item: Into<R>,

    Convert each item of the iterator using the Into trait. Read more
    source§

    fn map_ok<F, T, U, E>(self, f: F) -> MapOk<Self, F>
    where Self: Iterator<Item = Result<T, E>> + Sized, F: FnMut(T) -> U,

    Return an iterator adaptor that applies the provided closure to every Result::Ok value. Result::Err values are -unchanged. Read more
    source§

    fn filter_ok<F, T, E>(self, f: F) -> FilterOk<Self, F> ⓘ
    where +unchanged. Read more

    source§

    fn filter_ok<F, T, E>(self, f: F) -> FilterOk<Self, F> ⓘ
    where Self: Iterator<Item = Result<T, E>> + Sized, F: FnMut(&T) -> bool,

    Return an iterator adaptor that filters every Result::Ok value with the provided closure. Result::Err values are -unchanged. Read more
    source§

    fn filter_map_ok<F, T, U, E>(self, f: F) -> FilterMapOk<Self, F> ⓘ
    where +unchanged. Read more

    source§

    fn filter_map_ok<F, T, U, E>(self, f: F) -> FilterMapOk<Self, F> ⓘ
    where Self: Iterator<Item = Result<T, E>> + Sized, F: FnMut(T) -> Option<U>,

    Return an iterator adaptor that filters and transforms every Result::Ok value with the provided closure. Result::Err -values are unchanged. Read more
    source§

    fn flatten_ok<T, E>(self) -> FlattenOk<Self, T, E> ⓘ
    where +values are unchanged. Read more

    source§

    fn flatten_ok<T, E>(self) -> FlattenOk<Self, T, E> ⓘ
    where Self: Iterator<Item = Result<T, E>> + Sized, T: IntoIterator,

    Return an iterator adaptor that flattens every Result::Ok value into -a series of Result::Ok values. Result::Err values are unchanged. Read more
    source§

    fn process_results<F, T, E, R>(self, processor: F) -> Result<R, E>
    where +a series of Result::Ok values. Result::Err values are unchanged. Read more

    source§

    fn process_results<F, T, E, R>(self, processor: F) -> Result<R, E>
    where Self: Iterator<Item = Result<T, E>> + Sized, F: FnOnce(ProcessResults<'_, Self, E>) -> R,

    “Lift” a function of the values of the current iterator so as to process -an iterator of Result values instead. Read more
    source§

    fn merge<J>(self, other: J) -> Merge<Self, J::IntoIter>
    where +an iterator of Result values instead. Read more

    source§

    fn merge<J>(self, other: J) -> Merge<Self, J::IntoIter>
    where Self: Sized, Self::Item: PartialOrd, J: IntoIterator<Item = Self::Item>,

    Return an iterator adaptor that merges the two base iterators in ascending order. If both base iterators are sorted (ascending), the -result is sorted. Read more
    source§

    fn merge_by<J, F>(self, other: J, is_first: F) -> MergeBy<Self, J::IntoIter, F> ⓘ
    where +result is sorted. Read more

    source§

    fn merge_by<J, F>(self, other: J, is_first: F) -> MergeBy<Self, J::IntoIter, F> ⓘ
    where Self: Sized, J: IntoIterator<Item = Self::Item>, F: FnMut(&Self::Item, &Self::Item) -> bool,

    Return an iterator adaptor that merges the two base iterators in order. -This is much like .merge() but allows for a custom ordering. Read more
    source§

    fn merge_join_by<J, F, T>( +This is much like .merge() but allows for a custom ordering. Read more

    source§

    fn merge_join_by<J, F, T>( self, other: J, cmp_fn: F @@ -288,284 +289,295 @@ This is much like IntoIterator, F: FnMut(&Self::Item, &J::Item) -> T, Self: Sized,

    Create an iterator that merges items from both this and the specified -iterator in ascending order. Read more
    source§

    fn kmerge(self) -> KMerge<<Self::Item as IntoIterator>::IntoIter>
    where +iterator in ascending order. Read more

    source§

    fn kmerge(self) -> KMerge<<Self::Item as IntoIterator>::IntoIter>
    where Self: Sized, Self::Item: IntoIterator, <Self::Item as IntoIterator>::Item: PartialOrd,

    Return an iterator adaptor that flattens an iterator of iterators by -merging them in ascending order. Read more
    source§

    fn kmerge_by<F>( +merging them in ascending order. Read more

    source§

    fn kmerge_by<F>( self, first: F ) -> KMergeBy<<Self::Item as IntoIterator>::IntoIter, F> ⓘ
    where Self: Sized, Self::Item: IntoIterator, F: FnMut(&<Self::Item as IntoIterator>::Item, &<Self::Item as IntoIterator>::Item) -> bool,

    Return an iterator adaptor that flattens an iterator of iterators by -merging them according to the given closure. Read more
    source§

    fn cartesian_product<J>(self, other: J) -> Product<Self, J::IntoIter> ⓘ
    where +merging them according to the given closure. Read more

    source§

    fn cartesian_product<J>(self, other: J) -> Product<Self, J::IntoIter> ⓘ
    where Self: Sized, Self::Item: Clone, J: IntoIterator, J::IntoIter: Clone,

    Return an iterator adaptor that iterates over the cartesian product of -the element sets of two iterators self and J. Read more
    source§

    fn multi_cartesian_product( +the element sets of two iterators self and J. Read more

    source§

    fn multi_cartesian_product( self ) -> MultiProduct<<Self::Item as IntoIterator>::IntoIter> ⓘ
    where Self: Sized, Self::Item: IntoIterator, <Self::Item as IntoIterator>::IntoIter: Clone, <Self::Item as IntoIterator>::Item: Clone,

    Return an iterator adaptor that iterates over the cartesian product of -all subiterators returned by meta-iterator self. Read more
    source§

    fn coalesce<F>(self, f: F) -> Coalesce<Self, F>
    where +all subiterators returned by meta-iterator self. Read more

    source§

    fn coalesce<F>(self, f: F) -> Coalesce<Self, F>
    where Self: Sized, F: FnMut(Self::Item, Self::Item) -> Result<Self::Item, (Self::Item, Self::Item)>,

    Return an iterator adaptor that uses the passed-in closure to -optionally merge together consecutive elements. Read more
    source§

    fn dedup(self) -> Dedup<Self>
    where +optionally merge together consecutive elements. Read more

    source§

    fn dedup(self) -> Dedup<Self>
    where Self: Sized, Self::Item: PartialEq,

    Remove duplicates from sections of consecutive identical elements. -If the iterator is sorted, all elements will be unique. Read more
    source§

    fn dedup_by<Cmp>(self, cmp: Cmp) -> DedupBy<Self, Cmp>
    where +If the iterator is sorted, all elements will be unique. Read more

    source§

    fn dedup_by<Cmp>(self, cmp: Cmp) -> DedupBy<Self, Cmp>
    where Self: Sized, Cmp: FnMut(&Self::Item, &Self::Item) -> bool,

    Remove duplicates from sections of consecutive identical elements, determining equality using a comparison function. -If the iterator is sorted, all elements will be unique. Read more
    source§

    fn dedup_with_count(self) -> DedupWithCount<Self>
    where +If the iterator is sorted, all elements will be unique. Read more

    source§

    fn dedup_with_count(self) -> DedupWithCount<Self>
    where Self: Sized,

    Remove duplicates from sections of consecutive identical elements, while keeping a count of how many repeated elements were present. -If the iterator is sorted, all elements will be unique. Read more
    source§

    fn dedup_by_with_count<Cmp>(self, cmp: Cmp) -> DedupByWithCount<Self, Cmp>
    where +If the iterator is sorted, all elements will be unique. Read more

    source§

    fn dedup_by_with_count<Cmp>(self, cmp: Cmp) -> DedupByWithCount<Self, Cmp>
    where Self: Sized, Cmp: FnMut(&Self::Item, &Self::Item) -> bool,

    Remove duplicates from sections of consecutive identical elements, while keeping a count of how many repeated elements were present. This will determine equality using a comparison function. -If the iterator is sorted, all elements will be unique. Read more
    source§

    fn duplicates(self) -> Duplicates<Self>
    where +If the iterator is sorted, all elements will be unique. Read more

    source§

    fn duplicates(self) -> Duplicates<Self>
    where Self: Sized, Self::Item: Eq + Hash,

    Return an iterator adaptor that produces elements that appear more than once during the -iteration. Duplicates are detected using hash and equality. Read more
    source§

    fn duplicates_by<V, F>(self, f: F) -> DuplicatesBy<Self, V, F>
    where +iteration. Duplicates are detected using hash and equality. Read more

    source§

    fn duplicates_by<V, F>(self, f: F) -> DuplicatesBy<Self, V, F>
    where Self: Sized, V: Eq + Hash, F: FnMut(&Self::Item) -> V,

    Return an iterator adaptor that produces elements that appear more than once during the -iteration. Duplicates are detected using hash and equality. Read more
    source§

    fn unique(self) -> Unique<Self> ⓘ
    where +iteration. Duplicates are detected using hash and equality. Read more

    source§

    fn unique(self) -> Unique<Self> ⓘ
    where Self: Sized, Self::Item: Clone + Eq + Hash,

    Return an iterator adaptor that filters out elements that have already been produced once during the iteration. Duplicates -are detected using hash and equality. Read more
    source§

    fn unique_by<V, F>(self, f: F) -> UniqueBy<Self, V, F> ⓘ
    where +are detected using hash and equality. Read more

    source§

    fn unique_by<V, F>(self, f: F) -> UniqueBy<Self, V, F> ⓘ
    where Self: Sized, V: Eq + Hash, F: FnMut(&Self::Item) -> V,

    Return an iterator adaptor that filters out elements that have -already been produced once during the iteration. Read more
    source§

    fn peeking_take_while<F>(&mut self, accept: F) -> PeekingTakeWhile<'_, Self, F> ⓘ
    where +already been produced once during the iteration. Read more

    source§

    fn peeking_take_while<F>(&mut self, accept: F) -> PeekingTakeWhile<'_, Self, F> ⓘ
    where Self: Sized + PeekingNext, F: FnMut(&Self::Item) -> bool,

    Return an iterator adaptor that borrows from this iterator and -takes items while the closure accept returns true. Read more
    source§

    fn take_while_ref<F>(&mut self, accept: F) -> TakeWhileRef<'_, Self, F> ⓘ
    where +takes items while the closure accept returns true. Read more

    source§

    fn take_while_ref<F>(&mut self, accept: F) -> TakeWhileRef<'_, Self, F> ⓘ
    where Self: Clone, F: FnMut(&Self::Item) -> bool,

    Return an iterator adaptor that borrows from a Clone-able iterator -to only pick off elements while the predicate accept returns true. Read more
    source§

    fn take_while_inclusive<F>(self, accept: F) -> TakeWhileInclusive<Self, F> ⓘ
    where +to only pick off elements while the predicate accept returns true. Read more

    source§

    fn take_while_inclusive<F>(self, accept: F) -> TakeWhileInclusive<Self, F> ⓘ
    where Self: Sized, F: FnMut(&Self::Item) -> bool,

    Returns an iterator adaptor that consumes elements while the given predicate is true, including the element for which the predicate -first returned false. Read more
    source§

    fn while_some<A>(self) -> WhileSome<Self> ⓘ
    where +first returned false. Read more

    source§

    fn while_some<A>(self) -> WhileSome<Self> ⓘ
    where Self: Sized + Iterator<Item = Option<A>>,

    Return an iterator adaptor that filters Option<A> iterator elements -and produces A. Stops on the first None encountered. Read more
    source§

    fn tuple_combinations<T>(self) -> TupleCombinations<Self, T> ⓘ
    where +and produces A. Stops on the first None encountered. Read more

    source§

    fn tuple_combinations<T>(self) -> TupleCombinations<Self, T> ⓘ
    where Self: Sized + Clone, Self::Item: Clone, T: HasCombination<Self>,

    Return an iterator adaptor that iterates over the combinations of the -elements from an iterator. Read more
    source§

    fn combinations(self, k: usize) -> Combinations<Self> ⓘ
    where +elements from an iterator. Read more

    source§

    fn combinations(self, k: usize) -> Combinations<Self> ⓘ
    where Self: Sized, Self::Item: Clone,

    Return an iterator adaptor that iterates over the k-length combinations of -the elements from an iterator. Read more
    source§

    fn combinations_with_replacement( +the elements from an iterator. Read more

    source§

    fn combinations_with_replacement( self, k: usize ) -> CombinationsWithReplacement<Self> ⓘ
    where Self: Sized, Self::Item: Clone,

    Return an iterator that iterates over the k-length combinations of -the elements from an iterator, with replacement. Read more
    source§

    fn permutations(self, k: usize) -> Permutations<Self> ⓘ
    where +the elements from an iterator, with replacement. Read more

    source§

    fn permutations(self, k: usize) -> Permutations<Self> ⓘ
    where Self: Sized, Self::Item: Clone,

    Return an iterator adaptor that iterates over all k-permutations of the -elements from an iterator. Read more
    source§

    fn powerset(self) -> Powerset<Self> ⓘ
    where +elements from an iterator. Read more

    source§

    fn powerset(self) -> Powerset<Self> ⓘ
    where Self: Sized, Self::Item: Clone,

    Return an iterator that iterates through the powerset of the elements from an -iterator. Read more
    source§

    fn pad_using<F>(self, min: usize, f: F) -> PadUsing<Self, F> ⓘ
    where +iterator. Read more

    source§

    fn pad_using<F>(self, min: usize, f: F) -> PadUsing<Self, F> ⓘ
    where Self: Sized, F: FnMut(usize) -> Self::Item,

    Return an iterator adaptor that pads the sequence to a minimum length of -min by filling missing elements using a closure f. Read more
    source§

    fn with_position(self) -> WithPosition<Self> ⓘ
    where +min by filling missing elements using a closure f. Read more

    source§

    fn with_position(self) -> WithPosition<Self> ⓘ
    where Self: Sized,

    Return an iterator adaptor that combines each element with a Position to -ease special-case handling of the first or last elements. Read more
    source§

    fn positions<P>(self, predicate: P) -> Positions<Self, P> ⓘ
    where +ease special-case handling of the first or last elements. Read more

    source§

    fn positions<P>(self, predicate: P) -> Positions<Self, P> ⓘ
    where Self: Sized, P: FnMut(Self::Item) -> bool,

    Return an iterator adaptor that yields the indices of all elements -satisfying a predicate, counted from the start of the iterator. Read more
    source§

    fn update<F>(self, updater: F) -> Update<Self, F> ⓘ
    where +satisfying a predicate, counted from the start of the iterator. Read more

    source§

    fn update<F>(self, updater: F) -> Update<Self, F> ⓘ
    where Self: Sized, F: FnMut(&mut Self::Item),

    Return an iterator adaptor that applies a mutating function -to each element before yielding it. Read more
    source§

    fn next_tuple<T>(&mut self) -> Option<T>
    where +to each element before yielding it. Read more

    source§

    fn next_tuple<T>(&mut self) -> Option<T>
    where Self: Sized + Iterator<Item = T::Item>, T: HomogeneousTuple,

    Advances the iterator and returns the next items grouped in a tuple of -a specific size (up to 12). Read more
    source§

    fn collect_tuple<T>(self) -> Option<T>
    where +a specific size (up to 12). Read more

    source§

    fn collect_tuple<T>(self) -> Option<T>
    where Self: Sized + Iterator<Item = T::Item>, T: HomogeneousTuple,

    Collects all items from the iterator into a tuple of a specific size -(up to 12). Read more
    source§

    fn find_position<P>(&mut self, pred: P) -> Option<(usize, Self::Item)>
    where - P: FnMut(&Self::Item) -> bool,

    Find the position and value of the first element satisfying a predicate. Read more
    source§

    fn find_or_last<P>(self, predicate: P) -> Option<Self::Item>
    where +(up to 12). Read more

    source§

    fn find_position<P>(&mut self, pred: P) -> Option<(usize, Self::Item)>
    where + P: FnMut(&Self::Item) -> bool,

    Find the position and value of the first element satisfying a predicate. Read more
    source§

    fn find_or_last<P>(self, predicate: P) -> Option<Self::Item>
    where Self: Sized, - P: FnMut(&Self::Item) -> bool,

    Find the value of the first element satisfying a predicate or return the last element, if any. Read more
    source§

    fn find_or_first<P>(self, predicate: P) -> Option<Self::Item>
    where + P: FnMut(&Self::Item) -> bool,

    Find the value of the first element satisfying a predicate or return the last element, if any. Read more
    source§

    fn find_or_first<P>(self, predicate: P) -> Option<Self::Item>
    where Self: Sized, - P: FnMut(&Self::Item) -> bool,

    Find the value of the first element satisfying a predicate or return the first element, if any. Read more
    source§

    fn contains<Q>(&mut self, query: &Q) -> bool
    where + P: FnMut(&Self::Item) -> bool,

    Find the value of the first element satisfying a predicate or return the first element, if any. Read more
    source§

    fn contains<Q>(&mut self, query: &Q) -> bool
    where Self: Sized, Self::Item: Borrow<Q>, - Q: PartialEq,

    Returns true if the given item is present in this iterator. Read more
    source§

    fn all_equal(&mut self) -> bool
    where + Q: PartialEq,

    Returns true if the given item is present in this iterator. Read more
    source§

    fn all_equal(&mut self) -> bool
    where Self: Sized, - Self::Item: PartialEq,

    Check whether all elements compare equal. Read more
    source§

    fn all_equal_value( + Self::Item: PartialEq,

    Check whether all elements compare equal. Read more
    source§

    fn all_equal_value( &mut self ) -> Result<Self::Item, Option<(Self::Item, Self::Item)>>
    where Self: Sized, Self::Item: PartialEq,

    If there are elements and they are all equal, return a single copy of that element. If there are no elements, return an Error containing None. If there are elements and they are not all equal, return a tuple containing the first -two non-equal elements found. Read more
    source§

    fn all_unique(&mut self) -> bool
    where +two non-equal elements found. Read more

    source§

    fn all_unique(&mut self) -> bool
    where Self: Sized, - Self::Item: Eq + Hash,

    Check whether all elements are unique (non equal). Read more
    source§

    fn dropping(self, n: usize) -> Self
    where + Self::Item: Eq + Hash,

    Check whether all elements are unique (non equal). Read more
    source§

    fn dropping(self, n: usize) -> Self
    where Self: Sized,

    Consume the first n elements from the iterator eagerly, -and return the same iterator again. Read more
    source§

    fn dropping_back(self, n: usize) -> Self
    where +and return the same iterator again. Read more

    source§

    fn dropping_back(self, n: usize) -> Self
    where Self: Sized + DoubleEndedIterator,

    Consume the last n elements from the iterator eagerly, -and return the same iterator again. Read more
    source§

    fn foreach<F>(self, f: F)
    where - F: FnMut(Self::Item), - Self: Sized,

    👎Deprecated since 0.8.0: Use .for_each() instead
    Run the closure f eagerly on each element of the iterator. Read more
    source§

    fn concat(self) -> Self::Item
    where +and return the same iterator again. Read more

    source§

    fn concat(self) -> Self::Item
    where Self: Sized, - Self::Item: Extend<<<Self as Iterator>::Item as IntoIterator>::Item> + IntoIterator + Default,

    Combine all an iterator’s elements into one element by using Extend. Read more
    source§

    fn collect_vec(self) -> Vec<Self::Item>
    where + Self::Item: Extend<<<Self as Iterator>::Item as IntoIterator>::Item> + IntoIterator + Default,

    Combine all an iterator’s elements into one element by using Extend. Read more
    source§

    fn collect_vec(self) -> Vec<Self::Item>
    where Self: Sized,

    .collect_vec() is simply a type specialization of Iterator::collect, -for convenience.
    source§

    fn try_collect<T, U, E>(self) -> Result<U, E>
    where +for convenience.

    source§

    fn try_collect<T, U, E>(self) -> Result<U, E>
    where Self: Sized + Iterator<Item = Result<T, E>>, Result<U, E>: FromIterator<Result<T, E>>,

    .try_collect() is more convenient way of writing -.collect::<Result<_, _>>() Read more
    source§

    fn set_from<'a, A: 'a, J>(&mut self, from: J) -> usize
    where +.collect::<Result<_, _>>() Read more

    source§

    fn set_from<'a, A: 'a, J>(&mut self, from: J) -> usize
    where Self: Iterator<Item = &'a mut A>, J: IntoIterator<Item = A>,

    Assign to each reference in self from the from iterator, -stopping at the shortest of the two iterators. Read more
    source§

    fn join(&mut self, sep: &str) -> String
    where - Self::Item: Display,

    Combine all iterator elements into one String, separated by sep. Read more
    source§

    fn format(self, sep: &str) -> Format<'_, Self>
    where - Self: Sized,

    Format all iterator elements, separated by sep. Read more
    source§

    fn format_with<F>(self, sep: &str, format: F) -> FormatWith<'_, Self, F>
    where +stopping at the shortest of the two iterators. Read more

    source§

    fn join(&mut self, sep: &str) -> String
    where + Self::Item: Display,

    Combine all iterator elements into one String, separated by sep. Read more
    source§

    fn format(self, sep: &str) -> Format<'_, Self>
    where + Self: Sized,

    Format all iterator elements, separated by sep. Read more
    source§

    fn format_with<F>(self, sep: &str, format: F) -> FormatWith<'_, Self, F>
    where Self: Sized, - F: FnMut(Self::Item, &mut dyn FnMut(&dyn Display) -> Result) -> Result,

    Format all iterator elements, separated by sep. Read more
    source§

    fn fold_results<A, E, B, F>(&mut self, start: B, f: F) -> Result<B, E>
    where + F: FnMut(Self::Item, &mut dyn FnMut(&dyn Display) -> Result) -> Result,

    Format all iterator elements, separated by sep. Read more
    source§

    fn fold_ok<A, E, B, F>(&mut self, start: B, f: F) -> Result<B, E>
    where Self: Iterator<Item = Result<A, E>>, - F: FnMut(B, A) -> B,

    👎Deprecated since 0.10.0: Use .fold_ok() instead
    See .fold_ok().
    source§

    fn fold_ok<A, E, B, F>(&mut self, start: B, f: F) -> Result<B, E>
    where - Self: Iterator<Item = Result<A, E>>, - F: FnMut(B, A) -> B,

    Fold Result values from an iterator. Read more
    source§

    fn fold_options<A, B, F>(&mut self, start: B, f: F) -> Option<B>
    where + F: FnMut(B, A) -> B,

    Fold Result values from an iterator. Read more
    source§

    fn fold_options<A, B, F>(&mut self, start: B, f: F) -> Option<B>
    where Self: Iterator<Item = Option<A>>, - F: FnMut(B, A) -> B,

    Fold Option values from an iterator. Read more
    source§

    fn fold1<F>(self, f: F) -> Option<Self::Item>
    where + F: FnMut(B, A) -> B,

    Fold Option values from an iterator. Read more
    source§

    fn fold1<F>(self, f: F) -> Option<Self::Item>
    where F: FnMut(Self::Item, Self::Item) -> Self::Item, - Self: Sized,

    👎Deprecated since 0.10.2: Use Iterator::reduce instead
    Accumulator of the elements in the iterator. Read more
    source§

    fn tree_fold1<F>(self, f: F) -> Option<Self::Item>
    where + Self: Sized,

    👎Deprecated since 0.10.2: Use Iterator::reduce instead
    Accumulator of the elements in the iterator. Read more
    source§

    fn tree_reduce<F>(self, f: F) -> Option<Self::Item>
    where F: FnMut(Self::Item, Self::Item) -> Self::Item, - Self: Sized,

    Accumulate the elements in the iterator in a tree-like manner. Read more
    source§

    fn fold_while<B, F>(&mut self, init: B, f: F) -> FoldWhile<B>
    where + Self: Sized,

    Accumulate the elements in the iterator in a tree-like manner. Read more
    source§

    fn tree_fold1<F>(self, f: F) -> Option<Self::Item>
    where + F: FnMut(Self::Item, Self::Item) -> Self::Item, + Self: Sized,

    👎Deprecated since 0.13.0: Use .tree_reduce() instead
    See .tree_reduce().
    source§

    fn fold_while<B, F>(&mut self, init: B, f: F) -> FoldWhile<B>
    where Self: Sized, - F: FnMut(B, Self::Item) -> FoldWhile<B>,

    An iterator method that applies a function, producing a single, final value. Read more
    source§

    fn sum1<S>(self) -> Option<S>
    where + F: FnMut(B, Self::Item) -> FoldWhile<B>,

    An iterator method that applies a function, producing a single, final value. Read more
    source§

    fn sum1<S>(self) -> Option<S>
    where Self: Sized, - S: Sum<Self::Item>,

    Iterate over the entire iterator and add all the elements. Read more
    source§

    fn product1<P>(self) -> Option<P>
    where + S: Sum<Self::Item>,

    Iterate over the entire iterator and add all the elements. Read more
    source§

    fn product1<P>(self) -> Option<P>
    where Self: Sized, - P: Product<Self::Item>,

    Iterate over the entire iterator and multiply all the elements. Read more
    source§

    fn sorted_unstable(self) -> IntoIter<Self::Item> ⓘ
    where + P: Product<Self::Item>,

    Iterate over the entire iterator and multiply all the elements. Read more
    source§

    fn sorted_unstable(self) -> IntoIter<Self::Item> ⓘ
    where Self: Sized, - Self::Item: Ord,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_unstable_by<F>(self, cmp: F) -> IntoIter<Self::Item> ⓘ
    where + Self::Item: Ord,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_unstable_by<F>(self, cmp: F) -> IntoIter<Self::Item> ⓘ
    where Self: Sized, - F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_unstable_by_key<K, F>(self, f: F) -> IntoIter<Self::Item> ⓘ
    where + F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_unstable_by_key<K, F>(self, f: F) -> IntoIter<Self::Item> ⓘ
    where Self: Sized, K: Ord, - F: FnMut(&Self::Item) -> K,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted(self) -> IntoIter<Self::Item> ⓘ
    where + F: FnMut(&Self::Item) -> K,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted(self) -> IntoIter<Self::Item> ⓘ
    where Self: Sized, - Self::Item: Ord,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_by<F>(self, cmp: F) -> IntoIter<Self::Item> ⓘ
    where + Self::Item: Ord,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_by<F>(self, cmp: F) -> IntoIter<Self::Item> ⓘ
    where Self: Sized, - F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_by_key<K, F>(self, f: F) -> IntoIter<Self::Item> ⓘ
    where + F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_by_key<K, F>(self, f: F) -> IntoIter<Self::Item> ⓘ
    where Self: Sized, K: Ord, - F: FnMut(&Self::Item) -> K,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_by_cached_key<K, F>(self, f: F) -> IntoIter<Self::Item> ⓘ
    where + F: FnMut(&Self::Item) -> K,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_by_cached_key<K, F>(self, f: F) -> IntoIter<Self::Item> ⓘ
    where Self: Sized, K: Ord, F: FnMut(&Self::Item) -> K,

    Sort all iterator elements into a new iterator in ascending order. The key function is -called exactly once per key. Read more
    source§

    fn k_smallest(self, k: usize) -> IntoIter<Self::Item> ⓘ
    where +called exactly once per key. Read more

    source§

    fn k_smallest(self, k: usize) -> IntoIter<Self::Item> ⓘ
    where Self: Sized, - Self::Item: Ord,

    Sort the k smallest elements into a new iterator, in ascending order. Read more
    source§

    fn partition_map<A, B, F, L, R>(self, predicate: F) -> (A, B)
    where + Self::Item: Ord,

    Sort the k smallest elements into a new iterator, in ascending order. Read more
    source§

    fn k_smallest_by<F>(self, k: usize, cmp: F) -> IntoIter<Self::Item> ⓘ
    where + Self: Sized, + F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Sort the k smallest elements into a new iterator using the provided comparison. Read more
    source§

    fn k_smallest_by_key<F, K>(self, k: usize, key: F) -> IntoIter<Self::Item> ⓘ
    where + Self: Sized, + F: FnMut(&Self::Item) -> K, + K: Ord,

    Return the elements producing the k smallest outputs of the provided function. Read more
    source§

    fn k_largest(self, k: usize) -> IntoIter<Self::Item> ⓘ
    where + Self: Sized, + Self::Item: Ord,

    Sort the k largest elements into a new iterator, in descending order. Read more
    source§

    fn k_largest_by<F>(self, k: usize, cmp: F) -> IntoIter<Self::Item> ⓘ
    where + Self: Sized, + F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Sort the k largest elements into a new iterator using the provided comparison. Read more
    source§

    fn k_largest_by_key<F, K>(self, k: usize, key: F) -> IntoIter<Self::Item> ⓘ
    where + Self: Sized, + F: FnMut(&Self::Item) -> K, + K: Ord,

    Return the elements producing the k largest outputs of the provided function. Read more
    source§

    fn tail(self, n: usize) -> IntoIter<Self::Item> ⓘ
    where + Self: Sized,

    Consumes the iterator and return an iterator of the last n elements. Read more
    source§

    fn partition_map<A, B, F, L, R>(self, predicate: F) -> (A, B)
    where Self: Sized, F: FnMut(Self::Item) -> Either<L, R>, A: Default + Extend<L>, B: Default + Extend<R>,

    Collect all iterator elements into one of two partitions. Unlike Iterator::partition, each partition may -have a distinct type. Read more
    source§

    fn partition_result<A, B, T, E>(self) -> (A, B)
    where +have a distinct type. Read more

    source§

    fn partition_result<A, B, T, E>(self) -> (A, B)
    where Self: Iterator<Item = Result<T, E>> + Sized, A: Default + Extend<T>, B: Default + Extend<E>,

    Partition a sequence of Results into one list of all the Ok elements -and another list of all the Err elements. Read more
    source§

    fn into_group_map<K, V>(self) -> HashMap<K, Vec<V>>
    where +and another list of all the Err elements. Read more

    source§

    fn into_group_map<K, V>(self) -> HashMap<K, Vec<V>>
    where Self: Iterator<Item = (K, V)> + Sized, K: Hash + Eq,

    Return a HashMap of keys mapped to Vecs of values. Keys and values -are taken from (Key, Value) tuple pairs yielded by the input iterator. Read more
    source§

    fn into_group_map_by<K, V, F>(self, f: F) -> HashMap<K, Vec<V>>
    where +are taken from (Key, Value) tuple pairs yielded by the input iterator. Read more

    source§

    fn into_group_map_by<K, V, F>(self, f: F) -> HashMap<K, Vec<V>>
    where Self: Iterator<Item = V> + Sized, K: Hash + Eq, - F: Fn(&V) -> K,

    Return an Iterator on a HashMap. Keys mapped to Vecs of values. The key is specified -in the closure. Read more
    source§

    fn into_grouping_map<K, V>(self) -> GroupingMap<Self>
    where + F: FnMut(&V) -> K,

    Return an Iterator on a HashMap. Keys mapped to Vecs of values. The key is specified +in the closure. Read more
    source§

    fn into_grouping_map<K, V>(self) -> GroupingMap<Self>
    where Self: Iterator<Item = (K, V)> + Sized, K: Hash + Eq,

    Constructs a GroupingMap to be used later with one of the efficient -group-and-fold operations it allows to perform. Read more
    source§

    fn into_grouping_map_by<K, V, F>(self, key_mapper: F) -> GroupingMapBy<Self, F>
    where +group-and-fold operations it allows to perform. Read more

    source§

    fn into_grouping_map_by<K, V, F>(self, key_mapper: F) -> GroupingMapBy<Self, F>
    where Self: Iterator<Item = V> + Sized, K: Hash + Eq, F: FnMut(&V) -> K,

    Constructs a GroupingMap to be used later with one of the efficient -group-and-fold operations it allows to perform. Read more
    source§

    fn min_set(self) -> Vec<Self::Item>
    where +group-and-fold operations it allows to perform. Read more

    source§

    fn min_set(self) -> Vec<Self::Item>
    where Self: Sized, - Self::Item: Ord,

    Return all minimum elements of an iterator. Read more
    source§

    fn min_set_by<F>(self, compare: F) -> Vec<Self::Item>
    where + Self::Item: Ord,

    Return all minimum elements of an iterator. Read more
    source§

    fn min_set_by<F>(self, compare: F) -> Vec<Self::Item>
    where Self: Sized, F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Return all minimum elements of an iterator, as determined by -the specified function. Read more
    source§

    fn min_set_by_key<K, F>(self, key: F) -> Vec<Self::Item>
    where +the specified function. Read more

    source§

    fn min_set_by_key<K, F>(self, key: F) -> Vec<Self::Item>
    where Self: Sized, K: Ord, F: FnMut(&Self::Item) -> K,

    Return all minimum elements of an iterator, as determined by -the specified function. Read more
    source§

    fn max_set(self) -> Vec<Self::Item>
    where +the specified function. Read more

    source§

    fn max_set(self) -> Vec<Self::Item>
    where Self: Sized, - Self::Item: Ord,

    Return all maximum elements of an iterator. Read more
    source§

    fn max_set_by<F>(self, compare: F) -> Vec<Self::Item>
    where + Self::Item: Ord,

    Return all maximum elements of an iterator. Read more
    source§

    fn max_set_by<F>(self, compare: F) -> Vec<Self::Item>
    where Self: Sized, F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Return all maximum elements of an iterator, as determined by -the specified function. Read more
    source§

    fn max_set_by_key<K, F>(self, key: F) -> Vec<Self::Item>
    where +the specified function. Read more

    source§

    fn max_set_by_key<K, F>(self, key: F) -> Vec<Self::Item>
    where Self: Sized, K: Ord, F: FnMut(&Self::Item) -> K,

    Return all maximum elements of an iterator, as determined by -the specified function. Read more
    source§

    fn minmax(self) -> MinMaxResult<Self::Item>
    where +the specified function. Read more

    source§

    fn minmax(self) -> MinMaxResult<Self::Item>
    where Self: Sized, - Self::Item: PartialOrd,

    Return the minimum and maximum elements in the iterator. Read more
    source§

    fn minmax_by_key<K, F>(self, key: F) -> MinMaxResult<Self::Item>
    where + Self::Item: PartialOrd,

    Return the minimum and maximum elements in the iterator. Read more
    source§

    fn minmax_by_key<K, F>(self, key: F) -> MinMaxResult<Self::Item>
    where Self: Sized, K: PartialOrd, F: FnMut(&Self::Item) -> K,

    Return the minimum and maximum element of an iterator, as determined by -the specified function. Read more
    source§

    fn minmax_by<F>(self, compare: F) -> MinMaxResult<Self::Item>
    where +the specified function. Read more

    source§

    fn minmax_by<F>(self, compare: F) -> MinMaxResult<Self::Item>
    where Self: Sized, F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Return the minimum and maximum element of an iterator, as determined by -the specified comparison function. Read more
    source§

    fn position_max(self) -> Option<usize>
    where +the specified comparison function. Read more

    source§

    fn position_max(self) -> Option<usize>
    where Self: Sized, - Self::Item: Ord,

    Return the position of the maximum element in the iterator. Read more
    source§

    fn position_max_by_key<K, F>(self, key: F) -> Option<usize>
    where + Self::Item: Ord,

    Return the position of the maximum element in the iterator. Read more
    source§

    fn position_max_by_key<K, F>(self, key: F) -> Option<usize>
    where Self: Sized, K: Ord, F: FnMut(&Self::Item) -> K,

    Return the position of the maximum element in the iterator, as -determined by the specified function. Read more
    source§

    fn position_max_by<F>(self, compare: F) -> Option<usize>
    where +determined by the specified function. Read more

    source§

    fn position_max_by<F>(self, compare: F) -> Option<usize>
    where Self: Sized, F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Return the position of the maximum element in the iterator, as -determined by the specified comparison function. Read more
    source§

    fn position_min(self) -> Option<usize>
    where +determined by the specified comparison function. Read more

    source§

    fn position_min(self) -> Option<usize>
    where Self: Sized, - Self::Item: Ord,

    Return the position of the minimum element in the iterator. Read more
    source§

    fn position_min_by_key<K, F>(self, key: F) -> Option<usize>
    where + Self::Item: Ord,

    Return the position of the minimum element in the iterator. Read more
    source§

    fn position_min_by_key<K, F>(self, key: F) -> Option<usize>
    where Self: Sized, K: Ord, F: FnMut(&Self::Item) -> K,

    Return the position of the minimum element in the iterator, as -determined by the specified function. Read more
    source§

    fn position_min_by<F>(self, compare: F) -> Option<usize>
    where +determined by the specified function. Read more

    source§

    fn position_min_by<F>(self, compare: F) -> Option<usize>
    where Self: Sized, F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Return the position of the minimum element in the iterator, as -determined by the specified comparison function. Read more
    source§

    fn position_minmax(self) -> MinMaxResult<usize>
    where +determined by the specified comparison function. Read more

    source§

    fn position_minmax(self) -> MinMaxResult<usize>
    where Self: Sized, Self::Item: PartialOrd,

    Return the positions of the minimum and maximum elements in -the iterator. Read more
    source§

    fn position_minmax_by_key<K, F>(self, key: F) -> MinMaxResult<usize>
    where +the iterator. Read more

    source§

    fn position_minmax_by_key<K, F>(self, key: F) -> MinMaxResult<usize>
    where Self: Sized, K: PartialOrd, F: FnMut(&Self::Item) -> K,

    Return the postions of the minimum and maximum elements of an -iterator, as determined by the specified function. Read more
    source§

    fn position_minmax_by<F>(self, compare: F) -> MinMaxResult<usize>
    where +iterator, as determined by the specified function. Read more

    source§

    fn position_minmax_by<F>(self, compare: F) -> MinMaxResult<usize>
    where Self: Sized, F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Return the postions of the minimum and maximum elements of an -iterator, as determined by the specified comparison function. Read more
    source§

    fn exactly_one(self) -> Result<Self::Item, ExactlyOneError<Self>>
    where +iterator, as determined by the specified comparison function. Read more

    source§

    fn exactly_one(self) -> Result<Self::Item, ExactlyOneError<Self>>
    where Self: Sized,

    If the iterator yields exactly one element, that element will be returned, otherwise an error will be returned containing an iterator that has the same output as the input -iterator. Read more
    source§

    fn at_most_one(self) -> Result<Option<Self::Item>, ExactlyOneError<Self>>
    where - Self: Sized,

    If the iterator yields no elements, Ok(None) will be returned. If the iterator yields +iterator. Read more
    source§

    fn at_most_one(self) -> Result<Option<Self::Item>, ExactlyOneError<Self>>
    where + Self: Sized,

    If the iterator yields no elements, Ok(None) will be returned. If the iterator yields exactly one element, that element will be returned, otherwise an error will be returned -containing an iterator that has the same output as the input iterator. Read more
    source§

    fn multipeek(self) -> MultiPeek<Self> ⓘ
    where +containing an iterator that has the same output as the input iterator. Read more

    source§

    fn multipeek(self) -> MultiPeek<Self> ⓘ
    where Self: Sized,

    An iterator adaptor that allows the user to peek at multiple .next() -values without advancing the base iterator. Read more
    source§

    fn counts(self) -> HashMap<Self::Item, usize>
    where +values without advancing the base iterator. Read more

    source§

    fn counts(self) -> HashMap<Self::Item, usize>
    where Self: Sized, Self::Item: Eq + Hash,

    Collect the items in this iterator and return a HashMap which contains each item that appears in the iterator and the number -of times it appears. Read more
    source§

    fn counts_by<K, F>(self, f: F) -> HashMap<K, usize>
    where +of times it appears. Read more

    source§

    fn counts_by<K, F>(self, f: F) -> HashMap<K, usize>
    where Self: Sized, K: Eq + Hash, F: FnMut(Self::Item) -> K,

    Collect the items in this iterator and return a HashMap which contains each item that appears in the iterator and the number of times it appears, -determining identity using a keying function. Read more
    source§

    fn multiunzip<FromI>(self) -> FromI
    where - Self: Sized + MultiUnzip<FromI>,

    Converts an iterator of tuples into a tuple of containers. Read more
    source§

    fn try_len(&self) -> Result<usize, (usize, Option<usize>)>

    Returns the length of the iterator if one exists. +determining identity using a keying function. Read more
    source§

    fn multiunzip<FromI>(self) -> FromI
    where + Self: Sized + MultiUnzip<FromI>,

    Converts an iterator of tuples into a tuple of containers. Read more
    source§

    fn try_len(&self) -> Result<usize, (usize, Option<usize>)>

    Returns the length of the iterator if one exists. Otherwise return self.size_hint(). Read more
    source§

    impl<IT> MultiUnzip<()> for IT
    where IT: Iterator<Item = ()>,

    source§

    fn multiunzip(self)

    Unzip this iterator into multiple collections.
    source§

    impl<IT, A, FromA> MultiUnzip<(FromA,)> for IT
    where IT: Iterator<Item = (A,)>, @@ -667,4 +679,4 @@ Otherwise return self.size_hint(). (FromA, FromB, FromC, FromD, FromE, FromF, FromG, FromH, FromI, FromJ, FromK, FromL)

    Unzip this iterator into multiple collections.
    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 + 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/itertools/structs/struct.TupleBuffer.html b/itertools/structs/struct.TupleBuffer.html index 81f9e07f7..db34cbf29 100644 --- a/itertools/structs/struct.TupleBuffer.html +++ b/itertools/structs/struct.TupleBuffer.html @@ -1,4 +1,4 @@ -TupleBuffer in itertools::structs - Rust
    +TupleBuffer in itertools::structs - Rust

    Struct itertools::structs::TupleBuffer

    source · 
    pub struct TupleBuffer<T>
    where
     T: HomogeneousTuple,
    { /* private fields */ }
    Expand description

    An iterator over a incomplete tuple.

    See .tuples() and @@ -208,86 +208,87 @@ otherwise. Right variant of Either<Self, Self> otherwise. Read more

    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> Itertools for T
    where - T: Iterator + ?Sized,

    source§

    fn interleave<J>(self, other: J) -> Interleave<Self, J::IntoIter> ⓘ
    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> Itertools for T
    where + T: Iterator + ?Sized,

    source§

    fn interleave<J>(self, other: J) -> Interleave<Self, J::IntoIter> ⓘ
    where J: IntoIterator<Item = Self::Item>, - Self: Sized,

    Alternate elements from two iterators until both have run out. Read more
    source§

    fn interleave_shortest<J>( + Self: Sized,

    Alternate elements from two iterators until both have run out. Read more
    source§

    fn interleave_shortest<J>( self, other: J ) -> InterleaveShortest<Self, J::IntoIter> ⓘ
    where J: IntoIterator<Item = Self::Item>, Self: Sized,

    Alternate elements from two iterators until at least one of them has run -out. Read more
    source§

    fn intersperse(self, element: Self::Item) -> Intersperse<Self>
    where +out. Read more

    source§

    fn intersperse(self, element: Self::Item) -> Intersperse<Self>
    where Self: Sized, Self::Item: Clone,

    An iterator adaptor to insert a particular value -between each element of the adapted iterator. Read more
    source§

    fn intersperse_with<F>(self, element: F) -> IntersperseWith<Self, F> ⓘ
    where +between each element of the adapted iterator. Read more

    source§

    fn intersperse_with<F>(self, element: F) -> IntersperseWith<Self, F> ⓘ
    where Self: Sized, F: FnMut() -> Self::Item,

    An iterator adaptor to insert a particular value created by a function -between each element of the adapted iterator. Read more
    source§

    fn zip_longest<J>(self, other: J) -> ZipLongest<Self, J::IntoIter> ⓘ
    where +between each element of the adapted iterator. Read more

    source§

    fn get<R>(self, index: R) -> R::Output
    where + Self: Sized, + R: IteratorIndex<Self>,

    Returns an iterator over a subsection of the iterator. Read more
    source§

    fn zip_longest<J>(self, other: J) -> ZipLongest<Self, J::IntoIter> ⓘ
    where J: IntoIterator, Self: Sized,

    Create an iterator which iterates over both this and the specified -iterator simultaneously, yielding pairs of two optional elements. Read more
    source§

    fn zip_eq<J>(self, other: J) -> ZipEq<Self, J::IntoIter> ⓘ
    where +iterator simultaneously, yielding pairs of two optional elements. Read more

    source§

    fn zip_eq<J>(self, other: J) -> ZipEq<Self, J::IntoIter> ⓘ
    where J: IntoIterator, Self: Sized,

    Create an iterator which iterates over both this and the specified -iterator simultaneously, yielding pairs of elements. Read more
    source§

    fn batching<B, F>(self, f: F) -> Batching<Self, F> ⓘ
    where +iterator simultaneously, yielding pairs of elements. Read more

    source§

    fn batching<B, F>(self, f: F) -> Batching<Self, F> ⓘ
    where F: FnMut(&mut Self) -> Option<B>, Self: Sized,

    A “meta iterator adaptor”. Its closure receives a reference to the iterator and may pick off as many elements as it likes, to produce the -next iterator element. Read more
    source§

    fn group_by<K, F>(self, key: F) -> GroupBy<K, Self, F>
    where +next iterator element. Read more

    source§

    fn chunk_by<K, F>(self, key: F) -> ChunkBy<K, Self, F>
    where Self: Sized, F: FnMut(&Self::Item) -> K, K: PartialEq,

    Return an iterable that can group iterator elements. Consecutive elements that map to the same key (“runs”), are assigned -to the same group. Read more
    source§

    fn chunks(self, size: usize) -> IntoChunks<Self>
    where - Self: Sized,

    Return an iterable that can chunk the iterator. Read more
    source§

    fn tuple_windows<T>(self) -> TupleWindows<Self, T> ⓘ
    where +to the same group. Read more

    source§

    fn group_by<K, F>(self, key: F) -> ChunkBy<K, Self, F>
    where + Self: Sized, + F: FnMut(&Self::Item) -> K, + K: PartialEq,

    👎Deprecated since 0.13.0: Use .chunk_by() instead
    See .chunk_by().
    source§

    fn chunks(self, size: usize) -> IntoChunks<Self>
    where + Self: Sized,

    Return an iterable that can chunk the iterator. Read more
    source§

    fn tuple_windows<T>(self) -> TupleWindows<Self, T> ⓘ
    where Self: Sized + Iterator<Item = T::Item>, T: HomogeneousTuple, T::Item: Clone,

    Return an iterator over all contiguous windows producing tuples of -a specific size (up to 12). Read more
    source§

    fn circular_tuple_windows<T>(self) -> CircularTupleWindows<Self, T> ⓘ
    where +a specific size (up to 12). Read more

    source§

    fn circular_tuple_windows<T>(self) -> CircularTupleWindows<Self, T> ⓘ
    where Self: Sized + Clone + Iterator<Item = T::Item> + ExactSizeIterator, T: TupleCollect + Clone, T::Item: Clone,

    Return an iterator over all windows, wrapping back to the first elements when the window would otherwise exceed the length of the -iterator, producing tuples of a specific size (up to 12). Read more
    source§

    fn tuples<T>(self) -> Tuples<Self, T> ⓘ
    where +iterator, producing tuples of a specific size (up to 12). Read more

    source§

    fn tuples<T>(self) -> Tuples<Self, T> ⓘ
    where Self: Sized + Iterator<Item = T::Item>, T: HomogeneousTuple,

    Return an iterator that groups the items in tuples of a specific size -(up to 12). Read more
    source§

    fn tee(self) -> (Tee<Self>, Tee<Self>)
    where +(up to 12). Read more

    source§

    fn tee(self) -> (Tee<Self>, Tee<Self>)
    where Self: Sized, Self::Item: Clone,

    Split into an iterator pair that both yield all elements from -the original iterator. Read more
    source§

    fn step(self, n: usize) -> Step<Self> ⓘ
    where - Self: Sized,

    👎Deprecated since 0.8.0: Use std .step_by() instead
    Return an iterator adaptor that steps n elements in the base iterator -for each iteration. Read more
    source§

    fn map_into<R>(self) -> MapInto<Self, R>
    where +the original iterator. Read more

    source§

    fn map_into<R>(self) -> MapInto<Self, R>
    where Self: Sized, - Self::Item: Into<R>,

    Convert each item of the iterator using the Into trait. Read more
    source§

    fn map_results<F, T, U, E>(self, f: F) -> MapOk<Self, F>
    where - Self: Iterator<Item = Result<T, E>> + Sized, - F: FnMut(T) -> U,

    👎Deprecated since 0.10.0: Use .map_ok() instead
    See .map_ok().
    source§

    fn map_ok<F, T, U, E>(self, f: F) -> MapOk<Self, F>
    where + Self::Item: Into<R>,

    Convert each item of the iterator using the Into trait. Read more
    source§

    fn map_ok<F, T, U, E>(self, f: F) -> MapOk<Self, F>
    where Self: Iterator<Item = Result<T, E>> + Sized, F: FnMut(T) -> U,

    Return an iterator adaptor that applies the provided closure to every Result::Ok value. Result::Err values are -unchanged. Read more
    source§

    fn filter_ok<F, T, E>(self, f: F) -> FilterOk<Self, F> ⓘ
    where +unchanged. Read more

    source§

    fn filter_ok<F, T, E>(self, f: F) -> FilterOk<Self, F> ⓘ
    where Self: Iterator<Item = Result<T, E>> + Sized, F: FnMut(&T) -> bool,

    Return an iterator adaptor that filters every Result::Ok value with the provided closure. Result::Err values are -unchanged. Read more
    source§

    fn filter_map_ok<F, T, U, E>(self, f: F) -> FilterMapOk<Self, F> ⓘ
    where +unchanged. Read more

    source§

    fn filter_map_ok<F, T, U, E>(self, f: F) -> FilterMapOk<Self, F> ⓘ
    where Self: Iterator<Item = Result<T, E>> + Sized, F: FnMut(T) -> Option<U>,

    Return an iterator adaptor that filters and transforms every Result::Ok value with the provided closure. Result::Err -values are unchanged. Read more
    source§

    fn flatten_ok<T, E>(self) -> FlattenOk<Self, T, E> ⓘ
    where +values are unchanged. Read more

    source§

    fn flatten_ok<T, E>(self) -> FlattenOk<Self, T, E> ⓘ
    where Self: Iterator<Item = Result<T, E>> + Sized, T: IntoIterator,

    Return an iterator adaptor that flattens every Result::Ok value into -a series of Result::Ok values. Result::Err values are unchanged. Read more
    source§

    fn process_results<F, T, E, R>(self, processor: F) -> Result<R, E>
    where +a series of Result::Ok values. Result::Err values are unchanged. Read more

    source§

    fn process_results<F, T, E, R>(self, processor: F) -> Result<R, E>
    where Self: Iterator<Item = Result<T, E>> + Sized, F: FnOnce(ProcessResults<'_, Self, E>) -> R,

    “Lift” a function of the values of the current iterator so as to process -an iterator of Result values instead. Read more
    source§

    fn merge<J>(self, other: J) -> Merge<Self, J::IntoIter>
    where +an iterator of Result values instead. Read more

    source§

    fn merge<J>(self, other: J) -> Merge<Self, J::IntoIter>
    where Self: Sized, Self::Item: PartialOrd, J: IntoIterator<Item = Self::Item>,

    Return an iterator adaptor that merges the two base iterators in ascending order. If both base iterators are sorted (ascending), the -result is sorted. Read more
    source§

    fn merge_by<J, F>(self, other: J, is_first: F) -> MergeBy<Self, J::IntoIter, F> ⓘ
    where +result is sorted. Read more

    source§

    fn merge_by<J, F>(self, other: J, is_first: F) -> MergeBy<Self, J::IntoIter, F> ⓘ
    where Self: Sized, J: IntoIterator<Item = Self::Item>, F: FnMut(&Self::Item, &Self::Item) -> bool,

    Return an iterator adaptor that merges the two base iterators in order. -This is much like .merge() but allows for a custom ordering. Read more
    source§

    fn merge_join_by<J, F, T>( +This is much like .merge() but allows for a custom ordering. Read more

    source§

    fn merge_join_by<J, F, T>( self, other: J, cmp_fn: F @@ -295,284 +296,295 @@ This is much like IntoIterator, F: FnMut(&Self::Item, &J::Item) -> T, Self: Sized,

    Create an iterator that merges items from both this and the specified -iterator in ascending order. Read more
    source§

    fn kmerge(self) -> KMerge<<Self::Item as IntoIterator>::IntoIter>
    where +iterator in ascending order. Read more

    source§

    fn kmerge(self) -> KMerge<<Self::Item as IntoIterator>::IntoIter>
    where Self: Sized, Self::Item: IntoIterator, <Self::Item as IntoIterator>::Item: PartialOrd,

    Return an iterator adaptor that flattens an iterator of iterators by -merging them in ascending order. Read more
    source§

    fn kmerge_by<F>( +merging them in ascending order. Read more

    source§

    fn kmerge_by<F>( self, first: F ) -> KMergeBy<<Self::Item as IntoIterator>::IntoIter, F> ⓘ
    where Self: Sized, Self::Item: IntoIterator, F: FnMut(&<Self::Item as IntoIterator>::Item, &<Self::Item as IntoIterator>::Item) -> bool,

    Return an iterator adaptor that flattens an iterator of iterators by -merging them according to the given closure. Read more
    source§

    fn cartesian_product<J>(self, other: J) -> Product<Self, J::IntoIter> ⓘ
    where +merging them according to the given closure. Read more

    source§

    fn cartesian_product<J>(self, other: J) -> Product<Self, J::IntoIter> ⓘ
    where Self: Sized, Self::Item: Clone, J: IntoIterator, J::IntoIter: Clone,

    Return an iterator adaptor that iterates over the cartesian product of -the element sets of two iterators self and J. Read more
    source§

    fn multi_cartesian_product( +the element sets of two iterators self and J. Read more

    source§

    fn multi_cartesian_product( self ) -> MultiProduct<<Self::Item as IntoIterator>::IntoIter> ⓘ
    where Self: Sized, Self::Item: IntoIterator, <Self::Item as IntoIterator>::IntoIter: Clone, <Self::Item as IntoIterator>::Item: Clone,

    Return an iterator adaptor that iterates over the cartesian product of -all subiterators returned by meta-iterator self. Read more
    source§

    fn coalesce<F>(self, f: F) -> Coalesce<Self, F>
    where +all subiterators returned by meta-iterator self. Read more

    source§

    fn coalesce<F>(self, f: F) -> Coalesce<Self, F>
    where Self: Sized, F: FnMut(Self::Item, Self::Item) -> Result<Self::Item, (Self::Item, Self::Item)>,

    Return an iterator adaptor that uses the passed-in closure to -optionally merge together consecutive elements. Read more
    source§

    fn dedup(self) -> Dedup<Self>
    where +optionally merge together consecutive elements. Read more

    source§

    fn dedup(self) -> Dedup<Self>
    where Self: Sized, Self::Item: PartialEq,

    Remove duplicates from sections of consecutive identical elements. -If the iterator is sorted, all elements will be unique. Read more
    source§

    fn dedup_by<Cmp>(self, cmp: Cmp) -> DedupBy<Self, Cmp>
    where +If the iterator is sorted, all elements will be unique. Read more

    source§

    fn dedup_by<Cmp>(self, cmp: Cmp) -> DedupBy<Self, Cmp>
    where Self: Sized, Cmp: FnMut(&Self::Item, &Self::Item) -> bool,

    Remove duplicates from sections of consecutive identical elements, determining equality using a comparison function. -If the iterator is sorted, all elements will be unique. Read more
    source§

    fn dedup_with_count(self) -> DedupWithCount<Self>
    where +If the iterator is sorted, all elements will be unique. Read more

    source§

    fn dedup_with_count(self) -> DedupWithCount<Self>
    where Self: Sized,

    Remove duplicates from sections of consecutive identical elements, while keeping a count of how many repeated elements were present. -If the iterator is sorted, all elements will be unique. Read more
    source§

    fn dedup_by_with_count<Cmp>(self, cmp: Cmp) -> DedupByWithCount<Self, Cmp>
    where +If the iterator is sorted, all elements will be unique. Read more

    source§

    fn dedup_by_with_count<Cmp>(self, cmp: Cmp) -> DedupByWithCount<Self, Cmp>
    where Self: Sized, Cmp: FnMut(&Self::Item, &Self::Item) -> bool,

    Remove duplicates from sections of consecutive identical elements, while keeping a count of how many repeated elements were present. This will determine equality using a comparison function. -If the iterator is sorted, all elements will be unique. Read more
    source§

    fn duplicates(self) -> Duplicates<Self>
    where +If the iterator is sorted, all elements will be unique. Read more

    source§

    fn duplicates(self) -> Duplicates<Self>
    where Self: Sized, Self::Item: Eq + Hash,

    Return an iterator adaptor that produces elements that appear more than once during the -iteration. Duplicates are detected using hash and equality. Read more
    source§

    fn duplicates_by<V, F>(self, f: F) -> DuplicatesBy<Self, V, F>
    where +iteration. Duplicates are detected using hash and equality. Read more

    source§

    fn duplicates_by<V, F>(self, f: F) -> DuplicatesBy<Self, V, F>
    where Self: Sized, V: Eq + Hash, F: FnMut(&Self::Item) -> V,

    Return an iterator adaptor that produces elements that appear more than once during the -iteration. Duplicates are detected using hash and equality. Read more
    source§

    fn unique(self) -> Unique<Self> ⓘ
    where +iteration. Duplicates are detected using hash and equality. Read more

    source§

    fn unique(self) -> Unique<Self> ⓘ
    where Self: Sized, Self::Item: Clone + Eq + Hash,

    Return an iterator adaptor that filters out elements that have already been produced once during the iteration. Duplicates -are detected using hash and equality. Read more
    source§

    fn unique_by<V, F>(self, f: F) -> UniqueBy<Self, V, F> ⓘ
    where +are detected using hash and equality. Read more

    source§

    fn unique_by<V, F>(self, f: F) -> UniqueBy<Self, V, F> ⓘ
    where Self: Sized, V: Eq + Hash, F: FnMut(&Self::Item) -> V,

    Return an iterator adaptor that filters out elements that have -already been produced once during the iteration. Read more
    source§

    fn peeking_take_while<F>(&mut self, accept: F) -> PeekingTakeWhile<'_, Self, F> ⓘ
    where +already been produced once during the iteration. Read more

    source§

    fn peeking_take_while<F>(&mut self, accept: F) -> PeekingTakeWhile<'_, Self, F> ⓘ
    where Self: Sized + PeekingNext, F: FnMut(&Self::Item) -> bool,

    Return an iterator adaptor that borrows from this iterator and -takes items while the closure accept returns true. Read more
    source§

    fn take_while_ref<F>(&mut self, accept: F) -> TakeWhileRef<'_, Self, F> ⓘ
    where +takes items while the closure accept returns true. Read more

    source§

    fn take_while_ref<F>(&mut self, accept: F) -> TakeWhileRef<'_, Self, F> ⓘ
    where Self: Clone, F: FnMut(&Self::Item) -> bool,

    Return an iterator adaptor that borrows from a Clone-able iterator -to only pick off elements while the predicate accept returns true. Read more
    source§

    fn take_while_inclusive<F>(self, accept: F) -> TakeWhileInclusive<Self, F> ⓘ
    where +to only pick off elements while the predicate accept returns true. Read more

    source§

    fn take_while_inclusive<F>(self, accept: F) -> TakeWhileInclusive<Self, F> ⓘ
    where Self: Sized, F: FnMut(&Self::Item) -> bool,

    Returns an iterator adaptor that consumes elements while the given predicate is true, including the element for which the predicate -first returned false. Read more
    source§

    fn while_some<A>(self) -> WhileSome<Self> ⓘ
    where +first returned false. Read more

    source§

    fn while_some<A>(self) -> WhileSome<Self> ⓘ
    where Self: Sized + Iterator<Item = Option<A>>,

    Return an iterator adaptor that filters Option<A> iterator elements -and produces A. Stops on the first None encountered. Read more
    source§

    fn tuple_combinations<T>(self) -> TupleCombinations<Self, T> ⓘ
    where +and produces A. Stops on the first None encountered. Read more

    source§

    fn tuple_combinations<T>(self) -> TupleCombinations<Self, T> ⓘ
    where Self: Sized + Clone, Self::Item: Clone, T: HasCombination<Self>,

    Return an iterator adaptor that iterates over the combinations of the -elements from an iterator. Read more
    source§

    fn combinations(self, k: usize) -> Combinations<Self> ⓘ
    where +elements from an iterator. Read more

    source§

    fn combinations(self, k: usize) -> Combinations<Self> ⓘ
    where Self: Sized, Self::Item: Clone,

    Return an iterator adaptor that iterates over the k-length combinations of -the elements from an iterator. Read more
    source§

    fn combinations_with_replacement( +the elements from an iterator. Read more

    source§

    fn combinations_with_replacement( self, k: usize ) -> CombinationsWithReplacement<Self> ⓘ
    where Self: Sized, Self::Item: Clone,

    Return an iterator that iterates over the k-length combinations of -the elements from an iterator, with replacement. Read more
    source§

    fn permutations(self, k: usize) -> Permutations<Self> ⓘ
    where +the elements from an iterator, with replacement. Read more

    source§

    fn permutations(self, k: usize) -> Permutations<Self> ⓘ
    where Self: Sized, Self::Item: Clone,

    Return an iterator adaptor that iterates over all k-permutations of the -elements from an iterator. Read more
    source§

    fn powerset(self) -> Powerset<Self> ⓘ
    where +elements from an iterator. Read more

    source§

    fn powerset(self) -> Powerset<Self> ⓘ
    where Self: Sized, Self::Item: Clone,

    Return an iterator that iterates through the powerset of the elements from an -iterator. Read more
    source§

    fn pad_using<F>(self, min: usize, f: F) -> PadUsing<Self, F> ⓘ
    where +iterator. Read more

    source§

    fn pad_using<F>(self, min: usize, f: F) -> PadUsing<Self, F> ⓘ
    where Self: Sized, F: FnMut(usize) -> Self::Item,

    Return an iterator adaptor that pads the sequence to a minimum length of -min by filling missing elements using a closure f. Read more
    source§

    fn with_position(self) -> WithPosition<Self> ⓘ
    where +min by filling missing elements using a closure f. Read more

    source§

    fn with_position(self) -> WithPosition<Self> ⓘ
    where Self: Sized,

    Return an iterator adaptor that combines each element with a Position to -ease special-case handling of the first or last elements. Read more
    source§

    fn positions<P>(self, predicate: P) -> Positions<Self, P> ⓘ
    where +ease special-case handling of the first or last elements. Read more

    source§

    fn positions<P>(self, predicate: P) -> Positions<Self, P> ⓘ
    where Self: Sized, P: FnMut(Self::Item) -> bool,

    Return an iterator adaptor that yields the indices of all elements -satisfying a predicate, counted from the start of the iterator. Read more
    source§

    fn update<F>(self, updater: F) -> Update<Self, F> ⓘ
    where +satisfying a predicate, counted from the start of the iterator. Read more

    source§

    fn update<F>(self, updater: F) -> Update<Self, F> ⓘ
    where Self: Sized, F: FnMut(&mut Self::Item),

    Return an iterator adaptor that applies a mutating function -to each element before yielding it. Read more
    source§

    fn next_tuple<T>(&mut self) -> Option<T>
    where +to each element before yielding it. Read more

    source§

    fn next_tuple<T>(&mut self) -> Option<T>
    where Self: Sized + Iterator<Item = T::Item>, T: HomogeneousTuple,

    Advances the iterator and returns the next items grouped in a tuple of -a specific size (up to 12). Read more
    source§

    fn collect_tuple<T>(self) -> Option<T>
    where +a specific size (up to 12). Read more

    source§

    fn collect_tuple<T>(self) -> Option<T>
    where Self: Sized + Iterator<Item = T::Item>, T: HomogeneousTuple,

    Collects all items from the iterator into a tuple of a specific size -(up to 12). Read more
    source§

    fn find_position<P>(&mut self, pred: P) -> Option<(usize, Self::Item)>
    where - P: FnMut(&Self::Item) -> bool,

    Find the position and value of the first element satisfying a predicate. Read more
    source§

    fn find_or_last<P>(self, predicate: P) -> Option<Self::Item>
    where +(up to 12). Read more

    source§

    fn find_position<P>(&mut self, pred: P) -> Option<(usize, Self::Item)>
    where + P: FnMut(&Self::Item) -> bool,

    Find the position and value of the first element satisfying a predicate. Read more
    source§

    fn find_or_last<P>(self, predicate: P) -> Option<Self::Item>
    where Self: Sized, - P: FnMut(&Self::Item) -> bool,

    Find the value of the first element satisfying a predicate or return the last element, if any. Read more
    source§

    fn find_or_first<P>(self, predicate: P) -> Option<Self::Item>
    where + P: FnMut(&Self::Item) -> bool,

    Find the value of the first element satisfying a predicate or return the last element, if any. Read more
    source§

    fn find_or_first<P>(self, predicate: P) -> Option<Self::Item>
    where Self: Sized, - P: FnMut(&Self::Item) -> bool,

    Find the value of the first element satisfying a predicate or return the first element, if any. Read more
    source§

    fn contains<Q>(&mut self, query: &Q) -> bool
    where + P: FnMut(&Self::Item) -> bool,

    Find the value of the first element satisfying a predicate or return the first element, if any. Read more
    source§

    fn contains<Q>(&mut self, query: &Q) -> bool
    where Self: Sized, Self::Item: Borrow<Q>, - Q: PartialEq,

    Returns true if the given item is present in this iterator. Read more
    source§

    fn all_equal(&mut self) -> bool
    where + Q: PartialEq,

    Returns true if the given item is present in this iterator. Read more
    source§

    fn all_equal(&mut self) -> bool
    where Self: Sized, - Self::Item: PartialEq,

    Check whether all elements compare equal. Read more
    source§

    fn all_equal_value( + Self::Item: PartialEq,

    Check whether all elements compare equal. Read more
    source§

    fn all_equal_value( &mut self ) -> Result<Self::Item, Option<(Self::Item, Self::Item)>>
    where Self: Sized, Self::Item: PartialEq,

    If there are elements and they are all equal, return a single copy of that element. If there are no elements, return an Error containing None. If there are elements and they are not all equal, return a tuple containing the first -two non-equal elements found. Read more
    source§

    fn all_unique(&mut self) -> bool
    where +two non-equal elements found. Read more

    source§

    fn all_unique(&mut self) -> bool
    where Self: Sized, - Self::Item: Eq + Hash,

    Check whether all elements are unique (non equal). Read more
    source§

    fn dropping(self, n: usize) -> Self
    where + Self::Item: Eq + Hash,

    Check whether all elements are unique (non equal). Read more
    source§

    fn dropping(self, n: usize) -> Self
    where Self: Sized,

    Consume the first n elements from the iterator eagerly, -and return the same iterator again. Read more
    source§

    fn dropping_back(self, n: usize) -> Self
    where +and return the same iterator again. Read more

    source§

    fn dropping_back(self, n: usize) -> Self
    where Self: Sized + DoubleEndedIterator,

    Consume the last n elements from the iterator eagerly, -and return the same iterator again. Read more
    source§

    fn foreach<F>(self, f: F)
    where - F: FnMut(Self::Item), - Self: Sized,

    👎Deprecated since 0.8.0: Use .for_each() instead
    Run the closure f eagerly on each element of the iterator. Read more
    source§

    fn concat(self) -> Self::Item
    where +and return the same iterator again. Read more

    source§

    fn concat(self) -> Self::Item
    where Self: Sized, - Self::Item: Extend<<<Self as Iterator>::Item as IntoIterator>::Item> + IntoIterator + Default,

    Combine all an iterator’s elements into one element by using Extend. Read more
    source§

    fn collect_vec(self) -> Vec<Self::Item>
    where + Self::Item: Extend<<<Self as Iterator>::Item as IntoIterator>::Item> + IntoIterator + Default,

    Combine all an iterator’s elements into one element by using Extend. Read more
    source§

    fn collect_vec(self) -> Vec<Self::Item>
    where Self: Sized,

    .collect_vec() is simply a type specialization of Iterator::collect, -for convenience.
    source§

    fn try_collect<T, U, E>(self) -> Result<U, E>
    where +for convenience.

    source§

    fn try_collect<T, U, E>(self) -> Result<U, E>
    where Self: Sized + Iterator<Item = Result<T, E>>, Result<U, E>: FromIterator<Result<T, E>>,

    .try_collect() is more convenient way of writing -.collect::<Result<_, _>>() Read more
    source§

    fn set_from<'a, A: 'a, J>(&mut self, from: J) -> usize
    where +.collect::<Result<_, _>>() Read more

    source§

    fn set_from<'a, A: 'a, J>(&mut self, from: J) -> usize
    where Self: Iterator<Item = &'a mut A>, J: IntoIterator<Item = A>,

    Assign to each reference in self from the from iterator, -stopping at the shortest of the two iterators. Read more
    source§

    fn join(&mut self, sep: &str) -> String
    where - Self::Item: Display,

    Combine all iterator elements into one String, separated by sep. Read more
    source§

    fn format(self, sep: &str) -> Format<'_, Self>
    where - Self: Sized,

    Format all iterator elements, separated by sep. Read more
    source§

    fn format_with<F>(self, sep: &str, format: F) -> FormatWith<'_, Self, F>
    where +stopping at the shortest of the two iterators. Read more

    source§

    fn join(&mut self, sep: &str) -> String
    where + Self::Item: Display,

    Combine all iterator elements into one String, separated by sep. Read more
    source§

    fn format(self, sep: &str) -> Format<'_, Self>
    where + Self: Sized,

    Format all iterator elements, separated by sep. Read more
    source§

    fn format_with<F>(self, sep: &str, format: F) -> FormatWith<'_, Self, F>
    where Self: Sized, - F: FnMut(Self::Item, &mut dyn FnMut(&dyn Display) -> Result) -> Result,

    Format all iterator elements, separated by sep. Read more
    source§

    fn fold_results<A, E, B, F>(&mut self, start: B, f: F) -> Result<B, E>
    where + F: FnMut(Self::Item, &mut dyn FnMut(&dyn Display) -> Result) -> Result,

    Format all iterator elements, separated by sep. Read more
    source§

    fn fold_ok<A, E, B, F>(&mut self, start: B, f: F) -> Result<B, E>
    where Self: Iterator<Item = Result<A, E>>, - F: FnMut(B, A) -> B,

    👎Deprecated since 0.10.0: Use .fold_ok() instead
    See .fold_ok().
    source§

    fn fold_ok<A, E, B, F>(&mut self, start: B, f: F) -> Result<B, E>
    where - Self: Iterator<Item = Result<A, E>>, - F: FnMut(B, A) -> B,

    Fold Result values from an iterator. Read more
    source§

    fn fold_options<A, B, F>(&mut self, start: B, f: F) -> Option<B>
    where + F: FnMut(B, A) -> B,

    Fold Result values from an iterator. Read more
    source§

    fn fold_options<A, B, F>(&mut self, start: B, f: F) -> Option<B>
    where Self: Iterator<Item = Option<A>>, - F: FnMut(B, A) -> B,

    Fold Option values from an iterator. Read more
    source§

    fn fold1<F>(self, f: F) -> Option<Self::Item>
    where + F: FnMut(B, A) -> B,

    Fold Option values from an iterator. Read more
    source§

    fn fold1<F>(self, f: F) -> Option<Self::Item>
    where F: FnMut(Self::Item, Self::Item) -> Self::Item, - Self: Sized,

    👎Deprecated since 0.10.2: Use Iterator::reduce instead
    Accumulator of the elements in the iterator. Read more
    source§

    fn tree_fold1<F>(self, f: F) -> Option<Self::Item>
    where + Self: Sized,

    👎Deprecated since 0.10.2: Use Iterator::reduce instead
    Accumulator of the elements in the iterator. Read more
    source§

    fn tree_reduce<F>(self, f: F) -> Option<Self::Item>
    where F: FnMut(Self::Item, Self::Item) -> Self::Item, - Self: Sized,

    Accumulate the elements in the iterator in a tree-like manner. Read more
    source§

    fn fold_while<B, F>(&mut self, init: B, f: F) -> FoldWhile<B>
    where + Self: Sized,

    Accumulate the elements in the iterator in a tree-like manner. Read more
    source§

    fn tree_fold1<F>(self, f: F) -> Option<Self::Item>
    where + F: FnMut(Self::Item, Self::Item) -> Self::Item, + Self: Sized,

    👎Deprecated since 0.13.0: Use .tree_reduce() instead
    See .tree_reduce().
    source§

    fn fold_while<B, F>(&mut self, init: B, f: F) -> FoldWhile<B>
    where Self: Sized, - F: FnMut(B, Self::Item) -> FoldWhile<B>,

    An iterator method that applies a function, producing a single, final value. Read more
    source§

    fn sum1<S>(self) -> Option<S>
    where + F: FnMut(B, Self::Item) -> FoldWhile<B>,

    An iterator method that applies a function, producing a single, final value. Read more
    source§

    fn sum1<S>(self) -> Option<S>
    where Self: Sized, - S: Sum<Self::Item>,

    Iterate over the entire iterator and add all the elements. Read more
    source§

    fn product1<P>(self) -> Option<P>
    where + S: Sum<Self::Item>,

    Iterate over the entire iterator and add all the elements. Read more
    source§

    fn product1<P>(self) -> Option<P>
    where Self: Sized, - P: Product<Self::Item>,

    Iterate over the entire iterator and multiply all the elements. Read more
    source§

    fn sorted_unstable(self) -> IntoIter<Self::Item> ⓘ
    where + P: Product<Self::Item>,

    Iterate over the entire iterator and multiply all the elements. Read more
    source§

    fn sorted_unstable(self) -> IntoIter<Self::Item> ⓘ
    where Self: Sized, - Self::Item: Ord,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_unstable_by<F>(self, cmp: F) -> IntoIter<Self::Item> ⓘ
    where + Self::Item: Ord,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_unstable_by<F>(self, cmp: F) -> IntoIter<Self::Item> ⓘ
    where Self: Sized, - F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_unstable_by_key<K, F>(self, f: F) -> IntoIter<Self::Item> ⓘ
    where + F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_unstable_by_key<K, F>(self, f: F) -> IntoIter<Self::Item> ⓘ
    where Self: Sized, K: Ord, - F: FnMut(&Self::Item) -> K,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted(self) -> IntoIter<Self::Item> ⓘ
    where + F: FnMut(&Self::Item) -> K,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted(self) -> IntoIter<Self::Item> ⓘ
    where Self: Sized, - Self::Item: Ord,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_by<F>(self, cmp: F) -> IntoIter<Self::Item> ⓘ
    where + Self::Item: Ord,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_by<F>(self, cmp: F) -> IntoIter<Self::Item> ⓘ
    where Self: Sized, - F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_by_key<K, F>(self, f: F) -> IntoIter<Self::Item> ⓘ
    where + F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_by_key<K, F>(self, f: F) -> IntoIter<Self::Item> ⓘ
    where Self: Sized, K: Ord, - F: FnMut(&Self::Item) -> K,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_by_cached_key<K, F>(self, f: F) -> IntoIter<Self::Item> ⓘ
    where + F: FnMut(&Self::Item) -> K,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_by_cached_key<K, F>(self, f: F) -> IntoIter<Self::Item> ⓘ
    where Self: Sized, K: Ord, F: FnMut(&Self::Item) -> K,

    Sort all iterator elements into a new iterator in ascending order. The key function is -called exactly once per key. Read more
    source§

    fn k_smallest(self, k: usize) -> IntoIter<Self::Item> ⓘ
    where +called exactly once per key. Read more

    source§

    fn k_smallest(self, k: usize) -> IntoIter<Self::Item> ⓘ
    where Self: Sized, - Self::Item: Ord,

    Sort the k smallest elements into a new iterator, in ascending order. Read more
    source§

    fn partition_map<A, B, F, L, R>(self, predicate: F) -> (A, B)
    where + Self::Item: Ord,

    Sort the k smallest elements into a new iterator, in ascending order. Read more
    source§

    fn k_smallest_by<F>(self, k: usize, cmp: F) -> IntoIter<Self::Item> ⓘ
    where + Self: Sized, + F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Sort the k smallest elements into a new iterator using the provided comparison. Read more
    source§

    fn k_smallest_by_key<F, K>(self, k: usize, key: F) -> IntoIter<Self::Item> ⓘ
    where + Self: Sized, + F: FnMut(&Self::Item) -> K, + K: Ord,

    Return the elements producing the k smallest outputs of the provided function. Read more
    source§

    fn k_largest(self, k: usize) -> IntoIter<Self::Item> ⓘ
    where + Self: Sized, + Self::Item: Ord,

    Sort the k largest elements into a new iterator, in descending order. Read more
    source§

    fn k_largest_by<F>(self, k: usize, cmp: F) -> IntoIter<Self::Item> ⓘ
    where + Self: Sized, + F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Sort the k largest elements into a new iterator using the provided comparison. Read more
    source§

    fn k_largest_by_key<F, K>(self, k: usize, key: F) -> IntoIter<Self::Item> ⓘ
    where + Self: Sized, + F: FnMut(&Self::Item) -> K, + K: Ord,

    Return the elements producing the k largest outputs of the provided function. Read more
    source§

    fn tail(self, n: usize) -> IntoIter<Self::Item> ⓘ
    where + Self: Sized,

    Consumes the iterator and return an iterator of the last n elements. Read more
    source§

    fn partition_map<A, B, F, L, R>(self, predicate: F) -> (A, B)
    where Self: Sized, F: FnMut(Self::Item) -> Either<L, R>, A: Default + Extend<L>, B: Default + Extend<R>,

    Collect all iterator elements into one of two partitions. Unlike Iterator::partition, each partition may -have a distinct type. Read more
    source§

    fn partition_result<A, B, T, E>(self) -> (A, B)
    where +have a distinct type. Read more

    source§

    fn partition_result<A, B, T, E>(self) -> (A, B)
    where Self: Iterator<Item = Result<T, E>> + Sized, A: Default + Extend<T>, B: Default + Extend<E>,

    Partition a sequence of Results into one list of all the Ok elements -and another list of all the Err elements. Read more
    source§

    fn into_group_map<K, V>(self) -> HashMap<K, Vec<V>>
    where +and another list of all the Err elements. Read more

    source§

    fn into_group_map<K, V>(self) -> HashMap<K, Vec<V>>
    where Self: Iterator<Item = (K, V)> + Sized, K: Hash + Eq,

    Return a HashMap of keys mapped to Vecs of values. Keys and values -are taken from (Key, Value) tuple pairs yielded by the input iterator. Read more
    source§

    fn into_group_map_by<K, V, F>(self, f: F) -> HashMap<K, Vec<V>>
    where +are taken from (Key, Value) tuple pairs yielded by the input iterator. Read more

    source§

    fn into_group_map_by<K, V, F>(self, f: F) -> HashMap<K, Vec<V>>
    where Self: Iterator<Item = V> + Sized, K: Hash + Eq, - F: Fn(&V) -> K,

    Return an Iterator on a HashMap. Keys mapped to Vecs of values. The key is specified -in the closure. Read more
    source§

    fn into_grouping_map<K, V>(self) -> GroupingMap<Self>
    where + F: FnMut(&V) -> K,

    Return an Iterator on a HashMap. Keys mapped to Vecs of values. The key is specified +in the closure. Read more
    source§

    fn into_grouping_map<K, V>(self) -> GroupingMap<Self>
    where Self: Iterator<Item = (K, V)> + Sized, K: Hash + Eq,

    Constructs a GroupingMap to be used later with one of the efficient -group-and-fold operations it allows to perform. Read more
    source§

    fn into_grouping_map_by<K, V, F>(self, key_mapper: F) -> GroupingMapBy<Self, F>
    where +group-and-fold operations it allows to perform. Read more

    source§

    fn into_grouping_map_by<K, V, F>(self, key_mapper: F) -> GroupingMapBy<Self, F>
    where Self: Iterator<Item = V> + Sized, K: Hash + Eq, F: FnMut(&V) -> K,

    Constructs a GroupingMap to be used later with one of the efficient -group-and-fold operations it allows to perform. Read more
    source§

    fn min_set(self) -> Vec<Self::Item>
    where +group-and-fold operations it allows to perform. Read more

    source§

    fn min_set(self) -> Vec<Self::Item>
    where Self: Sized, - Self::Item: Ord,

    Return all minimum elements of an iterator. Read more
    source§

    fn min_set_by<F>(self, compare: F) -> Vec<Self::Item>
    where + Self::Item: Ord,

    Return all minimum elements of an iterator. Read more
    source§

    fn min_set_by<F>(self, compare: F) -> Vec<Self::Item>
    where Self: Sized, F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Return all minimum elements of an iterator, as determined by -the specified function. Read more
    source§

    fn min_set_by_key<K, F>(self, key: F) -> Vec<Self::Item>
    where +the specified function. Read more

    source§

    fn min_set_by_key<K, F>(self, key: F) -> Vec<Self::Item>
    where Self: Sized, K: Ord, F: FnMut(&Self::Item) -> K,

    Return all minimum elements of an iterator, as determined by -the specified function. Read more
    source§

    fn max_set(self) -> Vec<Self::Item>
    where +the specified function. Read more

    source§

    fn max_set(self) -> Vec<Self::Item>
    where Self: Sized, - Self::Item: Ord,

    Return all maximum elements of an iterator. Read more
    source§

    fn max_set_by<F>(self, compare: F) -> Vec<Self::Item>
    where + Self::Item: Ord,

    Return all maximum elements of an iterator. Read more
    source§

    fn max_set_by<F>(self, compare: F) -> Vec<Self::Item>
    where Self: Sized, F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Return all maximum elements of an iterator, as determined by -the specified function. Read more
    source§

    fn max_set_by_key<K, F>(self, key: F) -> Vec<Self::Item>
    where +the specified function. Read more

    source§

    fn max_set_by_key<K, F>(self, key: F) -> Vec<Self::Item>
    where Self: Sized, K: Ord, F: FnMut(&Self::Item) -> K,

    Return all maximum elements of an iterator, as determined by -the specified function. Read more
    source§

    fn minmax(self) -> MinMaxResult<Self::Item>
    where +the specified function. Read more

    source§

    fn minmax(self) -> MinMaxResult<Self::Item>
    where Self: Sized, - Self::Item: PartialOrd,

    Return the minimum and maximum elements in the iterator. Read more
    source§

    fn minmax_by_key<K, F>(self, key: F) -> MinMaxResult<Self::Item>
    where + Self::Item: PartialOrd,

    Return the minimum and maximum elements in the iterator. Read more
    source§

    fn minmax_by_key<K, F>(self, key: F) -> MinMaxResult<Self::Item>
    where Self: Sized, K: PartialOrd, F: FnMut(&Self::Item) -> K,

    Return the minimum and maximum element of an iterator, as determined by -the specified function. Read more
    source§

    fn minmax_by<F>(self, compare: F) -> MinMaxResult<Self::Item>
    where +the specified function. Read more

    source§

    fn minmax_by<F>(self, compare: F) -> MinMaxResult<Self::Item>
    where Self: Sized, F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Return the minimum and maximum element of an iterator, as determined by -the specified comparison function. Read more
    source§

    fn position_max(self) -> Option<usize>
    where +the specified comparison function. Read more

    source§

    fn position_max(self) -> Option<usize>
    where Self: Sized, - Self::Item: Ord,

    Return the position of the maximum element in the iterator. Read more
    source§

    fn position_max_by_key<K, F>(self, key: F) -> Option<usize>
    where + Self::Item: Ord,

    Return the position of the maximum element in the iterator. Read more
    source§

    fn position_max_by_key<K, F>(self, key: F) -> Option<usize>
    where Self: Sized, K: Ord, F: FnMut(&Self::Item) -> K,

    Return the position of the maximum element in the iterator, as -determined by the specified function. Read more
    source§

    fn position_max_by<F>(self, compare: F) -> Option<usize>
    where +determined by the specified function. Read more

    source§

    fn position_max_by<F>(self, compare: F) -> Option<usize>
    where Self: Sized, F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Return the position of the maximum element in the iterator, as -determined by the specified comparison function. Read more
    source§

    fn position_min(self) -> Option<usize>
    where +determined by the specified comparison function. Read more

    source§

    fn position_min(self) -> Option<usize>
    where Self: Sized, - Self::Item: Ord,

    Return the position of the minimum element in the iterator. Read more
    source§

    fn position_min_by_key<K, F>(self, key: F) -> Option<usize>
    where + Self::Item: Ord,

    Return the position of the minimum element in the iterator. Read more
    source§

    fn position_min_by_key<K, F>(self, key: F) -> Option<usize>
    where Self: Sized, K: Ord, F: FnMut(&Self::Item) -> K,

    Return the position of the minimum element in the iterator, as -determined by the specified function. Read more
    source§

    fn position_min_by<F>(self, compare: F) -> Option<usize>
    where +determined by the specified function. Read more

    source§

    fn position_min_by<F>(self, compare: F) -> Option<usize>
    where Self: Sized, F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Return the position of the minimum element in the iterator, as -determined by the specified comparison function. Read more
    source§

    fn position_minmax(self) -> MinMaxResult<usize>
    where +determined by the specified comparison function. Read more

    source§

    fn position_minmax(self) -> MinMaxResult<usize>
    where Self: Sized, Self::Item: PartialOrd,

    Return the positions of the minimum and maximum elements in -the iterator. Read more
    source§

    fn position_minmax_by_key<K, F>(self, key: F) -> MinMaxResult<usize>
    where +the iterator. Read more

    source§

    fn position_minmax_by_key<K, F>(self, key: F) -> MinMaxResult<usize>
    where Self: Sized, K: PartialOrd, F: FnMut(&Self::Item) -> K,

    Return the postions of the minimum and maximum elements of an -iterator, as determined by the specified function. Read more
    source§

    fn position_minmax_by<F>(self, compare: F) -> MinMaxResult<usize>
    where +iterator, as determined by the specified function. Read more

    source§

    fn position_minmax_by<F>(self, compare: F) -> MinMaxResult<usize>
    where Self: Sized, F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Return the postions of the minimum and maximum elements of an -iterator, as determined by the specified comparison function. Read more
    source§

    fn exactly_one(self) -> Result<Self::Item, ExactlyOneError<Self>>
    where +iterator, as determined by the specified comparison function. Read more

    source§

    fn exactly_one(self) -> Result<Self::Item, ExactlyOneError<Self>>
    where Self: Sized,

    If the iterator yields exactly one element, that element will be returned, otherwise an error will be returned containing an iterator that has the same output as the input -iterator. Read more
    source§

    fn at_most_one(self) -> Result<Option<Self::Item>, ExactlyOneError<Self>>
    where - Self: Sized,

    If the iterator yields no elements, Ok(None) will be returned. If the iterator yields +iterator. Read more
    source§

    fn at_most_one(self) -> Result<Option<Self::Item>, ExactlyOneError<Self>>
    where + Self: Sized,

    If the iterator yields no elements, Ok(None) will be returned. If the iterator yields exactly one element, that element will be returned, otherwise an error will be returned -containing an iterator that has the same output as the input iterator. Read more
    source§

    fn multipeek(self) -> MultiPeek<Self> ⓘ
    where +containing an iterator that has the same output as the input iterator. Read more

    source§

    fn multipeek(self) -> MultiPeek<Self> ⓘ
    where Self: Sized,

    An iterator adaptor that allows the user to peek at multiple .next() -values without advancing the base iterator. Read more
    source§

    fn counts(self) -> HashMap<Self::Item, usize>
    where +values without advancing the base iterator. Read more

    source§

    fn counts(self) -> HashMap<Self::Item, usize>
    where Self: Sized, Self::Item: Eq + Hash,

    Collect the items in this iterator and return a HashMap which contains each item that appears in the iterator and the number -of times it appears. Read more
    source§

    fn counts_by<K, F>(self, f: F) -> HashMap<K, usize>
    where +of times it appears. Read more

    source§

    fn counts_by<K, F>(self, f: F) -> HashMap<K, usize>
    where Self: Sized, K: Eq + Hash, F: FnMut(Self::Item) -> K,

    Collect the items in this iterator and return a HashMap which contains each item that appears in the iterator and the number of times it appears, -determining identity using a keying function. Read more
    source§

    fn multiunzip<FromI>(self) -> FromI
    where - Self: Sized + MultiUnzip<FromI>,

    Converts an iterator of tuples into a tuple of containers. Read more
    source§

    fn try_len(&self) -> Result<usize, (usize, Option<usize>)>

    Returns the length of the iterator if one exists. +determining identity using a keying function. Read more
    source§

    fn multiunzip<FromI>(self) -> FromI
    where + Self: Sized + MultiUnzip<FromI>,

    Converts an iterator of tuples into a tuple of containers. Read more
    source§

    fn try_len(&self) -> Result<usize, (usize, Option<usize>)>

    Returns the length of the iterator if one exists. Otherwise return self.size_hint(). Read more
    source§

    impl<IT> MultiUnzip<()> for IT
    where IT: Iterator<Item = ()>,

    source§

    fn multiunzip(self)

    Unzip this iterator into multiple collections.
    source§

    impl<IT, A, FromA> MultiUnzip<(FromA,)> for IT
    where IT: Iterator<Item = (A,)>, @@ -675,4 +687,4 @@ Otherwise return self.size_hint(). (FromA, FromB, FromC, FromD, FromE, FromF, FromG, FromH, FromI, FromJ, FromK, FromL)

    Unzip this iterator into multiple collections.
    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 + 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/itertools/structs/struct.TupleCombinations.html b/itertools/structs/struct.TupleCombinations.html index ae08f9c11..9fef5789a 100644 --- a/itertools/structs/struct.TupleCombinations.html +++ b/itertools/structs/struct.TupleCombinations.html @@ -1,19 +1,19 @@ -TupleCombinations in itertools::structs - Rust
    -

    Struct itertools::structs::TupleCombinations

    source · 
    pub struct TupleCombinations<I, T>
    where
+TupleCombinations in itertools::structs - Rust
    
+    
    Struct itertools::structs::TupleCombinations
    source · 
    pub struct TupleCombinations<I, T>
    where
     I: Iterator,
     T: HasCombination<I>,
    { /* private fields */ }
    Expand description
    An iterator to iterate through all combinations in a Clone-able iterator that produces tuples
 of a specific size.
    
 
    See .tuple_combinations() for more
 information.
    
-
    Trait Implementations§
    source§
    impl<I, T> Clone for TupleCombinations<I, T>
    where
+
    Trait Implementations§
    source§
    impl<I, T> Clone for TupleCombinations<I, T>
    where
     I: Iterator + Clone,
     T: HasCombination<I> + Clone,
-    T::Combination: Clone,
    source§
    fn clone(&self) -> TupleCombinations<I, T> ⓘ
    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<I, T> Debug for TupleCombinations<I, T>
    where
+    T::Combination: Clone,
    source§
    fn clone(&self) -> TupleCombinations<I, T> ⓘ
    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<I, T> Debug for TupleCombinations<I, T>
    where
     I: Iterator + Debug,
     T: HasCombination<I> + Debug,
-    T::Combination: Debug,
    source§
    fn fmt(&self, f: &mut Formatter<'_>) -> Result
    Formats the value using the given formatter. Read more
    source§
    impl<I, T> Iterator for TupleCombinations<I, T>
    where
+    T::Combination: Debug,
    source§
    fn fmt(&self, f: &mut Formatter<'_>) -> Result
    Formats the value using the given formatter. Read more
    source§
    impl<I, T> Iterator for TupleCombinations<I, T>
    where
     I: Iterator,
-    T: HasCombination<I>,
    §
    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 fold<B, F>(self, init: B, f: F) -> B
    where
+    T: HasCombination<I>,
    §
    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 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
@@ -188,7 +188,7 @@ greater than or equal to those of another. 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> FusedIterator for TupleCombinations<I, T>
    where
+function. Read more
    source§
    impl<I, T> FusedIterator for TupleCombinations<I, T>
    where
     I: FusedIterator,
     T: HasCombination<I>,

    Auto Trait Implementations§

    §

    impl<I, T> Freeze for TupleCombinations<I, T>
    where <T as HasCombination<I>>::Combination: Freeze,

    §

    impl<I, T> RefUnwindSafe for TupleCombinations<I, T>
    where @@ -217,86 +217,87 @@ otherwise. Right variant of Either<Self, Self> otherwise. Read more

    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> Itertools for T
    where - T: Iterator + ?Sized,

    source§

    fn interleave<J>(self, other: J) -> Interleave<Self, J::IntoIter> ⓘ
    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> Itertools for T
    where + T: Iterator + ?Sized,

    source§

    fn interleave<J>(self, other: J) -> Interleave<Self, J::IntoIter> ⓘ
    where J: IntoIterator<Item = Self::Item>, - Self: Sized,

    Alternate elements from two iterators until both have run out. Read more
    source§

    fn interleave_shortest<J>( + Self: Sized,

    Alternate elements from two iterators until both have run out. Read more
    source§

    fn interleave_shortest<J>( self, other: J ) -> InterleaveShortest<Self, J::IntoIter> ⓘ
    where J: IntoIterator<Item = Self::Item>, Self: Sized,

    Alternate elements from two iterators until at least one of them has run -out. Read more
    source§

    fn intersperse(self, element: Self::Item) -> Intersperse<Self>
    where +out. Read more

    source§

    fn intersperse(self, element: Self::Item) -> Intersperse<Self>
    where Self: Sized, Self::Item: Clone,

    An iterator adaptor to insert a particular value -between each element of the adapted iterator. Read more
    source§

    fn intersperse_with<F>(self, element: F) -> IntersperseWith<Self, F> ⓘ
    where +between each element of the adapted iterator. Read more

    source§

    fn intersperse_with<F>(self, element: F) -> IntersperseWith<Self, F> ⓘ
    where Self: Sized, F: FnMut() -> Self::Item,

    An iterator adaptor to insert a particular value created by a function -between each element of the adapted iterator. Read more
    source§

    fn zip_longest<J>(self, other: J) -> ZipLongest<Self, J::IntoIter> ⓘ
    where +between each element of the adapted iterator. Read more

    source§

    fn get<R>(self, index: R) -> R::Output
    where + Self: Sized, + R: IteratorIndex<Self>,

    Returns an iterator over a subsection of the iterator. Read more
    source§

    fn zip_longest<J>(self, other: J) -> ZipLongest<Self, J::IntoIter> ⓘ
    where J: IntoIterator, Self: Sized,

    Create an iterator which iterates over both this and the specified -iterator simultaneously, yielding pairs of two optional elements. Read more
    source§

    fn zip_eq<J>(self, other: J) -> ZipEq<Self, J::IntoIter> ⓘ
    where +iterator simultaneously, yielding pairs of two optional elements. Read more

    source§

    fn zip_eq<J>(self, other: J) -> ZipEq<Self, J::IntoIter> ⓘ
    where J: IntoIterator, Self: Sized,

    Create an iterator which iterates over both this and the specified -iterator simultaneously, yielding pairs of elements. Read more
    source§

    fn batching<B, F>(self, f: F) -> Batching<Self, F> ⓘ
    where +iterator simultaneously, yielding pairs of elements. Read more

    source§

    fn batching<B, F>(self, f: F) -> Batching<Self, F> ⓘ
    where F: FnMut(&mut Self) -> Option<B>, Self: Sized,

    A “meta iterator adaptor”. Its closure receives a reference to the iterator and may pick off as many elements as it likes, to produce the -next iterator element. Read more
    source§

    fn group_by<K, F>(self, key: F) -> GroupBy<K, Self, F>
    where +next iterator element. Read more

    source§

    fn chunk_by<K, F>(self, key: F) -> ChunkBy<K, Self, F>
    where Self: Sized, F: FnMut(&Self::Item) -> K, K: PartialEq,

    Return an iterable that can group iterator elements. Consecutive elements that map to the same key (“runs”), are assigned -to the same group. Read more
    source§

    fn chunks(self, size: usize) -> IntoChunks<Self>
    where - Self: Sized,

    Return an iterable that can chunk the iterator. Read more
    source§

    fn tuple_windows<T>(self) -> TupleWindows<Self, T> ⓘ
    where +to the same group. Read more

    source§

    fn group_by<K, F>(self, key: F) -> ChunkBy<K, Self, F>
    where + Self: Sized, + F: FnMut(&Self::Item) -> K, + K: PartialEq,

    👎Deprecated since 0.13.0: Use .chunk_by() instead
    See .chunk_by().
    source§

    fn chunks(self, size: usize) -> IntoChunks<Self>
    where + Self: Sized,

    Return an iterable that can chunk the iterator. Read more
    source§

    fn tuple_windows<T>(self) -> TupleWindows<Self, T> ⓘ
    where Self: Sized + Iterator<Item = T::Item>, T: HomogeneousTuple, T::Item: Clone,

    Return an iterator over all contiguous windows producing tuples of -a specific size (up to 12). Read more
    source§

    fn circular_tuple_windows<T>(self) -> CircularTupleWindows<Self, T> ⓘ
    where +a specific size (up to 12). Read more

    source§

    fn circular_tuple_windows<T>(self) -> CircularTupleWindows<Self, T> ⓘ
    where Self: Sized + Clone + Iterator<Item = T::Item> + ExactSizeIterator, T: TupleCollect + Clone, T::Item: Clone,

    Return an iterator over all windows, wrapping back to the first elements when the window would otherwise exceed the length of the -iterator, producing tuples of a specific size (up to 12). Read more
    source§

    fn tuples<T>(self) -> Tuples<Self, T> ⓘ
    where +iterator, producing tuples of a specific size (up to 12). Read more

    source§

    fn tuples<T>(self) -> Tuples<Self, T> ⓘ
    where Self: Sized + Iterator<Item = T::Item>, T: HomogeneousTuple,

    Return an iterator that groups the items in tuples of a specific size -(up to 12). Read more
    source§

    fn tee(self) -> (Tee<Self>, Tee<Self>)
    where +(up to 12). Read more

    source§

    fn tee(self) -> (Tee<Self>, Tee<Self>)
    where Self: Sized, Self::Item: Clone,

    Split into an iterator pair that both yield all elements from -the original iterator. Read more
    source§

    fn step(self, n: usize) -> Step<Self> ⓘ
    where - Self: Sized,

    👎Deprecated since 0.8.0: Use std .step_by() instead
    Return an iterator adaptor that steps n elements in the base iterator -for each iteration. Read more
    source§

    fn map_into<R>(self) -> MapInto<Self, R>
    where +the original iterator. Read more

    source§

    fn map_into<R>(self) -> MapInto<Self, R>
    where Self: Sized, - Self::Item: Into<R>,

    Convert each item of the iterator using the Into trait. Read more
    source§

    fn map_results<F, T, U, E>(self, f: F) -> MapOk<Self, F>
    where - Self: Iterator<Item = Result<T, E>> + Sized, - F: FnMut(T) -> U,

    👎Deprecated since 0.10.0: Use .map_ok() instead
    See .map_ok().
    source§

    fn map_ok<F, T, U, E>(self, f: F) -> MapOk<Self, F>
    where + Self::Item: Into<R>,

    Convert each item of the iterator using the Into trait. Read more
    source§

    fn map_ok<F, T, U, E>(self, f: F) -> MapOk<Self, F>
    where Self: Iterator<Item = Result<T, E>> + Sized, F: FnMut(T) -> U,

    Return an iterator adaptor that applies the provided closure to every Result::Ok value. Result::Err values are -unchanged. Read more
    source§

    fn filter_ok<F, T, E>(self, f: F) -> FilterOk<Self, F> ⓘ
    where +unchanged. Read more

    source§

    fn filter_ok<F, T, E>(self, f: F) -> FilterOk<Self, F> ⓘ
    where Self: Iterator<Item = Result<T, E>> + Sized, F: FnMut(&T) -> bool,

    Return an iterator adaptor that filters every Result::Ok value with the provided closure. Result::Err values are -unchanged. Read more
    source§

    fn filter_map_ok<F, T, U, E>(self, f: F) -> FilterMapOk<Self, F> ⓘ
    where +unchanged. Read more

    source§

    fn filter_map_ok<F, T, U, E>(self, f: F) -> FilterMapOk<Self, F> ⓘ
    where Self: Iterator<Item = Result<T, E>> + Sized, F: FnMut(T) -> Option<U>,

    Return an iterator adaptor that filters and transforms every Result::Ok value with the provided closure. Result::Err -values are unchanged. Read more
    source§

    fn flatten_ok<T, E>(self) -> FlattenOk<Self, T, E> ⓘ
    where +values are unchanged. Read more

    source§

    fn flatten_ok<T, E>(self) -> FlattenOk<Self, T, E> ⓘ
    where Self: Iterator<Item = Result<T, E>> + Sized, T: IntoIterator,

    Return an iterator adaptor that flattens every Result::Ok value into -a series of Result::Ok values. Result::Err values are unchanged. Read more
    source§

    fn process_results<F, T, E, R>(self, processor: F) -> Result<R, E>
    where +a series of Result::Ok values. Result::Err values are unchanged. Read more

    source§

    fn process_results<F, T, E, R>(self, processor: F) -> Result<R, E>
    where Self: Iterator<Item = Result<T, E>> + Sized, F: FnOnce(ProcessResults<'_, Self, E>) -> R,

    “Lift” a function of the values of the current iterator so as to process -an iterator of Result values instead. Read more
    source§

    fn merge<J>(self, other: J) -> Merge<Self, J::IntoIter>
    where +an iterator of Result values instead. Read more

    source§

    fn merge<J>(self, other: J) -> Merge<Self, J::IntoIter>
    where Self: Sized, Self::Item: PartialOrd, J: IntoIterator<Item = Self::Item>,

    Return an iterator adaptor that merges the two base iterators in ascending order. If both base iterators are sorted (ascending), the -result is sorted. Read more
    source§

    fn merge_by<J, F>(self, other: J, is_first: F) -> MergeBy<Self, J::IntoIter, F> ⓘ
    where +result is sorted. Read more

    source§

    fn merge_by<J, F>(self, other: J, is_first: F) -> MergeBy<Self, J::IntoIter, F> ⓘ
    where Self: Sized, J: IntoIterator<Item = Self::Item>, F: FnMut(&Self::Item, &Self::Item) -> bool,

    Return an iterator adaptor that merges the two base iterators in order. -This is much like .merge() but allows for a custom ordering. Read more
    source§

    fn merge_join_by<J, F, T>( +This is much like .merge() but allows for a custom ordering. Read more

    source§

    fn merge_join_by<J, F, T>( self, other: J, cmp_fn: F @@ -304,284 +305,295 @@ This is much like IntoIterator, F: FnMut(&Self::Item, &J::Item) -> T, Self: Sized,

    Create an iterator that merges items from both this and the specified -iterator in ascending order. Read more
    source§

    fn kmerge(self) -> KMerge<<Self::Item as IntoIterator>::IntoIter>
    where +iterator in ascending order. Read more

    source§

    fn kmerge(self) -> KMerge<<Self::Item as IntoIterator>::IntoIter>
    where Self: Sized, Self::Item: IntoIterator, <Self::Item as IntoIterator>::Item: PartialOrd,

    Return an iterator adaptor that flattens an iterator of iterators by -merging them in ascending order. Read more
    source§

    fn kmerge_by<F>( +merging them in ascending order. Read more

    source§

    fn kmerge_by<F>( self, first: F ) -> KMergeBy<<Self::Item as IntoIterator>::IntoIter, F> ⓘ
    where Self: Sized, Self::Item: IntoIterator, F: FnMut(&<Self::Item as IntoIterator>::Item, &<Self::Item as IntoIterator>::Item) -> bool,

    Return an iterator adaptor that flattens an iterator of iterators by -merging them according to the given closure. Read more
    source§

    fn cartesian_product<J>(self, other: J) -> Product<Self, J::IntoIter> ⓘ
    where +merging them according to the given closure. Read more

    source§

    fn cartesian_product<J>(self, other: J) -> Product<Self, J::IntoIter> ⓘ
    where Self: Sized, Self::Item: Clone, J: IntoIterator, J::IntoIter: Clone,

    Return an iterator adaptor that iterates over the cartesian product of -the element sets of two iterators self and J. Read more
    source§

    fn multi_cartesian_product( +the element sets of two iterators self and J. Read more

    source§

    fn multi_cartesian_product( self ) -> MultiProduct<<Self::Item as IntoIterator>::IntoIter> ⓘ
    where Self: Sized, Self::Item: IntoIterator, <Self::Item as IntoIterator>::IntoIter: Clone, <Self::Item as IntoIterator>::Item: Clone,

    Return an iterator adaptor that iterates over the cartesian product of -all subiterators returned by meta-iterator self. Read more
    source§

    fn coalesce<F>(self, f: F) -> Coalesce<Self, F>
    where +all subiterators returned by meta-iterator self. Read more

    source§

    fn coalesce<F>(self, f: F) -> Coalesce<Self, F>
    where Self: Sized, F: FnMut(Self::Item, Self::Item) -> Result<Self::Item, (Self::Item, Self::Item)>,

    Return an iterator adaptor that uses the passed-in closure to -optionally merge together consecutive elements. Read more
    source§

    fn dedup(self) -> Dedup<Self>
    where +optionally merge together consecutive elements. Read more

    source§

    fn dedup(self) -> Dedup<Self>
    where Self: Sized, Self::Item: PartialEq,

    Remove duplicates from sections of consecutive identical elements. -If the iterator is sorted, all elements will be unique. Read more
    source§

    fn dedup_by<Cmp>(self, cmp: Cmp) -> DedupBy<Self, Cmp>
    where +If the iterator is sorted, all elements will be unique. Read more

    source§

    fn dedup_by<Cmp>(self, cmp: Cmp) -> DedupBy<Self, Cmp>
    where Self: Sized, Cmp: FnMut(&Self::Item, &Self::Item) -> bool,

    Remove duplicates from sections of consecutive identical elements, determining equality using a comparison function. -If the iterator is sorted, all elements will be unique. Read more
    source§

    fn dedup_with_count(self) -> DedupWithCount<Self>
    where +If the iterator is sorted, all elements will be unique. Read more

    source§

    fn dedup_with_count(self) -> DedupWithCount<Self>
    where Self: Sized,

    Remove duplicates from sections of consecutive identical elements, while keeping a count of how many repeated elements were present. -If the iterator is sorted, all elements will be unique. Read more
    source§

    fn dedup_by_with_count<Cmp>(self, cmp: Cmp) -> DedupByWithCount<Self, Cmp>
    where +If the iterator is sorted, all elements will be unique. Read more

    source§

    fn dedup_by_with_count<Cmp>(self, cmp: Cmp) -> DedupByWithCount<Self, Cmp>
    where Self: Sized, Cmp: FnMut(&Self::Item, &Self::Item) -> bool,

    Remove duplicates from sections of consecutive identical elements, while keeping a count of how many repeated elements were present. This will determine equality using a comparison function. -If the iterator is sorted, all elements will be unique. Read more
    source§

    fn duplicates(self) -> Duplicates<Self>
    where +If the iterator is sorted, all elements will be unique. Read more

    source§

    fn duplicates(self) -> Duplicates<Self>
    where Self: Sized, Self::Item: Eq + Hash,

    Return an iterator adaptor that produces elements that appear more than once during the -iteration. Duplicates are detected using hash and equality. Read more
    source§

    fn duplicates_by<V, F>(self, f: F) -> DuplicatesBy<Self, V, F>
    where +iteration. Duplicates are detected using hash and equality. Read more

    source§

    fn duplicates_by<V, F>(self, f: F) -> DuplicatesBy<Self, V, F>
    where Self: Sized, V: Eq + Hash, F: FnMut(&Self::Item) -> V,

    Return an iterator adaptor that produces elements that appear more than once during the -iteration. Duplicates are detected using hash and equality. Read more
    source§

    fn unique(self) -> Unique<Self> ⓘ
    where +iteration. Duplicates are detected using hash and equality. Read more

    source§

    fn unique(self) -> Unique<Self> ⓘ
    where Self: Sized, Self::Item: Clone + Eq + Hash,

    Return an iterator adaptor that filters out elements that have already been produced once during the iteration. Duplicates -are detected using hash and equality. Read more
    source§

    fn unique_by<V, F>(self, f: F) -> UniqueBy<Self, V, F> ⓘ
    where +are detected using hash and equality. Read more

    source§

    fn unique_by<V, F>(self, f: F) -> UniqueBy<Self, V, F> ⓘ
    where Self: Sized, V: Eq + Hash, F: FnMut(&Self::Item) -> V,

    Return an iterator adaptor that filters out elements that have -already been produced once during the iteration. Read more
    source§

    fn peeking_take_while<F>(&mut self, accept: F) -> PeekingTakeWhile<'_, Self, F> ⓘ
    where +already been produced once during the iteration. Read more

    source§

    fn peeking_take_while<F>(&mut self, accept: F) -> PeekingTakeWhile<'_, Self, F> ⓘ
    where Self: Sized + PeekingNext, F: FnMut(&Self::Item) -> bool,

    Return an iterator adaptor that borrows from this iterator and -takes items while the closure accept returns true. Read more
    source§

    fn take_while_ref<F>(&mut self, accept: F) -> TakeWhileRef<'_, Self, F> ⓘ
    where +takes items while the closure accept returns true. Read more

    source§

    fn take_while_ref<F>(&mut self, accept: F) -> TakeWhileRef<'_, Self, F> ⓘ
    where Self: Clone, F: FnMut(&Self::Item) -> bool,

    Return an iterator adaptor that borrows from a Clone-able iterator -to only pick off elements while the predicate accept returns true. Read more
    source§

    fn take_while_inclusive<F>(self, accept: F) -> TakeWhileInclusive<Self, F> ⓘ
    where +to only pick off elements while the predicate accept returns true. Read more

    source§

    fn take_while_inclusive<F>(self, accept: F) -> TakeWhileInclusive<Self, F> ⓘ
    where Self: Sized, F: FnMut(&Self::Item) -> bool,

    Returns an iterator adaptor that consumes elements while the given predicate is true, including the element for which the predicate -first returned false. Read more
    source§

    fn while_some<A>(self) -> WhileSome<Self> ⓘ
    where +first returned false. Read more

    source§

    fn while_some<A>(self) -> WhileSome<Self> ⓘ
    where Self: Sized + Iterator<Item = Option<A>>,

    Return an iterator adaptor that filters Option<A> iterator elements -and produces A. Stops on the first None encountered. Read more
    source§

    fn tuple_combinations<T>(self) -> TupleCombinations<Self, T> ⓘ
    where +and produces A. Stops on the first None encountered. Read more

    source§

    fn tuple_combinations<T>(self) -> TupleCombinations<Self, T> ⓘ
    where Self: Sized + Clone, Self::Item: Clone, T: HasCombination<Self>,

    Return an iterator adaptor that iterates over the combinations of the -elements from an iterator. Read more
    source§

    fn combinations(self, k: usize) -> Combinations<Self> ⓘ
    where +elements from an iterator. Read more

    source§

    fn combinations(self, k: usize) -> Combinations<Self> ⓘ
    where Self: Sized, Self::Item: Clone,

    Return an iterator adaptor that iterates over the k-length combinations of -the elements from an iterator. Read more
    source§

    fn combinations_with_replacement( +the elements from an iterator. Read more

    source§

    fn combinations_with_replacement( self, k: usize ) -> CombinationsWithReplacement<Self> ⓘ
    where Self: Sized, Self::Item: Clone,

    Return an iterator that iterates over the k-length combinations of -the elements from an iterator, with replacement. Read more
    source§

    fn permutations(self, k: usize) -> Permutations<Self> ⓘ
    where +the elements from an iterator, with replacement. Read more

    source§

    fn permutations(self, k: usize) -> Permutations<Self> ⓘ
    where Self: Sized, Self::Item: Clone,

    Return an iterator adaptor that iterates over all k-permutations of the -elements from an iterator. Read more
    source§

    fn powerset(self) -> Powerset<Self> ⓘ
    where +elements from an iterator. Read more

    source§

    fn powerset(self) -> Powerset<Self> ⓘ
    where Self: Sized, Self::Item: Clone,

    Return an iterator that iterates through the powerset of the elements from an -iterator. Read more
    source§

    fn pad_using<F>(self, min: usize, f: F) -> PadUsing<Self, F> ⓘ
    where +iterator. Read more

    source§

    fn pad_using<F>(self, min: usize, f: F) -> PadUsing<Self, F> ⓘ
    where Self: Sized, F: FnMut(usize) -> Self::Item,

    Return an iterator adaptor that pads the sequence to a minimum length of -min by filling missing elements using a closure f. Read more
    source§

    fn with_position(self) -> WithPosition<Self> ⓘ
    where +min by filling missing elements using a closure f. Read more

    source§

    fn with_position(self) -> WithPosition<Self> ⓘ
    where Self: Sized,

    Return an iterator adaptor that combines each element with a Position to -ease special-case handling of the first or last elements. Read more
    source§

    fn positions<P>(self, predicate: P) -> Positions<Self, P> ⓘ
    where +ease special-case handling of the first or last elements. Read more

    source§

    fn positions<P>(self, predicate: P) -> Positions<Self, P> ⓘ
    where Self: Sized, P: FnMut(Self::Item) -> bool,

    Return an iterator adaptor that yields the indices of all elements -satisfying a predicate, counted from the start of the iterator. Read more
    source§

    fn update<F>(self, updater: F) -> Update<Self, F> ⓘ
    where +satisfying a predicate, counted from the start of the iterator. Read more

    source§

    fn update<F>(self, updater: F) -> Update<Self, F> ⓘ
    where Self: Sized, F: FnMut(&mut Self::Item),

    Return an iterator adaptor that applies a mutating function -to each element before yielding it. Read more
    source§

    fn next_tuple<T>(&mut self) -> Option<T>
    where +to each element before yielding it. Read more

    source§

    fn next_tuple<T>(&mut self) -> Option<T>
    where Self: Sized + Iterator<Item = T::Item>, T: HomogeneousTuple,

    Advances the iterator and returns the next items grouped in a tuple of -a specific size (up to 12). Read more
    source§

    fn collect_tuple<T>(self) -> Option<T>
    where +a specific size (up to 12). Read more

    source§

    fn collect_tuple<T>(self) -> Option<T>
    where Self: Sized + Iterator<Item = T::Item>, T: HomogeneousTuple,

    Collects all items from the iterator into a tuple of a specific size -(up to 12). Read more
    source§

    fn find_position<P>(&mut self, pred: P) -> Option<(usize, Self::Item)>
    where - P: FnMut(&Self::Item) -> bool,

    Find the position and value of the first element satisfying a predicate. Read more
    source§

    fn find_or_last<P>(self, predicate: P) -> Option<Self::Item>
    where +(up to 12). Read more

    source§

    fn find_position<P>(&mut self, pred: P) -> Option<(usize, Self::Item)>
    where + P: FnMut(&Self::Item) -> bool,

    Find the position and value of the first element satisfying a predicate. Read more
    source§

    fn find_or_last<P>(self, predicate: P) -> Option<Self::Item>
    where Self: Sized, - P: FnMut(&Self::Item) -> bool,

    Find the value of the first element satisfying a predicate or return the last element, if any. Read more
    source§

    fn find_or_first<P>(self, predicate: P) -> Option<Self::Item>
    where + P: FnMut(&Self::Item) -> bool,

    Find the value of the first element satisfying a predicate or return the last element, if any. Read more
    source§

    fn find_or_first<P>(self, predicate: P) -> Option<Self::Item>
    where Self: Sized, - P: FnMut(&Self::Item) -> bool,

    Find the value of the first element satisfying a predicate or return the first element, if any. Read more
    source§

    fn contains<Q>(&mut self, query: &Q) -> bool
    where + P: FnMut(&Self::Item) -> bool,

    Find the value of the first element satisfying a predicate or return the first element, if any. Read more
    source§

    fn contains<Q>(&mut self, query: &Q) -> bool
    where Self: Sized, Self::Item: Borrow<Q>, - Q: PartialEq,

    Returns true if the given item is present in this iterator. Read more
    source§

    fn all_equal(&mut self) -> bool
    where + Q: PartialEq,

    Returns true if the given item is present in this iterator. Read more
    source§

    fn all_equal(&mut self) -> bool
    where Self: Sized, - Self::Item: PartialEq,

    Check whether all elements compare equal. Read more
    source§

    fn all_equal_value( + Self::Item: PartialEq,

    Check whether all elements compare equal. Read more
    source§

    fn all_equal_value( &mut self ) -> Result<Self::Item, Option<(Self::Item, Self::Item)>>
    where Self: Sized, Self::Item: PartialEq,

    If there are elements and they are all equal, return a single copy of that element. If there are no elements, return an Error containing None. If there are elements and they are not all equal, return a tuple containing the first -two non-equal elements found. Read more
    source§

    fn all_unique(&mut self) -> bool
    where +two non-equal elements found. Read more

    source§

    fn all_unique(&mut self) -> bool
    where Self: Sized, - Self::Item: Eq + Hash,

    Check whether all elements are unique (non equal). Read more
    source§

    fn dropping(self, n: usize) -> Self
    where + Self::Item: Eq + Hash,

    Check whether all elements are unique (non equal). Read more
    source§

    fn dropping(self, n: usize) -> Self
    where Self: Sized,

    Consume the first n elements from the iterator eagerly, -and return the same iterator again. Read more
    source§

    fn dropping_back(self, n: usize) -> Self
    where +and return the same iterator again. Read more

    source§

    fn dropping_back(self, n: usize) -> Self
    where Self: Sized + DoubleEndedIterator,

    Consume the last n elements from the iterator eagerly, -and return the same iterator again. Read more
    source§

    fn foreach<F>(self, f: F)
    where - F: FnMut(Self::Item), - Self: Sized,

    👎Deprecated since 0.8.0: Use .for_each() instead
    Run the closure f eagerly on each element of the iterator. Read more
    source§

    fn concat(self) -> Self::Item
    where +and return the same iterator again. Read more

    source§

    fn concat(self) -> Self::Item
    where Self: Sized, - Self::Item: Extend<<<Self as Iterator>::Item as IntoIterator>::Item> + IntoIterator + Default,

    Combine all an iterator’s elements into one element by using Extend. Read more
    source§

    fn collect_vec(self) -> Vec<Self::Item>
    where + Self::Item: Extend<<<Self as Iterator>::Item as IntoIterator>::Item> + IntoIterator + Default,

    Combine all an iterator’s elements into one element by using Extend. Read more
    source§

    fn collect_vec(self) -> Vec<Self::Item>
    where Self: Sized,

    .collect_vec() is simply a type specialization of Iterator::collect, -for convenience.
    source§

    fn try_collect<T, U, E>(self) -> Result<U, E>
    where +for convenience.

    source§

    fn try_collect<T, U, E>(self) -> Result<U, E>
    where Self: Sized + Iterator<Item = Result<T, E>>, Result<U, E>: FromIterator<Result<T, E>>,

    .try_collect() is more convenient way of writing -.collect::<Result<_, _>>() Read more
    source§

    fn set_from<'a, A: 'a, J>(&mut self, from: J) -> usize
    where +.collect::<Result<_, _>>() Read more

    source§

    fn set_from<'a, A: 'a, J>(&mut self, from: J) -> usize
    where Self: Iterator<Item = &'a mut A>, J: IntoIterator<Item = A>,

    Assign to each reference in self from the from iterator, -stopping at the shortest of the two iterators. Read more
    source§

    fn join(&mut self, sep: &str) -> String
    where - Self::Item: Display,

    Combine all iterator elements into one String, separated by sep. Read more
    source§

    fn format(self, sep: &str) -> Format<'_, Self>
    where - Self: Sized,

    Format all iterator elements, separated by sep. Read more
    source§

    fn format_with<F>(self, sep: &str, format: F) -> FormatWith<'_, Self, F>
    where +stopping at the shortest of the two iterators. Read more

    source§

    fn join(&mut self, sep: &str) -> String
    where + Self::Item: Display,

    Combine all iterator elements into one String, separated by sep. Read more
    source§

    fn format(self, sep: &str) -> Format<'_, Self>
    where + Self: Sized,

    Format all iterator elements, separated by sep. Read more
    source§

    fn format_with<F>(self, sep: &str, format: F) -> FormatWith<'_, Self, F>
    where Self: Sized, - F: FnMut(Self::Item, &mut dyn FnMut(&dyn Display) -> Result) -> Result,

    Format all iterator elements, separated by sep. Read more
    source§

    fn fold_results<A, E, B, F>(&mut self, start: B, f: F) -> Result<B, E>
    where + F: FnMut(Self::Item, &mut dyn FnMut(&dyn Display) -> Result) -> Result,

    Format all iterator elements, separated by sep. Read more
    source§

    fn fold_ok<A, E, B, F>(&mut self, start: B, f: F) -> Result<B, E>
    where Self: Iterator<Item = Result<A, E>>, - F: FnMut(B, A) -> B,

    👎Deprecated since 0.10.0: Use .fold_ok() instead
    See .fold_ok().
    source§

    fn fold_ok<A, E, B, F>(&mut self, start: B, f: F) -> Result<B, E>
    where - Self: Iterator<Item = Result<A, E>>, - F: FnMut(B, A) -> B,

    Fold Result values from an iterator. Read more
    source§

    fn fold_options<A, B, F>(&mut self, start: B, f: F) -> Option<B>
    where + F: FnMut(B, A) -> B,

    Fold Result values from an iterator. Read more
    source§

    fn fold_options<A, B, F>(&mut self, start: B, f: F) -> Option<B>
    where Self: Iterator<Item = Option<A>>, - F: FnMut(B, A) -> B,

    Fold Option values from an iterator. Read more
    source§

    fn fold1<F>(self, f: F) -> Option<Self::Item>
    where + F: FnMut(B, A) -> B,

    Fold Option values from an iterator. Read more
    source§

    fn fold1<F>(self, f: F) -> Option<Self::Item>
    where F: FnMut(Self::Item, Self::Item) -> Self::Item, - Self: Sized,

    👎Deprecated since 0.10.2: Use Iterator::reduce instead
    Accumulator of the elements in the iterator. Read more
    source§

    fn tree_fold1<F>(self, f: F) -> Option<Self::Item>
    where + Self: Sized,

    👎Deprecated since 0.10.2: Use Iterator::reduce instead
    Accumulator of the elements in the iterator. Read more
    source§

    fn tree_reduce<F>(self, f: F) -> Option<Self::Item>
    where F: FnMut(Self::Item, Self::Item) -> Self::Item, - Self: Sized,

    Accumulate the elements in the iterator in a tree-like manner. Read more
    source§

    fn fold_while<B, F>(&mut self, init: B, f: F) -> FoldWhile<B>
    where + Self: Sized,

    Accumulate the elements in the iterator in a tree-like manner. Read more
    source§

    fn tree_fold1<F>(self, f: F) -> Option<Self::Item>
    where + F: FnMut(Self::Item, Self::Item) -> Self::Item, + Self: Sized,

    👎Deprecated since 0.13.0: Use .tree_reduce() instead
    See .tree_reduce().
    source§

    fn fold_while<B, F>(&mut self, init: B, f: F) -> FoldWhile<B>
    where Self: Sized, - F: FnMut(B, Self::Item) -> FoldWhile<B>,

    An iterator method that applies a function, producing a single, final value. Read more
    source§

    fn sum1<S>(self) -> Option<S>
    where + F: FnMut(B, Self::Item) -> FoldWhile<B>,

    An iterator method that applies a function, producing a single, final value. Read more
    source§

    fn sum1<S>(self) -> Option<S>
    where Self: Sized, - S: Sum<Self::Item>,

    Iterate over the entire iterator and add all the elements. Read more
    source§

    fn product1<P>(self) -> Option<P>
    where + S: Sum<Self::Item>,

    Iterate over the entire iterator and add all the elements. Read more
    source§

    fn product1<P>(self) -> Option<P>
    where Self: Sized, - P: Product<Self::Item>,

    Iterate over the entire iterator and multiply all the elements. Read more
    source§

    fn sorted_unstable(self) -> IntoIter<Self::Item> ⓘ
    where + P: Product<Self::Item>,

    Iterate over the entire iterator and multiply all the elements. Read more
    source§

    fn sorted_unstable(self) -> IntoIter<Self::Item> ⓘ
    where Self: Sized, - Self::Item: Ord,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_unstable_by<F>(self, cmp: F) -> IntoIter<Self::Item> ⓘ
    where + Self::Item: Ord,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_unstable_by<F>(self, cmp: F) -> IntoIter<Self::Item> ⓘ
    where Self: Sized, - F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_unstable_by_key<K, F>(self, f: F) -> IntoIter<Self::Item> ⓘ
    where + F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_unstable_by_key<K, F>(self, f: F) -> IntoIter<Self::Item> ⓘ
    where Self: Sized, K: Ord, - F: FnMut(&Self::Item) -> K,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted(self) -> IntoIter<Self::Item> ⓘ
    where + F: FnMut(&Self::Item) -> K,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted(self) -> IntoIter<Self::Item> ⓘ
    where Self: Sized, - Self::Item: Ord,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_by<F>(self, cmp: F) -> IntoIter<Self::Item> ⓘ
    where + Self::Item: Ord,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_by<F>(self, cmp: F) -> IntoIter<Self::Item> ⓘ
    where Self: Sized, - F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_by_key<K, F>(self, f: F) -> IntoIter<Self::Item> ⓘ
    where + F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_by_key<K, F>(self, f: F) -> IntoIter<Self::Item> ⓘ
    where Self: Sized, K: Ord, - F: FnMut(&Self::Item) -> K,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_by_cached_key<K, F>(self, f: F) -> IntoIter<Self::Item> ⓘ
    where + F: FnMut(&Self::Item) -> K,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_by_cached_key<K, F>(self, f: F) -> IntoIter<Self::Item> ⓘ
    where Self: Sized, K: Ord, F: FnMut(&Self::Item) -> K,

    Sort all iterator elements into a new iterator in ascending order. The key function is -called exactly once per key. Read more
    source§

    fn k_smallest(self, k: usize) -> IntoIter<Self::Item> ⓘ
    where +called exactly once per key. Read more

    source§

    fn k_smallest(self, k: usize) -> IntoIter<Self::Item> ⓘ
    where Self: Sized, - Self::Item: Ord,

    Sort the k smallest elements into a new iterator, in ascending order. Read more
    source§

    fn partition_map<A, B, F, L, R>(self, predicate: F) -> (A, B)
    where + Self::Item: Ord,

    Sort the k smallest elements into a new iterator, in ascending order. Read more
    source§

    fn k_smallest_by<F>(self, k: usize, cmp: F) -> IntoIter<Self::Item> ⓘ
    where + Self: Sized, + F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Sort the k smallest elements into a new iterator using the provided comparison. Read more
    source§

    fn k_smallest_by_key<F, K>(self, k: usize, key: F) -> IntoIter<Self::Item> ⓘ
    where + Self: Sized, + F: FnMut(&Self::Item) -> K, + K: Ord,

    Return the elements producing the k smallest outputs of the provided function. Read more
    source§

    fn k_largest(self, k: usize) -> IntoIter<Self::Item> ⓘ
    where + Self: Sized, + Self::Item: Ord,

    Sort the k largest elements into a new iterator, in descending order. Read more
    source§

    fn k_largest_by<F>(self, k: usize, cmp: F) -> IntoIter<Self::Item> ⓘ
    where + Self: Sized, + F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Sort the k largest elements into a new iterator using the provided comparison. Read more
    source§

    fn k_largest_by_key<F, K>(self, k: usize, key: F) -> IntoIter<Self::Item> ⓘ
    where + Self: Sized, + F: FnMut(&Self::Item) -> K, + K: Ord,

    Return the elements producing the k largest outputs of the provided function. Read more
    source§

    fn tail(self, n: usize) -> IntoIter<Self::Item> ⓘ
    where + Self: Sized,

    Consumes the iterator and return an iterator of the last n elements. Read more
    source§

    fn partition_map<A, B, F, L, R>(self, predicate: F) -> (A, B)
    where Self: Sized, F: FnMut(Self::Item) -> Either<L, R>, A: Default + Extend<L>, B: Default + Extend<R>,

    Collect all iterator elements into one of two partitions. Unlike Iterator::partition, each partition may -have a distinct type. Read more
    source§

    fn partition_result<A, B, T, E>(self) -> (A, B)
    where +have a distinct type. Read more

    source§

    fn partition_result<A, B, T, E>(self) -> (A, B)
    where Self: Iterator<Item = Result<T, E>> + Sized, A: Default + Extend<T>, B: Default + Extend<E>,

    Partition a sequence of Results into one list of all the Ok elements -and another list of all the Err elements. Read more
    source§

    fn into_group_map<K, V>(self) -> HashMap<K, Vec<V>>
    where +and another list of all the Err elements. Read more

    source§

    fn into_group_map<K, V>(self) -> HashMap<K, Vec<V>>
    where Self: Iterator<Item = (K, V)> + Sized, K: Hash + Eq,

    Return a HashMap of keys mapped to Vecs of values. Keys and values -are taken from (Key, Value) tuple pairs yielded by the input iterator. Read more
    source§

    fn into_group_map_by<K, V, F>(self, f: F) -> HashMap<K, Vec<V>>
    where +are taken from (Key, Value) tuple pairs yielded by the input iterator. Read more

    source§

    fn into_group_map_by<K, V, F>(self, f: F) -> HashMap<K, Vec<V>>
    where Self: Iterator<Item = V> + Sized, K: Hash + Eq, - F: Fn(&V) -> K,

    Return an Iterator on a HashMap. Keys mapped to Vecs of values. The key is specified -in the closure. Read more
    source§

    fn into_grouping_map<K, V>(self) -> GroupingMap<Self>
    where + F: FnMut(&V) -> K,

    Return an Iterator on a HashMap. Keys mapped to Vecs of values. The key is specified +in the closure. Read more
    source§

    fn into_grouping_map<K, V>(self) -> GroupingMap<Self>
    where Self: Iterator<Item = (K, V)> + Sized, K: Hash + Eq,

    Constructs a GroupingMap to be used later with one of the efficient -group-and-fold operations it allows to perform. Read more
    source§

    fn into_grouping_map_by<K, V, F>(self, key_mapper: F) -> GroupingMapBy<Self, F>
    where +group-and-fold operations it allows to perform. Read more

    source§

    fn into_grouping_map_by<K, V, F>(self, key_mapper: F) -> GroupingMapBy<Self, F>
    where Self: Iterator<Item = V> + Sized, K: Hash + Eq, F: FnMut(&V) -> K,

    Constructs a GroupingMap to be used later with one of the efficient -group-and-fold operations it allows to perform. Read more
    source§

    fn min_set(self) -> Vec<Self::Item>
    where +group-and-fold operations it allows to perform. Read more

    source§

    fn min_set(self) -> Vec<Self::Item>
    where Self: Sized, - Self::Item: Ord,

    Return all minimum elements of an iterator. Read more
    source§

    fn min_set_by<F>(self, compare: F) -> Vec<Self::Item>
    where + Self::Item: Ord,

    Return all minimum elements of an iterator. Read more
    source§

    fn min_set_by<F>(self, compare: F) -> Vec<Self::Item>
    where Self: Sized, F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Return all minimum elements of an iterator, as determined by -the specified function. Read more
    source§

    fn min_set_by_key<K, F>(self, key: F) -> Vec<Self::Item>
    where +the specified function. Read more

    source§

    fn min_set_by_key<K, F>(self, key: F) -> Vec<Self::Item>
    where Self: Sized, K: Ord, F: FnMut(&Self::Item) -> K,

    Return all minimum elements of an iterator, as determined by -the specified function. Read more
    source§

    fn max_set(self) -> Vec<Self::Item>
    where +the specified function. Read more

    source§

    fn max_set(self) -> Vec<Self::Item>
    where Self: Sized, - Self::Item: Ord,

    Return all maximum elements of an iterator. Read more
    source§

    fn max_set_by<F>(self, compare: F) -> Vec<Self::Item>
    where + Self::Item: Ord,

    Return all maximum elements of an iterator. Read more
    source§

    fn max_set_by<F>(self, compare: F) -> Vec<Self::Item>
    where Self: Sized, F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Return all maximum elements of an iterator, as determined by -the specified function. Read more
    source§

    fn max_set_by_key<K, F>(self, key: F) -> Vec<Self::Item>
    where +the specified function. Read more

    source§

    fn max_set_by_key<K, F>(self, key: F) -> Vec<Self::Item>
    where Self: Sized, K: Ord, F: FnMut(&Self::Item) -> K,

    Return all maximum elements of an iterator, as determined by -the specified function. Read more
    source§

    fn minmax(self) -> MinMaxResult<Self::Item>
    where +the specified function. Read more

    source§

    fn minmax(self) -> MinMaxResult<Self::Item>
    where Self: Sized, - Self::Item: PartialOrd,

    Return the minimum and maximum elements in the iterator. Read more
    source§

    fn minmax_by_key<K, F>(self, key: F) -> MinMaxResult<Self::Item>
    where + Self::Item: PartialOrd,

    Return the minimum and maximum elements in the iterator. Read more
    source§

    fn minmax_by_key<K, F>(self, key: F) -> MinMaxResult<Self::Item>
    where Self: Sized, K: PartialOrd, F: FnMut(&Self::Item) -> K,

    Return the minimum and maximum element of an iterator, as determined by -the specified function. Read more
    source§

    fn minmax_by<F>(self, compare: F) -> MinMaxResult<Self::Item>
    where +the specified function. Read more

    source§

    fn minmax_by<F>(self, compare: F) -> MinMaxResult<Self::Item>
    where Self: Sized, F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Return the minimum and maximum element of an iterator, as determined by -the specified comparison function. Read more
    source§

    fn position_max(self) -> Option<usize>
    where +the specified comparison function. Read more

    source§

    fn position_max(self) -> Option<usize>
    where Self: Sized, - Self::Item: Ord,

    Return the position of the maximum element in the iterator. Read more
    source§

    fn position_max_by_key<K, F>(self, key: F) -> Option<usize>
    where + Self::Item: Ord,

    Return the position of the maximum element in the iterator. Read more
    source§

    fn position_max_by_key<K, F>(self, key: F) -> Option<usize>
    where Self: Sized, K: Ord, F: FnMut(&Self::Item) -> K,

    Return the position of the maximum element in the iterator, as -determined by the specified function. Read more
    source§

    fn position_max_by<F>(self, compare: F) -> Option<usize>
    where +determined by the specified function. Read more

    source§

    fn position_max_by<F>(self, compare: F) -> Option<usize>
    where Self: Sized, F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Return the position of the maximum element in the iterator, as -determined by the specified comparison function. Read more
    source§

    fn position_min(self) -> Option<usize>
    where +determined by the specified comparison function. Read more

    source§

    fn position_min(self) -> Option<usize>
    where Self: Sized, - Self::Item: Ord,

    Return the position of the minimum element in the iterator. Read more
    source§

    fn position_min_by_key<K, F>(self, key: F) -> Option<usize>
    where + Self::Item: Ord,

    Return the position of the minimum element in the iterator. Read more
    source§

    fn position_min_by_key<K, F>(self, key: F) -> Option<usize>
    where Self: Sized, K: Ord, F: FnMut(&Self::Item) -> K,

    Return the position of the minimum element in the iterator, as -determined by the specified function. Read more
    source§

    fn position_min_by<F>(self, compare: F) -> Option<usize>
    where +determined by the specified function. Read more

    source§

    fn position_min_by<F>(self, compare: F) -> Option<usize>
    where Self: Sized, F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Return the position of the minimum element in the iterator, as -determined by the specified comparison function. Read more
    source§

    fn position_minmax(self) -> MinMaxResult<usize>
    where +determined by the specified comparison function. Read more

    source§

    fn position_minmax(self) -> MinMaxResult<usize>
    where Self: Sized, Self::Item: PartialOrd,

    Return the positions of the minimum and maximum elements in -the iterator. Read more
    source§

    fn position_minmax_by_key<K, F>(self, key: F) -> MinMaxResult<usize>
    where +the iterator. Read more

    source§

    fn position_minmax_by_key<K, F>(self, key: F) -> MinMaxResult<usize>
    where Self: Sized, K: PartialOrd, F: FnMut(&Self::Item) -> K,

    Return the postions of the minimum and maximum elements of an -iterator, as determined by the specified function. Read more
    source§

    fn position_minmax_by<F>(self, compare: F) -> MinMaxResult<usize>
    where +iterator, as determined by the specified function. Read more

    source§

    fn position_minmax_by<F>(self, compare: F) -> MinMaxResult<usize>
    where Self: Sized, F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Return the postions of the minimum and maximum elements of an -iterator, as determined by the specified comparison function. Read more
    source§

    fn exactly_one(self) -> Result<Self::Item, ExactlyOneError<Self>>
    where +iterator, as determined by the specified comparison function. Read more

    source§

    fn exactly_one(self) -> Result<Self::Item, ExactlyOneError<Self>>
    where Self: Sized,

    If the iterator yields exactly one element, that element will be returned, otherwise an error will be returned containing an iterator that has the same output as the input -iterator. Read more
    source§

    fn at_most_one(self) -> Result<Option<Self::Item>, ExactlyOneError<Self>>
    where - Self: Sized,

    If the iterator yields no elements, Ok(None) will be returned. If the iterator yields +iterator. Read more
    source§

    fn at_most_one(self) -> Result<Option<Self::Item>, ExactlyOneError<Self>>
    where + Self: Sized,

    If the iterator yields no elements, Ok(None) will be returned. If the iterator yields exactly one element, that element will be returned, otherwise an error will be returned -containing an iterator that has the same output as the input iterator. Read more
    source§

    fn multipeek(self) -> MultiPeek<Self> ⓘ
    where +containing an iterator that has the same output as the input iterator. Read more

    source§

    fn multipeek(self) -> MultiPeek<Self> ⓘ
    where Self: Sized,

    An iterator adaptor that allows the user to peek at multiple .next() -values without advancing the base iterator. Read more
    source§

    fn counts(self) -> HashMap<Self::Item, usize>
    where +values without advancing the base iterator. Read more

    source§

    fn counts(self) -> HashMap<Self::Item, usize>
    where Self: Sized, Self::Item: Eq + Hash,

    Collect the items in this iterator and return a HashMap which contains each item that appears in the iterator and the number -of times it appears. Read more
    source§

    fn counts_by<K, F>(self, f: F) -> HashMap<K, usize>
    where +of times it appears. Read more

    source§

    fn counts_by<K, F>(self, f: F) -> HashMap<K, usize>
    where Self: Sized, K: Eq + Hash, F: FnMut(Self::Item) -> K,

    Collect the items in this iterator and return a HashMap which contains each item that appears in the iterator and the number of times it appears, -determining identity using a keying function. Read more
    source§

    fn multiunzip<FromI>(self) -> FromI
    where - Self: Sized + MultiUnzip<FromI>,

    Converts an iterator of tuples into a tuple of containers. Read more
    source§

    fn try_len(&self) -> Result<usize, (usize, Option<usize>)>

    Returns the length of the iterator if one exists. +determining identity using a keying function. Read more
    source§

    fn multiunzip<FromI>(self) -> FromI
    where + Self: Sized + MultiUnzip<FromI>,

    Converts an iterator of tuples into a tuple of containers. Read more
    source§

    fn try_len(&self) -> Result<usize, (usize, Option<usize>)>

    Returns the length of the iterator if one exists. Otherwise return self.size_hint(). Read more
    source§

    impl<IT, A, FromA> MultiUnzip<(FromA,)> for IT
    where IT: Iterator<Item = (A,)>, FromA: Default + Extend<A>,

    source§

    fn multiunzip(self) -> (FromA,)

    Unzip this iterator into multiple collections.
    source§

    impl<IT, A, FromA, B, FromB> MultiUnzip<(FromA, FromB)> for IT
    where @@ -683,4 +695,4 @@ Otherwise return self.size_hint(). (FromA, FromB, FromC, FromD, FromE, FromF, FromG, FromH, FromI, FromJ, FromK, FromL)

    Unzip this iterator into multiple collections.
    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 + 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/itertools/structs/struct.TupleWindows.html b/itertools/structs/struct.TupleWindows.html index 0e18deba9..6aed4397f 100644 --- a/itertools/structs/struct.TupleWindows.html +++ b/itertools/structs/struct.TupleWindows.html @@ -1,4 +1,4 @@ -TupleWindows in itertools::structs - Rust
    +TupleWindows in itertools::structs - Rust

    Struct itertools::structs::TupleWindows

    source · 
    pub struct TupleWindows<I, T>
    where
     I: Iterator<Item = T::Item>,
     T: HomogeneousTuple,
    { /* private fields */ }
    Expand description

    An iterator over all contiguous windows that produces tuples of a specific size.

    @@ -222,86 +222,87 @@ otherwise. Right variant of Either<Self, Self> otherwise. Read more
    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> Itertools for T
    where - T: Iterator + ?Sized,

    source§

    fn interleave<J>(self, other: J) -> Interleave<Self, J::IntoIter> ⓘ
    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> Itertools for T
    where + T: Iterator + ?Sized,

    source§

    fn interleave<J>(self, other: J) -> Interleave<Self, J::IntoIter> ⓘ
    where J: IntoIterator<Item = Self::Item>, - Self: Sized,

    Alternate elements from two iterators until both have run out. Read more
    source§

    fn interleave_shortest<J>( + Self: Sized,

    Alternate elements from two iterators until both have run out. Read more
    source§

    fn interleave_shortest<J>( self, other: J ) -> InterleaveShortest<Self, J::IntoIter> ⓘ
    where J: IntoIterator<Item = Self::Item>, Self: Sized,

    Alternate elements from two iterators until at least one of them has run -out. Read more
    source§

    fn intersperse(self, element: Self::Item) -> Intersperse<Self>
    where +out. Read more

    source§

    fn intersperse(self, element: Self::Item) -> Intersperse<Self>
    where Self: Sized, Self::Item: Clone,

    An iterator adaptor to insert a particular value -between each element of the adapted iterator. Read more
    source§

    fn intersperse_with<F>(self, element: F) -> IntersperseWith<Self, F> ⓘ
    where +between each element of the adapted iterator. Read more

    source§

    fn intersperse_with<F>(self, element: F) -> IntersperseWith<Self, F> ⓘ
    where Self: Sized, F: FnMut() -> Self::Item,

    An iterator adaptor to insert a particular value created by a function -between each element of the adapted iterator. Read more
    source§

    fn zip_longest<J>(self, other: J) -> ZipLongest<Self, J::IntoIter> ⓘ
    where +between each element of the adapted iterator. Read more

    source§

    fn get<R>(self, index: R) -> R::Output
    where + Self: Sized, + R: IteratorIndex<Self>,

    Returns an iterator over a subsection of the iterator. Read more
    source§

    fn zip_longest<J>(self, other: J) -> ZipLongest<Self, J::IntoIter> ⓘ
    where J: IntoIterator, Self: Sized,

    Create an iterator which iterates over both this and the specified -iterator simultaneously, yielding pairs of two optional elements. Read more
    source§

    fn zip_eq<J>(self, other: J) -> ZipEq<Self, J::IntoIter> ⓘ
    where +iterator simultaneously, yielding pairs of two optional elements. Read more

    source§

    fn zip_eq<J>(self, other: J) -> ZipEq<Self, J::IntoIter> ⓘ
    where J: IntoIterator, Self: Sized,

    Create an iterator which iterates over both this and the specified -iterator simultaneously, yielding pairs of elements. Read more
    source§

    fn batching<B, F>(self, f: F) -> Batching<Self, F> ⓘ
    where +iterator simultaneously, yielding pairs of elements. Read more

    source§

    fn batching<B, F>(self, f: F) -> Batching<Self, F> ⓘ
    where F: FnMut(&mut Self) -> Option<B>, Self: Sized,

    A “meta iterator adaptor”. Its closure receives a reference to the iterator and may pick off as many elements as it likes, to produce the -next iterator element. Read more
    source§

    fn group_by<K, F>(self, key: F) -> GroupBy<K, Self, F>
    where +next iterator element. Read more

    source§

    fn chunk_by<K, F>(self, key: F) -> ChunkBy<K, Self, F>
    where Self: Sized, F: FnMut(&Self::Item) -> K, K: PartialEq,

    Return an iterable that can group iterator elements. Consecutive elements that map to the same key (“runs”), are assigned -to the same group. Read more
    source§

    fn chunks(self, size: usize) -> IntoChunks<Self>
    where - Self: Sized,

    Return an iterable that can chunk the iterator. Read more
    source§

    fn tuple_windows<T>(self) -> TupleWindows<Self, T> ⓘ
    where +to the same group. Read more

    source§

    fn group_by<K, F>(self, key: F) -> ChunkBy<K, Self, F>
    where + Self: Sized, + F: FnMut(&Self::Item) -> K, + K: PartialEq,

    👎Deprecated since 0.13.0: Use .chunk_by() instead
    See .chunk_by().
    source§

    fn chunks(self, size: usize) -> IntoChunks<Self>
    where + Self: Sized,

    Return an iterable that can chunk the iterator. Read more
    source§

    fn tuple_windows<T>(self) -> TupleWindows<Self, T> ⓘ
    where Self: Sized + Iterator<Item = T::Item>, T: HomogeneousTuple, T::Item: Clone,

    Return an iterator over all contiguous windows producing tuples of -a specific size (up to 12). Read more
    source§

    fn circular_tuple_windows<T>(self) -> CircularTupleWindows<Self, T> ⓘ
    where +a specific size (up to 12). Read more

    source§

    fn circular_tuple_windows<T>(self) -> CircularTupleWindows<Self, T> ⓘ
    where Self: Sized + Clone + Iterator<Item = T::Item> + ExactSizeIterator, T: TupleCollect + Clone, T::Item: Clone,

    Return an iterator over all windows, wrapping back to the first elements when the window would otherwise exceed the length of the -iterator, producing tuples of a specific size (up to 12). Read more
    source§

    fn tuples<T>(self) -> Tuples<Self, T> ⓘ
    where +iterator, producing tuples of a specific size (up to 12). Read more

    source§

    fn tuples<T>(self) -> Tuples<Self, T> ⓘ
    where Self: Sized + Iterator<Item = T::Item>, T: HomogeneousTuple,

    Return an iterator that groups the items in tuples of a specific size -(up to 12). Read more
    source§

    fn tee(self) -> (Tee<Self>, Tee<Self>)
    where +(up to 12). Read more

    source§

    fn tee(self) -> (Tee<Self>, Tee<Self>)
    where Self: Sized, Self::Item: Clone,

    Split into an iterator pair that both yield all elements from -the original iterator. Read more
    source§

    fn step(self, n: usize) -> Step<Self> ⓘ
    where - Self: Sized,

    👎Deprecated since 0.8.0: Use std .step_by() instead
    Return an iterator adaptor that steps n elements in the base iterator -for each iteration. Read more
    source§

    fn map_into<R>(self) -> MapInto<Self, R>
    where +the original iterator. Read more

    source§

    fn map_into<R>(self) -> MapInto<Self, R>
    where Self: Sized, - Self::Item: Into<R>,

    Convert each item of the iterator using the Into trait. Read more
    source§

    fn map_results<F, T, U, E>(self, f: F) -> MapOk<Self, F>
    where - Self: Iterator<Item = Result<T, E>> + Sized, - F: FnMut(T) -> U,

    👎Deprecated since 0.10.0: Use .map_ok() instead
    See .map_ok().
    source§

    fn map_ok<F, T, U, E>(self, f: F) -> MapOk<Self, F>
    where + Self::Item: Into<R>,

    Convert each item of the iterator using the Into trait. Read more
    source§

    fn map_ok<F, T, U, E>(self, f: F) -> MapOk<Self, F>
    where Self: Iterator<Item = Result<T, E>> + Sized, F: FnMut(T) -> U,

    Return an iterator adaptor that applies the provided closure to every Result::Ok value. Result::Err values are -unchanged. Read more
    source§

    fn filter_ok<F, T, E>(self, f: F) -> FilterOk<Self, F> ⓘ
    where +unchanged. Read more

    source§

    fn filter_ok<F, T, E>(self, f: F) -> FilterOk<Self, F> ⓘ
    where Self: Iterator<Item = Result<T, E>> + Sized, F: FnMut(&T) -> bool,

    Return an iterator adaptor that filters every Result::Ok value with the provided closure. Result::Err values are -unchanged. Read more
    source§

    fn filter_map_ok<F, T, U, E>(self, f: F) -> FilterMapOk<Self, F> ⓘ
    where +unchanged. Read more

    source§

    fn filter_map_ok<F, T, U, E>(self, f: F) -> FilterMapOk<Self, F> ⓘ
    where Self: Iterator<Item = Result<T, E>> + Sized, F: FnMut(T) -> Option<U>,

    Return an iterator adaptor that filters and transforms every Result::Ok value with the provided closure. Result::Err -values are unchanged. Read more
    source§

    fn flatten_ok<T, E>(self) -> FlattenOk<Self, T, E> ⓘ
    where +values are unchanged. Read more

    source§

    fn flatten_ok<T, E>(self) -> FlattenOk<Self, T, E> ⓘ
    where Self: Iterator<Item = Result<T, E>> + Sized, T: IntoIterator,

    Return an iterator adaptor that flattens every Result::Ok value into -a series of Result::Ok values. Result::Err values are unchanged. Read more
    source§

    fn process_results<F, T, E, R>(self, processor: F) -> Result<R, E>
    where +a series of Result::Ok values. Result::Err values are unchanged. Read more

    source§

    fn process_results<F, T, E, R>(self, processor: F) -> Result<R, E>
    where Self: Iterator<Item = Result<T, E>> + Sized, F: FnOnce(ProcessResults<'_, Self, E>) -> R,

    “Lift” a function of the values of the current iterator so as to process -an iterator of Result values instead. Read more
    source§

    fn merge<J>(self, other: J) -> Merge<Self, J::IntoIter>
    where +an iterator of Result values instead. Read more

    source§

    fn merge<J>(self, other: J) -> Merge<Self, J::IntoIter>
    where Self: Sized, Self::Item: PartialOrd, J: IntoIterator<Item = Self::Item>,

    Return an iterator adaptor that merges the two base iterators in ascending order. If both base iterators are sorted (ascending), the -result is sorted. Read more
    source§

    fn merge_by<J, F>(self, other: J, is_first: F) -> MergeBy<Self, J::IntoIter, F> ⓘ
    where +result is sorted. Read more

    source§

    fn merge_by<J, F>(self, other: J, is_first: F) -> MergeBy<Self, J::IntoIter, F> ⓘ
    where Self: Sized, J: IntoIterator<Item = Self::Item>, F: FnMut(&Self::Item, &Self::Item) -> bool,

    Return an iterator adaptor that merges the two base iterators in order. -This is much like .merge() but allows for a custom ordering. Read more
    source§

    fn merge_join_by<J, F, T>( +This is much like .merge() but allows for a custom ordering. Read more

    source§

    fn merge_join_by<J, F, T>( self, other: J, cmp_fn: F @@ -309,284 +310,295 @@ This is much like IntoIterator, F: FnMut(&Self::Item, &J::Item) -> T, Self: Sized,

    Create an iterator that merges items from both this and the specified -iterator in ascending order. Read more
    source§

    fn kmerge(self) -> KMerge<<Self::Item as IntoIterator>::IntoIter>
    where +iterator in ascending order. Read more

    source§

    fn kmerge(self) -> KMerge<<Self::Item as IntoIterator>::IntoIter>
    where Self: Sized, Self::Item: IntoIterator, <Self::Item as IntoIterator>::Item: PartialOrd,

    Return an iterator adaptor that flattens an iterator of iterators by -merging them in ascending order. Read more
    source§

    fn kmerge_by<F>( +merging them in ascending order. Read more

    source§

    fn kmerge_by<F>( self, first: F ) -> KMergeBy<<Self::Item as IntoIterator>::IntoIter, F> ⓘ
    where Self: Sized, Self::Item: IntoIterator, F: FnMut(&<Self::Item as IntoIterator>::Item, &<Self::Item as IntoIterator>::Item) -> bool,

    Return an iterator adaptor that flattens an iterator of iterators by -merging them according to the given closure. Read more
    source§

    fn cartesian_product<J>(self, other: J) -> Product<Self, J::IntoIter> ⓘ
    where +merging them according to the given closure. Read more

    source§

    fn cartesian_product<J>(self, other: J) -> Product<Self, J::IntoIter> ⓘ
    where Self: Sized, Self::Item: Clone, J: IntoIterator, J::IntoIter: Clone,

    Return an iterator adaptor that iterates over the cartesian product of -the element sets of two iterators self and J. Read more
    source§

    fn multi_cartesian_product( +the element sets of two iterators self and J. Read more

    source§

    fn multi_cartesian_product( self ) -> MultiProduct<<Self::Item as IntoIterator>::IntoIter> ⓘ
    where Self: Sized, Self::Item: IntoIterator, <Self::Item as IntoIterator>::IntoIter: Clone, <Self::Item as IntoIterator>::Item: Clone,

    Return an iterator adaptor that iterates over the cartesian product of -all subiterators returned by meta-iterator self. Read more
    source§

    fn coalesce<F>(self, f: F) -> Coalesce<Self, F>
    where +all subiterators returned by meta-iterator self. Read more

    source§

    fn coalesce<F>(self, f: F) -> Coalesce<Self, F>
    where Self: Sized, F: FnMut(Self::Item, Self::Item) -> Result<Self::Item, (Self::Item, Self::Item)>,

    Return an iterator adaptor that uses the passed-in closure to -optionally merge together consecutive elements. Read more
    source§

    fn dedup(self) -> Dedup<Self>
    where +optionally merge together consecutive elements. Read more

    source§

    fn dedup(self) -> Dedup<Self>
    where Self: Sized, Self::Item: PartialEq,

    Remove duplicates from sections of consecutive identical elements. -If the iterator is sorted, all elements will be unique. Read more
    source§

    fn dedup_by<Cmp>(self, cmp: Cmp) -> DedupBy<Self, Cmp>
    where +If the iterator is sorted, all elements will be unique. Read more

    source§

    fn dedup_by<Cmp>(self, cmp: Cmp) -> DedupBy<Self, Cmp>
    where Self: Sized, Cmp: FnMut(&Self::Item, &Self::Item) -> bool,

    Remove duplicates from sections of consecutive identical elements, determining equality using a comparison function. -If the iterator is sorted, all elements will be unique. Read more
    source§

    fn dedup_with_count(self) -> DedupWithCount<Self>
    where +If the iterator is sorted, all elements will be unique. Read more

    source§

    fn dedup_with_count(self) -> DedupWithCount<Self>
    where Self: Sized,

    Remove duplicates from sections of consecutive identical elements, while keeping a count of how many repeated elements were present. -If the iterator is sorted, all elements will be unique. Read more
    source§

    fn dedup_by_with_count<Cmp>(self, cmp: Cmp) -> DedupByWithCount<Self, Cmp>
    where +If the iterator is sorted, all elements will be unique. Read more

    source§

    fn dedup_by_with_count<Cmp>(self, cmp: Cmp) -> DedupByWithCount<Self, Cmp>
    where Self: Sized, Cmp: FnMut(&Self::Item, &Self::Item) -> bool,

    Remove duplicates from sections of consecutive identical elements, while keeping a count of how many repeated elements were present. This will determine equality using a comparison function. -If the iterator is sorted, all elements will be unique. Read more
    source§

    fn duplicates(self) -> Duplicates<Self>
    where +If the iterator is sorted, all elements will be unique. Read more

    source§

    fn duplicates(self) -> Duplicates<Self>
    where Self: Sized, Self::Item: Eq + Hash,

    Return an iterator adaptor that produces elements that appear more than once during the -iteration. Duplicates are detected using hash and equality. Read more
    source§

    fn duplicates_by<V, F>(self, f: F) -> DuplicatesBy<Self, V, F>
    where +iteration. Duplicates are detected using hash and equality. Read more

    source§

    fn duplicates_by<V, F>(self, f: F) -> DuplicatesBy<Self, V, F>
    where Self: Sized, V: Eq + Hash, F: FnMut(&Self::Item) -> V,

    Return an iterator adaptor that produces elements that appear more than once during the -iteration. Duplicates are detected using hash and equality. Read more
    source§

    fn unique(self) -> Unique<Self> ⓘ
    where +iteration. Duplicates are detected using hash and equality. Read more

    source§

    fn unique(self) -> Unique<Self> ⓘ
    where Self: Sized, Self::Item: Clone + Eq + Hash,

    Return an iterator adaptor that filters out elements that have already been produced once during the iteration. Duplicates -are detected using hash and equality. Read more
    source§

    fn unique_by<V, F>(self, f: F) -> UniqueBy<Self, V, F> ⓘ
    where +are detected using hash and equality. Read more

    source§

    fn unique_by<V, F>(self, f: F) -> UniqueBy<Self, V, F> ⓘ
    where Self: Sized, V: Eq + Hash, F: FnMut(&Self::Item) -> V,

    Return an iterator adaptor that filters out elements that have -already been produced once during the iteration. Read more
    source§

    fn peeking_take_while<F>(&mut self, accept: F) -> PeekingTakeWhile<'_, Self, F> ⓘ
    where +already been produced once during the iteration. Read more

    source§

    fn peeking_take_while<F>(&mut self, accept: F) -> PeekingTakeWhile<'_, Self, F> ⓘ
    where Self: Sized + PeekingNext, F: FnMut(&Self::Item) -> bool,

    Return an iterator adaptor that borrows from this iterator and -takes items while the closure accept returns true. Read more
    source§

    fn take_while_ref<F>(&mut self, accept: F) -> TakeWhileRef<'_, Self, F> ⓘ
    where +takes items while the closure accept returns true. Read more

    source§

    fn take_while_ref<F>(&mut self, accept: F) -> TakeWhileRef<'_, Self, F> ⓘ
    where Self: Clone, F: FnMut(&Self::Item) -> bool,

    Return an iterator adaptor that borrows from a Clone-able iterator -to only pick off elements while the predicate accept returns true. Read more
    source§

    fn take_while_inclusive<F>(self, accept: F) -> TakeWhileInclusive<Self, F> ⓘ
    where +to only pick off elements while the predicate accept returns true. Read more

    source§

    fn take_while_inclusive<F>(self, accept: F) -> TakeWhileInclusive<Self, F> ⓘ
    where Self: Sized, F: FnMut(&Self::Item) -> bool,

    Returns an iterator adaptor that consumes elements while the given predicate is true, including the element for which the predicate -first returned false. Read more
    source§

    fn while_some<A>(self) -> WhileSome<Self> ⓘ
    where +first returned false. Read more

    source§

    fn while_some<A>(self) -> WhileSome<Self> ⓘ
    where Self: Sized + Iterator<Item = Option<A>>,

    Return an iterator adaptor that filters Option<A> iterator elements -and produces A. Stops on the first None encountered. Read more
    source§

    fn tuple_combinations<T>(self) -> TupleCombinations<Self, T> ⓘ
    where +and produces A. Stops on the first None encountered. Read more

    source§

    fn tuple_combinations<T>(self) -> TupleCombinations<Self, T> ⓘ
    where Self: Sized + Clone, Self::Item: Clone, T: HasCombination<Self>,

    Return an iterator adaptor that iterates over the combinations of the -elements from an iterator. Read more
    source§

    fn combinations(self, k: usize) -> Combinations<Self> ⓘ
    where +elements from an iterator. Read more

    source§

    fn combinations(self, k: usize) -> Combinations<Self> ⓘ
    where Self: Sized, Self::Item: Clone,

    Return an iterator adaptor that iterates over the k-length combinations of -the elements from an iterator. Read more
    source§

    fn combinations_with_replacement( +the elements from an iterator. Read more

    source§

    fn combinations_with_replacement( self, k: usize ) -> CombinationsWithReplacement<Self> ⓘ
    where Self: Sized, Self::Item: Clone,

    Return an iterator that iterates over the k-length combinations of -the elements from an iterator, with replacement. Read more
    source§

    fn permutations(self, k: usize) -> Permutations<Self> ⓘ
    where +the elements from an iterator, with replacement. Read more

    source§

    fn permutations(self, k: usize) -> Permutations<Self> ⓘ
    where Self: Sized, Self::Item: Clone,

    Return an iterator adaptor that iterates over all k-permutations of the -elements from an iterator. Read more
    source§

    fn powerset(self) -> Powerset<Self> ⓘ
    where +elements from an iterator. Read more

    source§

    fn powerset(self) -> Powerset<Self> ⓘ
    where Self: Sized, Self::Item: Clone,

    Return an iterator that iterates through the powerset of the elements from an -iterator. Read more
    source§

    fn pad_using<F>(self, min: usize, f: F) -> PadUsing<Self, F> ⓘ
    where +iterator. Read more

    source§

    fn pad_using<F>(self, min: usize, f: F) -> PadUsing<Self, F> ⓘ
    where Self: Sized, F: FnMut(usize) -> Self::Item,

    Return an iterator adaptor that pads the sequence to a minimum length of -min by filling missing elements using a closure f. Read more
    source§

    fn with_position(self) -> WithPosition<Self> ⓘ
    where +min by filling missing elements using a closure f. Read more

    source§

    fn with_position(self) -> WithPosition<Self> ⓘ
    where Self: Sized,

    Return an iterator adaptor that combines each element with a Position to -ease special-case handling of the first or last elements. Read more
    source§

    fn positions<P>(self, predicate: P) -> Positions<Self, P> ⓘ
    where +ease special-case handling of the first or last elements. Read more

    source§

    fn positions<P>(self, predicate: P) -> Positions<Self, P> ⓘ
    where Self: Sized, P: FnMut(Self::Item) -> bool,

    Return an iterator adaptor that yields the indices of all elements -satisfying a predicate, counted from the start of the iterator. Read more
    source§

    fn update<F>(self, updater: F) -> Update<Self, F> ⓘ
    where +satisfying a predicate, counted from the start of the iterator. Read more

    source§

    fn update<F>(self, updater: F) -> Update<Self, F> ⓘ
    where Self: Sized, F: FnMut(&mut Self::Item),

    Return an iterator adaptor that applies a mutating function -to each element before yielding it. Read more
    source§

    fn next_tuple<T>(&mut self) -> Option<T>
    where +to each element before yielding it. Read more

    source§

    fn next_tuple<T>(&mut self) -> Option<T>
    where Self: Sized + Iterator<Item = T::Item>, T: HomogeneousTuple,

    Advances the iterator and returns the next items grouped in a tuple of -a specific size (up to 12). Read more
    source§

    fn collect_tuple<T>(self) -> Option<T>
    where +a specific size (up to 12). Read more

    source§

    fn collect_tuple<T>(self) -> Option<T>
    where Self: Sized + Iterator<Item = T::Item>, T: HomogeneousTuple,

    Collects all items from the iterator into a tuple of a specific size -(up to 12). Read more
    source§

    fn find_position<P>(&mut self, pred: P) -> Option<(usize, Self::Item)>
    where - P: FnMut(&Self::Item) -> bool,

    Find the position and value of the first element satisfying a predicate. Read more
    source§

    fn find_or_last<P>(self, predicate: P) -> Option<Self::Item>
    where +(up to 12). Read more

    source§

    fn find_position<P>(&mut self, pred: P) -> Option<(usize, Self::Item)>
    where + P: FnMut(&Self::Item) -> bool,

    Find the position and value of the first element satisfying a predicate. Read more
    source§

    fn find_or_last<P>(self, predicate: P) -> Option<Self::Item>
    where Self: Sized, - P: FnMut(&Self::Item) -> bool,

    Find the value of the first element satisfying a predicate or return the last element, if any. Read more
    source§

    fn find_or_first<P>(self, predicate: P) -> Option<Self::Item>
    where + P: FnMut(&Self::Item) -> bool,

    Find the value of the first element satisfying a predicate or return the last element, if any. Read more
    source§

    fn find_or_first<P>(self, predicate: P) -> Option<Self::Item>
    where Self: Sized, - P: FnMut(&Self::Item) -> bool,

    Find the value of the first element satisfying a predicate or return the first element, if any. Read more
    source§

    fn contains<Q>(&mut self, query: &Q) -> bool
    where + P: FnMut(&Self::Item) -> bool,

    Find the value of the first element satisfying a predicate or return the first element, if any. Read more
    source§

    fn contains<Q>(&mut self, query: &Q) -> bool
    where Self: Sized, Self::Item: Borrow<Q>, - Q: PartialEq,

    Returns true if the given item is present in this iterator. Read more
    source§

    fn all_equal(&mut self) -> bool
    where + Q: PartialEq,

    Returns true if the given item is present in this iterator. Read more
    source§

    fn all_equal(&mut self) -> bool
    where Self: Sized, - Self::Item: PartialEq,

    Check whether all elements compare equal. Read more
    source§

    fn all_equal_value( + Self::Item: PartialEq,

    Check whether all elements compare equal. Read more
    source§

    fn all_equal_value( &mut self ) -> Result<Self::Item, Option<(Self::Item, Self::Item)>>
    where Self: Sized, Self::Item: PartialEq,

    If there are elements and they are all equal, return a single copy of that element. If there are no elements, return an Error containing None. If there are elements and they are not all equal, return a tuple containing the first -two non-equal elements found. Read more
    source§

    fn all_unique(&mut self) -> bool
    where +two non-equal elements found. Read more

    source§

    fn all_unique(&mut self) -> bool
    where Self: Sized, - Self::Item: Eq + Hash,

    Check whether all elements are unique (non equal). Read more
    source§

    fn dropping(self, n: usize) -> Self
    where + Self::Item: Eq + Hash,

    Check whether all elements are unique (non equal). Read more
    source§

    fn dropping(self, n: usize) -> Self
    where Self: Sized,

    Consume the first n elements from the iterator eagerly, -and return the same iterator again. Read more
    source§

    fn dropping_back(self, n: usize) -> Self
    where +and return the same iterator again. Read more

    source§

    fn dropping_back(self, n: usize) -> Self
    where Self: Sized + DoubleEndedIterator,

    Consume the last n elements from the iterator eagerly, -and return the same iterator again. Read more
    source§

    fn foreach<F>(self, f: F)
    where - F: FnMut(Self::Item), - Self: Sized,

    👎Deprecated since 0.8.0: Use .for_each() instead
    Run the closure f eagerly on each element of the iterator. Read more
    source§

    fn concat(self) -> Self::Item
    where +and return the same iterator again. Read more

    source§

    fn concat(self) -> Self::Item
    where Self: Sized, - Self::Item: Extend<<<Self as Iterator>::Item as IntoIterator>::Item> + IntoIterator + Default,

    Combine all an iterator’s elements into one element by using Extend. Read more
    source§

    fn collect_vec(self) -> Vec<Self::Item>
    where + Self::Item: Extend<<<Self as Iterator>::Item as IntoIterator>::Item> + IntoIterator + Default,

    Combine all an iterator’s elements into one element by using Extend. Read more
    source§

    fn collect_vec(self) -> Vec<Self::Item>
    where Self: Sized,

    .collect_vec() is simply a type specialization of Iterator::collect, -for convenience.
    source§

    fn try_collect<T, U, E>(self) -> Result<U, E>
    where +for convenience.

    source§

    fn try_collect<T, U, E>(self) -> Result<U, E>
    where Self: Sized + Iterator<Item = Result<T, E>>, Result<U, E>: FromIterator<Result<T, E>>,

    .try_collect() is more convenient way of writing -.collect::<Result<_, _>>() Read more
    source§

    fn set_from<'a, A: 'a, J>(&mut self, from: J) -> usize
    where +.collect::<Result<_, _>>() Read more

    source§

    fn set_from<'a, A: 'a, J>(&mut self, from: J) -> usize
    where Self: Iterator<Item = &'a mut A>, J: IntoIterator<Item = A>,

    Assign to each reference in self from the from iterator, -stopping at the shortest of the two iterators. Read more
    source§

    fn join(&mut self, sep: &str) -> String
    where - Self::Item: Display,

    Combine all iterator elements into one String, separated by sep. Read more
    source§

    fn format(self, sep: &str) -> Format<'_, Self>
    where - Self: Sized,

    Format all iterator elements, separated by sep. Read more
    source§

    fn format_with<F>(self, sep: &str, format: F) -> FormatWith<'_, Self, F>
    where +stopping at the shortest of the two iterators. Read more

    source§

    fn join(&mut self, sep: &str) -> String
    where + Self::Item: Display,

    Combine all iterator elements into one String, separated by sep. Read more
    source§

    fn format(self, sep: &str) -> Format<'_, Self>
    where + Self: Sized,

    Format all iterator elements, separated by sep. Read more
    source§

    fn format_with<F>(self, sep: &str, format: F) -> FormatWith<'_, Self, F>
    where Self: Sized, - F: FnMut(Self::Item, &mut dyn FnMut(&dyn Display) -> Result) -> Result,

    Format all iterator elements, separated by sep. Read more
    source§

    fn fold_results<A, E, B, F>(&mut self, start: B, f: F) -> Result<B, E>
    where + F: FnMut(Self::Item, &mut dyn FnMut(&dyn Display) -> Result) -> Result,

    Format all iterator elements, separated by sep. Read more
    source§

    fn fold_ok<A, E, B, F>(&mut self, start: B, f: F) -> Result<B, E>
    where Self: Iterator<Item = Result<A, E>>, - F: FnMut(B, A) -> B,

    👎Deprecated since 0.10.0: Use .fold_ok() instead
    See .fold_ok().
    source§

    fn fold_ok<A, E, B, F>(&mut self, start: B, f: F) -> Result<B, E>
    where - Self: Iterator<Item = Result<A, E>>, - F: FnMut(B, A) -> B,

    Fold Result values from an iterator. Read more
    source§

    fn fold_options<A, B, F>(&mut self, start: B, f: F) -> Option<B>
    where + F: FnMut(B, A) -> B,

    Fold Result values from an iterator. Read more
    source§

    fn fold_options<A, B, F>(&mut self, start: B, f: F) -> Option<B>
    where Self: Iterator<Item = Option<A>>, - F: FnMut(B, A) -> B,

    Fold Option values from an iterator. Read more
    source§

    fn fold1<F>(self, f: F) -> Option<Self::Item>
    where + F: FnMut(B, A) -> B,

    Fold Option values from an iterator. Read more
    source§

    fn fold1<F>(self, f: F) -> Option<Self::Item>
    where F: FnMut(Self::Item, Self::Item) -> Self::Item, - Self: Sized,

    👎Deprecated since 0.10.2: Use Iterator::reduce instead
    Accumulator of the elements in the iterator. Read more
    source§

    fn tree_fold1<F>(self, f: F) -> Option<Self::Item>
    where + Self: Sized,

    👎Deprecated since 0.10.2: Use Iterator::reduce instead
    Accumulator of the elements in the iterator. Read more
    source§

    fn tree_reduce<F>(self, f: F) -> Option<Self::Item>
    where F: FnMut(Self::Item, Self::Item) -> Self::Item, - Self: Sized,

    Accumulate the elements in the iterator in a tree-like manner. Read more
    source§

    fn fold_while<B, F>(&mut self, init: B, f: F) -> FoldWhile<B>
    where + Self: Sized,

    Accumulate the elements in the iterator in a tree-like manner. Read more
    source§

    fn tree_fold1<F>(self, f: F) -> Option<Self::Item>
    where + F: FnMut(Self::Item, Self::Item) -> Self::Item, + Self: Sized,

    👎Deprecated since 0.13.0: Use .tree_reduce() instead
    See .tree_reduce().
    source§

    fn fold_while<B, F>(&mut self, init: B, f: F) -> FoldWhile<B>
    where Self: Sized, - F: FnMut(B, Self::Item) -> FoldWhile<B>,

    An iterator method that applies a function, producing a single, final value. Read more
    source§

    fn sum1<S>(self) -> Option<S>
    where + F: FnMut(B, Self::Item) -> FoldWhile<B>,

    An iterator method that applies a function, producing a single, final value. Read more
    source§

    fn sum1<S>(self) -> Option<S>
    where Self: Sized, - S: Sum<Self::Item>,

    Iterate over the entire iterator and add all the elements. Read more
    source§

    fn product1<P>(self) -> Option<P>
    where + S: Sum<Self::Item>,

    Iterate over the entire iterator and add all the elements. Read more
    source§

    fn product1<P>(self) -> Option<P>
    where Self: Sized, - P: Product<Self::Item>,

    Iterate over the entire iterator and multiply all the elements. Read more
    source§

    fn sorted_unstable(self) -> IntoIter<Self::Item> ⓘ
    where + P: Product<Self::Item>,

    Iterate over the entire iterator and multiply all the elements. Read more
    source§

    fn sorted_unstable(self) -> IntoIter<Self::Item> ⓘ
    where Self: Sized, - Self::Item: Ord,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_unstable_by<F>(self, cmp: F) -> IntoIter<Self::Item> ⓘ
    where + Self::Item: Ord,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_unstable_by<F>(self, cmp: F) -> IntoIter<Self::Item> ⓘ
    where Self: Sized, - F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_unstable_by_key<K, F>(self, f: F) -> IntoIter<Self::Item> ⓘ
    where + F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_unstable_by_key<K, F>(self, f: F) -> IntoIter<Self::Item> ⓘ
    where Self: Sized, K: Ord, - F: FnMut(&Self::Item) -> K,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted(self) -> IntoIter<Self::Item> ⓘ
    where + F: FnMut(&Self::Item) -> K,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted(self) -> IntoIter<Self::Item> ⓘ
    where Self: Sized, - Self::Item: Ord,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_by<F>(self, cmp: F) -> IntoIter<Self::Item> ⓘ
    where + Self::Item: Ord,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_by<F>(self, cmp: F) -> IntoIter<Self::Item> ⓘ
    where Self: Sized, - F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_by_key<K, F>(self, f: F) -> IntoIter<Self::Item> ⓘ
    where + F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_by_key<K, F>(self, f: F) -> IntoIter<Self::Item> ⓘ
    where Self: Sized, K: Ord, - F: FnMut(&Self::Item) -> K,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_by_cached_key<K, F>(self, f: F) -> IntoIter<Self::Item> ⓘ
    where + F: FnMut(&Self::Item) -> K,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_by_cached_key<K, F>(self, f: F) -> IntoIter<Self::Item> ⓘ
    where Self: Sized, K: Ord, F: FnMut(&Self::Item) -> K,

    Sort all iterator elements into a new iterator in ascending order. The key function is -called exactly once per key. Read more
    source§

    fn k_smallest(self, k: usize) -> IntoIter<Self::Item> ⓘ
    where +called exactly once per key. Read more

    source§

    fn k_smallest(self, k: usize) -> IntoIter<Self::Item> ⓘ
    where Self: Sized, - Self::Item: Ord,

    Sort the k smallest elements into a new iterator, in ascending order. Read more
    source§

    fn partition_map<A, B, F, L, R>(self, predicate: F) -> (A, B)
    where + Self::Item: Ord,

    Sort the k smallest elements into a new iterator, in ascending order. Read more
    source§

    fn k_smallest_by<F>(self, k: usize, cmp: F) -> IntoIter<Self::Item> ⓘ
    where + Self: Sized, + F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Sort the k smallest elements into a new iterator using the provided comparison. Read more
    source§

    fn k_smallest_by_key<F, K>(self, k: usize, key: F) -> IntoIter<Self::Item> ⓘ
    where + Self: Sized, + F: FnMut(&Self::Item) -> K, + K: Ord,

    Return the elements producing the k smallest outputs of the provided function. Read more
    source§

    fn k_largest(self, k: usize) -> IntoIter<Self::Item> ⓘ
    where + Self: Sized, + Self::Item: Ord,

    Sort the k largest elements into a new iterator, in descending order. Read more
    source§

    fn k_largest_by<F>(self, k: usize, cmp: F) -> IntoIter<Self::Item> ⓘ
    where + Self: Sized, + F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Sort the k largest elements into a new iterator using the provided comparison. Read more
    source§

    fn k_largest_by_key<F, K>(self, k: usize, key: F) -> IntoIter<Self::Item> ⓘ
    where + Self: Sized, + F: FnMut(&Self::Item) -> K, + K: Ord,

    Return the elements producing the k largest outputs of the provided function. Read more
    source§

    fn tail(self, n: usize) -> IntoIter<Self::Item> ⓘ
    where + Self: Sized,

    Consumes the iterator and return an iterator of the last n elements. Read more
    source§

    fn partition_map<A, B, F, L, R>(self, predicate: F) -> (A, B)
    where Self: Sized, F: FnMut(Self::Item) -> Either<L, R>, A: Default + Extend<L>, B: Default + Extend<R>,

    Collect all iterator elements into one of two partitions. Unlike Iterator::partition, each partition may -have a distinct type. Read more
    source§

    fn partition_result<A, B, T, E>(self) -> (A, B)
    where +have a distinct type. Read more

    source§

    fn partition_result<A, B, T, E>(self) -> (A, B)
    where Self: Iterator<Item = Result<T, E>> + Sized, A: Default + Extend<T>, B: Default + Extend<E>,

    Partition a sequence of Results into one list of all the Ok elements -and another list of all the Err elements. Read more
    source§

    fn into_group_map<K, V>(self) -> HashMap<K, Vec<V>>
    where +and another list of all the Err elements. Read more

    source§

    fn into_group_map<K, V>(self) -> HashMap<K, Vec<V>>
    where Self: Iterator<Item = (K, V)> + Sized, K: Hash + Eq,

    Return a HashMap of keys mapped to Vecs of values. Keys and values -are taken from (Key, Value) tuple pairs yielded by the input iterator. Read more
    source§

    fn into_group_map_by<K, V, F>(self, f: F) -> HashMap<K, Vec<V>>
    where +are taken from (Key, Value) tuple pairs yielded by the input iterator. Read more

    source§

    fn into_group_map_by<K, V, F>(self, f: F) -> HashMap<K, Vec<V>>
    where Self: Iterator<Item = V> + Sized, K: Hash + Eq, - F: Fn(&V) -> K,

    Return an Iterator on a HashMap. Keys mapped to Vecs of values. The key is specified -in the closure. Read more
    source§

    fn into_grouping_map<K, V>(self) -> GroupingMap<Self>
    where + F: FnMut(&V) -> K,

    Return an Iterator on a HashMap. Keys mapped to Vecs of values. The key is specified +in the closure. Read more
    source§

    fn into_grouping_map<K, V>(self) -> GroupingMap<Self>
    where Self: Iterator<Item = (K, V)> + Sized, K: Hash + Eq,

    Constructs a GroupingMap to be used later with one of the efficient -group-and-fold operations it allows to perform. Read more
    source§

    fn into_grouping_map_by<K, V, F>(self, key_mapper: F) -> GroupingMapBy<Self, F>
    where +group-and-fold operations it allows to perform. Read more

    source§

    fn into_grouping_map_by<K, V, F>(self, key_mapper: F) -> GroupingMapBy<Self, F>
    where Self: Iterator<Item = V> + Sized, K: Hash + Eq, F: FnMut(&V) -> K,

    Constructs a GroupingMap to be used later with one of the efficient -group-and-fold operations it allows to perform. Read more
    source§

    fn min_set(self) -> Vec<Self::Item>
    where +group-and-fold operations it allows to perform. Read more

    source§

    fn min_set(self) -> Vec<Self::Item>
    where Self: Sized, - Self::Item: Ord,

    Return all minimum elements of an iterator. Read more
    source§

    fn min_set_by<F>(self, compare: F) -> Vec<Self::Item>
    where + Self::Item: Ord,

    Return all minimum elements of an iterator. Read more
    source§

    fn min_set_by<F>(self, compare: F) -> Vec<Self::Item>
    where Self: Sized, F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Return all minimum elements of an iterator, as determined by -the specified function. Read more
    source§

    fn min_set_by_key<K, F>(self, key: F) -> Vec<Self::Item>
    where +the specified function. Read more

    source§

    fn min_set_by_key<K, F>(self, key: F) -> Vec<Self::Item>
    where Self: Sized, K: Ord, F: FnMut(&Self::Item) -> K,

    Return all minimum elements of an iterator, as determined by -the specified function. Read more
    source§

    fn max_set(self) -> Vec<Self::Item>
    where +the specified function. Read more

    source§

    fn max_set(self) -> Vec<Self::Item>
    where Self: Sized, - Self::Item: Ord,

    Return all maximum elements of an iterator. Read more
    source§

    fn max_set_by<F>(self, compare: F) -> Vec<Self::Item>
    where + Self::Item: Ord,

    Return all maximum elements of an iterator. Read more
    source§

    fn max_set_by<F>(self, compare: F) -> Vec<Self::Item>
    where Self: Sized, F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Return all maximum elements of an iterator, as determined by -the specified function. Read more
    source§

    fn max_set_by_key<K, F>(self, key: F) -> Vec<Self::Item>
    where +the specified function. Read more

    source§

    fn max_set_by_key<K, F>(self, key: F) -> Vec<Self::Item>
    where Self: Sized, K: Ord, F: FnMut(&Self::Item) -> K,

    Return all maximum elements of an iterator, as determined by -the specified function. Read more
    source§

    fn minmax(self) -> MinMaxResult<Self::Item>
    where +the specified function. Read more

    source§

    fn minmax(self) -> MinMaxResult<Self::Item>
    where Self: Sized, - Self::Item: PartialOrd,

    Return the minimum and maximum elements in the iterator. Read more
    source§

    fn minmax_by_key<K, F>(self, key: F) -> MinMaxResult<Self::Item>
    where + Self::Item: PartialOrd,

    Return the minimum and maximum elements in the iterator. Read more
    source§

    fn minmax_by_key<K, F>(self, key: F) -> MinMaxResult<Self::Item>
    where Self: Sized, K: PartialOrd, F: FnMut(&Self::Item) -> K,

    Return the minimum and maximum element of an iterator, as determined by -the specified function. Read more
    source§

    fn minmax_by<F>(self, compare: F) -> MinMaxResult<Self::Item>
    where +the specified function. Read more

    source§

    fn minmax_by<F>(self, compare: F) -> MinMaxResult<Self::Item>
    where Self: Sized, F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Return the minimum and maximum element of an iterator, as determined by -the specified comparison function. Read more
    source§

    fn position_max(self) -> Option<usize>
    where +the specified comparison function. Read more

    source§

    fn position_max(self) -> Option<usize>
    where Self: Sized, - Self::Item: Ord,

    Return the position of the maximum element in the iterator. Read more
    source§

    fn position_max_by_key<K, F>(self, key: F) -> Option<usize>
    where + Self::Item: Ord,

    Return the position of the maximum element in the iterator. Read more
    source§

    fn position_max_by_key<K, F>(self, key: F) -> Option<usize>
    where Self: Sized, K: Ord, F: FnMut(&Self::Item) -> K,

    Return the position of the maximum element in the iterator, as -determined by the specified function. Read more
    source§

    fn position_max_by<F>(self, compare: F) -> Option<usize>
    where +determined by the specified function. Read more

    source§

    fn position_max_by<F>(self, compare: F) -> Option<usize>
    where Self: Sized, F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Return the position of the maximum element in the iterator, as -determined by the specified comparison function. Read more
    source§

    fn position_min(self) -> Option<usize>
    where +determined by the specified comparison function. Read more

    source§

    fn position_min(self) -> Option<usize>
    where Self: Sized, - Self::Item: Ord,

    Return the position of the minimum element in the iterator. Read more
    source§

    fn position_min_by_key<K, F>(self, key: F) -> Option<usize>
    where + Self::Item: Ord,

    Return the position of the minimum element in the iterator. Read more
    source§

    fn position_min_by_key<K, F>(self, key: F) -> Option<usize>
    where Self: Sized, K: Ord, F: FnMut(&Self::Item) -> K,

    Return the position of the minimum element in the iterator, as -determined by the specified function. Read more
    source§

    fn position_min_by<F>(self, compare: F) -> Option<usize>
    where +determined by the specified function. Read more

    source§

    fn position_min_by<F>(self, compare: F) -> Option<usize>
    where Self: Sized, F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Return the position of the minimum element in the iterator, as -determined by the specified comparison function. Read more
    source§

    fn position_minmax(self) -> MinMaxResult<usize>
    where +determined by the specified comparison function. Read more

    source§

    fn position_minmax(self) -> MinMaxResult<usize>
    where Self: Sized, Self::Item: PartialOrd,

    Return the positions of the minimum and maximum elements in -the iterator. Read more
    source§

    fn position_minmax_by_key<K, F>(self, key: F) -> MinMaxResult<usize>
    where +the iterator. Read more

    source§

    fn position_minmax_by_key<K, F>(self, key: F) -> MinMaxResult<usize>
    where Self: Sized, K: PartialOrd, F: FnMut(&Self::Item) -> K,

    Return the postions of the minimum and maximum elements of an -iterator, as determined by the specified function. Read more
    source§

    fn position_minmax_by<F>(self, compare: F) -> MinMaxResult<usize>
    where +iterator, as determined by the specified function. Read more

    source§

    fn position_minmax_by<F>(self, compare: F) -> MinMaxResult<usize>
    where Self: Sized, F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Return the postions of the minimum and maximum elements of an -iterator, as determined by the specified comparison function. Read more
    source§

    fn exactly_one(self) -> Result<Self::Item, ExactlyOneError<Self>>
    where +iterator, as determined by the specified comparison function. Read more

    source§

    fn exactly_one(self) -> Result<Self::Item, ExactlyOneError<Self>>
    where Self: Sized,

    If the iterator yields exactly one element, that element will be returned, otherwise an error will be returned containing an iterator that has the same output as the input -iterator. Read more
    source§

    fn at_most_one(self) -> Result<Option<Self::Item>, ExactlyOneError<Self>>
    where - Self: Sized,

    If the iterator yields no elements, Ok(None) will be returned. If the iterator yields +iterator. Read more
    source§

    fn at_most_one(self) -> Result<Option<Self::Item>, ExactlyOneError<Self>>
    where + Self: Sized,

    If the iterator yields no elements, Ok(None) will be returned. If the iterator yields exactly one element, that element will be returned, otherwise an error will be returned -containing an iterator that has the same output as the input iterator. Read more
    source§

    fn multipeek(self) -> MultiPeek<Self> ⓘ
    where +containing an iterator that has the same output as the input iterator. Read more

    source§

    fn multipeek(self) -> MultiPeek<Self> ⓘ
    where Self: Sized,

    An iterator adaptor that allows the user to peek at multiple .next() -values without advancing the base iterator. Read more
    source§

    fn counts(self) -> HashMap<Self::Item, usize>
    where +values without advancing the base iterator. Read more

    source§

    fn counts(self) -> HashMap<Self::Item, usize>
    where Self: Sized, Self::Item: Eq + Hash,

    Collect the items in this iterator and return a HashMap which contains each item that appears in the iterator and the number -of times it appears. Read more
    source§

    fn counts_by<K, F>(self, f: F) -> HashMap<K, usize>
    where +of times it appears. Read more

    source§

    fn counts_by<K, F>(self, f: F) -> HashMap<K, usize>
    where Self: Sized, K: Eq + Hash, F: FnMut(Self::Item) -> K,

    Collect the items in this iterator and return a HashMap which contains each item that appears in the iterator and the number of times it appears, -determining identity using a keying function. Read more
    source§

    fn multiunzip<FromI>(self) -> FromI
    where - Self: Sized + MultiUnzip<FromI>,

    Converts an iterator of tuples into a tuple of containers. Read more
    source§

    fn try_len(&self) -> Result<usize, (usize, Option<usize>)>

    Returns the length of the iterator if one exists. +determining identity using a keying function. Read more
    source§

    fn multiunzip<FromI>(self) -> FromI
    where + Self: Sized + MultiUnzip<FromI>,

    Converts an iterator of tuples into a tuple of containers. Read more
    source§

    fn try_len(&self) -> Result<usize, (usize, Option<usize>)>

    Returns the length of the iterator if one exists. Otherwise return self.size_hint(). Read more
    source§

    impl<IT, A, FromA> MultiUnzip<(FromA,)> for IT
    where IT: Iterator<Item = (A,)>, FromA: Default + Extend<A>,

    source§

    fn multiunzip(self) -> (FromA,)

    Unzip this iterator into multiple collections.
    source§

    impl<IT, A, FromA, B, FromB> MultiUnzip<(FromA, FromB)> for IT
    where @@ -688,4 +700,4 @@ Otherwise return self.size_hint(). (FromA, FromB, FromC, FromD, FromE, FromF, FromG, FromH, FromI, FromJ, FromK, FromL)

    Unzip this iterator into multiple collections.
    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 + 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/itertools/structs/struct.Tuples.html b/itertools/structs/struct.Tuples.html index 52ee5edc0..311fa63fe 100644 --- a/itertools/structs/struct.Tuples.html +++ b/itertools/structs/struct.Tuples.html @@ -1,4 +1,4 @@ -Tuples in itertools::structs - Rust
    +Tuples in itertools::structs - Rust

    Struct itertools::structs::Tuples

    source · 
    pub struct Tuples<I, T>
    where
     I: Iterator<Item = T::Item>,
     T: HomogeneousTuple,
    { /* private fields */ }
    Expand description

    An iterator that groups the items in tuples of a specific size.

    @@ -228,86 +228,87 @@ otherwise. Right variant of Either<Self, Self> otherwise. Read more
    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> Itertools for T
    where - T: Iterator + ?Sized,

    source§

    fn interleave<J>(self, other: J) -> Interleave<Self, J::IntoIter> ⓘ
    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> Itertools for T
    where + T: Iterator + ?Sized,

    source§

    fn interleave<J>(self, other: J) -> Interleave<Self, J::IntoIter> ⓘ
    where J: IntoIterator<Item = Self::Item>, - Self: Sized,

    Alternate elements from two iterators until both have run out. Read more
    source§

    fn interleave_shortest<J>( + Self: Sized,

    Alternate elements from two iterators until both have run out. Read more
    source§

    fn interleave_shortest<J>( self, other: J ) -> InterleaveShortest<Self, J::IntoIter> ⓘ
    where J: IntoIterator<Item = Self::Item>, Self: Sized,

    Alternate elements from two iterators until at least one of them has run -out. Read more
    source§

    fn intersperse(self, element: Self::Item) -> Intersperse<Self>
    where +out. Read more

    source§

    fn intersperse(self, element: Self::Item) -> Intersperse<Self>
    where Self: Sized, Self::Item: Clone,

    An iterator adaptor to insert a particular value -between each element of the adapted iterator. Read more
    source§

    fn intersperse_with<F>(self, element: F) -> IntersperseWith<Self, F> ⓘ
    where +between each element of the adapted iterator. Read more

    source§

    fn intersperse_with<F>(self, element: F) -> IntersperseWith<Self, F> ⓘ
    where Self: Sized, F: FnMut() -> Self::Item,

    An iterator adaptor to insert a particular value created by a function -between each element of the adapted iterator. Read more
    source§

    fn zip_longest<J>(self, other: J) -> ZipLongest<Self, J::IntoIter> ⓘ
    where +between each element of the adapted iterator. Read more

    source§

    fn get<R>(self, index: R) -> R::Output
    where + Self: Sized, + R: IteratorIndex<Self>,

    Returns an iterator over a subsection of the iterator. Read more
    source§

    fn zip_longest<J>(self, other: J) -> ZipLongest<Self, J::IntoIter> ⓘ
    where J: IntoIterator, Self: Sized,

    Create an iterator which iterates over both this and the specified -iterator simultaneously, yielding pairs of two optional elements. Read more
    source§

    fn zip_eq<J>(self, other: J) -> ZipEq<Self, J::IntoIter> ⓘ
    where +iterator simultaneously, yielding pairs of two optional elements. Read more

    source§

    fn zip_eq<J>(self, other: J) -> ZipEq<Self, J::IntoIter> ⓘ
    where J: IntoIterator, Self: Sized,

    Create an iterator which iterates over both this and the specified -iterator simultaneously, yielding pairs of elements. Read more
    source§

    fn batching<B, F>(self, f: F) -> Batching<Self, F> ⓘ
    where +iterator simultaneously, yielding pairs of elements. Read more

    source§

    fn batching<B, F>(self, f: F) -> Batching<Self, F> ⓘ
    where F: FnMut(&mut Self) -> Option<B>, Self: Sized,

    A “meta iterator adaptor”. Its closure receives a reference to the iterator and may pick off as many elements as it likes, to produce the -next iterator element. Read more
    source§

    fn group_by<K, F>(self, key: F) -> GroupBy<K, Self, F>
    where +next iterator element. Read more

    source§

    fn chunk_by<K, F>(self, key: F) -> ChunkBy<K, Self, F>
    where Self: Sized, F: FnMut(&Self::Item) -> K, K: PartialEq,

    Return an iterable that can group iterator elements. Consecutive elements that map to the same key (“runs”), are assigned -to the same group. Read more
    source§

    fn chunks(self, size: usize) -> IntoChunks<Self>
    where - Self: Sized,

    Return an iterable that can chunk the iterator. Read more
    source§

    fn tuple_windows<T>(self) -> TupleWindows<Self, T> ⓘ
    where +to the same group. Read more

    source§

    fn group_by<K, F>(self, key: F) -> ChunkBy<K, Self, F>
    where + Self: Sized, + F: FnMut(&Self::Item) -> K, + K: PartialEq,

    👎Deprecated since 0.13.0: Use .chunk_by() instead
    See .chunk_by().
    source§

    fn chunks(self, size: usize) -> IntoChunks<Self>
    where + Self: Sized,

    Return an iterable that can chunk the iterator. Read more
    source§

    fn tuple_windows<T>(self) -> TupleWindows<Self, T> ⓘ
    where Self: Sized + Iterator<Item = T::Item>, T: HomogeneousTuple, T::Item: Clone,

    Return an iterator over all contiguous windows producing tuples of -a specific size (up to 12). Read more
    source§

    fn circular_tuple_windows<T>(self) -> CircularTupleWindows<Self, T> ⓘ
    where +a specific size (up to 12). Read more

    source§

    fn circular_tuple_windows<T>(self) -> CircularTupleWindows<Self, T> ⓘ
    where Self: Sized + Clone + Iterator<Item = T::Item> + ExactSizeIterator, T: TupleCollect + Clone, T::Item: Clone,

    Return an iterator over all windows, wrapping back to the first elements when the window would otherwise exceed the length of the -iterator, producing tuples of a specific size (up to 12). Read more
    source§

    fn tuples<T>(self) -> Tuples<Self, T> ⓘ
    where +iterator, producing tuples of a specific size (up to 12). Read more

    source§

    fn tuples<T>(self) -> Tuples<Self, T> ⓘ
    where Self: Sized + Iterator<Item = T::Item>, T: HomogeneousTuple,

    Return an iterator that groups the items in tuples of a specific size -(up to 12). Read more
    source§

    fn tee(self) -> (Tee<Self>, Tee<Self>)
    where +(up to 12). Read more

    source§

    fn tee(self) -> (Tee<Self>, Tee<Self>)
    where Self: Sized, Self::Item: Clone,

    Split into an iterator pair that both yield all elements from -the original iterator. Read more
    source§

    fn step(self, n: usize) -> Step<Self> ⓘ
    where - Self: Sized,

    👎Deprecated since 0.8.0: Use std .step_by() instead
    Return an iterator adaptor that steps n elements in the base iterator -for each iteration. Read more
    source§

    fn map_into<R>(self) -> MapInto<Self, R>
    where +the original iterator. Read more

    source§

    fn map_into<R>(self) -> MapInto<Self, R>
    where Self: Sized, - Self::Item: Into<R>,

    Convert each item of the iterator using the Into trait. Read more
    source§

    fn map_results<F, T, U, E>(self, f: F) -> MapOk<Self, F>
    where - Self: Iterator<Item = Result<T, E>> + Sized, - F: FnMut(T) -> U,

    👎Deprecated since 0.10.0: Use .map_ok() instead
    See .map_ok().
    source§

    fn map_ok<F, T, U, E>(self, f: F) -> MapOk<Self, F>
    where + Self::Item: Into<R>,

    Convert each item of the iterator using the Into trait. Read more
    source§

    fn map_ok<F, T, U, E>(self, f: F) -> MapOk<Self, F>
    where Self: Iterator<Item = Result<T, E>> + Sized, F: FnMut(T) -> U,

    Return an iterator adaptor that applies the provided closure to every Result::Ok value. Result::Err values are -unchanged. Read more
    source§

    fn filter_ok<F, T, E>(self, f: F) -> FilterOk<Self, F> ⓘ
    where +unchanged. Read more

    source§

    fn filter_ok<F, T, E>(self, f: F) -> FilterOk<Self, F> ⓘ
    where Self: Iterator<Item = Result<T, E>> + Sized, F: FnMut(&T) -> bool,

    Return an iterator adaptor that filters every Result::Ok value with the provided closure. Result::Err values are -unchanged. Read more
    source§

    fn filter_map_ok<F, T, U, E>(self, f: F) -> FilterMapOk<Self, F> ⓘ
    where +unchanged. Read more

    source§

    fn filter_map_ok<F, T, U, E>(self, f: F) -> FilterMapOk<Self, F> ⓘ
    where Self: Iterator<Item = Result<T, E>> + Sized, F: FnMut(T) -> Option<U>,

    Return an iterator adaptor that filters and transforms every Result::Ok value with the provided closure. Result::Err -values are unchanged. Read more
    source§

    fn flatten_ok<T, E>(self) -> FlattenOk<Self, T, E> ⓘ
    where +values are unchanged. Read more

    source§

    fn flatten_ok<T, E>(self) -> FlattenOk<Self, T, E> ⓘ
    where Self: Iterator<Item = Result<T, E>> + Sized, T: IntoIterator,

    Return an iterator adaptor that flattens every Result::Ok value into -a series of Result::Ok values. Result::Err values are unchanged. Read more
    source§

    fn process_results<F, T, E, R>(self, processor: F) -> Result<R, E>
    where +a series of Result::Ok values. Result::Err values are unchanged. Read more

    source§

    fn process_results<F, T, E, R>(self, processor: F) -> Result<R, E>
    where Self: Iterator<Item = Result<T, E>> + Sized, F: FnOnce(ProcessResults<'_, Self, E>) -> R,

    “Lift” a function of the values of the current iterator so as to process -an iterator of Result values instead. Read more
    source§

    fn merge<J>(self, other: J) -> Merge<Self, J::IntoIter>
    where +an iterator of Result values instead. Read more

    source§

    fn merge<J>(self, other: J) -> Merge<Self, J::IntoIter>
    where Self: Sized, Self::Item: PartialOrd, J: IntoIterator<Item = Self::Item>,

    Return an iterator adaptor that merges the two base iterators in ascending order. If both base iterators are sorted (ascending), the -result is sorted. Read more
    source§

    fn merge_by<J, F>(self, other: J, is_first: F) -> MergeBy<Self, J::IntoIter, F> ⓘ
    where +result is sorted. Read more

    source§

    fn merge_by<J, F>(self, other: J, is_first: F) -> MergeBy<Self, J::IntoIter, F> ⓘ
    where Self: Sized, J: IntoIterator<Item = Self::Item>, F: FnMut(&Self::Item, &Self::Item) -> bool,

    Return an iterator adaptor that merges the two base iterators in order. -This is much like .merge() but allows for a custom ordering. Read more
    source§

    fn merge_join_by<J, F, T>( +This is much like .merge() but allows for a custom ordering. Read more

    source§

    fn merge_join_by<J, F, T>( self, other: J, cmp_fn: F @@ -315,284 +316,295 @@ This is much like IntoIterator, F: FnMut(&Self::Item, &J::Item) -> T, Self: Sized,

    Create an iterator that merges items from both this and the specified -iterator in ascending order. Read more
    source§

    fn kmerge(self) -> KMerge<<Self::Item as IntoIterator>::IntoIter>
    where +iterator in ascending order. Read more

    source§

    fn kmerge(self) -> KMerge<<Self::Item as IntoIterator>::IntoIter>
    where Self: Sized, Self::Item: IntoIterator, <Self::Item as IntoIterator>::Item: PartialOrd,

    Return an iterator adaptor that flattens an iterator of iterators by -merging them in ascending order. Read more
    source§

    fn kmerge_by<F>( +merging them in ascending order. Read more

    source§

    fn kmerge_by<F>( self, first: F ) -> KMergeBy<<Self::Item as IntoIterator>::IntoIter, F> ⓘ
    where Self: Sized, Self::Item: IntoIterator, F: FnMut(&<Self::Item as IntoIterator>::Item, &<Self::Item as IntoIterator>::Item) -> bool,

    Return an iterator adaptor that flattens an iterator of iterators by -merging them according to the given closure. Read more
    source§

    fn cartesian_product<J>(self, other: J) -> Product<Self, J::IntoIter> ⓘ
    where +merging them according to the given closure. Read more

    source§

    fn cartesian_product<J>(self, other: J) -> Product<Self, J::IntoIter> ⓘ
    where Self: Sized, Self::Item: Clone, J: IntoIterator, J::IntoIter: Clone,

    Return an iterator adaptor that iterates over the cartesian product of -the element sets of two iterators self and J. Read more
    source§

    fn multi_cartesian_product( +the element sets of two iterators self and J. Read more

    source§

    fn multi_cartesian_product( self ) -> MultiProduct<<Self::Item as IntoIterator>::IntoIter> ⓘ
    where Self: Sized, Self::Item: IntoIterator, <Self::Item as IntoIterator>::IntoIter: Clone, <Self::Item as IntoIterator>::Item: Clone,

    Return an iterator adaptor that iterates over the cartesian product of -all subiterators returned by meta-iterator self. Read more
    source§

    fn coalesce<F>(self, f: F) -> Coalesce<Self, F>
    where +all subiterators returned by meta-iterator self. Read more

    source§

    fn coalesce<F>(self, f: F) -> Coalesce<Self, F>
    where Self: Sized, F: FnMut(Self::Item, Self::Item) -> Result<Self::Item, (Self::Item, Self::Item)>,

    Return an iterator adaptor that uses the passed-in closure to -optionally merge together consecutive elements. Read more
    source§

    fn dedup(self) -> Dedup<Self>
    where +optionally merge together consecutive elements. Read more

    source§

    fn dedup(self) -> Dedup<Self>
    where Self: Sized, Self::Item: PartialEq,

    Remove duplicates from sections of consecutive identical elements. -If the iterator is sorted, all elements will be unique. Read more
    source§

    fn dedup_by<Cmp>(self, cmp: Cmp) -> DedupBy<Self, Cmp>
    where +If the iterator is sorted, all elements will be unique. Read more

    source§

    fn dedup_by<Cmp>(self, cmp: Cmp) -> DedupBy<Self, Cmp>
    where Self: Sized, Cmp: FnMut(&Self::Item, &Self::Item) -> bool,

    Remove duplicates from sections of consecutive identical elements, determining equality using a comparison function. -If the iterator is sorted, all elements will be unique. Read more
    source§

    fn dedup_with_count(self) -> DedupWithCount<Self>
    where +If the iterator is sorted, all elements will be unique. Read more

    source§

    fn dedup_with_count(self) -> DedupWithCount<Self>
    where Self: Sized,

    Remove duplicates from sections of consecutive identical elements, while keeping a count of how many repeated elements were present. -If the iterator is sorted, all elements will be unique. Read more
    source§

    fn dedup_by_with_count<Cmp>(self, cmp: Cmp) -> DedupByWithCount<Self, Cmp>
    where +If the iterator is sorted, all elements will be unique. Read more

    source§

    fn dedup_by_with_count<Cmp>(self, cmp: Cmp) -> DedupByWithCount<Self, Cmp>
    where Self: Sized, Cmp: FnMut(&Self::Item, &Self::Item) -> bool,

    Remove duplicates from sections of consecutive identical elements, while keeping a count of how many repeated elements were present. This will determine equality using a comparison function. -If the iterator is sorted, all elements will be unique. Read more
    source§

    fn duplicates(self) -> Duplicates<Self>
    where +If the iterator is sorted, all elements will be unique. Read more

    source§

    fn duplicates(self) -> Duplicates<Self>
    where Self: Sized, Self::Item: Eq + Hash,

    Return an iterator adaptor that produces elements that appear more than once during the -iteration. Duplicates are detected using hash and equality. Read more
    source§

    fn duplicates_by<V, F>(self, f: F) -> DuplicatesBy<Self, V, F>
    where +iteration. Duplicates are detected using hash and equality. Read more

    source§

    fn duplicates_by<V, F>(self, f: F) -> DuplicatesBy<Self, V, F>
    where Self: Sized, V: Eq + Hash, F: FnMut(&Self::Item) -> V,

    Return an iterator adaptor that produces elements that appear more than once during the -iteration. Duplicates are detected using hash and equality. Read more
    source§

    fn unique(self) -> Unique<Self> ⓘ
    where +iteration. Duplicates are detected using hash and equality. Read more

    source§

    fn unique(self) -> Unique<Self> ⓘ
    where Self: Sized, Self::Item: Clone + Eq + Hash,

    Return an iterator adaptor that filters out elements that have already been produced once during the iteration. Duplicates -are detected using hash and equality. Read more
    source§

    fn unique_by<V, F>(self, f: F) -> UniqueBy<Self, V, F> ⓘ
    where +are detected using hash and equality. Read more

    source§

    fn unique_by<V, F>(self, f: F) -> UniqueBy<Self, V, F> ⓘ
    where Self: Sized, V: Eq + Hash, F: FnMut(&Self::Item) -> V,

    Return an iterator adaptor that filters out elements that have -already been produced once during the iteration. Read more
    source§

    fn peeking_take_while<F>(&mut self, accept: F) -> PeekingTakeWhile<'_, Self, F> ⓘ
    where +already been produced once during the iteration. Read more

    source§

    fn peeking_take_while<F>(&mut self, accept: F) -> PeekingTakeWhile<'_, Self, F> ⓘ
    where Self: Sized + PeekingNext, F: FnMut(&Self::Item) -> bool,

    Return an iterator adaptor that borrows from this iterator and -takes items while the closure accept returns true. Read more
    source§

    fn take_while_ref<F>(&mut self, accept: F) -> TakeWhileRef<'_, Self, F> ⓘ
    where +takes items while the closure accept returns true. Read more

    source§

    fn take_while_ref<F>(&mut self, accept: F) -> TakeWhileRef<'_, Self, F> ⓘ
    where Self: Clone, F: FnMut(&Self::Item) -> bool,

    Return an iterator adaptor that borrows from a Clone-able iterator -to only pick off elements while the predicate accept returns true. Read more
    source§

    fn take_while_inclusive<F>(self, accept: F) -> TakeWhileInclusive<Self, F> ⓘ
    where +to only pick off elements while the predicate accept returns true. Read more

    source§

    fn take_while_inclusive<F>(self, accept: F) -> TakeWhileInclusive<Self, F> ⓘ
    where Self: Sized, F: FnMut(&Self::Item) -> bool,

    Returns an iterator adaptor that consumes elements while the given predicate is true, including the element for which the predicate -first returned false. Read more
    source§

    fn while_some<A>(self) -> WhileSome<Self> ⓘ
    where +first returned false. Read more

    source§

    fn while_some<A>(self) -> WhileSome<Self> ⓘ
    where Self: Sized + Iterator<Item = Option<A>>,

    Return an iterator adaptor that filters Option<A> iterator elements -and produces A. Stops on the first None encountered. Read more
    source§

    fn tuple_combinations<T>(self) -> TupleCombinations<Self, T> ⓘ
    where +and produces A. Stops on the first None encountered. Read more

    source§

    fn tuple_combinations<T>(self) -> TupleCombinations<Self, T> ⓘ
    where Self: Sized + Clone, Self::Item: Clone, T: HasCombination<Self>,

    Return an iterator adaptor that iterates over the combinations of the -elements from an iterator. Read more
    source§

    fn combinations(self, k: usize) -> Combinations<Self> ⓘ
    where +elements from an iterator. Read more

    source§

    fn combinations(self, k: usize) -> Combinations<Self> ⓘ
    where Self: Sized, Self::Item: Clone,

    Return an iterator adaptor that iterates over the k-length combinations of -the elements from an iterator. Read more
    source§

    fn combinations_with_replacement( +the elements from an iterator. Read more

    source§

    fn combinations_with_replacement( self, k: usize ) -> CombinationsWithReplacement<Self> ⓘ
    where Self: Sized, Self::Item: Clone,

    Return an iterator that iterates over the k-length combinations of -the elements from an iterator, with replacement. Read more
    source§

    fn permutations(self, k: usize) -> Permutations<Self> ⓘ
    where +the elements from an iterator, with replacement. Read more

    source§

    fn permutations(self, k: usize) -> Permutations<Self> ⓘ
    where Self: Sized, Self::Item: Clone,

    Return an iterator adaptor that iterates over all k-permutations of the -elements from an iterator. Read more
    source§

    fn powerset(self) -> Powerset<Self> ⓘ
    where +elements from an iterator. Read more

    source§

    fn powerset(self) -> Powerset<Self> ⓘ
    where Self: Sized, Self::Item: Clone,

    Return an iterator that iterates through the powerset of the elements from an -iterator. Read more
    source§

    fn pad_using<F>(self, min: usize, f: F) -> PadUsing<Self, F> ⓘ
    where +iterator. Read more

    source§

    fn pad_using<F>(self, min: usize, f: F) -> PadUsing<Self, F> ⓘ
    where Self: Sized, F: FnMut(usize) -> Self::Item,

    Return an iterator adaptor that pads the sequence to a minimum length of -min by filling missing elements using a closure f. Read more
    source§

    fn with_position(self) -> WithPosition<Self> ⓘ
    where +min by filling missing elements using a closure f. Read more

    source§

    fn with_position(self) -> WithPosition<Self> ⓘ
    where Self: Sized,

    Return an iterator adaptor that combines each element with a Position to -ease special-case handling of the first or last elements. Read more
    source§

    fn positions<P>(self, predicate: P) -> Positions<Self, P> ⓘ
    where +ease special-case handling of the first or last elements. Read more

    source§

    fn positions<P>(self, predicate: P) -> Positions<Self, P> ⓘ
    where Self: Sized, P: FnMut(Self::Item) -> bool,

    Return an iterator adaptor that yields the indices of all elements -satisfying a predicate, counted from the start of the iterator. Read more
    source§

    fn update<F>(self, updater: F) -> Update<Self, F> ⓘ
    where +satisfying a predicate, counted from the start of the iterator. Read more

    source§

    fn update<F>(self, updater: F) -> Update<Self, F> ⓘ
    where Self: Sized, F: FnMut(&mut Self::Item),

    Return an iterator adaptor that applies a mutating function -to each element before yielding it. Read more
    source§

    fn next_tuple<T>(&mut self) -> Option<T>
    where +to each element before yielding it. Read more

    source§

    fn next_tuple<T>(&mut self) -> Option<T>
    where Self: Sized + Iterator<Item = T::Item>, T: HomogeneousTuple,

    Advances the iterator and returns the next items grouped in a tuple of -a specific size (up to 12). Read more
    source§

    fn collect_tuple<T>(self) -> Option<T>
    where +a specific size (up to 12). Read more

    source§

    fn collect_tuple<T>(self) -> Option<T>
    where Self: Sized + Iterator<Item = T::Item>, T: HomogeneousTuple,

    Collects all items from the iterator into a tuple of a specific size -(up to 12). Read more
    source§

    fn find_position<P>(&mut self, pred: P) -> Option<(usize, Self::Item)>
    where - P: FnMut(&Self::Item) -> bool,

    Find the position and value of the first element satisfying a predicate. Read more
    source§

    fn find_or_last<P>(self, predicate: P) -> Option<Self::Item>
    where +(up to 12). Read more

    source§

    fn find_position<P>(&mut self, pred: P) -> Option<(usize, Self::Item)>
    where + P: FnMut(&Self::Item) -> bool,

    Find the position and value of the first element satisfying a predicate. Read more
    source§

    fn find_or_last<P>(self, predicate: P) -> Option<Self::Item>
    where Self: Sized, - P: FnMut(&Self::Item) -> bool,

    Find the value of the first element satisfying a predicate or return the last element, if any. Read more
    source§

    fn find_or_first<P>(self, predicate: P) -> Option<Self::Item>
    where + P: FnMut(&Self::Item) -> bool,

    Find the value of the first element satisfying a predicate or return the last element, if any. Read more
    source§

    fn find_or_first<P>(self, predicate: P) -> Option<Self::Item>
    where Self: Sized, - P: FnMut(&Self::Item) -> bool,

    Find the value of the first element satisfying a predicate or return the first element, if any. Read more
    source§

    fn contains<Q>(&mut self, query: &Q) -> bool
    where + P: FnMut(&Self::Item) -> bool,

    Find the value of the first element satisfying a predicate or return the first element, if any. Read more
    source§

    fn contains<Q>(&mut self, query: &Q) -> bool
    where Self: Sized, Self::Item: Borrow<Q>, - Q: PartialEq,

    Returns true if the given item is present in this iterator. Read more
    source§

    fn all_equal(&mut self) -> bool
    where + Q: PartialEq,

    Returns true if the given item is present in this iterator. Read more
    source§

    fn all_equal(&mut self) -> bool
    where Self: Sized, - Self::Item: PartialEq,

    Check whether all elements compare equal. Read more
    source§

    fn all_equal_value( + Self::Item: PartialEq,

    Check whether all elements compare equal. Read more
    source§

    fn all_equal_value( &mut self ) -> Result<Self::Item, Option<(Self::Item, Self::Item)>>
    where Self: Sized, Self::Item: PartialEq,

    If there are elements and they are all equal, return a single copy of that element. If there are no elements, return an Error containing None. If there are elements and they are not all equal, return a tuple containing the first -two non-equal elements found. Read more
    source§

    fn all_unique(&mut self) -> bool
    where +two non-equal elements found. Read more

    source§

    fn all_unique(&mut self) -> bool
    where Self: Sized, - Self::Item: Eq + Hash,

    Check whether all elements are unique (non equal). Read more
    source§

    fn dropping(self, n: usize) -> Self
    where + Self::Item: Eq + Hash,

    Check whether all elements are unique (non equal). Read more
    source§

    fn dropping(self, n: usize) -> Self
    where Self: Sized,

    Consume the first n elements from the iterator eagerly, -and return the same iterator again. Read more
    source§

    fn dropping_back(self, n: usize) -> Self
    where +and return the same iterator again. Read more

    source§

    fn dropping_back(self, n: usize) -> Self
    where Self: Sized + DoubleEndedIterator,

    Consume the last n elements from the iterator eagerly, -and return the same iterator again. Read more
    source§

    fn foreach<F>(self, f: F)
    where - F: FnMut(Self::Item), - Self: Sized,

    👎Deprecated since 0.8.0: Use .for_each() instead
    Run the closure f eagerly on each element of the iterator. Read more
    source§

    fn concat(self) -> Self::Item
    where +and return the same iterator again. Read more

    source§

    fn concat(self) -> Self::Item
    where Self: Sized, - Self::Item: Extend<<<Self as Iterator>::Item as IntoIterator>::Item> + IntoIterator + Default,

    Combine all an iterator’s elements into one element by using Extend. Read more
    source§

    fn collect_vec(self) -> Vec<Self::Item>
    where + Self::Item: Extend<<<Self as Iterator>::Item as IntoIterator>::Item> + IntoIterator + Default,

    Combine all an iterator’s elements into one element by using Extend. Read more
    source§

    fn collect_vec(self) -> Vec<Self::Item>
    where Self: Sized,

    .collect_vec() is simply a type specialization of Iterator::collect, -for convenience.
    source§

    fn try_collect<T, U, E>(self) -> Result<U, E>
    where +for convenience.

    source§

    fn try_collect<T, U, E>(self) -> Result<U, E>
    where Self: Sized + Iterator<Item = Result<T, E>>, Result<U, E>: FromIterator<Result<T, E>>,

    .try_collect() is more convenient way of writing -.collect::<Result<_, _>>() Read more
    source§

    fn set_from<'a, A: 'a, J>(&mut self, from: J) -> usize
    where +.collect::<Result<_, _>>() Read more

    source§

    fn set_from<'a, A: 'a, J>(&mut self, from: J) -> usize
    where Self: Iterator<Item = &'a mut A>, J: IntoIterator<Item = A>,

    Assign to each reference in self from the from iterator, -stopping at the shortest of the two iterators. Read more
    source§

    fn join(&mut self, sep: &str) -> String
    where - Self::Item: Display,

    Combine all iterator elements into one String, separated by sep. Read more
    source§

    fn format(self, sep: &str) -> Format<'_, Self>
    where - Self: Sized,

    Format all iterator elements, separated by sep. Read more
    source§

    fn format_with<F>(self, sep: &str, format: F) -> FormatWith<'_, Self, F>
    where +stopping at the shortest of the two iterators. Read more

    source§

    fn join(&mut self, sep: &str) -> String
    where + Self::Item: Display,

    Combine all iterator elements into one String, separated by sep. Read more
    source§

    fn format(self, sep: &str) -> Format<'_, Self>
    where + Self: Sized,

    Format all iterator elements, separated by sep. Read more
    source§

    fn format_with<F>(self, sep: &str, format: F) -> FormatWith<'_, Self, F>
    where Self: Sized, - F: FnMut(Self::Item, &mut dyn FnMut(&dyn Display) -> Result) -> Result,

    Format all iterator elements, separated by sep. Read more
    source§

    fn fold_results<A, E, B, F>(&mut self, start: B, f: F) -> Result<B, E>
    where + F: FnMut(Self::Item, &mut dyn FnMut(&dyn Display) -> Result) -> Result,

    Format all iterator elements, separated by sep. Read more
    source§

    fn fold_ok<A, E, B, F>(&mut self, start: B, f: F) -> Result<B, E>
    where Self: Iterator<Item = Result<A, E>>, - F: FnMut(B, A) -> B,

    👎Deprecated since 0.10.0: Use .fold_ok() instead
    See .fold_ok().
    source§

    fn fold_ok<A, E, B, F>(&mut self, start: B, f: F) -> Result<B, E>
    where - Self: Iterator<Item = Result<A, E>>, - F: FnMut(B, A) -> B,

    Fold Result values from an iterator. Read more
    source§

    fn fold_options<A, B, F>(&mut self, start: B, f: F) -> Option<B>
    where + F: FnMut(B, A) -> B,

    Fold Result values from an iterator. Read more
    source§

    fn fold_options<A, B, F>(&mut self, start: B, f: F) -> Option<B>
    where Self: Iterator<Item = Option<A>>, - F: FnMut(B, A) -> B,

    Fold Option values from an iterator. Read more
    source§

    fn fold1<F>(self, f: F) -> Option<Self::Item>
    where + F: FnMut(B, A) -> B,

    Fold Option values from an iterator. Read more
    source§

    fn fold1<F>(self, f: F) -> Option<Self::Item>
    where F: FnMut(Self::Item, Self::Item) -> Self::Item, - Self: Sized,

    👎Deprecated since 0.10.2: Use Iterator::reduce instead
    Accumulator of the elements in the iterator. Read more
    source§

    fn tree_fold1<F>(self, f: F) -> Option<Self::Item>
    where + Self: Sized,

    👎Deprecated since 0.10.2: Use Iterator::reduce instead
    Accumulator of the elements in the iterator. Read more
    source§

    fn tree_reduce<F>(self, f: F) -> Option<Self::Item>
    where F: FnMut(Self::Item, Self::Item) -> Self::Item, - Self: Sized,

    Accumulate the elements in the iterator in a tree-like manner. Read more
    source§

    fn fold_while<B, F>(&mut self, init: B, f: F) -> FoldWhile<B>
    where + Self: Sized,

    Accumulate the elements in the iterator in a tree-like manner. Read more
    source§

    fn tree_fold1<F>(self, f: F) -> Option<Self::Item>
    where + F: FnMut(Self::Item, Self::Item) -> Self::Item, + Self: Sized,

    👎Deprecated since 0.13.0: Use .tree_reduce() instead
    See .tree_reduce().
    source§

    fn fold_while<B, F>(&mut self, init: B, f: F) -> FoldWhile<B>
    where Self: Sized, - F: FnMut(B, Self::Item) -> FoldWhile<B>,

    An iterator method that applies a function, producing a single, final value. Read more
    source§

    fn sum1<S>(self) -> Option<S>
    where + F: FnMut(B, Self::Item) -> FoldWhile<B>,

    An iterator method that applies a function, producing a single, final value. Read more
    source§

    fn sum1<S>(self) -> Option<S>
    where Self: Sized, - S: Sum<Self::Item>,

    Iterate over the entire iterator and add all the elements. Read more
    source§

    fn product1<P>(self) -> Option<P>
    where + S: Sum<Self::Item>,

    Iterate over the entire iterator and add all the elements. Read more
    source§

    fn product1<P>(self) -> Option<P>
    where Self: Sized, - P: Product<Self::Item>,

    Iterate over the entire iterator and multiply all the elements. Read more
    source§

    fn sorted_unstable(self) -> IntoIter<Self::Item> ⓘ
    where + P: Product<Self::Item>,

    Iterate over the entire iterator and multiply all the elements. Read more
    source§

    fn sorted_unstable(self) -> IntoIter<Self::Item> ⓘ
    where Self: Sized, - Self::Item: Ord,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_unstable_by<F>(self, cmp: F) -> IntoIter<Self::Item> ⓘ
    where + Self::Item: Ord,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_unstable_by<F>(self, cmp: F) -> IntoIter<Self::Item> ⓘ
    where Self: Sized, - F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_unstable_by_key<K, F>(self, f: F) -> IntoIter<Self::Item> ⓘ
    where + F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_unstable_by_key<K, F>(self, f: F) -> IntoIter<Self::Item> ⓘ
    where Self: Sized, K: Ord, - F: FnMut(&Self::Item) -> K,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted(self) -> IntoIter<Self::Item> ⓘ
    where + F: FnMut(&Self::Item) -> K,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted(self) -> IntoIter<Self::Item> ⓘ
    where Self: Sized, - Self::Item: Ord,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_by<F>(self, cmp: F) -> IntoIter<Self::Item> ⓘ
    where + Self::Item: Ord,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_by<F>(self, cmp: F) -> IntoIter<Self::Item> ⓘ
    where Self: Sized, - F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_by_key<K, F>(self, f: F) -> IntoIter<Self::Item> ⓘ
    where + F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_by_key<K, F>(self, f: F) -> IntoIter<Self::Item> ⓘ
    where Self: Sized, K: Ord, - F: FnMut(&Self::Item) -> K,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_by_cached_key<K, F>(self, f: F) -> IntoIter<Self::Item> ⓘ
    where + F: FnMut(&Self::Item) -> K,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_by_cached_key<K, F>(self, f: F) -> IntoIter<Self::Item> ⓘ
    where Self: Sized, K: Ord, F: FnMut(&Self::Item) -> K,

    Sort all iterator elements into a new iterator in ascending order. The key function is -called exactly once per key. Read more
    source§

    fn k_smallest(self, k: usize) -> IntoIter<Self::Item> ⓘ
    where +called exactly once per key. Read more

    source§

    fn k_smallest(self, k: usize) -> IntoIter<Self::Item> ⓘ
    where Self: Sized, - Self::Item: Ord,

    Sort the k smallest elements into a new iterator, in ascending order. Read more
    source§

    fn partition_map<A, B, F, L, R>(self, predicate: F) -> (A, B)
    where + Self::Item: Ord,

    Sort the k smallest elements into a new iterator, in ascending order. Read more
    source§

    fn k_smallest_by<F>(self, k: usize, cmp: F) -> IntoIter<Self::Item> ⓘ
    where + Self: Sized, + F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Sort the k smallest elements into a new iterator using the provided comparison. Read more
    source§

    fn k_smallest_by_key<F, K>(self, k: usize, key: F) -> IntoIter<Self::Item> ⓘ
    where + Self: Sized, + F: FnMut(&Self::Item) -> K, + K: Ord,

    Return the elements producing the k smallest outputs of the provided function. Read more
    source§

    fn k_largest(self, k: usize) -> IntoIter<Self::Item> ⓘ
    where + Self: Sized, + Self::Item: Ord,

    Sort the k largest elements into a new iterator, in descending order. Read more
    source§

    fn k_largest_by<F>(self, k: usize, cmp: F) -> IntoIter<Self::Item> ⓘ
    where + Self: Sized, + F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Sort the k largest elements into a new iterator using the provided comparison. Read more
    source§

    fn k_largest_by_key<F, K>(self, k: usize, key: F) -> IntoIter<Self::Item> ⓘ
    where + Self: Sized, + F: FnMut(&Self::Item) -> K, + K: Ord,

    Return the elements producing the k largest outputs of the provided function. Read more
    source§

    fn tail(self, n: usize) -> IntoIter<Self::Item> ⓘ
    where + Self: Sized,

    Consumes the iterator and return an iterator of the last n elements. Read more
    source§

    fn partition_map<A, B, F, L, R>(self, predicate: F) -> (A, B)
    where Self: Sized, F: FnMut(Self::Item) -> Either<L, R>, A: Default + Extend<L>, B: Default + Extend<R>,

    Collect all iterator elements into one of two partitions. Unlike Iterator::partition, each partition may -have a distinct type. Read more
    source§

    fn partition_result<A, B, T, E>(self) -> (A, B)
    where +have a distinct type. Read more

    source§

    fn partition_result<A, B, T, E>(self) -> (A, B)
    where Self: Iterator<Item = Result<T, E>> + Sized, A: Default + Extend<T>, B: Default + Extend<E>,

    Partition a sequence of Results into one list of all the Ok elements -and another list of all the Err elements. Read more
    source§

    fn into_group_map<K, V>(self) -> HashMap<K, Vec<V>>
    where +and another list of all the Err elements. Read more

    source§

    fn into_group_map<K, V>(self) -> HashMap<K, Vec<V>>
    where Self: Iterator<Item = (K, V)> + Sized, K: Hash + Eq,

    Return a HashMap of keys mapped to Vecs of values. Keys and values -are taken from (Key, Value) tuple pairs yielded by the input iterator. Read more
    source§

    fn into_group_map_by<K, V, F>(self, f: F) -> HashMap<K, Vec<V>>
    where +are taken from (Key, Value) tuple pairs yielded by the input iterator. Read more

    source§

    fn into_group_map_by<K, V, F>(self, f: F) -> HashMap<K, Vec<V>>
    where Self: Iterator<Item = V> + Sized, K: Hash + Eq, - F: Fn(&V) -> K,

    Return an Iterator on a HashMap. Keys mapped to Vecs of values. The key is specified -in the closure. Read more
    source§

    fn into_grouping_map<K, V>(self) -> GroupingMap<Self>
    where + F: FnMut(&V) -> K,

    Return an Iterator on a HashMap. Keys mapped to Vecs of values. The key is specified +in the closure. Read more
    source§

    fn into_grouping_map<K, V>(self) -> GroupingMap<Self>
    where Self: Iterator<Item = (K, V)> + Sized, K: Hash + Eq,

    Constructs a GroupingMap to be used later with one of the efficient -group-and-fold operations it allows to perform. Read more
    source§

    fn into_grouping_map_by<K, V, F>(self, key_mapper: F) -> GroupingMapBy<Self, F>
    where +group-and-fold operations it allows to perform. Read more

    source§

    fn into_grouping_map_by<K, V, F>(self, key_mapper: F) -> GroupingMapBy<Self, F>
    where Self: Iterator<Item = V> + Sized, K: Hash + Eq, F: FnMut(&V) -> K,

    Constructs a GroupingMap to be used later with one of the efficient -group-and-fold operations it allows to perform. Read more
    source§

    fn min_set(self) -> Vec<Self::Item>
    where +group-and-fold operations it allows to perform. Read more

    source§

    fn min_set(self) -> Vec<Self::Item>
    where Self: Sized, - Self::Item: Ord,

    Return all minimum elements of an iterator. Read more
    source§

    fn min_set_by<F>(self, compare: F) -> Vec<Self::Item>
    where + Self::Item: Ord,

    Return all minimum elements of an iterator. Read more
    source§

    fn min_set_by<F>(self, compare: F) -> Vec<Self::Item>
    where Self: Sized, F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Return all minimum elements of an iterator, as determined by -the specified function. Read more
    source§

    fn min_set_by_key<K, F>(self, key: F) -> Vec<Self::Item>
    where +the specified function. Read more

    source§

    fn min_set_by_key<K, F>(self, key: F) -> Vec<Self::Item>
    where Self: Sized, K: Ord, F: FnMut(&Self::Item) -> K,

    Return all minimum elements of an iterator, as determined by -the specified function. Read more
    source§

    fn max_set(self) -> Vec<Self::Item>
    where +the specified function. Read more

    source§

    fn max_set(self) -> Vec<Self::Item>
    where Self: Sized, - Self::Item: Ord,

    Return all maximum elements of an iterator. Read more
    source§

    fn max_set_by<F>(self, compare: F) -> Vec<Self::Item>
    where + Self::Item: Ord,

    Return all maximum elements of an iterator. Read more
    source§

    fn max_set_by<F>(self, compare: F) -> Vec<Self::Item>
    where Self: Sized, F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Return all maximum elements of an iterator, as determined by -the specified function. Read more
    source§

    fn max_set_by_key<K, F>(self, key: F) -> Vec<Self::Item>
    where +the specified function. Read more

    source§

    fn max_set_by_key<K, F>(self, key: F) -> Vec<Self::Item>
    where Self: Sized, K: Ord, F: FnMut(&Self::Item) -> K,

    Return all maximum elements of an iterator, as determined by -the specified function. Read more
    source§

    fn minmax(self) -> MinMaxResult<Self::Item>
    where +the specified function. Read more

    source§

    fn minmax(self) -> MinMaxResult<Self::Item>
    where Self: Sized, - Self::Item: PartialOrd,

    Return the minimum and maximum elements in the iterator. Read more
    source§

    fn minmax_by_key<K, F>(self, key: F) -> MinMaxResult<Self::Item>
    where + Self::Item: PartialOrd,

    Return the minimum and maximum elements in the iterator. Read more
    source§

    fn minmax_by_key<K, F>(self, key: F) -> MinMaxResult<Self::Item>
    where Self: Sized, K: PartialOrd, F: FnMut(&Self::Item) -> K,

    Return the minimum and maximum element of an iterator, as determined by -the specified function. Read more
    source§

    fn minmax_by<F>(self, compare: F) -> MinMaxResult<Self::Item>
    where +the specified function. Read more

    source§

    fn minmax_by<F>(self, compare: F) -> MinMaxResult<Self::Item>
    where Self: Sized, F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Return the minimum and maximum element of an iterator, as determined by -the specified comparison function. Read more
    source§

    fn position_max(self) -> Option<usize>
    where +the specified comparison function. Read more

    source§

    fn position_max(self) -> Option<usize>
    where Self: Sized, - Self::Item: Ord,

    Return the position of the maximum element in the iterator. Read more
    source§

    fn position_max_by_key<K, F>(self, key: F) -> Option<usize>
    where + Self::Item: Ord,

    Return the position of the maximum element in the iterator. Read more
    source§

    fn position_max_by_key<K, F>(self, key: F) -> Option<usize>
    where Self: Sized, K: Ord, F: FnMut(&Self::Item) -> K,

    Return the position of the maximum element in the iterator, as -determined by the specified function. Read more
    source§

    fn position_max_by<F>(self, compare: F) -> Option<usize>
    where +determined by the specified function. Read more

    source§

    fn position_max_by<F>(self, compare: F) -> Option<usize>
    where Self: Sized, F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Return the position of the maximum element in the iterator, as -determined by the specified comparison function. Read more
    source§

    fn position_min(self) -> Option<usize>
    where +determined by the specified comparison function. Read more

    source§

    fn position_min(self) -> Option<usize>
    where Self: Sized, - Self::Item: Ord,

    Return the position of the minimum element in the iterator. Read more
    source§

    fn position_min_by_key<K, F>(self, key: F) -> Option<usize>
    where + Self::Item: Ord,

    Return the position of the minimum element in the iterator. Read more
    source§

    fn position_min_by_key<K, F>(self, key: F) -> Option<usize>
    where Self: Sized, K: Ord, F: FnMut(&Self::Item) -> K,

    Return the position of the minimum element in the iterator, as -determined by the specified function. Read more
    source§

    fn position_min_by<F>(self, compare: F) -> Option<usize>
    where +determined by the specified function. Read more

    source§

    fn position_min_by<F>(self, compare: F) -> Option<usize>
    where Self: Sized, F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Return the position of the minimum element in the iterator, as -determined by the specified comparison function. Read more
    source§

    fn position_minmax(self) -> MinMaxResult<usize>
    where +determined by the specified comparison function. Read more

    source§

    fn position_minmax(self) -> MinMaxResult<usize>
    where Self: Sized, Self::Item: PartialOrd,

    Return the positions of the minimum and maximum elements in -the iterator. Read more
    source§

    fn position_minmax_by_key<K, F>(self, key: F) -> MinMaxResult<usize>
    where +the iterator. Read more

    source§

    fn position_minmax_by_key<K, F>(self, key: F) -> MinMaxResult<usize>
    where Self: Sized, K: PartialOrd, F: FnMut(&Self::Item) -> K,

    Return the postions of the minimum and maximum elements of an -iterator, as determined by the specified function. Read more
    source§

    fn position_minmax_by<F>(self, compare: F) -> MinMaxResult<usize>
    where +iterator, as determined by the specified function. Read more

    source§

    fn position_minmax_by<F>(self, compare: F) -> MinMaxResult<usize>
    where Self: Sized, F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Return the postions of the minimum and maximum elements of an -iterator, as determined by the specified comparison function. Read more
    source§

    fn exactly_one(self) -> Result<Self::Item, ExactlyOneError<Self>>
    where +iterator, as determined by the specified comparison function. Read more

    source§

    fn exactly_one(self) -> Result<Self::Item, ExactlyOneError<Self>>
    where Self: Sized,

    If the iterator yields exactly one element, that element will be returned, otherwise an error will be returned containing an iterator that has the same output as the input -iterator. Read more
    source§

    fn at_most_one(self) -> Result<Option<Self::Item>, ExactlyOneError<Self>>
    where - Self: Sized,

    If the iterator yields no elements, Ok(None) will be returned. If the iterator yields +iterator. Read more
    source§

    fn at_most_one(self) -> Result<Option<Self::Item>, ExactlyOneError<Self>>
    where + Self: Sized,

    If the iterator yields no elements, Ok(None) will be returned. If the iterator yields exactly one element, that element will be returned, otherwise an error will be returned -containing an iterator that has the same output as the input iterator. Read more
    source§

    fn multipeek(self) -> MultiPeek<Self> ⓘ
    where +containing an iterator that has the same output as the input iterator. Read more

    source§

    fn multipeek(self) -> MultiPeek<Self> ⓘ
    where Self: Sized,

    An iterator adaptor that allows the user to peek at multiple .next() -values without advancing the base iterator. Read more
    source§

    fn counts(self) -> HashMap<Self::Item, usize>
    where +values without advancing the base iterator. Read more

    source§

    fn counts(self) -> HashMap<Self::Item, usize>
    where Self: Sized, Self::Item: Eq + Hash,

    Collect the items in this iterator and return a HashMap which contains each item that appears in the iterator and the number -of times it appears. Read more
    source§

    fn counts_by<K, F>(self, f: F) -> HashMap<K, usize>
    where +of times it appears. Read more

    source§

    fn counts_by<K, F>(self, f: F) -> HashMap<K, usize>
    where Self: Sized, K: Eq + Hash, F: FnMut(Self::Item) -> K,

    Collect the items in this iterator and return a HashMap which contains each item that appears in the iterator and the number of times it appears, -determining identity using a keying function. Read more
    source§

    fn multiunzip<FromI>(self) -> FromI
    where - Self: Sized + MultiUnzip<FromI>,

    Converts an iterator of tuples into a tuple of containers. Read more
    source§

    fn try_len(&self) -> Result<usize, (usize, Option<usize>)>

    Returns the length of the iterator if one exists. +determining identity using a keying function. Read more
    source§

    fn multiunzip<FromI>(self) -> FromI
    where + Self: Sized + MultiUnzip<FromI>,

    Converts an iterator of tuples into a tuple of containers. Read more
    source§

    fn try_len(&self) -> Result<usize, (usize, Option<usize>)>

    Returns the length of the iterator if one exists. Otherwise return self.size_hint(). Read more
    source§

    impl<IT, A, FromA> MultiUnzip<(FromA,)> for IT
    where IT: Iterator<Item = (A,)>, FromA: Default + Extend<A>,

    source§

    fn multiunzip(self) -> (FromA,)

    Unzip this iterator into multiple collections.
    source§

    impl<IT, A, FromA, B, FromB> MultiUnzip<(FromA, FromB)> for IT
    where @@ -694,4 +706,4 @@ Otherwise return self.size_hint(). (FromA, FromB, FromC, FromD, FromE, FromF, FromG, FromH, FromI, FromJ, FromK, FromL)

    Unzip this iterator into multiple collections.
    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 + 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/itertools/structs/struct.Unfold.html b/itertools/structs/struct.Unfold.html index 6ba87c5e8..71cc931e3 100644 --- a/itertools/structs/struct.Unfold.html +++ b/itertools/structs/struct.Unfold.html @@ -1,12 +1,12 @@ -Unfold in itertools::structs - Rust
    -

    Struct itertools::structs::Unfold

    source · 
    pub struct Unfold<St, F> {
+Unfold in itertools::structs - Rust
    
+    
    Struct itertools::structs::Unfold
    source · 
    pub struct Unfold<St, F> {
     pub state: St,
     /* private fields */
-}
    Expand description
    See unfold for more information.
    
-
    Fields§
    §state: St
    Internal state that will be passed to the closure on the next iteration
    
-
    Trait Implementations§
    source§
    impl<St: Clone, F: Clone> Clone for Unfold<St, F>
    source§
    fn clone(&self) -> Unfold<St, F> ⓘ
    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<St, F> Debug for Unfold<St, F>
    where
-    St: Debug,
    source§
    fn fmt(&self, f: &mut Formatter<'_>) -> Result
    Formats the value using the given formatter. Read more
    source§
    impl<A, St, F> Iterator for Unfold<St, F>
    where
-    F: FnMut(&mut St) -> Option<A>,
    §
    type Item = A
    The type of the elements being iterated over.
    source§
    fn next(&mut self) -> Option<Self::Item>
    Advances the iterator and returns the next value. Read more
    source§
    fn next_chunk<const N: usize>(
+}
    👎Deprecated since 0.13.0: Use std::iter::FromFn instead
    Expand description

    See unfold for more information.

    +

    Fields§

    §state: St
    👎Deprecated since 0.13.0: Use std::iter::FromFn instead

    Internal state that will be passed to the closure on the next iteration

    +

    Trait Implementations§

    source§

    impl<St: Clone, F: Clone> Clone for Unfold<St, F>

    source§

    fn clone(&self) -> Unfold<St, F> ⓘ

    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<St, F> Debug for Unfold<St, F>
    where + St: Debug,

    source§

    fn fmt(&self, f: &mut Formatter<'_>) -> Result

    Formats the value using the given formatter. Read more
    source§

    impl<A, St, F> Iterator for Unfold<St, F>
    where + F: FnMut(&mut St) -> Option<A>,

    §

    type Item = A

    The type of the elements being iterated over.
    source§

    fn next(&mut self) -> Option<Self::Item>

    Advances the iterator and returns the next value. Read more
    source§

    fn next_chunk<const N: usize>( &mut self ) -> Result<[Self::Item; N], IntoIter<Self::Item, N>>
    where Self: Sized,

    🔬This is a nightly-only experimental API. (iter_next_chunk)
    Advances the iterator and returns an array containing the next N values. Read more
    1.0.0 · source§

    fn size_hint(&self) -> (usize, Option<usize>)

    Returns the bounds on the remaining length of the iterator. Read more
    1.0.0 · source§

    fn count(self) -> usize
    where @@ -211,86 +211,87 @@ otherwise. Right variant of Either<Self, Self> otherwise. Read more

    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> Itertools for T
    where - T: Iterator + ?Sized,

    source§

    fn interleave<J>(self, other: J) -> Interleave<Self, J::IntoIter> ⓘ
    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> Itertools for T
    where + T: Iterator + ?Sized,

    source§

    fn interleave<J>(self, other: J) -> Interleave<Self, J::IntoIter> ⓘ
    where J: IntoIterator<Item = Self::Item>, - Self: Sized,

    Alternate elements from two iterators until both have run out. Read more
    source§

    fn interleave_shortest<J>( + Self: Sized,

    Alternate elements from two iterators until both have run out. Read more
    source§

    fn interleave_shortest<J>( self, other: J ) -> InterleaveShortest<Self, J::IntoIter> ⓘ
    where J: IntoIterator<Item = Self::Item>, Self: Sized,

    Alternate elements from two iterators until at least one of them has run -out. Read more
    source§

    fn intersperse(self, element: Self::Item) -> Intersperse<Self>
    where +out. Read more

    source§

    fn intersperse(self, element: Self::Item) -> Intersperse<Self>
    where Self: Sized, Self::Item: Clone,

    An iterator adaptor to insert a particular value -between each element of the adapted iterator. Read more
    source§

    fn intersperse_with<F>(self, element: F) -> IntersperseWith<Self, F> ⓘ
    where +between each element of the adapted iterator. Read more

    source§

    fn intersperse_with<F>(self, element: F) -> IntersperseWith<Self, F> ⓘ
    where Self: Sized, F: FnMut() -> Self::Item,

    An iterator adaptor to insert a particular value created by a function -between each element of the adapted iterator. Read more
    source§

    fn zip_longest<J>(self, other: J) -> ZipLongest<Self, J::IntoIter> ⓘ
    where +between each element of the adapted iterator. Read more

    source§

    fn get<R>(self, index: R) -> R::Output
    where + Self: Sized, + R: IteratorIndex<Self>,

    Returns an iterator over a subsection of the iterator. Read more
    source§

    fn zip_longest<J>(self, other: J) -> ZipLongest<Self, J::IntoIter> ⓘ
    where J: IntoIterator, Self: Sized,

    Create an iterator which iterates over both this and the specified -iterator simultaneously, yielding pairs of two optional elements. Read more
    source§

    fn zip_eq<J>(self, other: J) -> ZipEq<Self, J::IntoIter> ⓘ
    where +iterator simultaneously, yielding pairs of two optional elements. Read more

    source§

    fn zip_eq<J>(self, other: J) -> ZipEq<Self, J::IntoIter> ⓘ
    where J: IntoIterator, Self: Sized,

    Create an iterator which iterates over both this and the specified -iterator simultaneously, yielding pairs of elements. Read more
    source§

    fn batching<B, F>(self, f: F) -> Batching<Self, F> ⓘ
    where +iterator simultaneously, yielding pairs of elements. Read more

    source§

    fn batching<B, F>(self, f: F) -> Batching<Self, F> ⓘ
    where F: FnMut(&mut Self) -> Option<B>, Self: Sized,

    A “meta iterator adaptor”. Its closure receives a reference to the iterator and may pick off as many elements as it likes, to produce the -next iterator element. Read more
    source§

    fn group_by<K, F>(self, key: F) -> GroupBy<K, Self, F>
    where +next iterator element. Read more

    source§

    fn chunk_by<K, F>(self, key: F) -> ChunkBy<K, Self, F>
    where Self: Sized, F: FnMut(&Self::Item) -> K, K: PartialEq,

    Return an iterable that can group iterator elements. Consecutive elements that map to the same key (“runs”), are assigned -to the same group. Read more
    source§

    fn chunks(self, size: usize) -> IntoChunks<Self>
    where - Self: Sized,

    Return an iterable that can chunk the iterator. Read more
    source§

    fn tuple_windows<T>(self) -> TupleWindows<Self, T> ⓘ
    where +to the same group. Read more

    source§

    fn group_by<K, F>(self, key: F) -> ChunkBy<K, Self, F>
    where + Self: Sized, + F: FnMut(&Self::Item) -> K, + K: PartialEq,

    👎Deprecated since 0.13.0: Use .chunk_by() instead
    See .chunk_by().
    source§

    fn chunks(self, size: usize) -> IntoChunks<Self>
    where + Self: Sized,

    Return an iterable that can chunk the iterator. Read more
    source§

    fn tuple_windows<T>(self) -> TupleWindows<Self, T> ⓘ
    where Self: Sized + Iterator<Item = T::Item>, T: HomogeneousTuple, T::Item: Clone,

    Return an iterator over all contiguous windows producing tuples of -a specific size (up to 12). Read more
    source§

    fn circular_tuple_windows<T>(self) -> CircularTupleWindows<Self, T> ⓘ
    where +a specific size (up to 12). Read more

    source§

    fn circular_tuple_windows<T>(self) -> CircularTupleWindows<Self, T> ⓘ
    where Self: Sized + Clone + Iterator<Item = T::Item> + ExactSizeIterator, T: TupleCollect + Clone, T::Item: Clone,

    Return an iterator over all windows, wrapping back to the first elements when the window would otherwise exceed the length of the -iterator, producing tuples of a specific size (up to 12). Read more
    source§

    fn tuples<T>(self) -> Tuples<Self, T> ⓘ
    where +iterator, producing tuples of a specific size (up to 12). Read more

    source§

    fn tuples<T>(self) -> Tuples<Self, T> ⓘ
    where Self: Sized + Iterator<Item = T::Item>, T: HomogeneousTuple,

    Return an iterator that groups the items in tuples of a specific size -(up to 12). Read more
    source§

    fn tee(self) -> (Tee<Self>, Tee<Self>)
    where +(up to 12). Read more

    source§

    fn tee(self) -> (Tee<Self>, Tee<Self>)
    where Self: Sized, Self::Item: Clone,

    Split into an iterator pair that both yield all elements from -the original iterator. Read more
    source§

    fn step(self, n: usize) -> Step<Self> ⓘ
    where - Self: Sized,

    👎Deprecated since 0.8.0: Use std .step_by() instead
    Return an iterator adaptor that steps n elements in the base iterator -for each iteration. Read more
    source§

    fn map_into<R>(self) -> MapInto<Self, R>
    where +the original iterator. Read more

    source§

    fn map_into<R>(self) -> MapInto<Self, R>
    where Self: Sized, - Self::Item: Into<R>,

    Convert each item of the iterator using the Into trait. Read more
    source§

    fn map_results<F, T, U, E>(self, f: F) -> MapOk<Self, F>
    where - Self: Iterator<Item = Result<T, E>> + Sized, - F: FnMut(T) -> U,

    👎Deprecated since 0.10.0: Use .map_ok() instead
    See .map_ok().
    source§

    fn map_ok<F, T, U, E>(self, f: F) -> MapOk<Self, F>
    where + Self::Item: Into<R>,

    Convert each item of the iterator using the Into trait. Read more
    source§

    fn map_ok<F, T, U, E>(self, f: F) -> MapOk<Self, F>
    where Self: Iterator<Item = Result<T, E>> + Sized, F: FnMut(T) -> U,

    Return an iterator adaptor that applies the provided closure to every Result::Ok value. Result::Err values are -unchanged. Read more
    source§

    fn filter_ok<F, T, E>(self, f: F) -> FilterOk<Self, F> ⓘ
    where +unchanged. Read more

    source§

    fn filter_ok<F, T, E>(self, f: F) -> FilterOk<Self, F> ⓘ
    where Self: Iterator<Item = Result<T, E>> + Sized, F: FnMut(&T) -> bool,

    Return an iterator adaptor that filters every Result::Ok value with the provided closure. Result::Err values are -unchanged. Read more
    source§

    fn filter_map_ok<F, T, U, E>(self, f: F) -> FilterMapOk<Self, F> ⓘ
    where +unchanged. Read more

    source§

    fn filter_map_ok<F, T, U, E>(self, f: F) -> FilterMapOk<Self, F> ⓘ
    where Self: Iterator<Item = Result<T, E>> + Sized, F: FnMut(T) -> Option<U>,

    Return an iterator adaptor that filters and transforms every Result::Ok value with the provided closure. Result::Err -values are unchanged. Read more
    source§

    fn flatten_ok<T, E>(self) -> FlattenOk<Self, T, E> ⓘ
    where +values are unchanged. Read more

    source§

    fn flatten_ok<T, E>(self) -> FlattenOk<Self, T, E> ⓘ
    where Self: Iterator<Item = Result<T, E>> + Sized, T: IntoIterator,

    Return an iterator adaptor that flattens every Result::Ok value into -a series of Result::Ok values. Result::Err values are unchanged. Read more
    source§

    fn process_results<F, T, E, R>(self, processor: F) -> Result<R, E>
    where +a series of Result::Ok values. Result::Err values are unchanged. Read more

    source§

    fn process_results<F, T, E, R>(self, processor: F) -> Result<R, E>
    where Self: Iterator<Item = Result<T, E>> + Sized, F: FnOnce(ProcessResults<'_, Self, E>) -> R,

    “Lift” a function of the values of the current iterator so as to process -an iterator of Result values instead. Read more
    source§

    fn merge<J>(self, other: J) -> Merge<Self, J::IntoIter>
    where +an iterator of Result values instead. Read more

    source§

    fn merge<J>(self, other: J) -> Merge<Self, J::IntoIter>
    where Self: Sized, Self::Item: PartialOrd, J: IntoIterator<Item = Self::Item>,

    Return an iterator adaptor that merges the two base iterators in ascending order. If both base iterators are sorted (ascending), the -result is sorted. Read more
    source§

    fn merge_by<J, F>(self, other: J, is_first: F) -> MergeBy<Self, J::IntoIter, F> ⓘ
    where +result is sorted. Read more

    source§

    fn merge_by<J, F>(self, other: J, is_first: F) -> MergeBy<Self, J::IntoIter, F> ⓘ
    where Self: Sized, J: IntoIterator<Item = Self::Item>, F: FnMut(&Self::Item, &Self::Item) -> bool,

    Return an iterator adaptor that merges the two base iterators in order. -This is much like .merge() but allows for a custom ordering. Read more
    source§

    fn merge_join_by<J, F, T>( +This is much like .merge() but allows for a custom ordering. Read more

    source§

    fn merge_join_by<J, F, T>( self, other: J, cmp_fn: F @@ -298,284 +299,295 @@ This is much like IntoIterator, F: FnMut(&Self::Item, &J::Item) -> T, Self: Sized,

    Create an iterator that merges items from both this and the specified -iterator in ascending order. Read more
    source§

    fn kmerge(self) -> KMerge<<Self::Item as IntoIterator>::IntoIter>
    where +iterator in ascending order. Read more

    source§

    fn kmerge(self) -> KMerge<<Self::Item as IntoIterator>::IntoIter>
    where Self: Sized, Self::Item: IntoIterator, <Self::Item as IntoIterator>::Item: PartialOrd,

    Return an iterator adaptor that flattens an iterator of iterators by -merging them in ascending order. Read more
    source§

    fn kmerge_by<F>( +merging them in ascending order. Read more

    source§

    fn kmerge_by<F>( self, first: F ) -> KMergeBy<<Self::Item as IntoIterator>::IntoIter, F> ⓘ
    where Self: Sized, Self::Item: IntoIterator, F: FnMut(&<Self::Item as IntoIterator>::Item, &<Self::Item as IntoIterator>::Item) -> bool,

    Return an iterator adaptor that flattens an iterator of iterators by -merging them according to the given closure. Read more
    source§

    fn cartesian_product<J>(self, other: J) -> Product<Self, J::IntoIter> ⓘ
    where +merging them according to the given closure. Read more

    source§

    fn cartesian_product<J>(self, other: J) -> Product<Self, J::IntoIter> ⓘ
    where Self: Sized, Self::Item: Clone, J: IntoIterator, J::IntoIter: Clone,

    Return an iterator adaptor that iterates over the cartesian product of -the element sets of two iterators self and J. Read more
    source§

    fn multi_cartesian_product( +the element sets of two iterators self and J. Read more

    source§

    fn multi_cartesian_product( self ) -> MultiProduct<<Self::Item as IntoIterator>::IntoIter> ⓘ
    where Self: Sized, Self::Item: IntoIterator, <Self::Item as IntoIterator>::IntoIter: Clone, <Self::Item as IntoIterator>::Item: Clone,

    Return an iterator adaptor that iterates over the cartesian product of -all subiterators returned by meta-iterator self. Read more
    source§

    fn coalesce<F>(self, f: F) -> Coalesce<Self, F>
    where +all subiterators returned by meta-iterator self. Read more

    source§

    fn coalesce<F>(self, f: F) -> Coalesce<Self, F>
    where Self: Sized, F: FnMut(Self::Item, Self::Item) -> Result<Self::Item, (Self::Item, Self::Item)>,

    Return an iterator adaptor that uses the passed-in closure to -optionally merge together consecutive elements. Read more
    source§

    fn dedup(self) -> Dedup<Self>
    where +optionally merge together consecutive elements. Read more

    source§

    fn dedup(self) -> Dedup<Self>
    where Self: Sized, Self::Item: PartialEq,

    Remove duplicates from sections of consecutive identical elements. -If the iterator is sorted, all elements will be unique. Read more
    source§

    fn dedup_by<Cmp>(self, cmp: Cmp) -> DedupBy<Self, Cmp>
    where +If the iterator is sorted, all elements will be unique. Read more

    source§

    fn dedup_by<Cmp>(self, cmp: Cmp) -> DedupBy<Self, Cmp>
    where Self: Sized, Cmp: FnMut(&Self::Item, &Self::Item) -> bool,

    Remove duplicates from sections of consecutive identical elements, determining equality using a comparison function. -If the iterator is sorted, all elements will be unique. Read more
    source§

    fn dedup_with_count(self) -> DedupWithCount<Self>
    where +If the iterator is sorted, all elements will be unique. Read more

    source§

    fn dedup_with_count(self) -> DedupWithCount<Self>
    where Self: Sized,

    Remove duplicates from sections of consecutive identical elements, while keeping a count of how many repeated elements were present. -If the iterator is sorted, all elements will be unique. Read more
    source§

    fn dedup_by_with_count<Cmp>(self, cmp: Cmp) -> DedupByWithCount<Self, Cmp>
    where +If the iterator is sorted, all elements will be unique. Read more

    source§

    fn dedup_by_with_count<Cmp>(self, cmp: Cmp) -> DedupByWithCount<Self, Cmp>
    where Self: Sized, Cmp: FnMut(&Self::Item, &Self::Item) -> bool,

    Remove duplicates from sections of consecutive identical elements, while keeping a count of how many repeated elements were present. This will determine equality using a comparison function. -If the iterator is sorted, all elements will be unique. Read more
    source§

    fn duplicates(self) -> Duplicates<Self>
    where +If the iterator is sorted, all elements will be unique. Read more

    source§

    fn duplicates(self) -> Duplicates<Self>
    where Self: Sized, Self::Item: Eq + Hash,

    Return an iterator adaptor that produces elements that appear more than once during the -iteration. Duplicates are detected using hash and equality. Read more
    source§

    fn duplicates_by<V, F>(self, f: F) -> DuplicatesBy<Self, V, F>
    where +iteration. Duplicates are detected using hash and equality. Read more

    source§

    fn duplicates_by<V, F>(self, f: F) -> DuplicatesBy<Self, V, F>
    where Self: Sized, V: Eq + Hash, F: FnMut(&Self::Item) -> V,

    Return an iterator adaptor that produces elements that appear more than once during the -iteration. Duplicates are detected using hash and equality. Read more
    source§

    fn unique(self) -> Unique<Self> ⓘ
    where +iteration. Duplicates are detected using hash and equality. Read more

    source§

    fn unique(self) -> Unique<Self> ⓘ
    where Self: Sized, Self::Item: Clone + Eq + Hash,

    Return an iterator adaptor that filters out elements that have already been produced once during the iteration. Duplicates -are detected using hash and equality. Read more
    source§

    fn unique_by<V, F>(self, f: F) -> UniqueBy<Self, V, F> ⓘ
    where +are detected using hash and equality. Read more

    source§

    fn unique_by<V, F>(self, f: F) -> UniqueBy<Self, V, F> ⓘ
    where Self: Sized, V: Eq + Hash, F: FnMut(&Self::Item) -> V,

    Return an iterator adaptor that filters out elements that have -already been produced once during the iteration. Read more
    source§

    fn peeking_take_while<F>(&mut self, accept: F) -> PeekingTakeWhile<'_, Self, F> ⓘ
    where +already been produced once during the iteration. Read more

    source§

    fn peeking_take_while<F>(&mut self, accept: F) -> PeekingTakeWhile<'_, Self, F> ⓘ
    where Self: Sized + PeekingNext, F: FnMut(&Self::Item) -> bool,

    Return an iterator adaptor that borrows from this iterator and -takes items while the closure accept returns true. Read more
    source§

    fn take_while_ref<F>(&mut self, accept: F) -> TakeWhileRef<'_, Self, F> ⓘ
    where +takes items while the closure accept returns true. Read more

    source§

    fn take_while_ref<F>(&mut self, accept: F) -> TakeWhileRef<'_, Self, F> ⓘ
    where Self: Clone, F: FnMut(&Self::Item) -> bool,

    Return an iterator adaptor that borrows from a Clone-able iterator -to only pick off elements while the predicate accept returns true. Read more
    source§

    fn take_while_inclusive<F>(self, accept: F) -> TakeWhileInclusive<Self, F> ⓘ
    where +to only pick off elements while the predicate accept returns true. Read more

    source§

    fn take_while_inclusive<F>(self, accept: F) -> TakeWhileInclusive<Self, F> ⓘ
    where Self: Sized, F: FnMut(&Self::Item) -> bool,

    Returns an iterator adaptor that consumes elements while the given predicate is true, including the element for which the predicate -first returned false. Read more
    source§

    fn while_some<A>(self) -> WhileSome<Self> ⓘ
    where +first returned false. Read more

    source§

    fn while_some<A>(self) -> WhileSome<Self> ⓘ
    where Self: Sized + Iterator<Item = Option<A>>,

    Return an iterator adaptor that filters Option<A> iterator elements -and produces A. Stops on the first None encountered. Read more
    source§

    fn tuple_combinations<T>(self) -> TupleCombinations<Self, T> ⓘ
    where +and produces A. Stops on the first None encountered. Read more

    source§

    fn tuple_combinations<T>(self) -> TupleCombinations<Self, T> ⓘ
    where Self: Sized + Clone, Self::Item: Clone, T: HasCombination<Self>,

    Return an iterator adaptor that iterates over the combinations of the -elements from an iterator. Read more
    source§

    fn combinations(self, k: usize) -> Combinations<Self> ⓘ
    where +elements from an iterator. Read more

    source§

    fn combinations(self, k: usize) -> Combinations<Self> ⓘ
    where Self: Sized, Self::Item: Clone,

    Return an iterator adaptor that iterates over the k-length combinations of -the elements from an iterator. Read more
    source§

    fn combinations_with_replacement( +the elements from an iterator. Read more

    source§

    fn combinations_with_replacement( self, k: usize ) -> CombinationsWithReplacement<Self> ⓘ
    where Self: Sized, Self::Item: Clone,

    Return an iterator that iterates over the k-length combinations of -the elements from an iterator, with replacement. Read more
    source§

    fn permutations(self, k: usize) -> Permutations<Self> ⓘ
    where +the elements from an iterator, with replacement. Read more

    source§

    fn permutations(self, k: usize) -> Permutations<Self> ⓘ
    where Self: Sized, Self::Item: Clone,

    Return an iterator adaptor that iterates over all k-permutations of the -elements from an iterator. Read more
    source§

    fn powerset(self) -> Powerset<Self> ⓘ
    where +elements from an iterator. Read more

    source§

    fn powerset(self) -> Powerset<Self> ⓘ
    where Self: Sized, Self::Item: Clone,

    Return an iterator that iterates through the powerset of the elements from an -iterator. Read more
    source§

    fn pad_using<F>(self, min: usize, f: F) -> PadUsing<Self, F> ⓘ
    where +iterator. Read more

    source§

    fn pad_using<F>(self, min: usize, f: F) -> PadUsing<Self, F> ⓘ
    where Self: Sized, F: FnMut(usize) -> Self::Item,

    Return an iterator adaptor that pads the sequence to a minimum length of -min by filling missing elements using a closure f. Read more
    source§

    fn with_position(self) -> WithPosition<Self> ⓘ
    where +min by filling missing elements using a closure f. Read more

    source§

    fn with_position(self) -> WithPosition<Self> ⓘ
    where Self: Sized,

    Return an iterator adaptor that combines each element with a Position to -ease special-case handling of the first or last elements. Read more
    source§

    fn positions<P>(self, predicate: P) -> Positions<Self, P> ⓘ
    where +ease special-case handling of the first or last elements. Read more

    source§

    fn positions<P>(self, predicate: P) -> Positions<Self, P> ⓘ
    where Self: Sized, P: FnMut(Self::Item) -> bool,

    Return an iterator adaptor that yields the indices of all elements -satisfying a predicate, counted from the start of the iterator. Read more
    source§

    fn update<F>(self, updater: F) -> Update<Self, F> ⓘ
    where +satisfying a predicate, counted from the start of the iterator. Read more

    source§

    fn update<F>(self, updater: F) -> Update<Self, F> ⓘ
    where Self: Sized, F: FnMut(&mut Self::Item),

    Return an iterator adaptor that applies a mutating function -to each element before yielding it. Read more
    source§

    fn next_tuple<T>(&mut self) -> Option<T>
    where +to each element before yielding it. Read more

    source§

    fn next_tuple<T>(&mut self) -> Option<T>
    where Self: Sized + Iterator<Item = T::Item>, T: HomogeneousTuple,

    Advances the iterator and returns the next items grouped in a tuple of -a specific size (up to 12). Read more
    source§

    fn collect_tuple<T>(self) -> Option<T>
    where +a specific size (up to 12). Read more

    source§

    fn collect_tuple<T>(self) -> Option<T>
    where Self: Sized + Iterator<Item = T::Item>, T: HomogeneousTuple,

    Collects all items from the iterator into a tuple of a specific size -(up to 12). Read more
    source§

    fn find_position<P>(&mut self, pred: P) -> Option<(usize, Self::Item)>
    where - P: FnMut(&Self::Item) -> bool,

    Find the position and value of the first element satisfying a predicate. Read more
    source§

    fn find_or_last<P>(self, predicate: P) -> Option<Self::Item>
    where +(up to 12). Read more

    source§

    fn find_position<P>(&mut self, pred: P) -> Option<(usize, Self::Item)>
    where + P: FnMut(&Self::Item) -> bool,

    Find the position and value of the first element satisfying a predicate. Read more
    source§

    fn find_or_last<P>(self, predicate: P) -> Option<Self::Item>
    where Self: Sized, - P: FnMut(&Self::Item) -> bool,

    Find the value of the first element satisfying a predicate or return the last element, if any. Read more
    source§

    fn find_or_first<P>(self, predicate: P) -> Option<Self::Item>
    where + P: FnMut(&Self::Item) -> bool,

    Find the value of the first element satisfying a predicate or return the last element, if any. Read more
    source§

    fn find_or_first<P>(self, predicate: P) -> Option<Self::Item>
    where Self: Sized, - P: FnMut(&Self::Item) -> bool,

    Find the value of the first element satisfying a predicate or return the first element, if any. Read more
    source§

    fn contains<Q>(&mut self, query: &Q) -> bool
    where + P: FnMut(&Self::Item) -> bool,

    Find the value of the first element satisfying a predicate or return the first element, if any. Read more
    source§

    fn contains<Q>(&mut self, query: &Q) -> bool
    where Self: Sized, Self::Item: Borrow<Q>, - Q: PartialEq,

    Returns true if the given item is present in this iterator. Read more
    source§

    fn all_equal(&mut self) -> bool
    where + Q: PartialEq,

    Returns true if the given item is present in this iterator. Read more
    source§

    fn all_equal(&mut self) -> bool
    where Self: Sized, - Self::Item: PartialEq,

    Check whether all elements compare equal. Read more
    source§

    fn all_equal_value( + Self::Item: PartialEq,

    Check whether all elements compare equal. Read more
    source§

    fn all_equal_value( &mut self ) -> Result<Self::Item, Option<(Self::Item, Self::Item)>>
    where Self: Sized, Self::Item: PartialEq,

    If there are elements and they are all equal, return a single copy of that element. If there are no elements, return an Error containing None. If there are elements and they are not all equal, return a tuple containing the first -two non-equal elements found. Read more
    source§

    fn all_unique(&mut self) -> bool
    where +two non-equal elements found. Read more

    source§

    fn all_unique(&mut self) -> bool
    where Self: Sized, - Self::Item: Eq + Hash,

    Check whether all elements are unique (non equal). Read more
    source§

    fn dropping(self, n: usize) -> Self
    where + Self::Item: Eq + Hash,

    Check whether all elements are unique (non equal). Read more
    source§

    fn dropping(self, n: usize) -> Self
    where Self: Sized,

    Consume the first n elements from the iterator eagerly, -and return the same iterator again. Read more
    source§

    fn dropping_back(self, n: usize) -> Self
    where +and return the same iterator again. Read more

    source§

    fn dropping_back(self, n: usize) -> Self
    where Self: Sized + DoubleEndedIterator,

    Consume the last n elements from the iterator eagerly, -and return the same iterator again. Read more
    source§

    fn foreach<F>(self, f: F)
    where - F: FnMut(Self::Item), - Self: Sized,

    👎Deprecated since 0.8.0: Use .for_each() instead
    Run the closure f eagerly on each element of the iterator. Read more
    source§

    fn concat(self) -> Self::Item
    where +and return the same iterator again. Read more

    source§

    fn concat(self) -> Self::Item
    where Self: Sized, - Self::Item: Extend<<<Self as Iterator>::Item as IntoIterator>::Item> + IntoIterator + Default,

    Combine all an iterator’s elements into one element by using Extend. Read more
    source§

    fn collect_vec(self) -> Vec<Self::Item>
    where + Self::Item: Extend<<<Self as Iterator>::Item as IntoIterator>::Item> + IntoIterator + Default,

    Combine all an iterator’s elements into one element by using Extend. Read more
    source§

    fn collect_vec(self) -> Vec<Self::Item>
    where Self: Sized,

    .collect_vec() is simply a type specialization of Iterator::collect, -for convenience.
    source§

    fn try_collect<T, U, E>(self) -> Result<U, E>
    where +for convenience.

    source§

    fn try_collect<T, U, E>(self) -> Result<U, E>
    where Self: Sized + Iterator<Item = Result<T, E>>, Result<U, E>: FromIterator<Result<T, E>>,

    .try_collect() is more convenient way of writing -.collect::<Result<_, _>>() Read more
    source§

    fn set_from<'a, A: 'a, J>(&mut self, from: J) -> usize
    where +.collect::<Result<_, _>>() Read more

    source§

    fn set_from<'a, A: 'a, J>(&mut self, from: J) -> usize
    where Self: Iterator<Item = &'a mut A>, J: IntoIterator<Item = A>,

    Assign to each reference in self from the from iterator, -stopping at the shortest of the two iterators. Read more
    source§

    fn join(&mut self, sep: &str) -> String
    where - Self::Item: Display,

    Combine all iterator elements into one String, separated by sep. Read more
    source§

    fn format(self, sep: &str) -> Format<'_, Self>
    where - Self: Sized,

    Format all iterator elements, separated by sep. Read more
    source§

    fn format_with<F>(self, sep: &str, format: F) -> FormatWith<'_, Self, F>
    where +stopping at the shortest of the two iterators. Read more

    source§

    fn join(&mut self, sep: &str) -> String
    where + Self::Item: Display,

    Combine all iterator elements into one String, separated by sep. Read more
    source§

    fn format(self, sep: &str) -> Format<'_, Self>
    where + Self: Sized,

    Format all iterator elements, separated by sep. Read more
    source§

    fn format_with<F>(self, sep: &str, format: F) -> FormatWith<'_, Self, F>
    where Self: Sized, - F: FnMut(Self::Item, &mut dyn FnMut(&dyn Display) -> Result) -> Result,

    Format all iterator elements, separated by sep. Read more
    source§

    fn fold_results<A, E, B, F>(&mut self, start: B, f: F) -> Result<B, E>
    where + F: FnMut(Self::Item, &mut dyn FnMut(&dyn Display) -> Result) -> Result,

    Format all iterator elements, separated by sep. Read more
    source§

    fn fold_ok<A, E, B, F>(&mut self, start: B, f: F) -> Result<B, E>
    where Self: Iterator<Item = Result<A, E>>, - F: FnMut(B, A) -> B,

    👎Deprecated since 0.10.0: Use .fold_ok() instead
    See .fold_ok().
    source§

    fn fold_ok<A, E, B, F>(&mut self, start: B, f: F) -> Result<B, E>
    where - Self: Iterator<Item = Result<A, E>>, - F: FnMut(B, A) -> B,

    Fold Result values from an iterator. Read more
    source§

    fn fold_options<A, B, F>(&mut self, start: B, f: F) -> Option<B>
    where + F: FnMut(B, A) -> B,

    Fold Result values from an iterator. Read more
    source§

    fn fold_options<A, B, F>(&mut self, start: B, f: F) -> Option<B>
    where Self: Iterator<Item = Option<A>>, - F: FnMut(B, A) -> B,

    Fold Option values from an iterator. Read more
    source§

    fn fold1<F>(self, f: F) -> Option<Self::Item>
    where + F: FnMut(B, A) -> B,

    Fold Option values from an iterator. Read more
    source§

    fn fold1<F>(self, f: F) -> Option<Self::Item>
    where F: FnMut(Self::Item, Self::Item) -> Self::Item, - Self: Sized,

    👎Deprecated since 0.10.2: Use Iterator::reduce instead
    Accumulator of the elements in the iterator. Read more
    source§

    fn tree_fold1<F>(self, f: F) -> Option<Self::Item>
    where + Self: Sized,

    👎Deprecated since 0.10.2: Use Iterator::reduce instead
    Accumulator of the elements in the iterator. Read more
    source§

    fn tree_reduce<F>(self, f: F) -> Option<Self::Item>
    where F: FnMut(Self::Item, Self::Item) -> Self::Item, - Self: Sized,

    Accumulate the elements in the iterator in a tree-like manner. Read more
    source§

    fn fold_while<B, F>(&mut self, init: B, f: F) -> FoldWhile<B>
    where + Self: Sized,

    Accumulate the elements in the iterator in a tree-like manner. Read more
    source§

    fn tree_fold1<F>(self, f: F) -> Option<Self::Item>
    where + F: FnMut(Self::Item, Self::Item) -> Self::Item, + Self: Sized,

    👎Deprecated since 0.13.0: Use .tree_reduce() instead
    See .tree_reduce().
    source§

    fn fold_while<B, F>(&mut self, init: B, f: F) -> FoldWhile<B>
    where Self: Sized, - F: FnMut(B, Self::Item) -> FoldWhile<B>,

    An iterator method that applies a function, producing a single, final value. Read more
    source§

    fn sum1<S>(self) -> Option<S>
    where + F: FnMut(B, Self::Item) -> FoldWhile<B>,

    An iterator method that applies a function, producing a single, final value. Read more
    source§

    fn sum1<S>(self) -> Option<S>
    where Self: Sized, - S: Sum<Self::Item>,

    Iterate over the entire iterator and add all the elements. Read more
    source§

    fn product1<P>(self) -> Option<P>
    where + S: Sum<Self::Item>,

    Iterate over the entire iterator and add all the elements. Read more
    source§

    fn product1<P>(self) -> Option<P>
    where Self: Sized, - P: Product<Self::Item>,

    Iterate over the entire iterator and multiply all the elements. Read more
    source§

    fn sorted_unstable(self) -> IntoIter<Self::Item> ⓘ
    where + P: Product<Self::Item>,

    Iterate over the entire iterator and multiply all the elements. Read more
    source§

    fn sorted_unstable(self) -> IntoIter<Self::Item> ⓘ
    where Self: Sized, - Self::Item: Ord,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_unstable_by<F>(self, cmp: F) -> IntoIter<Self::Item> ⓘ
    where + Self::Item: Ord,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_unstable_by<F>(self, cmp: F) -> IntoIter<Self::Item> ⓘ
    where Self: Sized, - F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_unstable_by_key<K, F>(self, f: F) -> IntoIter<Self::Item> ⓘ
    where + F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_unstable_by_key<K, F>(self, f: F) -> IntoIter<Self::Item> ⓘ
    where Self: Sized, K: Ord, - F: FnMut(&Self::Item) -> K,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted(self) -> IntoIter<Self::Item> ⓘ
    where + F: FnMut(&Self::Item) -> K,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted(self) -> IntoIter<Self::Item> ⓘ
    where Self: Sized, - Self::Item: Ord,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_by<F>(self, cmp: F) -> IntoIter<Self::Item> ⓘ
    where + Self::Item: Ord,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_by<F>(self, cmp: F) -> IntoIter<Self::Item> ⓘ
    where Self: Sized, - F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_by_key<K, F>(self, f: F) -> IntoIter<Self::Item> ⓘ
    where + F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_by_key<K, F>(self, f: F) -> IntoIter<Self::Item> ⓘ
    where Self: Sized, K: Ord, - F: FnMut(&Self::Item) -> K,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_by_cached_key<K, F>(self, f: F) -> IntoIter<Self::Item> ⓘ
    where + F: FnMut(&Self::Item) -> K,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_by_cached_key<K, F>(self, f: F) -> IntoIter<Self::Item> ⓘ
    where Self: Sized, K: Ord, F: FnMut(&Self::Item) -> K,

    Sort all iterator elements into a new iterator in ascending order. The key function is -called exactly once per key. Read more
    source§

    fn k_smallest(self, k: usize) -> IntoIter<Self::Item> ⓘ
    where +called exactly once per key. Read more

    source§

    fn k_smallest(self, k: usize) -> IntoIter<Self::Item> ⓘ
    where Self: Sized, - Self::Item: Ord,

    Sort the k smallest elements into a new iterator, in ascending order. Read more
    source§

    fn partition_map<A, B, F, L, R>(self, predicate: F) -> (A, B)
    where + Self::Item: Ord,

    Sort the k smallest elements into a new iterator, in ascending order. Read more
    source§

    fn k_smallest_by<F>(self, k: usize, cmp: F) -> IntoIter<Self::Item> ⓘ
    where + Self: Sized, + F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Sort the k smallest elements into a new iterator using the provided comparison. Read more
    source§

    fn k_smallest_by_key<F, K>(self, k: usize, key: F) -> IntoIter<Self::Item> ⓘ
    where + Self: Sized, + F: FnMut(&Self::Item) -> K, + K: Ord,

    Return the elements producing the k smallest outputs of the provided function. Read more
    source§

    fn k_largest(self, k: usize) -> IntoIter<Self::Item> ⓘ
    where + Self: Sized, + Self::Item: Ord,

    Sort the k largest elements into a new iterator, in descending order. Read more
    source§

    fn k_largest_by<F>(self, k: usize, cmp: F) -> IntoIter<Self::Item> ⓘ
    where + Self: Sized, + F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Sort the k largest elements into a new iterator using the provided comparison. Read more
    source§

    fn k_largest_by_key<F, K>(self, k: usize, key: F) -> IntoIter<Self::Item> ⓘ
    where + Self: Sized, + F: FnMut(&Self::Item) -> K, + K: Ord,

    Return the elements producing the k largest outputs of the provided function. Read more
    source§

    fn tail(self, n: usize) -> IntoIter<Self::Item> ⓘ
    where + Self: Sized,

    Consumes the iterator and return an iterator of the last n elements. Read more
    source§

    fn partition_map<A, B, F, L, R>(self, predicate: F) -> (A, B)
    where Self: Sized, F: FnMut(Self::Item) -> Either<L, R>, A: Default + Extend<L>, B: Default + Extend<R>,

    Collect all iterator elements into one of two partitions. Unlike Iterator::partition, each partition may -have a distinct type. Read more
    source§

    fn partition_result<A, B, T, E>(self) -> (A, B)
    where +have a distinct type. Read more

    source§

    fn partition_result<A, B, T, E>(self) -> (A, B)
    where Self: Iterator<Item = Result<T, E>> + Sized, A: Default + Extend<T>, B: Default + Extend<E>,

    Partition a sequence of Results into one list of all the Ok elements -and another list of all the Err elements. Read more
    source§

    fn into_group_map<K, V>(self) -> HashMap<K, Vec<V>>
    where +and another list of all the Err elements. Read more

    source§

    fn into_group_map<K, V>(self) -> HashMap<K, Vec<V>>
    where Self: Iterator<Item = (K, V)> + Sized, K: Hash + Eq,

    Return a HashMap of keys mapped to Vecs of values. Keys and values -are taken from (Key, Value) tuple pairs yielded by the input iterator. Read more
    source§

    fn into_group_map_by<K, V, F>(self, f: F) -> HashMap<K, Vec<V>>
    where +are taken from (Key, Value) tuple pairs yielded by the input iterator. Read more

    source§

    fn into_group_map_by<K, V, F>(self, f: F) -> HashMap<K, Vec<V>>
    where Self: Iterator<Item = V> + Sized, K: Hash + Eq, - F: Fn(&V) -> K,

    Return an Iterator on a HashMap. Keys mapped to Vecs of values. The key is specified -in the closure. Read more
    source§

    fn into_grouping_map<K, V>(self) -> GroupingMap<Self>
    where + F: FnMut(&V) -> K,

    Return an Iterator on a HashMap. Keys mapped to Vecs of values. The key is specified +in the closure. Read more
    source§

    fn into_grouping_map<K, V>(self) -> GroupingMap<Self>
    where Self: Iterator<Item = (K, V)> + Sized, K: Hash + Eq,

    Constructs a GroupingMap to be used later with one of the efficient -group-and-fold operations it allows to perform. Read more
    source§

    fn into_grouping_map_by<K, V, F>(self, key_mapper: F) -> GroupingMapBy<Self, F>
    where +group-and-fold operations it allows to perform. Read more

    source§

    fn into_grouping_map_by<K, V, F>(self, key_mapper: F) -> GroupingMapBy<Self, F>
    where Self: Iterator<Item = V> + Sized, K: Hash + Eq, F: FnMut(&V) -> K,

    Constructs a GroupingMap to be used later with one of the efficient -group-and-fold operations it allows to perform. Read more
    source§

    fn min_set(self) -> Vec<Self::Item>
    where +group-and-fold operations it allows to perform. Read more

    source§

    fn min_set(self) -> Vec<Self::Item>
    where Self: Sized, - Self::Item: Ord,

    Return all minimum elements of an iterator. Read more
    source§

    fn min_set_by<F>(self, compare: F) -> Vec<Self::Item>
    where + Self::Item: Ord,

    Return all minimum elements of an iterator. Read more
    source§

    fn min_set_by<F>(self, compare: F) -> Vec<Self::Item>
    where Self: Sized, F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Return all minimum elements of an iterator, as determined by -the specified function. Read more
    source§

    fn min_set_by_key<K, F>(self, key: F) -> Vec<Self::Item>
    where +the specified function. Read more

    source§

    fn min_set_by_key<K, F>(self, key: F) -> Vec<Self::Item>
    where Self: Sized, K: Ord, F: FnMut(&Self::Item) -> K,

    Return all minimum elements of an iterator, as determined by -the specified function. Read more
    source§

    fn max_set(self) -> Vec<Self::Item>
    where +the specified function. Read more

    source§

    fn max_set(self) -> Vec<Self::Item>
    where Self: Sized, - Self::Item: Ord,

    Return all maximum elements of an iterator. Read more
    source§

    fn max_set_by<F>(self, compare: F) -> Vec<Self::Item>
    where + Self::Item: Ord,

    Return all maximum elements of an iterator. Read more
    source§

    fn max_set_by<F>(self, compare: F) -> Vec<Self::Item>
    where Self: Sized, F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Return all maximum elements of an iterator, as determined by -the specified function. Read more
    source§

    fn max_set_by_key<K, F>(self, key: F) -> Vec<Self::Item>
    where +the specified function. Read more

    source§

    fn max_set_by_key<K, F>(self, key: F) -> Vec<Self::Item>
    where Self: Sized, K: Ord, F: FnMut(&Self::Item) -> K,

    Return all maximum elements of an iterator, as determined by -the specified function. Read more
    source§

    fn minmax(self) -> MinMaxResult<Self::Item>
    where +the specified function. Read more

    source§

    fn minmax(self) -> MinMaxResult<Self::Item>
    where Self: Sized, - Self::Item: PartialOrd,

    Return the minimum and maximum elements in the iterator. Read more
    source§

    fn minmax_by_key<K, F>(self, key: F) -> MinMaxResult<Self::Item>
    where + Self::Item: PartialOrd,

    Return the minimum and maximum elements in the iterator. Read more
    source§

    fn minmax_by_key<K, F>(self, key: F) -> MinMaxResult<Self::Item>
    where Self: Sized, K: PartialOrd, F: FnMut(&Self::Item) -> K,

    Return the minimum and maximum element of an iterator, as determined by -the specified function. Read more
    source§

    fn minmax_by<F>(self, compare: F) -> MinMaxResult<Self::Item>
    where +the specified function. Read more

    source§

    fn minmax_by<F>(self, compare: F) -> MinMaxResult<Self::Item>
    where Self: Sized, F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Return the minimum and maximum element of an iterator, as determined by -the specified comparison function. Read more
    source§

    fn position_max(self) -> Option<usize>
    where +the specified comparison function. Read more

    source§

    fn position_max(self) -> Option<usize>
    where Self: Sized, - Self::Item: Ord,

    Return the position of the maximum element in the iterator. Read more
    source§

    fn position_max_by_key<K, F>(self, key: F) -> Option<usize>
    where + Self::Item: Ord,

    Return the position of the maximum element in the iterator. Read more
    source§

    fn position_max_by_key<K, F>(self, key: F) -> Option<usize>
    where Self: Sized, K: Ord, F: FnMut(&Self::Item) -> K,

    Return the position of the maximum element in the iterator, as -determined by the specified function. Read more
    source§

    fn position_max_by<F>(self, compare: F) -> Option<usize>
    where +determined by the specified function. Read more

    source§

    fn position_max_by<F>(self, compare: F) -> Option<usize>
    where Self: Sized, F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Return the position of the maximum element in the iterator, as -determined by the specified comparison function. Read more
    source§

    fn position_min(self) -> Option<usize>
    where +determined by the specified comparison function. Read more

    source§

    fn position_min(self) -> Option<usize>
    where Self: Sized, - Self::Item: Ord,

    Return the position of the minimum element in the iterator. Read more
    source§

    fn position_min_by_key<K, F>(self, key: F) -> Option<usize>
    where + Self::Item: Ord,

    Return the position of the minimum element in the iterator. Read more
    source§

    fn position_min_by_key<K, F>(self, key: F) -> Option<usize>
    where Self: Sized, K: Ord, F: FnMut(&Self::Item) -> K,

    Return the position of the minimum element in the iterator, as -determined by the specified function. Read more
    source§

    fn position_min_by<F>(self, compare: F) -> Option<usize>
    where +determined by the specified function. Read more

    source§

    fn position_min_by<F>(self, compare: F) -> Option<usize>
    where Self: Sized, F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Return the position of the minimum element in the iterator, as -determined by the specified comparison function. Read more
    source§

    fn position_minmax(self) -> MinMaxResult<usize>
    where +determined by the specified comparison function. Read more

    source§

    fn position_minmax(self) -> MinMaxResult<usize>
    where Self: Sized, Self::Item: PartialOrd,

    Return the positions of the minimum and maximum elements in -the iterator. Read more
    source§

    fn position_minmax_by_key<K, F>(self, key: F) -> MinMaxResult<usize>
    where +the iterator. Read more

    source§

    fn position_minmax_by_key<K, F>(self, key: F) -> MinMaxResult<usize>
    where Self: Sized, K: PartialOrd, F: FnMut(&Self::Item) -> K,

    Return the postions of the minimum and maximum elements of an -iterator, as determined by the specified function. Read more
    source§

    fn position_minmax_by<F>(self, compare: F) -> MinMaxResult<usize>
    where +iterator, as determined by the specified function. Read more

    source§

    fn position_minmax_by<F>(self, compare: F) -> MinMaxResult<usize>
    where Self: Sized, F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Return the postions of the minimum and maximum elements of an -iterator, as determined by the specified comparison function. Read more
    source§

    fn exactly_one(self) -> Result<Self::Item, ExactlyOneError<Self>>
    where +iterator, as determined by the specified comparison function. Read more

    source§

    fn exactly_one(self) -> Result<Self::Item, ExactlyOneError<Self>>
    where Self: Sized,

    If the iterator yields exactly one element, that element will be returned, otherwise an error will be returned containing an iterator that has the same output as the input -iterator. Read more
    source§

    fn at_most_one(self) -> Result<Option<Self::Item>, ExactlyOneError<Self>>
    where - Self: Sized,

    If the iterator yields no elements, Ok(None) will be returned. If the iterator yields +iterator. Read more
    source§

    fn at_most_one(self) -> Result<Option<Self::Item>, ExactlyOneError<Self>>
    where + Self: Sized,

    If the iterator yields no elements, Ok(None) will be returned. If the iterator yields exactly one element, that element will be returned, otherwise an error will be returned -containing an iterator that has the same output as the input iterator. Read more
    source§

    fn multipeek(self) -> MultiPeek<Self> ⓘ
    where +containing an iterator that has the same output as the input iterator. Read more

    source§

    fn multipeek(self) -> MultiPeek<Self> ⓘ
    where Self: Sized,

    An iterator adaptor that allows the user to peek at multiple .next() -values without advancing the base iterator. Read more
    source§

    fn counts(self) -> HashMap<Self::Item, usize>
    where +values without advancing the base iterator. Read more

    source§

    fn counts(self) -> HashMap<Self::Item, usize>
    where Self: Sized, Self::Item: Eq + Hash,

    Collect the items in this iterator and return a HashMap which contains each item that appears in the iterator and the number -of times it appears. Read more
    source§

    fn counts_by<K, F>(self, f: F) -> HashMap<K, usize>
    where +of times it appears. Read more

    source§

    fn counts_by<K, F>(self, f: F) -> HashMap<K, usize>
    where Self: Sized, K: Eq + Hash, F: FnMut(Self::Item) -> K,

    Collect the items in this iterator and return a HashMap which contains each item that appears in the iterator and the number of times it appears, -determining identity using a keying function. Read more
    source§

    fn multiunzip<FromI>(self) -> FromI
    where - Self: Sized + MultiUnzip<FromI>,

    Converts an iterator of tuples into a tuple of containers. Read more
    source§

    fn try_len(&self) -> Result<usize, (usize, Option<usize>)>

    Returns the length of the iterator if one exists. +determining identity using a keying function. Read more
    source§

    fn multiunzip<FromI>(self) -> FromI
    where + Self: Sized + MultiUnzip<FromI>,

    Converts an iterator of tuples into a tuple of containers. Read more
    source§

    fn try_len(&self) -> Result<usize, (usize, Option<usize>)>

    Returns the length of the iterator if one exists. Otherwise return self.size_hint(). Read more
    source§

    impl<IT> MultiUnzip<()> for IT
    where IT: Iterator<Item = ()>,

    source§

    fn multiunzip(self)

    Unzip this iterator into multiple collections.
    source§

    impl<IT, A, FromA> MultiUnzip<(FromA,)> for IT
    where IT: Iterator<Item = (A,)>, @@ -678,4 +690,4 @@ Otherwise return self.size_hint(). (FromA, FromB, FromC, FromD, FromE, FromF, FromG, FromH, FromI, FromJ, FromK, FromL)

    Unzip this iterator into multiple collections.
    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 + 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/itertools/structs/struct.Unique.html b/itertools/structs/struct.Unique.html index 84aa28da1..bb8c78c83 100644 --- a/itertools/structs/struct.Unique.html +++ b/itertools/structs/struct.Unique.html @@ -1,4 +1,4 @@ -Unique in itertools::structs - Rust
    +Unique in itertools::structs - Rust

    Struct itertools::structs::Unique

    source · 
    pub struct Unique<I>
    where
     I: Iterator,
     I::Item: Eq + Hash + Clone,
    { /* private fields */ }
    Expand description

    An iterator adapter to filter out duplicate elements.

    @@ -225,86 +225,87 @@ otherwise. Right variant of Either<Self, Self> otherwise. Read more
    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> Itertools for T
    where - T: Iterator + ?Sized,

    source§

    fn interleave<J>(self, other: J) -> Interleave<Self, J::IntoIter> ⓘ
    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> Itertools for T
    where + T: Iterator + ?Sized,

    source§

    fn interleave<J>(self, other: J) -> Interleave<Self, J::IntoIter> ⓘ
    where J: IntoIterator<Item = Self::Item>, - Self: Sized,

    Alternate elements from two iterators until both have run out. Read more
    source§

    fn interleave_shortest<J>( + Self: Sized,

    Alternate elements from two iterators until both have run out. Read more
    source§

    fn interleave_shortest<J>( self, other: J ) -> InterleaveShortest<Self, J::IntoIter> ⓘ
    where J: IntoIterator<Item = Self::Item>, Self: Sized,

    Alternate elements from two iterators until at least one of them has run -out. Read more
    source§

    fn intersperse(self, element: Self::Item) -> Intersperse<Self>
    where +out. Read more

    source§

    fn intersperse(self, element: Self::Item) -> Intersperse<Self>
    where Self: Sized, Self::Item: Clone,

    An iterator adaptor to insert a particular value -between each element of the adapted iterator. Read more
    source§

    fn intersperse_with<F>(self, element: F) -> IntersperseWith<Self, F> ⓘ
    where +between each element of the adapted iterator. Read more

    source§

    fn intersperse_with<F>(self, element: F) -> IntersperseWith<Self, F> ⓘ
    where Self: Sized, F: FnMut() -> Self::Item,

    An iterator adaptor to insert a particular value created by a function -between each element of the adapted iterator. Read more
    source§

    fn zip_longest<J>(self, other: J) -> ZipLongest<Self, J::IntoIter> ⓘ
    where +between each element of the adapted iterator. Read more

    source§

    fn get<R>(self, index: R) -> R::Output
    where + Self: Sized, + R: IteratorIndex<Self>,

    Returns an iterator over a subsection of the iterator. Read more
    source§

    fn zip_longest<J>(self, other: J) -> ZipLongest<Self, J::IntoIter> ⓘ
    where J: IntoIterator, Self: Sized,

    Create an iterator which iterates over both this and the specified -iterator simultaneously, yielding pairs of two optional elements. Read more
    source§

    fn zip_eq<J>(self, other: J) -> ZipEq<Self, J::IntoIter> ⓘ
    where +iterator simultaneously, yielding pairs of two optional elements. Read more

    source§

    fn zip_eq<J>(self, other: J) -> ZipEq<Self, J::IntoIter> ⓘ
    where J: IntoIterator, Self: Sized,

    Create an iterator which iterates over both this and the specified -iterator simultaneously, yielding pairs of elements. Read more
    source§

    fn batching<B, F>(self, f: F) -> Batching<Self, F> ⓘ
    where +iterator simultaneously, yielding pairs of elements. Read more

    source§

    fn batching<B, F>(self, f: F) -> Batching<Self, F> ⓘ
    where F: FnMut(&mut Self) -> Option<B>, Self: Sized,

    A “meta iterator adaptor”. Its closure receives a reference to the iterator and may pick off as many elements as it likes, to produce the -next iterator element. Read more
    source§

    fn group_by<K, F>(self, key: F) -> GroupBy<K, Self, F>
    where +next iterator element. Read more

    source§

    fn chunk_by<K, F>(self, key: F) -> ChunkBy<K, Self, F>
    where Self: Sized, F: FnMut(&Self::Item) -> K, K: PartialEq,

    Return an iterable that can group iterator elements. Consecutive elements that map to the same key (“runs”), are assigned -to the same group. Read more
    source§

    fn chunks(self, size: usize) -> IntoChunks<Self>
    where - Self: Sized,

    Return an iterable that can chunk the iterator. Read more
    source§

    fn tuple_windows<T>(self) -> TupleWindows<Self, T> ⓘ
    where +to the same group. Read more

    source§

    fn group_by<K, F>(self, key: F) -> ChunkBy<K, Self, F>
    where + Self: Sized, + F: FnMut(&Self::Item) -> K, + K: PartialEq,

    👎Deprecated since 0.13.0: Use .chunk_by() instead
    See .chunk_by().
    source§

    fn chunks(self, size: usize) -> IntoChunks<Self>
    where + Self: Sized,

    Return an iterable that can chunk the iterator. Read more
    source§

    fn tuple_windows<T>(self) -> TupleWindows<Self, T> ⓘ
    where Self: Sized + Iterator<Item = T::Item>, T: HomogeneousTuple, T::Item: Clone,

    Return an iterator over all contiguous windows producing tuples of -a specific size (up to 12). Read more
    source§

    fn circular_tuple_windows<T>(self) -> CircularTupleWindows<Self, T> ⓘ
    where +a specific size (up to 12). Read more

    source§

    fn circular_tuple_windows<T>(self) -> CircularTupleWindows<Self, T> ⓘ
    where Self: Sized + Clone + Iterator<Item = T::Item> + ExactSizeIterator, T: TupleCollect + Clone, T::Item: Clone,

    Return an iterator over all windows, wrapping back to the first elements when the window would otherwise exceed the length of the -iterator, producing tuples of a specific size (up to 12). Read more
    source§

    fn tuples<T>(self) -> Tuples<Self, T> ⓘ
    where +iterator, producing tuples of a specific size (up to 12). Read more

    source§

    fn tuples<T>(self) -> Tuples<Self, T> ⓘ
    where Self: Sized + Iterator<Item = T::Item>, T: HomogeneousTuple,

    Return an iterator that groups the items in tuples of a specific size -(up to 12). Read more
    source§

    fn tee(self) -> (Tee<Self>, Tee<Self>)
    where +(up to 12). Read more

    source§

    fn tee(self) -> (Tee<Self>, Tee<Self>)
    where Self: Sized, Self::Item: Clone,

    Split into an iterator pair that both yield all elements from -the original iterator. Read more
    source§

    fn step(self, n: usize) -> Step<Self> ⓘ
    where - Self: Sized,

    👎Deprecated since 0.8.0: Use std .step_by() instead
    Return an iterator adaptor that steps n elements in the base iterator -for each iteration. Read more
    source§

    fn map_into<R>(self) -> MapInto<Self, R>
    where +the original iterator. Read more

    source§

    fn map_into<R>(self) -> MapInto<Self, R>
    where Self: Sized, - Self::Item: Into<R>,

    Convert each item of the iterator using the Into trait. Read more
    source§

    fn map_results<F, T, U, E>(self, f: F) -> MapOk<Self, F>
    where - Self: Iterator<Item = Result<T, E>> + Sized, - F: FnMut(T) -> U,

    👎Deprecated since 0.10.0: Use .map_ok() instead
    See .map_ok().
    source§

    fn map_ok<F, T, U, E>(self, f: F) -> MapOk<Self, F>
    where + Self::Item: Into<R>,

    Convert each item of the iterator using the Into trait. Read more
    source§

    fn map_ok<F, T, U, E>(self, f: F) -> MapOk<Self, F>
    where Self: Iterator<Item = Result<T, E>> + Sized, F: FnMut(T) -> U,

    Return an iterator adaptor that applies the provided closure to every Result::Ok value. Result::Err values are -unchanged. Read more
    source§

    fn filter_ok<F, T, E>(self, f: F) -> FilterOk<Self, F> ⓘ
    where +unchanged. Read more

    source§

    fn filter_ok<F, T, E>(self, f: F) -> FilterOk<Self, F> ⓘ
    where Self: Iterator<Item = Result<T, E>> + Sized, F: FnMut(&T) -> bool,

    Return an iterator adaptor that filters every Result::Ok value with the provided closure. Result::Err values are -unchanged. Read more
    source§

    fn filter_map_ok<F, T, U, E>(self, f: F) -> FilterMapOk<Self, F> ⓘ
    where +unchanged. Read more

    source§

    fn filter_map_ok<F, T, U, E>(self, f: F) -> FilterMapOk<Self, F> ⓘ
    where Self: Iterator<Item = Result<T, E>> + Sized, F: FnMut(T) -> Option<U>,

    Return an iterator adaptor that filters and transforms every Result::Ok value with the provided closure. Result::Err -values are unchanged. Read more
    source§

    fn flatten_ok<T, E>(self) -> FlattenOk<Self, T, E> ⓘ
    where +values are unchanged. Read more

    source§

    fn flatten_ok<T, E>(self) -> FlattenOk<Self, T, E> ⓘ
    where Self: Iterator<Item = Result<T, E>> + Sized, T: IntoIterator,

    Return an iterator adaptor that flattens every Result::Ok value into -a series of Result::Ok values. Result::Err values are unchanged. Read more
    source§

    fn process_results<F, T, E, R>(self, processor: F) -> Result<R, E>
    where +a series of Result::Ok values. Result::Err values are unchanged. Read more

    source§

    fn process_results<F, T, E, R>(self, processor: F) -> Result<R, E>
    where Self: Iterator<Item = Result<T, E>> + Sized, F: FnOnce(ProcessResults<'_, Self, E>) -> R,

    “Lift” a function of the values of the current iterator so as to process -an iterator of Result values instead. Read more
    source§

    fn merge<J>(self, other: J) -> Merge<Self, J::IntoIter>
    where +an iterator of Result values instead. Read more

    source§

    fn merge<J>(self, other: J) -> Merge<Self, J::IntoIter>
    where Self: Sized, Self::Item: PartialOrd, J: IntoIterator<Item = Self::Item>,

    Return an iterator adaptor that merges the two base iterators in ascending order. If both base iterators are sorted (ascending), the -result is sorted. Read more
    source§

    fn merge_by<J, F>(self, other: J, is_first: F) -> MergeBy<Self, J::IntoIter, F> ⓘ
    where +result is sorted. Read more

    source§

    fn merge_by<J, F>(self, other: J, is_first: F) -> MergeBy<Self, J::IntoIter, F> ⓘ
    where Self: Sized, J: IntoIterator<Item = Self::Item>, F: FnMut(&Self::Item, &Self::Item) -> bool,

    Return an iterator adaptor that merges the two base iterators in order. -This is much like .merge() but allows for a custom ordering. Read more
    source§

    fn merge_join_by<J, F, T>( +This is much like .merge() but allows for a custom ordering. Read more

    source§

    fn merge_join_by<J, F, T>( self, other: J, cmp_fn: F @@ -312,284 +313,295 @@ This is much like IntoIterator, F: FnMut(&Self::Item, &J::Item) -> T, Self: Sized,

    Create an iterator that merges items from both this and the specified -iterator in ascending order. Read more
    source§

    fn kmerge(self) -> KMerge<<Self::Item as IntoIterator>::IntoIter>
    where +iterator in ascending order. Read more

    source§

    fn kmerge(self) -> KMerge<<Self::Item as IntoIterator>::IntoIter>
    where Self: Sized, Self::Item: IntoIterator, <Self::Item as IntoIterator>::Item: PartialOrd,

    Return an iterator adaptor that flattens an iterator of iterators by -merging them in ascending order. Read more
    source§

    fn kmerge_by<F>( +merging them in ascending order. Read more

    source§

    fn kmerge_by<F>( self, first: F ) -> KMergeBy<<Self::Item as IntoIterator>::IntoIter, F> ⓘ
    where Self: Sized, Self::Item: IntoIterator, F: FnMut(&<Self::Item as IntoIterator>::Item, &<Self::Item as IntoIterator>::Item) -> bool,

    Return an iterator adaptor that flattens an iterator of iterators by -merging them according to the given closure. Read more
    source§

    fn cartesian_product<J>(self, other: J) -> Product<Self, J::IntoIter> ⓘ
    where +merging them according to the given closure. Read more

    source§

    fn cartesian_product<J>(self, other: J) -> Product<Self, J::IntoIter> ⓘ
    where Self: Sized, Self::Item: Clone, J: IntoIterator, J::IntoIter: Clone,

    Return an iterator adaptor that iterates over the cartesian product of -the element sets of two iterators self and J. Read more
    source§

    fn multi_cartesian_product( +the element sets of two iterators self and J. Read more

    source§

    fn multi_cartesian_product( self ) -> MultiProduct<<Self::Item as IntoIterator>::IntoIter> ⓘ
    where Self: Sized, Self::Item: IntoIterator, <Self::Item as IntoIterator>::IntoIter: Clone, <Self::Item as IntoIterator>::Item: Clone,

    Return an iterator adaptor that iterates over the cartesian product of -all subiterators returned by meta-iterator self. Read more
    source§

    fn coalesce<F>(self, f: F) -> Coalesce<Self, F>
    where +all subiterators returned by meta-iterator self. Read more

    source§

    fn coalesce<F>(self, f: F) -> Coalesce<Self, F>
    where Self: Sized, F: FnMut(Self::Item, Self::Item) -> Result<Self::Item, (Self::Item, Self::Item)>,

    Return an iterator adaptor that uses the passed-in closure to -optionally merge together consecutive elements. Read more
    source§

    fn dedup(self) -> Dedup<Self>
    where +optionally merge together consecutive elements. Read more

    source§

    fn dedup(self) -> Dedup<Self>
    where Self: Sized, Self::Item: PartialEq,

    Remove duplicates from sections of consecutive identical elements. -If the iterator is sorted, all elements will be unique. Read more
    source§

    fn dedup_by<Cmp>(self, cmp: Cmp) -> DedupBy<Self, Cmp>
    where +If the iterator is sorted, all elements will be unique. Read more

    source§

    fn dedup_by<Cmp>(self, cmp: Cmp) -> DedupBy<Self, Cmp>
    where Self: Sized, Cmp: FnMut(&Self::Item, &Self::Item) -> bool,

    Remove duplicates from sections of consecutive identical elements, determining equality using a comparison function. -If the iterator is sorted, all elements will be unique. Read more
    source§

    fn dedup_with_count(self) -> DedupWithCount<Self>
    where +If the iterator is sorted, all elements will be unique. Read more

    source§

    fn dedup_with_count(self) -> DedupWithCount<Self>
    where Self: Sized,

    Remove duplicates from sections of consecutive identical elements, while keeping a count of how many repeated elements were present. -If the iterator is sorted, all elements will be unique. Read more
    source§

    fn dedup_by_with_count<Cmp>(self, cmp: Cmp) -> DedupByWithCount<Self, Cmp>
    where +If the iterator is sorted, all elements will be unique. Read more

    source§

    fn dedup_by_with_count<Cmp>(self, cmp: Cmp) -> DedupByWithCount<Self, Cmp>
    where Self: Sized, Cmp: FnMut(&Self::Item, &Self::Item) -> bool,

    Remove duplicates from sections of consecutive identical elements, while keeping a count of how many repeated elements were present. This will determine equality using a comparison function. -If the iterator is sorted, all elements will be unique. Read more
    source§

    fn duplicates(self) -> Duplicates<Self>
    where +If the iterator is sorted, all elements will be unique. Read more

    source§

    fn duplicates(self) -> Duplicates<Self>
    where Self: Sized, Self::Item: Eq + Hash,

    Return an iterator adaptor that produces elements that appear more than once during the -iteration. Duplicates are detected using hash and equality. Read more
    source§

    fn duplicates_by<V, F>(self, f: F) -> DuplicatesBy<Self, V, F>
    where +iteration. Duplicates are detected using hash and equality. Read more

    source§

    fn duplicates_by<V, F>(self, f: F) -> DuplicatesBy<Self, V, F>
    where Self: Sized, V: Eq + Hash, F: FnMut(&Self::Item) -> V,

    Return an iterator adaptor that produces elements that appear more than once during the -iteration. Duplicates are detected using hash and equality. Read more
    source§

    fn unique(self) -> Unique<Self> ⓘ
    where +iteration. Duplicates are detected using hash and equality. Read more

    source§

    fn unique(self) -> Unique<Self> ⓘ
    where Self: Sized, Self::Item: Clone + Eq + Hash,

    Return an iterator adaptor that filters out elements that have already been produced once during the iteration. Duplicates -are detected using hash and equality. Read more
    source§

    fn unique_by<V, F>(self, f: F) -> UniqueBy<Self, V, F> ⓘ
    where +are detected using hash and equality. Read more

    source§

    fn unique_by<V, F>(self, f: F) -> UniqueBy<Self, V, F> ⓘ
    where Self: Sized, V: Eq + Hash, F: FnMut(&Self::Item) -> V,

    Return an iterator adaptor that filters out elements that have -already been produced once during the iteration. Read more
    source§

    fn peeking_take_while<F>(&mut self, accept: F) -> PeekingTakeWhile<'_, Self, F> ⓘ
    where +already been produced once during the iteration. Read more

    source§

    fn peeking_take_while<F>(&mut self, accept: F) -> PeekingTakeWhile<'_, Self, F> ⓘ
    where Self: Sized + PeekingNext, F: FnMut(&Self::Item) -> bool,

    Return an iterator adaptor that borrows from this iterator and -takes items while the closure accept returns true. Read more
    source§

    fn take_while_ref<F>(&mut self, accept: F) -> TakeWhileRef<'_, Self, F> ⓘ
    where +takes items while the closure accept returns true. Read more

    source§

    fn take_while_ref<F>(&mut self, accept: F) -> TakeWhileRef<'_, Self, F> ⓘ
    where Self: Clone, F: FnMut(&Self::Item) -> bool,

    Return an iterator adaptor that borrows from a Clone-able iterator -to only pick off elements while the predicate accept returns true. Read more
    source§

    fn take_while_inclusive<F>(self, accept: F) -> TakeWhileInclusive<Self, F> ⓘ
    where +to only pick off elements while the predicate accept returns true. Read more

    source§

    fn take_while_inclusive<F>(self, accept: F) -> TakeWhileInclusive<Self, F> ⓘ
    where Self: Sized, F: FnMut(&Self::Item) -> bool,

    Returns an iterator adaptor that consumes elements while the given predicate is true, including the element for which the predicate -first returned false. Read more
    source§

    fn while_some<A>(self) -> WhileSome<Self> ⓘ
    where +first returned false. Read more

    source§

    fn while_some<A>(self) -> WhileSome<Self> ⓘ
    where Self: Sized + Iterator<Item = Option<A>>,

    Return an iterator adaptor that filters Option<A> iterator elements -and produces A. Stops on the first None encountered. Read more
    source§

    fn tuple_combinations<T>(self) -> TupleCombinations<Self, T> ⓘ
    where +and produces A. Stops on the first None encountered. Read more

    source§

    fn tuple_combinations<T>(self) -> TupleCombinations<Self, T> ⓘ
    where Self: Sized + Clone, Self::Item: Clone, T: HasCombination<Self>,

    Return an iterator adaptor that iterates over the combinations of the -elements from an iterator. Read more
    source§

    fn combinations(self, k: usize) -> Combinations<Self> ⓘ
    where +elements from an iterator. Read more

    source§

    fn combinations(self, k: usize) -> Combinations<Self> ⓘ
    where Self: Sized, Self::Item: Clone,

    Return an iterator adaptor that iterates over the k-length combinations of -the elements from an iterator. Read more
    source§

    fn combinations_with_replacement( +the elements from an iterator. Read more

    source§

    fn combinations_with_replacement( self, k: usize ) -> CombinationsWithReplacement<Self> ⓘ
    where Self: Sized, Self::Item: Clone,

    Return an iterator that iterates over the k-length combinations of -the elements from an iterator, with replacement. Read more
    source§

    fn permutations(self, k: usize) -> Permutations<Self> ⓘ
    where +the elements from an iterator, with replacement. Read more

    source§

    fn permutations(self, k: usize) -> Permutations<Self> ⓘ
    where Self: Sized, Self::Item: Clone,

    Return an iterator adaptor that iterates over all k-permutations of the -elements from an iterator. Read more
    source§

    fn powerset(self) -> Powerset<Self> ⓘ
    where +elements from an iterator. Read more

    source§

    fn powerset(self) -> Powerset<Self> ⓘ
    where Self: Sized, Self::Item: Clone,

    Return an iterator that iterates through the powerset of the elements from an -iterator. Read more
    source§

    fn pad_using<F>(self, min: usize, f: F) -> PadUsing<Self, F> ⓘ
    where +iterator. Read more

    source§

    fn pad_using<F>(self, min: usize, f: F) -> PadUsing<Self, F> ⓘ
    where Self: Sized, F: FnMut(usize) -> Self::Item,

    Return an iterator adaptor that pads the sequence to a minimum length of -min by filling missing elements using a closure f. Read more
    source§

    fn with_position(self) -> WithPosition<Self> ⓘ
    where +min by filling missing elements using a closure f. Read more

    source§

    fn with_position(self) -> WithPosition<Self> ⓘ
    where Self: Sized,

    Return an iterator adaptor that combines each element with a Position to -ease special-case handling of the first or last elements. Read more
    source§

    fn positions<P>(self, predicate: P) -> Positions<Self, P> ⓘ
    where +ease special-case handling of the first or last elements. Read more

    source§

    fn positions<P>(self, predicate: P) -> Positions<Self, P> ⓘ
    where Self: Sized, P: FnMut(Self::Item) -> bool,

    Return an iterator adaptor that yields the indices of all elements -satisfying a predicate, counted from the start of the iterator. Read more
    source§

    fn update<F>(self, updater: F) -> Update<Self, F> ⓘ
    where +satisfying a predicate, counted from the start of the iterator. Read more

    source§

    fn update<F>(self, updater: F) -> Update<Self, F> ⓘ
    where Self: Sized, F: FnMut(&mut Self::Item),

    Return an iterator adaptor that applies a mutating function -to each element before yielding it. Read more
    source§

    fn next_tuple<T>(&mut self) -> Option<T>
    where +to each element before yielding it. Read more

    source§

    fn next_tuple<T>(&mut self) -> Option<T>
    where Self: Sized + Iterator<Item = T::Item>, T: HomogeneousTuple,

    Advances the iterator and returns the next items grouped in a tuple of -a specific size (up to 12). Read more
    source§

    fn collect_tuple<T>(self) -> Option<T>
    where +a specific size (up to 12). Read more

    source§

    fn collect_tuple<T>(self) -> Option<T>
    where Self: Sized + Iterator<Item = T::Item>, T: HomogeneousTuple,

    Collects all items from the iterator into a tuple of a specific size -(up to 12). Read more
    source§

    fn find_position<P>(&mut self, pred: P) -> Option<(usize, Self::Item)>
    where - P: FnMut(&Self::Item) -> bool,

    Find the position and value of the first element satisfying a predicate. Read more
    source§

    fn find_or_last<P>(self, predicate: P) -> Option<Self::Item>
    where +(up to 12). Read more

    source§

    fn find_position<P>(&mut self, pred: P) -> Option<(usize, Self::Item)>
    where + P: FnMut(&Self::Item) -> bool,

    Find the position and value of the first element satisfying a predicate. Read more
    source§

    fn find_or_last<P>(self, predicate: P) -> Option<Self::Item>
    where Self: Sized, - P: FnMut(&Self::Item) -> bool,

    Find the value of the first element satisfying a predicate or return the last element, if any. Read more
    source§

    fn find_or_first<P>(self, predicate: P) -> Option<Self::Item>
    where + P: FnMut(&Self::Item) -> bool,

    Find the value of the first element satisfying a predicate or return the last element, if any. Read more
    source§

    fn find_or_first<P>(self, predicate: P) -> Option<Self::Item>
    where Self: Sized, - P: FnMut(&Self::Item) -> bool,

    Find the value of the first element satisfying a predicate or return the first element, if any. Read more
    source§

    fn contains<Q>(&mut self, query: &Q) -> bool
    where + P: FnMut(&Self::Item) -> bool,

    Find the value of the first element satisfying a predicate or return the first element, if any. Read more
    source§

    fn contains<Q>(&mut self, query: &Q) -> bool
    where Self: Sized, Self::Item: Borrow<Q>, - Q: PartialEq,

    Returns true if the given item is present in this iterator. Read more
    source§

    fn all_equal(&mut self) -> bool
    where + Q: PartialEq,

    Returns true if the given item is present in this iterator. Read more
    source§

    fn all_equal(&mut self) -> bool
    where Self: Sized, - Self::Item: PartialEq,

    Check whether all elements compare equal. Read more
    source§

    fn all_equal_value( + Self::Item: PartialEq,

    Check whether all elements compare equal. Read more
    source§

    fn all_equal_value( &mut self ) -> Result<Self::Item, Option<(Self::Item, Self::Item)>>
    where Self: Sized, Self::Item: PartialEq,

    If there are elements and they are all equal, return a single copy of that element. If there are no elements, return an Error containing None. If there are elements and they are not all equal, return a tuple containing the first -two non-equal elements found. Read more
    source§

    fn all_unique(&mut self) -> bool
    where +two non-equal elements found. Read more

    source§

    fn all_unique(&mut self) -> bool
    where Self: Sized, - Self::Item: Eq + Hash,

    Check whether all elements are unique (non equal). Read more
    source§

    fn dropping(self, n: usize) -> Self
    where + Self::Item: Eq + Hash,

    Check whether all elements are unique (non equal). Read more
    source§

    fn dropping(self, n: usize) -> Self
    where Self: Sized,

    Consume the first n elements from the iterator eagerly, -and return the same iterator again. Read more
    source§

    fn dropping_back(self, n: usize) -> Self
    where +and return the same iterator again. Read more

    source§

    fn dropping_back(self, n: usize) -> Self
    where Self: Sized + DoubleEndedIterator,

    Consume the last n elements from the iterator eagerly, -and return the same iterator again. Read more
    source§

    fn foreach<F>(self, f: F)
    where - F: FnMut(Self::Item), - Self: Sized,

    👎Deprecated since 0.8.0: Use .for_each() instead
    Run the closure f eagerly on each element of the iterator. Read more
    source§

    fn concat(self) -> Self::Item
    where +and return the same iterator again. Read more

    source§

    fn concat(self) -> Self::Item
    where Self: Sized, - Self::Item: Extend<<<Self as Iterator>::Item as IntoIterator>::Item> + IntoIterator + Default,

    Combine all an iterator’s elements into one element by using Extend. Read more
    source§

    fn collect_vec(self) -> Vec<Self::Item>
    where + Self::Item: Extend<<<Self as Iterator>::Item as IntoIterator>::Item> + IntoIterator + Default,

    Combine all an iterator’s elements into one element by using Extend. Read more
    source§

    fn collect_vec(self) -> Vec<Self::Item>
    where Self: Sized,

    .collect_vec() is simply a type specialization of Iterator::collect, -for convenience.
    source§

    fn try_collect<T, U, E>(self) -> Result<U, E>
    where +for convenience.

    source§

    fn try_collect<T, U, E>(self) -> Result<U, E>
    where Self: Sized + Iterator<Item = Result<T, E>>, Result<U, E>: FromIterator<Result<T, E>>,

    .try_collect() is more convenient way of writing -.collect::<Result<_, _>>() Read more
    source§

    fn set_from<'a, A: 'a, J>(&mut self, from: J) -> usize
    where +.collect::<Result<_, _>>() Read more

    source§

    fn set_from<'a, A: 'a, J>(&mut self, from: J) -> usize
    where Self: Iterator<Item = &'a mut A>, J: IntoIterator<Item = A>,

    Assign to each reference in self from the from iterator, -stopping at the shortest of the two iterators. Read more
    source§

    fn join(&mut self, sep: &str) -> String
    where - Self::Item: Display,

    Combine all iterator elements into one String, separated by sep. Read more
    source§

    fn format(self, sep: &str) -> Format<'_, Self>
    where - Self: Sized,

    Format all iterator elements, separated by sep. Read more
    source§

    fn format_with<F>(self, sep: &str, format: F) -> FormatWith<'_, Self, F>
    where +stopping at the shortest of the two iterators. Read more

    source§

    fn join(&mut self, sep: &str) -> String
    where + Self::Item: Display,

    Combine all iterator elements into one String, separated by sep. Read more
    source§

    fn format(self, sep: &str) -> Format<'_, Self>
    where + Self: Sized,

    Format all iterator elements, separated by sep. Read more
    source§

    fn format_with<F>(self, sep: &str, format: F) -> FormatWith<'_, Self, F>
    where Self: Sized, - F: FnMut(Self::Item, &mut dyn FnMut(&dyn Display) -> Result) -> Result,

    Format all iterator elements, separated by sep. Read more
    source§

    fn fold_results<A, E, B, F>(&mut self, start: B, f: F) -> Result<B, E>
    where + F: FnMut(Self::Item, &mut dyn FnMut(&dyn Display) -> Result) -> Result,

    Format all iterator elements, separated by sep. Read more
    source§

    fn fold_ok<A, E, B, F>(&mut self, start: B, f: F) -> Result<B, E>
    where Self: Iterator<Item = Result<A, E>>, - F: FnMut(B, A) -> B,

    👎Deprecated since 0.10.0: Use .fold_ok() instead
    See .fold_ok().
    source§

    fn fold_ok<A, E, B, F>(&mut self, start: B, f: F) -> Result<B, E>
    where - Self: Iterator<Item = Result<A, E>>, - F: FnMut(B, A) -> B,

    Fold Result values from an iterator. Read more
    source§

    fn fold_options<A, B, F>(&mut self, start: B, f: F) -> Option<B>
    where + F: FnMut(B, A) -> B,

    Fold Result values from an iterator. Read more
    source§

    fn fold_options<A, B, F>(&mut self, start: B, f: F) -> Option<B>
    where Self: Iterator<Item = Option<A>>, - F: FnMut(B, A) -> B,

    Fold Option values from an iterator. Read more
    source§

    fn fold1<F>(self, f: F) -> Option<Self::Item>
    where + F: FnMut(B, A) -> B,

    Fold Option values from an iterator. Read more
    source§

    fn fold1<F>(self, f: F) -> Option<Self::Item>
    where F: FnMut(Self::Item, Self::Item) -> Self::Item, - Self: Sized,

    👎Deprecated since 0.10.2: Use Iterator::reduce instead
    Accumulator of the elements in the iterator. Read more
    source§

    fn tree_fold1<F>(self, f: F) -> Option<Self::Item>
    where + Self: Sized,

    👎Deprecated since 0.10.2: Use Iterator::reduce instead
    Accumulator of the elements in the iterator. Read more
    source§

    fn tree_reduce<F>(self, f: F) -> Option<Self::Item>
    where F: FnMut(Self::Item, Self::Item) -> Self::Item, - Self: Sized,

    Accumulate the elements in the iterator in a tree-like manner. Read more
    source§

    fn fold_while<B, F>(&mut self, init: B, f: F) -> FoldWhile<B>
    where + Self: Sized,

    Accumulate the elements in the iterator in a tree-like manner. Read more
    source§

    fn tree_fold1<F>(self, f: F) -> Option<Self::Item>
    where + F: FnMut(Self::Item, Self::Item) -> Self::Item, + Self: Sized,

    👎Deprecated since 0.13.0: Use .tree_reduce() instead
    See .tree_reduce().
    source§

    fn fold_while<B, F>(&mut self, init: B, f: F) -> FoldWhile<B>
    where Self: Sized, - F: FnMut(B, Self::Item) -> FoldWhile<B>,

    An iterator method that applies a function, producing a single, final value. Read more
    source§

    fn sum1<S>(self) -> Option<S>
    where + F: FnMut(B, Self::Item) -> FoldWhile<B>,

    An iterator method that applies a function, producing a single, final value. Read more
    source§

    fn sum1<S>(self) -> Option<S>
    where Self: Sized, - S: Sum<Self::Item>,

    Iterate over the entire iterator and add all the elements. Read more
    source§

    fn product1<P>(self) -> Option<P>
    where + S: Sum<Self::Item>,

    Iterate over the entire iterator and add all the elements. Read more
    source§

    fn product1<P>(self) -> Option<P>
    where Self: Sized, - P: Product<Self::Item>,

    Iterate over the entire iterator and multiply all the elements. Read more
    source§

    fn sorted_unstable(self) -> IntoIter<Self::Item> ⓘ
    where + P: Product<Self::Item>,

    Iterate over the entire iterator and multiply all the elements. Read more
    source§

    fn sorted_unstable(self) -> IntoIter<Self::Item> ⓘ
    where Self: Sized, - Self::Item: Ord,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_unstable_by<F>(self, cmp: F) -> IntoIter<Self::Item> ⓘ
    where + Self::Item: Ord,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_unstable_by<F>(self, cmp: F) -> IntoIter<Self::Item> ⓘ
    where Self: Sized, - F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_unstable_by_key<K, F>(self, f: F) -> IntoIter<Self::Item> ⓘ
    where + F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_unstable_by_key<K, F>(self, f: F) -> IntoIter<Self::Item> ⓘ
    where Self: Sized, K: Ord, - F: FnMut(&Self::Item) -> K,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted(self) -> IntoIter<Self::Item> ⓘ
    where + F: FnMut(&Self::Item) -> K,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted(self) -> IntoIter<Self::Item> ⓘ
    where Self: Sized, - Self::Item: Ord,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_by<F>(self, cmp: F) -> IntoIter<Self::Item> ⓘ
    where + Self::Item: Ord,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_by<F>(self, cmp: F) -> IntoIter<Self::Item> ⓘ
    where Self: Sized, - F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_by_key<K, F>(self, f: F) -> IntoIter<Self::Item> ⓘ
    where + F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_by_key<K, F>(self, f: F) -> IntoIter<Self::Item> ⓘ
    where Self: Sized, K: Ord, - F: FnMut(&Self::Item) -> K,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_by_cached_key<K, F>(self, f: F) -> IntoIter<Self::Item> ⓘ
    where + F: FnMut(&Self::Item) -> K,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_by_cached_key<K, F>(self, f: F) -> IntoIter<Self::Item> ⓘ
    where Self: Sized, K: Ord, F: FnMut(&Self::Item) -> K,

    Sort all iterator elements into a new iterator in ascending order. The key function is -called exactly once per key. Read more
    source§

    fn k_smallest(self, k: usize) -> IntoIter<Self::Item> ⓘ
    where +called exactly once per key. Read more

    source§

    fn k_smallest(self, k: usize) -> IntoIter<Self::Item> ⓘ
    where Self: Sized, - Self::Item: Ord,

    Sort the k smallest elements into a new iterator, in ascending order. Read more
    source§

    fn partition_map<A, B, F, L, R>(self, predicate: F) -> (A, B)
    where + Self::Item: Ord,

    Sort the k smallest elements into a new iterator, in ascending order. Read more
    source§

    fn k_smallest_by<F>(self, k: usize, cmp: F) -> IntoIter<Self::Item> ⓘ
    where + Self: Sized, + F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Sort the k smallest elements into a new iterator using the provided comparison. Read more
    source§

    fn k_smallest_by_key<F, K>(self, k: usize, key: F) -> IntoIter<Self::Item> ⓘ
    where + Self: Sized, + F: FnMut(&Self::Item) -> K, + K: Ord,

    Return the elements producing the k smallest outputs of the provided function. Read more
    source§

    fn k_largest(self, k: usize) -> IntoIter<Self::Item> ⓘ
    where + Self: Sized, + Self::Item: Ord,

    Sort the k largest elements into a new iterator, in descending order. Read more
    source§

    fn k_largest_by<F>(self, k: usize, cmp: F) -> IntoIter<Self::Item> ⓘ
    where + Self: Sized, + F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Sort the k largest elements into a new iterator using the provided comparison. Read more
    source§

    fn k_largest_by_key<F, K>(self, k: usize, key: F) -> IntoIter<Self::Item> ⓘ
    where + Self: Sized, + F: FnMut(&Self::Item) -> K, + K: Ord,

    Return the elements producing the k largest outputs of the provided function. Read more
    source§

    fn tail(self, n: usize) -> IntoIter<Self::Item> ⓘ
    where + Self: Sized,

    Consumes the iterator and return an iterator of the last n elements. Read more
    source§

    fn partition_map<A, B, F, L, R>(self, predicate: F) -> (A, B)
    where Self: Sized, F: FnMut(Self::Item) -> Either<L, R>, A: Default + Extend<L>, B: Default + Extend<R>,

    Collect all iterator elements into one of two partitions. Unlike Iterator::partition, each partition may -have a distinct type. Read more
    source§

    fn partition_result<A, B, T, E>(self) -> (A, B)
    where +have a distinct type. Read more

    source§

    fn partition_result<A, B, T, E>(self) -> (A, B)
    where Self: Iterator<Item = Result<T, E>> + Sized, A: Default + Extend<T>, B: Default + Extend<E>,

    Partition a sequence of Results into one list of all the Ok elements -and another list of all the Err elements. Read more
    source§

    fn into_group_map<K, V>(self) -> HashMap<K, Vec<V>>
    where +and another list of all the Err elements. Read more

    source§

    fn into_group_map<K, V>(self) -> HashMap<K, Vec<V>>
    where Self: Iterator<Item = (K, V)> + Sized, K: Hash + Eq,

    Return a HashMap of keys mapped to Vecs of values. Keys and values -are taken from (Key, Value) tuple pairs yielded by the input iterator. Read more
    source§

    fn into_group_map_by<K, V, F>(self, f: F) -> HashMap<K, Vec<V>>
    where +are taken from (Key, Value) tuple pairs yielded by the input iterator. Read more

    source§

    fn into_group_map_by<K, V, F>(self, f: F) -> HashMap<K, Vec<V>>
    where Self: Iterator<Item = V> + Sized, K: Hash + Eq, - F: Fn(&V) -> K,

    Return an Iterator on a HashMap. Keys mapped to Vecs of values. The key is specified -in the closure. Read more
    source§

    fn into_grouping_map<K, V>(self) -> GroupingMap<Self>
    where + F: FnMut(&V) -> K,

    Return an Iterator on a HashMap. Keys mapped to Vecs of values. The key is specified +in the closure. Read more
    source§

    fn into_grouping_map<K, V>(self) -> GroupingMap<Self>
    where Self: Iterator<Item = (K, V)> + Sized, K: Hash + Eq,

    Constructs a GroupingMap to be used later with one of the efficient -group-and-fold operations it allows to perform. Read more
    source§

    fn into_grouping_map_by<K, V, F>(self, key_mapper: F) -> GroupingMapBy<Self, F>
    where +group-and-fold operations it allows to perform. Read more

    source§

    fn into_grouping_map_by<K, V, F>(self, key_mapper: F) -> GroupingMapBy<Self, F>
    where Self: Iterator<Item = V> + Sized, K: Hash + Eq, F: FnMut(&V) -> K,

    Constructs a GroupingMap to be used later with one of the efficient -group-and-fold operations it allows to perform. Read more
    source§

    fn min_set(self) -> Vec<Self::Item>
    where +group-and-fold operations it allows to perform. Read more

    source§

    fn min_set(self) -> Vec<Self::Item>
    where Self: Sized, - Self::Item: Ord,

    Return all minimum elements of an iterator. Read more
    source§

    fn min_set_by<F>(self, compare: F) -> Vec<Self::Item>
    where + Self::Item: Ord,

    Return all minimum elements of an iterator. Read more
    source§

    fn min_set_by<F>(self, compare: F) -> Vec<Self::Item>
    where Self: Sized, F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Return all minimum elements of an iterator, as determined by -the specified function. Read more
    source§

    fn min_set_by_key<K, F>(self, key: F) -> Vec<Self::Item>
    where +the specified function. Read more

    source§

    fn min_set_by_key<K, F>(self, key: F) -> Vec<Self::Item>
    where Self: Sized, K: Ord, F: FnMut(&Self::Item) -> K,

    Return all minimum elements of an iterator, as determined by -the specified function. Read more
    source§

    fn max_set(self) -> Vec<Self::Item>
    where +the specified function. Read more

    source§

    fn max_set(self) -> Vec<Self::Item>
    where Self: Sized, - Self::Item: Ord,

    Return all maximum elements of an iterator. Read more
    source§

    fn max_set_by<F>(self, compare: F) -> Vec<Self::Item>
    where + Self::Item: Ord,

    Return all maximum elements of an iterator. Read more
    source§

    fn max_set_by<F>(self, compare: F) -> Vec<Self::Item>
    where Self: Sized, F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Return all maximum elements of an iterator, as determined by -the specified function. Read more
    source§

    fn max_set_by_key<K, F>(self, key: F) -> Vec<Self::Item>
    where +the specified function. Read more

    source§

    fn max_set_by_key<K, F>(self, key: F) -> Vec<Self::Item>
    where Self: Sized, K: Ord, F: FnMut(&Self::Item) -> K,

    Return all maximum elements of an iterator, as determined by -the specified function. Read more
    source§

    fn minmax(self) -> MinMaxResult<Self::Item>
    where +the specified function. Read more

    source§

    fn minmax(self) -> MinMaxResult<Self::Item>
    where Self: Sized, - Self::Item: PartialOrd,

    Return the minimum and maximum elements in the iterator. Read more
    source§

    fn minmax_by_key<K, F>(self, key: F) -> MinMaxResult<Self::Item>
    where + Self::Item: PartialOrd,

    Return the minimum and maximum elements in the iterator. Read more
    source§

    fn minmax_by_key<K, F>(self, key: F) -> MinMaxResult<Self::Item>
    where Self: Sized, K: PartialOrd, F: FnMut(&Self::Item) -> K,

    Return the minimum and maximum element of an iterator, as determined by -the specified function. Read more
    source§

    fn minmax_by<F>(self, compare: F) -> MinMaxResult<Self::Item>
    where +the specified function. Read more

    source§

    fn minmax_by<F>(self, compare: F) -> MinMaxResult<Self::Item>
    where Self: Sized, F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Return the minimum and maximum element of an iterator, as determined by -the specified comparison function. Read more
    source§

    fn position_max(self) -> Option<usize>
    where +the specified comparison function. Read more

    source§

    fn position_max(self) -> Option<usize>
    where Self: Sized, - Self::Item: Ord,

    Return the position of the maximum element in the iterator. Read more
    source§

    fn position_max_by_key<K, F>(self, key: F) -> Option<usize>
    where + Self::Item: Ord,

    Return the position of the maximum element in the iterator. Read more
    source§

    fn position_max_by_key<K, F>(self, key: F) -> Option<usize>
    where Self: Sized, K: Ord, F: FnMut(&Self::Item) -> K,

    Return the position of the maximum element in the iterator, as -determined by the specified function. Read more
    source§

    fn position_max_by<F>(self, compare: F) -> Option<usize>
    where +determined by the specified function. Read more

    source§

    fn position_max_by<F>(self, compare: F) -> Option<usize>
    where Self: Sized, F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Return the position of the maximum element in the iterator, as -determined by the specified comparison function. Read more
    source§

    fn position_min(self) -> Option<usize>
    where +determined by the specified comparison function. Read more

    source§

    fn position_min(self) -> Option<usize>
    where Self: Sized, - Self::Item: Ord,

    Return the position of the minimum element in the iterator. Read more
    source§

    fn position_min_by_key<K, F>(self, key: F) -> Option<usize>
    where + Self::Item: Ord,

    Return the position of the minimum element in the iterator. Read more
    source§

    fn position_min_by_key<K, F>(self, key: F) -> Option<usize>
    where Self: Sized, K: Ord, F: FnMut(&Self::Item) -> K,

    Return the position of the minimum element in the iterator, as -determined by the specified function. Read more
    source§

    fn position_min_by<F>(self, compare: F) -> Option<usize>
    where +determined by the specified function. Read more

    source§

    fn position_min_by<F>(self, compare: F) -> Option<usize>
    where Self: Sized, F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Return the position of the minimum element in the iterator, as -determined by the specified comparison function. Read more
    source§

    fn position_minmax(self) -> MinMaxResult<usize>
    where +determined by the specified comparison function. Read more

    source§

    fn position_minmax(self) -> MinMaxResult<usize>
    where Self: Sized, Self::Item: PartialOrd,

    Return the positions of the minimum and maximum elements in -the iterator. Read more
    source§

    fn position_minmax_by_key<K, F>(self, key: F) -> MinMaxResult<usize>
    where +the iterator. Read more

    source§

    fn position_minmax_by_key<K, F>(self, key: F) -> MinMaxResult<usize>
    where Self: Sized, K: PartialOrd, F: FnMut(&Self::Item) -> K,

    Return the postions of the minimum and maximum elements of an -iterator, as determined by the specified function. Read more
    source§

    fn position_minmax_by<F>(self, compare: F) -> MinMaxResult<usize>
    where +iterator, as determined by the specified function. Read more

    source§

    fn position_minmax_by<F>(self, compare: F) -> MinMaxResult<usize>
    where Self: Sized, F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Return the postions of the minimum and maximum elements of an -iterator, as determined by the specified comparison function. Read more
    source§

    fn exactly_one(self) -> Result<Self::Item, ExactlyOneError<Self>>
    where +iterator, as determined by the specified comparison function. Read more

    source§

    fn exactly_one(self) -> Result<Self::Item, ExactlyOneError<Self>>
    where Self: Sized,

    If the iterator yields exactly one element, that element will be returned, otherwise an error will be returned containing an iterator that has the same output as the input -iterator. Read more
    source§

    fn at_most_one(self) -> Result<Option<Self::Item>, ExactlyOneError<Self>>
    where - Self: Sized,

    If the iterator yields no elements, Ok(None) will be returned. If the iterator yields +iterator. Read more
    source§

    fn at_most_one(self) -> Result<Option<Self::Item>, ExactlyOneError<Self>>
    where + Self: Sized,

    If the iterator yields no elements, Ok(None) will be returned. If the iterator yields exactly one element, that element will be returned, otherwise an error will be returned -containing an iterator that has the same output as the input iterator. Read more
    source§

    fn multipeek(self) -> MultiPeek<Self> ⓘ
    where +containing an iterator that has the same output as the input iterator. Read more

    source§

    fn multipeek(self) -> MultiPeek<Self> ⓘ
    where Self: Sized,

    An iterator adaptor that allows the user to peek at multiple .next() -values without advancing the base iterator. Read more
    source§

    fn counts(self) -> HashMap<Self::Item, usize>
    where +values without advancing the base iterator. Read more

    source§

    fn counts(self) -> HashMap<Self::Item, usize>
    where Self: Sized, Self::Item: Eq + Hash,

    Collect the items in this iterator and return a HashMap which contains each item that appears in the iterator and the number -of times it appears. Read more
    source§

    fn counts_by<K, F>(self, f: F) -> HashMap<K, usize>
    where +of times it appears. Read more

    source§

    fn counts_by<K, F>(self, f: F) -> HashMap<K, usize>
    where Self: Sized, K: Eq + Hash, F: FnMut(Self::Item) -> K,

    Collect the items in this iterator and return a HashMap which contains each item that appears in the iterator and the number of times it appears, -determining identity using a keying function. Read more
    source§

    fn multiunzip<FromI>(self) -> FromI
    where - Self: Sized + MultiUnzip<FromI>,

    Converts an iterator of tuples into a tuple of containers. Read more
    source§

    fn try_len(&self) -> Result<usize, (usize, Option<usize>)>

    Returns the length of the iterator if one exists. +determining identity using a keying function. Read more
    source§

    fn multiunzip<FromI>(self) -> FromI
    where + Self: Sized + MultiUnzip<FromI>,

    Converts an iterator of tuples into a tuple of containers. Read more
    source§

    fn try_len(&self) -> Result<usize, (usize, Option<usize>)>

    Returns the length of the iterator if one exists. Otherwise return self.size_hint(). Read more
    source§

    impl<IT> MultiUnzip<()> for IT
    where IT: Iterator<Item = ()>,

    source§

    fn multiunzip(self)

    Unzip this iterator into multiple collections.
    source§

    impl<IT, A, FromA> MultiUnzip<(FromA,)> for IT
    where IT: Iterator<Item = (A,)>, @@ -692,4 +704,4 @@ Otherwise return self.size_hint(). (FromA, FromB, FromC, FromD, FromE, FromF, FromG, FromH, FromI, FromJ, FromK, FromL)

    Unzip this iterator into multiple collections.
    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 + 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/itertools/structs/struct.UniqueBy.html b/itertools/structs/struct.UniqueBy.html index f3c9e6525..1c03e1ca1 100644 --- a/itertools/structs/struct.UniqueBy.html +++ b/itertools/structs/struct.UniqueBy.html @@ -1,4 +1,4 @@ -UniqueBy in itertools::structs - Rust
    +UniqueBy in itertools::structs - Rust

    Struct itertools::structs::UniqueBy

    source · 
    pub struct UniqueBy<I: Iterator, V, F> { /* private fields */ }
    Expand description

    An iterator adapter to filter out duplicate elements.

    See .unique_by() for more information.

    Trait Implementations§

    source§

    impl<I: Clone + Iterator, V: Clone, F: Clone> Clone for UniqueBy<I, V, F>

    source§

    fn clone(&self) -> UniqueBy<I, V, F> ⓘ

    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<I, V, F> Debug for UniqueBy<I, V, F>
    where @@ -230,86 +230,87 @@ otherwise. Right variant of Either<Self, Self> otherwise. Read more

    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> Itertools for T
    where - T: Iterator + ?Sized,

    source§

    fn interleave<J>(self, other: J) -> Interleave<Self, J::IntoIter> ⓘ
    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> Itertools for T
    where + T: Iterator + ?Sized,

    source§

    fn interleave<J>(self, other: J) -> Interleave<Self, J::IntoIter> ⓘ
    where J: IntoIterator<Item = Self::Item>, - Self: Sized,

    Alternate elements from two iterators until both have run out. Read more
    source§

    fn interleave_shortest<J>( + Self: Sized,

    Alternate elements from two iterators until both have run out. Read more
    source§

    fn interleave_shortest<J>( self, other: J ) -> InterleaveShortest<Self, J::IntoIter> ⓘ
    where J: IntoIterator<Item = Self::Item>, Self: Sized,

    Alternate elements from two iterators until at least one of them has run -out. Read more
    source§

    fn intersperse(self, element: Self::Item) -> Intersperse<Self>
    where +out. Read more

    source§

    fn intersperse(self, element: Self::Item) -> Intersperse<Self>
    where Self: Sized, Self::Item: Clone,

    An iterator adaptor to insert a particular value -between each element of the adapted iterator. Read more
    source§

    fn intersperse_with<F>(self, element: F) -> IntersperseWith<Self, F> ⓘ
    where +between each element of the adapted iterator. Read more

    source§

    fn intersperse_with<F>(self, element: F) -> IntersperseWith<Self, F> ⓘ
    where Self: Sized, F: FnMut() -> Self::Item,

    An iterator adaptor to insert a particular value created by a function -between each element of the adapted iterator. Read more
    source§

    fn zip_longest<J>(self, other: J) -> ZipLongest<Self, J::IntoIter> ⓘ
    where +between each element of the adapted iterator. Read more

    source§

    fn get<R>(self, index: R) -> R::Output
    where + Self: Sized, + R: IteratorIndex<Self>,

    Returns an iterator over a subsection of the iterator. Read more
    source§

    fn zip_longest<J>(self, other: J) -> ZipLongest<Self, J::IntoIter> ⓘ
    where J: IntoIterator, Self: Sized,

    Create an iterator which iterates over both this and the specified -iterator simultaneously, yielding pairs of two optional elements. Read more
    source§

    fn zip_eq<J>(self, other: J) -> ZipEq<Self, J::IntoIter> ⓘ
    where +iterator simultaneously, yielding pairs of two optional elements. Read more

    source§

    fn zip_eq<J>(self, other: J) -> ZipEq<Self, J::IntoIter> ⓘ
    where J: IntoIterator, Self: Sized,

    Create an iterator which iterates over both this and the specified -iterator simultaneously, yielding pairs of elements. Read more
    source§

    fn batching<B, F>(self, f: F) -> Batching<Self, F> ⓘ
    where +iterator simultaneously, yielding pairs of elements. Read more

    source§

    fn batching<B, F>(self, f: F) -> Batching<Self, F> ⓘ
    where F: FnMut(&mut Self) -> Option<B>, Self: Sized,

    A “meta iterator adaptor”. Its closure receives a reference to the iterator and may pick off as many elements as it likes, to produce the -next iterator element. Read more
    source§

    fn group_by<K, F>(self, key: F) -> GroupBy<K, Self, F>
    where +next iterator element. Read more

    source§

    fn chunk_by<K, F>(self, key: F) -> ChunkBy<K, Self, F>
    where Self: Sized, F: FnMut(&Self::Item) -> K, K: PartialEq,

    Return an iterable that can group iterator elements. Consecutive elements that map to the same key (“runs”), are assigned -to the same group. Read more
    source§

    fn chunks(self, size: usize) -> IntoChunks<Self>
    where - Self: Sized,

    Return an iterable that can chunk the iterator. Read more
    source§

    fn tuple_windows<T>(self) -> TupleWindows<Self, T> ⓘ
    where +to the same group. Read more

    source§

    fn group_by<K, F>(self, key: F) -> ChunkBy<K, Self, F>
    where + Self: Sized, + F: FnMut(&Self::Item) -> K, + K: PartialEq,

    👎Deprecated since 0.13.0: Use .chunk_by() instead
    See .chunk_by().
    source§

    fn chunks(self, size: usize) -> IntoChunks<Self>
    where + Self: Sized,

    Return an iterable that can chunk the iterator. Read more
    source§

    fn tuple_windows<T>(self) -> TupleWindows<Self, T> ⓘ
    where Self: Sized + Iterator<Item = T::Item>, T: HomogeneousTuple, T::Item: Clone,

    Return an iterator over all contiguous windows producing tuples of -a specific size (up to 12). Read more
    source§

    fn circular_tuple_windows<T>(self) -> CircularTupleWindows<Self, T> ⓘ
    where +a specific size (up to 12). Read more

    source§

    fn circular_tuple_windows<T>(self) -> CircularTupleWindows<Self, T> ⓘ
    where Self: Sized + Clone + Iterator<Item = T::Item> + ExactSizeIterator, T: TupleCollect + Clone, T::Item: Clone,

    Return an iterator over all windows, wrapping back to the first elements when the window would otherwise exceed the length of the -iterator, producing tuples of a specific size (up to 12). Read more
    source§

    fn tuples<T>(self) -> Tuples<Self, T> ⓘ
    where +iterator, producing tuples of a specific size (up to 12). Read more

    source§

    fn tuples<T>(self) -> Tuples<Self, T> ⓘ
    where Self: Sized + Iterator<Item = T::Item>, T: HomogeneousTuple,

    Return an iterator that groups the items in tuples of a specific size -(up to 12). Read more
    source§

    fn tee(self) -> (Tee<Self>, Tee<Self>)
    where +(up to 12). Read more

    source§

    fn tee(self) -> (Tee<Self>, Tee<Self>)
    where Self: Sized, Self::Item: Clone,

    Split into an iterator pair that both yield all elements from -the original iterator. Read more
    source§

    fn step(self, n: usize) -> Step<Self> ⓘ
    where - Self: Sized,

    👎Deprecated since 0.8.0: Use std .step_by() instead
    Return an iterator adaptor that steps n elements in the base iterator -for each iteration. Read more
    source§

    fn map_into<R>(self) -> MapInto<Self, R>
    where +the original iterator. Read more

    source§

    fn map_into<R>(self) -> MapInto<Self, R>
    where Self: Sized, - Self::Item: Into<R>,

    Convert each item of the iterator using the Into trait. Read more
    source§

    fn map_results<F, T, U, E>(self, f: F) -> MapOk<Self, F>
    where - Self: Iterator<Item = Result<T, E>> + Sized, - F: FnMut(T) -> U,

    👎Deprecated since 0.10.0: Use .map_ok() instead
    See .map_ok().
    source§

    fn map_ok<F, T, U, E>(self, f: F) -> MapOk<Self, F>
    where + Self::Item: Into<R>,

    Convert each item of the iterator using the Into trait. Read more
    source§

    fn map_ok<F, T, U, E>(self, f: F) -> MapOk<Self, F>
    where Self: Iterator<Item = Result<T, E>> + Sized, F: FnMut(T) -> U,

    Return an iterator adaptor that applies the provided closure to every Result::Ok value. Result::Err values are -unchanged. Read more
    source§

    fn filter_ok<F, T, E>(self, f: F) -> FilterOk<Self, F> ⓘ
    where +unchanged. Read more

    source§

    fn filter_ok<F, T, E>(self, f: F) -> FilterOk<Self, F> ⓘ
    where Self: Iterator<Item = Result<T, E>> + Sized, F: FnMut(&T) -> bool,

    Return an iterator adaptor that filters every Result::Ok value with the provided closure. Result::Err values are -unchanged. Read more
    source§

    fn filter_map_ok<F, T, U, E>(self, f: F) -> FilterMapOk<Self, F> ⓘ
    where +unchanged. Read more

    source§

    fn filter_map_ok<F, T, U, E>(self, f: F) -> FilterMapOk<Self, F> ⓘ
    where Self: Iterator<Item = Result<T, E>> + Sized, F: FnMut(T) -> Option<U>,

    Return an iterator adaptor that filters and transforms every Result::Ok value with the provided closure. Result::Err -values are unchanged. Read more
    source§

    fn flatten_ok<T, E>(self) -> FlattenOk<Self, T, E> ⓘ
    where +values are unchanged. Read more

    source§

    fn flatten_ok<T, E>(self) -> FlattenOk<Self, T, E> ⓘ
    where Self: Iterator<Item = Result<T, E>> + Sized, T: IntoIterator,

    Return an iterator adaptor that flattens every Result::Ok value into -a series of Result::Ok values. Result::Err values are unchanged. Read more
    source§

    fn process_results<F, T, E, R>(self, processor: F) -> Result<R, E>
    where +a series of Result::Ok values. Result::Err values are unchanged. Read more

    source§

    fn process_results<F, T, E, R>(self, processor: F) -> Result<R, E>
    where Self: Iterator<Item = Result<T, E>> + Sized, F: FnOnce(ProcessResults<'_, Self, E>) -> R,

    “Lift” a function of the values of the current iterator so as to process -an iterator of Result values instead. Read more
    source§

    fn merge<J>(self, other: J) -> Merge<Self, J::IntoIter>
    where +an iterator of Result values instead. Read more

    source§

    fn merge<J>(self, other: J) -> Merge<Self, J::IntoIter>
    where Self: Sized, Self::Item: PartialOrd, J: IntoIterator<Item = Self::Item>,

    Return an iterator adaptor that merges the two base iterators in ascending order. If both base iterators are sorted (ascending), the -result is sorted. Read more
    source§

    fn merge_by<J, F>(self, other: J, is_first: F) -> MergeBy<Self, J::IntoIter, F> ⓘ
    where +result is sorted. Read more

    source§

    fn merge_by<J, F>(self, other: J, is_first: F) -> MergeBy<Self, J::IntoIter, F> ⓘ
    where Self: Sized, J: IntoIterator<Item = Self::Item>, F: FnMut(&Self::Item, &Self::Item) -> bool,

    Return an iterator adaptor that merges the two base iterators in order. -This is much like .merge() but allows for a custom ordering. Read more
    source§

    fn merge_join_by<J, F, T>( +This is much like .merge() but allows for a custom ordering. Read more

    source§

    fn merge_join_by<J, F, T>( self, other: J, cmp_fn: F @@ -317,284 +318,295 @@ This is much like IntoIterator, F: FnMut(&Self::Item, &J::Item) -> T, Self: Sized,

    Create an iterator that merges items from both this and the specified -iterator in ascending order. Read more
    source§

    fn kmerge(self) -> KMerge<<Self::Item as IntoIterator>::IntoIter>
    where +iterator in ascending order. Read more

    source§

    fn kmerge(self) -> KMerge<<Self::Item as IntoIterator>::IntoIter>
    where Self: Sized, Self::Item: IntoIterator, <Self::Item as IntoIterator>::Item: PartialOrd,

    Return an iterator adaptor that flattens an iterator of iterators by -merging them in ascending order. Read more
    source§

    fn kmerge_by<F>( +merging them in ascending order. Read more

    source§

    fn kmerge_by<F>( self, first: F ) -> KMergeBy<<Self::Item as IntoIterator>::IntoIter, F> ⓘ
    where Self: Sized, Self::Item: IntoIterator, F: FnMut(&<Self::Item as IntoIterator>::Item, &<Self::Item as IntoIterator>::Item) -> bool,

    Return an iterator adaptor that flattens an iterator of iterators by -merging them according to the given closure. Read more
    source§

    fn cartesian_product<J>(self, other: J) -> Product<Self, J::IntoIter> ⓘ
    where +merging them according to the given closure. Read more

    source§

    fn cartesian_product<J>(self, other: J) -> Product<Self, J::IntoIter> ⓘ
    where Self: Sized, Self::Item: Clone, J: IntoIterator, J::IntoIter: Clone,

    Return an iterator adaptor that iterates over the cartesian product of -the element sets of two iterators self and J. Read more
    source§

    fn multi_cartesian_product( +the element sets of two iterators self and J. Read more

    source§

    fn multi_cartesian_product( self ) -> MultiProduct<<Self::Item as IntoIterator>::IntoIter> ⓘ
    where Self: Sized, Self::Item: IntoIterator, <Self::Item as IntoIterator>::IntoIter: Clone, <Self::Item as IntoIterator>::Item: Clone,

    Return an iterator adaptor that iterates over the cartesian product of -all subiterators returned by meta-iterator self. Read more
    source§

    fn coalesce<F>(self, f: F) -> Coalesce<Self, F>
    where +all subiterators returned by meta-iterator self. Read more

    source§

    fn coalesce<F>(self, f: F) -> Coalesce<Self, F>
    where Self: Sized, F: FnMut(Self::Item, Self::Item) -> Result<Self::Item, (Self::Item, Self::Item)>,

    Return an iterator adaptor that uses the passed-in closure to -optionally merge together consecutive elements. Read more
    source§

    fn dedup(self) -> Dedup<Self>
    where +optionally merge together consecutive elements. Read more

    source§

    fn dedup(self) -> Dedup<Self>
    where Self: Sized, Self::Item: PartialEq,

    Remove duplicates from sections of consecutive identical elements. -If the iterator is sorted, all elements will be unique. Read more
    source§

    fn dedup_by<Cmp>(self, cmp: Cmp) -> DedupBy<Self, Cmp>
    where +If the iterator is sorted, all elements will be unique. Read more

    source§

    fn dedup_by<Cmp>(self, cmp: Cmp) -> DedupBy<Self, Cmp>
    where Self: Sized, Cmp: FnMut(&Self::Item, &Self::Item) -> bool,

    Remove duplicates from sections of consecutive identical elements, determining equality using a comparison function. -If the iterator is sorted, all elements will be unique. Read more
    source§

    fn dedup_with_count(self) -> DedupWithCount<Self>
    where +If the iterator is sorted, all elements will be unique. Read more

    source§

    fn dedup_with_count(self) -> DedupWithCount<Self>
    where Self: Sized,

    Remove duplicates from sections of consecutive identical elements, while keeping a count of how many repeated elements were present. -If the iterator is sorted, all elements will be unique. Read more
    source§

    fn dedup_by_with_count<Cmp>(self, cmp: Cmp) -> DedupByWithCount<Self, Cmp>
    where +If the iterator is sorted, all elements will be unique. Read more

    source§

    fn dedup_by_with_count<Cmp>(self, cmp: Cmp) -> DedupByWithCount<Self, Cmp>
    where Self: Sized, Cmp: FnMut(&Self::Item, &Self::Item) -> bool,

    Remove duplicates from sections of consecutive identical elements, while keeping a count of how many repeated elements were present. This will determine equality using a comparison function. -If the iterator is sorted, all elements will be unique. Read more
    source§

    fn duplicates(self) -> Duplicates<Self>
    where +If the iterator is sorted, all elements will be unique. Read more

    source§

    fn duplicates(self) -> Duplicates<Self>
    where Self: Sized, Self::Item: Eq + Hash,

    Return an iterator adaptor that produces elements that appear more than once during the -iteration. Duplicates are detected using hash and equality. Read more
    source§

    fn duplicates_by<V, F>(self, f: F) -> DuplicatesBy<Self, V, F>
    where +iteration. Duplicates are detected using hash and equality. Read more

    source§

    fn duplicates_by<V, F>(self, f: F) -> DuplicatesBy<Self, V, F>
    where Self: Sized, V: Eq + Hash, F: FnMut(&Self::Item) -> V,

    Return an iterator adaptor that produces elements that appear more than once during the -iteration. Duplicates are detected using hash and equality. Read more
    source§

    fn unique(self) -> Unique<Self> ⓘ
    where +iteration. Duplicates are detected using hash and equality. Read more

    source§

    fn unique(self) -> Unique<Self> ⓘ
    where Self: Sized, Self::Item: Clone + Eq + Hash,

    Return an iterator adaptor that filters out elements that have already been produced once during the iteration. Duplicates -are detected using hash and equality. Read more
    source§

    fn unique_by<V, F>(self, f: F) -> UniqueBy<Self, V, F> ⓘ
    where +are detected using hash and equality. Read more

    source§

    fn unique_by<V, F>(self, f: F) -> UniqueBy<Self, V, F> ⓘ
    where Self: Sized, V: Eq + Hash, F: FnMut(&Self::Item) -> V,

    Return an iterator adaptor that filters out elements that have -already been produced once during the iteration. Read more
    source§

    fn peeking_take_while<F>(&mut self, accept: F) -> PeekingTakeWhile<'_, Self, F> ⓘ
    where +already been produced once during the iteration. Read more

    source§

    fn peeking_take_while<F>(&mut self, accept: F) -> PeekingTakeWhile<'_, Self, F> ⓘ
    where Self: Sized + PeekingNext, F: FnMut(&Self::Item) -> bool,

    Return an iterator adaptor that borrows from this iterator and -takes items while the closure accept returns true. Read more
    source§

    fn take_while_ref<F>(&mut self, accept: F) -> TakeWhileRef<'_, Self, F> ⓘ
    where +takes items while the closure accept returns true. Read more

    source§

    fn take_while_ref<F>(&mut self, accept: F) -> TakeWhileRef<'_, Self, F> ⓘ
    where Self: Clone, F: FnMut(&Self::Item) -> bool,

    Return an iterator adaptor that borrows from a Clone-able iterator -to only pick off elements while the predicate accept returns true. Read more
    source§

    fn take_while_inclusive<F>(self, accept: F) -> TakeWhileInclusive<Self, F> ⓘ
    where +to only pick off elements while the predicate accept returns true. Read more

    source§

    fn take_while_inclusive<F>(self, accept: F) -> TakeWhileInclusive<Self, F> ⓘ
    where Self: Sized, F: FnMut(&Self::Item) -> bool,

    Returns an iterator adaptor that consumes elements while the given predicate is true, including the element for which the predicate -first returned false. Read more
    source§

    fn while_some<A>(self) -> WhileSome<Self> ⓘ
    where +first returned false. Read more

    source§

    fn while_some<A>(self) -> WhileSome<Self> ⓘ
    where Self: Sized + Iterator<Item = Option<A>>,

    Return an iterator adaptor that filters Option<A> iterator elements -and produces A. Stops on the first None encountered. Read more
    source§

    fn tuple_combinations<T>(self) -> TupleCombinations<Self, T> ⓘ
    where +and produces A. Stops on the first None encountered. Read more

    source§

    fn tuple_combinations<T>(self) -> TupleCombinations<Self, T> ⓘ
    where Self: Sized + Clone, Self::Item: Clone, T: HasCombination<Self>,

    Return an iterator adaptor that iterates over the combinations of the -elements from an iterator. Read more
    source§

    fn combinations(self, k: usize) -> Combinations<Self> ⓘ
    where +elements from an iterator. Read more

    source§

    fn combinations(self, k: usize) -> Combinations<Self> ⓘ
    where Self: Sized, Self::Item: Clone,

    Return an iterator adaptor that iterates over the k-length combinations of -the elements from an iterator. Read more
    source§

    fn combinations_with_replacement( +the elements from an iterator. Read more

    source§

    fn combinations_with_replacement( self, k: usize ) -> CombinationsWithReplacement<Self> ⓘ
    where Self: Sized, Self::Item: Clone,

    Return an iterator that iterates over the k-length combinations of -the elements from an iterator, with replacement. Read more
    source§

    fn permutations(self, k: usize) -> Permutations<Self> ⓘ
    where +the elements from an iterator, with replacement. Read more

    source§

    fn permutations(self, k: usize) -> Permutations<Self> ⓘ
    where Self: Sized, Self::Item: Clone,

    Return an iterator adaptor that iterates over all k-permutations of the -elements from an iterator. Read more
    source§

    fn powerset(self) -> Powerset<Self> ⓘ
    where +elements from an iterator. Read more

    source§

    fn powerset(self) -> Powerset<Self> ⓘ
    where Self: Sized, Self::Item: Clone,

    Return an iterator that iterates through the powerset of the elements from an -iterator. Read more
    source§

    fn pad_using<F>(self, min: usize, f: F) -> PadUsing<Self, F> ⓘ
    where +iterator. Read more

    source§

    fn pad_using<F>(self, min: usize, f: F) -> PadUsing<Self, F> ⓘ
    where Self: Sized, F: FnMut(usize) -> Self::Item,

    Return an iterator adaptor that pads the sequence to a minimum length of -min by filling missing elements using a closure f. Read more
    source§

    fn with_position(self) -> WithPosition<Self> ⓘ
    where +min by filling missing elements using a closure f. Read more

    source§

    fn with_position(self) -> WithPosition<Self> ⓘ
    where Self: Sized,

    Return an iterator adaptor that combines each element with a Position to -ease special-case handling of the first or last elements. Read more
    source§

    fn positions<P>(self, predicate: P) -> Positions<Self, P> ⓘ
    where +ease special-case handling of the first or last elements. Read more

    source§

    fn positions<P>(self, predicate: P) -> Positions<Self, P> ⓘ
    where Self: Sized, P: FnMut(Self::Item) -> bool,

    Return an iterator adaptor that yields the indices of all elements -satisfying a predicate, counted from the start of the iterator. Read more
    source§

    fn update<F>(self, updater: F) -> Update<Self, F> ⓘ
    where +satisfying a predicate, counted from the start of the iterator. Read more

    source§

    fn update<F>(self, updater: F) -> Update<Self, F> ⓘ
    where Self: Sized, F: FnMut(&mut Self::Item),

    Return an iterator adaptor that applies a mutating function -to each element before yielding it. Read more
    source§

    fn next_tuple<T>(&mut self) -> Option<T>
    where +to each element before yielding it. Read more

    source§

    fn next_tuple<T>(&mut self) -> Option<T>
    where Self: Sized + Iterator<Item = T::Item>, T: HomogeneousTuple,

    Advances the iterator and returns the next items grouped in a tuple of -a specific size (up to 12). Read more
    source§

    fn collect_tuple<T>(self) -> Option<T>
    where +a specific size (up to 12). Read more

    source§

    fn collect_tuple<T>(self) -> Option<T>
    where Self: Sized + Iterator<Item = T::Item>, T: HomogeneousTuple,

    Collects all items from the iterator into a tuple of a specific size -(up to 12). Read more
    source§

    fn find_position<P>(&mut self, pred: P) -> Option<(usize, Self::Item)>
    where - P: FnMut(&Self::Item) -> bool,

    Find the position and value of the first element satisfying a predicate. Read more
    source§

    fn find_or_last<P>(self, predicate: P) -> Option<Self::Item>
    where +(up to 12). Read more

    source§

    fn find_position<P>(&mut self, pred: P) -> Option<(usize, Self::Item)>
    where + P: FnMut(&Self::Item) -> bool,

    Find the position and value of the first element satisfying a predicate. Read more
    source§

    fn find_or_last<P>(self, predicate: P) -> Option<Self::Item>
    where Self: Sized, - P: FnMut(&Self::Item) -> bool,

    Find the value of the first element satisfying a predicate or return the last element, if any. Read more
    source§

    fn find_or_first<P>(self, predicate: P) -> Option<Self::Item>
    where + P: FnMut(&Self::Item) -> bool,

    Find the value of the first element satisfying a predicate or return the last element, if any. Read more
    source§

    fn find_or_first<P>(self, predicate: P) -> Option<Self::Item>
    where Self: Sized, - P: FnMut(&Self::Item) -> bool,

    Find the value of the first element satisfying a predicate or return the first element, if any. Read more
    source§

    fn contains<Q>(&mut self, query: &Q) -> bool
    where + P: FnMut(&Self::Item) -> bool,

    Find the value of the first element satisfying a predicate or return the first element, if any. Read more
    source§

    fn contains<Q>(&mut self, query: &Q) -> bool
    where Self: Sized, Self::Item: Borrow<Q>, - Q: PartialEq,

    Returns true if the given item is present in this iterator. Read more
    source§

    fn all_equal(&mut self) -> bool
    where + Q: PartialEq,

    Returns true if the given item is present in this iterator. Read more
    source§

    fn all_equal(&mut self) -> bool
    where Self: Sized, - Self::Item: PartialEq,

    Check whether all elements compare equal. Read more
    source§

    fn all_equal_value( + Self::Item: PartialEq,

    Check whether all elements compare equal. Read more
    source§

    fn all_equal_value( &mut self ) -> Result<Self::Item, Option<(Self::Item, Self::Item)>>
    where Self: Sized, Self::Item: PartialEq,

    If there are elements and they are all equal, return a single copy of that element. If there are no elements, return an Error containing None. If there are elements and they are not all equal, return a tuple containing the first -two non-equal elements found. Read more
    source§

    fn all_unique(&mut self) -> bool
    where +two non-equal elements found. Read more

    source§

    fn all_unique(&mut self) -> bool
    where Self: Sized, - Self::Item: Eq + Hash,

    Check whether all elements are unique (non equal). Read more
    source§

    fn dropping(self, n: usize) -> Self
    where + Self::Item: Eq + Hash,

    Check whether all elements are unique (non equal). Read more
    source§

    fn dropping(self, n: usize) -> Self
    where Self: Sized,

    Consume the first n elements from the iterator eagerly, -and return the same iterator again. Read more
    source§

    fn dropping_back(self, n: usize) -> Self
    where +and return the same iterator again. Read more

    source§

    fn dropping_back(self, n: usize) -> Self
    where Self: Sized + DoubleEndedIterator,

    Consume the last n elements from the iterator eagerly, -and return the same iterator again. Read more
    source§

    fn foreach<F>(self, f: F)
    where - F: FnMut(Self::Item), - Self: Sized,

    👎Deprecated since 0.8.0: Use .for_each() instead
    Run the closure f eagerly on each element of the iterator. Read more
    source§

    fn concat(self) -> Self::Item
    where +and return the same iterator again. Read more

    source§

    fn concat(self) -> Self::Item
    where Self: Sized, - Self::Item: Extend<<<Self as Iterator>::Item as IntoIterator>::Item> + IntoIterator + Default,

    Combine all an iterator’s elements into one element by using Extend. Read more
    source§

    fn collect_vec(self) -> Vec<Self::Item>
    where + Self::Item: Extend<<<Self as Iterator>::Item as IntoIterator>::Item> + IntoIterator + Default,

    Combine all an iterator’s elements into one element by using Extend. Read more
    source§

    fn collect_vec(self) -> Vec<Self::Item>
    where Self: Sized,

    .collect_vec() is simply a type specialization of Iterator::collect, -for convenience.
    source§

    fn try_collect<T, U, E>(self) -> Result<U, E>
    where +for convenience.

    source§

    fn try_collect<T, U, E>(self) -> Result<U, E>
    where Self: Sized + Iterator<Item = Result<T, E>>, Result<U, E>: FromIterator<Result<T, E>>,

    .try_collect() is more convenient way of writing -.collect::<Result<_, _>>() Read more
    source§

    fn set_from<'a, A: 'a, J>(&mut self, from: J) -> usize
    where +.collect::<Result<_, _>>() Read more

    source§

    fn set_from<'a, A: 'a, J>(&mut self, from: J) -> usize
    where Self: Iterator<Item = &'a mut A>, J: IntoIterator<Item = A>,

    Assign to each reference in self from the from iterator, -stopping at the shortest of the two iterators. Read more
    source§

    fn join(&mut self, sep: &str) -> String
    where - Self::Item: Display,

    Combine all iterator elements into one String, separated by sep. Read more
    source§

    fn format(self, sep: &str) -> Format<'_, Self>
    where - Self: Sized,

    Format all iterator elements, separated by sep. Read more
    source§

    fn format_with<F>(self, sep: &str, format: F) -> FormatWith<'_, Self, F>
    where +stopping at the shortest of the two iterators. Read more

    source§

    fn join(&mut self, sep: &str) -> String
    where + Self::Item: Display,

    Combine all iterator elements into one String, separated by sep. Read more
    source§

    fn format(self, sep: &str) -> Format<'_, Self>
    where + Self: Sized,

    Format all iterator elements, separated by sep. Read more
    source§

    fn format_with<F>(self, sep: &str, format: F) -> FormatWith<'_, Self, F>
    where Self: Sized, - F: FnMut(Self::Item, &mut dyn FnMut(&dyn Display) -> Result) -> Result,

    Format all iterator elements, separated by sep. Read more
    source§

    fn fold_results<A, E, B, F>(&mut self, start: B, f: F) -> Result<B, E>
    where + F: FnMut(Self::Item, &mut dyn FnMut(&dyn Display) -> Result) -> Result,

    Format all iterator elements, separated by sep. Read more
    source§

    fn fold_ok<A, E, B, F>(&mut self, start: B, f: F) -> Result<B, E>
    where Self: Iterator<Item = Result<A, E>>, - F: FnMut(B, A) -> B,

    👎Deprecated since 0.10.0: Use .fold_ok() instead
    See .fold_ok().
    source§

    fn fold_ok<A, E, B, F>(&mut self, start: B, f: F) -> Result<B, E>
    where - Self: Iterator<Item = Result<A, E>>, - F: FnMut(B, A) -> B,

    Fold Result values from an iterator. Read more
    source§

    fn fold_options<A, B, F>(&mut self, start: B, f: F) -> Option<B>
    where + F: FnMut(B, A) -> B,

    Fold Result values from an iterator. Read more
    source§

    fn fold_options<A, B, F>(&mut self, start: B, f: F) -> Option<B>
    where Self: Iterator<Item = Option<A>>, - F: FnMut(B, A) -> B,

    Fold Option values from an iterator. Read more
    source§

    fn fold1<F>(self, f: F) -> Option<Self::Item>
    where + F: FnMut(B, A) -> B,

    Fold Option values from an iterator. Read more
    source§

    fn fold1<F>(self, f: F) -> Option<Self::Item>
    where F: FnMut(Self::Item, Self::Item) -> Self::Item, - Self: Sized,

    👎Deprecated since 0.10.2: Use Iterator::reduce instead
    Accumulator of the elements in the iterator. Read more
    source§

    fn tree_fold1<F>(self, f: F) -> Option<Self::Item>
    where + Self: Sized,

    👎Deprecated since 0.10.2: Use Iterator::reduce instead
    Accumulator of the elements in the iterator. Read more
    source§

    fn tree_reduce<F>(self, f: F) -> Option<Self::Item>
    where F: FnMut(Self::Item, Self::Item) -> Self::Item, - Self: Sized,

    Accumulate the elements in the iterator in a tree-like manner. Read more
    source§

    fn fold_while<B, F>(&mut self, init: B, f: F) -> FoldWhile<B>
    where + Self: Sized,

    Accumulate the elements in the iterator in a tree-like manner. Read more
    source§

    fn tree_fold1<F>(self, f: F) -> Option<Self::Item>
    where + F: FnMut(Self::Item, Self::Item) -> Self::Item, + Self: Sized,

    👎Deprecated since 0.13.0: Use .tree_reduce() instead
    See .tree_reduce().
    source§

    fn fold_while<B, F>(&mut self, init: B, f: F) -> FoldWhile<B>
    where Self: Sized, - F: FnMut(B, Self::Item) -> FoldWhile<B>,

    An iterator method that applies a function, producing a single, final value. Read more
    source§

    fn sum1<S>(self) -> Option<S>
    where + F: FnMut(B, Self::Item) -> FoldWhile<B>,

    An iterator method that applies a function, producing a single, final value. Read more
    source§

    fn sum1<S>(self) -> Option<S>
    where Self: Sized, - S: Sum<Self::Item>,

    Iterate over the entire iterator and add all the elements. Read more
    source§

    fn product1<P>(self) -> Option<P>
    where + S: Sum<Self::Item>,

    Iterate over the entire iterator and add all the elements. Read more
    source§

    fn product1<P>(self) -> Option<P>
    where Self: Sized, - P: Product<Self::Item>,

    Iterate over the entire iterator and multiply all the elements. Read more
    source§

    fn sorted_unstable(self) -> IntoIter<Self::Item> ⓘ
    where + P: Product<Self::Item>,

    Iterate over the entire iterator and multiply all the elements. Read more
    source§

    fn sorted_unstable(self) -> IntoIter<Self::Item> ⓘ
    where Self: Sized, - Self::Item: Ord,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_unstable_by<F>(self, cmp: F) -> IntoIter<Self::Item> ⓘ
    where + Self::Item: Ord,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_unstable_by<F>(self, cmp: F) -> IntoIter<Self::Item> ⓘ
    where Self: Sized, - F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_unstable_by_key<K, F>(self, f: F) -> IntoIter<Self::Item> ⓘ
    where + F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_unstable_by_key<K, F>(self, f: F) -> IntoIter<Self::Item> ⓘ
    where Self: Sized, K: Ord, - F: FnMut(&Self::Item) -> K,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted(self) -> IntoIter<Self::Item> ⓘ
    where + F: FnMut(&Self::Item) -> K,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted(self) -> IntoIter<Self::Item> ⓘ
    where Self: Sized, - Self::Item: Ord,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_by<F>(self, cmp: F) -> IntoIter<Self::Item> ⓘ
    where + Self::Item: Ord,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_by<F>(self, cmp: F) -> IntoIter<Self::Item> ⓘ
    where Self: Sized, - F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_by_key<K, F>(self, f: F) -> IntoIter<Self::Item> ⓘ
    where + F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_by_key<K, F>(self, f: F) -> IntoIter<Self::Item> ⓘ
    where Self: Sized, K: Ord, - F: FnMut(&Self::Item) -> K,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_by_cached_key<K, F>(self, f: F) -> IntoIter<Self::Item> ⓘ
    where + F: FnMut(&Self::Item) -> K,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_by_cached_key<K, F>(self, f: F) -> IntoIter<Self::Item> ⓘ
    where Self: Sized, K: Ord, F: FnMut(&Self::Item) -> K,

    Sort all iterator elements into a new iterator in ascending order. The key function is -called exactly once per key. Read more
    source§

    fn k_smallest(self, k: usize) -> IntoIter<Self::Item> ⓘ
    where +called exactly once per key. Read more

    source§

    fn k_smallest(self, k: usize) -> IntoIter<Self::Item> ⓘ
    where Self: Sized, - Self::Item: Ord,

    Sort the k smallest elements into a new iterator, in ascending order. Read more
    source§

    fn partition_map<A, B, F, L, R>(self, predicate: F) -> (A, B)
    where + Self::Item: Ord,

    Sort the k smallest elements into a new iterator, in ascending order. Read more
    source§

    fn k_smallest_by<F>(self, k: usize, cmp: F) -> IntoIter<Self::Item> ⓘ
    where + Self: Sized, + F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Sort the k smallest elements into a new iterator using the provided comparison. Read more
    source§

    fn k_smallest_by_key<F, K>(self, k: usize, key: F) -> IntoIter<Self::Item> ⓘ
    where + Self: Sized, + F: FnMut(&Self::Item) -> K, + K: Ord,

    Return the elements producing the k smallest outputs of the provided function. Read more
    source§

    fn k_largest(self, k: usize) -> IntoIter<Self::Item> ⓘ
    where + Self: Sized, + Self::Item: Ord,

    Sort the k largest elements into a new iterator, in descending order. Read more
    source§

    fn k_largest_by<F>(self, k: usize, cmp: F) -> IntoIter<Self::Item> ⓘ
    where + Self: Sized, + F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Sort the k largest elements into a new iterator using the provided comparison. Read more
    source§

    fn k_largest_by_key<F, K>(self, k: usize, key: F) -> IntoIter<Self::Item> ⓘ
    where + Self: Sized, + F: FnMut(&Self::Item) -> K, + K: Ord,

    Return the elements producing the k largest outputs of the provided function. Read more
    source§

    fn tail(self, n: usize) -> IntoIter<Self::Item> ⓘ
    where + Self: Sized,

    Consumes the iterator and return an iterator of the last n elements. Read more
    source§

    fn partition_map<A, B, F, L, R>(self, predicate: F) -> (A, B)
    where Self: Sized, F: FnMut(Self::Item) -> Either<L, R>, A: Default + Extend<L>, B: Default + Extend<R>,

    Collect all iterator elements into one of two partitions. Unlike Iterator::partition, each partition may -have a distinct type. Read more
    source§

    fn partition_result<A, B, T, E>(self) -> (A, B)
    where +have a distinct type. Read more

    source§

    fn partition_result<A, B, T, E>(self) -> (A, B)
    where Self: Iterator<Item = Result<T, E>> + Sized, A: Default + Extend<T>, B: Default + Extend<E>,

    Partition a sequence of Results into one list of all the Ok elements -and another list of all the Err elements. Read more
    source§

    fn into_group_map<K, V>(self) -> HashMap<K, Vec<V>>
    where +and another list of all the Err elements. Read more

    source§

    fn into_group_map<K, V>(self) -> HashMap<K, Vec<V>>
    where Self: Iterator<Item = (K, V)> + Sized, K: Hash + Eq,

    Return a HashMap of keys mapped to Vecs of values. Keys and values -are taken from (Key, Value) tuple pairs yielded by the input iterator. Read more
    source§

    fn into_group_map_by<K, V, F>(self, f: F) -> HashMap<K, Vec<V>>
    where +are taken from (Key, Value) tuple pairs yielded by the input iterator. Read more

    source§

    fn into_group_map_by<K, V, F>(self, f: F) -> HashMap<K, Vec<V>>
    where Self: Iterator<Item = V> + Sized, K: Hash + Eq, - F: Fn(&V) -> K,

    Return an Iterator on a HashMap. Keys mapped to Vecs of values. The key is specified -in the closure. Read more
    source§

    fn into_grouping_map<K, V>(self) -> GroupingMap<Self>
    where + F: FnMut(&V) -> K,

    Return an Iterator on a HashMap. Keys mapped to Vecs of values. The key is specified +in the closure. Read more
    source§

    fn into_grouping_map<K, V>(self) -> GroupingMap<Self>
    where Self: Iterator<Item = (K, V)> + Sized, K: Hash + Eq,

    Constructs a GroupingMap to be used later with one of the efficient -group-and-fold operations it allows to perform. Read more
    source§

    fn into_grouping_map_by<K, V, F>(self, key_mapper: F) -> GroupingMapBy<Self, F>
    where +group-and-fold operations it allows to perform. Read more

    source§

    fn into_grouping_map_by<K, V, F>(self, key_mapper: F) -> GroupingMapBy<Self, F>
    where Self: Iterator<Item = V> + Sized, K: Hash + Eq, F: FnMut(&V) -> K,

    Constructs a GroupingMap to be used later with one of the efficient -group-and-fold operations it allows to perform. Read more
    source§

    fn min_set(self) -> Vec<Self::Item>
    where +group-and-fold operations it allows to perform. Read more

    source§

    fn min_set(self) -> Vec<Self::Item>
    where Self: Sized, - Self::Item: Ord,

    Return all minimum elements of an iterator. Read more
    source§

    fn min_set_by<F>(self, compare: F) -> Vec<Self::Item>
    where + Self::Item: Ord,

    Return all minimum elements of an iterator. Read more
    source§

    fn min_set_by<F>(self, compare: F) -> Vec<Self::Item>
    where Self: Sized, F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Return all minimum elements of an iterator, as determined by -the specified function. Read more
    source§

    fn min_set_by_key<K, F>(self, key: F) -> Vec<Self::Item>
    where +the specified function. Read more

    source§

    fn min_set_by_key<K, F>(self, key: F) -> Vec<Self::Item>
    where Self: Sized, K: Ord, F: FnMut(&Self::Item) -> K,

    Return all minimum elements of an iterator, as determined by -the specified function. Read more
    source§

    fn max_set(self) -> Vec<Self::Item>
    where +the specified function. Read more

    source§

    fn max_set(self) -> Vec<Self::Item>
    where Self: Sized, - Self::Item: Ord,

    Return all maximum elements of an iterator. Read more
    source§

    fn max_set_by<F>(self, compare: F) -> Vec<Self::Item>
    where + Self::Item: Ord,

    Return all maximum elements of an iterator. Read more
    source§

    fn max_set_by<F>(self, compare: F) -> Vec<Self::Item>
    where Self: Sized, F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Return all maximum elements of an iterator, as determined by -the specified function. Read more
    source§

    fn max_set_by_key<K, F>(self, key: F) -> Vec<Self::Item>
    where +the specified function. Read more

    source§

    fn max_set_by_key<K, F>(self, key: F) -> Vec<Self::Item>
    where Self: Sized, K: Ord, F: FnMut(&Self::Item) -> K,

    Return all maximum elements of an iterator, as determined by -the specified function. Read more
    source§

    fn minmax(self) -> MinMaxResult<Self::Item>
    where +the specified function. Read more

    source§

    fn minmax(self) -> MinMaxResult<Self::Item>
    where Self: Sized, - Self::Item: PartialOrd,

    Return the minimum and maximum elements in the iterator. Read more
    source§

    fn minmax_by_key<K, F>(self, key: F) -> MinMaxResult<Self::Item>
    where + Self::Item: PartialOrd,

    Return the minimum and maximum elements in the iterator. Read more
    source§

    fn minmax_by_key<K, F>(self, key: F) -> MinMaxResult<Self::Item>
    where Self: Sized, K: PartialOrd, F: FnMut(&Self::Item) -> K,

    Return the minimum and maximum element of an iterator, as determined by -the specified function. Read more
    source§

    fn minmax_by<F>(self, compare: F) -> MinMaxResult<Self::Item>
    where +the specified function. Read more

    source§

    fn minmax_by<F>(self, compare: F) -> MinMaxResult<Self::Item>
    where Self: Sized, F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Return the minimum and maximum element of an iterator, as determined by -the specified comparison function. Read more
    source§

    fn position_max(self) -> Option<usize>
    where +the specified comparison function. Read more

    source§

    fn position_max(self) -> Option<usize>
    where Self: Sized, - Self::Item: Ord,

    Return the position of the maximum element in the iterator. Read more
    source§

    fn position_max_by_key<K, F>(self, key: F) -> Option<usize>
    where + Self::Item: Ord,

    Return the position of the maximum element in the iterator. Read more
    source§

    fn position_max_by_key<K, F>(self, key: F) -> Option<usize>
    where Self: Sized, K: Ord, F: FnMut(&Self::Item) -> K,

    Return the position of the maximum element in the iterator, as -determined by the specified function. Read more
    source§

    fn position_max_by<F>(self, compare: F) -> Option<usize>
    where +determined by the specified function. Read more

    source§

    fn position_max_by<F>(self, compare: F) -> Option<usize>
    where Self: Sized, F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Return the position of the maximum element in the iterator, as -determined by the specified comparison function. Read more
    source§

    fn position_min(self) -> Option<usize>
    where +determined by the specified comparison function. Read more

    source§

    fn position_min(self) -> Option<usize>
    where Self: Sized, - Self::Item: Ord,

    Return the position of the minimum element in the iterator. Read more
    source§

    fn position_min_by_key<K, F>(self, key: F) -> Option<usize>
    where + Self::Item: Ord,

    Return the position of the minimum element in the iterator. Read more
    source§

    fn position_min_by_key<K, F>(self, key: F) -> Option<usize>
    where Self: Sized, K: Ord, F: FnMut(&Self::Item) -> K,

    Return the position of the minimum element in the iterator, as -determined by the specified function. Read more
    source§

    fn position_min_by<F>(self, compare: F) -> Option<usize>
    where +determined by the specified function. Read more

    source§

    fn position_min_by<F>(self, compare: F) -> Option<usize>
    where Self: Sized, F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Return the position of the minimum element in the iterator, as -determined by the specified comparison function. Read more
    source§

    fn position_minmax(self) -> MinMaxResult<usize>
    where +determined by the specified comparison function. Read more

    source§

    fn position_minmax(self) -> MinMaxResult<usize>
    where Self: Sized, Self::Item: PartialOrd,

    Return the positions of the minimum and maximum elements in -the iterator. Read more
    source§

    fn position_minmax_by_key<K, F>(self, key: F) -> MinMaxResult<usize>
    where +the iterator. Read more

    source§

    fn position_minmax_by_key<K, F>(self, key: F) -> MinMaxResult<usize>
    where Self: Sized, K: PartialOrd, F: FnMut(&Self::Item) -> K,

    Return the postions of the minimum and maximum elements of an -iterator, as determined by the specified function. Read more
    source§

    fn position_minmax_by<F>(self, compare: F) -> MinMaxResult<usize>
    where +iterator, as determined by the specified function. Read more

    source§

    fn position_minmax_by<F>(self, compare: F) -> MinMaxResult<usize>
    where Self: Sized, F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Return the postions of the minimum and maximum elements of an -iterator, as determined by the specified comparison function. Read more
    source§

    fn exactly_one(self) -> Result<Self::Item, ExactlyOneError<Self>>
    where +iterator, as determined by the specified comparison function. Read more

    source§

    fn exactly_one(self) -> Result<Self::Item, ExactlyOneError<Self>>
    where Self: Sized,

    If the iterator yields exactly one element, that element will be returned, otherwise an error will be returned containing an iterator that has the same output as the input -iterator. Read more
    source§

    fn at_most_one(self) -> Result<Option<Self::Item>, ExactlyOneError<Self>>
    where - Self: Sized,

    If the iterator yields no elements, Ok(None) will be returned. If the iterator yields +iterator. Read more
    source§

    fn at_most_one(self) -> Result<Option<Self::Item>, ExactlyOneError<Self>>
    where + Self: Sized,

    If the iterator yields no elements, Ok(None) will be returned. If the iterator yields exactly one element, that element will be returned, otherwise an error will be returned -containing an iterator that has the same output as the input iterator. Read more
    source§

    fn multipeek(self) -> MultiPeek<Self> ⓘ
    where +containing an iterator that has the same output as the input iterator. Read more

    source§

    fn multipeek(self) -> MultiPeek<Self> ⓘ
    where Self: Sized,

    An iterator adaptor that allows the user to peek at multiple .next() -values without advancing the base iterator. Read more
    source§

    fn counts(self) -> HashMap<Self::Item, usize>
    where +values without advancing the base iterator. Read more

    source§

    fn counts(self) -> HashMap<Self::Item, usize>
    where Self: Sized, Self::Item: Eq + Hash,

    Collect the items in this iterator and return a HashMap which contains each item that appears in the iterator and the number -of times it appears. Read more
    source§

    fn counts_by<K, F>(self, f: F) -> HashMap<K, usize>
    where +of times it appears. Read more

    source§

    fn counts_by<K, F>(self, f: F) -> HashMap<K, usize>
    where Self: Sized, K: Eq + Hash, F: FnMut(Self::Item) -> K,

    Collect the items in this iterator and return a HashMap which contains each item that appears in the iterator and the number of times it appears, -determining identity using a keying function. Read more
    source§

    fn multiunzip<FromI>(self) -> FromI
    where - Self: Sized + MultiUnzip<FromI>,

    Converts an iterator of tuples into a tuple of containers. Read more
    source§

    fn try_len(&self) -> Result<usize, (usize, Option<usize>)>

    Returns the length of the iterator if one exists. +determining identity using a keying function. Read more
    source§

    fn multiunzip<FromI>(self) -> FromI
    where + Self: Sized + MultiUnzip<FromI>,

    Converts an iterator of tuples into a tuple of containers. Read more
    source§

    fn try_len(&self) -> Result<usize, (usize, Option<usize>)>

    Returns the length of the iterator if one exists. Otherwise return self.size_hint(). Read more
    source§

    impl<IT> MultiUnzip<()> for IT
    where IT: Iterator<Item = ()>,

    source§

    fn multiunzip(self)

    Unzip this iterator into multiple collections.
    source§

    impl<IT, A, FromA> MultiUnzip<(FromA,)> for IT
    where IT: Iterator<Item = (A,)>, @@ -697,4 +709,4 @@ Otherwise return self.size_hint(). (FromA, FromB, FromC, FromD, FromE, FromF, FromG, FromH, FromI, FromJ, FromK, FromL)

    Unzip this iterator into multiple collections.
    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 + 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/itertools/structs/struct.Update.html b/itertools/structs/struct.Update.html index ddd7d1477..3fb2f0af8 100644 --- a/itertools/structs/struct.Update.html +++ b/itertools/structs/struct.Update.html @@ -1,10 +1,10 @@ -Update in itertools::structs - Rust
    -

    Struct itertools::structs::Update

    source · 
    pub struct Update<I, F> { /* private fields */ }
    Expand description

    An iterator adapter to apply a mutating function to each element before yielding it.

    +Update in itertools::structs - Rust
    +

    Struct itertools::structs::Update

    source · 
    pub struct Update<I, F> { /* private fields */ }
    Expand description

    An iterator adapter to apply a mutating function to each element before yielding it.

    See .update() for more information.

    -

    Trait Implementations§

    source§

    impl<I: Clone, F: Clone> Clone for Update<I, F>

    source§

    fn clone(&self) -> Update<I, F> ⓘ

    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<I, F> Debug for Update<I, F>
    where - I: Debug,

    source§

    fn fmt(&self, f: &mut Formatter<'_>) -> Result

    Formats the value using the given formatter. Read more
    source§

    impl<I, F> DoubleEndedIterator for Update<I, F>
    where +

    Trait Implementations§

    source§

    impl<I: Clone, F: Clone> Clone for Update<I, F>

    source§

    fn clone(&self) -> Update<I, F> ⓘ

    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<I, F> Debug for Update<I, F>
    where + I: Debug,

    source§

    fn fmt(&self, f: &mut Formatter<'_>) -> Result

    Formats the value using the given formatter. Read more
    source§

    impl<I, F> DoubleEndedIterator for Update<I, F>
    where I: DoubleEndedIterator, - F: FnMut(&mut I::Item),

    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 + F: FnMut(&mut I::Item),

    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 @@ -13,13 +13,13 @@ elements starting from the back of the iterator. 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, F> ExactSizeIterator for Update<I, F>
    where + P: FnMut(&Self::Item) -> bool,

    Searches for an element of an iterator from the back that satisfies a predicate. Read more
    source§

    impl<I, F> ExactSizeIterator for Update<I, F>
    where I: ExactSizeIterator, - F: FnMut(&mut I::Item),

    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<I, F> Iterator for Update<I, F>
    where + F: FnMut(&mut I::Item),

    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<I, F> Iterator for Update<I, F>
    where I: Iterator, - F: FnMut(&mut I::Item),

    §

    type Item = <I as Iterator>::Item

    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<Acc, G>(self, init: Acc, g: G) -> Acc
    where + F: FnMut(&mut I::Item),

    §

    type Item = <I as Iterator>::Item

    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<Acc, G>(self, init: Acc, g: G) -> Acc
    where G: FnMut(Acc, Self::Item) -> Acc,

    Folds every element into an accumulator by applying an operation, -returning the final result. Read more
    source§

    fn collect<C>(self) -> C
    where +returning the final result. 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 @@ -192,7 +192,7 @@ greater than or equal to those of another. 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, F> FusedIterator for Update<I, F>
    where +function. Read more

    source§

    impl<I, F> FusedIterator for Update<I, F>
    where I: FusedIterator, F: FnMut(&mut I::Item),

    Auto Trait Implementations§

    §

    impl<I, F> Freeze for Update<I, F>
    where F: Freeze, @@ -222,86 +222,87 @@ otherwise. Right variant of Either<Self, Self> otherwise. Read more

    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> Itertools for T
    where - T: Iterator + ?Sized,

    source§

    fn interleave<J>(self, other: J) -> Interleave<Self, J::IntoIter> ⓘ
    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> Itertools for T
    where + T: Iterator + ?Sized,

    source§

    fn interleave<J>(self, other: J) -> Interleave<Self, J::IntoIter> ⓘ
    where J: IntoIterator<Item = Self::Item>, - Self: Sized,

    Alternate elements from two iterators until both have run out. Read more
    source§

    fn interleave_shortest<J>( + Self: Sized,

    Alternate elements from two iterators until both have run out. Read more
    source§

    fn interleave_shortest<J>( self, other: J ) -> InterleaveShortest<Self, J::IntoIter> ⓘ
    where J: IntoIterator<Item = Self::Item>, Self: Sized,

    Alternate elements from two iterators until at least one of them has run -out. Read more
    source§

    fn intersperse(self, element: Self::Item) -> Intersperse<Self>
    where +out. Read more

    source§

    fn intersperse(self, element: Self::Item) -> Intersperse<Self>
    where Self: Sized, Self::Item: Clone,

    An iterator adaptor to insert a particular value -between each element of the adapted iterator. Read more
    source§

    fn intersperse_with<F>(self, element: F) -> IntersperseWith<Self, F> ⓘ
    where +between each element of the adapted iterator. Read more

    source§

    fn intersperse_with<F>(self, element: F) -> IntersperseWith<Self, F> ⓘ
    where Self: Sized, F: FnMut() -> Self::Item,

    An iterator adaptor to insert a particular value created by a function -between each element of the adapted iterator. Read more
    source§

    fn zip_longest<J>(self, other: J) -> ZipLongest<Self, J::IntoIter> ⓘ
    where +between each element of the adapted iterator. Read more

    source§

    fn get<R>(self, index: R) -> R::Output
    where + Self: Sized, + R: IteratorIndex<Self>,

    Returns an iterator over a subsection of the iterator. Read more
    source§

    fn zip_longest<J>(self, other: J) -> ZipLongest<Self, J::IntoIter> ⓘ
    where J: IntoIterator, Self: Sized,

    Create an iterator which iterates over both this and the specified -iterator simultaneously, yielding pairs of two optional elements. Read more
    source§

    fn zip_eq<J>(self, other: J) -> ZipEq<Self, J::IntoIter> ⓘ
    where +iterator simultaneously, yielding pairs of two optional elements. Read more

    source§

    fn zip_eq<J>(self, other: J) -> ZipEq<Self, J::IntoIter> ⓘ
    where J: IntoIterator, Self: Sized,

    Create an iterator which iterates over both this and the specified -iterator simultaneously, yielding pairs of elements. Read more
    source§

    fn batching<B, F>(self, f: F) -> Batching<Self, F> ⓘ
    where +iterator simultaneously, yielding pairs of elements. Read more

    source§

    fn batching<B, F>(self, f: F) -> Batching<Self, F> ⓘ
    where F: FnMut(&mut Self) -> Option<B>, Self: Sized,

    A “meta iterator adaptor”. Its closure receives a reference to the iterator and may pick off as many elements as it likes, to produce the -next iterator element. Read more
    source§

    fn group_by<K, F>(self, key: F) -> GroupBy<K, Self, F>
    where +next iterator element. Read more

    source§

    fn chunk_by<K, F>(self, key: F) -> ChunkBy<K, Self, F>
    where Self: Sized, F: FnMut(&Self::Item) -> K, K: PartialEq,

    Return an iterable that can group iterator elements. Consecutive elements that map to the same key (“runs”), are assigned -to the same group. Read more
    source§

    fn chunks(self, size: usize) -> IntoChunks<Self>
    where - Self: Sized,

    Return an iterable that can chunk the iterator. Read more
    source§

    fn tuple_windows<T>(self) -> TupleWindows<Self, T> ⓘ
    where +to the same group. Read more

    source§

    fn group_by<K, F>(self, key: F) -> ChunkBy<K, Self, F>
    where + Self: Sized, + F: FnMut(&Self::Item) -> K, + K: PartialEq,

    👎Deprecated since 0.13.0: Use .chunk_by() instead
    See .chunk_by().
    source§

    fn chunks(self, size: usize) -> IntoChunks<Self>
    where + Self: Sized,

    Return an iterable that can chunk the iterator. Read more
    source§

    fn tuple_windows<T>(self) -> TupleWindows<Self, T> ⓘ
    where Self: Sized + Iterator<Item = T::Item>, T: HomogeneousTuple, T::Item: Clone,

    Return an iterator over all contiguous windows producing tuples of -a specific size (up to 12). Read more
    source§

    fn circular_tuple_windows<T>(self) -> CircularTupleWindows<Self, T> ⓘ
    where +a specific size (up to 12). Read more

    source§

    fn circular_tuple_windows<T>(self) -> CircularTupleWindows<Self, T> ⓘ
    where Self: Sized + Clone + Iterator<Item = T::Item> + ExactSizeIterator, T: TupleCollect + Clone, T::Item: Clone,

    Return an iterator over all windows, wrapping back to the first elements when the window would otherwise exceed the length of the -iterator, producing tuples of a specific size (up to 12). Read more
    source§

    fn tuples<T>(self) -> Tuples<Self, T> ⓘ
    where +iterator, producing tuples of a specific size (up to 12). Read more

    source§

    fn tuples<T>(self) -> Tuples<Self, T> ⓘ
    where Self: Sized + Iterator<Item = T::Item>, T: HomogeneousTuple,

    Return an iterator that groups the items in tuples of a specific size -(up to 12). Read more
    source§

    fn tee(self) -> (Tee<Self>, Tee<Self>)
    where +(up to 12). Read more

    source§

    fn tee(self) -> (Tee<Self>, Tee<Self>)
    where Self: Sized, Self::Item: Clone,

    Split into an iterator pair that both yield all elements from -the original iterator. Read more
    source§

    fn step(self, n: usize) -> Step<Self> ⓘ
    where - Self: Sized,

    👎Deprecated since 0.8.0: Use std .step_by() instead
    Return an iterator adaptor that steps n elements in the base iterator -for each iteration. Read more
    source§

    fn map_into<R>(self) -> MapInto<Self, R>
    where +the original iterator. Read more

    source§

    fn map_into<R>(self) -> MapInto<Self, R>
    where Self: Sized, - Self::Item: Into<R>,

    Convert each item of the iterator using the Into trait. Read more
    source§

    fn map_results<F, T, U, E>(self, f: F) -> MapOk<Self, F>
    where - Self: Iterator<Item = Result<T, E>> + Sized, - F: FnMut(T) -> U,

    👎Deprecated since 0.10.0: Use .map_ok() instead
    See .map_ok().
    source§

    fn map_ok<F, T, U, E>(self, f: F) -> MapOk<Self, F>
    where + Self::Item: Into<R>,

    Convert each item of the iterator using the Into trait. Read more
    source§

    fn map_ok<F, T, U, E>(self, f: F) -> MapOk<Self, F>
    where Self: Iterator<Item = Result<T, E>> + Sized, F: FnMut(T) -> U,

    Return an iterator adaptor that applies the provided closure to every Result::Ok value. Result::Err values are -unchanged. Read more
    source§

    fn filter_ok<F, T, E>(self, f: F) -> FilterOk<Self, F> ⓘ
    where +unchanged. Read more

    source§

    fn filter_ok<F, T, E>(self, f: F) -> FilterOk<Self, F> ⓘ
    where Self: Iterator<Item = Result<T, E>> + Sized, F: FnMut(&T) -> bool,

    Return an iterator adaptor that filters every Result::Ok value with the provided closure. Result::Err values are -unchanged. Read more
    source§

    fn filter_map_ok<F, T, U, E>(self, f: F) -> FilterMapOk<Self, F> ⓘ
    where +unchanged. Read more

    source§

    fn filter_map_ok<F, T, U, E>(self, f: F) -> FilterMapOk<Self, F> ⓘ
    where Self: Iterator<Item = Result<T, E>> + Sized, F: FnMut(T) -> Option<U>,

    Return an iterator adaptor that filters and transforms every Result::Ok value with the provided closure. Result::Err -values are unchanged. Read more
    source§

    fn flatten_ok<T, E>(self) -> FlattenOk<Self, T, E> ⓘ
    where +values are unchanged. Read more

    source§

    fn flatten_ok<T, E>(self) -> FlattenOk<Self, T, E> ⓘ
    where Self: Iterator<Item = Result<T, E>> + Sized, T: IntoIterator,

    Return an iterator adaptor that flattens every Result::Ok value into -a series of Result::Ok values. Result::Err values are unchanged. Read more
    source§

    fn process_results<F, T, E, R>(self, processor: F) -> Result<R, E>
    where +a series of Result::Ok values. Result::Err values are unchanged. Read more

    source§

    fn process_results<F, T, E, R>(self, processor: F) -> Result<R, E>
    where Self: Iterator<Item = Result<T, E>> + Sized, F: FnOnce(ProcessResults<'_, Self, E>) -> R,

    “Lift” a function of the values of the current iterator so as to process -an iterator of Result values instead. Read more
    source§

    fn merge<J>(self, other: J) -> Merge<Self, J::IntoIter>
    where +an iterator of Result values instead. Read more

    source§

    fn merge<J>(self, other: J) -> Merge<Self, J::IntoIter>
    where Self: Sized, Self::Item: PartialOrd, J: IntoIterator<Item = Self::Item>,

    Return an iterator adaptor that merges the two base iterators in ascending order. If both base iterators are sorted (ascending), the -result is sorted. Read more
    source§

    fn merge_by<J, F>(self, other: J, is_first: F) -> MergeBy<Self, J::IntoIter, F> ⓘ
    where +result is sorted. Read more

    source§

    fn merge_by<J, F>(self, other: J, is_first: F) -> MergeBy<Self, J::IntoIter, F> ⓘ
    where Self: Sized, J: IntoIterator<Item = Self::Item>, F: FnMut(&Self::Item, &Self::Item) -> bool,

    Return an iterator adaptor that merges the two base iterators in order. -This is much like .merge() but allows for a custom ordering. Read more
    source§

    fn merge_join_by<J, F, T>( +This is much like .merge() but allows for a custom ordering. Read more

    source§

    fn merge_join_by<J, F, T>( self, other: J, cmp_fn: F @@ -309,284 +310,295 @@ This is much like IntoIterator, F: FnMut(&Self::Item, &J::Item) -> T, Self: Sized,

    Create an iterator that merges items from both this and the specified -iterator in ascending order. Read more
    source§

    fn kmerge(self) -> KMerge<<Self::Item as IntoIterator>::IntoIter>
    where +iterator in ascending order. Read more

    source§

    fn kmerge(self) -> KMerge<<Self::Item as IntoIterator>::IntoIter>
    where Self: Sized, Self::Item: IntoIterator, <Self::Item as IntoIterator>::Item: PartialOrd,

    Return an iterator adaptor that flattens an iterator of iterators by -merging them in ascending order. Read more
    source§

    fn kmerge_by<F>( +merging them in ascending order. Read more

    source§

    fn kmerge_by<F>( self, first: F ) -> KMergeBy<<Self::Item as IntoIterator>::IntoIter, F> ⓘ
    where Self: Sized, Self::Item: IntoIterator, F: FnMut(&<Self::Item as IntoIterator>::Item, &<Self::Item as IntoIterator>::Item) -> bool,

    Return an iterator adaptor that flattens an iterator of iterators by -merging them according to the given closure. Read more
    source§

    fn cartesian_product<J>(self, other: J) -> Product<Self, J::IntoIter> ⓘ
    where +merging them according to the given closure. Read more

    source§

    fn cartesian_product<J>(self, other: J) -> Product<Self, J::IntoIter> ⓘ
    where Self: Sized, Self::Item: Clone, J: IntoIterator, J::IntoIter: Clone,

    Return an iterator adaptor that iterates over the cartesian product of -the element sets of two iterators self and J. Read more
    source§

    fn multi_cartesian_product( +the element sets of two iterators self and J. Read more

    source§

    fn multi_cartesian_product( self ) -> MultiProduct<<Self::Item as IntoIterator>::IntoIter> ⓘ
    where Self: Sized, Self::Item: IntoIterator, <Self::Item as IntoIterator>::IntoIter: Clone, <Self::Item as IntoIterator>::Item: Clone,

    Return an iterator adaptor that iterates over the cartesian product of -all subiterators returned by meta-iterator self. Read more
    source§

    fn coalesce<F>(self, f: F) -> Coalesce<Self, F>
    where +all subiterators returned by meta-iterator self. Read more

    source§

    fn coalesce<F>(self, f: F) -> Coalesce<Self, F>
    where Self: Sized, F: FnMut(Self::Item, Self::Item) -> Result<Self::Item, (Self::Item, Self::Item)>,

    Return an iterator adaptor that uses the passed-in closure to -optionally merge together consecutive elements. Read more
    source§

    fn dedup(self) -> Dedup<Self>
    where +optionally merge together consecutive elements. Read more

    source§

    fn dedup(self) -> Dedup<Self>
    where Self: Sized, Self::Item: PartialEq,

    Remove duplicates from sections of consecutive identical elements. -If the iterator is sorted, all elements will be unique. Read more
    source§

    fn dedup_by<Cmp>(self, cmp: Cmp) -> DedupBy<Self, Cmp>
    where +If the iterator is sorted, all elements will be unique. Read more

    source§

    fn dedup_by<Cmp>(self, cmp: Cmp) -> DedupBy<Self, Cmp>
    where Self: Sized, Cmp: FnMut(&Self::Item, &Self::Item) -> bool,

    Remove duplicates from sections of consecutive identical elements, determining equality using a comparison function. -If the iterator is sorted, all elements will be unique. Read more
    source§

    fn dedup_with_count(self) -> DedupWithCount<Self>
    where +If the iterator is sorted, all elements will be unique. Read more

    source§

    fn dedup_with_count(self) -> DedupWithCount<Self>
    where Self: Sized,

    Remove duplicates from sections of consecutive identical elements, while keeping a count of how many repeated elements were present. -If the iterator is sorted, all elements will be unique. Read more
    source§

    fn dedup_by_with_count<Cmp>(self, cmp: Cmp) -> DedupByWithCount<Self, Cmp>
    where +If the iterator is sorted, all elements will be unique. Read more

    source§

    fn dedup_by_with_count<Cmp>(self, cmp: Cmp) -> DedupByWithCount<Self, Cmp>
    where Self: Sized, Cmp: FnMut(&Self::Item, &Self::Item) -> bool,

    Remove duplicates from sections of consecutive identical elements, while keeping a count of how many repeated elements were present. This will determine equality using a comparison function. -If the iterator is sorted, all elements will be unique. Read more
    source§

    fn duplicates(self) -> Duplicates<Self>
    where +If the iterator is sorted, all elements will be unique. Read more

    source§

    fn duplicates(self) -> Duplicates<Self>
    where Self: Sized, Self::Item: Eq + Hash,

    Return an iterator adaptor that produces elements that appear more than once during the -iteration. Duplicates are detected using hash and equality. Read more
    source§

    fn duplicates_by<V, F>(self, f: F) -> DuplicatesBy<Self, V, F>
    where +iteration. Duplicates are detected using hash and equality. Read more

    source§

    fn duplicates_by<V, F>(self, f: F) -> DuplicatesBy<Self, V, F>
    where Self: Sized, V: Eq + Hash, F: FnMut(&Self::Item) -> V,

    Return an iterator adaptor that produces elements that appear more than once during the -iteration. Duplicates are detected using hash and equality. Read more
    source§

    fn unique(self) -> Unique<Self> ⓘ
    where +iteration. Duplicates are detected using hash and equality. Read more

    source§

    fn unique(self) -> Unique<Self> ⓘ
    where Self: Sized, Self::Item: Clone + Eq + Hash,

    Return an iterator adaptor that filters out elements that have already been produced once during the iteration. Duplicates -are detected using hash and equality. Read more
    source§

    fn unique_by<V, F>(self, f: F) -> UniqueBy<Self, V, F> ⓘ
    where +are detected using hash and equality. Read more

    source§

    fn unique_by<V, F>(self, f: F) -> UniqueBy<Self, V, F> ⓘ
    where Self: Sized, V: Eq + Hash, F: FnMut(&Self::Item) -> V,

    Return an iterator adaptor that filters out elements that have -already been produced once during the iteration. Read more
    source§

    fn peeking_take_while<F>(&mut self, accept: F) -> PeekingTakeWhile<'_, Self, F> ⓘ
    where +already been produced once during the iteration. Read more

    source§

    fn peeking_take_while<F>(&mut self, accept: F) -> PeekingTakeWhile<'_, Self, F> ⓘ
    where Self: Sized + PeekingNext, F: FnMut(&Self::Item) -> bool,

    Return an iterator adaptor that borrows from this iterator and -takes items while the closure accept returns true. Read more
    source§

    fn take_while_ref<F>(&mut self, accept: F) -> TakeWhileRef<'_, Self, F> ⓘ
    where +takes items while the closure accept returns true. Read more

    source§

    fn take_while_ref<F>(&mut self, accept: F) -> TakeWhileRef<'_, Self, F> ⓘ
    where Self: Clone, F: FnMut(&Self::Item) -> bool,

    Return an iterator adaptor that borrows from a Clone-able iterator -to only pick off elements while the predicate accept returns true. Read more
    source§

    fn take_while_inclusive<F>(self, accept: F) -> TakeWhileInclusive<Self, F> ⓘ
    where +to only pick off elements while the predicate accept returns true. Read more

    source§

    fn take_while_inclusive<F>(self, accept: F) -> TakeWhileInclusive<Self, F> ⓘ
    where Self: Sized, F: FnMut(&Self::Item) -> bool,

    Returns an iterator adaptor that consumes elements while the given predicate is true, including the element for which the predicate -first returned false. Read more
    source§

    fn while_some<A>(self) -> WhileSome<Self> ⓘ
    where +first returned false. Read more

    source§

    fn while_some<A>(self) -> WhileSome<Self> ⓘ
    where Self: Sized + Iterator<Item = Option<A>>,

    Return an iterator adaptor that filters Option<A> iterator elements -and produces A. Stops on the first None encountered. Read more
    source§

    fn tuple_combinations<T>(self) -> TupleCombinations<Self, T> ⓘ
    where +and produces A. Stops on the first None encountered. Read more

    source§

    fn tuple_combinations<T>(self) -> TupleCombinations<Self, T> ⓘ
    where Self: Sized + Clone, Self::Item: Clone, T: HasCombination<Self>,

    Return an iterator adaptor that iterates over the combinations of the -elements from an iterator. Read more
    source§

    fn combinations(self, k: usize) -> Combinations<Self> ⓘ
    where +elements from an iterator. Read more

    source§

    fn combinations(self, k: usize) -> Combinations<Self> ⓘ
    where Self: Sized, Self::Item: Clone,

    Return an iterator adaptor that iterates over the k-length combinations of -the elements from an iterator. Read more
    source§

    fn combinations_with_replacement( +the elements from an iterator. Read more

    source§

    fn combinations_with_replacement( self, k: usize ) -> CombinationsWithReplacement<Self> ⓘ
    where Self: Sized, Self::Item: Clone,

    Return an iterator that iterates over the k-length combinations of -the elements from an iterator, with replacement. Read more
    source§

    fn permutations(self, k: usize) -> Permutations<Self> ⓘ
    where +the elements from an iterator, with replacement. Read more

    source§

    fn permutations(self, k: usize) -> Permutations<Self> ⓘ
    where Self: Sized, Self::Item: Clone,

    Return an iterator adaptor that iterates over all k-permutations of the -elements from an iterator. Read more
    source§

    fn powerset(self) -> Powerset<Self> ⓘ
    where +elements from an iterator. Read more

    source§

    fn powerset(self) -> Powerset<Self> ⓘ
    where Self: Sized, Self::Item: Clone,

    Return an iterator that iterates through the powerset of the elements from an -iterator. Read more
    source§

    fn pad_using<F>(self, min: usize, f: F) -> PadUsing<Self, F> ⓘ
    where +iterator. Read more

    source§

    fn pad_using<F>(self, min: usize, f: F) -> PadUsing<Self, F> ⓘ
    where Self: Sized, F: FnMut(usize) -> Self::Item,

    Return an iterator adaptor that pads the sequence to a minimum length of -min by filling missing elements using a closure f. Read more
    source§

    fn with_position(self) -> WithPosition<Self> ⓘ
    where +min by filling missing elements using a closure f. Read more

    source§

    fn with_position(self) -> WithPosition<Self> ⓘ
    where Self: Sized,

    Return an iterator adaptor that combines each element with a Position to -ease special-case handling of the first or last elements. Read more
    source§

    fn positions<P>(self, predicate: P) -> Positions<Self, P> ⓘ
    where +ease special-case handling of the first or last elements. Read more

    source§

    fn positions<P>(self, predicate: P) -> Positions<Self, P> ⓘ
    where Self: Sized, P: FnMut(Self::Item) -> bool,

    Return an iterator adaptor that yields the indices of all elements -satisfying a predicate, counted from the start of the iterator. Read more
    source§

    fn update<F>(self, updater: F) -> Update<Self, F> ⓘ
    where +satisfying a predicate, counted from the start of the iterator. Read more

    source§

    fn update<F>(self, updater: F) -> Update<Self, F> ⓘ
    where Self: Sized, F: FnMut(&mut Self::Item),

    Return an iterator adaptor that applies a mutating function -to each element before yielding it. Read more
    source§

    fn next_tuple<T>(&mut self) -> Option<T>
    where +to each element before yielding it. Read more

    source§

    fn next_tuple<T>(&mut self) -> Option<T>
    where Self: Sized + Iterator<Item = T::Item>, T: HomogeneousTuple,

    Advances the iterator and returns the next items grouped in a tuple of -a specific size (up to 12). Read more
    source§

    fn collect_tuple<T>(self) -> Option<T>
    where +a specific size (up to 12). Read more

    source§

    fn collect_tuple<T>(self) -> Option<T>
    where Self: Sized + Iterator<Item = T::Item>, T: HomogeneousTuple,

    Collects all items from the iterator into a tuple of a specific size -(up to 12). Read more
    source§

    fn find_position<P>(&mut self, pred: P) -> Option<(usize, Self::Item)>
    where - P: FnMut(&Self::Item) -> bool,

    Find the position and value of the first element satisfying a predicate. Read more
    source§

    fn find_or_last<P>(self, predicate: P) -> Option<Self::Item>
    where +(up to 12). Read more

    source§

    fn find_position<P>(&mut self, pred: P) -> Option<(usize, Self::Item)>
    where + P: FnMut(&Self::Item) -> bool,

    Find the position and value of the first element satisfying a predicate. Read more
    source§

    fn find_or_last<P>(self, predicate: P) -> Option<Self::Item>
    where Self: Sized, - P: FnMut(&Self::Item) -> bool,

    Find the value of the first element satisfying a predicate or return the last element, if any. Read more
    source§

    fn find_or_first<P>(self, predicate: P) -> Option<Self::Item>
    where + P: FnMut(&Self::Item) -> bool,

    Find the value of the first element satisfying a predicate or return the last element, if any. Read more
    source§

    fn find_or_first<P>(self, predicate: P) -> Option<Self::Item>
    where Self: Sized, - P: FnMut(&Self::Item) -> bool,

    Find the value of the first element satisfying a predicate or return the first element, if any. Read more
    source§

    fn contains<Q>(&mut self, query: &Q) -> bool
    where + P: FnMut(&Self::Item) -> bool,

    Find the value of the first element satisfying a predicate or return the first element, if any. Read more
    source§

    fn contains<Q>(&mut self, query: &Q) -> bool
    where Self: Sized, Self::Item: Borrow<Q>, - Q: PartialEq,

    Returns true if the given item is present in this iterator. Read more
    source§

    fn all_equal(&mut self) -> bool
    where + Q: PartialEq,

    Returns true if the given item is present in this iterator. Read more
    source§

    fn all_equal(&mut self) -> bool
    where Self: Sized, - Self::Item: PartialEq,

    Check whether all elements compare equal. Read more
    source§

    fn all_equal_value( + Self::Item: PartialEq,

    Check whether all elements compare equal. Read more
    source§

    fn all_equal_value( &mut self ) -> Result<Self::Item, Option<(Self::Item, Self::Item)>>
    where Self: Sized, Self::Item: PartialEq,

    If there are elements and they are all equal, return a single copy of that element. If there are no elements, return an Error containing None. If there are elements and they are not all equal, return a tuple containing the first -two non-equal elements found. Read more
    source§

    fn all_unique(&mut self) -> bool
    where +two non-equal elements found. Read more

    source§

    fn all_unique(&mut self) -> bool
    where Self: Sized, - Self::Item: Eq + Hash,

    Check whether all elements are unique (non equal). Read more
    source§

    fn dropping(self, n: usize) -> Self
    where + Self::Item: Eq + Hash,

    Check whether all elements are unique (non equal). Read more
    source§

    fn dropping(self, n: usize) -> Self
    where Self: Sized,

    Consume the first n elements from the iterator eagerly, -and return the same iterator again. Read more
    source§

    fn dropping_back(self, n: usize) -> Self
    where +and return the same iterator again. Read more

    source§

    fn dropping_back(self, n: usize) -> Self
    where Self: Sized + DoubleEndedIterator,

    Consume the last n elements from the iterator eagerly, -and return the same iterator again. Read more
    source§

    fn foreach<F>(self, f: F)
    where - F: FnMut(Self::Item), - Self: Sized,

    👎Deprecated since 0.8.0: Use .for_each() instead
    Run the closure f eagerly on each element of the iterator. Read more
    source§

    fn concat(self) -> Self::Item
    where +and return the same iterator again. Read more

    source§

    fn concat(self) -> Self::Item
    where Self: Sized, - Self::Item: Extend<<<Self as Iterator>::Item as IntoIterator>::Item> + IntoIterator + Default,

    Combine all an iterator’s elements into one element by using Extend. Read more
    source§

    fn collect_vec(self) -> Vec<Self::Item>
    where + Self::Item: Extend<<<Self as Iterator>::Item as IntoIterator>::Item> + IntoIterator + Default,

    Combine all an iterator’s elements into one element by using Extend. Read more
    source§

    fn collect_vec(self) -> Vec<Self::Item>
    where Self: Sized,

    .collect_vec() is simply a type specialization of Iterator::collect, -for convenience.
    source§

    fn try_collect<T, U, E>(self) -> Result<U, E>
    where +for convenience.

    source§

    fn try_collect<T, U, E>(self) -> Result<U, E>
    where Self: Sized + Iterator<Item = Result<T, E>>, Result<U, E>: FromIterator<Result<T, E>>,

    .try_collect() is more convenient way of writing -.collect::<Result<_, _>>() Read more
    source§

    fn set_from<'a, A: 'a, J>(&mut self, from: J) -> usize
    where +.collect::<Result<_, _>>() Read more

    source§

    fn set_from<'a, A: 'a, J>(&mut self, from: J) -> usize
    where Self: Iterator<Item = &'a mut A>, J: IntoIterator<Item = A>,

    Assign to each reference in self from the from iterator, -stopping at the shortest of the two iterators. Read more
    source§

    fn join(&mut self, sep: &str) -> String
    where - Self::Item: Display,

    Combine all iterator elements into one String, separated by sep. Read more
    source§

    fn format(self, sep: &str) -> Format<'_, Self>
    where - Self: Sized,

    Format all iterator elements, separated by sep. Read more
    source§

    fn format_with<F>(self, sep: &str, format: F) -> FormatWith<'_, Self, F>
    where +stopping at the shortest of the two iterators. Read more

    source§

    fn join(&mut self, sep: &str) -> String
    where + Self::Item: Display,

    Combine all iterator elements into one String, separated by sep. Read more
    source§

    fn format(self, sep: &str) -> Format<'_, Self>
    where + Self: Sized,

    Format all iterator elements, separated by sep. Read more
    source§

    fn format_with<F>(self, sep: &str, format: F) -> FormatWith<'_, Self, F>
    where Self: Sized, - F: FnMut(Self::Item, &mut dyn FnMut(&dyn Display) -> Result) -> Result,

    Format all iterator elements, separated by sep. Read more
    source§

    fn fold_results<A, E, B, F>(&mut self, start: B, f: F) -> Result<B, E>
    where + F: FnMut(Self::Item, &mut dyn FnMut(&dyn Display) -> Result) -> Result,

    Format all iterator elements, separated by sep. Read more
    source§

    fn fold_ok<A, E, B, F>(&mut self, start: B, f: F) -> Result<B, E>
    where Self: Iterator<Item = Result<A, E>>, - F: FnMut(B, A) -> B,

    👎Deprecated since 0.10.0: Use .fold_ok() instead
    See .fold_ok().
    source§

    fn fold_ok<A, E, B, F>(&mut self, start: B, f: F) -> Result<B, E>
    where - Self: Iterator<Item = Result<A, E>>, - F: FnMut(B, A) -> B,

    Fold Result values from an iterator. Read more
    source§

    fn fold_options<A, B, F>(&mut self, start: B, f: F) -> Option<B>
    where + F: FnMut(B, A) -> B,

    Fold Result values from an iterator. Read more
    source§

    fn fold_options<A, B, F>(&mut self, start: B, f: F) -> Option<B>
    where Self: Iterator<Item = Option<A>>, - F: FnMut(B, A) -> B,

    Fold Option values from an iterator. Read more
    source§

    fn fold1<F>(self, f: F) -> Option<Self::Item>
    where + F: FnMut(B, A) -> B,

    Fold Option values from an iterator. Read more
    source§

    fn fold1<F>(self, f: F) -> Option<Self::Item>
    where F: FnMut(Self::Item, Self::Item) -> Self::Item, - Self: Sized,

    👎Deprecated since 0.10.2: Use Iterator::reduce instead
    Accumulator of the elements in the iterator. Read more
    source§

    fn tree_fold1<F>(self, f: F) -> Option<Self::Item>
    where + Self: Sized,

    👎Deprecated since 0.10.2: Use Iterator::reduce instead
    Accumulator of the elements in the iterator. Read more
    source§

    fn tree_reduce<F>(self, f: F) -> Option<Self::Item>
    where F: FnMut(Self::Item, Self::Item) -> Self::Item, - Self: Sized,

    Accumulate the elements in the iterator in a tree-like manner. Read more
    source§

    fn fold_while<B, F>(&mut self, init: B, f: F) -> FoldWhile<B>
    where + Self: Sized,

    Accumulate the elements in the iterator in a tree-like manner. Read more
    source§

    fn tree_fold1<F>(self, f: F) -> Option<Self::Item>
    where + F: FnMut(Self::Item, Self::Item) -> Self::Item, + Self: Sized,

    👎Deprecated since 0.13.0: Use .tree_reduce() instead
    See .tree_reduce().
    source§

    fn fold_while<B, F>(&mut self, init: B, f: F) -> FoldWhile<B>
    where Self: Sized, - F: FnMut(B, Self::Item) -> FoldWhile<B>,

    An iterator method that applies a function, producing a single, final value. Read more
    source§

    fn sum1<S>(self) -> Option<S>
    where + F: FnMut(B, Self::Item) -> FoldWhile<B>,

    An iterator method that applies a function, producing a single, final value. Read more
    source§

    fn sum1<S>(self) -> Option<S>
    where Self: Sized, - S: Sum<Self::Item>,

    Iterate over the entire iterator and add all the elements. Read more
    source§

    fn product1<P>(self) -> Option<P>
    where + S: Sum<Self::Item>,

    Iterate over the entire iterator and add all the elements. Read more
    source§

    fn product1<P>(self) -> Option<P>
    where Self: Sized, - P: Product<Self::Item>,

    Iterate over the entire iterator and multiply all the elements. Read more
    source§

    fn sorted_unstable(self) -> IntoIter<Self::Item> ⓘ
    where + P: Product<Self::Item>,

    Iterate over the entire iterator and multiply all the elements. Read more
    source§

    fn sorted_unstable(self) -> IntoIter<Self::Item> ⓘ
    where Self: Sized, - Self::Item: Ord,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_unstable_by<F>(self, cmp: F) -> IntoIter<Self::Item> ⓘ
    where + Self::Item: Ord,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_unstable_by<F>(self, cmp: F) -> IntoIter<Self::Item> ⓘ
    where Self: Sized, - F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_unstable_by_key<K, F>(self, f: F) -> IntoIter<Self::Item> ⓘ
    where + F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_unstable_by_key<K, F>(self, f: F) -> IntoIter<Self::Item> ⓘ
    where Self: Sized, K: Ord, - F: FnMut(&Self::Item) -> K,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted(self) -> IntoIter<Self::Item> ⓘ
    where + F: FnMut(&Self::Item) -> K,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted(self) -> IntoIter<Self::Item> ⓘ
    where Self: Sized, - Self::Item: Ord,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_by<F>(self, cmp: F) -> IntoIter<Self::Item> ⓘ
    where + Self::Item: Ord,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_by<F>(self, cmp: F) -> IntoIter<Self::Item> ⓘ
    where Self: Sized, - F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_by_key<K, F>(self, f: F) -> IntoIter<Self::Item> ⓘ
    where + F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_by_key<K, F>(self, f: F) -> IntoIter<Self::Item> ⓘ
    where Self: Sized, K: Ord, - F: FnMut(&Self::Item) -> K,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_by_cached_key<K, F>(self, f: F) -> IntoIter<Self::Item> ⓘ
    where + F: FnMut(&Self::Item) -> K,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_by_cached_key<K, F>(self, f: F) -> IntoIter<Self::Item> ⓘ
    where Self: Sized, K: Ord, F: FnMut(&Self::Item) -> K,

    Sort all iterator elements into a new iterator in ascending order. The key function is -called exactly once per key. Read more
    source§

    fn k_smallest(self, k: usize) -> IntoIter<Self::Item> ⓘ
    where +called exactly once per key. Read more

    source§

    fn k_smallest(self, k: usize) -> IntoIter<Self::Item> ⓘ
    where Self: Sized, - Self::Item: Ord,

    Sort the k smallest elements into a new iterator, in ascending order. Read more
    source§

    fn partition_map<A, B, F, L, R>(self, predicate: F) -> (A, B)
    where + Self::Item: Ord,

    Sort the k smallest elements into a new iterator, in ascending order. Read more
    source§

    fn k_smallest_by<F>(self, k: usize, cmp: F) -> IntoIter<Self::Item> ⓘ
    where + Self: Sized, + F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Sort the k smallest elements into a new iterator using the provided comparison. Read more
    source§

    fn k_smallest_by_key<F, K>(self, k: usize, key: F) -> IntoIter<Self::Item> ⓘ
    where + Self: Sized, + F: FnMut(&Self::Item) -> K, + K: Ord,

    Return the elements producing the k smallest outputs of the provided function. Read more
    source§

    fn k_largest(self, k: usize) -> IntoIter<Self::Item> ⓘ
    where + Self: Sized, + Self::Item: Ord,

    Sort the k largest elements into a new iterator, in descending order. Read more
    source§

    fn k_largest_by<F>(self, k: usize, cmp: F) -> IntoIter<Self::Item> ⓘ
    where + Self: Sized, + F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Sort the k largest elements into a new iterator using the provided comparison. Read more
    source§

    fn k_largest_by_key<F, K>(self, k: usize, key: F) -> IntoIter<Self::Item> ⓘ
    where + Self: Sized, + F: FnMut(&Self::Item) -> K, + K: Ord,

    Return the elements producing the k largest outputs of the provided function. Read more
    source§

    fn tail(self, n: usize) -> IntoIter<Self::Item> ⓘ
    where + Self: Sized,

    Consumes the iterator and return an iterator of the last n elements. Read more
    source§

    fn partition_map<A, B, F, L, R>(self, predicate: F) -> (A, B)
    where Self: Sized, F: FnMut(Self::Item) -> Either<L, R>, A: Default + Extend<L>, B: Default + Extend<R>,

    Collect all iterator elements into one of two partitions. Unlike Iterator::partition, each partition may -have a distinct type. Read more
    source§

    fn partition_result<A, B, T, E>(self) -> (A, B)
    where +have a distinct type. Read more

    source§

    fn partition_result<A, B, T, E>(self) -> (A, B)
    where Self: Iterator<Item = Result<T, E>> + Sized, A: Default + Extend<T>, B: Default + Extend<E>,

    Partition a sequence of Results into one list of all the Ok elements -and another list of all the Err elements. Read more
    source§

    fn into_group_map<K, V>(self) -> HashMap<K, Vec<V>>
    where +and another list of all the Err elements. Read more

    source§

    fn into_group_map<K, V>(self) -> HashMap<K, Vec<V>>
    where Self: Iterator<Item = (K, V)> + Sized, K: Hash + Eq,

    Return a HashMap of keys mapped to Vecs of values. Keys and values -are taken from (Key, Value) tuple pairs yielded by the input iterator. Read more
    source§

    fn into_group_map_by<K, V, F>(self, f: F) -> HashMap<K, Vec<V>>
    where +are taken from (Key, Value) tuple pairs yielded by the input iterator. Read more

    source§

    fn into_group_map_by<K, V, F>(self, f: F) -> HashMap<K, Vec<V>>
    where Self: Iterator<Item = V> + Sized, K: Hash + Eq, - F: Fn(&V) -> K,

    Return an Iterator on a HashMap. Keys mapped to Vecs of values. The key is specified -in the closure. Read more
    source§

    fn into_grouping_map<K, V>(self) -> GroupingMap<Self>
    where + F: FnMut(&V) -> K,

    Return an Iterator on a HashMap. Keys mapped to Vecs of values. The key is specified +in the closure. Read more
    source§

    fn into_grouping_map<K, V>(self) -> GroupingMap<Self>
    where Self: Iterator<Item = (K, V)> + Sized, K: Hash + Eq,

    Constructs a GroupingMap to be used later with one of the efficient -group-and-fold operations it allows to perform. Read more
    source§

    fn into_grouping_map_by<K, V, F>(self, key_mapper: F) -> GroupingMapBy<Self, F>
    where +group-and-fold operations it allows to perform. Read more

    source§

    fn into_grouping_map_by<K, V, F>(self, key_mapper: F) -> GroupingMapBy<Self, F>
    where Self: Iterator<Item = V> + Sized, K: Hash + Eq, F: FnMut(&V) -> K,

    Constructs a GroupingMap to be used later with one of the efficient -group-and-fold operations it allows to perform. Read more
    source§

    fn min_set(self) -> Vec<Self::Item>
    where +group-and-fold operations it allows to perform. Read more

    source§

    fn min_set(self) -> Vec<Self::Item>
    where Self: Sized, - Self::Item: Ord,

    Return all minimum elements of an iterator. Read more
    source§

    fn min_set_by<F>(self, compare: F) -> Vec<Self::Item>
    where + Self::Item: Ord,

    Return all minimum elements of an iterator. Read more
    source§

    fn min_set_by<F>(self, compare: F) -> Vec<Self::Item>
    where Self: Sized, F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Return all minimum elements of an iterator, as determined by -the specified function. Read more
    source§

    fn min_set_by_key<K, F>(self, key: F) -> Vec<Self::Item>
    where +the specified function. Read more

    source§

    fn min_set_by_key<K, F>(self, key: F) -> Vec<Self::Item>
    where Self: Sized, K: Ord, F: FnMut(&Self::Item) -> K,

    Return all minimum elements of an iterator, as determined by -the specified function. Read more
    source§

    fn max_set(self) -> Vec<Self::Item>
    where +the specified function. Read more

    source§

    fn max_set(self) -> Vec<Self::Item>
    where Self: Sized, - Self::Item: Ord,

    Return all maximum elements of an iterator. Read more
    source§

    fn max_set_by<F>(self, compare: F) -> Vec<Self::Item>
    where + Self::Item: Ord,

    Return all maximum elements of an iterator. Read more
    source§

    fn max_set_by<F>(self, compare: F) -> Vec<Self::Item>
    where Self: Sized, F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Return all maximum elements of an iterator, as determined by -the specified function. Read more
    source§

    fn max_set_by_key<K, F>(self, key: F) -> Vec<Self::Item>
    where +the specified function. Read more

    source§

    fn max_set_by_key<K, F>(self, key: F) -> Vec<Self::Item>
    where Self: Sized, K: Ord, F: FnMut(&Self::Item) -> K,

    Return all maximum elements of an iterator, as determined by -the specified function. Read more
    source§

    fn minmax(self) -> MinMaxResult<Self::Item>
    where +the specified function. Read more

    source§

    fn minmax(self) -> MinMaxResult<Self::Item>
    where Self: Sized, - Self::Item: PartialOrd,

    Return the minimum and maximum elements in the iterator. Read more
    source§

    fn minmax_by_key<K, F>(self, key: F) -> MinMaxResult<Self::Item>
    where + Self::Item: PartialOrd,

    Return the minimum and maximum elements in the iterator. Read more
    source§

    fn minmax_by_key<K, F>(self, key: F) -> MinMaxResult<Self::Item>
    where Self: Sized, K: PartialOrd, F: FnMut(&Self::Item) -> K,

    Return the minimum and maximum element of an iterator, as determined by -the specified function. Read more
    source§

    fn minmax_by<F>(self, compare: F) -> MinMaxResult<Self::Item>
    where +the specified function. Read more

    source§

    fn minmax_by<F>(self, compare: F) -> MinMaxResult<Self::Item>
    where Self: Sized, F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Return the minimum and maximum element of an iterator, as determined by -the specified comparison function. Read more
    source§

    fn position_max(self) -> Option<usize>
    where +the specified comparison function. Read more

    source§

    fn position_max(self) -> Option<usize>
    where Self: Sized, - Self::Item: Ord,

    Return the position of the maximum element in the iterator. Read more
    source§

    fn position_max_by_key<K, F>(self, key: F) -> Option<usize>
    where + Self::Item: Ord,

    Return the position of the maximum element in the iterator. Read more
    source§

    fn position_max_by_key<K, F>(self, key: F) -> Option<usize>
    where Self: Sized, K: Ord, F: FnMut(&Self::Item) -> K,

    Return the position of the maximum element in the iterator, as -determined by the specified function. Read more
    source§

    fn position_max_by<F>(self, compare: F) -> Option<usize>
    where +determined by the specified function. Read more

    source§

    fn position_max_by<F>(self, compare: F) -> Option<usize>
    where Self: Sized, F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Return the position of the maximum element in the iterator, as -determined by the specified comparison function. Read more
    source§

    fn position_min(self) -> Option<usize>
    where +determined by the specified comparison function. Read more

    source§

    fn position_min(self) -> Option<usize>
    where Self: Sized, - Self::Item: Ord,

    Return the position of the minimum element in the iterator. Read more
    source§

    fn position_min_by_key<K, F>(self, key: F) -> Option<usize>
    where + Self::Item: Ord,

    Return the position of the minimum element in the iterator. Read more
    source§

    fn position_min_by_key<K, F>(self, key: F) -> Option<usize>
    where Self: Sized, K: Ord, F: FnMut(&Self::Item) -> K,

    Return the position of the minimum element in the iterator, as -determined by the specified function. Read more
    source§

    fn position_min_by<F>(self, compare: F) -> Option<usize>
    where +determined by the specified function. Read more

    source§

    fn position_min_by<F>(self, compare: F) -> Option<usize>
    where Self: Sized, F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Return the position of the minimum element in the iterator, as -determined by the specified comparison function. Read more
    source§

    fn position_minmax(self) -> MinMaxResult<usize>
    where +determined by the specified comparison function. Read more

    source§

    fn position_minmax(self) -> MinMaxResult<usize>
    where Self: Sized, Self::Item: PartialOrd,

    Return the positions of the minimum and maximum elements in -the iterator. Read more
    source§

    fn position_minmax_by_key<K, F>(self, key: F) -> MinMaxResult<usize>
    where +the iterator. Read more

    source§

    fn position_minmax_by_key<K, F>(self, key: F) -> MinMaxResult<usize>
    where Self: Sized, K: PartialOrd, F: FnMut(&Self::Item) -> K,

    Return the postions of the minimum and maximum elements of an -iterator, as determined by the specified function. Read more
    source§

    fn position_minmax_by<F>(self, compare: F) -> MinMaxResult<usize>
    where +iterator, as determined by the specified function. Read more

    source§

    fn position_minmax_by<F>(self, compare: F) -> MinMaxResult<usize>
    where Self: Sized, F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Return the postions of the minimum and maximum elements of an -iterator, as determined by the specified comparison function. Read more
    source§

    fn exactly_one(self) -> Result<Self::Item, ExactlyOneError<Self>>
    where +iterator, as determined by the specified comparison function. Read more

    source§

    fn exactly_one(self) -> Result<Self::Item, ExactlyOneError<Self>>
    where Self: Sized,

    If the iterator yields exactly one element, that element will be returned, otherwise an error will be returned containing an iterator that has the same output as the input -iterator. Read more
    source§

    fn at_most_one(self) -> Result<Option<Self::Item>, ExactlyOneError<Self>>
    where - Self: Sized,

    If the iterator yields no elements, Ok(None) will be returned. If the iterator yields +iterator. Read more
    source§

    fn at_most_one(self) -> Result<Option<Self::Item>, ExactlyOneError<Self>>
    where + Self: Sized,

    If the iterator yields no elements, Ok(None) will be returned. If the iterator yields exactly one element, that element will be returned, otherwise an error will be returned -containing an iterator that has the same output as the input iterator. Read more
    source§

    fn multipeek(self) -> MultiPeek<Self> ⓘ
    where +containing an iterator that has the same output as the input iterator. Read more

    source§

    fn multipeek(self) -> MultiPeek<Self> ⓘ
    where Self: Sized,

    An iterator adaptor that allows the user to peek at multiple .next() -values without advancing the base iterator. Read more
    source§

    fn counts(self) -> HashMap<Self::Item, usize>
    where +values without advancing the base iterator. Read more

    source§

    fn counts(self) -> HashMap<Self::Item, usize>
    where Self: Sized, Self::Item: Eq + Hash,

    Collect the items in this iterator and return a HashMap which contains each item that appears in the iterator and the number -of times it appears. Read more
    source§

    fn counts_by<K, F>(self, f: F) -> HashMap<K, usize>
    where +of times it appears. Read more

    source§

    fn counts_by<K, F>(self, f: F) -> HashMap<K, usize>
    where Self: Sized, K: Eq + Hash, F: FnMut(Self::Item) -> K,

    Collect the items in this iterator and return a HashMap which contains each item that appears in the iterator and the number of times it appears, -determining identity using a keying function. Read more
    source§

    fn multiunzip<FromI>(self) -> FromI
    where - Self: Sized + MultiUnzip<FromI>,

    Converts an iterator of tuples into a tuple of containers. Read more
    source§

    fn try_len(&self) -> Result<usize, (usize, Option<usize>)>

    Returns the length of the iterator if one exists. +determining identity using a keying function. Read more
    source§

    fn multiunzip<FromI>(self) -> FromI
    where + Self: Sized + MultiUnzip<FromI>,

    Converts an iterator of tuples into a tuple of containers. Read more
    source§

    fn try_len(&self) -> Result<usize, (usize, Option<usize>)>

    Returns the length of the iterator if one exists. Otherwise return self.size_hint(). Read more
    source§

    impl<IT> MultiUnzip<()> for IT
    where IT: Iterator<Item = ()>,

    source§

    fn multiunzip(self)

    Unzip this iterator into multiple collections.
    source§

    impl<IT, A, FromA> MultiUnzip<(FromA,)> for IT
    where IT: Iterator<Item = (A,)>, @@ -689,4 +701,4 @@ Otherwise return self.size_hint(). (FromA, FromB, FromC, FromD, FromE, FromF, FromG, FromH, FromI, FromJ, FromK, FromL)

    Unzip this iterator into multiple collections.
    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 + 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/itertools/structs/struct.WhileSome.html b/itertools/structs/struct.WhileSome.html index c09c186aa..c76f7a67a 100644 --- a/itertools/structs/struct.WhileSome.html +++ b/itertools/structs/struct.WhileSome.html @@ -1,9 +1,9 @@ -WhileSome in itertools::structs - Rust
    -

    Struct itertools::structs::WhileSome

    source · 
    pub struct WhileSome<I> { /* private fields */ }
    Expand description

    An iterator adaptor that filters Option<A> iterator elements +WhileSome in itertools::structs - Rust

    +

    Struct itertools::structs::WhileSome

    source · 
    pub struct WhileSome<I> { /* private fields */ }
    Expand description

    An iterator adaptor that filters Option<A> iterator elements and produces A. Stops on the first None encountered.

    See .while_some() for more information.

    -

    Trait Implementations§

    source§

    impl<I: Clone> Clone for WhileSome<I>

    source§

    fn clone(&self) -> WhileSome<I> ⓘ

    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<I: Debug> Debug for WhileSome<I>

    source§

    fn fmt(&self, f: &mut Formatter<'_>) -> Result

    Formats the value using the given formatter. Read more
    source§

    impl<I, A> Iterator for WhileSome<I>
    where - I: Iterator<Item = Option<A>>,

    §

    type Item = A

    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, acc: B, f: F) -> B
    where +

    Trait Implementations§

    source§

    impl<I: Clone> Clone for WhileSome<I>

    source§

    fn clone(&self) -> WhileSome<I> ⓘ

    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<I: Debug> Debug for WhileSome<I>

    source§

    fn fmt(&self, f: &mut Formatter<'_>) -> Result

    Formats the value using the given formatter. Read more
    source§

    impl<I, A> Iterator for WhileSome<I>
    where + I: Iterator<Item = Option<A>>,

    §

    type Item = A

    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, acc: 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>( @@ -202,86 +202,87 @@ otherwise. Right variant of Either<Self, Self> otherwise. Read more

    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> Itertools for T
    where - T: Iterator + ?Sized,

    source§

    fn interleave<J>(self, other: J) -> Interleave<Self, J::IntoIter> ⓘ
    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> Itertools for T
    where + T: Iterator + ?Sized,

    source§

    fn interleave<J>(self, other: J) -> Interleave<Self, J::IntoIter> ⓘ
    where J: IntoIterator<Item = Self::Item>, - Self: Sized,

    Alternate elements from two iterators until both have run out. Read more
    source§

    fn interleave_shortest<J>( + Self: Sized,

    Alternate elements from two iterators until both have run out. Read more
    source§

    fn interleave_shortest<J>( self, other: J ) -> InterleaveShortest<Self, J::IntoIter> ⓘ
    where J: IntoIterator<Item = Self::Item>, Self: Sized,

    Alternate elements from two iterators until at least one of them has run -out. Read more
    source§

    fn intersperse(self, element: Self::Item) -> Intersperse<Self>
    where +out. Read more

    source§

    fn intersperse(self, element: Self::Item) -> Intersperse<Self>
    where Self: Sized, Self::Item: Clone,

    An iterator adaptor to insert a particular value -between each element of the adapted iterator. Read more
    source§

    fn intersperse_with<F>(self, element: F) -> IntersperseWith<Self, F> ⓘ
    where +between each element of the adapted iterator. Read more

    source§

    fn intersperse_with<F>(self, element: F) -> IntersperseWith<Self, F> ⓘ
    where Self: Sized, F: FnMut() -> Self::Item,

    An iterator adaptor to insert a particular value created by a function -between each element of the adapted iterator. Read more
    source§

    fn zip_longest<J>(self, other: J) -> ZipLongest<Self, J::IntoIter> ⓘ
    where +between each element of the adapted iterator. Read more

    source§

    fn get<R>(self, index: R) -> R::Output
    where + Self: Sized, + R: IteratorIndex<Self>,

    Returns an iterator over a subsection of the iterator. Read more
    source§

    fn zip_longest<J>(self, other: J) -> ZipLongest<Self, J::IntoIter> ⓘ
    where J: IntoIterator, Self: Sized,

    Create an iterator which iterates over both this and the specified -iterator simultaneously, yielding pairs of two optional elements. Read more
    source§

    fn zip_eq<J>(self, other: J) -> ZipEq<Self, J::IntoIter> ⓘ
    where +iterator simultaneously, yielding pairs of two optional elements. Read more

    source§

    fn zip_eq<J>(self, other: J) -> ZipEq<Self, J::IntoIter> ⓘ
    where J: IntoIterator, Self: Sized,

    Create an iterator which iterates over both this and the specified -iterator simultaneously, yielding pairs of elements. Read more
    source§

    fn batching<B, F>(self, f: F) -> Batching<Self, F> ⓘ
    where +iterator simultaneously, yielding pairs of elements. Read more

    source§

    fn batching<B, F>(self, f: F) -> Batching<Self, F> ⓘ
    where F: FnMut(&mut Self) -> Option<B>, Self: Sized,

    A “meta iterator adaptor”. Its closure receives a reference to the iterator and may pick off as many elements as it likes, to produce the -next iterator element. Read more
    source§

    fn group_by<K, F>(self, key: F) -> GroupBy<K, Self, F>
    where +next iterator element. Read more

    source§

    fn chunk_by<K, F>(self, key: F) -> ChunkBy<K, Self, F>
    where Self: Sized, F: FnMut(&Self::Item) -> K, K: PartialEq,

    Return an iterable that can group iterator elements. Consecutive elements that map to the same key (“runs”), are assigned -to the same group. Read more
    source§

    fn chunks(self, size: usize) -> IntoChunks<Self>
    where - Self: Sized,

    Return an iterable that can chunk the iterator. Read more
    source§

    fn tuple_windows<T>(self) -> TupleWindows<Self, T> ⓘ
    where +to the same group. Read more

    source§

    fn group_by<K, F>(self, key: F) -> ChunkBy<K, Self, F>
    where + Self: Sized, + F: FnMut(&Self::Item) -> K, + K: PartialEq,

    👎Deprecated since 0.13.0: Use .chunk_by() instead
    See .chunk_by().
    source§

    fn chunks(self, size: usize) -> IntoChunks<Self>
    where + Self: Sized,

    Return an iterable that can chunk the iterator. Read more
    source§

    fn tuple_windows<T>(self) -> TupleWindows<Self, T> ⓘ
    where Self: Sized + Iterator<Item = T::Item>, T: HomogeneousTuple, T::Item: Clone,

    Return an iterator over all contiguous windows producing tuples of -a specific size (up to 12). Read more
    source§

    fn circular_tuple_windows<T>(self) -> CircularTupleWindows<Self, T> ⓘ
    where +a specific size (up to 12). Read more

    source§

    fn circular_tuple_windows<T>(self) -> CircularTupleWindows<Self, T> ⓘ
    where Self: Sized + Clone + Iterator<Item = T::Item> + ExactSizeIterator, T: TupleCollect + Clone, T::Item: Clone,

    Return an iterator over all windows, wrapping back to the first elements when the window would otherwise exceed the length of the -iterator, producing tuples of a specific size (up to 12). Read more
    source§

    fn tuples<T>(self) -> Tuples<Self, T> ⓘ
    where +iterator, producing tuples of a specific size (up to 12). Read more

    source§

    fn tuples<T>(self) -> Tuples<Self, T> ⓘ
    where Self: Sized + Iterator<Item = T::Item>, T: HomogeneousTuple,

    Return an iterator that groups the items in tuples of a specific size -(up to 12). Read more
    source§

    fn tee(self) -> (Tee<Self>, Tee<Self>)
    where +(up to 12). Read more

    source§

    fn tee(self) -> (Tee<Self>, Tee<Self>)
    where Self: Sized, Self::Item: Clone,

    Split into an iterator pair that both yield all elements from -the original iterator. Read more
    source§

    fn step(self, n: usize) -> Step<Self> ⓘ
    where - Self: Sized,

    👎Deprecated since 0.8.0: Use std .step_by() instead
    Return an iterator adaptor that steps n elements in the base iterator -for each iteration. Read more
    source§

    fn map_into<R>(self) -> MapInto<Self, R>
    where +the original iterator. Read more

    source§

    fn map_into<R>(self) -> MapInto<Self, R>
    where Self: Sized, - Self::Item: Into<R>,

    Convert each item of the iterator using the Into trait. Read more
    source§

    fn map_results<F, T, U, E>(self, f: F) -> MapOk<Self, F>
    where - Self: Iterator<Item = Result<T, E>> + Sized, - F: FnMut(T) -> U,

    👎Deprecated since 0.10.0: Use .map_ok() instead
    See .map_ok().
    source§

    fn map_ok<F, T, U, E>(self, f: F) -> MapOk<Self, F>
    where + Self::Item: Into<R>,

    Convert each item of the iterator using the Into trait. Read more
    source§

    fn map_ok<F, T, U, E>(self, f: F) -> MapOk<Self, F>
    where Self: Iterator<Item = Result<T, E>> + Sized, F: FnMut(T) -> U,

    Return an iterator adaptor that applies the provided closure to every Result::Ok value. Result::Err values are -unchanged. Read more
    source§

    fn filter_ok<F, T, E>(self, f: F) -> FilterOk<Self, F> ⓘ
    where +unchanged. Read more

    source§

    fn filter_ok<F, T, E>(self, f: F) -> FilterOk<Self, F> ⓘ
    where Self: Iterator<Item = Result<T, E>> + Sized, F: FnMut(&T) -> bool,

    Return an iterator adaptor that filters every Result::Ok value with the provided closure. Result::Err values are -unchanged. Read more
    source§

    fn filter_map_ok<F, T, U, E>(self, f: F) -> FilterMapOk<Self, F> ⓘ
    where +unchanged. Read more

    source§

    fn filter_map_ok<F, T, U, E>(self, f: F) -> FilterMapOk<Self, F> ⓘ
    where Self: Iterator<Item = Result<T, E>> + Sized, F: FnMut(T) -> Option<U>,

    Return an iterator adaptor that filters and transforms every Result::Ok value with the provided closure. Result::Err -values are unchanged. Read more
    source§

    fn flatten_ok<T, E>(self) -> FlattenOk<Self, T, E> ⓘ
    where +values are unchanged. Read more

    source§

    fn flatten_ok<T, E>(self) -> FlattenOk<Self, T, E> ⓘ
    where Self: Iterator<Item = Result<T, E>> + Sized, T: IntoIterator,

    Return an iterator adaptor that flattens every Result::Ok value into -a series of Result::Ok values. Result::Err values are unchanged. Read more
    source§

    fn process_results<F, T, E, R>(self, processor: F) -> Result<R, E>
    where +a series of Result::Ok values. Result::Err values are unchanged. Read more

    source§

    fn process_results<F, T, E, R>(self, processor: F) -> Result<R, E>
    where Self: Iterator<Item = Result<T, E>> + Sized, F: FnOnce(ProcessResults<'_, Self, E>) -> R,

    “Lift” a function of the values of the current iterator so as to process -an iterator of Result values instead. Read more
    source§

    fn merge<J>(self, other: J) -> Merge<Self, J::IntoIter>
    where +an iterator of Result values instead. Read more

    source§

    fn merge<J>(self, other: J) -> Merge<Self, J::IntoIter>
    where Self: Sized, Self::Item: PartialOrd, J: IntoIterator<Item = Self::Item>,

    Return an iterator adaptor that merges the two base iterators in ascending order. If both base iterators are sorted (ascending), the -result is sorted. Read more
    source§

    fn merge_by<J, F>(self, other: J, is_first: F) -> MergeBy<Self, J::IntoIter, F> ⓘ
    where +result is sorted. Read more

    source§

    fn merge_by<J, F>(self, other: J, is_first: F) -> MergeBy<Self, J::IntoIter, F> ⓘ
    where Self: Sized, J: IntoIterator<Item = Self::Item>, F: FnMut(&Self::Item, &Self::Item) -> bool,

    Return an iterator adaptor that merges the two base iterators in order. -This is much like .merge() but allows for a custom ordering. Read more
    source§

    fn merge_join_by<J, F, T>( +This is much like .merge() but allows for a custom ordering. Read more

    source§

    fn merge_join_by<J, F, T>( self, other: J, cmp_fn: F @@ -289,284 +290,295 @@ This is much like IntoIterator, F: FnMut(&Self::Item, &J::Item) -> T, Self: Sized,

    Create an iterator that merges items from both this and the specified -iterator in ascending order. Read more
    source§

    fn kmerge(self) -> KMerge<<Self::Item as IntoIterator>::IntoIter>
    where +iterator in ascending order. Read more

    source§

    fn kmerge(self) -> KMerge<<Self::Item as IntoIterator>::IntoIter>
    where Self: Sized, Self::Item: IntoIterator, <Self::Item as IntoIterator>::Item: PartialOrd,

    Return an iterator adaptor that flattens an iterator of iterators by -merging them in ascending order. Read more
    source§

    fn kmerge_by<F>( +merging them in ascending order. Read more

    source§

    fn kmerge_by<F>( self, first: F ) -> KMergeBy<<Self::Item as IntoIterator>::IntoIter, F> ⓘ
    where Self: Sized, Self::Item: IntoIterator, F: FnMut(&<Self::Item as IntoIterator>::Item, &<Self::Item as IntoIterator>::Item) -> bool,

    Return an iterator adaptor that flattens an iterator of iterators by -merging them according to the given closure. Read more
    source§

    fn cartesian_product<J>(self, other: J) -> Product<Self, J::IntoIter> ⓘ
    where +merging them according to the given closure. Read more

    source§

    fn cartesian_product<J>(self, other: J) -> Product<Self, J::IntoIter> ⓘ
    where Self: Sized, Self::Item: Clone, J: IntoIterator, J::IntoIter: Clone,

    Return an iterator adaptor that iterates over the cartesian product of -the element sets of two iterators self and J. Read more
    source§

    fn multi_cartesian_product( +the element sets of two iterators self and J. Read more

    source§

    fn multi_cartesian_product( self ) -> MultiProduct<<Self::Item as IntoIterator>::IntoIter> ⓘ
    where Self: Sized, Self::Item: IntoIterator, <Self::Item as IntoIterator>::IntoIter: Clone, <Self::Item as IntoIterator>::Item: Clone,

    Return an iterator adaptor that iterates over the cartesian product of -all subiterators returned by meta-iterator self. Read more
    source§

    fn coalesce<F>(self, f: F) -> Coalesce<Self, F>
    where +all subiterators returned by meta-iterator self. Read more

    source§

    fn coalesce<F>(self, f: F) -> Coalesce<Self, F>
    where Self: Sized, F: FnMut(Self::Item, Self::Item) -> Result<Self::Item, (Self::Item, Self::Item)>,

    Return an iterator adaptor that uses the passed-in closure to -optionally merge together consecutive elements. Read more
    source§

    fn dedup(self) -> Dedup<Self>
    where +optionally merge together consecutive elements. Read more

    source§

    fn dedup(self) -> Dedup<Self>
    where Self: Sized, Self::Item: PartialEq,

    Remove duplicates from sections of consecutive identical elements. -If the iterator is sorted, all elements will be unique. Read more
    source§

    fn dedup_by<Cmp>(self, cmp: Cmp) -> DedupBy<Self, Cmp>
    where +If the iterator is sorted, all elements will be unique. Read more

    source§

    fn dedup_by<Cmp>(self, cmp: Cmp) -> DedupBy<Self, Cmp>
    where Self: Sized, Cmp: FnMut(&Self::Item, &Self::Item) -> bool,

    Remove duplicates from sections of consecutive identical elements, determining equality using a comparison function. -If the iterator is sorted, all elements will be unique. Read more
    source§

    fn dedup_with_count(self) -> DedupWithCount<Self>
    where +If the iterator is sorted, all elements will be unique. Read more

    source§

    fn dedup_with_count(self) -> DedupWithCount<Self>
    where Self: Sized,

    Remove duplicates from sections of consecutive identical elements, while keeping a count of how many repeated elements were present. -If the iterator is sorted, all elements will be unique. Read more
    source§

    fn dedup_by_with_count<Cmp>(self, cmp: Cmp) -> DedupByWithCount<Self, Cmp>
    where +If the iterator is sorted, all elements will be unique. Read more

    source§

    fn dedup_by_with_count<Cmp>(self, cmp: Cmp) -> DedupByWithCount<Self, Cmp>
    where Self: Sized, Cmp: FnMut(&Self::Item, &Self::Item) -> bool,

    Remove duplicates from sections of consecutive identical elements, while keeping a count of how many repeated elements were present. This will determine equality using a comparison function. -If the iterator is sorted, all elements will be unique. Read more
    source§

    fn duplicates(self) -> Duplicates<Self>
    where +If the iterator is sorted, all elements will be unique. Read more

    source§

    fn duplicates(self) -> Duplicates<Self>
    where Self: Sized, Self::Item: Eq + Hash,

    Return an iterator adaptor that produces elements that appear more than once during the -iteration. Duplicates are detected using hash and equality. Read more
    source§

    fn duplicates_by<V, F>(self, f: F) -> DuplicatesBy<Self, V, F>
    where +iteration. Duplicates are detected using hash and equality. Read more

    source§

    fn duplicates_by<V, F>(self, f: F) -> DuplicatesBy<Self, V, F>
    where Self: Sized, V: Eq + Hash, F: FnMut(&Self::Item) -> V,

    Return an iterator adaptor that produces elements that appear more than once during the -iteration. Duplicates are detected using hash and equality. Read more
    source§

    fn unique(self) -> Unique<Self> ⓘ
    where +iteration. Duplicates are detected using hash and equality. Read more

    source§

    fn unique(self) -> Unique<Self> ⓘ
    where Self: Sized, Self::Item: Clone + Eq + Hash,

    Return an iterator adaptor that filters out elements that have already been produced once during the iteration. Duplicates -are detected using hash and equality. Read more
    source§

    fn unique_by<V, F>(self, f: F) -> UniqueBy<Self, V, F> ⓘ
    where +are detected using hash and equality. Read more

    source§

    fn unique_by<V, F>(self, f: F) -> UniqueBy<Self, V, F> ⓘ
    where Self: Sized, V: Eq + Hash, F: FnMut(&Self::Item) -> V,

    Return an iterator adaptor that filters out elements that have -already been produced once during the iteration. Read more
    source§

    fn peeking_take_while<F>(&mut self, accept: F) -> PeekingTakeWhile<'_, Self, F> ⓘ
    where +already been produced once during the iteration. Read more

    source§

    fn peeking_take_while<F>(&mut self, accept: F) -> PeekingTakeWhile<'_, Self, F> ⓘ
    where Self: Sized + PeekingNext, F: FnMut(&Self::Item) -> bool,

    Return an iterator adaptor that borrows from this iterator and -takes items while the closure accept returns true. Read more
    source§

    fn take_while_ref<F>(&mut self, accept: F) -> TakeWhileRef<'_, Self, F> ⓘ
    where +takes items while the closure accept returns true. Read more

    source§

    fn take_while_ref<F>(&mut self, accept: F) -> TakeWhileRef<'_, Self, F> ⓘ
    where Self: Clone, F: FnMut(&Self::Item) -> bool,

    Return an iterator adaptor that borrows from a Clone-able iterator -to only pick off elements while the predicate accept returns true. Read more
    source§

    fn take_while_inclusive<F>(self, accept: F) -> TakeWhileInclusive<Self, F> ⓘ
    where +to only pick off elements while the predicate accept returns true. Read more

    source§

    fn take_while_inclusive<F>(self, accept: F) -> TakeWhileInclusive<Self, F> ⓘ
    where Self: Sized, F: FnMut(&Self::Item) -> bool,

    Returns an iterator adaptor that consumes elements while the given predicate is true, including the element for which the predicate -first returned false. Read more
    source§

    fn while_some<A>(self) -> WhileSome<Self> ⓘ
    where +first returned false. Read more

    source§

    fn while_some<A>(self) -> WhileSome<Self> ⓘ
    where Self: Sized + Iterator<Item = Option<A>>,

    Return an iterator adaptor that filters Option<A> iterator elements -and produces A. Stops on the first None encountered. Read more
    source§

    fn tuple_combinations<T>(self) -> TupleCombinations<Self, T> ⓘ
    where +and produces A. Stops on the first None encountered. Read more

    source§

    fn tuple_combinations<T>(self) -> TupleCombinations<Self, T> ⓘ
    where Self: Sized + Clone, Self::Item: Clone, T: HasCombination<Self>,

    Return an iterator adaptor that iterates over the combinations of the -elements from an iterator. Read more
    source§

    fn combinations(self, k: usize) -> Combinations<Self> ⓘ
    where +elements from an iterator. Read more

    source§

    fn combinations(self, k: usize) -> Combinations<Self> ⓘ
    where Self: Sized, Self::Item: Clone,

    Return an iterator adaptor that iterates over the k-length combinations of -the elements from an iterator. Read more
    source§

    fn combinations_with_replacement( +the elements from an iterator. Read more

    source§

    fn combinations_with_replacement( self, k: usize ) -> CombinationsWithReplacement<Self> ⓘ
    where Self: Sized, Self::Item: Clone,

    Return an iterator that iterates over the k-length combinations of -the elements from an iterator, with replacement. Read more
    source§

    fn permutations(self, k: usize) -> Permutations<Self> ⓘ
    where +the elements from an iterator, with replacement. Read more

    source§

    fn permutations(self, k: usize) -> Permutations<Self> ⓘ
    where Self: Sized, Self::Item: Clone,

    Return an iterator adaptor that iterates over all k-permutations of the -elements from an iterator. Read more
    source§

    fn powerset(self) -> Powerset<Self> ⓘ
    where +elements from an iterator. Read more

    source§

    fn powerset(self) -> Powerset<Self> ⓘ
    where Self: Sized, Self::Item: Clone,

    Return an iterator that iterates through the powerset of the elements from an -iterator. Read more
    source§

    fn pad_using<F>(self, min: usize, f: F) -> PadUsing<Self, F> ⓘ
    where +iterator. Read more

    source§

    fn pad_using<F>(self, min: usize, f: F) -> PadUsing<Self, F> ⓘ
    where Self: Sized, F: FnMut(usize) -> Self::Item,

    Return an iterator adaptor that pads the sequence to a minimum length of -min by filling missing elements using a closure f. Read more
    source§

    fn with_position(self) -> WithPosition<Self> ⓘ
    where +min by filling missing elements using a closure f. Read more

    source§

    fn with_position(self) -> WithPosition<Self> ⓘ
    where Self: Sized,

    Return an iterator adaptor that combines each element with a Position to -ease special-case handling of the first or last elements. Read more
    source§

    fn positions<P>(self, predicate: P) -> Positions<Self, P> ⓘ
    where +ease special-case handling of the first or last elements. Read more

    source§

    fn positions<P>(self, predicate: P) -> Positions<Self, P> ⓘ
    where Self: Sized, P: FnMut(Self::Item) -> bool,

    Return an iterator adaptor that yields the indices of all elements -satisfying a predicate, counted from the start of the iterator. Read more
    source§

    fn update<F>(self, updater: F) -> Update<Self, F> ⓘ
    where +satisfying a predicate, counted from the start of the iterator. Read more

    source§

    fn update<F>(self, updater: F) -> Update<Self, F> ⓘ
    where Self: Sized, F: FnMut(&mut Self::Item),

    Return an iterator adaptor that applies a mutating function -to each element before yielding it. Read more
    source§

    fn next_tuple<T>(&mut self) -> Option<T>
    where +to each element before yielding it. Read more

    source§

    fn next_tuple<T>(&mut self) -> Option<T>
    where Self: Sized + Iterator<Item = T::Item>, T: HomogeneousTuple,

    Advances the iterator and returns the next items grouped in a tuple of -a specific size (up to 12). Read more
    source§

    fn collect_tuple<T>(self) -> Option<T>
    where +a specific size (up to 12). Read more

    source§

    fn collect_tuple<T>(self) -> Option<T>
    where Self: Sized + Iterator<Item = T::Item>, T: HomogeneousTuple,

    Collects all items from the iterator into a tuple of a specific size -(up to 12). Read more
    source§

    fn find_position<P>(&mut self, pred: P) -> Option<(usize, Self::Item)>
    where - P: FnMut(&Self::Item) -> bool,

    Find the position and value of the first element satisfying a predicate. Read more
    source§

    fn find_or_last<P>(self, predicate: P) -> Option<Self::Item>
    where +(up to 12). Read more

    source§

    fn find_position<P>(&mut self, pred: P) -> Option<(usize, Self::Item)>
    where + P: FnMut(&Self::Item) -> bool,

    Find the position and value of the first element satisfying a predicate. Read more
    source§

    fn find_or_last<P>(self, predicate: P) -> Option<Self::Item>
    where Self: Sized, - P: FnMut(&Self::Item) -> bool,

    Find the value of the first element satisfying a predicate or return the last element, if any. Read more
    source§

    fn find_or_first<P>(self, predicate: P) -> Option<Self::Item>
    where + P: FnMut(&Self::Item) -> bool,

    Find the value of the first element satisfying a predicate or return the last element, if any. Read more
    source§

    fn find_or_first<P>(self, predicate: P) -> Option<Self::Item>
    where Self: Sized, - P: FnMut(&Self::Item) -> bool,

    Find the value of the first element satisfying a predicate or return the first element, if any. Read more
    source§

    fn contains<Q>(&mut self, query: &Q) -> bool
    where + P: FnMut(&Self::Item) -> bool,

    Find the value of the first element satisfying a predicate or return the first element, if any. Read more
    source§

    fn contains<Q>(&mut self, query: &Q) -> bool
    where Self: Sized, Self::Item: Borrow<Q>, - Q: PartialEq,

    Returns true if the given item is present in this iterator. Read more
    source§

    fn all_equal(&mut self) -> bool
    where + Q: PartialEq,

    Returns true if the given item is present in this iterator. Read more
    source§

    fn all_equal(&mut self) -> bool
    where Self: Sized, - Self::Item: PartialEq,

    Check whether all elements compare equal. Read more
    source§

    fn all_equal_value( + Self::Item: PartialEq,

    Check whether all elements compare equal. Read more
    source§

    fn all_equal_value( &mut self ) -> Result<Self::Item, Option<(Self::Item, Self::Item)>>
    where Self: Sized, Self::Item: PartialEq,

    If there are elements and they are all equal, return a single copy of that element. If there are no elements, return an Error containing None. If there are elements and they are not all equal, return a tuple containing the first -two non-equal elements found. Read more
    source§

    fn all_unique(&mut self) -> bool
    where +two non-equal elements found. Read more

    source§

    fn all_unique(&mut self) -> bool
    where Self: Sized, - Self::Item: Eq + Hash,

    Check whether all elements are unique (non equal). Read more
    source§

    fn dropping(self, n: usize) -> Self
    where + Self::Item: Eq + Hash,

    Check whether all elements are unique (non equal). Read more
    source§

    fn dropping(self, n: usize) -> Self
    where Self: Sized,

    Consume the first n elements from the iterator eagerly, -and return the same iterator again. Read more
    source§

    fn dropping_back(self, n: usize) -> Self
    where +and return the same iterator again. Read more

    source§

    fn dropping_back(self, n: usize) -> Self
    where Self: Sized + DoubleEndedIterator,

    Consume the last n elements from the iterator eagerly, -and return the same iterator again. Read more
    source§

    fn foreach<F>(self, f: F)
    where - F: FnMut(Self::Item), - Self: Sized,

    👎Deprecated since 0.8.0: Use .for_each() instead
    Run the closure f eagerly on each element of the iterator. Read more
    source§

    fn concat(self) -> Self::Item
    where +and return the same iterator again. Read more

    source§

    fn concat(self) -> Self::Item
    where Self: Sized, - Self::Item: Extend<<<Self as Iterator>::Item as IntoIterator>::Item> + IntoIterator + Default,

    Combine all an iterator’s elements into one element by using Extend. Read more
    source§

    fn collect_vec(self) -> Vec<Self::Item>
    where + Self::Item: Extend<<<Self as Iterator>::Item as IntoIterator>::Item> + IntoIterator + Default,

    Combine all an iterator’s elements into one element by using Extend. Read more
    source§

    fn collect_vec(self) -> Vec<Self::Item>
    where Self: Sized,

    .collect_vec() is simply a type specialization of Iterator::collect, -for convenience.
    source§

    fn try_collect<T, U, E>(self) -> Result<U, E>
    where +for convenience.

    source§

    fn try_collect<T, U, E>(self) -> Result<U, E>
    where Self: Sized + Iterator<Item = Result<T, E>>, Result<U, E>: FromIterator<Result<T, E>>,

    .try_collect() is more convenient way of writing -.collect::<Result<_, _>>() Read more
    source§

    fn set_from<'a, A: 'a, J>(&mut self, from: J) -> usize
    where +.collect::<Result<_, _>>() Read more

    source§

    fn set_from<'a, A: 'a, J>(&mut self, from: J) -> usize
    where Self: Iterator<Item = &'a mut A>, J: IntoIterator<Item = A>,

    Assign to each reference in self from the from iterator, -stopping at the shortest of the two iterators. Read more
    source§

    fn join(&mut self, sep: &str) -> String
    where - Self::Item: Display,

    Combine all iterator elements into one String, separated by sep. Read more
    source§

    fn format(self, sep: &str) -> Format<'_, Self>
    where - Self: Sized,

    Format all iterator elements, separated by sep. Read more
    source§

    fn format_with<F>(self, sep: &str, format: F) -> FormatWith<'_, Self, F>
    where +stopping at the shortest of the two iterators. Read more

    source§

    fn join(&mut self, sep: &str) -> String
    where + Self::Item: Display,

    Combine all iterator elements into one String, separated by sep. Read more
    source§

    fn format(self, sep: &str) -> Format<'_, Self>
    where + Self: Sized,

    Format all iterator elements, separated by sep. Read more
    source§

    fn format_with<F>(self, sep: &str, format: F) -> FormatWith<'_, Self, F>
    where Self: Sized, - F: FnMut(Self::Item, &mut dyn FnMut(&dyn Display) -> Result) -> Result,

    Format all iterator elements, separated by sep. Read more
    source§

    fn fold_results<A, E, B, F>(&mut self, start: B, f: F) -> Result<B, E>
    where + F: FnMut(Self::Item, &mut dyn FnMut(&dyn Display) -> Result) -> Result,

    Format all iterator elements, separated by sep. Read more
    source§

    fn fold_ok<A, E, B, F>(&mut self, start: B, f: F) -> Result<B, E>
    where Self: Iterator<Item = Result<A, E>>, - F: FnMut(B, A) -> B,

    👎Deprecated since 0.10.0: Use .fold_ok() instead
    See .fold_ok().
    source§

    fn fold_ok<A, E, B, F>(&mut self, start: B, f: F) -> Result<B, E>
    where - Self: Iterator<Item = Result<A, E>>, - F: FnMut(B, A) -> B,

    Fold Result values from an iterator. Read more
    source§

    fn fold_options<A, B, F>(&mut self, start: B, f: F) -> Option<B>
    where + F: FnMut(B, A) -> B,

    Fold Result values from an iterator. Read more
    source§

    fn fold_options<A, B, F>(&mut self, start: B, f: F) -> Option<B>
    where Self: Iterator<Item = Option<A>>, - F: FnMut(B, A) -> B,

    Fold Option values from an iterator. Read more
    source§

    fn fold1<F>(self, f: F) -> Option<Self::Item>
    where + F: FnMut(B, A) -> B,

    Fold Option values from an iterator. Read more
    source§

    fn fold1<F>(self, f: F) -> Option<Self::Item>
    where F: FnMut(Self::Item, Self::Item) -> Self::Item, - Self: Sized,

    👎Deprecated since 0.10.2: Use Iterator::reduce instead
    Accumulator of the elements in the iterator. Read more
    source§

    fn tree_fold1<F>(self, f: F) -> Option<Self::Item>
    where + Self: Sized,

    👎Deprecated since 0.10.2: Use Iterator::reduce instead
    Accumulator of the elements in the iterator. Read more
    source§

    fn tree_reduce<F>(self, f: F) -> Option<Self::Item>
    where F: FnMut(Self::Item, Self::Item) -> Self::Item, - Self: Sized,

    Accumulate the elements in the iterator in a tree-like manner. Read more
    source§

    fn fold_while<B, F>(&mut self, init: B, f: F) -> FoldWhile<B>
    where + Self: Sized,

    Accumulate the elements in the iterator in a tree-like manner. Read more
    source§

    fn tree_fold1<F>(self, f: F) -> Option<Self::Item>
    where + F: FnMut(Self::Item, Self::Item) -> Self::Item, + Self: Sized,

    👎Deprecated since 0.13.0: Use .tree_reduce() instead
    See .tree_reduce().
    source§

    fn fold_while<B, F>(&mut self, init: B, f: F) -> FoldWhile<B>
    where Self: Sized, - F: FnMut(B, Self::Item) -> FoldWhile<B>,

    An iterator method that applies a function, producing a single, final value. Read more
    source§

    fn sum1<S>(self) -> Option<S>
    where + F: FnMut(B, Self::Item) -> FoldWhile<B>,

    An iterator method that applies a function, producing a single, final value. Read more
    source§

    fn sum1<S>(self) -> Option<S>
    where Self: Sized, - S: Sum<Self::Item>,

    Iterate over the entire iterator and add all the elements. Read more
    source§

    fn product1<P>(self) -> Option<P>
    where + S: Sum<Self::Item>,

    Iterate over the entire iterator and add all the elements. Read more
    source§

    fn product1<P>(self) -> Option<P>
    where Self: Sized, - P: Product<Self::Item>,

    Iterate over the entire iterator and multiply all the elements. Read more
    source§

    fn sorted_unstable(self) -> IntoIter<Self::Item> ⓘ
    where + P: Product<Self::Item>,

    Iterate over the entire iterator and multiply all the elements. Read more
    source§

    fn sorted_unstable(self) -> IntoIter<Self::Item> ⓘ
    where Self: Sized, - Self::Item: Ord,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_unstable_by<F>(self, cmp: F) -> IntoIter<Self::Item> ⓘ
    where + Self::Item: Ord,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_unstable_by<F>(self, cmp: F) -> IntoIter<Self::Item> ⓘ
    where Self: Sized, - F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_unstable_by_key<K, F>(self, f: F) -> IntoIter<Self::Item> ⓘ
    where + F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_unstable_by_key<K, F>(self, f: F) -> IntoIter<Self::Item> ⓘ
    where Self: Sized, K: Ord, - F: FnMut(&Self::Item) -> K,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted(self) -> IntoIter<Self::Item> ⓘ
    where + F: FnMut(&Self::Item) -> K,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted(self) -> IntoIter<Self::Item> ⓘ
    where Self: Sized, - Self::Item: Ord,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_by<F>(self, cmp: F) -> IntoIter<Self::Item> ⓘ
    where + Self::Item: Ord,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_by<F>(self, cmp: F) -> IntoIter<Self::Item> ⓘ
    where Self: Sized, - F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_by_key<K, F>(self, f: F) -> IntoIter<Self::Item> ⓘ
    where + F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_by_key<K, F>(self, f: F) -> IntoIter<Self::Item> ⓘ
    where Self: Sized, K: Ord, - F: FnMut(&Self::Item) -> K,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_by_cached_key<K, F>(self, f: F) -> IntoIter<Self::Item> ⓘ
    where + F: FnMut(&Self::Item) -> K,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_by_cached_key<K, F>(self, f: F) -> IntoIter<Self::Item> ⓘ
    where Self: Sized, K: Ord, F: FnMut(&Self::Item) -> K,

    Sort all iterator elements into a new iterator in ascending order. The key function is -called exactly once per key. Read more
    source§

    fn k_smallest(self, k: usize) -> IntoIter<Self::Item> ⓘ
    where +called exactly once per key. Read more

    source§

    fn k_smallest(self, k: usize) -> IntoIter<Self::Item> ⓘ
    where Self: Sized, - Self::Item: Ord,

    Sort the k smallest elements into a new iterator, in ascending order. Read more
    source§

    fn partition_map<A, B, F, L, R>(self, predicate: F) -> (A, B)
    where + Self::Item: Ord,

    Sort the k smallest elements into a new iterator, in ascending order. Read more
    source§

    fn k_smallest_by<F>(self, k: usize, cmp: F) -> IntoIter<Self::Item> ⓘ
    where + Self: Sized, + F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Sort the k smallest elements into a new iterator using the provided comparison. Read more
    source§

    fn k_smallest_by_key<F, K>(self, k: usize, key: F) -> IntoIter<Self::Item> ⓘ
    where + Self: Sized, + F: FnMut(&Self::Item) -> K, + K: Ord,

    Return the elements producing the k smallest outputs of the provided function. Read more
    source§

    fn k_largest(self, k: usize) -> IntoIter<Self::Item> ⓘ
    where + Self: Sized, + Self::Item: Ord,

    Sort the k largest elements into a new iterator, in descending order. Read more
    source§

    fn k_largest_by<F>(self, k: usize, cmp: F) -> IntoIter<Self::Item> ⓘ
    where + Self: Sized, + F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Sort the k largest elements into a new iterator using the provided comparison. Read more
    source§

    fn k_largest_by_key<F, K>(self, k: usize, key: F) -> IntoIter<Self::Item> ⓘ
    where + Self: Sized, + F: FnMut(&Self::Item) -> K, + K: Ord,

    Return the elements producing the k largest outputs of the provided function. Read more
    source§

    fn tail(self, n: usize) -> IntoIter<Self::Item> ⓘ
    where + Self: Sized,

    Consumes the iterator and return an iterator of the last n elements. Read more
    source§

    fn partition_map<A, B, F, L, R>(self, predicate: F) -> (A, B)
    where Self: Sized, F: FnMut(Self::Item) -> Either<L, R>, A: Default + Extend<L>, B: Default + Extend<R>,

    Collect all iterator elements into one of two partitions. Unlike Iterator::partition, each partition may -have a distinct type. Read more
    source§

    fn partition_result<A, B, T, E>(self) -> (A, B)
    where +have a distinct type. Read more

    source§

    fn partition_result<A, B, T, E>(self) -> (A, B)
    where Self: Iterator<Item = Result<T, E>> + Sized, A: Default + Extend<T>, B: Default + Extend<E>,

    Partition a sequence of Results into one list of all the Ok elements -and another list of all the Err elements. Read more
    source§

    fn into_group_map<K, V>(self) -> HashMap<K, Vec<V>>
    where +and another list of all the Err elements. Read more

    source§

    fn into_group_map<K, V>(self) -> HashMap<K, Vec<V>>
    where Self: Iterator<Item = (K, V)> + Sized, K: Hash + Eq,

    Return a HashMap of keys mapped to Vecs of values. Keys and values -are taken from (Key, Value) tuple pairs yielded by the input iterator. Read more
    source§

    fn into_group_map_by<K, V, F>(self, f: F) -> HashMap<K, Vec<V>>
    where +are taken from (Key, Value) tuple pairs yielded by the input iterator. Read more

    source§

    fn into_group_map_by<K, V, F>(self, f: F) -> HashMap<K, Vec<V>>
    where Self: Iterator<Item = V> + Sized, K: Hash + Eq, - F: Fn(&V) -> K,

    Return an Iterator on a HashMap. Keys mapped to Vecs of values. The key is specified -in the closure. Read more
    source§

    fn into_grouping_map<K, V>(self) -> GroupingMap<Self>
    where + F: FnMut(&V) -> K,

    Return an Iterator on a HashMap. Keys mapped to Vecs of values. The key is specified +in the closure. Read more
    source§

    fn into_grouping_map<K, V>(self) -> GroupingMap<Self>
    where Self: Iterator<Item = (K, V)> + Sized, K: Hash + Eq,

    Constructs a GroupingMap to be used later with one of the efficient -group-and-fold operations it allows to perform. Read more
    source§

    fn into_grouping_map_by<K, V, F>(self, key_mapper: F) -> GroupingMapBy<Self, F>
    where +group-and-fold operations it allows to perform. Read more

    source§

    fn into_grouping_map_by<K, V, F>(self, key_mapper: F) -> GroupingMapBy<Self, F>
    where Self: Iterator<Item = V> + Sized, K: Hash + Eq, F: FnMut(&V) -> K,

    Constructs a GroupingMap to be used later with one of the efficient -group-and-fold operations it allows to perform. Read more
    source§

    fn min_set(self) -> Vec<Self::Item>
    where +group-and-fold operations it allows to perform. Read more

    source§

    fn min_set(self) -> Vec<Self::Item>
    where Self: Sized, - Self::Item: Ord,

    Return all minimum elements of an iterator. Read more
    source§

    fn min_set_by<F>(self, compare: F) -> Vec<Self::Item>
    where + Self::Item: Ord,

    Return all minimum elements of an iterator. Read more
    source§

    fn min_set_by<F>(self, compare: F) -> Vec<Self::Item>
    where Self: Sized, F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Return all minimum elements of an iterator, as determined by -the specified function. Read more
    source§

    fn min_set_by_key<K, F>(self, key: F) -> Vec<Self::Item>
    where +the specified function. Read more

    source§

    fn min_set_by_key<K, F>(self, key: F) -> Vec<Self::Item>
    where Self: Sized, K: Ord, F: FnMut(&Self::Item) -> K,

    Return all minimum elements of an iterator, as determined by -the specified function. Read more
    source§

    fn max_set(self) -> Vec<Self::Item>
    where +the specified function. Read more

    source§

    fn max_set(self) -> Vec<Self::Item>
    where Self: Sized, - Self::Item: Ord,

    Return all maximum elements of an iterator. Read more
    source§

    fn max_set_by<F>(self, compare: F) -> Vec<Self::Item>
    where + Self::Item: Ord,

    Return all maximum elements of an iterator. Read more
    source§

    fn max_set_by<F>(self, compare: F) -> Vec<Self::Item>
    where Self: Sized, F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Return all maximum elements of an iterator, as determined by -the specified function. Read more
    source§

    fn max_set_by_key<K, F>(self, key: F) -> Vec<Self::Item>
    where +the specified function. Read more

    source§

    fn max_set_by_key<K, F>(self, key: F) -> Vec<Self::Item>
    where Self: Sized, K: Ord, F: FnMut(&Self::Item) -> K,

    Return all maximum elements of an iterator, as determined by -the specified function. Read more
    source§

    fn minmax(self) -> MinMaxResult<Self::Item>
    where +the specified function. Read more

    source§

    fn minmax(self) -> MinMaxResult<Self::Item>
    where Self: Sized, - Self::Item: PartialOrd,

    Return the minimum and maximum elements in the iterator. Read more
    source§

    fn minmax_by_key<K, F>(self, key: F) -> MinMaxResult<Self::Item>
    where + Self::Item: PartialOrd,

    Return the minimum and maximum elements in the iterator. Read more
    source§

    fn minmax_by_key<K, F>(self, key: F) -> MinMaxResult<Self::Item>
    where Self: Sized, K: PartialOrd, F: FnMut(&Self::Item) -> K,

    Return the minimum and maximum element of an iterator, as determined by -the specified function. Read more
    source§

    fn minmax_by<F>(self, compare: F) -> MinMaxResult<Self::Item>
    where +the specified function. Read more

    source§

    fn minmax_by<F>(self, compare: F) -> MinMaxResult<Self::Item>
    where Self: Sized, F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Return the minimum and maximum element of an iterator, as determined by -the specified comparison function. Read more
    source§

    fn position_max(self) -> Option<usize>
    where +the specified comparison function. Read more

    source§

    fn position_max(self) -> Option<usize>
    where Self: Sized, - Self::Item: Ord,

    Return the position of the maximum element in the iterator. Read more
    source§

    fn position_max_by_key<K, F>(self, key: F) -> Option<usize>
    where + Self::Item: Ord,

    Return the position of the maximum element in the iterator. Read more
    source§

    fn position_max_by_key<K, F>(self, key: F) -> Option<usize>
    where Self: Sized, K: Ord, F: FnMut(&Self::Item) -> K,

    Return the position of the maximum element in the iterator, as -determined by the specified function. Read more
    source§

    fn position_max_by<F>(self, compare: F) -> Option<usize>
    where +determined by the specified function. Read more

    source§

    fn position_max_by<F>(self, compare: F) -> Option<usize>
    where Self: Sized, F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Return the position of the maximum element in the iterator, as -determined by the specified comparison function. Read more
    source§

    fn position_min(self) -> Option<usize>
    where +determined by the specified comparison function. Read more

    source§

    fn position_min(self) -> Option<usize>
    where Self: Sized, - Self::Item: Ord,

    Return the position of the minimum element in the iterator. Read more
    source§

    fn position_min_by_key<K, F>(self, key: F) -> Option<usize>
    where + Self::Item: Ord,

    Return the position of the minimum element in the iterator. Read more
    source§

    fn position_min_by_key<K, F>(self, key: F) -> Option<usize>
    where Self: Sized, K: Ord, F: FnMut(&Self::Item) -> K,

    Return the position of the minimum element in the iterator, as -determined by the specified function. Read more
    source§

    fn position_min_by<F>(self, compare: F) -> Option<usize>
    where +determined by the specified function. Read more

    source§

    fn position_min_by<F>(self, compare: F) -> Option<usize>
    where Self: Sized, F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Return the position of the minimum element in the iterator, as -determined by the specified comparison function. Read more
    source§

    fn position_minmax(self) -> MinMaxResult<usize>
    where +determined by the specified comparison function. Read more

    source§

    fn position_minmax(self) -> MinMaxResult<usize>
    where Self: Sized, Self::Item: PartialOrd,

    Return the positions of the minimum and maximum elements in -the iterator. Read more
    source§

    fn position_minmax_by_key<K, F>(self, key: F) -> MinMaxResult<usize>
    where +the iterator. Read more

    source§

    fn position_minmax_by_key<K, F>(self, key: F) -> MinMaxResult<usize>
    where Self: Sized, K: PartialOrd, F: FnMut(&Self::Item) -> K,

    Return the postions of the minimum and maximum elements of an -iterator, as determined by the specified function. Read more
    source§

    fn position_minmax_by<F>(self, compare: F) -> MinMaxResult<usize>
    where +iterator, as determined by the specified function. Read more

    source§

    fn position_minmax_by<F>(self, compare: F) -> MinMaxResult<usize>
    where Self: Sized, F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Return the postions of the minimum and maximum elements of an -iterator, as determined by the specified comparison function. Read more
    source§

    fn exactly_one(self) -> Result<Self::Item, ExactlyOneError<Self>>
    where +iterator, as determined by the specified comparison function. Read more

    source§

    fn exactly_one(self) -> Result<Self::Item, ExactlyOneError<Self>>
    where Self: Sized,

    If the iterator yields exactly one element, that element will be returned, otherwise an error will be returned containing an iterator that has the same output as the input -iterator. Read more
    source§

    fn at_most_one(self) -> Result<Option<Self::Item>, ExactlyOneError<Self>>
    where - Self: Sized,

    If the iterator yields no elements, Ok(None) will be returned. If the iterator yields +iterator. Read more
    source§

    fn at_most_one(self) -> Result<Option<Self::Item>, ExactlyOneError<Self>>
    where + Self: Sized,

    If the iterator yields no elements, Ok(None) will be returned. If the iterator yields exactly one element, that element will be returned, otherwise an error will be returned -containing an iterator that has the same output as the input iterator. Read more
    source§

    fn multipeek(self) -> MultiPeek<Self> ⓘ
    where +containing an iterator that has the same output as the input iterator. Read more

    source§

    fn multipeek(self) -> MultiPeek<Self> ⓘ
    where Self: Sized,

    An iterator adaptor that allows the user to peek at multiple .next() -values without advancing the base iterator. Read more
    source§

    fn counts(self) -> HashMap<Self::Item, usize>
    where +values without advancing the base iterator. Read more

    source§

    fn counts(self) -> HashMap<Self::Item, usize>
    where Self: Sized, Self::Item: Eq + Hash,

    Collect the items in this iterator and return a HashMap which contains each item that appears in the iterator and the number -of times it appears. Read more
    source§

    fn counts_by<K, F>(self, f: F) -> HashMap<K, usize>
    where +of times it appears. Read more

    source§

    fn counts_by<K, F>(self, f: F) -> HashMap<K, usize>
    where Self: Sized, K: Eq + Hash, F: FnMut(Self::Item) -> K,

    Collect the items in this iterator and return a HashMap which contains each item that appears in the iterator and the number of times it appears, -determining identity using a keying function. Read more
    source§

    fn multiunzip<FromI>(self) -> FromI
    where - Self: Sized + MultiUnzip<FromI>,

    Converts an iterator of tuples into a tuple of containers. Read more
    source§

    fn try_len(&self) -> Result<usize, (usize, Option<usize>)>

    Returns the length of the iterator if one exists. +determining identity using a keying function. Read more
    source§

    fn multiunzip<FromI>(self) -> FromI
    where + Self: Sized + MultiUnzip<FromI>,

    Converts an iterator of tuples into a tuple of containers. Read more
    source§

    fn try_len(&self) -> Result<usize, (usize, Option<usize>)>

    Returns the length of the iterator if one exists. Otherwise return self.size_hint(). Read more
    source§

    impl<IT> MultiUnzip<()> for IT
    where IT: Iterator<Item = ()>,

    source§

    fn multiunzip(self)

    Unzip this iterator into multiple collections.
    source§

    impl<IT, A, FromA> MultiUnzip<(FromA,)> for IT
    where IT: Iterator<Item = (A,)>, @@ -669,4 +681,4 @@ Otherwise return self.size_hint(). (FromA, FromB, FromC, FromD, FromE, FromF, FromG, FromH, FromI, FromJ, FromK, FromL)

    Unzip this iterator into multiple collections.
    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 + 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/itertools/structs/struct.WithPosition.html b/itertools/structs/struct.WithPosition.html index 5143f719c..fdb5a1bb4 100644 --- a/itertools/structs/struct.WithPosition.html +++ b/itertools/structs/struct.WithPosition.html @@ -1,4 +1,4 @@ -WithPosition in itertools::structs - Rust
    +WithPosition in itertools::structs - Rust

    Struct itertools::structs::WithPosition

    source · 
    pub struct WithPosition<I>
    where
     I: Iterator,
    { /* private fields */ }
    Expand description

    An iterator adaptor that wraps each element in an Position.

    Iterator element type is (Position, I::Item).

    @@ -212,86 +212,87 @@ otherwise. Right variant of Either<Self, Self> otherwise. Read more
    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> Itertools for T
    where - T: Iterator + ?Sized,

    source§

    fn interleave<J>(self, other: J) -> Interleave<Self, J::IntoIter> ⓘ
    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> Itertools for T
    where + T: Iterator + ?Sized,

    source§

    fn interleave<J>(self, other: J) -> Interleave<Self, J::IntoIter> ⓘ
    where J: IntoIterator<Item = Self::Item>, - Self: Sized,

    Alternate elements from two iterators until both have run out. Read more
    source§

    fn interleave_shortest<J>( + Self: Sized,

    Alternate elements from two iterators until both have run out. Read more
    source§

    fn interleave_shortest<J>( self, other: J ) -> InterleaveShortest<Self, J::IntoIter> ⓘ
    where J: IntoIterator<Item = Self::Item>, Self: Sized,

    Alternate elements from two iterators until at least one of them has run -out. Read more
    source§

    fn intersperse(self, element: Self::Item) -> Intersperse<Self>
    where +out. Read more

    source§

    fn intersperse(self, element: Self::Item) -> Intersperse<Self>
    where Self: Sized, Self::Item: Clone,

    An iterator adaptor to insert a particular value -between each element of the adapted iterator. Read more
    source§

    fn intersperse_with<F>(self, element: F) -> IntersperseWith<Self, F> ⓘ
    where +between each element of the adapted iterator. Read more

    source§

    fn intersperse_with<F>(self, element: F) -> IntersperseWith<Self, F> ⓘ
    where Self: Sized, F: FnMut() -> Self::Item,

    An iterator adaptor to insert a particular value created by a function -between each element of the adapted iterator. Read more
    source§

    fn zip_longest<J>(self, other: J) -> ZipLongest<Self, J::IntoIter> ⓘ
    where +between each element of the adapted iterator. Read more

    source§

    fn get<R>(self, index: R) -> R::Output
    where + Self: Sized, + R: IteratorIndex<Self>,

    Returns an iterator over a subsection of the iterator. Read more
    source§

    fn zip_longest<J>(self, other: J) -> ZipLongest<Self, J::IntoIter> ⓘ
    where J: IntoIterator, Self: Sized,

    Create an iterator which iterates over both this and the specified -iterator simultaneously, yielding pairs of two optional elements. Read more
    source§

    fn zip_eq<J>(self, other: J) -> ZipEq<Self, J::IntoIter> ⓘ
    where +iterator simultaneously, yielding pairs of two optional elements. Read more

    source§

    fn zip_eq<J>(self, other: J) -> ZipEq<Self, J::IntoIter> ⓘ
    where J: IntoIterator, Self: Sized,

    Create an iterator which iterates over both this and the specified -iterator simultaneously, yielding pairs of elements. Read more
    source§

    fn batching<B, F>(self, f: F) -> Batching<Self, F> ⓘ
    where +iterator simultaneously, yielding pairs of elements. Read more

    source§

    fn batching<B, F>(self, f: F) -> Batching<Self, F> ⓘ
    where F: FnMut(&mut Self) -> Option<B>, Self: Sized,

    A “meta iterator adaptor”. Its closure receives a reference to the iterator and may pick off as many elements as it likes, to produce the -next iterator element. Read more
    source§

    fn group_by<K, F>(self, key: F) -> GroupBy<K, Self, F>
    where +next iterator element. Read more

    source§

    fn chunk_by<K, F>(self, key: F) -> ChunkBy<K, Self, F>
    where Self: Sized, F: FnMut(&Self::Item) -> K, K: PartialEq,

    Return an iterable that can group iterator elements. Consecutive elements that map to the same key (“runs”), are assigned -to the same group. Read more
    source§

    fn chunks(self, size: usize) -> IntoChunks<Self>
    where - Self: Sized,

    Return an iterable that can chunk the iterator. Read more
    source§

    fn tuple_windows<T>(self) -> TupleWindows<Self, T> ⓘ
    where +to the same group. Read more

    source§

    fn group_by<K, F>(self, key: F) -> ChunkBy<K, Self, F>
    where + Self: Sized, + F: FnMut(&Self::Item) -> K, + K: PartialEq,

    👎Deprecated since 0.13.0: Use .chunk_by() instead
    See .chunk_by().
    source§

    fn chunks(self, size: usize) -> IntoChunks<Self>
    where + Self: Sized,

    Return an iterable that can chunk the iterator. Read more
    source§

    fn tuple_windows<T>(self) -> TupleWindows<Self, T> ⓘ
    where Self: Sized + Iterator<Item = T::Item>, T: HomogeneousTuple, T::Item: Clone,

    Return an iterator over all contiguous windows producing tuples of -a specific size (up to 12). Read more
    source§

    fn circular_tuple_windows<T>(self) -> CircularTupleWindows<Self, T> ⓘ
    where +a specific size (up to 12). Read more

    source§

    fn circular_tuple_windows<T>(self) -> CircularTupleWindows<Self, T> ⓘ
    where Self: Sized + Clone + Iterator<Item = T::Item> + ExactSizeIterator, T: TupleCollect + Clone, T::Item: Clone,

    Return an iterator over all windows, wrapping back to the first elements when the window would otherwise exceed the length of the -iterator, producing tuples of a specific size (up to 12). Read more
    source§

    fn tuples<T>(self) -> Tuples<Self, T> ⓘ
    where +iterator, producing tuples of a specific size (up to 12). Read more

    source§

    fn tuples<T>(self) -> Tuples<Self, T> ⓘ
    where Self: Sized + Iterator<Item = T::Item>, T: HomogeneousTuple,

    Return an iterator that groups the items in tuples of a specific size -(up to 12). Read more
    source§

    fn tee(self) -> (Tee<Self>, Tee<Self>)
    where +(up to 12). Read more

    source§

    fn tee(self) -> (Tee<Self>, Tee<Self>)
    where Self: Sized, Self::Item: Clone,

    Split into an iterator pair that both yield all elements from -the original iterator. Read more
    source§

    fn step(self, n: usize) -> Step<Self> ⓘ
    where - Self: Sized,

    👎Deprecated since 0.8.0: Use std .step_by() instead
    Return an iterator adaptor that steps n elements in the base iterator -for each iteration. Read more
    source§

    fn map_into<R>(self) -> MapInto<Self, R>
    where +the original iterator. Read more

    source§

    fn map_into<R>(self) -> MapInto<Self, R>
    where Self: Sized, - Self::Item: Into<R>,

    Convert each item of the iterator using the Into trait. Read more
    source§

    fn map_results<F, T, U, E>(self, f: F) -> MapOk<Self, F>
    where - Self: Iterator<Item = Result<T, E>> + Sized, - F: FnMut(T) -> U,

    👎Deprecated since 0.10.0: Use .map_ok() instead
    See .map_ok().
    source§

    fn map_ok<F, T, U, E>(self, f: F) -> MapOk<Self, F>
    where + Self::Item: Into<R>,

    Convert each item of the iterator using the Into trait. Read more
    source§

    fn map_ok<F, T, U, E>(self, f: F) -> MapOk<Self, F>
    where Self: Iterator<Item = Result<T, E>> + Sized, F: FnMut(T) -> U,

    Return an iterator adaptor that applies the provided closure to every Result::Ok value. Result::Err values are -unchanged. Read more
    source§

    fn filter_ok<F, T, E>(self, f: F) -> FilterOk<Self, F> ⓘ
    where +unchanged. Read more

    source§

    fn filter_ok<F, T, E>(self, f: F) -> FilterOk<Self, F> ⓘ
    where Self: Iterator<Item = Result<T, E>> + Sized, F: FnMut(&T) -> bool,

    Return an iterator adaptor that filters every Result::Ok value with the provided closure. Result::Err values are -unchanged. Read more
    source§

    fn filter_map_ok<F, T, U, E>(self, f: F) -> FilterMapOk<Self, F> ⓘ
    where +unchanged. Read more

    source§

    fn filter_map_ok<F, T, U, E>(self, f: F) -> FilterMapOk<Self, F> ⓘ
    where Self: Iterator<Item = Result<T, E>> + Sized, F: FnMut(T) -> Option<U>,

    Return an iterator adaptor that filters and transforms every Result::Ok value with the provided closure. Result::Err -values are unchanged. Read more
    source§

    fn flatten_ok<T, E>(self) -> FlattenOk<Self, T, E> ⓘ
    where +values are unchanged. Read more

    source§

    fn flatten_ok<T, E>(self) -> FlattenOk<Self, T, E> ⓘ
    where Self: Iterator<Item = Result<T, E>> + Sized, T: IntoIterator,

    Return an iterator adaptor that flattens every Result::Ok value into -a series of Result::Ok values. Result::Err values are unchanged. Read more
    source§

    fn process_results<F, T, E, R>(self, processor: F) -> Result<R, E>
    where +a series of Result::Ok values. Result::Err values are unchanged. Read more

    source§

    fn process_results<F, T, E, R>(self, processor: F) -> Result<R, E>
    where Self: Iterator<Item = Result<T, E>> + Sized, F: FnOnce(ProcessResults<'_, Self, E>) -> R,

    “Lift” a function of the values of the current iterator so as to process -an iterator of Result values instead. Read more
    source§

    fn merge<J>(self, other: J) -> Merge<Self, J::IntoIter>
    where +an iterator of Result values instead. Read more

    source§

    fn merge<J>(self, other: J) -> Merge<Self, J::IntoIter>
    where Self: Sized, Self::Item: PartialOrd, J: IntoIterator<Item = Self::Item>,

    Return an iterator adaptor that merges the two base iterators in ascending order. If both base iterators are sorted (ascending), the -result is sorted. Read more
    source§

    fn merge_by<J, F>(self, other: J, is_first: F) -> MergeBy<Self, J::IntoIter, F> ⓘ
    where +result is sorted. Read more

    source§

    fn merge_by<J, F>(self, other: J, is_first: F) -> MergeBy<Self, J::IntoIter, F> ⓘ
    where Self: Sized, J: IntoIterator<Item = Self::Item>, F: FnMut(&Self::Item, &Self::Item) -> bool,

    Return an iterator adaptor that merges the two base iterators in order. -This is much like .merge() but allows for a custom ordering. Read more
    source§

    fn merge_join_by<J, F, T>( +This is much like .merge() but allows for a custom ordering. Read more

    source§

    fn merge_join_by<J, F, T>( self, other: J, cmp_fn: F @@ -299,288 +300,299 @@ This is much like IntoIterator, F: FnMut(&Self::Item, &J::Item) -> T, Self: Sized,

    Create an iterator that merges items from both this and the specified -iterator in ascending order. Read more
    source§

    fn kmerge(self) -> KMerge<<Self::Item as IntoIterator>::IntoIter>
    where +iterator in ascending order. Read more

    source§

    fn kmerge(self) -> KMerge<<Self::Item as IntoIterator>::IntoIter>
    where Self: Sized, Self::Item: IntoIterator, <Self::Item as IntoIterator>::Item: PartialOrd,

    Return an iterator adaptor that flattens an iterator of iterators by -merging them in ascending order. Read more
    source§

    fn kmerge_by<F>( +merging them in ascending order. Read more

    source§

    fn kmerge_by<F>( self, first: F ) -> KMergeBy<<Self::Item as IntoIterator>::IntoIter, F> ⓘ
    where Self: Sized, Self::Item: IntoIterator, F: FnMut(&<Self::Item as IntoIterator>::Item, &<Self::Item as IntoIterator>::Item) -> bool,

    Return an iterator adaptor that flattens an iterator of iterators by -merging them according to the given closure. Read more
    source§

    fn cartesian_product<J>(self, other: J) -> Product<Self, J::IntoIter> ⓘ
    where +merging them according to the given closure. Read more

    source§

    fn cartesian_product<J>(self, other: J) -> Product<Self, J::IntoIter> ⓘ
    where Self: Sized, Self::Item: Clone, J: IntoIterator, J::IntoIter: Clone,

    Return an iterator adaptor that iterates over the cartesian product of -the element sets of two iterators self and J. Read more
    source§

    fn multi_cartesian_product( +the element sets of two iterators self and J. Read more

    source§

    fn multi_cartesian_product( self ) -> MultiProduct<<Self::Item as IntoIterator>::IntoIter> ⓘ
    where Self: Sized, Self::Item: IntoIterator, <Self::Item as IntoIterator>::IntoIter: Clone, <Self::Item as IntoIterator>::Item: Clone,

    Return an iterator adaptor that iterates over the cartesian product of -all subiterators returned by meta-iterator self. Read more
    source§

    fn coalesce<F>(self, f: F) -> Coalesce<Self, F>
    where +all subiterators returned by meta-iterator self. Read more

    source§

    fn coalesce<F>(self, f: F) -> Coalesce<Self, F>
    where Self: Sized, F: FnMut(Self::Item, Self::Item) -> Result<Self::Item, (Self::Item, Self::Item)>,

    Return an iterator adaptor that uses the passed-in closure to -optionally merge together consecutive elements. Read more
    source§

    fn dedup(self) -> Dedup<Self>
    where +optionally merge together consecutive elements. Read more

    source§

    fn dedup(self) -> Dedup<Self>
    where Self: Sized, Self::Item: PartialEq,

    Remove duplicates from sections of consecutive identical elements. -If the iterator is sorted, all elements will be unique. Read more
    source§

    fn dedup_by<Cmp>(self, cmp: Cmp) -> DedupBy<Self, Cmp>
    where +If the iterator is sorted, all elements will be unique. Read more

    source§

    fn dedup_by<Cmp>(self, cmp: Cmp) -> DedupBy<Self, Cmp>
    where Self: Sized, Cmp: FnMut(&Self::Item, &Self::Item) -> bool,

    Remove duplicates from sections of consecutive identical elements, determining equality using a comparison function. -If the iterator is sorted, all elements will be unique. Read more
    source§

    fn dedup_with_count(self) -> DedupWithCount<Self>
    where +If the iterator is sorted, all elements will be unique. Read more

    source§

    fn dedup_with_count(self) -> DedupWithCount<Self>
    where Self: Sized,

    Remove duplicates from sections of consecutive identical elements, while keeping a count of how many repeated elements were present. -If the iterator is sorted, all elements will be unique. Read more
    source§

    fn dedup_by_with_count<Cmp>(self, cmp: Cmp) -> DedupByWithCount<Self, Cmp>
    where +If the iterator is sorted, all elements will be unique. Read more

    source§

    fn dedup_by_with_count<Cmp>(self, cmp: Cmp) -> DedupByWithCount<Self, Cmp>
    where Self: Sized, Cmp: FnMut(&Self::Item, &Self::Item) -> bool,

    Remove duplicates from sections of consecutive identical elements, while keeping a count of how many repeated elements were present. This will determine equality using a comparison function. -If the iterator is sorted, all elements will be unique. Read more
    source§

    fn duplicates(self) -> Duplicates<Self>
    where +If the iterator is sorted, all elements will be unique. Read more

    source§

    fn duplicates(self) -> Duplicates<Self>
    where Self: Sized, Self::Item: Eq + Hash,

    Return an iterator adaptor that produces elements that appear more than once during the -iteration. Duplicates are detected using hash and equality. Read more
    source§

    fn duplicates_by<V, F>(self, f: F) -> DuplicatesBy<Self, V, F>
    where +iteration. Duplicates are detected using hash and equality. Read more

    source§

    fn duplicates_by<V, F>(self, f: F) -> DuplicatesBy<Self, V, F>
    where Self: Sized, V: Eq + Hash, F: FnMut(&Self::Item) -> V,

    Return an iterator adaptor that produces elements that appear more than once during the -iteration. Duplicates are detected using hash and equality. Read more
    source§

    fn unique(self) -> Unique<Self> ⓘ
    where +iteration. Duplicates are detected using hash and equality. Read more

    source§

    fn unique(self) -> Unique<Self> ⓘ
    where Self: Sized, Self::Item: Clone + Eq + Hash,

    Return an iterator adaptor that filters out elements that have already been produced once during the iteration. Duplicates -are detected using hash and equality. Read more
    source§

    fn unique_by<V, F>(self, f: F) -> UniqueBy<Self, V, F> ⓘ
    where +are detected using hash and equality. Read more

    source§

    fn unique_by<V, F>(self, f: F) -> UniqueBy<Self, V, F> ⓘ
    where Self: Sized, V: Eq + Hash, F: FnMut(&Self::Item) -> V,

    Return an iterator adaptor that filters out elements that have -already been produced once during the iteration. Read more
    source§

    fn peeking_take_while<F>(&mut self, accept: F) -> PeekingTakeWhile<'_, Self, F> ⓘ
    where +already been produced once during the iteration. Read more

    source§

    fn peeking_take_while<F>(&mut self, accept: F) -> PeekingTakeWhile<'_, Self, F> ⓘ
    where Self: Sized + PeekingNext, F: FnMut(&Self::Item) -> bool,

    Return an iterator adaptor that borrows from this iterator and -takes items while the closure accept returns true. Read more
    source§

    fn take_while_ref<F>(&mut self, accept: F) -> TakeWhileRef<'_, Self, F> ⓘ
    where +takes items while the closure accept returns true. Read more

    source§

    fn take_while_ref<F>(&mut self, accept: F) -> TakeWhileRef<'_, Self, F> ⓘ
    where Self: Clone, F: FnMut(&Self::Item) -> bool,

    Return an iterator adaptor that borrows from a Clone-able iterator -to only pick off elements while the predicate accept returns true. Read more
    source§

    fn take_while_inclusive<F>(self, accept: F) -> TakeWhileInclusive<Self, F> ⓘ
    where +to only pick off elements while the predicate accept returns true. Read more

    source§

    fn take_while_inclusive<F>(self, accept: F) -> TakeWhileInclusive<Self, F> ⓘ
    where Self: Sized, F: FnMut(&Self::Item) -> bool,

    Returns an iterator adaptor that consumes elements while the given predicate is true, including the element for which the predicate -first returned false. Read more
    source§

    fn while_some<A>(self) -> WhileSome<Self> ⓘ
    where +first returned false. Read more

    source§

    fn while_some<A>(self) -> WhileSome<Self> ⓘ
    where Self: Sized + Iterator<Item = Option<A>>,

    Return an iterator adaptor that filters Option<A> iterator elements -and produces A. Stops on the first None encountered. Read more
    source§

    fn tuple_combinations<T>(self) -> TupleCombinations<Self, T> ⓘ
    where +and produces A. Stops on the first None encountered. Read more

    source§

    fn tuple_combinations<T>(self) -> TupleCombinations<Self, T> ⓘ
    where Self: Sized + Clone, Self::Item: Clone, T: HasCombination<Self>,

    Return an iterator adaptor that iterates over the combinations of the -elements from an iterator. Read more
    source§

    fn combinations(self, k: usize) -> Combinations<Self> ⓘ
    where +elements from an iterator. Read more

    source§

    fn combinations(self, k: usize) -> Combinations<Self> ⓘ
    where Self: Sized, Self::Item: Clone,

    Return an iterator adaptor that iterates over the k-length combinations of -the elements from an iterator. Read more
    source§

    fn combinations_with_replacement( +the elements from an iterator. Read more

    source§

    fn combinations_with_replacement( self, k: usize ) -> CombinationsWithReplacement<Self> ⓘ
    where Self: Sized, Self::Item: Clone,

    Return an iterator that iterates over the k-length combinations of -the elements from an iterator, with replacement. Read more
    source§

    fn permutations(self, k: usize) -> Permutations<Self> ⓘ
    where +the elements from an iterator, with replacement. Read more

    source§

    fn permutations(self, k: usize) -> Permutations<Self> ⓘ
    where Self: Sized, Self::Item: Clone,

    Return an iterator adaptor that iterates over all k-permutations of the -elements from an iterator. Read more
    source§

    fn powerset(self) -> Powerset<Self> ⓘ
    where +elements from an iterator. Read more

    source§

    fn powerset(self) -> Powerset<Self> ⓘ
    where Self: Sized, Self::Item: Clone,

    Return an iterator that iterates through the powerset of the elements from an -iterator. Read more
    source§

    fn pad_using<F>(self, min: usize, f: F) -> PadUsing<Self, F> ⓘ
    where +iterator. Read more

    source§

    fn pad_using<F>(self, min: usize, f: F) -> PadUsing<Self, F> ⓘ
    where Self: Sized, F: FnMut(usize) -> Self::Item,

    Return an iterator adaptor that pads the sequence to a minimum length of -min by filling missing elements using a closure f. Read more
    source§

    fn with_position(self) -> WithPosition<Self> ⓘ
    where +min by filling missing elements using a closure f. Read more

    source§

    fn with_position(self) -> WithPosition<Self> ⓘ
    where Self: Sized,

    Return an iterator adaptor that combines each element with a Position to -ease special-case handling of the first or last elements. Read more
    source§

    fn positions<P>(self, predicate: P) -> Positions<Self, P> ⓘ
    where +ease special-case handling of the first or last elements. Read more

    source§

    fn positions<P>(self, predicate: P) -> Positions<Self, P> ⓘ
    where Self: Sized, P: FnMut(Self::Item) -> bool,

    Return an iterator adaptor that yields the indices of all elements -satisfying a predicate, counted from the start of the iterator. Read more
    source§

    fn update<F>(self, updater: F) -> Update<Self, F> ⓘ
    where +satisfying a predicate, counted from the start of the iterator. Read more

    source§

    fn update<F>(self, updater: F) -> Update<Self, F> ⓘ
    where Self: Sized, F: FnMut(&mut Self::Item),

    Return an iterator adaptor that applies a mutating function -to each element before yielding it. Read more
    source§

    fn next_tuple<T>(&mut self) -> Option<T>
    where +to each element before yielding it. Read more

    source§

    fn next_tuple<T>(&mut self) -> Option<T>
    where Self: Sized + Iterator<Item = T::Item>, T: HomogeneousTuple,

    Advances the iterator and returns the next items grouped in a tuple of -a specific size (up to 12). Read more
    source§

    fn collect_tuple<T>(self) -> Option<T>
    where +a specific size (up to 12). Read more

    source§

    fn collect_tuple<T>(self) -> Option<T>
    where Self: Sized + Iterator<Item = T::Item>, T: HomogeneousTuple,

    Collects all items from the iterator into a tuple of a specific size -(up to 12). Read more
    source§

    fn find_position<P>(&mut self, pred: P) -> Option<(usize, Self::Item)>
    where - P: FnMut(&Self::Item) -> bool,

    Find the position and value of the first element satisfying a predicate. Read more
    source§

    fn find_or_last<P>(self, predicate: P) -> Option<Self::Item>
    where +(up to 12). Read more

    source§

    fn find_position<P>(&mut self, pred: P) -> Option<(usize, Self::Item)>
    where + P: FnMut(&Self::Item) -> bool,

    Find the position and value of the first element satisfying a predicate. Read more
    source§

    fn find_or_last<P>(self, predicate: P) -> Option<Self::Item>
    where Self: Sized, - P: FnMut(&Self::Item) -> bool,

    Find the value of the first element satisfying a predicate or return the last element, if any. Read more
    source§

    fn find_or_first<P>(self, predicate: P) -> Option<Self::Item>
    where + P: FnMut(&Self::Item) -> bool,

    Find the value of the first element satisfying a predicate or return the last element, if any. Read more
    source§

    fn find_or_first<P>(self, predicate: P) -> Option<Self::Item>
    where Self: Sized, - P: FnMut(&Self::Item) -> bool,

    Find the value of the first element satisfying a predicate or return the first element, if any. Read more
    source§

    fn contains<Q>(&mut self, query: &Q) -> bool
    where + P: FnMut(&Self::Item) -> bool,

    Find the value of the first element satisfying a predicate or return the first element, if any. Read more
    source§

    fn contains<Q>(&mut self, query: &Q) -> bool
    where Self: Sized, Self::Item: Borrow<Q>, - Q: PartialEq,

    Returns true if the given item is present in this iterator. Read more
    source§

    fn all_equal(&mut self) -> bool
    where + Q: PartialEq,

    Returns true if the given item is present in this iterator. Read more
    source§

    fn all_equal(&mut self) -> bool
    where Self: Sized, - Self::Item: PartialEq,

    Check whether all elements compare equal. Read more
    source§

    fn all_equal_value( + Self::Item: PartialEq,

    Check whether all elements compare equal. Read more
    source§

    fn all_equal_value( &mut self ) -> Result<Self::Item, Option<(Self::Item, Self::Item)>>
    where Self: Sized, Self::Item: PartialEq,

    If there are elements and they are all equal, return a single copy of that element. If there are no elements, return an Error containing None. If there are elements and they are not all equal, return a tuple containing the first -two non-equal elements found. Read more
    source§

    fn all_unique(&mut self) -> bool
    where +two non-equal elements found. Read more

    source§

    fn all_unique(&mut self) -> bool
    where Self: Sized, - Self::Item: Eq + Hash,

    Check whether all elements are unique (non equal). Read more
    source§

    fn dropping(self, n: usize) -> Self
    where + Self::Item: Eq + Hash,

    Check whether all elements are unique (non equal). Read more
    source§

    fn dropping(self, n: usize) -> Self
    where Self: Sized,

    Consume the first n elements from the iterator eagerly, -and return the same iterator again. Read more
    source§

    fn dropping_back(self, n: usize) -> Self
    where +and return the same iterator again. Read more

    source§

    fn dropping_back(self, n: usize) -> Self
    where Self: Sized + DoubleEndedIterator,

    Consume the last n elements from the iterator eagerly, -and return the same iterator again. Read more
    source§

    fn foreach<F>(self, f: F)
    where - F: FnMut(Self::Item), - Self: Sized,

    👎Deprecated since 0.8.0: Use .for_each() instead
    Run the closure f eagerly on each element of the iterator. Read more
    source§

    fn concat(self) -> Self::Item
    where +and return the same iterator again. Read more

    source§

    fn concat(self) -> Self::Item
    where Self: Sized, - Self::Item: Extend<<<Self as Iterator>::Item as IntoIterator>::Item> + IntoIterator + Default,

    Combine all an iterator’s elements into one element by using Extend. Read more
    source§

    fn collect_vec(self) -> Vec<Self::Item>
    where + Self::Item: Extend<<<Self as Iterator>::Item as IntoIterator>::Item> + IntoIterator + Default,

    Combine all an iterator’s elements into one element by using Extend. Read more
    source§

    fn collect_vec(self) -> Vec<Self::Item>
    where Self: Sized,

    .collect_vec() is simply a type specialization of Iterator::collect, -for convenience.
    source§

    fn try_collect<T, U, E>(self) -> Result<U, E>
    where +for convenience.

    source§

    fn try_collect<T, U, E>(self) -> Result<U, E>
    where Self: Sized + Iterator<Item = Result<T, E>>, Result<U, E>: FromIterator<Result<T, E>>,

    .try_collect() is more convenient way of writing -.collect::<Result<_, _>>() Read more
    source§

    fn set_from<'a, A: 'a, J>(&mut self, from: J) -> usize
    where +.collect::<Result<_, _>>() Read more

    source§

    fn set_from<'a, A: 'a, J>(&mut self, from: J) -> usize
    where Self: Iterator<Item = &'a mut A>, J: IntoIterator<Item = A>,

    Assign to each reference in self from the from iterator, -stopping at the shortest of the two iterators. Read more
    source§

    fn join(&mut self, sep: &str) -> String
    where - Self::Item: Display,

    Combine all iterator elements into one String, separated by sep. Read more
    source§

    fn format(self, sep: &str) -> Format<'_, Self>
    where - Self: Sized,

    Format all iterator elements, separated by sep. Read more
    source§

    fn format_with<F>(self, sep: &str, format: F) -> FormatWith<'_, Self, F>
    where +stopping at the shortest of the two iterators. Read more

    source§

    fn join(&mut self, sep: &str) -> String
    where + Self::Item: Display,

    Combine all iterator elements into one String, separated by sep. Read more
    source§

    fn format(self, sep: &str) -> Format<'_, Self>
    where + Self: Sized,

    Format all iterator elements, separated by sep. Read more
    source§

    fn format_with<F>(self, sep: &str, format: F) -> FormatWith<'_, Self, F>
    where Self: Sized, - F: FnMut(Self::Item, &mut dyn FnMut(&dyn Display) -> Result) -> Result,

    Format all iterator elements, separated by sep. Read more
    source§

    fn fold_results<A, E, B, F>(&mut self, start: B, f: F) -> Result<B, E>
    where + F: FnMut(Self::Item, &mut dyn FnMut(&dyn Display) -> Result) -> Result,

    Format all iterator elements, separated by sep. Read more
    source§

    fn fold_ok<A, E, B, F>(&mut self, start: B, f: F) -> Result<B, E>
    where Self: Iterator<Item = Result<A, E>>, - F: FnMut(B, A) -> B,

    👎Deprecated since 0.10.0: Use .fold_ok() instead
    See .fold_ok().
    source§

    fn fold_ok<A, E, B, F>(&mut self, start: B, f: F) -> Result<B, E>
    where - Self: Iterator<Item = Result<A, E>>, - F: FnMut(B, A) -> B,

    Fold Result values from an iterator. Read more
    source§

    fn fold_options<A, B, F>(&mut self, start: B, f: F) -> Option<B>
    where + F: FnMut(B, A) -> B,

    Fold Result values from an iterator. Read more
    source§

    fn fold_options<A, B, F>(&mut self, start: B, f: F) -> Option<B>
    where Self: Iterator<Item = Option<A>>, - F: FnMut(B, A) -> B,

    Fold Option values from an iterator. Read more
    source§

    fn fold1<F>(self, f: F) -> Option<Self::Item>
    where + F: FnMut(B, A) -> B,

    Fold Option values from an iterator. Read more
    source§

    fn fold1<F>(self, f: F) -> Option<Self::Item>
    where F: FnMut(Self::Item, Self::Item) -> Self::Item, - Self: Sized,

    👎Deprecated since 0.10.2: Use Iterator::reduce instead
    Accumulator of the elements in the iterator. Read more
    source§

    fn tree_fold1<F>(self, f: F) -> Option<Self::Item>
    where + Self: Sized,

    👎Deprecated since 0.10.2: Use Iterator::reduce instead
    Accumulator of the elements in the iterator. Read more
    source§

    fn tree_reduce<F>(self, f: F) -> Option<Self::Item>
    where F: FnMut(Self::Item, Self::Item) -> Self::Item, - Self: Sized,

    Accumulate the elements in the iterator in a tree-like manner. Read more
    source§

    fn fold_while<B, F>(&mut self, init: B, f: F) -> FoldWhile<B>
    where + Self: Sized,

    Accumulate the elements in the iterator in a tree-like manner. Read more
    source§

    fn tree_fold1<F>(self, f: F) -> Option<Self::Item>
    where + F: FnMut(Self::Item, Self::Item) -> Self::Item, + Self: Sized,

    👎Deprecated since 0.13.0: Use .tree_reduce() instead
    See .tree_reduce().
    source§

    fn fold_while<B, F>(&mut self, init: B, f: F) -> FoldWhile<B>
    where Self: Sized, - F: FnMut(B, Self::Item) -> FoldWhile<B>,

    An iterator method that applies a function, producing a single, final value. Read more
    source§

    fn sum1<S>(self) -> Option<S>
    where + F: FnMut(B, Self::Item) -> FoldWhile<B>,

    An iterator method that applies a function, producing a single, final value. Read more
    source§

    fn sum1<S>(self) -> Option<S>
    where Self: Sized, - S: Sum<Self::Item>,

    Iterate over the entire iterator and add all the elements. Read more
    source§

    fn product1<P>(self) -> Option<P>
    where + S: Sum<Self::Item>,

    Iterate over the entire iterator and add all the elements. Read more
    source§

    fn product1<P>(self) -> Option<P>
    where Self: Sized, - P: Product<Self::Item>,

    Iterate over the entire iterator and multiply all the elements. Read more
    source§

    fn sorted_unstable(self) -> IntoIter<Self::Item> ⓘ
    where + P: Product<Self::Item>,

    Iterate over the entire iterator and multiply all the elements. Read more
    source§

    fn sorted_unstable(self) -> IntoIter<Self::Item> ⓘ
    where Self: Sized, - Self::Item: Ord,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_unstable_by<F>(self, cmp: F) -> IntoIter<Self::Item> ⓘ
    where + Self::Item: Ord,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_unstable_by<F>(self, cmp: F) -> IntoIter<Self::Item> ⓘ
    where Self: Sized, - F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_unstable_by_key<K, F>(self, f: F) -> IntoIter<Self::Item> ⓘ
    where + F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_unstable_by_key<K, F>(self, f: F) -> IntoIter<Self::Item> ⓘ
    where Self: Sized, K: Ord, - F: FnMut(&Self::Item) -> K,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted(self) -> IntoIter<Self::Item> ⓘ
    where + F: FnMut(&Self::Item) -> K,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted(self) -> IntoIter<Self::Item> ⓘ
    where Self: Sized, - Self::Item: Ord,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_by<F>(self, cmp: F) -> IntoIter<Self::Item> ⓘ
    where + Self::Item: Ord,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_by<F>(self, cmp: F) -> IntoIter<Self::Item> ⓘ
    where Self: Sized, - F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_by_key<K, F>(self, f: F) -> IntoIter<Self::Item> ⓘ
    where + F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_by_key<K, F>(self, f: F) -> IntoIter<Self::Item> ⓘ
    where Self: Sized, K: Ord, - F: FnMut(&Self::Item) -> K,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_by_cached_key<K, F>(self, f: F) -> IntoIter<Self::Item> ⓘ
    where + F: FnMut(&Self::Item) -> K,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_by_cached_key<K, F>(self, f: F) -> IntoIter<Self::Item> ⓘ
    where Self: Sized, K: Ord, F: FnMut(&Self::Item) -> K,

    Sort all iterator elements into a new iterator in ascending order. The key function is -called exactly once per key. Read more
    source§

    fn k_smallest(self, k: usize) -> IntoIter<Self::Item> ⓘ
    where +called exactly once per key. Read more

    source§

    fn k_smallest(self, k: usize) -> IntoIter<Self::Item> ⓘ
    where Self: Sized, - Self::Item: Ord,

    Sort the k smallest elements into a new iterator, in ascending order. Read more
    source§

    fn partition_map<A, B, F, L, R>(self, predicate: F) -> (A, B)
    where + Self::Item: Ord,

    Sort the k smallest elements into a new iterator, in ascending order. Read more
    source§

    fn k_smallest_by<F>(self, k: usize, cmp: F) -> IntoIter<Self::Item> ⓘ
    where + Self: Sized, + F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Sort the k smallest elements into a new iterator using the provided comparison. Read more
    source§

    fn k_smallest_by_key<F, K>(self, k: usize, key: F) -> IntoIter<Self::Item> ⓘ
    where + Self: Sized, + F: FnMut(&Self::Item) -> K, + K: Ord,

    Return the elements producing the k smallest outputs of the provided function. Read more
    source§

    fn k_largest(self, k: usize) -> IntoIter<Self::Item> ⓘ
    where + Self: Sized, + Self::Item: Ord,

    Sort the k largest elements into a new iterator, in descending order. Read more
    source§

    fn k_largest_by<F>(self, k: usize, cmp: F) -> IntoIter<Self::Item> ⓘ
    where + Self: Sized, + F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Sort the k largest elements into a new iterator using the provided comparison. Read more
    source§

    fn k_largest_by_key<F, K>(self, k: usize, key: F) -> IntoIter<Self::Item> ⓘ
    where + Self: Sized, + F: FnMut(&Self::Item) -> K, + K: Ord,

    Return the elements producing the k largest outputs of the provided function. Read more
    source§

    fn tail(self, n: usize) -> IntoIter<Self::Item> ⓘ
    where + Self: Sized,

    Consumes the iterator and return an iterator of the last n elements. Read more
    source§

    fn partition_map<A, B, F, L, R>(self, predicate: F) -> (A, B)
    where Self: Sized, F: FnMut(Self::Item) -> Either<L, R>, A: Default + Extend<L>, B: Default + Extend<R>,

    Collect all iterator elements into one of two partitions. Unlike Iterator::partition, each partition may -have a distinct type. Read more
    source§

    fn partition_result<A, B, T, E>(self) -> (A, B)
    where +have a distinct type. Read more

    source§

    fn partition_result<A, B, T, E>(self) -> (A, B)
    where Self: Iterator<Item = Result<T, E>> + Sized, A: Default + Extend<T>, B: Default + Extend<E>,

    Partition a sequence of Results into one list of all the Ok elements -and another list of all the Err elements. Read more
    source§

    fn into_group_map<K, V>(self) -> HashMap<K, Vec<V>>
    where +and another list of all the Err elements. Read more

    source§

    fn into_group_map<K, V>(self) -> HashMap<K, Vec<V>>
    where Self: Iterator<Item = (K, V)> + Sized, K: Hash + Eq,

    Return a HashMap of keys mapped to Vecs of values. Keys and values -are taken from (Key, Value) tuple pairs yielded by the input iterator. Read more
    source§

    fn into_group_map_by<K, V, F>(self, f: F) -> HashMap<K, Vec<V>>
    where +are taken from (Key, Value) tuple pairs yielded by the input iterator. Read more

    source§

    fn into_group_map_by<K, V, F>(self, f: F) -> HashMap<K, Vec<V>>
    where Self: Iterator<Item = V> + Sized, K: Hash + Eq, - F: Fn(&V) -> K,

    Return an Iterator on a HashMap. Keys mapped to Vecs of values. The key is specified -in the closure. Read more
    source§

    fn into_grouping_map<K, V>(self) -> GroupingMap<Self>
    where + F: FnMut(&V) -> K,

    Return an Iterator on a HashMap. Keys mapped to Vecs of values. The key is specified +in the closure. Read more
    source§

    fn into_grouping_map<K, V>(self) -> GroupingMap<Self>
    where Self: Iterator<Item = (K, V)> + Sized, K: Hash + Eq,

    Constructs a GroupingMap to be used later with one of the efficient -group-and-fold operations it allows to perform. Read more
    source§

    fn into_grouping_map_by<K, V, F>(self, key_mapper: F) -> GroupingMapBy<Self, F>
    where +group-and-fold operations it allows to perform. Read more

    source§

    fn into_grouping_map_by<K, V, F>(self, key_mapper: F) -> GroupingMapBy<Self, F>
    where Self: Iterator<Item = V> + Sized, K: Hash + Eq, F: FnMut(&V) -> K,

    Constructs a GroupingMap to be used later with one of the efficient -group-and-fold operations it allows to perform. Read more
    source§

    fn min_set(self) -> Vec<Self::Item>
    where +group-and-fold operations it allows to perform. Read more

    source§

    fn min_set(self) -> Vec<Self::Item>
    where Self: Sized, - Self::Item: Ord,

    Return all minimum elements of an iterator. Read more
    source§

    fn min_set_by<F>(self, compare: F) -> Vec<Self::Item>
    where + Self::Item: Ord,

    Return all minimum elements of an iterator. Read more
    source§

    fn min_set_by<F>(self, compare: F) -> Vec<Self::Item>
    where Self: Sized, F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Return all minimum elements of an iterator, as determined by -the specified function. Read more
    source§

    fn min_set_by_key<K, F>(self, key: F) -> Vec<Self::Item>
    where +the specified function. Read more

    source§

    fn min_set_by_key<K, F>(self, key: F) -> Vec<Self::Item>
    where Self: Sized, K: Ord, F: FnMut(&Self::Item) -> K,

    Return all minimum elements of an iterator, as determined by -the specified function. Read more
    source§

    fn max_set(self) -> Vec<Self::Item>
    where +the specified function. Read more

    source§

    fn max_set(self) -> Vec<Self::Item>
    where Self: Sized, - Self::Item: Ord,

    Return all maximum elements of an iterator. Read more
    source§

    fn max_set_by<F>(self, compare: F) -> Vec<Self::Item>
    where + Self::Item: Ord,

    Return all maximum elements of an iterator. Read more
    source§

    fn max_set_by<F>(self, compare: F) -> Vec<Self::Item>
    where Self: Sized, F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Return all maximum elements of an iterator, as determined by -the specified function. Read more
    source§

    fn max_set_by_key<K, F>(self, key: F) -> Vec<Self::Item>
    where +the specified function. Read more

    source§

    fn max_set_by_key<K, F>(self, key: F) -> Vec<Self::Item>
    where Self: Sized, K: Ord, F: FnMut(&Self::Item) -> K,

    Return all maximum elements of an iterator, as determined by -the specified function. Read more
    source§

    fn minmax(self) -> MinMaxResult<Self::Item>
    where +the specified function. Read more

    source§

    fn minmax(self) -> MinMaxResult<Self::Item>
    where Self: Sized, - Self::Item: PartialOrd,

    Return the minimum and maximum elements in the iterator. Read more
    source§

    fn minmax_by_key<K, F>(self, key: F) -> MinMaxResult<Self::Item>
    where + Self::Item: PartialOrd,

    Return the minimum and maximum elements in the iterator. Read more
    source§

    fn minmax_by_key<K, F>(self, key: F) -> MinMaxResult<Self::Item>
    where Self: Sized, K: PartialOrd, F: FnMut(&Self::Item) -> K,

    Return the minimum and maximum element of an iterator, as determined by -the specified function. Read more
    source§

    fn minmax_by<F>(self, compare: F) -> MinMaxResult<Self::Item>
    where +the specified function. Read more

    source§

    fn minmax_by<F>(self, compare: F) -> MinMaxResult<Self::Item>
    where Self: Sized, F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Return the minimum and maximum element of an iterator, as determined by -the specified comparison function. Read more
    source§

    fn position_max(self) -> Option<usize>
    where +the specified comparison function. Read more

    source§

    fn position_max(self) -> Option<usize>
    where Self: Sized, - Self::Item: Ord,

    Return the position of the maximum element in the iterator. Read more
    source§

    fn position_max_by_key<K, F>(self, key: F) -> Option<usize>
    where + Self::Item: Ord,

    Return the position of the maximum element in the iterator. Read more
    source§

    fn position_max_by_key<K, F>(self, key: F) -> Option<usize>
    where Self: Sized, K: Ord, F: FnMut(&Self::Item) -> K,

    Return the position of the maximum element in the iterator, as -determined by the specified function. Read more
    source§

    fn position_max_by<F>(self, compare: F) -> Option<usize>
    where +determined by the specified function. Read more

    source§

    fn position_max_by<F>(self, compare: F) -> Option<usize>
    where Self: Sized, F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Return the position of the maximum element in the iterator, as -determined by the specified comparison function. Read more
    source§

    fn position_min(self) -> Option<usize>
    where +determined by the specified comparison function. Read more

    source§

    fn position_min(self) -> Option<usize>
    where Self: Sized, - Self::Item: Ord,

    Return the position of the minimum element in the iterator. Read more
    source§

    fn position_min_by_key<K, F>(self, key: F) -> Option<usize>
    where + Self::Item: Ord,

    Return the position of the minimum element in the iterator. Read more
    source§

    fn position_min_by_key<K, F>(self, key: F) -> Option<usize>
    where Self: Sized, K: Ord, F: FnMut(&Self::Item) -> K,

    Return the position of the minimum element in the iterator, as -determined by the specified function. Read more
    source§

    fn position_min_by<F>(self, compare: F) -> Option<usize>
    where +determined by the specified function. Read more

    source§

    fn position_min_by<F>(self, compare: F) -> Option<usize>
    where Self: Sized, F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Return the position of the minimum element in the iterator, as -determined by the specified comparison function. Read more
    source§

    fn position_minmax(self) -> MinMaxResult<usize>
    where +determined by the specified comparison function. Read more

    source§

    fn position_minmax(self) -> MinMaxResult<usize>
    where Self: Sized, Self::Item: PartialOrd,

    Return the positions of the minimum and maximum elements in -the iterator. Read more
    source§

    fn position_minmax_by_key<K, F>(self, key: F) -> MinMaxResult<usize>
    where +the iterator. Read more

    source§

    fn position_minmax_by_key<K, F>(self, key: F) -> MinMaxResult<usize>
    where Self: Sized, K: PartialOrd, F: FnMut(&Self::Item) -> K,

    Return the postions of the minimum and maximum elements of an -iterator, as determined by the specified function. Read more
    source§

    fn position_minmax_by<F>(self, compare: F) -> MinMaxResult<usize>
    where +iterator, as determined by the specified function. Read more

    source§

    fn position_minmax_by<F>(self, compare: F) -> MinMaxResult<usize>
    where Self: Sized, F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Return the postions of the minimum and maximum elements of an -iterator, as determined by the specified comparison function. Read more
    source§

    fn exactly_one(self) -> Result<Self::Item, ExactlyOneError<Self>>
    where +iterator, as determined by the specified comparison function. Read more

    source§

    fn exactly_one(self) -> Result<Self::Item, ExactlyOneError<Self>>
    where Self: Sized,

    If the iterator yields exactly one element, that element will be returned, otherwise an error will be returned containing an iterator that has the same output as the input -iterator. Read more
    source§

    fn at_most_one(self) -> Result<Option<Self::Item>, ExactlyOneError<Self>>
    where - Self: Sized,

    If the iterator yields no elements, Ok(None) will be returned. If the iterator yields +iterator. Read more
    source§

    fn at_most_one(self) -> Result<Option<Self::Item>, ExactlyOneError<Self>>
    where + Self: Sized,

    If the iterator yields no elements, Ok(None) will be returned. If the iterator yields exactly one element, that element will be returned, otherwise an error will be returned -containing an iterator that has the same output as the input iterator. Read more
    source§

    fn multipeek(self) -> MultiPeek<Self> ⓘ
    where +containing an iterator that has the same output as the input iterator. Read more

    source§

    fn multipeek(self) -> MultiPeek<Self> ⓘ
    where Self: Sized,

    An iterator adaptor that allows the user to peek at multiple .next() -values without advancing the base iterator. Read more
    source§

    fn counts(self) -> HashMap<Self::Item, usize>
    where +values without advancing the base iterator. Read more

    source§

    fn counts(self) -> HashMap<Self::Item, usize>
    where Self: Sized, Self::Item: Eq + Hash,

    Collect the items in this iterator and return a HashMap which contains each item that appears in the iterator and the number -of times it appears. Read more
    source§

    fn counts_by<K, F>(self, f: F) -> HashMap<K, usize>
    where +of times it appears. Read more

    source§

    fn counts_by<K, F>(self, f: F) -> HashMap<K, usize>
    where Self: Sized, K: Eq + Hash, F: FnMut(Self::Item) -> K,

    Collect the items in this iterator and return a HashMap which contains each item that appears in the iterator and the number of times it appears, -determining identity using a keying function. Read more
    source§

    fn multiunzip<FromI>(self) -> FromI
    where - Self: Sized + MultiUnzip<FromI>,

    Converts an iterator of tuples into a tuple of containers. Read more
    source§

    fn try_len(&self) -> Result<usize, (usize, Option<usize>)>

    Returns the length of the iterator if one exists. +determining identity using a keying function. Read more
    source§

    fn multiunzip<FromI>(self) -> FromI
    where + Self: Sized + MultiUnzip<FromI>,

    Converts an iterator of tuples into a tuple of containers. Read more
    source§

    fn try_len(&self) -> Result<usize, (usize, Option<usize>)>

    Returns the length of the iterator if one exists. Otherwise return self.size_hint(). Read more
    source§

    impl<IT, A, FromA, B, FromB> MultiUnzip<(FromA, FromB)> for IT
    where IT: Iterator<Item = (A, B)>, FromA: Default + Extend<A>, FromB: Default + Extend<B>,

    source§

    fn multiunzip(self) -> (FromA, FromB)

    Unzip this iterator into multiple collections.
    source§

    impl<T> 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 + 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/itertools/structs/struct.Zip.html b/itertools/structs/struct.Zip.html index 1127d86a2..48a169304 100644 --- a/itertools/structs/struct.Zip.html +++ b/itertools/structs/struct.Zip.html @@ -1,72 +1,18 @@ -Zip in itertools::structs - Rust
    +Zip in itertools::structs - Rust

    Struct itertools::structs::Zip

    source · 
    pub struct Zip<T> { /* private fields */ }
    Expand description

    See multizip for more information.

    -

    Trait Implementations§

    source§

    impl<T: Clone> Clone for Zip<T>

    source§

    fn clone(&self) -> Zip<T>

    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 Zip<T>

    source§

    fn fmt(&self, f: &mut Formatter<'_>) -> Result

    Formats the value using the given formatter. Read more
    source§

    impl<A> DoubleEndedIterator for Zip<(A,)>
    where - A: DoubleEndedIterator + ExactSizeIterator,

    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 +

    Trait Implementations§

    source§

    impl<T: Clone> Clone for Zip<T>

    source§

    fn clone(&self) -> Zip<T>

    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 Zip<T>

    source§

    fn fmt(&self, f: &mut Formatter<'_>) -> Result

    Formats the value using the given formatter. Read more
    source§

    impl<A> DoubleEndedIterator for Zip<(A,)>
    where + A: DoubleEndedIterator + ExactSizeIterator,

    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 +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 +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, B> DoubleEndedIterator for Zip<(A, B)>
    where + P: FnMut(&Self::Item) -> bool,

    Searches for an element of an iterator from the back that satisfies a predicate. Read more
    source§

    impl<A, B> DoubleEndedIterator for Zip<(A, B)>
    where A: DoubleEndedIterator + ExactSizeIterator, - B: DoubleEndedIterator + ExactSizeIterator,

    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, B, C> DoubleEndedIterator for Zip<(A, B, C)>
    where - A: DoubleEndedIterator + ExactSizeIterator, - B: DoubleEndedIterator + ExactSizeIterator, - C: DoubleEndedIterator + ExactSizeIterator,

    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, B, C, D> DoubleEndedIterator for Zip<(A, B, C, D)>
    where - A: DoubleEndedIterator + ExactSizeIterator, - B: DoubleEndedIterator + ExactSizeIterator, - C: DoubleEndedIterator + ExactSizeIterator, - D: DoubleEndedIterator + ExactSizeIterator,

    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, B, C, D, E> DoubleEndedIterator for Zip<(A, B, C, D, E)>
    where - A: DoubleEndedIterator + ExactSizeIterator, - B: DoubleEndedIterator + ExactSizeIterator, - C: DoubleEndedIterator + ExactSizeIterator, - D: DoubleEndedIterator + ExactSizeIterator, - E: DoubleEndedIterator + ExactSizeIterator,

    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, B, C, D, E, F> DoubleEndedIterator for Zip<(A, B, C, D, E, F)>
    where - A: DoubleEndedIterator + ExactSizeIterator, - B: DoubleEndedIterator + ExactSizeIterator, - C: DoubleEndedIterator + ExactSizeIterator, - D: DoubleEndedIterator + ExactSizeIterator, - E: DoubleEndedIterator + ExactSizeIterator, - F: DoubleEndedIterator + ExactSizeIterator,

    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 + B: DoubleEndedIterator + ExactSizeIterator,

    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 @@ -75,14 +21,23 @@ elements starting from the back of the iterator. 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, B, C, D, E, F, G> DoubleEndedIterator for Zip<(A, B, C, D, E, F, G)>
    where + P: FnMut(&Self::Item) -> bool,

    Searches for an element of an iterator from the back that satisfies a predicate. Read more
    source§

    impl<A, B, C> DoubleEndedIterator for Zip<(A, B, C)>
    where + A: DoubleEndedIterator + ExactSizeIterator, + B: DoubleEndedIterator + ExactSizeIterator, + C: DoubleEndedIterator + ExactSizeIterator,

    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, B, C, D> DoubleEndedIterator for Zip<(A, B, C, D)>
    where A: DoubleEndedIterator + ExactSizeIterator, B: DoubleEndedIterator + ExactSizeIterator, C: DoubleEndedIterator + ExactSizeIterator, - D: DoubleEndedIterator + ExactSizeIterator, - E: DoubleEndedIterator + ExactSizeIterator, - F: DoubleEndedIterator + ExactSizeIterator, - G: DoubleEndedIterator + ExactSizeIterator,

    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 + D: DoubleEndedIterator + ExactSizeIterator,

    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 @@ -91,33 +46,12 @@ elements starting from the back of the iterator. 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, B, C, D, E, F, G, H> DoubleEndedIterator for Zip<(A, B, C, D, E, F, G, H)>
    where + P: FnMut(&Self::Item) -> bool,

    Searches for an element of an iterator from the back that satisfies a predicate. Read more
    source§

    impl<A, B, C, D, E> DoubleEndedIterator for Zip<(A, B, C, D, E)>
    where A: DoubleEndedIterator + ExactSizeIterator, B: DoubleEndedIterator + ExactSizeIterator, C: DoubleEndedIterator + ExactSizeIterator, D: DoubleEndedIterator + ExactSizeIterator, - E: DoubleEndedIterator + ExactSizeIterator, - F: DoubleEndedIterator + ExactSizeIterator, - G: DoubleEndedIterator + ExactSizeIterator, - H: DoubleEndedIterator + ExactSizeIterator,

    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, B, C, D, E, F, G, H, I> DoubleEndedIterator for Zip<(A, B, C, D, E, F, G, H, I)>
    where - A: DoubleEndedIterator + ExactSizeIterator, - B: DoubleEndedIterator + ExactSizeIterator, - C: DoubleEndedIterator + ExactSizeIterator, - D: DoubleEndedIterator + ExactSizeIterator, - E: DoubleEndedIterator + ExactSizeIterator, - F: DoubleEndedIterator + ExactSizeIterator, - G: DoubleEndedIterator + ExactSizeIterator, - H: DoubleEndedIterator + ExactSizeIterator, - I: DoubleEndedIterator + ExactSizeIterator,

    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 + E: DoubleEndedIterator + ExactSizeIterator,

    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 @@ -126,7 +60,73 @@ elements starting from the back of the iterator. 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, B, C, D, E, F, G, H, I, J> DoubleEndedIterator for Zip<(A, B, C, D, E, F, G, H, I, J)>
    where + P: FnMut(&Self::Item) -> bool,

    Searches for an element of an iterator from the back that satisfies a predicate. Read more
    source§

    impl<A, B, C, D, E, F> DoubleEndedIterator for Zip<(A, B, C, D, E, F)>
    where + A: DoubleEndedIterator + ExactSizeIterator, + B: DoubleEndedIterator + ExactSizeIterator, + C: DoubleEndedIterator + ExactSizeIterator, + D: DoubleEndedIterator + ExactSizeIterator, + E: DoubleEndedIterator + ExactSizeIterator, + F: DoubleEndedIterator + ExactSizeIterator,

    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, B, C, D, E, F, G> DoubleEndedIterator for Zip<(A, B, C, D, E, F, G)>
    where + A: DoubleEndedIterator + ExactSizeIterator, + B: DoubleEndedIterator + ExactSizeIterator, + C: DoubleEndedIterator + ExactSizeIterator, + D: DoubleEndedIterator + ExactSizeIterator, + E: DoubleEndedIterator + ExactSizeIterator, + F: DoubleEndedIterator + ExactSizeIterator, + G: DoubleEndedIterator + ExactSizeIterator,

    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, B, C, D, E, F, G, H> DoubleEndedIterator for Zip<(A, B, C, D, E, F, G, H)>
    where + A: DoubleEndedIterator + ExactSizeIterator, + B: DoubleEndedIterator + ExactSizeIterator, + C: DoubleEndedIterator + ExactSizeIterator, + D: DoubleEndedIterator + ExactSizeIterator, + E: DoubleEndedIterator + ExactSizeIterator, + F: DoubleEndedIterator + ExactSizeIterator, + G: DoubleEndedIterator + ExactSizeIterator, + H: DoubleEndedIterator + ExactSizeIterator,

    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, B, C, D, E, F, G, H, I> DoubleEndedIterator for Zip<(A, B, C, D, E, F, G, H, I)>
    where + A: DoubleEndedIterator + ExactSizeIterator, + B: DoubleEndedIterator + ExactSizeIterator, + C: DoubleEndedIterator + ExactSizeIterator, + D: DoubleEndedIterator + ExactSizeIterator, + E: DoubleEndedIterator + ExactSizeIterator, + F: DoubleEndedIterator + ExactSizeIterator, + G: DoubleEndedIterator + ExactSizeIterator, + H: DoubleEndedIterator + ExactSizeIterator, + I: DoubleEndedIterator + ExactSizeIterator,

    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, B, C, D, E, F, G, H, I, J> DoubleEndedIterator for Zip<(A, B, C, D, E, F, G, H, I, J)>
    where A: DoubleEndedIterator + ExactSizeIterator, B: DoubleEndedIterator + ExactSizeIterator, C: DoubleEndedIterator + ExactSizeIterator, @@ -136,16 +136,16 @@ final value, starting from the back. DoubleEndedIterator + ExactSizeIterator, H: DoubleEndedIterator + ExactSizeIterator, I: DoubleEndedIterator + ExactSizeIterator, - J: DoubleEndedIterator + ExactSizeIterator,

    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 + J: DoubleEndedIterator + ExactSizeIterator,

    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 +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 +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, B, C, D, E, F, G, H, I, J, K> DoubleEndedIterator for Zip<(A, B, C, D, E, F, G, H, I, J, K)>
    where + P: FnMut(&Self::Item) -> bool,

    Searches for an element of an iterator from the back that satisfies a predicate. Read more
    source§

    impl<A, B, C, D, E, F, G, H, I, J, K> DoubleEndedIterator for Zip<(A, B, C, D, E, F, G, H, I, J, K)>
    where A: DoubleEndedIterator + ExactSizeIterator, B: DoubleEndedIterator + ExactSizeIterator, C: DoubleEndedIterator + ExactSizeIterator, @@ -156,16 +156,16 @@ final value, starting from the back. DoubleEndedIterator + ExactSizeIterator, I: DoubleEndedIterator + ExactSizeIterator, J: DoubleEndedIterator + ExactSizeIterator, - K: DoubleEndedIterator + ExactSizeIterator,

    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 + K: DoubleEndedIterator + ExactSizeIterator,

    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 +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 +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, B, C, D, E, F, G, H, I, J, K, L> DoubleEndedIterator for Zip<(A, B, C, D, E, F, G, H, I, J, K, L)>
    where + P: FnMut(&Self::Item) -> bool,

    Searches for an element of an iterator from the back that satisfies a predicate. Read more
    source§

    impl<A, B, C, D, E, F, G, H, I, J, K, L> DoubleEndedIterator for Zip<(A, B, C, D, E, F, G, H, I, J, K, L)>
    where A: DoubleEndedIterator + ExactSizeIterator, B: DoubleEndedIterator + ExactSizeIterator, C: DoubleEndedIterator + ExactSizeIterator, @@ -177,44 +177,44 @@ final value, starting from the back. DoubleEndedIterator + ExactSizeIterator, J: DoubleEndedIterator + ExactSizeIterator, K: DoubleEndedIterator + ExactSizeIterator, - L: DoubleEndedIterator + ExactSizeIterator,

    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 + L: DoubleEndedIterator + ExactSizeIterator,

    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 +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 +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> ExactSizeIterator for Zip<(A,)>
    where - A: ExactSizeIterator,

    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<A, B> ExactSizeIterator for Zip<(A, B)>
    where + P: FnMut(&Self::Item) -> bool,

    Searches for an element of an iterator from the back that satisfies a predicate. Read more
    source§

    impl<A> ExactSizeIterator for Zip<(A,)>
    where + A: ExactSizeIterator,

    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<A, B> ExactSizeIterator for Zip<(A, B)>
    where A: ExactSizeIterator, - B: ExactSizeIterator,

    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<A, B, C> ExactSizeIterator for Zip<(A, B, C)>
    where + B: ExactSizeIterator,

    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<A, B, C> ExactSizeIterator for Zip<(A, B, C)>
    where A: ExactSizeIterator, B: ExactSizeIterator, - C: ExactSizeIterator,

    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<A, B, C, D> ExactSizeIterator for Zip<(A, B, C, D)>
    where + C: ExactSizeIterator,

    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<A, B, C, D> ExactSizeIterator for Zip<(A, B, C, D)>
    where A: ExactSizeIterator, B: ExactSizeIterator, C: ExactSizeIterator, - D: ExactSizeIterator,

    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<A, B, C, D, E> ExactSizeIterator for Zip<(A, B, C, D, E)>
    where + D: ExactSizeIterator,

    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<A, B, C, D, E> ExactSizeIterator for Zip<(A, B, C, D, E)>
    where A: ExactSizeIterator, B: ExactSizeIterator, C: ExactSizeIterator, D: ExactSizeIterator, - E: ExactSizeIterator,

    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<A, B, C, D, E, F> ExactSizeIterator for Zip<(A, B, C, D, E, F)>
    where + E: ExactSizeIterator,

    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<A, B, C, D, E, F> ExactSizeIterator for Zip<(A, B, C, D, E, F)>
    where A: ExactSizeIterator, B: ExactSizeIterator, C: ExactSizeIterator, D: ExactSizeIterator, E: ExactSizeIterator, - F: ExactSizeIterator,

    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<A, B, C, D, E, F, G> ExactSizeIterator for Zip<(A, B, C, D, E, F, G)>
    where + F: ExactSizeIterator,

    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<A, B, C, D, E, F, G> ExactSizeIterator for Zip<(A, B, C, D, E, F, G)>
    where A: ExactSizeIterator, B: ExactSizeIterator, C: ExactSizeIterator, D: ExactSizeIterator, E: ExactSizeIterator, F: ExactSizeIterator, - G: ExactSizeIterator,

    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<A, B, C, D, E, F, G, H> ExactSizeIterator for Zip<(A, B, C, D, E, F, G, H)>
    where + G: ExactSizeIterator,

    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<A, B, C, D, E, F, G, H> ExactSizeIterator for Zip<(A, B, C, D, E, F, G, H)>
    where A: ExactSizeIterator, B: ExactSizeIterator, C: ExactSizeIterator, @@ -222,7 +222,7 @@ final value, starting from the back. ExactSizeIterator, F: ExactSizeIterator, G: ExactSizeIterator, - H: ExactSizeIterator,

    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<A, B, C, D, E, F, G, H, I> ExactSizeIterator for Zip<(A, B, C, D, E, F, G, H, I)>
    where + H: ExactSizeIterator,

    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<A, B, C, D, E, F, G, H, I> ExactSizeIterator for Zip<(A, B, C, D, E, F, G, H, I)>
    where A: ExactSizeIterator, B: ExactSizeIterator, C: ExactSizeIterator, @@ -231,7 +231,7 @@ final value, starting from the back. ExactSizeIterator, G: ExactSizeIterator, H: ExactSizeIterator, - I: ExactSizeIterator,

    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<A, B, C, D, E, F, G, H, I, J> ExactSizeIterator for Zip<(A, B, C, D, E, F, G, H, I, J)>
    where + I: ExactSizeIterator,

    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<A, B, C, D, E, F, G, H, I, J> ExactSizeIterator for Zip<(A, B, C, D, E, F, G, H, I, J)>
    where A: ExactSizeIterator, B: ExactSizeIterator, C: ExactSizeIterator, @@ -241,7 +241,7 @@ final value, starting from the back. ExactSizeIterator, H: ExactSizeIterator, I: ExactSizeIterator, - J: ExactSizeIterator,

    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<A, B, C, D, E, F, G, H, I, J, K> ExactSizeIterator for Zip<(A, B, C, D, E, F, G, H, I, J, K)>
    where + J: ExactSizeIterator,

    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<A, B, C, D, E, F, G, H, I, J, K> ExactSizeIterator for Zip<(A, B, C, D, E, F, G, H, I, J, K)>
    where A: ExactSizeIterator, B: ExactSizeIterator, C: ExactSizeIterator, @@ -252,7 +252,7 @@ final value, starting from the back. ExactSizeIterator, I: ExactSizeIterator, J: ExactSizeIterator, - K: ExactSizeIterator,

    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<A, B, C, D, E, F, G, H, I, J, K, L> ExactSizeIterator for Zip<(A, B, C, D, E, F, G, H, I, J, K, L)>
    where + K: ExactSizeIterator,

    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<A, B, C, D, E, F, G, H, I, J, K, L> ExactSizeIterator for Zip<(A, B, C, D, E, F, G, H, I, J, K, L)>
    where A: ExactSizeIterator, B: ExactSizeIterator, C: ExactSizeIterator, @@ -264,1468 +264,8 @@ final value, starting from the back. ExactSizeIterator, J: ExactSizeIterator, K: ExactSizeIterator, - L: ExactSizeIterator,

    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<A: IntoIterator> From<(A,)> for Zip<(A::IntoIter,)>

    source§

    fn from(t: (A,)) -> Self

    Converts to this type from the input type.
    source§

    impl<A: IntoIterator, B: IntoIterator> From<(A, B)> for Zip<(A::IntoIter, B::IntoIter)>

    source§

    fn from(t: (A, B)) -> Self

    Converts to this type from the input type.
    source§

    impl<A: IntoIterator, B: IntoIterator, C: IntoIterator> From<(A, B, C)> for Zip<(A::IntoIter, B::IntoIter, C::IntoIter)>

    source§

    fn from(t: (A, B, C)) -> Self

    Converts to this type from the input type.
    source§

    impl<A: IntoIterator, B: IntoIterator, C: IntoIterator, D: IntoIterator> From<(A, B, C, D)> for Zip<(A::IntoIter, B::IntoIter, C::IntoIter, D::IntoIter)>

    source§

    fn from(t: (A, B, C, D)) -> Self

    Converts to this type from the input type.
    source§

    impl<A: IntoIterator, B: IntoIterator, C: IntoIterator, D: IntoIterator, E: IntoIterator> From<(A, B, C, D, E)> for Zip<(A::IntoIter, B::IntoIter, C::IntoIter, D::IntoIter, E::IntoIter)>

    source§

    fn from(t: (A, B, C, D, E)) -> Self

    Converts to this type from the input type.
    source§

    impl<A: IntoIterator, B: IntoIterator, C: IntoIterator, D: IntoIterator, E: IntoIterator, F: IntoIterator> From<(A, B, C, D, E, F)> for Zip<(A::IntoIter, B::IntoIter, C::IntoIter, D::IntoIter, E::IntoIter, F::IntoIter)>

    source§

    fn from(t: (A, B, C, D, E, F)) -> Self

    Converts to this type from the input type.
    source§

    impl<A: IntoIterator, B: IntoIterator, C: IntoIterator, D: IntoIterator, E: IntoIterator, F: IntoIterator, G: IntoIterator> From<(A, B, C, D, E, F, G)> for Zip<(A::IntoIter, B::IntoIter, C::IntoIter, D::IntoIter, E::IntoIter, F::IntoIter, G::IntoIter)>

    source§

    fn from(t: (A, B, C, D, E, F, G)) -> Self

    Converts to this type from the input type.
    source§

    impl<A: IntoIterator, B: IntoIterator, C: IntoIterator, D: IntoIterator, E: IntoIterator, F: IntoIterator, G: IntoIterator, H: IntoIterator> From<(A, B, C, D, E, F, G, H)> for Zip<(A::IntoIter, B::IntoIter, C::IntoIter, D::IntoIter, E::IntoIter, F::IntoIter, G::IntoIter, H::IntoIter)>

    source§

    fn from(t: (A, B, C, D, E, F, G, H)) -> Self

    Converts to this type from the input type.
    source§

    impl<A: IntoIterator, B: IntoIterator, C: IntoIterator, D: IntoIterator, E: IntoIterator, F: IntoIterator, G: IntoIterator, H: IntoIterator, I: IntoIterator> From<(A, B, C, D, E, F, G, H, I)> for Zip<(A::IntoIter, B::IntoIter, C::IntoIter, D::IntoIter, E::IntoIter, F::IntoIter, G::IntoIter, H::IntoIter, I::IntoIter)>

    source§

    fn from(t: (A, B, C, D, E, F, G, H, I)) -> Self

    Converts to this type from the input type.
    source§

    impl<A: IntoIterator, B: IntoIterator, C: IntoIterator, D: IntoIterator, E: IntoIterator, F: IntoIterator, G: IntoIterator, H: IntoIterator, I: IntoIterator, J: IntoIterator> From<(A, B, C, D, E, F, G, H, I, J)> for Zip<(A::IntoIter, B::IntoIter, C::IntoIter, D::IntoIter, E::IntoIter, F::IntoIter, G::IntoIter, H::IntoIter, I::IntoIter, J::IntoIter)>

    source§

    fn from(t: (A, B, C, D, E, F, G, H, I, J)) -> Self

    Converts to this type from the input type.
    source§

    impl<A: IntoIterator, B: IntoIterator, C: IntoIterator, D: IntoIterator, E: IntoIterator, F: IntoIterator, G: IntoIterator, H: IntoIterator, I: IntoIterator, J: IntoIterator, K: IntoIterator> From<(A, B, C, D, E, F, G, H, I, J, K)> for Zip<(A::IntoIter, B::IntoIter, C::IntoIter, D::IntoIter, E::IntoIter, F::IntoIter, G::IntoIter, H::IntoIter, I::IntoIter, J::IntoIter, K::IntoIter)>

    source§

    fn from(t: (A, B, C, D, E, F, G, H, I, J, K)) -> Self

    Converts to this type from the input type.
    source§

    impl<A: IntoIterator, B: IntoIterator, C: IntoIterator, D: IntoIterator, E: IntoIterator, F: IntoIterator, G: IntoIterator, H: IntoIterator, I: IntoIterator, J: IntoIterator, K: IntoIterator, L: IntoIterator> From<(A, B, C, D, E, F, G, H, I, J, K, L)> for Zip<(A::IntoIter, B::IntoIter, C::IntoIter, D::IntoIter, E::IntoIter, F::IntoIter, G::IntoIter, H::IntoIter, I::IntoIter, J::IntoIter, K::IntoIter, L::IntoIter)>

    source§

    fn from(t: (A, B, C, D, E, F, G, H, I, J, K, L)) -> Self

    Converts to this type from the input type.
    source§

    impl<A> Iterator for Zip<(A,)>
    where - A: Iterator,

    §

    type Item = (<A as Iterator>::Item,)

    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<A, B> Iterator for Zip<(A, B)>
    where - A: Iterator, - B: Iterator,

    §

    type Item = (<A as Iterator>::Item, <B as Iterator>::Item)

    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<A, B, C> Iterator for Zip<(A, B, C)>
    where - A: Iterator, - B: Iterator, - C: Iterator,

    §

    type Item = (<A as Iterator>::Item, <B as Iterator>::Item, <C as Iterator>::Item)

    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<A, B, C, D> Iterator for Zip<(A, B, C, D)>
    where - A: Iterator, - B: Iterator, - C: Iterator, - D: Iterator,

    §

    type Item = (<A as Iterator>::Item, <B as Iterator>::Item, <C as Iterator>::Item, <D as Iterator>::Item)

    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<A, B, C, D, E> Iterator for Zip<(A, B, C, D, E)>
    where - A: Iterator, - B: Iterator, - C: Iterator, - D: Iterator, - E: Iterator,

    §

    type Item = (<A as Iterator>::Item, <B as Iterator>::Item, <C as Iterator>::Item, <D as Iterator>::Item, <E as Iterator>::Item)

    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<A, B, C, D, E, F> Iterator for Zip<(A, B, C, D, E, F)>
    where - A: Iterator, - B: Iterator, - C: Iterator, - D: Iterator, - E: Iterator, - F: Iterator,

    §

    type Item = (<A as Iterator>::Item, <B as Iterator>::Item, <C as Iterator>::Item, <D as Iterator>::Item, <E as Iterator>::Item, <F as Iterator>::Item)

    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<A, B, C, D, E, F, G> Iterator for Zip<(A, B, C, D, E, F, G)>
    where - A: Iterator, - B: Iterator, - C: Iterator, - D: Iterator, - E: Iterator, - F: Iterator, - G: Iterator,

    §

    type Item = (<A as Iterator>::Item, <B as Iterator>::Item, <C as Iterator>::Item, <D as Iterator>::Item, <E as Iterator>::Item, <F as Iterator>::Item, <G as Iterator>::Item)

    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<A, B, C, D, E, F, G, H> Iterator for Zip<(A, B, C, D, E, F, G, H)>
    where - A: Iterator, - B: Iterator, - C: Iterator, - D: Iterator, - E: Iterator, - F: Iterator, - G: Iterator, - H: Iterator,

    §

    type Item = (<A as Iterator>::Item, <B as Iterator>::Item, <C as Iterator>::Item, <D as Iterator>::Item, <E as Iterator>::Item, <F as Iterator>::Item, <G as Iterator>::Item, <H as Iterator>::Item)

    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<A, B, C, D, E, F, G, H, I> Iterator for Zip<(A, B, C, D, E, F, G, H, I)>
    where - A: Iterator, - B: Iterator, - C: Iterator, - D: Iterator, - E: Iterator, - F: Iterator, - G: Iterator, - H: Iterator, - I: Iterator,

    §

    type Item = (<A as Iterator>::Item, <B as Iterator>::Item, <C as Iterator>::Item, <D as Iterator>::Item, <E as Iterator>::Item, <F as Iterator>::Item, <G as Iterator>::Item, <H as Iterator>::Item, <I as Iterator>::Item)

    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>( + L: ExactSizeIterator,

    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<A: IntoIterator> From<(A,)> for Zip<(A::IntoIter,)>

    source§

    fn from(t: (A,)) -> Self

    Converts to this type from the input type.
    source§

    impl<A: IntoIterator, B: IntoIterator> From<(A, B)> for Zip<(A::IntoIter, B::IntoIter)>

    source§

    fn from(t: (A, B)) -> Self

    Converts to this type from the input type.
    source§

    impl<A: IntoIterator, B: IntoIterator, C: IntoIterator> From<(A, B, C)> for Zip<(A::IntoIter, B::IntoIter, C::IntoIter)>

    source§

    fn from(t: (A, B, C)) -> Self

    Converts to this type from the input type.
    source§

    impl<A: IntoIterator, B: IntoIterator, C: IntoIterator, D: IntoIterator> From<(A, B, C, D)> for Zip<(A::IntoIter, B::IntoIter, C::IntoIter, D::IntoIter)>

    source§

    fn from(t: (A, B, C, D)) -> Self

    Converts to this type from the input type.
    source§

    impl<A: IntoIterator, B: IntoIterator, C: IntoIterator, D: IntoIterator, E: IntoIterator> From<(A, B, C, D, E)> for Zip<(A::IntoIter, B::IntoIter, C::IntoIter, D::IntoIter, E::IntoIter)>

    source§

    fn from(t: (A, B, C, D, E)) -> Self

    Converts to this type from the input type.
    source§

    impl<A: IntoIterator, B: IntoIterator, C: IntoIterator, D: IntoIterator, E: IntoIterator, F: IntoIterator> From<(A, B, C, D, E, F)> for Zip<(A::IntoIter, B::IntoIter, C::IntoIter, D::IntoIter, E::IntoIter, F::IntoIter)>

    source§

    fn from(t: (A, B, C, D, E, F)) -> Self

    Converts to this type from the input type.
    source§

    impl<A: IntoIterator, B: IntoIterator, C: IntoIterator, D: IntoIterator, E: IntoIterator, F: IntoIterator, G: IntoIterator> From<(A, B, C, D, E, F, G)> for Zip<(A::IntoIter, B::IntoIter, C::IntoIter, D::IntoIter, E::IntoIter, F::IntoIter, G::IntoIter)>

    source§

    fn from(t: (A, B, C, D, E, F, G)) -> Self

    Converts to this type from the input type.
    source§

    impl<A: IntoIterator, B: IntoIterator, C: IntoIterator, D: IntoIterator, E: IntoIterator, F: IntoIterator, G: IntoIterator, H: IntoIterator> From<(A, B, C, D, E, F, G, H)> for Zip<(A::IntoIter, B::IntoIter, C::IntoIter, D::IntoIter, E::IntoIter, F::IntoIter, G::IntoIter, H::IntoIter)>

    source§

    fn from(t: (A, B, C, D, E, F, G, H)) -> Self

    Converts to this type from the input type.
    source§

    impl<A: IntoIterator, B: IntoIterator, C: IntoIterator, D: IntoIterator, E: IntoIterator, F: IntoIterator, G: IntoIterator, H: IntoIterator, I: IntoIterator> From<(A, B, C, D, E, F, G, H, I)> for Zip<(A::IntoIter, B::IntoIter, C::IntoIter, D::IntoIter, E::IntoIter, F::IntoIter, G::IntoIter, H::IntoIter, I::IntoIter)>

    source§

    fn from(t: (A, B, C, D, E, F, G, H, I)) -> Self

    Converts to this type from the input type.
    source§

    impl<A: IntoIterator, B: IntoIterator, C: IntoIterator, D: IntoIterator, E: IntoIterator, F: IntoIterator, G: IntoIterator, H: IntoIterator, I: IntoIterator, J: IntoIterator> From<(A, B, C, D, E, F, G, H, I, J)> for Zip<(A::IntoIter, B::IntoIter, C::IntoIter, D::IntoIter, E::IntoIter, F::IntoIter, G::IntoIter, H::IntoIter, I::IntoIter, J::IntoIter)>

    source§

    fn from(t: (A, B, C, D, E, F, G, H, I, J)) -> Self

    Converts to this type from the input type.
    source§

    impl<A: IntoIterator, B: IntoIterator, C: IntoIterator, D: IntoIterator, E: IntoIterator, F: IntoIterator, G: IntoIterator, H: IntoIterator, I: IntoIterator, J: IntoIterator, K: IntoIterator> From<(A, B, C, D, E, F, G, H, I, J, K)> for Zip<(A::IntoIter, B::IntoIter, C::IntoIter, D::IntoIter, E::IntoIter, F::IntoIter, G::IntoIter, H::IntoIter, I::IntoIter, J::IntoIter, K::IntoIter)>

    source§

    fn from(t: (A, B, C, D, E, F, G, H, I, J, K)) -> Self

    Converts to this type from the input type.
    source§

    impl<A: IntoIterator, B: IntoIterator, C: IntoIterator, D: IntoIterator, E: IntoIterator, F: IntoIterator, G: IntoIterator, H: IntoIterator, I: IntoIterator, J: IntoIterator, K: IntoIterator, L: IntoIterator> From<(A, B, C, D, E, F, G, H, I, J, K, L)> for Zip<(A::IntoIter, B::IntoIter, C::IntoIter, D::IntoIter, E::IntoIter, F::IntoIter, G::IntoIter, H::IntoIter, I::IntoIter, J::IntoIter, K::IntoIter, L::IntoIter)>

    source§

    fn from(t: (A, B, C, D, E, F, G, H, I, J, K, L)) -> Self

    Converts to this type from the input type.
    source§

    impl<A> Iterator for Zip<(A,)>
    where + A: Iterator,

    §

    type Item = (<A as Iterator>::Item,)

    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 @@ -1902,93 +442,85 @@ greater than or equal to those of another. Sized, F: FnMut(Self::Item) -> K, K: PartialOrd,

    🔬This is a nightly-only experimental API. (is_sorted)
    Checks if the elements of this iterator are sorted using the given key extraction -function. Read more
    source§

    impl<A, B, C, D, E, F, G, H, I, J> Iterator for Zip<(A, B, C, D, E, F, G, H, I, J)>
    where +function. Read more

    source§

    impl<A, B> Iterator for Zip<(A, B)>
    where A: Iterator, - B: Iterator, - C: Iterator, - D: Iterator, - E: Iterator, - F: Iterator, - G: Iterator, - H: Iterator, - I: Iterator, - J: Iterator,

    §

    type Item = (<A as Iterator>::Item, <B as Iterator>::Item, <C as Iterator>::Item, <D as Iterator>::Item, <E as Iterator>::Item, <F as Iterator>::Item, <G as Iterator>::Item, <H as Iterator>::Item, <I as Iterator>::Item, <J as Iterator>::Item)

    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>( + B: Iterator,

    §

    type Item = (<A as Iterator>::Item, <B as Iterator>::Item)

    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,

    🔬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 +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 + 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 + 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 +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 +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 + 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 +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 + 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 +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 +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 + 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 + 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 + 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 +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 +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 + 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 +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 + 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 + 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,

    🔬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 + 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 +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 +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 +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 +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>( +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 @@ -1996,16 +528,16 @@ operation. 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 +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 + 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 + 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 + 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>( +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 @@ -2013,94 +545,86 @@ the first non-none result. 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 +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 + 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 +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 +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 +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 +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 + 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 + 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 + 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 + 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 + 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 +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 +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 +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 +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 +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 +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 +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 +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 +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 +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 + 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<A, B, C, D, E, F, G, H, I, J, K> Iterator for Zip<(A, B, C, D, E, F, G, H, I, J, K)>
    where +function. Read more

    source§

    impl<A, B, C> Iterator for Zip<(A, B, C)>
    where A: Iterator, B: Iterator, - C: Iterator, - D: Iterator, - E: Iterator, - F: Iterator, - G: Iterator, - H: Iterator, - I: Iterator, - J: Iterator, - K: Iterator,

    §

    type Item = (<A as Iterator>::Item, <B as Iterator>::Item, <C as Iterator>::Item, <D as Iterator>::Item, <E as Iterator>::Item, <F as Iterator>::Item, <G as Iterator>::Item, <H as Iterator>::Item, <I as Iterator>::Item, <J as Iterator>::Item, <K as Iterator>::Item)

    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>( + C: Iterator,

    §

    type Item = (<A as Iterator>::Item, <B as Iterator>::Item, <C as Iterator>::Item)

    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 @@ -2277,19 +801,11 @@ greater than or equal to those of another. Sized, F: FnMut(Self::Item) -> K, K: PartialOrd,

    🔬This is a nightly-only experimental API. (is_sorted)
    Checks if the elements of this iterator are sorted using the given key extraction -function. Read more
    source§

    impl<A, B, C, D, E, F, G, H, I, J, K, L> Iterator for Zip<(A, B, C, D, E, F, G, H, I, J, K, L)>
    where +function. Read more

    source§

    impl<A, B, C, D> Iterator for Zip<(A, B, C, D)>
    where A: Iterator, B: Iterator, C: Iterator, - D: Iterator, - E: Iterator, - F: Iterator, - G: Iterator, - H: Iterator, - I: Iterator, - J: Iterator, - K: Iterator, - L: Iterator,

    §

    type Item = (<A as Iterator>::Item, <B as Iterator>::Item, <C as Iterator>::Item, <D as Iterator>::Item, <E as Iterator>::Item, <F as Iterator>::Item, <G as Iterator>::Item, <H as Iterator>::Item, <I as Iterator>::Item, <J as Iterator>::Item, <K as Iterator>::Item, <L as Iterator>::Item)

    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>( + D: Iterator,

    §

    type Item = (<A as Iterator>::Item, <B as Iterator>::Item, <C as Iterator>::Item, <D as Iterator>::Item)

    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 @@ -2466,6 +982,1490 @@ greater than or equal to those of another. Sized, F: FnMut(Self::Item) -> K, K: PartialOrd,

    🔬This is a nightly-only experimental API. (is_sorted)
    Checks if the elements of this iterator are sorted using the given key extraction +function. Read more
    source§

    impl<A, B, C, D, E> Iterator for Zip<(A, B, C, D, E)>
    where + A: Iterator, + B: Iterator, + C: Iterator, + D: Iterator, + E: Iterator,

    §

    type Item = (<A as Iterator>::Item, <B as Iterator>::Item, <C as Iterator>::Item, <D as Iterator>::Item, <E as Iterator>::Item)

    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<A, B, C, D, E, F> Iterator for Zip<(A, B, C, D, E, F)>
    where + A: Iterator, + B: Iterator, + C: Iterator, + D: Iterator, + E: Iterator, + F: Iterator,

    §

    type Item = (<A as Iterator>::Item, <B as Iterator>::Item, <C as Iterator>::Item, <D as Iterator>::Item, <E as Iterator>::Item, <F as Iterator>::Item)

    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<A, B, C, D, E, F, G> Iterator for Zip<(A, B, C, D, E, F, G)>
    where + A: Iterator, + B: Iterator, + C: Iterator, + D: Iterator, + E: Iterator, + F: Iterator, + G: Iterator,

    §

    type Item = (<A as Iterator>::Item, <B as Iterator>::Item, <C as Iterator>::Item, <D as Iterator>::Item, <E as Iterator>::Item, <F as Iterator>::Item, <G as Iterator>::Item)

    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<A, B, C, D, E, F, G, H> Iterator for Zip<(A, B, C, D, E, F, G, H)>
    where + A: Iterator, + B: Iterator, + C: Iterator, + D: Iterator, + E: Iterator, + F: Iterator, + G: Iterator, + H: Iterator,

    §

    type Item = (<A as Iterator>::Item, <B as Iterator>::Item, <C as Iterator>::Item, <D as Iterator>::Item, <E as Iterator>::Item, <F as Iterator>::Item, <G as Iterator>::Item, <H as Iterator>::Item)

    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<A, B, C, D, E, F, G, H, I> Iterator for Zip<(A, B, C, D, E, F, G, H, I)>
    where + A: Iterator, + B: Iterator, + C: Iterator, + D: Iterator, + E: Iterator, + F: Iterator, + G: Iterator, + H: Iterator, + I: Iterator,

    §

    type Item = (<A as Iterator>::Item, <B as Iterator>::Item, <C as Iterator>::Item, <D as Iterator>::Item, <E as Iterator>::Item, <F as Iterator>::Item, <G as Iterator>::Item, <H as Iterator>::Item, <I as Iterator>::Item)

    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<A, B, C, D, E, F, G, H, I, J> Iterator for Zip<(A, B, C, D, E, F, G, H, I, J)>
    where + A: Iterator, + B: Iterator, + C: Iterator, + D: Iterator, + E: Iterator, + F: Iterator, + G: Iterator, + H: Iterator, + I: Iterator, + J: Iterator,

    §

    type Item = (<A as Iterator>::Item, <B as Iterator>::Item, <C as Iterator>::Item, <D as Iterator>::Item, <E as Iterator>::Item, <F as Iterator>::Item, <G as Iterator>::Item, <H as Iterator>::Item, <I as Iterator>::Item, <J as Iterator>::Item)

    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<A, B, C, D, E, F, G, H, I, J, K> Iterator for Zip<(A, B, C, D, E, F, G, H, I, J, K)>
    where + A: Iterator, + B: Iterator, + C: Iterator, + D: Iterator, + E: Iterator, + F: Iterator, + G: Iterator, + H: Iterator, + I: Iterator, + J: Iterator, + K: Iterator,

    §

    type Item = (<A as Iterator>::Item, <B as Iterator>::Item, <C as Iterator>::Item, <D as Iterator>::Item, <E as Iterator>::Item, <F as Iterator>::Item, <G as Iterator>::Item, <H as Iterator>::Item, <I as Iterator>::Item, <J as Iterator>::Item, <K as Iterator>::Item)

    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<A, B, C, D, E, F, G, H, I, J, K, L> Iterator for Zip<(A, B, C, D, E, F, G, H, I, J, K, L)>
    where + A: Iterator, + B: Iterator, + C: Iterator, + D: Iterator, + E: Iterator, + F: Iterator, + G: Iterator, + H: Iterator, + I: Iterator, + J: Iterator, + K: Iterator, + L: Iterator,

    §

    type Item = (<A as Iterator>::Item, <B as Iterator>::Item, <C as Iterator>::Item, <D as Iterator>::Item, <E as Iterator>::Item, <F as Iterator>::Item, <G as Iterator>::Item, <H as Iterator>::Item, <I as Iterator>::Item, <J as Iterator>::Item, <K as Iterator>::Item, <L as Iterator>::Item)

    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

    Auto Trait Implementations§

    §

    impl<T> Freeze for Zip<T>
    where T: Freeze,

    §

    impl<T> RefUnwindSafe for Zip<T>
    where T: RefUnwindSafe,

    §

    impl<T> Send for Zip<T>
    where @@ -2488,86 +2488,87 @@ otherwise. Right variant of Either<Self, Self> otherwise. Read more

    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> Itertools for T
    where - T: Iterator + ?Sized,

    source§

    fn interleave<J>(self, other: J) -> Interleave<Self, J::IntoIter> ⓘ
    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> Itertools for T
    where + T: Iterator + ?Sized,

    source§

    fn interleave<J>(self, other: J) -> Interleave<Self, J::IntoIter> ⓘ
    where J: IntoIterator<Item = Self::Item>, - Self: Sized,

    Alternate elements from two iterators until both have run out. Read more
    source§

    fn interleave_shortest<J>( + Self: Sized,

    Alternate elements from two iterators until both have run out. Read more
    source§

    fn interleave_shortest<J>( self, other: J ) -> InterleaveShortest<Self, J::IntoIter> ⓘ
    where J: IntoIterator<Item = Self::Item>, Self: Sized,

    Alternate elements from two iterators until at least one of them has run -out. Read more
    source§

    fn intersperse(self, element: Self::Item) -> Intersperse<Self>
    where +out. Read more

    source§

    fn intersperse(self, element: Self::Item) -> Intersperse<Self>
    where Self: Sized, Self::Item: Clone,

    An iterator adaptor to insert a particular value -between each element of the adapted iterator. Read more
    source§

    fn intersperse_with<F>(self, element: F) -> IntersperseWith<Self, F> ⓘ
    where +between each element of the adapted iterator. Read more

    source§

    fn intersperse_with<F>(self, element: F) -> IntersperseWith<Self, F> ⓘ
    where Self: Sized, F: FnMut() -> Self::Item,

    An iterator adaptor to insert a particular value created by a function -between each element of the adapted iterator. Read more
    source§

    fn zip_longest<J>(self, other: J) -> ZipLongest<Self, J::IntoIter> ⓘ
    where +between each element of the adapted iterator. Read more

    source§

    fn get<R>(self, index: R) -> R::Output
    where + Self: Sized, + R: IteratorIndex<Self>,

    Returns an iterator over a subsection of the iterator. Read more
    source§

    fn zip_longest<J>(self, other: J) -> ZipLongest<Self, J::IntoIter> ⓘ
    where J: IntoIterator, Self: Sized,

    Create an iterator which iterates over both this and the specified -iterator simultaneously, yielding pairs of two optional elements. Read more
    source§

    fn zip_eq<J>(self, other: J) -> ZipEq<Self, J::IntoIter> ⓘ
    where +iterator simultaneously, yielding pairs of two optional elements. Read more

    source§

    fn zip_eq<J>(self, other: J) -> ZipEq<Self, J::IntoIter> ⓘ
    where J: IntoIterator, Self: Sized,

    Create an iterator which iterates over both this and the specified -iterator simultaneously, yielding pairs of elements. Read more
    source§

    fn batching<B, F>(self, f: F) -> Batching<Self, F> ⓘ
    where +iterator simultaneously, yielding pairs of elements. Read more

    source§

    fn batching<B, F>(self, f: F) -> Batching<Self, F> ⓘ
    where F: FnMut(&mut Self) -> Option<B>, Self: Sized,

    A “meta iterator adaptor”. Its closure receives a reference to the iterator and may pick off as many elements as it likes, to produce the -next iterator element. Read more
    source§

    fn group_by<K, F>(self, key: F) -> GroupBy<K, Self, F>
    where +next iterator element. Read more

    source§

    fn chunk_by<K, F>(self, key: F) -> ChunkBy<K, Self, F>
    where Self: Sized, F: FnMut(&Self::Item) -> K, K: PartialEq,

    Return an iterable that can group iterator elements. Consecutive elements that map to the same key (“runs”), are assigned -to the same group. Read more
    source§

    fn chunks(self, size: usize) -> IntoChunks<Self>
    where - Self: Sized,

    Return an iterable that can chunk the iterator. Read more
    source§

    fn tuple_windows<T>(self) -> TupleWindows<Self, T> ⓘ
    where +to the same group. Read more

    source§

    fn group_by<K, F>(self, key: F) -> ChunkBy<K, Self, F>
    where + Self: Sized, + F: FnMut(&Self::Item) -> K, + K: PartialEq,

    👎Deprecated since 0.13.0: Use .chunk_by() instead
    See .chunk_by().
    source§

    fn chunks(self, size: usize) -> IntoChunks<Self>
    where + Self: Sized,

    Return an iterable that can chunk the iterator. Read more
    source§

    fn tuple_windows<T>(self) -> TupleWindows<Self, T> ⓘ
    where Self: Sized + Iterator<Item = T::Item>, T: HomogeneousTuple, T::Item: Clone,

    Return an iterator over all contiguous windows producing tuples of -a specific size (up to 12). Read more
    source§

    fn circular_tuple_windows<T>(self) -> CircularTupleWindows<Self, T> ⓘ
    where +a specific size (up to 12). Read more

    source§

    fn circular_tuple_windows<T>(self) -> CircularTupleWindows<Self, T> ⓘ
    where Self: Sized + Clone + Iterator<Item = T::Item> + ExactSizeIterator, T: TupleCollect + Clone, T::Item: Clone,

    Return an iterator over all windows, wrapping back to the first elements when the window would otherwise exceed the length of the -iterator, producing tuples of a specific size (up to 12). Read more
    source§

    fn tuples<T>(self) -> Tuples<Self, T> ⓘ
    where +iterator, producing tuples of a specific size (up to 12). Read more

    source§

    fn tuples<T>(self) -> Tuples<Self, T> ⓘ
    where Self: Sized + Iterator<Item = T::Item>, T: HomogeneousTuple,

    Return an iterator that groups the items in tuples of a specific size -(up to 12). Read more
    source§

    fn tee(self) -> (Tee<Self>, Tee<Self>)
    where +(up to 12). Read more

    source§

    fn tee(self) -> (Tee<Self>, Tee<Self>)
    where Self: Sized, Self::Item: Clone,

    Split into an iterator pair that both yield all elements from -the original iterator. Read more
    source§

    fn step(self, n: usize) -> Step<Self> ⓘ
    where - Self: Sized,

    👎Deprecated since 0.8.0: Use std .step_by() instead
    Return an iterator adaptor that steps n elements in the base iterator -for each iteration. Read more
    source§

    fn map_into<R>(self) -> MapInto<Self, R>
    where +the original iterator. Read more

    source§

    fn map_into<R>(self) -> MapInto<Self, R>
    where Self: Sized, - Self::Item: Into<R>,

    Convert each item of the iterator using the Into trait. Read more
    source§

    fn map_results<F, T, U, E>(self, f: F) -> MapOk<Self, F>
    where - Self: Iterator<Item = Result<T, E>> + Sized, - F: FnMut(T) -> U,

    👎Deprecated since 0.10.0: Use .map_ok() instead
    See .map_ok().
    source§

    fn map_ok<F, T, U, E>(self, f: F) -> MapOk<Self, F>
    where + Self::Item: Into<R>,

    Convert each item of the iterator using the Into trait. Read more
    source§

    fn map_ok<F, T, U, E>(self, f: F) -> MapOk<Self, F>
    where Self: Iterator<Item = Result<T, E>> + Sized, F: FnMut(T) -> U,

    Return an iterator adaptor that applies the provided closure to every Result::Ok value. Result::Err values are -unchanged. Read more
    source§

    fn filter_ok<F, T, E>(self, f: F) -> FilterOk<Self, F> ⓘ
    where +unchanged. Read more

    source§

    fn filter_ok<F, T, E>(self, f: F) -> FilterOk<Self, F> ⓘ
    where Self: Iterator<Item = Result<T, E>> + Sized, F: FnMut(&T) -> bool,

    Return an iterator adaptor that filters every Result::Ok value with the provided closure. Result::Err values are -unchanged. Read more
    source§

    fn filter_map_ok<F, T, U, E>(self, f: F) -> FilterMapOk<Self, F> ⓘ
    where +unchanged. Read more

    source§

    fn filter_map_ok<F, T, U, E>(self, f: F) -> FilterMapOk<Self, F> ⓘ
    where Self: Iterator<Item = Result<T, E>> + Sized, F: FnMut(T) -> Option<U>,

    Return an iterator adaptor that filters and transforms every Result::Ok value with the provided closure. Result::Err -values are unchanged. Read more
    source§

    fn flatten_ok<T, E>(self) -> FlattenOk<Self, T, E> ⓘ
    where +values are unchanged. Read more

    source§

    fn flatten_ok<T, E>(self) -> FlattenOk<Self, T, E> ⓘ
    where Self: Iterator<Item = Result<T, E>> + Sized, T: IntoIterator,

    Return an iterator adaptor that flattens every Result::Ok value into -a series of Result::Ok values. Result::Err values are unchanged. Read more
    source§

    fn process_results<F, T, E, R>(self, processor: F) -> Result<R, E>
    where +a series of Result::Ok values. Result::Err values are unchanged. Read more

    source§

    fn process_results<F, T, E, R>(self, processor: F) -> Result<R, E>
    where Self: Iterator<Item = Result<T, E>> + Sized, F: FnOnce(ProcessResults<'_, Self, E>) -> R,

    “Lift” a function of the values of the current iterator so as to process -an iterator of Result values instead. Read more
    source§

    fn merge<J>(self, other: J) -> Merge<Self, J::IntoIter>
    where +an iterator of Result values instead. Read more

    source§

    fn merge<J>(self, other: J) -> Merge<Self, J::IntoIter>
    where Self: Sized, Self::Item: PartialOrd, J: IntoIterator<Item = Self::Item>,

    Return an iterator adaptor that merges the two base iterators in ascending order. If both base iterators are sorted (ascending), the -result is sorted. Read more
    source§

    fn merge_by<J, F>(self, other: J, is_first: F) -> MergeBy<Self, J::IntoIter, F> ⓘ
    where +result is sorted. Read more

    source§

    fn merge_by<J, F>(self, other: J, is_first: F) -> MergeBy<Self, J::IntoIter, F> ⓘ
    where Self: Sized, J: IntoIterator<Item = Self::Item>, F: FnMut(&Self::Item, &Self::Item) -> bool,

    Return an iterator adaptor that merges the two base iterators in order. -This is much like .merge() but allows for a custom ordering. Read more
    source§

    fn merge_join_by<J, F, T>( +This is much like .merge() but allows for a custom ordering. Read more

    source§

    fn merge_join_by<J, F, T>( self, other: J, cmp_fn: F @@ -2575,284 +2576,295 @@ This is much like IntoIterator, F: FnMut(&Self::Item, &J::Item) -> T, Self: Sized,

    Create an iterator that merges items from both this and the specified -iterator in ascending order. Read more
    source§

    fn kmerge(self) -> KMerge<<Self::Item as IntoIterator>::IntoIter>
    where +iterator in ascending order. Read more

    source§

    fn kmerge(self) -> KMerge<<Self::Item as IntoIterator>::IntoIter>
    where Self: Sized, Self::Item: IntoIterator, <Self::Item as IntoIterator>::Item: PartialOrd,

    Return an iterator adaptor that flattens an iterator of iterators by -merging them in ascending order. Read more
    source§

    fn kmerge_by<F>( +merging them in ascending order. Read more

    source§

    fn kmerge_by<F>( self, first: F ) -> KMergeBy<<Self::Item as IntoIterator>::IntoIter, F> ⓘ
    where Self: Sized, Self::Item: IntoIterator, F: FnMut(&<Self::Item as IntoIterator>::Item, &<Self::Item as IntoIterator>::Item) -> bool,

    Return an iterator adaptor that flattens an iterator of iterators by -merging them according to the given closure. Read more
    source§

    fn cartesian_product<J>(self, other: J) -> Product<Self, J::IntoIter> ⓘ
    where +merging them according to the given closure. Read more

    source§

    fn cartesian_product<J>(self, other: J) -> Product<Self, J::IntoIter> ⓘ
    where Self: Sized, Self::Item: Clone, J: IntoIterator, J::IntoIter: Clone,

    Return an iterator adaptor that iterates over the cartesian product of -the element sets of two iterators self and J. Read more
    source§

    fn multi_cartesian_product( +the element sets of two iterators self and J. Read more

    source§

    fn multi_cartesian_product( self ) -> MultiProduct<<Self::Item as IntoIterator>::IntoIter> ⓘ
    where Self: Sized, Self::Item: IntoIterator, <Self::Item as IntoIterator>::IntoIter: Clone, <Self::Item as IntoIterator>::Item: Clone,

    Return an iterator adaptor that iterates over the cartesian product of -all subiterators returned by meta-iterator self. Read more
    source§

    fn coalesce<F>(self, f: F) -> Coalesce<Self, F>
    where +all subiterators returned by meta-iterator self. Read more

    source§

    fn coalesce<F>(self, f: F) -> Coalesce<Self, F>
    where Self: Sized, F: FnMut(Self::Item, Self::Item) -> Result<Self::Item, (Self::Item, Self::Item)>,

    Return an iterator adaptor that uses the passed-in closure to -optionally merge together consecutive elements. Read more
    source§

    fn dedup(self) -> Dedup<Self>
    where +optionally merge together consecutive elements. Read more

    source§

    fn dedup(self) -> Dedup<Self>
    where Self: Sized, Self::Item: PartialEq,

    Remove duplicates from sections of consecutive identical elements. -If the iterator is sorted, all elements will be unique. Read more
    source§

    fn dedup_by<Cmp>(self, cmp: Cmp) -> DedupBy<Self, Cmp>
    where +If the iterator is sorted, all elements will be unique. Read more

    source§

    fn dedup_by<Cmp>(self, cmp: Cmp) -> DedupBy<Self, Cmp>
    where Self: Sized, Cmp: FnMut(&Self::Item, &Self::Item) -> bool,

    Remove duplicates from sections of consecutive identical elements, determining equality using a comparison function. -If the iterator is sorted, all elements will be unique. Read more
    source§

    fn dedup_with_count(self) -> DedupWithCount<Self>
    where +If the iterator is sorted, all elements will be unique. Read more

    source§

    fn dedup_with_count(self) -> DedupWithCount<Self>
    where Self: Sized,

    Remove duplicates from sections of consecutive identical elements, while keeping a count of how many repeated elements were present. -If the iterator is sorted, all elements will be unique. Read more
    source§

    fn dedup_by_with_count<Cmp>(self, cmp: Cmp) -> DedupByWithCount<Self, Cmp>
    where +If the iterator is sorted, all elements will be unique. Read more

    source§

    fn dedup_by_with_count<Cmp>(self, cmp: Cmp) -> DedupByWithCount<Self, Cmp>
    where Self: Sized, Cmp: FnMut(&Self::Item, &Self::Item) -> bool,

    Remove duplicates from sections of consecutive identical elements, while keeping a count of how many repeated elements were present. This will determine equality using a comparison function. -If the iterator is sorted, all elements will be unique. Read more
    source§

    fn duplicates(self) -> Duplicates<Self>
    where +If the iterator is sorted, all elements will be unique. Read more

    source§

    fn duplicates(self) -> Duplicates<Self>
    where Self: Sized, Self::Item: Eq + Hash,

    Return an iterator adaptor that produces elements that appear more than once during the -iteration. Duplicates are detected using hash and equality. Read more
    source§

    fn duplicates_by<V, F>(self, f: F) -> DuplicatesBy<Self, V, F>
    where +iteration. Duplicates are detected using hash and equality. Read more

    source§

    fn duplicates_by<V, F>(self, f: F) -> DuplicatesBy<Self, V, F>
    where Self: Sized, V: Eq + Hash, F: FnMut(&Self::Item) -> V,

    Return an iterator adaptor that produces elements that appear more than once during the -iteration. Duplicates are detected using hash and equality. Read more
    source§

    fn unique(self) -> Unique<Self> ⓘ
    where +iteration. Duplicates are detected using hash and equality. Read more

    source§

    fn unique(self) -> Unique<Self> ⓘ
    where Self: Sized, Self::Item: Clone + Eq + Hash,

    Return an iterator adaptor that filters out elements that have already been produced once during the iteration. Duplicates -are detected using hash and equality. Read more
    source§

    fn unique_by<V, F>(self, f: F) -> UniqueBy<Self, V, F> ⓘ
    where +are detected using hash and equality. Read more

    source§

    fn unique_by<V, F>(self, f: F) -> UniqueBy<Self, V, F> ⓘ
    where Self: Sized, V: Eq + Hash, F: FnMut(&Self::Item) -> V,

    Return an iterator adaptor that filters out elements that have -already been produced once during the iteration. Read more
    source§

    fn peeking_take_while<F>(&mut self, accept: F) -> PeekingTakeWhile<'_, Self, F> ⓘ
    where +already been produced once during the iteration. Read more

    source§

    fn peeking_take_while<F>(&mut self, accept: F) -> PeekingTakeWhile<'_, Self, F> ⓘ
    where Self: Sized + PeekingNext, F: FnMut(&Self::Item) -> bool,

    Return an iterator adaptor that borrows from this iterator and -takes items while the closure accept returns true. Read more
    source§

    fn take_while_ref<F>(&mut self, accept: F) -> TakeWhileRef<'_, Self, F> ⓘ
    where +takes items while the closure accept returns true. Read more

    source§

    fn take_while_ref<F>(&mut self, accept: F) -> TakeWhileRef<'_, Self, F> ⓘ
    where Self: Clone, F: FnMut(&Self::Item) -> bool,

    Return an iterator adaptor that borrows from a Clone-able iterator -to only pick off elements while the predicate accept returns true. Read more
    source§

    fn take_while_inclusive<F>(self, accept: F) -> TakeWhileInclusive<Self, F> ⓘ
    where +to only pick off elements while the predicate accept returns true. Read more

    source§

    fn take_while_inclusive<F>(self, accept: F) -> TakeWhileInclusive<Self, F> ⓘ
    where Self: Sized, F: FnMut(&Self::Item) -> bool,

    Returns an iterator adaptor that consumes elements while the given predicate is true, including the element for which the predicate -first returned false. Read more
    source§

    fn while_some<A>(self) -> WhileSome<Self> ⓘ
    where +first returned false. Read more

    source§

    fn while_some<A>(self) -> WhileSome<Self> ⓘ
    where Self: Sized + Iterator<Item = Option<A>>,

    Return an iterator adaptor that filters Option<A> iterator elements -and produces A. Stops on the first None encountered. Read more
    source§

    fn tuple_combinations<T>(self) -> TupleCombinations<Self, T> ⓘ
    where +and produces A. Stops on the first None encountered. Read more

    source§

    fn tuple_combinations<T>(self) -> TupleCombinations<Self, T> ⓘ
    where Self: Sized + Clone, Self::Item: Clone, T: HasCombination<Self>,

    Return an iterator adaptor that iterates over the combinations of the -elements from an iterator. Read more
    source§

    fn combinations(self, k: usize) -> Combinations<Self> ⓘ
    where +elements from an iterator. Read more

    source§

    fn combinations(self, k: usize) -> Combinations<Self> ⓘ
    where Self: Sized, Self::Item: Clone,

    Return an iterator adaptor that iterates over the k-length combinations of -the elements from an iterator. Read more
    source§

    fn combinations_with_replacement( +the elements from an iterator. Read more

    source§

    fn combinations_with_replacement( self, k: usize ) -> CombinationsWithReplacement<Self> ⓘ
    where Self: Sized, Self::Item: Clone,

    Return an iterator that iterates over the k-length combinations of -the elements from an iterator, with replacement. Read more
    source§

    fn permutations(self, k: usize) -> Permutations<Self> ⓘ
    where +the elements from an iterator, with replacement. Read more

    source§

    fn permutations(self, k: usize) -> Permutations<Self> ⓘ
    where Self: Sized, Self::Item: Clone,

    Return an iterator adaptor that iterates over all k-permutations of the -elements from an iterator. Read more
    source§

    fn powerset(self) -> Powerset<Self> ⓘ
    where +elements from an iterator. Read more

    source§

    fn powerset(self) -> Powerset<Self> ⓘ
    where Self: Sized, Self::Item: Clone,

    Return an iterator that iterates through the powerset of the elements from an -iterator. Read more
    source§

    fn pad_using<F>(self, min: usize, f: F) -> PadUsing<Self, F> ⓘ
    where +iterator. Read more

    source§

    fn pad_using<F>(self, min: usize, f: F) -> PadUsing<Self, F> ⓘ
    where Self: Sized, F: FnMut(usize) -> Self::Item,

    Return an iterator adaptor that pads the sequence to a minimum length of -min by filling missing elements using a closure f. Read more
    source§

    fn with_position(self) -> WithPosition<Self> ⓘ
    where +min by filling missing elements using a closure f. Read more

    source§

    fn with_position(self) -> WithPosition<Self> ⓘ
    where Self: Sized,

    Return an iterator adaptor that combines each element with a Position to -ease special-case handling of the first or last elements. Read more
    source§

    fn positions<P>(self, predicate: P) -> Positions<Self, P> ⓘ
    where +ease special-case handling of the first or last elements. Read more

    source§

    fn positions<P>(self, predicate: P) -> Positions<Self, P> ⓘ
    where Self: Sized, P: FnMut(Self::Item) -> bool,

    Return an iterator adaptor that yields the indices of all elements -satisfying a predicate, counted from the start of the iterator. Read more
    source§

    fn update<F>(self, updater: F) -> Update<Self, F> ⓘ
    where +satisfying a predicate, counted from the start of the iterator. Read more

    source§

    fn update<F>(self, updater: F) -> Update<Self, F> ⓘ
    where Self: Sized, F: FnMut(&mut Self::Item),

    Return an iterator adaptor that applies a mutating function -to each element before yielding it. Read more
    source§

    fn next_tuple<T>(&mut self) -> Option<T>
    where +to each element before yielding it. Read more

    source§

    fn next_tuple<T>(&mut self) -> Option<T>
    where Self: Sized + Iterator<Item = T::Item>, T: HomogeneousTuple,

    Advances the iterator and returns the next items grouped in a tuple of -a specific size (up to 12). Read more
    source§

    fn collect_tuple<T>(self) -> Option<T>
    where +a specific size (up to 12). Read more

    source§

    fn collect_tuple<T>(self) -> Option<T>
    where Self: Sized + Iterator<Item = T::Item>, T: HomogeneousTuple,

    Collects all items from the iterator into a tuple of a specific size -(up to 12). Read more
    source§

    fn find_position<P>(&mut self, pred: P) -> Option<(usize, Self::Item)>
    where - P: FnMut(&Self::Item) -> bool,

    Find the position and value of the first element satisfying a predicate. Read more
    source§

    fn find_or_last<P>(self, predicate: P) -> Option<Self::Item>
    where +(up to 12). Read more

    source§

    fn find_position<P>(&mut self, pred: P) -> Option<(usize, Self::Item)>
    where + P: FnMut(&Self::Item) -> bool,

    Find the position and value of the first element satisfying a predicate. Read more
    source§

    fn find_or_last<P>(self, predicate: P) -> Option<Self::Item>
    where Self: Sized, - P: FnMut(&Self::Item) -> bool,

    Find the value of the first element satisfying a predicate or return the last element, if any. Read more
    source§

    fn find_or_first<P>(self, predicate: P) -> Option<Self::Item>
    where + P: FnMut(&Self::Item) -> bool,

    Find the value of the first element satisfying a predicate or return the last element, if any. Read more
    source§

    fn find_or_first<P>(self, predicate: P) -> Option<Self::Item>
    where Self: Sized, - P: FnMut(&Self::Item) -> bool,

    Find the value of the first element satisfying a predicate or return the first element, if any. Read more
    source§

    fn contains<Q>(&mut self, query: &Q) -> bool
    where + P: FnMut(&Self::Item) -> bool,

    Find the value of the first element satisfying a predicate or return the first element, if any. Read more
    source§

    fn contains<Q>(&mut self, query: &Q) -> bool
    where Self: Sized, Self::Item: Borrow<Q>, - Q: PartialEq,

    Returns true if the given item is present in this iterator. Read more
    source§

    fn all_equal(&mut self) -> bool
    where + Q: PartialEq,

    Returns true if the given item is present in this iterator. Read more
    source§

    fn all_equal(&mut self) -> bool
    where Self: Sized, - Self::Item: PartialEq,

    Check whether all elements compare equal. Read more
    source§

    fn all_equal_value( + Self::Item: PartialEq,

    Check whether all elements compare equal. Read more
    source§

    fn all_equal_value( &mut self ) -> Result<Self::Item, Option<(Self::Item, Self::Item)>>
    where Self: Sized, Self::Item: PartialEq,

    If there are elements and they are all equal, return a single copy of that element. If there are no elements, return an Error containing None. If there are elements and they are not all equal, return a tuple containing the first -two non-equal elements found. Read more
    source§

    fn all_unique(&mut self) -> bool
    where +two non-equal elements found. Read more

    source§

    fn all_unique(&mut self) -> bool
    where Self: Sized, - Self::Item: Eq + Hash,

    Check whether all elements are unique (non equal). Read more
    source§

    fn dropping(self, n: usize) -> Self
    where + Self::Item: Eq + Hash,

    Check whether all elements are unique (non equal). Read more
    source§

    fn dropping(self, n: usize) -> Self
    where Self: Sized,

    Consume the first n elements from the iterator eagerly, -and return the same iterator again. Read more
    source§

    fn dropping_back(self, n: usize) -> Self
    where +and return the same iterator again. Read more

    source§

    fn dropping_back(self, n: usize) -> Self
    where Self: Sized + DoubleEndedIterator,

    Consume the last n elements from the iterator eagerly, -and return the same iterator again. Read more
    source§

    fn foreach<F>(self, f: F)
    where - F: FnMut(Self::Item), - Self: Sized,

    👎Deprecated since 0.8.0: Use .for_each() instead
    Run the closure f eagerly on each element of the iterator. Read more
    source§

    fn concat(self) -> Self::Item
    where +and return the same iterator again. Read more

    source§

    fn concat(self) -> Self::Item
    where Self: Sized, - Self::Item: Extend<<<Self as Iterator>::Item as IntoIterator>::Item> + IntoIterator + Default,

    Combine all an iterator’s elements into one element by using Extend. Read more
    source§

    fn collect_vec(self) -> Vec<Self::Item>
    where + Self::Item: Extend<<<Self as Iterator>::Item as IntoIterator>::Item> + IntoIterator + Default,

    Combine all an iterator’s elements into one element by using Extend. Read more
    source§

    fn collect_vec(self) -> Vec<Self::Item>
    where Self: Sized,

    .collect_vec() is simply a type specialization of Iterator::collect, -for convenience.
    source§

    fn try_collect<T, U, E>(self) -> Result<U, E>
    where +for convenience.

    source§

    fn try_collect<T, U, E>(self) -> Result<U, E>
    where Self: Sized + Iterator<Item = Result<T, E>>, Result<U, E>: FromIterator<Result<T, E>>,

    .try_collect() is more convenient way of writing -.collect::<Result<_, _>>() Read more
    source§

    fn set_from<'a, A: 'a, J>(&mut self, from: J) -> usize
    where +.collect::<Result<_, _>>() Read more

    source§

    fn set_from<'a, A: 'a, J>(&mut self, from: J) -> usize
    where Self: Iterator<Item = &'a mut A>, J: IntoIterator<Item = A>,

    Assign to each reference in self from the from iterator, -stopping at the shortest of the two iterators. Read more
    source§

    fn join(&mut self, sep: &str) -> String
    where - Self::Item: Display,

    Combine all iterator elements into one String, separated by sep. Read more
    source§

    fn format(self, sep: &str) -> Format<'_, Self>
    where - Self: Sized,

    Format all iterator elements, separated by sep. Read more
    source§

    fn format_with<F>(self, sep: &str, format: F) -> FormatWith<'_, Self, F>
    where +stopping at the shortest of the two iterators. Read more

    source§

    fn join(&mut self, sep: &str) -> String
    where + Self::Item: Display,

    Combine all iterator elements into one String, separated by sep. Read more
    source§

    fn format(self, sep: &str) -> Format<'_, Self>
    where + Self: Sized,

    Format all iterator elements, separated by sep. Read more
    source§

    fn format_with<F>(self, sep: &str, format: F) -> FormatWith<'_, Self, F>
    where Self: Sized, - F: FnMut(Self::Item, &mut dyn FnMut(&dyn Display) -> Result) -> Result,

    Format all iterator elements, separated by sep. Read more
    source§

    fn fold_results<A, E, B, F>(&mut self, start: B, f: F) -> Result<B, E>
    where + F: FnMut(Self::Item, &mut dyn FnMut(&dyn Display) -> Result) -> Result,

    Format all iterator elements, separated by sep. Read more
    source§

    fn fold_ok<A, E, B, F>(&mut self, start: B, f: F) -> Result<B, E>
    where Self: Iterator<Item = Result<A, E>>, - F: FnMut(B, A) -> B,

    👎Deprecated since 0.10.0: Use .fold_ok() instead
    See .fold_ok().
    source§

    fn fold_ok<A, E, B, F>(&mut self, start: B, f: F) -> Result<B, E>
    where - Self: Iterator<Item = Result<A, E>>, - F: FnMut(B, A) -> B,

    Fold Result values from an iterator. Read more
    source§

    fn fold_options<A, B, F>(&mut self, start: B, f: F) -> Option<B>
    where + F: FnMut(B, A) -> B,

    Fold Result values from an iterator. Read more
    source§

    fn fold_options<A, B, F>(&mut self, start: B, f: F) -> Option<B>
    where Self: Iterator<Item = Option<A>>, - F: FnMut(B, A) -> B,

    Fold Option values from an iterator. Read more
    source§

    fn fold1<F>(self, f: F) -> Option<Self::Item>
    where + F: FnMut(B, A) -> B,

    Fold Option values from an iterator. Read more
    source§

    fn fold1<F>(self, f: F) -> Option<Self::Item>
    where F: FnMut(Self::Item, Self::Item) -> Self::Item, - Self: Sized,

    👎Deprecated since 0.10.2: Use Iterator::reduce instead
    Accumulator of the elements in the iterator. Read more
    source§

    fn tree_fold1<F>(self, f: F) -> Option<Self::Item>
    where + Self: Sized,

    👎Deprecated since 0.10.2: Use Iterator::reduce instead
    Accumulator of the elements in the iterator. Read more
    source§

    fn tree_reduce<F>(self, f: F) -> Option<Self::Item>
    where F: FnMut(Self::Item, Self::Item) -> Self::Item, - Self: Sized,

    Accumulate the elements in the iterator in a tree-like manner. Read more
    source§

    fn fold_while<B, F>(&mut self, init: B, f: F) -> FoldWhile<B>
    where + Self: Sized,

    Accumulate the elements in the iterator in a tree-like manner. Read more
    source§

    fn tree_fold1<F>(self, f: F) -> Option<Self::Item>
    where + F: FnMut(Self::Item, Self::Item) -> Self::Item, + Self: Sized,

    👎Deprecated since 0.13.0: Use .tree_reduce() instead
    See .tree_reduce().
    source§

    fn fold_while<B, F>(&mut self, init: B, f: F) -> FoldWhile<B>
    where Self: Sized, - F: FnMut(B, Self::Item) -> FoldWhile<B>,

    An iterator method that applies a function, producing a single, final value. Read more
    source§

    fn sum1<S>(self) -> Option<S>
    where + F: FnMut(B, Self::Item) -> FoldWhile<B>,

    An iterator method that applies a function, producing a single, final value. Read more
    source§

    fn sum1<S>(self) -> Option<S>
    where Self: Sized, - S: Sum<Self::Item>,

    Iterate over the entire iterator and add all the elements. Read more
    source§

    fn product1<P>(self) -> Option<P>
    where + S: Sum<Self::Item>,

    Iterate over the entire iterator and add all the elements. Read more
    source§

    fn product1<P>(self) -> Option<P>
    where Self: Sized, - P: Product<Self::Item>,

    Iterate over the entire iterator and multiply all the elements. Read more
    source§

    fn sorted_unstable(self) -> IntoIter<Self::Item> ⓘ
    where + P: Product<Self::Item>,

    Iterate over the entire iterator and multiply all the elements. Read more
    source§

    fn sorted_unstable(self) -> IntoIter<Self::Item> ⓘ
    where Self: Sized, - Self::Item: Ord,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_unstable_by<F>(self, cmp: F) -> IntoIter<Self::Item> ⓘ
    where + Self::Item: Ord,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_unstable_by<F>(self, cmp: F) -> IntoIter<Self::Item> ⓘ
    where Self: Sized, - F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_unstable_by_key<K, F>(self, f: F) -> IntoIter<Self::Item> ⓘ
    where + F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_unstable_by_key<K, F>(self, f: F) -> IntoIter<Self::Item> ⓘ
    where Self: Sized, K: Ord, - F: FnMut(&Self::Item) -> K,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted(self) -> IntoIter<Self::Item> ⓘ
    where + F: FnMut(&Self::Item) -> K,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted(self) -> IntoIter<Self::Item> ⓘ
    where Self: Sized, - Self::Item: Ord,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_by<F>(self, cmp: F) -> IntoIter<Self::Item> ⓘ
    where + Self::Item: Ord,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_by<F>(self, cmp: F) -> IntoIter<Self::Item> ⓘ
    where Self: Sized, - F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_by_key<K, F>(self, f: F) -> IntoIter<Self::Item> ⓘ
    where + F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_by_key<K, F>(self, f: F) -> IntoIter<Self::Item> ⓘ
    where Self: Sized, K: Ord, - F: FnMut(&Self::Item) -> K,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_by_cached_key<K, F>(self, f: F) -> IntoIter<Self::Item> ⓘ
    where + F: FnMut(&Self::Item) -> K,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_by_cached_key<K, F>(self, f: F) -> IntoIter<Self::Item> ⓘ
    where Self: Sized, K: Ord, F: FnMut(&Self::Item) -> K,

    Sort all iterator elements into a new iterator in ascending order. The key function is -called exactly once per key. Read more
    source§

    fn k_smallest(self, k: usize) -> IntoIter<Self::Item> ⓘ
    where +called exactly once per key. Read more

    source§

    fn k_smallest(self, k: usize) -> IntoIter<Self::Item> ⓘ
    where Self: Sized, - Self::Item: Ord,

    Sort the k smallest elements into a new iterator, in ascending order. Read more
    source§

    fn partition_map<A, B, F, L, R>(self, predicate: F) -> (A, B)
    where + Self::Item: Ord,

    Sort the k smallest elements into a new iterator, in ascending order. Read more
    source§

    fn k_smallest_by<F>(self, k: usize, cmp: F) -> IntoIter<Self::Item> ⓘ
    where + Self: Sized, + F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Sort the k smallest elements into a new iterator using the provided comparison. Read more
    source§

    fn k_smallest_by_key<F, K>(self, k: usize, key: F) -> IntoIter<Self::Item> ⓘ
    where + Self: Sized, + F: FnMut(&Self::Item) -> K, + K: Ord,

    Return the elements producing the k smallest outputs of the provided function. Read more
    source§

    fn k_largest(self, k: usize) -> IntoIter<Self::Item> ⓘ
    where + Self: Sized, + Self::Item: Ord,

    Sort the k largest elements into a new iterator, in descending order. Read more
    source§

    fn k_largest_by<F>(self, k: usize, cmp: F) -> IntoIter<Self::Item> ⓘ
    where + Self: Sized, + F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Sort the k largest elements into a new iterator using the provided comparison. Read more
    source§

    fn k_largest_by_key<F, K>(self, k: usize, key: F) -> IntoIter<Self::Item> ⓘ
    where + Self: Sized, + F: FnMut(&Self::Item) -> K, + K: Ord,

    Return the elements producing the k largest outputs of the provided function. Read more
    source§

    fn tail(self, n: usize) -> IntoIter<Self::Item> ⓘ
    where + Self: Sized,

    Consumes the iterator and return an iterator of the last n elements. Read more
    source§

    fn partition_map<A, B, F, L, R>(self, predicate: F) -> (A, B)
    where Self: Sized, F: FnMut(Self::Item) -> Either<L, R>, A: Default + Extend<L>, B: Default + Extend<R>,

    Collect all iterator elements into one of two partitions. Unlike Iterator::partition, each partition may -have a distinct type. Read more
    source§

    fn partition_result<A, B, T, E>(self) -> (A, B)
    where +have a distinct type. Read more

    source§

    fn partition_result<A, B, T, E>(self) -> (A, B)
    where Self: Iterator<Item = Result<T, E>> + Sized, A: Default + Extend<T>, B: Default + Extend<E>,

    Partition a sequence of Results into one list of all the Ok elements -and another list of all the Err elements. Read more
    source§

    fn into_group_map<K, V>(self) -> HashMap<K, Vec<V>>
    where +and another list of all the Err elements. Read more

    source§

    fn into_group_map<K, V>(self) -> HashMap<K, Vec<V>>
    where Self: Iterator<Item = (K, V)> + Sized, K: Hash + Eq,

    Return a HashMap of keys mapped to Vecs of values. Keys and values -are taken from (Key, Value) tuple pairs yielded by the input iterator. Read more
    source§

    fn into_group_map_by<K, V, F>(self, f: F) -> HashMap<K, Vec<V>>
    where +are taken from (Key, Value) tuple pairs yielded by the input iterator. Read more

    source§

    fn into_group_map_by<K, V, F>(self, f: F) -> HashMap<K, Vec<V>>
    where Self: Iterator<Item = V> + Sized, K: Hash + Eq, - F: Fn(&V) -> K,

    Return an Iterator on a HashMap. Keys mapped to Vecs of values. The key is specified -in the closure. Read more
    source§

    fn into_grouping_map<K, V>(self) -> GroupingMap<Self>
    where + F: FnMut(&V) -> K,

    Return an Iterator on a HashMap. Keys mapped to Vecs of values. The key is specified +in the closure. Read more
    source§

    fn into_grouping_map<K, V>(self) -> GroupingMap<Self>
    where Self: Iterator<Item = (K, V)> + Sized, K: Hash + Eq,

    Constructs a GroupingMap to be used later with one of the efficient -group-and-fold operations it allows to perform. Read more
    source§

    fn into_grouping_map_by<K, V, F>(self, key_mapper: F) -> GroupingMapBy<Self, F>
    where +group-and-fold operations it allows to perform. Read more

    source§

    fn into_grouping_map_by<K, V, F>(self, key_mapper: F) -> GroupingMapBy<Self, F>
    where Self: Iterator<Item = V> + Sized, K: Hash + Eq, F: FnMut(&V) -> K,

    Constructs a GroupingMap to be used later with one of the efficient -group-and-fold operations it allows to perform. Read more
    source§

    fn min_set(self) -> Vec<Self::Item>
    where +group-and-fold operations it allows to perform. Read more

    source§

    fn min_set(self) -> Vec<Self::Item>
    where Self: Sized, - Self::Item: Ord,

    Return all minimum elements of an iterator. Read more
    source§

    fn min_set_by<F>(self, compare: F) -> Vec<Self::Item>
    where + Self::Item: Ord,

    Return all minimum elements of an iterator. Read more
    source§

    fn min_set_by<F>(self, compare: F) -> Vec<Self::Item>
    where Self: Sized, F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Return all minimum elements of an iterator, as determined by -the specified function. Read more
    source§

    fn min_set_by_key<K, F>(self, key: F) -> Vec<Self::Item>
    where +the specified function. Read more

    source§

    fn min_set_by_key<K, F>(self, key: F) -> Vec<Self::Item>
    where Self: Sized, K: Ord, F: FnMut(&Self::Item) -> K,

    Return all minimum elements of an iterator, as determined by -the specified function. Read more
    source§

    fn max_set(self) -> Vec<Self::Item>
    where +the specified function. Read more

    source§

    fn max_set(self) -> Vec<Self::Item>
    where Self: Sized, - Self::Item: Ord,

    Return all maximum elements of an iterator. Read more
    source§

    fn max_set_by<F>(self, compare: F) -> Vec<Self::Item>
    where + Self::Item: Ord,

    Return all maximum elements of an iterator. Read more
    source§

    fn max_set_by<F>(self, compare: F) -> Vec<Self::Item>
    where Self: Sized, F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Return all maximum elements of an iterator, as determined by -the specified function. Read more
    source§

    fn max_set_by_key<K, F>(self, key: F) -> Vec<Self::Item>
    where +the specified function. Read more

    source§

    fn max_set_by_key<K, F>(self, key: F) -> Vec<Self::Item>
    where Self: Sized, K: Ord, F: FnMut(&Self::Item) -> K,

    Return all maximum elements of an iterator, as determined by -the specified function. Read more
    source§

    fn minmax(self) -> MinMaxResult<Self::Item>
    where +the specified function. Read more

    source§

    fn minmax(self) -> MinMaxResult<Self::Item>
    where Self: Sized, - Self::Item: PartialOrd,

    Return the minimum and maximum elements in the iterator. Read more
    source§

    fn minmax_by_key<K, F>(self, key: F) -> MinMaxResult<Self::Item>
    where + Self::Item: PartialOrd,

    Return the minimum and maximum elements in the iterator. Read more
    source§

    fn minmax_by_key<K, F>(self, key: F) -> MinMaxResult<Self::Item>
    where Self: Sized, K: PartialOrd, F: FnMut(&Self::Item) -> K,

    Return the minimum and maximum element of an iterator, as determined by -the specified function. Read more
    source§

    fn minmax_by<F>(self, compare: F) -> MinMaxResult<Self::Item>
    where +the specified function. Read more

    source§

    fn minmax_by<F>(self, compare: F) -> MinMaxResult<Self::Item>
    where Self: Sized, F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Return the minimum and maximum element of an iterator, as determined by -the specified comparison function. Read more
    source§

    fn position_max(self) -> Option<usize>
    where +the specified comparison function. Read more

    source§

    fn position_max(self) -> Option<usize>
    where Self: Sized, - Self::Item: Ord,

    Return the position of the maximum element in the iterator. Read more
    source§

    fn position_max_by_key<K, F>(self, key: F) -> Option<usize>
    where + Self::Item: Ord,

    Return the position of the maximum element in the iterator. Read more
    source§

    fn position_max_by_key<K, F>(self, key: F) -> Option<usize>
    where Self: Sized, K: Ord, F: FnMut(&Self::Item) -> K,

    Return the position of the maximum element in the iterator, as -determined by the specified function. Read more
    source§

    fn position_max_by<F>(self, compare: F) -> Option<usize>
    where +determined by the specified function. Read more

    source§

    fn position_max_by<F>(self, compare: F) -> Option<usize>
    where Self: Sized, F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Return the position of the maximum element in the iterator, as -determined by the specified comparison function. Read more
    source§

    fn position_min(self) -> Option<usize>
    where +determined by the specified comparison function. Read more

    source§

    fn position_min(self) -> Option<usize>
    where Self: Sized, - Self::Item: Ord,

    Return the position of the minimum element in the iterator. Read more
    source§

    fn position_min_by_key<K, F>(self, key: F) -> Option<usize>
    where + Self::Item: Ord,

    Return the position of the minimum element in the iterator. Read more
    source§

    fn position_min_by_key<K, F>(self, key: F) -> Option<usize>
    where Self: Sized, K: Ord, F: FnMut(&Self::Item) -> K,

    Return the position of the minimum element in the iterator, as -determined by the specified function. Read more
    source§

    fn position_min_by<F>(self, compare: F) -> Option<usize>
    where +determined by the specified function. Read more

    source§

    fn position_min_by<F>(self, compare: F) -> Option<usize>
    where Self: Sized, F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Return the position of the minimum element in the iterator, as -determined by the specified comparison function. Read more
    source§

    fn position_minmax(self) -> MinMaxResult<usize>
    where +determined by the specified comparison function. Read more

    source§

    fn position_minmax(self) -> MinMaxResult<usize>
    where Self: Sized, Self::Item: PartialOrd,

    Return the positions of the minimum and maximum elements in -the iterator. Read more
    source§

    fn position_minmax_by_key<K, F>(self, key: F) -> MinMaxResult<usize>
    where +the iterator. Read more

    source§

    fn position_minmax_by_key<K, F>(self, key: F) -> MinMaxResult<usize>
    where Self: Sized, K: PartialOrd, F: FnMut(&Self::Item) -> K,

    Return the postions of the minimum and maximum elements of an -iterator, as determined by the specified function. Read more
    source§

    fn position_minmax_by<F>(self, compare: F) -> MinMaxResult<usize>
    where +iterator, as determined by the specified function. Read more

    source§

    fn position_minmax_by<F>(self, compare: F) -> MinMaxResult<usize>
    where Self: Sized, F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Return the postions of the minimum and maximum elements of an -iterator, as determined by the specified comparison function. Read more
    source§

    fn exactly_one(self) -> Result<Self::Item, ExactlyOneError<Self>>
    where +iterator, as determined by the specified comparison function. Read more

    source§

    fn exactly_one(self) -> Result<Self::Item, ExactlyOneError<Self>>
    where Self: Sized,

    If the iterator yields exactly one element, that element will be returned, otherwise an error will be returned containing an iterator that has the same output as the input -iterator. Read more
    source§

    fn at_most_one(self) -> Result<Option<Self::Item>, ExactlyOneError<Self>>
    where - Self: Sized,

    If the iterator yields no elements, Ok(None) will be returned. If the iterator yields +iterator. Read more
    source§

    fn at_most_one(self) -> Result<Option<Self::Item>, ExactlyOneError<Self>>
    where + Self: Sized,

    If the iterator yields no elements, Ok(None) will be returned. If the iterator yields exactly one element, that element will be returned, otherwise an error will be returned -containing an iterator that has the same output as the input iterator. Read more
    source§

    fn multipeek(self) -> MultiPeek<Self> ⓘ
    where +containing an iterator that has the same output as the input iterator. Read more

    source§

    fn multipeek(self) -> MultiPeek<Self> ⓘ
    where Self: Sized,

    An iterator adaptor that allows the user to peek at multiple .next() -values without advancing the base iterator. Read more
    source§

    fn counts(self) -> HashMap<Self::Item, usize>
    where +values without advancing the base iterator. Read more

    source§

    fn counts(self) -> HashMap<Self::Item, usize>
    where Self: Sized, Self::Item: Eq + Hash,

    Collect the items in this iterator and return a HashMap which contains each item that appears in the iterator and the number -of times it appears. Read more
    source§

    fn counts_by<K, F>(self, f: F) -> HashMap<K, usize>
    where +of times it appears. Read more

    source§

    fn counts_by<K, F>(self, f: F) -> HashMap<K, usize>
    where Self: Sized, K: Eq + Hash, F: FnMut(Self::Item) -> K,

    Collect the items in this iterator and return a HashMap which contains each item that appears in the iterator and the number of times it appears, -determining identity using a keying function. Read more
    source§

    fn multiunzip<FromI>(self) -> FromI
    where - Self: Sized + MultiUnzip<FromI>,

    Converts an iterator of tuples into a tuple of containers. Read more
    source§

    fn try_len(&self) -> Result<usize, (usize, Option<usize>)>

    Returns the length of the iterator if one exists. +determining identity using a keying function. Read more
    source§

    fn multiunzip<FromI>(self) -> FromI
    where + Self: Sized + MultiUnzip<FromI>,

    Converts an iterator of tuples into a tuple of containers. Read more
    source§

    fn try_len(&self) -> Result<usize, (usize, Option<usize>)>

    Returns the length of the iterator if one exists. Otherwise return self.size_hint(). Read more
    source§

    impl<IT> MultiUnzip<()> for IT
    where IT: Iterator<Item = ()>,

    source§

    fn multiunzip(self)

    Unzip this iterator into multiple collections.
    source§

    impl<IT, A, FromA> MultiUnzip<(FromA,)> for IT
    where IT: Iterator<Item = (A,)>, @@ -2955,4 +2967,4 @@ Otherwise return self.size_hint(). (FromA, FromB, FromC, FromD, FromE, FromF, FromG, FromH, FromI, FromJ, FromK, FromL)

    Unzip this iterator into multiple collections.
    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 + 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/itertools/structs/struct.ZipEq.html b/itertools/structs/struct.ZipEq.html index 7a0034a99..30ada8b44 100644 --- a/itertools/structs/struct.ZipEq.html +++ b/itertools/structs/struct.ZipEq.html @@ -1,11 +1,12 @@ -ZipEq in itertools::structs - Rust
    -

    Struct itertools::structs::ZipEq

    source · 
    pub struct ZipEq<I, J> { /* private fields */ }
    Expand description

    An iterator which iterates two other iterators simultaneously

    +ZipEq in itertools::structs - Rust
    +

    Struct itertools::structs::ZipEq

    source · 
    pub struct ZipEq<I, J> { /* private fields */ }
    Expand description

    An iterator which iterates two other iterators simultaneously +and panic if they have different lengths.

    See .zip_eq() for more information.

    -

    Trait Implementations§

    source§

    impl<I: Clone, J: Clone> Clone for ZipEq<I, J>

    source§

    fn clone(&self) -> ZipEq<I, J> ⓘ

    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<I: Debug, J: Debug> Debug for ZipEq<I, J>

    source§

    fn fmt(&self, f: &mut Formatter<'_>) -> Result

    Formats the value using the given formatter. Read more
    source§

    impl<I, J> ExactSizeIterator for ZipEq<I, J>
    where +

    Trait Implementations§

    source§

    impl<I: Clone, J: Clone> Clone for ZipEq<I, J>

    source§

    fn clone(&self) -> ZipEq<I, J> ⓘ

    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<I: Debug, J: Debug> Debug for ZipEq<I, J>

    source§

    fn fmt(&self, f: &mut Formatter<'_>) -> Result

    Formats the value using the given formatter. Read more
    source§

    impl<I, J> ExactSizeIterator for ZipEq<I, J>
    where I: ExactSizeIterator, - J: ExactSizeIterator,

    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<I, J> Iterator for ZipEq<I, J>
    where + J: ExactSizeIterator,

    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<I, J> Iterator for ZipEq<I, J>
    where I: Iterator, - J: Iterator,

    §

    type Item = (<I as Iterator>::Item, <J as Iterator>::Item)

    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>( + J: Iterator,

    §

    type Item = (<I as Iterator>::Item, <J as Iterator>::Item)

    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 @@ -210,86 +211,87 @@ otherwise. Right variant of Either<Self, Self> otherwise. Read more

    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> Itertools for T
    where - T: Iterator + ?Sized,

    source§

    fn interleave<J>(self, other: J) -> Interleave<Self, J::IntoIter> ⓘ
    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> Itertools for T
    where + T: Iterator + ?Sized,

    source§

    fn interleave<J>(self, other: J) -> Interleave<Self, J::IntoIter> ⓘ
    where J: IntoIterator<Item = Self::Item>, - Self: Sized,

    Alternate elements from two iterators until both have run out. Read more
    source§

    fn interleave_shortest<J>( + Self: Sized,

    Alternate elements from two iterators until both have run out. Read more
    source§

    fn interleave_shortest<J>( self, other: J ) -> InterleaveShortest<Self, J::IntoIter> ⓘ
    where J: IntoIterator<Item = Self::Item>, Self: Sized,

    Alternate elements from two iterators until at least one of them has run -out. Read more
    source§

    fn intersperse(self, element: Self::Item) -> Intersperse<Self>
    where +out. Read more

    source§

    fn intersperse(self, element: Self::Item) -> Intersperse<Self>
    where Self: Sized, Self::Item: Clone,

    An iterator adaptor to insert a particular value -between each element of the adapted iterator. Read more
    source§

    fn intersperse_with<F>(self, element: F) -> IntersperseWith<Self, F> ⓘ
    where +between each element of the adapted iterator. Read more

    source§

    fn intersperse_with<F>(self, element: F) -> IntersperseWith<Self, F> ⓘ
    where Self: Sized, F: FnMut() -> Self::Item,

    An iterator adaptor to insert a particular value created by a function -between each element of the adapted iterator. Read more
    source§

    fn zip_longest<J>(self, other: J) -> ZipLongest<Self, J::IntoIter> ⓘ
    where +between each element of the adapted iterator. Read more

    source§

    fn get<R>(self, index: R) -> R::Output
    where + Self: Sized, + R: IteratorIndex<Self>,

    Returns an iterator over a subsection of the iterator. Read more
    source§

    fn zip_longest<J>(self, other: J) -> ZipLongest<Self, J::IntoIter> ⓘ
    where J: IntoIterator, Self: Sized,

    Create an iterator which iterates over both this and the specified -iterator simultaneously, yielding pairs of two optional elements. Read more
    source§

    fn zip_eq<J>(self, other: J) -> ZipEq<Self, J::IntoIter> ⓘ
    where +iterator simultaneously, yielding pairs of two optional elements. Read more

    source§

    fn zip_eq<J>(self, other: J) -> ZipEq<Self, J::IntoIter> ⓘ
    where J: IntoIterator, Self: Sized,

    Create an iterator which iterates over both this and the specified -iterator simultaneously, yielding pairs of elements. Read more
    source§

    fn batching<B, F>(self, f: F) -> Batching<Self, F> ⓘ
    where +iterator simultaneously, yielding pairs of elements. Read more

    source§

    fn batching<B, F>(self, f: F) -> Batching<Self, F> ⓘ
    where F: FnMut(&mut Self) -> Option<B>, Self: Sized,

    A “meta iterator adaptor”. Its closure receives a reference to the iterator and may pick off as many elements as it likes, to produce the -next iterator element. Read more
    source§

    fn group_by<K, F>(self, key: F) -> GroupBy<K, Self, F>
    where +next iterator element. Read more

    source§

    fn chunk_by<K, F>(self, key: F) -> ChunkBy<K, Self, F>
    where Self: Sized, F: FnMut(&Self::Item) -> K, K: PartialEq,

    Return an iterable that can group iterator elements. Consecutive elements that map to the same key (“runs”), are assigned -to the same group. Read more
    source§

    fn chunks(self, size: usize) -> IntoChunks<Self>
    where - Self: Sized,

    Return an iterable that can chunk the iterator. Read more
    source§

    fn tuple_windows<T>(self) -> TupleWindows<Self, T> ⓘ
    where +to the same group. Read more

    source§

    fn group_by<K, F>(self, key: F) -> ChunkBy<K, Self, F>
    where + Self: Sized, + F: FnMut(&Self::Item) -> K, + K: PartialEq,

    👎Deprecated since 0.13.0: Use .chunk_by() instead
    See .chunk_by().
    source§

    fn chunks(self, size: usize) -> IntoChunks<Self>
    where + Self: Sized,

    Return an iterable that can chunk the iterator. Read more
    source§

    fn tuple_windows<T>(self) -> TupleWindows<Self, T> ⓘ
    where Self: Sized + Iterator<Item = T::Item>, T: HomogeneousTuple, T::Item: Clone,

    Return an iterator over all contiguous windows producing tuples of -a specific size (up to 12). Read more
    source§

    fn circular_tuple_windows<T>(self) -> CircularTupleWindows<Self, T> ⓘ
    where +a specific size (up to 12). Read more

    source§

    fn circular_tuple_windows<T>(self) -> CircularTupleWindows<Self, T> ⓘ
    where Self: Sized + Clone + Iterator<Item = T::Item> + ExactSizeIterator, T: TupleCollect + Clone, T::Item: Clone,

    Return an iterator over all windows, wrapping back to the first elements when the window would otherwise exceed the length of the -iterator, producing tuples of a specific size (up to 12). Read more
    source§

    fn tuples<T>(self) -> Tuples<Self, T> ⓘ
    where +iterator, producing tuples of a specific size (up to 12). Read more

    source§

    fn tuples<T>(self) -> Tuples<Self, T> ⓘ
    where Self: Sized + Iterator<Item = T::Item>, T: HomogeneousTuple,

    Return an iterator that groups the items in tuples of a specific size -(up to 12). Read more
    source§

    fn tee(self) -> (Tee<Self>, Tee<Self>)
    where +(up to 12). Read more

    source§

    fn tee(self) -> (Tee<Self>, Tee<Self>)
    where Self: Sized, Self::Item: Clone,

    Split into an iterator pair that both yield all elements from -the original iterator. Read more
    source§

    fn step(self, n: usize) -> Step<Self> ⓘ
    where - Self: Sized,

    👎Deprecated since 0.8.0: Use std .step_by() instead
    Return an iterator adaptor that steps n elements in the base iterator -for each iteration. Read more
    source§

    fn map_into<R>(self) -> MapInto<Self, R>
    where +the original iterator. Read more

    source§

    fn map_into<R>(self) -> MapInto<Self, R>
    where Self: Sized, - Self::Item: Into<R>,

    Convert each item of the iterator using the Into trait. Read more
    source§

    fn map_results<F, T, U, E>(self, f: F) -> MapOk<Self, F>
    where - Self: Iterator<Item = Result<T, E>> + Sized, - F: FnMut(T) -> U,

    👎Deprecated since 0.10.0: Use .map_ok() instead
    See .map_ok().
    source§

    fn map_ok<F, T, U, E>(self, f: F) -> MapOk<Self, F>
    where + Self::Item: Into<R>,

    Convert each item of the iterator using the Into trait. Read more
    source§

    fn map_ok<F, T, U, E>(self, f: F) -> MapOk<Self, F>
    where Self: Iterator<Item = Result<T, E>> + Sized, F: FnMut(T) -> U,

    Return an iterator adaptor that applies the provided closure to every Result::Ok value. Result::Err values are -unchanged. Read more
    source§

    fn filter_ok<F, T, E>(self, f: F) -> FilterOk<Self, F> ⓘ
    where +unchanged. Read more

    source§

    fn filter_ok<F, T, E>(self, f: F) -> FilterOk<Self, F> ⓘ
    where Self: Iterator<Item = Result<T, E>> + Sized, F: FnMut(&T) -> bool,

    Return an iterator adaptor that filters every Result::Ok value with the provided closure. Result::Err values are -unchanged. Read more
    source§

    fn filter_map_ok<F, T, U, E>(self, f: F) -> FilterMapOk<Self, F> ⓘ
    where +unchanged. Read more

    source§

    fn filter_map_ok<F, T, U, E>(self, f: F) -> FilterMapOk<Self, F> ⓘ
    where Self: Iterator<Item = Result<T, E>> + Sized, F: FnMut(T) -> Option<U>,

    Return an iterator adaptor that filters and transforms every Result::Ok value with the provided closure. Result::Err -values are unchanged. Read more
    source§

    fn flatten_ok<T, E>(self) -> FlattenOk<Self, T, E> ⓘ
    where +values are unchanged. Read more

    source§

    fn flatten_ok<T, E>(self) -> FlattenOk<Self, T, E> ⓘ
    where Self: Iterator<Item = Result<T, E>> + Sized, T: IntoIterator,

    Return an iterator adaptor that flattens every Result::Ok value into -a series of Result::Ok values. Result::Err values are unchanged. Read more
    source§

    fn process_results<F, T, E, R>(self, processor: F) -> Result<R, E>
    where +a series of Result::Ok values. Result::Err values are unchanged. Read more

    source§

    fn process_results<F, T, E, R>(self, processor: F) -> Result<R, E>
    where Self: Iterator<Item = Result<T, E>> + Sized, F: FnOnce(ProcessResults<'_, Self, E>) -> R,

    “Lift” a function of the values of the current iterator so as to process -an iterator of Result values instead. Read more
    source§

    fn merge<J>(self, other: J) -> Merge<Self, J::IntoIter>
    where +an iterator of Result values instead. Read more

    source§

    fn merge<J>(self, other: J) -> Merge<Self, J::IntoIter>
    where Self: Sized, Self::Item: PartialOrd, J: IntoIterator<Item = Self::Item>,

    Return an iterator adaptor that merges the two base iterators in ascending order. If both base iterators are sorted (ascending), the -result is sorted. Read more
    source§

    fn merge_by<J, F>(self, other: J, is_first: F) -> MergeBy<Self, J::IntoIter, F> ⓘ
    where +result is sorted. Read more

    source§

    fn merge_by<J, F>(self, other: J, is_first: F) -> MergeBy<Self, J::IntoIter, F> ⓘ
    where Self: Sized, J: IntoIterator<Item = Self::Item>, F: FnMut(&Self::Item, &Self::Item) -> bool,

    Return an iterator adaptor that merges the two base iterators in order. -This is much like .merge() but allows for a custom ordering. Read more
    source§

    fn merge_join_by<J, F, T>( +This is much like .merge() but allows for a custom ordering. Read more

    source§

    fn merge_join_by<J, F, T>( self, other: J, cmp_fn: F @@ -297,288 +299,299 @@ This is much like IntoIterator, F: FnMut(&Self::Item, &J::Item) -> T, Self: Sized,

    Create an iterator that merges items from both this and the specified -iterator in ascending order. Read more
    source§

    fn kmerge(self) -> KMerge<<Self::Item as IntoIterator>::IntoIter>
    where +iterator in ascending order. Read more

    source§

    fn kmerge(self) -> KMerge<<Self::Item as IntoIterator>::IntoIter>
    where Self: Sized, Self::Item: IntoIterator, <Self::Item as IntoIterator>::Item: PartialOrd,

    Return an iterator adaptor that flattens an iterator of iterators by -merging them in ascending order. Read more
    source§

    fn kmerge_by<F>( +merging them in ascending order. Read more

    source§

    fn kmerge_by<F>( self, first: F ) -> KMergeBy<<Self::Item as IntoIterator>::IntoIter, F> ⓘ
    where Self: Sized, Self::Item: IntoIterator, F: FnMut(&<Self::Item as IntoIterator>::Item, &<Self::Item as IntoIterator>::Item) -> bool,

    Return an iterator adaptor that flattens an iterator of iterators by -merging them according to the given closure. Read more
    source§

    fn cartesian_product<J>(self, other: J) -> Product<Self, J::IntoIter> ⓘ
    where +merging them according to the given closure. Read more

    source§

    fn cartesian_product<J>(self, other: J) -> Product<Self, J::IntoIter> ⓘ
    where Self: Sized, Self::Item: Clone, J: IntoIterator, J::IntoIter: Clone,

    Return an iterator adaptor that iterates over the cartesian product of -the element sets of two iterators self and J. Read more
    source§

    fn multi_cartesian_product( +the element sets of two iterators self and J. Read more

    source§

    fn multi_cartesian_product( self ) -> MultiProduct<<Self::Item as IntoIterator>::IntoIter> ⓘ
    where Self: Sized, Self::Item: IntoIterator, <Self::Item as IntoIterator>::IntoIter: Clone, <Self::Item as IntoIterator>::Item: Clone,

    Return an iterator adaptor that iterates over the cartesian product of -all subiterators returned by meta-iterator self. Read more
    source§

    fn coalesce<F>(self, f: F) -> Coalesce<Self, F>
    where +all subiterators returned by meta-iterator self. Read more

    source§

    fn coalesce<F>(self, f: F) -> Coalesce<Self, F>
    where Self: Sized, F: FnMut(Self::Item, Self::Item) -> Result<Self::Item, (Self::Item, Self::Item)>,

    Return an iterator adaptor that uses the passed-in closure to -optionally merge together consecutive elements. Read more
    source§

    fn dedup(self) -> Dedup<Self>
    where +optionally merge together consecutive elements. Read more

    source§

    fn dedup(self) -> Dedup<Self>
    where Self: Sized, Self::Item: PartialEq,

    Remove duplicates from sections of consecutive identical elements. -If the iterator is sorted, all elements will be unique. Read more
    source§

    fn dedup_by<Cmp>(self, cmp: Cmp) -> DedupBy<Self, Cmp>
    where +If the iterator is sorted, all elements will be unique. Read more

    source§

    fn dedup_by<Cmp>(self, cmp: Cmp) -> DedupBy<Self, Cmp>
    where Self: Sized, Cmp: FnMut(&Self::Item, &Self::Item) -> bool,

    Remove duplicates from sections of consecutive identical elements, determining equality using a comparison function. -If the iterator is sorted, all elements will be unique. Read more
    source§

    fn dedup_with_count(self) -> DedupWithCount<Self>
    where +If the iterator is sorted, all elements will be unique. Read more

    source§

    fn dedup_with_count(self) -> DedupWithCount<Self>
    where Self: Sized,

    Remove duplicates from sections of consecutive identical elements, while keeping a count of how many repeated elements were present. -If the iterator is sorted, all elements will be unique. Read more
    source§

    fn dedup_by_with_count<Cmp>(self, cmp: Cmp) -> DedupByWithCount<Self, Cmp>
    where +If the iterator is sorted, all elements will be unique. Read more

    source§

    fn dedup_by_with_count<Cmp>(self, cmp: Cmp) -> DedupByWithCount<Self, Cmp>
    where Self: Sized, Cmp: FnMut(&Self::Item, &Self::Item) -> bool,

    Remove duplicates from sections of consecutive identical elements, while keeping a count of how many repeated elements were present. This will determine equality using a comparison function. -If the iterator is sorted, all elements will be unique. Read more
    source§

    fn duplicates(self) -> Duplicates<Self>
    where +If the iterator is sorted, all elements will be unique. Read more

    source§

    fn duplicates(self) -> Duplicates<Self>
    where Self: Sized, Self::Item: Eq + Hash,

    Return an iterator adaptor that produces elements that appear more than once during the -iteration. Duplicates are detected using hash and equality. Read more
    source§

    fn duplicates_by<V, F>(self, f: F) -> DuplicatesBy<Self, V, F>
    where +iteration. Duplicates are detected using hash and equality. Read more

    source§

    fn duplicates_by<V, F>(self, f: F) -> DuplicatesBy<Self, V, F>
    where Self: Sized, V: Eq + Hash, F: FnMut(&Self::Item) -> V,

    Return an iterator adaptor that produces elements that appear more than once during the -iteration. Duplicates are detected using hash and equality. Read more
    source§

    fn unique(self) -> Unique<Self> ⓘ
    where +iteration. Duplicates are detected using hash and equality. Read more

    source§

    fn unique(self) -> Unique<Self> ⓘ
    where Self: Sized, Self::Item: Clone + Eq + Hash,

    Return an iterator adaptor that filters out elements that have already been produced once during the iteration. Duplicates -are detected using hash and equality. Read more
    source§

    fn unique_by<V, F>(self, f: F) -> UniqueBy<Self, V, F> ⓘ
    where +are detected using hash and equality. Read more

    source§

    fn unique_by<V, F>(self, f: F) -> UniqueBy<Self, V, F> ⓘ
    where Self: Sized, V: Eq + Hash, F: FnMut(&Self::Item) -> V,

    Return an iterator adaptor that filters out elements that have -already been produced once during the iteration. Read more
    source§

    fn peeking_take_while<F>(&mut self, accept: F) -> PeekingTakeWhile<'_, Self, F> ⓘ
    where +already been produced once during the iteration. Read more

    source§

    fn peeking_take_while<F>(&mut self, accept: F) -> PeekingTakeWhile<'_, Self, F> ⓘ
    where Self: Sized + PeekingNext, F: FnMut(&Self::Item) -> bool,

    Return an iterator adaptor that borrows from this iterator and -takes items while the closure accept returns true. Read more
    source§

    fn take_while_ref<F>(&mut self, accept: F) -> TakeWhileRef<'_, Self, F> ⓘ
    where +takes items while the closure accept returns true. Read more

    source§

    fn take_while_ref<F>(&mut self, accept: F) -> TakeWhileRef<'_, Self, F> ⓘ
    where Self: Clone, F: FnMut(&Self::Item) -> bool,

    Return an iterator adaptor that borrows from a Clone-able iterator -to only pick off elements while the predicate accept returns true. Read more
    source§

    fn take_while_inclusive<F>(self, accept: F) -> TakeWhileInclusive<Self, F> ⓘ
    where +to only pick off elements while the predicate accept returns true. Read more

    source§

    fn take_while_inclusive<F>(self, accept: F) -> TakeWhileInclusive<Self, F> ⓘ
    where Self: Sized, F: FnMut(&Self::Item) -> bool,

    Returns an iterator adaptor that consumes elements while the given predicate is true, including the element for which the predicate -first returned false. Read more
    source§

    fn while_some<A>(self) -> WhileSome<Self> ⓘ
    where +first returned false. Read more

    source§

    fn while_some<A>(self) -> WhileSome<Self> ⓘ
    where Self: Sized + Iterator<Item = Option<A>>,

    Return an iterator adaptor that filters Option<A> iterator elements -and produces A. Stops on the first None encountered. Read more
    source§

    fn tuple_combinations<T>(self) -> TupleCombinations<Self, T> ⓘ
    where +and produces A. Stops on the first None encountered. Read more

    source§

    fn tuple_combinations<T>(self) -> TupleCombinations<Self, T> ⓘ
    where Self: Sized + Clone, Self::Item: Clone, T: HasCombination<Self>,

    Return an iterator adaptor that iterates over the combinations of the -elements from an iterator. Read more
    source§

    fn combinations(self, k: usize) -> Combinations<Self> ⓘ
    where +elements from an iterator. Read more

    source§

    fn combinations(self, k: usize) -> Combinations<Self> ⓘ
    where Self: Sized, Self::Item: Clone,

    Return an iterator adaptor that iterates over the k-length combinations of -the elements from an iterator. Read more
    source§

    fn combinations_with_replacement( +the elements from an iterator. Read more

    source§

    fn combinations_with_replacement( self, k: usize ) -> CombinationsWithReplacement<Self> ⓘ
    where Self: Sized, Self::Item: Clone,

    Return an iterator that iterates over the k-length combinations of -the elements from an iterator, with replacement. Read more
    source§

    fn permutations(self, k: usize) -> Permutations<Self> ⓘ
    where +the elements from an iterator, with replacement. Read more

    source§

    fn permutations(self, k: usize) -> Permutations<Self> ⓘ
    where Self: Sized, Self::Item: Clone,

    Return an iterator adaptor that iterates over all k-permutations of the -elements from an iterator. Read more
    source§

    fn powerset(self) -> Powerset<Self> ⓘ
    where +elements from an iterator. Read more

    source§

    fn powerset(self) -> Powerset<Self> ⓘ
    where Self: Sized, Self::Item: Clone,

    Return an iterator that iterates through the powerset of the elements from an -iterator. Read more
    source§

    fn pad_using<F>(self, min: usize, f: F) -> PadUsing<Self, F> ⓘ
    where +iterator. Read more

    source§

    fn pad_using<F>(self, min: usize, f: F) -> PadUsing<Self, F> ⓘ
    where Self: Sized, F: FnMut(usize) -> Self::Item,

    Return an iterator adaptor that pads the sequence to a minimum length of -min by filling missing elements using a closure f. Read more
    source§

    fn with_position(self) -> WithPosition<Self> ⓘ
    where +min by filling missing elements using a closure f. Read more

    source§

    fn with_position(self) -> WithPosition<Self> ⓘ
    where Self: Sized,

    Return an iterator adaptor that combines each element with a Position to -ease special-case handling of the first or last elements. Read more
    source§

    fn positions<P>(self, predicate: P) -> Positions<Self, P> ⓘ
    where +ease special-case handling of the first or last elements. Read more

    source§

    fn positions<P>(self, predicate: P) -> Positions<Self, P> ⓘ
    where Self: Sized, P: FnMut(Self::Item) -> bool,

    Return an iterator adaptor that yields the indices of all elements -satisfying a predicate, counted from the start of the iterator. Read more
    source§

    fn update<F>(self, updater: F) -> Update<Self, F> ⓘ
    where +satisfying a predicate, counted from the start of the iterator. Read more

    source§

    fn update<F>(self, updater: F) -> Update<Self, F> ⓘ
    where Self: Sized, F: FnMut(&mut Self::Item),

    Return an iterator adaptor that applies a mutating function -to each element before yielding it. Read more
    source§

    fn next_tuple<T>(&mut self) -> Option<T>
    where +to each element before yielding it. Read more

    source§

    fn next_tuple<T>(&mut self) -> Option<T>
    where Self: Sized + Iterator<Item = T::Item>, T: HomogeneousTuple,

    Advances the iterator and returns the next items grouped in a tuple of -a specific size (up to 12). Read more
    source§

    fn collect_tuple<T>(self) -> Option<T>
    where +a specific size (up to 12). Read more

    source§

    fn collect_tuple<T>(self) -> Option<T>
    where Self: Sized + Iterator<Item = T::Item>, T: HomogeneousTuple,

    Collects all items from the iterator into a tuple of a specific size -(up to 12). Read more
    source§

    fn find_position<P>(&mut self, pred: P) -> Option<(usize, Self::Item)>
    where - P: FnMut(&Self::Item) -> bool,

    Find the position and value of the first element satisfying a predicate. Read more
    source§

    fn find_or_last<P>(self, predicate: P) -> Option<Self::Item>
    where +(up to 12). Read more

    source§

    fn find_position<P>(&mut self, pred: P) -> Option<(usize, Self::Item)>
    where + P: FnMut(&Self::Item) -> bool,

    Find the position and value of the first element satisfying a predicate. Read more
    source§

    fn find_or_last<P>(self, predicate: P) -> Option<Self::Item>
    where Self: Sized, - P: FnMut(&Self::Item) -> bool,

    Find the value of the first element satisfying a predicate or return the last element, if any. Read more
    source§

    fn find_or_first<P>(self, predicate: P) -> Option<Self::Item>
    where + P: FnMut(&Self::Item) -> bool,

    Find the value of the first element satisfying a predicate or return the last element, if any. Read more
    source§

    fn find_or_first<P>(self, predicate: P) -> Option<Self::Item>
    where Self: Sized, - P: FnMut(&Self::Item) -> bool,

    Find the value of the first element satisfying a predicate or return the first element, if any. Read more
    source§

    fn contains<Q>(&mut self, query: &Q) -> bool
    where + P: FnMut(&Self::Item) -> bool,

    Find the value of the first element satisfying a predicate or return the first element, if any. Read more
    source§

    fn contains<Q>(&mut self, query: &Q) -> bool
    where Self: Sized, Self::Item: Borrow<Q>, - Q: PartialEq,

    Returns true if the given item is present in this iterator. Read more
    source§

    fn all_equal(&mut self) -> bool
    where + Q: PartialEq,

    Returns true if the given item is present in this iterator. Read more
    source§

    fn all_equal(&mut self) -> bool
    where Self: Sized, - Self::Item: PartialEq,

    Check whether all elements compare equal. Read more
    source§

    fn all_equal_value( + Self::Item: PartialEq,

    Check whether all elements compare equal. Read more
    source§

    fn all_equal_value( &mut self ) -> Result<Self::Item, Option<(Self::Item, Self::Item)>>
    where Self: Sized, Self::Item: PartialEq,

    If there are elements and they are all equal, return a single copy of that element. If there are no elements, return an Error containing None. If there are elements and they are not all equal, return a tuple containing the first -two non-equal elements found. Read more
    source§

    fn all_unique(&mut self) -> bool
    where +two non-equal elements found. Read more

    source§

    fn all_unique(&mut self) -> bool
    where Self: Sized, - Self::Item: Eq + Hash,

    Check whether all elements are unique (non equal). Read more
    source§

    fn dropping(self, n: usize) -> Self
    where + Self::Item: Eq + Hash,

    Check whether all elements are unique (non equal). Read more
    source§

    fn dropping(self, n: usize) -> Self
    where Self: Sized,

    Consume the first n elements from the iterator eagerly, -and return the same iterator again. Read more
    source§

    fn dropping_back(self, n: usize) -> Self
    where +and return the same iterator again. Read more

    source§

    fn dropping_back(self, n: usize) -> Self
    where Self: Sized + DoubleEndedIterator,

    Consume the last n elements from the iterator eagerly, -and return the same iterator again. Read more
    source§

    fn foreach<F>(self, f: F)
    where - F: FnMut(Self::Item), - Self: Sized,

    👎Deprecated since 0.8.0: Use .for_each() instead
    Run the closure f eagerly on each element of the iterator. Read more
    source§

    fn concat(self) -> Self::Item
    where +and return the same iterator again. Read more

    source§

    fn concat(self) -> Self::Item
    where Self: Sized, - Self::Item: Extend<<<Self as Iterator>::Item as IntoIterator>::Item> + IntoIterator + Default,

    Combine all an iterator’s elements into one element by using Extend. Read more
    source§

    fn collect_vec(self) -> Vec<Self::Item>
    where + Self::Item: Extend<<<Self as Iterator>::Item as IntoIterator>::Item> + IntoIterator + Default,

    Combine all an iterator’s elements into one element by using Extend. Read more
    source§

    fn collect_vec(self) -> Vec<Self::Item>
    where Self: Sized,

    .collect_vec() is simply a type specialization of Iterator::collect, -for convenience.
    source§

    fn try_collect<T, U, E>(self) -> Result<U, E>
    where +for convenience.

    source§

    fn try_collect<T, U, E>(self) -> Result<U, E>
    where Self: Sized + Iterator<Item = Result<T, E>>, Result<U, E>: FromIterator<Result<T, E>>,

    .try_collect() is more convenient way of writing -.collect::<Result<_, _>>() Read more
    source§

    fn set_from<'a, A: 'a, J>(&mut self, from: J) -> usize
    where +.collect::<Result<_, _>>() Read more

    source§

    fn set_from<'a, A: 'a, J>(&mut self, from: J) -> usize
    where Self: Iterator<Item = &'a mut A>, J: IntoIterator<Item = A>,

    Assign to each reference in self from the from iterator, -stopping at the shortest of the two iterators. Read more
    source§

    fn join(&mut self, sep: &str) -> String
    where - Self::Item: Display,

    Combine all iterator elements into one String, separated by sep. Read more
    source§

    fn format(self, sep: &str) -> Format<'_, Self>
    where - Self: Sized,

    Format all iterator elements, separated by sep. Read more
    source§

    fn format_with<F>(self, sep: &str, format: F) -> FormatWith<'_, Self, F>
    where +stopping at the shortest of the two iterators. Read more

    source§

    fn join(&mut self, sep: &str) -> String
    where + Self::Item: Display,

    Combine all iterator elements into one String, separated by sep. Read more
    source§

    fn format(self, sep: &str) -> Format<'_, Self>
    where + Self: Sized,

    Format all iterator elements, separated by sep. Read more
    source§

    fn format_with<F>(self, sep: &str, format: F) -> FormatWith<'_, Self, F>
    where Self: Sized, - F: FnMut(Self::Item, &mut dyn FnMut(&dyn Display) -> Result) -> Result,

    Format all iterator elements, separated by sep. Read more
    source§

    fn fold_results<A, E, B, F>(&mut self, start: B, f: F) -> Result<B, E>
    where + F: FnMut(Self::Item, &mut dyn FnMut(&dyn Display) -> Result) -> Result,

    Format all iterator elements, separated by sep. Read more
    source§

    fn fold_ok<A, E, B, F>(&mut self, start: B, f: F) -> Result<B, E>
    where Self: Iterator<Item = Result<A, E>>, - F: FnMut(B, A) -> B,

    👎Deprecated since 0.10.0: Use .fold_ok() instead
    See .fold_ok().
    source§

    fn fold_ok<A, E, B, F>(&mut self, start: B, f: F) -> Result<B, E>
    where - Self: Iterator<Item = Result<A, E>>, - F: FnMut(B, A) -> B,

    Fold Result values from an iterator. Read more
    source§

    fn fold_options<A, B, F>(&mut self, start: B, f: F) -> Option<B>
    where + F: FnMut(B, A) -> B,

    Fold Result values from an iterator. Read more
    source§

    fn fold_options<A, B, F>(&mut self, start: B, f: F) -> Option<B>
    where Self: Iterator<Item = Option<A>>, - F: FnMut(B, A) -> B,

    Fold Option values from an iterator. Read more
    source§

    fn fold1<F>(self, f: F) -> Option<Self::Item>
    where + F: FnMut(B, A) -> B,

    Fold Option values from an iterator. Read more
    source§

    fn fold1<F>(self, f: F) -> Option<Self::Item>
    where F: FnMut(Self::Item, Self::Item) -> Self::Item, - Self: Sized,

    👎Deprecated since 0.10.2: Use Iterator::reduce instead
    Accumulator of the elements in the iterator. Read more
    source§

    fn tree_fold1<F>(self, f: F) -> Option<Self::Item>
    where + Self: Sized,

    👎Deprecated since 0.10.2: Use Iterator::reduce instead
    Accumulator of the elements in the iterator. Read more
    source§

    fn tree_reduce<F>(self, f: F) -> Option<Self::Item>
    where F: FnMut(Self::Item, Self::Item) -> Self::Item, - Self: Sized,

    Accumulate the elements in the iterator in a tree-like manner. Read more
    source§

    fn fold_while<B, F>(&mut self, init: B, f: F) -> FoldWhile<B>
    where + Self: Sized,

    Accumulate the elements in the iterator in a tree-like manner. Read more
    source§

    fn tree_fold1<F>(self, f: F) -> Option<Self::Item>
    where + F: FnMut(Self::Item, Self::Item) -> Self::Item, + Self: Sized,

    👎Deprecated since 0.13.0: Use .tree_reduce() instead
    See .tree_reduce().
    source§

    fn fold_while<B, F>(&mut self, init: B, f: F) -> FoldWhile<B>
    where Self: Sized, - F: FnMut(B, Self::Item) -> FoldWhile<B>,

    An iterator method that applies a function, producing a single, final value. Read more
    source§

    fn sum1<S>(self) -> Option<S>
    where + F: FnMut(B, Self::Item) -> FoldWhile<B>,

    An iterator method that applies a function, producing a single, final value. Read more
    source§

    fn sum1<S>(self) -> Option<S>
    where Self: Sized, - S: Sum<Self::Item>,

    Iterate over the entire iterator and add all the elements. Read more
    source§

    fn product1<P>(self) -> Option<P>
    where + S: Sum<Self::Item>,

    Iterate over the entire iterator and add all the elements. Read more
    source§

    fn product1<P>(self) -> Option<P>
    where Self: Sized, - P: Product<Self::Item>,

    Iterate over the entire iterator and multiply all the elements. Read more
    source§

    fn sorted_unstable(self) -> IntoIter<Self::Item> ⓘ
    where + P: Product<Self::Item>,

    Iterate over the entire iterator and multiply all the elements. Read more
    source§

    fn sorted_unstable(self) -> IntoIter<Self::Item> ⓘ
    where Self: Sized, - Self::Item: Ord,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_unstable_by<F>(self, cmp: F) -> IntoIter<Self::Item> ⓘ
    where + Self::Item: Ord,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_unstable_by<F>(self, cmp: F) -> IntoIter<Self::Item> ⓘ
    where Self: Sized, - F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_unstable_by_key<K, F>(self, f: F) -> IntoIter<Self::Item> ⓘ
    where + F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_unstable_by_key<K, F>(self, f: F) -> IntoIter<Self::Item> ⓘ
    where Self: Sized, K: Ord, - F: FnMut(&Self::Item) -> K,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted(self) -> IntoIter<Self::Item> ⓘ
    where + F: FnMut(&Self::Item) -> K,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted(self) -> IntoIter<Self::Item> ⓘ
    where Self: Sized, - Self::Item: Ord,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_by<F>(self, cmp: F) -> IntoIter<Self::Item> ⓘ
    where + Self::Item: Ord,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_by<F>(self, cmp: F) -> IntoIter<Self::Item> ⓘ
    where Self: Sized, - F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_by_key<K, F>(self, f: F) -> IntoIter<Self::Item> ⓘ
    where + F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_by_key<K, F>(self, f: F) -> IntoIter<Self::Item> ⓘ
    where Self: Sized, K: Ord, - F: FnMut(&Self::Item) -> K,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_by_cached_key<K, F>(self, f: F) -> IntoIter<Self::Item> ⓘ
    where + F: FnMut(&Self::Item) -> K,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_by_cached_key<K, F>(self, f: F) -> IntoIter<Self::Item> ⓘ
    where Self: Sized, K: Ord, F: FnMut(&Self::Item) -> K,

    Sort all iterator elements into a new iterator in ascending order. The key function is -called exactly once per key. Read more
    source§

    fn k_smallest(self, k: usize) -> IntoIter<Self::Item> ⓘ
    where +called exactly once per key. Read more

    source§

    fn k_smallest(self, k: usize) -> IntoIter<Self::Item> ⓘ
    where Self: Sized, - Self::Item: Ord,

    Sort the k smallest elements into a new iterator, in ascending order. Read more
    source§

    fn partition_map<A, B, F, L, R>(self, predicate: F) -> (A, B)
    where + Self::Item: Ord,

    Sort the k smallest elements into a new iterator, in ascending order. Read more
    source§

    fn k_smallest_by<F>(self, k: usize, cmp: F) -> IntoIter<Self::Item> ⓘ
    where + Self: Sized, + F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Sort the k smallest elements into a new iterator using the provided comparison. Read more
    source§

    fn k_smallest_by_key<F, K>(self, k: usize, key: F) -> IntoIter<Self::Item> ⓘ
    where + Self: Sized, + F: FnMut(&Self::Item) -> K, + K: Ord,

    Return the elements producing the k smallest outputs of the provided function. Read more
    source§

    fn k_largest(self, k: usize) -> IntoIter<Self::Item> ⓘ
    where + Self: Sized, + Self::Item: Ord,

    Sort the k largest elements into a new iterator, in descending order. Read more
    source§

    fn k_largest_by<F>(self, k: usize, cmp: F) -> IntoIter<Self::Item> ⓘ
    where + Self: Sized, + F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Sort the k largest elements into a new iterator using the provided comparison. Read more
    source§

    fn k_largest_by_key<F, K>(self, k: usize, key: F) -> IntoIter<Self::Item> ⓘ
    where + Self: Sized, + F: FnMut(&Self::Item) -> K, + K: Ord,

    Return the elements producing the k largest outputs of the provided function. Read more
    source§

    fn tail(self, n: usize) -> IntoIter<Self::Item> ⓘ
    where + Self: Sized,

    Consumes the iterator and return an iterator of the last n elements. Read more
    source§

    fn partition_map<A, B, F, L, R>(self, predicate: F) -> (A, B)
    where Self: Sized, F: FnMut(Self::Item) -> Either<L, R>, A: Default + Extend<L>, B: Default + Extend<R>,

    Collect all iterator elements into one of two partitions. Unlike Iterator::partition, each partition may -have a distinct type. Read more
    source§

    fn partition_result<A, B, T, E>(self) -> (A, B)
    where +have a distinct type. Read more

    source§

    fn partition_result<A, B, T, E>(self) -> (A, B)
    where Self: Iterator<Item = Result<T, E>> + Sized, A: Default + Extend<T>, B: Default + Extend<E>,

    Partition a sequence of Results into one list of all the Ok elements -and another list of all the Err elements. Read more
    source§

    fn into_group_map<K, V>(self) -> HashMap<K, Vec<V>>
    where +and another list of all the Err elements. Read more

    source§

    fn into_group_map<K, V>(self) -> HashMap<K, Vec<V>>
    where Self: Iterator<Item = (K, V)> + Sized, K: Hash + Eq,

    Return a HashMap of keys mapped to Vecs of values. Keys and values -are taken from (Key, Value) tuple pairs yielded by the input iterator. Read more
    source§

    fn into_group_map_by<K, V, F>(self, f: F) -> HashMap<K, Vec<V>>
    where +are taken from (Key, Value) tuple pairs yielded by the input iterator. Read more

    source§

    fn into_group_map_by<K, V, F>(self, f: F) -> HashMap<K, Vec<V>>
    where Self: Iterator<Item = V> + Sized, K: Hash + Eq, - F: Fn(&V) -> K,

    Return an Iterator on a HashMap. Keys mapped to Vecs of values. The key is specified -in the closure. Read more
    source§

    fn into_grouping_map<K, V>(self) -> GroupingMap<Self>
    where + F: FnMut(&V) -> K,

    Return an Iterator on a HashMap. Keys mapped to Vecs of values. The key is specified +in the closure. Read more
    source§

    fn into_grouping_map<K, V>(self) -> GroupingMap<Self>
    where Self: Iterator<Item = (K, V)> + Sized, K: Hash + Eq,

    Constructs a GroupingMap to be used later with one of the efficient -group-and-fold operations it allows to perform. Read more
    source§

    fn into_grouping_map_by<K, V, F>(self, key_mapper: F) -> GroupingMapBy<Self, F>
    where +group-and-fold operations it allows to perform. Read more

    source§

    fn into_grouping_map_by<K, V, F>(self, key_mapper: F) -> GroupingMapBy<Self, F>
    where Self: Iterator<Item = V> + Sized, K: Hash + Eq, F: FnMut(&V) -> K,

    Constructs a GroupingMap to be used later with one of the efficient -group-and-fold operations it allows to perform. Read more
    source§

    fn min_set(self) -> Vec<Self::Item>
    where +group-and-fold operations it allows to perform. Read more

    source§

    fn min_set(self) -> Vec<Self::Item>
    where Self: Sized, - Self::Item: Ord,

    Return all minimum elements of an iterator. Read more
    source§

    fn min_set_by<F>(self, compare: F) -> Vec<Self::Item>
    where + Self::Item: Ord,

    Return all minimum elements of an iterator. Read more
    source§

    fn min_set_by<F>(self, compare: F) -> Vec<Self::Item>
    where Self: Sized, F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Return all minimum elements of an iterator, as determined by -the specified function. Read more
    source§

    fn min_set_by_key<K, F>(self, key: F) -> Vec<Self::Item>
    where +the specified function. Read more

    source§

    fn min_set_by_key<K, F>(self, key: F) -> Vec<Self::Item>
    where Self: Sized, K: Ord, F: FnMut(&Self::Item) -> K,

    Return all minimum elements of an iterator, as determined by -the specified function. Read more
    source§

    fn max_set(self) -> Vec<Self::Item>
    where +the specified function. Read more

    source§

    fn max_set(self) -> Vec<Self::Item>
    where Self: Sized, - Self::Item: Ord,

    Return all maximum elements of an iterator. Read more
    source§

    fn max_set_by<F>(self, compare: F) -> Vec<Self::Item>
    where + Self::Item: Ord,

    Return all maximum elements of an iterator. Read more
    source§

    fn max_set_by<F>(self, compare: F) -> Vec<Self::Item>
    where Self: Sized, F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Return all maximum elements of an iterator, as determined by -the specified function. Read more
    source§

    fn max_set_by_key<K, F>(self, key: F) -> Vec<Self::Item>
    where +the specified function. Read more

    source§

    fn max_set_by_key<K, F>(self, key: F) -> Vec<Self::Item>
    where Self: Sized, K: Ord, F: FnMut(&Self::Item) -> K,

    Return all maximum elements of an iterator, as determined by -the specified function. Read more
    source§

    fn minmax(self) -> MinMaxResult<Self::Item>
    where +the specified function. Read more

    source§

    fn minmax(self) -> MinMaxResult<Self::Item>
    where Self: Sized, - Self::Item: PartialOrd,

    Return the minimum and maximum elements in the iterator. Read more
    source§

    fn minmax_by_key<K, F>(self, key: F) -> MinMaxResult<Self::Item>
    where + Self::Item: PartialOrd,

    Return the minimum and maximum elements in the iterator. Read more
    source§

    fn minmax_by_key<K, F>(self, key: F) -> MinMaxResult<Self::Item>
    where Self: Sized, K: PartialOrd, F: FnMut(&Self::Item) -> K,

    Return the minimum and maximum element of an iterator, as determined by -the specified function. Read more
    source§

    fn minmax_by<F>(self, compare: F) -> MinMaxResult<Self::Item>
    where +the specified function. Read more

    source§

    fn minmax_by<F>(self, compare: F) -> MinMaxResult<Self::Item>
    where Self: Sized, F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Return the minimum and maximum element of an iterator, as determined by -the specified comparison function. Read more
    source§

    fn position_max(self) -> Option<usize>
    where +the specified comparison function. Read more

    source§

    fn position_max(self) -> Option<usize>
    where Self: Sized, - Self::Item: Ord,

    Return the position of the maximum element in the iterator. Read more
    source§

    fn position_max_by_key<K, F>(self, key: F) -> Option<usize>
    where + Self::Item: Ord,

    Return the position of the maximum element in the iterator. Read more
    source§

    fn position_max_by_key<K, F>(self, key: F) -> Option<usize>
    where Self: Sized, K: Ord, F: FnMut(&Self::Item) -> K,

    Return the position of the maximum element in the iterator, as -determined by the specified function. Read more
    source§

    fn position_max_by<F>(self, compare: F) -> Option<usize>
    where +determined by the specified function. Read more

    source§

    fn position_max_by<F>(self, compare: F) -> Option<usize>
    where Self: Sized, F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Return the position of the maximum element in the iterator, as -determined by the specified comparison function. Read more
    source§

    fn position_min(self) -> Option<usize>
    where +determined by the specified comparison function. Read more

    source§

    fn position_min(self) -> Option<usize>
    where Self: Sized, - Self::Item: Ord,

    Return the position of the minimum element in the iterator. Read more
    source§

    fn position_min_by_key<K, F>(self, key: F) -> Option<usize>
    where + Self::Item: Ord,

    Return the position of the minimum element in the iterator. Read more
    source§

    fn position_min_by_key<K, F>(self, key: F) -> Option<usize>
    where Self: Sized, K: Ord, F: FnMut(&Self::Item) -> K,

    Return the position of the minimum element in the iterator, as -determined by the specified function. Read more
    source§

    fn position_min_by<F>(self, compare: F) -> Option<usize>
    where +determined by the specified function. Read more

    source§

    fn position_min_by<F>(self, compare: F) -> Option<usize>
    where Self: Sized, F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Return the position of the minimum element in the iterator, as -determined by the specified comparison function. Read more
    source§

    fn position_minmax(self) -> MinMaxResult<usize>
    where +determined by the specified comparison function. Read more

    source§

    fn position_minmax(self) -> MinMaxResult<usize>
    where Self: Sized, Self::Item: PartialOrd,

    Return the positions of the minimum and maximum elements in -the iterator. Read more
    source§

    fn position_minmax_by_key<K, F>(self, key: F) -> MinMaxResult<usize>
    where +the iterator. Read more

    source§

    fn position_minmax_by_key<K, F>(self, key: F) -> MinMaxResult<usize>
    where Self: Sized, K: PartialOrd, F: FnMut(&Self::Item) -> K,

    Return the postions of the minimum and maximum elements of an -iterator, as determined by the specified function. Read more
    source§

    fn position_minmax_by<F>(self, compare: F) -> MinMaxResult<usize>
    where +iterator, as determined by the specified function. Read more

    source§

    fn position_minmax_by<F>(self, compare: F) -> MinMaxResult<usize>
    where Self: Sized, F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Return the postions of the minimum and maximum elements of an -iterator, as determined by the specified comparison function. Read more
    source§

    fn exactly_one(self) -> Result<Self::Item, ExactlyOneError<Self>>
    where +iterator, as determined by the specified comparison function. Read more

    source§

    fn exactly_one(self) -> Result<Self::Item, ExactlyOneError<Self>>
    where Self: Sized,

    If the iterator yields exactly one element, that element will be returned, otherwise an error will be returned containing an iterator that has the same output as the input -iterator. Read more
    source§

    fn at_most_one(self) -> Result<Option<Self::Item>, ExactlyOneError<Self>>
    where - Self: Sized,

    If the iterator yields no elements, Ok(None) will be returned. If the iterator yields +iterator. Read more
    source§

    fn at_most_one(self) -> Result<Option<Self::Item>, ExactlyOneError<Self>>
    where + Self: Sized,

    If the iterator yields no elements, Ok(None) will be returned. If the iterator yields exactly one element, that element will be returned, otherwise an error will be returned -containing an iterator that has the same output as the input iterator. Read more
    source§

    fn multipeek(self) -> MultiPeek<Self> ⓘ
    where +containing an iterator that has the same output as the input iterator. Read more

    source§

    fn multipeek(self) -> MultiPeek<Self> ⓘ
    where Self: Sized,

    An iterator adaptor that allows the user to peek at multiple .next() -values without advancing the base iterator. Read more
    source§

    fn counts(self) -> HashMap<Self::Item, usize>
    where +values without advancing the base iterator. Read more

    source§

    fn counts(self) -> HashMap<Self::Item, usize>
    where Self: Sized, Self::Item: Eq + Hash,

    Collect the items in this iterator and return a HashMap which contains each item that appears in the iterator and the number -of times it appears. Read more
    source§

    fn counts_by<K, F>(self, f: F) -> HashMap<K, usize>
    where +of times it appears. Read more

    source§

    fn counts_by<K, F>(self, f: F) -> HashMap<K, usize>
    where Self: Sized, K: Eq + Hash, F: FnMut(Self::Item) -> K,

    Collect the items in this iterator and return a HashMap which contains each item that appears in the iterator and the number of times it appears, -determining identity using a keying function. Read more
    source§

    fn multiunzip<FromI>(self) -> FromI
    where - Self: Sized + MultiUnzip<FromI>,

    Converts an iterator of tuples into a tuple of containers. Read more
    source§

    fn try_len(&self) -> Result<usize, (usize, Option<usize>)>

    Returns the length of the iterator if one exists. +determining identity using a keying function. Read more
    source§

    fn multiunzip<FromI>(self) -> FromI
    where + Self: Sized + MultiUnzip<FromI>,

    Converts an iterator of tuples into a tuple of containers. Read more
    source§

    fn try_len(&self) -> Result<usize, (usize, Option<usize>)>

    Returns the length of the iterator if one exists. Otherwise return self.size_hint(). Read more
    source§

    impl<IT, A, FromA, B, FromB> MultiUnzip<(FromA, FromB)> for IT
    where IT: Iterator<Item = (A, B)>, FromA: Default + Extend<A>, FromB: Default + Extend<B>,

    source§

    fn multiunzip(self) -> (FromA, FromB)

    Unzip this iterator into multiple collections.
    source§

    impl<T> 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 + 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/itertools/structs/struct.ZipLongest.html b/itertools/structs/struct.ZipLongest.html index e2432e375..b45af12bb 100644 --- a/itertools/structs/struct.ZipLongest.html +++ b/itertools/structs/struct.ZipLongest.html @@ -1,10 +1,11 @@ -ZipLongest in itertools::structs - Rust
    -

    Struct itertools::structs::ZipLongest

    source · 
    pub struct ZipLongest<T, U> { /* private fields */ }
    Expand description

    An iterator which iterates two other iterators simultaneously

    +ZipLongest in itertools::structs - Rust
    +

    Struct itertools::structs::ZipLongest

    source · 
    pub struct ZipLongest<T, U> { /* private fields */ }
    Expand description

    An iterator which iterates two other iterators simultaneously +and wraps the elements in EitherOrBoth.

    This iterator is fused.

    See .zip_longest() for more information.

    -

    Trait Implementations§

    source§

    impl<T: Clone, U: Clone> Clone for ZipLongest<T, U>

    source§

    fn clone(&self) -> ZipLongest<T, U> ⓘ

    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, U: Debug> Debug for ZipLongest<T, U>

    source§

    fn fmt(&self, f: &mut Formatter<'_>) -> Result

    Formats the value using the given formatter. Read more
    source§

    impl<T, U> DoubleEndedIterator for ZipLongest<T, U>
    where +

    Trait Implementations§

    source§

    impl<T: Clone, U: Clone> Clone for ZipLongest<T, U>

    source§

    fn clone(&self) -> ZipLongest<T, U> ⓘ

    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, U: Debug> Debug for ZipLongest<T, U>

    source§

    fn fmt(&self, f: &mut Formatter<'_>) -> Result

    Formats the value using the given formatter. Read more
    source§

    impl<T, U> DoubleEndedIterator for ZipLongest<T, U>
    where T: DoubleEndedIterator + ExactSizeIterator, - U: DoubleEndedIterator + ExactSizeIterator,

    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 + U: DoubleEndedIterator + ExactSizeIterator,

    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, @@ -12,11 +13,11 @@ final value, starting from the back. 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<T, U> ExactSizeIterator for ZipLongest<T, U>
    where + P: FnMut(&Self::Item) -> bool,

    Searches for an element of an iterator from the back that satisfies a predicate. Read more
    source§

    impl<T, U> ExactSizeIterator for ZipLongest<T, U>
    where T: ExactSizeIterator, - U: ExactSizeIterator,

    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, U> Iterator for ZipLongest<T, U>
    where + U: ExactSizeIterator,

    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, U> Iterator for ZipLongest<T, U>
    where T: Iterator, - U: Iterator,

    §

    type Item = EitherOrBoth<<T as Iterator>::Item, <U as Iterator>::Item>

    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 + U: Iterator,

    §

    type Item = EitherOrBoth<<T as Iterator>::Item, <U as Iterator>::Item>

    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>( @@ -193,7 +194,7 @@ greater than or equal to those of another. 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, U> FusedIterator for ZipLongest<T, U>
    where +function. Read more
    source§

    impl<T, U> FusedIterator for ZipLongest<T, U>
    where T: Iterator, U: Iterator,

    Auto Trait Implementations§

    §

    impl<T, U> Freeze for ZipLongest<T, U>
    where T: Freeze, @@ -223,86 +224,87 @@ otherwise. Right variant of Either<Self, Self> otherwise. Read more

    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> Itertools for T
    where - T: Iterator + ?Sized,

    source§

    fn interleave<J>(self, other: J) -> Interleave<Self, J::IntoIter> ⓘ
    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> Itertools for T
    where + T: Iterator + ?Sized,

    source§

    fn interleave<J>(self, other: J) -> Interleave<Self, J::IntoIter> ⓘ
    where J: IntoIterator<Item = Self::Item>, - Self: Sized,

    Alternate elements from two iterators until both have run out. Read more
    source§

    fn interleave_shortest<J>( + Self: Sized,

    Alternate elements from two iterators until both have run out. Read more
    source§

    fn interleave_shortest<J>( self, other: J ) -> InterleaveShortest<Self, J::IntoIter> ⓘ
    where J: IntoIterator<Item = Self::Item>, Self: Sized,

    Alternate elements from two iterators until at least one of them has run -out. Read more
    source§

    fn intersperse(self, element: Self::Item) -> Intersperse<Self>
    where +out. Read more

    source§

    fn intersperse(self, element: Self::Item) -> Intersperse<Self>
    where Self: Sized, Self::Item: Clone,

    An iterator adaptor to insert a particular value -between each element of the adapted iterator. Read more
    source§

    fn intersperse_with<F>(self, element: F) -> IntersperseWith<Self, F> ⓘ
    where +between each element of the adapted iterator. Read more

    source§

    fn intersperse_with<F>(self, element: F) -> IntersperseWith<Self, F> ⓘ
    where Self: Sized, F: FnMut() -> Self::Item,

    An iterator adaptor to insert a particular value created by a function -between each element of the adapted iterator. Read more
    source§

    fn zip_longest<J>(self, other: J) -> ZipLongest<Self, J::IntoIter> ⓘ
    where +between each element of the adapted iterator. Read more

    source§

    fn get<R>(self, index: R) -> R::Output
    where + Self: Sized, + R: IteratorIndex<Self>,

    Returns an iterator over a subsection of the iterator. Read more
    source§

    fn zip_longest<J>(self, other: J) -> ZipLongest<Self, J::IntoIter> ⓘ
    where J: IntoIterator, Self: Sized,

    Create an iterator which iterates over both this and the specified -iterator simultaneously, yielding pairs of two optional elements. Read more
    source§

    fn zip_eq<J>(self, other: J) -> ZipEq<Self, J::IntoIter> ⓘ
    where +iterator simultaneously, yielding pairs of two optional elements. Read more

    source§

    fn zip_eq<J>(self, other: J) -> ZipEq<Self, J::IntoIter> ⓘ
    where J: IntoIterator, Self: Sized,

    Create an iterator which iterates over both this and the specified -iterator simultaneously, yielding pairs of elements. Read more
    source§

    fn batching<B, F>(self, f: F) -> Batching<Self, F> ⓘ
    where +iterator simultaneously, yielding pairs of elements. Read more

    source§

    fn batching<B, F>(self, f: F) -> Batching<Self, F> ⓘ
    where F: FnMut(&mut Self) -> Option<B>, Self: Sized,

    A “meta iterator adaptor”. Its closure receives a reference to the iterator and may pick off as many elements as it likes, to produce the -next iterator element. Read more
    source§

    fn group_by<K, F>(self, key: F) -> GroupBy<K, Self, F>
    where +next iterator element. Read more

    source§

    fn chunk_by<K, F>(self, key: F) -> ChunkBy<K, Self, F>
    where Self: Sized, F: FnMut(&Self::Item) -> K, K: PartialEq,

    Return an iterable that can group iterator elements. Consecutive elements that map to the same key (“runs”), are assigned -to the same group. Read more
    source§

    fn chunks(self, size: usize) -> IntoChunks<Self>
    where - Self: Sized,

    Return an iterable that can chunk the iterator. Read more
    source§

    fn tuple_windows<T>(self) -> TupleWindows<Self, T> ⓘ
    where +to the same group. Read more

    source§

    fn group_by<K, F>(self, key: F) -> ChunkBy<K, Self, F>
    where + Self: Sized, + F: FnMut(&Self::Item) -> K, + K: PartialEq,

    👎Deprecated since 0.13.0: Use .chunk_by() instead
    See .chunk_by().
    source§

    fn chunks(self, size: usize) -> IntoChunks<Self>
    where + Self: Sized,

    Return an iterable that can chunk the iterator. Read more
    source§

    fn tuple_windows<T>(self) -> TupleWindows<Self, T> ⓘ
    where Self: Sized + Iterator<Item = T::Item>, T: HomogeneousTuple, T::Item: Clone,

    Return an iterator over all contiguous windows producing tuples of -a specific size (up to 12). Read more
    source§

    fn circular_tuple_windows<T>(self) -> CircularTupleWindows<Self, T> ⓘ
    where +a specific size (up to 12). Read more

    source§

    fn circular_tuple_windows<T>(self) -> CircularTupleWindows<Self, T> ⓘ
    where Self: Sized + Clone + Iterator<Item = T::Item> + ExactSizeIterator, T: TupleCollect + Clone, T::Item: Clone,

    Return an iterator over all windows, wrapping back to the first elements when the window would otherwise exceed the length of the -iterator, producing tuples of a specific size (up to 12). Read more
    source§

    fn tuples<T>(self) -> Tuples<Self, T> ⓘ
    where +iterator, producing tuples of a specific size (up to 12). Read more

    source§

    fn tuples<T>(self) -> Tuples<Self, T> ⓘ
    where Self: Sized + Iterator<Item = T::Item>, T: HomogeneousTuple,

    Return an iterator that groups the items in tuples of a specific size -(up to 12). Read more
    source§

    fn tee(self) -> (Tee<Self>, Tee<Self>)
    where +(up to 12). Read more

    source§

    fn tee(self) -> (Tee<Self>, Tee<Self>)
    where Self: Sized, Self::Item: Clone,

    Split into an iterator pair that both yield all elements from -the original iterator. Read more
    source§

    fn step(self, n: usize) -> Step<Self> ⓘ
    where - Self: Sized,

    👎Deprecated since 0.8.0: Use std .step_by() instead
    Return an iterator adaptor that steps n elements in the base iterator -for each iteration. Read more
    source§

    fn map_into<R>(self) -> MapInto<Self, R>
    where +the original iterator. Read more

    source§

    fn map_into<R>(self) -> MapInto<Self, R>
    where Self: Sized, - Self::Item: Into<R>,

    Convert each item of the iterator using the Into trait. Read more
    source§

    fn map_results<F, T, U, E>(self, f: F) -> MapOk<Self, F>
    where - Self: Iterator<Item = Result<T, E>> + Sized, - F: FnMut(T) -> U,

    👎Deprecated since 0.10.0: Use .map_ok() instead
    See .map_ok().
    source§

    fn map_ok<F, T, U, E>(self, f: F) -> MapOk<Self, F>
    where + Self::Item: Into<R>,

    Convert each item of the iterator using the Into trait. Read more
    source§

    fn map_ok<F, T, U, E>(self, f: F) -> MapOk<Self, F>
    where Self: Iterator<Item = Result<T, E>> + Sized, F: FnMut(T) -> U,

    Return an iterator adaptor that applies the provided closure to every Result::Ok value. Result::Err values are -unchanged. Read more
    source§

    fn filter_ok<F, T, E>(self, f: F) -> FilterOk<Self, F> ⓘ
    where +unchanged. Read more

    source§

    fn filter_ok<F, T, E>(self, f: F) -> FilterOk<Self, F> ⓘ
    where Self: Iterator<Item = Result<T, E>> + Sized, F: FnMut(&T) -> bool,

    Return an iterator adaptor that filters every Result::Ok value with the provided closure. Result::Err values are -unchanged. Read more
    source§

    fn filter_map_ok<F, T, U, E>(self, f: F) -> FilterMapOk<Self, F> ⓘ
    where +unchanged. Read more

    source§

    fn filter_map_ok<F, T, U, E>(self, f: F) -> FilterMapOk<Self, F> ⓘ
    where Self: Iterator<Item = Result<T, E>> + Sized, F: FnMut(T) -> Option<U>,

    Return an iterator adaptor that filters and transforms every Result::Ok value with the provided closure. Result::Err -values are unchanged. Read more
    source§

    fn flatten_ok<T, E>(self) -> FlattenOk<Self, T, E> ⓘ
    where +values are unchanged. Read more

    source§

    fn flatten_ok<T, E>(self) -> FlattenOk<Self, T, E> ⓘ
    where Self: Iterator<Item = Result<T, E>> + Sized, T: IntoIterator,

    Return an iterator adaptor that flattens every Result::Ok value into -a series of Result::Ok values. Result::Err values are unchanged. Read more
    source§

    fn process_results<F, T, E, R>(self, processor: F) -> Result<R, E>
    where +a series of Result::Ok values. Result::Err values are unchanged. Read more

    source§

    fn process_results<F, T, E, R>(self, processor: F) -> Result<R, E>
    where Self: Iterator<Item = Result<T, E>> + Sized, F: FnOnce(ProcessResults<'_, Self, E>) -> R,

    “Lift” a function of the values of the current iterator so as to process -an iterator of Result values instead. Read more
    source§

    fn merge<J>(self, other: J) -> Merge<Self, J::IntoIter>
    where +an iterator of Result values instead. Read more

    source§

    fn merge<J>(self, other: J) -> Merge<Self, J::IntoIter>
    where Self: Sized, Self::Item: PartialOrd, J: IntoIterator<Item = Self::Item>,

    Return an iterator adaptor that merges the two base iterators in ascending order. If both base iterators are sorted (ascending), the -result is sorted. Read more
    source§

    fn merge_by<J, F>(self, other: J, is_first: F) -> MergeBy<Self, J::IntoIter, F> ⓘ
    where +result is sorted. Read more

    source§

    fn merge_by<J, F>(self, other: J, is_first: F) -> MergeBy<Self, J::IntoIter, F> ⓘ
    where Self: Sized, J: IntoIterator<Item = Self::Item>, F: FnMut(&Self::Item, &Self::Item) -> bool,

    Return an iterator adaptor that merges the two base iterators in order. -This is much like .merge() but allows for a custom ordering. Read more
    source§

    fn merge_join_by<J, F, T>( +This is much like .merge() but allows for a custom ordering. Read more

    source§

    fn merge_join_by<J, F, T>( self, other: J, cmp_fn: F @@ -310,285 +312,296 @@ This is much like IntoIterator, F: FnMut(&Self::Item, &J::Item) -> T, Self: Sized,

    Create an iterator that merges items from both this and the specified -iterator in ascending order. Read more
    source§

    fn kmerge(self) -> KMerge<<Self::Item as IntoIterator>::IntoIter>
    where +iterator in ascending order. Read more

    source§

    fn kmerge(self) -> KMerge<<Self::Item as IntoIterator>::IntoIter>
    where Self: Sized, Self::Item: IntoIterator, <Self::Item as IntoIterator>::Item: PartialOrd,

    Return an iterator adaptor that flattens an iterator of iterators by -merging them in ascending order. Read more
    source§

    fn kmerge_by<F>( +merging them in ascending order. Read more

    source§

    fn kmerge_by<F>( self, first: F ) -> KMergeBy<<Self::Item as IntoIterator>::IntoIter, F> ⓘ
    where Self: Sized, Self::Item: IntoIterator, F: FnMut(&<Self::Item as IntoIterator>::Item, &<Self::Item as IntoIterator>::Item) -> bool,

    Return an iterator adaptor that flattens an iterator of iterators by -merging them according to the given closure. Read more
    source§

    fn cartesian_product<J>(self, other: J) -> Product<Self, J::IntoIter> ⓘ
    where +merging them according to the given closure. Read more

    source§

    fn cartesian_product<J>(self, other: J) -> Product<Self, J::IntoIter> ⓘ
    where Self: Sized, Self::Item: Clone, J: IntoIterator, J::IntoIter: Clone,

    Return an iterator adaptor that iterates over the cartesian product of -the element sets of two iterators self and J. Read more
    source§

    fn multi_cartesian_product( +the element sets of two iterators self and J. Read more

    source§

    fn multi_cartesian_product( self ) -> MultiProduct<<Self::Item as IntoIterator>::IntoIter> ⓘ
    where Self: Sized, Self::Item: IntoIterator, <Self::Item as IntoIterator>::IntoIter: Clone, <Self::Item as IntoIterator>::Item: Clone,

    Return an iterator adaptor that iterates over the cartesian product of -all subiterators returned by meta-iterator self. Read more
    source§

    fn coalesce<F>(self, f: F) -> Coalesce<Self, F>
    where +all subiterators returned by meta-iterator self. Read more

    source§

    fn coalesce<F>(self, f: F) -> Coalesce<Self, F>
    where Self: Sized, F: FnMut(Self::Item, Self::Item) -> Result<Self::Item, (Self::Item, Self::Item)>,

    Return an iterator adaptor that uses the passed-in closure to -optionally merge together consecutive elements. Read more
    source§

    fn dedup(self) -> Dedup<Self>
    where +optionally merge together consecutive elements. Read more

    source§

    fn dedup(self) -> Dedup<Self>
    where Self: Sized, Self::Item: PartialEq,

    Remove duplicates from sections of consecutive identical elements. -If the iterator is sorted, all elements will be unique. Read more
    source§

    fn dedup_by<Cmp>(self, cmp: Cmp) -> DedupBy<Self, Cmp>
    where +If the iterator is sorted, all elements will be unique. Read more

    source§

    fn dedup_by<Cmp>(self, cmp: Cmp) -> DedupBy<Self, Cmp>
    where Self: Sized, Cmp: FnMut(&Self::Item, &Self::Item) -> bool,

    Remove duplicates from sections of consecutive identical elements, determining equality using a comparison function. -If the iterator is sorted, all elements will be unique. Read more
    source§

    fn dedup_with_count(self) -> DedupWithCount<Self>
    where +If the iterator is sorted, all elements will be unique. Read more

    source§

    fn dedup_with_count(self) -> DedupWithCount<Self>
    where Self: Sized,

    Remove duplicates from sections of consecutive identical elements, while keeping a count of how many repeated elements were present. -If the iterator is sorted, all elements will be unique. Read more
    source§

    fn dedup_by_with_count<Cmp>(self, cmp: Cmp) -> DedupByWithCount<Self, Cmp>
    where +If the iterator is sorted, all elements will be unique. Read more

    source§

    fn dedup_by_with_count<Cmp>(self, cmp: Cmp) -> DedupByWithCount<Self, Cmp>
    where Self: Sized, Cmp: FnMut(&Self::Item, &Self::Item) -> bool,

    Remove duplicates from sections of consecutive identical elements, while keeping a count of how many repeated elements were present. This will determine equality using a comparison function. -If the iterator is sorted, all elements will be unique. Read more
    source§

    fn duplicates(self) -> Duplicates<Self>
    where +If the iterator is sorted, all elements will be unique. Read more

    source§

    fn duplicates(self) -> Duplicates<Self>
    where Self: Sized, Self::Item: Eq + Hash,

    Return an iterator adaptor that produces elements that appear more than once during the -iteration. Duplicates are detected using hash and equality. Read more
    source§

    fn duplicates_by<V, F>(self, f: F) -> DuplicatesBy<Self, V, F>
    where +iteration. Duplicates are detected using hash and equality. Read more

    source§

    fn duplicates_by<V, F>(self, f: F) -> DuplicatesBy<Self, V, F>
    where Self: Sized, V: Eq + Hash, F: FnMut(&Self::Item) -> V,

    Return an iterator adaptor that produces elements that appear more than once during the -iteration. Duplicates are detected using hash and equality. Read more
    source§

    fn unique(self) -> Unique<Self> ⓘ
    where +iteration. Duplicates are detected using hash and equality. Read more

    source§

    fn unique(self) -> Unique<Self> ⓘ
    where Self: Sized, Self::Item: Clone + Eq + Hash,

    Return an iterator adaptor that filters out elements that have already been produced once during the iteration. Duplicates -are detected using hash and equality. Read more
    source§

    fn unique_by<V, F>(self, f: F) -> UniqueBy<Self, V, F> ⓘ
    where +are detected using hash and equality. Read more

    source§

    fn unique_by<V, F>(self, f: F) -> UniqueBy<Self, V, F> ⓘ
    where Self: Sized, V: Eq + Hash, F: FnMut(&Self::Item) -> V,

    Return an iterator adaptor that filters out elements that have -already been produced once during the iteration. Read more
    source§

    fn peeking_take_while<F>(&mut self, accept: F) -> PeekingTakeWhile<'_, Self, F> ⓘ
    where +already been produced once during the iteration. Read more

    source§

    fn peeking_take_while<F>(&mut self, accept: F) -> PeekingTakeWhile<'_, Self, F> ⓘ
    where Self: Sized + PeekingNext, F: FnMut(&Self::Item) -> bool,

    Return an iterator adaptor that borrows from this iterator and -takes items while the closure accept returns true. Read more
    source§

    fn take_while_ref<F>(&mut self, accept: F) -> TakeWhileRef<'_, Self, F> ⓘ
    where +takes items while the closure accept returns true. Read more

    source§

    fn take_while_ref<F>(&mut self, accept: F) -> TakeWhileRef<'_, Self, F> ⓘ
    where Self: Clone, F: FnMut(&Self::Item) -> bool,

    Return an iterator adaptor that borrows from a Clone-able iterator -to only pick off elements while the predicate accept returns true. Read more
    source§

    fn take_while_inclusive<F>(self, accept: F) -> TakeWhileInclusive<Self, F> ⓘ
    where +to only pick off elements while the predicate accept returns true. Read more

    source§

    fn take_while_inclusive<F>(self, accept: F) -> TakeWhileInclusive<Self, F> ⓘ
    where Self: Sized, F: FnMut(&Self::Item) -> bool,

    Returns an iterator adaptor that consumes elements while the given predicate is true, including the element for which the predicate -first returned false. Read more
    source§

    fn while_some<A>(self) -> WhileSome<Self> ⓘ
    where +first returned false. Read more

    source§

    fn while_some<A>(self) -> WhileSome<Self> ⓘ
    where Self: Sized + Iterator<Item = Option<A>>,

    Return an iterator adaptor that filters Option<A> iterator elements -and produces A. Stops on the first None encountered. Read more
    source§

    fn tuple_combinations<T>(self) -> TupleCombinations<Self, T> ⓘ
    where +and produces A. Stops on the first None encountered. Read more

    source§

    fn tuple_combinations<T>(self) -> TupleCombinations<Self, T> ⓘ
    where Self: Sized + Clone, Self::Item: Clone, T: HasCombination<Self>,

    Return an iterator adaptor that iterates over the combinations of the -elements from an iterator. Read more
    source§

    fn combinations(self, k: usize) -> Combinations<Self> ⓘ
    where +elements from an iterator. Read more

    source§

    fn combinations(self, k: usize) -> Combinations<Self> ⓘ
    where Self: Sized, Self::Item: Clone,

    Return an iterator adaptor that iterates over the k-length combinations of -the elements from an iterator. Read more
    source§

    fn combinations_with_replacement( +the elements from an iterator. Read more

    source§

    fn combinations_with_replacement( self, k: usize ) -> CombinationsWithReplacement<Self> ⓘ
    where Self: Sized, Self::Item: Clone,

    Return an iterator that iterates over the k-length combinations of -the elements from an iterator, with replacement. Read more
    source§

    fn permutations(self, k: usize) -> Permutations<Self> ⓘ
    where +the elements from an iterator, with replacement. Read more

    source§

    fn permutations(self, k: usize) -> Permutations<Self> ⓘ
    where Self: Sized, Self::Item: Clone,

    Return an iterator adaptor that iterates over all k-permutations of the -elements from an iterator. Read more
    source§

    fn powerset(self) -> Powerset<Self> ⓘ
    where +elements from an iterator. Read more

    source§

    fn powerset(self) -> Powerset<Self> ⓘ
    where Self: Sized, Self::Item: Clone,

    Return an iterator that iterates through the powerset of the elements from an -iterator. Read more
    source§

    fn pad_using<F>(self, min: usize, f: F) -> PadUsing<Self, F> ⓘ
    where +iterator. Read more

    source§

    fn pad_using<F>(self, min: usize, f: F) -> PadUsing<Self, F> ⓘ
    where Self: Sized, F: FnMut(usize) -> Self::Item,

    Return an iterator adaptor that pads the sequence to a minimum length of -min by filling missing elements using a closure f. Read more
    source§

    fn with_position(self) -> WithPosition<Self> ⓘ
    where +min by filling missing elements using a closure f. Read more

    source§

    fn with_position(self) -> WithPosition<Self> ⓘ
    where Self: Sized,

    Return an iterator adaptor that combines each element with a Position to -ease special-case handling of the first or last elements. Read more
    source§

    fn positions<P>(self, predicate: P) -> Positions<Self, P> ⓘ
    where +ease special-case handling of the first or last elements. Read more

    source§

    fn positions<P>(self, predicate: P) -> Positions<Self, P> ⓘ
    where Self: Sized, P: FnMut(Self::Item) -> bool,

    Return an iterator adaptor that yields the indices of all elements -satisfying a predicate, counted from the start of the iterator. Read more
    source§

    fn update<F>(self, updater: F) -> Update<Self, F> ⓘ
    where +satisfying a predicate, counted from the start of the iterator. Read more

    source§

    fn update<F>(self, updater: F) -> Update<Self, F> ⓘ
    where Self: Sized, F: FnMut(&mut Self::Item),

    Return an iterator adaptor that applies a mutating function -to each element before yielding it. Read more
    source§

    fn next_tuple<T>(&mut self) -> Option<T>
    where +to each element before yielding it. Read more

    source§

    fn next_tuple<T>(&mut self) -> Option<T>
    where Self: Sized + Iterator<Item = T::Item>, T: HomogeneousTuple,

    Advances the iterator and returns the next items grouped in a tuple of -a specific size (up to 12). Read more
    source§

    fn collect_tuple<T>(self) -> Option<T>
    where +a specific size (up to 12). Read more

    source§

    fn collect_tuple<T>(self) -> Option<T>
    where Self: Sized + Iterator<Item = T::Item>, T: HomogeneousTuple,

    Collects all items from the iterator into a tuple of a specific size -(up to 12). Read more
    source§

    fn find_position<P>(&mut self, pred: P) -> Option<(usize, Self::Item)>
    where - P: FnMut(&Self::Item) -> bool,

    Find the position and value of the first element satisfying a predicate. Read more
    source§

    fn find_or_last<P>(self, predicate: P) -> Option<Self::Item>
    where +(up to 12). Read more

    source§

    fn find_position<P>(&mut self, pred: P) -> Option<(usize, Self::Item)>
    where + P: FnMut(&Self::Item) -> bool,

    Find the position and value of the first element satisfying a predicate. Read more
    source§

    fn find_or_last<P>(self, predicate: P) -> Option<Self::Item>
    where Self: Sized, - P: FnMut(&Self::Item) -> bool,

    Find the value of the first element satisfying a predicate or return the last element, if any. Read more
    source§

    fn find_or_first<P>(self, predicate: P) -> Option<Self::Item>
    where + P: FnMut(&Self::Item) -> bool,

    Find the value of the first element satisfying a predicate or return the last element, if any. Read more
    source§

    fn find_or_first<P>(self, predicate: P) -> Option<Self::Item>
    where Self: Sized, - P: FnMut(&Self::Item) -> bool,

    Find the value of the first element satisfying a predicate or return the first element, if any. Read more
    source§

    fn contains<Q>(&mut self, query: &Q) -> bool
    where + P: FnMut(&Self::Item) -> bool,

    Find the value of the first element satisfying a predicate or return the first element, if any. Read more
    source§

    fn contains<Q>(&mut self, query: &Q) -> bool
    where Self: Sized, Self::Item: Borrow<Q>, - Q: PartialEq,

    Returns true if the given item is present in this iterator. Read more
    source§

    fn all_equal(&mut self) -> bool
    where + Q: PartialEq,

    Returns true if the given item is present in this iterator. Read more
    source§

    fn all_equal(&mut self) -> bool
    where Self: Sized, - Self::Item: PartialEq,

    Check whether all elements compare equal. Read more
    source§

    fn all_equal_value( + Self::Item: PartialEq,

    Check whether all elements compare equal. Read more
    source§

    fn all_equal_value( &mut self ) -> Result<Self::Item, Option<(Self::Item, Self::Item)>>
    where Self: Sized, Self::Item: PartialEq,

    If there are elements and they are all equal, return a single copy of that element. If there are no elements, return an Error containing None. If there are elements and they are not all equal, return a tuple containing the first -two non-equal elements found. Read more
    source§

    fn all_unique(&mut self) -> bool
    where +two non-equal elements found. Read more

    source§

    fn all_unique(&mut self) -> bool
    where Self: Sized, - Self::Item: Eq + Hash,

    Check whether all elements are unique (non equal). Read more
    source§

    fn dropping(self, n: usize) -> Self
    where + Self::Item: Eq + Hash,

    Check whether all elements are unique (non equal). Read more
    source§

    fn dropping(self, n: usize) -> Self
    where Self: Sized,

    Consume the first n elements from the iterator eagerly, -and return the same iterator again. Read more
    source§

    fn dropping_back(self, n: usize) -> Self
    where +and return the same iterator again. Read more

    source§

    fn dropping_back(self, n: usize) -> Self
    where Self: Sized + DoubleEndedIterator,

    Consume the last n elements from the iterator eagerly, -and return the same iterator again. Read more
    source§

    fn foreach<F>(self, f: F)
    where - F: FnMut(Self::Item), - Self: Sized,

    👎Deprecated since 0.8.0: Use .for_each() instead
    Run the closure f eagerly on each element of the iterator. Read more
    source§

    fn concat(self) -> Self::Item
    where +and return the same iterator again. Read more

    source§

    fn concat(self) -> Self::Item
    where Self: Sized, - Self::Item: Extend<<<Self as Iterator>::Item as IntoIterator>::Item> + IntoIterator + Default,

    Combine all an iterator’s elements into one element by using Extend. Read more
    source§

    fn collect_vec(self) -> Vec<Self::Item>
    where + Self::Item: Extend<<<Self as Iterator>::Item as IntoIterator>::Item> + IntoIterator + Default,

    Combine all an iterator’s elements into one element by using Extend. Read more
    source§

    fn collect_vec(self) -> Vec<Self::Item>
    where Self: Sized,

    .collect_vec() is simply a type specialization of Iterator::collect, -for convenience.
    source§

    fn try_collect<T, U, E>(self) -> Result<U, E>
    where +for convenience.

    source§

    fn try_collect<T, U, E>(self) -> Result<U, E>
    where Self: Sized + Iterator<Item = Result<T, E>>, Result<U, E>: FromIterator<Result<T, E>>,

    .try_collect() is more convenient way of writing -.collect::<Result<_, _>>() Read more
    source§

    fn set_from<'a, A: 'a, J>(&mut self, from: J) -> usize
    where +.collect::<Result<_, _>>() Read more

    source§

    fn set_from<'a, A: 'a, J>(&mut self, from: J) -> usize
    where Self: Iterator<Item = &'a mut A>, J: IntoIterator<Item = A>,

    Assign to each reference in self from the from iterator, -stopping at the shortest of the two iterators. Read more
    source§

    fn join(&mut self, sep: &str) -> String
    where - Self::Item: Display,

    Combine all iterator elements into one String, separated by sep. Read more
    source§

    fn format(self, sep: &str) -> Format<'_, Self>
    where - Self: Sized,

    Format all iterator elements, separated by sep. Read more
    source§

    fn format_with<F>(self, sep: &str, format: F) -> FormatWith<'_, Self, F>
    where +stopping at the shortest of the two iterators. Read more

    source§

    fn join(&mut self, sep: &str) -> String
    where + Self::Item: Display,

    Combine all iterator elements into one String, separated by sep. Read more
    source§

    fn format(self, sep: &str) -> Format<'_, Self>
    where + Self: Sized,

    Format all iterator elements, separated by sep. Read more
    source§

    fn format_with<F>(self, sep: &str, format: F) -> FormatWith<'_, Self, F>
    where Self: Sized, - F: FnMut(Self::Item, &mut dyn FnMut(&dyn Display) -> Result) -> Result,

    Format all iterator elements, separated by sep. Read more
    source§

    fn fold_results<A, E, B, F>(&mut self, start: B, f: F) -> Result<B, E>
    where + F: FnMut(Self::Item, &mut dyn FnMut(&dyn Display) -> Result) -> Result,

    Format all iterator elements, separated by sep. Read more
    source§

    fn fold_ok<A, E, B, F>(&mut self, start: B, f: F) -> Result<B, E>
    where Self: Iterator<Item = Result<A, E>>, - F: FnMut(B, A) -> B,

    👎Deprecated since 0.10.0: Use .fold_ok() instead
    See .fold_ok().
    source§

    fn fold_ok<A, E, B, F>(&mut self, start: B, f: F) -> Result<B, E>
    where - Self: Iterator<Item = Result<A, E>>, - F: FnMut(B, A) -> B,

    Fold Result values from an iterator. Read more
    source§

    fn fold_options<A, B, F>(&mut self, start: B, f: F) -> Option<B>
    where + F: FnMut(B, A) -> B,

    Fold Result values from an iterator. Read more
    source§

    fn fold_options<A, B, F>(&mut self, start: B, f: F) -> Option<B>
    where Self: Iterator<Item = Option<A>>, - F: FnMut(B, A) -> B,

    Fold Option values from an iterator. Read more
    source§

    fn fold1<F>(self, f: F) -> Option<Self::Item>
    where + F: FnMut(B, A) -> B,

    Fold Option values from an iterator. Read more
    source§

    fn fold1<F>(self, f: F) -> Option<Self::Item>
    where F: FnMut(Self::Item, Self::Item) -> Self::Item, - Self: Sized,

    👎Deprecated since 0.10.2: Use Iterator::reduce instead
    Accumulator of the elements in the iterator. Read more
    source§

    fn tree_fold1<F>(self, f: F) -> Option<Self::Item>
    where + Self: Sized,

    👎Deprecated since 0.10.2: Use Iterator::reduce instead
    Accumulator of the elements in the iterator. Read more
    source§

    fn tree_reduce<F>(self, f: F) -> Option<Self::Item>
    where F: FnMut(Self::Item, Self::Item) -> Self::Item, - Self: Sized,

    Accumulate the elements in the iterator in a tree-like manner. Read more
    source§

    fn fold_while<B, F>(&mut self, init: B, f: F) -> FoldWhile<B>
    where + Self: Sized,

    Accumulate the elements in the iterator in a tree-like manner. Read more
    source§

    fn tree_fold1<F>(self, f: F) -> Option<Self::Item>
    where + F: FnMut(Self::Item, Self::Item) -> Self::Item, + Self: Sized,

    👎Deprecated since 0.13.0: Use .tree_reduce() instead
    See .tree_reduce().
    source§

    fn fold_while<B, F>(&mut self, init: B, f: F) -> FoldWhile<B>
    where Self: Sized, - F: FnMut(B, Self::Item) -> FoldWhile<B>,

    An iterator method that applies a function, producing a single, final value. Read more
    source§

    fn sum1<S>(self) -> Option<S>
    where + F: FnMut(B, Self::Item) -> FoldWhile<B>,

    An iterator method that applies a function, producing a single, final value. Read more
    source§

    fn sum1<S>(self) -> Option<S>
    where Self: Sized, - S: Sum<Self::Item>,

    Iterate over the entire iterator and add all the elements. Read more
    source§

    fn product1<P>(self) -> Option<P>
    where + S: Sum<Self::Item>,

    Iterate over the entire iterator and add all the elements. Read more
    source§

    fn product1<P>(self) -> Option<P>
    where Self: Sized, - P: Product<Self::Item>,

    Iterate over the entire iterator and multiply all the elements. Read more
    source§

    fn sorted_unstable(self) -> IntoIter<Self::Item> ⓘ
    where + P: Product<Self::Item>,

    Iterate over the entire iterator and multiply all the elements. Read more
    source§

    fn sorted_unstable(self) -> IntoIter<Self::Item> ⓘ
    where Self: Sized, - Self::Item: Ord,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_unstable_by<F>(self, cmp: F) -> IntoIter<Self::Item> ⓘ
    where + Self::Item: Ord,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_unstable_by<F>(self, cmp: F) -> IntoIter<Self::Item> ⓘ
    where Self: Sized, - F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_unstable_by_key<K, F>(self, f: F) -> IntoIter<Self::Item> ⓘ
    where + F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_unstable_by_key<K, F>(self, f: F) -> IntoIter<Self::Item> ⓘ
    where Self: Sized, K: Ord, - F: FnMut(&Self::Item) -> K,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted(self) -> IntoIter<Self::Item> ⓘ
    where + F: FnMut(&Self::Item) -> K,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted(self) -> IntoIter<Self::Item> ⓘ
    where Self: Sized, - Self::Item: Ord,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_by<F>(self, cmp: F) -> IntoIter<Self::Item> ⓘ
    where + Self::Item: Ord,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_by<F>(self, cmp: F) -> IntoIter<Self::Item> ⓘ
    where Self: Sized, - F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_by_key<K, F>(self, f: F) -> IntoIter<Self::Item> ⓘ
    where + F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_by_key<K, F>(self, f: F) -> IntoIter<Self::Item> ⓘ
    where Self: Sized, K: Ord, - F: FnMut(&Self::Item) -> K,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_by_cached_key<K, F>(self, f: F) -> IntoIter<Self::Item> ⓘ
    where + F: FnMut(&Self::Item) -> K,

    Sort all iterator elements into a new iterator in ascending order. Read more
    source§

    fn sorted_by_cached_key<K, F>(self, f: F) -> IntoIter<Self::Item> ⓘ
    where Self: Sized, K: Ord, F: FnMut(&Self::Item) -> K,

    Sort all iterator elements into a new iterator in ascending order. The key function is -called exactly once per key. Read more
    source§

    fn k_smallest(self, k: usize) -> IntoIter<Self::Item> ⓘ
    where +called exactly once per key. Read more

    source§

    fn k_smallest(self, k: usize) -> IntoIter<Self::Item> ⓘ
    where Self: Sized, - Self::Item: Ord,

    Sort the k smallest elements into a new iterator, in ascending order. Read more
    source§

    fn partition_map<A, B, F, L, R>(self, predicate: F) -> (A, B)
    where + Self::Item: Ord,

    Sort the k smallest elements into a new iterator, in ascending order. Read more
    source§

    fn k_smallest_by<F>(self, k: usize, cmp: F) -> IntoIter<Self::Item> ⓘ
    where + Self: Sized, + F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Sort the k smallest elements into a new iterator using the provided comparison. Read more
    source§

    fn k_smallest_by_key<F, K>(self, k: usize, key: F) -> IntoIter<Self::Item> ⓘ
    where + Self: Sized, + F: FnMut(&Self::Item) -> K, + K: Ord,

    Return the elements producing the k smallest outputs of the provided function. Read more
    source§

    fn k_largest(self, k: usize) -> IntoIter<Self::Item> ⓘ
    where + Self: Sized, + Self::Item: Ord,

    Sort the k largest elements into a new iterator, in descending order. Read more
    source§

    fn k_largest_by<F>(self, k: usize, cmp: F) -> IntoIter<Self::Item> ⓘ
    where + Self: Sized, + F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Sort the k largest elements into a new iterator using the provided comparison. Read more
    source§

    fn k_largest_by_key<F, K>(self, k: usize, key: F) -> IntoIter<Self::Item> ⓘ
    where + Self: Sized, + F: FnMut(&Self::Item) -> K, + K: Ord,

    Return the elements producing the k largest outputs of the provided function. Read more
    source§

    fn tail(self, n: usize) -> IntoIter<Self::Item> ⓘ
    where + Self: Sized,

    Consumes the iterator and return an iterator of the last n elements. Read more
    source§

    fn partition_map<A, B, F, L, R>(self, predicate: F) -> (A, B)
    where Self: Sized, F: FnMut(Self::Item) -> Either<L, R>, A: Default + Extend<L>, B: Default + Extend<R>,

    Collect all iterator elements into one of two partitions. Unlike Iterator::partition, each partition may -have a distinct type. Read more
    source§

    fn partition_result<A, B, T, E>(self) -> (A, B)
    where +have a distinct type. Read more

    source§

    fn partition_result<A, B, T, E>(self) -> (A, B)
    where Self: Iterator<Item = Result<T, E>> + Sized, A: Default + Extend<T>, B: Default + Extend<E>,

    Partition a sequence of Results into one list of all the Ok elements -and another list of all the Err elements. Read more
    source§

    fn into_group_map<K, V>(self) -> HashMap<K, Vec<V>>
    where +and another list of all the Err elements. Read more

    source§

    fn into_group_map<K, V>(self) -> HashMap<K, Vec<V>>
    where Self: Iterator<Item = (K, V)> + Sized, K: Hash + Eq,

    Return a HashMap of keys mapped to Vecs of values. Keys and values -are taken from (Key, Value) tuple pairs yielded by the input iterator. Read more
    source§

    fn into_group_map_by<K, V, F>(self, f: F) -> HashMap<K, Vec<V>>
    where +are taken from (Key, Value) tuple pairs yielded by the input iterator. Read more

    source§

    fn into_group_map_by<K, V, F>(self, f: F) -> HashMap<K, Vec<V>>
    where Self: Iterator<Item = V> + Sized, K: Hash + Eq, - F: Fn(&V) -> K,

    Return an Iterator on a HashMap. Keys mapped to Vecs of values. The key is specified -in the closure. Read more
    source§

    fn into_grouping_map<K, V>(self) -> GroupingMap<Self>
    where + F: FnMut(&V) -> K,

    Return an Iterator on a HashMap. Keys mapped to Vecs of values. The key is specified +in the closure. Read more
    source§

    fn into_grouping_map<K, V>(self) -> GroupingMap<Self>
    where Self: Iterator<Item = (K, V)> + Sized, K: Hash + Eq,

    Constructs a GroupingMap to be used later with one of the efficient -group-and-fold operations it allows to perform. Read more
    source§

    fn into_grouping_map_by<K, V, F>(self, key_mapper: F) -> GroupingMapBy<Self, F>
    where +group-and-fold operations it allows to perform. Read more

    source§

    fn into_grouping_map_by<K, V, F>(self, key_mapper: F) -> GroupingMapBy<Self, F>
    where Self: Iterator<Item = V> + Sized, K: Hash + Eq, F: FnMut(&V) -> K,

    Constructs a GroupingMap to be used later with one of the efficient -group-and-fold operations it allows to perform. Read more
    source§

    fn min_set(self) -> Vec<Self::Item>
    where +group-and-fold operations it allows to perform. Read more

    source§

    fn min_set(self) -> Vec<Self::Item>
    where Self: Sized, - Self::Item: Ord,

    Return all minimum elements of an iterator. Read more
    source§

    fn min_set_by<F>(self, compare: F) -> Vec<Self::Item>
    where + Self::Item: Ord,

    Return all minimum elements of an iterator. Read more
    source§

    fn min_set_by<F>(self, compare: F) -> Vec<Self::Item>
    where Self: Sized, F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Return all minimum elements of an iterator, as determined by -the specified function. Read more
    source§

    fn min_set_by_key<K, F>(self, key: F) -> Vec<Self::Item>
    where +the specified function. Read more

    source§

    fn min_set_by_key<K, F>(self, key: F) -> Vec<Self::Item>
    where Self: Sized, K: Ord, F: FnMut(&Self::Item) -> K,

    Return all minimum elements of an iterator, as determined by -the specified function. Read more
    source§

    fn max_set(self) -> Vec<Self::Item>
    where +the specified function. Read more

    source§

    fn max_set(self) -> Vec<Self::Item>
    where Self: Sized, - Self::Item: Ord,

    Return all maximum elements of an iterator. Read more
    source§

    fn max_set_by<F>(self, compare: F) -> Vec<Self::Item>
    where + Self::Item: Ord,

    Return all maximum elements of an iterator. Read more
    source§

    fn max_set_by<F>(self, compare: F) -> Vec<Self::Item>
    where Self: Sized, F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Return all maximum elements of an iterator, as determined by -the specified function. Read more
    source§

    fn max_set_by_key<K, F>(self, key: F) -> Vec<Self::Item>
    where +the specified function. Read more

    source§

    fn max_set_by_key<K, F>(self, key: F) -> Vec<Self::Item>
    where Self: Sized, K: Ord, F: FnMut(&Self::Item) -> K,

    Return all maximum elements of an iterator, as determined by -the specified function. Read more
    source§

    fn minmax(self) -> MinMaxResult<Self::Item>
    where +the specified function. Read more

    source§

    fn minmax(self) -> MinMaxResult<Self::Item>
    where Self: Sized, - Self::Item: PartialOrd,

    Return the minimum and maximum elements in the iterator. Read more
    source§

    fn minmax_by_key<K, F>(self, key: F) -> MinMaxResult<Self::Item>
    where + Self::Item: PartialOrd,

    Return the minimum and maximum elements in the iterator. Read more
    source§

    fn minmax_by_key<K, F>(self, key: F) -> MinMaxResult<Self::Item>
    where Self: Sized, K: PartialOrd, F: FnMut(&Self::Item) -> K,

    Return the minimum and maximum element of an iterator, as determined by -the specified function. Read more
    source§

    fn minmax_by<F>(self, compare: F) -> MinMaxResult<Self::Item>
    where +the specified function. Read more

    source§

    fn minmax_by<F>(self, compare: F) -> MinMaxResult<Self::Item>
    where Self: Sized, F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Return the minimum and maximum element of an iterator, as determined by -the specified comparison function. Read more
    source§

    fn position_max(self) -> Option<usize>
    where +the specified comparison function. Read more

    source§

    fn position_max(self) -> Option<usize>
    where Self: Sized, - Self::Item: Ord,

    Return the position of the maximum element in the iterator. Read more
    source§

    fn position_max_by_key<K, F>(self, key: F) -> Option<usize>
    where + Self::Item: Ord,

    Return the position of the maximum element in the iterator. Read more
    source§

    fn position_max_by_key<K, F>(self, key: F) -> Option<usize>
    where Self: Sized, K: Ord, F: FnMut(&Self::Item) -> K,

    Return the position of the maximum element in the iterator, as -determined by the specified function. Read more
    source§

    fn position_max_by<F>(self, compare: F) -> Option<usize>
    where +determined by the specified function. Read more

    source§

    fn position_max_by<F>(self, compare: F) -> Option<usize>
    where Self: Sized, F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Return the position of the maximum element in the iterator, as -determined by the specified comparison function. Read more
    source§

    fn position_min(self) -> Option<usize>
    where +determined by the specified comparison function. Read more

    source§

    fn position_min(self) -> Option<usize>
    where Self: Sized, - Self::Item: Ord,

    Return the position of the minimum element in the iterator. Read more
    source§

    fn position_min_by_key<K, F>(self, key: F) -> Option<usize>
    where + Self::Item: Ord,

    Return the position of the minimum element in the iterator. Read more
    source§

    fn position_min_by_key<K, F>(self, key: F) -> Option<usize>
    where Self: Sized, K: Ord, F: FnMut(&Self::Item) -> K,

    Return the position of the minimum element in the iterator, as -determined by the specified function. Read more
    source§

    fn position_min_by<F>(self, compare: F) -> Option<usize>
    where +determined by the specified function. Read more

    source§

    fn position_min_by<F>(self, compare: F) -> Option<usize>
    where Self: Sized, F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Return the position of the minimum element in the iterator, as -determined by the specified comparison function. Read more
    source§

    fn position_minmax(self) -> MinMaxResult<usize>
    where +determined by the specified comparison function. Read more

    source§

    fn position_minmax(self) -> MinMaxResult<usize>
    where Self: Sized, Self::Item: PartialOrd,

    Return the positions of the minimum and maximum elements in -the iterator. Read more
    source§

    fn position_minmax_by_key<K, F>(self, key: F) -> MinMaxResult<usize>
    where +the iterator. Read more

    source§

    fn position_minmax_by_key<K, F>(self, key: F) -> MinMaxResult<usize>
    where Self: Sized, K: PartialOrd, F: FnMut(&Self::Item) -> K,

    Return the postions of the minimum and maximum elements of an -iterator, as determined by the specified function. Read more
    source§

    fn position_minmax_by<F>(self, compare: F) -> MinMaxResult<usize>
    where +iterator, as determined by the specified function. Read more

    source§

    fn position_minmax_by<F>(self, compare: F) -> MinMaxResult<usize>
    where Self: Sized, F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Return the postions of the minimum and maximum elements of an -iterator, as determined by the specified comparison function. Read more
    source§

    fn exactly_one(self) -> Result<Self::Item, ExactlyOneError<Self>>
    where +iterator, as determined by the specified comparison function. Read more

    source§

    fn exactly_one(self) -> Result<Self::Item, ExactlyOneError<Self>>
    where Self: Sized,

    If the iterator yields exactly one element, that element will be returned, otherwise an error will be returned containing an iterator that has the same output as the input -iterator. Read more
    source§

    fn at_most_one(self) -> Result<Option<Self::Item>, ExactlyOneError<Self>>
    where - Self: Sized,

    If the iterator yields no elements, Ok(None) will be returned. If the iterator yields +iterator. Read more
    source§

    fn at_most_one(self) -> Result<Option<Self::Item>, ExactlyOneError<Self>>
    where + Self: Sized,

    If the iterator yields no elements, Ok(None) will be returned. If the iterator yields exactly one element, that element will be returned, otherwise an error will be returned -containing an iterator that has the same output as the input iterator. Read more
    source§

    fn multipeek(self) -> MultiPeek<Self> ⓘ
    where +containing an iterator that has the same output as the input iterator. Read more

    source§

    fn multipeek(self) -> MultiPeek<Self> ⓘ
    where Self: Sized,

    An iterator adaptor that allows the user to peek at multiple .next() -values without advancing the base iterator. Read more
    source§

    fn counts(self) -> HashMap<Self::Item, usize>
    where +values without advancing the base iterator. Read more

    source§

    fn counts(self) -> HashMap<Self::Item, usize>
    where Self: Sized, Self::Item: Eq + Hash,

    Collect the items in this iterator and return a HashMap which contains each item that appears in the iterator and the number -of times it appears. Read more
    source§

    fn counts_by<K, F>(self, f: F) -> HashMap<K, usize>
    where +of times it appears. Read more

    source§

    fn counts_by<K, F>(self, f: F) -> HashMap<K, usize>
    where Self: Sized, K: Eq + Hash, F: FnMut(Self::Item) -> K,

    Collect the items in this iterator and return a HashMap which contains each item that appears in the iterator and the number of times it appears, -determining identity using a keying function. Read more
    source§

    fn multiunzip<FromI>(self) -> FromI
    where - Self: Sized + MultiUnzip<FromI>,

    Converts an iterator of tuples into a tuple of containers. Read more
    source§

    fn try_len(&self) -> Result<usize, (usize, Option<usize>)>

    Returns the length of the iterator if one exists. +determining identity using a keying function. Read more
    source§

    fn multiunzip<FromI>(self) -> FromI
    where + Self: Sized + MultiUnzip<FromI>,

    Converts an iterator of tuples into a tuple of containers. Read more
    source§

    fn try_len(&self) -> Result<usize, (usize, Option<usize>)>

    Returns the length of the iterator if one exists. Otherwise return self.size_hint(). Read more
    source§

    impl<T> 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 + 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/itertools/structs/type.Coalesce.html b/itertools/structs/type.Coalesce.html index fb703d01e..ae91371ea 100644 --- a/itertools/structs/type.Coalesce.html +++ b/itertools/structs/type.Coalesce.html @@ -1,4 +1,4 @@ -Coalesce in itertools::structs - Rust
    +Coalesce in itertools::structs - Rust

    Type Alias itertools::structs::Coalesce

    source · 
    pub type Coalesce<I, F> = CoalesceBy<I, F, NoCount>;
    Expand description

    An iterator adaptor that may join together adjacent elements.

    See .coalesce() for more information.

    Aliased Type§

    struct Coalesce<I, F> { /* private fields */ }
    \ No newline at end of file diff --git a/itertools/structs/type.Dedup.html b/itertools/structs/type.Dedup.html index 7fafb1c79..acbe8d534 100644 --- a/itertools/structs/type.Dedup.html +++ b/itertools/structs/type.Dedup.html @@ -1,4 +1,4 @@ -Dedup in itertools::structs - Rust
    +Dedup in itertools::structs - Rust

    Type Alias itertools::structs::Dedup

    source · 
    pub type Dedup<I> = DedupBy<I, DedupEq>;
    Expand description

    An iterator adaptor that removes repeated duplicates.

    See .dedup() for more information.

    Aliased Type§

    struct Dedup<I> { /* private fields */ }
    \ No newline at end of file diff --git a/itertools/structs/type.DedupBy.html b/itertools/structs/type.DedupBy.html index 2572cfc54..4eaa025b7 100644 --- a/itertools/structs/type.DedupBy.html +++ b/itertools/structs/type.DedupBy.html @@ -1,4 +1,4 @@ -DedupBy in itertools::structs - Rust
    +DedupBy in itertools::structs - Rust

    Type Alias itertools::structs::DedupBy

    source · 
    pub type DedupBy<I, Pred> = CoalesceBy<I, DedupPred2CoalescePred<Pred>, NoCount>;
    Expand description

    An iterator adaptor that removes repeated duplicates, determining equality using a comparison function.

    See .dedup_by() or .dedup() for more information.

    Aliased Type§

    struct DedupBy<I, Pred> { /* private fields */ }
    \ No newline at end of file diff --git a/itertools/structs/type.DedupByWithCount.html b/itertools/structs/type.DedupByWithCount.html index 35770976c..04f3e8166 100644 --- a/itertools/structs/type.DedupByWithCount.html +++ b/itertools/structs/type.DedupByWithCount.html @@ -1,4 +1,4 @@ -DedupByWithCount in itertools::structs - Rust
    +DedupByWithCount in itertools::structs - Rust

    Type Alias itertools::structs::DedupByWithCount

    source · 
    pub type DedupByWithCount<I, Pred> = CoalesceBy<I, DedupPredWithCount2CoalescePred<Pred>, WithCount>;
    Expand description

    An iterator adaptor that removes repeated duplicates, while keeping a count of how many repeated elements were present. This will determine equality using a comparison function.

    See .dedup_by_with_count() or diff --git a/itertools/structs/type.DedupWithCount.html b/itertools/structs/type.DedupWithCount.html index ea92d515f..a59bb7594 100644 --- a/itertools/structs/type.DedupWithCount.html +++ b/itertools/structs/type.DedupWithCount.html @@ -1,4 +1,4 @@ -DedupWithCount in itertools::structs - Rust

    +DedupWithCount in itertools::structs - Rust

    Type Alias itertools::structs::DedupWithCount

    source · 
    pub type DedupWithCount<I> = DedupByWithCount<I, DedupEq>;
    Expand description

    An iterator adaptor that removes repeated duplicates, while keeping a count of how many repeated elements were present.

    See .dedup_with_count() for more information.

    diff --git a/itertools/structs/type.Duplicates.html b/itertools/structs/type.Duplicates.html index 25be73595..7d51309cf 100644 --- a/itertools/structs/type.Duplicates.html +++ b/itertools/structs/type.Duplicates.html @@ -1,4 +1,4 @@ -Duplicates in itertools::structs - Rust
    +Duplicates in itertools::structs - Rust

    Type Alias itertools::structs::Duplicates

    source · 
    pub type Duplicates<I> = DuplicatesBy<I, <I as Iterator>::Item, ById>;
    Expand description

    An iterator adapter to filter out duplicate elements.

    See .duplicates() for more information.

    Aliased Type§

    struct Duplicates<I> { /* private fields */ }
    \ No newline at end of file diff --git a/itertools/structs/type.DuplicatesBy.html b/itertools/structs/type.DuplicatesBy.html index b0d2e6a52..edbcd664d 100644 --- a/itertools/structs/type.DuplicatesBy.html +++ b/itertools/structs/type.DuplicatesBy.html @@ -1,4 +1,4 @@ -DuplicatesBy in itertools::structs - Rust
    +DuplicatesBy in itertools::structs - Rust

    Type Alias itertools::structs::DuplicatesBy

    source · 
    pub type DuplicatesBy<I, V, F> = DuplicatesBy<I, V, ByFn<F>>;
    Expand description

    An iterator adapter to filter for duplicate elements.

    See .duplicates_by() for more information.

    Aliased Type§

    struct DuplicatesBy<I, V, F> { /* private fields */ }
    \ No newline at end of file diff --git a/itertools/structs/type.GroupBy.html b/itertools/structs/type.GroupBy.html new file mode 100644 index 000000000..1c2419d7e --- /dev/null +++ b/itertools/structs/type.GroupBy.html @@ -0,0 +1,3 @@ +GroupBy in itertools::structs - Rust
    +

    Type Alias itertools::structs::GroupBy

    source · 
    pub type GroupBy<K, I, F> = ChunkBy<K, I, F>;
    👎Deprecated since 0.13.0: Use ChunkBy instead
    Expand description

    See ChunkBy.

    +

    Aliased Type§

    struct GroupBy<K, I, F> { /* private fields */ }
    \ No newline at end of file diff --git a/itertools/structs/type.GroupingMapBy.html b/itertools/structs/type.GroupingMapBy.html index 11be31a2f..b23568128 100644 --- a/itertools/structs/type.GroupingMapBy.html +++ b/itertools/structs/type.GroupingMapBy.html @@ -1,4 +1,4 @@ -GroupingMapBy in itertools::structs - Rust
    -

    Type Alias itertools::structs::GroupingMapBy

    source · 
    pub type GroupingMapBy<I, F> = GroupingMap<MapForGrouping<I, F>>;
    Expand description

    GroupingMapBy is an intermediate struct for efficient group-and-fold operations.

    +GroupingMapBy in itertools::structs - Rust
    +

    Type Alias itertools::structs::GroupingMapBy

    source · 
    pub type GroupingMapBy<I, F> = GroupingMap<MapSpecialCase<I, GroupingMapFn<F>>>;
    Expand description

    GroupingMapBy is an intermediate struct for efficient group-and-fold operations.

    See GroupingMap for more informations.

    Aliased Type§

    struct GroupingMapBy<I, F> { /* private fields */ }
    \ No newline at end of file diff --git a/itertools/structs/type.Intersperse.html b/itertools/structs/type.Intersperse.html index cdcb426fd..505e74c2c 100644 --- a/itertools/structs/type.Intersperse.html +++ b/itertools/structs/type.Intersperse.html @@ -1,4 +1,4 @@ -Intersperse in itertools::structs - Rust
    +Intersperse in itertools::structs - Rust

    Type Alias itertools::structs::Intersperse

    source · 
    pub type Intersperse<I> = IntersperseWith<I, IntersperseElementSimple<<I as Iterator>::Item>>;
    Expand description

    An iterator adaptor to insert a particular value between each element of the adapted iterator.

    Iterator element type is I::Item

    diff --git a/itertools/structs/type.KMerge.html b/itertools/structs/type.KMerge.html index 60a3cb587..e010cef7a 100644 --- a/itertools/structs/type.KMerge.html +++ b/itertools/structs/type.KMerge.html @@ -1,4 +1,4 @@ -KMerge in itertools::structs - Rust
    +KMerge in itertools::structs - Rust

    Type Alias itertools::structs::KMerge

    source · 
    pub type KMerge<I> = KMergeBy<I, KMergeByLt>;
    Expand description

    An iterator adaptor that merges an abitrary number of base iterators in ascending order. If all base iterators are sorted (ascending), the result is sorted.

    Iterator element type is I::Item.

    diff --git a/itertools/structs/type.MapInto.html b/itertools/structs/type.MapInto.html index f6e43e7ea..f6f83b27f 100644 --- a/itertools/structs/type.MapInto.html +++ b/itertools/structs/type.MapInto.html @@ -1,4 +1,4 @@ -MapInto in itertools::structs - Rust
    -

    Type Alias itertools::structs::MapInto

    source · 
    pub type MapInto<I, R> = MapSpecialCase<I, MapSpecialCaseFnInto<R>>;
    Expand description

    An iterator adapter to apply Into conversion to each element.

    +MapInto in itertools::structs - Rust
    +

    Type Alias itertools::structs::MapInto

    source · 
    pub type MapInto<I, R> = MapSpecialCase<I, MapSpecialCaseFnInto<R>>;
    Expand description

    An iterator adapter to apply Into conversion to each element.

    See .map_into() for more information.

    Aliased Type§

    struct MapInto<I, R> { /* private fields */ }
    \ No newline at end of file diff --git a/itertools/structs/type.MapOk.html b/itertools/structs/type.MapOk.html index b63df9920..faa12a385 100644 --- a/itertools/structs/type.MapOk.html +++ b/itertools/structs/type.MapOk.html @@ -1,4 +1,4 @@ -MapOk in itertools::structs - Rust
    +MapOk in itertools::structs - Rust

    Type Alias itertools::structs::MapOk

    source · 
    pub type MapOk<I, F> = MapSpecialCase<I, MapSpecialCaseFnOk<F>>;
    Expand description

    An iterator adapter to apply a transformation within a nested Result::Ok.

    See .map_ok() for more information.

    Aliased Type§

    struct MapOk<I, F> { /* private fields */ }
    \ No newline at end of file diff --git a/itertools/structs/type.MapResults.html b/itertools/structs/type.MapResults.html deleted file mode 100644 index bae26c533..000000000 --- a/itertools/structs/type.MapResults.html +++ /dev/null @@ -1,3 +0,0 @@ -MapResults in itertools::structs - Rust
    -

    Type Alias itertools::structs::MapResults

    source · 
    pub type MapResults<I, F> = MapOk<I, F>;
    👎Deprecated since 0.10.0: Use MapOk instead
    Expand description

    See MapOk.

    -

    Aliased Type§

    struct MapResults<I, F> { /* private fields */ }
    \ No newline at end of file diff --git a/itertools/structs/type.Merge.html b/itertools/structs/type.Merge.html index 4116c6bb3..819c1e971 100644 --- a/itertools/structs/type.Merge.html +++ b/itertools/structs/type.Merge.html @@ -1,4 +1,4 @@ -Merge in itertools::structs - Rust
    +Merge in itertools::structs - Rust

    Type Alias itertools::structs::Merge

    source · 
    pub type Merge<I, J> = MergeBy<I, J, MergeLte>;
    Expand description

    An iterator adaptor that merges the two base iterators in ascending order. If both base iterators are sorted (ascending), the result is sorted.

    Iterator element type is I::Item.

    diff --git a/itertools/structs/type.MergeJoinBy.html b/itertools/structs/type.MergeJoinBy.html index 87d9f11a3..be983f35e 100644 --- a/itertools/structs/type.MergeJoinBy.html +++ b/itertools/structs/type.MergeJoinBy.html @@ -1,4 +1,4 @@ -MergeJoinBy in itertools::structs - Rust
    +MergeJoinBy in itertools::structs - Rust

    Type Alias itertools::structs::MergeJoinBy

    source · 
    pub type MergeJoinBy<I, J, F> = MergeBy<I, J, MergeFuncLR<F, <F as FuncLR<<I as Iterator>::Item, <J as Iterator>::Item>>::T>>;
    Expand description

    An iterator adaptor that merge-joins items from the two base iterators in ascending order.

    See .merge_join_by() for more information.

    Aliased Type§

    struct MergeJoinBy<I, J, F> { /* private fields */ }
    \ No newline at end of file diff --git a/itertools/trait.Itertools.html b/itertools/trait.Itertools.html index 7f5294988..1e2659347 100644 --- a/itertools/trait.Itertools.html +++ b/itertools/trait.Itertools.html @@ -1,6 +1,6 @@ -Itertools in itertools - Rust
    -

    Trait itertools::Itertools

    source · 
    pub trait Itertools: Iterator {
-
    Show 116 methods    // Provided methods
+Itertools in itertools - Rust
    
+    
    Trait itertools::Itertools
    source · 
    pub trait Itertools: Iterator {
+
    Show 121 methods    // Provided methods
     fn interleave<J>(self, other: J) -> Interleave<Self, J::IntoIter> ⓘ
        where J: IntoIterator<Item = Self::Item>,
              Self: Sized { ... }
@@ -16,6 +16,9 @@
     fn intersperse_with<F>(self, element: F) -> IntersperseWith<Self, F> ⓘ
        where Self: Sized,
              F: FnMut() -> Self::Item { ... }
+    fn get<R>(self, index: R) -> R::Output
+       where Self: Sized,
+             R: IteratorIndex<Self> { ... }
     fn zip_longest<J>(self, other: J) -> ZipLongest<Self, J::IntoIter> ⓘ
        where J: IntoIterator,
              Self: Sized { ... }
@@ -25,7 +28,11 @@
     fn batching<B, F>(self, f: F) -> Batching<Self, F> ⓘ
        where F: FnMut(&mut Self) -> Option<B>,
              Self: Sized { ... }
-    fn group_by<K, F>(self, key: F) -> GroupBy<K, Self, F>
+    fn chunk_by<K, F>(self, key: F) -> ChunkBy<K, Self, F>
+       where Self: Sized,
+             F: FnMut(&Self::Item) -> K,
+             K: PartialEq { ... }
+    fn group_by<K, F>(self, key: F) -> ChunkBy<K, Self, F>
        where Self: Sized,
              F: FnMut(&Self::Item) -> K,
              K: PartialEq { ... }
@@ -45,14 +52,9 @@
     fn tee(self) -> (Tee<Self>, Tee<Self>)
        where Self: Sized,
              Self::Item: Clone { ... }
-    fn step(self, n: usize) -> Step<Self> ⓘ
-       where Self: Sized { ... }
     fn map_into<R>(self) -> MapInto<Self, R>
        where Self: Sized,
              Self::Item: Into<R> { ... }
-    fn map_results<F, T, U, E>(self, f: F) -> MapOk<Self, F>
-       where Self: Iterator<Item = Result<T, E>> + Sized,
-             F: FnMut(T) -> U { ... }
     fn map_ok<F, T, U, E>(self, f: F) -> MapOk<Self, F>
        where Self: Iterator<Item = Result<T, E>> + Sized,
              F: FnMut(T) -> U { ... }
@@ -216,9 +218,6 @@
        where Self: Sized { ... }
     fn dropping_back(self, n: usize) -> Self
        where Self: Sized + DoubleEndedIterator { ... }
-    fn foreach<F>(self, f: F)
-       where F: FnMut(Self::Item),
-             Self: Sized { ... }
     fn concat(self) -> Self::Item
        where Self: Sized,
              Self::Item: Extend<<<Self as Iterator>::Item as IntoIterator>::Item> + IntoIterator + Default { ... }
@@ -237,9 +236,6 @@
     fn format_with<F>(self, sep: &str, format: F) -> FormatWith<'_, Self, F>
        where Self: Sized,
              F: FnMut(Self::Item, &mut dyn FnMut(&dyn Display) -> Result) -> Result { ... }
-    fn fold_results<A, E, B, F>(&mut self, start: B, f: F) -> Result<B, E>
-       where Self: Iterator<Item = Result<A, E>>,
-             F: FnMut(B, A) -> B { ... }
     fn fold_ok<A, E, B, F>(&mut self, start: B, f: F) -> Result<B, E>
        where Self: Iterator<Item = Result<A, E>>,
              F: FnMut(B, A) -> B { ... }
@@ -249,6 +245,9 @@
     fn fold1<F>(self, f: F) -> Option<Self::Item>
        where F: FnMut(Self::Item, Self::Item) -> Self::Item,
              Self: Sized { ... }
+    fn tree_reduce<F>(self, f: F) -> Option<Self::Item>
+       where F: FnMut(Self::Item, Self::Item) -> Self::Item,
+             Self: Sized { ... }
     fn tree_fold1<F>(self, f: F) -> Option<Self::Item>
        where F: FnMut(Self::Item, Self::Item) -> Self::Item,
              Self: Sized { ... }
@@ -288,6 +287,25 @@
     fn k_smallest(self, k: usize) -> IntoIter<Self::Item> ⓘ
        where Self: Sized,
              Self::Item: Ord { ... }
+    fn k_smallest_by<F>(self, k: usize, cmp: F) -> IntoIter<Self::Item> ⓘ
+       where Self: Sized,
+             F: FnMut(&Self::Item, &Self::Item) -> Ordering { ... }
+    fn k_smallest_by_key<F, K>(self, k: usize, key: F) -> IntoIter<Self::Item> ⓘ
+       where Self: Sized,
+             F: FnMut(&Self::Item) -> K,
+             K: Ord { ... }
+    fn k_largest(self, k: usize) -> IntoIter<Self::Item> ⓘ
+       where Self: Sized,
+             Self::Item: Ord { ... }
+    fn k_largest_by<F>(self, k: usize, cmp: F) -> IntoIter<Self::Item> ⓘ
+       where Self: Sized,
+             F: FnMut(&Self::Item, &Self::Item) -> Ordering { ... }
+    fn k_largest_by_key<F, K>(self, k: usize, key: F) -> IntoIter<Self::Item> ⓘ
+       where Self: Sized,
+             F: FnMut(&Self::Item) -> K,
+             K: Ord { ... }
+    fn tail(self, n: usize) -> IntoIter<Self::Item> ⓘ
+       where Self: Sized { ... }
     fn partition_map<A, B, F, L, R>(self, predicate: F) -> (A, B)
        where Self: Sized,
              F: FnMut(Self::Item) -> Either<L, R>,
@@ -303,7 +321,7 @@
     fn into_group_map_by<K, V, F>(self, f: F) -> HashMap<K, Vec<V>>
        where Self: Iterator<Item = V> + Sized,
              K: Hash + Eq,
-             F: Fn(&V) -> K { ... }
+             F: FnMut(&V) -> K { ... }
     fn into_grouping_map<K, V>(self) -> GroupingMap<Self>
        where Self: Iterator<Item = (K, V)> + Sized,
              K: Hash + Eq { ... }
@@ -406,7 +424,7 @@ return a regular value of some other kind.
 method in the list.
    
 
 
-
    Provided Methods§
    source
    fn interleave<J>(self, other: J) -> Interleave<Self, J::IntoIter> ⓘ
    where
+
    Provided Methods§
    source
    fn interleave<J>(self, other: J) -> Interleave<Self, J::IntoIter> ⓘ
    where
     J: IntoIterator<Item = Self::Item>,
     Self: Sized,
    Alternate elements from two iterators until both have run out.
    
 
    Iterator element type is Self::Item.
    
@@ -416,7 +434,7 @@ method in the list.
    
 
 let it = (1..7).interleave(vec![-1, -2]);
 itertools::assert_equal(it, vec![1, -1, 2, -2, 3, 4, 5, 6]);
    -
    source

    fn interleave_shortest<J>( +

    source

    fn interleave_shortest<J>( self, other: J ) -> InterleaveShortest<Self, J::IntoIter> ⓘ
    where @@ -429,7 +447,7 @@ out.

    let it = (1..7).interleave_shortest(vec![-1, -2]); itertools::assert_equal(it, vec![1, -1, 2, -2, 3]);
    -

    source

    fn intersperse(self, element: Self::Item) -> Intersperse<Self>
    where +

    source

    fn intersperse(self, element: Self::Item) -> Intersperse<Self>
    where Self: Sized, Self::Item: Clone,

    An iterator adaptor to insert a particular value between each element of the adapted iterator.

    @@ -439,7 +457,7 @@ between each element of the adapted iterator.

    use itertools::Itertools;
 
 itertools::assert_equal((0..3).intersperse(8), vec![0, 8, 1, 8, 2]);
    -
    source

    fn intersperse_with<F>(self, element: F) -> IntersperseWith<Self, F> ⓘ
    where +

    source

    fn intersperse_with<F>(self, element: F) -> IntersperseWith<Self, F> ⓘ
    where Self: Sized, F: FnMut() -> Self::Item,

    An iterator adaptor to insert a particular value created by a function between each element of the adapted iterator.

    @@ -451,7 +469,45 @@ between each element of the adapted iterator.

    let mut i = 10; itertools::assert_equal((0..3).intersperse_with(|| { i -= 1; i }), vec![0, 9, 1, 8, 2]); assert_eq!(i, 8);
    -
    source

    fn zip_longest<J>(self, other: J) -> ZipLongest<Self, J::IntoIter> ⓘ
    where +

    source

    fn get<R>(self, index: R) -> R::Output
    where + Self: Sized, + R: IteratorIndex<Self>,

    Returns an iterator over a subsection of the iterator.

    +

    Works similarly to slice::get.

    +

    Panics for ranges ..=usize::MAX and 0..=usize::MAX.

    +

    It’s a generalisation of Iterator::take and Iterator::skip, +and uses these under the hood. +Therefore, the resulting iterator is:

    + +
    §Unspecified Behavior
    +

    The result of indexing with an exhausted core::ops::RangeInclusive is unspecified.

    +
    §Examples
    +
    use itertools::Itertools;
+
+let vec = vec![3, 1, 4, 1, 5];
+
+let mut range: Vec<_> =
+        vec.iter().get(1..=3).copied().collect();
+assert_eq!(&range, &[1, 4, 1]);
+
+// It works with other types of ranges, too
+range = vec.iter().get(..2).copied().collect();
+assert_eq!(&range, &[3, 1]);
+
+range = vec.iter().get(0..1).copied().collect();
+assert_eq!(&range, &[3]);
+
+range = vec.iter().get(2..).copied().collect();
+assert_eq!(&range, &[4, 1, 5]);
+
+range = vec.iter().get(..=2).copied().collect();
+assert_eq!(&range, &[3, 1, 4]);
+
+range = vec.iter().get(..).copied().collect();
+assert_eq!(range, vec);
    +
    source

    fn zip_longest<J>(self, other: J) -> ZipLongest<Self, J::IntoIter> ⓘ
    where J: IntoIterator, Self: Sized,

    Create an iterator which iterates over both this and the specified iterator simultaneously, yielding pairs of two optional elements.

    @@ -471,13 +527,13 @@ will return None.

    use itertools::Itertools; let it = (0..1).zip_longest(1..3); itertools::assert_equal(it, vec![Both(0, 1), Right(2)]);
    -
    source

    fn zip_eq<J>(self, other: J) -> ZipEq<Self, J::IntoIter> ⓘ
    where +

    source

    fn zip_eq<J>(self, other: J) -> ZipEq<Self, J::IntoIter> ⓘ
    where J: IntoIterator, Self: Sized,

    Create an iterator which iterates over both this and the specified iterator simultaneously, yielding pairs of elements.

    Panics if the iterators reach an end and they are not of equal lengths.

    -
    source

    fn batching<B, F>(self, f: F) -> Batching<Self, F> ⓘ
    where +

    source

    fn batching<B, F>(self, f: F) -> Batching<Self, F> ⓘ
    where F: FnMut(&mut Self) -> Option<B>, Self: Sized,

    A “meta iterator adaptor”. Its closure receives a reference to the iterator and may pick off as many elements as it likes, to produce the @@ -498,15 +554,15 @@ next iterator element.

    }); itertools::assert_equal(pit, vec![(0, 1), (2, 3)]);
    -
    source

    fn group_by<K, F>(self, key: F) -> GroupBy<K, Self, F>
    where +

    source

    fn chunk_by<K, F>(self, key: F) -> ChunkBy<K, Self, F>
    where Self: Sized, F: FnMut(&Self::Item) -> K, K: PartialEq,

    Return an iterable that can group iterator elements. Consecutive elements that map to the same key (“runs”), are assigned to the same group.

    -

    GroupBy is the storage for the lazy grouping operation.

    +

    ChunkBy is the storage for the lazy grouping operation.

    If the groups are consumed in order, or if each group’s iterator is -dropped without keeping it around, then GroupBy uses no +dropped without keeping it around, then ChunkBy uses no allocations. It needs allocations only if several group iterators are alive at the same time.

    This type implements IntoIterator (it is not an iterator @@ -518,23 +574,27 @@ group iterator.

    use itertools::Itertools;
 
-// group data into runs of larger than zero or not.
+// chunk data into runs of larger than zero or not.
 let data = vec![1, 3, -2, -2, 1, 0, 1, 2];
-// groups:     |---->|------>|--------->|
+// chunks:     |---->|------>|--------->|
 
-// Note: The `&` is significant here, `GroupBy` is iterable
+// Note: The `&` is significant here, `ChunkBy` is iterable
 // only by reference. You can also call `.into_iter()` explicitly.
 let mut data_grouped = Vec::new();
-for (key, group) in &data.into_iter().group_by(|elt| *elt >= 0) {
-    data_grouped.push((key, group.collect()));
+for (key, chunk) in &data.into_iter().chunk_by(|elt| *elt >= 0) {
+    data_grouped.push((key, chunk.collect()));
 }
 assert_eq!(data_grouped, vec![(true, vec![1, 3]), (false, vec![-2, -2]), (true, vec![1, 0, 1, 2])]);
    -
    source

    fn chunks(self, size: usize) -> IntoChunks<Self>
    where +

    source

    fn group_by<K, F>(self, key: F) -> ChunkBy<K, Self, F>
    where + Self: Sized, + F: FnMut(&Self::Item) -> K, + K: PartialEq,

    👎Deprecated since 0.13.0: Use .chunk_by() instead

    See .chunk_by().

    +
    source

    fn chunks(self, size: usize) -> IntoChunks<Self>
    where Self: Sized,

    Return an iterable that can chunk the iterator.

    Yield subiterators (chunks) that each yield a fixed number elements, determined by size. The last chunk will be shorter if there aren’t enough elements.

    -

    IntoChunks is based on GroupBy: it is iterable (implements +

    IntoChunks is based on ChunkBy: it is iterable (implements IntoIterator, not Iterator), and it only buffers if several chunk iterators are alive at the same time.

    Iterator element type is Chunk, each chunk’s iterator.

    @@ -551,7 +611,7 @@ chunk iterators are alive at the same time.

    // Check that the sum of each chunk is 4. assert_eq!(4, chunk.sum()); }
    -
    source

    fn tuple_windows<T>(self) -> TupleWindows<Self, T> ⓘ
    where +

    source

    fn tuple_windows<T>(self) -> TupleWindows<Self, T> ⓘ
    where Self: Sized + Iterator<Item = T::Item>, T: HomogeneousTuple, T::Item: Clone,

    Return an iterator over all contiguous windows producing tuples of @@ -584,7 +644,7 @@ itertools::assert_equal(it, vec![(let it: TupleWindows<Range<u32>, (u32, u32, u32)> = (1..5).tuple_windows(); itertools::assert_equal(it, vec![(1, 2, 3), (2, 3, 4)]);

    -
    source

    fn circular_tuple_windows<T>(self) -> CircularTupleWindows<Self, T> ⓘ
    where +

    source

    fn circular_tuple_windows<T>(self) -> CircularTupleWindows<Self, T> ⓘ
    where Self: Sized + Clone + Iterator<Item = T::Item> + ExactSizeIterator, T: TupleCollect + Clone, T::Item: Clone,

    Return an iterator over all windows, wrapping back to the first @@ -611,7 +671,7 @@ of references and other values that are cheap to copy.

    // this requires a type hint let it = (1..5).circular_tuple_windows::<(_, _, _)>(); itertools::assert_equal(it, vec![(1, 2, 3), (2, 3, 4), (3, 4, 1), (4, 1, 2)]);
    -
    source

    fn tuples<T>(self) -> Tuples<Self, T> ⓘ
    where +

    source

    fn tuples<T>(self) -> Tuples<Self, T> ⓘ
    where Self: Sized + Iterator<Item = T::Item>, T: HomogeneousTuple,

    Return an iterator that groups the items in tuples of a specific size (up to 12).

    @@ -640,7 +700,7 @@ itertools::assert_equal(it, vec![(let it: Tuples<Range<u32>, (u32, u32, u32)> = (1..7).tuples(); itertools::assert_equal(it, vec![(1, 2, 3), (4, 5, 6)]);

    See also Tuples::into_buffer.

    -
    source

    fn tee(self) -> (Tee<Self>, Tee<Self>)
    where +

    source

    fn tee(self) -> (Tee<Self>, Tee<Self>)
    where Self: Sized, Self::Item: Clone,

    Split into an iterator pair that both yield all elements from the original iterator.

    @@ -655,29 +715,14 @@ of using this method. Cloning is likely to be more efficient.

    itertools::assert_equal(t1.next(), Some(0)); itertools::assert_equal(t2, 0..4); itertools::assert_equal(t1, 1..4);
    -
    source

    fn step(self, n: usize) -> Step<Self> ⓘ
    where - Self: Sized,

    👎Deprecated since 0.8.0: Use std .step_by() instead

    Return an iterator adaptor that steps n elements in the base iterator -for each iteration.

    -

    The iterator steps by yielding the next element from the base iterator, -then skipping forward n - 1 elements.

    -

    Iterator element type is Self::Item.

    -

    Panics if the step is 0.

    - -
    use itertools::Itertools;
-
-let it = (0..8).step(3);
-itertools::assert_equal(it, vec![0, 3, 6]);
    -
    source

    fn map_into<R>(self) -> MapInto<Self, R>
    where +

    source

    fn map_into<R>(self) -> MapInto<Self, R>
    where Self: Sized, Self::Item: Into<R>,

    Convert each item of the iterator using the Into trait.

    use itertools::Itertools;
 
 (1i32..42i32).map_into::<f64>().collect_vec();
    -
    source

    fn map_results<F, T, U, E>(self, f: F) -> MapOk<Self, F>
    where - Self: Iterator<Item = Result<T, E>> + Sized, - F: FnMut(T) -> U,

    👎Deprecated since 0.10.0: Use .map_ok() instead

    See .map_ok().

    -
    source

    fn map_ok<F, T, U, E>(self, f: F) -> MapOk<Self, F>
    where +

    source

    fn map_ok<F, T, U, E>(self, f: F) -> MapOk<Self, F>
    where Self: Iterator<Item = Result<T, E>> + Sized, F: FnMut(T) -> U,

    Return an iterator adaptor that applies the provided closure to every Result::Ok value. Result::Err values are @@ -688,7 +733,7 @@ unchanged.

    let input = vec![Ok(41), Err(false), Ok(11)]; let it = input.into_iter().map_ok(|i| i + 1); itertools::assert_equal(it, vec![Ok(42), Err(false), Ok(12)]);
    -
    source

    fn filter_ok<F, T, E>(self, f: F) -> FilterOk<Self, F> ⓘ
    where +

    source

    fn filter_ok<F, T, E>(self, f: F) -> FilterOk<Self, F> ⓘ
    where Self: Iterator<Item = Result<T, E>> + Sized, F: FnMut(&T) -> bool,

    Return an iterator adaptor that filters every Result::Ok value with the provided closure. Result::Err values are @@ -699,7 +744,7 @@ unchanged.

    let input = vec![Ok(22), Err(false), Ok(11)]; let it = input.into_iter().filter_ok(|&i| i > 20); itertools::assert_equal(it, vec![Ok(22), Err(false)]);
    -
    source

    fn filter_map_ok<F, T, U, E>(self, f: F) -> FilterMapOk<Self, F> ⓘ
    where +

    source

    fn filter_map_ok<F, T, U, E>(self, f: F) -> FilterMapOk<Self, F> ⓘ
    where Self: Iterator<Item = Result<T, E>> + Sized, F: FnMut(T) -> Option<U>,

    Return an iterator adaptor that filters and transforms every Result::Ok value with the provided closure. Result::Err @@ -710,7 +755,7 @@ values are unchanged.

    let input = vec![Ok(22), Err(false), Ok(11)]; let it = input.into_iter().filter_map_ok(|i| if i > 20 { Some(i * 2) } else { None }); itertools::assert_equal(it, vec![Ok(44), Err(false)]);
    -
    source

    fn flatten_ok<T, E>(self) -> FlattenOk<Self, T, E> ⓘ
    where +

    source

    fn flatten_ok<T, E>(self) -> FlattenOk<Self, T, E> ⓘ
    where Self: Iterator<Item = Result<T, E>> + Sized, T: IntoIterator,

    Return an iterator adaptor that flattens every Result::Ok value into a series of Result::Ok values. Result::Err values are unchanged.

    @@ -726,7 +771,7 @@ itertools::assert_equal(it.clone(), vec![// This can also be used to propagate errors when collecting. let output_result: Result<Vec<i32>, bool> = it.collect(); assert_eq!(output_result, Err(false));
    -
    source

    fn process_results<F, T, E, R>(self, processor: F) -> Result<R, E>
    where +

    source

    fn process_results<F, T, E, R>(self, processor: F) -> Result<R, E>
    where Self: Iterator<Item = Result<T, E>> + Sized, F: FnOnce(ProcessResults<'_, Self, E>) -> R,

    “Lift” a function of the values of the current iterator so as to process an iterator of Result values instead.

    @@ -751,7 +796,7 @@ inside Ok.

    assert_eq!(first_max, Ok(3)); assert!(second_max.is_err());
    -
    source

    fn merge<J>(self, other: J) -> Merge<Self, J::IntoIter>
    where +

    source

    fn merge<J>(self, other: J) -> Merge<Self, J::IntoIter>
    where Self: Sized, Self::Item: PartialOrd, J: IntoIterator<Item = Self::Item>,

    Return an iterator adaptor that merges the two base iterators in @@ -765,7 +810,7 @@ result is sorted.

    let b = (0..11).step_by(5); let it = a.merge(b); itertools::assert_equal(it, vec![0, 0, 3, 5, 6, 9, 10]);
    -
    source

    fn merge_by<J, F>(self, other: J, is_first: F) -> MergeBy<Self, J::IntoIter, F> ⓘ
    where +

    source

    fn merge_by<J, F>(self, other: J, is_first: F) -> MergeBy<Self, J::IntoIter, F> ⓘ
    where Self: Sized, J: IntoIterator<Item = Self::Item>, F: FnMut(&Self::Item, &Self::Item) -> bool,

    Return an iterator adaptor that merges the two base iterators in order. @@ -779,7 +824,7 @@ This is much like let b = (0..).zip("ad".chars()); let it = a.merge_by(b, |x, y| x.1 <= y.1); itertools::assert_equal(it, vec![(0, 'a'), (0, 'b'), (1, 'c'), (1, 'd')]);

    -
    source

    fn merge_join_by<J, F, T>( +

    source

    fn merge_join_by<J, F, T>( self, other: J, cmp_fn: F @@ -837,7 +882,7 @@ itertools::assert_equal( a.merge_join_by(b, |i, j| i <= j), vec![Left(0), Right(0), Left(2), Right(3), Left(4), Left(6), Left(1), Right(6), Right(9)] ); -

    source

    fn kmerge(self) -> KMerge<<Self::Item as IntoIterator>::IntoIter>
    where +

    source

    fn kmerge(self) -> KMerge<<Self::Item as IntoIterator>::IntoIter>
    where Self: Sized, Self::Item: IntoIterator, <Self::Item as IntoIterator>::Item: PartialOrd,

    Return an iterator adaptor that flattens an iterator of iterators by @@ -852,7 +897,7 @@ merging them in ascending order.

    let c = (2..6).step_by(3); let it = vec![a, b, c].into_iter().kmerge(); itertools::assert_equal(it, vec![0, 1, 2, 3, 4, 5]);
    -
    source

    fn kmerge_by<F>( +

    source

    fn kmerge_by<F>( self, first: F ) -> KMergeBy<<Self::Item as IntoIterator>::IntoIter, F> ⓘ
    where @@ -873,7 +918,7 @@ sorted.

    let mut it = vec![a, b].into_iter().kmerge_by(|a, b| a.abs() < b.abs()); assert_eq!(it.next(), Some(0.)); assert_eq!(it.last(), Some(-7.));
    -

    source

    fn cartesian_product<J>(self, other: J) -> Product<Self, J::IntoIter> ⓘ
    where +

    source

    fn cartesian_product<J>(self, other: J) -> Product<Self, J::IntoIter> ⓘ
    where Self: Sized, Self::Item: Clone, J: IntoIterator, @@ -885,7 +930,7 @@ the element sets of two iterators self and J.

    let it = (0..2).cartesian_product("αβ".chars()); itertools::assert_equal(it, vec![(0, 'α'), (0, 'β'), (1, 'α'), (1, 'β')]);
    -

    source

    fn multi_cartesian_product( +

    source

    fn multi_cartesian_product( self ) -> MultiProduct<<Self::Item as IntoIterator>::IntoIter> ⓘ
    where Self: Sized, @@ -898,6 +943,7 @@ the product of iterators yielding multiple types, use the iproduct macro instead.

    The iterator element type is Vec<T>, where T is the iterator element of the subiterators.

    +

    Note that the iterator is fused.

    use itertools::Itertools;
 let mut multi_prod = (0..3).map(|i| (i * 2)..(i * 2 + 2))
@@ -911,7 +957,14 @@ of the subiterators.
    
 assert_eq!(multi_prod.next(), Some(vec![1, 3, 4]));
 assert_eq!(multi_prod.next(), Some(vec![1, 3, 5]));
 assert_eq!(multi_prod.next(), None);
    -

    source

    fn coalesce<F>(self, f: F) -> Coalesce<Self, F>
    where +

    If the adapted iterator is empty, the result is an iterator yielding a single empty vector. +This is known as the nullary cartesian product.

    + +
    use itertools::Itertools;
+let mut nullary_cartesian_product = (0..0).map(|i| (i * 2)..(i * 2 + 2)).multi_cartesian_product();
+assert_eq!(nullary_cartesian_product.next(), Some(vec![]));
+assert_eq!(nullary_cartesian_product.next(), None);
    +

    source

    fn coalesce<F>(self, f: F) -> Coalesce<Self, F>
    where Self: Sized, F: FnMut(Self::Item, Self::Item) -> Result<Self::Item, (Self::Item, Self::Item)>,

    Return an iterator adaptor that uses the passed-in closure to optionally merge together consecutive elements.

    @@ -936,7 +989,7 @@ itertools::assert_equal(data.into_iter().coalesce(|x, y| Err((x, y)) }), vec![-6., 4., -1.]);
    -
    source

    fn dedup(self) -> Dedup<Self>
    where +

    source

    fn dedup(self) -> Dedup<Self>
    where Self: Sized, Self::Item: PartialEq,

    Remove duplicates from sections of consecutive identical elements. If the iterator is sorted, all elements will be unique.

    @@ -948,7 +1001,7 @@ If the iterator is sorted, all elements will be unique.

    let data = vec![1., 1., 2., 3., 3., 2., 2.]; itertools::assert_equal(data.into_iter().dedup(), vec![1., 2., 3., 2.]);
    -
    source

    fn dedup_by<Cmp>(self, cmp: Cmp) -> DedupBy<Self, Cmp>
    where +

    source

    fn dedup_by<Cmp>(self, cmp: Cmp) -> DedupBy<Self, Cmp>
    where Self: Sized, Cmp: FnMut(&Self::Item, &Self::Item) -> bool,

    Remove duplicates from sections of consecutive identical elements, determining equality using a comparison function. @@ -961,7 +1014,7 @@ If the iterator is sorted, all elements will be unique.

    let data = vec![(0, 1.), (1, 1.), (0, 2.), (0, 3.), (1, 3.), (1, 2.), (2, 2.)]; itertools::assert_equal(data.into_iter().dedup_by(|x, y| x.1 == y.1), vec![(0, 1.), (0, 2.), (0, 3.), (1, 2.)]);
    -
    source

    fn dedup_with_count(self) -> DedupWithCount<Self>
    where +

    source

    fn dedup_with_count(self) -> DedupWithCount<Self>
    where Self: Sized,

    Remove duplicates from sections of consecutive identical elements, while keeping a count of how many repeated elements were present. If the iterator is sorted, all elements will be unique.

    @@ -973,7 +1026,7 @@ If the iterator is sorted, all elements will be unique.

    let data = vec!['a', 'a', 'b', 'c', 'c', 'b', 'b']; itertools::assert_equal(data.into_iter().dedup_with_count(), vec![(2, 'a'), (1, 'b'), (2, 'c'), (2, 'b')]);
    -
    source

    fn dedup_by_with_count<Cmp>(self, cmp: Cmp) -> DedupByWithCount<Self, Cmp>
    where +

    source

    fn dedup_by_with_count<Cmp>(self, cmp: Cmp) -> DedupByWithCount<Self, Cmp>
    where Self: Sized, Cmp: FnMut(&Self::Item, &Self::Item) -> bool,

    Remove duplicates from sections of consecutive identical elements, while keeping a count of how many repeated elements were present. @@ -987,7 +1040,7 @@ If the iterator is sorted, all elements will be unique.

    let data = vec![(0, 'a'), (1, 'a'), (0, 'b'), (0, 'c'), (1, 'c'), (1, 'b'), (2, 'b')]; itertools::assert_equal(data.into_iter().dedup_by_with_count(|x, y| x.1 == y.1), vec![(2, (0, 'a')), (1, (0, 'b')), (2, (0, 'c')), (2, (1, 'b'))]);
    -
    source

    fn duplicates(self) -> Duplicates<Self>
    where +

    source

    fn duplicates(self) -> Duplicates<Self>
    where Self: Sized, Self::Item: Eq + Hash,

    Return an iterator adaptor that produces elements that appear more than once during the iteration. Duplicates are detected using hash and equality.

    @@ -1000,7 +1053,7 @@ than twice, the second item is the item retained and the rest are discarded.

    let data = vec![10, 20, 30, 20, 40, 10, 50]; itertools::assert_equal(data.into_iter().duplicates(), vec![20, 10]);
    -
    source

    fn duplicates_by<V, F>(self, f: F) -> DuplicatesBy<Self, V, F>
    where +

    source

    fn duplicates_by<V, F>(self, f: F) -> DuplicatesBy<Self, V, F>
    where Self: Sized, V: Eq + Hash, F: FnMut(&Self::Item) -> V,

    Return an iterator adaptor that produces elements that appear more than once during the @@ -1016,7 +1069,7 @@ than twice, the second item is the item retained and the rest are discarded.

    let data = vec!["a", "bb", "aa", "c", "ccc"]; itertools::assert_equal(data.into_iter().duplicates_by(|s| s.len()), vec!["aa", "c"]);
    -
    source

    fn unique(self) -> Unique<Self> ⓘ
    where +

    source

    fn unique(self) -> Unique<Self> ⓘ
    where Self: Sized, Self::Item: Clone + Eq + Hash,

    Return an iterator adaptor that filters out elements that have already been produced once during the iteration. Duplicates @@ -1032,7 +1085,7 @@ items, the first item encountered is the item retained.

    let data = vec![10, 20, 30, 20, 40, 10, 50]; itertools::assert_equal(data.into_iter().unique(), vec![10, 20, 30, 40, 50]);
    -
    source

    fn unique_by<V, F>(self, f: F) -> UniqueBy<Self, V, F> ⓘ
    where +

    source

    fn unique_by<V, F>(self, f: F) -> UniqueBy<Self, V, F> ⓘ
    where Self: Sized, V: Eq + Hash, F: FnMut(&Self::Item) -> V,

    Return an iterator adaptor that filters out elements that have @@ -1049,7 +1102,7 @@ items, the first item encountered is the item retained.

    let data = vec!["a", "bb", "aa", "c", "ccc"]; itertools::assert_equal(data.into_iter().unique_by(|s| s.len()), vec!["a", "bb", "ccc"]);
    -
    source

    fn peeking_take_while<F>(&mut self, accept: F) -> PeekingTakeWhile<'_, Self, F> ⓘ
    where +

    source

    fn peeking_take_while<F>(&mut self, accept: F) -> PeekingTakeWhile<'_, Self, F> ⓘ
    where Self: Sized + PeekingNext, F: FnMut(&Self::Item) -> bool,

    Return an iterator adaptor that borrows from this iterator and takes items while the closure accept returns true.

    @@ -1059,7 +1112,7 @@ like .peekable(), put_back and a few other collection peeking_take_while is done.

    See also .take_while_ref() which is a similar adaptor.

    -
    source

    fn take_while_ref<F>(&mut self, accept: F) -> TakeWhileRef<'_, Self, F> ⓘ
    where +

    source

    fn take_while_ref<F>(&mut self, accept: F) -> TakeWhileRef<'_, Self, F> ⓘ
    where Self: Clone, F: FnMut(&Self::Item) -> bool,

    Return an iterator adaptor that borrows from a Clone-able iterator to only pick off elements while the predicate accept returns true.

    @@ -1076,7 +1129,7 @@ last and rejected element (first false) is still available when assert_eq!(decimals, "0123456789"); assert_eq!(hexadecimals.next(), Some('a'));
    -
    source

    fn take_while_inclusive<F>(self, accept: F) -> TakeWhileInclusive<Self, F> ⓘ
    where +

    source

    fn take_while_inclusive<F>(self, accept: F) -> TakeWhileInclusive<Self, F> ⓘ
    where Self: Sized, F: FnMut(&Self::Item) -> bool,

    Returns an iterator adaptor that consumes elements while the given predicate is true, including the element for which the predicate @@ -1128,7 +1181,7 @@ the underlying elements.

    .collect(); let expected: Vec<_> = vec![1, 2, 3].into_iter().map(NoCloneImpl).collect(); assert_eq!(filtered, expected);
    -
    source

    fn while_some<A>(self) -> WhileSome<Self> ⓘ
    where +

    source

    fn while_some<A>(self) -> WhileSome<Self> ⓘ
    where Self: Sized + Iterator<Item = Option<A>>,

    Return an iterator adaptor that filters Option<A> iterator elements and produces A. Stops on the first None encountered.

    Iterator element type is A, the unwrapped element.

    @@ -1140,13 +1193,16 @@ and produces A. Stops on the first None encountered.0..).map(|i| std::char::from_digit(i, 16)).while_some(), "0123456789abcdef".chars());
    -
    source

    fn tuple_combinations<T>(self) -> TupleCombinations<Self, T> ⓘ
    where +

    source

    fn tuple_combinations<T>(self) -> TupleCombinations<Self, T> ⓘ
    where Self: Sized + Clone, Self::Item: Clone, T: HasCombination<Self>,

    Return an iterator adaptor that iterates over the combinations of the elements from an iterator.

    Iterator element can be any homogeneous tuple of type Self::Item with size up to 12.

    +
    §Guarantees
    +

    If the adapted iterator is deterministic, +this iterator adapter yields items in a reliable order.

    use itertools::Itertools;
 
@@ -1173,15 +1229,15 @@ itertools::assert_equal(it, vec![(let it: TupleCombinations<Range<u32>, (u32, u32, u32)> = (1..5).tuple_combinations();
 itertools::assert_equal(it, vec![(1, 2, 3), (1, 2, 4), (1, 3, 4), (2, 3, 4)]);
    -
    §Guarantees
    -

    If the adapted iterator is deterministic, -this iterator adapter yields items in a reliable order.

    -
    source

    fn combinations(self, k: usize) -> Combinations<Self> ⓘ
    where +

    source

    fn combinations(self, k: usize) -> Combinations<Self> ⓘ
    where Self: Sized, Self::Item: Clone,

    Return an iterator adaptor that iterates over the k-length combinations of the elements from an iterator.

    -

    Iterator element type is Vec<Self::Item>. The iterator produces a new Vec per iteration, +

    Iterator element type is Vec<Self::Item>. The iterator produces a new Vec per iteration, and clones the iterator elements.

    +
    §Guarantees
    +

    If the adapted iterator is deterministic, +this iterator adapter yields items in a reliable order.

    use itertools::Itertools;
 
@@ -1202,17 +1258,14 @@ itertools::assert_equal(it, vec![
     vec![1, 2], // Note: these are the same
     vec![2, 2],
 ]);
    -
    §Guarantees
    -

    If the adapted iterator is deterministic, -this iterator adapter yields items in a reliable order.

    -
    source

    fn combinations_with_replacement( +

    source

    fn combinations_with_replacement( self, k: usize ) -> CombinationsWithReplacement<Self> ⓘ
    where Self: Sized, Self::Item: Clone,

    Return an iterator that iterates over the k-length combinations of the elements from an iterator, with replacement.

    -

    Iterator element type is Vec<Self::Item>. The iterator produces a new Vec per iteration, +

    Iterator element type is Vec<Self::Item>. The iterator produces a new Vec per iteration, and clones the iterator elements.

    use itertools::Itertools;
@@ -1226,12 +1279,12 @@ itertools::assert_equal(it, vec![
     vec![2, 3],
     vec![3, 3],
 ]);
    -
    source

    fn permutations(self, k: usize) -> Permutations<Self> ⓘ
    where +

    source

    fn permutations(self, k: usize) -> Permutations<Self> ⓘ
    where Self: Sized, Self::Item: Clone,

    Return an iterator adaptor that iterates over all k-permutations of the elements from an iterator.

    Iterator element type is Vec<Self::Item> with length k. The iterator -produces a new Vec per iteration, and clones the iterator elements.

    +produces a new Vec per iteration, and clones the iterator elements.

    If k is greater than the length of the input iterator, the resultant iterator adaptor will be empty.

    If you are looking for permutations with replacements, @@ -1259,7 +1312,7 @@ itertools::assert_equal(it, vec![ ]);

    Note: The source iterator is collected lazily, and will not be re-iterated if the permutations adaptor is completed and re-iterated.

    -
    source

    fn powerset(self) -> Powerset<Self> ⓘ
    where +

    source

    fn powerset(self) -> Powerset<Self> ⓘ
    where Self: Sized, Self::Item: Clone,

    Return an iterator that iterates through the powerset of the elements from an iterator.

    @@ -1284,7 +1337,7 @@ itertools::assert_equal(sets, vec![ vec![2, 3], vec![1, 2, 3], ]);
    -
    source

    fn pad_using<F>(self, min: usize, f: F) -> PadUsing<Self, F> ⓘ
    where +

    source

    fn pad_using<F>(self, min: usize, f: F) -> PadUsing<Self, F> ⓘ
    where Self: Sized, F: FnMut(usize) -> Self::Item,

    Return an iterator adaptor that pads the sequence to a minimum length of min by filling missing elements using a closure f.

    @@ -1300,7 +1353,7 @@ itertools::assert_equal(it, vec![let it = (0..5).pad_using(10, |i| 2*i).rev(); itertools::assert_equal(it, vec![18, 16, 14, 12, 10, 4, 3, 2, 1, 0]);
    -
    source

    fn with_position(self) -> WithPosition<Self> ⓘ
    where +

    source

    fn with_position(self) -> WithPosition<Self> ⓘ
    where Self: Sized,

    Return an iterator adaptor that combines each element with a Position to ease special-case handling of the first or last elements.

    Iterator element type is @@ -1317,7 +1370,7 @@ itertools::assert_equal(it, let it = (0..1).with_position(); itertools::assert_equal(it, vec![(Position::Only, 0)]);

    -
    source

    fn positions<P>(self, predicate: P) -> Positions<Self, P> ⓘ
    where +

    source

    fn positions<P>(self, predicate: P) -> Positions<Self, P> ⓘ
    where Self: Sized, P: FnMut(Self::Item) -> bool,

    Return an iterator adaptor that yields the indices of all elements satisfying a predicate, counted from the start of the iterator.

    @@ -1329,7 +1382,7 @@ satisfying a predicate, counted from the start of the iterator.

    itertools::assert_equal(data.iter().positions(|v| v % 2 == 0), vec![1, 4, 5]); itertools::assert_equal(data.iter().positions(|v| v % 2 == 1).rev(), vec![7, 6, 3, 2, 0]);
    -
    source

    fn update<F>(self, updater: F) -> Update<Self, F> ⓘ
    where +

    source

    fn update<F>(self, updater: F) -> Update<Self, F> ⓘ
    where Self: Sized, F: FnMut(&mut Self::Item),

    Return an iterator adaptor that applies a mutating function to each element before yielding it.

    @@ -1339,7 +1392,7 @@ to each element before yielding it.

    let input = vec![vec![1], vec![3, 2, 1]]; let it = input.into_iter().update(|mut v| v.push(0)); itertools::assert_equal(it, vec![vec![1, 0], vec![3, 2, 1, 0]]);
    -
    source

    fn next_tuple<T>(&mut self) -> Option<T>
    where +

    source

    fn next_tuple<T>(&mut self) -> Option<T>
    where Self: Sized + Iterator<Item = T::Item>, T: HomogeneousTuple,

    Advances the iterator and returns the next items grouped in a tuple of a specific size (up to 12).

    @@ -1351,7 +1404,7 @@ returned inside Some, otherwise None is returned.

    let mut iter = 1..5; assert_eq!(Some((1, 2)), iter.next_tuple());
    -
    source

    fn collect_tuple<T>(self) -> Option<T>
    where +

    source

    fn collect_tuple<T>(self) -> Option<T>
    where Self: Sized + Iterator<Item = T::Item>, T: HomogeneousTuple,

    Collects all items from the iterator into a tuple of a specific size (up to 12).

    @@ -1368,7 +1421,7 @@ the tuple size, then the tuple is returned inside Some, otherwise } else { panic!("Expected two elements") }
    -
    source

    fn find_position<P>(&mut self, pred: P) -> Option<(usize, Self::Item)>
    where +

    source

    fn find_position<P>(&mut self, pred: P) -> Option<(usize, Self::Item)>
    where P: FnMut(&Self::Item) -> bool,

    Find the position and value of the first element satisfying a predicate.

    The iterator is not advanced past the first element found.

    @@ -1376,7 +1429,7 @@ the tuple size, then the tuple is returned inside Some, otherwise let text = "Hα"; assert_eq!(text.chars().find_position(|ch| ch.is_lowercase()), Some((1, 'α')));
    -
    source

    fn find_or_last<P>(self, predicate: P) -> Option<Self::Item>
    where +

    source

    fn find_or_last<P>(self, predicate: P) -> Option<Self::Item>
    where Self: Sized, P: FnMut(&Self::Item) -> bool,

    Find the value of the first element satisfying a predicate or return the last element, if any.

    The iterator is not advanced past the first element found.

    @@ -1387,7 +1440,7 @@ the tuple size, then the tuple is returned inside Some, otherwise assert_eq!(numbers.iter().find_or_last(|&&x| x > 5), Some(&4)); assert_eq!(numbers.iter().find_or_last(|&&x| x > 2), Some(&3)); assert_eq!(std::iter::empty::<i32>().find_or_last(|&x| x > 5), None);
    -
    source

    fn find_or_first<P>(self, predicate: P) -> Option<Self::Item>
    where +

    source

    fn find_or_first<P>(self, predicate: P) -> Option<Self::Item>
    where Self: Sized, P: FnMut(&Self::Item) -> bool,

    Find the value of the first element satisfying a predicate or return the first element, if any.

    The iterator is not advanced past the first element found.

    @@ -1398,7 +1451,7 @@ the tuple size, then the tuple is returned inside Some, otherwise assert_eq!(numbers.iter().find_or_first(|&&x| x > 5), Some(&1)); assert_eq!(numbers.iter().find_or_first(|&&x| x > 2), Some(&3)); assert_eq!(std::iter::empty::<i32>().find_or_first(|&x| x > 5), None);
    -
    source

    fn contains<Q>(&mut self, query: &Q) -> bool
    where +

    source

    fn contains<Q>(&mut self, query: &Q) -> bool
    where Self: Sized, Self::Item: Borrow<Q>, Q: PartialEq,

    Returns true if the given item is present in this iterator.

    @@ -1423,7 +1476,7 @@ iterator will be exhausted.

    assert_eq!(iter.contains(&Enum::E), false); // `E` wasn't found, so `iter` is now exhausted assert_eq!(iter.next(), None);
    -
    source

    fn all_equal(&mut self) -> bool
    where +

    source

    fn all_equal(&mut self) -> bool
    where Self: Sized, Self::Item: PartialEq,

    Check whether all elements compare equal.

    Empty iterators are considered to have equal elements:

    @@ -1438,7 +1491,7 @@ iterator will be exhausted.

    let data : Option<usize> = None; assert!(data.into_iter().all_equal());
    -
    source

    fn all_equal_value( +

    source

    fn all_equal_value( &mut self ) -> Result<Self::Item, Option<(Self::Item, Self::Item)>>
    where Self: Sized, @@ -1457,7 +1510,7 @@ two non-equal elements found.

    let data : Option<usize> = None; assert_eq!(data.into_iter().all_equal_value(), Err(None));
    -

    source

    fn all_unique(&mut self) -> bool
    where +

    source

    fn all_unique(&mut self) -> bool
    where Self: Sized, Self::Item: Eq + Hash,

    Check whether all elements are unique (non equal).

    Empty iterators are considered to have unique elements:

    @@ -1471,10 +1524,10 @@ two non-equal elements found.

    let data : Option<usize> = None; assert!(data.into_iter().all_unique());
    -
    source

    fn dropping(self, n: usize) -> Self
    where +

    source

    fn dropping(self, n: usize) -> Self
    where Self: Sized,

    Consume the first n elements from the iterator eagerly, and return the same iterator again.

    -

    It works similarly to .skip( n ) except it is eager and +

    It works similarly to .skip(n) except it is eager and preserves the iterator type.

    use itertools::Itertools;
@@ -1483,7 +1536,7 @@ preserves the iterator type.
    
 itertools::assert_equal(iter, "γ".chars());

    Fusing notes: if the iterator is exhausted by dropping, the result of calling .next() again depends on the iterator implementation.

    -
    source

    fn dropping_back(self, n: usize) -> Self
    where +

    source

    fn dropping_back(self, n: usize) -> Self
    where Self: Sized + DoubleEndedIterator,

    Consume the last n elements from the iterator eagerly, and return the same iterator again.

    This is only possible on double ended iterators. n may be @@ -1495,23 +1548,7 @@ preserves the iterator type.

    let init = vec![0, 3, 6, 9].into_iter().dropping_back(1); itertools::assert_equal(init, vec![0, 3, 6]);
    -
    source

    fn foreach<F>(self, f: F)
    where - F: FnMut(Self::Item), - Self: Sized,

    👎Deprecated since 0.8.0: Use .for_each() instead

    Run the closure f eagerly on each element of the iterator.

    -

    Consumes the iterator until its end.

    - -
    use std::sync::mpsc::channel;
-use itertools::Itertools;
-
-let (tx, rx) = channel();
-
-// use .foreach() to apply a function to each value -- sending it
-(0..5).map(|x| x * 2 + 1).foreach(|x| { tx.send(x).unwrap(); } );
-
-drop(tx);
-
-itertools::assert_equal(rx.iter(), vec![1, 3, 5, 7, 9]);
    -
    source

    fn concat(self) -> Self::Item
    where +

    source

    fn concat(self) -> Self::Item
    where Self: Sized, Self::Item: Extend<<<Self as Iterator>::Item as IntoIterator>::Item> + IntoIterator + Default,

    Combine all an iterator’s elements into one element by using Extend.

    This combinator will extend the first item with each of the rest of the @@ -1523,10 +1560,10 @@ items of the iterator. If the iterator is empty, the default value of let input = vec![vec![1], vec![2, 3], vec![4, 5, 6]]; assert_eq!(input.into_iter().concat(), vec![1, 2, 3, 4, 5, 6]);

    -
    source

    fn collect_vec(self) -> Vec<Self::Item>
    where +

    source

    fn collect_vec(self) -> Vec<Self::Item>
    where Self: Sized,

    .collect_vec() is simply a type specialization of Iterator::collect, for convenience.

    -
    source

    fn try_collect<T, U, E>(self) -> Result<U, E>
    where +

    source

    fn try_collect<T, U, E>(self) -> Result<U, E>
    where Self: Sized + Iterator<Item = Result<T, E>>, Result<U, E>: FromIterator<Result<T, E>>,

    .try_collect() is more convenient way of writing .collect::<Result<_, _>>()

    @@ -1544,7 +1581,7 @@ for convenience.

    Ok(()) }
    -
    source

    fn set_from<'a, A: 'a, J>(&mut self, from: J) -> usize
    where +

    source

    fn set_from<'a, A: 'a, J>(&mut self, from: J) -> usize
    where Self: Iterator<Item = &'a mut A>, J: IntoIterator<Item = A>,

    Assign to each reference in self from the from iterator, stopping at the shortest of the two iterators.

    @@ -1557,15 +1594,15 @@ iterator, and if either is exhausted the method is done.

    let mut xs = [0; 4]; xs.iter_mut().set_from(1..); assert_eq!(xs, [1, 2, 3, 4]);
    -
    source

    fn join(&mut self, sep: &str) -> String
    where - Self::Item: Display,

    Combine all iterator elements into one String, separated by sep.

    +
    source

    fn join(&mut self, sep: &str) -> String
    where + Self::Item: Display,

    Combine all iterator elements into one String, separated by sep.

    Use the Display implementation of each element.

    use itertools::Itertools;
 
 assert_eq!(["a", "b", "c"].iter().join(", "), "a, b, c");
 assert_eq!([1, 2, 3].iter().join(", "), "1, 2, 3");
    -
    source

    fn format(self, sep: &str) -> Format<'_, Self>
    where +

    source

    fn format(self, sep: &str) -> Format<'_, Self>
    where Self: Sized,

    Format all iterator elements, separated by sep.

    All elements are formatted (any formatting trait) with sep inserted between each element.

    @@ -1577,7 +1614,7 @@ with sep inserted between each element.

    assert_eq!( format!("{:.2}", data.iter().format(", ")), "1.10, 2.72, -3.00");
    -
    source

    fn format_with<F>(self, sep: &str, format: F) -> FormatWith<'_, Self, F>
    where +

    source

    fn format_with<F>(self, sep: &str, format: F) -> FormatWith<'_, Self, F>
    where Self: Sized, F: FnMut(Self::Item, &mut dyn FnMut(&dyn Display) -> Result) -> Result,

    Format all iterator elements, separated by sep.

    This is a customizable version of .format().

    @@ -1605,10 +1642,7 @@ element formatting. The callback can be called multiple times if needed.

    "1, 2, 3\n4, 5, 6");
    -
    source

    fn fold_results<A, E, B, F>(&mut self, start: B, f: F) -> Result<B, E>
    where - Self: Iterator<Item = Result<A, E>>, - F: FnMut(B, A) -> B,

    👎Deprecated since 0.10.0: Use .fold_ok() instead

    See .fold_ok().

    -
    source

    fn fold_ok<A, E, B, F>(&mut self, start: B, f: F) -> Result<B, E>
    where +

    source

    fn fold_ok<A, E, B, F>(&mut self, start: B, f: F) -> Result<B, E>
    where Self: Iterator<Item = Result<A, E>>, F: FnMut(B, A) -> B,

    Fold Result values from an iterator.

    Only Ok values are folded. If no error is encountered, the folded @@ -1644,7 +1678,7 @@ this effectively results in ((0 + 1) + 2) + 3

    .fold_ok(0, Add::add) .is_err() );
    -
    source

    fn fold_options<A, B, F>(&mut self, start: B, f: F) -> Option<B>
    where +

    source

    fn fold_options<A, B, F>(&mut self, start: B, f: F) -> Option<B>
    where Self: Iterator<Item = Option<A>>, F: FnMut(B, A) -> B,

    Fold Option values from an iterator.

    Only Some values are folded. If no None is encountered, the folded @@ -1661,9 +1695,9 @@ and returns None. No iterator elements are consumed after the let mut more_values = vec![Some(2), None, Some(0)].into_iter(); assert!(more_values.fold_options(0, Add::add).is_none()); assert_eq!(more_values.next().unwrap(), Some(0));

    -
    source

    fn fold1<F>(self, f: F) -> Option<Self::Item>
    where +

    source

    fn fold1<F>(self, f: F) -> Option<Self::Item>
    where F: FnMut(Self::Item, Self::Item) -> Self::Item, - Self: Sized,

    👎Deprecated since 0.10.2: Use Iterator::reduce instead

    Accumulator of the elements in the iterator.

    + Self: Sized,
    👎Deprecated since 0.10.2: Use Iterator::reduce instead

    Accumulator of the elements in the iterator.

    Like .fold(), without a base case. If the iterator is empty, return None. With just one element, return it. Otherwise elements are accumulated in sequence using the closure f.

    @@ -1672,7 +1706,7 @@ Otherwise elements are accumulated in sequence using the closure f. assert_eq!((0..10).fold1(|x, y| x + y).unwrap_or(0), 45); assert_eq!((0..0).fold1(|x, y| x * y), None);
    -
    source

    fn tree_fold1<F>(self, f: F) -> Option<Self::Item>
    where +

    source

    fn tree_reduce<F>(self, f: F) -> Option<Self::Item>
    where F: FnMut(Self::Item, Self::Item) -> Self::Item, Self: Sized,

    Accumulate the elements in the iterator in a tree-like manner.

    You can think of it as, while there’s more than one item, repeatedly @@ -1699,7 +1733,7 @@ result than the linear call tree used by Iterator::reduce instead since it will most likely result in the generation of simpler code because the compiler is able to optimize it -

  • otherwise if f is non-trivial like format!, you should use tree_fold1 since it +
  • otherwise if f is non-trivial like format!, you should use tree_reduce since it reduces the number of operations from O(n) to O(ln(n))

    • Here “non-trivial” means:

    @@ -1712,19 +1746,22 @@ reduces the number of operations from O(n) to O(ln(n)) // The same tree as above let num_strings = (1..8).map(|x| x.to_string()); -assert_eq!(num_strings.tree_fold1(|x, y| format!("f({}, {})", x, y)), +assert_eq!(num_strings.tree_reduce(|x, y| format!("f({}, {})", x, y)), Some(String::from("f(f(f(1, 2), f(3, 4)), f(f(5, 6), 7))"))); // Like fold1, an empty iterator produces None -assert_eq!((0..0).tree_fold1(|x, y| x * y), None); +assert_eq!((0..0).tree_reduce(|x, y| x * y), None); -// tree_fold1 matches fold1 for associative operations... -assert_eq!((0..10).tree_fold1(|x, y| x + y), +// tree_reduce matches fold1 for associative operations... +assert_eq!((0..10).tree_reduce(|x, y| x + y), (0..10).fold1(|x, y| x + y)); // ...but not for non-associative ones -assert_ne!((0..10).tree_fold1(|x, y| x - y), +assert_ne!((0..10).tree_reduce(|x, y| x - y), (0..10).fold1(|x, y| x - y));
    -
    source

    fn fold_while<B, F>(&mut self, init: B, f: F) -> FoldWhile<B>
    where +

    source

    fn tree_fold1<F>(self, f: F) -> Option<Self::Item>
    where + F: FnMut(Self::Item, Self::Item) -> Self::Item, + Self: Sized,

    👎Deprecated since 0.13.0: Use .tree_reduce() instead

    See .tree_reduce().

    +
    source

    fn fold_while<B, F>(&mut self, init: B, f: F) -> FoldWhile<B>
    where Self: Sized, F: FnMut(B, Self::Item) -> FoldWhile<B>,

    An iterator method that applies a function, producing a single, final value.

    fold_while() is basically equivalent to Iterator::fold but with additional support for @@ -1761,7 +1798,7 @@ early exit via short-circuiting.

    The big difference between the computations of result2 and result3 is that while fold() called the provided closure for every item of the callee iterator, fold_while() actually stopped iterating as soon as it encountered Fold::Done(_).

    -
    source

    fn sum1<S>(self) -> Option<S>
    where +

    source

    fn sum1<S>(self) -> Option<S>
    where Self: Sized, S: Sum<Self::Item>,

    Iterate over the entire iterator and add all the elements.

    An empty iterator returns None, otherwise Some(sum).

    @@ -1769,7 +1806,7 @@ early exit via short-circuiting.

    When calling sum1() and a primitive integer type is being returned, this method will panic if the computation overflows and debug assertions are enabled.

    -
    §Examples
    +
    §Examples
    use itertools::Itertools;
 
 let empty_sum = (1..1).sum1::<i32>();
@@ -1777,7 +1814,7 @@ enabled.
    
 
 let nonempty_sum = (1..11).sum1::<i32>();
 assert_eq!(nonempty_sum, Some(55));
    -
    source

    fn product1<P>(self) -> Option<P>
    where +

    source

    fn product1<P>(self) -> Option<P>
    where Self: Sized, P: Product<Self::Item>,

    Iterate over the entire iterator and multiply all the elements.

    An empty iterator returns None, otherwise Some(product).

    @@ -1785,7 +1822,7 @@ enabled.

    When calling product1() and a primitive integer type is being returned, method will panic if the computation overflows and debug assertions are enabled.

    -
    §Examples
    +
    §Examples
    use itertools::Itertools;
 
 let empty_product = (1..1).product1::<i32>();
@@ -1793,7 +1830,7 @@ enabled.
    
 
 let nonempty_product = (1..11).product1::<i32>();
 assert_eq!(nonempty_product, Some(3628800));
    -
    source

    fn sorted_unstable(self) -> IntoIter<Self::Item> ⓘ
    where +

    source

    fn sorted_unstable(self) -> IntoIter<Self::Item> ⓘ
    where Self: Sized, Self::Item: Ord,

    Sort all iterator elements into a new iterator in ascending order.

    Note: This consumes the entire iterator, uses the @@ -1809,7 +1846,7 @@ without any extra copying or allocation cost.

    let text = "bdacfe"; itertools::assert_equal(text.chars().sorted_unstable(), "abcdef".chars());
    -
    source

    fn sorted_unstable_by<F>(self, cmp: F) -> IntoIter<Self::Item> ⓘ
    where +

    source

    fn sorted_unstable_by<F>(self, cmp: F) -> IntoIter<Self::Item> ⓘ
    where Self: Sized, F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Sort all iterator elements into a new iterator in ascending order.

    Note: This consumes the entire iterator, uses the @@ -1831,7 +1868,7 @@ without any extra copying or allocation cost.

    itertools::assert_equal(oldest_people_first, vec!["Jill", "Jack", "Jane", "John"]);
    -
    source

    fn sorted_unstable_by_key<K, F>(self, f: F) -> IntoIter<Self::Item> ⓘ
    where +

    source

    fn sorted_unstable_by_key<K, F>(self, f: F) -> IntoIter<Self::Item> ⓘ
    where Self: Sized, K: Ord, F: FnMut(&Self::Item) -> K,

    Sort all iterator elements into a new iterator in ascending order.

    @@ -1854,7 +1891,7 @@ without any extra copying or allocation cost.

    itertools::assert_equal(oldest_people_first, vec!["Jill", "Jack", "Jane", "John"]);
    -
    source

    fn sorted(self) -> IntoIter<Self::Item> ⓘ
    where +

    source

    fn sorted(self) -> IntoIter<Self::Item> ⓘ
    where Self: Sized, Self::Item: Ord,

    Sort all iterator elements into a new iterator in ascending order.

    Note: This consumes the entire iterator, uses the @@ -1870,7 +1907,7 @@ without any extra copying or allocation cost.

    let text = "bdacfe"; itertools::assert_equal(text.chars().sorted(), "abcdef".chars());
    -
    source

    fn sorted_by<F>(self, cmp: F) -> IntoIter<Self::Item> ⓘ
    where +

    source

    fn sorted_by<F>(self, cmp: F) -> IntoIter<Self::Item> ⓘ
    where Self: Sized, F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Sort all iterator elements into a new iterator in ascending order.

    Note: This consumes the entire iterator, uses the @@ -1892,7 +1929,7 @@ without any extra copying or allocation cost.

    itertools::assert_equal(oldest_people_first, vec!["Jill", "Jack", "Jane", "John"]);
    -
    source

    fn sorted_by_key<K, F>(self, f: F) -> IntoIter<Self::Item> ⓘ
    where +

    source

    fn sorted_by_key<K, F>(self, f: F) -> IntoIter<Self::Item> ⓘ
    where Self: Sized, K: Ord, F: FnMut(&Self::Item) -> K,

    Sort all iterator elements into a new iterator in ascending order.

    @@ -1915,7 +1952,7 @@ without any extra copying or allocation cost.

    itertools::assert_equal(oldest_people_first, vec!["Jill", "Jack", "Jane", "John"]);
    -
    source

    fn sorted_by_cached_key<K, F>(self, f: F) -> IntoIter<Self::Item> ⓘ
    where +

    source

    fn sorted_by_cached_key<K, F>(self, f: F) -> IntoIter<Self::Item> ⓘ
    where Self: Sized, K: Ord, F: FnMut(&Self::Item) -> K,

    Sort all iterator elements into a new iterator in ascending order. The key function is @@ -1939,7 +1976,7 @@ without any extra copying or allocation cost.

    itertools::assert_equal(oldest_people_first, vec!["Jill", "Jack", "Jane", "John"]);
    -
    source

    fn k_smallest(self, k: usize) -> IntoIter<Self::Item> ⓘ
    where +

    source

    fn k_smallest(self, k: usize) -> IntoIter<Self::Item> ⓘ
    where Self: Sized, Self::Item: Ord,

    Sort the k smallest elements into a new iterator, in ascending order.

    Note: This consumes the entire iterator, and returns the result @@ -1962,7 +1999,126 @@ but much more efficient.

    .k_smallest(5); itertools::assert_equal(five_smallest, 0..5);
    -
    source

    fn partition_map<A, B, F, L, R>(self, predicate: F) -> (A, B)
    where +

    source

    fn k_smallest_by<F>(self, k: usize, cmp: F) -> IntoIter<Self::Item> ⓘ
    where + Self: Sized, + F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Sort the k smallest elements into a new iterator using the provided comparison.

    +

    The sorted iterator, if directly collected to a Vec, is converted +without any extra copying or allocation cost.

    +

    This corresponds to self.sorted_by(cmp).take(k) in the same way that +k_smallest corresponds to self.sorted().take(k), +in both semantics and complexity.

    +

    Particularly, a custom heap implementation ensures the comparison is not cloned.

    + +
    use itertools::Itertools;
+
+// A random permutation of 0..15
+let numbers = vec![6, 9, 1, 14, 0, 4, 8, 7, 11, 2, 10, 3, 13, 12, 5];
+
+let five_smallest = numbers
+    .into_iter()
+    .k_smallest_by(5, |a, b| (a % 7).cmp(&(b % 7)).then(a.cmp(b)));
+
+itertools::assert_equal(five_smallest, vec![0, 7, 14, 1, 8]);
    +
    source

    fn k_smallest_by_key<F, K>(self, k: usize, key: F) -> IntoIter<Self::Item> ⓘ
    where + Self: Sized, + F: FnMut(&Self::Item) -> K, + K: Ord,

    Return the elements producing the k smallest outputs of the provided function.

    +

    The sorted iterator, if directly collected to a Vec, is converted +without any extra copying or allocation cost.

    +

    This corresponds to self.sorted_by_key(key).take(k) in the same way that +k_smallest corresponds to self.sorted().take(k), +in both semantics and complexity.

    +

    Particularly, a custom heap implementation ensures the comparison is not cloned.

    + +
    use itertools::Itertools;
+
+// A random permutation of 0..15
+let numbers = vec![6, 9, 1, 14, 0, 4, 8, 7, 11, 2, 10, 3, 13, 12, 5];
+
+let five_smallest = numbers
+    .into_iter()
+    .k_smallest_by_key(5, |n| (n % 7, *n));
+
+itertools::assert_equal(five_smallest, vec![0, 7, 14, 1, 8]);
    +
    source

    fn k_largest(self, k: usize) -> IntoIter<Self::Item> ⓘ
    where + Self: Sized, + Self::Item: Ord,

    Sort the k largest elements into a new iterator, in descending order.

    +

    The sorted iterator, if directly collected to a Vec, is converted +without any extra copying or allocation cost.

    +

    It is semantically equivalent to k_smallest +with a reversed Ord. +However, this is implemented with a custom binary heap which does not +have the same performance characteristics for very large Self::Item.

    + +
    use itertools::Itertools;
+
+// A random permutation of 0..15
+let numbers = vec![6, 9, 1, 14, 0, 4, 8, 7, 11, 2, 10, 3, 13, 12, 5];
+
+let five_largest = numbers
+    .into_iter()
+    .k_largest(5);
+
+itertools::assert_equal(five_largest, vec![14, 13, 12, 11, 10]);
    +
    source

    fn k_largest_by<F>(self, k: usize, cmp: F) -> IntoIter<Self::Item> ⓘ
    where + Self: Sized, + F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Sort the k largest elements into a new iterator using the provided comparison.

    +

    The sorted iterator, if directly collected to a Vec, is converted +without any extra copying or allocation cost.

    +

    Functionally equivalent to k_smallest_by +with a reversed Ord.

    + +
    use itertools::Itertools;
+
+// A random permutation of 0..15
+let numbers = vec![6, 9, 1, 14, 0, 4, 8, 7, 11, 2, 10, 3, 13, 12, 5];
+
+let five_largest = numbers
+    .into_iter()
+    .k_largest_by(5, |a, b| (a % 7).cmp(&(b % 7)).then(a.cmp(b)));
+
+itertools::assert_equal(five_largest, vec![13, 6, 12, 5, 11]);
    +
    source

    fn k_largest_by_key<F, K>(self, k: usize, key: F) -> IntoIter<Self::Item> ⓘ
    where + Self: Sized, + F: FnMut(&Self::Item) -> K, + K: Ord,

    Return the elements producing the k largest outputs of the provided function.

    +

    The sorted iterator, if directly collected to a Vec, is converted +without any extra copying or allocation cost.

    +

    Functionally equivalent to k_smallest_by_key +with a reversed Ord.

    + +
    use itertools::Itertools;
+
+// A random permutation of 0..15
+let numbers = vec![6, 9, 1, 14, 0, 4, 8, 7, 11, 2, 10, 3, 13, 12, 5];
+
+let five_largest = numbers
+    .into_iter()
+    .k_largest_by_key(5, |n| (n % 7, *n));
+
+itertools::assert_equal(five_largest, vec![13, 6, 12, 5, 11]);
    +
    source

    fn tail(self, n: usize) -> IntoIter<Self::Item> ⓘ
    where + Self: Sized,

    Consumes the iterator and return an iterator of the last n elements.

    +

    The iterator, if directly collected to a VecDeque, is converted +without any extra copying or allocation cost. +If directly collected to a Vec, it may need some data movement +but no re-allocation.

    + +
    use itertools::{assert_equal, Itertools};
+
+let v = vec![5, 9, 8, 4, 2, 12, 0];
+assert_equal(v.iter().tail(3), &[2, 12, 0]);
+assert_equal(v.iter().tail(10), &v);
+
+assert_equal(v.iter().tail(1), v.iter().last());
+
+assert_equal((0..100).tail(10), 90..100);
+
+assert_equal((0..100).filter(|x| x % 3 == 0).tail(10), (72..100).step_by(3));
    +

    For double ended iterators without side-effects, you might prefer +.rev().take(n).rev() to have a similar result (lazy and non-allocating) +without consuming the entire iterator.

    +
    source

    fn partition_map<A, B, F, L, R>(self, predicate: F) -> (A, B)
    where Self: Sized, F: FnMut(Self::Item) -> Either<L, R>, A: Default + Extend<L>, @@ -1985,7 +2141,7 @@ have a distinct type.

    assert_eq!(successes, [1, 2]); assert_eq!(failures, [false, true]);
    -

    source

    fn partition_result<A, B, T, E>(self) -> (A, B)
    where +

    source

    fn partition_result<A, B, T, E>(self) -> (A, B)
    where Self: Iterator<Item = Result<T, E>> + Sized, A: Default + Extend<T>, B: Default + Extend<E>,

    Partition a sequence of Results into one list of all the Ok elements @@ -2001,7 +2157,7 @@ and another list of all the Err elements.

    assert_eq!(successes, [1, 2]); assert_eq!(failures, [false, true]);
    -
    source

    fn into_group_map<K, V>(self) -> HashMap<K, Vec<V>>
    where +

    source

    fn into_group_map<K, V>(self) -> HashMap<K, Vec<V>>
    where Self: Iterator<Item = (K, V)> + Sized, K: Hash + Eq,

    Return a HashMap of keys mapped to Vecs of values. Keys and values are taken from (Key, Value) tuple pairs yielded by the input iterator.

    @@ -2016,10 +2172,10 @@ are taken from (Key, Value) tuple pairs yielded by the input iterat assert_eq!(lookup.get(&1), None); assert_eq!(lookup[&2], vec![12, 42]); assert_eq!(lookup[&3], vec![13, 33]);
    -
    source

    fn into_group_map_by<K, V, F>(self, f: F) -> HashMap<K, Vec<V>>
    where +

    source

    fn into_group_map_by<K, V, F>(self, f: F) -> HashMap<K, Vec<V>>
    where Self: Iterator<Item = V> + Sized, K: Hash + Eq, - F: Fn(&V) -> K,

    Return an Iterator on a HashMap. Keys mapped to Vecs of values. The key is specified + F: FnMut(&V) -> K,

    Return an Iterator on a HashMap. Keys mapped to Vecs of values. The key is specified in the closure.

    Essentially a shorthand for .into_grouping_map_by(f).collect::<Vec<_>>().

    @@ -2043,7 +2199,7 @@ in the closure.

    .collect::<HashMap<u32,u32>>()[&0], 30, );
    -
    source

    fn into_grouping_map<K, V>(self) -> GroupingMap<Self>
    where +

    source

    fn into_grouping_map<K, V>(self) -> GroupingMap<Self>
    where Self: Iterator<Item = (K, V)> + Sized, K: Hash + Eq,

    Constructs a GroupingMap to be used later with one of the efficient group-and-fold operations it allows to perform.

    @@ -2052,7 +2208,7 @@ value of type K will be used as key to identify the groups and the value of type V as value for the folding operation.

    See GroupingMap for more informations on what operations are available.

    -
    source

    fn into_grouping_map_by<K, V, F>(self, key_mapper: F) -> GroupingMapBy<Self, F>
    where +

    source

    fn into_grouping_map_by<K, V, F>(self, key_mapper: F) -> GroupingMapBy<Self, F>
    where Self: Iterator<Item = V> + Sized, K: Hash + Eq, F: FnMut(&V) -> K,

    Constructs a GroupingMap to be used later with one of the efficient @@ -2061,10 +2217,10 @@ group-and-fold operations it allows to perform.

    while the keys will be obtained from the values by calling key_mapper.

    See GroupingMap for more informations on what operations are available.

    -
    source

    fn min_set(self) -> Vec<Self::Item>
    where +

    source

    fn min_set(self) -> Vec<Self::Item>
    where Self: Sized, Self::Item: Ord,

    Return all minimum elements of an iterator.

    -
    §Examples
    +
    §Examples
    use itertools::Itertools;
 
 let a: [i32; 0] = [];
@@ -2080,11 +2236,11 @@ on what operations are available.
    
 assert_eq!(a.iter().min_set(), vec![&1, &1, &1, &1]);

    The elements can be floats but no particular result is guaranteed if an element is NaN.

    -
    source

    fn min_set_by<F>(self, compare: F) -> Vec<Self::Item>
    where +

    source

    fn min_set_by<F>(self, compare: F) -> Vec<Self::Item>
    where Self: Sized, F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Return all minimum elements of an iterator, as determined by the specified function.

    -
    §Examples
    +
    §Examples
    use itertools::Itertools;
 
 let a: [(i32, i32); 0] = [];
@@ -2100,12 +2256,12 @@ the specified function.
    
 assert_eq!(a.iter().min_set_by(|&&(k1,_), &&(k2, _)| k1.cmp(&k2)), vec![&(1, 2), &(1, 3), &(1, 4), &(1, 5)]);

    The elements can be floats but no particular result is guaranteed if an element is NaN.

    -
    source

    fn min_set_by_key<K, F>(self, key: F) -> Vec<Self::Item>
    where +

    source

    fn min_set_by_key<K, F>(self, key: F) -> Vec<Self::Item>
    where Self: Sized, K: Ord, F: FnMut(&Self::Item) -> K,

    Return all minimum elements of an iterator, as determined by the specified function.

    -
    §Examples
    +
    §Examples
    use itertools::Itertools;
 
 let a: [(i32, i32); 0] = [];
@@ -2121,10 +2277,10 @@ the specified function.
    
 assert_eq!(a.iter().min_set_by_key(|&&(k, _)| k), vec![&(1, 2), &(1, 3), &(1, 4), &(1, 5)]);

    The elements can be floats but no particular result is guaranteed if an element is NaN.

    -
    source

    fn max_set(self) -> Vec<Self::Item>
    where +

    source

    fn max_set(self) -> Vec<Self::Item>
    where Self: Sized, Self::Item: Ord,

    Return all maximum elements of an iterator.

    -
    §Examples
    +
    §Examples
    use itertools::Itertools;
 
 let a: [i32; 0] = [];
@@ -2140,11 +2296,11 @@ if an element is NaN.
    
 assert_eq!(a.iter().max_set(), vec![&1, &1, &1, &1]);

    The elements can be floats but no particular result is guaranteed if an element is NaN.

    -
    source

    fn max_set_by<F>(self, compare: F) -> Vec<Self::Item>
    where +

    source

    fn max_set_by<F>(self, compare: F) -> Vec<Self::Item>
    where Self: Sized, F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Return all maximum elements of an iterator, as determined by the specified function.

    -
    §Examples
    +
    §Examples
    use itertools::Itertools;
 
 let a: [(i32, i32); 0] = [];
@@ -2160,12 +2316,12 @@ the specified function.
    
 assert_eq!(a.iter().max_set_by(|&&(k1,_), &&(k2, _)| k1.cmp(&k2)), vec![&(1, 2), &(1, 3), &(1, 4), &(1, 5)]);

    The elements can be floats but no particular result is guaranteed if an element is NaN.

    -
    source

    fn max_set_by_key<K, F>(self, key: F) -> Vec<Self::Item>
    where +

    source

    fn max_set_by_key<K, F>(self, key: F) -> Vec<Self::Item>
    where Self: Sized, K: Ord, F: FnMut(&Self::Item) -> K,

    Return all maximum elements of an iterator, as determined by the specified function.

    -
    §Examples
    +
    §Examples
    use itertools::Itertools;
 
 let a: [(i32, i32); 0] = [];
@@ -2181,7 +2337,7 @@ the specified function.
    
 assert_eq!(a.iter().max_set_by_key(|&&(k, _)| k), vec![&(1, 2), &(1, 3), &(1, 4), &(1, 5)]);

    The elements can be floats but no particular result is guaranteed if an element is NaN.

    -
    source

    fn minmax(self) -> MinMaxResult<Self::Item>
    where +

    source

    fn minmax(self) -> MinMaxResult<Self::Item>
    where Self: Sized, Self::Item: PartialOrd,

    Return the minimum and maximum elements in the iterator.

    The return type MinMaxResult is an enum of three variants:

    @@ -2195,7 +2351,7 @@ element in the iterator and all elements are equal.

    On an iterator of length n, minmax does 1.5 * n comparisons, and so is faster than calling min and max separately which does 2 * n comparisons.

    -
    §Examples
    +
    §Examples
    use itertools::Itertools;
 use itertools::MinMaxResult::{NoElements, OneElement, MinMax};
 
@@ -2212,7 +2368,7 @@ and so is faster than calling min and max separately w
 assert_eq!(a.iter().minmax(), MinMax(&1, &1));

    The elements can be floats but no particular result is guaranteed if an element is NaN.

    -
    source

    fn minmax_by_key<K, F>(self, key: F) -> MinMaxResult<Self::Item>
    where +

    source

    fn minmax_by_key<K, F>(self, key: F) -> MinMaxResult<Self::Item>
    where Self: Sized, K: PartialOrd, F: FnMut(&Self::Item) -> K,

    Return the minimum and maximum element of an iterator, as determined by @@ -2223,7 +2379,7 @@ the last maximal element wins. This matches the behavior of the standard Iterator::min and Iterator::max methods.

    The keys can be floats but no particular result is guaranteed if a key is NaN.

    -
    source

    fn minmax_by<F>(self, compare: F) -> MinMaxResult<Self::Item>
    where +

    source

    fn minmax_by<F>(self, compare: F) -> MinMaxResult<Self::Item>
    where Self: Sized, F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Return the minimum and maximum element of an iterator, as determined by the specified comparison function.

    @@ -2231,12 +2387,12 @@ the specified comparison function.

    For the minimum, the first minimal element is returned. For the maximum, the last maximal element wins. This matches the behavior of the standard Iterator::min and Iterator::max methods.

    -
    source

    fn position_max(self) -> Option<usize>
    where +

    source

    fn position_max(self) -> Option<usize>
    where Self: Sized, Self::Item: Ord,

    Return the position of the maximum element in the iterator.

    If several elements are equally maximum, the position of the last of them is returned.

    -
    §Examples
    +
    §Examples
    use itertools::Itertools;
 
 let a: [i32; 0] = [];
@@ -2247,14 +2403,14 @@ last of them is returned.
    
 
 let a = [1, 1, -1, -1];
 assert_eq!(a.iter().position_max(), Some(1));
    -
    source

    fn position_max_by_key<K, F>(self, key: F) -> Option<usize>
    where +

    source

    fn position_max_by_key<K, F>(self, key: F) -> Option<usize>
    where Self: Sized, K: Ord, F: FnMut(&Self::Item) -> K,

    Return the position of the maximum element in the iterator, as determined by the specified function.

    If several elements are equally maximum, the position of the last of them is returned.

    -
    §Examples
    +
    §Examples
    use itertools::Itertools;
 
 let a: [i32; 0] = [];
@@ -2265,13 +2421,13 @@ last of them is returned.
    
 
 let a = [1_i32, 1, -1, -1];
 assert_eq!(a.iter().position_max_by_key(|x| x.abs()), Some(3));
    -
    source

    fn position_max_by<F>(self, compare: F) -> Option<usize>
    where +

    source

    fn position_max_by<F>(self, compare: F) -> Option<usize>
    where Self: Sized, F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Return the position of the maximum element in the iterator, as determined by the specified comparison function.

    If several elements are equally maximum, the position of the last of them is returned.

    -
    §Examples
    +
    §Examples
    use itertools::Itertools;
 
 let a: [i32; 0] = [];
@@ -2282,12 +2438,12 @@ last of them is returned.
    
 
 let a = [1_i32, 1, -1, -1];
 assert_eq!(a.iter().position_max_by(|x, y| x.cmp(y)), Some(1));
    -
    source

    fn position_min(self) -> Option<usize>
    where +

    source

    fn position_min(self) -> Option<usize>
    where Self: Sized, Self::Item: Ord,

    Return the position of the minimum element in the iterator.

    If several elements are equally minimum, the position of the first of them is returned.

    -
    §Examples
    +
    §Examples
    use itertools::Itertools;
 
 let a: [i32; 0] = [];
@@ -2298,14 +2454,14 @@ first of them is returned.
    
 
 let a = [1, 1, -1, -1];
 assert_eq!(a.iter().position_min(), Some(2));
    -
    source

    fn position_min_by_key<K, F>(self, key: F) -> Option<usize>
    where +

    source

    fn position_min_by_key<K, F>(self, key: F) -> Option<usize>
    where Self: Sized, K: Ord, F: FnMut(&Self::Item) -> K,

    Return the position of the minimum element in the iterator, as determined by the specified function.

    If several elements are equally minimum, the position of the first of them is returned.

    -
    §Examples
    +
    §Examples
    use itertools::Itertools;
 
 let a: [i32; 0] = [];
@@ -2316,13 +2472,13 @@ first of them is returned.
    
 
 let a = [1_i32, 1, -1, -1];
 assert_eq!(a.iter().position_min_by_key(|x| x.abs()), Some(0));
    -
    source

    fn position_min_by<F>(self, compare: F) -> Option<usize>
    where +

    source

    fn position_min_by<F>(self, compare: F) -> Option<usize>
    where Self: Sized, F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Return the position of the minimum element in the iterator, as determined by the specified comparison function.

    If several elements are equally minimum, the position of the first of them is returned.

    -
    §Examples
    +
    §Examples
    use itertools::Itertools;
 
 let a: [i32; 0] = [];
@@ -2333,7 +2489,7 @@ first of them is returned.
    
 
 let a = [1_i32, 1, -1, -1];
 assert_eq!(a.iter().position_min_by(|x, y| x.cmp(y)), Some(2));
    -
    source

    fn position_minmax(self) -> MinMaxResult<usize>
    where +

    source

    fn position_minmax(self) -> MinMaxResult<usize>
    where Self: Sized, Self::Item: PartialOrd,

    Return the positions of the minimum and maximum elements in the iterator.

    @@ -2355,7 +2511,7 @@ several elements are equally maximum, the position of the last of them is returned.

    The elements can be floats but no particular result is guaranteed if an element is NaN.

    -
    §Examples
    +
    §Examples
    use itertools::Itertools;
 use itertools::MinMaxResult::{NoElements, OneElement, MinMax};
 
@@ -2370,7 +2526,7 @@ guaranteed if an element is NaN.
    
 
 let a = [1, 1, -1, -1];
 assert_eq!(a.iter().position_minmax(), MinMax(2, 1));
    -
    source

    fn position_minmax_by_key<K, F>(self, key: F) -> MinMaxResult<usize>
    where +

    source

    fn position_minmax_by_key<K, F>(self, key: F) -> MinMaxResult<usize>
    where Self: Sized, K: PartialOrd, F: FnMut(&Self::Item) -> K,

    Return the postions of the minimum and maximum elements of an @@ -2383,7 +2539,7 @@ several elements are equally maximum, the position of the last of them is returned.

    The keys can be floats but no particular result is guaranteed if a key is NaN.

    -
    §Examples
    +
    §Examples
    use itertools::Itertools;
 use itertools::MinMaxResult::{NoElements, OneElement, MinMax};
 
@@ -2398,7 +2554,7 @@ if a key is NaN.
    
 
 let a = [1_i32, 1, -1, -1];
 assert_eq!(a.iter().position_minmax_by_key(|x| x.abs()), MinMax(0, 3));
    -
    source

    fn position_minmax_by<F>(self, compare: F) -> MinMaxResult<usize>
    where +

    source

    fn position_minmax_by<F>(self, compare: F) -> MinMaxResult<usize>
    where Self: Sized, F: FnMut(&Self::Item, &Self::Item) -> Ordering,

    Return the postions of the minimum and maximum elements of an iterator, as determined by the specified comparison function.

    @@ -2408,7 +2564,7 @@ iterator, as determined by the specified comparison function.

    position of the first of them is returned. For the maximum, if several elements are equally maximum, the position of the last of them is returned.

    -
    §Examples
    +
    §Examples
    use itertools::Itertools;
 use itertools::MinMaxResult::{NoElements, OneElement, MinMax};
 
@@ -2423,38 +2579,38 @@ of them is returned.
    
 
 let a = [1_i32, 1, -1, -1];
 assert_eq!(a.iter().position_minmax_by(|x, y| x.cmp(y)), MinMax(2, 1));
    -
    source

    fn exactly_one(self) -> Result<Self::Item, ExactlyOneError<Self>>
    where +

    source

    fn exactly_one(self) -> Result<Self::Item, ExactlyOneError<Self>>
    where Self: Sized,

    If the iterator yields exactly one element, that element will be returned, otherwise an error will be returned containing an iterator that has the same output as the input iterator.

    This provides an additional layer of validation over just calling Iterator::next(). If your assumption that there should only be one element yielded is false this provides the opportunity to detect and handle that, preventing errors at a distance.

    -
    §Examples
    +
    §Examples
    use itertools::Itertools;
 
 assert_eq!((0..10).filter(|&x| x == 2).exactly_one().unwrap(), 2);
 assert!((0..10).filter(|&x| x > 1 && x < 4).exactly_one().unwrap_err().eq(2..4));
 assert!((0..10).filter(|&x| x > 1 && x < 5).exactly_one().unwrap_err().eq(2..5));
 assert!((0..10).filter(|&_| false).exactly_one().unwrap_err().eq(0..0));
    -
    source

    fn at_most_one(self) -> Result<Option<Self::Item>, ExactlyOneError<Self>>
    where - Self: Sized,

    If the iterator yields no elements, Ok(None) will be returned. If the iterator yields +

    source

    fn at_most_one(self) -> Result<Option<Self::Item>, ExactlyOneError<Self>>
    where + Self: Sized,

    If the iterator yields no elements, Ok(None) will be returned. If the iterator yields exactly one element, that element will be returned, otherwise an error will be returned containing an iterator that has the same output as the input iterator.

    This provides an additional layer of validation over just calling Iterator::next(). If your assumption that there should be at most one element yielded is false this provides the opportunity to detect and handle that, preventing errors at a distance.

    -
    §Examples
    +
    §Examples
    use itertools::Itertools;
 
 assert_eq!((0..10).filter(|&x| x == 2).at_most_one().unwrap(), Some(2));
 assert!((0..10).filter(|&x| x > 1 && x < 4).at_most_one().unwrap_err().eq(2..4));
 assert!((0..10).filter(|&x| x > 1 && x < 5).at_most_one().unwrap_err().eq(2..5));
 assert_eq!((0..10).filter(|&_| false).at_most_one().unwrap(), None);
    -
    source

    fn multipeek(self) -> MultiPeek<Self> ⓘ
    where +

    source

    fn multipeek(self) -> MultiPeek<Self> ⓘ
    where Self: Sized,

    An iterator adaptor that allows the user to peek at multiple .next() values without advancing the base iterator.

    -
    §Examples
    +
    §Examples
    use itertools::Itertools;
 
 let mut iter = (0..10).multipeek();
@@ -2463,18 +2619,18 @@ values without advancing the base iterator.
    
 assert_eq!(iter.peek(), Some(&2));
 assert_eq!(iter.next(), Some(0));
 assert_eq!(iter.peek(), Some(&1));
    -
    source

    fn counts(self) -> HashMap<Self::Item, usize>
    where +

    source

    fn counts(self) -> HashMap<Self::Item, usize>
    where Self: Sized, Self::Item: Eq + Hash,

    Collect the items in this iterator and return a HashMap which contains each item that appears in the iterator and the number of times it appears.

    -
    §Examples
    +
    §Examples
    let counts = [1, 1, 1, 3, 3, 5].into_iter().counts();
 assert_eq!(counts[&1], 3);
 assert_eq!(counts[&3], 2);
 assert_eq!(counts[&5], 1);
 assert_eq!(counts.get(&0), None);
    -
    source

    fn counts_by<K, F>(self, f: F) -> HashMap<K, usize>
    where +

    source

    fn counts_by<K, F>(self, f: F) -> HashMap<K, usize>
    where Self: Sized, K: Eq + Hash, F: FnMut(Self::Item) -> K,

    Collect the items in this iterator and return a HashMap which @@ -2506,9 +2662,9 @@ determining identity using a keying function.

    assert_eq!(first_name_frequency["Amy"], 3); assert_eq!(first_name_frequency["James"], 4); assert_eq!(first_name_frequency.contains_key("Asha"), false);
    -
    source

    fn multiunzip<FromI>(self) -> FromI
    where +

    source

    fn multiunzip<FromI>(self) -> FromI
    where Self: Sized + MultiUnzip<FromI>,

    Converts an iterator of tuples into a tuple of containers.

    -

    unzip() consumes an entire iterator of n-ary tuples, producing n collections, one for each +

    It consumes an entire iterator of n-ary tuples, producing n collections, one for each column.

    This function is, in some sense, the opposite of multizip.

    @@ -2523,7 +2679,7 @@ column.

    assert_eq!(a, vec![1, 4, 7]); assert_eq!(b, vec![2, 5, 8]); assert_eq!(c, vec![3, 6, 9]);
    -
    source

    fn try_len(&self) -> Result<usize, (usize, Option<usize>)>

    Returns the length of the iterator if one exists. +

    source

    fn try_len(&self) -> Result<usize, (usize, Option<usize>)>

    Returns the length of the iterator if one exists. Otherwise return self.size_hint().

    Fallible ExactSizeIterator::len.

    Inherits guarantees and restrictions from Iterator::size_hint.

    @@ -2535,5 +2691,5 @@ Otherwise return self.size_hint().

    assert_eq!((15..10).try_len(), Ok(0)); assert_eq!((10..).try_len(), Err((usize::MAX, None))); assert_eq!((10..15).filter(|x| x % 2 == 0).try_len(), Err((0, Some(5))));
    -

    Object Safety§

    This trait is not object safe.

    Implementors§

    source§

    impl<T> Itertools for T
    where - T: Iterator + ?Sized,

    \ No newline at end of file +

    Object Safety§

    This trait is not object safe.

    Implementors§

    source§

    impl<T> Itertools for T
    where + T: Iterator + ?Sized,

    \ No newline at end of file diff --git a/itertools/trait.MultiUnzip.html b/itertools/trait.MultiUnzip.html index cf531237d..fee0a2368 100644 --- a/itertools/trait.MultiUnzip.html +++ b/itertools/trait.MultiUnzip.html @@ -1,4 +1,4 @@ -MultiUnzip in itertools - Rust
    +MultiUnzip in itertools - Rust

    Trait itertools::MultiUnzip

    source · 
    pub trait MultiUnzip<FromI>: Iterator {
     // Required method
     fn multiunzip(self) -> FromI;
diff --git a/itertools/trait.PeekingNext.html b/itertools/trait.PeekingNext.html
index 9dab458c4..cfcf4a494 100644
--- a/itertools/trait.PeekingNext.html
+++ b/itertools/trait.PeekingNext.html
@@ -1,4 +1,4 @@
-PeekingNext in itertools - Rust
    
+PeekingNext in itertools - Rust
    
     
    Trait itertools::PeekingNext
    source · 
    pub trait PeekingNext: Iterator {
     // Required method
     fn peeking_next<F>(&mut self, accept: F) -> Option<Self::Item>
@@ -9,12 +9,12 @@
 for more information.
    
 
    This is implemented by peeking adaptors like peekable and put back,
 but also by a few iterators that can be peeked natively, like the slice’s
-by reference iterator (std::slice::Iter).
    
+by reference iterator (std::slice::Iter).
    
 
    Required Methods§
    source
    fn peeking_next<F>(&mut self, accept: F) -> Option<Self::Item>
    where
     Self: Sized,
     F: FnOnce(&Self::Item) -> bool,
    Pass a reference to the next iterator element to the closure accept;
-if accept returns true, return it as the next element,
-else None.
    
+if accept returns true, return it as the next element,
+else None.
    
 
    Implementations on Foreign Types§
    source§
    impl<'a> PeekingNext for Bytes<'a>
    source§
    fn peeking_next<F>(&mut self, accept: F) -> Option<Self::Item>
    where
     F: FnOnce(&Self::Item) -> bool,
    source§
    impl<'a> PeekingNext for CharIndices<'a>
    source§
    fn peeking_next<F>(&mut self, accept: F) -> Option<Self::Item>
    where
     F: FnOnce(&Self::Item) -> bool,
    source§
    impl<'a> PeekingNext for Chars<'a>
    source§
    fn peeking_next<F>(&mut self, accept: F) -> Option<Self::Item>
    where
diff --git a/itertools/traits/index.html b/itertools/traits/index.html
index af76a241b..4489a0bb2 100644
--- a/itertools/traits/index.html
+++ b/itertools/traits/index.html
@@ -1,3 +1,4 @@
-itertools::traits - Rust
    
-    
    Module itertools::traits
    source · 
    Expand description
    Traits helpful for using certain Itertools methods in generic contexts.
    
-
    Traits§
    
\ No newline at end of file
+itertools::traits - Rust
    
+    
    Module itertools::traits
    source · 
    Expand description
    Traits helpful for using certain Itertools methods in generic contexts.
    
+
    Traits§
    
\ No newline at end of file
diff --git a/itertools/traits/sidebar-items.js b/itertools/traits/sidebar-items.js
index 8e28ade51..879215ec3 100644
--- a/itertools/traits/sidebar-items.js
+++ b/itertools/traits/sidebar-items.js
@@ -1 +1 @@
-window.SIDEBAR_ITEMS = {"trait":["HomogeneousTuple"]};
\ No newline at end of file
+window.SIDEBAR_ITEMS = {"trait":["HomogeneousTuple","IteratorIndex"]};
\ No newline at end of file
diff --git a/itertools/traits/trait.HomogeneousTuple.html b/itertools/traits/trait.HomogeneousTuple.html
index 4ab8d0c23..12dc2c6a8 100644
--- a/itertools/traits/trait.HomogeneousTuple.html
+++ b/itertools/traits/trait.HomogeneousTuple.html
@@ -1,3 +1,3 @@
-HomogeneousTuple in itertools::traits - Rust
    
+HomogeneousTuple in itertools::traits - Rust
    
     
    Trait itertools::traits::HomogeneousTuple
    source · 
    pub trait HomogeneousTuple: TupleCollect { }
    Expand description
    Implemented for homogeneous tuples of size up to 12.
    
 
    Object Safety§
    This trait is not object safe.
    Implementors§
    source§
    impl<T: TupleCollect> HomogeneousTuple for T
    
\ No newline at end of file
diff --git a/itertools/traits/trait.IteratorIndex.html b/itertools/traits/trait.IteratorIndex.html
new file mode 100644
index 000000000..9e6ab46ce
--- /dev/null
+++ b/itertools/traits/trait.IteratorIndex.html
@@ -0,0 +1,20 @@
+IteratorIndex in itertools::traits - Rust
    
+    
    Trait itertools::traits::IteratorIndex
    source · 
    pub trait IteratorIndex<I>: Sealed
    where
+    I: Iterator,
    {
+    type Output: Iterator<Item = I::Item>;
+
+    // Required method
+    fn index(self, from: I) -> Self::Output;
+}
    Expand description
    Used by Itertools::get to know which iterator
+to turn different ranges into.
    
+
    Required Associated Types§
    source
    type Output: Iterator<Item = I::Item>
    The type returned for this type of index.
    
+
    Required Methods§
    source
    fn index(self, from: I) -> Self::Output
    Returns an adapted iterator for the current index.
    
+
    Prefer calling Itertools::get instead
+of calling this directly.
    
+
    Implementations on Foreign Types§
    source§
    impl<I> IteratorIndex<I> for Range<usize>
    where
+    I: Iterator,
    §
    type Output = Skip<Take<I>>
    source§
    fn index(self, iter: I) -> Self::Output
    source§
    impl<I> IteratorIndex<I> for RangeFrom<usize>
    where
+    I: Iterator,
    §
    type Output = Skip<I>
    source§
    fn index(self, iter: I) -> Self::Output
    source§
    impl<I> IteratorIndex<I> for RangeFull
    where
+    I: Iterator,
    §
    type Output = I
    source§
    fn index(self, iter: I) -> Self::Output
    source§
    impl<I> IteratorIndex<I> for RangeInclusive<usize>
    where
+    I: Iterator,
    §
    type Output = Take<Skip<I>>
    source§
    fn index(self, iter: I) -> Self::Output
    source§
    impl<I> IteratorIndex<I> for RangeTo<usize>
    where
+    I: Iterator,
    §
    type Output = Take<I>
    source§
    fn index(self, iter: I) -> Self::Output
    source§
    impl<I> IteratorIndex<I> for RangeToInclusive<usize>
    where
+    I: Iterator,
    §
    type Output = Take<I>
    source§
    fn index(self, iter: I) -> Self::Output
    Implementors§
    
\ No newline at end of file
diff --git a/regex_syntax/ast/enum.ErrorKind.html b/regex_syntax/ast/enum.ErrorKind.html
index e972701b4..210ac6dc7 100644
--- a/regex_syntax/ast/enum.ErrorKind.html
+++ b/regex_syntax/ast/enum.ErrorKind.html
@@ -115,7 +115,7 @@ returned. Some example syntaxes that are rejected include, but are
 not necessarily limited to, (?=re), (?!re), (?<=re) and
 (?<!re). Note that all of these syntaxes are otherwise invalid; this
 error is used to improve the user experience.
    
-
    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/enum.Error.html b/regex_syntax/enum.Error.html
index d3d74c20a..0e1545eef 100644
--- a/regex_syntax/enum.Error.html
+++ b/regex_syntax/enum.Error.html
@@ -9,7 +9,7 @@ new variant is not considered a breaking change.
    
 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/literal/struct.Literal.html b/regex_syntax/hir/literal/struct.Literal.html
index dbdcf40bd..6dc5a6ef7 100644
--- a/regex_syntax/hir/literal/struct.Literal.html
+++ b/regex_syntax/hir/literal/struct.Literal.html
@@ -33,7 +33,7 @@ Otherwise, the literal is marked as inexact.
    
 
    source
    pub fn keep_last_bytes(&mut self, len: usize)
    Trims this literal such that only the last len bytes remain. If this
 literal has fewer than len bytes, then it remains unchanged.
 Otherwise, the literal is marked as inexact.
    
-
    Trait Implementations§
    source§
    impl AsRef<[u8]> for Literal
    source§
    fn as_ref(&self) -> &[u8] ⓘ
    Converts this type into a shared reference of the (usually inferred) input type.
    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 From<char> for Literal
    source§
    fn from(ch: char) -> Literal
    Converts to this type from the input type.
    source§
    impl From<u8> for Literal
    source§
    fn from(byte: u8) -> Literal
    Converts to this type from the input type.
    source§
    impl FromIterator<Literal> for Seq
    source§
    fn from_iter<T: IntoIterator<Item = Literal>>(it: T) -> Seq
    Creates a value from an iterator. Read more
    source§
    impl Ord for Literal
    source§
    fn cmp(&self, other: &Literal) -> Ordering
    This method returns an Ordering between self and other. Read more
    1.21.0 · source§
    fn max(self, other: Self) -> Self
    where
+
    Trait Implementations§
    source§
    impl AsRef<[u8]> for Literal
    source§
    fn as_ref(&self) -> &[u8] ⓘ
    Converts this type into a shared reference of the (usually inferred) input type.
    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 From<char> for Literal
    source§
    fn from(ch: char) -> Literal
    Converts to this type from the input type.
    source§
    impl From<u8> for Literal
    source§
    fn from(byte: u8) -> Literal
    Converts to this type from the input type.
    source§
    impl FromIterator<Literal> for Seq
    source§
    fn from_iter<T: IntoIterator<Item = Literal>>(it: T) -> Seq
    Creates a value from an iterator. Read more
    source§
    impl Ord for Literal
    source§
    fn cmp(&self, other: &Literal) -> 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 Literal
    source§
    fn eq(&self, other: &Literal) -> bool
    This method tests for self and other values to be equal, and is used
diff --git a/regex_syntax/hir/struct.Hir.html b/regex_syntax/hir/struct.Hir.html
index e7449e7fc..5fc3461a5 100644
--- a/regex_syntax/hir/struct.Hir.html
+++ b/regex_syntax/hir/struct.Hir.html
@@ -236,11 +236,11 @@ HIR value. It is just an abbreviation for a common character class.
    
     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 5bfb43711..8b11c10f2 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 06366281f..d359d346f 100644 --- a/search-index.js +++ b/search-index.js @@ -4,7 +4,7 @@ var searchIndex = new Map(JSON.parse('[\ ["anstyle",{"doc":"ANSI Text Styling","t":"PPFGTTPPPPPPPPPPTGPTTTTFFPTTTPPFPFTFTPPNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNN","n":["Ansi","Ansi256","Ansi256Color","AnsiColor","BLINK","BOLD","Black","Blue","BrightBlack","BrightBlue","BrightCyan","BrightGreen","BrightMagenta","BrightRed","BrightWhite","BrightYellow","CURLY_UNDERLINE","Color","Cyan","DASHED_UNDERLINE","DIMMED","DOTTED_UNDERLINE","DOUBLE_UNDERLINE","EffectIter","Effects","Green","HIDDEN","INVERT","ITALIC","Magenta","Red","Reset","Rgb","RgbColor","STRIKETHROUGH","Style","UNDERLINE","White","Yellow","b","bg_color","bitor","bitor","bitor_assign","bitor_assign","blink","bold","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","bright","clear","clone","clone","clone","clone","clone","clone","clone","clone","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","cmp","cmp","cmp","cmp","cmp","cmp","cmp","contains","default","default","default","dimmed","effects","eq","eq","eq","eq","eq","eq","eq","eq","eq","fg_color","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_ansi","g","get_bg_color","get_effects","get_fg_color","get_underline_color","hash","hash","hash","hash","hash","hash","hash","hidden","index","insert","into","into","into","into","into","into","into","into","into_ansi","into_iter","invert","is_bright","is_plain","is_plain","italic","iter","new","new","next","on","on","on","on","on_default","on_default","on_default","on_default","partial_cmp","partial_cmp","partial_cmp","partial_cmp","partial_cmp","partial_cmp","partial_cmp","r","remove","render","render","render","render_bg","render_bg","render_bg","render_bg","render_fg","render_fg","render_fg","render_fg","render_reset","set","strikethrough","sub","sub","sub_assign","sub_assign","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_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","underline","underline_color","write_reset_to","write_to"],"q":[[0,"anstyle"],[239,"core::option"],[240,"core::cmp"],[241,"core::fmt"],[242,"core::fmt"],[243,"core::convert"],[244,"core::fmt"],[245,"alloc::string"],[246,"core::result"],[247,"core::any"],[248,"std::io"],[249,"std::io::error"]],"d":["Available 4-bit ANSI color palette codes","256 (8-bit) color support","256 (8-bit) color support","Available 4-bit ANSI color palette codes","","","Black: #0 (foreground code 30, background code 40).","Blue: #4 (foreground code 34, background code 44).","Bright black: #0 (foreground code 90, background code 100).","Bright blue: #4 (foreground code 94, background code 104).","Bright cyan: #6 (foreground code 96, background code 106).","Bright green: #2 (foreground code 92, background code 102).","Bright magenta: #5 (foreground code 95, background code 105…","Bright red: #1 (foreground code 91, background code 101).","Bright white: #7 (foreground code 97, background code 107).","Bright yellow: #3 (foreground code 93, background code 103…","","Any ANSI color code scheme","Cyan: #6 (foreground code 36, background code 46).","","","","","Enumerate each enabled value in Effects","A set of text effects","Green: #2 (foreground code 32, background code 42).","","Swap foreground and background colors; inconsistent …","Not widely supported. Sometimes treated as inverse or blink","Magenta: #5 (foreground code 35, background code 45).","Red: #1 (foreground code 31, background code 41).","Reset terminal formatting","24-bit ANSI RGB color codes","24-bit ANSI RGB color codes","Characters legible but marked as if for deletion. Not …","ANSI Text styling","Style extensions exist for Kitty, VTE, mintty and iTerm2.","White: #7 (foreground code 37, background code 47).","Yellow: #3 (foreground code 33, background code 43).","Blue","Set background color","","","","","Apply blink effect","Apply bold effect","","","","","","","","","","","","","","","","","Change the color to/from bright","Reset all effects in-place","","","","","","","","","","","","","","","","","","","","","","","","Returns true if all of the effects in other are contained …","","","","Apply dimmed effect","Set text effects","","","","","","","","","","Set foreground color","","","","","","","","","","","","","Returns the argument unchanged.","","","","Returns the argument unchanged.","","","Returns the argument unchanged.","Returns the argument unchanged.","","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","","Returns the argument unchanged.","Losslessly convert from AnsiColor","Green","Get the background color","","Get the foreground color","","","","","","","","","Apply hidden effect","Get the raw value","Inserts the specified effects in-place.","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Convert to AnsiColor when there is a 1:1 mapping","","Apply invert effect","Report whether the color is bright","Check if no effects are enabled","Check if no styling is enabled","Apply italic effect","Iterate over enabled effects","No effects enabled","No effects enabled","","Create a Style with this as the foreground","Create a Style with this as the foreground","Create a Style with this as the foreground","Create a Style with this as the foreground","Create a Style with this as the foreground","Create a Style with this as the foreground","Create a Style with this as the foreground","Create a Style with this as the foreground","","","","","","","","Red","Removes the specified effects in-place.","Render the ANSI code","Render the ANSI code","Render the ANSI code","Render the ANSI code for a background color","Render the ANSI code for a background color","Render the ANSI code for a background color","Render the ANSI code for a background color","Render the ANSI code for a foreground color","Render the ANSI code for a foreground color","Render the ANSI code for a foreground color","Render the ANSI code for a foreground color","Renders the relevant Reset code","Enable or disable the specified effects depending on the …","Apply strikethrough effect","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","Apply underline effect","Set underline color","Write the relevant Reset code","Write the ANSI code"],"i":[4,4,0,0,6,6,8,8,8,8,8,8,8,8,8,8,6,0,8,6,6,6,6,0,0,8,6,6,6,8,8,0,4,0,6,0,6,8,8,1,3,6,3,6,3,3,3,4,8,10,1,6,11,12,3,4,8,10,1,6,11,12,3,8,6,4,8,10,1,6,11,12,3,4,8,10,1,6,11,12,3,4,8,10,1,6,12,3,6,6,12,3,3,3,4,8,10,1,6,11,12,3,3,3,4,8,10,1,6,11,12,12,3,3,4,4,4,4,4,4,8,10,10,10,1,1,6,11,12,3,3,10,1,3,3,3,3,4,8,10,1,6,12,3,3,10,6,4,8,10,1,6,11,12,3,10,11,3,8,6,3,3,6,6,3,11,4,8,10,1,4,8,10,1,4,8,10,1,6,12,3,1,6,6,12,3,4,8,10,1,4,8,10,1,3,6,3,6,3,6,3,4,8,10,1,6,11,12,3,12,3,4,8,10,1,6,11,12,3,4,8,10,1,6,11,12,3,4,8,10,1,6,11,12,3,3,3,3,3],"f":"```````````````````````````````````````{bd}{{f{j{h}}}f}{{ll}l}{{fl}f}{{ll}n}{{fl}n}{ff}0{ce{}{}}000000000000000{{A`Ab}A`}{ll}{hh}{A`A`}{AdAd}{bb}4{AfAf}{AhAh}9{{ce}n{}{}}0000000{{hh}Aj}{{A`A`}Aj}{{AdAd}Aj}{{bb}Aj}{{ll}Aj}{{AhAh}Aj}{{ff}Aj}{{ll}Ab}{{}l}{{}Ah}{{}f}{ff}{{fl}f}{{hh}Ab}{{A`A`}Ab}{{AdAd}Ab}{{bb}Ab}9{{AfAf}Ab}{{AhAh}Ab}{{fl}Ab}{{ff}Ab}{{f{j{h}}}f}{{hAl}An}{{A`Al}An}{{AdAl}An}{{bAl}An}{{lAl}An}{{AfAl}An}{{AhAl}An}0{{fAl}An}0{dh}{A`h}{cc{}}{bh}{Adh}{{{B`{ddd}}}h}3{A`Ad}{dAd}55{{{B`{ddd}}}b}666{lf}73{bd}{f{{j{h}}}}{fl}11{{hc}nBb}{{A`c}nBb}{{Adc}nBb}{{bc}nBb}{{lc}nBb}{{Ahc}nBb}{{fc}nBb}{ff}{Add}{{ll}l}{ce{}{}}0000000{Ad{{j{A`}}}}14{A`Ab}{lAb}{fAb}7{lAf}{{}l}{{}f}{Af{{j{c}}}{}}{{hc}f{{Bd{h}}}}{{A`c}f{{Bd{h}}}}{{Adc}f{{Bd{h}}}}{{bc}f{{Bd{h}}}}{hf}{A`f}{Adf}{bf}{{hh}{{j{Aj}}}}{{A`A`}{{j{Aj}}}}{{AdAd}{{j{Aj}}}}{{bb}{{j{Aj}}}}{{ll}{{j{Aj}}}}{{AhAh}{{j{Aj}}}}{{ff}{{j{Aj}}}}{bd}{{ll}l}{l{{`{BfBh}}}}{Ah{{`{BfBh}}}}{f{{`{BfBh}}}}{h{{`{BfBh}}}}{A`{{`{BfBh}}}}{Ad{{`{BfBh}}}}{b{{`{BfBh}}}}32104{{llAb}l}{ff}9{{fl}f}{{ll}n}{{fl}n}{ce{}{}}0000000{cBj{}}0{c{{Bl{e}}}{}{}}000000000000000{cBn{}}00000007{{f{j{h}}}f}{{fC`}{{Cb{n}}}}0","c":[],"p":[[5,"RgbColor",0],[1,"u8"],[5,"Style",0],[6,"Color",0],[6,"Option",239],[5,"Effects",0],[1,"unit"],[6,"AnsiColor",0],[1,"bool"],[5,"Ansi256Color",0],[5,"EffectIter",0],[5,"Reset",0],[6,"Ordering",240],[5,"Formatter",241],[8,"Result",241],[1,"tuple"],[10,"Hasher",242],[10,"Into",243],[10,"Display",241],[10,"Copy",244],[5,"String",245],[6,"Result",246],[5,"TypeId",247],[10,"Write",248],[8,"Result",249]],"b":[[101,"impl-PartialEq%3CEffects%3E-for-Style"],[102,"impl-PartialEq-for-Style"],[110,"impl-Debug-for-Reset"],[111,"impl-Display-for-Reset"],[112,"impl-Debug-for-Style"],[113,"impl-Display-for-Style"],[114,"impl-From%3Cu8%3E-for-Color"],[115,"impl-From%3CAnsiColor%3E-for-Color"],[117,"impl-From%3CRgbColor%3E-for-Color"],[118,"impl-From%3CAnsi256Color%3E-for-Color"],[119,"impl-From%3C(u8,+u8,+u8)%3E-for-Color"],[121,"impl-From%3CAnsiColor%3E-for-Ansi256Color"],[122,"impl-From%3Cu8%3E-for-Ansi256Color"]]}],\ ["anstyle_parse",{"doc":"Parser for implementing virtual terminal emulators","t":"FKIFFFKFMNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNCNNNNNNNNNNNNNNNNNNNNGPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPGPPNNNNNNNNNNNNNNNNNNHNNNNNNNNNN","n":["AsciiParser","CharAccumulator","DefaultCharAccumulator","Params","ParamsIter","Parser","Perform","Utf8Parser","add","add","add","advance","borrow","borrow","borrow","borrow","borrow","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","clone","clone","clone","clone","clone_into","clone_into","clone_into","clone_into","csi_dispatch","default","default","default","default","eq","eq","eq","eq","esc_dispatch","execute","fmt","fmt","fmt","fmt","from","from","from","from","from","hook","into","into","into","into","into","into_iter","into_iter","is_empty","iter","len","new","next","osc_dispatch","print","put","size_hint","state","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","type_id","type_id","type_id","type_id","type_id","unhook","Action","Anywhere","BeginUtf8","Clear","Collect","CsiDispatch","CsiEntry","CsiIgnore","CsiIntermediate","CsiParam","DcsEntry","DcsIgnore","DcsIntermediate","DcsParam","DcsPassthrough","EscDispatch","Escape","EscapeIntermediate","Execute","Ground","Hook","Ignore","Nop","OscEnd","OscPut","OscStart","OscString","Param","Print","Put","SosPmApcString","State","Unhook","Utf8","borrow","borrow","borrow_mut","borrow_mut","clone","clone","clone_into","clone_into","default","default","eq","eq","fmt","fmt","from","from","into","into","state_change","to_owned","to_owned","try_from","try_from","try_from","try_from","try_into","try_into","type_id","type_id"],"q":[[0,"anstyle_parse"],[88,"anstyle_parse::state"],[151,"core::option"],[152,"core::clone"],[153,"core::default"],[154,"core::cmp"],[155,"core::fmt"],[156,"core::fmt"],[157,"core::any"]],"d":["Only allow parsing 7-bit ASCII","Build a char out of bytes","Most flexible CharAccumulator for Parser based on active …","","Immutable subparameter iterator.","Parser for raw VTE protocol which delegates actions to a …","Performs actions requested by the Parser","Allow parsing UTF-8","Build a char out of bytes","","","Advance the parser state","","","","","","","","","","","","","","","","","","","A final character has arrived for a CSI sequence","","","","","","","","","The final character of an escape sequence has arrived.","Execute a C0 or C1 control function.","","","","","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Invoked when a final character arrives in first part of …","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 no parameters present.","Returns an iterator over all parameters and subparameters.","Returns the number of parameters.","Create a new Parser","","Dispatch an operating system command.","Draw a character to the screen and update states.","Pass bytes as part of a device control string to the …","","ANSI escape code parsing state machine","","","","","","","","","","","","","","","","","","","","Called when a device control string is terminated.","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","Returns the argument unchanged.","Returns the argument unchanged.","Calls U::from(self).","Calls U::from(self).","Transition to next State","","","","","","","","","",""],"i":[0,0,0,0,0,0,0,0,1,5,6,7,19,10,7,5,6,19,10,7,5,6,10,7,5,6,10,7,5,6,9,10,7,5,6,10,7,5,6,9,9,10,7,5,6,19,10,7,5,6,9,19,10,7,5,6,19,10,10,10,10,7,19,9,9,9,19,0,10,7,5,6,19,10,7,5,6,19,10,7,5,6,19,10,7,5,6,9,0,24,25,25,25,25,24,24,24,24,24,24,24,24,24,25,24,24,25,24,25,25,25,25,25,25,24,25,25,25,24,0,25,24,24,25,24,25,24,25,24,25,24,25,24,25,24,25,24,25,24,25,0,24,25,24,24,25,25,24,25,24,25],"f":"````````{{bd}{{h{f}}}}{{jd}{{h{f}}}}{{ld}{{h{f}}}}{{{n{c}}ed}A`bAb}{ce{}{}}000000000{AdAd}{{{n{c}}}{{n{c}}}Af}{jj}{ll}{{ce}A`{}{}}000{{AbAd{Ah{d}}Ajd}A`}{{}Ad}{{}{{n{c}}}Al}{{}j}{{}l}{{AdAd}Aj}{{{n{c}}{n{c}}}AjAn}{{jj}Aj}{{ll}Aj}{{Ab{Ah{d}}Ajd}A`}{{Abd}A`}{{AdB`}Bb}{{{n{c}}B`}BbBd}{{jB`}Bb}{{lB`}Bb}{cc{}}0000?{ce{}{}}00000{Adc{}}{AdAj}{AdBf}{AdBh}{{}n}{Bf{{h{c}}}{}}{{Ab{Ah{{Ah{d}}}}Aj}A`}{{Abf}A`}>{Bf{{Bj{Bh{h{Bh}}}}}}`9999{c{{Bl{e}}}{}{}}000000000{cBn{}}0000{AbA`}``````````````````````````````````<<<<{C`C`}{CbCb}{{ce}A`{}{}}0{{}C`}{{}Cb}{{C`C`}Aj}{{CbCb}Aj}{{C`B`}Bb}{{CbB`}Bb}{cc{}}0{ce{}{}}0{{C`d}{{Bj{C`Cb}}}}11{d{{Bl{C`c}}}{}}?{d{{Bl{Cbc}}}{}}{c{{Bl{e}}}{}{}}00{cBn{}}0","c":[],"p":[[10,"CharAccumulator",0],[1,"u8"],[1,"char"],[6,"Option",151],[5,"AsciiParser",0],[5,"Utf8Parser",0],[5,"Parser",0],[1,"unit"],[10,"Perform",0],[5,"Params",0],[10,"Clone",152],[1,"slice"],[1,"bool"],[10,"Default",153],[10,"PartialEq",154],[5,"Formatter",155],[8,"Result",155],[10,"Debug",155],[5,"ParamsIter",0],[1,"usize"],[1,"tuple"],[6,"Result",156],[5,"TypeId",157],[6,"State",88],[6,"Action",88]],"b":[]}],\ ["anstyle_query",{"doc":"Low level terminal capability lookups","t":"HHHHHHHCH","n":["clicolor","clicolor_force","is_ci","no_color","term_supports_ansi_color","term_supports_color","truecolor","windows","enable_ansi_colors"],"q":[[0,"anstyle_query"],[8,"anstyle_query::windows"],[9,"core::option"]],"d":["Check CLICOLOR status","Check CLICOLOR_FORCE status","Report whether this is running in CI","Check NO_COLOR status","Check TERM for ANSI color support","Check TERM for color support","Check COLORTERM for truecolor support","Windows-specific style queries","Enable ANSI escape codes (…"],"i":[0,0,0,0,0,0,0,0,0],"f":"{{}{{d{b}}}}{{}b}00000`1","c":[],"p":[[1,"bool"],[6,"Option",9]],"b":[]}],\ -["anyhow",{"doc":"github crates-io docs-rs","t":"FKPFHPIQNNNQNNNNNNNMNNNNNNNNQNNENNNNNNNNNNNNNNNNNNNNNNNNM","n":["Chain","Context","Err","Error","Ok","Ok","Result","anyhow","as_ref","as_ref","backtrace","bail","borrow","borrow","borrow_mut","borrow_mut","chain","clone","clone_into","context","context","default","deref","deref_mut","downcast","downcast_mut","downcast_ref","drop","ensure","fmt","fmt","format_err","from","from","from","from","into","into","into_iter","is","len","msg","new","new","next","next_back","root_cause","size_hint","to_owned","to_string","try_from","try_from","try_into","try_into","type_id","type_id","with_context"],"q":[[0,"anyhow"],[57,"core::error"],[58,"std::backtrace"],[59,"core::fmt"],[60,"core::marker"],[61,"core::marker"],[62,"core::fmt"],[63,"core::fmt"],[64,"core::any"],[65,"core::ops::function"]],"d":["Iterator of a chain of source errors.","Provides the context method for Result.","Contains the error value","The Error type, a wrapper around a dynamic error type.","Equivalent to Ok::<_, anyhow::Error>(value).","Contains the success value","Result<T, Error>","Construct an ad-hoc error from a string or existing non-…","","","Get the backtrace for this Error.","Return early with an error.","","","","","An iterator of the chain of source errors contained by …","","","Wrap the error value with additional context.","Wrap the error value with additional context.","","","","Attempt to downcast the error object to a concrete type.","Downcast this error object by mutable reference.","Downcast this error object by reference.","","Return early with an error if a condition is not satisfied.","","","","Returns the argument unchanged.","","","Returns the argument unchanged.","Calls U::from(self).","Calls U::from(self).","","Returns true if E is the type held by this error object.","","Create a new error object from a printable error message.","Create a new error object from any error type.","","","","The lowest level cause of this error — this error’s …","","","","","","","","","","Wrap the error value with additional context that is …"],"i":[0,0,1,0,0,1,0,0,2,2,2,0,2,5,2,5,2,5,5,7,2,5,2,2,2,2,2,2,0,2,2,0,2,2,2,5,2,5,5,2,5,2,2,5,5,5,2,5,5,2,2,5,2,5,2,5,7],"f":"````{c{{b{c}}}{}}```{df}0{dh}`{ce{}{}}000{dj}{jj}{{ce}l{}{}}{{nc}{{b{ed}}}{A`AbAd}{}}{{dc}d{A`AbAd}}{{}j}{dc{}}0{d{{Af{cd}}}{A`AhAbAd}}{d{{Aj{c}}}{A`AhAbAd}}0{dl}`{{dAl}An}0`{cc{}}{B`c{}}{cd{fAbAd}}2>>>{dBb}{jBd}{cd{A`AhAbAd}}3{fj}{j{{Aj{c}}}{}}0{df}{j{{Bf{Bd{Aj{Bd}}}}}}{ce{}{}}{cBh{}}{c{{Af{e}}}{}{}}000{cBj{}}0{{ne}{{b{gd}}}{A`AbAd}{{Bn{}{{Bl{c}}}}}{}}","c":[],"p":[[8,"Result",0],[5,"Error",0],[10,"Error",57],[5,"Backtrace",58],[5,"Chain",0],[1,"unit"],[10,"Context",0],[10,"Display",59],[10,"Send",60],[10,"Sync",60],[6,"Result",61],[10,"Debug",59],[6,"Option",62],[5,"Formatter",59],[8,"Result",59],[1,"never"],[1,"bool"],[1,"usize"],[1,"tuple"],[5,"String",63],[5,"TypeId",64],[17,"Output"],[10,"FnOnce",65]],"b":[[8,"impl-AsRef%3Cdyn+Error%3E-for-Error"],[9,"impl-AsRef%3Cdyn+Error+%2B+Send+%2B+Sync%3E-for-Error"],[29,"impl-Debug-for-Error"],[30,"impl-Display-for-Error"]]}],\ +["anyhow",{"doc":"github crates-io docs-rs","t":"FKPFHPIQNNNQNNNNNNNMNNNNNNNNQNNENNNNNNNNNNNNNNNNNNNNNNNNM","n":["Chain","Context","Err","Error","Ok","Ok","Result","anyhow","as_ref","as_ref","backtrace","bail","borrow","borrow","borrow_mut","borrow_mut","chain","clone","clone_into","context","context","default","deref","deref_mut","downcast","downcast_mut","downcast_ref","drop","ensure","fmt","fmt","format_err","from","from","from","from","into","into","into_iter","is","len","msg","new","new","next","next_back","root_cause","size_hint","to_owned","to_string","try_from","try_from","try_into","try_into","type_id","type_id","with_context"],"q":[[0,"anyhow"],[57,"core::error"],[58,"std::backtrace"],[59,"core::fmt"],[60,"core::marker"],[61,"core::marker"],[62,"core::fmt"],[63,"core::fmt"],[64,"core::any"],[65,"core::ops::function"]],"d":["Iterator of a chain of source errors.","Provides the context method for Result.","Contains the error value","The Error type, a wrapper around a dynamic error type.","Equivalent to Ok::<_, anyhow::Error>(value).","Contains the success value","Result<T, Error>","Construct an ad-hoc error from a string or existing non-…","","","Get the backtrace for this Error.","Return early with an error.","","","","","An iterator of the chain of source errors contained by …","","","Wrap the error value with additional context.","Wrap the error value with additional context.","","","","Attempt to downcast the error object to a concrete type.","Downcast this error object by mutable reference.","Downcast this error object by reference.","","Return early with an error if a condition is not satisfied.","","","","","Returns the argument unchanged.","","Returns the argument unchanged.","Calls U::from(self).","Calls U::from(self).","","Returns true if E is the type held by this error object.","","Create a new error object from a printable error message.","Create a new error object from any error type.","","","","The lowest level cause of this error — this error’s …","","","","","","","","","","Wrap the error value with additional context that is …"],"i":[0,0,1,0,0,1,0,0,2,2,2,0,2,5,2,5,2,5,5,7,2,5,2,2,2,2,2,2,0,2,2,0,2,2,2,5,2,5,5,2,5,2,2,5,5,5,2,5,5,2,2,5,2,5,2,5,7],"f":"````{c{{b{c}}}{}}```{df}0{dh}`{ce{}{}}000{dj}{jj}{{ce}l{}{}}{{nc}{{b{ed}}}{A`AbAd}{}}{{dc}d{A`AbAd}}{{}j}{dc{}}0{d{{Af{cd}}}{A`AhAbAd}}{d{{Aj{c}}}{A`AhAbAd}}0{dl}`{{dAl}An}0`{cd{fAbAd}}{cc{}}{B`c{}}1>>>{dBb}{jBd}{cd{A`AhAbAd}}5{fj}{j{{Aj{c}}}{}}0{df}{j{{Bf{Bd{Aj{Bd}}}}}}{ce{}{}}{cBh{}}{c{{Af{e}}}{}{}}000{cBj{}}0{{ne}{{b{gd}}}{A`AbAd}{{Bn{}{{Bl{c}}}}}{}}","c":[],"p":[[8,"Result",0],[5,"Error",0],[10,"Error",57],[5,"Backtrace",58],[5,"Chain",0],[1,"unit"],[10,"Context",0],[10,"Display",59],[10,"Send",60],[10,"Sync",60],[6,"Result",61],[10,"Debug",59],[6,"Option",62],[5,"Formatter",59],[8,"Result",59],[1,"never"],[1,"bool"],[1,"usize"],[1,"tuple"],[5,"String",63],[5,"TypeId",64],[17,"Output"],[10,"FnOnce",65]],"b":[[8,"impl-AsRef%3Cdyn+Error%3E-for-Error"],[9,"impl-AsRef%3Cdyn+Error+%2B+Send+%2B+Sync%3E-for-Error"],[29,"impl-Debug-for-Error"],[30,"impl-Display-for-Error"]]}],\ ["ariadne",{"doc":"Ariadne","t":"PPPPPPPPPPPPPKPGGFFPPPPFPKFPGFGFPPPPFFGPFRKPKRPPPPNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNMNNNMNNNNNNNNNNMNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNMHNMNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNN","n":["Advice","Ascii","Black","Blue","BrightBlack","BrightBlue","BrightCyan","BrightGreen","BrightMagenta","BrightRed","BrightWhite","BrightYellow","Byte","Cache","Char","CharSet","Color","ColorGenerator","Config","Custom","Cyan","End","Error","FileCache","Fixed","Fmt","FnCache","Green","IndexType","Label","LabelAttach","Line","Magenta","Middle","Primary","Red","Report","ReportBuilder","ReportKind","Rgb","Source","SourceId","Span","Start","StdoutFmt","Storage","Unicode","Warning","White","Yellow","add_label","add_labels","attr","attr","attr","attr","attr","attr","attr","attr","attr","attr","attr","attr","attr","attr","attr","background","bg","bg","bg","bg","bg","bg","bg","bg","bg","bg","bg","bg","bg","bg","bg","bg","bg","bg","bg","black","black","black","black","black","black","black","black","black","black","black","black","black","black","blink","blink","blink","blink","blink","blink","blink","blink","blink","blink","blink","blink","blink","blink","blink","blue","blue","blue","blue","blue","blue","blue","blue","blue","blue","blue","blue","blue","blue","bold","bold","bold","bold","bold","bold","bold","bold","bold","bold","bold","bold","bold","bold","bold","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","bright","bright","bright","bright","bright","bright","bright","bright","bright","bright","bright","bright","bright","bright","bright","bright_black","bright_black","bright_black","bright_black","bright_black","bright_black","bright_black","bright_black","bright_black","bright_black","bright_black","bright_black","bright_black","bright_black","bright_blue","bright_blue","bright_blue","bright_blue","bright_blue","bright_blue","bright_blue","bright_blue","bright_blue","bright_blue","bright_blue","bright_blue","bright_blue","bright_blue","bright_cyan","bright_cyan","bright_cyan","bright_cyan","bright_cyan","bright_cyan","bright_cyan","bright_cyan","bright_cyan","bright_cyan","bright_cyan","bright_cyan","bright_cyan","bright_cyan","bright_green","bright_green","bright_green","bright_green","bright_green","bright_green","bright_green","bright_green","bright_green","bright_green","bright_green","bright_green","bright_green","bright_green","bright_magenta","bright_magenta","bright_magenta","bright_magenta","bright_magenta","bright_magenta","bright_magenta","bright_magenta","bright_magenta","bright_magenta","bright_magenta","bright_magenta","bright_magenta","bright_magenta","bright_red","bright_red","bright_red","bright_red","bright_red","bright_red","bright_red","bright_red","bright_red","bright_red","bright_red","bright_red","bright_red","bright_red","bright_white","bright_white","bright_white","bright_white","bright_white","bright_white","bright_white","bright_white","bright_white","bright_white","bright_white","bright_white","bright_white","bright_white","bright_yellow","bright_yellow","bright_yellow","bright_yellow","bright_yellow","bright_yellow","bright_yellow","bright_yellow","bright_yellow","bright_yellow","bright_yellow","bright_yellow","bright_yellow","bright_yellow","build","chars","clear","clear","clear","clear","clear","clear","clear","clear","clear","clear","clear","clear","clear","clear","clear","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","cmp","conceal","conceal","conceal","conceal","conceal","conceal","conceal","conceal","conceal","conceal","conceal","conceal","conceal","conceal","conceal","contains","cyan","cyan","cyan","cyan","cyan","cyan","cyan","cyan","cyan","cyan","cyan","cyan","cyan","cyan","default","default","default","default","dim","dim","dim","dim","dim","dim","dim","dim","dim","dim","dim","dim","dim","dim","dim","display","display","display","display","end","eprint","eq","eq","eq","eq","eq","eq","eq","eq","eq","fetch","fetch","fetch","fetch","fg","fg","fg","fg","fg","fg","fg","fg","fg","fg","fg","fg","fg","fg","fg","fg","fg","fg","finish","fixed","fixed","fixed","fixed","fixed","fixed","fixed","fixed","fixed","fixed","fixed","fixed","fixed","fixed","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","foreground","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from_state","get_byte_line","get_line_range","get_line_text","get_offset_line","green","green","green","green","green","green","green","green","green","green","green","green","green","green","hash","hash","hash","hash","into","into","into","into","into","into","into","into","into","into","into","into","into","into","invert","invert","invert","invert","invert","invert","invert","invert","invert","invert","invert","invert","invert","invert","invert","is_empty","is_empty","is_empty","italic","italic","italic","italic","italic","italic","italic","italic","italic","italic","italic","italic","italic","italic","italic","len","len","len","line","lines","linger","linger","linger","linger","linger","linger","linger","linger","linger","linger","linger","linger","linger","linger","linger","magenta","magenta","magenta","magenta","magenta","magenta","magenta","magenta","magenta","magenta","magenta","magenta","magenta","magenta","mask","mask","mask","mask","mask","mask","mask","mask","mask","mask","mask","mask","mask","mask","mask","new","new","new","next","offset","on_black","on_black","on_black","on_black","on_black","on_black","on_black","on_black","on_black","on_black","on_black","on_black","on_black","on_black","on_black","on_blue","on_blue","on_blue","on_blue","on_blue","on_blue","on_blue","on_blue","on_blue","on_blue","on_blue","on_blue","on_blue","on_blue","on_blue","on_bright","on_bright","on_bright","on_bright","on_bright","on_bright","on_bright","on_bright","on_bright","on_bright","on_bright","on_bright","on_bright","on_bright","on_bright","on_bright_black","on_bright_black","on_bright_black","on_bright_black","on_bright_black","on_bright_black","on_bright_black","on_bright_black","on_bright_black","on_bright_black","on_bright_black","on_bright_black","on_bright_black","on_bright_black","on_bright_black","on_bright_blue","on_bright_blue","on_bright_blue","on_bright_blue","on_bright_blue","on_bright_blue","on_bright_blue","on_bright_blue","on_bright_blue","on_bright_blue","on_bright_blue","on_bright_blue","on_bright_blue","on_bright_blue","on_bright_blue","on_bright_cyan","on_bright_cyan","on_bright_cyan","on_bright_cyan","on_bright_cyan","on_bright_cyan","on_bright_cyan","on_bright_cyan","on_bright_cyan","on_bright_cyan","on_bright_cyan","on_bright_cyan","on_bright_cyan","on_bright_cyan","on_bright_cyan","on_bright_green","on_bright_green","on_bright_green","on_bright_green","on_bright_green","on_bright_green","on_bright_green","on_bright_green","on_bright_green","on_bright_green","on_bright_green","on_bright_green","on_bright_green","on_bright_green","on_bright_green","on_bright_magenta","on_bright_magenta","on_bright_magenta","on_bright_magenta","on_bright_magenta","on_bright_magenta","on_bright_magenta","on_bright_magenta","on_bright_magenta","on_bright_magenta","on_bright_magenta","on_bright_magenta","on_bright_magenta","on_bright_magenta","on_bright_magenta","on_bright_red","on_bright_red","on_bright_red","on_bright_red","on_bright_red","on_bright_red","on_bright_red","on_bright_red","on_bright_red","on_bright_red","on_bright_red","on_bright_red","on_bright_red","on_bright_red","on_bright_red","on_bright_white","on_bright_white","on_bright_white","on_bright_white","on_bright_white","on_bright_white","on_bright_white","on_bright_white","on_bright_white","on_bright_white","on_bright_white","on_bright_white","on_bright_white","on_bright_white","on_bright_white","on_bright_yellow","on_bright_yellow","on_bright_yellow","on_bright_yellow","on_bright_yellow","on_bright_yellow","on_bright_yellow","on_bright_yellow","on_bright_yellow","on_bright_yellow","on_bright_yellow","on_bright_yellow","on_bright_yellow","on_bright_yellow","on_bright_yellow","on_cyan","on_cyan","on_cyan","on_cyan","on_cyan","on_cyan","on_cyan","on_cyan","on_cyan","on_cyan","on_cyan","on_cyan","on_cyan","on_cyan","on_cyan","on_fixed","on_fixed","on_fixed","on_fixed","on_fixed","on_fixed","on_fixed","on_fixed","on_fixed","on_fixed","on_fixed","on_fixed","on_fixed","on_fixed","on_fixed","on_green","on_green","on_green","on_green","on_green","on_green","on_green","on_green","on_green","on_green","on_green","on_green","on_green","on_green","on_green","on_magenta","on_magenta","on_magenta","on_magenta","on_magenta","on_magenta","on_magenta","on_magenta","on_magenta","on_magenta","on_magenta","on_magenta","on_magenta","on_magenta","on_magenta","on_primary","on_primary","on_primary","on_primary","on_primary","on_primary","on_primary","on_primary","on_primary","on_primary","on_primary","on_primary","on_primary","on_primary","on_primary","on_red","on_red","on_red","on_red","on_red","on_red","on_red","on_red","on_red","on_red","on_red","on_red","on_red","on_red","on_red","on_rgb","on_rgb","on_rgb","on_rgb","on_rgb","on_rgb","on_rgb","on_rgb","on_rgb","on_rgb","on_rgb","on_rgb","on_rgb","on_rgb","on_rgb","on_white","on_white","on_white","on_white","on_white","on_white","on_white","on_white","on_white","on_white","on_white","on_white","on_white","on_white","on_white","on_yellow","on_yellow","on_yellow","on_yellow","on_yellow","on_yellow","on_yellow","on_yellow","on_yellow","on_yellow","on_yellow","on_yellow","on_yellow","on_yellow","on_yellow","partial_cmp","primary","primary","primary","primary","primary","primary","primary","primary","primary","primary","primary","primary","primary","primary","print","quirk","quirk","quirk","quirk","quirk","quirk","quirk","quirk","quirk","quirk","quirk","quirk","quirk","quirk","quirk","rapid_blink","rapid_blink","rapid_blink","rapid_blink","rapid_blink","rapid_blink","rapid_blink","rapid_blink","rapid_blink","rapid_blink","rapid_blink","rapid_blink","rapid_blink","rapid_blink","rapid_blink","red","red","red","red","red","red","red","red","red","red","red","red","red","red","resetting","resetting","resetting","resetting","resetting","resetting","resetting","resetting","resetting","resetting","resetting","resetting","resetting","resetting","resetting","rgb","rgb","rgb","rgb","rgb","rgb","rgb","rgb","rgb","rgb","rgb","rgb","rgb","rgb","set_help","set_message","set_note","source","sources","span","start","strike","strike","strike","strike","strike","strike","strike","strike","strike","strike","strike","strike","strike","strike","strike","text","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_into","try_into","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","underline","underline","underline","underline","underline","underline","underline","underline","underline","underline","underline","underline","underline","underline","underline","whenever","whenever","whenever","whenever","whenever","whenever","whenever","whenever","whenever","whenever","whenever","whenever","whenever","whenever","whenever","white","white","white","white","white","white","white","white","white","white","white","white","white","white","with_char_set","with_code","with_color","with_color","with_compact","with_config","with_cross_gap","with_help","with_index_type","with_label","with_label_attach","with_labels","with_message","with_message","with_multiline_arrows","with_note","with_order","with_priority","with_sources","with_tab_width","with_underlines","wrap","wrap","wrap","wrap","wrap","wrap","wrap","wrap","wrap","wrap","wrap","wrap","wrap","wrap","wrap","write","write_for_stdout","yellow","yellow","yellow","yellow","yellow","yellow","yellow","yellow","yellow","yellow","yellow","yellow","yellow","yellow"],"q":[[0,"ariadne"],[1157,"core::iter::traits::collect"],[1158,"yansi::attr_quirk"],[1159,"yansi::paint"],[1160,"yansi::style"],[1161,"core::option"],[1162,"core::convert"],[1163,"core::iter::traits::iterator"],[1164,"core::convert"],[1165,"core::cmp"],[1166,"core::cmp"],[1167,"core::marker"],[1168,"core::fmt"],[1169,"alloc::boxed"],[1170,"std::path"],[1171,"core::hash"],[1172,"core::cmp"],[1173,"core::ops::function"],[1174,"std::io::error"],[1175,"core::fmt"],[1176,"core::hash"],[1177,"yansi::attr_quirk"],[1178,"alloc::string"],[1179,"yansi::condition"],[1180,"std::collections::hash::map"],[1181,"std::io"]],"d":["The report is advice to the user about a potential …","ASCII-only characters.","Black #0 (foreground code 30, background code 40).","Blue: #4 (foreground code 34, background code 44).","Bright Black #0 (foreground code 90, background code 100).","Bright Blue: #4 (foreground code 94, background code 104).","Bright Cyan: #6 (foreground code 96, background code 106).","Bright Green: #2 (foreground code 92, background code 102).","Bright Magenta: #5 (foreground code 95, background code 105…","Bright Red #1 (foreground code 91, background code 101).","Bright White: #7 (foreground code 97, background code 107).","Bright Yellow: #3 (foreground code 93, background code 103…","Byte spans. Always results in O(1) loopups","A trait implemented by Source caches.","Char based spans. May incur O(n) lookups","Possible character sets to use when rendering diagnostics.","Enum representing a terminal color.","A type that can generate distinct 8-bit colors.","A type used to configure a report","The report is of a kind not built into Ariadne.","Cyan: #6 (foreground code 36, background code 46).","Arrows should attach to the end of the label span.","The report is an error and indicates a critical problem …","A Cache that fetches Sources from the filesystem.","A color from 0 to 255, for use in 256-color terminals.","A trait used to add formatting attributes to displayable …","A Cache that fetches Sources using the provided function.","Green: #2 (foreground code 32, background code 42).","Possible character sets to use when rendering diagnostics.","A type that represents a labelled section of source code.","The attachment point of inline label arrows","A type representing a single line of a Source.","Magenta: #5 (foreground code 35, background code 45).","Arrows should attach to the middle of the label span (or …","Terminal primary color #9. (foreground code 39, background …","Red #1 (foreground code 31, background code 41).","A type representing a diagnostic that is ready to be …","A type used to build a Report.","A type that defines the kind of report being produced.","A 24-bit R G B “true color”, as specified by …","A type representing a single source that may be referred …","The identifier used to uniquely refer to a source. In most …","A trait implemented by spans within a character-based …","Arrows should attach to the start of the label span.","A trait used to add formatting attributes to displayable …","The type used to store the string data for this cache.","Unicode characters (an attempt is made to use only …","The report is a warning and indicates a likely problem, …","White: #7 (foreground code 37, background code 47).","Yellow: #3 (foreground code 33, background code 43).","Add a label to the report.","Add multiple labels to the report.","Enables the styling Attribute value.","Enables the styling Attribute value.","Enables the styling Attribute value.","Enables the styling Attribute value.","Enables the styling Attribute value.","Enables the styling Attribute value.","Enables the styling Attribute value.","Enables the styling Attribute value.","Enables the styling Attribute value.","Enables the styling Attribute value.","Enables the styling Attribute value.","Enables the styling Attribute value.","Enables the styling Attribute value.","Enables the styling Attribute value.","Enables the styling Attribute value.","Returns a Style with a background color of self.","Give this value the specified background colour.","Give this value the specified background colour.","Give this value the specified background colour, when …","Give this value the specified background colour, when …","Returns a styled value derived from self with the …","Returns a styled value derived from self with the …","Returns a styled value derived from self with the …","Returns a styled value derived from self with the …","Returns a styled value derived from self with the …","Returns a styled value derived from self with the …","Returns a styled value derived from self with the …","Returns a styled value derived from self with the …","Returns a styled value derived from self with the …","Returns a styled value derived from self with the …","Returns a styled value derived from self with the …","Returns a styled value derived from self with the …","Returns a styled value derived from self with the …","Returns a styled value derived from self with the …","Returns a styled value derived from self with the …","Returns self with the fg() set to Color::Black.","Returns self with the fg() set to Color::Black.","Returns self with the fg() set to Color::Black.","Returns self with the fg() set to Color::Black.","Returns self with the fg() set to Color::Black.","Returns self with the fg() set to Color::Black.","Returns self with the fg() set to Color::Black.","Returns self with the fg() set to Color::Black.","Returns self with the fg() set to Color::Black.","Returns self with the fg() set to Color::Black.","Returns self with the fg() set to Color::Black.","Returns self with the fg() set to Color::Black.","Returns self with the fg() set to Color::Black.","Returns self with the fg() set to Color::Black.","Returns self with the attr() set to Attribute::Blink.","Returns self with the attr() set to Attribute::Blink.","Returns self with the attr() set to Attribute::Blink.","Returns self with the attr() set to Attribute::Blink.","Returns self with the attr() set to Attribute::Blink.","Returns self with the attr() set to Attribute::Blink.","Returns self with the attr() set to Attribute::Blink.","Returns self with the attr() set to Attribute::Blink.","Returns self with the attr() set to Attribute::Blink.","Returns self with the attr() set to Attribute::Blink.","Returns self with the attr() set to Attribute::Blink.","Returns self with the attr() set to Attribute::Blink.","Returns self with the attr() set to Attribute::Blink.","Returns self with the attr() set to Attribute::Blink.","Returns self with the attr() set to Attribute::Blink.","Returns self with the fg() set to Color::Blue.","Returns self with the fg() set to Color::Blue.","Returns self with the fg() set to Color::Blue.","Returns self with the fg() set to Color::Blue.","Returns self with the fg() set to Color::Blue.","Returns self with the fg() set to Color::Blue.","Returns self with the fg() set to Color::Blue.","Returns self with the fg() set to Color::Blue.","Returns self with the fg() set to Color::Blue.","Returns self with the fg() set to Color::Blue.","Returns self with the fg() set to Color::Blue.","Returns self with the fg() set to Color::Blue.","Returns self with the fg() set to Color::Blue.","Returns self with the fg() set to Color::Blue.","Returns self with the attr() set to Attribute::Bold.","Returns self with the attr() set to Attribute::Bold.","Returns self with the attr() set to Attribute::Bold.","Returns self with the attr() set to Attribute::Bold.","Returns self with the attr() set to Attribute::Bold.","Returns self with the attr() set to Attribute::Bold.","Returns self with the attr() set to Attribute::Bold.","Returns self with the attr() set to Attribute::Bold.","Returns self with the attr() set to Attribute::Bold.","Returns self with the attr() set to Attribute::Bold.","Returns self with the attr() set to Attribute::Bold.","Returns self with the attr() set to Attribute::Bold.","Returns self with the attr() set to Attribute::Bold.","Returns self with the attr() set to Attribute::Bold.","Returns self with the attr() set to Attribute::Bold.","","","","","","","","","","","","","","","","","","","","","","","","","","","","","Returns self with the quirk() set to Quirk::Bright.","Returns self with the quirk() set to Quirk::Bright.","Returns self with the quirk() set to Quirk::Bright.","Returns self with the quirk() set to Quirk::Bright.","Returns self with the quirk() set to Quirk::Bright.","Returns self with the quirk() set to Quirk::Bright.","Returns self with the quirk() set to Quirk::Bright.","Returns self with the quirk() set to Quirk::Bright.","Returns self with the quirk() set to Quirk::Bright.","Returns self with the quirk() set to Quirk::Bright.","Returns self with the quirk() set to Quirk::Bright.","Returns self with the quirk() set to Quirk::Bright.","Returns self with the quirk() set to Quirk::Bright.","Returns self with the quirk() set to Quirk::Bright.","Returns self with the quirk() set to Quirk::Bright.","Returns self with the fg() set to Color::BrightBlack.","Returns self with the fg() set to Color::BrightBlack.","Returns self with the fg() set to Color::BrightBlack.","Returns self with the fg() set to Color::BrightBlack.","Returns self with the fg() set to Color::BrightBlack.","Returns self with the fg() set to Color::BrightBlack.","Returns self with the fg() set to Color::BrightBlack.","Returns self with the fg() set to Color::BrightBlack.","Returns self with the fg() set to Color::BrightBlack.","Returns self with the fg() set to Color::BrightBlack.","Returns self with the fg() set to Color::BrightBlack.","Returns self with the fg() set to Color::BrightBlack.","Returns self with the fg() set to Color::BrightBlack.","Returns self with the fg() set to Color::BrightBlack.","Returns self with the fg() set to Color::BrightBlue.","Returns self with the fg() set to Color::BrightBlue.","Returns self with the fg() set to Color::BrightBlue.","Returns self with the fg() set to Color::BrightBlue.","Returns self with the fg() set to Color::BrightBlue.","Returns self with the fg() set to Color::BrightBlue.","Returns self with the fg() set to Color::BrightBlue.","Returns self with the fg() set to Color::BrightBlue.","Returns self with the fg() set to Color::BrightBlue.","Returns self with the fg() set to Color::BrightBlue.","Returns self with the fg() set to Color::BrightBlue.","Returns self with the fg() set to Color::BrightBlue.","Returns self with the fg() set to Color::BrightBlue.","Returns self with the fg() set to Color::BrightBlue.","Returns self with the fg() set to Color::BrightCyan.","Returns self with the fg() set to Color::BrightCyan.","Returns self with the fg() set to Color::BrightCyan.","Returns self with the fg() set to Color::BrightCyan.","Returns self with the fg() set to Color::BrightCyan.","Returns self with the fg() set to Color::BrightCyan.","Returns self with the fg() set to Color::BrightCyan.","Returns self with the fg() set to Color::BrightCyan.","Returns self with the fg() set to Color::BrightCyan.","Returns self with the fg() set to Color::BrightCyan.","Returns self with the fg() set to Color::BrightCyan.","Returns self with the fg() set to Color::BrightCyan.","Returns self with the fg() set to Color::BrightCyan.","Returns self with the fg() set to Color::BrightCyan.","Returns self with the fg() set to Color::BrightGreen.","Returns self with the fg() set to Color::BrightGreen.","Returns self with the fg() set to Color::BrightGreen.","Returns self with the fg() set to Color::BrightGreen.","Returns self with the fg() set to Color::BrightGreen.","Returns self with the fg() set to Color::BrightGreen.","Returns self with the fg() set to Color::BrightGreen.","Returns self with the fg() set to Color::BrightGreen.","Returns self with the fg() set to Color::BrightGreen.","Returns self with the fg() set to Color::BrightGreen.","Returns self with the fg() set to Color::BrightGreen.","Returns self with the fg() set to Color::BrightGreen.","Returns self with the fg() set to Color::BrightGreen.","Returns self with the fg() set to Color::BrightGreen.","Returns self with the fg() set to Color::BrightMagenta.","Returns self with the fg() set to Color::BrightMagenta.","Returns self with the fg() set to Color::BrightMagenta.","Returns self with the fg() set to Color::BrightMagenta.","Returns self with the fg() set to Color::BrightMagenta.","Returns self with the fg() set to Color::BrightMagenta.","Returns self with the fg() set to Color::BrightMagenta.","Returns self with the fg() set to Color::BrightMagenta.","Returns self with the fg() set to Color::BrightMagenta.","Returns self with the fg() set to Color::BrightMagenta.","Returns self with the fg() set to Color::BrightMagenta.","Returns self with the fg() set to Color::BrightMagenta.","Returns self with the fg() set to Color::BrightMagenta.","Returns self with the fg() set to Color::BrightMagenta.","Returns self with the fg() set to Color::BrightRed.","Returns self with the fg() set to Color::BrightRed.","Returns self with the fg() set to Color::BrightRed.","Returns self with the fg() set to Color::BrightRed.","Returns self with the fg() set to Color::BrightRed.","Returns self with the fg() set to Color::BrightRed.","Returns self with the fg() set to Color::BrightRed.","Returns self with the fg() set to Color::BrightRed.","Returns self with the fg() set to Color::BrightRed.","Returns self with the fg() set to Color::BrightRed.","Returns self with the fg() set to Color::BrightRed.","Returns self with the fg() set to Color::BrightRed.","Returns self with the fg() set to Color::BrightRed.","Returns self with the fg() set to Color::BrightRed.","Returns self with the fg() set to Color::BrightWhite.","Returns self with the fg() set to Color::BrightWhite.","Returns self with the fg() set to Color::BrightWhite.","Returns self with the fg() set to Color::BrightWhite.","Returns self with the fg() set to Color::BrightWhite.","Returns self with the fg() set to Color::BrightWhite.","Returns self with the fg() set to Color::BrightWhite.","Returns self with the fg() set to Color::BrightWhite.","Returns self with the fg() set to Color::BrightWhite.","Returns self with the fg() set to Color::BrightWhite.","Returns self with the fg() set to Color::BrightWhite.","Returns self with the fg() set to Color::BrightWhite.","Returns self with the fg() set to Color::BrightWhite.","Returns self with the fg() set to Color::BrightWhite.","Returns self with the fg() set to Color::BrightYellow.","Returns self with the fg() set to Color::BrightYellow.","Returns self with the fg() set to Color::BrightYellow.","Returns self with the fg() set to Color::BrightYellow.","Returns self with the fg() set to Color::BrightYellow.","Returns self with the fg() set to Color::BrightYellow.","Returns self with the fg() set to Color::BrightYellow.","Returns self with the fg() set to Color::BrightYellow.","Returns self with the fg() set to Color::BrightYellow.","Returns self with the fg() set to Color::BrightYellow.","Returns self with the fg() set to Color::BrightYellow.","Returns self with the fg() set to Color::BrightYellow.","Returns self with the fg() set to Color::BrightYellow.","Returns self with the fg() set to Color::BrightYellow.","Begin building a new Report.","Return an iterator over the characters in the source.","Returns self with the quirk() set to Quirk::Clear.","Returns self with the quirk() set to Quirk::Clear.","Returns self with the quirk() set to Quirk::Clear.","Returns self with the quirk() set to Quirk::Clear.","Returns self with the quirk() set to Quirk::Clear.","Returns self with the quirk() set to Quirk::Clear.","Returns self with the quirk() set to Quirk::Clear.","Returns self with the quirk() set to Quirk::Clear.","Returns self with the quirk() set to Quirk::Clear.","Returns self with the quirk() set to Quirk::Clear.","Returns self with the quirk() set to Quirk::Clear.","Returns self with the quirk() set to Quirk::Clear.","Returns self with the quirk() set to Quirk::Clear.","Returns self with the quirk() set to Quirk::Clear.","Returns self with the quirk() set to Quirk::Clear.","","","","","","","","","","","","","","","","","","","","","","","","Returns self with the attr() set to Attribute::Conceal.","Returns self with the attr() set to Attribute::Conceal.","Returns self with the attr() set to Attribute::Conceal.","Returns self with the attr() set to Attribute::Conceal.","Returns self with the attr() set to Attribute::Conceal.","Returns self with the attr() set to Attribute::Conceal.","Returns self with the attr() set to Attribute::Conceal.","Returns self with the attr() set to Attribute::Conceal.","Returns self with the attr() set to Attribute::Conceal.","Returns self with the attr() set to Attribute::Conceal.","Returns self with the attr() set to Attribute::Conceal.","Returns self with the attr() set to Attribute::Conceal.","Returns self with the attr() set to Attribute::Conceal.","Returns self with the attr() set to Attribute::Conceal.","Returns self with the attr() set to Attribute::Conceal.","Determine whether the span contains the given offset.","Returns self with the fg() set to Color::Cyan.","Returns self with the fg() set to Color::Cyan.","Returns self with the fg() set to Color::Cyan.","Returns self with the fg() set to Color::Cyan.","Returns self with the fg() set to Color::Cyan.","Returns self with the fg() set to Color::Cyan.","Returns self with the fg() set to Color::Cyan.","Returns self with the fg() set to Color::Cyan.","Returns self with the fg() set to Color::Cyan.","Returns self with the fg() set to Color::Cyan.","Returns self with the fg() set to Color::Cyan.","Returns self with the fg() set to Color::Cyan.","Returns self with the fg() set to Color::Cyan.","Returns self with the fg() set to Color::Cyan.","","","","","Returns self with the attr() set to Attribute::Dim.","Returns self with the attr() set to Attribute::Dim.","Returns self with the attr() set to Attribute::Dim.","Returns self with the attr() set to Attribute::Dim.","Returns self with the attr() set to Attribute::Dim.","Returns self with the attr() set to Attribute::Dim.","Returns self with the attr() set to Attribute::Dim.","Returns self with the attr() set to Attribute::Dim.","Returns self with the attr() set to Attribute::Dim.","Returns self with the attr() set to Attribute::Dim.","Returns self with the attr() set to Attribute::Dim.","Returns self with the attr() set to Attribute::Dim.","Returns self with the attr() set to Attribute::Dim.","Returns self with the attr() set to Attribute::Dim.","Returns self with the attr() set to Attribute::Dim.","Display the given ID. as a single inline value.","","","","Get the (exclusive) end offset of this span.","Write this diagnostic out to stderr.","","","","","","","","","","Fetch the Source identified by the given ID, if possible.","","","","Give this value the specified foreground colour.","Give this value the specified foreground colour.","Give this value the specified foreground colour, when …","Give this value the specified foreground colour, when …","Returns a styled value derived from self with the …","Returns a styled value derived from self with the …","Returns a styled value derived from self with the …","Returns a styled value derived from self with the …","Returns a styled value derived from self with the …","Returns a styled value derived from self with the …","Returns a styled value derived from self with the …","Returns a styled value derived from self with the …","Returns a styled value derived from self with the …","Returns a styled value derived from self with the …","Returns a styled value derived from self with the …","Returns a styled value derived from self with the …","Returns a styled value derived from self with the …","Returns a styled value derived from self with the …","Finish building the Report.","Returns self with the fg() set to Color::Fixed.","Returns self with the fg() set to Color::Fixed.","Returns self with the fg() set to Color::Fixed.","Returns self with the fg() set to Color::Fixed.","Returns self with the fg() set to Color::Fixed.","Returns self with the fg() set to Color::Fixed.","Returns self with the fg() set to Color::Fixed.","Returns self with the fg() set to Color::Fixed.","Returns self with the fg() set to Color::Fixed.","Returns self with the fg() set to Color::Fixed.","Returns self with the fg() set to Color::Fixed.","Returns self with the fg() set to Color::Fixed.","Returns self with the fg() set to Color::Fixed.","Returns self with the fg() set to Color::Fixed.","","","","","","","","","","","","","","","Returns a Style with a foreground color of self.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Generate a Source from the given str.","Returns the argument unchanged.","Returns the argument unchanged.","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 ColorGenerator with the given pre-chosen …","Get the line that the given byte offset appears on, and …","Get the range of lines that this span runs across.","Get the source text for a line, includes trailing …","Get the line that the given offset appears on, and the …","Returns self with the fg() set to Color::Green.","Returns self with the fg() set to Color::Green.","Returns self with the fg() set to Color::Green.","Returns self with the fg() set to Color::Green.","Returns self with the fg() set to Color::Green.","Returns self with the fg() set to Color::Green.","Returns self with the fg() set to Color::Green.","Returns self with the fg() set to Color::Green.","Returns self with the fg() set to Color::Green.","Returns self with the fg() set to Color::Green.","Returns self with the fg() set to Color::Green.","Returns self with the fg() set to Color::Green.","Returns self with the fg() set to Color::Green.","Returns self with the fg() set to Color::Green.","","","","","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","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 self with the attr() set to Attribute::Invert.","Returns self with the attr() set to Attribute::Invert.","Returns self with the attr() set to Attribute::Invert.","Returns self with the attr() set to Attribute::Invert.","Returns self with the attr() set to Attribute::Invert.","Returns self with the attr() set to Attribute::Invert.","Returns self with the attr() set to Attribute::Invert.","Returns self with the attr() set to Attribute::Invert.","Returns self with the attr() set to Attribute::Invert.","Returns self with the attr() set to Attribute::Invert.","Returns self with the attr() set to Attribute::Invert.","Returns self with the attr() set to Attribute::Invert.","Returns self with the attr() set to Attribute::Invert.","Returns self with the attr() set to Attribute::Invert.","Returns self with the attr() set to Attribute::Invert.","Returns true if this span has length zero.","Returns true if this line contains no characters.","Returns true if this source contains no characters.","Returns self with the attr() set to Attribute::Italic.","Returns self with the attr() set to Attribute::Italic.","Returns self with the attr() set to Attribute::Italic.","Returns self with the attr() set to Attribute::Italic.","Returns self with the attr() set to Attribute::Italic.","Returns self with the attr() set to Attribute::Italic.","Returns self with the attr() set to Attribute::Italic.","Returns self with the attr() set to Attribute::Italic.","Returns self with the attr() set to Attribute::Italic.","Returns self with the attr() set to Attribute::Italic.","Returns self with the attr() set to Attribute::Italic.","Returns self with the attr() set to Attribute::Italic.","Returns self with the attr() set to Attribute::Italic.","Returns self with the attr() set to Attribute::Italic.","Returns self with the attr() set to Attribute::Italic.","Get the length of this span (difference between the start …","Get the character length of this line.","Get the length of the total number of characters in the …","Get access to a specific, zero-indexed Line.","Return an iterator over the Lines in this source.","Returns self with the quirk() set to Quirk::Linger.","Returns self with the quirk() set to Quirk::Linger.","Returns self with the quirk() set to Quirk::Linger.","Returns self with the quirk() set to Quirk::Linger.","Returns self with the quirk() set to Quirk::Linger.","Returns self with the quirk() set to Quirk::Linger.","Returns self with the quirk() set to Quirk::Linger.","Returns self with the quirk() set to Quirk::Linger.","Returns self with the quirk() set to Quirk::Linger.","Returns self with the quirk() set to Quirk::Linger.","Returns self with the quirk() set to Quirk::Linger.","Returns self with the quirk() set to Quirk::Linger.","Returns self with the quirk() set to Quirk::Linger.","Returns self with the quirk() set to Quirk::Linger.","Returns self with the quirk() set to Quirk::Linger.","Returns self with the fg() set to Color::Magenta.","Returns self with the fg() set to Color::Magenta.","Returns self with the fg() set to Color::Magenta.","Returns self with the fg() set to Color::Magenta.","Returns self with the fg() set to Color::Magenta.","Returns self with the fg() set to Color::Magenta.","Returns self with the fg() set to Color::Magenta.","Returns self with the fg() set to Color::Magenta.","Returns self with the fg() set to Color::Magenta.","Returns self with the fg() set to Color::Magenta.","Returns self with the fg() set to Color::Magenta.","Returns self with the fg() set to Color::Magenta.","Returns self with the fg() set to Color::Magenta.","Returns self with the fg() set to Color::Magenta.","Returns self with the quirk() set to Quirk::Mask.","Returns self with the quirk() set to Quirk::Mask.","Returns self with the quirk() set to Quirk::Mask.","Returns self with the quirk() set to Quirk::Mask.","Returns self with the quirk() set to Quirk::Mask.","Returns self with the quirk() set to Quirk::Mask.","Returns self with the quirk() set to Quirk::Mask.","Returns self with the quirk() set to Quirk::Mask.","Returns self with the quirk() set to Quirk::Mask.","Returns self with the quirk() set to Quirk::Mask.","Returns self with the quirk() set to Quirk::Mask.","Returns self with the quirk() set to Quirk::Mask.","Returns self with the quirk() set to Quirk::Mask.","Returns self with the quirk() set to Quirk::Mask.","Returns self with the quirk() set to Quirk::Mask.","Create a new ColorGenerator with the default state.","Create a new FnCache with the given fetch function.","Create a new Label. If the span is specified as a …","Generate the next colour in the sequence.","Get the offset of this line in the original Source (i.e: …","Returns self with the bg() set to Color::Black.","Returns self with the bg() set to Color::Black.","Returns self with the bg() set to Color::Black.","Returns self with the bg() set to Color::Black.","Returns self with the bg() set to Color::Black.","Returns self with the bg() set to Color::Black.","Returns self with the bg() set to Color::Black.","Returns self with the bg() set to Color::Black.","Returns self with the bg() set to Color::Black.","Returns self with the bg() set to Color::Black.","Returns self with the bg() set to Color::Black.","Returns self with the bg() set to Color::Black.","Returns self with the bg() set to Color::Black.","Returns self with the bg() set to Color::Black.","Returns self with the bg() set to Color::Black.","Returns self with the bg() set to Color::Blue.","Returns self with the bg() set to Color::Blue.","Returns self with the bg() set to Color::Blue.","Returns self with the bg() set to Color::Blue.","Returns self with the bg() set to Color::Blue.","Returns self with the bg() set to Color::Blue.","Returns self with the bg() set to Color::Blue.","Returns self with the bg() set to Color::Blue.","Returns self with the bg() set to Color::Blue.","Returns self with the bg() set to Color::Blue.","Returns self with the bg() set to Color::Blue.","Returns self with the bg() set to Color::Blue.","Returns self with the bg() set to Color::Blue.","Returns self with the bg() set to Color::Blue.","Returns self with the bg() set to Color::Blue.","Returns self with the quirk() set to Quirk::OnBright.","Returns self with the quirk() set to Quirk::OnBright.","Returns self with the quirk() set to Quirk::OnBright.","Returns self with the quirk() set to Quirk::OnBright.","Returns self with the quirk() set to Quirk::OnBright.","Returns self with the quirk() set to Quirk::OnBright.","Returns self with the quirk() set to Quirk::OnBright.","Returns self with the quirk() set to Quirk::OnBright.","Returns self with the quirk() set to Quirk::OnBright.","Returns self with the quirk() set to Quirk::OnBright.","Returns self with the quirk() set to Quirk::OnBright.","Returns self with the quirk() set to Quirk::OnBright.","Returns self with the quirk() set to Quirk::OnBright.","Returns self with the quirk() set to Quirk::OnBright.","Returns self with the quirk() set to Quirk::OnBright.","Returns self with the bg() set to Color::BrightBlack.","Returns self with the bg() set to Color::BrightBlack.","Returns self with the bg() set to Color::BrightBlack.","Returns self with the bg() set to Color::BrightBlack.","Returns self with the bg() set to Color::BrightBlack.","Returns self with the bg() set to Color::BrightBlack.","Returns self with the bg() set to Color::BrightBlack.","Returns self with the bg() set to Color::BrightBlack.","Returns self with the bg() set to Color::BrightBlack.","Returns self with the bg() set to Color::BrightBlack.","Returns self with the bg() set to Color::BrightBlack.","Returns self with the bg() set to Color::BrightBlack.","Returns self with the bg() set to Color::BrightBlack.","Returns self with the bg() set to Color::BrightBlack.","Returns self with the bg() set to Color::BrightBlack.","Returns self with the bg() set to Color::BrightBlue.","Returns self with the bg() set to Color::BrightBlue.","Returns self with the bg() set to Color::BrightBlue.","Returns self with the bg() set to Color::BrightBlue.","Returns self with the bg() set to Color::BrightBlue.","Returns self with the bg() set to Color::BrightBlue.","Returns self with the bg() set to Color::BrightBlue.","Returns self with the bg() set to Color::BrightBlue.","Returns self with the bg() set to Color::BrightBlue.","Returns self with the bg() set to Color::BrightBlue.","Returns self with the bg() set to Color::BrightBlue.","Returns self with the bg() set to Color::BrightBlue.","Returns self with the bg() set to Color::BrightBlue.","Returns self with the bg() set to Color::BrightBlue.","Returns self with the bg() set to Color::BrightBlue.","Returns self with the bg() set to Color::BrightCyan.","Returns self with the bg() set to Color::BrightCyan.","Returns self with the bg() set to Color::BrightCyan.","Returns self with the bg() set to Color::BrightCyan.","Returns self with the bg() set to Color::BrightCyan.","Returns self with the bg() set to Color::BrightCyan.","Returns self with the bg() set to Color::BrightCyan.","Returns self with the bg() set to Color::BrightCyan.","Returns self with the bg() set to Color::BrightCyan.","Returns self with the bg() set to Color::BrightCyan.","Returns self with the bg() set to Color::BrightCyan.","Returns self with the bg() set to Color::BrightCyan.","Returns self with the bg() set to Color::BrightCyan.","Returns self with the bg() set to Color::BrightCyan.","Returns self with the bg() set to Color::BrightCyan.","Returns self with the bg() set to Color::BrightGreen.","Returns self with the bg() set to Color::BrightGreen.","Returns self with the bg() set to Color::BrightGreen.","Returns self with the bg() set to Color::BrightGreen.","Returns self with the bg() set to Color::BrightGreen.","Returns self with the bg() set to Color::BrightGreen.","Returns self with the bg() set to Color::BrightGreen.","Returns self with the bg() set to Color::BrightGreen.","Returns self with the bg() set to Color::BrightGreen.","Returns self with the bg() set to Color::BrightGreen.","Returns self with the bg() set to Color::BrightGreen.","Returns self with the bg() set to Color::BrightGreen.","Returns self with the bg() set to Color::BrightGreen.","Returns self with the bg() set to Color::BrightGreen.","Returns self with the bg() set to Color::BrightGreen.","Returns self with the bg() set to Color::BrightMagenta.","Returns self with the bg() set to Color::BrightMagenta.","Returns self with the bg() set to Color::BrightMagenta.","Returns self with the bg() set to Color::BrightMagenta.","Returns self with the bg() set to Color::BrightMagenta.","Returns self with the bg() set to Color::BrightMagenta.","Returns self with the bg() set to Color::BrightMagenta.","Returns self with the bg() set to Color::BrightMagenta.","Returns self with the bg() set to Color::BrightMagenta.","Returns self with the bg() set to Color::BrightMagenta.","Returns self with the bg() set to Color::BrightMagenta.","Returns self with the bg() set to Color::BrightMagenta.","Returns self with the bg() set to Color::BrightMagenta.","Returns self with the bg() set to Color::BrightMagenta.","Returns self with the bg() set to Color::BrightMagenta.","Returns self with the bg() set to Color::BrightRed.","Returns self with the bg() set to Color::BrightRed.","Returns self with the bg() set to Color::BrightRed.","Returns self with the bg() set to Color::BrightRed.","Returns self with the bg() set to Color::BrightRed.","Returns self with the bg() set to Color::BrightRed.","Returns self with the bg() set to Color::BrightRed.","Returns self with the bg() set to Color::BrightRed.","Returns self with the bg() set to Color::BrightRed.","Returns self with the bg() set to Color::BrightRed.","Returns self with the bg() set to Color::BrightRed.","Returns self with the bg() set to Color::BrightRed.","Returns self with the bg() set to Color::BrightRed.","Returns self with the bg() set to Color::BrightRed.","Returns self with the bg() set to Color::BrightRed.","Returns self with the bg() set to Color::BrightWhite.","Returns self with the bg() set to Color::BrightWhite.","Returns self with the bg() set to Color::BrightWhite.","Returns self with the bg() set to Color::BrightWhite.","Returns self with the bg() set to Color::BrightWhite.","Returns self with the bg() set to Color::BrightWhite.","Returns self with the bg() set to Color::BrightWhite.","Returns self with the bg() set to Color::BrightWhite.","Returns self with the bg() set to Color::BrightWhite.","Returns self with the bg() set to Color::BrightWhite.","Returns self with the bg() set to Color::BrightWhite.","Returns self with the bg() set to Color::BrightWhite.","Returns self with the bg() set to Color::BrightWhite.","Returns self with the bg() set to Color::BrightWhite.","Returns self with the bg() set to Color::BrightWhite.","Returns self with the bg() set to Color::BrightYellow.","Returns self with the bg() set to Color::BrightYellow.","Returns self with the bg() set to Color::BrightYellow.","Returns self with the bg() set to Color::BrightYellow.","Returns self with the bg() set to Color::BrightYellow.","Returns self with the bg() set to Color::BrightYellow.","Returns self with the bg() set to Color::BrightYellow.","Returns self with the bg() set to Color::BrightYellow.","Returns self with the bg() set to Color::BrightYellow.","Returns self with the bg() set to Color::BrightYellow.","Returns self with the bg() set to Color::BrightYellow.","Returns self with the bg() set to Color::BrightYellow.","Returns self with the bg() set to Color::BrightYellow.","Returns self with the bg() set to Color::BrightYellow.","Returns self with the bg() set to Color::BrightYellow.","Returns self with the bg() set to Color::Cyan.","Returns self with the bg() set to Color::Cyan.","Returns self with the bg() set to Color::Cyan.","Returns self with the bg() set to Color::Cyan.","Returns self with the bg() set to Color::Cyan.","Returns self with the bg() set to Color::Cyan.","Returns self with the bg() set to Color::Cyan.","Returns self with the bg() set to Color::Cyan.","Returns self with the bg() set to Color::Cyan.","Returns self with the bg() set to Color::Cyan.","Returns self with the bg() set to Color::Cyan.","Returns self with the bg() set to Color::Cyan.","Returns self with the bg() set to Color::Cyan.","Returns self with the bg() set to Color::Cyan.","Returns self with the bg() set to Color::Cyan.","Returns self with the bg() set to Color::Fixed.","Returns self with the bg() set to Color::Fixed.","Returns self with the bg() set to Color::Fixed.","Returns self with the bg() set to Color::Fixed.","Returns self with the bg() set to Color::Fixed.","Returns self with the bg() set to Color::Fixed.","Returns self with the bg() set to Color::Fixed.","Returns self with the bg() set to Color::Fixed.","Returns self with the bg() set to Color::Fixed.","Returns self with the bg() set to Color::Fixed.","Returns self with the bg() set to Color::Fixed.","Returns self with the bg() set to Color::Fixed.","Returns self with the bg() set to Color::Fixed.","Returns self with the bg() set to Color::Fixed.","Returns self with the bg() set to Color::Fixed.","Returns self with the bg() set to Color::Green.","Returns self with the bg() set to Color::Green.","Returns self with the bg() set to Color::Green.","Returns self with the bg() set to Color::Green.","Returns self with the bg() set to Color::Green.","Returns self with the bg() set to Color::Green.","Returns self with the bg() set to Color::Green.","Returns self with the bg() set to Color::Green.","Returns self with the bg() set to Color::Green.","Returns self with the bg() set to Color::Green.","Returns self with the bg() set to Color::Green.","Returns self with the bg() set to Color::Green.","Returns self with the bg() set to Color::Green.","Returns self with the bg() set to Color::Green.","Returns self with the bg() set to Color::Green.","Returns self with the bg() set to Color::Magenta.","Returns self with the bg() set to Color::Magenta.","Returns self with the bg() set to Color::Magenta.","Returns self with the bg() set to Color::Magenta.","Returns self with the bg() set to Color::Magenta.","Returns self with the bg() set to Color::Magenta.","Returns self with the bg() set to Color::Magenta.","Returns self with the bg() set to Color::Magenta.","Returns self with the bg() set to Color::Magenta.","Returns self with the bg() set to Color::Magenta.","Returns self with the bg() set to Color::Magenta.","Returns self with the bg() set to Color::Magenta.","Returns self with the bg() set to Color::Magenta.","Returns self with the bg() set to Color::Magenta.","Returns self with the bg() set to Color::Magenta.","Returns self with the bg() set to Color::Primary.","Returns self with the bg() set to Color::Primary.","Returns self with the bg() set to Color::Primary.","Returns self with the bg() set to Color::Primary.","Returns self with the bg() set to Color::Primary.","Returns self with the bg() set to Color::Primary.","Returns self with the bg() set to Color::Primary.","Returns self with the bg() set to Color::Primary.","Returns self with the bg() set to Color::Primary.","Returns self with the bg() set to Color::Primary.","Returns self with the bg() set to Color::Primary.","Returns self with the bg() set to Color::Primary.","Returns self with the bg() set to Color::Primary.","Returns self with the bg() set to Color::Primary.","Returns self with the bg() set to Color::Primary.","Returns self with the bg() set to Color::Red.","Returns self with the bg() set to Color::Red.","Returns self with the bg() set to Color::Red.","Returns self with the bg() set to Color::Red.","Returns self with the bg() set to Color::Red.","Returns self with the bg() set to Color::Red.","Returns self with the bg() set to Color::Red.","Returns self with the bg() set to Color::Red.","Returns self with the bg() set to Color::Red.","Returns self with the bg() set to Color::Red.","Returns self with the bg() set to Color::Red.","Returns self with the bg() set to Color::Red.","Returns self with the bg() set to Color::Red.","Returns self with the bg() set to Color::Red.","Returns self with the bg() set to Color::Red.","Returns self with the bg() set to Color::Rgb.","Returns self with the bg() set to Color::Rgb.","Returns self with the bg() set to Color::Rgb.","Returns self with the bg() set to Color::Rgb.","Returns self with the bg() set to Color::Rgb.","Returns self with the bg() set to Color::Rgb.","Returns self with the bg() set to Color::Rgb.","Returns self with the bg() set to Color::Rgb.","Returns self with the bg() set to Color::Rgb.","Returns self with the bg() set to Color::Rgb.","Returns self with the bg() set to Color::Rgb.","Returns self with the bg() set to Color::Rgb.","Returns self with the bg() set to Color::Rgb.","Returns self with the bg() set to Color::Rgb.","Returns self with the bg() set to Color::Rgb.","Returns self with the bg() set to Color::White.","Returns self with the bg() set to Color::White.","Returns self with the bg() set to Color::White.","Returns self with the bg() set to Color::White.","Returns self with the bg() set to Color::White.","Returns self with the bg() set to Color::White.","Returns self with the bg() set to Color::White.","Returns self with the bg() set to Color::White.","Returns self with the bg() set to Color::White.","Returns self with the bg() set to Color::White.","Returns self with the bg() set to Color::White.","Returns self with the bg() set to Color::White.","Returns self with the bg() set to Color::White.","Returns self with the bg() set to Color::White.","Returns self with the bg() set to Color::White.","Returns self with the bg() set to Color::Yellow.","Returns self with the bg() set to Color::Yellow.","Returns self with the bg() set to Color::Yellow.","Returns self with the bg() set to Color::Yellow.","Returns self with the bg() set to Color::Yellow.","Returns self with the bg() set to Color::Yellow.","Returns self with the bg() set to Color::Yellow.","Returns self with the bg() set to Color::Yellow.","Returns self with the bg() set to Color::Yellow.","Returns self with the bg() set to Color::Yellow.","Returns self with the bg() set to Color::Yellow.","Returns self with the bg() set to Color::Yellow.","Returns self with the bg() set to Color::Yellow.","Returns self with the bg() set to Color::Yellow.","Returns self with the bg() set to Color::Yellow.","","Returns self with the fg() set to Color::Primary.","Returns self with the fg() set to Color::Primary.","Returns self with the fg() set to Color::Primary.","Returns self with the fg() set to Color::Primary.","Returns self with the fg() set to Color::Primary.","Returns self with the fg() set to Color::Primary.","Returns self with the fg() set to Color::Primary.","Returns self with the fg() set to Color::Primary.","Returns self with the fg() set to Color::Primary.","Returns self with the fg() set to Color::Primary.","Returns self with the fg() set to Color::Primary.","Returns self with the fg() set to Color::Primary.","Returns self with the fg() set to Color::Primary.","Returns self with the fg() set to Color::Primary.","Write this diagnostic out to stdout.","Enables the yansi Quirk value.","Enables the yansi Quirk value.","Enables the yansi Quirk value.","Enables the yansi Quirk value.","Enables the yansi Quirk value.","Enables the yansi Quirk value.","Enables the yansi Quirk value.","Enables the yansi Quirk value.","Enables the yansi Quirk value.","Enables the yansi Quirk value.","Enables the yansi Quirk value.","Enables the yansi Quirk value.","Enables the yansi Quirk value.","Enables the yansi Quirk value.","Enables the yansi Quirk value.","Returns self with the attr() set to Attribute::RapidBlink.","Returns self with the attr() set to Attribute::RapidBlink.","Returns self with the attr() set to Attribute::RapidBlink.","Returns self with the attr() set to Attribute::RapidBlink.","Returns self with the attr() set to Attribute::RapidBlink.","Returns self with the attr() set to Attribute::RapidBlink.","Returns self with the attr() set to Attribute::RapidBlink.","Returns self with the attr() set to Attribute::RapidBlink.","Returns self with the attr() set to Attribute::RapidBlink.","Returns self with the attr() set to Attribute::RapidBlink.","Returns self with the attr() set to Attribute::RapidBlink.","Returns self with the attr() set to Attribute::RapidBlink.","Returns self with the attr() set to Attribute::RapidBlink.","Returns self with the attr() set to Attribute::RapidBlink.","Returns self with the attr() set to Attribute::RapidBlink.","Returns self with the fg() set to Color::Red.","Returns self with the fg() set to Color::Red.","Returns self with the fg() set to Color::Red.","Returns self with the fg() set to Color::Red.","Returns self with the fg() set to Color::Red.","Returns self with the fg() set to Color::Red.","Returns self with the fg() set to Color::Red.","Returns self with the fg() set to Color::Red.","Returns self with the fg() set to Color::Red.","Returns self with the fg() set to Color::Red.","Returns self with the fg() set to Color::Red.","Returns self with the fg() set to Color::Red.","Returns self with the fg() set to Color::Red.","Returns self with the fg() set to Color::Red.","Returns self with the quirk() set to Quirk::Resetting.","Returns self with the quirk() set to Quirk::Resetting.","Returns self with the quirk() set to Quirk::Resetting.","Returns self with the quirk() set to Quirk::Resetting.","Returns self with the quirk() set to Quirk::Resetting.","Returns self with the quirk() set to Quirk::Resetting.","Returns self with the quirk() set to Quirk::Resetting.","Returns self with the quirk() set to Quirk::Resetting.","Returns self with the quirk() set to Quirk::Resetting.","Returns self with the quirk() set to Quirk::Resetting.","Returns self with the quirk() set to Quirk::Resetting.","Returns self with the quirk() set to Quirk::Resetting.","Returns self with the quirk() set to Quirk::Resetting.","Returns self with the quirk() set to Quirk::Resetting.","Returns self with the quirk() set to Quirk::Resetting.","Returns self with the fg() set to Color::Rgb.","Returns self with the fg() set to Color::Rgb.","Returns self with the fg() set to Color::Rgb.","Returns self with the fg() set to Color::Rgb.","Returns self with the fg() set to Color::Rgb.","Returns self with the fg() set to Color::Rgb.","Returns self with the fg() set to Color::Rgb.","Returns self with the fg() set to Color::Rgb.","Returns self with the fg() set to Color::Rgb.","Returns self with the fg() set to Color::Rgb.","Returns self with the fg() set to Color::Rgb.","Returns self with the fg() set to Color::Rgb.","Returns self with the fg() set to Color::Rgb.","Returns self with the fg() set to Color::Rgb.","Set the help message of this report.","Set the message of this report.","Set the note of this report.","Get the identifier of the source that this span refers to.","Create a Cache from a collection of ID/strings, where each …","Get the offset span of this line in the original Source.","Get the start offset of this span.","Returns self with the attr() set to Attribute::Strike.","Returns self with the attr() set to Attribute::Strike.","Returns self with the attr() set to Attribute::Strike.","Returns self with the attr() set to Attribute::Strike.","Returns self with the attr() set to Attribute::Strike.","Returns self with the attr() set to Attribute::Strike.","Returns self with the attr() set to Attribute::Strike.","Returns self with the attr() set to Attribute::Strike.","Returns self with the attr() set to Attribute::Strike.","Returns self with the attr() set to Attribute::Strike.","Returns self with the attr() set to Attribute::Strike.","Returns self with the attr() set to Attribute::Strike.","Returns self with the attr() set to Attribute::Strike.","Returns self with the attr() set to Attribute::Strike.","Returns self with the attr() set to Attribute::Strike.","Get the full text of this source file.","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","Returns self with the attr() set to Attribute::Underline.","Returns self with the attr() set to Attribute::Underline.","Returns self with the attr() set to Attribute::Underline.","Returns self with the attr() set to Attribute::Underline.","Returns self with the attr() set to Attribute::Underline.","Returns self with the attr() set to Attribute::Underline.","Returns self with the attr() set to Attribute::Underline.","Returns self with the attr() set to Attribute::Underline.","Returns self with the attr() set to Attribute::Underline.","Returns self with the attr() set to Attribute::Underline.","Returns self with the attr() set to Attribute::Underline.","Returns self with the attr() set to Attribute::Underline.","Returns self with the attr() set to Attribute::Underline.","Returns self with the attr() set to Attribute::Underline.","Returns self with the attr() set to Attribute::Underline.","Conditionally enable styling based on whether the Condition…","Conditionally enable styling based on whether the Condition…","Conditionally enable styling based on whether the Condition…","Conditionally enable styling based on whether the Condition…","Conditionally enable styling based on whether the Condition…","Conditionally enable styling based on whether the Condition…","Conditionally enable styling based on whether the Condition…","Conditionally enable styling based on whether the Condition…","Conditionally enable styling based on whether the Condition…","Conditionally enable styling based on whether the Condition…","Conditionally enable styling based on whether the Condition…","Conditionally enable styling based on whether the Condition…","Conditionally enable styling based on whether the Condition…","Conditionally enable styling based on whether the Condition…","Conditionally enable styling based on whether the Condition…","Returns self with the fg() set to Color::White.","Returns self with the fg() set to Color::White.","Returns self with the fg() set to Color::White.","Returns self with the fg() set to Color::White.","Returns self with the fg() set to Color::White.","Returns self with the fg() set to Color::White.","Returns self with the fg() set to Color::White.","Returns self with the fg() set to Color::White.","Returns self with the fg() set to Color::White.","Returns self with the fg() set to Color::White.","Returns self with the fg() set to Color::White.","Returns self with the fg() set to Color::White.","Returns self with the fg() set to Color::White.","Returns self with the fg() set to Color::White.","What character set should be used to display dynamic …","Give this report a numerical code that may be used to more …","Give this label a highlight colour.","Should colored output should be enabled?","Should the report remove gaps to minimise used space?","Use the given Config to determine diagnostic attributes.","When label lines cross one-another, should there be a gap?","Set the help message of this report.","Should this report use byte spans instead of char spans?","Add a label to the report.","Where should inline labels attach to their spans?","Add multiple labels to the report.","Add a message to this report.","Give this label a message.","Should arrows be used to point to the bounds of multi-line …","Set the note of this report.","Specify the order of this label relative to other labels.","Specify the priority of this label relative to other …","Pre-insert a selection of Sources into this cache.","How many characters width should tab characters be?","Should underlines be used for label span where possible?","Returns self with the quirk() set to Quirk::Wrap.","Returns self with the quirk() set to Quirk::Wrap.","Returns self with the quirk() set to Quirk::Wrap.","Returns self with the quirk() set to Quirk::Wrap.","Returns self with the quirk() set to Quirk::Wrap.","Returns self with the quirk() set to Quirk::Wrap.","Returns self with the quirk() set to Quirk::Wrap.","Returns self with the quirk() set to Quirk::Wrap.","Returns self with the quirk() set to Quirk::Wrap.","Returns self with the quirk() set to Quirk::Wrap.","Returns self with the quirk() set to Quirk::Wrap.","Returns self with the quirk() set to Quirk::Wrap.","Returns self with the quirk() set to Quirk::Wrap.","Returns self with the quirk() set to Quirk::Wrap.","Returns self with the quirk() set to Quirk::Wrap.","Write this diagnostic to an implementor of Write.","Write this diagnostic to an implementor of Write, assuming …","Returns self with the fg() set to Color::Yellow.","Returns self with the fg() set to Color::Yellow.","Returns self with the fg() set to Color::Yellow.","Returns self with the fg() set to Color::Yellow.","Returns self with the fg() set to Color::Yellow.","Returns self with the fg() set to Color::Yellow.","Returns self with the fg() set to Color::Yellow.","Returns self with the fg() set to Color::Yellow.","Returns self with the fg() set to Color::Yellow.","Returns self with the fg() set to Color::Yellow.","Returns self with the fg() set to Color::Yellow.","Returns self with the fg() set to Color::Yellow.","Returns self with the fg() set to Color::Yellow.","Returns self with the fg() set to Color::Yellow."],"i":[15,27,9,9,9,9,9,9,9,9,9,9,28,0,28,0,0,0,0,15,9,26,15,0,9,0,0,9,0,0,0,0,9,26,9,9,0,0,0,9,0,4,0,26,0,38,27,15,9,9,1,1,36,48,1,9,9,22,17,24,25,2,15,26,27,28,29,9,11,11,14,14,36,48,1,9,9,22,17,24,25,2,15,26,27,28,29,36,48,1,9,22,17,24,25,2,15,26,27,28,29,36,48,1,9,9,22,17,24,25,2,15,26,27,28,29,36,48,1,9,22,17,24,25,2,15,26,27,28,29,36,48,1,9,9,22,17,24,25,2,15,26,27,28,29,36,48,1,9,22,17,24,25,2,15,26,27,28,29,36,48,1,9,22,17,24,25,2,15,26,27,28,29,36,48,1,9,9,22,17,24,25,2,15,26,27,28,29,36,48,1,9,22,17,24,25,2,15,26,27,28,29,36,48,1,9,22,17,24,25,2,15,26,27,28,29,36,48,1,9,22,17,24,25,2,15,26,27,28,29,36,48,1,9,22,17,24,25,2,15,26,27,28,29,36,48,1,9,22,17,24,25,2,15,26,27,28,29,36,48,1,9,22,17,24,25,2,15,26,27,28,29,36,48,1,9,22,17,24,25,2,15,26,27,28,29,36,48,1,9,22,17,24,25,2,15,26,27,28,29,48,17,36,48,1,9,9,22,17,24,25,2,15,26,27,28,29,9,22,17,24,25,2,15,26,27,28,29,9,22,17,24,25,2,15,26,27,28,29,9,36,48,1,9,9,22,17,24,25,2,15,26,27,28,29,4,36,48,1,9,22,17,24,25,2,15,26,27,28,29,36,9,24,29,36,48,1,9,9,22,17,24,25,2,15,26,27,28,29,38,17,24,25,4,48,9,22,17,2,15,26,27,28,29,38,17,24,25,11,11,14,14,36,48,1,9,22,17,24,25,2,15,26,27,28,29,1,36,48,1,9,22,17,24,25,2,15,26,27,28,29,48,1,9,22,17,24,25,2,15,15,26,27,28,29,9,36,48,1,9,22,17,17,24,25,2,15,26,27,28,29,36,17,17,17,17,36,48,1,9,22,17,24,25,2,15,26,27,28,29,9,22,17,2,36,48,1,9,22,17,24,25,2,15,26,27,28,29,36,48,1,9,9,22,17,24,25,2,15,26,27,28,29,4,22,17,36,48,1,9,9,22,17,24,25,2,15,26,27,28,29,4,22,17,17,17,36,48,1,9,9,22,17,24,25,2,15,26,27,28,29,36,48,1,9,22,17,24,25,2,15,26,27,28,29,36,48,1,9,9,22,17,24,25,2,15,26,27,28,29,36,25,2,36,22,36,48,1,9,9,22,17,24,25,2,15,26,27,28,29,36,48,1,9,9,22,17,24,25,2,15,26,27,28,29,36,48,1,9,9,22,17,24,25,2,15,26,27,28,29,36,48,1,9,9,22,17,24,25,2,15,26,27,28,29,36,48,1,9,9,22,17,24,25,2,15,26,27,28,29,36,48,1,9,9,22,17,24,25,2,15,26,27,28,29,36,48,1,9,9,22,17,24,25,2,15,26,27,28,29,36,48,1,9,9,22,17,24,25,2,15,26,27,28,29,36,48,1,9,9,22,17,24,25,2,15,26,27,28,29,36,48,1,9,9,22,17,24,25,2,15,26,27,28,29,36,48,1,9,9,22,17,24,25,2,15,26,27,28,29,36,48,1,9,9,22,17,24,25,2,15,26,27,28,29,36,48,1,9,9,22,17,24,25,2,15,26,27,28,29,36,48,1,9,9,22,17,24,25,2,15,26,27,28,29,36,48,1,9,9,22,17,24,25,2,15,26,27,28,29,36,48,1,9,9,22,17,24,25,2,15,26,27,28,29,36,48,1,9,9,22,17,24,25,2,15,26,27,28,29,36,48,1,9,9,22,17,24,25,2,15,26,27,28,29,36,48,1,9,9,22,17,24,25,2,15,26,27,28,29,36,48,1,9,9,22,17,24,25,2,15,26,27,28,29,9,36,48,1,9,22,17,24,25,2,15,26,27,28,29,48,36,48,1,9,9,22,17,24,25,2,15,26,27,28,29,36,48,1,9,9,22,17,24,25,2,15,26,27,28,29,36,48,1,9,22,17,24,25,2,15,26,27,28,29,36,48,1,9,9,22,17,24,25,2,15,26,27,28,29,36,48,1,9,22,17,24,25,2,15,26,27,28,29,1,1,1,4,0,22,4,36,48,1,9,9,22,17,24,25,2,15,26,27,28,29,17,9,22,17,24,25,2,15,26,27,28,29,15,36,48,1,9,22,17,24,25,2,15,26,27,28,29,36,48,1,9,22,17,24,25,2,15,26,27,28,29,36,48,1,9,22,17,24,25,2,15,26,27,28,29,36,48,1,9,9,22,17,24,25,2,15,26,27,28,29,36,48,1,9,9,22,17,24,25,2,15,26,27,28,29,36,48,1,9,22,17,24,25,2,15,26,27,28,29,29,1,2,29,29,1,29,1,29,1,29,1,1,2,29,1,2,2,25,29,29,36,48,1,9,9,22,17,24,25,2,15,26,27,28,29,48,48,36,48,1,9,22,17,24,25,2,15,26,27,28,29],"f":"``````````````````````````````````````````````````{{{b{c}}{d{c}}}fh}{{{b{c}}e}fh{{l{}{{j{{d{c}}}}}}}}{{cn}{{A`{e}}}{}{}}000{{Abn}Ad}1111111111{AbAd}{{Afc}{{`{Af}}}{{Aj{{Ah{Ab}}}}}}0{{Alc}{{`{Al}}}{{Aj{{Ah{Ab}}}}}}0{{cAb}{{A`{e}}}{}{}}00{{AbAb}Ad}11111111111{c{{A`{e}}}{}{}}000000000000000050000000000000000000000000000500000000000{ce{}{}}0000000000000000000000000001116111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111{{AncB`}{{b{e}}}Ajh}{{{Bb{c}}}{{`{{Bf{}{{j{Bd}}}}}}}{{Bj{Bh}}}}333383333333333{AbAb}{BlBl}{{{Bb{c}}}{{Bb{c}}}{Bn{Bj{Bh}}}}{C`C`}{{{Cb{ceg}}}{{Cb{ceg}}}BnBn{{Bj{Bh}}Bn}}{{{d{c}}}{{d{c}}}Bn}{AnAn}{CdCd}{CfCf}{ChCh}{CjCj}{{ce}f{}{}}0000000000{{AbAb}Cl}{c{{A`{e}}}{}{}}000{AbAd}1111111111{{{h{}{{Cn{c}}}}B`}D`{DbDdDf}}22222222222222{{}Dh}{{}Ab}{{}C`}{{}Cj}666566666666666{{{Dl{}{{Dj{c}}}}e}{{Ah{{E`{Dn}}}}}{{Bj{Bh}}}Df}{{{Bb{c}}f}{{Ah{{E`{Dn}}}}}{{Bj{Bh}}}}{{C`Eb}{{Ah{{E`{Dn}}}}}}{{{Cb{cge}}c}{{Ah{{E`{Dn}}}}}{DnEdDbEfBn}{{Bj{Bh}}}{{En{c}{{Eh{{El{e{E`{Ej}}}}}}}}}}{{{h{}{{Cn{c}}}}}B`{DbDdDf}}{{{F`{c}}e}{{Fb{f}}}hDl}{{AbAb}D`}{{BlBl}D`}{{{Bb{c}}{Bb{c}}}D`{Db{Bj{Bh}}}}{{{d{c}}{d{c}}}D`Db}{{AnAn}D`}{{CdCd}D`}{{CfCf}D`}{{ChCh}D`}{{CjCj}D`}{{{Dl{}{{Dj{c}}}}e}{{El{{Bb{c}}{E`{Ej}}}}}{{Bj{Bh}}}Df}{{{Bb{c}}f}{{El{{Bb{c}}{E`{Ej}}}}}{{Bj{Bh}}}}{{C`Eb}{{El{Bb{E`{Ej}}}}}}{{{Cb{cge}}c}{{El{{Bb{e}}{E`{Ej}}}}}{DnEdDbEfBn}{{Bj{Bh}}}{{En{c}{{Eh{{El{e{E`{Ej}}}}}}}}}}{{Afc}{{`{Af}}}{{Aj{{Ah{Ab}}}}}}0{{Alc}{{`{Al}}}{{Aj{{Ah{Ab}}}}}}0{{cAb}{{A`{e}}}{}{}}0000000000000{{{b{c}}}{{F`{c}}}h}{{cFd}{{A`{e}}}{}{}}0000000000000{{{F`{c}}Ff}Fhh}{{{b{c}}Ff}Fhh}{{AbFf}{{El{fFj}}}}{{BlFf}Fh}{{{Bb{c}}Ff}Fh{Ej{Bj{Bh}}}}{{C`Ff}Fh}{{{Cb{ceg}}Ff}FhEjEj{{Bj{Bh}}Ej}}{{{d{c}}Ff}FhEj}{{AnFf}Fh}0{{CdFf}Fh}{{CfFf}Fh}{{ChFf}Fh}{{CjFf}Fh}{AbAd}{cc{}}00000{c{{Bb{c}}}{{Bj{Bh}}}}11111111{{{Fn{Fl}}G`}Dh}{{{Bb{c}}B`}{{Ah{{Gb{BlB`B`}}}}}{{Bj{Bh}}}}{{{Bb{c}}e}{{Gd{B`}}}{{Bj{Bh}}}h}{{{Bb{c}}Bl}{{Ah{Bh}}}{{Bj{Bh}}}}2{c{{A`{e}}}{}{}}0000000000000{{Abc}fGf}{{Blc}fGf}{{{Bb{c}}e}f{Ed{Bj{Bh}}}Gf}{{{d{c}}e}fEdGf}{ce{}{}}0000000000000555<55555555555{{{h{}{{Cn{c}}}}}D`{DbDdDf}}{BlD`}{{{Bb{c}}}D`{{Bj{Bh}}}}8888?8888888888{{{h{}{{Cn{c}}}}}B`{DbDdDf}}{BlB`}{{{Bb{c}}}B`{{Bj{Bh}}}}{{{Bb{c}}B`}{{Ah{Bl}}}{{Bj{Bh}}}}{{{Bb{c}}}{{`{{Gh{}{{j{Bl}}}}}}}{{Bj{Bh}}}}===={AbAd}>>>>>>>>>>>>>>>>>>>>>>>>>>>0>>>>>>>>>>>{{}Dh}{c{{Cb{ecg}}}{}{}{{Bj{Bh}}}}{c{{d{c}}}h}{DhAb}8{c{{A`{e}}}{}{}}00050000000000000050000000000000500000000000000050000000000000500000000000000500000000000000500000000000000500000000000000500000000000000500000000000000500000000000000500000000000{{cFd}{{A`{e}}}{}{}}000{{AbFd}Ad}1111111111222722222222222222722222222222222272222222222222272222222222{{cFdFdFd}{{A`{e}}}{}{}}00{{AbFdFdFd}Ad}11111111111444494444444444444494444444444{{AbAb}{{Ah{Cl}}}}55555555555555{{{F`{c}}e}{{Fb{f}}}hDl}{{cGj}{{A`{e}}}{}{}}000{{AbGj}Ad}1111111111888=88888888888888888888888888888=888888888855555555555555{{{b{c}}e}fhGl}00{{{h{}{{Cn{c}}}}}c{DbDdDf}}{g{{`{{Dl{c}}}}}{DnEdDbEfBn}{{Bj{Bh}}}{{l{}{{j{{Gb{ce}}}}}}}}{Bl{{Gd{B`}}}}{{{h{}{{Cn{c}}}}}B`{DbDdDf}}==={AbAd}>>>>>>>>>>>{{{Bb{c}}}Bh{{Bj{Bh}}}}{ce{}{}}0000000000{cGn{}}{c{{El{e}}}{}{}}000000000000000000000000000{cH`{}}0000000000000{c{{A`{e}}}{}{}}00600000000000{{cHb}{{A`{e}}}{}{}}00{{AbHb}Ad}1111111111122222222222222{{CjCf}Cj}{{{b{c}}e}{{b{c}}}hDn}{{{d{c}}Ab}{{d{c}}}h}{{CjD`}Cj}0{{{b{c}}Cj}{{b{c}}}h}1{{{b{c}}e}{{b{c}}}hGl}{{CjCh}Cj}{{{b{c}}{d{c}}}{{b{c}}}h}{{CjCd}Cj}{{{b{c}}e}{{b{c}}}h{{l{}{{j{{d{c}}}}}}}}4{{{d{c}}e}{{d{c}}}hGl}75{{{d{c}}Hd}{{d{c}}}h}0{{{Cb{ceg}}{Hf{c{Bb{g}}}}}{{Cb{ceg}}}{EfEd}{}{{Bj{Bh}}}}{{CjB`}Cj}:{c{{A`{e}}}{}{}}00{AbAd}11111111111{{{F`{c}}eg}{{Fb{f}}}hDlHh}022222222222222","c":[302,303,304,305,306,307,308,309,310,311,312,313,314,315,316],"p":[[5,"ReportBuilder",0],[5,"Label",0],[1,"unit"],[10,"Span",0],[17,"Item"],[10,"IntoIterator",1157],[6,"Attribute",1158],[5,"Painted",1159],[6,"Color",0],[5,"Style",1160],[10,"Fmt",0],[6,"Option",1161],[10,"Into",1162],[10,"StdoutFmt",0],[6,"ReportKind",0],[1,"usize"],[5,"Source",0],[1,"char"],[10,"Iterator",1163],[1,"str"],[10,"AsRef",1162],[5,"Line",0],[10,"Clone",1164],[5,"FileCache",0],[5,"FnCache",0],[6,"LabelAttach",0],[6,"CharSet",0],[6,"IndexType",0],[5,"Config",0],[6,"Ordering",1165],[17,"SourceId"],[1,"bool"],[10,"PartialEq",1165],[10,"ToOwned",1166],[10,"Sized",1167],[5,"ColorGenerator",0],[17,"Storage"],[10,"Cache",0],[10,"Display",1168],[5,"Box",1169],[5,"Path",1170],[10,"Hash",1171],[10,"Eq",1165],[17,"Output"],[10,"Debug",1168],[6,"Result",1172],[10,"FnMut",1173],[5,"Report",0],[8,"Result",1174],[1,"u8"],[5,"Formatter",1168],[8,"Result",1168],[5,"Error",1168],[1,"u16"],[1,"array"],[1,"f32"],[1,"tuple"],[5,"Range",1175],[10,"Hasher",1171],[10,"ExactSizeIterator",1176],[6,"Quirk",1158],[10,"ToString",1177],[5,"String",1177],[5,"TypeId",1178],[5,"Condition",1179],[1,"i32"],[5,"HashMap",1180],[10,"Write",1181]],"b":[[449,"impl-Display-for-ReportKind%3C\'_%3E"],[450,"impl-Debug-for-ReportKind%3C\'a%3E"]]}],\ ["beef",{"doc":"Faster, more compact implementation of Cow.","t":"ICCFNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNI","n":["Cow","generic","lean","Cow","as_ref","borrow","borrow","borrow_mut","borrowed","clone","clone_into","cmp","const_str","const_str","default","deref","drop","eq","eq","eq","eq","eq","eq","eq","fmt","fmt","from","from","from","from","from","hash","into","into_owned","is_borrowed","is_owned","owned","partial_cmp","to_owned","to_string","try_from","try_into","type_id","unwrap_borrowed","Cow"],"q":[[0,"beef"],[3,"beef::generic"],[44,"beef::lean"],[45,"core::marker"],[46,"core::cmp"],[47,"core::cmp"],[48,"alloc::vec"],[49,"core::clone"],[50,"core::cmp"],[51,"core::fmt"],[52,"core::hash"],[53,"core::hash"],[54,"core::cmp"],[55,"core::any"]],"d":["Compact three word Cow that puts the ownership tag in …","This module contains the actual, albeit generic, …","Namespace containing the 2-word Cow implementation.","A clone-on-write smart pointer, mostly compatible with …","","","","","Borrowed data.","","","","Borrowed data.","Borrowed data.","","","","","","","","","","","","","","Returns the argument unchanged.","","","","","Calls U::from(self).","Extracts the owned data.","Returns true if data is borrowed or had no capacity.","Returns true if data is owned and has non-0 capacity.","Owned data.","","","","","","","Extracts borrowed data.","Faster, 2-word Cow. This version is available only on …"],"i":[0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,0],"f":"````{{{b{ce}}}c{`d}`}{ce{}{}}10{c{{b{ce}}}{`d}`}{{{b{ce}}}{{b{ce}}}{`d}`}{{ce}f{}{}}{{{b{ce}}{b{ce}}}h{j`d}`}{l{{b{l`}}}}0{{}{{b{ce}}}{`d}`}7{{{b{ce}}}f{`d}`}{{{b{lc}}n}A``}{{{b{lc}}l}A``}{{{b{{Ab{c}}e}}{Ad{c}}}A`{AfAh}`}1{{{b{{Ab{c}}e}}{Ab{c}}}A`{AfAh}`}{{{b{eg}}{b{ci}}}A`{`d}{`d{Ah{c}}}``}1{{{b{ce}}Aj}Al{`And}`}{{{b{ce}}Aj}Al{`B`d}`}{{{Ad{c}}}{{b{{Ab{c}}e}}}Af`}{cc{}}{{{Bb{c}}}{{b{ce}}}{`d}`}{n{{b{lc}}}`}{c{{b{ce}}}{`d}`}{{{b{ce}}g}f{Bd`d}`Bf}{ce{}{}}{{{b{ce}}}{}{`d}`}{{{b{ce}}}A`{`d}`}0{{}{{b{ce}}}{`d}`}{{{b{eg}}{b{ci}}}{{Bh{h}}}{`d}{`d{Bj{c}}}``}4{cn{}}{c{{Bl{e}}}{}{}}0{cBn{}}{{{b{ce}}}c{`d}`}`","c":[],"p":[[5,"Cow",3],[10,"Sized",45],[1,"unit"],[6,"Ordering",46],[10,"Ord",46],[1,"str"],[5,"String",47],[1,"bool"],[1,"slice"],[5,"Vec",48],[10,"Clone",49],[10,"PartialEq",46],[5,"Formatter",50],[8,"Result",50],[10,"Debug",50],[10,"Display",50],[6,"Cow",51],[10,"Hash",52],[10,"Hasher",52],[6,"Option",53],[10,"PartialOrd",46],[6,"Result",54],[5,"TypeId",55]],"b":[[12,"impl-Cow%3C\'a,+str,+Wide%3E"],[13,"impl-Cow%3C\'a,+str,+Lean%3E"],[17,"impl-PartialEq%3CString%3E-for-Cow%3C\'_,+str,+U%3E"],[18,"impl-PartialEq%3Cstr%3E-for-Cow%3C\'_,+str,+U%3E"],[19,"impl-PartialEq%3CVec%3CT%3E%3E-for-Cow%3C\'_,+%5BT%5D,+U%3E"],[20,"impl-PartialEq%3C%26str%3E-for-Cow%3C\'_,+str,+U%3E"],[21,"impl-PartialEq%3C%5BT%5D%3E-for-Cow%3C\'_,+%5BT%5D,+U%3E"],[22,"impl-PartialEq%3CCow%3C\'_,+B,+V%3E%3E-for-Cow%3C\'_,+A,+U%3E"],[23,"impl-PartialEq%3C%26%5BT%5D%3E-for-Cow%3C\'_,+%5BT%5D,+U%3E"],[24,"impl-Debug-for-Cow%3C\'_,+T,+U%3E"],[25,"impl-Display-for-Cow%3C\'_,+T,+U%3E"],[26,"impl-From%3CVec%3CT%3E%3E-for-Cow%3C\'_,+%5BT%5D,+U%3E"],[28,"impl-From%3CCow%3C\'a,+T%3E%3E-for-Cow%3C\'a,+T,+U%3E"],[29,"impl-From%3CString%3E-for-Cow%3C\'_,+str,+U%3E"],[30,"impl-From%3C%26T%3E-for-Cow%3C\'a,+T,+U%3E"]]}],\ ["bitflags",{"doc":"Generate types for C-style flags with ergonomic APIs.","t":"TEKRTTFKNNQMNNNNNNNNNNNNNNMNNNNNNNNNNNNNNNNNCNNNNNNCNNNNNNNNNNNNNNFFNNNNNNNNNNNNNNNNNNNFKKNNNNNNHHHNNNMHHHNNNM","n":["ALL","BitFlags","Bits","Bits","EMPTY","FLAGS","Flag","Flags","all","all","bitflags","bits","borrow","borrow_mut","complement","complement","contains","contains","difference","difference","empty","empty","fmt","from","from_bits","from_bits","from_bits_retain","from_bits_truncate","from_bits_truncate","from_name","from_name","insert","insert","intersection","intersection","intersects","intersects","into","is_all","is_all","is_empty","is_empty","is_named","is_unnamed","iter","iter","iter","iter_names","iter_names","name","new","parser","remove","remove","set","set","symmetric_difference","symmetric_difference","toggle","toggle","try_from","try_into","type_id","union","union","value","Iter","IterNames","borrow","borrow","borrow_mut","borrow_mut","from","from","into","into","into_iter","into_iter","next","next","remaining","try_from","try_from","try_into","try_into","type_id","type_id","ParseError","ParseHex","WriteHex","borrow","borrow_mut","empty_flag","fmt","fmt","from","from_str","from_str_strict","from_str_truncate","into","invalid_hex_flag","invalid_named_flag","parse_hex","to_writer","to_writer_strict","to_writer_truncate","try_from","try_into","type_id","write_hex"],"q":[[0,"bitflags"],[66,"bitflags::iter"],[87,"bitflags::parser"],[110,"core::fmt"],[111,"core::fmt"],[112,"core::result"],[113,"core::any"],[114,"core::fmt"]],"d":["A value with all bits set.","","A bits type that can be used as storage for a flags type.","The underlying bits type.","A value with all bits unset.","The set of defined flags.","A defined flags value that may be named or unnamed.","A set of defined flags using a bits type as storage.","Get a flags value with all known bits set.","Get a flags value with all known bits set.","Generate a flags type.","Get the underlying bits value.","","","The bitwise negation (!) of the bits in a flags value, …","The bitwise negation (!) of the bits in a flags value, …","Whether all set bits in a source flags value are also set …","Whether all set bits in a source flags value are also set …","The intersection of a source flags value with the …","The intersection of a source flags value with the …","Get a flags value with all bits unset.","Get a flags value with all bits unset.","","Returns the argument unchanged.","Convert from a bits value.","Convert from a bits value.","Convert from a bits value exactly.","Convert from a bits value, unsetting any unknown bits.","Convert from a bits value, unsetting any unknown bits.","Get a flags value with the bits of a flag with the given …","Get a flags value with the bits of a flag with the given …","The bitwise or (|) of the bits in two flags values.","The bitwise or (|) of the bits in two flags values.","The bitwise and (&) of the bits in two flags values.","The bitwise and (&) of the bits in two flags values.","Whether any set bits in a source flags value are also set …","Whether any set bits in a source flags value are also set …","Calls U::from(self).","Whether all known bits in this flags value are set.","Whether all known bits in this flags value are set.","Whether all bits in this flags value are unset.","Whether all bits in this flags value are unset.","Whether the flag is named.","Whether the flag is unnamed.","Yield the bits of a source flags value in a set of …","Yield a set of contained flags values.","Yield a set of contained flags values.","Yield a set of contained named flags values.","Yield a set of contained named flags values.","Get the name of this flag.","Define a flag.","Parsing flags from text.","The intersection of a source flags value with the …","The intersection of a source flags value with the …","Call Flags::insert when value is true or Flags::remove …","Call Flags::insert when value is true or Flags::remove …","The bitwise exclusive-or (^) of the bits in two flags …","The bitwise exclusive-or (^) of the bits in two flags …","The bitwise exclusive-or (^) of the bits in two flags …","The bitwise exclusive-or (^) of the bits in two flags …","","","","The bitwise or (|) of the bits in two flags values.","The bitwise or (|) of the bits in two flags values.","Get the flags value of this flag.","An iterator over flags values.","An iterator over flags values.","","","","","Returns the argument unchanged.","Returns the argument unchanged.","Calls U::from(self).","Calls U::from(self).","","","","","Get a flags value of any remaining bits that haven’t …","","","","","","","An error encountered while parsing flags from text.","Parse a value from a hex string.","Encode a value as a hex string.","","","A hex or named flag wasn’t found between separators.","","","Returns the argument unchanged.","Parse a flags value from text.","Parse a flags value from text.","Parse a flags value from text.","Calls U::from(self).","An invalid hex flag was encountered.","A named flag that doesn’t correspond to any on the flags …","Parse the value from hex.","Write a flags value as text.","Write only the contained, defined, named flags in a flags …","Write a flags value as text, ignoring any unknown bits.","","","","Write the value as hex."],"i":[3,0,0,2,3,2,0,0,2,2,0,2,5,5,2,2,2,2,2,2,2,2,5,5,2,2,2,2,2,2,2,2,2,2,2,2,2,5,2,2,2,2,5,5,0,2,2,2,2,5,5,0,2,2,2,2,2,2,2,2,5,5,5,2,2,5,0,0,12,13,12,13,12,13,12,13,12,13,12,13,13,12,13,12,13,12,13,0,0,0,16,16,16,16,16,16,0,0,0,16,16,16,18,0,0,0,16,16,16,21],"f":"````````{{}{{d{}{{b{c}}}}}f}0`{{{d{}{{b{c}}}}}cf}{ce{}{}}0{{{d{}{{b{c}}}}}{{d{}{{b{c}}}}}f}0{{{d{}{{b{c}}}}{d{}{{b{c}}}}}hf}0{{{d{}{{b{c}}}}{d{}{{b{c}}}}}{{d{}{{b{c}}}}}f}055{{{j{c}}l}nA`}{cc{}}{c{{Ab{{d{}{{b{c}}}}}}}f}0{c{{d{}{{b{c}}}}}f}00{Ad{{Ab{{d{}{{b{c}}}}}}}f}0{{{d{}{{b{c}}}}{d{}{{b{c}}}}}Aff}066779{{{d{}{{b{c}}}}}hf}000{{{j{c}}}h{}}0`{{{d{}{{b{c}}}}}{{Ah{{d{}{{b{c}}}}}}}f}0{{{d{}{{b{c}}}}}{{Aj{{d{}{{b{c}}}}}}}f}0{{{j{c}}}Ad{}}{{Adc}{{j{c}}}{}}`66{{{d{}{{b{c}}}}{d{}{{b{c}}}}h}Aff}0==77{c{{Al{e}}}{}{}}0{cAn{}}??{{{j{c}}}c{}}``{ce{}{}}000??0000{{{Ah{c}}}{{Ab{e}}}d{}}{{{Aj{c}}}{{Ab{e}}}d{}}{{{Aj{c}}}c{}}666655```33{{}B`}{{B`l}n}0{cc{}}{Ad{{Al{cB`}}}d}007{cB`Bb}0{Ad{{Al{BdB`}}}}{{ce}{{Al{AfBf}}}dBh}00==<{{Bjc}nBh}","c":[],"p":[[17,"Bits"],[10,"Flags",0],[10,"Bits",0],[1,"bool"],[5,"Flag",0],[5,"Formatter",110],[8,"Result",110],[10,"Debug",110],[6,"Option",111],[1,"str"],[1,"unit"],[5,"Iter",66],[5,"IterNames",66],[6,"Result",112],[5,"TypeId",113],[5,"ParseError",87],[10,"Display",110],[10,"ParseHex",87],[5,"Error",110],[10,"Write",110],[10,"WriteHex",87]],"b":[[93,"impl-Display-for-ParseError"],[94,"impl-Debug-for-ParseError"]]}],\ @@ -21,9 +21,9 @@ var searchIndex = new Map(JSON.parse('[\ ["edlang_check",{"doc":"","t":"H","n":["lowering_error_to_report"],"q":[[0,"edlang_check"],[1,"edlang_lowering::errors"],[2,"edlang_session"],[3,"alloc::string"],[4,"core::ops::range"],[5,"ariadne"]],"d":["Creates a report from a lowering error."],"i":[0],"f":"{{bd}{{n{{l{f{j{h}}}}}}}}","c":[],"p":[[6,"LoweringError",1],[5,"Session",2],[5,"String",3],[1,"usize"],[5,"Range",4],[1,"tuple"],[5,"Report",5]],"b":[]}],\ ["edlang_codegen_llvm",{"doc":"","t":"CHH","n":["codegen","compile","compile"],"q":[[0,"edlang_codegen_llvm"],[2,"edlang_codegen_llvm::codegen"],[3,"edlang_session"],[4,"edlang_ir"],[5,"std::path"],[6,"core::error"],[7,"alloc::boxed"],[8,"core::result"]],"d":["","",""],"i":[0,0,0],"f":"`{{bd}{{l{f{j{h}}}}}}0","c":[],"p":[[5,"Session",3],[5,"ProgramBody",4],[5,"PathBuf",5],[10,"Error",6],[5,"Box",7],[6,"Result",8]],"b":[]}],\ ["edlang_driver",{"doc":"","t":"FOONNNNNNNNNNNNNNNNNNNNNNHNNONNNNNNNNNONNONONCONHNONNNNNNNNNNNNNNNNNNNNOOHNNNNONNNNNNNNNNNNNHH","n":["CompilerArgs","asm","ast","attr","augment_args","augment_args_for_update","bg","black","blink","blue","bold","borrow","borrow_mut","bright","bright_black","bright_blue","bright_cyan","bright_green","bright_magenta","bright_red","bright_white","bright_yellow","clear","command","command_for_update","compile","conceal","cyan","debug_info","dim","fg","fixed","fmt","from","from_arg_matches","from_arg_matches_mut","green","group_id","input","into","invert","ir","italic","library","linger","linker","llvm","magenta","main","mask","object","on_black","on_blue","on_bright","on_bright_black","on_bright_blue","on_bright_cyan","on_bright_green","on_bright_magenta","on_bright_red","on_bright_white","on_bright_yellow","on_cyan","on_fixed","on_green","on_magenta","on_primary","on_red","on_rgb","on_white","on_yellow","optlevel","output","parse_file","primary","quirk","rapid_blink","red","release","resetting","rgb","strike","try_from","try_into","type_id","underline","update_from_arg_matches","update_from_arg_matches_mut","whenever","white","wrap","yellow","link_binary","link_shared_lib"],"q":[[0,"edlang_driver"],[92,"edlang_driver::linker"],[94,"yansi::attr_quirk"],[95,"yansi::paint"],[96,"clap_builder::builder::command"],[97,"yansi::color"],[98,"std::path"],[99,"anyhow"],[100,"core::fmt"],[101,"core::fmt"],[102,"clap_builder"],[103,"core::result"],[104,"clap_builder::util::id"],[105,"core::option"],[106,"alloc::string"],[107,"edlang_ast"],[108,"alloc::vec"],[109,"yansi::attr_quirk"],[110,"yansi::condition"],[111,"std::path"]],"d":["","Output asm","Print the edlang AST","Enables the styling Attribute value.","","","Returns a styled value derived from self with the …","Returns self with the fg() set to Color::Black.","Returns self with the attr() set to Attribute::Blink.","Returns self with the fg() set to Color::Blue.","Returns self with the attr() set to Attribute::Bold.","","","Returns self with the quirk() set to Quirk::Bright.","Returns self with the fg() set to Color::BrightBlack.","Returns self with the fg() set to Color::BrightBlue.","Returns self with the fg() set to Color::BrightCyan.","Returns self with the fg() set to Color::BrightGreen.","Returns self with the fg() set to Color::BrightMagenta.","Returns self with the fg() set to Color::BrightRed.","Returns self with the fg() set to Color::BrightWhite.","Returns self with the fg() set to Color::BrightYellow.","Returns self with the quirk() set to Quirk::Clear.","","","","Returns self with the attr() set to Attribute::Conceal.","Returns self with the fg() set to Color::Cyan.","Always add debug info","Returns self with the attr() set to Attribute::Dim.","Returns a styled value derived from self with the …","Returns self with the fg() set to Color::Fixed.","","Returns the argument unchanged.","","","Returns self with the fg() set to Color::Green.","","The input file.","Calls U::from(self).","Returns self with the attr() set to Attribute::Invert.","Print the edlang IR","Returns self with the attr() set to Attribute::Italic.","Build as a library.","Returns self with the quirk() set to Quirk::Linger.","","Output llvm ir","Returns self with the fg() set to Color::Magenta.","","Returns self with the quirk() set to Quirk::Mask.","Output a object file","Returns self with the bg() set to Color::Black.","Returns self with the bg() set to Color::Blue.","Returns self with the quirk() set to Quirk::OnBright.","Returns self with the bg() set to Color::BrightBlack.","Returns self with the bg() set to Color::BrightBlue.","Returns self with the bg() set to Color::BrightCyan.","Returns self with the bg() set to Color::BrightGreen.","Returns self with the bg() set to Color::BrightMagenta.","Returns self with the bg() set to Color::BrightRed.","Returns self with the bg() set to Color::BrightWhite.","Returns self with the bg() set to Color::BrightYellow.","Returns self with the bg() set to Color::Cyan.","Returns self with the bg() set to Color::Fixed.","Returns self with the bg() set to Color::Green.","Returns self with the bg() set to Color::Magenta.","Returns self with the bg() set to Color::Primary.","Returns self with the bg() set to Color::Red.","Returns self with the bg() set to Color::Rgb.","Returns self with the bg() set to Color::White.","Returns self with the bg() set to Color::Yellow.","Set the optimization level, 0,1,2,3","The output file.","","Returns self with the fg() set to Color::Primary.","Enables the yansi Quirk value.","Returns self with the attr() set to Attribute::RapidBlink.","Returns self with the fg() set to Color::Red.","Build for release with all optimizations.","Returns self with the quirk() set to Quirk::Resetting.","Returns self with the fg() set to Color::Rgb.","Returns self with the attr() set to Attribute::Strike.","","","","Returns self with the attr() set to Attribute::Underline.","","","Conditionally enable styling based on whether the Condition…","Returns self with the fg() set to Color::White.","Returns self with the quirk() set to Quirk::Wrap.","Returns self with the fg() set to Color::Yellow.","",""],"i":[0,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,0,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,0,5,5,0,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,0,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,0,0],"f":"```{{cb}{{d{e}}}{}{}}{ff}0{{ch}{{d{e}}}{}{}}{c{{d{e}}}{}{}}000{ce{}{}}01111111111{{}f}0{j{{n{l}}}}33`34{{cA`}{{d{e}}}{}{}}{{jAb}Ad}{cc{}}{Af{{Aj{jAh}}}}07{{}{{An{Al}}}}`78`8`8``8{{}{{n{B`}}}}9`99999999999959999{{cA`A`A`}{{d{e}}}{}{}}::``{{{Bh{{Bf{lBbBd}}}}l}{{n{B`}}}};{{cBj}{{d{e}}}{}{}}<<`<2<{c{{Aj{e}}}{}{}}0{cBl{}}>{{jAf}{{Aj{B`Ah}}}}0{{cBn}{{d{e}}}{}{}}{c{{d{e}}}{}{}}00{{{C`{l}}Cb}{{Cd{B`}}}}0","c":[22],"p":[[6,"Attribute",94],[5,"Painted",95],[5,"Command",96],[6,"Color",97],[5,"CompilerArgs",0],[5,"PathBuf",98],[8,"Result",99],[1,"u8"],[5,"Formatter",100],[8,"Result",100],[5,"ArgMatches",101],[8,"Error",102],[6,"Result",103],[5,"Id",104],[6,"Option",105],[1,"unit"],[5,"String",106],[5,"Module",107],[1,"tuple"],[5,"Vec",108],[6,"Quirk",94],[5,"TypeId",109],[5,"Condition",110],[1,"slice"],[5,"Path",98],[8,"Result",111]],"b":[]}],\ -["edlang_ir",{"doc":"","t":"PFFPPPFGPPPPFPPPPPPPFPGGPPFFPPPPPPPPPGPPPPPPPPPPPPPPPGPPPPFGPGPFPPPPPPGPFGFPGPPPPPPPPFGPPPPPPPFFPPGFGPPPPPPPPPPPGGPPPPPPGPONNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNOOOOOONNNNNNNNNOONNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNONNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNOOOONNNNNNNNNNNNNNNNNNNNNNOOONNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNOONNNOONNOOOOOOOOOOOOOOOOOONONNNNNNOOCOOOOOOOOOOOOOONOONNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNOONNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNOONNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNOOOOOOOOOOOOOOFNNNNNONNNNNNHNONHNNNN","n":["Add","AdtBody","AdtVariant","And","Arg","Assign","BasicBlock","BinOp","BinOp","BitAnd","BitOr","BitXor","Body","Bool","Bool","Branch","Call","Cast","Char","Char","ConstData","ConstIndex","ConstKind","ConstValue","Constant","Copy","DebugInfo","DefId","Deref","Div","Eq","F32","F32","F64","F64","Field","Float","FloatTy","FnDef","Ge","Gt","I128","I128","I16","I16","I32","I32","I64","I64","I8","I8","Index","Int","IntTy","Isize","Isize","Le","Leaf","Local","LocalKind","LogicOp","LogicalOp","Lt","ModuleBody","Move","Mul","Ne","Neg","Not","Offset","Operand","Or","Place","PlaceElem","ProgramBody","Ptr","RValue","Ref","Ref","Rem","Return","ReturnPointer","Shl","Shr","Slice","Statement","StatementKind","StorageDead","StorageLive","Str","Str","Struct","Sub","SwitchInt","SwitchTarget","SymbolTable","Target","Temp","Terminator","TypeInfo","TypeKind","U128","U128","U16","U16","U32","U32","U64","U64","U8","U8","Uint","UintTy","UnOp","UnOp","Unit","Unreachable","Use","Usize","Value","ValueTree","ZeroSized","blocks","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","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","clone","clone","clone","clone","clone","clone","clone","clone","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","cmp","cmp","cmp","cmp","cmp","cmp","constants","constants","debug_name","def_id","def_id","def_id","default","default","default","eq","eq","eq","eq","eq","eq","file_id","file_names","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","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_span","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","function_signatures","functions","functions","functions","get_args","get_bool","get_char","get_f32","get_f64","get_falsy_value","get_i128","get_i16","get_i32","get_i64","get_i8","get_local","get_local","get_mangled_name","get_return_local","get_type","get_u128","get_u16","get_u32","get_u64","get_u8","hash","id","id","imports","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","is_exported","is_extern","is_float","is_integer","is_mutable","is_pub","is_pub","is_signed_integer","is_unit","kind","kind","kind","kind","local","locals","methods","mod_id","module_id","modules","modules","modules","mutable","name","name","name","name","name_to_idx","new","parent_ids","partial_cmp","partial_cmp","partial_cmp","partial_cmp","partial_cmp","partial_cmp","program_id","projection","scalar_int","span","span","span","span","span","span","span","statements","structs","structs","structs","symbols","symbols","targets","temp","terminator","terminator_span","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_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","top_level_module_names","top_level_modules","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_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","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_info","types","types","values","variants","field_idx","index","value","args","destination","discriminator","func","target","targets","ScalarInt","borrow","borrow_mut","clone","clone_into","cmp","data","eq","fmt","from","hash","into","partial_cmp","sign_extend","size","size","to_owned","truncate","try_from","try_from_int","try_into","type_id"],"q":[[0,"edlang_ir"],[583,"edlang_ir::PlaceElem"],[586,"edlang_ir::Terminator"],[592,"edlang_ir::scalar_int"],[614,"core::cmp"],[615,"core::fmt"],[616,"core::fmt"],[617,"core::option"],[618,"alloc::string"],[619,"core::hash"],[620,"edlang_span"],[621,"core::result"],[622,"core::any"],[623,"core::convert"]],"d":["","","struct field or enum variant","","","","","","","","","","","","","","","","","","","","","","","","","Definition id.","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","Used for ifs, match","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","Constants defined in this module.","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","The function signatures.","","This stores all the functions from all modules","Functions defined in this module.","","","","","","","","","","","","","","","","","","","","","","","","","Imported items. symbol -> id","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","","","","","","","","","","","","","","","","","","","","All the modules in a flat map.","Submodules defined in this module.","","","","","","","","","","","","","","","","","","","","","","","","","","","","Structs defined in this module.","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","The top level modules.","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","Types defined in this module.","","","","","","The arguments.","The place in memory to store the return value of the …","","The function to call.","What basic block to jump to after the function call, if …","","","","","","","","","","","Returns the argument unchanged.","","Calls U::from(self).","","","Size in bytes","Size in bytes","","Truncates value to self bits.","","","",""],"i":[28,0,0,29,11,13,0,0,24,28,28,28,0,17,31,23,14,24,17,31,0,27,0,0,25,25,0,0,27,28,28,20,31,20,31,27,17,0,17,28,28,18,31,18,31,18,31,18,31,18,31,27,17,0,18,31,28,23,0,0,24,0,28,0,25,28,28,30,30,28,0,29,0,0,0,17,0,17,24,28,14,11,28,28,17,0,0,13,13,17,31,17,28,14,0,0,14,11,0,0,0,19,31,19,31,19,31,19,31,19,31,17,0,0,24,17,14,24,19,22,0,22,5,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,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,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,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,4,16,17,18,19,20,1,3,10,5,6,7,1,2,4,4,16,17,18,19,20,3,2,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,17,18,19,20,21,22,23,24,25,26,27,28,29,30,31,5,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,2,1,2,3,5,17,17,17,17,17,17,17,17,17,17,24,25,5,5,23,17,17,17,17,17,4,4,8,3,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,5,5,17,17,10,5,6,17,17,10,12,16,21,26,5,1,6,3,1,2,3,10,3,5,6,7,6,10,3,4,16,17,18,19,20,4,26,0,3,6,8,10,12,16,21,9,1,2,3,1,3,15,10,9,9,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,17,2,2,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,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,7,10,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,21,1,3,15,6,51,52,53,54,54,55,54,54,55,0,46,46,46,46,46,46,46,46,46,46,46,46,0,46,46,46,0,46,46,46,46],"f":"```````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````{ce{}{}}0000000000000000000000000000000000000000000000000000000000000{bb}{dd}{ff}{hh}{jj}{ll}{nn}{A`A`}{AbAb}{AdAd}{AfAf}{AhAh}{AjAj}{AlAl}{AnAn}{B`B`}{BbBb}{BdBd}{BfBf}{BhBh}{BjBj}{BlBl}{BnBn}{C`C`}{CbCb}{CdCd}{CfCf}{ChCh}{CjCj}{ClCl}{CnCn}{{ce}D`{}{}}000000000000000000000000000000{{hh}Db}{{B`B`}Db}{{BbBb}Db}{{BdBd}Db}{{BfBf}Db}{{BhBh}Db}``````{{}b}{{}d}{{}h}{{hh}Dd}{{B`B`}Dd}{{BbBb}Dd}{{BdBd}Dd}{{BfBf}Dd}{{BhBh}Dd}``{{bDf}Dh}{{dDf}Dh}{{fDf}Dh}{{hDf}Dh}{{jDf}Dh}{{lDf}Dh}{{nDf}Dh}{{A`Df}Dh}{{AbDf}Dh}{{AdDf}Dh}{{AfDf}Dh}{{AhDf}Dh}{{AjDf}Dh}{{AlDf}Dh}{{AnDf}Dh}{{B`Df}Dh}{{BbDf}Dh}0{{BdDf}Dh}{{BfDf}Dh}{{BhDf}Dh}{{BjDf}Dh}{{BlDf}Dh}{{BnDf}Dh}{{C`Df}Dh}{{CbDf}Dh}{{CdDf}Dh}{{CfDf}Dh}{{ChDf}Dh}{{CjDf}Dh}{{ClDf}Dh}{{CnDf}Dh}`{cc{}}000000000000000000000000000000````{j{{Dl{{Dj{Ad}}}}}}{{}Bb}000{BbBn}11111{C`{{E`{Dn}}}}{Cb{{E`{Dn}}}}{jEb}{jAd}{BnBb}66666{{hc}D`Ed}```{ce{}{}}000000000000000000000000000000``{BbDd}0{AdDd}``11``````````````````{{{E`{Ef}}AfB`{E`{Eb}}Dd}Ad}`{{hh}{{E`{Db}}}}{{B`B`}{{E`{Db}}}}{{BbBb}{{E`{Db}}}}{{BdBd}{{E`{Db}}}}{{BfBf}{{E`{Db}}}}{{BhBh}{{E`{Db}}}}`````````````````{BbAd}``:::::::::::::::::::::::::::::::{cEb{}}``{c{{Eh{e}}}{}{}}0000000000000000000000000000000000000000000000000000000000000``{cEj{}}000000000000000000000000000000```````````````=={ElEl}{{ce}D`{}{}}{{ElEl}Db}`{{ElEl}Dd}{{ElDf}Dh}{cc{}}{{Elc}D`Ed}{ce{}{}}{{ElEl}{{E`{Db}}}}{{EnF`}F`}{ElEn}`31<{{cEn}{{E`{El}}}{{Fd{Fb}}}}=<","c":[],"p":[[5,"SymbolTable",0],[5,"ProgramBody",0],[5,"ModuleBody",0],[5,"DefId",0],[5,"Body",0],[5,"AdtBody",0],[5,"AdtVariant",0],[5,"DebugInfo",0],[5,"BasicBlock",0],[5,"Local",0],[6,"LocalKind",0],[5,"Statement",0],[6,"StatementKind",0],[6,"Terminator",0],[5,"SwitchTarget",0],[5,"TypeInfo",0],[6,"TypeKind",0],[6,"IntTy",0],[6,"UintTy",0],[6,"FloatTy",0],[5,"ConstData",0],[6,"ConstKind",0],[6,"ValueTree",0],[6,"RValue",0],[6,"Operand",0],[5,"Place",0],[6,"PlaceElem",0],[6,"BinOp",0],[6,"LogicalOp",0],[6,"UnOp",0],[6,"ConstValue",0],[1,"unit"],[6,"Ordering",614],[1,"bool"],[5,"Formatter",615],[8,"Result",615],[1,"array"],[5,"SmallVec",616],[1,"usize"],[6,"Option",617],[5,"String",618],[10,"Hasher",619],[5,"Span",620],[6,"Result",621],[5,"TypeId",622],[5,"ScalarInt",592],[1,"u64"],[1,"u128"],[1,"i128"],[10,"Into",623],[15,"Field",583],[15,"ConstIndex",583],[15,"Index",583],[15,"Call",586],[15,"SwitchInt",586]],"b":[[286,"impl-Debug-for-TypeKind"],[287,"impl-Display-for-TypeKind"]]}],\ +["edlang_ir",{"doc":"","t":"PFFPPPFGPPPPFPPPPPPPFPGGPPFFPPPPPPPPPGPPPPPPPPPPPPPPPGPPPPFGPGPFPPPPPPGPFGFPGPPPPPPPPFGPPPPPPPFFPPGFGPPPPPPPPPPPGGPPPPPPGPONNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNOOOOOONNNNNNNNNOONNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNONNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNOOOONNNNNNNNNNNNNNNNNNNNNNOOONNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNOONNNOONNOOOOOOOOOOOOOOOOOONONNNNNNOOCOOOOOOOOOOOOOONOONNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNOONNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNOONNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNOOOOOOOOOOOOOOFNNNNNONNNNNNHNONHNNNN","n":["Add","AdtBody","AdtVariant","And","Arg","Assign","BasicBlock","BinOp","BinOp","BitAnd","BitOr","BitXor","Body","Bool","Bool","Branch","Call","Cast","Char","Char","ConstData","ConstIndex","ConstKind","ConstValue","Constant","Copy","DebugInfo","DefId","Deref","Div","Eq","F32","F32","F64","F64","Field","Float","FloatTy","FnDef","Ge","Gt","I128","I128","I16","I16","I32","I32","I64","I64","I8","I8","Index","Int","IntTy","Isize","Isize","Le","Leaf","Local","LocalKind","LogicOp","LogicalOp","Lt","ModuleBody","Move","Mul","Ne","Neg","Not","Offset","Operand","Or","Place","PlaceElem","ProgramBody","Ptr","RValue","Ref","Ref","Rem","Return","ReturnPointer","Shl","Shr","Slice","Statement","StatementKind","StorageDead","StorageLive","Str","Str","Struct","Sub","SwitchInt","SwitchTarget","SymbolTable","Target","Temp","Terminator","TypeInfo","TypeKind","U128","U128","U16","U16","U32","U32","U64","U64","U8","U8","Uint","UintTy","UnOp","UnOp","Unit","Unreachable","Use","Usize","Value","ValueTree","ZeroSized","blocks","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","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","clone","clone","clone","clone","clone","clone","clone","clone","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","cmp","cmp","cmp","cmp","cmp","cmp","constants","constants","debug_name","def_id","def_id","def_id","default","default","default","eq","eq","eq","eq","eq","eq","file_id","file_names","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","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_span","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","function_signatures","functions","functions","functions","get_args","get_bool","get_char","get_f32","get_f64","get_falsy_value","get_i128","get_i16","get_i32","get_i64","get_i8","get_local","get_local","get_mangled_name","get_return_local","get_type","get_u128","get_u16","get_u32","get_u64","get_u8","hash","id","id","imports","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","is_exported","is_extern","is_float","is_integer","is_mutable","is_pub","is_pub","is_signed_integer","is_unit","kind","kind","kind","kind","local","locals","methods","mod_id","module_id","modules","modules","modules","mutable","name","name","name","name","name_to_idx","new","parent_ids","partial_cmp","partial_cmp","partial_cmp","partial_cmp","partial_cmp","partial_cmp","program_id","projection","scalar_int","span","span","span","span","span","span","span","statements","structs","structs","structs","symbols","symbols","targets","temp","terminator","terminator_span","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_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","top_level_module_names","top_level_modules","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_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","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_info","types","types","values","variants","field_idx","index","value","args","destination","discriminator","func","target","targets","ScalarInt","borrow","borrow_mut","clone","clone_into","cmp","data","eq","fmt","from","hash","into","partial_cmp","sign_extend","size","size","to_owned","truncate","try_from","try_from_int","try_into","type_id"],"q":[[0,"edlang_ir"],[583,"edlang_ir::PlaceElem"],[586,"edlang_ir::Terminator"],[592,"edlang_ir::scalar_int"],[614,"core::cmp"],[615,"core::fmt"],[616,"core::fmt"],[617,"core::option"],[618,"alloc::string"],[619,"core::hash"],[620,"edlang_span"],[621,"core::result"],[622,"core::any"],[623,"core::convert"]],"d":["","","struct field or enum variant","","","","","","","","","","","","","","","","","","","","","","","","","Definition id.","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","Used for ifs, match","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","Constants defined in this module.","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","The function signatures.","","This stores all the functions from all modules","Functions defined in this module.","","","","","","","","","","","","","","","","","","","","","","","","","Imported items. symbol -> id","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","","","","","","","","","","","","","","","","","","","","All the modules in a flat map.","Submodules defined in this module.","","","","","","","","","","","","","","","","","","","","","","","","","","","","Structs defined in this module.","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","The top level modules.","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","Types defined in this module.","","","","","","The arguments.","The place in memory to store the return value of the …","","The function to call.","What basic block to jump to after the function call, if …","","","","","","","","","","","Returns the argument unchanged.","","Calls U::from(self).","","","Size in bytes","Size in bytes","","Truncates value to self bits.","","","",""],"i":[28,0,0,29,11,13,0,0,24,28,28,28,0,17,31,23,14,24,17,31,0,27,0,0,25,25,0,0,27,28,28,20,31,20,31,27,17,0,17,28,28,18,31,18,31,18,31,18,31,18,31,27,17,0,18,31,28,23,0,0,24,0,28,0,25,28,28,30,30,28,0,29,0,0,0,17,0,17,24,28,14,11,28,28,17,0,0,13,13,17,31,17,28,14,0,0,14,11,0,0,0,19,31,19,31,19,31,19,31,19,31,17,0,0,24,17,14,24,19,22,0,22,5,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,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,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,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,4,16,17,18,19,20,1,3,10,5,6,7,1,2,4,4,16,17,18,19,20,3,2,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,17,18,19,20,21,22,23,24,25,26,27,28,29,30,31,5,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,2,1,2,3,5,17,17,17,17,17,17,17,17,17,17,24,25,5,5,23,17,17,17,17,17,4,4,8,3,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,5,5,17,17,10,5,6,17,17,10,12,16,21,26,5,1,6,3,1,2,3,10,3,5,6,7,6,10,3,4,16,17,18,19,20,4,26,0,3,6,8,10,12,16,21,9,1,2,3,1,3,15,10,9,9,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,17,2,2,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,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,7,10,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,21,1,3,15,6,51,52,53,54,54,55,54,54,55,0,46,46,46,46,46,46,46,46,46,46,46,46,0,46,46,46,0,46,46,46,46],"f":"```````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````{ce{}{}}0000000000000000000000000000000000000000000000000000000000000{bb}{dd}{ff}{hh}{jj}{ll}{nn}{A`A`}{AbAb}{AdAd}{AfAf}{AhAh}{AjAj}{AlAl}{AnAn}{B`B`}{BbBb}{BdBd}{BfBf}{BhBh}{BjBj}{BlBl}{BnBn}{C`C`}{CbCb}{CdCd}{CfCf}{ChCh}{CjCj}{ClCl}{CnCn}{{ce}D`{}{}}000000000000000000000000000000{{hh}Db}{{B`B`}Db}{{BbBb}Db}{{BdBd}Db}{{BfBf}Db}{{BhBh}Db}``````{{}b}{{}d}{{}h}{{hh}Dd}{{B`B`}Dd}{{BbBb}Dd}{{BdBd}Dd}{{BfBf}Dd}{{BhBh}Dd}``{{bDf}Dh}{{dDf}Dh}{{fDf}Dh}{{hDf}Dh}{{jDf}Dh}{{lDf}Dh}{{nDf}Dh}{{A`Df}Dh}{{AbDf}Dh}{{AdDf}Dh}{{AfDf}Dh}{{AhDf}Dh}{{AjDf}Dh}{{AlDf}Dh}{{AnDf}Dh}{{B`Df}Dh}{{BbDf}Dh}0{{BdDf}Dh}{{BfDf}Dh}{{BhDf}Dh}{{BjDf}Dh}{{BlDf}Dh}{{BnDf}Dh}{{C`Df}Dh}{{CbDf}Dh}{{CdDf}Dh}{{CfDf}Dh}{{ChDf}Dh}{{CjDf}Dh}{{ClDf}Dh}{{CnDf}Dh}`{cc{}}000000000000000000000000000000````{j{{Dl{{Dj{Ad}}}}}}{{}Bb}000{BbBn}11111{C`{{E`{Dn}}}}{Cb{{E`{Dn}}}}{jEb}{jAd}{BnBb}66666{{hc}D`Ed}```{ce{}{}}000000000000000000000000000000``{BbDd}0{AdDd}``11``````````````````{{{E`{Ef}}AfB`{E`{Eb}}Dd}Ad}`{{hh}{{E`{Db}}}}{{B`B`}{{E`{Db}}}}{{BbBb}{{E`{Db}}}}{{BdBd}{{E`{Db}}}}{{BfBf}{{E`{Db}}}}{{BhBh}{{E`{Db}}}}`````````````````{BbAd}``:::::::::::::::::::::::::::::::{cEb{}}``{c{{Eh{e}}}{}{}}0000000000000000000000000000000000000000000000000000000000000``{cEj{}}000000000000000000000000000000```````````````=={ElEl}{{ce}D`{}{}}{{ElEl}Db}`{{ElEl}Dd}{{ElDf}Dh}{cc{}}{{Elc}D`Ed}{ce{}{}}{{ElEl}{{E`{Db}}}}{{EnF`}F`}{ElEn}`31<{{cEn}{{E`{El}}}{{Fd{Fb}}}}=<","c":[],"p":[[5,"SymbolTable",0],[5,"ProgramBody",0],[5,"ModuleBody",0],[5,"DefId",0],[5,"Body",0],[5,"AdtBody",0],[5,"AdtVariant",0],[5,"DebugInfo",0],[5,"BasicBlock",0],[5,"Local",0],[6,"LocalKind",0],[5,"Statement",0],[6,"StatementKind",0],[6,"Terminator",0],[5,"SwitchTarget",0],[5,"TypeInfo",0],[6,"TypeKind",0],[6,"IntTy",0],[6,"UintTy",0],[6,"FloatTy",0],[5,"ConstData",0],[6,"ConstKind",0],[6,"ValueTree",0],[6,"RValue",0],[6,"Operand",0],[5,"Place",0],[6,"PlaceElem",0],[6,"BinOp",0],[6,"LogicalOp",0],[6,"UnOp",0],[6,"ConstValue",0],[1,"unit"],[6,"Ordering",614],[1,"bool"],[5,"Formatter",615],[8,"Result",615],[1,"array"],[5,"SmallVec",616],[1,"usize"],[6,"Option",617],[5,"String",618],[10,"Hasher",619],[5,"Span",620],[6,"Result",621],[5,"TypeId",622],[5,"ScalarInt",592],[1,"u64"],[1,"u128"],[1,"i128"],[10,"Into",623],[15,"Field",583],[15,"ConstIndex",583],[15,"Index",583],[15,"Call",586],[15,"SwitchInt",586]],"b":[[286,"impl-Display-for-TypeKind"],[287,"impl-Debug-for-TypeKind"]]}],\ ["edlang_lowering",{"doc":"","t":"CHHPPPPPGPPPPPPPPNNNNNNNNNNNNNOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOO","n":["errors","lower_modules","lower_type","BorrowNotMutable","CantTakeMutableBorrow","FunctionNotFound","IdNotFound","ImportNotFound","LoweringError","ModuleNotFound","NotMutable","NotMutableSelf","NotYetImplemented","ParamCountMismatch","UnexpectedType","UnrecognizedType","UseOfUndeclaredVariable","borrow","borrow_mut","clone","clone_into","fmt","fmt","from","into","to_owned","to_string","try_from","try_into","type_id","declare_span","declare_span","expected","file_id","file_id","file_id","file_id","file_id","file_id","file_id","file_id","file_id","file_id","file_id","file_id","file_id","found","function","has_args","id","import_span","message","module","module_span","name","name","name","needs","path_span","span","span","span","span","span","span","span","span","span","span","span","span","symbol","type_span"],"q":[[0,"edlang_lowering"],[3,"edlang_lowering::errors"],[30,"edlang_lowering::errors::LoweringError"],[73,"edlang_ast"],[74,"edlang_ir"],[75,"core::result"],[76,"edlang_ast"],[77,"core::fmt"],[78,"core::any"]],"d":["","","","","","","","","","","","","","","","","","","","","","","","Returns the argument unchanged.","Calls U::from(self).","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","",""],"i":[0,0,0,4,4,4,4,4,0,4,4,4,4,4,4,4,4,4,4,4,4,4,4,4,4,4,4,4,4,4,14,15,16,17,18,19,20,21,22,23,16,24,25,14,15,26,16,18,25,22,19,23,17,19,20,21,24,25,26,17,18,20,21,22,23,16,24,25,14,15,26,19,20],"f":"`{{{d{b}}}{{j{fh}}}}```````````````{ce{}{}}0{hh}{{ce}Ab{}{}}{{hAd}Af}0{cc{}}44{cAh{}}{c{{j{e}}}{}{}}0{cAj{}}```````````````````````````````````````````","c":[],"p":[[5,"Module",73],[1,"slice"],[5,"ProgramBody",74],[6,"LoweringError",3],[6,"Result",75],[6,"Type",73],[5,"DefId",74],[5,"TypeInfo",74],[1,"unit"],[5,"Formatter",76],[8,"Result",76],[5,"String",77],[5,"TypeId",78],[15,"NotMutable",30],[15,"CantTakeMutableBorrow",30],[15,"UnexpectedType",30],[15,"ModuleNotFound",30],[15,"FunctionNotFound",30],[15,"ImportNotFound",30],[15,"BorrowNotMutable",30],[15,"UnrecognizedType",30],[15,"IdNotFound",30],[15,"NotYetImplemented",30],[15,"UseOfUndeclaredVariable",30],[15,"ParamCountMismatch",30],[15,"NotMutableSelf",30]],"b":[[21,"impl-Display-for-LoweringError"],[22,"impl-Debug-for-LoweringError"]]}],\ -["edlang_parser",{"doc":"","t":"CHCCHHCIPPPPPOOOOOOOCFFFFFFFFKNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNMNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNPPFGPINNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPGPPPPPPPPPPPPPPPPPPPPPPPGPNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNN","n":["error","error_to_report","grammar","lexer","parse_ast","print_report","tokens","Error","ExtraToken","InvalidToken","UnrecognizedEof","UnrecognizedToken","User","error","expected","expected","location","location","token","token","grammar","BinaryFirstLvlOpParser","BinarySecondLvlOpParser","BinaryThirdLvlOpParser","ModuleParser","PathSegmentsParser","StructImplParser","TopLevelModuleParser","UnaryOpParser","__ToTriple","attr","attr","attr","attr","attr","attr","attr","attr","bg","bg","bg","bg","bg","bg","bg","bg","black","black","black","black","black","black","black","black","blink","blink","blink","blink","blink","blink","blink","blink","blue","blue","blue","blue","blue","blue","blue","blue","bold","bold","bold","bold","bold","bold","bold","bold","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","bright","bright","bright","bright","bright","bright","bright","bright","bright_black","bright_black","bright_black","bright_black","bright_black","bright_black","bright_black","bright_black","bright_blue","bright_blue","bright_blue","bright_blue","bright_blue","bright_blue","bright_blue","bright_blue","bright_cyan","bright_cyan","bright_cyan","bright_cyan","bright_cyan","bright_cyan","bright_cyan","bright_cyan","bright_green","bright_green","bright_green","bright_green","bright_green","bright_green","bright_green","bright_green","bright_magenta","bright_magenta","bright_magenta","bright_magenta","bright_magenta","bright_magenta","bright_magenta","bright_magenta","bright_red","bright_red","bright_red","bright_red","bright_red","bright_red","bright_red","bright_red","bright_white","bright_white","bright_white","bright_white","bright_white","bright_white","bright_white","bright_white","bright_yellow","bright_yellow","bright_yellow","bright_yellow","bright_yellow","bright_yellow","bright_yellow","bright_yellow","clear","clear","clear","clear","clear","clear","clear","clear","conceal","conceal","conceal","conceal","conceal","conceal","conceal","conceal","cyan","cyan","cyan","cyan","cyan","cyan","cyan","cyan","default","default","default","default","default","default","default","default","dim","dim","dim","dim","dim","dim","dim","dim","fg","fg","fg","fg","fg","fg","fg","fg","fixed","fixed","fixed","fixed","fixed","fixed","fixed","fixed","from","from","from","from","from","from","from","from","green","green","green","green","green","green","green","green","into","into","into","into","into","into","into","into","invert","invert","invert","invert","invert","invert","invert","invert","italic","italic","italic","italic","italic","italic","italic","italic","linger","linger","linger","linger","linger","linger","linger","linger","magenta","magenta","magenta","magenta","magenta","magenta","magenta","magenta","mask","mask","mask","mask","mask","mask","mask","mask","new","new","new","new","new","new","new","new","on_black","on_black","on_black","on_black","on_black","on_black","on_black","on_black","on_blue","on_blue","on_blue","on_blue","on_blue","on_blue","on_blue","on_blue","on_bright","on_bright","on_bright","on_bright","on_bright","on_bright","on_bright","on_bright","on_bright_black","on_bright_black","on_bright_black","on_bright_black","on_bright_black","on_bright_black","on_bright_black","on_bright_black","on_bright_blue","on_bright_blue","on_bright_blue","on_bright_blue","on_bright_blue","on_bright_blue","on_bright_blue","on_bright_blue","on_bright_cyan","on_bright_cyan","on_bright_cyan","on_bright_cyan","on_bright_cyan","on_bright_cyan","on_bright_cyan","on_bright_cyan","on_bright_green","on_bright_green","on_bright_green","on_bright_green","on_bright_green","on_bright_green","on_bright_green","on_bright_green","on_bright_magenta","on_bright_magenta","on_bright_magenta","on_bright_magenta","on_bright_magenta","on_bright_magenta","on_bright_magenta","on_bright_magenta","on_bright_red","on_bright_red","on_bright_red","on_bright_red","on_bright_red","on_bright_red","on_bright_red","on_bright_red","on_bright_white","on_bright_white","on_bright_white","on_bright_white","on_bright_white","on_bright_white","on_bright_white","on_bright_white","on_bright_yellow","on_bright_yellow","on_bright_yellow","on_bright_yellow","on_bright_yellow","on_bright_yellow","on_bright_yellow","on_bright_yellow","on_cyan","on_cyan","on_cyan","on_cyan","on_cyan","on_cyan","on_cyan","on_cyan","on_fixed","on_fixed","on_fixed","on_fixed","on_fixed","on_fixed","on_fixed","on_fixed","on_green","on_green","on_green","on_green","on_green","on_green","on_green","on_green","on_magenta","on_magenta","on_magenta","on_magenta","on_magenta","on_magenta","on_magenta","on_magenta","on_primary","on_primary","on_primary","on_primary","on_primary","on_primary","on_primary","on_primary","on_red","on_red","on_red","on_red","on_red","on_red","on_red","on_red","on_rgb","on_rgb","on_rgb","on_rgb","on_rgb","on_rgb","on_rgb","on_rgb","on_white","on_white","on_white","on_white","on_white","on_white","on_white","on_white","on_yellow","on_yellow","on_yellow","on_yellow","on_yellow","on_yellow","on_yellow","on_yellow","parse","parse","parse","parse","parse","parse","parse","parse","primary","primary","primary","primary","primary","primary","primary","primary","quirk","quirk","quirk","quirk","quirk","quirk","quirk","quirk","rapid_blink","rapid_blink","rapid_blink","rapid_blink","rapid_blink","rapid_blink","rapid_blink","rapid_blink","red","red","red","red","red","red","red","red","resetting","resetting","resetting","resetting","resetting","resetting","resetting","resetting","rgb","rgb","rgb","rgb","rgb","rgb","rgb","rgb","strike","strike","strike","strike","strike","strike","strike","strike","to_triple","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","underline","underline","underline","underline","underline","underline","underline","underline","whenever","whenever","whenever","whenever","whenever","whenever","whenever","whenever","white","white","white","white","white","white","white","white","wrap","wrap","wrap","wrap","wrap","wrap","wrap","wrap","yellow","yellow","yellow","yellow","yellow","yellow","yellow","yellow","Err","InvalidToken","Lexer","LexicalError","Ok","Spanned","attr","attr","bg","bg","black","black","blink","blink","blue","blue","bold","bold","borrow","borrow","borrow_mut","borrow_mut","bright","bright","bright_black","bright_black","bright_blue","bright_blue","bright_cyan","bright_cyan","bright_green","bright_green","bright_magenta","bright_magenta","bright_red","bright_red","bright_white","bright_white","bright_yellow","bright_yellow","clear","clear","clone","clone_into","conceal","conceal","cyan","cyan","dim","dim","fg","fg","fixed","fixed","fmt","fmt","from","from","green","green","into","into","into_iter","invert","invert","italic","italic","linger","linger","magenta","magenta","mask","mask","new","next","on_black","on_black","on_blue","on_blue","on_bright","on_bright","on_bright_black","on_bright_black","on_bright_blue","on_bright_blue","on_bright_cyan","on_bright_cyan","on_bright_green","on_bright_green","on_bright_magenta","on_bright_magenta","on_bright_red","on_bright_red","on_bright_white","on_bright_white","on_bright_yellow","on_bright_yellow","on_cyan","on_cyan","on_fixed","on_fixed","on_green","on_green","on_magenta","on_magenta","on_primary","on_primary","on_red","on_red","on_rgb","on_rgb","on_white","on_white","on_yellow","on_yellow","primary","primary","quirk","quirk","rapid_blink","rapid_blink","red","red","resetting","resetting","rgb","rgb","strike","strike","to_owned","to_string","try_from","try_from","try_into","try_into","type_id","type_id","underline","underline","whenever","whenever","white","white","wrap","wrap","yellow","yellow","Arrow","Assign","Boolean","Colon","Coma","Dot","DoubleColon","Identifier","Integer","KeywordAs","KeywordConst","KeywordElse","KeywordExported","KeywordExtern","KeywordFn","KeywordFor","KeywordIf","KeywordImpl","KeywordIn","KeywordLet","KeywordMatch","KeywordMod","KeywordMut","KeywordPub","KeywordReturn","KeywordStruct","KeywordUse","KeywordWhile","LeftBracket","LeftParen","LeftSquareBracket","LessThanEqSign","LessThanSign","LexingError","MoreThanEqSign","MoreThanSign","NumberParseError","OperatorAdd","OperatorAnd","OperatorBitwiseAnd","OperatorBitwiseNot","OperatorBitwiseOr","OperatorBitwiseXor","OperatorDiv","OperatorEq","OperatorMul","OperatorNe","OperatorNot","OperatorOr","OperatorRem","OperatorSub","Other","RightBracket","RightParen","RightSquareBracket","Semicolon","String","Token","TwoDots","attr","attr","bg","bg","black","black","blink","blink","blue","blue","bold","bold","borrow","borrow","borrow_mut","borrow_mut","bright","bright","bright_black","bright_black","bright_blue","bright_blue","bright_cyan","bright_cyan","bright_green","bright_green","bright_magenta","bright_magenta","bright_red","bright_red","bright_white","bright_white","bright_yellow","bright_yellow","clear","clear","clone","clone","clone_into","clone_into","conceal","conceal","cyan","cyan","default","dim","dim","eq","eq","fg","fg","fixed","fixed","fmt","fmt","from","from","from","from","green","green","into","into","invert","invert","italic","italic","lex","linger","linger","magenta","magenta","mask","mask","on_black","on_black","on_blue","on_blue","on_bright","on_bright","on_bright_black","on_bright_black","on_bright_blue","on_bright_blue","on_bright_cyan","on_bright_cyan","on_bright_green","on_bright_green","on_bright_magenta","on_bright_magenta","on_bright_red","on_bright_red","on_bright_white","on_bright_white","on_bright_yellow","on_bright_yellow","on_cyan","on_cyan","on_fixed","on_fixed","on_green","on_green","on_magenta","on_magenta","on_primary","on_primary","on_red","on_red","on_rgb","on_rgb","on_white","on_white","on_yellow","on_yellow","primary","primary","quirk","quirk","rapid_blink","rapid_blink","red","red","resetting","resetting","rgb","rgb","strike","strike","to_owned","to_owned","try_from","try_from","try_into","try_into","type_id","type_id","underline","underline","whenever","whenever","white","white","wrap","wrap","yellow","yellow"],"q":[[0,"edlang_parser"],[7,"edlang_parser::error"],[13,"edlang_parser::error::Error"],[20,"edlang_parser::grammar"],[21,"edlang_parser::grammar::grammar"],[583,"edlang_parser::lexer"],[730,"edlang_parser::tokens"],[935,"core::ops::range"],[936,"ariadne"],[937,"std::io::error"],[938,"core::result"],[939,"edlang_ast"],[940,"lalrpop_util"],[941,"yansi::attr_quirk"],[942,"yansi::paint"],[943,"yansi::color"],[944,"edlang_ast"],[945,"edlang_ast"],[946,"edlang_ast"],[947,"yansi::condition"],[948,"core::fmt"],[949,"core::fmt"],[950,"alloc::string"],[951,"core::num::error"],[952,"core::convert"],[953,"logos::lexer"]],"d":["","","","","","","","","Generated by the parser when it encounters additional, …","Generated by the parser when it encounters a token (or …","Generated by the parser when it encounters an EOF it did …","Generated by the parser when it encounters a token it did …","Custom error type.","","The set of expected tokens: these names are taken from the …","The set of expected tokens: these names are taken from the …","","The end of the final token","The unexpected token of type T with a span given by the …","","","","","","","","","","","","Enables the styling Attribute value.","Enables the styling Attribute value.","Enables the styling Attribute value.","Enables the styling Attribute value.","Enables the styling Attribute value.","Enables the styling Attribute value.","Enables the styling Attribute value.","Enables the styling Attribute value.","Returns a styled value derived from self with the …","Returns a styled value derived from self with the …","Returns a styled value derived from self with the …","Returns a styled value derived from self with the …","Returns a styled value derived from self with the …","Returns a styled value derived from self with the …","Returns a styled value derived from self with the …","Returns a styled value derived from self with the …","Returns self with the fg() set to Color::Black.","Returns self with the fg() set to Color::Black.","Returns self with the fg() set to Color::Black.","Returns self with the fg() set to Color::Black.","Returns self with the fg() set to Color::Black.","Returns self with the fg() set to Color::Black.","Returns self with the fg() set to Color::Black.","Returns self with the fg() set to Color::Black.","Returns self with the attr() set to Attribute::Blink.","Returns self with the attr() set to Attribute::Blink.","Returns self with the attr() set to Attribute::Blink.","Returns self with the attr() set to Attribute::Blink.","Returns self with the attr() set to Attribute::Blink.","Returns self with the attr() set to Attribute::Blink.","Returns self with the attr() set to Attribute::Blink.","Returns self with the attr() set to Attribute::Blink.","Returns self with the fg() set to Color::Blue.","Returns self with the fg() set to Color::Blue.","Returns self with the fg() set to Color::Blue.","Returns self with the fg() set to Color::Blue.","Returns self with the fg() set to Color::Blue.","Returns self with the fg() set to Color::Blue.","Returns self with the fg() set to Color::Blue.","Returns self with the fg() set to Color::Blue.","Returns self with the attr() set to Attribute::Bold.","Returns self with the attr() set to Attribute::Bold.","Returns self with the attr() set to Attribute::Bold.","Returns self with the attr() set to Attribute::Bold.","Returns self with the attr() set to Attribute::Bold.","Returns self with the attr() set to Attribute::Bold.","Returns self with the attr() set to Attribute::Bold.","Returns self with the attr() set to Attribute::Bold.","","","","","","","","","","","","","","","","","Returns self with the quirk() set to Quirk::Bright.","Returns self with the quirk() set to Quirk::Bright.","Returns self with the quirk() set to Quirk::Bright.","Returns self with the quirk() set to Quirk::Bright.","Returns self with the quirk() set to Quirk::Bright.","Returns self with the quirk() set to Quirk::Bright.","Returns self with the quirk() set to Quirk::Bright.","Returns self with the quirk() set to Quirk::Bright.","Returns self with the fg() set to Color::BrightBlack.","Returns self with the fg() set to Color::BrightBlack.","Returns self with the fg() set to Color::BrightBlack.","Returns self with the fg() set to Color::BrightBlack.","Returns self with the fg() set to Color::BrightBlack.","Returns self with the fg() set to Color::BrightBlack.","Returns self with the fg() set to Color::BrightBlack.","Returns self with the fg() set to Color::BrightBlack.","Returns self with the fg() set to Color::BrightBlue.","Returns self with the fg() set to Color::BrightBlue.","Returns self with the fg() set to Color::BrightBlue.","Returns self with the fg() set to Color::BrightBlue.","Returns self with the fg() set to Color::BrightBlue.","Returns self with the fg() set to Color::BrightBlue.","Returns self with the fg() set to Color::BrightBlue.","Returns self with the fg() set to Color::BrightBlue.","Returns self with the fg() set to Color::BrightCyan.","Returns self with the fg() set to Color::BrightCyan.","Returns self with the fg() set to Color::BrightCyan.","Returns self with the fg() set to Color::BrightCyan.","Returns self with the fg() set to Color::BrightCyan.","Returns self with the fg() set to Color::BrightCyan.","Returns self with the fg() set to Color::BrightCyan.","Returns self with the fg() set to Color::BrightCyan.","Returns self with the fg() set to Color::BrightGreen.","Returns self with the fg() set to Color::BrightGreen.","Returns self with the fg() set to Color::BrightGreen.","Returns self with the fg() set to Color::BrightGreen.","Returns self with the fg() set to Color::BrightGreen.","Returns self with the fg() set to Color::BrightGreen.","Returns self with the fg() set to Color::BrightGreen.","Returns self with the fg() set to Color::BrightGreen.","Returns self with the fg() set to Color::BrightMagenta.","Returns self with the fg() set to Color::BrightMagenta.","Returns self with the fg() set to Color::BrightMagenta.","Returns self with the fg() set to Color::BrightMagenta.","Returns self with the fg() set to Color::BrightMagenta.","Returns self with the fg() set to Color::BrightMagenta.","Returns self with the fg() set to Color::BrightMagenta.","Returns self with the fg() set to Color::BrightMagenta.","Returns self with the fg() set to Color::BrightRed.","Returns self with the fg() set to Color::BrightRed.","Returns self with the fg() set to Color::BrightRed.","Returns self with the fg() set to Color::BrightRed.","Returns self with the fg() set to Color::BrightRed.","Returns self with the fg() set to Color::BrightRed.","Returns self with the fg() set to Color::BrightRed.","Returns self with the fg() set to Color::BrightRed.","Returns self with the fg() set to Color::BrightWhite.","Returns self with the fg() set to Color::BrightWhite.","Returns self with the fg() set to Color::BrightWhite.","Returns self with the fg() set to Color::BrightWhite.","Returns self with the fg() set to Color::BrightWhite.","Returns self with the fg() set to Color::BrightWhite.","Returns self with the fg() set to Color::BrightWhite.","Returns self with the fg() set to Color::BrightWhite.","Returns self with the fg() set to Color::BrightYellow.","Returns self with the fg() set to Color::BrightYellow.","Returns self with the fg() set to Color::BrightYellow.","Returns self with the fg() set to Color::BrightYellow.","Returns self with the fg() set to Color::BrightYellow.","Returns self with the fg() set to Color::BrightYellow.","Returns self with the fg() set to Color::BrightYellow.","Returns self with the fg() set to Color::BrightYellow.","Returns self with the quirk() set to Quirk::Clear.","Returns self with the quirk() set to Quirk::Clear.","Returns self with the quirk() set to Quirk::Clear.","Returns self with the quirk() set to Quirk::Clear.","Returns self with the quirk() set to Quirk::Clear.","Returns self with the quirk() set to Quirk::Clear.","Returns self with the quirk() set to Quirk::Clear.","Returns self with the quirk() set to Quirk::Clear.","Returns self with the attr() set to Attribute::Conceal.","Returns self with the attr() set to Attribute::Conceal.","Returns self with the attr() set to Attribute::Conceal.","Returns self with the attr() set to Attribute::Conceal.","Returns self with the attr() set to Attribute::Conceal.","Returns self with the attr() set to Attribute::Conceal.","Returns self with the attr() set to Attribute::Conceal.","Returns self with the attr() set to Attribute::Conceal.","Returns self with the fg() set to Color::Cyan.","Returns self with the fg() set to Color::Cyan.","Returns self with the fg() set to Color::Cyan.","Returns self with the fg() set to Color::Cyan.","Returns self with the fg() set to Color::Cyan.","Returns self with the fg() set to Color::Cyan.","Returns self with the fg() set to Color::Cyan.","Returns self with the fg() set to Color::Cyan.","","","","","","","","","Returns self with the attr() set to Attribute::Dim.","Returns self with the attr() set to Attribute::Dim.","Returns self with the attr() set to Attribute::Dim.","Returns self with the attr() set to Attribute::Dim.","Returns self with the attr() set to Attribute::Dim.","Returns self with the attr() set to Attribute::Dim.","Returns self with the attr() set to Attribute::Dim.","Returns self with the attr() set to Attribute::Dim.","Returns a styled value derived from self with the …","Returns a styled value derived from self with the …","Returns a styled value derived from self with the …","Returns a styled value derived from self with the …","Returns a styled value derived from self with the …","Returns a styled value derived from self with the …","Returns a styled value derived from self with the …","Returns a styled value derived from self with the …","Returns self with the fg() set to Color::Fixed.","Returns self with the fg() set to Color::Fixed.","Returns self with the fg() set to Color::Fixed.","Returns self with the fg() set to Color::Fixed.","Returns self with the fg() set to Color::Fixed.","Returns self with the fg() set to Color::Fixed.","Returns self with the fg() set to Color::Fixed.","Returns self with the fg() set to Color::Fixed.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns self with the fg() set to Color::Green.","Returns self with the fg() set to Color::Green.","Returns self with the fg() set to Color::Green.","Returns self with the fg() set to Color::Green.","Returns self with the fg() set to Color::Green.","Returns self with the fg() set to Color::Green.","Returns self with the fg() set to Color::Green.","Returns self with the fg() set to Color::Green.","Calls U::from(self).","Calls U::from(self).","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 self with the attr() set to Attribute::Invert.","Returns self with the attr() set to Attribute::Invert.","Returns self with the attr() set to Attribute::Invert.","Returns self with the attr() set to Attribute::Invert.","Returns self with the attr() set to Attribute::Invert.","Returns self with the attr() set to Attribute::Invert.","Returns self with the attr() set to Attribute::Invert.","Returns self with the attr() set to Attribute::Invert.","Returns self with the attr() set to Attribute::Italic.","Returns self with the attr() set to Attribute::Italic.","Returns self with the attr() set to Attribute::Italic.","Returns self with the attr() set to Attribute::Italic.","Returns self with the attr() set to Attribute::Italic.","Returns self with the attr() set to Attribute::Italic.","Returns self with the attr() set to Attribute::Italic.","Returns self with the attr() set to Attribute::Italic.","Returns self with the quirk() set to Quirk::Linger.","Returns self with the quirk() set to Quirk::Linger.","Returns self with the quirk() set to Quirk::Linger.","Returns self with the quirk() set to Quirk::Linger.","Returns self with the quirk() set to Quirk::Linger.","Returns self with the quirk() set to Quirk::Linger.","Returns self with the quirk() set to Quirk::Linger.","Returns self with the quirk() set to Quirk::Linger.","Returns self with the fg() set to Color::Magenta.","Returns self with the fg() set to Color::Magenta.","Returns self with the fg() set to Color::Magenta.","Returns self with the fg() set to Color::Magenta.","Returns self with the fg() set to Color::Magenta.","Returns self with the fg() set to Color::Magenta.","Returns self with the fg() set to Color::Magenta.","Returns self with the fg() set to Color::Magenta.","Returns self with the quirk() set to Quirk::Mask.","Returns self with the quirk() set to Quirk::Mask.","Returns self with the quirk() set to Quirk::Mask.","Returns self with the quirk() set to Quirk::Mask.","Returns self with the quirk() set to Quirk::Mask.","Returns self with the quirk() set to Quirk::Mask.","Returns self with the quirk() set to Quirk::Mask.","Returns self with the quirk() set to Quirk::Mask.","","","","","","","","","Returns self with the bg() set to Color::Black.","Returns self with the bg() set to Color::Black.","Returns self with the bg() set to Color::Black.","Returns self with the bg() set to Color::Black.","Returns self with the bg() set to Color::Black.","Returns self with the bg() set to Color::Black.","Returns self with the bg() set to Color::Black.","Returns self with the bg() set to Color::Black.","Returns self with the bg() set to Color::Blue.","Returns self with the bg() set to Color::Blue.","Returns self with the bg() set to Color::Blue.","Returns self with the bg() set to Color::Blue.","Returns self with the bg() set to Color::Blue.","Returns self with the bg() set to Color::Blue.","Returns self with the bg() set to Color::Blue.","Returns self with the bg() set to Color::Blue.","Returns self with the quirk() set to Quirk::OnBright.","Returns self with the quirk() set to Quirk::OnBright.","Returns self with the quirk() set to Quirk::OnBright.","Returns self with the quirk() set to Quirk::OnBright.","Returns self with the quirk() set to Quirk::OnBright.","Returns self with the quirk() set to Quirk::OnBright.","Returns self with the quirk() set to Quirk::OnBright.","Returns self with the quirk() set to Quirk::OnBright.","Returns self with the bg() set to Color::BrightBlack.","Returns self with the bg() set to Color::BrightBlack.","Returns self with the bg() set to Color::BrightBlack.","Returns self with the bg() set to Color::BrightBlack.","Returns self with the bg() set to Color::BrightBlack.","Returns self with the bg() set to Color::BrightBlack.","Returns self with the bg() set to Color::BrightBlack.","Returns self with the bg() set to Color::BrightBlack.","Returns self with the bg() set to Color::BrightBlue.","Returns self with the bg() set to Color::BrightBlue.","Returns self with the bg() set to Color::BrightBlue.","Returns self with the bg() set to Color::BrightBlue.","Returns self with the bg() set to Color::BrightBlue.","Returns self with the bg() set to Color::BrightBlue.","Returns self with the bg() set to Color::BrightBlue.","Returns self with the bg() set to Color::BrightBlue.","Returns self with the bg() set to Color::BrightCyan.","Returns self with the bg() set to Color::BrightCyan.","Returns self with the bg() set to Color::BrightCyan.","Returns self with the bg() set to Color::BrightCyan.","Returns self with the bg() set to Color::BrightCyan.","Returns self with the bg() set to Color::BrightCyan.","Returns self with the bg() set to Color::BrightCyan.","Returns self with the bg() set to Color::BrightCyan.","Returns self with the bg() set to Color::BrightGreen.","Returns self with the bg() set to Color::BrightGreen.","Returns self with the bg() set to Color::BrightGreen.","Returns self with the bg() set to Color::BrightGreen.","Returns self with the bg() set to Color::BrightGreen.","Returns self with the bg() set to Color::BrightGreen.","Returns self with the bg() set to Color::BrightGreen.","Returns self with the bg() set to Color::BrightGreen.","Returns self with the bg() set to Color::BrightMagenta.","Returns self with the bg() set to Color::BrightMagenta.","Returns self with the bg() set to Color::BrightMagenta.","Returns self with the bg() set to Color::BrightMagenta.","Returns self with the bg() set to Color::BrightMagenta.","Returns self with the bg() set to Color::BrightMagenta.","Returns self with the bg() set to Color::BrightMagenta.","Returns self with the bg() set to Color::BrightMagenta.","Returns self with the bg() set to Color::BrightRed.","Returns self with the bg() set to Color::BrightRed.","Returns self with the bg() set to Color::BrightRed.","Returns self with the bg() set to Color::BrightRed.","Returns self with the bg() set to Color::BrightRed.","Returns self with the bg() set to Color::BrightRed.","Returns self with the bg() set to Color::BrightRed.","Returns self with the bg() set to Color::BrightRed.","Returns self with the bg() set to Color::BrightWhite.","Returns self with the bg() set to Color::BrightWhite.","Returns self with the bg() set to Color::BrightWhite.","Returns self with the bg() set to Color::BrightWhite.","Returns self with the bg() set to Color::BrightWhite.","Returns self with the bg() set to Color::BrightWhite.","Returns self with the bg() set to Color::BrightWhite.","Returns self with the bg() set to Color::BrightWhite.","Returns self with the bg() set to Color::BrightYellow.","Returns self with the bg() set to Color::BrightYellow.","Returns self with the bg() set to Color::BrightYellow.","Returns self with the bg() set to Color::BrightYellow.","Returns self with the bg() set to Color::BrightYellow.","Returns self with the bg() set to Color::BrightYellow.","Returns self with the bg() set to Color::BrightYellow.","Returns self with the bg() set to Color::BrightYellow.","Returns self with the bg() set to Color::Cyan.","Returns self with the bg() set to Color::Cyan.","Returns self with the bg() set to Color::Cyan.","Returns self with the bg() set to Color::Cyan.","Returns self with the bg() set to Color::Cyan.","Returns self with the bg() set to Color::Cyan.","Returns self with the bg() set to Color::Cyan.","Returns self with the bg() set to Color::Cyan.","Returns self with the bg() set to Color::Fixed.","Returns self with the bg() set to Color::Fixed.","Returns self with the bg() set to Color::Fixed.","Returns self with the bg() set to Color::Fixed.","Returns self with the bg() set to Color::Fixed.","Returns self with the bg() set to Color::Fixed.","Returns self with the bg() set to Color::Fixed.","Returns self with the bg() set to Color::Fixed.","Returns self with the bg() set to Color::Green.","Returns self with the bg() set to Color::Green.","Returns self with the bg() set to Color::Green.","Returns self with the bg() set to Color::Green.","Returns self with the bg() set to Color::Green.","Returns self with the bg() set to Color::Green.","Returns self with the bg() set to Color::Green.","Returns self with the bg() set to Color::Green.","Returns self with the bg() set to Color::Magenta.","Returns self with the bg() set to Color::Magenta.","Returns self with the bg() set to Color::Magenta.","Returns self with the bg() set to Color::Magenta.","Returns self with the bg() set to Color::Magenta.","Returns self with the bg() set to Color::Magenta.","Returns self with the bg() set to Color::Magenta.","Returns self with the bg() set to Color::Magenta.","Returns self with the bg() set to Color::Primary.","Returns self with the bg() set to Color::Primary.","Returns self with the bg() set to Color::Primary.","Returns self with the bg() set to Color::Primary.","Returns self with the bg() set to Color::Primary.","Returns self with the bg() set to Color::Primary.","Returns self with the bg() set to Color::Primary.","Returns self with the bg() set to Color::Primary.","Returns self with the bg() set to Color::Red.","Returns self with the bg() set to Color::Red.","Returns self with the bg() set to Color::Red.","Returns self with the bg() set to Color::Red.","Returns self with the bg() set to Color::Red.","Returns self with the bg() set to Color::Red.","Returns self with the bg() set to Color::Red.","Returns self with the bg() set to Color::Red.","Returns self with the bg() set to Color::Rgb.","Returns self with the bg() set to Color::Rgb.","Returns self with the bg() set to Color::Rgb.","Returns self with the bg() set to Color::Rgb.","Returns self with the bg() set to Color::Rgb.","Returns self with the bg() set to Color::Rgb.","Returns self with the bg() set to Color::Rgb.","Returns self with the bg() set to Color::Rgb.","Returns self with the bg() set to Color::White.","Returns self with the bg() set to Color::White.","Returns self with the bg() set to Color::White.","Returns self with the bg() set to Color::White.","Returns self with the bg() set to Color::White.","Returns self with the bg() set to Color::White.","Returns self with the bg() set to Color::White.","Returns self with the bg() set to Color::White.","Returns self with the bg() set to Color::Yellow.","Returns self with the bg() set to Color::Yellow.","Returns self with the bg() set to Color::Yellow.","Returns self with the bg() set to Color::Yellow.","Returns self with the bg() set to Color::Yellow.","Returns self with the bg() set to Color::Yellow.","Returns self with the bg() set to Color::Yellow.","Returns self with the bg() set to Color::Yellow.","","","","","","","","","Returns self with the fg() set to Color::Primary.","Returns self with the fg() set to Color::Primary.","Returns self with the fg() set to Color::Primary.","Returns self with the fg() set to Color::Primary.","Returns self with the fg() set to Color::Primary.","Returns self with the fg() set to Color::Primary.","Returns self with the fg() set to Color::Primary.","Returns self with the fg() set to Color::Primary.","Enables the yansi Quirk value.","Enables the yansi Quirk value.","Enables the yansi Quirk value.","Enables the yansi Quirk value.","Enables the yansi Quirk value.","Enables the yansi Quirk value.","Enables the yansi Quirk value.","Enables the yansi Quirk value.","Returns self with the attr() set to Attribute::RapidBlink.","Returns self with the attr() set to Attribute::RapidBlink.","Returns self with the attr() set to Attribute::RapidBlink.","Returns self with the attr() set to Attribute::RapidBlink.","Returns self with the attr() set to Attribute::RapidBlink.","Returns self with the attr() set to Attribute::RapidBlink.","Returns self with the attr() set to Attribute::RapidBlink.","Returns self with the attr() set to Attribute::RapidBlink.","Returns self with the fg() set to Color::Red.","Returns self with the fg() set to Color::Red.","Returns self with the fg() set to Color::Red.","Returns self with the fg() set to Color::Red.","Returns self with the fg() set to Color::Red.","Returns self with the fg() set to Color::Red.","Returns self with the fg() set to Color::Red.","Returns self with the fg() set to Color::Red.","Returns self with the quirk() set to Quirk::Resetting.","Returns self with the quirk() set to Quirk::Resetting.","Returns self with the quirk() set to Quirk::Resetting.","Returns self with the quirk() set to Quirk::Resetting.","Returns self with the quirk() set to Quirk::Resetting.","Returns self with the quirk() set to Quirk::Resetting.","Returns self with the quirk() set to Quirk::Resetting.","Returns self with the quirk() set to Quirk::Resetting.","Returns self with the fg() set to Color::Rgb.","Returns self with the fg() set to Color::Rgb.","Returns self with the fg() set to Color::Rgb.","Returns self with the fg() set to Color::Rgb.","Returns self with the fg() set to Color::Rgb.","Returns self with the fg() set to Color::Rgb.","Returns self with the fg() set to Color::Rgb.","Returns self with the fg() set to Color::Rgb.","Returns self with the attr() set to Attribute::Strike.","Returns self with the attr() set to Attribute::Strike.","Returns self with the attr() set to Attribute::Strike.","Returns self with the attr() set to Attribute::Strike.","Returns self with the attr() set to Attribute::Strike.","Returns self with the attr() set to Attribute::Strike.","Returns self with the attr() set to Attribute::Strike.","Returns self with the attr() set to Attribute::Strike.","","","","","","","","","","","","","","","","","","","","","","","","","","Returns self with the attr() set to Attribute::Underline.","Returns self with the attr() set to Attribute::Underline.","Returns self with the attr() set to Attribute::Underline.","Returns self with the attr() set to Attribute::Underline.","Returns self with the attr() set to Attribute::Underline.","Returns self with the attr() set to Attribute::Underline.","Returns self with the attr() set to Attribute::Underline.","Returns self with the attr() set to Attribute::Underline.","Conditionally enable styling based on whether the Condition…","Conditionally enable styling based on whether the Condition…","Conditionally enable styling based on whether the Condition…","Conditionally enable styling based on whether the Condition…","Conditionally enable styling based on whether the Condition…","Conditionally enable styling based on whether the Condition…","Conditionally enable styling based on whether the Condition…","Conditionally enable styling based on whether the Condition…","Returns self with the fg() set to Color::White.","Returns self with the fg() set to Color::White.","Returns self with the fg() set to Color::White.","Returns self with the fg() set to Color::White.","Returns self with the fg() set to Color::White.","Returns self with the fg() set to Color::White.","Returns self with the fg() set to Color::White.","Returns self with the fg() set to Color::White.","Returns self with the quirk() set to Quirk::Wrap.","Returns self with the quirk() set to Quirk::Wrap.","Returns self with the quirk() set to Quirk::Wrap.","Returns self with the quirk() set to Quirk::Wrap.","Returns self with the quirk() set to Quirk::Wrap.","Returns self with the quirk() set to Quirk::Wrap.","Returns self with the quirk() set to Quirk::Wrap.","Returns self with the quirk() set to Quirk::Wrap.","Returns self with the fg() set to Color::Yellow.","Returns self with the fg() set to Color::Yellow.","Returns self with the fg() set to Color::Yellow.","Returns self with the fg() set to Color::Yellow.","Returns self with the fg() set to Color::Yellow.","Returns self with the fg() set to Color::Yellow.","Returns self with the fg() set to Color::Yellow.","Returns self with the fg() set to Color::Yellow.","Contains the error value","","","","Contains the success value","","Enables the styling Attribute value.","Enables the styling Attribute value.","Returns a styled value derived from self with the …","Returns a styled value derived from self with the …","Returns self with the fg() set to Color::Black.","Returns self with the fg() set to Color::Black.","Returns self with the attr() set to Attribute::Blink.","Returns self with the attr() set to Attribute::Blink.","Returns self with the fg() set to Color::Blue.","Returns self with the fg() set to Color::Blue.","Returns self with the attr() set to Attribute::Bold.","Returns self with the attr() set to Attribute::Bold.","","","","","Returns self with the quirk() set to Quirk::Bright.","Returns self with the quirk() set to Quirk::Bright.","Returns self with the fg() set to Color::BrightBlack.","Returns self with the fg() set to Color::BrightBlack.","Returns self with the fg() set to Color::BrightBlue.","Returns self with the fg() set to Color::BrightBlue.","Returns self with the fg() set to Color::BrightCyan.","Returns self with the fg() set to Color::BrightCyan.","Returns self with the fg() set to Color::BrightGreen.","Returns self with the fg() set to Color::BrightGreen.","Returns self with the fg() set to Color::BrightMagenta.","Returns self with the fg() set to Color::BrightMagenta.","Returns self with the fg() set to Color::BrightRed.","Returns self with the fg() set to Color::BrightRed.","Returns self with the fg() set to Color::BrightWhite.","Returns self with the fg() set to Color::BrightWhite.","Returns self with the fg() set to Color::BrightYellow.","Returns self with the fg() set to Color::BrightYellow.","Returns self with the quirk() set to Quirk::Clear.","Returns self with the quirk() set to Quirk::Clear.","","","Returns self with the attr() set to Attribute::Conceal.","Returns self with the attr() set to Attribute::Conceal.","Returns self with the fg() set to Color::Cyan.","Returns self with the fg() set to Color::Cyan.","Returns self with the attr() set to Attribute::Dim.","Returns self with the attr() set to Attribute::Dim.","Returns a styled value derived from self with the …","Returns a styled value derived from self with the …","Returns self with the fg() set to Color::Fixed.","Returns self with the fg() set to Color::Fixed.","","","Returns the argument unchanged.","Returns the argument unchanged.","Returns self with the fg() set to Color::Green.","Returns self with the fg() set to Color::Green.","Calls U::from(self).","Calls U::from(self).","","Returns self with the attr() set to Attribute::Invert.","Returns self with the attr() set to Attribute::Invert.","Returns self with the attr() set to Attribute::Italic.","Returns self with the attr() set to Attribute::Italic.","Returns self with the quirk() set to Quirk::Linger.","Returns self with the quirk() set to Quirk::Linger.","Returns self with the fg() set to Color::Magenta.","Returns self with the fg() set to Color::Magenta.","Returns self with the quirk() set to Quirk::Mask.","Returns self with the quirk() set to Quirk::Mask.","","","Returns self with the bg() set to Color::Black.","Returns self with the bg() set to Color::Black.","Returns self with the bg() set to Color::Blue.","Returns self with the bg() set to Color::Blue.","Returns self with the quirk() set to Quirk::OnBright.","Returns self with the quirk() set to Quirk::OnBright.","Returns self with the bg() set to Color::BrightBlack.","Returns self with the bg() set to Color::BrightBlack.","Returns self with the bg() set to Color::BrightBlue.","Returns self with the bg() set to Color::BrightBlue.","Returns self with the bg() set to Color::BrightCyan.","Returns self with the bg() set to Color::BrightCyan.","Returns self with the bg() set to Color::BrightGreen.","Returns self with the bg() set to Color::BrightGreen.","Returns self with the bg() set to Color::BrightMagenta.","Returns self with the bg() set to Color::BrightMagenta.","Returns self with the bg() set to Color::BrightRed.","Returns self with the bg() set to Color::BrightRed.","Returns self with the bg() set to Color::BrightWhite.","Returns self with the bg() set to Color::BrightWhite.","Returns self with the bg() set to Color::BrightYellow.","Returns self with the bg() set to Color::BrightYellow.","Returns self with the bg() set to Color::Cyan.","Returns self with the bg() set to Color::Cyan.","Returns self with the bg() set to Color::Fixed.","Returns self with the bg() set to Color::Fixed.","Returns self with the bg() set to Color::Green.","Returns self with the bg() set to Color::Green.","Returns self with the bg() set to Color::Magenta.","Returns self with the bg() set to Color::Magenta.","Returns self with the bg() set to Color::Primary.","Returns self with the bg() set to Color::Primary.","Returns self with the bg() set to Color::Red.","Returns self with the bg() set to Color::Red.","Returns self with the bg() set to Color::Rgb.","Returns self with the bg() set to Color::Rgb.","Returns self with the bg() set to Color::White.","Returns self with the bg() set to Color::White.","Returns self with the bg() set to Color::Yellow.","Returns self with the bg() set to Color::Yellow.","Returns self with the fg() set to Color::Primary.","Returns self with the fg() set to Color::Primary.","Enables the yansi Quirk value.","Enables the yansi Quirk value.","Returns self with the attr() set to Attribute::RapidBlink.","Returns self with the attr() set to Attribute::RapidBlink.","Returns self with the fg() set to Color::Red.","Returns self with the fg() set to Color::Red.","Returns self with the quirk() set to Quirk::Resetting.","Returns self with the quirk() set to Quirk::Resetting.","Returns self with the fg() set to Color::Rgb.","Returns self with the fg() set to Color::Rgb.","Returns self with the attr() set to Attribute::Strike.","Returns self with the attr() set to Attribute::Strike.","","","","","","","","","Returns self with the attr() set to Attribute::Underline.","Returns self with the attr() set to Attribute::Underline.","Conditionally enable styling based on whether the Condition…","Conditionally enable styling based on whether the Condition…","Returns self with the fg() set to Color::White.","Returns self with the fg() set to Color::White.","Returns self with the quirk() set to Quirk::Wrap.","Returns self with the quirk() set to Quirk::Wrap.","Returns self with the fg() set to Color::Yellow.","Returns self with the fg() set to Color::Yellow.","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","Enables the styling Attribute value.","Enables the styling Attribute value.","Returns a styled value derived from self with the …","Returns a styled value derived from self with the …","Returns self with the fg() set to Color::Black.","Returns self with the fg() set to Color::Black.","Returns self with the attr() set to Attribute::Blink.","Returns self with the attr() set to Attribute::Blink.","Returns self with the fg() set to Color::Blue.","Returns self with the fg() set to Color::Blue.","Returns self with the attr() set to Attribute::Bold.","Returns self with the attr() set to Attribute::Bold.","","","","","Returns self with the quirk() set to Quirk::Bright.","Returns self with the quirk() set to Quirk::Bright.","Returns self with the fg() set to Color::BrightBlack.","Returns self with the fg() set to Color::BrightBlack.","Returns self with the fg() set to Color::BrightBlue.","Returns self with the fg() set to Color::BrightBlue.","Returns self with the fg() set to Color::BrightCyan.","Returns self with the fg() set to Color::BrightCyan.","Returns self with the fg() set to Color::BrightGreen.","Returns self with the fg() set to Color::BrightGreen.","Returns self with the fg() set to Color::BrightMagenta.","Returns self with the fg() set to Color::BrightMagenta.","Returns self with the fg() set to Color::BrightRed.","Returns self with the fg() set to Color::BrightRed.","Returns self with the fg() set to Color::BrightWhite.","Returns self with the fg() set to Color::BrightWhite.","Returns self with the fg() set to Color::BrightYellow.","Returns self with the fg() set to Color::BrightYellow.","Returns self with the quirk() set to Quirk::Clear.","Returns self with the quirk() set to Quirk::Clear.","","","","","Returns self with the attr() set to Attribute::Conceal.","Returns self with the attr() set to Attribute::Conceal.","Returns self with the fg() set to Color::Cyan.","Returns self with the fg() set to Color::Cyan.","","Returns self with the attr() set to Attribute::Dim.","Returns self with the attr() set to Attribute::Dim.","","","Returns a styled value derived from self with the …","Returns a styled value derived from self with the …","Returns self with the fg() set to Color::Fixed.","Returns self with the fg() set to Color::Fixed.","","","","","Returns the argument unchanged.","Returns the argument unchanged.","Returns self with the fg() set to Color::Green.","Returns self with the fg() set to Color::Green.","Calls U::from(self).","Calls U::from(self).","Returns self with the attr() set to Attribute::Invert.","Returns self with the attr() set to Attribute::Invert.","Returns self with the attr() set to Attribute::Italic.","Returns self with the attr() set to Attribute::Italic.","","Returns self with the quirk() set to Quirk::Linger.","Returns self with the quirk() set to Quirk::Linger.","Returns self with the fg() set to Color::Magenta.","Returns self with the fg() set to Color::Magenta.","Returns self with the quirk() set to Quirk::Mask.","Returns self with the quirk() set to Quirk::Mask.","Returns self with the bg() set to Color::Black.","Returns self with the bg() set to Color::Black.","Returns self with the bg() set to Color::Blue.","Returns self with the bg() set to Color::Blue.","Returns self with the quirk() set to Quirk::OnBright.","Returns self with the quirk() set to Quirk::OnBright.","Returns self with the bg() set to Color::BrightBlack.","Returns self with the bg() set to Color::BrightBlack.","Returns self with the bg() set to Color::BrightBlue.","Returns self with the bg() set to Color::BrightBlue.","Returns self with the bg() set to Color::BrightCyan.","Returns self with the bg() set to Color::BrightCyan.","Returns self with the bg() set to Color::BrightGreen.","Returns self with the bg() set to Color::BrightGreen.","Returns self with the bg() set to Color::BrightMagenta.","Returns self with the bg() set to Color::BrightMagenta.","Returns self with the bg() set to Color::BrightRed.","Returns self with the bg() set to Color::BrightRed.","Returns self with the bg() set to Color::BrightWhite.","Returns self with the bg() set to Color::BrightWhite.","Returns self with the bg() set to Color::BrightYellow.","Returns self with the bg() set to Color::BrightYellow.","Returns self with the bg() set to Color::Cyan.","Returns self with the bg() set to Color::Cyan.","Returns self with the bg() set to Color::Fixed.","Returns self with the bg() set to Color::Fixed.","Returns self with the bg() set to Color::Green.","Returns self with the bg() set to Color::Green.","Returns self with the bg() set to Color::Magenta.","Returns self with the bg() set to Color::Magenta.","Returns self with the bg() set to Color::Primary.","Returns self with the bg() set to Color::Primary.","Returns self with the bg() set to Color::Red.","Returns self with the bg() set to Color::Red.","Returns self with the bg() set to Color::Rgb.","Returns self with the bg() set to Color::Rgb.","Returns self with the bg() set to Color::White.","Returns self with the bg() set to Color::White.","Returns self with the bg() set to Color::Yellow.","Returns self with the bg() set to Color::Yellow.","Returns self with the fg() set to Color::Primary.","Returns self with the fg() set to Color::Primary.","Enables the yansi Quirk value.","Enables the yansi Quirk value.","Returns self with the attr() set to Attribute::RapidBlink.","Returns self with the attr() set to Attribute::RapidBlink.","Returns self with the fg() set to Color::Red.","Returns self with the fg() set to Color::Red.","Returns self with the quirk() set to Quirk::Resetting.","Returns self with the quirk() set to Quirk::Resetting.","Returns self with the fg() set to Color::Rgb.","Returns self with the fg() set to Color::Rgb.","Returns self with the attr() set to Attribute::Strike.","Returns self with the attr() set to Attribute::Strike.","","","","","","","","","Returns self with the attr() set to Attribute::Underline.","Returns self with the attr() set to Attribute::Underline.","Conditionally enable styling based on whether the Condition…","Conditionally enable styling based on whether the Condition…","Returns self with the fg() set to Color::White.","Returns self with the fg() set to Color::White.","Returns self with the quirk() set to Quirk::Wrap.","Returns self with the quirk() set to Quirk::Wrap.","Returns self with the fg() set to Color::Yellow.","Returns self with the fg() set to Color::Yellow."],"i":[0,0,0,0,0,0,0,0,2,2,2,2,2,47,48,49,50,48,49,51,0,0,0,0,0,0,0,0,0,0,17,18,19,20,21,22,23,24,17,18,19,20,21,22,23,24,17,18,19,20,21,22,23,24,17,18,19,20,21,22,23,24,17,18,19,20,21,22,23,24,17,18,19,20,21,22,23,24,17,18,19,20,21,22,23,24,17,18,19,20,21,22,23,24,17,18,19,20,21,22,23,24,17,18,19,20,21,22,23,24,17,18,19,20,21,22,23,24,17,18,19,20,21,22,23,24,17,18,19,20,21,22,23,24,17,18,19,20,21,22,23,24,17,18,19,20,21,22,23,24,17,18,19,20,21,22,23,24,17,18,19,20,21,22,23,24,17,18,19,20,21,22,23,24,17,18,19,20,21,22,23,24,17,18,19,20,21,22,23,24,17,18,19,20,21,22,23,24,17,18,19,20,21,22,23,24,17,18,19,20,21,22,23,24,17,18,19,20,21,22,23,24,17,18,19,20,21,22,23,24,17,18,19,20,21,22,23,24,17,18,19,20,21,22,23,24,17,18,19,20,21,22,23,24,17,18,19,20,21,22,23,24,17,18,19,20,21,22,23,24,17,18,19,20,21,22,23,24,17,18,19,20,21,22,23,24,17,18,19,20,21,22,23,24,17,18,19,20,21,22,23,24,17,18,19,20,21,22,23,24,17,18,19,20,21,22,23,24,17,18,19,20,21,22,23,24,17,18,19,20,21,22,23,24,17,18,19,20,21,22,23,24,17,18,19,20,21,22,23,24,17,18,19,20,21,22,23,24,17,18,19,20,21,22,23,24,17,18,19,20,21,22,23,24,17,18,19,20,21,22,23,24,17,18,19,20,21,22,23,24,17,18,19,20,21,22,23,24,17,18,19,20,21,22,23,24,17,18,19,20,21,22,23,24,17,18,19,20,21,22,23,24,17,18,19,20,21,22,23,24,17,18,19,20,21,22,23,24,17,18,19,20,21,22,23,24,17,18,19,20,21,22,23,24,17,18,19,20,21,22,23,24,17,18,19,20,21,22,23,24,17,18,19,20,21,22,23,24,17,18,19,20,21,22,23,24,17,18,19,20,21,22,23,24,17,18,19,20,21,22,23,24,17,18,19,20,21,22,23,24,17,18,19,20,21,22,23,24,27,17,18,19,20,21,22,23,24,17,18,19,20,21,22,23,24,17,18,19,20,21,22,23,24,17,18,19,20,21,22,23,24,17,18,19,20,21,22,23,24,17,18,19,20,21,22,23,24,17,18,19,20,21,22,23,24,17,18,19,20,21,22,23,24,52,11,0,0,52,0,39,11,39,11,39,11,39,11,39,11,39,11,39,11,39,11,39,11,39,11,39,11,39,11,39,11,39,11,39,11,39,11,39,11,39,11,11,11,39,11,39,11,39,11,39,11,39,11,11,11,39,11,39,11,39,11,39,39,11,39,11,39,11,39,11,39,11,39,39,39,11,39,11,39,11,39,11,39,11,39,11,39,11,39,11,39,11,39,11,39,11,39,11,39,11,39,11,39,11,39,11,39,11,39,11,39,11,39,11,39,11,39,11,39,11,39,11,39,11,39,11,39,11,11,11,39,11,39,11,39,11,39,11,39,11,39,11,39,11,39,11,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,10,10,10,0,10,10,42,10,10,10,10,10,10,10,10,10,10,10,10,10,10,42,10,10,10,10,10,0,10,42,10,42,10,42,10,42,10,42,10,42,10,42,10,42,10,42,10,42,10,42,10,42,10,42,10,42,10,42,10,42,10,42,10,42,10,42,10,42,10,42,10,42,10,42,42,10,42,10,42,10,42,10,42,10,42,42,42,10,42,10,42,10,42,10,42,10,10,42,10,42,10,42,10,42,10,42,10,42,10,42,10,42,10,42,10,42,10,42,10,42,10,42,10,42,10,42,10,42,10,42,10,42,10,42,10,42,10,42,10,42,10,42,10,42,10,42,10,42,10,42,10,42,10,42,10,42,10,42,10,42,10,42,10,42,10,42,10,42,10,42,10,42,10,42,10],"f":"`{{bd}{{A`{{l{{j{b{h{f}}}}}}n}}}}``{{bb}{{A`{Ab{Ah{fAdAf}}}}}}{{bb{l{{j{b{h{f}}}}}}}{{A`{Ajn}}}}````````````````````````{{cAl}{{An{e}}}{}{}}0000000{{cB`}{{An{e}}}{}{}}0000000{c{{An{e}}}{}{}}0000000000000000000000000000000{ce{}{}}000000000000000111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111{{}Bb}{{}Bd}{{}Bf}{{}Bh}{{}Bj}{{}Bl}{{}Bn}{{}C`}99999999::::::::{{cCb}{{An{e}}}{}{}}0000000{cc{}}0000000;;;;;;;;::::::::;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;98765432;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;11111111;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;{{cCbCbCb}{{An{e}}}{}{}}0000000<<<<<<<<<<<<<<<<{{Bbbe}{{A`{Cd{Ah{fAdAf}}}}}Cf{{Cj{}{{Ch{c}}}}}}{{Bdbe}{{A`{Cd{Ah{fAdAf}}}}}Cf{{Cj{}{{Ch{c}}}}}}{{Bfbe}{{A`{Cd{Ah{fAdAf}}}}}Cf{{Cj{}{{Ch{c}}}}}}{{Bhbe}{{A`{Ab{Ah{fAdAf}}}}}Cf{{Cj{}{{Ch{c}}}}}}{{Bjbe}{{A`{{Cn{Cl}}{Ah{fAdAf}}}}}Cf{{Cj{}{{Ch{c}}}}}}{{Blbe}{{A`{D`{Ah{fAdAf}}}}}Cf{{Cj{}{{Ch{c}}}}}}{{Bnbe}{{A`{Ab{Ah{fAdAf}}}}}Cf{{Cj{}{{Ch{c}}}}}}{{C`be}{{A`{Db{Ah{fAdAf}}}}}Cf{{Cj{}{{Ch{c}}}}}}{c{{An{e}}}{}{}}0000000{{cDd}{{An{e}}}{}{}}0000000111111111111111111111111::::::::11111111{Cf{{A`{{j{fAdf}}{Ah{fAdAf}}}}}}{c{{A`{e}}}{}{}}000000000000000{cDf{}}000000044444444{{cDh}{{An{e}}}{}{}}0000000555555555555555555555555``````{{cAl}{{An{e}}}{}{}}0{{cB`}{{An{e}}}{}{}}077777777{ce{}{}}00088888888888888888888{AfAf}{{ce}Aj{}{}}::::::33{{cCb}{{An{e}}}{}{}}0{{AfDj}Dl}0{cc{}}0==555=========={bDn}{Dn{{E`{c}}}{}}????????????????????????44????????{{cCbCbCb}{{An{e}}}{}{}}0{c{{An{e}}}{}{}}00000{{cDd}{{An{e}}}{}{}}01111112211:{cEb{}}{c{{A`{e}}}{}{}}000{cDf{}}044{{cDh}{{An{e}}}{}{}}0555555```````````````````````````````````````````````````````````{{cAl}{{An{e}}}{}{}}0{{cB`}{{An{e}}}{}{}}077777777{ce{}{}}00088888888888888888888{EdEd}{AdAd}{{ce}Aj{}{}}0;;;;{{}Ed}<<{{EdEd}Ef}{{AdAd}Ef}77{{cCb}{{An{e}}}{}{}}0{{EdDj}Dl}{{AdDj}Dl}{EhEd}{EjEd}{cc{}}0{c{{An{e}}}{}{}}0==0000{{{El{Ad}}}Aj}1111111111111111111111111111117711111111{{cCbCbCb}{{An{e}}}{}{}}0222222{{cDd}{{An{e}}}{}{}}03333331133{ce{}{}}0{c{{A`{e}}}{}{}}000{cDf{}}066{{cDh}{{An{e}}}{}{}}0777777","c":[166,167,168,169,170,171,172,173,623,624,823,824],"p":[[1,"str"],[8,"Error",7],[1,"usize"],[5,"Range",935],[1,"tuple"],[5,"Report",936],[5,"Error",937],[6,"Result",938],[5,"Module",939],[6,"Token",730],[6,"LexicalError",583],[6,"ParseError",940],[1,"unit"],[6,"Attribute",941],[5,"Painted",942],[6,"Color",943],[5,"BinaryFirstLvlOpParser",21],[5,"BinarySecondLvlOpParser",21],[5,"BinaryThirdLvlOpParser",21],[5,"ModuleParser",21],[5,"PathSegmentsParser",21],[5,"StructImplParser",21],[5,"TopLevelModuleParser",21],[5,"UnaryOpParser",21],[1,"u8"],[6,"BinaryOp",939],[10,"__ToTriple",21],[17,"Item"],[10,"IntoIterator",944],[6,"PathSegment",939],[5,"Vec",945],[5,"StructImpl",939],[6,"UnaryOp",939],[6,"Quirk",941],[5,"TypeId",946],[5,"Condition",947],[5,"Formatter",948],[8,"Result",948],[5,"Lexer",583],[6,"Option",949],[5,"String",950],[6,"LexingError",730],[1,"bool"],[5,"ParseIntError",951],[6,"Infallible",952],[5,"Lexer",953],[15,"User",13],[15,"UnrecognizedEof",13],[15,"UnrecognizedToken",13],[15,"InvalidToken",13],[15,"ExtraToken",13],[8,"Spanned",583]],"b":[[637,"impl-Debug-for-LexicalError"],[638,"impl-Display-for-LexicalError"],[844,"impl-From%3CParseIntError%3E-for-LexingError"],[845,"impl-From%3CInfallible%3E-for-LexingError"]]}],\ +["edlang_parser",{"doc":"","t":"CHCCHHCIPPPPPOOOOOOOCFFFFFFFFKNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNMNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNPPFGPINNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPGPPPPPPPPPPPPPPPPPPPPPPPGPNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNN","n":["error","error_to_report","grammar","lexer","parse_ast","print_report","tokens","Error","ExtraToken","InvalidToken","UnrecognizedEof","UnrecognizedToken","User","error","expected","expected","location","location","token","token","grammar","BinaryFirstLvlOpParser","BinarySecondLvlOpParser","BinaryThirdLvlOpParser","ModuleParser","PathSegmentsParser","StructImplParser","TopLevelModuleParser","UnaryOpParser","__ToTriple","attr","attr","attr","attr","attr","attr","attr","attr","bg","bg","bg","bg","bg","bg","bg","bg","black","black","black","black","black","black","black","black","blink","blink","blink","blink","blink","blink","blink","blink","blue","blue","blue","blue","blue","blue","blue","blue","bold","bold","bold","bold","bold","bold","bold","bold","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","bright","bright","bright","bright","bright","bright","bright","bright","bright_black","bright_black","bright_black","bright_black","bright_black","bright_black","bright_black","bright_black","bright_blue","bright_blue","bright_blue","bright_blue","bright_blue","bright_blue","bright_blue","bright_blue","bright_cyan","bright_cyan","bright_cyan","bright_cyan","bright_cyan","bright_cyan","bright_cyan","bright_cyan","bright_green","bright_green","bright_green","bright_green","bright_green","bright_green","bright_green","bright_green","bright_magenta","bright_magenta","bright_magenta","bright_magenta","bright_magenta","bright_magenta","bright_magenta","bright_magenta","bright_red","bright_red","bright_red","bright_red","bright_red","bright_red","bright_red","bright_red","bright_white","bright_white","bright_white","bright_white","bright_white","bright_white","bright_white","bright_white","bright_yellow","bright_yellow","bright_yellow","bright_yellow","bright_yellow","bright_yellow","bright_yellow","bright_yellow","clear","clear","clear","clear","clear","clear","clear","clear","conceal","conceal","conceal","conceal","conceal","conceal","conceal","conceal","cyan","cyan","cyan","cyan","cyan","cyan","cyan","cyan","default","default","default","default","default","default","default","default","dim","dim","dim","dim","dim","dim","dim","dim","fg","fg","fg","fg","fg","fg","fg","fg","fixed","fixed","fixed","fixed","fixed","fixed","fixed","fixed","from","from","from","from","from","from","from","from","green","green","green","green","green","green","green","green","into","into","into","into","into","into","into","into","invert","invert","invert","invert","invert","invert","invert","invert","italic","italic","italic","italic","italic","italic","italic","italic","linger","linger","linger","linger","linger","linger","linger","linger","magenta","magenta","magenta","magenta","magenta","magenta","magenta","magenta","mask","mask","mask","mask","mask","mask","mask","mask","new","new","new","new","new","new","new","new","on_black","on_black","on_black","on_black","on_black","on_black","on_black","on_black","on_blue","on_blue","on_blue","on_blue","on_blue","on_blue","on_blue","on_blue","on_bright","on_bright","on_bright","on_bright","on_bright","on_bright","on_bright","on_bright","on_bright_black","on_bright_black","on_bright_black","on_bright_black","on_bright_black","on_bright_black","on_bright_black","on_bright_black","on_bright_blue","on_bright_blue","on_bright_blue","on_bright_blue","on_bright_blue","on_bright_blue","on_bright_blue","on_bright_blue","on_bright_cyan","on_bright_cyan","on_bright_cyan","on_bright_cyan","on_bright_cyan","on_bright_cyan","on_bright_cyan","on_bright_cyan","on_bright_green","on_bright_green","on_bright_green","on_bright_green","on_bright_green","on_bright_green","on_bright_green","on_bright_green","on_bright_magenta","on_bright_magenta","on_bright_magenta","on_bright_magenta","on_bright_magenta","on_bright_magenta","on_bright_magenta","on_bright_magenta","on_bright_red","on_bright_red","on_bright_red","on_bright_red","on_bright_red","on_bright_red","on_bright_red","on_bright_red","on_bright_white","on_bright_white","on_bright_white","on_bright_white","on_bright_white","on_bright_white","on_bright_white","on_bright_white","on_bright_yellow","on_bright_yellow","on_bright_yellow","on_bright_yellow","on_bright_yellow","on_bright_yellow","on_bright_yellow","on_bright_yellow","on_cyan","on_cyan","on_cyan","on_cyan","on_cyan","on_cyan","on_cyan","on_cyan","on_fixed","on_fixed","on_fixed","on_fixed","on_fixed","on_fixed","on_fixed","on_fixed","on_green","on_green","on_green","on_green","on_green","on_green","on_green","on_green","on_magenta","on_magenta","on_magenta","on_magenta","on_magenta","on_magenta","on_magenta","on_magenta","on_primary","on_primary","on_primary","on_primary","on_primary","on_primary","on_primary","on_primary","on_red","on_red","on_red","on_red","on_red","on_red","on_red","on_red","on_rgb","on_rgb","on_rgb","on_rgb","on_rgb","on_rgb","on_rgb","on_rgb","on_white","on_white","on_white","on_white","on_white","on_white","on_white","on_white","on_yellow","on_yellow","on_yellow","on_yellow","on_yellow","on_yellow","on_yellow","on_yellow","parse","parse","parse","parse","parse","parse","parse","parse","primary","primary","primary","primary","primary","primary","primary","primary","quirk","quirk","quirk","quirk","quirk","quirk","quirk","quirk","rapid_blink","rapid_blink","rapid_blink","rapid_blink","rapid_blink","rapid_blink","rapid_blink","rapid_blink","red","red","red","red","red","red","red","red","resetting","resetting","resetting","resetting","resetting","resetting","resetting","resetting","rgb","rgb","rgb","rgb","rgb","rgb","rgb","rgb","strike","strike","strike","strike","strike","strike","strike","strike","to_triple","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","underline","underline","underline","underline","underline","underline","underline","underline","whenever","whenever","whenever","whenever","whenever","whenever","whenever","whenever","white","white","white","white","white","white","white","white","wrap","wrap","wrap","wrap","wrap","wrap","wrap","wrap","yellow","yellow","yellow","yellow","yellow","yellow","yellow","yellow","Err","InvalidToken","Lexer","LexicalError","Ok","Spanned","attr","attr","bg","bg","black","black","blink","blink","blue","blue","bold","bold","borrow","borrow","borrow_mut","borrow_mut","bright","bright","bright_black","bright_black","bright_blue","bright_blue","bright_cyan","bright_cyan","bright_green","bright_green","bright_magenta","bright_magenta","bright_red","bright_red","bright_white","bright_white","bright_yellow","bright_yellow","clear","clear","clone","clone_into","conceal","conceal","cyan","cyan","dim","dim","fg","fg","fixed","fixed","fmt","fmt","from","from","green","green","into","into","into_iter","invert","invert","italic","italic","linger","linger","magenta","magenta","mask","mask","new","next","on_black","on_black","on_blue","on_blue","on_bright","on_bright","on_bright_black","on_bright_black","on_bright_blue","on_bright_blue","on_bright_cyan","on_bright_cyan","on_bright_green","on_bright_green","on_bright_magenta","on_bright_magenta","on_bright_red","on_bright_red","on_bright_white","on_bright_white","on_bright_yellow","on_bright_yellow","on_cyan","on_cyan","on_fixed","on_fixed","on_green","on_green","on_magenta","on_magenta","on_primary","on_primary","on_red","on_red","on_rgb","on_rgb","on_white","on_white","on_yellow","on_yellow","primary","primary","quirk","quirk","rapid_blink","rapid_blink","red","red","resetting","resetting","rgb","rgb","strike","strike","to_owned","to_string","try_from","try_from","try_into","try_into","type_id","type_id","underline","underline","whenever","whenever","white","white","wrap","wrap","yellow","yellow","Arrow","Assign","Boolean","Colon","Coma","Dot","DoubleColon","Identifier","Integer","KeywordAs","KeywordConst","KeywordElse","KeywordExported","KeywordExtern","KeywordFn","KeywordFor","KeywordIf","KeywordImpl","KeywordIn","KeywordLet","KeywordMatch","KeywordMod","KeywordMut","KeywordPub","KeywordReturn","KeywordStruct","KeywordUse","KeywordWhile","LeftBracket","LeftParen","LeftSquareBracket","LessThanEqSign","LessThanSign","LexingError","MoreThanEqSign","MoreThanSign","NumberParseError","OperatorAdd","OperatorAnd","OperatorBitwiseAnd","OperatorBitwiseNot","OperatorBitwiseOr","OperatorBitwiseXor","OperatorDiv","OperatorEq","OperatorMul","OperatorNe","OperatorNot","OperatorOr","OperatorRem","OperatorSub","Other","RightBracket","RightParen","RightSquareBracket","Semicolon","String","Token","TwoDots","attr","attr","bg","bg","black","black","blink","blink","blue","blue","bold","bold","borrow","borrow","borrow_mut","borrow_mut","bright","bright","bright_black","bright_black","bright_blue","bright_blue","bright_cyan","bright_cyan","bright_green","bright_green","bright_magenta","bright_magenta","bright_red","bright_red","bright_white","bright_white","bright_yellow","bright_yellow","clear","clear","clone","clone","clone_into","clone_into","conceal","conceal","cyan","cyan","default","dim","dim","eq","eq","fg","fg","fixed","fixed","fmt","fmt","from","from","from","from","green","green","into","into","invert","invert","italic","italic","lex","linger","linger","magenta","magenta","mask","mask","on_black","on_black","on_blue","on_blue","on_bright","on_bright","on_bright_black","on_bright_black","on_bright_blue","on_bright_blue","on_bright_cyan","on_bright_cyan","on_bright_green","on_bright_green","on_bright_magenta","on_bright_magenta","on_bright_red","on_bright_red","on_bright_white","on_bright_white","on_bright_yellow","on_bright_yellow","on_cyan","on_cyan","on_fixed","on_fixed","on_green","on_green","on_magenta","on_magenta","on_primary","on_primary","on_red","on_red","on_rgb","on_rgb","on_white","on_white","on_yellow","on_yellow","primary","primary","quirk","quirk","rapid_blink","rapid_blink","red","red","resetting","resetting","rgb","rgb","strike","strike","to_owned","to_owned","try_from","try_from","try_into","try_into","type_id","type_id","underline","underline","whenever","whenever","white","white","wrap","wrap","yellow","yellow"],"q":[[0,"edlang_parser"],[7,"edlang_parser::error"],[13,"edlang_parser::error::Error"],[20,"edlang_parser::grammar"],[21,"edlang_parser::grammar::grammar"],[583,"edlang_parser::lexer"],[730,"edlang_parser::tokens"],[935,"core::ops::range"],[936,"ariadne"],[937,"std::io::error"],[938,"core::result"],[939,"edlang_ast"],[940,"lalrpop_util"],[941,"yansi::attr_quirk"],[942,"yansi::paint"],[943,"yansi::color"],[944,"edlang_ast"],[945,"edlang_ast"],[946,"edlang_ast"],[947,"yansi::condition"],[948,"core::fmt"],[949,"core::fmt"],[950,"alloc::string"],[951,"core::convert"],[952,"core::num::error"],[953,"logos::lexer"]],"d":["","","","","","","","","Generated by the parser when it encounters additional, …","Generated by the parser when it encounters a token (or …","Generated by the parser when it encounters an EOF it did …","Generated by the parser when it encounters a token it did …","Custom error type.","","The set of expected tokens: these names are taken from the …","The set of expected tokens: these names are taken from the …","","The end of the final token","The unexpected token of type T with a span given by the …","","","","","","","","","","","","Enables the styling Attribute value.","Enables the styling Attribute value.","Enables the styling Attribute value.","Enables the styling Attribute value.","Enables the styling Attribute value.","Enables the styling Attribute value.","Enables the styling Attribute value.","Enables the styling Attribute value.","Returns a styled value derived from self with the …","Returns a styled value derived from self with the …","Returns a styled value derived from self with the …","Returns a styled value derived from self with the …","Returns a styled value derived from self with the …","Returns a styled value derived from self with the …","Returns a styled value derived from self with the …","Returns a styled value derived from self with the …","Returns self with the fg() set to Color::Black.","Returns self with the fg() set to Color::Black.","Returns self with the fg() set to Color::Black.","Returns self with the fg() set to Color::Black.","Returns self with the fg() set to Color::Black.","Returns self with the fg() set to Color::Black.","Returns self with the fg() set to Color::Black.","Returns self with the fg() set to Color::Black.","Returns self with the attr() set to Attribute::Blink.","Returns self with the attr() set to Attribute::Blink.","Returns self with the attr() set to Attribute::Blink.","Returns self with the attr() set to Attribute::Blink.","Returns self with the attr() set to Attribute::Blink.","Returns self with the attr() set to Attribute::Blink.","Returns self with the attr() set to Attribute::Blink.","Returns self with the attr() set to Attribute::Blink.","Returns self with the fg() set to Color::Blue.","Returns self with the fg() set to Color::Blue.","Returns self with the fg() set to Color::Blue.","Returns self with the fg() set to Color::Blue.","Returns self with the fg() set to Color::Blue.","Returns self with the fg() set to Color::Blue.","Returns self with the fg() set to Color::Blue.","Returns self with the fg() set to Color::Blue.","Returns self with the attr() set to Attribute::Bold.","Returns self with the attr() set to Attribute::Bold.","Returns self with the attr() set to Attribute::Bold.","Returns self with the attr() set to Attribute::Bold.","Returns self with the attr() set to Attribute::Bold.","Returns self with the attr() set to Attribute::Bold.","Returns self with the attr() set to Attribute::Bold.","Returns self with the attr() set to Attribute::Bold.","","","","","","","","","","","","","","","","","Returns self with the quirk() set to Quirk::Bright.","Returns self with the quirk() set to Quirk::Bright.","Returns self with the quirk() set to Quirk::Bright.","Returns self with the quirk() set to Quirk::Bright.","Returns self with the quirk() set to Quirk::Bright.","Returns self with the quirk() set to Quirk::Bright.","Returns self with the quirk() set to Quirk::Bright.","Returns self with the quirk() set to Quirk::Bright.","Returns self with the fg() set to Color::BrightBlack.","Returns self with the fg() set to Color::BrightBlack.","Returns self with the fg() set to Color::BrightBlack.","Returns self with the fg() set to Color::BrightBlack.","Returns self with the fg() set to Color::BrightBlack.","Returns self with the fg() set to Color::BrightBlack.","Returns self with the fg() set to Color::BrightBlack.","Returns self with the fg() set to Color::BrightBlack.","Returns self with the fg() set to Color::BrightBlue.","Returns self with the fg() set to Color::BrightBlue.","Returns self with the fg() set to Color::BrightBlue.","Returns self with the fg() set to Color::BrightBlue.","Returns self with the fg() set to Color::BrightBlue.","Returns self with the fg() set to Color::BrightBlue.","Returns self with the fg() set to Color::BrightBlue.","Returns self with the fg() set to Color::BrightBlue.","Returns self with the fg() set to Color::BrightCyan.","Returns self with the fg() set to Color::BrightCyan.","Returns self with the fg() set to Color::BrightCyan.","Returns self with the fg() set to Color::BrightCyan.","Returns self with the fg() set to Color::BrightCyan.","Returns self with the fg() set to Color::BrightCyan.","Returns self with the fg() set to Color::BrightCyan.","Returns self with the fg() set to Color::BrightCyan.","Returns self with the fg() set to Color::BrightGreen.","Returns self with the fg() set to Color::BrightGreen.","Returns self with the fg() set to Color::BrightGreen.","Returns self with the fg() set to Color::BrightGreen.","Returns self with the fg() set to Color::BrightGreen.","Returns self with the fg() set to Color::BrightGreen.","Returns self with the fg() set to Color::BrightGreen.","Returns self with the fg() set to Color::BrightGreen.","Returns self with the fg() set to Color::BrightMagenta.","Returns self with the fg() set to Color::BrightMagenta.","Returns self with the fg() set to Color::BrightMagenta.","Returns self with the fg() set to Color::BrightMagenta.","Returns self with the fg() set to Color::BrightMagenta.","Returns self with the fg() set to Color::BrightMagenta.","Returns self with the fg() set to Color::BrightMagenta.","Returns self with the fg() set to Color::BrightMagenta.","Returns self with the fg() set to Color::BrightRed.","Returns self with the fg() set to Color::BrightRed.","Returns self with the fg() set to Color::BrightRed.","Returns self with the fg() set to Color::BrightRed.","Returns self with the fg() set to Color::BrightRed.","Returns self with the fg() set to Color::BrightRed.","Returns self with the fg() set to Color::BrightRed.","Returns self with the fg() set to Color::BrightRed.","Returns self with the fg() set to Color::BrightWhite.","Returns self with the fg() set to Color::BrightWhite.","Returns self with the fg() set to Color::BrightWhite.","Returns self with the fg() set to Color::BrightWhite.","Returns self with the fg() set to Color::BrightWhite.","Returns self with the fg() set to Color::BrightWhite.","Returns self with the fg() set to Color::BrightWhite.","Returns self with the fg() set to Color::BrightWhite.","Returns self with the fg() set to Color::BrightYellow.","Returns self with the fg() set to Color::BrightYellow.","Returns self with the fg() set to Color::BrightYellow.","Returns self with the fg() set to Color::BrightYellow.","Returns self with the fg() set to Color::BrightYellow.","Returns self with the fg() set to Color::BrightYellow.","Returns self with the fg() set to Color::BrightYellow.","Returns self with the fg() set to Color::BrightYellow.","Returns self with the quirk() set to Quirk::Clear.","Returns self with the quirk() set to Quirk::Clear.","Returns self with the quirk() set to Quirk::Clear.","Returns self with the quirk() set to Quirk::Clear.","Returns self with the quirk() set to Quirk::Clear.","Returns self with the quirk() set to Quirk::Clear.","Returns self with the quirk() set to Quirk::Clear.","Returns self with the quirk() set to Quirk::Clear.","Returns self with the attr() set to Attribute::Conceal.","Returns self with the attr() set to Attribute::Conceal.","Returns self with the attr() set to Attribute::Conceal.","Returns self with the attr() set to Attribute::Conceal.","Returns self with the attr() set to Attribute::Conceal.","Returns self with the attr() set to Attribute::Conceal.","Returns self with the attr() set to Attribute::Conceal.","Returns self with the attr() set to Attribute::Conceal.","Returns self with the fg() set to Color::Cyan.","Returns self with the fg() set to Color::Cyan.","Returns self with the fg() set to Color::Cyan.","Returns self with the fg() set to Color::Cyan.","Returns self with the fg() set to Color::Cyan.","Returns self with the fg() set to Color::Cyan.","Returns self with the fg() set to Color::Cyan.","Returns self with the fg() set to Color::Cyan.","","","","","","","","","Returns self with the attr() set to Attribute::Dim.","Returns self with the attr() set to Attribute::Dim.","Returns self with the attr() set to Attribute::Dim.","Returns self with the attr() set to Attribute::Dim.","Returns self with the attr() set to Attribute::Dim.","Returns self with the attr() set to Attribute::Dim.","Returns self with the attr() set to Attribute::Dim.","Returns self with the attr() set to Attribute::Dim.","Returns a styled value derived from self with the …","Returns a styled value derived from self with the …","Returns a styled value derived from self with the …","Returns a styled value derived from self with the …","Returns a styled value derived from self with the …","Returns a styled value derived from self with the …","Returns a styled value derived from self with the …","Returns a styled value derived from self with the …","Returns self with the fg() set to Color::Fixed.","Returns self with the fg() set to Color::Fixed.","Returns self with the fg() set to Color::Fixed.","Returns self with the fg() set to Color::Fixed.","Returns self with the fg() set to Color::Fixed.","Returns self with the fg() set to Color::Fixed.","Returns self with the fg() set to Color::Fixed.","Returns self with the fg() set to Color::Fixed.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns self with the fg() set to Color::Green.","Returns self with the fg() set to Color::Green.","Returns self with the fg() set to Color::Green.","Returns self with the fg() set to Color::Green.","Returns self with the fg() set to Color::Green.","Returns self with the fg() set to Color::Green.","Returns self with the fg() set to Color::Green.","Returns self with the fg() set to Color::Green.","Calls U::from(self).","Calls U::from(self).","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 self with the attr() set to Attribute::Invert.","Returns self with the attr() set to Attribute::Invert.","Returns self with the attr() set to Attribute::Invert.","Returns self with the attr() set to Attribute::Invert.","Returns self with the attr() set to Attribute::Invert.","Returns self with the attr() set to Attribute::Invert.","Returns self with the attr() set to Attribute::Invert.","Returns self with the attr() set to Attribute::Invert.","Returns self with the attr() set to Attribute::Italic.","Returns self with the attr() set to Attribute::Italic.","Returns self with the attr() set to Attribute::Italic.","Returns self with the attr() set to Attribute::Italic.","Returns self with the attr() set to Attribute::Italic.","Returns self with the attr() set to Attribute::Italic.","Returns self with the attr() set to Attribute::Italic.","Returns self with the attr() set to Attribute::Italic.","Returns self with the quirk() set to Quirk::Linger.","Returns self with the quirk() set to Quirk::Linger.","Returns self with the quirk() set to Quirk::Linger.","Returns self with the quirk() set to Quirk::Linger.","Returns self with the quirk() set to Quirk::Linger.","Returns self with the quirk() set to Quirk::Linger.","Returns self with the quirk() set to Quirk::Linger.","Returns self with the quirk() set to Quirk::Linger.","Returns self with the fg() set to Color::Magenta.","Returns self with the fg() set to Color::Magenta.","Returns self with the fg() set to Color::Magenta.","Returns self with the fg() set to Color::Magenta.","Returns self with the fg() set to Color::Magenta.","Returns self with the fg() set to Color::Magenta.","Returns self with the fg() set to Color::Magenta.","Returns self with the fg() set to Color::Magenta.","Returns self with the quirk() set to Quirk::Mask.","Returns self with the quirk() set to Quirk::Mask.","Returns self with the quirk() set to Quirk::Mask.","Returns self with the quirk() set to Quirk::Mask.","Returns self with the quirk() set to Quirk::Mask.","Returns self with the quirk() set to Quirk::Mask.","Returns self with the quirk() set to Quirk::Mask.","Returns self with the quirk() set to Quirk::Mask.","","","","","","","","","Returns self with the bg() set to Color::Black.","Returns self with the bg() set to Color::Black.","Returns self with the bg() set to Color::Black.","Returns self with the bg() set to Color::Black.","Returns self with the bg() set to Color::Black.","Returns self with the bg() set to Color::Black.","Returns self with the bg() set to Color::Black.","Returns self with the bg() set to Color::Black.","Returns self with the bg() set to Color::Blue.","Returns self with the bg() set to Color::Blue.","Returns self with the bg() set to Color::Blue.","Returns self with the bg() set to Color::Blue.","Returns self with the bg() set to Color::Blue.","Returns self with the bg() set to Color::Blue.","Returns self with the bg() set to Color::Blue.","Returns self with the bg() set to Color::Blue.","Returns self with the quirk() set to Quirk::OnBright.","Returns self with the quirk() set to Quirk::OnBright.","Returns self with the quirk() set to Quirk::OnBright.","Returns self with the quirk() set to Quirk::OnBright.","Returns self with the quirk() set to Quirk::OnBright.","Returns self with the quirk() set to Quirk::OnBright.","Returns self with the quirk() set to Quirk::OnBright.","Returns self with the quirk() set to Quirk::OnBright.","Returns self with the bg() set to Color::BrightBlack.","Returns self with the bg() set to Color::BrightBlack.","Returns self with the bg() set to Color::BrightBlack.","Returns self with the bg() set to Color::BrightBlack.","Returns self with the bg() set to Color::BrightBlack.","Returns self with the bg() set to Color::BrightBlack.","Returns self with the bg() set to Color::BrightBlack.","Returns self with the bg() set to Color::BrightBlack.","Returns self with the bg() set to Color::BrightBlue.","Returns self with the bg() set to Color::BrightBlue.","Returns self with the bg() set to Color::BrightBlue.","Returns self with the bg() set to Color::BrightBlue.","Returns self with the bg() set to Color::BrightBlue.","Returns self with the bg() set to Color::BrightBlue.","Returns self with the bg() set to Color::BrightBlue.","Returns self with the bg() set to Color::BrightBlue.","Returns self with the bg() set to Color::BrightCyan.","Returns self with the bg() set to Color::BrightCyan.","Returns self with the bg() set to Color::BrightCyan.","Returns self with the bg() set to Color::BrightCyan.","Returns self with the bg() set to Color::BrightCyan.","Returns self with the bg() set to Color::BrightCyan.","Returns self with the bg() set to Color::BrightCyan.","Returns self with the bg() set to Color::BrightCyan.","Returns self with the bg() set to Color::BrightGreen.","Returns self with the bg() set to Color::BrightGreen.","Returns self with the bg() set to Color::BrightGreen.","Returns self with the bg() set to Color::BrightGreen.","Returns self with the bg() set to Color::BrightGreen.","Returns self with the bg() set to Color::BrightGreen.","Returns self with the bg() set to Color::BrightGreen.","Returns self with the bg() set to Color::BrightGreen.","Returns self with the bg() set to Color::BrightMagenta.","Returns self with the bg() set to Color::BrightMagenta.","Returns self with the bg() set to Color::BrightMagenta.","Returns self with the bg() set to Color::BrightMagenta.","Returns self with the bg() set to Color::BrightMagenta.","Returns self with the bg() set to Color::BrightMagenta.","Returns self with the bg() set to Color::BrightMagenta.","Returns self with the bg() set to Color::BrightMagenta.","Returns self with the bg() set to Color::BrightRed.","Returns self with the bg() set to Color::BrightRed.","Returns self with the bg() set to Color::BrightRed.","Returns self with the bg() set to Color::BrightRed.","Returns self with the bg() set to Color::BrightRed.","Returns self with the bg() set to Color::BrightRed.","Returns self with the bg() set to Color::BrightRed.","Returns self with the bg() set to Color::BrightRed.","Returns self with the bg() set to Color::BrightWhite.","Returns self with the bg() set to Color::BrightWhite.","Returns self with the bg() set to Color::BrightWhite.","Returns self with the bg() set to Color::BrightWhite.","Returns self with the bg() set to Color::BrightWhite.","Returns self with the bg() set to Color::BrightWhite.","Returns self with the bg() set to Color::BrightWhite.","Returns self with the bg() set to Color::BrightWhite.","Returns self with the bg() set to Color::BrightYellow.","Returns self with the bg() set to Color::BrightYellow.","Returns self with the bg() set to Color::BrightYellow.","Returns self with the bg() set to Color::BrightYellow.","Returns self with the bg() set to Color::BrightYellow.","Returns self with the bg() set to Color::BrightYellow.","Returns self with the bg() set to Color::BrightYellow.","Returns self with the bg() set to Color::BrightYellow.","Returns self with the bg() set to Color::Cyan.","Returns self with the bg() set to Color::Cyan.","Returns self with the bg() set to Color::Cyan.","Returns self with the bg() set to Color::Cyan.","Returns self with the bg() set to Color::Cyan.","Returns self with the bg() set to Color::Cyan.","Returns self with the bg() set to Color::Cyan.","Returns self with the bg() set to Color::Cyan.","Returns self with the bg() set to Color::Fixed.","Returns self with the bg() set to Color::Fixed.","Returns self with the bg() set to Color::Fixed.","Returns self with the bg() set to Color::Fixed.","Returns self with the bg() set to Color::Fixed.","Returns self with the bg() set to Color::Fixed.","Returns self with the bg() set to Color::Fixed.","Returns self with the bg() set to Color::Fixed.","Returns self with the bg() set to Color::Green.","Returns self with the bg() set to Color::Green.","Returns self with the bg() set to Color::Green.","Returns self with the bg() set to Color::Green.","Returns self with the bg() set to Color::Green.","Returns self with the bg() set to Color::Green.","Returns self with the bg() set to Color::Green.","Returns self with the bg() set to Color::Green.","Returns self with the bg() set to Color::Magenta.","Returns self with the bg() set to Color::Magenta.","Returns self with the bg() set to Color::Magenta.","Returns self with the bg() set to Color::Magenta.","Returns self with the bg() set to Color::Magenta.","Returns self with the bg() set to Color::Magenta.","Returns self with the bg() set to Color::Magenta.","Returns self with the bg() set to Color::Magenta.","Returns self with the bg() set to Color::Primary.","Returns self with the bg() set to Color::Primary.","Returns self with the bg() set to Color::Primary.","Returns self with the bg() set to Color::Primary.","Returns self with the bg() set to Color::Primary.","Returns self with the bg() set to Color::Primary.","Returns self with the bg() set to Color::Primary.","Returns self with the bg() set to Color::Primary.","Returns self with the bg() set to Color::Red.","Returns self with the bg() set to Color::Red.","Returns self with the bg() set to Color::Red.","Returns self with the bg() set to Color::Red.","Returns self with the bg() set to Color::Red.","Returns self with the bg() set to Color::Red.","Returns self with the bg() set to Color::Red.","Returns self with the bg() set to Color::Red.","Returns self with the bg() set to Color::Rgb.","Returns self with the bg() set to Color::Rgb.","Returns self with the bg() set to Color::Rgb.","Returns self with the bg() set to Color::Rgb.","Returns self with the bg() set to Color::Rgb.","Returns self with the bg() set to Color::Rgb.","Returns self with the bg() set to Color::Rgb.","Returns self with the bg() set to Color::Rgb.","Returns self with the bg() set to Color::White.","Returns self with the bg() set to Color::White.","Returns self with the bg() set to Color::White.","Returns self with the bg() set to Color::White.","Returns self with the bg() set to Color::White.","Returns self with the bg() set to Color::White.","Returns self with the bg() set to Color::White.","Returns self with the bg() set to Color::White.","Returns self with the bg() set to Color::Yellow.","Returns self with the bg() set to Color::Yellow.","Returns self with the bg() set to Color::Yellow.","Returns self with the bg() set to Color::Yellow.","Returns self with the bg() set to Color::Yellow.","Returns self with the bg() set to Color::Yellow.","Returns self with the bg() set to Color::Yellow.","Returns self with the bg() set to Color::Yellow.","","","","","","","","","Returns self with the fg() set to Color::Primary.","Returns self with the fg() set to Color::Primary.","Returns self with the fg() set to Color::Primary.","Returns self with the fg() set to Color::Primary.","Returns self with the fg() set to Color::Primary.","Returns self with the fg() set to Color::Primary.","Returns self with the fg() set to Color::Primary.","Returns self with the fg() set to Color::Primary.","Enables the yansi Quirk value.","Enables the yansi Quirk value.","Enables the yansi Quirk value.","Enables the yansi Quirk value.","Enables the yansi Quirk value.","Enables the yansi Quirk value.","Enables the yansi Quirk value.","Enables the yansi Quirk value.","Returns self with the attr() set to Attribute::RapidBlink.","Returns self with the attr() set to Attribute::RapidBlink.","Returns self with the attr() set to Attribute::RapidBlink.","Returns self with the attr() set to Attribute::RapidBlink.","Returns self with the attr() set to Attribute::RapidBlink.","Returns self with the attr() set to Attribute::RapidBlink.","Returns self with the attr() set to Attribute::RapidBlink.","Returns self with the attr() set to Attribute::RapidBlink.","Returns self with the fg() set to Color::Red.","Returns self with the fg() set to Color::Red.","Returns self with the fg() set to Color::Red.","Returns self with the fg() set to Color::Red.","Returns self with the fg() set to Color::Red.","Returns self with the fg() set to Color::Red.","Returns self with the fg() set to Color::Red.","Returns self with the fg() set to Color::Red.","Returns self with the quirk() set to Quirk::Resetting.","Returns self with the quirk() set to Quirk::Resetting.","Returns self with the quirk() set to Quirk::Resetting.","Returns self with the quirk() set to Quirk::Resetting.","Returns self with the quirk() set to Quirk::Resetting.","Returns self with the quirk() set to Quirk::Resetting.","Returns self with the quirk() set to Quirk::Resetting.","Returns self with the quirk() set to Quirk::Resetting.","Returns self with the fg() set to Color::Rgb.","Returns self with the fg() set to Color::Rgb.","Returns self with the fg() set to Color::Rgb.","Returns self with the fg() set to Color::Rgb.","Returns self with the fg() set to Color::Rgb.","Returns self with the fg() set to Color::Rgb.","Returns self with the fg() set to Color::Rgb.","Returns self with the fg() set to Color::Rgb.","Returns self with the attr() set to Attribute::Strike.","Returns self with the attr() set to Attribute::Strike.","Returns self with the attr() set to Attribute::Strike.","Returns self with the attr() set to Attribute::Strike.","Returns self with the attr() set to Attribute::Strike.","Returns self with the attr() set to Attribute::Strike.","Returns self with the attr() set to Attribute::Strike.","Returns self with the attr() set to Attribute::Strike.","","","","","","","","","","","","","","","","","","","","","","","","","","Returns self with the attr() set to Attribute::Underline.","Returns self with the attr() set to Attribute::Underline.","Returns self with the attr() set to Attribute::Underline.","Returns self with the attr() set to Attribute::Underline.","Returns self with the attr() set to Attribute::Underline.","Returns self with the attr() set to Attribute::Underline.","Returns self with the attr() set to Attribute::Underline.","Returns self with the attr() set to Attribute::Underline.","Conditionally enable styling based on whether the Condition…","Conditionally enable styling based on whether the Condition…","Conditionally enable styling based on whether the Condition…","Conditionally enable styling based on whether the Condition…","Conditionally enable styling based on whether the Condition…","Conditionally enable styling based on whether the Condition…","Conditionally enable styling based on whether the Condition…","Conditionally enable styling based on whether the Condition…","Returns self with the fg() set to Color::White.","Returns self with the fg() set to Color::White.","Returns self with the fg() set to Color::White.","Returns self with the fg() set to Color::White.","Returns self with the fg() set to Color::White.","Returns self with the fg() set to Color::White.","Returns self with the fg() set to Color::White.","Returns self with the fg() set to Color::White.","Returns self with the quirk() set to Quirk::Wrap.","Returns self with the quirk() set to Quirk::Wrap.","Returns self with the quirk() set to Quirk::Wrap.","Returns self with the quirk() set to Quirk::Wrap.","Returns self with the quirk() set to Quirk::Wrap.","Returns self with the quirk() set to Quirk::Wrap.","Returns self with the quirk() set to Quirk::Wrap.","Returns self with the quirk() set to Quirk::Wrap.","Returns self with the fg() set to Color::Yellow.","Returns self with the fg() set to Color::Yellow.","Returns self with the fg() set to Color::Yellow.","Returns self with the fg() set to Color::Yellow.","Returns self with the fg() set to Color::Yellow.","Returns self with the fg() set to Color::Yellow.","Returns self with the fg() set to Color::Yellow.","Returns self with the fg() set to Color::Yellow.","Contains the error value","","","","Contains the success value","","Enables the styling Attribute value.","Enables the styling Attribute value.","Returns a styled value derived from self with the …","Returns a styled value derived from self with the …","Returns self with the fg() set to Color::Black.","Returns self with the fg() set to Color::Black.","Returns self with the attr() set to Attribute::Blink.","Returns self with the attr() set to Attribute::Blink.","Returns self with the fg() set to Color::Blue.","Returns self with the fg() set to Color::Blue.","Returns self with the attr() set to Attribute::Bold.","Returns self with the attr() set to Attribute::Bold.","","","","","Returns self with the quirk() set to Quirk::Bright.","Returns self with the quirk() set to Quirk::Bright.","Returns self with the fg() set to Color::BrightBlack.","Returns self with the fg() set to Color::BrightBlack.","Returns self with the fg() set to Color::BrightBlue.","Returns self with the fg() set to Color::BrightBlue.","Returns self with the fg() set to Color::BrightCyan.","Returns self with the fg() set to Color::BrightCyan.","Returns self with the fg() set to Color::BrightGreen.","Returns self with the fg() set to Color::BrightGreen.","Returns self with the fg() set to Color::BrightMagenta.","Returns self with the fg() set to Color::BrightMagenta.","Returns self with the fg() set to Color::BrightRed.","Returns self with the fg() set to Color::BrightRed.","Returns self with the fg() set to Color::BrightWhite.","Returns self with the fg() set to Color::BrightWhite.","Returns self with the fg() set to Color::BrightYellow.","Returns self with the fg() set to Color::BrightYellow.","Returns self with the quirk() set to Quirk::Clear.","Returns self with the quirk() set to Quirk::Clear.","","","Returns self with the attr() set to Attribute::Conceal.","Returns self with the attr() set to Attribute::Conceal.","Returns self with the fg() set to Color::Cyan.","Returns self with the fg() set to Color::Cyan.","Returns self with the attr() set to Attribute::Dim.","Returns self with the attr() set to Attribute::Dim.","Returns a styled value derived from self with the …","Returns a styled value derived from self with the …","Returns self with the fg() set to Color::Fixed.","Returns self with the fg() set to Color::Fixed.","","","Returns the argument unchanged.","Returns the argument unchanged.","Returns self with the fg() set to Color::Green.","Returns self with the fg() set to Color::Green.","Calls U::from(self).","Calls U::from(self).","","Returns self with the attr() set to Attribute::Invert.","Returns self with the attr() set to Attribute::Invert.","Returns self with the attr() set to Attribute::Italic.","Returns self with the attr() set to Attribute::Italic.","Returns self with the quirk() set to Quirk::Linger.","Returns self with the quirk() set to Quirk::Linger.","Returns self with the fg() set to Color::Magenta.","Returns self with the fg() set to Color::Magenta.","Returns self with the quirk() set to Quirk::Mask.","Returns self with the quirk() set to Quirk::Mask.","","","Returns self with the bg() set to Color::Black.","Returns self with the bg() set to Color::Black.","Returns self with the bg() set to Color::Blue.","Returns self with the bg() set to Color::Blue.","Returns self with the quirk() set to Quirk::OnBright.","Returns self with the quirk() set to Quirk::OnBright.","Returns self with the bg() set to Color::BrightBlack.","Returns self with the bg() set to Color::BrightBlack.","Returns self with the bg() set to Color::BrightBlue.","Returns self with the bg() set to Color::BrightBlue.","Returns self with the bg() set to Color::BrightCyan.","Returns self with the bg() set to Color::BrightCyan.","Returns self with the bg() set to Color::BrightGreen.","Returns self with the bg() set to Color::BrightGreen.","Returns self with the bg() set to Color::BrightMagenta.","Returns self with the bg() set to Color::BrightMagenta.","Returns self with the bg() set to Color::BrightRed.","Returns self with the bg() set to Color::BrightRed.","Returns self with the bg() set to Color::BrightWhite.","Returns self with the bg() set to Color::BrightWhite.","Returns self with the bg() set to Color::BrightYellow.","Returns self with the bg() set to Color::BrightYellow.","Returns self with the bg() set to Color::Cyan.","Returns self with the bg() set to Color::Cyan.","Returns self with the bg() set to Color::Fixed.","Returns self with the bg() set to Color::Fixed.","Returns self with the bg() set to Color::Green.","Returns self with the bg() set to Color::Green.","Returns self with the bg() set to Color::Magenta.","Returns self with the bg() set to Color::Magenta.","Returns self with the bg() set to Color::Primary.","Returns self with the bg() set to Color::Primary.","Returns self with the bg() set to Color::Red.","Returns self with the bg() set to Color::Red.","Returns self with the bg() set to Color::Rgb.","Returns self with the bg() set to Color::Rgb.","Returns self with the bg() set to Color::White.","Returns self with the bg() set to Color::White.","Returns self with the bg() set to Color::Yellow.","Returns self with the bg() set to Color::Yellow.","Returns self with the fg() set to Color::Primary.","Returns self with the fg() set to Color::Primary.","Enables the yansi Quirk value.","Enables the yansi Quirk value.","Returns self with the attr() set to Attribute::RapidBlink.","Returns self with the attr() set to Attribute::RapidBlink.","Returns self with the fg() set to Color::Red.","Returns self with the fg() set to Color::Red.","Returns self with the quirk() set to Quirk::Resetting.","Returns self with the quirk() set to Quirk::Resetting.","Returns self with the fg() set to Color::Rgb.","Returns self with the fg() set to Color::Rgb.","Returns self with the attr() set to Attribute::Strike.","Returns self with the attr() set to Attribute::Strike.","","","","","","","","","Returns self with the attr() set to Attribute::Underline.","Returns self with the attr() set to Attribute::Underline.","Conditionally enable styling based on whether the Condition…","Conditionally enable styling based on whether the Condition…","Returns self with the fg() set to Color::White.","Returns self with the fg() set to Color::White.","Returns self with the quirk() set to Quirk::Wrap.","Returns self with the quirk() set to Quirk::Wrap.","Returns self with the fg() set to Color::Yellow.","Returns self with the fg() set to Color::Yellow.","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","Enables the styling Attribute value.","Enables the styling Attribute value.","Returns a styled value derived from self with the …","Returns a styled value derived from self with the …","Returns self with the fg() set to Color::Black.","Returns self with the fg() set to Color::Black.","Returns self with the attr() set to Attribute::Blink.","Returns self with the attr() set to Attribute::Blink.","Returns self with the fg() set to Color::Blue.","Returns self with the fg() set to Color::Blue.","Returns self with the attr() set to Attribute::Bold.","Returns self with the attr() set to Attribute::Bold.","","","","","Returns self with the quirk() set to Quirk::Bright.","Returns self with the quirk() set to Quirk::Bright.","Returns self with the fg() set to Color::BrightBlack.","Returns self with the fg() set to Color::BrightBlack.","Returns self with the fg() set to Color::BrightBlue.","Returns self with the fg() set to Color::BrightBlue.","Returns self with the fg() set to Color::BrightCyan.","Returns self with the fg() set to Color::BrightCyan.","Returns self with the fg() set to Color::BrightGreen.","Returns self with the fg() set to Color::BrightGreen.","Returns self with the fg() set to Color::BrightMagenta.","Returns self with the fg() set to Color::BrightMagenta.","Returns self with the fg() set to Color::BrightRed.","Returns self with the fg() set to Color::BrightRed.","Returns self with the fg() set to Color::BrightWhite.","Returns self with the fg() set to Color::BrightWhite.","Returns self with the fg() set to Color::BrightYellow.","Returns self with the fg() set to Color::BrightYellow.","Returns self with the quirk() set to Quirk::Clear.","Returns self with the quirk() set to Quirk::Clear.","","","","","Returns self with the attr() set to Attribute::Conceal.","Returns self with the attr() set to Attribute::Conceal.","Returns self with the fg() set to Color::Cyan.","Returns self with the fg() set to Color::Cyan.","","Returns self with the attr() set to Attribute::Dim.","Returns self with the attr() set to Attribute::Dim.","","","Returns a styled value derived from self with the …","Returns a styled value derived from self with the …","Returns self with the fg() set to Color::Fixed.","Returns self with the fg() set to Color::Fixed.","","","Returns the argument unchanged.","","","Returns the argument unchanged.","Returns self with the fg() set to Color::Green.","Returns self with the fg() set to Color::Green.","Calls U::from(self).","Calls U::from(self).","Returns self with the attr() set to Attribute::Invert.","Returns self with the attr() set to Attribute::Invert.","Returns self with the attr() set to Attribute::Italic.","Returns self with the attr() set to Attribute::Italic.","","Returns self with the quirk() set to Quirk::Linger.","Returns self with the quirk() set to Quirk::Linger.","Returns self with the fg() set to Color::Magenta.","Returns self with the fg() set to Color::Magenta.","Returns self with the quirk() set to Quirk::Mask.","Returns self with the quirk() set to Quirk::Mask.","Returns self with the bg() set to Color::Black.","Returns self with the bg() set to Color::Black.","Returns self with the bg() set to Color::Blue.","Returns self with the bg() set to Color::Blue.","Returns self with the quirk() set to Quirk::OnBright.","Returns self with the quirk() set to Quirk::OnBright.","Returns self with the bg() set to Color::BrightBlack.","Returns self with the bg() set to Color::BrightBlack.","Returns self with the bg() set to Color::BrightBlue.","Returns self with the bg() set to Color::BrightBlue.","Returns self with the bg() set to Color::BrightCyan.","Returns self with the bg() set to Color::BrightCyan.","Returns self with the bg() set to Color::BrightGreen.","Returns self with the bg() set to Color::BrightGreen.","Returns self with the bg() set to Color::BrightMagenta.","Returns self with the bg() set to Color::BrightMagenta.","Returns self with the bg() set to Color::BrightRed.","Returns self with the bg() set to Color::BrightRed.","Returns self with the bg() set to Color::BrightWhite.","Returns self with the bg() set to Color::BrightWhite.","Returns self with the bg() set to Color::BrightYellow.","Returns self with the bg() set to Color::BrightYellow.","Returns self with the bg() set to Color::Cyan.","Returns self with the bg() set to Color::Cyan.","Returns self with the bg() set to Color::Fixed.","Returns self with the bg() set to Color::Fixed.","Returns self with the bg() set to Color::Green.","Returns self with the bg() set to Color::Green.","Returns self with the bg() set to Color::Magenta.","Returns self with the bg() set to Color::Magenta.","Returns self with the bg() set to Color::Primary.","Returns self with the bg() set to Color::Primary.","Returns self with the bg() set to Color::Red.","Returns self with the bg() set to Color::Red.","Returns self with the bg() set to Color::Rgb.","Returns self with the bg() set to Color::Rgb.","Returns self with the bg() set to Color::White.","Returns self with the bg() set to Color::White.","Returns self with the bg() set to Color::Yellow.","Returns self with the bg() set to Color::Yellow.","Returns self with the fg() set to Color::Primary.","Returns self with the fg() set to Color::Primary.","Enables the yansi Quirk value.","Enables the yansi Quirk value.","Returns self with the attr() set to Attribute::RapidBlink.","Returns self with the attr() set to Attribute::RapidBlink.","Returns self with the fg() set to Color::Red.","Returns self with the fg() set to Color::Red.","Returns self with the quirk() set to Quirk::Resetting.","Returns self with the quirk() set to Quirk::Resetting.","Returns self with the fg() set to Color::Rgb.","Returns self with the fg() set to Color::Rgb.","Returns self with the attr() set to Attribute::Strike.","Returns self with the attr() set to Attribute::Strike.","","","","","","","","","Returns self with the attr() set to Attribute::Underline.","Returns self with the attr() set to Attribute::Underline.","Conditionally enable styling based on whether the Condition…","Conditionally enable styling based on whether the Condition…","Returns self with the fg() set to Color::White.","Returns self with the fg() set to Color::White.","Returns self with the quirk() set to Quirk::Wrap.","Returns self with the quirk() set to Quirk::Wrap.","Returns self with the fg() set to Color::Yellow.","Returns self with the fg() set to Color::Yellow."],"i":[0,0,0,0,0,0,0,0,2,2,2,2,2,47,48,49,50,48,49,51,0,0,0,0,0,0,0,0,0,0,17,18,19,20,21,22,23,24,17,18,19,20,21,22,23,24,17,18,19,20,21,22,23,24,17,18,19,20,21,22,23,24,17,18,19,20,21,22,23,24,17,18,19,20,21,22,23,24,17,18,19,20,21,22,23,24,17,18,19,20,21,22,23,24,17,18,19,20,21,22,23,24,17,18,19,20,21,22,23,24,17,18,19,20,21,22,23,24,17,18,19,20,21,22,23,24,17,18,19,20,21,22,23,24,17,18,19,20,21,22,23,24,17,18,19,20,21,22,23,24,17,18,19,20,21,22,23,24,17,18,19,20,21,22,23,24,17,18,19,20,21,22,23,24,17,18,19,20,21,22,23,24,17,18,19,20,21,22,23,24,17,18,19,20,21,22,23,24,17,18,19,20,21,22,23,24,17,18,19,20,21,22,23,24,17,18,19,20,21,22,23,24,17,18,19,20,21,22,23,24,17,18,19,20,21,22,23,24,17,18,19,20,21,22,23,24,17,18,19,20,21,22,23,24,17,18,19,20,21,22,23,24,17,18,19,20,21,22,23,24,17,18,19,20,21,22,23,24,17,18,19,20,21,22,23,24,17,18,19,20,21,22,23,24,17,18,19,20,21,22,23,24,17,18,19,20,21,22,23,24,17,18,19,20,21,22,23,24,17,18,19,20,21,22,23,24,17,18,19,20,21,22,23,24,17,18,19,20,21,22,23,24,17,18,19,20,21,22,23,24,17,18,19,20,21,22,23,24,17,18,19,20,21,22,23,24,17,18,19,20,21,22,23,24,17,18,19,20,21,22,23,24,17,18,19,20,21,22,23,24,17,18,19,20,21,22,23,24,17,18,19,20,21,22,23,24,17,18,19,20,21,22,23,24,17,18,19,20,21,22,23,24,17,18,19,20,21,22,23,24,17,18,19,20,21,22,23,24,17,18,19,20,21,22,23,24,17,18,19,20,21,22,23,24,17,18,19,20,21,22,23,24,17,18,19,20,21,22,23,24,17,18,19,20,21,22,23,24,17,18,19,20,21,22,23,24,17,18,19,20,21,22,23,24,17,18,19,20,21,22,23,24,17,18,19,20,21,22,23,24,17,18,19,20,21,22,23,24,27,17,18,19,20,21,22,23,24,17,18,19,20,21,22,23,24,17,18,19,20,21,22,23,24,17,18,19,20,21,22,23,24,17,18,19,20,21,22,23,24,17,18,19,20,21,22,23,24,17,18,19,20,21,22,23,24,17,18,19,20,21,22,23,24,52,11,0,0,52,0,39,11,39,11,39,11,39,11,39,11,39,11,39,11,39,11,39,11,39,11,39,11,39,11,39,11,39,11,39,11,39,11,39,11,39,11,11,11,39,11,39,11,39,11,39,11,39,11,11,11,39,11,39,11,39,11,39,39,11,39,11,39,11,39,11,39,11,39,39,39,11,39,11,39,11,39,11,39,11,39,11,39,11,39,11,39,11,39,11,39,11,39,11,39,11,39,11,39,11,39,11,39,11,39,11,39,11,39,11,39,11,39,11,39,11,39,11,39,11,39,11,39,11,11,11,39,11,39,11,39,11,39,11,39,11,39,11,39,11,39,11,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,10,10,10,0,10,10,42,10,10,10,10,10,10,10,10,10,10,10,10,10,10,42,10,10,10,10,10,0,10,42,10,42,10,42,10,42,10,42,10,42,10,42,10,42,10,42,10,42,10,42,10,42,10,42,10,42,10,42,10,42,10,42,10,42,10,42,10,42,10,42,10,42,10,42,42,10,42,10,42,10,42,10,42,10,42,42,42,10,42,10,42,10,42,10,42,10,10,42,10,42,10,42,10,42,10,42,10,42,10,42,10,42,10,42,10,42,10,42,10,42,10,42,10,42,10,42,10,42,10,42,10,42,10,42,10,42,10,42,10,42,10,42,10,42,10,42,10,42,10,42,10,42,10,42,10,42,10,42,10,42,10,42,10,42,10,42,10,42,10,42,10,42,10,42,10],"f":"`{{bd}{{A`{{l{{j{b{h{f}}}}}}n}}}}``{{bb}{{A`{Ab{Ah{fAdAf}}}}}}{{bb{l{{j{b{h{f}}}}}}}{{A`{Ajn}}}}````````````````````````{{cAl}{{An{e}}}{}{}}0000000{{cB`}{{An{e}}}{}{}}0000000{c{{An{e}}}{}{}}0000000000000000000000000000000{ce{}{}}000000000000000111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111{{}Bb}{{}Bd}{{}Bf}{{}Bh}{{}Bj}{{}Bl}{{}Bn}{{}C`}99999999::::::::{{cCb}{{An{e}}}{}{}}0000000{cc{}}0000000;;;;;;;;::::::::;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;98765432;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;11111111;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;{{cCbCbCb}{{An{e}}}{}{}}0000000<<<<<<<<<<<<<<<<{{Bbbe}{{A`{Cd{Ah{fAdAf}}}}}Cf{{Cj{}{{Ch{c}}}}}}{{Bdbe}{{A`{Cd{Ah{fAdAf}}}}}Cf{{Cj{}{{Ch{c}}}}}}{{Bfbe}{{A`{Cd{Ah{fAdAf}}}}}Cf{{Cj{}{{Ch{c}}}}}}{{Bhbe}{{A`{Ab{Ah{fAdAf}}}}}Cf{{Cj{}{{Ch{c}}}}}}{{Bjbe}{{A`{{Cn{Cl}}{Ah{fAdAf}}}}}Cf{{Cj{}{{Ch{c}}}}}}{{Blbe}{{A`{D`{Ah{fAdAf}}}}}Cf{{Cj{}{{Ch{c}}}}}}{{Bnbe}{{A`{Ab{Ah{fAdAf}}}}}Cf{{Cj{}{{Ch{c}}}}}}{{C`be}{{A`{Db{Ah{fAdAf}}}}}Cf{{Cj{}{{Ch{c}}}}}}{c{{An{e}}}{}{}}0000000{{cDd}{{An{e}}}{}{}}0000000111111111111111111111111::::::::11111111{Cf{{A`{{j{fAdf}}{Ah{fAdAf}}}}}}{c{{A`{e}}}{}{}}000000000000000{cDf{}}000000044444444{{cDh}{{An{e}}}{}{}}0000000555555555555555555555555``````{{cAl}{{An{e}}}{}{}}0{{cB`}{{An{e}}}{}{}}077777777{ce{}{}}00088888888888888888888{AfAf}{{ce}Aj{}{}}::::::33{{cCb}{{An{e}}}{}{}}0{{AfDj}Dl}0{cc{}}0==555=========={bDn}{Dn{{E`{c}}}{}}????????????????????????44????????{{cCbCbCb}{{An{e}}}{}{}}0{c{{An{e}}}{}{}}00000{{cDd}{{An{e}}}{}{}}01111112211:{cEb{}}{c{{A`{e}}}{}{}}000{cDf{}}044{{cDh}{{An{e}}}{}{}}0555555```````````````````````````````````````````````````````````{{cAl}{{An{e}}}{}{}}0{{cB`}{{An{e}}}{}{}}077777777{ce{}{}}00088888888888888888888{EdEd}{AdAd}{{ce}Aj{}{}}0;;;;{{}Ed}<<{{EdEd}Ef}{{AdAd}Ef}77{{cCb}{{An{e}}}{}{}}0{{EdDj}Dl}{{AdDj}Dl}{cc{}}{EhEd}{EjEd}2{c{{An{e}}}{}{}}0==0000{{{El{Ad}}}Aj}1111111111111111111111111111117711111111{{cCbCbCb}{{An{e}}}{}{}}0222222{{cDd}{{An{e}}}{}{}}03333331133{ce{}{}}0{c{{A`{e}}}{}{}}000{cDf{}}066{{cDh}{{An{e}}}{}{}}0777777","c":[166,167,168,169,170,171,172,173,623,624,823,824],"p":[[1,"str"],[8,"Error",7],[1,"usize"],[5,"Range",935],[1,"tuple"],[5,"Report",936],[5,"Error",937],[6,"Result",938],[5,"Module",939],[6,"Token",730],[6,"LexicalError",583],[6,"ParseError",940],[1,"unit"],[6,"Attribute",941],[5,"Painted",942],[6,"Color",943],[5,"BinaryFirstLvlOpParser",21],[5,"BinarySecondLvlOpParser",21],[5,"BinaryThirdLvlOpParser",21],[5,"ModuleParser",21],[5,"PathSegmentsParser",21],[5,"StructImplParser",21],[5,"TopLevelModuleParser",21],[5,"UnaryOpParser",21],[1,"u8"],[6,"BinaryOp",939],[10,"__ToTriple",21],[17,"Item"],[10,"IntoIterator",944],[6,"PathSegment",939],[5,"Vec",945],[5,"StructImpl",939],[6,"UnaryOp",939],[6,"Quirk",941],[5,"TypeId",946],[5,"Condition",947],[5,"Formatter",948],[8,"Result",948],[5,"Lexer",583],[6,"Option",949],[5,"String",950],[6,"LexingError",730],[1,"bool"],[6,"Infallible",951],[5,"ParseIntError",952],[5,"Lexer",953],[15,"User",13],[15,"UnrecognizedEof",13],[15,"UnrecognizedToken",13],[15,"InvalidToken",13],[15,"ExtraToken",13],[8,"Spanned",583]],"b":[[637,"impl-Display-for-LexicalError"],[638,"impl-Debug-for-LexicalError"],[845,"impl-From%3CInfallible%3E-for-LexingError"],[846,"impl-From%3CParseIntError%3E-for-LexingError"]]}],\ ["edlang_session",{"doc":"","t":"PGPPPPPGFNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNONNNNNNNNONNNNNNNNNNNNNNNNNNNNNNNNONNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNOOOONNNNNNNNNNNNNNNNNNONNNNNNNNNNNNNNNNNNNNNNNNNNNNNN","n":["Aggressive","DebugInfo","Default","Full","Less","None","None","OptLevel","Session","attr","attr","attr","bg","bg","bg","black","black","black","blink","blink","blink","blue","blue","blue","bold","bold","bold","borrow","borrow","borrow","borrow_mut","borrow_mut","borrow_mut","bright","bright","bright","bright_black","bright_black","bright_black","bright_blue","bright_blue","bright_blue","bright_cyan","bright_cyan","bright_cyan","bright_green","bright_green","bright_green","bright_magenta","bright_magenta","bright_magenta","bright_red","bright_red","bright_red","bright_white","bright_white","bright_white","bright_yellow","bright_yellow","bright_yellow","clear","clear","clear","clone","clone","clone","clone_into","clone_into","clone_into","conceal","conceal","conceal","cyan","cyan","cyan","debug_info","dim","dim","dim","eq","eq","fg","fg","fg","file_paths","fixed","fixed","fixed","fmt","fmt","fmt","from","from","from","get_platform_library_ext","green","green","green","hash","hash","into","into","into","invert","invert","invert","italic","italic","italic","library","linger","linger","linger","magenta","magenta","magenta","mask","mask","mask","on_black","on_black","on_black","on_blue","on_blue","on_blue","on_bright","on_bright","on_bright","on_bright_black","on_bright_black","on_bright_black","on_bright_blue","on_bright_blue","on_bright_blue","on_bright_cyan","on_bright_cyan","on_bright_cyan","on_bright_green","on_bright_green","on_bright_green","on_bright_magenta","on_bright_magenta","on_bright_magenta","on_bright_red","on_bright_red","on_bright_red","on_bright_white","on_bright_white","on_bright_white","on_bright_yellow","on_bright_yellow","on_bright_yellow","on_cyan","on_cyan","on_cyan","on_fixed","on_fixed","on_fixed","on_green","on_green","on_green","on_magenta","on_magenta","on_magenta","on_primary","on_primary","on_primary","on_red","on_red","on_red","on_rgb","on_rgb","on_rgb","on_white","on_white","on_white","on_yellow","on_yellow","on_yellow","optlevel","output_asm","output_file","output_llvm","primary","primary","primary","quirk","quirk","quirk","rapid_blink","rapid_blink","rapid_blink","red","red","red","resetting","resetting","resetting","rgb","rgb","rgb","sources","strike","strike","strike","to_owned","to_owned","to_owned","try_from","try_from","try_from","try_into","try_into","try_into","type_id","type_id","type_id","underline","underline","underline","whenever","whenever","whenever","white","white","white","wrap","wrap","wrap","yellow","yellow","yellow"],"q":[[0,"edlang_session"],[232,"yansi::attr_quirk"],[233,"yansi::paint"],[234,"yansi::color"],[235,"core::fmt"],[236,"core::fmt"],[237,"yansi::attr_quirk"],[238,"core::any"],[239,"yansi::condition"]],"d":["","","","","","","","","","Enables the styling Attribute value.","Enables the styling Attribute value.","Enables the styling Attribute value.","Returns a styled value derived from self with the …","Returns a styled value derived from self with the …","Returns a styled value derived from self with the …","Returns self with the fg() set to Color::Black.","Returns self with the fg() set to Color::Black.","Returns self with the fg() set to Color::Black.","Returns self with the attr() set to Attribute::Blink.","Returns self with the attr() set to Attribute::Blink.","Returns self with the attr() set to Attribute::Blink.","Returns self with the fg() set to Color::Blue.","Returns self with the fg() set to Color::Blue.","Returns self with the fg() set to Color::Blue.","Returns self with the attr() set to Attribute::Bold.","Returns self with the attr() set to Attribute::Bold.","Returns self with the attr() set to Attribute::Bold.","","","","","","","Returns self with the quirk() set to Quirk::Bright.","Returns self with the quirk() set to Quirk::Bright.","Returns self with the quirk() set to Quirk::Bright.","Returns self with the fg() set to Color::BrightBlack.","Returns self with the fg() set to Color::BrightBlack.","Returns self with the fg() set to Color::BrightBlack.","Returns self with the fg() set to Color::BrightBlue.","Returns self with the fg() set to Color::BrightBlue.","Returns self with the fg() set to Color::BrightBlue.","Returns self with the fg() set to Color::BrightCyan.","Returns self with the fg() set to Color::BrightCyan.","Returns self with the fg() set to Color::BrightCyan.","Returns self with the fg() set to Color::BrightGreen.","Returns self with the fg() set to Color::BrightGreen.","Returns self with the fg() set to Color::BrightGreen.","Returns self with the fg() set to Color::BrightMagenta.","Returns self with the fg() set to Color::BrightMagenta.","Returns self with the fg() set to Color::BrightMagenta.","Returns self with the fg() set to Color::BrightRed.","Returns self with the fg() set to Color::BrightRed.","Returns self with the fg() set to Color::BrightRed.","Returns self with the fg() set to Color::BrightWhite.","Returns self with the fg() set to Color::BrightWhite.","Returns self with the fg() set to Color::BrightWhite.","Returns self with the fg() set to Color::BrightYellow.","Returns self with the fg() set to Color::BrightYellow.","Returns self with the fg() set to Color::BrightYellow.","Returns self with the quirk() set to Quirk::Clear.","Returns self with the quirk() set to Quirk::Clear.","Returns self with the quirk() set to Quirk::Clear.","","","","","","","Returns self with the attr() set to Attribute::Conceal.","Returns self with the attr() set to Attribute::Conceal.","Returns self with the attr() set to Attribute::Conceal.","Returns self with the fg() set to Color::Cyan.","Returns self with the fg() set to Color::Cyan.","Returns self with the fg() set to Color::Cyan.","","Returns self with the attr() set to Attribute::Dim.","Returns self with the attr() set to Attribute::Dim.","Returns self with the attr() set to Attribute::Dim.","","","Returns a styled value derived from self with the …","Returns a styled value derived from self with the …","Returns a styled value derived from self with the …","","Returns self with the fg() set to Color::Fixed.","Returns self with the fg() set to Color::Fixed.","Returns self with the fg() set to Color::Fixed.","","","","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","","Returns self with the fg() set to Color::Green.","Returns self with the fg() set to Color::Green.","Returns self with the fg() set to Color::Green.","","","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Returns self with the attr() set to Attribute::Invert.","Returns self with the attr() set to Attribute::Invert.","Returns self with the attr() set to Attribute::Invert.","Returns self with the attr() set to Attribute::Italic.","Returns self with the attr() set to Attribute::Italic.","Returns self with the attr() set to Attribute::Italic.","","Returns self with the quirk() set to Quirk::Linger.","Returns self with the quirk() set to Quirk::Linger.","Returns self with the quirk() set to Quirk::Linger.","Returns self with the fg() set to Color::Magenta.","Returns self with the fg() set to Color::Magenta.","Returns self with the fg() set to Color::Magenta.","Returns self with the quirk() set to Quirk::Mask.","Returns self with the quirk() set to Quirk::Mask.","Returns self with the quirk() set to Quirk::Mask.","Returns self with the bg() set to Color::Black.","Returns self with the bg() set to Color::Black.","Returns self with the bg() set to Color::Black.","Returns self with the bg() set to Color::Blue.","Returns self with the bg() set to Color::Blue.","Returns self with the bg() set to Color::Blue.","Returns self with the quirk() set to Quirk::OnBright.","Returns self with the quirk() set to Quirk::OnBright.","Returns self with the quirk() set to Quirk::OnBright.","Returns self with the bg() set to Color::BrightBlack.","Returns self with the bg() set to Color::BrightBlack.","Returns self with the bg() set to Color::BrightBlack.","Returns self with the bg() set to Color::BrightBlue.","Returns self with the bg() set to Color::BrightBlue.","Returns self with the bg() set to Color::BrightBlue.","Returns self with the bg() set to Color::BrightCyan.","Returns self with the bg() set to Color::BrightCyan.","Returns self with the bg() set to Color::BrightCyan.","Returns self with the bg() set to Color::BrightGreen.","Returns self with the bg() set to Color::BrightGreen.","Returns self with the bg() set to Color::BrightGreen.","Returns self with the bg() set to Color::BrightMagenta.","Returns self with the bg() set to Color::BrightMagenta.","Returns self with the bg() set to Color::BrightMagenta.","Returns self with the bg() set to Color::BrightRed.","Returns self with the bg() set to Color::BrightRed.","Returns self with the bg() set to Color::BrightRed.","Returns self with the bg() set to Color::BrightWhite.","Returns self with the bg() set to Color::BrightWhite.","Returns self with the bg() set to Color::BrightWhite.","Returns self with the bg() set to Color::BrightYellow.","Returns self with the bg() set to Color::BrightYellow.","Returns self with the bg() set to Color::BrightYellow.","Returns self with the bg() set to Color::Cyan.","Returns self with the bg() set to Color::Cyan.","Returns self with the bg() set to Color::Cyan.","Returns self with the bg() set to Color::Fixed.","Returns self with the bg() set to Color::Fixed.","Returns self with the bg() set to Color::Fixed.","Returns self with the bg() set to Color::Green.","Returns self with the bg() set to Color::Green.","Returns self with the bg() set to Color::Green.","Returns self with the bg() set to Color::Magenta.","Returns self with the bg() set to Color::Magenta.","Returns self with the bg() set to Color::Magenta.","Returns self with the bg() set to Color::Primary.","Returns self with the bg() set to Color::Primary.","Returns self with the bg() set to Color::Primary.","Returns self with the bg() set to Color::Red.","Returns self with the bg() set to Color::Red.","Returns self with the bg() set to Color::Red.","Returns self with the bg() set to Color::Rgb.","Returns self with the bg() set to Color::Rgb.","Returns self with the bg() set to Color::Rgb.","Returns self with the bg() set to Color::White.","Returns self with the bg() set to Color::White.","Returns self with the bg() set to Color::White.","Returns self with the bg() set to Color::Yellow.","Returns self with the bg() set to Color::Yellow.","Returns self with the bg() set to Color::Yellow.","","","","","Returns self with the fg() set to Color::Primary.","Returns self with the fg() set to Color::Primary.","Returns self with the fg() set to Color::Primary.","Enables the yansi Quirk value.","Enables the yansi Quirk value.","Enables the yansi Quirk value.","Returns self with the attr() set to Attribute::RapidBlink.","Returns self with the attr() set to Attribute::RapidBlink.","Returns self with the attr() set to Attribute::RapidBlink.","Returns self with the fg() set to Color::Red.","Returns self with the fg() set to Color::Red.","Returns self with the fg() set to Color::Red.","Returns self with the quirk() set to Quirk::Resetting.","Returns self with the quirk() set to Quirk::Resetting.","Returns self with the quirk() set to Quirk::Resetting.","Returns self with the fg() set to Color::Rgb.","Returns self with the fg() set to Color::Rgb.","Returns self with the fg() set to Color::Rgb.","","Returns self with the attr() set to Attribute::Strike.","Returns self with the attr() set to Attribute::Strike.","Returns self with the attr() set to Attribute::Strike.","","","","","","","","","","","","","Returns self with the attr() set to Attribute::Underline.","Returns self with the attr() set to Attribute::Underline.","Returns self with the attr() set to Attribute::Underline.","Conditionally enable styling based on whether the Condition…","Conditionally enable styling based on whether the Condition…","Conditionally enable styling based on whether the Condition…","Returns self with the fg() set to Color::White.","Returns self with the fg() set to Color::White.","Returns self with the fg() set to Color::White.","Returns self with the quirk() set to Quirk::Wrap.","Returns self with the quirk() set to Quirk::Wrap.","Returns self with the quirk() set to Quirk::Wrap.","Returns self with the fg() set to Color::Yellow.","Returns self with the fg() set to Color::Yellow.","Returns self with the fg() set to Color::Yellow."],"i":[5,0,5,6,5,5,6,0,0,4,5,6,4,5,6,4,5,6,4,5,6,4,5,6,4,5,6,4,5,6,4,5,6,4,5,6,4,5,6,4,5,6,4,5,6,4,5,6,4,5,6,4,5,6,4,5,6,4,5,6,4,5,6,4,5,6,4,5,6,4,5,6,4,5,6,4,4,5,6,5,6,4,5,6,4,4,5,6,4,5,6,4,5,6,4,4,5,6,5,6,4,5,6,4,5,6,4,5,6,4,4,5,6,4,5,6,4,5,6,4,5,6,4,5,6,4,5,6,4,5,6,4,5,6,4,5,6,4,5,6,4,5,6,4,5,6,4,5,6,4,5,6,4,5,6,4,5,6,4,5,6,4,5,6,4,5,6,4,5,6,4,5,6,4,5,6,4,5,6,4,4,4,4,4,5,6,4,5,6,4,5,6,4,5,6,4,5,6,4,5,6,4,4,5,6,4,5,6,4,5,6,4,5,6,4,5,6,4,5,6,4,5,6,4,5,6,4,5,6,4,5,6],"f":"`````````{{cb}{{d{e}}}{}{}}00{{cf}{{d{e}}}{}{}}00{c{{d{e}}}{}{}}00000000000{ce{}{}}00000111111111111111111111111111111{hh}{jj}{ll}{{ce}n{}{}}00555555`555{{jj}A`}{{ll}A`}888`{{cAb}{{d{e}}}{}{}}00{{hAd}Af}{{jAd}Af}{{lAd}Af}{cc{}}00{{}Ah}==={{jc}nAj}{{lc}nAj}>>>??????`?????????????????????????????????????????????777????????????{{cAbAbAb}{{d{e}}}{}{}}00{c{{d{e}}}{}{}}00000````000{{cAl}{{d{e}}}{}{}}00111111111222`111{ce{}{}}00{c{{An{e}}}{}{}}00000{cB`{}}00444{{cBb}{{d{e}}}{}{}}00555555555","c":[60,61,62],"p":[[6,"Attribute",232],[5,"Painted",233],[6,"Color",234],[5,"Session",0],[6,"OptLevel",0],[6,"DebugInfo",0],[1,"unit"],[1,"bool"],[1,"u8"],[5,"Formatter",235],[8,"Result",235],[1,"str"],[10,"Hasher",236],[6,"Quirk",232],[6,"Result",237],[5,"TypeId",238],[5,"Condition",239]],"b":[]}],\ ["edlang_span",{"doc":"","t":"FNNNNNNNNNNONONNNNNN","n":["Span","borrow","borrow_mut","clone","clone_into","cmp","default","eq","fmt","from","hash","hi","into","lo","new","partial_cmp","to_owned","try_from","try_into","type_id"],"q":[[0,"edlang_span"],[20,"core::cmp"],[21,"core::fmt"],[22,"core::fmt"],[23,"core::option"],[24,"core::result"],[25,"core::any"]],"d":["","","","","","","","","","Returns the argument unchanged.","","","Calls U::from(self).","","","","","","",""],"i":[0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1],"f":"`{ce{}{}}0{bb}{{ce}d{}{}}{{bb}f}{{}b}{{bb}h}{{bj}l}{cc{}}{{bc}dn}`8`{{A`A`}b}{{bb}{{Ab{f}}}}:{c{{Ad{e}}}{}{}}0{cAf{}}","c":[],"p":[[5,"Span",0],[1,"unit"],[6,"Ordering",20],[1,"bool"],[5,"Formatter",21],[8,"Result",21],[10,"Hasher",22],[1,"usize"],[6,"Option",23],[6,"Result",24],[5,"TypeId",25]],"b":[]}],\ ["edlangc",{"doc":"","t":"H","n":["main"],"q":[[0,"edlangc"],[1,"core::error"],[2,"alloc::boxed"],[3,"core::result"]],"d":[""],"i":[0],"f":"{{}{{h{b{f{d}}}}}}","c":[],"p":[[1,"unit"],[10,"Error",1],[5,"Box",2],[6,"Result",3]],"b":[]}],\ @@ -39,11 +39,11 @@ var searchIndex = new Map(JSON.parse('[\ ["heck",{"doc":"heck is a case conversion library.","t":"FFFFFFFFFFFMKKKKKKKKKKKNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNMMMMMMMNNNNNNNNMMMNNNNNNNNNNNNNNNNNNNNNNNN","n":["AsKebabCase","AsLowerCamelCase","AsPascalCase","AsShoutyKebabCase","AsShoutySnakeCase","AsShoutySnekCase","AsSnakeCase","AsSnekCase","AsTitleCase","AsTrainCase","AsUpperCamelCase","TO_SHOUTY_SNEK_CASE","ToKebabCase","ToLowerCamelCase","ToPascalCase","ToShoutyKebabCase","ToShoutySnakeCase","ToShoutySnekCase","ToSnakeCase","ToSnekCase","ToTitleCase","ToTrainCase","ToUpperCamelCase","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","from","from","from","from","from","from","from","from","into","into","into","into","into","into","into","into","to_kebab_case","to_lower_camel_case","to_pascal_case","to_shouty_kebab_case","to_shouty_snake_case","to_snake_case","to_snek_case","to_string","to_string","to_string","to_string","to_string","to_string","to_string","to_string","to_title_case","to_train_case","to_upper_camel_case","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"],"q":[[0,"heck"],[105,"core::fmt"],[106,"core::fmt"],[107,"alloc::string"],[108,"core::result"],[109,"core::any"]],"d":["This wrapper performs a kebab case conversion in …","This wrapper performs a lower camel case conversion in …","This wrapper performs a upper camel case conversion in …","This wrapper performs a kebab case conversion in …","This wrapper performs a shouty snake case conversion in …","This wrapper performs a shouty snake case conversion in …","This wrapper performs a snake case conversion in …","This wrapper performs a snake case conversion in …","This wrapper performs a title case conversion in …","This wrapper performs a train case conversion in …","This wrapper performs a upper camel case conversion in …","CONVERT THIS TYPE TO SNEK CASE.","This trait defines a kebab case conversion.","This trait defines a lower camel case conversion.","ToPascalCase is an alias for ToUpperCamelCase. See …","This trait defines a shouty kebab case conversion.","This trait defines a shouty snake case conversion.","Oh heck, ToShoutySnekCase is an alias for ToShoutySnakeCase…","This trait defines a snake case conversion.","Oh heck, SnekCase is an alias for ToSnakeCase. See …","This trait defines a title case conversion.","This trait defines a train case conversion.","This trait defines an upper camel case conversion.","","","","","","","","","","","","","","","","","","","","","","","","","Returns the argument unchanged.","Returns the argument unchanged.","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).","Convert this type to kebab case.","Convert this type to lower camel case.","Convert this type to upper camel case.","Convert this type to shouty kebab case.","Convert this type to shouty snake case.","Convert this type to snake case.","Convert this type to snek case.","","","","","","","","","Convert this type to title case.","Convert this type to Train-Case.","Convert this type to upper camel case.","","","","","","","","","","","","","","","","","","","","","","","",""],"i":[0,0,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,2,7,8,9,10,11,12,13,2,7,8,9,10,11,12,13,2,7,8,9,10,11,12,13,2,7,8,9,10,11,12,13,2,7,8,9,10,11,12,13,14,15,16,17,18,19,20,2,7,8,9,10,11,12,13,22,23,24,2,7,8,9,10,11,12,13,2,7,8,9,10,11,12,13,2,7,8,9,10,11,12,13],"f":"```````````{bc{}}```````````{ce{}{}}000000000000000{{{d{c}}f}h{{l{j}}}}{{{n{c}}f}h{{l{j}}}}{{{A`{c}}f}h{{l{j}}}}{{{Ab{c}}f}h{{l{j}}}}{{{Ad{c}}f}h{{l{j}}}}{{{Af{c}}f}h{{l{j}}}}{{{Ah{c}}f}h{{l{j}}}}{{{Aj{c}}f}h{{l{j}}}}{cc{}}000000099999999{Alc{}}{Anc{}}{B`c{}}{Bbc{}}{Bdc{}}{Bfc{}}{Bhc{}}{cBj{}}0000000{Blc{}}{Bnc{}}{C`c{}}{c{{Cb{e}}}{}{}}000000000000000{cCd{}}0000000","c":[],"p":[[10,"ToShoutySnekCase",0],[5,"AsKebabCase",0],[5,"Formatter",105],[8,"Result",105],[1,"str"],[10,"AsRef",106],[5,"AsLowerCamelCase",0],[5,"AsShoutyKebabCase",0],[5,"AsShoutySnakeCase",0],[5,"AsSnakeCase",0],[5,"AsTitleCase",0],[5,"AsTrainCase",0],[5,"AsUpperCamelCase",0],[10,"ToKebabCase",0],[10,"ToLowerCamelCase",0],[10,"ToPascalCase",0],[10,"ToShoutyKebabCase",0],[10,"ToShoutySnakeCase",0],[10,"ToSnakeCase",0],[10,"ToSnekCase",0],[5,"String",107],[10,"ToTitleCase",0],[10,"ToTrainCase",0],[10,"ToUpperCamelCase",0],[6,"Result",108],[5,"TypeId",109]],"b":[]}],\ ["idna",{"doc":"This Rust crate implements IDNA per the WHATWG URL Standard…","t":"FFFNNNNNNNNNNNNHHHNNNNNNNNNCNNNNNNNNNNNNNNNNNNNNHHHH","n":["Config","Errors","Idna","borrow","borrow","borrow","borrow_mut","borrow_mut","borrow_mut","check_hyphens","clone","clone_into","default","default","default","domain_to_ascii","domain_to_ascii_strict","domain_to_unicode","fmt","fmt","from","from","from","into","into","into","new","punycode","to_ascii","to_ascii","to_ascii_inner","to_owned","to_string","to_unicode","to_unicode","transitional_processing","try_from","try_from","try_from","try_into","try_into","try_into","type_id","type_id","type_id","use_idna_2008_rules","use_std3_ascii_rules","verify_dns_length","decode","decode_to_string","encode","encode_str"],"q":[[0,"idna"],[48,"idna::punycode"],[52,"alloc::string"],[53,"core::result"],[54,"core::fmt"],[55,"core::fmt"],[56,"alloc::vec"],[57,"core::option"]],"d":["","Errors recorded during UTS #46 processing.","","","","","","","","","","","","","","The domain to ASCII algorithm.","The domain to ASCII algorithm, with the beStrict flag set.","The domain to Unicode algorithm.","","","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","","Punycode (RFC 3492) implementation.","http://www.unicode.org/reports/tr46/#ToASCII","http://www.unicode.org/reports/tr46/#ToASCII","","","","http://www.unicode.org/reports/tr46/#ToUnicode","http://www.unicode.org/reports/tr46/#ToUnicode","","","","","","","","","","","","","","Convert Punycode to Unicode.","Convert Punycode to an Unicode String.","Convert Unicode to Punycode.","Convert an Unicode str to Punycode."],"i":[0,0,0,4,1,5,4,1,5,1,1,1,4,1,5,0,0,0,5,5,4,1,5,4,1,5,4,0,4,1,4,1,5,4,1,1,4,1,5,4,1,5,4,1,5,1,1,1,0,0,0,0],"f":"```{ce{}{}}00000{{bd}b}{bb}{{ce}f{}{}}{{}h}{{}b}{{}j}{l{{A`{nj}}}}0{l{{Ab{n{A`{fj}}}}}}{{jAd}Af}0{cc{}}00:::{bh}`{{hln}{{A`{fj}}}}{{bl}{{A`{nj}}}}{{hln}j}>{cn{}}3{{bl}{{Ab{n{A`{fj}}}}}}?{c{{A`{e}}}{}{}}00000{cAh{}}00{{bd}b}00{l{{An{{Al{Aj}}}}}}{l{{An{n}}}}{{{B`{Aj}}}{{An{n}}}}1","c":[],"p":[[5,"Config",0],[1,"bool"],[1,"unit"],[5,"Idna",0],[5,"Errors",0],[1,"str"],[5,"String",52],[6,"Result",53],[1,"tuple"],[5,"Formatter",54],[8,"Result",54],[5,"TypeId",55],[1,"char"],[5,"Vec",56],[6,"Option",57],[1,"slice"]],"b":[[18,"impl-Debug-for-Errors"],[19,"impl-Display-for-Errors"]]}],\ ["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 at the supplied …","","","","","","","Returns a mutable reference to the value corresponding to …","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.","Examples","Returns the argument unchanged.","","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}}{Fl{Bf}}}{{Al{ce}}}{}{}}{{{Al{ce}}Bf}e{}{}}{{{Al{ce}}{Fn{Bf}}}{{Al{ce}}}{}{}}{{{Al{ce}}{G`{Bf}}}{{Al{ce}}}{}{}}{{{Al{ce}}{Gb{Bf}}}{{Al{ce}}}{}{}}{{{Al{ce}}{Dl{{Gd{Bf}}{Gd{Bf}}}}}{{Al{ce}}}{}{}}{{{Al{ce}}{Gf{Bf}}}{{Al{ce}}}{}{}}{{{Al{ce}}Gh}{{Al{ce}}}{}{}}{{{An{ceg}}{Fn{Bf}}}i{}{}{}{}}{{{An{ceg}}Bf}e{}{}{}}{{{An{ceg}}{Fl{Bf}}}i{}{}{}{}}{{{An{ceg}}{G`{Bf}}}i{}{}{}{}}{{{An{ceg}}i}e{}{}Cn{D`{h{c}}j}}{{{An{ceg}}{Dl{{Gd{Bf}}{Gd{Bf}}}}}i{}{}{}{}}{{{An{ceg}}Gh}i{}{}{}{}}{{{An{ceg}}{Gb{Bf}}}i{}{}{}{}}{{{An{ceg}}{Gf{Bf}}}i{}{}{}{}}{{{Al{ce}}{Fl{Bf}}}{{Al{ce}}}{}{}};<{{{Al{ce}}Bf}e{}{}};>?{{{Al{ce}}{Fn{Bf}}}{{Al{ce}}}{}{}}4:95683;7{{{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`DhEb}Cn{{Ed{}{{Dj{c}}}}}}{{{Id{ce}}g}d{D`Dh}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{}}0000000{{{F`{c}}}{{Id{cFb}}}{DhD`}}1{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}}{Fn{Bf}}}e{}{}}{{{Hn{c}}{G`{Bf}}}e{}{}}{{{Hn{c}}{Gf{Bf}}}e{}{}}{{{Hn{c}}{Dl{{Gd{Bf}}{Gd{Bf}}}}}e{}{}}{{{Hn{c}}{Gb{Bf}}}e{}{}}{{{Hn{c}}{Fl{Bf}}}e{}{}}{{{Hn{c}}Gh}e{}{}}{{{Id{ce}}{Fn{Bf}}}g{}{}{}}{{{Id{ce}}{Gb{Bf}}}g{}{}{}}{{{Id{ce}}{Gf{Bf}}}g{}{}{}}{{{Id{ce}}{Dl{{Gd{Bf}}{Gd{Bf}}}}}g{}{}{}}{{{Id{ce}}{Fl{Bf}}}g{}{}{}}{{{Id{ce}}Gh}g{}{}{}}{{{Id{ce}}Bf}c{}{}}{{{Id{ce}}{G`{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,"RangeInclusive",905],[5,"RangeToInclusive",905],[5,"RangeFrom",905],[5,"Range",905],[6,"Bound",905],[5,"RangeTo",905],[5,"RangeFull",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-Display-for-TryReserveError"],[14,"impl-Debug-for-TryReserveError"],[134,"impl-Default-for-%26mut+Slice%3CK,+V%3E"],[135,"impl-Default-for-%26Slice%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%3CRangeInclusive%3Cusize%3E%3E-for-Slice%3CK,+V%3E"],[218,"impl-Index%3Cusize%3E-for-Slice%3CK,+V%3E"],[219,"impl-Index%3CRangeToInclusive%3Cusize%3E%3E-for-Slice%3CK,+V%3E"],[220,"impl-Index%3CRangeFrom%3Cusize%3E%3E-for-Slice%3CK,+V%3E"],[221,"impl-Index%3CRange%3Cusize%3E%3E-for-Slice%3CK,+V%3E"],[222,"impl-Index%3C(Bound%3Cusize%3E,+Bound%3Cusize%3E)%3E-for-Slice%3CK,+V%3E"],[223,"impl-Index%3CRangeTo%3Cusize%3E%3E-for-Slice%3CK,+V%3E"],[224,"impl-Index%3CRangeFull%3E-for-Slice%3CK,+V%3E"],[225,"impl-Index%3CRangeToInclusive%3Cusize%3E%3E-for-IndexMap%3CK,+V,+S%3E"],[226,"impl-Index%3Cusize%3E-for-IndexMap%3CK,+V,+S%3E"],[227,"impl-Index%3CRangeInclusive%3Cusize%3E%3E-for-IndexMap%3CK,+V,+S%3E"],[228,"impl-Index%3CRangeFrom%3Cusize%3E%3E-for-IndexMap%3CK,+V,+S%3E"],[229,"impl-Index%3C%26Q%3E-for-IndexMap%3CK,+V,+S%3E"],[230,"impl-Index%3C(Bound%3Cusize%3E,+Bound%3Cusize%3E)%3E-for-IndexMap%3CK,+V,+S%3E"],[231,"impl-Index%3CRangeFull%3E-for-IndexMap%3CK,+V,+S%3E"],[232,"impl-Index%3CRange%3Cusize%3E%3E-for-IndexMap%3CK,+V,+S%3E"],[233,"impl-Index%3CRangeTo%3Cusize%3E%3E-for-IndexMap%3CK,+V,+S%3E"],[234,"impl-IndexMut%3CRangeInclusive%3Cusize%3E%3E-for-Slice%3CK,+V%3E"],[235,"impl-IndexMut%3CRangeTo%3Cusize%3E%3E-for-Slice%3CK,+V%3E"],[236,"impl-IndexMut%3C(Bound%3Cusize%3E,+Bound%3Cusize%3E)%3E-for-Slice%3CK,+V%3E"],[237,"impl-IndexMut%3Cusize%3E-for-Slice%3CK,+V%3E"],[238,"impl-IndexMut%3CRangeFull%3E-for-Slice%3CK,+V%3E"],[239,"impl-IndexMut%3CRange%3Cusize%3E%3E-for-Slice%3CK,+V%3E"],[240,"impl-IndexMut%3CRangeFrom%3Cusize%3E%3E-for-Slice%3CK,+V%3E"],[241,"impl-IndexMut%3CRangeToInclusive%3Cusize%3E%3E-for-Slice%3CK,+V%3E"],[242,"impl-IndexMut%3CRange%3Cusize%3E%3E-for-IndexMap%3CK,+V,+S%3E"],[243,"impl-IndexMut%3Cusize%3E-for-IndexMap%3CK,+V,+S%3E"],[244,"impl-IndexMut%3CRangeInclusive%3Cusize%3E%3E-for-IndexMap%3CK,+V,+S%3E"],[245,"impl-IndexMut%3CRangeFull%3E-for-IndexMap%3CK,+V,+S%3E"],[246,"impl-IndexMut%3C(Bound%3Cusize%3E,+Bound%3Cusize%3E)%3E-for-IndexMap%3CK,+V,+S%3E"],[247,"impl-IndexMut%3CRangeFrom%3Cusize%3E%3E-for-IndexMap%3CK,+V,+S%3E"],[248,"impl-IndexMut%3CRangeTo%3Cusize%3E%3E-for-IndexMap%3CK,+V,+S%3E"],[249,"impl-IndexMut%3CRangeToInclusive%3Cusize%3E%3E-for-IndexMap%3CK,+V,+S%3E"],[250,"impl-IndexMut%3C%26Q%3E-for-IndexMap%3CK,+V,+S%3E"],[284,"impl-IntoIterator-for-%26Slice%3CK,+V%3E"],[285,"impl-IntoIterator-for-%26mut+Slice%3CK,+V%3E"],[286,"impl-IntoIterator-for-%26mut+IndexMap%3CK,+V,+S%3E"],[287,"impl-IntoIterator-for-%26IndexMap%3CK,+V,+S%3E"],[288,"impl-IntoIterator-for-IndexMap%3CK,+V,+S%3E"],[679,"impl-Extend%3C%26T%3E-for-IndexSet%3CT,+S%3E"],[680,"impl-Extend%3CT%3E-for-IndexSet%3CT,+S%3E"],[719,"impl-Index%3Cusize%3E-for-Slice%3CT%3E"],[720,"impl-Index%3CRangeToInclusive%3Cusize%3E%3E-for-Slice%3CT%3E"],[721,"impl-Index%3CRangeFrom%3Cusize%3E%3E-for-Slice%3CT%3E"],[722,"impl-Index%3CRangeTo%3Cusize%3E%3E-for-Slice%3CT%3E"],[723,"impl-Index%3C(Bound%3Cusize%3E,+Bound%3Cusize%3E)%3E-for-Slice%3CT%3E"],[724,"impl-Index%3CRange%3Cusize%3E%3E-for-Slice%3CT%3E"],[725,"impl-Index%3CRangeInclusive%3Cusize%3E%3E-for-Slice%3CT%3E"],[726,"impl-Index%3CRangeFull%3E-for-Slice%3CT%3E"],[727,"impl-Index%3CRangeToInclusive%3Cusize%3E%3E-for-IndexSet%3CT,+S%3E"],[728,"impl-Index%3CRange%3Cusize%3E%3E-for-IndexSet%3CT,+S%3E"],[729,"impl-Index%3CRangeTo%3Cusize%3E%3E-for-IndexSet%3CT,+S%3E"],[730,"impl-Index%3C(Bound%3Cusize%3E,+Bound%3Cusize%3E)%3E-for-IndexSet%3CT,+S%3E"],[731,"impl-Index%3CRangeInclusive%3Cusize%3E%3E-for-IndexSet%3CT,+S%3E"],[732,"impl-Index%3CRangeFull%3E-for-IndexSet%3CT,+S%3E"],[733,"impl-Index%3Cusize%3E-for-IndexSet%3CT,+S%3E"],[734,"impl-Index%3CRangeFrom%3Cusize%3E%3E-for-IndexSet%3CT,+S%3E"],[758,"impl-IntoIterator-for-IndexSet%3CT,+S%3E"],[759,"impl-IntoIterator-for-%26IndexSet%3CT,+S%3E"]]}],\ -["inkwell",{"doc":"Inkwell documentation is a work in progress.","t":"PPPPFPPGGGPPPPPPPPPGPGPPPGGPPPPPPPPPPPPPPPPPPGPPPPPPPPPPPGPPPPPPPPPPPPPPPPCCNNNNNNNNNNNNNNNNNNNNCNNNNNNNNNNNNNNNNNNNNNNNNNNNCCCCNNNNNNNNNNNNNNCNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNCDCCCNNNNNNNCCCNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNCCFGPPPNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNFFNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNPPFGPPPPPPPNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNPFGPPPPNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNKFFNNMNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNFNNNNNNNNNNNTTTTPPPPKTTPPPPPPPPPPPPPPPPPFFFFFFIKKFFFFFFFFFGGFPTTTTPPPPPPPPPPTTTTPPPITTPTTPPPPTTPTTTTPPPPPTTTTTTTTPPTTTTPPTTTTPTTTTTTPTTTTTTTTPMNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNHNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNFGPPPFPPGKNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNFNNNNNNNNNNNNNNNFNNNNNNNNNNNNNNNNNNPPPPPPPPPPGFPFPPPPGPPFPPPPPPNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNFFFFFFFNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNRFFKNNNNNNMNNNNNNNNNNNNNMNNNNNNNNNNNNNNNNNNFGPPNNNNNNNNNNHNNCNNNNNNHNNHHHHHNNNNNNNNNNHHPPGGPPPGFPPPPPPPGPPFFFFFNNNNNNOOONNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNONNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNONNNNNNNNNNNNNNNNNNNNNNNNNNNNNONNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNPKGFPPPKGKGPPFKFPPPFPPKFPPPRRFPPKFPPPRRGFPPPRRRFPPPFPNNNNNNNNNNNNMNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNPPPKGPPKGFPPPPKPPRRRGKGFPPPPFPPPPPPPPPPSPPPPPPPPPFKFPPPPFPFPPFPFPPPGFPKPFPPPPGPPPPPPPPFPPPPFFPPFPKFPPPPPPPPPPPPPPFPPPPPPPPPPGPPPPFPPPPPNNNNNNNNNNNNNNNNNNNNNNNMNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNMMMNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNN","n":["ATT","Acquire","AcquireRelease","Add","AddressSpace","Aggressive","And","AtomicOrdering","AtomicRMWBinOp","DLLStorageClass","Default","Default","Default","EQ","Export","FAdd","FMax","FMin","FSub","FloatPredicate","GeneralDynamicTLSModel","GlobalVisibility","Hidden","Import","InitialExecTLSModel","InlineAsmDialect","IntPredicate","Intel","Less","LocalDynamicTLSModel","LocalExecTLSModel","Max","Min","Monotonic","NE","Nand","None","NotAtomic","OEQ","OGE","OGT","OLE","OLT","ONE","ORD","OptimizationLevel","Or","PredicateFalse","PredicateTrue","Protected","Release","SGE","SGT","SLE","SLT","SequentiallyConsistent","Sub","ThreadLocalMode","UEQ","UGE","UGE","UGT","UGT","ULE","ULE","ULT","ULT","UMax","UMin","UNE","UNO","Unordered","Xchg","Xor","attributes","basic_block","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","builder","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","cmp","cmp","cmp","cmp","cmp","cmp","cmp","comdat","context","data_layout","debug_info","default","default","default","default","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","execution_engine","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","hash","hash","hash","hash","hash","hash","hash","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","intrinsics","llvm_sys","memory_buffer","module","object_file","partial_cmp","partial_cmp","partial_cmp","partial_cmp","partial_cmp","partial_cmp","partial_cmp","passes","support","targets","to_owned","to_owned","to_owned","to_owned","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_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","types","values","Attribute","AttributeLoc","Function","Param","Return","as_mut_ptr","borrow","borrow","borrow_mut","borrow_mut","clone","clone","clone_into","clone_into","eq","eq","fmt","fmt","from","from","get_enum_kind_id","get_enum_value","get_last_enum_kind_id","get_named_enum_kind_id","get_string_kind_id","get_string_value","get_type_value","hash","into","into","is_enum","is_string","is_type","new","to_owned","to_owned","try_from","try_from","try_into","try_into","type_id","type_id","BasicBlock","InstructionIter","as_mut_ptr","borrow","borrow","borrow_mut","borrow_mut","clone","clone_into","delete","eq","fmt","fmt","from","from","get_address","get_context","get_first_instruction","get_first_use","get_instruction_with_name","get_instructions","get_last_instruction","get_name","get_next_basic_block","get_parent","get_previous_basic_block","get_terminator","hash","into","into","into_iter","move_after","move_before","next","remove_from_function","replace_all_uses_with","set_name","to_owned","try_from","try_from","try_into","try_into","type_id","type_id","AlignmentError","BitwidthError","Builder","BuilderError","ExtractOutOfRange","GEPIndex","GEPPointee","OrderingError","PointeeTypeMismatch","UnsetPosition","ValueTypeMismatch","as_mut_ptr","borrow","borrow","borrow_mut","borrow_mut","build_address_space_cast","build_aggregate_return","build_alloca","build_and","build_array_alloca","build_array_malloc","build_atomicrmw","build_bit_cast","build_call","build_cast","build_cmpxchg","build_conditional_branch","build_direct_call","build_direct_invoke","build_extract_element","build_extract_value","build_fence","build_float_add","build_float_cast","build_float_compare","build_float_div","build_float_ext","build_float_mul","build_float_neg","build_float_rem","build_float_sub","build_float_to_signed_int","build_float_to_unsigned_int","build_float_trunc","build_free","build_gep","build_global_string","build_global_string_ptr","build_in_bounds_gep","build_indirect_branch","build_indirect_call","build_indirect_invoke","build_insert_element","build_insert_value","build_int_add","build_int_cast","build_int_cast_sign_flag","build_int_compare","build_int_exact_signed_div","build_int_mul","build_int_neg","build_int_nsw_add","build_int_nsw_mul","build_int_nsw_neg","build_int_nsw_sub","build_int_nuw_add","build_int_nuw_mul","build_int_nuw_neg","build_int_nuw_sub","build_int_s_extend","build_int_s_extend_or_bit_cast","build_int_signed_div","build_int_signed_rem","build_int_sub","build_int_to_ptr","build_int_truncate","build_int_truncate_or_bit_cast","build_int_unsigned_div","build_int_unsigned_rem","build_int_z_extend","build_int_z_extend_or_bit_cast","build_invoke","build_is_not_null","build_is_null","build_landing_pad","build_left_shift","build_load","build_malloc","build_memcpy","build_memmove","build_memset","build_not","build_or","build_phi","build_pointer_cast","build_ptr_diff","build_ptr_to_int","build_resume","build_return","build_right_shift","build_select","build_shuffle_vector","build_signed_int_to_float","build_store","build_struct_gep","build_switch","build_unconditional_branch","build_unreachable","build_unsigned_int_to_float","build_va_arg","build_xor","clear_insertion_position","drop","eq","fmt","fmt","fmt","from","from","get_current_debug_location","get_insert_block","insert_instruction","into","into","new","position_at","position_at_end","position_before","set_current_debug_location","to_string","try_from","try_from","try_into","try_into","type_id","type_id","unset_current_debug_location","Any","Comdat","ComdatSelectionKind","ExactMatch","Largest","NoDuplicates","SameSize","as_mut_ptr","borrow","borrow","borrow_mut","borrow_mut","clone","clone","clone_into","clone_into","cmp","eq","eq","fmt","fmt","from","from","from","get_selection_kind","hash","into","into","into","new","partial_cmp","set_selection_kind","to_owned","to_owned","try_from","try_from","try_into","try_into","type_id","type_id","AsContextRef","Context","ContextRef","append_basic_block","append_basic_block","as_ctx_ref","as_ctx_ref","as_ctx_ref","bool_type","bool_type","borrow","borrow","borrow_mut","borrow_mut","clone","clone_into","const_string","const_string","const_struct","const_struct","create","create_builder","create_builder","create_enum_attribute","create_enum_attribute","create_inline_asm","create_inline_asm","create_module","create_module","create_module_from_ir","create_module_from_ir","create_string_attribute","create_string_attribute","create_type_attribute","create_type_attribute","custom_width_int_type","custom_width_int_type","drop","eq","eq","eq","eq","f128_type","f128_type","f16_type","f16_type","f32_type","f32_type","f64_type","f64_type","fmt","fmt","from","from","get_global","get_kind_id","get_kind_id","get_struct_type","get_struct_type","i128_type","i128_type","i16_type","i16_type","i32_type","i32_type","i64_type","i64_type","i8_type","i8_type","insert_basic_block_after","insert_basic_block_after","into","into","metadata_node","metadata_node","metadata_string","metadata_string","metadata_type","metadata_type","opaque_struct_type","opaque_struct_type","ppc_f128_type","ppc_f128_type","prepend_basic_block","prepend_basic_block","ptr_sized_int_type","ptr_sized_int_type","ptr_type","ptr_type","struct_type","struct_type","to_owned","try_from","try_from","try_into","try_into","type_id","type_id","void_type","void_type","x86_f80_type","x86_f80_type","DataLayout","as_ptr","as_str","borrow","borrow_mut","eq","fmt","from","into","try_from","try_into","type_id","APPLE_BLOCK","APPLE_BLOCK","ARTIFICIAL","ARTIFICIAL","Ada2005","Ada2012","Ada83","Ada95","AsDIScope","BIT_FIELD","BIT_FIELD","BLISS","BORLANDDelphi","C","C11","C17","C89","C99","CPlusPlus","CPlusPlus03","CPlusPlus11","CPlusPlus14","CPlusPlus17","CPlusPlus20","Cobol74","Cobol85","Crystal","D","DIBasicType","DICompileUnit","DICompositeType","DIDerivedType","DIExpression","DIFile","DIFlags","DIFlagsConstants","DIFlagsConstants","DIGlobalVariableExpression","DILexicalBlock","DILocalVariable","DILocation","DINamespace","DIScope","DISubprogram","DISubroutineType","DIType","DWARFEmissionKind","DWARFSourceLanguage","DebugInfoBuilder","Dylan","EXPLICIT","EXPLICIT","FWD_DECL","FWD_DECL","Fortran03","Fortran08","Fortran18","Fortran77","Fortran90","Fortran95","Full","GOOGLERenderScript","Go","Haskell","INDIRECT_VIRTUAL_BASE","INDIRECT_VIRTUAL_BASE","INTRODUCED_VIRTUAL","INTRODUCED_VIRTUAL","Java","Julia","Kotlin","LLVMDWARFTypeEncoding","LVALUE_REFERENCE","LVALUE_REFERENCE","LineTablesOnly","MULTIPLE_INHERITANCE","MULTIPLE_INHERITANCE","MipsAssembler","Modula2","Modula3","Mojo","NO_RETURN","NO_RETURN","None","OBJC_CLASS_COMPLETE","OBJC_CLASS_COMPLETE","OBJECT_POINTER","OBJECT_POINTER","OCaml","ObjC","ObjCPlusPlus","OpenCL","PLI","PRIVATE","PRIVATE","PROTECTED","PROTECTED","PROTOTYPED","PROTOTYPED","PUBLIC","PUBLIC","Pascal83","Python","RESERVED","RESERVED","RVALUE_REFERENCE","RVALUE_REFERENCE","RenderScript","Rust","SINGLE_INHERITANCE","SINGLE_INHERITANCE","STATIC_MEMBER","STATIC_MEMBER","Swift","THUNK","THUNK","TYPE_PASS_BY_REFERENCE","TYPE_PASS_BY_REFERENCE","TYPE_PASS_BY_VALUE","TYPE_PASS_BY_VALUE","UPC","VECTOR","VECTOR","VIRTUAL","VIRTUAL","VIRTUAL_INHERITANCE","VIRTUAL_INHERITANCE","ZERO","ZERO","Zig","as_debug_info_scope","as_debug_info_scope","as_debug_info_scope","as_debug_info_scope","as_debug_info_scope","as_debug_info_scope","as_debug_info_scope","as_debug_info_scope","as_debug_info_scope","as_debug_info_scope","as_metadata_value","as_mut_ptr","as_mut_ptr","as_mut_ptr","as_mut_ptr","as_mut_ptr","as_mut_ptr","as_mut_ptr","as_mut_ptr","as_mut_ptr","as_mut_ptr","as_mut_ptr","as_mut_ptr","as_mut_ptr","as_mut_ptr","as_mut_ptr","as_type","as_type","as_type","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","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","create_array_type","create_auto_variable","create_basic_type","create_constant_expression","create_debug_location","create_expression","create_file","create_function","create_global_variable_expression","create_lexical_block","create_member_type","create_namespace","create_parameter_variable","create_placeholder_derived_type","create_pointer_type","create_reference_type","create_struct_type","create_subroutine_type","create_typedef","create_union_type","debug_metadata_version","drop","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","finalize","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","get_align_in_bits","get_column","get_file","get_line","get_offset_in_bits","get_scope","get_size_in_bits","hash","hash","insert_dbg_value_before","insert_declare_at_end","insert_declare_before_instruction","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","partial_cmp","partial_cmp","replace_placeholder_derived_type","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","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_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","ExecutionEngine","FunctionLookupError","FunctionNotFound","IncorrectModuleOwner","JITNotEnabled","JitFunction","LLVMError","ModuleNotOwned","RemoveModuleError","UnsafeFunctionPointer","add_global_mapping","add_module","as_mut_ptr","as_raw","borrow","borrow","borrow","borrow","borrow_mut","borrow_mut","borrow_mut","borrow_mut","call","call","call","call","call","call","call","call","call","call","call","call","call","call","cause","clone","clone","clone_into","clone_into","description","drop","eq","eq","eq","fmt","fmt","fmt","fmt","fmt","fmt","free_fn_machine_code","from","from","from","from","get_function","get_function_address","get_function_value","get_target_data","into","into","into","into","into_raw","link_in_interpreter","link_in_mc_jit","new","remove_module","run_function","run_function_as_main","run_static_constructors","run_static_destructors","to_owned","to_owned","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","Intrinsic","borrow","borrow_mut","clone","clone_into","eq","find","fmt","from","get_declaration","into","is_overloaded","to_owned","try_from","try_into","type_id","MemoryBuffer","as_mut_ptr","as_slice","borrow","borrow_mut","create_from_file","create_from_memory_range","create_from_memory_range_copy","create_from_stdin","create_object_file","drop","fmt","from","get_size","into","new","try_from","try_into","type_id","Append","AppendUnique","Appending","AvailableExternally","Common","DLLExport","DLLImport","Error","External","ExternalWeak","FlagBehavior","FunctionIterator","Ghost","GlobalIterator","Internal","LinkOnceAny","LinkOnceODR","LinkOnceODRAutoHide","Linkage","LinkerPrivate","LinkerPrivateWeak","Module","Override","Private","Require","Warning","WeakAny","WeakODR","add_basic_value_flag","add_function","add_global","add_global_metadata","add_metadata_flag","as_mut_ptr","borrow","borrow","borrow","borrow","borrow","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","clone","clone","clone","clone_into","clone_into","clone_into","cmp","cmp","create","create_debug_info_builder","create_execution_engine","create_interpreter_execution_engine","create_jit_execution_engine","drop","eq","eq","eq","fmt","fmt","fmt","fmt","fmt","from","from","from","from","from","from","from","get_context","get_data_layout","get_debug_metadata_version","get_first_function","get_first_global","get_flag","get_function","get_functions","get_global","get_global_metadata","get_global_metadata_size","get_globals","get_last_function","get_last_global","get_name","get_or_insert_comdat","get_source_file_name","get_struct_type","get_triple","hash","hash","into","into","into","into","into","into","into","into_iter","into_iter","link_in_module","new","next","next","parse_bitcode_from_buffer","parse_bitcode_from_path","partial_cmp","partial_cmp","print_to_file","print_to_stderr","print_to_string","run_in_pass_manager","run_passes","set_data_layout","set_inline_assembly","set_name","set_source_file_name","set_triple","strip_debug_info","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","verify","write_bitcode_to_file","write_bitcode_to_memory","write_bitcode_to_path","ObjectFile","Relocation","RelocationIterator","Section","SectionIterator","Symbol","SymbolIterator","as_mut_ptr","as_mut_ptr","as_mut_ptr","as_mut_ptr","as_mut_ptr","as_mut_ptr","as_mut_ptr","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","drop","drop","drop","drop","fmt","fmt","fmt","fmt","fmt","fmt","fmt","from","from","from","from","from","from","from","get_address","get_address","get_contents","get_name","get_name","get_offset","get_relocations","get_sections","get_symbols","get_symbols","get_type","get_value","into","into","into","into","into","into","into","into_iter","into_iter","into_iter","new","new","new","new","new","new","new","next","next","next","size","size","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","Input","PassBuilderOptions","PassManager","PassManagerSubType","as_mut_ptr","as_mut_ptr","borrow","borrow","borrow_mut","borrow_mut","create","create","create","drop","drop","finalize","fmt","fmt","from","from","initialize","into","into","new","run_in_pass_manager","run_on","set_call_graph_profile","set_debug_logging","set_forget_all_scev_in_loop_unroll","set_licm_mssa_no_acc_for_promotion_cap","set_licm_mssa_opt_cap","set_loop_interleaving","set_loop_slp_vectorization","set_loop_unrolling","set_loop_vectorization","set_merge_functions","set_verify_each","try_from","try_from","try_into","try_into","type_id","type_id","LLVMString","LoadLibraryError","LoadingError","UnicodeError","borrow","borrow","borrow_mut","borrow_mut","cause","clone","clone_into","deref","description","drop","enable_llvm_pretty_stack_trace","eq","eq","error_handling","fmt","fmt","fmt","fmt","from","from","get_llvm_version","into","into","is_multithreaded","load_library_permanently","load_visible_symbols","search_for_address_of_symbol","shutdown_llvm","to_owned","to_string","to_string","to_string","try_from","try_from","try_into","try_into","type_id","type_id","install_fatal_error_handler","reset_fatal_error_handler","Assembly","BigEndian","ByteOrdering","CodeModel","Default","Default","DynamicNoPic","FileType","InitializationConfig","JITDefault","Kernel","Large","LittleEndian","Medium","Object","PIC","RelocMode","Small","Static","Target","TargetData","TargetMachine","TargetMachineOptions","TargetTriple","add_analysis_passes","as_mut_ptr","as_mut_ptr","as_mut_ptr","as_ptr","as_str","asm_parser","asm_printer","base","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","clone","clone","clone","clone","clone","clone_into","clone_into","clone_into","clone_into","clone_into","create","create","create_target_machine","create_target_machine_from_options","default","default","default","default","disassembler","drop","drop","drop","element_at_offset","eq","eq","eq","eq","eq","eq","eq","eq","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","from","from","from","from","from","from","from","from","from","from","from_name","from_triple","get_abi_alignment","get_abi_size","get_bit_size","get_byte_ordering","get_call_frame_alignment","get_cpu","get_data_layout","get_default_triple","get_description","get_feature_string","get_first","get_host_cpu_features","get_host_cpu_name","get_name","get_next","get_pointer_byte_size","get_preferred_alignment","get_preferred_alignment_of_global","get_store_size","get_target","get_target_data","get_triple","has_asm_backend","has_jit","has_target_machine","info","initialize_aarch64","initialize_all","initialize_amd_gpu","initialize_arm","initialize_bpf","initialize_hexagon","initialize_lanai","initialize_loongarch","initialize_mips","initialize_msp430","initialize_native","initialize_nvptx","initialize_power_pc","initialize_riscv","initialize_sparc","initialize_system_z","initialize_webassembly","initialize_x86","initialize_x_core","into","into","into","into","into","into","into","into","into","into","machine_code","new","new","new","new","new","normalize_triple","offset_of_element","ptr_sized_int_type_in_context","set_abi","set_asm_verbosity","set_code_model","set_cpu","set_features","set_level","set_reloc_mode","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_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","write_to_file","write_to_memory_buffer","Alphanumeric","AnyType","AnyTypeEnum","ArrayType","ArrayType","ArrayType","ArrayType","AsTypeRef","BasicMetadataTypeEnum","BasicType","BasicTypeEnum","Binary","Decimal","FieldTypesIter","FloatMathType","FloatType","FloatType","FloatType","FloatType","FunctionType","FunctionType","Hexadecimal","IntMathType","IntType","IntType","IntType","IntType","MathConvType","MathConvType","MetadataType","MetadataType","Octal","PointerMathType","PointerType","PointerType","PointerType","PointerType","PtrConvType","PtrConvType","StringRadix","StructType","StructType","StructType","StructType","ValueType","ValueType","ValueType","VectorType","VectorType","VectorType","VectorType","VoidType","VoidType","array_type","array_type","array_type","array_type","array_type","array_type","array_type","array_type","as_any_type_enum","as_any_type_enum","as_basic_type_enum","as_basic_type_enum","as_type_ref","as_type_ref","as_type_ref","as_type_ref","as_type_ref","as_type_ref","as_type_ref","as_type_ref","as_type_ref","as_type_ref","as_type_ref","as_type_ref","as_type_ref","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","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","const_all_ones","const_array","const_array","const_array","const_array","const_array","const_array","const_float","const_float_from_string","const_int","const_int_arbitrary_precision","const_int_from_string","const_named_struct","const_null","const_vector","const_zero","const_zero","const_zero","const_zero","const_zero","const_zero","const_zero","count_fields","count_param_types","create_generic_value","create_generic_value","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","fn_type","fn_type","fn_type","fn_type","fn_type","fn_type","fn_type","fn_type","fn_type","fn_type","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","get_address_space","get_alignment","get_alignment","get_alignment","get_alignment","get_alignment","get_alignment","get_bit_width","get_context","get_context","get_context","get_context","get_context","get_context","get_context","get_context","get_context","get_element_type","get_element_type","get_field_type_at_index","get_field_type_at_index_unchecked","get_field_types","get_field_types_iter","get_name","get_param_types","get_poison","get_poison","get_poison","get_poison","get_poison","get_poison","get_return_type","get_size","get_undef","get_undef","get_undef","get_undef","get_undef","get_undef","hash","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into_array_type","into_array_type","into_array_type","into_float_type","into_float_type","into_float_type","into_function_type","into_int_type","into_int_type","into_int_type","into_iter","into_metadata_type","into_pointer_type","into_pointer_type","into_pointer_type","into_struct_type","into_struct_type","into_struct_type","into_vector_type","into_vector_type","into_vector_type","into_void_type","is_array_type","is_array_type","is_array_type","is_float_type","is_float_type","is_float_type","is_function_type","is_int_type","is_int_type","is_int_type","is_metadata_type","is_opaque","is_opaque","is_packed","is_pointer_type","is_pointer_type","is_pointer_type","is_sized","is_sized","is_sized","is_sized","is_struct_type","is_struct_type","is_struct_type","is_var_arg","is_vector_type","is_vector_type","is_vector_type","is_void_type","len","matches_str","new","new","new","new","new","new","new","new","new","new","new","next","print_to_string","print_to_string","print_to_string","print_to_string","print_to_string","print_to_string","print_to_string","print_to_string","print_to_string","print_to_string","print_to_string","print_to_string","print_to_string","print_to_string","ptr_type","ptr_type","ptr_type","ptr_type","ptr_type","ptr_type","ptr_type","ptr_type","ptr_type","set_body","size_of","size_of","size_of","size_of","size_of","size_of","size_of","size_of","size_of","to_owned","to_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_string","to_string","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_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_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","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","vec_type","vec_type","vec_type","AShr","Add","AddrSpaceCast","AggregateValue","AggregateValueEnum","Alloca","And","AnyValue","AnyValueEnum","ArrayValue","ArrayValue","ArrayValue","ArrayValue","ArrayValue","AsValueRef","AtomicCmpXchg","AtomicRMW","BaseType","BaseType","BaseType","BasicMetadataValueEnum","BasicValue","BasicValueEnum","BasicValueUse","BitCast","Br","Call","CallBr","CallSiteValue","CatchPad","CatchRet","CatchSwitch","CleanupPad","CleanupRet","ExtractElement","ExtractValue","FAdd","FCmp","FDiv","FIRST_CUSTOM_METADATA_KIND_ID","FMul","FNeg","FPExt","FPToSI","FPToUI","FPTrunc","FRem","FSub","Fence","FieldValueIter","FloatMathValue","FloatValue","FloatValue","FloatValue","FloatValue","Freeze","FunctionValue","FunctionValue","GenericValue","GetElementPtr","Global","GlobalValue","ICmp","IncomingIter","IndirectBr","InsertElement","InsertValue","InstructionOpcode","InstructionValue","InstructionValue","IntMathValue","IntToPtr","IntValue","IntValue","IntValue","IntValue","Invoke","LLVMTailCallKind","LLVMTailCallKindMustTail","LLVMTailCallKindNoTail","LLVMTailCallKindNone","LLVMTailCallKindTail","LShr","LandingPad","Load","Local","MetadataValue","MetadataValue","MetadataValue","Mul","None","OperandIter","OperandUseIter","Or","Phi","PhiValue","PhiValue","PointerMathValue","PointerValue","PointerValue","PointerValue","PointerValue","PtrToInt","Resume","Return","SDiv","SExt","SIToFP","SRem","Select","Shl","ShuffleVector","Store","StructValue","StructValue","StructValue","StructValue","StructValue","Sub","Switch","Trunc","UDiv","UIToFP","URem","UnnamedAddress","Unreachable","UserOp1","UserOp2","VAArg","VectorValue","VectorValue","VectorValue","VectorValue","Xor","ZExt","add_attribute","add_attribute","add_incoming","as_aggregate_value_enum","as_aggregate_value_enum","as_any_value_enum","as_any_value_enum","as_basic_value","as_basic_value_enum","as_basic_value_enum","as_float","as_global_value","as_instruction","as_instruction","as_instruction","as_instruction","as_instruction","as_instruction","as_instruction","as_instruction_value","as_instruction_value","as_int","as_pointer_value","as_value_ref","as_value_ref","as_value_ref","as_value_ref","as_value_ref","as_value_ref","as_value_ref","as_value_ref","as_value_ref","as_value_ref","as_value_ref","as_value_ref","as_value_ref","as_value_ref","as_value_ref","as_value_ref","as_value_ref","attributes","attributes","borrow","borrow","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","can_use_fast_math_flags","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","cmp","const_add","const_address_space_cast","const_bit_cast","const_cast","const_compare","const_extract_element","const_gep","const_in_bounds_gep","const_insert_element","const_int_compare","const_mul","const_neg","const_not","const_nsw_add","const_nsw_mul","const_nsw_neg","const_nsw_sub","const_nuw_add","const_nuw_mul","const_nuw_neg","const_nuw_sub","const_shl","const_shuffle_vector","const_sub","const_to_int","const_to_pointer","const_truncate","const_truncate_or_bit_cast","const_xor","count_arguments","count_attributes","count_attributes","count_basic_blocks","count_fields","count_incoming","count_params","create","create_generic_value_of_pointer","delete","delete","drop","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","erase_from_basic_block","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","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","get_alignment","get_alignment","get_allocated_type","get_atomic_ordering","get_basic_block_iter","get_basic_blocks","get_call_convention","get_call_conventions","get_called_fn_value","get_comdat","get_constant","get_disjoint_flag","get_dll_storage_class","get_element_as_constant","get_enum_attribute","get_enum_attribute","get_fast_math_flags","get_fcmp_predicate","get_field_at_index","get_field_at_index_unchecked","get_fields","get_first_basic_block","get_first_param","get_first_use","get_first_use","get_first_use","get_gc","get_icmp_predicate","get_incoming","get_incoming_unchecked","get_incomings","get_initializer","get_instruction_with_name","get_intrinsic_id","get_last_basic_block","get_last_param","get_linkage","get_linkage","get_metadata","get_name","get_name","get_name","get_name","get_name","get_name","get_name","get_name","get_name","get_name","get_name","get_name","get_next_function","get_next_global","get_next_instruction","get_next_use","get_node_size","get_node_values","get_non_negative_flag","get_nth_param","get_num_operands","get_opcode","get_operand","get_operand_unchecked","get_operand_use","get_operand_use_unchecked","get_operand_uses","get_operands","get_param_iter","get_params","get_parent","get_personality_function","get_previous_function","get_previous_global","get_previous_instruction","get_section","get_section","get_sign_extended_constant","get_string_attribute","get_string_attribute","get_string_constant","get_string_value","get_subprogram","get_tail_call_kind","get_tail_call_kind","get_thread_local_mode","get_type","get_type","get_type","get_type","get_type","get_type","get_type","get_type","get_type","get_type","get_unnamed_address","get_used_value","get_user","get_value_type","get_visibility","get_volatile","get_zero_extended_constant","has_metadata","has_personality_function","has_unnamed_addr","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","int_width","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into_array_value","into_array_value","into_array_value","into_array_value","into_float_value","into_float_value","into_float_value","into_function_value","into_instruction_value","into_int_value","into_int_value","into_int_value","into_iter","into_iter","into_iter","into_iter","into_metadata_value","into_phi_value","into_pointer","into_pointer_value","into_pointer_value","into_pointer_value","into_struct_value","into_struct_value","into_struct_value","into_struct_value","into_vector_value","into_vector_value","into_vector_value","is_array_value","is_array_value","is_array_value","is_array_value","is_conditional","is_const","is_const","is_const","is_const","is_const","is_const_string","is_constant","is_constant_data_vector","is_constant_int","is_constant_vector","is_declaration","is_externally_initialized","is_float_value","is_float_value","is_float_value","is_function_value","is_instruction_value","is_int_value","is_int_value","is_int_value","is_metadata_value","is_node","is_null","is_null","is_null","is_null","is_null","is_null","is_null","is_null","is_phi_value","is_pointer_value","is_pointer_value","is_pointer_value","is_poison","is_poison","is_string","is_struct_value","is_struct_value","is_struct_value","is_struct_value","is_tail_call","is_tail_call","is_terminator","is_thread_local","is_undef","is_undef","is_undef","is_undef","is_undef","is_undef","is_undef","is_undef","is_vector_value","is_vector_value","is_vector_value","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","next","next","next","partial_cmp","print_to_stderr","print_to_stderr","print_to_stderr","print_to_stderr","print_to_stderr","print_to_stderr","print_to_stderr","print_to_stderr","print_to_string","print_to_string","remove_enum_attribute","remove_enum_attribute","remove_from_basic_block","remove_string_attribute","remove_string_attribute","replace_all_uses_with","replace_all_uses_with","replace_all_uses_with","replace_all_uses_with","replace_all_uses_with","replace_all_uses_with","replace_all_uses_with","replace_all_uses_with","replace_all_uses_with","replace_all_uses_with","run_in_pass_manager","set_alignment","set_alignment","set_alignment_attribute","set_atomic_ordering","set_call_convention","set_call_conventions","set_comdat","set_constant","set_disjoint_flag","set_dll_storage_class","set_externally_initialized","set_fast_math_flags","set_field_at_index","set_gc","set_initializer","set_linkage","set_linkage","set_metadata","set_metadata","set_name","set_name","set_name","set_name","set_name","set_name","set_name","set_name","set_name","set_name","set_name","set_name","set_non_negative_flag","set_operand","set_param_alignment","set_personality_function","set_section","set_section","set_subprogram","set_tail_call","set_tail_call_kind","set_thread_local","set_thread_local_mode","set_unnamed_addr","set_unnamed_address","set_visibility","set_volatile","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_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_string","to_string","to_string","to_string","to_string","to_string","to_string","to_string","to_string","to_string","to_string","to_string","try_as_basic_value","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_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","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","verify","view_function_cfg","view_function_cfg_only"],"q":[[0,"inkwell"],[253,"inkwell::attributes"],[295,"inkwell::basic_block"],[339,"inkwell::builder"],[477,"inkwell::comdat"],[517,"inkwell::context"],[619,"inkwell::data_layout"],[631,"inkwell::debug_info"],[1047,"inkwell::execution_engine"],[1137,"inkwell::intrinsics"],[1153,"inkwell::memory_buffer"],[1172,"inkwell::module"],[1317,"inkwell::object_file"],[1418,"inkwell::passes"],[1461,"inkwell::support"],[1503,"inkwell::support::error_handling"],[1505,"inkwell::targets"],[1721,"inkwell::types"],[2211,"inkwell::values"],[3178,"core::cmp"],[3179,"core::fmt"],[3180,"core::fmt"],[3181,"llvm_sys"],[3182,"core::option"],[3183,"core::result"],[3184,"core::any"],[3185,"llvm_sys::prelude"],[3186,"core::ffi::c_str"],[3187,"llvm_sys::prelude"],[3188,"llvm_sys::prelude"],[3189,"llvm_sys::prelude"],[3190,"libc::unix::linux_like::linux::gnu::b64::x86_64"],[3191,"llvm_sys::prelude"],[3192,"alloc::vec"],[3193,"libc::unix"],[3194,"llvm_sys::debuginfo"],[3195,"llvm_sys::debuginfo"],[3196,"core::marker"],[3197,"core::error"],[3198,"core::clone"],[3199,"alloc::rc"],[3200,"libc::unix"],[3201,"llvm_sys::prelude"],[3202,"llvm_sys"],[3203,"core::convert"],[3204,"std::fs"],[3205,"llvm_sys::object"],[3206,"llvm_sys::object"],[3207,"core::fmt"],[3208,"llvm_sys::target_machine"],[3209,"llvm_sys::prelude"],[3210,"llvm_sys::prelude"]],"d":["","","","Adds to the value in memory and returns the prior value.","Defines the address space in which a global will be …","","Bitwise and into memory and returns the prior value.","","","","","","","Equal","","Adds to the float-typed value in memory and returns the …","Sets memory to the greater of the two float-typed values, …","Sets memory to the lesser of the two float-typed values, …","Subtract a float-typed value off the value in memory and …","Defines how to compare a left and right FloatValue.","","","","","","","This enum defines how to compare a left and right IntValue.","","","","","Sets memory to the signed-greater of the value provided …","Sets memory to the signed-lesser of the value provided and …","","Not Equal","Bitwise nands into memory and returns the prior value.","","","Returns true if left == right and neither are NaN","Returns true if left >= right and neither are NaN","Returns true if left > right and neither are NaN","Returns true if left <= right and neither are NaN","Returns true if left < right and neither are NaN","Returns true if left != right and neither are NaN","Returns true if neither value is NaN","Defines the optimization level used to compile a Module.","Bitwise ors into memory and returns the prior value.","Always returns false","Always returns true","","","Signed Greater Than or Equal","Signed Greater Than","Signed Less Than or Equal","Signed Less Than","","Subtract a value off the value in memory and returns the …","","Returns true if left == right or either is NaN","Unsigned Greater Than or Equal","Returns true if left >= right or either is NaN","Unsigned Greater Than","Returns true if left > right or either is NaN","Unsigned Less Than or Equal","Returns true if left <= right or either is NaN","Unsigned Less Than","Returns true if left < right or either is NaN","Sets memory to the unsigned-greater of the value provided …","Sets memory to the unsigned-lesser of the value provided …","Returns true if left != right or either is NaN","Returns true if either value is NaN","","Stores to memory and returns the prior value.","Bitwise xors into memory and returns the prior value.","Attributes are optional modifiers to functions, function …","A BasicBlock is a container of instructions.","","","","","","","","","","","","","","","","","","","","","A Builder enables you to build instructions.","","","","","","","","","","","","","","","","","","","","","","","","","","","","A Comdat helps resolve linker errors for duplicate …","A Context is an opaque owner and manager of core global …","","Debug symbols - DebugInfoBuilder interface","","Returns the default value for OptimizationLevel, namely …","Returns the default value for GlobalVisibility, namely …","Returns the default value for DLLStorageClass, namely …","","","","","","","","","","","","","","","","","","","","","","Returns the argument unchanged.","","Returns the argument unchanged.","","","Returns the argument unchanged.","","Returns the argument unchanged.","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).","","","","A Module represents a single code compilation unit.","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","A type is a classification which determines how data is …","A value is an instance of a type.","Functions, function parameters, and return types can have …","An AttributeLoc determines where on a function an …","Assign to the FunctionValue itself.","Assign to one of the FunctionValue’s params (0-indexed).","Assign to the FunctionValue’s return type.","Acquires the underlying raw pointer belonging to this …","","","","","","","","","","","","","Returns the argument unchanged.","Returns the argument unchanged.","Gets the kind id associated with an enum Attribute.","Gets the value associated with an enum Attribute.","Gets the last enum kind id associated with builtin names.","Gets the enum kind id associated with a builtin name.","Gets the string kind id associated with a string attribute.","Gets the string value associated with a string attribute.","Gets the type associated with a type attribute.","","Calls U::from(self).","Calls U::from(self).","Determines whether or not an Attribute is an enum. This …","Determines whether or not an Attribute is a string. This …","Determines whether or not an Attribute is a type …","Creates a new Attribute from a raw pointer.","","","","","","","","","A BasicBlock is a container of instructions.","Iterate over all InstructionValues in a basic block.","Acquires the underlying raw pointer belonging to this …","","","","","","","Removes this BasicBlock completely from memory. This is …","","","","Returns the argument unchanged.","Returns the argument unchanged.","Gets the address of this BasicBlock if possible. Returns …","Obtains the ContextRef this BasicBlock belongs to.","Obtains the first InstructionValue in this BasicBlock, if …","Gets the first use of this BasicBlock if any.","Performs a linear lookup to obtain a instruction based on …","Get an instruction iterator","Obtains the last InstructionValue in this BasicBlock, if …","Gets the name of a BasicBlock.","Gets the BasicBlock succeeding the current one, in its own …","Obtains the FunctionValue that this BasicBlock belongs to, …","Gets the BasicBlock preceding the current one, in its own …","Obtains the terminating InstructionValue in this BasicBlock…","","Calls U::from(self).","Calls U::from(self).","","Appends one BasicBlock after another. It returns Err(()) …","Prepends one BasicBlock before another. It returns Err(()) …","","Removes this BasicBlock from its parent FunctionValue. It …","Replaces all uses of this basic block with another.","Set name of the BasicBlock.","","","","","","","","","","All build_* methods return a Result<_, BuilderError> type …","Errors that can be generated by the Builder. All build_* …","","","","","","","","Acquires the underlying raw pointer belonging to this …","","","","","","Builds a function return instruction for a return type …","","","","Returns Err(BuilderError::AlignmentError) if the type is …","Builds an atomicrmw instruction. It allows you to …","Builds a bitcast instruction. A bitcast reinterprets the …","Builds a function call instruction. Alias for …","","Builds a cmpxchg instruction. It allows you to atomically …","","Builds a function call instruction. The function being …","","Builds an extract element instruction which extracts a …","Builds an extract value instruction which extracts a …","","","","","","","","","","","","","","","GEP is very likely to segfault if indexes are used …","","","GEP is very likely to segfault if indexes are used …","","Call a function pointer. Because a pointer does not carry …","","Builds an insert element instruction which inserts a …","Builds an insert value instruction which inserts a …","","","Like build_int_cast, but respects the signedness of the …","","","","","","","","","","","","","","","","","","","","","","","","","An invoke is similar to a normal function call, but used to","","","Landing pads are places where control flow jumps to if a …","Builds an IntValue containing the result of a logical left …","Builds a load2 instruction. It allows you to retrieve a …","Returns Err(BuilderError::AlignmentError) if the type is …","Build a memcpy instruction.","Build a memmove instruction.","Build a memset instruction.","","","","","Builds an instruction which calculates the difference of …","","Resume propagation of an existing (in-flight) exception …","Builds a function return instruction. It should be …","Builds an IntValue containing the result of a right shift …","","","","Builds a store instruction. It allows you to store a value …","Builds a GEP instruction on a struct pointer. Returns Err …","","","","","","","","","","","","","Returns the argument unchanged.","Returns the argument unchanged.","Get the debug info source location of the instruction …","","","Calls U::from(self).","Calls U::from(self).","","Set the position of the builder to after an instruction.","Set the position of the builder to the end of a basic …","Set the position of the builder to before an instruction.","Set the debug info source location of the instruction …","","","","","","","","Unset the debug info source location of the instruction …","The linker may choose any COMDAT.","A Comdat determines how to resolve duplicate sections when …","Determines how linker conflicts are to be resolved.","The data referenced by the COMDAT must be the same.","The linker will choose the largest COMDAT.","No other Module may specify this COMDAT.","The data referenced by the COMDAT must be the same size.","Acquires the underlying raw pointer belonging to this …","","","","","","","","","","","","","","Returns the argument unchanged.","","Returns the argument unchanged.","Gets what kind of Comdat this is.","","Calls U::from(self).","","Calls U::from(self).","Creates a new Comdat type from a raw pointer.","","Sets what kind of Comdat this should be.","","","","","","","","","This trait abstracts an LLVM Context type and should be …","A Context is a container for all LLVM entities including …","A ContextRef is a smart pointer allowing borrowed access …","Append a named BasicBlock at the end of the referenced …","Append a named BasicBlock at the end of the referenced …","Returns the internal LLVM reference behind the type","Acquires the underlying raw pointer belonging to this …","Acquires the underlying raw pointer belonging to this …","Gets the IntType representing 1 bit width. It will be …","Gets the IntType representing 1 bit width. It will be …","","","","","","","Creates a const string which may be null terminated.","Creates a const string which may be null terminated.","Creates a constant StructValue from constant values.","Creates a constant StructValue from constant values.","Creates a new Context.","Creates a new Builder for a Context.","Creates a new Builder for a Context.","Creates an enum Attribute in this Context.","Creates an enum Attribute in this Context.","Creates a inline asm function pointer.","Creates a inline asm function pointer.","Creates a new Module for a Context.","Creates a new Module for a Context.","Creates a new Module for the current Context from a …","Creates a new Module for the current Context from a …","Creates a string Attribute in this Context.","Creates a string Attribute in this Context.","Create an enum Attribute with an AnyTypeEnum attached to …","Create an enum Attribute with an AnyTypeEnum attached to …","Gets the IntType representing a custom bit width. It will …","Gets the IntType representing a custom bit width. It will …","","","","","","Gets the FloatType representing a 128 bit width. It will …","Gets the FloatType representing a 128 bit width. It will …","Gets the FloatType representing a 16 bit width. It will be …","Gets the FloatType representing a 16 bit width. It will be …","Gets the FloatType representing a 32 bit width. It will be …","Gets the FloatType representing a 32 bit width. It will be …","Gets the FloatType representing a 64 bit width. It will be …","Gets the FloatType representing a 64 bit width. It will be …","","","Returns the argument unchanged.","Returns the argument unchanged.","Gets a Mutex<Context> which points to the global context …","Obtains the index of a metadata kind id. If the string …","Obtains the index of a metadata kind id. If the string …","Gets a named StructType from this Context.","Gets a named StructType from this Context.","Gets the IntType representing 128 bit width. It will be …","Gets the IntType representing 128 bit width. It will be …","Gets the IntType representing 16 bit width. It will be …","Gets the IntType representing 16 bit width. It will be …","Gets the IntType representing 32 bit width. It will be …","Gets the IntType representing 32 bit width. It will be …","Gets the IntType representing 64 bit width. It will be …","Gets the IntType representing 64 bit width. It will be …","Gets the IntType representing 8 bit width. It will be …","Gets the IntType representing 8 bit width. It will be …","Append a named BasicBlock after the referenced BasicBlock.","Append a named BasicBlock after the referenced BasicBlock.","Calls U::from(self).","Calls U::from(self).","Creates a MetadataValue tuple of heterogeneous types (a “…","Creates a MetadataValue tuple of heterogeneous types (a “…","Creates a MetadataValue string for the current context. It …","Creates a MetadataValue string for the current context. It …","Gets the MetadataType representing 128 bit width. It will …","Gets the MetadataType representing 128 bit width. It will …","Creates an opaque StructType with no type definition yet …","Creates an opaque StructType with no type definition yet …","Gets the FloatType representing a 128 bit width. It will …","Gets the FloatType representing a 128 bit width. It will …","Prepend a named BasicBlock before the referenced BasicBlock…","Prepend a named BasicBlock before the referenced BasicBlock…","Gets the IntType representing a bit width of a pointer. It …","Gets the IntType representing a bit width of a pointer. It …","Gets the PointerType. It will be assigned the current …","Gets the PointerType. It will be assigned the current …","Creates a StructType definition from heterogeneous types …","Creates a StructType definition from heterogeneous types …","","","","","","","","Gets the VoidType. It will be assigned the current context.","Gets the VoidType. It will be assigned the current context.","Gets the FloatType representing a 80 bit width. It will be …","Gets the FloatType representing a 80 bit width. It will be …","","","","","","","","Returns the argument unchanged.","Calls U::from(self).","","","","","","","","","","","","Specific scopes (i.e. DILexicalBlock) can be turned into a …","","","","","","","","","","","","","","","","","","","","A primitive debug info type created by create_basic_type …","Compilation unit scope for debug info","A wrapper around an array of types, such as a union or …","A wrapper around a single type, such as a typedef or …","https://llvm.org/docs/LangRef.html#diexpression","Source file scope for debug info","","","","","Lexical block scope for debug info","Metadata representing a variable inside a scope","A debug location within the source code. Contains the …","Namespace scope for debug info","Any kind of debug information scope (i.e. visibility of a …","Function body scope for debug info","Metadata representing the type of a function","Any kind of debug info type","The amount of debug information to emit. Corresponds to …","Source languages known by DWARF. Corresponds to …","A builder object to create debug info metadata. Used along …","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","Acquires the underlying raw pointer belonging to this …","Acquires the underlying raw pointer belonging to this …","Acquires the underlying raw pointer belonging to this …","Acquires the underlying raw pointer belonging to this …","Acquires the underlying raw pointer belonging to this …","Acquires the underlying raw pointer belonging to this …","Acquires the underlying raw pointer belonging to this …","","Acquires the underlying raw pointer belonging to this …","Acquires the underlying raw pointer belonging to this …","Acquires the underlying raw pointer belonging to this …","Acquires the underlying raw pointer belonging to this …","Acquires the underlying raw pointer belonging to this …","Acquires the underlying raw pointer belonging to this …","Acquires the underlying raw pointer belonging to this …","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","Creates an array type","Create local automatic storage variable.","Create a primitive basic type. encoding is an unsigned int …","","Create a debug location.","Create an expression","Create a file scope.","A DIFunction provides an anchor for all debugging …","","Create a lexical block scope.","Create a type for a non-static member.","","Create function parameter variable.","Construct a placeholders derived type to be used when …","Creates a pointer type","Creates a pointer type","Create a struct type.","Create a function type","Create a typedef (alias) of ditype","Create union type of multiple types.","Gets the version of debug metadata produced by the current …","","","","","","","","","","","","","","","","","","","","Construct any deferred debug info descriptors. May …","","","","","","","","","","","","","","","","","","","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","","","Returns the argument unchanged.","","","","","","","","","","Insert a new llvm.dbg.value intrinsic call before an …","Insert a variable declaration (llvm.dbg.declare intrinsic) …","Insert a variable declaration (llvm.dbg.declare) before a …","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","","","Calls U::from(self).","","","Deletes a placeholder, replacing all uses of it with …","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","A reference-counted wrapper around LLVM’s execution …","","","","","A wrapper around a function pointer which ensures the …","","","","Marker trait representing an unsafe function pointer (…","Maps the specified value to an address.","Adds a module to an ExecutionEngine.","Acquires the underlying raw pointer belonging to this …","Returns the raw function pointer. This function is unsafe …","","","","","","","","","This method allows you to call the underlying function …","This method allows you to call the underlying function …","This method allows you to call the underlying function …","This method allows you to call the underlying function …","This method allows you to call the underlying function …","This method allows you to call the underlying function …","This method allows you to call the underlying function …","This method allows you to call the underlying function …","This method allows you to call the underlying function …","This method allows you to call the underlying function …","This method allows you to call the underlying function …","This method allows you to call the underlying function …","This method allows you to call the underlying function …","This method allows you to call the underlying function …","","","","","","","","","","","","","","","","","","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Try to load a function from the execution engine.","Attempts to look up a function’s address by its name. …","","","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Returns the raw function pointer, consuming self in the …","This function probably doesn’t need to be called, but is …","This function probably doesn’t need to be called, but is …","","","","","","","","","","","","","","","","","","","","","","","","","","","","","Find llvm intrinsic id from name","","Returns the argument unchanged.","Create or insert the declaration of an intrinsic.","Calls U::from(self).","Check if specified intrinsic is overloaded","","","","","","","Gets a byte slice of this MemoryBuffer.","","","","This function is likely slightly cheaper than …","This will create a new MemoryBuffer from the given input.","","Convert this MemoryBuffer into an ObjectFile. LLVM does …","","","Returns the argument unchanged.","Gets the byte size of this MemoryBuffer.","Calls U::from(self).","","","","","Appends the two values, which are required to be metadata …","Appends the two values, which are required to be metadata …","Appending linkage may only be applied to global variables …","Globals with AvailableExternally linkage are never emitted …","Common linkage is most similar to “weak” linkage, but …","DLLExport causes the compiler to provide a global pointer …","DLLImport causes the compiler to reference a function or …","Emits an error if two values disagree, otherwise the …","If none of the other identifiers are used, the global is …","The semantics of this linkage follow the ELF object file …","Defines the operational behavior for a module wide flag. …","Iterate over all FunctionValues in an llvm module","FIXME: Unknown linkage type","Iterate over all GlobalValues in an llvm module","Similar to private, but the value shows as a local symbol …","Globals with LinkOnceAny linkage are merged with other …","Some languages allow differing globals to be merged, such …","FIXME: Unknown linkage type","This enum defines how to link a global variable or …","FIXME: Unknown linkage type","FIXME: Unknown linkage type","Represents a reference to an LLVM Module. The underlying …","Uses the specified value, regardless of the behavior or …","Global values with Private linkage are only directly …","Adds a requirement that another module flag be present and …","Emits a warning if two values disagree. The result value …","WeakAny linkage has the same merging semantics as linkonce …","Some languages allow differing globals to be merged, such …","Append a BasicValue as a module wide flag. Note that using …","Creates a function given its name and ty, adds it to the …","Creates a GlobalValue based on a type in an address space.","Appends a MetaDataValue to a global list indexed by a …","Append a MetadataValue as a module wide flag. Note that …","Acquires the underlying raw pointer belonging to this …","","","","","","","","","","","","","","","","","","","","Creates a DebugInfoBuilder for this Module.","Creates an ExecutionEngine from this Module.","Creates an interpreter ExecutionEngine from this Module.","Creates a JIT ExecutionEngine from this Module.","","","","","","","","","","","Returns the argument unchanged.","Returns the argument unchanged.","","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Gets the Context from which this Module originates.","Gets a smart pointer to the DataLayout belonging to a …","Gets the version of debug metadata contained in this Module…","Gets the first FunctionValue defined in this Module.","Gets the first GlobalValue in a module.","Gets the MetadataValue flag associated with the key in …","Gets a FunctionValue defined in this Module by its name.","An iterator over the functions in this Module.","Gets a named GlobalValue in a module.","Obtains the global MetaDataValue node indexed by key, …","Obtains the number of MetaDataValues indexed by a …","An iterator over the globals in this Module.","Gets the last FunctionValue defined in this Module.","Gets the last GlobalValue in a module.","Gets the name of this Module.","Gets the Comdat associated with a particular name. If it …","Gets the source file name. It defaults to the module …","Gets a named StructType from this Module’s Context.","Gets the TargetTriple assigned to this Module. If none has …","","","Calls U::from(self).","","Calls U::from(self).","Calls U::from(self).","","Calls U::from(self).","Calls U::from(self).","","","Links one module into another. This will merge two Modules …","Get a module from an LLVMModuleRef.","","","Creates a new Module from a MemoryBuffer with bitcode.","A convenience function for creating a Module from a …","","","Prints the content of the Module to a file.","Prints the content of the Module to stderr.","Prints the content of the Module to an LLVMString.","","Construct and run a set of passes over a module. This …","Sets the DataLayout for a particular Module.","Sets the inline assembly for the Module.","Assigns the name of this Module.","Sets the source file name. It defaults to the module …","Assigns a TargetTriple to this Module.","Strips and debug info from the module, if it exists.","","","","Prints the content of the Module to a String.","","","","","","","","","","","","","","","","Ensures that the current Module is valid, and returns a …","write_bitcode_to_path should be preferred over this …","Writes this Module to a MemoryBuffer.","Writes a Module to a Path.","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","Returns the argument unchanged.","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).","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","A manager for running optimization and simplification …","","Acquires the underlying raw pointer belonging to this …","Acquires the underlying raw pointer belonging to this …","","","","","","","Create a new set of options for a PassBuilder","","","","","","Returns the argument unchanged.","Returns the argument unchanged.","","Calls U::from(self).","Calls U::from(self).","","","This method returns true if any of the passes modified the …","","Toggle debug logging when running the PassBuilder.","","","","","","","","","Toggle adding the VerifierPass for the PassBuilder, …","","","","","","","An owned LLVM String. Also known as a LLVM Message","Possible errors that can occur when loading a library","The given path could not be loaded as a library","The given path could not be converted to a &str","","","","","","","","","","","","","","This module contains some supplemental functions for …","","","","","Returns the argument unchanged.","Returns the argument unchanged.","Returns the major, minor, and patch version of the LLVM in …","Calls U::from(self).","Calls U::from(self).","Determines whether or not LLVM has been configured to run …","Permanently load the dynamic library at the given path.","Permanently loads all the symbols visible inside the …","Search through all previously loaded dynamic libraries for …","This function is very unsafe. Any reference to LLVM data …","","This is a convenience method for creating a Rust String, …","","","","","","","","","Installs an error handler to be called before LLVM exits.","Resets LLVM’s fatal error handler back to the default","","","","","","","","","","","","","","","","","","","","","","","LLVM target machine options provide another way to create …","","","Acquires the underlying raw pointer belonging to this …","Acquires the underlying raw pointer belonging to this …","Acquires the underlying raw pointer belonging to this …","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","Create a target machine from given TargetMachineOptions.","","","","","","","","","","","","","","","","","","","","","","","","","","","","","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","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 the default triple for the current system.","","","","Gets a comma separated list of supported features by the …","Gets a string containing the host CPU’s name (triple).","","","","","","","","Create TargetData from this target machine","","","","","","","","","","","","","","","","","","","","","","","","","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","","","","","","","","","Gets the IntType representing a bit width of a pointer. It …","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","Saves a TargetMachine to a file.","Writes a TargetMachine to a MemoryBuffer.","Alphanumeric, 0-9 and all 26 letters in upper or lowercase.","Represents any LLVM type.","A wrapper for any BasicType, VoidType, or FunctionType.","An ArrayType is the type of contiguous constants or …","A contiguous homogeneous container type.","A contiguous homogeneous container type.","","Accessor to the inner LLVM type reference","","Represents a basic LLVM type, that may be used in …","A wrapper for any BasicType.","Binary 0 or 1","Decimal 0-9","Iterate over all BasicTypeEnums in a struct.","Represents an LLVM type that can have floating point math …","A FloatType is the type of a floating point constant or …","A floating point type.","A floating point type.","","A FunctionType is the type of a function variable.","A function return and parameter definition.","Hexadecimal with upper or lowercase letters up to F.","Represents an LLVM type that can have integer math …","An IntType is the type of an integer constant or variable.","An integer type.","An integer type.","","The type for int to float or int vector to float vector …","The type for float to int or float vector to int vector …","A MetadataType is the type of a metadata.","","Octal 0-7","Represents an LLVM type that can have pointer operations …","A PointerType is the type of a pointer constant or …","A pointer type.","A pointer type.","","The type for int to pointer or int vector to pointer …","The type for pointer to int or pointer vector to int …","How to interpret a string or digits used to construct an …","A StructType is the type of a heterogeneous container of …","A contiguous heterogeneous container type.","A contiguous heterogeneous container type.","","The value instance of an int or int vector type.","The value instance of a float or float vector type.","The value instance of a pointer type.","A VectorType is the type of a multiple value SIMD constant …","A contiguous homogeneous “SIMD” container type.","A contiguous homogeneous “SIMD” container type.","","A VoidType is a special type with no possible direct …","A valueless type.","Create an ArrayType with this BasicType as its elements.","Create an ArrayType with this BasicType as its elements.","Creates an ArrayType with this ArrayType for its element …","Creates an ArrayType with this FloatType for its element …","Creates an ArrayType with this IntType for its element …","Creates an ArrayType with this PointerType for its element …","Creates an ArrayType with this StructType for its element …","Creates an ArrayType with this VectorType for its element …","Returns an AnyTypeEnum that represents the current type.","Returns an AnyTypeEnum that represents the current type.","Returns a BasicTypeEnum that represents the current type.","Returns a BasicTypeEnum that represents the current type.","Returns the internal LLVM reference behind the type","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","Creates an IntValue representing a constant value of all …","Creates a constant ArrayValue.","Creates a constant ArrayValue.","Creates a constant ArrayValue.","Creates a constant ArrayValue.","Creates a constant ArrayValue.","Creates a constant ArrayValue.","Creates a FloatValue representing a constant value of this …","Create a FloatValue from a string. LLVM provides no error …","Creates an IntValue representing a constant value of this …","Create a constant IntValue of arbitrary precision.","Create an IntValue from a string and radix. LLVM provides …","Creates a StructValue based on this StructType’s …","Creates a null PointerValue of this PointerType. It will …","Creates a constant VectorValue.","Creates a constant zero value of this ArrayType.","Creates a constant BasicValueZero.","Creates a constant zero value of this FloatType.","Creates a constant zero value of this IntType.","Creates a constant null value of this PointerType. This is …","Creates a constant zero value of this StructType.","Creates a constant zero value of this VectorType.","Counts the number of field types.","Counts the number of param types this FunctionType has.","Creates a GenericValue for use with ExecutionEngines.","Creates a GenericValue for use with ExecutionEngines.","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","Create a FunctionType with this BasicType as its return …","Create a FunctionType with this BasicType as its return …","Creates a FunctionType with this ArrayType for its return …","Creates a FunctionType with this FloatType for its return …","Creates a FunctionType with this IntType for its return …","Creates a FunctionType with this MetadataType for its …","Creates a FunctionType with this PointerType for its …","Creates a FunctionType with this StructType for its return …","Creates a FunctionType with this VectorType for its return …","Creates a FunctionType with this VoidType for its return …","Returns the argument unchanged.","","","Returns the argument unchanged.","","","","","","","","","","","","Returns the argument unchanged.","","","","","","","","","","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","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 the AddressSpace a PointerType was created with.","Gets the alignment of this ArrayType. Value may vary …","Gets the alignment of this FloatType. Value may vary …","Gets the alignment of this IntType. Value may vary …","Gets the alignment of this PointerType. Value may vary …","Gets the alignment of this StructType. Value may vary …","Gets the alignment of this VectorType. Value may vary …","Gets the bit width of an IntType.","Gets a reference to the Context this ArrayType was created …","Gets a reference to the Context this FloatType was created …","Gets a reference to the Context this FunctionType was …","Gets a reference to the Context this IntType was created …","Gets a reference to the Context this MetadataType was …","Gets a reference to the Context this PointerType was …","Gets a reference to the Context this StructType was …","Gets a reference to the Context this VectorType was …","Gets a reference to the Context this VoidType was created …","Gets the element type of this ArrayType.","Gets the element type of this VectorType.","Gets the type of a field belonging to this StructType.","Gets the type of a field belonging to this StructType.","Gets this StructType’s field types.","Get a struct field iterator.","Gets this StructType’s name.","Gets param types this FunctionType has.","Creates a poison instance of a ArrayType.","Creates a poison instance of a FloatType.","Creates a poison instance of an IntType.","Creates a poison instance of a PointerType.","Creates a poison instance of a StructType.","Creates a poison instance of a VectorType.","Gets the return type of this FunctionType.","Gets the size of this VectorType.","Creates an undefined instance of a ArrayType.","Creates an undefined instance of a FloatType.","Creates an undefined instance of an IntType.","Creates an undefined instance of a PointerType.","Creates an undefined instance of a StructType.","Creates an undefined instance of a VectorType.","","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","Determine whether this pointer is opaque.","Determines whether or not a StructType is opaque.","Determines whether or not a StructType is packed.","","","","Determines whether or not this BasicType is sized or not. …","Determines whether or not this BasicType is sized or not. …","Gets whether or not this FunctionType is sized or not. …","Gets whether or not this VoidType is sized or not. This …","","","","Determines whether or not a FunctionType is a variadic …","","","","","Gets the length of this ArrayType.","Is the string valid for the given radix?","Create ArrayType from LLVMTypeRef","Create AnyTypeEnum from LLVMTypeRef","Create BasicTypeEnum from LLVMTypeRef","Create FloatType from LLVMTypeRef","Create FunctionType from LLVMTypeRef","Create IntType from LLVMTypeRef","Create MetadataType from LLVMTypeRef","Create PointerType from LLVMTypeRef","Create StructType from LLVMTypeRef","Create VectorType from LLVMTypeRef","Create VoidType from LLVMTypeRef","","Prints the definition of a Type to a LLVMString.","Prints the definition of a Type to a LLVMString.","Print the definition of an ArrayType to LLVMString","Print the definition of a AnyTypeEnum to LLVMString.","Print the definition of a BasicTypeEnum to LLVMString.","Print the definition of a BasicMetadataTypeEnum to …","Print the definition of a FloatType to LLVMString.","Print the definition of a FunctionType to LLVMString.","Print the definition of an IntType to LLVMString.","Print the definition of a MetadataType to LLVMString.","Print the definition of a PointerType to LLVMString.","Print the definition of a StructType to LLVMString.","Print the definition of a VectorType to LLVMString.","Print the definition of a VoidType to LLVMString.","Create a PointerType that points to this BasicType.","Create a PointerType that points to this BasicType.","Creates a PointerType with this ArrayType for its element …","Creates a PointerType with this FloatType for its element …","Creates a PointerType with this FunctionType for its …","Creates a PointerType with this IntType for its element …","Creates a PointerType with this PointerType for its …","Creates a PointerType with this StructType for its element …","Creates a PointerType with this VectorType for its element …","Defines the body of a StructType.","Gets the size of this BasicType. Value may vary depending …","Gets the size of this BasicType. Value may vary depending …","Gets the size of this ArrayType. Value may vary depending …","","Gets the size of this FloatType. Value may vary depending …","Gets the size of this IntType. Value may vary depending on …","Gets the size of this PointerType. Value may vary …","Gets the size of this StructType. Value may vary depending …","Gets the size of this VectorType. Value may vary depending …","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","Creates a VectorType with this FloatType for its element …","Creates a VectorType with this IntType for its element …","Creates a VectorType with this PointerType for its element …","","","","Represents an aggregate value, built on top of other …","","","","Defines any struct wrapping an LLVM value.","","An ArrayValue is a block of contiguous constants or …","","","","","","","","","","","","Represents a basic value, which can be used both by …","","A usage of a BasicValue in another value.","","","","","A value resulting from a function call. It may have …","","","","","","","","","","","","","","","","","","","","","Iterate over all the field values of this struct.","Represents a value which is permitted in floating point …","","","","","","","","","","Address of the GlobalValue is globally insignificant.","","","Iterate over all the incoming edges of a phi value.","","","","","","","Represents a value which is permitted in integer math …","","","","","","","Tail call kind for LLVMSetTailCallKind and …","","","","","","","","Address of the GlobalValue is locally insignificant.","","","","","Address of the GlobalValue is significant.","Iterate over all the operands of an instruction value.","Iterate over all the operands of an instruction value.","","","A Phi Instruction returns a value based on which basic …","","","","","","","","","","","","","","","","","","","","","","","","","","","","","This enum determines the significance of a GlobalValue’s …","","","","","","","","","","","Adds an Attribute to this CallSiteValue.","Adds an Attribute to a particular location in this …","","Returns an enum containing a typed version of the …","Returns an enum containing a typed version of the …","Returns an enum containing a typed version of AnyValue.","Returns an enum containing a typed version of AnyValue.","","Returns an enum containing a typed version of the …","Returns an enum containing a typed version of the …","","Gets the GlobalValue version of this FunctionValue. This …","Attempt to convert this ArrayValue to an InstructionValue, …","","","","","","","Most BasicValues are the byproduct of an instruction and …","Most BasicValues are the byproduct of an instruction and …","","","","","","","","","","","","","","","","","","","","Get all Attributes on this CallSiteValue at an index.","Get all Attributes belonging to the specified location in …","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","Check whether this instructions supports fast math flags.","","","","","","","","","","","","","","Creates a clone of this InstructionValue, and returns it. …","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","GEP is very likely to segfault if indexes are used …","GEP is very likely to segfault if indexes are used …","","","","","","","","","","","","","","","","","","","","","","Counts the number of arguments this CallSiteValue was …","Counts the number of Attributes on this CallSiteValue at …","Counts the number of Attributes belonging to the specified …","","Counts the number of fields.","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","","","Returns the argument unchanged.","","","Returns the argument unchanged.","","","","","","","","","","Returns the argument unchanged.","","","","","","","","","Returns the argument unchanged.","","","","","","","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","","Returns the argument unchanged.","","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","","Returns alignment on a memory access instruction or alloca.","Returns the type that is allocated by the alloca …","Returns atomic ordering on a memory access instruction.","","","Gets the calling convention for this CallSiteValue.","","Gets the FunctionValue this CallSiteValue is based on.","Gets a Comdat assigned to this GlobalValue, if any.","Obtains a constant FloatValue’s value and whether or not …","Checks if an or instruction has the disjoint flag set.","","","Gets an enum Attribute on this CallSiteValue at an index …","Gets an enum Attribute belonging to the specified location …","Get fast math flags of supported instructions.","Gets the predicate of an FCmp InstructionValue. For …","Gets the value of a field belonging to this StructValue.","Gets the value of a field belonging to this StructValue.","Get a field value iterator.","","","","","Gets the first use of an InstructionValue if any.","","Gets the predicate of an ICmp InstructionValue. For …","","Safety","Get an incoming edge iterator.","","Get a instruction with it’s name Compares against all …","","","","","","Gets the MetadataValue associated with this Instruction at …","Get name of the ArrayValue. If the value is a constant, …","Get the name of the BasicValueEnum.","Gets name of the FloatValue. If the value is a constant, …","Gets the name of a FunctionValue.","Get name of the GlobalValue.","Get name of the InstructionValue.","Gets the name of an IntValue. If the value is a constant, …","Get name of the MetadataValue.","Gets the name of a ArrayValue. If the value is a constant, …","Get name of the PointerValue. If the value is a constant, …","Gets the name of a StructValue. If the value is a …","Gets the name of a VectorValue. If the value is a …","","","","Gets the next use of a BasicBlock, InstructionValue or …","","","Check if a zext instruction has the non-negative flag set.","","Obtains the number of operands an InstructionValue has. An …","","Obtains the operand an InstructionValue has at a given …","Get the operand of an InstructionValue.","Gets the use of an operand(BasicValue), if any.","Gets the use of an operand(BasicValue), if any.","Get an instruction value operand use iterator.","Get an instruction value operand iterator.","","","","","","","","Get the section to which this function belongs","Get section, this global value belongs to","Obtains a constant IntValue’s sign extended value.","Gets a string Attribute on this CallSiteValue at an index …","Gets a string Attribute belonging to the specified …","Obtain the string from the ArrayValue if the value points …","","Get the debug info descriptor","Returns tail, musttail, and notail attributes.","Returns the tail call kind on call instructions.","","Gets the type of this ArrayValue.","","","","","Get type of the current InstructionValue","","","","","","Gets the used value (a BasicValueEnum or BasicBlock) of …","Gets the user (an AnyValueEnum) of this use.","","","Returns whether or not a memory access instruction is …","Obtains a constant IntValue’s zero extended value.","Determines whether or not this Instruction has any …","","","","","","","","","","","","","","","","","","","","","","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","","","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","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 if a terminator is conditional or not","Determines whether or not an ArrayValue is a constant.","Determines whether or not a FloatValue is a constant.","Determines whether or not an IntValue is an llvm::Constant.","Determines whether or not a PointerValue is a constant.","Determines whether or not a VectorValue is a constant.","Determines whether or not an ArrayValue represents a …","","","Determines whether or not an IntValue is an …","","Determines whether or not a GlobalValue is a declaration …","","","","","","","","","","","","Determines whether or not this value is null.","","","","","","","","","","","","Returns whether the value is poison","Returns whether the value is poison","","","","","","Determines whether or not this call is a tail call.","","Returns if the instruction is a terminator","","Determines whether or not this value is undefined.","","","","","","","","","","","","","","Get a value from an LLVMValueRef.","Get a value from an LLVMUseRef.","Get a value from an LLVMValueRef.","Get a value from an LLVMValueRef.","Get a value from an LLVMValueRef.","Get a value from an LLVMValueRef.","Get a value from an LLVMValueRef.","","Get a value from an LLVMValueRef.","Get a value from an LLVMValueRef.","Get a value from an LLVMValueRef.","","Get a value from an LLVMValueRef.","Get a value from an LLVMValueRef.","Get a value from an LLVMValueRef.","","","Get a value from an LLVMValueRef.","Get a value from an LLVMValueRef.","","Get a value from an LLVMValueRef.","","","","","","","","Prints this ArrayValue to standard error.","","","","","","","","Prints a value to a LLVMString","Prints a value to a LLVMString","Removes an enum Attribute on this CallSiteValue at an …","Removes an enum Attribute belonging to the specified …","","Removes a string Attribute on this CallSiteValue at an …","Removes a string Attribute belonging to the specified …","Replaces all uses of this value with another value of the …","","","","","","","","","","","","Sets alignment on a memory access instruction or alloca.","Shortcut for setting the alignment Attribute for this …","Sets atomic ordering on a memory access instruction.","Sets the calling convention for this CallSiteValue.","","Assigns a Comdat to this GlobalValue.","","Set the disjoint flag on or instructions.","","","Set fast math flags on supported instructions.","Sets the value of a field belonging to this StructValue.","","","","","Sets a metadata of the given type on the GlobalValue","Determines whether or not this Instruction has any …","Sets the name of a BasicValue. If the value is a constant, …","Sets the name of a BasicValue. If the value is a constant, …","Set name of the ArrayValue.","Set name of the BasicValueEnum.","Set name of the FloatValue.","Set name of the GlobalValue.","Set name of the InstructionValue.","Set name of the IntValue.","","Set name of the PointerValue.","Get name of the StructValue.","Set name of the VectorValue.","Set the non-negative flag on zext instructions.","Sets the operand an InstructionValue has at a given index …","","","Set the section to which this function should belong","Set section, this global value belongs to","Set the debug info descriptor","Sets whether or not this call is a tail call.","Sets tail, musttail, and notail attributes.","","","","","","Sets whether or not a memory access instruction is …","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","Try to convert this CallSiteValue to a BasicValueEnum if …","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","View the control flow graph and produce a .dot file","Only view the control flow graph"],"i":[10,4,4,5,0,6,5,0,0,0,6,7,9,2,9,5,5,5,5,0,8,0,7,9,8,0,0,10,6,8,8,5,5,4,2,5,6,4,3,3,3,3,3,3,3,0,5,3,3,7,4,2,2,2,2,4,5,0,3,2,3,2,3,2,3,2,3,5,5,3,3,4,5,5,0,0,1,2,3,4,5,6,7,8,9,10,1,2,3,4,5,6,7,8,9,10,0,1,2,3,4,5,6,7,8,9,10,1,2,3,4,5,6,7,8,9,10,2,3,4,5,7,9,10,0,0,0,0,1,6,7,9,1,2,3,4,5,6,7,8,9,10,0,1,2,3,4,5,6,7,8,9,10,1,1,2,2,3,3,4,4,5,5,6,7,7,8,9,9,10,10,2,3,4,5,7,9,10,1,2,2,3,3,4,4,5,5,6,7,7,8,9,9,10,10,0,0,0,0,0,2,3,4,5,7,9,10,0,0,0,1,2,3,4,5,6,7,8,9,10,1,1,2,3,4,5,6,7,8,9,10,1,2,3,4,5,6,7,8,9,10,1,2,3,4,5,6,7,8,9,10,0,0,0,0,31,31,31,29,29,31,29,31,29,31,29,31,29,31,29,31,29,31,29,29,29,29,29,29,29,31,29,31,29,29,29,29,29,31,29,31,29,31,29,31,0,0,36,36,38,36,38,36,36,36,36,36,38,36,38,36,36,36,36,36,36,36,36,36,36,36,36,36,36,38,38,36,36,38,36,36,36,36,36,38,36,38,36,38,47,47,0,0,47,47,47,47,47,47,47,44,47,44,47,44,44,44,44,44,44,44,44,44,44,44,44,44,44,44,44,44,44,44,44,44,44,44,44,44,44,44,44,44,44,44,44,44,44,44,44,44,44,44,44,44,44,44,44,44,44,44,44,44,44,44,44,44,44,44,44,44,44,44,44,44,44,44,44,44,44,44,44,44,44,44,44,44,44,44,44,44,44,44,44,44,44,44,44,44,44,44,44,44,44,44,44,44,44,44,44,44,44,44,47,47,47,44,47,44,44,44,44,47,44,44,44,44,44,44,47,47,44,47,44,47,44,44,72,0,0,72,72,72,72,70,72,70,72,70,72,70,72,70,72,72,70,72,70,72,72,70,70,72,72,72,70,70,72,70,72,70,72,70,72,70,72,70,0,0,0,74,40,75,74,40,74,40,74,40,74,40,40,40,74,40,74,40,74,74,40,74,40,74,40,74,40,74,40,74,40,74,40,74,40,74,74,74,40,40,74,40,74,40,74,40,74,40,74,40,74,40,74,74,40,74,40,74,40,74,40,74,40,74,40,74,40,74,40,74,40,74,40,74,40,74,40,74,40,74,40,74,40,74,40,74,40,74,40,40,74,40,74,40,74,40,74,40,74,40,0,92,92,92,92,92,92,92,92,92,92,92,210,210,210,210,113,113,113,113,0,210,210,113,113,113,113,113,113,113,113,113,113,113,113,113,113,113,113,113,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,113,210,210,210,210,113,113,113,113,113,113,112,113,113,113,210,210,210,210,113,113,113,0,210,210,112,210,210,113,113,113,113,210,210,112,210,210,210,210,113,113,113,113,113,210,210,210,210,210,210,210,210,113,113,210,210,210,210,113,113,210,210,210,210,113,210,210,210,210,210,210,113,210,210,210,210,210,210,210,210,113,94,96,97,98,99,100,101,102,103,104,105,106,95,96,97,98,99,100,101,102,103,104,68,109,105,110,101,102,103,106,95,96,97,98,99,100,101,102,103,111,104,68,109,105,110,112,113,106,95,96,97,98,99,100,101,102,103,111,104,68,109,105,110,112,113,95,96,97,98,99,100,101,102,103,111,104,68,109,105,110,112,113,95,96,97,98,99,100,101,102,103,111,104,68,109,105,110,112,113,112,113,106,106,106,106,106,106,106,106,106,106,106,106,106,106,106,106,106,106,106,106,0,106,106,95,96,97,98,99,100,101,102,103,111,104,68,109,105,110,112,113,106,106,95,96,97,98,99,100,101,102,103,111,104,68,109,105,110,112,113,106,95,96,97,98,99,100,101,102,103,111,104,68,109,105,110,112,112,113,113,100,68,97,68,100,68,100,112,113,106,106,106,106,95,96,97,98,99,100,101,102,103,111,104,68,109,105,110,112,112,113,113,112,113,106,95,96,97,98,99,100,101,102,103,111,104,68,109,105,110,112,113,106,95,96,97,98,99,100,101,102,103,111,104,68,109,105,110,112,113,106,95,96,97,98,99,100,101,102,103,111,104,68,109,105,110,112,113,106,95,96,97,98,99,100,101,102,103,111,104,68,109,105,110,112,113,0,0,132,129,132,0,129,129,0,0,122,122,122,126,132,129,122,126,132,129,122,126,126,126,126,126,126,126,126,126,126,126,126,126,126,126,129,122,126,122,126,129,122,132,129,122,132,132,129,129,122,126,122,132,129,122,126,122,122,122,122,132,129,122,126,126,122,122,122,122,122,122,122,122,122,126,132,129,132,129,122,126,132,129,122,126,132,129,122,126,0,137,137,137,137,137,137,137,137,137,137,137,137,137,137,137,0,81,81,81,81,81,81,81,81,81,81,81,81,81,81,81,81,81,81,141,141,142,142,142,142,142,141,142,142,0,0,142,0,142,142,142,142,0,142,142,0,141,142,141,141,142,142,80,80,80,80,80,80,142,80,141,146,147,142,80,141,146,147,142,80,141,142,80,141,142,141,80,80,80,80,80,80,142,80,141,142,80,141,146,147,142,142,80,141,141,146,147,80,80,80,80,80,80,80,80,80,80,80,80,80,80,80,80,80,80,80,142,141,142,142,80,141,141,146,147,146,147,80,80,146,147,80,80,142,141,80,80,80,80,80,80,80,80,80,80,80,142,80,141,80,142,80,141,146,147,142,80,141,146,147,142,80,141,146,147,80,80,80,80,0,0,0,0,0,0,0,140,158,160,161,163,164,166,140,158,160,161,163,164,166,140,158,160,161,163,164,166,140,158,161,164,140,158,160,161,163,164,166,140,158,160,161,163,164,166,160,166,160,160,166,163,160,140,140,163,163,163,140,158,160,161,163,164,166,158,161,164,140,158,160,161,163,164,166,158,161,164,160,166,140,158,160,161,163,164,166,140,158,160,161,163,164,166,140,158,160,161,163,164,166,168,0,0,0,153,155,153,155,153,155,168,153,155,153,155,153,153,155,153,155,153,153,155,153,168,153,155,155,155,155,155,155,155,155,155,155,155,153,155,153,155,153,155,0,0,171,171,82,171,82,171,82,171,171,82,82,82,0,82,171,0,82,82,171,171,82,171,0,82,171,0,0,0,0,0,171,82,82,171,82,171,82,171,82,171,0,0,179,181,0,0,177,178,178,0,0,177,177,177,181,177,179,178,0,177,178,0,0,0,0,0,154,173,154,89,151,151,180,180,180,177,178,179,180,151,173,154,181,89,182,177,178,179,180,151,173,154,181,89,182,177,178,179,180,181,177,178,179,180,181,151,89,173,173,177,178,180,182,180,154,89,182,89,177,178,179,180,151,173,181,89,177,178,179,180,151,151,173,154,181,89,182,177,178,179,180,151,173,154,181,89,182,173,173,89,89,89,89,89,154,89,154,173,154,173,154,154,173,173,89,89,89,89,154,154,154,173,173,173,180,173,173,173,173,173,173,173,173,173,173,173,173,173,173,173,173,173,173,173,177,178,179,180,151,173,154,181,89,182,180,151,173,154,89,182,154,89,89,182,154,182,182,182,182,182,177,178,179,180,181,151,177,178,179,180,151,173,154,181,89,182,177,178,179,180,151,173,154,181,89,182,177,178,179,180,151,173,154,181,89,182,154,154,189,0,0,0,35,90,188,0,0,0,0,189,189,0,0,0,35,90,188,0,35,189,0,0,35,90,188,206,207,0,188,189,0,0,35,90,188,206,208,0,0,35,90,188,206,207,208,0,35,90,188,0,35,50,50,184,83,77,46,86,185,183,183,50,50,186,184,35,90,188,83,63,77,88,46,86,185,91,184,35,90,188,83,63,189,77,88,46,86,192,185,91,184,35,90,188,83,63,189,77,88,46,86,192,185,91,184,35,90,188,83,63,189,77,88,46,86,185,91,184,35,90,188,83,63,189,77,88,46,86,185,91,77,184,83,77,46,86,185,83,83,77,77,77,86,46,185,184,90,83,77,46,86,185,86,63,83,77,184,35,90,188,83,63,189,77,88,46,86,185,91,184,184,35,35,90,90,188,188,83,83,63,63,189,77,77,88,88,46,46,86,86,192,185,185,91,91,50,50,184,83,77,88,46,86,185,91,184,35,35,35,35,35,35,35,35,35,90,90,90,90,90,90,90,188,188,188,188,188,188,188,188,188,83,63,189,77,88,46,86,192,185,91,46,184,83,77,46,86,185,77,184,83,63,77,88,46,86,185,91,184,185,86,86,86,86,86,63,184,83,77,46,86,185,63,185,184,83,77,46,86,185,189,184,35,90,188,83,63,189,77,88,46,86,192,185,91,35,90,188,35,90,188,35,35,90,188,192,188,35,90,188,35,90,188,35,90,188,35,35,90,188,35,90,188,35,35,90,188,188,46,86,86,35,90,188,50,50,63,91,35,90,188,63,35,90,188,35,184,189,184,35,90,83,63,77,88,46,86,185,91,192,183,183,184,35,90,188,83,63,77,88,46,86,185,91,50,50,184,83,63,77,46,86,185,86,50,50,184,35,83,77,46,86,185,184,35,90,188,83,63,189,77,88,46,86,185,91,184,35,90,188,83,63,77,88,46,86,185,91,184,184,184,184,35,90,90,90,188,188,83,83,83,83,63,63,189,189,77,77,77,77,88,88,46,46,46,46,86,86,86,86,192,185,185,185,185,91,91,184,35,90,188,83,63,189,77,88,46,86,192,185,91,184,35,90,188,83,63,189,77,88,46,86,192,185,91,83,77,46,56,56,56,0,0,56,56,0,0,0,64,193,48,54,0,56,56,51,61,65,0,0,0,0,56,56,56,56,0,56,56,56,56,56,56,56,56,56,56,0,56,56,56,56,56,56,56,56,56,0,0,0,193,48,54,56,0,193,0,56,197,0,56,0,56,56,56,0,0,193,0,56,0,193,48,54,56,0,196,196,196,196,56,56,56,197,0,193,54,56,197,0,0,56,56,0,193,0,0,193,48,54,56,56,56,56,56,56,56,56,56,56,56,0,64,193,48,54,56,56,56,56,56,56,0,56,56,56,56,0,193,48,54,56,56,55,43,66,59,59,123,123,66,53,53,135,43,79,190,52,66,39,57,58,53,53,135,62,194,79,55,64,193,48,54,190,43,62,41,52,87,66,39,57,58,55,43,196,79,42,55,64,193,48,54,190,43,135,62,197,56,41,198,199,52,87,66,200,39,57,201,58,196,79,42,55,64,193,48,54,190,43,135,62,197,56,41,198,199,52,87,66,200,39,57,201,58,41,196,79,42,55,64,193,48,54,190,43,62,197,56,41,52,87,66,39,57,58,196,79,42,55,64,193,48,54,190,43,62,197,56,41,52,87,66,39,57,58,197,52,39,52,39,190,58,39,39,58,52,52,52,52,52,52,52,52,52,52,52,52,52,58,52,39,52,52,52,52,55,55,43,43,57,66,43,43,135,43,62,135,196,79,79,79,79,79,42,55,64,64,64,193,193,193,193,193,193,193,193,193,193,193,48,48,48,48,48,48,48,54,54,54,54,54,54,54,54,190,190,190,190,43,43,62,197,56,41,41,52,52,52,52,87,87,87,66,66,39,39,39,39,57,57,57,57,57,58,58,58,58,41,196,79,79,42,55,55,64,64,193,193,48,48,54,54,190,190,43,43,135,62,62,197,56,41,41,198,199,52,52,87,87,66,66,200,39,39,57,57,201,58,58,196,79,42,55,64,64,64,193,193,193,193,193,193,193,193,193,193,193,193,48,48,48,48,48,48,48,54,54,54,54,54,54,54,54,54,190,43,135,62,197,197,56,56,41,198,199,52,87,66,200,39,57,201,58,62,41,41,41,43,43,55,43,55,62,190,41,62,58,55,43,41,41,57,57,57,43,43,53,53,41,43,41,66,66,66,62,41,43,43,43,43,62,41,79,48,190,43,62,41,52,87,66,39,57,58,43,62,41,42,87,87,41,43,41,41,41,41,41,41,41,41,43,43,41,43,43,62,41,43,62,52,55,43,79,87,43,55,41,62,79,193,48,190,43,41,52,39,57,58,62,42,42,62,62,41,52,41,43,62,79,55,64,193,48,54,190,43,62,197,56,41,52,87,66,39,57,58,135,196,79,42,55,64,193,48,54,190,43,135,62,197,197,56,56,41,198,199,52,87,66,200,39,57,201,58,64,193,48,54,193,48,54,193,193,193,48,54,198,199,200,201,54,193,135,193,48,54,64,193,48,54,193,48,54,64,193,48,54,41,79,190,52,39,58,79,62,58,52,58,62,62,193,48,54,193,193,193,48,54,54,87,79,190,43,52,66,39,57,58,193,193,48,54,123,123,87,64,193,48,54,55,41,41,62,79,190,43,52,66,39,57,58,193,48,54,51,61,65,79,42,55,64,193,48,190,190,43,62,41,52,52,87,66,39,39,39,57,58,58,58,58,198,199,200,201,197,79,190,43,52,87,39,57,58,123,123,55,43,41,55,43,79,190,43,41,52,87,66,39,57,58,43,62,41,55,41,55,43,62,62,41,62,62,41,57,43,62,43,62,62,41,53,53,79,48,190,62,41,52,66,39,57,58,41,41,43,43,43,62,43,55,55,62,62,62,62,62,41,196,79,42,55,64,193,48,54,190,43,62,197,56,41,52,87,66,39,57,58,79,55,64,193,48,54,190,43,62,41,52,87,66,39,57,58,55,196,79,79,79,79,79,42,55,64,193,48,48,48,54,54,190,190,190,190,190,43,43,135,62,197,56,41,41,198,199,52,52,52,52,52,87,87,87,66,66,66,200,39,39,39,39,39,57,57,57,57,57,201,58,58,58,58,196,79,42,55,64,193,48,54,190,43,135,62,197,56,41,198,199,52,87,66,200,39,57,201,58,196,79,42,55,64,193,48,54,190,43,135,62,197,56,41,198,199,52,87,66,200,39,57,201,58,43,43,43],"f":"````````````````````````````````````````````````````````````````````````````{ce{}{}}0000000000000000000`{bb}{dd}{ff}{hh}{jj}{ll}{nn}{A`A`}{AbAb}{AdAd}{{ce}Af{}{}}000000000{{dd}Ah}{{ff}Ah}{{hh}Ah}{{jj}Ah}{{nn}Ah}{{AbAb}Ah}{{AdAd}Ah}````{{}b}{{}l}{{}n}{{}Ab}{{bb}Aj}{{dd}Aj}{{ff}Aj}{{hh}Aj}{{jj}Aj}{{ll}Aj}{{nn}Aj}{{A`A`}Aj}{{AbAb}Aj}{{AdAd}Aj}`{{bAl}An}{{dAl}An}{{fAl}An}{{hAl}An}{{jAl}An}{{lAl}An}{{nAl}An}{{A`Al}An}{{AbAl}An}{{AdAl}An}{cc{}}{B`b}1{Bbd}{Bdf}3{Bfh}44{Bhj}55{Bjn}6{BlAb}7{BnAd}8{{dc}AfC`}{{fc}AfC`}{{hc}AfC`}{{jc}AfC`}{{nc}AfC`}{{Abc}AfC`}{{Adc}AfC`}{ce{}{}}{dBb}11{fBd}2{hBf}3{jBh}44{nBj}5{AbBl}6{AdBn}7`````{{dd}{{Cb{Ah}}}}{{ff}{{Cb{Ah}}}}{{hh}{{Cb{Ah}}}}{{jj}{{Cb{Ah}}}}{{nn}{{Cb{Ah}}}}{{AbAb}{{Cb{Ah}}}}{{AdAd}{{Cb{Ah}}}}```>>>>>>>>>>{Cd{{Cf{bc}}}{}}{c{{Cf{e}}}{}{}}0000000000000000000{cCh{}}000000000```````{CjCl}{ce{}{}}000{CjCj}{CnCn}{{ce}Af{}{}}0{{CjCj}Aj}{{CnCn}Aj}{{CjAl}An}{{CnAl}An}{cc{}}0{CjCd}{CjD`}{{}Cd}{DbCd}{CjDd}0{CjDf}{{Cnc}AfC`}??{CjAj}00{ClCj}{ce{}{}}0{c{{Cf{e}}}{}{}}000{cCh{}}0``{DhDj}3333{DhDh}{{ce}Af{}{}}{Dh{{Cf{AfAf}}}}{{DhDh}Aj}{{DhAl}An}{{DlAl}An}{cc{}}0{Dh{{Cb{Dn}}}}{DhE`}{Dh{{Cb{Eb}}}}{Dh{{Cb{Ed}}}}{{DhDb}{{Cb{Eb}}}}{DhDl}3{DhDd}{Dh{{Cb{Dh}}}}{Dh{{Cb{Ef}}}}16{{Dhc}AfC`}{ce{}{}}00{{DhDh}{{Cf{AfAf}}}}0{Dl{{Cb{c}}}{}}{Dh{{Cf{AfAf}}}}{{DhDh}Af}{{DhDb}Af}5{c{{Cf{e}}}{}{}}000{cCh{}}0```````````{EhEj}8888{{EhDnElDb}{{Cf{DnEn}}}}{{Eh{Fb{F`}}}{{Cf{EbEn}}}}{{EhcDb}{{Cf{DnEn}}}Fd}{{EhccDb}{{Cf{cEn}}}Ff}{{EhcFhDb}{{Cf{DnEn}}}Fd}0{{EhjDnFhh}{{Cf{FhEn}}}}{{EhceDb}{{Cf{F`En}}}FjFd}{{EhEf{Fb{Fl}}Db}{{Cf{FnEn}}}}{{EhG`ceDb}{{Cf{F`En}}}FjFd}{{EhDncchh}{{Cf{GbEn}}}Fj}{{EhFhDhDh}{{Cf{EbEn}}}}3{{EhEf{Fb{F`}}DhDhDb}{{Cf{FnEn}}}}{{EhGdFhDb}{{Cf{F`En}}}}{{EhcCdDb}{{Cf{F`En}}}Gf}{{EhhGhDb}{{Cf{EbEn}}}}{{EhccDb}{{Cf{cEn}}}Gj}{{EhcDb}{{Cf{cEn}}}Gj}{{EhfccDb}{{Cf{En}}}Gj}212122{{EhcDb}{{Cf{En}}}Gj}02{{EhDn}{{Cf{EbEn}}}}{{EhcDn{Fb{Fh}}Db}{{Cf{DnEn}}}Fd}{{EhDbDb}{{Cf{GlEn}}}}01{{Ehc{Fb{Dh}}}{{Cf{EbEn}}}Fj}{{EhGnDn{Fb{Fl}}Db}{{Cf{FnEn}}}}{{EhGnDn{Fb{F`}}DhDhDb}{{Cf{FnEn}}}}{{EhGdcFhDb}{{Cf{GdEn}}}Fj}{{EhceCdDb}{{Cf{H`En}}}GfFj}{{EhccDb}{{Cf{cEn}}}Ff}{{EhcDb}{{Cf{cEn}}}Ff}{{EhcAjDb}{{Cf{cEn}}}Ff}{{EhdccDb}{{Cf{En}}}Ff}3323323332322333{{EhcDb}{{Cf{En}}}Ff}334433{{EhEf{Fb{F`}}DhDhDb}{{Cf{FnEn}}}}{{EhcDb}{{Cf{En}}}Hb}0{{EhcEf{Fb{F`}}AjDb}{{Cf{F`En}}}Fd}7{{EhcDnDb}{{Cf{F`En}}}Fd}{{EhcDb}{{Cf{DnEn}}}Fd}{{EhDnCdDnCdFh}{{Cf{DnEn}}}}0{{EhDnCdFhFh}{{Cf{DnEn}}}}:;{{EhcDb}{{Cf{HdEn}}}Fd}{{EhcDb}{{Cf{cEn}}}Hb}{{EhcDnDnDb}{{Cf{FhEn}}}Fd}8{{Ehc}{{Cf{EbEn}}}Fj}{{Eh{Cb{Fj}}}{{Cf{EbEn}}}}{{EhccAjDb}{{Cf{cEn}}}Ff}{{EhceeDb}{{Cf{F`En}}}FfFj}{{EhGdGdGdDb}{{Cf{GdEn}}}}?{{EhDnc}{{Cf{EbEn}}}Fj}{{EhcDnCdDb}{{Cf{DnEn}}}Fd}{{EhFhDh{Fb{{Hf{FhDh}}}}}{{Cf{EbEn}}}}{{EhDh}{{Cf{EbEn}}}}{Eh{{Cf{EbEn}}}}{{EhcDb}{{Cf{En}}}Ff}{{EhDncDb}{{Cf{F`En}}}Fd}{{EhccDb}{{Cf{cEn}}}Ff}{EhAf}0{{EnEn}Aj}{{EnAl}An}0{{EhAl}An}{cc{}}0{Eh{{Cb{Hh}}}}{Eh{{Cb{Dh}}}}{{EhEb{Cb{Db}}}Af}{ce{}{}}0{EjEh}{{EhDhEb}Af}{{EhDh}Af}{{EhEb}Af}{{EhHh}Af}{cHj{}}{c{{Cf{e}}}{}{}}000{cCh{}}0{EhAf}```````{HlHn}::::{I`I`}{HlHl}{{ce}Af{}{}}0{{I`I`}Ah}{{I`I`}Aj}{{HlHl}Aj}{{I`Al}An}{{HlAl}An}{cc{}}{IbI`}1{HlI`}{{I`c}AfC`}{ce{}{}}{I`Ib}1{HnHl}{{I`I`}{{Cb{Ah}}}}{{HlI`}Af}44{c{{Cf{e}}}{}{}}000{cCh{}}0```{{IdEfDb}Dh}{{E`EfDb}Dh}{IfIh}{IdIh}{E`Ih}{IdIj}{E`Ij}===={E`E`}{{ce}Af{}{}}{{Id{Fb{Il}}Aj}In}{{E`{Fb{Il}}Aj}In}{{Id{Fb{F`}}Aj}Gb}{{E`{Fb{F`}}Aj}Gb}{{}Id}{IdEh}{E`Eh}{{IdCdD`}Cj}{{E`CdD`}Cj}{{IdGnHjHjAjAj{Cb{Ad}}Aj}Dn}{{E`GnHjHjAjAj{Cb{Ad}}Aj}Dn}{{IdDb}J`}{{E`Db}J`}{{IdJb}{{Cf{J`Jd}}}}{{E`Jb}{{Cf{J`Jd}}}}{{IdDbDb}Cj}{{E`DbDb}Cj}{{IdCdDf}Cj}{{E`CdDf}Cj}{{IdCd}Ij}{{E`Cd}Ij}{IdAf}{{IdId}Aj}{{IdE`}Aj}{{E`E`}Aj}{{E`Id}Aj}{IdJf}{E`Jf}101010{{IdAl}An}{{E`Al}An}{cc{}}0{ec{}{{Jj{Id}{{Jh{c}}}}}}{{IdDb}Cd}{{E`Db}Cd}{{IdDb}{{Cb{Jl}}}}{{E`Db}{{Cb{Jl}}}}{IdIj}{E`Ij}10101010{{IdDhDb}Dh}{{E`DhDb}Dh}{ce{}{}}0{{Id{Fb{Fl}}}Jn}{{E`{Fb{Fl}}}Jn}{{IdDb}Jn}{{E`Db}Jn}{IdK`}{E`K`}{{IdDb}Jl}{{E`Db}Jl}{IdJf}{E`Jf}<;{{IdKb{Cb{b}}}Ij}{{E`Kb{Cb{b}}}Ij}{{Idb}El}{{E`b}El}{{Id{Fb{Kd}}Aj}Jl}{{E`{Fb{Kd}}Aj}Jl}{ce{}{}}{c{{Cf{e}}}{}{}}000{cCh{}}0{IdKf}{E`Kf}<;`{KhKj}{KhDd}66{{KhKh}Aj}{{KhAl}An}{cc{}}9887``````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````{KlKn}{L`Kn}{LbKn}{LdKn}{LfKn}{LhKn}{LjKn}{LlKn}{LnKn}{M`Kn}{{Mbc}JnIf}{MdMf}{KnMh}{L`Mh}{LbMh}{LdMh}{LfMh}{LhMh}{LjMh}{LlMh}{LnMh}{M`Mh}{HhMh}{MjMh}{MbMh}{MlMh}{LjLh}{LlLh}{LnLh}{ce{}{}}00000000000000000000000000000000000{KnKn}{L`L`}{LbLb}{LdLd}{LfLf}{LhLh}{LjLj}{LlLl}{LnLn}{MnMn}{M`M`}{HhHh}{MjMj}{MbMb}{MlMl}{N`N`}{NbNb}{{ce}Af{}{}}0000000000000000{{N`N`}Ah}{{NbNb}Ah}{{MdLhD`Cd{Fb{{Nf{Nd}}}}}Ln}{{MdKnDbL`CdLhAjNhCd}Mj}{{MdDbD`NjNh}{{Cf{LlDb}}}}{{MdNd}Ml}{{MdcCdCdKn{Cb{Hh}}}HhIf}{{Md{Nl{Nd}}}Ml}{{MdDbDb}L`}{{MdKnDb{Cb{Db}}L`CdMnAjAjCdNhAj}Lf}{{MdKnDbDbL`CdLhAj{Cb{Ml}}{Cb{Kn}}Cd}Mb}{{MdKnL`CdCd}M`}{{MdKnDbL`NnD`CdD`NhLh}Lj}{{MdKnDbAj}Ld}{{MdKnDbCdL`CdLhAjNh}Mj}{{Mdc}LjIf}{{MdDbLhD`Cdb}Lj}{{MdLhCd}Lj}{{MdKnDbL`NnD`CdNh{Cb{Lh}}{Fb{Lh}}Nn{Cb{Lh}}Db}Ln}{{MdL`{Cb{Lh}}{Fb{Lh}}Nh}Mn}{{MdLhDbL`CdKnCd}Lj}{{MdKnDbL`CdD`CdNh{Fb{Lh}}CdDb}Ln}{{}Nn}{MdAf}{{MdMd}Aj}{{KnKn}Aj}{{L`L`}Aj}{{LbLb}Aj}{{LdLd}Aj}{{LfLf}Aj}{{LhLh}Aj}{{LjLj}Aj}{{LlLl}Aj}{{LnLn}Aj}{{MnMn}Aj}{{M`M`}Aj}{{HhHh}Aj}{{MjMj}Aj}{{MbMb}Aj}{{MlMl}Aj}{{N`N`}Aj}{{NbNb}Aj}{MdAf}{{MdAl}An}{{KnAl}An}{{L`Al}An}{{LbAl}An}{{LdAl}An}{{LfAl}An}{{LhAl}An}{{LjAl}An}{{LlAl}An}{{LnAl}An}{{MnAl}An}{{M`Al}An}{{HhAl}An}{{MjAl}An}{{MbAl}An}{{MlAl}An}{{N`Al}An}{{NbAl}An}{cc{}}0000000000000000{O`N`}{ObNb}2{LhCd}{HhCd}{LbL`}1{LhD`}{HhKn}1{{N`c}AfC`}{{Nbc}AfC`}{{MdF`Mj{Cb{Ml}}HhEb}Eb}{{MdDn{Cb{Mj}}{Cb{Ml}}HhDh}Eb}{{MdDn{Cb{Mj}}{Cb{Ml}}HhEb}Eb}{ce{}{}}0000000000000000{N`O`}{NbOb}2{{N`N`}{{Cb{Ah}}}}{{NbNb}{{Cb{Ah}}}}{{MdLjLj}Af}55555555555555555{c{{Cf{e}}}{}{}}00000000000000000000000000000000000{cCh{}}00000000000000000``````````{{OdOfOh}Af}{{OdJ`}{{Cf{AfAf}}}}{OdOj}{{{Ol{c}}}cOn};;;;;;;;{{{Ol{{A`{cegi}{{Jh{k}}}}}}cegi}k{}{}{}{}{}}{{{Ol{{A`{cegikmo}{{Jh{Aa}}}}}}cegikmo}Aa{}{}{}{}{}{}{}{}}{{{Ol{{A`{cegikmoAaAcAe}{{Jh{Ag}}}}}}cegikmoAaAcAe}Ag{}{}{}{}{}{}{}{}{}{}{}}{{{Ol{{A`{cegikm}{{Jh{o}}}}}}cegikm}o{}{}{}{}{}{}{}}{{{Ol{{A`{ce}{{Jh{g}}}}}}ce}g{}{}{}}{{{Ol{{A`{cegik}{{Jh{m}}}}}}cegik}m{}{}{}{}{}{}}{{{Ol{{A`{cegikmoAaAcAeAgAi}{{Jh{Ak}}}}}}cegikmoAaAcAeAgAi}Ak{}{}{}{}{}{}{}{}{}{}{}{}{}}{{{Ol{{A`{cegikmoAaAcAeAgAiAk}{{Jh{Am}}}}}}cegikmoAaAcAeAgAiAk}Am{}{}{}{}{}{}{}{}{}{}{}{}{}{}}{{{Ol{{A`{cegikmoAaAcAeAg}{{Jh{Ai}}}}}}cegikmoAaAcAeAg}Ai{}{}{}{}{}{}{}{}{}{}{}{}}{{{Ol{{A`{ceg}{{Jh{i}}}}}}ceg}i{}{}{}{}}{{{Ol{{A`{cegikmoAaAc}{{Jh{Ae}}}}}}cegikmoAaAc}Ae{}{}{}{}{}{}{}{}{}{}}{{{Ol{{A`{}{{Jh{c}}}}}}}c{}}{{{Ol{{A`{cegikmoAa}{{Jh{Ac}}}}}}cegikmoAa}Ac{}{}{}{}{}{}{}{}{}}{{{Ol{{A`{c}{{Jh{e}}}}}}c}e{}{}}{Ab{{Cb{Ad}}}}{OdOd}{{{Ol{c}}}{{Ol{c}}}Af}{{ce}Af{}{}}0{AbDb}{OdAf}{{AhAh}Aj}{{AbAb}Aj}{{OdOd}Aj}{{AhAl}An}0{{AbAl}An}0{{OdAl}An}{{{Ol{c}}Al}An{}}{{OdEf}Af}{cc{}}000{{OdDb}{{Cf{{Ol{c}}Ah}}}Aj}{{OdDb}{{Cf{OhAh}}}}{{OdDb}{{Cf{EfAh}}}}{OdKb}{ce{}{}}000{{{Ol{c}}}cOn}{{}Af}0{{{Al{Oj}}Aj}Od}{{OdJ`}{{Cf{AfAb}}}}{{OdEf{Fb{An}}}An}{{OdEf{Fb{Db}}}AA`}{OdAf}077{cHj{}}0{c{{Cf{e}}}{}{}}0000000{cCh{}}000`::{AAbAAb}{{ce}Af{}{}}{{AAbAAb}Aj}{Db{{Cb{AAb}}}}{{AAbAl}An}{cc{}}{{AAbJ`{Fb{Kd}}}{{Cb{Ef}}}}{ce{}{}}{AAbAj}1::9`{JbAAd}{Jb{{Fb{Il}}}}33{AAf{{Cf{JbJd}}}}{{{Fb{Il}}Db}Jb}0{{}{{Cf{JbJd}}}}{Jb{{Cf{AAhAf}}}}{JbAf}{{JbAl}An};{JbOh}:{AAdJb}{c{{Cf{e}}}{}{}}0{cCh{}}````````````````````````````{{J`DbAAjc}AfFj}{{J`DbGn{Cb{AAl}}}Ef}{{J`c{Cb{b}}Db}GlFd}{{J`DbJn}{{Cf{AfDb}}}}{{J`DbAAjJn}Af}{J`AAn}{ce{}{}}000000000{AAlAAl}{J`J`}{AAjAAj}{{ce}Af{}{}}00{{AAlAAl}Ah}{{AAjAAj}Ah}{eAB`{}{{ABb{c}}}}{{J`AjNbDbDbDbAjDbNnDbN`NnAjAjDbDb}{{Hf{MdLb}}}}{J`{{Cf{OdJd}}}}0{{J`l}{{Cf{OdJd}}}}{J`Af}{{AAlAAl}Aj}{{J`J`}Aj}{{AAjAAj}Aj}{{AAlAl}An}{{J`Al}An}{{AAjAl}An}{{ABdAl}An}{{ABfAl}An}{ABhAAl}{cc{}}0{ABjAAj}111{J`E`}{J`{{ABl{Kh}}}}{J`Nn}{J`{{Cb{Ef}}}}{J`{{Cb{Gl}}}}{{J`Db}{{Cb{Jn}}}}{{J`Db}{{Cb{Ef}}}}{J`ABd}{{J`Db}{{Cb{Gl}}}}{{J`Db}{{Nl{Jn}}}}{{J`Db}Cd}{J`ABf}87{J`Dd}{{J`Db}Hl}1{{J`Db}{{Cb{Jl}}}}{J`ABn}{{AAlc}AfC`}{{AAjc}AfC`}{ce{}{}}{AAlABh}11{AAjABj}2222{{J`J`}{{Cf{AfJd}}}}{AAnJ`}{ABd{{Cb{c}}}{}}{ABf{{Cb{c}}}{}}{{Jbc}{{Cf{J`Jd}}}If}{{ce}{{Cf{J`Jd}}}{{AC`{AAf}}}If}{{AAlAAl}{{Cb{Ah}}}}{{AAjAAj}{{Cb{Ah}}}}{{J`c}{{Cf{AfJd}}}{{AC`{AAf}}}}{J`Af}{J`Jd}{{J`{ACb{J`}}}Aj}{{J`DbACdACf}{{Cf{AfJd}}}}{{J`Kh}Af}{{J`Db}Af}00{{J`ABn}Af}{J`Aj}{ce{}{}}00{J`Hj}{c{{Cf{e}}}{}{}}000000000{cCh{}}0000{J`{{Cf{AfJd}}}}{{J`AChAjAj}Aj}{J`Jb}{{J`AAf}Aj}```````{AAhACj}{ACl{{Hf{ACnACj}}}}{AD`{{Hf{ACnACj}}}}{ADb{{Hf{ADdACnACj}}}}{ADf{{Hf{ADdACj}}}}{ADh{{Hf{ADjACj}}}}{ADlADj}>>>>>>>>>>>>>>{AAhAf}{AClAf}{ADbAf}{ADhAf}{{AAhAl}An}{{AClAl}An}{{AD`Al}An}{{ADbAl}An}{{ADfAl}An}{{ADhAl}An}{{ADlAl}An}{cc{}}000000{AD`D`}{ADlD`}{AD`{{Fb{Il}}}}{AD`{{Cb{Dd}}}}{ADl{{Cb{Dd}}}}{ADfD`}{AD`ADb}{AAhACl}{AAhADh}{ADfADh}{ADf{{Hf{D`Dd}}}}{ADfDd}{ce{}{}}000000000{ACjAAh}{{ACnACj}ACl}{{ACnACj}AD`}{{ADdACnACj}ADb}{{ADdACj}ADf}{{ADjACj}ADh}{ADjADl}{ACl{{Cb{c}}}{}}{ADb{{Cb{c}}}{}}{ADh{{Cb{c}}}{}}{AD`D`}{ADlD`}{c{{Cf{e}}}{}{}}0000000000000{cCh{}}000000````{{{ACb{Ef}}}AB`}{ACfADn}{ce{}{}}000{eAB`{}{{ABb{c}}}}{c{{ACb{e}}}ABbAE`}{{}ACf}{{{ACb{c}}}Af{}}{ACfAf}{{{ACb{Ef}}}Aj}{{{ACb{c}}Al}AnAEb}{{ACfAl}An}{cc{}}0399{AB`{{ACb{c}}}AE`}{{{AE`{}{{AEd{c}}}}{ACb{{AE`{}{{AEd{c}}}}}}}Aj{}}{{{ACb{c}}c}AjAE`}{{ACfAj}Af}00{{ACfCd}Af}0111111{c{{Cf{e}}}{}{}}000{cCh{}}0````{ce{}{}}000{Jd{{Cb{Ad}}}}{AEfAEf}{{ce}Af{}{}}{Jdc{}}{JdDb}{JdAf}{{}Af}{{JdJd}Aj}{{AEfAEf}Aj}`{{JdAl}{{Cf{AfAEh}}}}0{{AEfAl}An}0{cc{}}0{{}{{Hf{CdCdCd}}}}=={{}Aj}{AAf{{Cf{AfAEf}}}}8{Db{{Cb{Oh}}}}9{ce{}{}}{JdHj}{cHj{}}0{c{{Cf{e}}}{}{}}000{cCh{}}0{{{A`{Kj}{{Jh{Af}}}}}Af}?````````````````````````{{ACd{ACb{c}}}Af{}}{AEjAEl}{ACdAEn}{KbAF`}{ABnKj}{ABnDd}```;;;;;;;;;;;;;;;;;;;;{AFbAFb}{AFdAFd}{AFfAFf}{AFhAFh}{AFjAFj}{{ce}Af{}{}}0000{DbABn}{DbKb}{{AEjABnDbDblAFdAFb}{{Cb{ACd}}}}{{AEjABnAFl}{{Cb{ACd}}}}{{}AFb}{{}AFd}{{}AFh}{{}AFl}`{ACdAf}{KbAf}{AFlAf}{{KbJlD`}Cd}{{AFbAFb}Aj}{{AFdAFd}Aj}{{AFfAFf}Aj}{{AFhAFh}Aj}{{ABnABn}Aj}{{AEjAEj}Aj}{{AFjAFj}Aj}{{KbKb}Aj}{{AFbAl}An}{{AFdAl}An}{{AFfAl}An}{{AFhAl}An}{{ABnAl}An}{{ABnAl}{{Cf{AfAEh}}}}{{AEjAl}An}{{ACdAl}An}{{AFjAl}An}{{KbAl}An}{{AFlAl}An}{cc{}}000000000{Db{{Cb{AEj}}}}{ABn{{Cf{AEjJd}}}}{{KbAFn}Cd}{{KbAFn}D`}0{KbAFj}2{ACdJd}{KbKh}{{}ABn}{AEjDd}{ACdDd}{{}{{Cb{AEj}}}}{{}Jd}03{AEj{{Cb{AEj}}}}{{Kb{Cb{b}}}Cd};{{KbGl}Cd};{ACdAEj}{ACdKb}{ACdABn}{AEjAj}00`{AFhAf}000000000{AFh{{Cf{AfHj}}}}11111111{ce{}{}}000000000`{JdABn}{AElAEj}{AEnACd}{AF`Kb}{{}AFl}{ABnABn}{{KbJlCd}{{Cb{D`}}}}{{Kbc{Cb{b}}}IjIf}{{AFlDb}AFl}{{ACdAj}Af}{{AFlAFb}AFl}22{{AFll}AFl}{{AFlAFd}AFl}====={cHj{}}{c{{Cf{e}}}{}{}}0000000000000000000{cCh{}}000000000{{ACdJ`AFfAAf}{{Cf{AfJd}}}}{{ACdJ`AFf}{{Cf{JbJd}}}}`````````````````````````````````````````````````````{{FdCd}AG`}0{{AG`Cd}AG`}{{JfCd}AG`}{{IjCd}AG`}{{ElCd}AG`}{{JlCd}AG`}{{AGbCd}AG`}{AFnDf}0{FdKd}0{AGdAGf}{AG`AGf}{DfAGf}{KdAGf}{AGhAGf}{JfAGf}{GnAGf}{IjAGf}{K`AGf}{ElAGf}{JlAGf}{AGbAGf}{KfAGf}{ce{}{}}000000000000000000000000000{AG`AG`}{DfDf}{KdKd}{AGhAGh}{JfJf}{GnGn}{AGjAGj}{IjIj}{K`K`}{ElEl}{JlJl}{AGbAGb}{KfKf}{{ce}Af{}{}}000000000000{IjFh}{{AG`{Fb{In}}}In}{{Jf{Fb{AGl}}}In}{{Ij{Fb{Fh}}}In}{{El{Fb{Dn}}}In}{{Jl{Fb{Gb}}}In}{{AGb{Fb{Gd}}}In}{{JfAGn}AGl}{{JfDb}AGl}{{IjD`Aj}Fh}{{Ij{Fb{D`}}}Fh}{{IjDbAGj}{{Cb{Fh}}}}{{Jl{Fb{F`}}}Gb}{ElDn}{{{Fb{c}}}GdFj}{AG`In}{KdF`}{JfAGl}{IjFh}5{JlGb}{AGbGd}{JlCd}{GnCd}{{JfAGn}An}{{IjD`Aj}An}{{AG`AG`}Aj}{{DfDf}Aj}{{KdKd}Aj}{{AGhAGh}Aj}{{JfJf}Aj}{{GnGn}Aj}{{AGjAGj}Aj}{{IjIj}Aj}{{K`K`}Aj}{{ElEl}Aj}{{JlJl}Aj}{{AGbAGb}Aj}{{KfKf}Aj}{{AG`Al}An}0{{DfAl}An}0{{KdAl}An}0{{AGhAl}An}0{{JfAl}An}0{{GnAl}An}0{{AGjAl}An}{{IjAl}An}0{{K`Al}An}0{{ElAl}An}0{{JlAl}An}0{{AH`Al}An}{{AGbAl}An}0{{KfAl}An}0{{Fd{Fb{AGh}}Aj}Gn}0{{AG`{Fb{AGh}}Aj}Gn}{{Jf{Fb{AGh}}Aj}Gn}{{Ij{Fb{AGh}}Aj}Gn}{{K`{Fb{AGh}}Aj}Gn}{{El{Fb{AGh}}Aj}Gn}{{Jl{Fb{AGh}}Aj}Gn}{{AGb{Fb{AGh}}Aj}Gn}{{Kf{Fb{AGh}}Aj}Gn}{cc{}}{IjDf}{GnDf}2{JfDf}{KfDf}{AG`Df}{ElDf}{JlDf}{AGbDf}{JlKd}{JfKd}{AGbKd}{ElKd}{AG`Kd}={IjKd}{K`AGh}{IjAGh}{AGbAGh}{KdAGh}{AG`AGh}{JlAGh}{ElAGh}{JfAGh}{cc{}}0000000000{Elb}{AG`Fh}{JfFh}{IjFh}{ElFh}{JlFh}{AGbFh}{IjCd}{AG`E`}{JfE`}{GnE`}{IjE`}{K`E`}{ElE`}{JlE`}{AGbE`}{KfE`}{AG`Kd}{AGbKd}{{JlCd}{{Cb{Kd}}}}{{JlCd}Kd}{Jl{{Nl{Kd}}}}{JlAH`}{Jl{{Cb{Dd}}}}{Gn{{Nl{Kd}}}}{AG`In}{JfAGl}{IjFh}{ElDn}{JlGb}{AGbGd}{Gn{{Cb{Kd}}}}{AGbCd}765432{{AGjc}AfC`}{ce{}{}}0000000000000{DfAG`}{KdAG`}{AGhAG`}{DfJf}{KdJf}{AGhJf}{DfGn}{DfIj}{KdIj}{AGhIj}:{AGhK`}{DfEl}{KdEl}{AGhEl}{DfJl}{KdJl}{AGhJl}{DfAGb}{KdAGb}{AGhAGb}{DfKf}{DfAj}{KdAj}{AGhAj}21022100{ElAj}{JlAj}0432{FdAj}0{GnAj}{KfAj}76517657{AG`Cd}{{AGjDb}Aj}{AGfAG`}{AGfDf}{AGfKd}{AGfJf}{AGfGn}{AGfIj}{AGfK`}{AGfEl}{AGfJl}{AGfAGb}{AGfKf}{AH`{{Cb{c}}}{}}{AFnJd}0{AG`Jd}{DfJd}{KdJd}{AGhJd}{JfJd}{GnJd}{IjJd}{K`Jd}{ElJd}{JlJd}{AGbJd}{KfJd}{{Fdb}El}0{{AG`b}El}{{Jfb}El}{{Gnb}El}{{Ijb}El}{{Elb}El}{{Jlb}El}{{AGbb}El}{{Jl{Fb{Kd}}Aj}Aj}{Fd{{Cb{Fh}}}}0{AG`{{Cb{Fh}}}}{Df{{Cb{Fh}}}}{JfFh}{IjFh}{ElFh}{Jl{{Cb{Fh}}}}{AGb{{Cb{Fh}}}}{ce{}{}}000000000000{cHj{}}00000000000{AGh{{Cf{AG`c}}}{}}{Kd{{Cf{AG`c}}}{}}{c{{Cf{e}}}{}{}}{Df{{Cf{AG`c}}}{}}1{AGh{{Cf{Kdc}}}{}}2{Df{{Cf{Kdc}}}{}}{Df{{Cf{AGhc}}}{}}4{AGh{{Cf{Jfc}}}{}}5{Kd{{Cf{Jfc}}}{}}{Df{{Cf{Jfc}}}{}}7{Df{{Cf{Gnc}}}{}}{Il{{Cf{AGjc}}}{}}9{AGh{{Cf{Ijc}}}{}}{Df{{Cf{Ijc}}}{}};{Kd{{Cf{Ijc}}}{}}{AGh{{Cf{K`c}}}{}}={Kd{{Cf{Elc}}}{}}{Df{{Cf{Elc}}}{}}{AGh{{Cf{Elc}}}{}}{c{{Cf{e}}}{}{}}{Kd{{Cf{Jlc}}}{}}{Df{{Cf{Jlc}}}{}}2{AGh{{Cf{Jlc}}}{}}33{AGh{{Cf{AGbc}}}{}}{Df{{Cf{AGbc}}}{}}{Kd{{Cf{AGbc}}}{}}{Df{{Cf{Kfc}}}{}}777777777777777{cCh{}}0000000000000{{JfCd}AGb}{{IjCd}AGb}{{ElCd}AGb}```````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````{{FnCnCj}Af}{{EfCnCj}Af}{{Hd{Fb{{Hf{FjDh}}}}}Af}{GfH`}0{OfAHb}0{HdF`}{FjF`}0{{AnJf}AGn}{EfGl}{In{{Cb{Eb}}}}{AGl{{Cb{Eb}}}}{Fh{{Cb{Eb}}}}{HdEb}{Dn{{Cb{Eb}}}}{Gb{{Cb{Eb}}}}{Gd{{Cb{Eb}}}}{Fj{{Cb{Eb}}}}0{{AnAj}D`}{GlDn}{AHdAHf}{InAHf}{FnAHf}{H`AHf}{AHbAHf}{F`AHf}{FlAHf}{AGlAHf}{EfAHf}{GlAHf}{EbAHf}{FhAHf}{JnAHf}{HdAHf}{DnAHf}{GbAHf}{GdAHf}{{FnCn}{{Nl{Cj}}}}{{EfCn}{{Nl{Cj}}}}{ce{}{}}0000000000000000000000000000000000000000000000000{EbAj}{AHhAHh}{InIn}{EdEd}{FnFn}{H`H`}{AHbAHb}{F`F`}{FlFl}{AGlAGl}{EfEf}{GlGl}{AHjAHj}{G`G`}{EbEb}{FhFh}{JnJn}{HdHd}{DnDn}{GbGb}{GdGd}{{ce}Af{}{}}0000000000000000000{{AHjAHj}Ah}{{FhFh}Fh}{{DnEl}Dn}{{FhIj}Fh}1{{AGlfAGl}Fh}{{GdFh}F`}{{Dnc{Fb{Fh}}}DnFd}0{{GdFhc}F`Fj}{{FhdFh}Fh}7??77?777?77{{GdGdGd}Gd}8{{DnIj}Fh}{{FhEl}Dn}88:{FnCd}{{FnCn}Cd}{{EfCn}Cd}{EfCd}{GbCd}{HdCd}2{eAB`{}{{ABb{c}}}}{cAn{}}{EfAf}{GlAf}{AnAf}{{AHhAHh}Aj}{{InIn}Aj}{{InH`}Aj}{{InAHb}Aj}{{InF`}Aj}{{InFl}Aj}{{EdEd}Aj}{{FnFn}Aj}{{H`H`}Aj}{{H`In}Aj}{{H`Gb}Aj}{{AHbGb}Aj}{{AHbEb}Aj}{{AHbFh}Aj}{{AHbIn}Aj}{{AHbEf}Aj}{{AHbAHb}Aj}{{AHbAGl}Aj}{{AHbJn}Aj}{{AHbGd}Aj}{{AHbDn}Aj}{{AHbHd}Aj}{{F`Gd}Aj}{{F`F`}Aj}{{F`AGl}Aj}{{F`Dn}Aj}{{F`Gb}Aj}{{F`Fh}Aj}{{F`In}Aj}{{FlIn}Aj}{{FlGd}Aj}{{FlDn}Aj}{{FlGb}Aj}{{FlFh}Aj}{{FlJn}Aj}{{FlAGl}Aj}{{FlFl}Aj}{{AGlAGl}Aj}{{AGlFl}Aj}{{AGlAHb}Aj}{{AGlF`}Aj}{{EfEf}Aj}{{EfAHb}Aj}{{GlGl}Aj}{{AHjAHj}Aj}{{G`G`}Aj}{{EbAHb}Aj}{{EbEb}Aj}{{FhFl}Aj}{{FhAHb}Aj}{{FhFh}Aj}{{FhF`}Aj}{{JnFl}Aj}{{JnJn}Aj}{{JnAHb}Aj}{{HdHd}Aj}{{HdAHb}Aj}{{DnF`}Aj}{{DnFl}Aj}{{DnDn}Aj}{{DnAHb}Aj}{{GbH`}Aj}{{GbAHb}Aj}{{GbF`}Aj}{{GbGb}Aj}{{GbFl}Aj}{{GdGd}Aj}{{GdFl}Aj}{{GdAHb}Aj}{{GdF`}Aj}{EbAf}{{AHhAl}{{Cf{AfAEh}}}}{{InAl}An}0{{EdAl}An}{{FnAl}An}0{{H`Al}An}0{{AHbAl}An}0{{F`Al}An}0{{FlAl}An}0{{AGlAl}An}0{{EfAl}An}0{{AnAl}An}{{GlAl}An}0{{AHjAl}An}{{G`Al}An}{{EbAl}An}0{{AHlAl}An}{{AHnAl}An}{{FhAl}An}0{{JnAl}An}0{{HdAl}An}0{{AI`Al}An}{{DnAl}An}0{{GbAl}An}0{{AIbAl}An}{{GdAl}An}0{cc{}}000{GbH`}{InH`}2{GdAHb}{F`AHb}4{HdAHb}{FhAHb}{EfAHb}{GbAHb}{AGlAHb}{JnAHb}{DnAHb}{InAHb}{EbAHb}={DnF`}{FhF`}{AGlF`}{GdF`}{GbF`}{InF`}{F`Fl}{GdFl}{cc{}}{GbFl}{AGlFl}{InFl}{JnFl}{FhFl}{DnFl}6666{AIdAHj}7{AIfG`}888888888888{GlCd}{Eb{{Cf{CdDb}}}}{Eb{{Cf{KdDb}}}}{Eb{{Cf{hDb}}}}`{Ef{{Nl{Dh}}}}{FnCd}{EfCd}{FnEf}{Gl{{Cb{Hl}}}}{AGl{{Cb{{Hf{AGnAj}}}}}}{Eb{{Cb{Aj}}}}{GlAb}{{GdCd}F`}{{FnCnCd}{{Cb{Cj}}}}{{EfCnCd}{{Cb{Cj}}}}{Eb{{Cb{Cd}}}}{Eb{{Cb{f}}}}{{GbCd}{{Cb{F`}}}}{{GbCd}F`}{GbAIb}{Ef{{Cb{Dh}}}}{Ef{{Cb{F`}}}}{Fj{{Cb{Ed}}}}0{Eb{{Cb{Ed}}}}{EfDd}{Eb{{Cb{d}}}}{{HdCd}{{Cb{{Hf{F`Dh}}}}}}{{HdCd}{{Hf{F`Dh}}}}{HdAI`}{Gl{{Cb{F`}}}}{{EbDb}{{Cb{Eb}}}}{EfCd};:{EfAAl}{GlAAl}{{EbCd}{{Cb{Jn}}}}{InDd}{F`Dd}{AGlDd}={GlDd}{Eb{{Cb{Dd}}}}{FhDd}{JnDd}{HdDd}{DnDd}{GbDd}{GdDd}{Ef{{Cb{Ef}}}}{Gl{{Cb{Gl}}}}{Eb{{Cb{Eb}}}}{Ed{{Cb{Ed}}}}{JnCd}{Jn{{Nl{Fl}}}}{Eb{{Cb{Aj}}}}{{EfCd}{{Cb{F`}}}}{EbCd}{EbG`}{{EbCd}{{Cb{{AIh{F`Dh}}}}}}0{{EbCd}{{Cb{Ed}}}}0{EbAHn}{EbAHl}`{Ef{{Nl{F`}}}}{Eb{{Cb{Dh}}}}??>={Ef{{Cb{Dd}}}}{Gl{{Cb{Dd}}}}{Fh{{Cb{Nd}}}}{{FnCnDb}{{Cb{Cj}}}}{{EfCnDb}{{Cb{Cj}}}}{In{{Cb{Dd}}}}{Jn{{Cb{Dd}}}}{Ef{{Cb{Lf}}}}{FnAHh}{Eb{{Cb{AHh}}}}{Gl{{Cb{A`}}}}{InAG`}{AHbDf}{F`Kd}{AGlJf}{EfGn}{EbDf}{FhIj}{DnEl}{GbJl}{GdAGb}{GlAHj}{Ed{{AIh{F`Dh}}}}{EdAHb}{GlDf}{Gln}{Eb{{Cf{AjDb}}}}{Fh{{Cb{D`}}}}{EbAj}{EfAj}{GlAj}{{Inc}AfC`}{{Fnc}AfC`}{{H`c}AfC`}{{AHbc}AfC`}{{F`c}AfC`}{{Flc}AfC`}{{AGlc}AfC`}{{Efc}AfC`}{{Glc}AfC`}{{AHjc}AfC`}{{G`c}AfC`}{{Ebc}AfC`}{{Fhc}AfC`}{{Jnc}AfC`}{{Hdc}AfC`}{{Dnc}AfC`}{{Gbc}AfC`}{{Gdc}AfC`}{AnCd}{ce{}{}}000000000000{AHjAId}{G`AIf}222222222222{H`In}{AHbIn}{F`In}{FlIn}{AHbAGl}{F`AGl}{FlAGl}{AHbEf}{AHbEb}{AHbFh}{F`Fh}{FlFh}>>>>{FlJn}{AHbHd}{An}{AHbDn}{F`Dn}{FlDn}{H`Gb}{AHbGb}{F`Gb}{FlGb}{AHbGd}{F`Gd}{FlGd}{H`Aj}{AHbAj}{F`Aj}{FlAj}{EbAj}{InAj}{AGlAj}{FhAj}{DnAj}{GdAj}4{GlAj}13100987999877{JnAj}65{EfAj}5{HdAj}5{GbAj}5==<;{OfAj}04?>=<{FnAj}<<6;:493827?>={AHf{{Ff{}{{AIj{c}}}}}AIl}{AHf{{Gj{}{{AIj{c}}}}}AIn}{AHf{{Hb{}{{AIj{c}}}}}AJ`}{AHfIn}{AJbEd}{AHfFn}{AHfH`}{AHfAHb}{AHfF`}{AHfAGl}0{AHf{{Cb{Ef}}}}{AHfGl}{AHfEb}{AHfFh}0{AHfJn}{AHfHd}{AHfDn}00{AHfGb}{AHfGd}000{AHl{{Cb{c}}}{}}{AHn{{Cb{c}}}{}}{AI`{{Cb{c}}}{}}{AIb{{Cb{c}}}{}}{{AHjAHj}{{Cb{Ah}}}}{InAf}{AGlAf}{EfAf}{FhAf}{JnAf}{DnAf}{GbAf}{GdAf}{OfJd}0{{FnCnCd}Af}{{EfCnCd}Af}{EbAf}{{FnCnDb}Af}{{EfCnDb}Af}{{InIn}Af}{{AGlAGl}Af}{{EfEf}Af}{{EbEb}Af}{{FhFh}Af}{{JnJn}Af}{{HdHd}Af}{{DnDn}Af}{{GbGb}Af}{{GdGd}Af}{{Ef{ACb{Ef}}}Aj}{{GlCd}Af}{{EbCd}{{Cf{AfDb}}}}{{FnCnCd}Af}{{Ebh}{{Cf{AfDb}}}}{{FnCd}Af}{{EfCd}Af}{{GlHl}Af}{{GlAj}Af}{{EbAj}Af}{{GlAb}Af}2{{EbCd}Af}{{GbCdc}AjFj}{{EfDb}Af}{{GlFj}Af}{{EfAAl}Af}{{GlAAl}Af}{{GlJnCd}Af}{{EbJnCd}{{Cf{AfDb}}}}{{FjDb}Af}0{{InDb}Af}{{F`Db}Af}{{AGlDb}Af}{{GlDb}Af}{{EbDb}{{Cf{AfDb}}}}{{FhDb}Af}{{HdDb}Af}{{DnDb}Af}{{GbDb}Af}{{GdDb}Af}{{EbAj}Af}{{EbCdc}AjFj}{{EfCdCd}Af}{{EfEf}Af}{{Ef{Cb{Db}}}Af}{{Gl{Cb{Db}}}Af}{{EfLf}Af}{{FnAj}Af}{{FnAHh}Af}{{GlAj}Af}{{Gl{Cb{A`}}}Af}1{{GlAHj}Af}{{Gln}Af}{{EbAj}{{Cf{AfDb}}}}{ce{}{}}0000000000000000000{cHj{}}000000000000000{Fn{{AIh{F`Eb}}}}{c{{Cf{e}}}{}{}}0{Fl{{Cf{Inc}}}{}}{F`{{Cf{Inc}}}{}}{AHb{{Cf{Inc}}}{}}{H`{{Cf{Inc}}}{}}4444{AHb{{Cf{F`c}}}{}}{Fl{{Cf{F`c}}}{}}6{AHb{{Cf{Flc}}}{}}7{F`{{Cf{AGlc}}}{}}{Eb{{Cf{AGlc}}}{}}9{AHb{{Cf{AGlc}}}{}}{Fl{{Cf{AGlc}}}{}}{AHb{{Cf{Efc}}}{}}<<<<<<{AHb{{Cf{Ebc}}}{}}=={AHb{{Cf{Fhc}}}{}}{Fl{{Cf{Fhc}}}{}}{Eb{{Cf{Fhc}}}{}}{F`{{Cf{Fhc}}}{}}{c{{Cf{e}}}{}{}}{Fl{{Cf{Jnc}}}{}}1{AHb{{Cf{Jnc}}}{}}{Eb{{Cf{Hdc}}}{}}{AHb{{Cf{Hdc}}}{}}44{F`{{Cf{Dnc}}}{}}{Eb{{Cf{Dnc}}}{}}{Fl{{Cf{Dnc}}}{}}7{AHb{{Cf{Dnc}}}{}}{AHb{{Cf{Gbc}}}{}}{H`{{Cf{Gbc}}}{}}{Fl{{Cf{Gbc}}}{}}{F`{{Cf{Gbc}}}{}}<<{Fl{{Cf{Gdc}}}{}}{F`{{Cf{Gdc}}}{}}>{AHb{{Cf{Gdc}}}{}}?????????????????????????{cCh{}}000000000000000000000000{{EfAj}Aj}{EfAf}0","c":[1675,2097,2098,2099,2100,2101,2102,2103,2104,2105],"p":[[5,"AddressSpace",0],[6,"IntPredicate",0],[6,"FloatPredicate",0],[6,"AtomicOrdering",0],[6,"AtomicRMWBinOp",0],[6,"OptimizationLevel",0],[6,"GlobalVisibility",0],[6,"ThreadLocalMode",0],[6,"DLLStorageClass",0],[6,"InlineAsmDialect",0],[1,"unit"],[6,"Ordering",3178],[1,"bool"],[5,"Formatter",3179],[8,"Result",3179],[1,"u16"],[6,"LLVMIntPredicate",3180],[6,"LLVMRealPredicate",3180],[6,"LLVMAtomicOrdering",3180],[6,"LLVMAtomicRMWBinOp",3180],[6,"LLVMVisibility",3180],[6,"LLVMDLLStorageClass",3180],[6,"LLVMInlineAsmDialect",3180],[10,"Hasher",3181],[6,"Option",3182],[1,"u32"],[6,"Result",3183],[5,"TypeId",3184],[5,"Attribute",253],[8,"LLVMAttributeRef",3185],[6,"AttributeLoc",253],[1,"u64"],[1,"str"],[5,"CStr",3186],[6,"AnyTypeEnum",1721],[5,"BasicBlock",295],[8,"LLVMBasicBlockRef",3185],[5,"InstructionIter",295],[5,"PointerValue",2211],[5,"ContextRef",517],[5,"InstructionValue",2211],[5,"BasicValueUse",2211],[5,"FunctionValue",2211],[5,"Builder",339],[8,"LLVMBuilderRef",3185],[5,"PointerType",1721],[6,"BuilderError",339],[6,"BasicValueEnum",2211],[1,"slice"],[10,"BasicType",1721],[10,"IntMathValue",2211],[5,"IntValue",2211],[10,"BasicValue",2211],[6,"BasicMetadataValueEnum",2211],[5,"CallSiteValue",2211],[6,"InstructionOpcode",2211],[5,"StructValue",2211],[5,"VectorValue",2211],[10,"AggregateValue",2211],[1,"i32"],[10,"FloatMathValue",2211],[5,"GlobalValue",2211],[5,"FunctionType",1721],[6,"AggregateValueEnum",2211],[10,"PointerMathValue",2211],[5,"PhiValue",2211],[1,"tuple"],[5,"DILocation",631],[5,"String",3187],[5,"Comdat",477],[8,"LLVMComdatRef",3185],[6,"ComdatSelectionKind",477],[6,"LLVMComdatSelectionKind",3188],[5,"Context",517],[10,"AsContextRef",517],[8,"LLVMContextRef",3185],[5,"IntType",1721],[1,"u8"],[5,"ArrayValue",2211],[5,"Module",1172],[5,"MemoryBuffer",1153],[5,"LLVMString",1461],[5,"FloatType",1721],[17,"Output"],[10,"FnOnce",3189],[5,"StructType",1721],[5,"MetadataValue",2211],[5,"MetadataType",1721],[5,"TargetData",1505],[6,"BasicTypeEnum",1721],[5,"VoidType",1721],[5,"DataLayout",619],[8,"c_char",3190],[10,"AsDIScope",631],[5,"DIScope",631],[5,"DIFile",631],[5,"DICompileUnit",631],[5,"DINamespace",631],[5,"DISubprogram",631],[5,"DIType",631],[5,"DIDerivedType",631],[5,"DIBasicType",631],[5,"DICompositeType",631],[5,"DILexicalBlock",631],[5,"DIGlobalVariableExpression",631],[5,"DebugInfoBuilder",631],[8,"LLVMDIBuilderRef",3185],[8,"LLVMMetadataRef",3185],[5,"DILocalVariable",631],[5,"DIExpression",631],[5,"DISubroutineType",631],[6,"DWARFEmissionKind",631],[6,"DWARFSourceLanguage",631],[1,"i64"],[5,"Range",3191],[8,"DIFlags",631],[8,"LLVMDWARFTypeEncoding",631],[5,"Vec",3192],[8,"c_uint",3193],[6,"LLVMDWARFEmissionKind",3194],[6,"LLVMDWARFSourceLanguage",3194],[5,"ExecutionEngine",1047],[10,"AnyValue",2211],[1,"usize"],[8,"LLVMExecutionEngineRef",3195],[5,"JitFunction",1047],[10,"Copy",3196],[1,"fn"],[6,"RemoveModuleError",1047],[10,"Error",3197],[10,"Clone",3198],[6,"FunctionLookupError",1047],[10,"UnsafeFunctionPointer",1047],[5,"Rc",3199],[5,"GenericValue",2211],[8,"c_int",3193],[5,"Intrinsic",1137],[8,"LLVMMemoryBufferRef",3185],[5,"Path",3200],[5,"ObjectFile",1317],[6,"FlagBehavior",1172],[6,"Linkage",1172],[8,"LLVMModuleRef",3185],[8,"LLVMPassManagerRef",3185],[10,"Borrow",3201],[5,"FunctionIterator",1172],[5,"GlobalIterator",1172],[6,"LLVMLinkage",3180],[6,"LLVMModuleFlagBehavior",3180],[5,"Ref",3202],[5,"TargetTriple",1505],[10,"AsRef",3203],[5,"PassManager",1418],[5,"TargetMachine",1505],[5,"PassBuilderOptions",1418],[5,"File",3204],[8,"LLVMObjectFileRef",3205],[5,"SectionIterator",1317],[8,"LLVMSectionIteratorRef",3205],[5,"Section",1317],[5,"RelocationIterator",1317],[8,"LLVMRelocationIteratorRef",3205],[5,"Relocation",1317],[5,"SymbolIterator",1317],[8,"LLVMSymbolIteratorRef",3205],[5,"Symbol",1317],[8,"LLVMPassBuilderOptionsRef",3206],[10,"PassManagerSubType",1418],[10,"Debug",3179],[17,"Input"],[6,"LoadLibraryError",1461],[5,"Error",3179],[5,"Target",1505],[8,"LLVMTargetRef",3207],[8,"LLVMTargetMachineRef",3207],[8,"LLVMTargetDataRef",3208],[6,"CodeModel",1505],[6,"RelocMode",1505],[6,"FileType",1505],[5,"InitializationConfig",1505],[6,"ByteOrdering",1505],[5,"TargetMachineOptions",1505],[10,"AnyType",1721],[5,"ArrayType",1721],[5,"VectorType",1721],[10,"AsTypeRef",1721],[8,"LLVMTypeRef",3185],[6,"BasicMetadataTypeEnum",1721],[6,"StringRadix",1721],[5,"FloatValue",2211],[1,"f64"],[5,"FieldTypesIter",1721],[6,"AnyValueEnum",2211],[10,"AsValueRef",2211],[8,"LLVMValueRef",3185],[6,"LLVMTailCallKind",2211],[6,"UnnamedAddress",2211],[5,"OperandIter",2211],[5,"OperandUseIter",2211],[5,"IncomingIter",2211],[5,"FieldValueIter",2211],[6,"LLVMUnnamedAddr",3180],[6,"LLVMOpcode",3180],[6,"Either",3209],[17,"BaseType"],[10,"IntMathType",1721],[10,"FloatMathType",1721],[10,"PointerMathType",1721],[8,"LLVMUseRef",3185],[10,"DIFlagsConstants",631]],"b":[[454,"impl-Display-for-BuilderError"],[455,"impl-Debug-for-BuilderError"],[555,"impl-PartialEq-for-Context"],[556,"impl-PartialEq%3CContextRef%3C\'_%3E%3E-for-Context"],[557,"impl-PartialEq-for-ContextRef%3C\'ctx%3E"],[558,"impl-PartialEq%3CContext%3E-for-ContextRef%3C\'_%3E"],[1069,"impl-JitFunction%3C\'_,+unsafe+extern+%22C%22+fn(J,+K,+L,+M)+-%3E+Output%3E"],[1070,"impl-JitFunction%3C\'_,+unsafe+extern+%22C%22+fn(G,+H,+I,+J,+K,+L,+M)+-%3E+Output%3E"],[1071,"impl-JitFunction%3C\'_,+unsafe+extern+%22C%22+fn(D,+E,+F,+G,+H,+I,+J,+K,+L,+M)+-%3E+Output%3E"],[1072,"impl-JitFunction%3C\'_,+unsafe+extern+%22C%22+fn(H,+I,+J,+K,+L,+M)+-%3E+Output%3E"],[1073,"impl-JitFunction%3C\'_,+unsafe+extern+%22C%22+fn(L,+M)+-%3E+Output%3E"],[1074,"impl-JitFunction%3C\'_,+unsafe+extern+%22C%22+fn(I,+J,+K,+L,+M)+-%3E+Output%3E"],[1075,"impl-JitFunction%3C\'_,+unsafe+extern+%22C%22+fn(B,+C,+D,+E,+F,+G,+H,+I,+J,+K,+L,+M)+-%3E+Output%3E"],[1076,"impl-JitFunction%3C\'_,+unsafe+extern+%22C%22+fn(A,+B,+C,+D,+E,+F,+G,+H,+I,+J,+K,+L,+M)+-%3E+Output%3E"],[1077,"impl-JitFunction%3C\'_,+unsafe+extern+%22C%22+fn(C,+D,+E,+F,+G,+H,+I,+J,+K,+L,+M)+-%3E+Output%3E"],[1078,"impl-JitFunction%3C\'_,+unsafe+extern+%22C%22+fn(K,+L,+M)+-%3E+Output%3E"],[1079,"impl-JitFunction%3C\'_,+unsafe+extern+%22C%22+fn(E,+F,+G,+H,+I,+J,+K,+L,+M)+-%3E+Output%3E"],[1080,"impl-JitFunction%3C\'_,+unsafe+extern+%22C%22+fn()+-%3E+Output%3E"],[1081,"impl-JitFunction%3C\'_,+unsafe+extern+%22C%22+fn(F,+G,+H,+I,+J,+K,+L,+M)+-%3E+Output%3E"],[1082,"impl-JitFunction%3C\'_,+unsafe+extern+%22C%22+fn(M)+-%3E+Output%3E"],[1093,"impl-Display-for-FunctionLookupError"],[1094,"impl-Debug-for-FunctionLookupError"],[1095,"impl-Display-for-RemoveModuleError"],[1096,"impl-Debug-for-RemoveModuleError"],[1479,"impl-Display-for-LLVMString"],[1480,"impl-Debug-for-LLVMString"],[1481,"impl-Debug-for-LoadLibraryError"],[1482,"impl-Display-for-LoadLibraryError"],[1593,"impl-Debug-for-TargetTriple"],[1594,"impl-Display-for-TargetTriple"],[1892,"impl-Debug-for-ArrayType%3C\'ctx%3E"],[1893,"impl-Display-for-ArrayType%3C\'_%3E"],[1894,"impl-Debug-for-AnyTypeEnum%3C\'ctx%3E"],[1895,"impl-Display-for-AnyTypeEnum%3C\'_%3E"],[1896,"impl-Debug-for-BasicTypeEnum%3C\'ctx%3E"],[1897,"impl-Display-for-BasicTypeEnum%3C\'_%3E"],[1898,"impl-Debug-for-BasicMetadataTypeEnum%3C\'ctx%3E"],[1899,"impl-Display-for-BasicMetadataTypeEnum%3C\'_%3E"],[1900,"impl-Debug-for-FloatType%3C\'ctx%3E"],[1901,"impl-Display-for-FloatType%3C\'_%3E"],[1902,"impl-Debug-for-FunctionType%3C\'_%3E"],[1903,"impl-Display-for-FunctionType%3C\'_%3E"],[1905,"impl-Display-for-IntType%3C\'_%3E"],[1906,"impl-Debug-for-IntType%3C\'ctx%3E"],[1907,"impl-Debug-for-MetadataType%3C\'ctx%3E"],[1908,"impl-Display-for-MetadataType%3C\'_%3E"],[1909,"impl-Display-for-PointerType%3C\'_%3E"],[1910,"impl-Debug-for-PointerType%3C\'ctx%3E"],[1911,"impl-Display-for-StructType%3C\'_%3E"],[1912,"impl-Debug-for-StructType%3C\'ctx%3E"],[1914,"impl-Display-for-VectorType%3C\'_%3E"],[1915,"impl-Debug-for-VectorType%3C\'ctx%3E"],[1916,"impl-Display-for-VoidType%3C\'_%3E"],[1917,"impl-Debug-for-VoidType%3C\'ctx%3E"],[1929,"impl-From%3CIntType%3C\'ctx%3E%3E-for-AnyTypeEnum%3C\'ctx%3E"],[1930,"impl-From%3CFunctionType%3C\'ctx%3E%3E-for-AnyTypeEnum%3C\'ctx%3E"],[1932,"impl-From%3CFloatType%3C\'ctx%3E%3E-for-AnyTypeEnum%3C\'ctx%3E"],[1933,"impl-From%3CVoidType%3C\'ctx%3E%3E-for-AnyTypeEnum%3C\'ctx%3E"],[1934,"impl-From%3CArrayType%3C\'ctx%3E%3E-for-AnyTypeEnum%3C\'ctx%3E"],[1935,"impl-From%3CPointerType%3C\'ctx%3E%3E-for-AnyTypeEnum%3C\'ctx%3E"],[1936,"impl-From%3CStructType%3C\'ctx%3E%3E-for-AnyTypeEnum%3C\'ctx%3E"],[1937,"impl-From%3CVectorType%3C\'ctx%3E%3E-for-AnyTypeEnum%3C\'ctx%3E"],[1938,"impl-From%3CStructType%3C\'ctx%3E%3E-for-BasicTypeEnum%3C\'ctx%3E"],[1939,"impl-From%3CFloatType%3C\'ctx%3E%3E-for-BasicTypeEnum%3C\'ctx%3E"],[1940,"impl-From%3CVectorType%3C\'ctx%3E%3E-for-BasicTypeEnum%3C\'ctx%3E"],[1941,"impl-From%3CPointerType%3C\'ctx%3E%3E-for-BasicTypeEnum%3C\'ctx%3E"],[1942,"impl-From%3CArrayType%3C\'ctx%3E%3E-for-BasicTypeEnum%3C\'ctx%3E"],[1944,"impl-From%3CIntType%3C\'ctx%3E%3E-for-BasicTypeEnum%3C\'ctx%3E"],[1945,"impl-From%3CMetadataType%3C\'ctx%3E%3E-for-BasicMetadataTypeEnum%3C\'ctx%3E"],[1946,"impl-From%3CIntType%3C\'ctx%3E%3E-for-BasicMetadataTypeEnum%3C\'ctx%3E"],[1947,"impl-From%3CVectorType%3C\'ctx%3E%3E-for-BasicMetadataTypeEnum%3C\'ctx%3E"],[1948,"impl-From%3CBasicTypeEnum%3C\'ctx%3E%3E-for-BasicMetadataTypeEnum%3C\'ctx%3E"],[1949,"impl-From%3CArrayType%3C\'ctx%3E%3E-for-BasicMetadataTypeEnum%3C\'ctx%3E"],[1950,"impl-From%3CStructType%3C\'ctx%3E%3E-for-BasicMetadataTypeEnum%3C\'ctx%3E"],[1951,"impl-From%3CPointerType%3C\'ctx%3E%3E-for-BasicMetadataTypeEnum%3C\'ctx%3E"],[1952,"impl-From%3CFloatType%3C\'ctx%3E%3E-for-BasicMetadataTypeEnum%3C\'ctx%3E"],[2141,"impl-TryFrom%3CBasicMetadataTypeEnum%3C\'ctx%3E%3E-for-ArrayType%3C\'ctx%3E"],[2142,"impl-TryFrom%3CBasicTypeEnum%3C\'ctx%3E%3E-for-ArrayType%3C\'ctx%3E"],[2144,"impl-TryFrom%3CAnyTypeEnum%3C\'ctx%3E%3E-for-ArrayType%3C\'ctx%3E"],[2146,"impl-TryFrom%3CBasicMetadataTypeEnum%3C\'ctx%3E%3E-for-BasicTypeEnum%3C\'ctx%3E"],[2148,"impl-TryFrom%3CAnyTypeEnum%3C\'ctx%3E%3E-for-BasicTypeEnum%3C\'ctx%3E"],[2151,"impl-TryFrom%3CBasicMetadataTypeEnum%3C\'ctx%3E%3E-for-FloatType%3C\'ctx%3E"],[2153,"impl-TryFrom%3CBasicTypeEnum%3C\'ctx%3E%3E-for-FloatType%3C\'ctx%3E"],[2154,"impl-TryFrom%3CAnyTypeEnum%3C\'ctx%3E%3E-for-FloatType%3C\'ctx%3E"],[2159,"impl-TryFrom%3CBasicMetadataTypeEnum%3C\'ctx%3E%3E-for-IntType%3C\'ctx%3E"],[2160,"impl-TryFrom%3CAnyTypeEnum%3C\'ctx%3E%3E-for-IntType%3C\'ctx%3E"],[2162,"impl-TryFrom%3CBasicTypeEnum%3C\'ctx%3E%3E-for-IntType%3C\'ctx%3E"],[2165,"impl-TryFrom%3CBasicTypeEnum%3C\'ctx%3E%3E-for-PointerType%3C\'ctx%3E"],[2166,"impl-TryFrom%3CAnyTypeEnum%3C\'ctx%3E%3E-for-PointerType%3C\'ctx%3E"],[2167,"impl-TryFrom%3CBasicMetadataTypeEnum%3C\'ctx%3E%3E-for-PointerType%3C\'ctx%3E"],[2169,"impl-TryFrom%3CBasicTypeEnum%3C\'ctx%3E%3E-for-StructType%3C\'ctx%3E"],[2170,"impl-TryFrom%3CAnyTypeEnum%3C\'ctx%3E%3E-for-StructType%3C\'ctx%3E"],[2172,"impl-TryFrom%3CBasicMetadataTypeEnum%3C\'ctx%3E%3E-for-StructType%3C\'ctx%3E"],[2175,"impl-TryFrom%3CBasicMetadataTypeEnum%3C\'ctx%3E%3E-for-VectorType%3C\'ctx%3E"],[2176,"impl-TryFrom%3CAnyTypeEnum%3C\'ctx%3E%3E-for-VectorType%3C\'ctx%3E"],[2177,"impl-TryFrom%3CBasicTypeEnum%3C\'ctx%3E%3E-for-VectorType%3C\'ctx%3E"],[2522,"impl-PartialEq-for-ArrayValue%3C\'ctx%3E"],[2523,"impl-PartialEq%3CAggregateValueEnum%3C\'ctx%3E%3E-for-ArrayValue%3C\'ctx%3E"],[2524,"impl-PartialEq%3CAnyValueEnum%3C\'ctx%3E%3E-for-ArrayValue%3C\'ctx%3E"],[2525,"impl-PartialEq%3CBasicValueEnum%3C\'ctx%3E%3E-for-ArrayValue%3C\'ctx%3E"],[2526,"impl-PartialEq%3CBasicMetadataValueEnum%3C\'ctx%3E%3E-for-ArrayValue%3C\'ctx%3E"],[2529,"impl-PartialEq-for-AggregateValueEnum%3C\'ctx%3E"],[2530,"impl-PartialEq%3CArrayValue%3C\'ctx%3E%3E-for-AggregateValueEnum%3C\'ctx%3E"],[2531,"impl-PartialEq%3CStructValue%3C\'ctx%3E%3E-for-AggregateValueEnum%3C\'ctx%3E"],[2532,"impl-PartialEq%3CStructValue%3C\'ctx%3E%3E-for-AnyValueEnum%3C\'ctx%3E"],[2533,"impl-PartialEq%3CInstructionValue%3C\'ctx%3E%3E-for-AnyValueEnum%3C\'ctx%3E"],[2534,"impl-PartialEq%3CIntValue%3C\'ctx%3E%3E-for-AnyValueEnum%3C\'ctx%3E"],[2535,"impl-PartialEq%3CArrayValue%3C\'ctx%3E%3E-for-AnyValueEnum%3C\'ctx%3E"],[2536,"impl-PartialEq%3CFunctionValue%3C\'ctx%3E%3E-for-AnyValueEnum%3C\'ctx%3E"],[2537,"impl-PartialEq-for-AnyValueEnum%3C\'ctx%3E"],[2538,"impl-PartialEq%3CFloatValue%3C\'ctx%3E%3E-for-AnyValueEnum%3C\'ctx%3E"],[2539,"impl-PartialEq%3CMetadataValue%3C\'ctx%3E%3E-for-AnyValueEnum%3C\'ctx%3E"],[2540,"impl-PartialEq%3CVectorValue%3C\'ctx%3E%3E-for-AnyValueEnum%3C\'ctx%3E"],[2541,"impl-PartialEq%3CPointerValue%3C\'ctx%3E%3E-for-AnyValueEnum%3C\'ctx%3E"],[2542,"impl-PartialEq%3CPhiValue%3C\'ctx%3E%3E-for-AnyValueEnum%3C\'ctx%3E"],[2543,"impl-PartialEq%3CVectorValue%3C\'ctx%3E%3E-for-BasicValueEnum%3C\'ctx%3E"],[2544,"impl-PartialEq-for-BasicValueEnum%3C\'ctx%3E"],[2545,"impl-PartialEq%3CFloatValue%3C\'ctx%3E%3E-for-BasicValueEnum%3C\'ctx%3E"],[2546,"impl-PartialEq%3CPointerValue%3C\'ctx%3E%3E-for-BasicValueEnum%3C\'ctx%3E"],[2547,"impl-PartialEq%3CStructValue%3C\'ctx%3E%3E-for-BasicValueEnum%3C\'ctx%3E"],[2548,"impl-PartialEq%3CIntValue%3C\'ctx%3E%3E-for-BasicValueEnum%3C\'ctx%3E"],[2549,"impl-PartialEq%3CArrayValue%3C\'ctx%3E%3E-for-BasicValueEnum%3C\'ctx%3E"],[2550,"impl-PartialEq%3CArrayValue%3C\'ctx%3E%3E-for-BasicMetadataValueEnum%3C\'ctx%3E"],[2551,"impl-PartialEq%3CVectorValue%3C\'ctx%3E%3E-for-BasicMetadataValueEnum%3C\'ctx%3E"],[2552,"impl-PartialEq%3CPointerValue%3C\'ctx%3E%3E-for-BasicMetadataValueEnum%3C\'ctx%3E"],[2553,"impl-PartialEq%3CStructValue%3C\'ctx%3E%3E-for-BasicMetadataValueEnum%3C\'ctx%3E"],[2554,"impl-PartialEq%3CIntValue%3C\'ctx%3E%3E-for-BasicMetadataValueEnum%3C\'ctx%3E"],[2555,"impl-PartialEq%3CMetadataValue%3C\'ctx%3E%3E-for-BasicMetadataValueEnum%3C\'ctx%3E"],[2556,"impl-PartialEq%3CFloatValue%3C\'ctx%3E%3E-for-BasicMetadataValueEnum%3C\'ctx%3E"],[2557,"impl-PartialEq-for-BasicMetadataValueEnum%3C\'ctx%3E"],[2558,"impl-PartialEq-for-FloatValue%3C\'ctx%3E"],[2559,"impl-PartialEq%3CBasicMetadataValueEnum%3C\'ctx%3E%3E-for-FloatValue%3C\'ctx%3E"],[2560,"impl-PartialEq%3CAnyValueEnum%3C\'ctx%3E%3E-for-FloatValue%3C\'ctx%3E"],[2561,"impl-PartialEq%3CBasicValueEnum%3C\'ctx%3E%3E-for-FloatValue%3C\'ctx%3E"],[2562,"impl-PartialEq-for-FunctionValue%3C\'ctx%3E"],[2563,"impl-PartialEq%3CAnyValueEnum%3C\'ctx%3E%3E-for-FunctionValue%3C\'ctx%3E"],[2567,"impl-PartialEq%3CAnyValueEnum%3C\'ctx%3E%3E-for-InstructionValue%3C\'ctx%3E"],[2568,"impl-PartialEq-for-InstructionValue%3C\'ctx%3E"],[2569,"impl-PartialEq%3CBasicMetadataValueEnum%3C\'ctx%3E%3E-for-IntValue%3C\'ctx%3E"],[2570,"impl-PartialEq%3CAnyValueEnum%3C\'ctx%3E%3E-for-IntValue%3C\'ctx%3E"],[2571,"impl-PartialEq-for-IntValue%3C\'ctx%3E"],[2572,"impl-PartialEq%3CBasicValueEnum%3C\'ctx%3E%3E-for-IntValue%3C\'ctx%3E"],[2573,"impl-PartialEq%3CBasicMetadataValueEnum%3C\'ctx%3E%3E-for-MetadataValue%3C\'ctx%3E"],[2574,"impl-PartialEq-for-MetadataValue%3C\'ctx%3E"],[2575,"impl-PartialEq%3CAnyValueEnum%3C\'ctx%3E%3E-for-MetadataValue%3C\'ctx%3E"],[2576,"impl-PartialEq-for-PhiValue%3C\'ctx%3E"],[2577,"impl-PartialEq%3CAnyValueEnum%3C\'ctx%3E%3E-for-PhiValue%3C\'ctx%3E"],[2578,"impl-PartialEq%3CBasicValueEnum%3C\'ctx%3E%3E-for-PointerValue%3C\'ctx%3E"],[2579,"impl-PartialEq%3CBasicMetadataValueEnum%3C\'ctx%3E%3E-for-PointerValue%3C\'ctx%3E"],[2580,"impl-PartialEq-for-PointerValue%3C\'ctx%3E"],[2581,"impl-PartialEq%3CAnyValueEnum%3C\'ctx%3E%3E-for-PointerValue%3C\'ctx%3E"],[2582,"impl-PartialEq%3CAggregateValueEnum%3C\'ctx%3E%3E-for-StructValue%3C\'ctx%3E"],[2583,"impl-PartialEq%3CAnyValueEnum%3C\'ctx%3E%3E-for-StructValue%3C\'ctx%3E"],[2584,"impl-PartialEq%3CBasicValueEnum%3C\'ctx%3E%3E-for-StructValue%3C\'ctx%3E"],[2585,"impl-PartialEq-for-StructValue%3C\'ctx%3E"],[2586,"impl-PartialEq%3CBasicMetadataValueEnum%3C\'ctx%3E%3E-for-StructValue%3C\'ctx%3E"],[2587,"impl-PartialEq-for-VectorValue%3C\'ctx%3E"],[2588,"impl-PartialEq%3CBasicMetadataValueEnum%3C\'ctx%3E%3E-for-VectorValue%3C\'ctx%3E"],[2589,"impl-PartialEq%3CAnyValueEnum%3C\'ctx%3E%3E-for-VectorValue%3C\'ctx%3E"],[2590,"impl-PartialEq%3CBasicValueEnum%3C\'ctx%3E%3E-for-VectorValue%3C\'ctx%3E"],[2593,"impl-Display-for-ArrayValue%3C\'_%3E"],[2594,"impl-Debug-for-ArrayValue%3C\'_%3E"],[2596,"impl-Debug-for-CallSiteValue%3C\'ctx%3E"],[2597,"impl-Display-for-CallSiteValue%3C\'_%3E"],[2598,"impl-Debug-for-AggregateValueEnum%3C\'ctx%3E"],[2599,"impl-Display-for-AggregateValueEnum%3C\'_%3E"],[2600,"impl-Display-for-AnyValueEnum%3C\'_%3E"],[2601,"impl-Debug-for-AnyValueEnum%3C\'ctx%3E"],[2602,"impl-Display-for-BasicValueEnum%3C\'_%3E"],[2603,"impl-Debug-for-BasicValueEnum%3C\'ctx%3E"],[2604,"impl-Debug-for-BasicMetadataValueEnum%3C\'ctx%3E"],[2605,"impl-Display-for-BasicMetadataValueEnum%3C\'_%3E"],[2606,"impl-Debug-for-FloatValue%3C\'ctx%3E"],[2607,"impl-Display-for-FloatValue%3C\'_%3E"],[2608,"impl-Debug-for-FunctionValue%3C\'_%3E"],[2609,"impl-Display-for-FunctionValue%3C\'_%3E"],[2611,"impl-Debug-for-GlobalValue%3C\'ctx%3E"],[2612,"impl-Display-for-GlobalValue%3C\'_%3E"],[2615,"impl-Debug-for-InstructionValue%3C\'ctx%3E"],[2616,"impl-Display-for-InstructionValue%3C\'_%3E"],[2619,"impl-Debug-for-IntValue%3C\'ctx%3E"],[2620,"impl-Display-for-IntValue%3C\'_%3E"],[2621,"impl-Display-for-MetadataValue%3C\'_%3E"],[2622,"impl-Debug-for-MetadataValue%3C\'_%3E"],[2623,"impl-Display-for-PhiValue%3C\'_%3E"],[2624,"impl-Debug-for-PhiValue%3C\'ctx%3E"],[2626,"impl-Display-for-PointerValue%3C\'_%3E"],[2627,"impl-Debug-for-PointerValue%3C\'ctx%3E"],[2628,"impl-Debug-for-StructValue%3C\'ctx%3E"],[2629,"impl-Display-for-StructValue%3C\'_%3E"],[2631,"impl-Debug-for-VectorValue%3C\'ctx%3E"],[2632,"impl-Display-for-VectorValue%3C\'_%3E"],[2637,"impl-From%3CStructValue%3C\'ctx%3E%3E-for-AggregateValueEnum%3C\'ctx%3E"],[2638,"impl-From%3CArrayValue%3C\'ctx%3E%3E-for-AggregateValueEnum%3C\'ctx%3E"],[2640,"impl-From%3CVectorValue%3C\'ctx%3E%3E-for-AnyValueEnum%3C\'ctx%3E"],[2641,"impl-From%3CBasicValueEnum%3C\'ctx%3E%3E-for-AnyValueEnum%3C\'ctx%3E"],[2643,"impl-From%3CPhiValue%3C\'ctx%3E%3E-for-AnyValueEnum%3C\'ctx%3E"],[2644,"impl-From%3CIntValue%3C\'ctx%3E%3E-for-AnyValueEnum%3C\'ctx%3E"],[2645,"impl-From%3CFunctionValue%3C\'ctx%3E%3E-for-AnyValueEnum%3C\'ctx%3E"],[2646,"impl-From%3CStructValue%3C\'ctx%3E%3E-for-AnyValueEnum%3C\'ctx%3E"],[2647,"impl-From%3CFloatValue%3C\'ctx%3E%3E-for-AnyValueEnum%3C\'ctx%3E"],[2648,"impl-From%3CMetadataValue%3C\'ctx%3E%3E-for-AnyValueEnum%3C\'ctx%3E"],[2649,"impl-From%3CPointerValue%3C\'ctx%3E%3E-for-AnyValueEnum%3C\'ctx%3E"],[2650,"impl-From%3CArrayValue%3C\'ctx%3E%3E-for-AnyValueEnum%3C\'ctx%3E"],[2651,"impl-From%3CInstructionValue%3C\'ctx%3E%3E-for-AnyValueEnum%3C\'ctx%3E"],[2653,"impl-From%3CPointerValue%3C\'ctx%3E%3E-for-BasicValueEnum%3C\'ctx%3E"],[2654,"impl-From%3CIntValue%3C\'ctx%3E%3E-for-BasicValueEnum%3C\'ctx%3E"],[2655,"impl-From%3CFloatValue%3C\'ctx%3E%3E-for-BasicValueEnum%3C\'ctx%3E"],[2656,"impl-From%3CVectorValue%3C\'ctx%3E%3E-for-BasicValueEnum%3C\'ctx%3E"],[2657,"impl-From%3CStructValue%3C\'ctx%3E%3E-for-BasicValueEnum%3C\'ctx%3E"],[2658,"impl-From%3CArrayValue%3C\'ctx%3E%3E-for-BasicValueEnum%3C\'ctx%3E"],[2659,"impl-From%3CBasicValueEnum%3C\'ctx%3E%3E-for-BasicMetadataValueEnum%3C\'ctx%3E"],[2660,"impl-From%3CVectorValue%3C\'ctx%3E%3E-for-BasicMetadataValueEnum%3C\'ctx%3E"],[2662,"impl-From%3CStructValue%3C\'ctx%3E%3E-for-BasicMetadataValueEnum%3C\'ctx%3E"],[2663,"impl-From%3CFloatValue%3C\'ctx%3E%3E-for-BasicMetadataValueEnum%3C\'ctx%3E"],[2664,"impl-From%3CArrayValue%3C\'ctx%3E%3E-for-BasicMetadataValueEnum%3C\'ctx%3E"],[2665,"impl-From%3CMetadataValue%3C\'ctx%3E%3E-for-BasicMetadataValueEnum%3C\'ctx%3E"],[2666,"impl-From%3CIntValue%3C\'ctx%3E%3E-for-BasicMetadataValueEnum%3C\'ctx%3E"],[2667,"impl-From%3CPointerValue%3C\'ctx%3E%3E-for-BasicMetadataValueEnum%3C\'ctx%3E"],[2937,"impl-FloatValue%3C\'ctx%3E"],[2938,"impl-FloatMathValue%3C\'ctx%3E-for-FloatValue%3C\'ctx%3E"],[2942,"impl-IntMathValue%3C\'ctx%3E-for-IntValue%3C\'ctx%3E"],[2943,"impl-IntValue%3C\'ctx%3E"],[2946,"impl-IntMathValue%3C\'ctx%3E-for-PointerValue%3C\'ctx%3E"],[2947,"impl-PointerMathValue%3C\'ctx%3E-for-PointerValue%3C\'ctx%3E"],[2948,"impl-PointerValue%3C\'ctx%3E"],[2950,"impl-FloatMathValue%3C\'ctx%3E-for-VectorValue%3C\'ctx%3E"],[2951,"impl-VectorValue%3C\'ctx%3E"],[2952,"impl-IntMathValue%3C\'ctx%3E-for-VectorValue%3C\'ctx%3E"],[2953,"impl-PointerMathValue%3C\'ctx%3E-for-VectorValue%3C\'ctx%3E"],[3070,"impl-TryFrom%3CBasicMetadataValueEnum%3C\'ctx%3E%3E-for-ArrayValue%3C\'ctx%3E"],[3071,"impl-TryFrom%3CBasicValueEnum%3C\'ctx%3E%3E-for-ArrayValue%3C\'ctx%3E"],[3072,"impl-TryFrom%3CAnyValueEnum%3C\'ctx%3E%3E-for-ArrayValue%3C\'ctx%3E"],[3073,"impl-TryFrom%3CAggregateValueEnum%3C\'ctx%3E%3E-for-ArrayValue%3C\'ctx%3E"],[3078,"impl-TryFrom%3CAnyValueEnum%3C\'ctx%3E%3E-for-BasicValueEnum%3C\'ctx%3E"],[3079,"impl-TryFrom%3CBasicMetadataValueEnum%3C\'ctx%3E%3E-for-BasicValueEnum%3C\'ctx%3E"],[3083,"impl-TryFrom%3CBasicValueEnum%3C\'ctx%3E%3E-for-FloatValue%3C\'ctx%3E"],[3084,"impl-TryFrom%3CInstructionValue%3C\'ctx%3E%3E-for-FloatValue%3C\'ctx%3E"],[3086,"impl-TryFrom%3CAnyValueEnum%3C\'ctx%3E%3E-for-FloatValue%3C\'ctx%3E"],[3087,"impl-TryFrom%3CBasicMetadataValueEnum%3C\'ctx%3E%3E-for-FloatValue%3C\'ctx%3E"],[3098,"impl-TryFrom%3CAnyValueEnum%3C\'ctx%3E%3E-for-IntValue%3C\'ctx%3E"],[3099,"impl-TryFrom%3CBasicMetadataValueEnum%3C\'ctx%3E%3E-for-IntValue%3C\'ctx%3E"],[3100,"impl-TryFrom%3CInstructionValue%3C\'ctx%3E%3E-for-IntValue%3C\'ctx%3E"],[3101,"impl-TryFrom%3CBasicValueEnum%3C\'ctx%3E%3E-for-IntValue%3C\'ctx%3E"],[3103,"impl-TryFrom%3CBasicMetadataValueEnum%3C\'ctx%3E%3E-for-MetadataValue%3C\'ctx%3E"],[3105,"impl-TryFrom%3CAnyValueEnum%3C\'ctx%3E%3E-for-MetadataValue%3C\'ctx%3E"],[3106,"impl-TryFrom%3CInstructionValue%3C\'ctx%3E%3E-for-PhiValue%3C\'ctx%3E"],[3107,"impl-TryFrom%3CAnyValueEnum%3C\'ctx%3E%3E-for-PhiValue%3C\'ctx%3E"],[3110,"impl-TryFrom%3CBasicValueEnum%3C\'ctx%3E%3E-for-PointerValue%3C\'ctx%3E"],[3111,"impl-TryFrom%3CInstructionValue%3C\'ctx%3E%3E-for-PointerValue%3C\'ctx%3E"],[3112,"impl-TryFrom%3CBasicMetadataValueEnum%3C\'ctx%3E%3E-for-PointerValue%3C\'ctx%3E"],[3114,"impl-TryFrom%3CAnyValueEnum%3C\'ctx%3E%3E-for-PointerValue%3C\'ctx%3E"],[3115,"impl-TryFrom%3CAnyValueEnum%3C\'ctx%3E%3E-for-StructValue%3C\'ctx%3E"],[3116,"impl-TryFrom%3CAggregateValueEnum%3C\'ctx%3E%3E-for-StructValue%3C\'ctx%3E"],[3117,"impl-TryFrom%3CBasicMetadataValueEnum%3C\'ctx%3E%3E-for-StructValue%3C\'ctx%3E"],[3118,"impl-TryFrom%3CBasicValueEnum%3C\'ctx%3E%3E-for-StructValue%3C\'ctx%3E"],[3121,"impl-TryFrom%3CBasicMetadataValueEnum%3C\'ctx%3E%3E-for-VectorValue%3C\'ctx%3E"],[3122,"impl-TryFrom%3CBasicValueEnum%3C\'ctx%3E%3E-for-VectorValue%3C\'ctx%3E"],[3124,"impl-TryFrom%3CAnyValueEnum%3C\'ctx%3E%3E-for-VectorValue%3C\'ctx%3E"]]}],\ +["inkwell",{"doc":"Inkwell documentation is a work in progress.","t":"PPPPFPPGGGPPPPPPPPPGPGPPPGGPPPPPPPPPPPPPPPPPPGPPPPPPPPPPPGPPPPPPPPPPPPPPPPCCNNNNNNNNNNNNNNNNNNNNCNNNNNNNNNNNNNNNNNNNNNNNNNNNCCCCNNNNNNNNNNNNNNCNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNCDCCCNNNNNNNCCCNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNCCFGPPPNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNFFNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNPPFGPPPPPPPNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNPFGPPPPNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNKFFNNMNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNFNNNNNNNNNNNTTTTPPPPKTTPPPPPPPPPPPPPPPPPFFFFFFIKKFFFFFFFFFGGFPTTTTPPPPPPPPPPTTTTPPPITTPTTPPPPTTPTTTTPPPPPTTTTTTTTPPTTTTPPTTTTPTTTTTTPTTTTTTTTPMNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNHNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNFGPPPFPPGKNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNFNNNNNNNNNNNNNNNFNNNNNNNNNNNNNNNNNNPPPPPPPPPPGFPFPPPPGPPFPPPPPPNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNFFFFFFFNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNRFFKNNNNNNMNNNNNNNNNNNNNMNNNNNNNNNNNNNNNNNNFGPPNNNNNNNNNNHNNCNNNNNNHNNHHHHHNNNNNNNNNNHHPPGGPPPGFPPPPPPPGPPFFFFFNNNNNNOOONNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNONNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNONNNNNNNNNNNNNNNNNNNNNNNNNNNNNONNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNPKGFPPPKGKGPPFKFPPPFPPKFPPPRRFPPKFPPPRRGFPPPRRRFPPPFPNNNNNNNNNNNNMNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNPPPKGPPKGFPPPPKPPRRRGKGFPPPPFPPPPPPPPPPSPPPPPPPPPFKFPPPPFPFPPFPFPPPGFPKPFPPPPGPPPPPPPPFPPPPFFPPFPKFPPPPPPPPPPPPPPFPPPPPPPPPPGPPPPFPPPPPNNNNNNNNNNNNNNNNNNNNNNNMNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNMMMNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNN","n":["ATT","Acquire","AcquireRelease","Add","AddressSpace","Aggressive","And","AtomicOrdering","AtomicRMWBinOp","DLLStorageClass","Default","Default","Default","EQ","Export","FAdd","FMax","FMin","FSub","FloatPredicate","GeneralDynamicTLSModel","GlobalVisibility","Hidden","Import","InitialExecTLSModel","InlineAsmDialect","IntPredicate","Intel","Less","LocalDynamicTLSModel","LocalExecTLSModel","Max","Min","Monotonic","NE","Nand","None","NotAtomic","OEQ","OGE","OGT","OLE","OLT","ONE","ORD","OptimizationLevel","Or","PredicateFalse","PredicateTrue","Protected","Release","SGE","SGT","SLE","SLT","SequentiallyConsistent","Sub","ThreadLocalMode","UEQ","UGE","UGE","UGT","UGT","ULE","ULE","ULT","ULT","UMax","UMin","UNE","UNO","Unordered","Xchg","Xor","attributes","basic_block","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","builder","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","cmp","cmp","cmp","cmp","cmp","cmp","cmp","comdat","context","data_layout","debug_info","default","default","default","default","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","execution_engine","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","hash","hash","hash","hash","hash","hash","hash","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","intrinsics","llvm_sys","memory_buffer","module","object_file","partial_cmp","partial_cmp","partial_cmp","partial_cmp","partial_cmp","partial_cmp","partial_cmp","passes","support","targets","to_owned","to_owned","to_owned","to_owned","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_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","types","values","Attribute","AttributeLoc","Function","Param","Return","as_mut_ptr","borrow","borrow","borrow_mut","borrow_mut","clone","clone","clone_into","clone_into","eq","eq","fmt","fmt","from","from","get_enum_kind_id","get_enum_value","get_last_enum_kind_id","get_named_enum_kind_id","get_string_kind_id","get_string_value","get_type_value","hash","into","into","is_enum","is_string","is_type","new","to_owned","to_owned","try_from","try_from","try_into","try_into","type_id","type_id","BasicBlock","InstructionIter","as_mut_ptr","borrow","borrow","borrow_mut","borrow_mut","clone","clone_into","delete","eq","fmt","fmt","from","from","get_address","get_context","get_first_instruction","get_first_use","get_instruction_with_name","get_instructions","get_last_instruction","get_name","get_next_basic_block","get_parent","get_previous_basic_block","get_terminator","hash","into","into","into_iter","move_after","move_before","next","remove_from_function","replace_all_uses_with","set_name","to_owned","try_from","try_from","try_into","try_into","type_id","type_id","AlignmentError","BitwidthError","Builder","BuilderError","ExtractOutOfRange","GEPIndex","GEPPointee","OrderingError","PointeeTypeMismatch","UnsetPosition","ValueTypeMismatch","as_mut_ptr","borrow","borrow","borrow_mut","borrow_mut","build_address_space_cast","build_aggregate_return","build_alloca","build_and","build_array_alloca","build_array_malloc","build_atomicrmw","build_bit_cast","build_call","build_cast","build_cmpxchg","build_conditional_branch","build_direct_call","build_direct_invoke","build_extract_element","build_extract_value","build_fence","build_float_add","build_float_cast","build_float_compare","build_float_div","build_float_ext","build_float_mul","build_float_neg","build_float_rem","build_float_sub","build_float_to_signed_int","build_float_to_unsigned_int","build_float_trunc","build_free","build_gep","build_global_string","build_global_string_ptr","build_in_bounds_gep","build_indirect_branch","build_indirect_call","build_indirect_invoke","build_insert_element","build_insert_value","build_int_add","build_int_cast","build_int_cast_sign_flag","build_int_compare","build_int_exact_signed_div","build_int_mul","build_int_neg","build_int_nsw_add","build_int_nsw_mul","build_int_nsw_neg","build_int_nsw_sub","build_int_nuw_add","build_int_nuw_mul","build_int_nuw_neg","build_int_nuw_sub","build_int_s_extend","build_int_s_extend_or_bit_cast","build_int_signed_div","build_int_signed_rem","build_int_sub","build_int_to_ptr","build_int_truncate","build_int_truncate_or_bit_cast","build_int_unsigned_div","build_int_unsigned_rem","build_int_z_extend","build_int_z_extend_or_bit_cast","build_invoke","build_is_not_null","build_is_null","build_landing_pad","build_left_shift","build_load","build_malloc","build_memcpy","build_memmove","build_memset","build_not","build_or","build_phi","build_pointer_cast","build_ptr_diff","build_ptr_to_int","build_resume","build_return","build_right_shift","build_select","build_shuffle_vector","build_signed_int_to_float","build_store","build_struct_gep","build_switch","build_unconditional_branch","build_unreachable","build_unsigned_int_to_float","build_va_arg","build_xor","clear_insertion_position","drop","eq","fmt","fmt","fmt","from","from","get_current_debug_location","get_insert_block","insert_instruction","into","into","new","position_at","position_at_end","position_before","set_current_debug_location","to_string","try_from","try_from","try_into","try_into","type_id","type_id","unset_current_debug_location","Any","Comdat","ComdatSelectionKind","ExactMatch","Largest","NoDuplicates","SameSize","as_mut_ptr","borrow","borrow","borrow_mut","borrow_mut","clone","clone","clone_into","clone_into","cmp","eq","eq","fmt","fmt","from","from","from","get_selection_kind","hash","into","into","into","new","partial_cmp","set_selection_kind","to_owned","to_owned","try_from","try_from","try_into","try_into","type_id","type_id","AsContextRef","Context","ContextRef","append_basic_block","append_basic_block","as_ctx_ref","as_ctx_ref","as_ctx_ref","bool_type","bool_type","borrow","borrow","borrow_mut","borrow_mut","clone","clone_into","const_string","const_string","const_struct","const_struct","create","create_builder","create_builder","create_enum_attribute","create_enum_attribute","create_inline_asm","create_inline_asm","create_module","create_module","create_module_from_ir","create_module_from_ir","create_string_attribute","create_string_attribute","create_type_attribute","create_type_attribute","custom_width_int_type","custom_width_int_type","drop","eq","eq","eq","eq","f128_type","f128_type","f16_type","f16_type","f32_type","f32_type","f64_type","f64_type","fmt","fmt","from","from","get_global","get_kind_id","get_kind_id","get_struct_type","get_struct_type","i128_type","i128_type","i16_type","i16_type","i32_type","i32_type","i64_type","i64_type","i8_type","i8_type","insert_basic_block_after","insert_basic_block_after","into","into","metadata_node","metadata_node","metadata_string","metadata_string","metadata_type","metadata_type","opaque_struct_type","opaque_struct_type","ppc_f128_type","ppc_f128_type","prepend_basic_block","prepend_basic_block","ptr_sized_int_type","ptr_sized_int_type","ptr_type","ptr_type","struct_type","struct_type","to_owned","try_from","try_from","try_into","try_into","type_id","type_id","void_type","void_type","x86_f80_type","x86_f80_type","DataLayout","as_ptr","as_str","borrow","borrow_mut","eq","fmt","from","into","try_from","try_into","type_id","APPLE_BLOCK","APPLE_BLOCK","ARTIFICIAL","ARTIFICIAL","Ada2005","Ada2012","Ada83","Ada95","AsDIScope","BIT_FIELD","BIT_FIELD","BLISS","BORLANDDelphi","C","C11","C17","C89","C99","CPlusPlus","CPlusPlus03","CPlusPlus11","CPlusPlus14","CPlusPlus17","CPlusPlus20","Cobol74","Cobol85","Crystal","D","DIBasicType","DICompileUnit","DICompositeType","DIDerivedType","DIExpression","DIFile","DIFlags","DIFlagsConstants","DIFlagsConstants","DIGlobalVariableExpression","DILexicalBlock","DILocalVariable","DILocation","DINamespace","DIScope","DISubprogram","DISubroutineType","DIType","DWARFEmissionKind","DWARFSourceLanguage","DebugInfoBuilder","Dylan","EXPLICIT","EXPLICIT","FWD_DECL","FWD_DECL","Fortran03","Fortran08","Fortran18","Fortran77","Fortran90","Fortran95","Full","GOOGLERenderScript","Go","Haskell","INDIRECT_VIRTUAL_BASE","INDIRECT_VIRTUAL_BASE","INTRODUCED_VIRTUAL","INTRODUCED_VIRTUAL","Java","Julia","Kotlin","LLVMDWARFTypeEncoding","LVALUE_REFERENCE","LVALUE_REFERENCE","LineTablesOnly","MULTIPLE_INHERITANCE","MULTIPLE_INHERITANCE","MipsAssembler","Modula2","Modula3","Mojo","NO_RETURN","NO_RETURN","None","OBJC_CLASS_COMPLETE","OBJC_CLASS_COMPLETE","OBJECT_POINTER","OBJECT_POINTER","OCaml","ObjC","ObjCPlusPlus","OpenCL","PLI","PRIVATE","PRIVATE","PROTECTED","PROTECTED","PROTOTYPED","PROTOTYPED","PUBLIC","PUBLIC","Pascal83","Python","RESERVED","RESERVED","RVALUE_REFERENCE","RVALUE_REFERENCE","RenderScript","Rust","SINGLE_INHERITANCE","SINGLE_INHERITANCE","STATIC_MEMBER","STATIC_MEMBER","Swift","THUNK","THUNK","TYPE_PASS_BY_REFERENCE","TYPE_PASS_BY_REFERENCE","TYPE_PASS_BY_VALUE","TYPE_PASS_BY_VALUE","UPC","VECTOR","VECTOR","VIRTUAL","VIRTUAL","VIRTUAL_INHERITANCE","VIRTUAL_INHERITANCE","ZERO","ZERO","Zig","as_debug_info_scope","as_debug_info_scope","as_debug_info_scope","as_debug_info_scope","as_debug_info_scope","as_debug_info_scope","as_debug_info_scope","as_debug_info_scope","as_debug_info_scope","as_debug_info_scope","as_metadata_value","as_mut_ptr","as_mut_ptr","as_mut_ptr","as_mut_ptr","as_mut_ptr","as_mut_ptr","as_mut_ptr","as_mut_ptr","as_mut_ptr","as_mut_ptr","as_mut_ptr","as_mut_ptr","as_mut_ptr","as_mut_ptr","as_mut_ptr","as_type","as_type","as_type","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","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","create_array_type","create_auto_variable","create_basic_type","create_constant_expression","create_debug_location","create_expression","create_file","create_function","create_global_variable_expression","create_lexical_block","create_member_type","create_namespace","create_parameter_variable","create_placeholder_derived_type","create_pointer_type","create_reference_type","create_struct_type","create_subroutine_type","create_typedef","create_union_type","debug_metadata_version","drop","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","finalize","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","get_align_in_bits","get_column","get_file","get_line","get_offset_in_bits","get_scope","get_size_in_bits","hash","hash","insert_dbg_value_before","insert_declare_at_end","insert_declare_before_instruction","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","partial_cmp","partial_cmp","replace_placeholder_derived_type","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","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_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","ExecutionEngine","FunctionLookupError","FunctionNotFound","IncorrectModuleOwner","JITNotEnabled","JitFunction","LLVMError","ModuleNotOwned","RemoveModuleError","UnsafeFunctionPointer","add_global_mapping","add_module","as_mut_ptr","as_raw","borrow","borrow","borrow","borrow","borrow_mut","borrow_mut","borrow_mut","borrow_mut","call","call","call","call","call","call","call","call","call","call","call","call","call","call","cause","clone","clone","clone_into","clone_into","description","drop","eq","eq","eq","fmt","fmt","fmt","fmt","fmt","fmt","free_fn_machine_code","from","from","from","from","get_function","get_function_address","get_function_value","get_target_data","into","into","into","into","into_raw","link_in_interpreter","link_in_mc_jit","new","remove_module","run_function","run_function_as_main","run_static_constructors","run_static_destructors","to_owned","to_owned","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","Intrinsic","borrow","borrow_mut","clone","clone_into","eq","find","fmt","from","get_declaration","into","is_overloaded","to_owned","try_from","try_into","type_id","MemoryBuffer","as_mut_ptr","as_slice","borrow","borrow_mut","create_from_file","create_from_memory_range","create_from_memory_range_copy","create_from_stdin","create_object_file","drop","fmt","from","get_size","into","new","try_from","try_into","type_id","Append","AppendUnique","Appending","AvailableExternally","Common","DLLExport","DLLImport","Error","External","ExternalWeak","FlagBehavior","FunctionIterator","Ghost","GlobalIterator","Internal","LinkOnceAny","LinkOnceODR","LinkOnceODRAutoHide","Linkage","LinkerPrivate","LinkerPrivateWeak","Module","Override","Private","Require","Warning","WeakAny","WeakODR","add_basic_value_flag","add_function","add_global","add_global_metadata","add_metadata_flag","as_mut_ptr","borrow","borrow","borrow","borrow","borrow","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","clone","clone","clone","clone_into","clone_into","clone_into","cmp","cmp","create","create_debug_info_builder","create_execution_engine","create_interpreter_execution_engine","create_jit_execution_engine","drop","eq","eq","eq","fmt","fmt","fmt","fmt","fmt","from","from","from","from","from","from","from","get_context","get_data_layout","get_debug_metadata_version","get_first_function","get_first_global","get_flag","get_function","get_functions","get_global","get_global_metadata","get_global_metadata_size","get_globals","get_last_function","get_last_global","get_name","get_or_insert_comdat","get_source_file_name","get_struct_type","get_triple","hash","hash","into","into","into","into","into","into","into","into_iter","into_iter","link_in_module","new","next","next","parse_bitcode_from_buffer","parse_bitcode_from_path","partial_cmp","partial_cmp","print_to_file","print_to_stderr","print_to_string","run_in_pass_manager","run_passes","set_data_layout","set_inline_assembly","set_name","set_source_file_name","set_triple","strip_debug_info","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","verify","write_bitcode_to_file","write_bitcode_to_memory","write_bitcode_to_path","ObjectFile","Relocation","RelocationIterator","Section","SectionIterator","Symbol","SymbolIterator","as_mut_ptr","as_mut_ptr","as_mut_ptr","as_mut_ptr","as_mut_ptr","as_mut_ptr","as_mut_ptr","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","drop","drop","drop","drop","fmt","fmt","fmt","fmt","fmt","fmt","fmt","from","from","from","from","from","from","from","get_address","get_address","get_contents","get_name","get_name","get_offset","get_relocations","get_sections","get_symbols","get_symbols","get_type","get_value","into","into","into","into","into","into","into","into_iter","into_iter","into_iter","new","new","new","new","new","new","new","next","next","next","size","size","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","Input","PassBuilderOptions","PassManager","PassManagerSubType","as_mut_ptr","as_mut_ptr","borrow","borrow","borrow_mut","borrow_mut","create","create","create","drop","drop","finalize","fmt","fmt","from","from","initialize","into","into","new","run_in_pass_manager","run_on","set_call_graph_profile","set_debug_logging","set_forget_all_scev_in_loop_unroll","set_licm_mssa_no_acc_for_promotion_cap","set_licm_mssa_opt_cap","set_loop_interleaving","set_loop_slp_vectorization","set_loop_unrolling","set_loop_vectorization","set_merge_functions","set_verify_each","try_from","try_from","try_into","try_into","type_id","type_id","LLVMString","LoadLibraryError","LoadingError","UnicodeError","borrow","borrow","borrow_mut","borrow_mut","cause","clone","clone_into","deref","description","drop","enable_llvm_pretty_stack_trace","eq","eq","error_handling","fmt","fmt","fmt","fmt","from","from","get_llvm_version","into","into","is_multithreaded","load_library_permanently","load_visible_symbols","search_for_address_of_symbol","shutdown_llvm","to_owned","to_string","to_string","to_string","try_from","try_from","try_into","try_into","type_id","type_id","install_fatal_error_handler","reset_fatal_error_handler","Assembly","BigEndian","ByteOrdering","CodeModel","Default","Default","DynamicNoPic","FileType","InitializationConfig","JITDefault","Kernel","Large","LittleEndian","Medium","Object","PIC","RelocMode","Small","Static","Target","TargetData","TargetMachine","TargetMachineOptions","TargetTriple","add_analysis_passes","as_mut_ptr","as_mut_ptr","as_mut_ptr","as_ptr","as_str","asm_parser","asm_printer","base","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","clone","clone","clone","clone","clone","clone_into","clone_into","clone_into","clone_into","clone_into","create","create","create_target_machine","create_target_machine_from_options","default","default","default","default","disassembler","drop","drop","drop","element_at_offset","eq","eq","eq","eq","eq","eq","eq","eq","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","from","from","from","from","from","from","from","from","from","from","from_name","from_triple","get_abi_alignment","get_abi_size","get_bit_size","get_byte_ordering","get_call_frame_alignment","get_cpu","get_data_layout","get_default_triple","get_description","get_feature_string","get_first","get_host_cpu_features","get_host_cpu_name","get_name","get_next","get_pointer_byte_size","get_preferred_alignment","get_preferred_alignment_of_global","get_store_size","get_target","get_target_data","get_triple","has_asm_backend","has_jit","has_target_machine","info","initialize_aarch64","initialize_all","initialize_amd_gpu","initialize_arm","initialize_bpf","initialize_hexagon","initialize_lanai","initialize_loongarch","initialize_mips","initialize_msp430","initialize_native","initialize_nvptx","initialize_power_pc","initialize_riscv","initialize_sparc","initialize_system_z","initialize_webassembly","initialize_x86","initialize_x_core","into","into","into","into","into","into","into","into","into","into","machine_code","new","new","new","new","new","normalize_triple","offset_of_element","ptr_sized_int_type_in_context","set_abi","set_asm_verbosity","set_code_model","set_cpu","set_features","set_level","set_reloc_mode","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_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","write_to_file","write_to_memory_buffer","Alphanumeric","AnyType","AnyTypeEnum","ArrayType","ArrayType","ArrayType","ArrayType","AsTypeRef","BasicMetadataTypeEnum","BasicType","BasicTypeEnum","Binary","Decimal","FieldTypesIter","FloatMathType","FloatType","FloatType","FloatType","FloatType","FunctionType","FunctionType","Hexadecimal","IntMathType","IntType","IntType","IntType","IntType","MathConvType","MathConvType","MetadataType","MetadataType","Octal","PointerMathType","PointerType","PointerType","PointerType","PointerType","PtrConvType","PtrConvType","StringRadix","StructType","StructType","StructType","StructType","ValueType","ValueType","ValueType","VectorType","VectorType","VectorType","VectorType","VoidType","VoidType","array_type","array_type","array_type","array_type","array_type","array_type","array_type","array_type","as_any_type_enum","as_any_type_enum","as_basic_type_enum","as_basic_type_enum","as_type_ref","as_type_ref","as_type_ref","as_type_ref","as_type_ref","as_type_ref","as_type_ref","as_type_ref","as_type_ref","as_type_ref","as_type_ref","as_type_ref","as_type_ref","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","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","const_all_ones","const_array","const_array","const_array","const_array","const_array","const_array","const_float","const_float_from_string","const_int","const_int_arbitrary_precision","const_int_from_string","const_named_struct","const_null","const_vector","const_zero","const_zero","const_zero","const_zero","const_zero","const_zero","const_zero","count_fields","count_param_types","create_generic_value","create_generic_value","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","fn_type","fn_type","fn_type","fn_type","fn_type","fn_type","fn_type","fn_type","fn_type","fn_type","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","get_address_space","get_alignment","get_alignment","get_alignment","get_alignment","get_alignment","get_alignment","get_bit_width","get_context","get_context","get_context","get_context","get_context","get_context","get_context","get_context","get_context","get_element_type","get_element_type","get_field_type_at_index","get_field_type_at_index_unchecked","get_field_types","get_field_types_iter","get_name","get_param_types","get_poison","get_poison","get_poison","get_poison","get_poison","get_poison","get_return_type","get_size","get_undef","get_undef","get_undef","get_undef","get_undef","get_undef","hash","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into_array_type","into_array_type","into_array_type","into_float_type","into_float_type","into_float_type","into_function_type","into_int_type","into_int_type","into_int_type","into_iter","into_metadata_type","into_pointer_type","into_pointer_type","into_pointer_type","into_struct_type","into_struct_type","into_struct_type","into_vector_type","into_vector_type","into_vector_type","into_void_type","is_array_type","is_array_type","is_array_type","is_empty","is_float_type","is_float_type","is_float_type","is_function_type","is_int_type","is_int_type","is_int_type","is_metadata_type","is_opaque","is_opaque","is_packed","is_pointer_type","is_pointer_type","is_pointer_type","is_sized","is_sized","is_sized","is_sized","is_struct_type","is_struct_type","is_struct_type","is_var_arg","is_vector_type","is_vector_type","is_vector_type","is_void_type","len","matches_str","new","new","new","new","new","new","new","new","new","new","new","next","print_to_string","print_to_string","print_to_string","print_to_string","print_to_string","print_to_string","print_to_string","print_to_string","print_to_string","print_to_string","print_to_string","print_to_string","print_to_string","print_to_string","ptr_type","ptr_type","ptr_type","ptr_type","ptr_type","ptr_type","ptr_type","ptr_type","ptr_type","set_body","size_of","size_of","size_of","size_of","size_of","size_of","size_of","size_of","size_of","to_owned","to_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_string","to_string","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_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_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","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","vec_type","vec_type","vec_type","AShr","Add","AddrSpaceCast","AggregateValue","AggregateValueEnum","Alloca","And","AnyValue","AnyValueEnum","ArrayValue","ArrayValue","ArrayValue","ArrayValue","ArrayValue","AsValueRef","AtomicCmpXchg","AtomicRMW","BaseType","BaseType","BaseType","BasicMetadataValueEnum","BasicValue","BasicValueEnum","BasicValueUse","BitCast","Br","Call","CallBr","CallSiteValue","CatchPad","CatchRet","CatchSwitch","CleanupPad","CleanupRet","ExtractElement","ExtractValue","FAdd","FCmp","FDiv","FIRST_CUSTOM_METADATA_KIND_ID","FMul","FNeg","FPExt","FPToSI","FPToUI","FPTrunc","FRem","FSub","Fence","FieldValueIter","FloatMathValue","FloatValue","FloatValue","FloatValue","FloatValue","Freeze","FunctionValue","FunctionValue","GenericValue","GetElementPtr","Global","GlobalValue","ICmp","IncomingIter","IndirectBr","InsertElement","InsertValue","InstructionOpcode","InstructionValue","InstructionValue","IntMathValue","IntToPtr","IntValue","IntValue","IntValue","IntValue","Invoke","LLVMTailCallKind","LLVMTailCallKindMustTail","LLVMTailCallKindNoTail","LLVMTailCallKindNone","LLVMTailCallKindTail","LShr","LandingPad","Load","Local","MetadataValue","MetadataValue","MetadataValue","Mul","None","OperandIter","OperandUseIter","Or","Phi","PhiValue","PhiValue","PointerMathValue","PointerValue","PointerValue","PointerValue","PointerValue","PtrToInt","Resume","Return","SDiv","SExt","SIToFP","SRem","Select","Shl","ShuffleVector","Store","StructValue","StructValue","StructValue","StructValue","StructValue","Sub","Switch","Trunc","UDiv","UIToFP","URem","UnnamedAddress","Unreachable","UserOp1","UserOp2","VAArg","VectorValue","VectorValue","VectorValue","VectorValue","Xor","ZExt","add_attribute","add_attribute","add_incoming","as_aggregate_value_enum","as_aggregate_value_enum","as_any_value_enum","as_any_value_enum","as_basic_value","as_basic_value_enum","as_basic_value_enum","as_float","as_global_value","as_instruction","as_instruction","as_instruction","as_instruction","as_instruction","as_instruction","as_instruction","as_instruction_value","as_instruction_value","as_int","as_pointer_value","as_value_ref","as_value_ref","as_value_ref","as_value_ref","as_value_ref","as_value_ref","as_value_ref","as_value_ref","as_value_ref","as_value_ref","as_value_ref","as_value_ref","as_value_ref","as_value_ref","as_value_ref","as_value_ref","as_value_ref","attributes","attributes","borrow","borrow","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","can_use_fast_math_flags","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","cmp","const_add","const_address_space_cast","const_bit_cast","const_cast","const_compare","const_extract_element","const_gep","const_in_bounds_gep","const_insert_element","const_int_compare","const_mul","const_neg","const_not","const_nsw_add","const_nsw_mul","const_nsw_neg","const_nsw_sub","const_nuw_add","const_nuw_mul","const_nuw_neg","const_nuw_sub","const_shl","const_shuffle_vector","const_sub","const_to_int","const_to_pointer","const_truncate","const_truncate_or_bit_cast","const_xor","count_arguments","count_attributes","count_attributes","count_basic_blocks","count_fields","count_incoming","count_params","create","create_generic_value_of_pointer","delete","delete","drop","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","eq","erase_from_basic_block","explicit_clone","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","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","get_alignment","get_alignment","get_allocated_type","get_atomic_ordering","get_basic_block_iter","get_basic_blocks","get_call_convention","get_call_conventions","get_called_fn_value","get_comdat","get_constant","get_disjoint_flag","get_dll_storage_class","get_element_as_constant","get_enum_attribute","get_enum_attribute","get_fast_math_flags","get_fcmp_predicate","get_field_at_index","get_field_at_index_unchecked","get_fields","get_first_basic_block","get_first_param","get_first_use","get_first_use","get_first_use","get_gc","get_icmp_predicate","get_incoming","get_incoming_unchecked","get_incomings","get_initializer","get_instruction_with_name","get_intrinsic_id","get_last_basic_block","get_last_param","get_linkage","get_linkage","get_metadata","get_name","get_name","get_name","get_name","get_name","get_name","get_name","get_name","get_name","get_name","get_name","get_name","get_next_function","get_next_global","get_next_instruction","get_next_use","get_node_size","get_node_values","get_non_negative_flag","get_nth_param","get_num_operands","get_opcode","get_operand","get_operand_unchecked","get_operand_use","get_operand_use_unchecked","get_operand_uses","get_operands","get_param_iter","get_params","get_parent","get_personality_function","get_previous_function","get_previous_global","get_previous_instruction","get_section","get_section","get_sign_extended_constant","get_string_attribute","get_string_attribute","get_string_constant","get_string_value","get_subprogram","get_tail_call_kind","get_tail_call_kind","get_thread_local_mode","get_type","get_type","get_type","get_type","get_type","get_type","get_type","get_type","get_type","get_type","get_unnamed_address","get_used_value","get_user","get_value_type","get_visibility","get_volatile","get_zero_extended_constant","has_metadata","has_personality_function","has_unnamed_addr","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","hash","int_width","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into_array_value","into_array_value","into_array_value","into_array_value","into_float_value","into_float_value","into_float_value","into_function_value","into_instruction_value","into_int_value","into_int_value","into_int_value","into_iter","into_iter","into_iter","into_iter","into_metadata_value","into_phi_value","into_pointer","into_pointer_value","into_pointer_value","into_pointer_value","into_struct_value","into_struct_value","into_struct_value","into_struct_value","into_vector_value","into_vector_value","into_vector_value","is_array_value","is_array_value","is_array_value","is_array_value","is_conditional","is_const","is_const","is_const","is_const","is_const","is_const_string","is_constant","is_constant_data_vector","is_constant_int","is_constant_vector","is_declaration","is_externally_initialized","is_float_value","is_float_value","is_float_value","is_function_value","is_instruction_value","is_int_value","is_int_value","is_int_value","is_metadata_value","is_node","is_null","is_null","is_null","is_null","is_null","is_null","is_null","is_null","is_phi_value","is_pointer_value","is_pointer_value","is_pointer_value","is_poison","is_poison","is_string","is_struct_value","is_struct_value","is_struct_value","is_struct_value","is_tail_call","is_tail_call","is_terminator","is_thread_local","is_undef","is_undef","is_undef","is_undef","is_undef","is_undef","is_undef","is_undef","is_vector_value","is_vector_value","is_vector_value","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_const_array","new_raw_const_array","next","next","next","next","partial_cmp","print_to_stderr","print_to_stderr","print_to_stderr","print_to_stderr","print_to_stderr","print_to_stderr","print_to_stderr","print_to_stderr","print_to_string","print_to_string","remove_enum_attribute","remove_enum_attribute","remove_from_basic_block","remove_string_attribute","remove_string_attribute","replace_all_uses_with","replace_all_uses_with","replace_all_uses_with","replace_all_uses_with","replace_all_uses_with","replace_all_uses_with","replace_all_uses_with","replace_all_uses_with","replace_all_uses_with","replace_all_uses_with","run_in_pass_manager","set_alignment","set_alignment","set_alignment_attribute","set_atomic_ordering","set_call_convention","set_call_conventions","set_comdat","set_constant","set_disjoint_flag","set_dll_storage_class","set_externally_initialized","set_fast_math_flags","set_field_at_index","set_gc","set_initializer","set_linkage","set_linkage","set_metadata","set_metadata","set_name","set_name","set_name","set_name","set_name","set_name","set_name","set_name","set_name","set_name","set_name","set_name","set_non_negative_flag","set_operand","set_param_alignment","set_personality_function","set_section","set_section","set_subprogram","set_tail_call","set_tail_call_kind","set_thread_local","set_thread_local_mode","set_unnamed_addr","set_unnamed_address","set_visibility","set_volatile","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_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_string","to_string","to_string","to_string","to_string","to_string","to_string","to_string","to_string","to_string","to_string","to_string","try_as_basic_value","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_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","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","verify","view_function_cfg","view_function_cfg_only"],"q":[[0,"inkwell"],[253,"inkwell::attributes"],[295,"inkwell::basic_block"],[339,"inkwell::builder"],[477,"inkwell::comdat"],[517,"inkwell::context"],[619,"inkwell::data_layout"],[631,"inkwell::debug_info"],[1047,"inkwell::execution_engine"],[1137,"inkwell::intrinsics"],[1153,"inkwell::memory_buffer"],[1172,"inkwell::module"],[1317,"inkwell::object_file"],[1418,"inkwell::passes"],[1461,"inkwell::support"],[1503,"inkwell::support::error_handling"],[1505,"inkwell::targets"],[1721,"inkwell::types"],[2212,"inkwell::values"],[3182,"core::cmp"],[3183,"core::fmt"],[3184,"core::fmt"],[3185,"llvm_sys"],[3186,"core::option"],[3187,"core::result"],[3188,"core::any"],[3189,"llvm_sys::prelude"],[3190,"core::ffi::c_str"],[3191,"llvm_sys::prelude"],[3192,"llvm_sys::prelude"],[3193,"llvm_sys::prelude"],[3194,"libc::unix::linux_like::linux::gnu::b64::x86_64"],[3195,"llvm_sys::prelude"],[3196,"alloc::vec"],[3197,"libc::unix"],[3198,"llvm_sys::debuginfo"],[3199,"llvm_sys::debuginfo"],[3200,"core::marker"],[3201,"core::error"],[3202,"core::clone"],[3203,"alloc::rc"],[3204,"libc::unix"],[3205,"llvm_sys::prelude"],[3206,"llvm_sys"],[3207,"core::convert"],[3208,"std::fs"],[3209,"llvm_sys::object"],[3210,"llvm_sys::object"],[3211,"core::fmt"],[3212,"llvm_sys::target_machine"],[3213,"llvm_sys::prelude"],[3214,"llvm_sys::prelude"]],"d":["","","","Adds to the value in memory and returns the prior value.","Defines the address space in which a global will be …","","Bitwise and into memory and returns the prior value.","","","","","","","Equal","","Adds to the float-typed value in memory and returns the …","Sets memory to the greater of the two float-typed values, …","Sets memory to the lesser of the two float-typed values, …","Subtract a float-typed value off the value in memory and …","Defines how to compare a left and right FloatValue.","","","","","","","This enum defines how to compare a left and right IntValue.","","","","","Sets memory to the signed-greater of the value provided …","Sets memory to the signed-lesser of the value provided and …","","Not Equal","Bitwise nands into memory and returns the prior value.","","","Returns true if left == right and neither are NaN","Returns true if left >= right and neither are NaN","Returns true if left > right and neither are NaN","Returns true if left <= right and neither are NaN","Returns true if left < right and neither are NaN","Returns true if left != right and neither are NaN","Returns true if neither value is NaN","Defines the optimization level used to compile a Module.","Bitwise ors into memory and returns the prior value.","Always returns false","Always returns true","","","Signed Greater Than or Equal","Signed Greater Than","Signed Less Than or Equal","Signed Less Than","","Subtract a value off the value in memory and returns the …","","Returns true if left == right or either is NaN","Unsigned Greater Than or Equal","Returns true if left >= right or either is NaN","Unsigned Greater Than","Returns true if left > right or either is NaN","Unsigned Less Than or Equal","Returns true if left <= right or either is NaN","Unsigned Less Than","Returns true if left < right or either is NaN","Sets memory to the unsigned-greater of the value provided …","Sets memory to the unsigned-lesser of the value provided …","Returns true if left != right or either is NaN","Returns true if either value is NaN","","Stores to memory and returns the prior value.","Bitwise xors into memory and returns the prior value.","Attributes are optional modifiers to functions, function …","A BasicBlock is a container of instructions.","","","","","","","","","","","","","","","","","","","","","A Builder enables you to build instructions.","","","","","","","","","","","","","","","","","","","","","","","","","","","","A Comdat helps resolve linker errors for duplicate …","A Context is an opaque owner and manager of core global …","","Debug symbols - DebugInfoBuilder interface","","Returns the default value for OptimizationLevel, namely …","Returns the default value for GlobalVisibility, namely …","Returns the default value for DLLStorageClass, namely …","","","","","","","","","","","","","","","","","","","","","","Returns the argument unchanged.","","","Returns the argument unchanged.","","Returns the argument unchanged.","Returns the argument unchanged.","","","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).","","","","A Module represents a single code compilation unit.","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","A type is a classification which determines how data is …","A value is an instance of a type.","Functions, function parameters, and return types can have …","An AttributeLoc determines where on a function an …","Assign to the FunctionValue itself.","Assign to one of the FunctionValue’s params (0-indexed).","Assign to the FunctionValue’s return type.","Acquires the underlying raw pointer belonging to this …","","","","","","","","","","","","","Returns the argument unchanged.","Returns the argument unchanged.","Gets the kind id associated with an enum Attribute.","Gets the value associated with an enum Attribute.","Gets the last enum kind id associated with builtin names.","Gets the enum kind id associated with a builtin name.","Gets the string kind id associated with a string attribute.","Gets the string value associated with a string attribute.","Gets the type associated with a type attribute.","","Calls U::from(self).","Calls U::from(self).","Determines whether or not an Attribute is an enum. This …","Determines whether or not an Attribute is a string. This …","Determines whether or not an Attribute is a type …","Creates a new Attribute from a raw pointer.","","","","","","","","","A BasicBlock is a container of instructions.","Iterate over all InstructionValues in a basic block.","Acquires the underlying raw pointer belonging to this …","","","","","","","Removes this BasicBlock completely from memory. This is …","","","","Returns the argument unchanged.","Returns the argument unchanged.","Gets the address of this BasicBlock if possible. Returns …","Obtains the ContextRef this BasicBlock belongs to.","Obtains the first InstructionValue in this BasicBlock, if …","Gets the first use of this BasicBlock if any.","Performs a linear lookup to obtain a instruction based on …","Get an instruction iterator","Obtains the last InstructionValue in this BasicBlock, if …","Gets the name of a BasicBlock.","Gets the BasicBlock succeeding the current one, in its own …","Obtains the FunctionValue that this BasicBlock belongs to, …","Gets the BasicBlock preceding the current one, in its own …","Obtains the terminating InstructionValue in this BasicBlock…","","Calls U::from(self).","Calls U::from(self).","","Appends one BasicBlock after another. It returns Err(()) …","Prepends one BasicBlock before another. It returns Err(()) …","","Removes this BasicBlock from its parent FunctionValue. It …","Replaces all uses of this basic block with another.","Set name of the BasicBlock.","","","","","","","","","","All build_* methods return a Result<_, BuilderError> type …","Errors that can be generated by the Builder. All build_* …","","","","","","","","Acquires the underlying raw pointer belonging to this …","","","","","","Builds a function return instruction for a return type …","","","","Returns Err(BuilderError::AlignmentError) if the type is …","Builds an atomicrmw instruction. It allows you to …","Builds a bitcast instruction. A bitcast reinterprets the …","Builds a function call instruction. Alias for …","","Builds a cmpxchg instruction. It allows you to atomically …","","Builds a function call instruction. The function being …","","Builds an extract element instruction which extracts a …","Builds an extract value instruction which extracts a …","","","","","","","","","","","","","","","GEP is very likely to segfault if indexes are used …","","","GEP is very likely to segfault if indexes are used …","","Call a function pointer. Because a pointer does not carry …","","Builds an insert element instruction which inserts a …","Builds an insert value instruction which inserts a …","","","Like build_int_cast, but respects the signedness of the …","","","","","","","","","","","","","","","","","","","","","","","","","An invoke is similar to a normal function call, but used to","","","Landing pads are places where control flow jumps to if a …","Builds an IntValue containing the result of a logical left …","Builds a load2 instruction. It allows you to retrieve a …","Returns Err(BuilderError::AlignmentError) if the type is …","Build a memcpy instruction.","Build a memmove instruction.","Build a memset instruction.","","","","","Builds an instruction which calculates the difference of …","","Resume propagation of an existing (in-flight) exception …","Builds a function return instruction. It should be …","Builds an IntValue containing the result of a right shift …","","","","Builds a store instruction. It allows you to store a value …","Builds a GEP instruction on a struct pointer. Returns Err …","","","","","","","","","","","","","Returns the argument unchanged.","Returns the argument unchanged.","Get the debug info source location of the instruction …","","","Calls U::from(self).","Calls U::from(self).","","Set the position of the builder to after an instruction.","Set the position of the builder to the end of a basic …","Set the position of the builder to before an instruction.","Set the debug info source location of the instruction …","","","","","","","","Unset the debug info source location of the instruction …","The linker may choose any COMDAT.","A Comdat determines how to resolve duplicate sections when …","Determines how linker conflicts are to be resolved.","The data referenced by the COMDAT must be the same.","The linker will choose the largest COMDAT.","No other Module may specify this COMDAT.","The data referenced by the COMDAT must be the same size.","Acquires the underlying raw pointer belonging to this …","","","","","","","","","","","","","","","Returns the argument unchanged.","Returns the argument unchanged.","Gets what kind of Comdat this is.","","Calls U::from(self).","","Calls U::from(self).","Creates a new Comdat type from a raw pointer.","","Sets what kind of Comdat this should be.","","","","","","","","","This trait abstracts an LLVM Context type and should be …","A Context is a container for all LLVM entities including …","A ContextRef is a smart pointer allowing borrowed access …","Append a named BasicBlock at the end of the referenced …","Append a named BasicBlock at the end of the referenced …","Returns the internal LLVM reference behind the type","Acquires the underlying raw pointer belonging to this …","Acquires the underlying raw pointer belonging to this …","Gets the IntType representing 1 bit width. It will be …","Gets the IntType representing 1 bit width. It will be …","","","","","","","Creates a const string which may be null terminated.","Creates a const string which may be null terminated.","Creates a constant StructValue from constant values.","Creates a constant StructValue from constant values.","Creates a new Context.","Creates a new Builder for a Context.","Creates a new Builder for a Context.","Creates an enum Attribute in this Context.","Creates an enum Attribute in this Context.","Creates a inline asm function pointer.","Creates a inline asm function pointer.","Creates a new Module for a Context.","Creates a new Module for a Context.","Creates a new Module for the current Context from a …","Creates a new Module for the current Context from a …","Creates a string Attribute in this Context.","Creates a string Attribute in this Context.","Create an enum Attribute with an AnyTypeEnum attached to …","Create an enum Attribute with an AnyTypeEnum attached to …","Gets the IntType representing a custom bit width. It will …","Gets the IntType representing a custom bit width. It will …","","","","","","Gets the FloatType representing a 128 bit width. It will …","Gets the FloatType representing a 128 bit width. It will …","Gets the FloatType representing a 16 bit width. It will be …","Gets the FloatType representing a 16 bit width. It will be …","Gets the FloatType representing a 32 bit width. It will be …","Gets the FloatType representing a 32 bit width. It will be …","Gets the FloatType representing a 64 bit width. It will be …","Gets the FloatType representing a 64 bit width. It will be …","","","Returns the argument unchanged.","Returns the argument unchanged.","Gets a Mutex<Context> which points to the global context …","Obtains the index of a metadata kind id. If the string …","Obtains the index of a metadata kind id. If the string …","Gets a named StructType from this Context.","Gets a named StructType from this Context.","Gets the IntType representing 128 bit width. It will be …","Gets the IntType representing 128 bit width. It will be …","Gets the IntType representing 16 bit width. It will be …","Gets the IntType representing 16 bit width. It will be …","Gets the IntType representing 32 bit width. It will be …","Gets the IntType representing 32 bit width. It will be …","Gets the IntType representing 64 bit width. It will be …","Gets the IntType representing 64 bit width. It will be …","Gets the IntType representing 8 bit width. It will be …","Gets the IntType representing 8 bit width. It will be …","Append a named BasicBlock after the referenced BasicBlock.","Append a named BasicBlock after the referenced BasicBlock.","Calls U::from(self).","Calls U::from(self).","Creates a MetadataValue tuple of heterogeneous types (a “…","Creates a MetadataValue tuple of heterogeneous types (a “…","Creates a MetadataValue string for the current context. It …","Creates a MetadataValue string for the current context. It …","Gets the MetadataType representing 128 bit width. It will …","Gets the MetadataType representing 128 bit width. It will …","Creates an opaque StructType with no type definition yet …","Creates an opaque StructType with no type definition yet …","Gets the FloatType representing a 128 bit width. It will …","Gets the FloatType representing a 128 bit width. It will …","Prepend a named BasicBlock before the referenced BasicBlock…","Prepend a named BasicBlock before the referenced BasicBlock…","Gets the IntType representing a bit width of a pointer. It …","Gets the IntType representing a bit width of a pointer. It …","Gets the PointerType. It will be assigned the current …","Gets the PointerType. It will be assigned the current …","Creates a StructType definition from heterogeneous types …","Creates a StructType definition from heterogeneous types …","","","","","","","","Gets the VoidType. It will be assigned the current context.","Gets the VoidType. It will be assigned the current context.","Gets the FloatType representing a 80 bit width. It will be …","Gets the FloatType representing a 80 bit width. It will be …","","","","","","","","Returns the argument unchanged.","Calls U::from(self).","","","","","","","","","","","","Specific scopes (i.e. DILexicalBlock) can be turned into a …","","","","","","","","","","","","","","","","","","","","A primitive debug info type created by create_basic_type …","Compilation unit scope for debug info","A wrapper around an array of types, such as a union or …","A wrapper around a single type, such as a typedef or …","https://llvm.org/docs/LangRef.html#diexpression","Source file scope for debug info","","","","","Lexical block scope for debug info","Metadata representing a variable inside a scope","A debug location within the source code. Contains the …","Namespace scope for debug info","Any kind of debug information scope (i.e. visibility of a …","Function body scope for debug info","Metadata representing the type of a function","Any kind of debug info type","The amount of debug information to emit. Corresponds to …","Source languages known by DWARF. Corresponds to …","A builder object to create debug info metadata. Used along …","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","Acquires the underlying raw pointer belonging to this …","Acquires the underlying raw pointer belonging to this …","Acquires the underlying raw pointer belonging to this …","Acquires the underlying raw pointer belonging to this …","Acquires the underlying raw pointer belonging to this …","Acquires the underlying raw pointer belonging to this …","Acquires the underlying raw pointer belonging to this …","","Acquires the underlying raw pointer belonging to this …","Acquires the underlying raw pointer belonging to this …","Acquires the underlying raw pointer belonging to this …","Acquires the underlying raw pointer belonging to this …","Acquires the underlying raw pointer belonging to this …","Acquires the underlying raw pointer belonging to this …","Acquires the underlying raw pointer belonging to this …","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","Creates an array type","Create local automatic storage variable.","Create a primitive basic type. encoding is an unsigned int …","","Create a debug location.","Create an expression","Create a file scope.","A DIFunction provides an anchor for all debugging …","","Create a lexical block scope.","Create a type for a non-static member.","","Create function parameter variable.","Construct a placeholders derived type to be used when …","Creates a pointer type","Creates a pointer type","Create a struct type.","Create a function type","Create a typedef (alias) of ditype","Create union type of multiple types.","Gets the version of debug metadata produced by the current …","","","","","","","","","","","","","","","","","","","","Construct any deferred debug info descriptors. May …","","","","","","","","","","","","","","","","","","","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","","Returns the argument unchanged.","Returns the argument unchanged.","","","","","","","","","","","Insert a new llvm.dbg.value intrinsic call before an …","Insert a variable declaration (llvm.dbg.declare intrinsic) …","Insert a variable declaration (llvm.dbg.declare) before a …","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","","Calls U::from(self).","","Calls U::from(self).","","","Deletes a placeholder, replacing all uses of it with …","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","A reference-counted wrapper around LLVM’s execution …","","","","","A wrapper around a function pointer which ensures the …","","","","Marker trait representing an unsafe function pointer (…","Maps the specified value to an address.","Adds a module to an ExecutionEngine.","Acquires the underlying raw pointer belonging to this …","Returns the raw function pointer. This function is unsafe …","","","","","","","","","This method allows you to call the underlying function …","This method allows you to call the underlying function …","This method allows you to call the underlying function …","This method allows you to call the underlying function …","This method allows you to call the underlying function …","This method allows you to call the underlying function …","This method allows you to call the underlying function …","This method allows you to call the underlying function …","This method allows you to call the underlying function …","This method allows you to call the underlying function …","This method allows you to call the underlying function …","This method allows you to call the underlying function …","This method allows you to call the underlying function …","This method allows you to call the underlying function …","","","","","","","","","","","","","","","","","","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Try to load a function from the execution engine.","Attempts to look up a function’s address by its name. …","","","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Returns the raw function pointer, consuming self in the …","This function probably doesn’t need to be called, but is …","This function probably doesn’t need to be called, but is …","","","","","","","","","","","","","","","","","","","","","","","","","","","","","Find llvm intrinsic id from name","","Returns the argument unchanged.","Create or insert the declaration of an intrinsic.","Calls U::from(self).","Check if specified intrinsic is overloaded","","","","","","","Gets a byte slice of this MemoryBuffer.","","","","This function is likely slightly cheaper than …","This will create a new MemoryBuffer from the given input.","","Convert this MemoryBuffer into an ObjectFile. LLVM does …","","","Returns the argument unchanged.","Gets the byte size of this MemoryBuffer.","Calls U::from(self).","","","","","Appends the two values, which are required to be metadata …","Appends the two values, which are required to be metadata …","Appending linkage may only be applied to global variables …","Globals with AvailableExternally linkage are never emitted …","Common linkage is most similar to “weak” linkage, but …","DLLExport causes the compiler to provide a global pointer …","DLLImport causes the compiler to reference a function or …","Emits an error if two values disagree, otherwise the …","If none of the other identifiers are used, the global is …","The semantics of this linkage follow the ELF object file …","Defines the operational behavior for a module wide flag. …","Iterate over all FunctionValues in an llvm module","FIXME: Unknown linkage type","Iterate over all GlobalValues in an llvm module","Similar to private, but the value shows as a local symbol …","Globals with LinkOnceAny linkage are merged with other …","Some languages allow differing globals to be merged, such …","FIXME: Unknown linkage type","This enum defines how to link a global variable or …","FIXME: Unknown linkage type","FIXME: Unknown linkage type","Represents a reference to an LLVM Module. The underlying …","Uses the specified value, regardless of the behavior or …","Global values with Private linkage are only directly …","Adds a requirement that another module flag be present and …","Emits a warning if two values disagree. The result value …","WeakAny linkage has the same merging semantics as linkonce …","Some languages allow differing globals to be merged, such …","Append a BasicValue as a module wide flag. Note that using …","Creates a function given its name and ty, adds it to the …","Creates a GlobalValue based on a type in an address space.","Appends a MetaDataValue to a global list indexed by a …","Append a MetadataValue as a module wide flag. Note that …","Acquires the underlying raw pointer belonging to this …","","","","","","","","","","","","","","","","","","","","Creates a DebugInfoBuilder for this Module.","Creates an ExecutionEngine from this Module.","Creates an interpreter ExecutionEngine from this Module.","Creates a JIT ExecutionEngine from this Module.","","","","","","","","","","Returns the argument unchanged.","","Returns the argument unchanged.","Returns the argument unchanged.","","Returns the argument unchanged.","Returns the argument unchanged.","Gets the Context from which this Module originates.","Gets a smart pointer to the DataLayout belonging to a …","Gets the version of debug metadata contained in this Module…","Gets the first FunctionValue defined in this Module.","Gets the first GlobalValue in a module.","Gets the MetadataValue flag associated with the key in …","Gets a FunctionValue defined in this Module by its name.","An iterator over the functions in this Module.","Gets a named GlobalValue in a module.","Obtains the global MetaDataValue node indexed by key, …","Obtains the number of MetaDataValues indexed by a …","An iterator over the globals in this Module.","Gets the last FunctionValue defined in this Module.","Gets the last GlobalValue in a module.","Gets the name of this Module.","Gets the Comdat associated with a particular name. If it …","Gets the source file name. It defaults to the module …","Gets a named StructType from this Module’s Context.","Gets the TargetTriple assigned to this Module. If none has …","","","Calls U::from(self).","","Calls U::from(self).","Calls U::from(self).","","Calls U::from(self).","Calls U::from(self).","","","Links one module into another. This will merge two Modules …","Get a module from an LLVMModuleRef.","","","Creates a new Module from a MemoryBuffer with bitcode.","A convenience function for creating a Module from a …","","","Prints the content of the Module to a file.","Prints the content of the Module to stderr.","Prints the content of the Module to an LLVMString.","","Construct and run a set of passes over a module. This …","Sets the DataLayout for a particular Module.","Sets the inline assembly for the Module.","Assigns the name of this Module.","Sets the source file name. It defaults to the module …","Assigns a TargetTriple to this Module.","Strips and debug info from the module, if it exists.","","","","Prints the content of the Module to a String.","","","","","","","","","","","","","","","","Ensures that the current Module is valid, and returns a …","write_bitcode_to_path should be preferred over this …","Writes this Module to a MemoryBuffer.","Writes a Module to a Path.","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","Returns the argument unchanged.","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).","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","A manager for running optimization and simplification …","","Acquires the underlying raw pointer belonging to this …","Acquires the underlying raw pointer belonging to this …","","","","","","","Create a new set of options for a PassBuilder","","","","","","Returns the argument unchanged.","Returns the argument unchanged.","","Calls U::from(self).","Calls U::from(self).","","","This method returns true if any of the passes modified the …","","Toggle debug logging when running the PassBuilder.","","","","","","","","","Toggle adding the VerifierPass for the PassBuilder, …","","","","","","","An owned LLVM String. Also known as a LLVM Message","Possible errors that can occur when loading a library","The given path could not be loaded as a library","The given path could not be converted to a &str","","","","","","","","","","","","","","This module contains some supplemental functions for …","","","","","Returns the argument unchanged.","Returns the argument unchanged.","Returns the major, minor, and patch version of the LLVM in …","Calls U::from(self).","Calls U::from(self).","Determines whether or not LLVM has been configured to run …","Permanently load the dynamic library at the given path.","Permanently loads all the symbols visible inside the …","Search through all previously loaded dynamic libraries for …","This function is very unsafe. Any reference to LLVM data …","","This is a convenience method for creating a Rust String, …","","","","","","","","","Installs an error handler to be called before LLVM exits.","Resets LLVM’s fatal error handler back to the default","","","","","","","","","","","","","","","","","","","","","","","LLVM target machine options provide another way to create …","","","Acquires the underlying raw pointer belonging to this …","Acquires the underlying raw pointer belonging to this …","Acquires the underlying raw pointer belonging to this …","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","Create a target machine from given TargetMachineOptions.","","","","","","","","","","","","","","","","","","","","","","","","","","","","","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","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 the default triple for the current system.","","","","Gets a comma separated list of supported features by the …","Gets a string containing the host CPU’s name (triple).","","","","","","","","Create TargetData from this target machine","","","","","","","","","","","","","","","","","","","","","","","","","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","","","","","","","","","Gets the IntType representing a bit width of a pointer. It …","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","Saves a TargetMachine to a file.","Writes a TargetMachine to a MemoryBuffer.","Alphanumeric, 0-9 and all 26 letters in upper or lowercase.","Represents any LLVM type.","A wrapper for any BasicType, VoidType, or FunctionType.","An ArrayType is the type of contiguous constants or …","A contiguous homogeneous container type.","A contiguous homogeneous container type.","","Accessor to the inner LLVM type reference","","Represents a basic LLVM type, that may be used in …","A wrapper for any BasicType.","Binary 0 or 1","Decimal 0-9","Iterate over all BasicTypeEnums in a struct.","Represents an LLVM type that can have floating point math …","A FloatType is the type of a floating point constant or …","A floating point type.","A floating point type.","","A FunctionType is the type of a function variable.","A function return and parameter definition.","Hexadecimal with upper or lowercase letters up to F.","Represents an LLVM type that can have integer math …","An IntType is the type of an integer constant or variable.","An integer type.","An integer type.","","The type for int to float or int vector to float vector …","The type for float to int or float vector to int vector …","A MetadataType is the type of a metadata.","","Octal 0-7","Represents an LLVM type that can have pointer operations …","A PointerType is the type of a pointer constant or …","A pointer type.","A pointer type.","","The type for int to pointer or int vector to pointer …","The type for pointer to int or pointer vector to int …","How to interpret a string or digits used to construct an …","A StructType is the type of a heterogeneous container of …","A contiguous heterogeneous container type.","A contiguous heterogeneous container type.","","The value instance of an int or int vector type.","The value instance of a float or float vector type.","The value instance of a pointer type.","A VectorType is the type of a multiple value SIMD constant …","A contiguous homogeneous “SIMD” container type.","A contiguous homogeneous “SIMD” container type.","","A VoidType is a special type with no possible direct …","A valueless type.","Create an ArrayType with this BasicType as its elements.","Create an ArrayType with this BasicType as its elements.","Creates an ArrayType with this ArrayType for its element …","Creates an ArrayType with this FloatType for its element …","Creates an ArrayType with this IntType for its element …","Creates an ArrayType with this PointerType for its element …","Creates an ArrayType with this StructType for its element …","Creates an ArrayType with this VectorType for its element …","Returns an AnyTypeEnum that represents the current type.","Returns an AnyTypeEnum that represents the current type.","Returns a BasicTypeEnum that represents the current type.","Returns a BasicTypeEnum that represents the current type.","Returns the internal LLVM reference behind the type","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","Creates an IntValue representing a constant value of all …","Creates a constant ArrayValue of ArrayValues.","Creates a constant ArrayValue.","Creates a constant ArrayValue.","Creates a constant ArrayValue.","Creates a constant ArrayValue.","Creates a constant ArrayValue.","Creates a FloatValue representing a constant value of this …","Create a FloatValue from a string. LLVM provides no error …","Creates an IntValue representing a constant value of this …","Create a constant IntValue of arbitrary precision.","Create an IntValue from a string and radix. LLVM provides …","Creates a StructValue based on this StructType’s …","Creates a null PointerValue of this PointerType. It will …","Creates a constant VectorValue.","Creates a constant zero value of this ArrayType.","Creates a constant BasicValueZero.","Creates a constant zero value of this FloatType.","Creates a constant zero value of this IntType.","Creates a constant null value of this PointerType. This is …","Creates a constant zero value of this StructType.","Creates a constant zero value of this VectorType.","Counts the number of field types.","Counts the number of param types this FunctionType has.","Creates a GenericValue for use with ExecutionEngines.","Creates a GenericValue for use with ExecutionEngines.","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","Create a FunctionType with this BasicType as its return …","Create a FunctionType with this BasicType as its return …","Creates a FunctionType with this ArrayType for its return …","Creates a FunctionType with this FloatType for its return …","Creates a FunctionType with this IntType for its return …","Creates a FunctionType with this MetadataType for its …","Creates a FunctionType with this PointerType for its …","Creates a FunctionType with this StructType for its return …","Creates a FunctionType with this VectorType for its return …","Creates a FunctionType with this VoidType for its return …","Returns the argument unchanged.","","","","Returns the argument unchanged.","","","","","","","","","Returns the argument unchanged.","","","","","","","","","","","","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","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 the AddressSpace a PointerType was created with.","Gets the alignment of this ArrayType. Value may vary …","Gets the alignment of this FloatType. Value may vary …","Gets the alignment of this IntType. Value may vary …","Gets the alignment of this PointerType. Value may vary …","Gets the alignment of this StructType. Value may vary …","Gets the alignment of this VectorType. Value may vary …","Gets the bit width of an IntType.","Gets a reference to the Context this ArrayType was created …","Gets a reference to the Context this FloatType was created …","Gets a reference to the Context this FunctionType was …","Gets a reference to the Context this IntType was created …","Gets a reference to the Context this MetadataType was …","Gets a reference to the Context this PointerType was …","Gets a reference to the Context this StructType was …","Gets a reference to the Context this VectorType was …","Gets a reference to the Context this VoidType was created …","Gets the element type of this ArrayType.","Gets the element type of this VectorType.","Gets the type of a field belonging to this StructType.","Gets the type of a field belonging to this StructType.","Gets this StructType’s field types.","Get a struct field iterator.","Gets this StructType’s name.","Gets param types this FunctionType has.","Creates a poison instance of a ArrayType.","Creates a poison instance of a FloatType.","Creates a poison instance of an IntType.","Creates a poison instance of a PointerType.","Creates a poison instance of a StructType.","Creates a poison instance of a VectorType.","Gets the return type of this FunctionType.","Gets the size of this VectorType.","Creates an undefined instance of a ArrayType.","Creates an undefined instance of a FloatType.","Creates an undefined instance of an IntType.","Creates an undefined instance of a PointerType.","Creates an undefined instance of a StructType.","Creates an undefined instance of a VectorType.","","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","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 ArrayType contains no elements.","","","","","","","","","Determine whether this pointer is opaque.","Determines whether or not a StructType is opaque.","Determines whether or not a StructType is packed.","","","","Determines whether or not this BasicType is sized or not. …","Determines whether or not this BasicType is sized or not. …","Gets whether or not this FunctionType is sized or not. …","Gets whether or not this VoidType is sized or not. This …","","","","Determines whether or not a FunctionType is a variadic …","","","","","Gets the length of this ArrayType.","Is the string valid for the given radix?","Create ArrayType from LLVMTypeRef","Create AnyTypeEnum from LLVMTypeRef","Create BasicTypeEnum from LLVMTypeRef","Create FloatType from LLVMTypeRef","Create FunctionType from LLVMTypeRef","Create IntType from LLVMTypeRef","Create MetadataType from LLVMTypeRef","Create PointerType from LLVMTypeRef","Create StructType from LLVMTypeRef","Create VectorType from LLVMTypeRef","Create VoidType from LLVMTypeRef","","Prints the definition of a Type to a LLVMString.","Prints the definition of a Type to a LLVMString.","Print the definition of an ArrayType to LLVMString","Print the definition of a AnyTypeEnum to LLVMString.","Print the definition of a BasicTypeEnum to LLVMString.","Print the definition of a BasicMetadataTypeEnum to …","Print the definition of a FloatType to LLVMString.","Print the definition of a FunctionType to LLVMString.","Print the definition of an IntType to LLVMString.","Print the definition of a MetadataType to LLVMString.","Print the definition of a PointerType to LLVMString.","Print the definition of a StructType to LLVMString.","Print the definition of a VectorType to LLVMString.","Print the definition of a VoidType to LLVMString.","Create a PointerType that points to this BasicType.","Create a PointerType that points to this BasicType.","Creates a PointerType with this ArrayType for its element …","Creates a PointerType with this FloatType for its element …","Creates a PointerType with this FunctionType for its …","Creates a PointerType with this IntType for its element …","Creates a PointerType with this PointerType for its …","Creates a PointerType with this StructType for its element …","Creates a PointerType with this VectorType for its element …","Defines the body of a StructType.","Gets the size of this BasicType. Value may vary depending …","Gets the size of this BasicType. Value may vary depending …","Gets the size of this ArrayType. Value may vary depending …","","Gets the size of this FloatType. Value may vary depending …","Gets the size of this IntType. Value may vary depending on …","Gets the size of this PointerType. Value may vary …","Gets the size of this StructType. Value may vary depending …","Gets the size of this VectorType. Value may vary depending …","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","Creates a VectorType with this FloatType for its element …","Creates a VectorType with this IntType for its element …","Creates a VectorType with this PointerType for its element …","","","","Represents an aggregate value, built on top of other …","","","","Defines any struct wrapping an LLVM value.","","An ArrayValue is a block of contiguous constants or …","","","","","","","","","","","","Represents a basic value, which can be used both by …","","A usage of a BasicValue in another value.","","","","","A value resulting from a function call. It may have …","","","","","","","","","","","Value returned by Context::get_kind_id() for the first …","","","","","","","","","","Iterate over all the field values of this struct.","Represents a value which is permitted in floating point …","","","","","","","","","","Address of the GlobalValue is globally insignificant.","","","Iterate over all the incoming edges of a phi value.","","","","","","","Represents a value which is permitted in integer math …","","","","","","","Tail call kind for LLVMSetTailCallKind and …","","","","","","","","Address of the GlobalValue is locally insignificant.","","","","","Address of the GlobalValue is significant.","Iterate over all the operands of an instruction value.","Iterate over all the operands of an instruction value.","","","A Phi Instruction returns a value based on which basic …","","","","","","","","","","","","","","","","","","","","","","","","","","","","","This enum determines the significance of a GlobalValue’s …","","","","","","","","","","","Adds an Attribute to this CallSiteValue.","Adds an Attribute to a particular location in this …","","Returns an enum containing a typed version of the …","Returns an enum containing a typed version of the …","Returns an enum containing a typed version of AnyValue.","Returns an enum containing a typed version of AnyValue.","","Returns an enum containing a typed version of the …","Returns an enum containing a typed version of the …","","Gets the GlobalValue version of this FunctionValue. This …","Attempt to convert this ArrayValue to an InstructionValue, …","","","","","","","Most BasicValues are the byproduct of an instruction and …","Most BasicValues are the byproduct of an instruction and …","","","","","","","","","","","","","","","","","","","","Get all Attributes on this CallSiteValue at an index.","Get all Attributes belonging to the specified location in …","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","Check whether this instructions supports fast math flags.","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","GEP is very likely to segfault if indexes are used …","GEP is very likely to segfault if indexes are used …","","","","","","","","","","","","","","","","","","","","","","Counts the number of arguments this CallSiteValue was …","Counts the number of Attributes on this CallSiteValue at …","Counts the number of Attributes belonging to the specified …","","Counts the number of fields.","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","Creates a clone of this InstructionValue, and returns it. …","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","","Returns the argument unchanged.","","","","","","","","","Returns the argument unchanged.","","","","","","","","","Returns the argument unchanged.","","","","","","","","Returns the argument unchanged.","","","","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","","Returns the argument unchanged.","","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","","Returns alignment on a memory access instruction or alloca.","Returns the type that is allocated by the alloca …","Returns atomic ordering on a memory access instruction.","","","Gets the calling convention for this CallSiteValue.","","Gets the FunctionValue this CallSiteValue is based on.","Gets a Comdat assigned to this GlobalValue, if any.","Obtains a constant FloatValue’s value and whether or not …","Checks if an or instruction has the disjoint flag set.","","","Gets an enum Attribute on this CallSiteValue at an index …","Gets an enum Attribute belonging to the specified location …","Get fast math flags of supported instructions.","Gets the predicate of an FCmp InstructionValue. For …","Gets the value of a field belonging to this StructValue.","Gets the value of a field belonging to this StructValue.","Get a field value iterator.","","","","","Gets the first use of an InstructionValue if any.","","Gets the predicate of an ICmp InstructionValue. For …","","Safety","Get an incoming edge iterator.","","Get a instruction with it’s name Compares against all …","","","","","","Gets the MetadataValue associated with this Instruction at …","Get name of the ArrayValue. If the value is a constant, …","Get the name of the BasicValueEnum.","Gets name of the FloatValue. If the value is a constant, …","Gets the name of a FunctionValue.","Get name of the GlobalValue.","Get name of the InstructionValue.","Gets the name of an IntValue. If the value is a constant, …","Get name of the MetadataValue.","Gets the name of a ArrayValue. If the value is a constant, …","Get name of the PointerValue. If the value is a constant, …","Gets the name of a StructValue. If the value is a …","Gets the name of a VectorValue. If the value is a …","","","","Gets the next use of a BasicBlock, InstructionValue or …","","","Check if a zext instruction has the non-negative flag set.","","Obtains the number of operands an InstructionValue has. An …","","Obtains the operand an InstructionValue has at a given …","Get the operand of an InstructionValue.","Gets the use of an operand(BasicValue), if any.","Gets the use of an operand(BasicValue), if any.","Get an instruction value operand use iterator.","Get an instruction value operand iterator.","","","","","","","","Get the section to which this function belongs","Get section, this global value belongs to","Obtains a constant IntValue’s sign extended value.","Gets a string Attribute on this CallSiteValue at an index …","Gets a string Attribute belonging to the specified …","Obtain the string from the ArrayValue if the value points …","","Get the debug info descriptor","Returns tail, musttail, and notail attributes.","Returns the tail call kind on call instructions.","","Gets the type of this ArrayValue.","","","","","Get type of the current InstructionValue","","","","","","Gets the used value (a BasicValueEnum or BasicBlock) of …","Gets the user (an AnyValueEnum) of this use.","","","Returns whether or not a memory access instruction is …","Obtains a constant IntValue’s zero extended value.","Determines whether or not this Instruction has any …","","","","","","","","","","","","","","","","","","","","","","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","","","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","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 if a terminator is conditional or not","Determines whether or not an ArrayValue is a constant.","Determines whether or not a FloatValue is a constant.","Determines whether or not an IntValue is an llvm::Constant.","Determines whether or not a PointerValue is a constant.","Determines whether or not a VectorValue is a constant.","Determines whether or not an ArrayValue represents a …","","","Determines whether or not an IntValue is an …","","Determines whether or not a GlobalValue is a declaration …","","","","","","","","","","","","Determines whether or not this value is null.","","","","","","","","","","","","Returns whether the value is poison","Returns whether the value is poison","","","","","","Determines whether or not this call is a tail call.","","Returns if the instruction is a terminator","","Determines whether or not this value is undefined.","","","","","","","","","","","","","","Get a value from an LLVMValueRef.","Get a value from an LLVMUseRef.","Get a value from an LLVMValueRef.","Get a value from an LLVMValueRef.","Get a value from an LLVMValueRef.","Get a value from an LLVMValueRef.","Get a value from an LLVMValueRef.","","Get a value from an LLVMValueRef.","Get a value from an LLVMValueRef.","Get a value from an LLVMValueRef.","","Get a value from an LLVMValueRef.","Get a value from an LLVMValueRef.","Get a value from an LLVMValueRef.","","Get a value from an LLVMValueRef.","","Get a value from an LLVMValueRef.","","","Get a value from an LLVMValueRef.","","Creates a new constant ArrayValue with the given type and …","Creates a new constant ArrayValue with the given type and …","","","","","","Prints this ArrayValue to standard error.","","","","","","","","Prints a value to a LLVMString","Prints a value to a LLVMString","Removes an enum Attribute on this CallSiteValue at an …","Removes an enum Attribute belonging to the specified …","","Removes a string Attribute on this CallSiteValue at an …","Removes a string Attribute belonging to the specified …","Replaces all uses of this value with another value of the …","","","","","","","","","","","","Sets alignment on a memory access instruction or alloca.","Shortcut for setting the alignment Attribute for this …","Sets atomic ordering on a memory access instruction.","Sets the calling convention for this CallSiteValue.","","Assigns a Comdat to this GlobalValue.","","Set the disjoint flag on or instructions.","","","Set fast math flags on supported instructions.","Sets the value of a field belonging to this StructValue.","","","","","Sets a metadata of the given type on the GlobalValue","Determines whether or not this Instruction has any …","Sets the name of a BasicValue. If the value is a constant, …","Sets the name of a BasicValue. If the value is a constant, …","Set name of the ArrayValue.","Set name of the BasicValueEnum.","Set name of the FloatValue.","Set name of the GlobalValue.","Set name of the InstructionValue.","Set name of the IntValue.","","Set name of the PointerValue.","Get name of the StructValue.","Set name of the VectorValue.","Set the non-negative flag on zext instructions.","Sets the operand an InstructionValue has at a given index …","","","Set the section to which this function should belong","Set section, this global value belongs to","Set the debug info descriptor","Sets whether or not this call is a tail call.","Sets tail, musttail, and notail attributes.","","","","","","Sets whether or not a memory access instruction is …","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","Try to convert this CallSiteValue to a BasicValueEnum if …","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","View the control flow graph and produce a .dot file","Only view the control flow graph"],"i":[10,4,4,5,0,6,5,0,0,0,6,7,9,2,9,5,5,5,5,0,8,0,7,9,8,0,0,10,6,8,8,5,5,4,2,5,6,4,3,3,3,3,3,3,3,0,5,3,3,7,4,2,2,2,2,4,5,0,3,2,3,2,3,2,3,2,3,5,5,3,3,4,5,5,0,0,1,2,3,4,5,6,7,8,9,10,1,2,3,4,5,6,7,8,9,10,0,1,2,3,4,5,6,7,8,9,10,1,2,3,4,5,6,7,8,9,10,2,3,4,5,7,9,10,0,0,0,0,1,6,7,9,1,2,3,4,5,6,7,8,9,10,0,1,2,3,4,5,6,7,8,9,10,1,1,2,2,3,3,4,4,5,5,6,7,7,8,9,9,10,10,2,3,4,5,7,9,10,1,2,2,3,3,4,4,5,5,6,7,7,8,9,9,10,10,0,0,0,0,0,2,3,4,5,7,9,10,0,0,0,1,2,3,4,5,6,7,8,9,10,1,1,2,3,4,5,6,7,8,9,10,1,2,3,4,5,6,7,8,9,10,1,2,3,4,5,6,7,8,9,10,0,0,0,0,31,31,31,29,29,31,29,31,29,31,29,31,29,31,29,31,29,31,29,29,29,29,29,29,29,31,29,31,29,29,29,29,29,31,29,31,29,31,29,31,0,0,36,36,38,36,38,36,36,36,36,36,38,36,38,36,36,36,36,36,36,36,36,36,36,36,36,36,36,38,38,36,36,38,36,36,36,36,36,38,36,38,36,38,47,47,0,0,47,47,47,47,47,47,47,44,47,44,47,44,44,44,44,44,44,44,44,44,44,44,44,44,44,44,44,44,44,44,44,44,44,44,44,44,44,44,44,44,44,44,44,44,44,44,44,44,44,44,44,44,44,44,44,44,44,44,44,44,44,44,44,44,44,44,44,44,44,44,44,44,44,44,44,44,44,44,44,44,44,44,44,44,44,44,44,44,44,44,44,44,44,44,44,44,44,44,44,44,44,44,44,44,44,44,44,44,44,44,47,47,47,44,47,44,44,44,44,47,44,44,44,44,44,44,47,47,44,47,44,47,44,44,72,0,0,72,72,72,72,70,72,70,72,70,72,70,72,70,72,72,70,72,70,72,72,70,70,72,72,72,70,70,72,70,72,70,72,70,72,70,72,70,0,0,0,74,40,75,74,40,74,40,74,40,74,40,40,40,74,40,74,40,74,74,40,74,40,74,40,74,40,74,40,74,40,74,40,74,40,74,74,74,40,40,74,40,74,40,74,40,74,40,74,40,74,40,74,74,40,74,40,74,40,74,40,74,40,74,40,74,40,74,40,74,40,74,40,74,40,74,40,74,40,74,40,74,40,74,40,74,40,74,40,40,74,40,74,40,74,40,74,40,74,40,0,92,92,92,92,92,92,92,92,92,92,92,210,210,210,210,113,113,113,113,0,210,210,113,113,113,113,113,113,113,113,113,113,113,113,113,113,113,113,113,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,113,210,210,210,210,113,113,113,113,113,113,112,113,113,113,210,210,210,210,113,113,113,0,210,210,112,210,210,113,113,113,113,210,210,112,210,210,210,210,113,113,113,113,113,210,210,210,210,210,210,210,210,113,113,210,210,210,210,113,113,210,210,210,210,113,210,210,210,210,210,210,113,210,210,210,210,210,210,210,210,113,94,96,97,98,99,100,101,102,103,104,105,106,95,96,97,98,99,100,101,102,103,104,68,109,105,110,101,102,103,106,95,96,97,98,99,100,101,102,103,111,104,68,109,105,110,112,113,106,95,96,97,98,99,100,101,102,103,111,104,68,109,105,110,112,113,95,96,97,98,99,100,101,102,103,111,104,68,109,105,110,112,113,95,96,97,98,99,100,101,102,103,111,104,68,109,105,110,112,113,112,113,106,106,106,106,106,106,106,106,106,106,106,106,106,106,106,106,106,106,106,106,0,106,106,95,96,97,98,99,100,101,102,103,111,104,68,109,105,110,112,113,106,106,95,96,97,98,99,100,101,102,103,111,104,68,109,105,110,112,113,106,95,96,97,98,99,100,101,102,103,111,104,68,109,105,110,112,112,113,113,100,68,97,68,100,68,100,112,113,106,106,106,106,95,96,97,98,99,100,101,102,103,111,104,68,109,105,110,112,112,113,113,112,113,106,95,96,97,98,99,100,101,102,103,111,104,68,109,105,110,112,113,106,95,96,97,98,99,100,101,102,103,111,104,68,109,105,110,112,113,106,95,96,97,98,99,100,101,102,103,111,104,68,109,105,110,112,113,106,95,96,97,98,99,100,101,102,103,111,104,68,109,105,110,112,113,0,0,132,129,132,0,129,129,0,0,122,122,122,126,132,129,122,126,132,129,122,126,126,126,126,126,126,126,126,126,126,126,126,126,126,126,129,122,126,122,126,129,122,132,129,122,132,132,129,129,122,126,122,132,129,122,126,122,122,122,122,132,129,122,126,126,122,122,122,122,122,122,122,122,122,126,132,129,132,129,122,126,132,129,122,126,132,129,122,126,0,137,137,137,137,137,137,137,137,137,137,137,137,137,137,137,0,81,81,81,81,81,81,81,81,81,81,81,81,81,81,81,81,81,81,141,141,142,142,142,142,142,141,142,142,0,0,142,0,142,142,142,142,0,142,142,0,141,142,141,141,142,142,80,80,80,80,80,80,142,80,141,146,147,142,80,141,146,147,142,80,141,142,80,141,142,141,80,80,80,80,80,80,142,80,141,142,80,141,146,147,142,142,80,141,141,146,147,80,80,80,80,80,80,80,80,80,80,80,80,80,80,80,80,80,80,80,142,141,142,142,80,141,141,146,147,146,147,80,80,146,147,80,80,142,141,80,80,80,80,80,80,80,80,80,80,80,142,80,141,80,142,80,141,146,147,142,80,141,146,147,142,80,141,146,147,80,80,80,80,0,0,0,0,0,0,0,140,158,160,161,163,164,166,140,158,160,161,163,164,166,140,158,160,161,163,164,166,140,158,161,164,140,158,160,161,163,164,166,140,158,160,161,163,164,166,160,166,160,160,166,163,160,140,140,163,163,163,140,158,160,161,163,164,166,158,161,164,140,158,160,161,163,164,166,158,161,164,160,166,140,158,160,161,163,164,166,140,158,160,161,163,164,166,140,158,160,161,163,164,166,168,0,0,0,153,155,153,155,153,155,168,153,155,153,155,153,153,155,153,155,153,153,155,153,168,153,155,155,155,155,155,155,155,155,155,155,155,153,155,153,155,153,155,0,0,171,171,82,171,82,171,82,171,171,82,82,82,0,82,171,0,82,82,171,171,82,171,0,82,171,0,0,0,0,0,171,82,82,171,82,171,82,171,82,171,0,0,179,181,0,0,177,178,178,0,0,177,177,177,181,177,179,178,0,177,178,0,0,0,0,0,154,173,154,89,151,151,180,180,180,177,178,179,180,151,173,154,181,89,182,177,178,179,180,151,173,154,181,89,182,177,178,179,180,181,177,178,179,180,181,151,89,173,173,177,178,180,182,180,154,89,182,89,177,178,179,180,151,173,181,89,177,178,179,180,151,151,173,154,181,89,182,177,178,179,180,151,173,154,181,89,182,173,173,89,89,89,89,89,154,89,154,173,154,173,154,154,173,173,89,89,89,89,154,154,154,173,173,173,180,173,173,173,173,173,173,173,173,173,173,173,173,173,173,173,173,173,173,173,177,178,179,180,151,173,154,181,89,182,180,151,173,154,89,182,154,89,89,182,154,182,182,182,182,182,177,178,179,180,181,151,177,178,179,180,151,173,154,181,89,182,177,178,179,180,151,173,154,181,89,182,177,178,179,180,151,173,154,181,89,182,154,154,189,0,0,0,35,90,188,0,0,0,0,189,189,0,0,0,35,90,188,0,35,189,0,0,35,90,188,206,207,0,188,189,0,0,35,90,188,206,208,0,0,35,90,188,206,207,208,0,35,90,188,0,35,50,50,184,83,77,46,86,185,183,183,50,50,186,184,35,90,188,83,63,77,88,46,86,185,91,184,35,90,188,83,63,189,77,88,46,86,192,185,91,184,35,90,188,83,63,189,77,88,46,86,192,185,91,184,35,90,188,83,63,189,77,88,46,86,185,91,184,35,90,188,83,63,189,77,88,46,86,185,91,77,184,83,77,46,86,185,83,83,77,77,77,86,46,185,184,90,83,77,46,86,185,86,63,83,77,184,35,90,188,83,63,189,77,88,46,86,185,91,184,184,35,35,90,90,188,188,83,83,63,63,189,77,77,88,88,46,46,86,86,192,185,185,91,91,50,50,184,83,77,88,46,86,185,91,184,35,35,35,35,35,35,35,35,35,90,90,90,90,90,90,90,188,188,188,188,188,188,188,188,188,83,63,189,77,88,46,86,192,185,91,46,184,83,77,46,86,185,77,184,83,63,77,88,46,86,185,91,184,185,86,86,86,86,86,63,184,83,77,46,86,185,63,185,184,83,77,46,86,185,189,184,35,90,188,83,63,189,77,88,46,86,192,185,91,35,90,188,35,90,188,35,35,90,188,192,188,35,90,188,35,90,188,35,90,188,35,35,90,188,184,35,90,188,35,35,90,188,188,46,86,86,35,90,188,50,50,63,91,35,90,188,63,35,90,188,35,184,189,184,35,90,83,63,77,88,46,86,185,91,192,183,183,184,35,90,188,83,63,77,88,46,86,185,91,50,50,184,83,63,77,46,86,185,86,50,50,184,35,83,77,46,86,185,184,35,90,188,83,63,189,77,88,46,86,185,91,184,35,90,188,83,63,77,88,46,86,185,91,184,184,184,184,35,90,90,90,188,188,83,83,83,83,63,63,189,189,77,77,77,77,88,88,46,46,46,46,86,86,86,86,192,185,185,185,185,91,91,184,35,90,188,83,63,189,77,88,46,86,192,185,91,184,35,90,188,83,63,189,77,88,46,86,192,185,91,83,77,46,56,56,56,0,0,56,56,0,0,0,64,193,48,54,0,56,56,51,61,65,0,0,0,0,56,56,56,56,0,56,56,56,56,56,56,56,56,56,56,0,56,56,56,56,56,56,56,56,56,0,0,0,193,48,54,56,0,193,0,56,197,0,56,0,56,56,56,0,0,193,0,56,0,193,48,54,56,0,196,196,196,196,56,56,56,197,0,193,54,56,197,0,0,56,56,0,193,0,0,193,48,54,56,56,56,56,56,56,56,56,56,56,56,0,64,193,48,54,56,56,56,56,56,56,0,56,56,56,56,0,193,48,54,56,56,55,43,66,59,59,123,123,66,53,53,135,43,79,190,52,66,39,57,58,53,53,135,62,194,79,55,64,193,48,54,190,43,62,41,52,87,66,39,57,58,55,43,196,79,42,55,64,193,48,54,190,43,135,62,197,56,41,198,199,52,87,66,200,39,57,201,58,196,79,42,55,64,193,48,54,190,43,135,62,197,56,41,198,199,52,87,66,200,39,57,201,58,41,196,79,42,55,64,193,48,54,190,43,62,197,56,41,52,87,66,39,57,58,196,79,42,55,64,193,48,54,190,43,62,197,56,41,52,87,66,39,57,58,197,52,39,52,39,190,58,39,39,58,52,52,52,52,52,52,52,52,52,52,52,52,52,58,52,39,52,52,52,52,55,55,43,43,57,66,43,43,135,43,62,135,196,79,79,79,79,79,42,55,64,64,64,193,193,193,193,193,193,193,193,193,193,193,48,48,48,48,48,48,48,54,54,54,54,54,54,54,54,190,190,190,190,43,43,62,197,56,41,41,52,52,52,52,87,87,87,66,66,39,39,39,39,57,57,57,57,57,58,58,58,58,41,41,196,79,79,42,55,55,64,64,193,193,48,48,54,54,190,190,43,43,135,62,62,197,56,41,41,198,199,52,52,87,87,66,66,200,39,39,57,57,201,58,58,196,79,42,55,64,64,64,193,193,193,193,193,193,193,193,193,193,193,193,48,48,48,48,48,48,48,54,54,54,54,54,54,54,54,54,190,43,135,62,197,197,56,56,41,198,199,52,87,66,200,39,57,201,58,62,41,41,41,43,43,55,43,55,62,190,41,62,58,55,43,41,41,57,57,57,43,43,53,53,41,43,41,66,66,66,62,41,43,43,43,43,62,41,79,48,190,43,62,41,52,87,66,39,57,58,43,62,41,42,87,87,41,43,41,41,41,41,41,41,41,41,43,43,41,43,43,62,41,43,62,52,55,43,79,87,43,55,41,62,79,193,48,190,43,41,52,39,57,58,62,42,42,62,62,41,52,41,43,62,79,55,64,193,48,54,190,43,62,197,56,41,52,87,66,39,57,58,135,196,79,42,55,64,193,48,54,190,43,135,62,197,197,56,56,41,198,199,52,87,66,200,39,57,201,58,64,193,48,54,193,48,54,193,193,193,48,54,198,199,200,201,54,193,135,193,48,54,64,193,48,54,193,48,54,64,193,48,54,41,79,190,52,39,58,79,62,58,52,58,62,62,193,48,54,193,193,193,48,54,54,87,79,190,43,52,66,39,57,58,193,193,48,54,123,123,87,64,193,48,54,55,41,41,62,79,190,43,52,66,39,57,58,193,48,54,51,61,65,79,42,55,64,193,48,190,190,43,62,41,52,52,87,66,39,39,39,57,58,58,58,58,79,79,198,199,200,201,197,79,190,43,52,87,39,57,58,123,123,55,43,41,55,43,79,190,43,41,52,87,66,39,57,58,43,62,41,55,41,55,43,62,62,41,62,62,41,57,43,62,43,62,62,41,53,53,79,48,190,62,41,52,66,39,57,58,41,41,43,43,43,62,43,55,55,62,62,62,62,62,41,196,79,42,55,64,193,48,54,190,43,62,197,56,41,52,87,66,39,57,58,79,55,64,193,48,54,190,43,62,41,52,87,66,39,57,58,55,196,79,79,79,79,79,42,55,64,193,48,48,48,54,54,190,190,190,190,190,43,43,135,62,197,56,41,41,198,199,52,52,52,52,52,87,87,87,66,66,66,200,39,39,39,39,39,57,57,57,57,57,201,58,58,58,58,196,79,42,55,64,193,48,54,190,43,135,62,197,56,41,198,199,52,87,66,200,39,57,201,58,196,79,42,55,64,193,48,54,190,43,135,62,197,56,41,198,199,52,87,66,200,39,57,201,58,43,43,43],"f":"````````````````````````````````````````````````````````````````````````````{ce{}{}}0000000000000000000`{bb}{dd}{ff}{hh}{jj}{ll}{nn}{A`A`}{AbAb}{AdAd}{{ce}Af{}{}}000000000{{dd}Ah}{{ff}Ah}{{hh}Ah}{{jj}Ah}{{nn}Ah}{{AbAb}Ah}{{AdAd}Ah}````{{}b}{{}l}{{}n}{{}Ab}{{bb}Aj}{{dd}Aj}{{ff}Aj}{{hh}Aj}{{jj}Aj}{{ll}Aj}{{nn}Aj}{{A`A`}Aj}{{AbAb}Aj}{{AdAd}Aj}`{{bAl}An}{{dAl}An}{{fAl}An}{{hAl}An}{{jAl}An}{{lAl}An}{{nAl}An}{{A`Al}An}{{AbAl}An}{{AdAl}An}{cc{}}{B`b}{Bbd}2{Bdf}33{Bfh}{Bhj}55{Bjn}666{BlAb}{BnAd}8{{dc}AfC`}{{fc}AfC`}{{hc}AfC`}{{jc}AfC`}{{nc}AfC`}{{Abc}AfC`}{{Adc}AfC`}{ce{}{}}0{dBb}1{fBd}{hBf}3{jBh}44{nBj}555{AbBl}{AdBn}7`````{{dd}{{Cb{Ah}}}}{{ff}{{Cb{Ah}}}}{{hh}{{Cb{Ah}}}}{{jj}{{Cb{Ah}}}}{{nn}{{Cb{Ah}}}}{{AbAb}{{Cb{Ah}}}}{{AdAd}{{Cb{Ah}}}}```>>>>>>>>>>{Cd{{Cf{bc}}}{}}{c{{Cf{e}}}{}{}}0000000000000000000{cCh{}}000000000```````{CjCl}{ce{}{}}000{CjCj}{CnCn}{{ce}Af{}{}}0{{CjCj}Aj}{{CnCn}Aj}{{CjAl}An}{{CnAl}An}{cc{}}0{CjCd}{CjD`}{{}Cd}{DbCd}{CjDd}0{CjDf}{{Cnc}AfC`}??{CjAj}00{ClCj}{ce{}{}}0{c{{Cf{e}}}{}{}}000{cCh{}}0``{DhDj}3333{DhDh}{{ce}Af{}{}}{Dh{{Cf{AfAf}}}}{{DhDh}Aj}{{DhAl}An}{{DlAl}An}{cc{}}0{Dh{{Cb{Dn}}}}{DhE`}{Dh{{Cb{Eb}}}}{Dh{{Cb{Ed}}}}{{DhDb}{{Cb{Eb}}}}{DhDl}3{DhDd}{Dh{{Cb{Dh}}}}{Dh{{Cb{Ef}}}}16{{Dhc}AfC`}{ce{}{}}00{{DhDh}{{Cf{AfAf}}}}0{Dl{{Cb{c}}}{}}{Dh{{Cf{AfAf}}}}{{DhDh}Af}{{DhDb}Af}5{c{{Cf{e}}}{}{}}000{cCh{}}0```````````{EhEj}8888{{EhDnElDb}{{Cf{DnEn}}}}{{Eh{Fb{F`}}}{{Cf{EbEn}}}}{{EhcDb}{{Cf{DnEn}}}Fd}{{EhccDb}{{Cf{cEn}}}Ff}{{EhcFhDb}{{Cf{DnEn}}}Fd}0{{EhjDnFhh}{{Cf{FhEn}}}}{{EhceDb}{{Cf{F`En}}}FjFd}{{EhEf{Fb{Fl}}Db}{{Cf{FnEn}}}}{{EhG`ceDb}{{Cf{F`En}}}FjFd}{{EhDncchh}{{Cf{GbEn}}}Fj}{{EhFhDhDh}{{Cf{EbEn}}}}3{{EhEf{Fb{F`}}DhDhDb}{{Cf{FnEn}}}}{{EhGdFhDb}{{Cf{F`En}}}}{{EhcCdDb}{{Cf{F`En}}}Gf}{{EhhGhDb}{{Cf{EbEn}}}}{{EhccDb}{{Cf{cEn}}}Gj}{{EhcDb}{{Cf{cEn}}}Gj}{{EhfccDb}{{Cf{En}}}Gj}212122{{EhcDb}{{Cf{En}}}Gj}02{{EhDn}{{Cf{EbEn}}}}{{EhcDn{Fb{Fh}}Db}{{Cf{DnEn}}}Fd}{{EhDbDb}{{Cf{GlEn}}}}01{{Ehc{Fb{Dh}}}{{Cf{EbEn}}}Fj}{{EhGnDn{Fb{Fl}}Db}{{Cf{FnEn}}}}{{EhGnDn{Fb{F`}}DhDhDb}{{Cf{FnEn}}}}{{EhGdcFhDb}{{Cf{GdEn}}}Fj}{{EhceCdDb}{{Cf{H`En}}}GfFj}{{EhccDb}{{Cf{cEn}}}Ff}{{EhcDb}{{Cf{cEn}}}Ff}{{EhcAjDb}{{Cf{cEn}}}Ff}{{EhdccDb}{{Cf{En}}}Ff}3323323332322333{{EhcDb}{{Cf{En}}}Ff}334433{{EhEf{Fb{F`}}DhDhDb}{{Cf{FnEn}}}}{{EhcDb}{{Cf{En}}}Hb}0{{EhcEf{Fb{F`}}AjDb}{{Cf{F`En}}}Fd}7{{EhcDnDb}{{Cf{F`En}}}Fd}{{EhcDb}{{Cf{DnEn}}}Fd}{{EhDnCdDnCdFh}{{Cf{DnEn}}}}0{{EhDnCdFhFh}{{Cf{DnEn}}}}:;{{EhcDb}{{Cf{HdEn}}}Fd}{{EhcDb}{{Cf{cEn}}}Hb}{{EhcDnDnDb}{{Cf{FhEn}}}Fd}8{{Ehc}{{Cf{EbEn}}}Fj}{{Eh{Cb{Fj}}}{{Cf{EbEn}}}}{{EhccAjDb}{{Cf{cEn}}}Ff}{{EhceeDb}{{Cf{F`En}}}FfFj}{{EhGdGdGdDb}{{Cf{GdEn}}}}?{{EhDnc}{{Cf{EbEn}}}Fj}{{EhcDnCdDb}{{Cf{DnEn}}}Fd}{{EhFhDh{Fb{{Hf{FhDh}}}}}{{Cf{EbEn}}}}{{EhDh}{{Cf{EbEn}}}}{Eh{{Cf{EbEn}}}}{{EhcDb}{{Cf{En}}}Ff}{{EhDncDb}{{Cf{F`En}}}Fd}{{EhccDb}{{Cf{cEn}}}Ff}{EhAf}0{{EnEn}Aj}{{EnAl}An}0{{EhAl}An}{cc{}}0{Eh{{Cb{Hh}}}}{Eh{{Cb{Dh}}}}{{EhEb{Cb{Db}}}Af}{ce{}{}}0{EjEh}{{EhDhEb}Af}{{EhDh}Af}{{EhEb}Af}{{EhHh}Af}{cHj{}}{c{{Cf{e}}}{}{}}000{cCh{}}0{EhAf}```````{HlHn}::::{I`I`}{HlHl}{{ce}Af{}{}}0{{I`I`}Ah}{{I`I`}Aj}{{HlHl}Aj}{{I`Al}An}{{HlAl}An}{IbI`}{cc{}}0{HlI`}{{I`c}AfC`}{ce{}{}}{I`Ib}1{HnHl}{{I`I`}{{Cb{Ah}}}}{{HlI`}Af}44{c{{Cf{e}}}{}{}}000{cCh{}}0```{{IdEfDb}Dh}{{E`EfDb}Dh}{IfIh}{IdIh}{E`Ih}{IdIj}{E`Ij}===={E`E`}{{ce}Af{}{}}{{Id{Fb{Il}}Aj}In}{{E`{Fb{Il}}Aj}In}{{Id{Fb{F`}}Aj}Gb}{{E`{Fb{F`}}Aj}Gb}{{}Id}{IdEh}{E`Eh}{{IdCdD`}Cj}{{E`CdD`}Cj}{{IdGnHjHjAjAj{Cb{Ad}}Aj}Dn}{{E`GnHjHjAjAj{Cb{Ad}}Aj}Dn}{{IdDb}J`}{{E`Db}J`}{{IdJb}{{Cf{J`Jd}}}}{{E`Jb}{{Cf{J`Jd}}}}{{IdDbDb}Cj}{{E`DbDb}Cj}{{IdCdDf}Cj}{{E`CdDf}Cj}{{IdCd}Ij}{{E`Cd}Ij}{IdAf}{{IdE`}Aj}{{IdId}Aj}{{E`E`}Aj}{{E`Id}Aj}{IdJf}{E`Jf}101010{{IdAl}An}{{E`Al}An}{cc{}}0{ec{}{{Jj{Id}{{Jh{c}}}}}}{{IdDb}Cd}{{E`Db}Cd}{{IdDb}{{Cb{Jl}}}}{{E`Db}{{Cb{Jl}}}}{IdIj}{E`Ij}10101010{{IdDhDb}Dh}{{E`DhDb}Dh}{ce{}{}}0{{Id{Fb{Fl}}}Jn}{{E`{Fb{Fl}}}Jn}{{IdDb}Jn}{{E`Db}Jn}{IdK`}{E`K`}{{IdDb}Jl}{{E`Db}Jl}{IdJf}{E`Jf}<;{{IdKb{Cb{b}}}Ij}{{E`Kb{Cb{b}}}Ij}{{Idb}El}{{E`b}El}{{Id{Fb{Kd}}Aj}Jl}{{E`{Fb{Kd}}Aj}Jl}{ce{}{}}{c{{Cf{e}}}{}{}}000{cCh{}}0{IdKf}{E`Kf}<;`{KhKj}{KhDd}66{{KhKh}Aj}{{KhAl}An}{cc{}}9887``````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````{KlKn}{L`Kn}{LbKn}{LdKn}{LfKn}{LhKn}{LjKn}{LlKn}{LnKn}{M`Kn}{{Mbc}JnIf}{MdMf}{KnMh}{L`Mh}{LbMh}{LdMh}{LfMh}{LhMh}{LjMh}{LlMh}{LnMh}{M`Mh}{HhMh}{MjMh}{MbMh}{MlMh}{LjLh}{LlLh}{LnLh}{ce{}{}}00000000000000000000000000000000000{KnKn}{L`L`}{LbLb}{LdLd}{LfLf}{LhLh}{LjLj}{LlLl}{LnLn}{MnMn}{M`M`}{HhHh}{MjMj}{MbMb}{MlMl}{N`N`}{NbNb}{{ce}Af{}{}}0000000000000000{{N`N`}Ah}{{NbNb}Ah}{{MdLhD`Cd{Fb{{Nf{Nd}}}}}Ln}{{MdKnDbL`CdLhAjNhCd}Mj}{{MdDbD`NjNh}{{Cf{LlDb}}}}{{MdNd}Ml}{{MdcCdCdKn{Cb{Hh}}}HhIf}{{Md{Nl{Nd}}}Ml}{{MdDbDb}L`}{{MdKnDb{Cb{Db}}L`CdMnAjAjCdNhAj}Lf}{{MdKnDbDbL`CdLhAj{Cb{Ml}}{Cb{Kn}}Cd}Mb}{{MdKnL`CdCd}M`}{{MdKnDbL`NnD`CdD`NhLh}Lj}{{MdKnDbAj}Ld}{{MdKnDbCdL`CdLhAjNh}Mj}{{Mdc}LjIf}{{MdDbLhD`Cdb}Lj}{{MdLhCd}Lj}{{MdKnDbL`NnD`CdNh{Cb{Lh}}{Fb{Lh}}Nn{Cb{Lh}}Db}Ln}{{MdL`{Cb{Lh}}{Fb{Lh}}Nh}Mn}{{MdLhDbL`CdKnCd}Lj}{{MdKnDbL`CdD`CdNh{Fb{Lh}}CdDb}Ln}{{}Nn}{MdAf}{{MdMd}Aj}{{KnKn}Aj}{{L`L`}Aj}{{LbLb}Aj}{{LdLd}Aj}{{LfLf}Aj}{{LhLh}Aj}{{LjLj}Aj}{{LlLl}Aj}{{LnLn}Aj}{{MnMn}Aj}{{M`M`}Aj}{{HhHh}Aj}{{MjMj}Aj}{{MbMb}Aj}{{MlMl}Aj}{{N`N`}Aj}{{NbNb}Aj}{MdAf}{{MdAl}An}{{KnAl}An}{{L`Al}An}{{LbAl}An}{{LdAl}An}{{LfAl}An}{{LhAl}An}{{LjAl}An}{{LlAl}An}{{LnAl}An}{{MnAl}An}{{M`Al}An}{{HhAl}An}{{MjAl}An}{{MbAl}An}{{MlAl}An}{{N`Al}An}{{NbAl}An}{cc{}}000000000000000{O`N`}11{ObNb}{LhCd}{HhCd}{LbL`}1{LhD`}{HhKn}1{{N`c}AfC`}{{Nbc}AfC`}{{MdF`Mj{Cb{Ml}}HhEb}Eb}{{MdDn{Cb{Mj}}{Cb{Ml}}HhDh}Eb}{{MdDn{Cb{Mj}}{Cb{Ml}}HhEb}Eb}{ce{}{}}000000000000000{N`O`}1{NbOb}2{{N`N`}{{Cb{Ah}}}}{{NbNb}{{Cb{Ah}}}}{{MdLjLj}Af}55555555555555555{c{{Cf{e}}}{}{}}00000000000000000000000000000000000{cCh{}}00000000000000000``````````{{OdOfOh}Af}{{OdJ`}{{Cf{AfAf}}}}{OdOj}{{{Ol{c}}}cOn};;;;;;;;{{{Ol{{A`{ce}{{Jh{g}}}}}}ce}g{}{}{}}{{{Ol{{A`{ceg}{{Jh{i}}}}}}ceg}i{}{}{}{}}{{{Ol{{A`{cegi}{{Jh{k}}}}}}cegi}k{}{}{}{}{}}{{{Ol{{A`{c}{{Jh{e}}}}}}c}e{}{}}{{{Ol{{A`{cegik}{{Jh{m}}}}}}cegik}m{}{}{}{}{}{}}{{{Ol{{A`{cegikmoAaAcAeAg}{{Jh{Ai}}}}}}cegikmoAaAcAeAg}Ai{}{}{}{}{}{}{}{}{}{}{}{}}{{{Ol{{A`{cegikmoAa}{{Jh{Ac}}}}}}cegikmoAa}Ac{}{}{}{}{}{}{}{}{}}{{{Ol{{A`{cegikm}{{Jh{o}}}}}}cegikm}o{}{}{}{}{}{}{}}{{{Ol{{A`{cegikmoAaAc}{{Jh{Ae}}}}}}cegikmoAaAc}Ae{}{}{}{}{}{}{}{}{}{}}{{{Ol{{A`{}{{Jh{c}}}}}}}c{}}{{{Ol{{A`{cegikmoAaAcAeAgAiAk}{{Jh{Am}}}}}}cegikmoAaAcAeAgAiAk}Am{}{}{}{}{}{}{}{}{}{}{}{}{}{}}{{{Ol{{A`{cegikmo}{{Jh{Aa}}}}}}cegikmo}Aa{}{}{}{}{}{}{}{}}{{{Ol{{A`{cegikmoAaAcAe}{{Jh{Ag}}}}}}cegikmoAaAcAe}Ag{}{}{}{}{}{}{}{}{}{}{}}{{{Ol{{A`{cegikmoAaAcAeAgAi}{{Jh{Ak}}}}}}cegikmoAaAcAeAgAi}Ak{}{}{}{}{}{}{}{}{}{}{}{}{}}{Ab{{Cb{Ad}}}}{OdOd}{{{Ol{c}}}{{Ol{c}}}Af}{{ce}Af{}{}}0{AbDb}{OdAf}{{AhAh}Aj}{{AbAb}Aj}{{OdOd}Aj}{{AhAl}An}0{{AbAl}An}0{{OdAl}An}{{{Ol{c}}Al}An{}}{{OdEf}Af}{cc{}}000{{OdDb}{{Cf{{Ol{c}}Ah}}}Aj}{{OdDb}{{Cf{OhAh}}}}{{OdDb}{{Cf{EfAh}}}}{OdKb}{ce{}{}}000{{{Ol{c}}}cOn}{{}Af}0{{{Al{Oj}}Aj}Od}{{OdJ`}{{Cf{AfAb}}}}{{OdEf{Fb{An}}}An}{{OdEf{Fb{Db}}}AA`}{OdAf}077{cHj{}}0{c{{Cf{e}}}{}{}}0000000{cCh{}}000`::{AAbAAb}{{ce}Af{}{}}{{AAbAAb}Aj}{Db{{Cb{AAb}}}}{{AAbAl}An}{cc{}}{{AAbJ`{Fb{Kd}}}{{Cb{Ef}}}}{ce{}{}}{AAbAj}1::9`{JbAAd}{Jb{{Fb{Il}}}}33{AAf{{Cf{JbJd}}}}{{{Fb{Il}}Db}Jb}0{{}{{Cf{JbJd}}}}{Jb{{Cf{AAhAf}}}}{JbAf}{{JbAl}An};{JbOh}:{AAdJb}{c{{Cf{e}}}{}{}}0{cCh{}}````````````````````````````{{J`DbAAjc}AfFj}{{J`DbGn{Cb{AAl}}}Ef}{{J`c{Cb{b}}Db}GlFd}{{J`DbJn}{{Cf{AfDb}}}}{{J`DbAAjJn}Af}{J`AAn}{ce{}{}}000000000{AAlAAl}{J`J`}{AAjAAj}{{ce}Af{}{}}00{{AAlAAl}Ah}{{AAjAAj}Ah}{eAB`{}{{ABb{c}}}}{{J`AjNbDbDbDbAjDbNnDbN`NnAjAjDbDb}{{Hf{MdLb}}}}{J`{{Cf{OdJd}}}}0{{J`l}{{Cf{OdJd}}}}{J`Af}{{AAlAAl}Aj}{{J`J`}Aj}{{AAjAAj}Aj}{{AAlAl}An}{{J`Al}An}{{AAjAl}An}{{ABdAl}An}{{ABfAl}An}{cc{}}{ABhAAl}11{ABjAAj}22{J`E`}{J`{{ABl{Kh}}}}{J`Nn}{J`{{Cb{Ef}}}}{J`{{Cb{Gl}}}}{{J`Db}{{Cb{Jn}}}}{{J`Db}{{Cb{Ef}}}}{J`ABd}{{J`Db}{{Cb{Gl}}}}{{J`Db}{{Nl{Jn}}}}{{J`Db}Cd}{J`ABf}87{J`Dd}{{J`Db}Hl}1{{J`Db}{{Cb{Jl}}}}{J`ABn}{{AAlc}AfC`}{{AAjc}AfC`}{ce{}{}}{AAlABh}11{AAjABj}2222{{J`J`}{{Cf{AfJd}}}}{AAnJ`}{ABd{{Cb{c}}}{}}{ABf{{Cb{c}}}{}}{{Jbc}{{Cf{J`Jd}}}If}{{ce}{{Cf{J`Jd}}}{{AC`{AAf}}}If}{{AAlAAl}{{Cb{Ah}}}}{{AAjAAj}{{Cb{Ah}}}}{{J`c}{{Cf{AfJd}}}{{AC`{AAf}}}}{J`Af}{J`Jd}{{J`{ACb{J`}}}Aj}{{J`DbACdACf}{{Cf{AfJd}}}}{{J`Kh}Af}{{J`Db}Af}00{{J`ABn}Af}{J`Aj}{ce{}{}}00{J`Hj}{c{{Cf{e}}}{}{}}000000000{cCh{}}0000{J`{{Cf{AfJd}}}}{{J`AChAjAj}Aj}{J`Jb}{{J`AAf}Aj}```````{AAhACj}{ACl{{Hf{ACnACj}}}}{AD`{{Hf{ACnACj}}}}{ADb{{Hf{ADdACnACj}}}}{ADf{{Hf{ADdACj}}}}{ADh{{Hf{ADjACj}}}}{ADlADj}>>>>>>>>>>>>>>{AAhAf}{AClAf}{ADbAf}{ADhAf}{{AAhAl}An}{{AClAl}An}{{AD`Al}An}{{ADbAl}An}{{ADfAl}An}{{ADhAl}An}{{ADlAl}An}{cc{}}000000{AD`D`}{ADlD`}{AD`{{Fb{Il}}}}{AD`{{Cb{Dd}}}}{ADl{{Cb{Dd}}}}{ADfD`}{AD`ADb}{AAhACl}{AAhADh}{ADfADh}{ADf{{Hf{D`Dd}}}}{ADfDd}{ce{}{}}000000000{ACjAAh}{{ACnACj}ACl}{{ACnACj}AD`}{{ADdACnACj}ADb}{{ADdACj}ADf}{{ADjACj}ADh}{ADjADl}{ACl{{Cb{c}}}{}}{ADb{{Cb{c}}}{}}{ADh{{Cb{c}}}{}}{AD`D`}{ADlD`}{c{{Cf{e}}}{}{}}0000000000000{cCh{}}000000````{{{ACb{Ef}}}AB`}{ACfADn}{ce{}{}}000{eAB`{}{{ABb{c}}}}{c{{ACb{e}}}ABbAE`}{{}ACf}{{{ACb{c}}}Af{}}{ACfAf}{{{ACb{Ef}}}Aj}{{{ACb{c}}Al}AnAEb}{{ACfAl}An}{cc{}}0399{AB`{{ACb{c}}}AE`}{{{AE`{}{{AEd{c}}}}{ACb{{AE`{}{{AEd{c}}}}}}}Aj{}}{{{ACb{c}}c}AjAE`}{{ACfAj}Af}00{{ACfCd}Af}0111111{c{{Cf{e}}}{}{}}000{cCh{}}0````{ce{}{}}000{Jd{{Cb{Ad}}}}{AEfAEf}{{ce}Af{}{}}{Jdc{}}{JdDb}{JdAf}{{}Af}{{JdJd}Aj}{{AEfAEf}Aj}`{{JdAl}{{Cf{AfAEh}}}}0{{AEfAl}An}0{cc{}}0{{}{{Hf{CdCdCd}}}}=={{}Aj}{AAf{{Cf{AfAEf}}}}8{Db{{Cb{Oh}}}}9{ce{}{}}{JdHj}{cHj{}}0{c{{Cf{e}}}{}{}}000{cCh{}}0{{{A`{Kj}{{Jh{Af}}}}}Af}?````````````````````````{{ACd{ACb{c}}}Af{}}{AEjAEl}{ACdAEn}{KbAF`}{ABnKj}{ABnDd}```;;;;;;;;;;;;;;;;;;;;{AFbAFb}{AFdAFd}{AFfAFf}{AFhAFh}{AFjAFj}{{ce}Af{}{}}0000{DbABn}{DbKb}{{AEjABnDbDblAFdAFb}{{Cb{ACd}}}}{{AEjABnAFl}{{Cb{ACd}}}}{{}AFb}{{}AFd}{{}AFh}{{}AFl}`{ACdAf}{KbAf}{AFlAf}{{KbJlD`}Cd}{{AFbAFb}Aj}{{AFdAFd}Aj}{{AFfAFf}Aj}{{AFhAFh}Aj}{{ABnABn}Aj}{{AEjAEj}Aj}{{AFjAFj}Aj}{{KbKb}Aj}{{AFbAl}An}{{AFdAl}An}{{AFfAl}An}{{AFhAl}An}{{ABnAl}An}{{ABnAl}{{Cf{AfAEh}}}}{{AEjAl}An}{{ACdAl}An}{{AFjAl}An}{{KbAl}An}{{AFlAl}An}{cc{}}000000000{Db{{Cb{AEj}}}}{ABn{{Cf{AEjJd}}}}{{KbAFn}Cd}{{KbAFn}D`}0{KbAFj}2{ACdJd}{KbKh}{{}ABn}{AEjDd}{ACdDd}{{}{{Cb{AEj}}}}{{}Jd}03{AEj{{Cb{AEj}}}}{{Kb{Cb{b}}}Cd};{{KbGl}Cd};{ACdAEj}{ACdKb}{ACdABn}{AEjAj}00`{AFhAf}000000000{AFh{{Cf{AfHj}}}}11111111{ce{}{}}000000000`{JdABn}{AElAEj}{AEnACd}{AF`Kb}{{}AFl}{ABnABn}{{KbJlCd}{{Cb{D`}}}}{{Kbc{Cb{b}}}IjIf}{{AFlDb}AFl}{{ACdAj}Af}{{AFlAFb}AFl}22{{AFll}AFl}{{AFlAFd}AFl}====={cHj{}}{c{{Cf{e}}}{}{}}0000000000000000000{cCh{}}000000000{{ACdJ`AFfAAf}{{Cf{AfJd}}}}{{ACdJ`AFf}{{Cf{JbJd}}}}`````````````````````````````````````````````````````{{FdCd}AG`}0{{AG`Cd}AG`}{{JfCd}AG`}{{IjCd}AG`}{{ElCd}AG`}{{JlCd}AG`}{{AGbCd}AG`}{AFnDf}0{FdKd}0{AGdAGf}{AG`AGf}{DfAGf}{KdAGf}{AGhAGf}{JfAGf}{GnAGf}{IjAGf}{K`AGf}{ElAGf}{JlAGf}{AGbAGf}{KfAGf}{ce{}{}}000000000000000000000000000{AG`AG`}{DfDf}{KdKd}{AGhAGh}{JfJf}{GnGn}{AGjAGj}{IjIj}{K`K`}{ElEl}{JlJl}{AGbAGb}{KfKf}{{ce}Af{}{}}000000000000{IjFh}{{AG`{Fb{In}}}In}{{Jf{Fb{AGl}}}In}{{Ij{Fb{Fh}}}In}{{El{Fb{Dn}}}In}{{Jl{Fb{Gb}}}In}{{AGb{Fb{Gd}}}In}{{JfAGn}AGl}{{JfDb}AGl}{{IjD`Aj}Fh}{{Ij{Fb{D`}}}Fh}{{IjDbAGj}{{Cb{Fh}}}}{{Jl{Fb{F`}}}Gb}{ElDn}{{{Fb{c}}}GdFj}{AG`In}{KdF`}{JfAGl}{IjFh}5{JlGb}{AGbGd}{JlCd}{GnCd}{{JfAGn}An}{{IjD`Aj}An}{{AG`AG`}Aj}{{DfDf}Aj}{{KdKd}Aj}{{AGhAGh}Aj}{{JfJf}Aj}{{GnGn}Aj}{{AGjAGj}Aj}{{IjIj}Aj}{{K`K`}Aj}{{ElEl}Aj}{{JlJl}Aj}{{AGbAGb}Aj}{{KfKf}Aj}{{AG`Al}An}0{{DfAl}An}0{{KdAl}An}0{{AGhAl}An}0{{JfAl}An}0{{GnAl}An}0{{AGjAl}An}{{IjAl}An}0{{K`Al}An}0{{ElAl}An}0{{JlAl}An}0{{AH`Al}An}{{AGbAl}An}0{{KfAl}An}0{{Fd{Fb{AGh}}Aj}Gn}0{{AG`{Fb{AGh}}Aj}Gn}{{Jf{Fb{AGh}}Aj}Gn}{{Ij{Fb{AGh}}Aj}Gn}{{K`{Fb{AGh}}Aj}Gn}{{El{Fb{AGh}}Aj}Gn}{{Jl{Fb{AGh}}Aj}Gn}{{AGb{Fb{AGh}}Aj}Gn}{{Kf{Fb{AGh}}Aj}Gn}{cc{}}{ElDf}{AGbDf}{JfDf}3{IjDf}{AG`Df}{GnDf}{JlDf}{KfDf}{IjKd}{ElKd}{AG`Kd};{JfKd}{AGbKd}{JlKd}{AGbAGh}{K`AGh}{JfAGh}{AG`AGh}{IjAGh}{KdAGh}{JlAGh}{ElAGh}{cc{}}0000000000{Elb}{AG`Fh}{JfFh}{IjFh}{ElFh}{JlFh}{AGbFh}{IjCd}{AG`E`}{JfE`}{GnE`}{IjE`}{K`E`}{ElE`}{JlE`}{AGbE`}{KfE`}{AG`Kd}{AGbKd}{{JlCd}{{Cb{Kd}}}}{{JlCd}Kd}{Jl{{Nl{Kd}}}}{JlAH`}{Jl{{Cb{Dd}}}}{Gn{{Nl{Kd}}}}{AG`In}{JfAGl}{IjFh}{ElDn}{JlGb}{AGbGd}{Gn{{Cb{Kd}}}}{AGbCd}765432{{AGjc}AfC`}{ce{}{}}0000000000000{DfAG`}{KdAG`}{AGhAG`}{DfJf}{KdJf}{AGhJf}{DfGn}{DfIj}{KdIj}{AGhIj}:{AGhK`}{DfEl}{KdEl}{AGhEl}{DfJl}{KdJl}{AGhJl}{DfAGb}{KdAGb}{AGhAGb}{DfKf}{DfAj}{KdAj}{AGhAj}{AG`Aj}32133211{ElAj}{JlAj}0543{FdAj}0{GnAj}{KfAj}87618768{AG`Cd}{{AGjDb}Aj}{AGfAG`}{AGfDf}{AGfKd}{AGfJf}{AGfGn}{AGfIj}{AGfK`}{AGfEl}{AGfJl}{AGfAGb}{AGfKf}{AH`{{Cb{c}}}{}}{AFnJd}0{AG`Jd}{DfJd}{KdJd}{AGhJd}{JfJd}{GnJd}{IjJd}{K`Jd}{ElJd}{JlJd}{AGbJd}{KfJd}{{Fdb}El}0{{AG`b}El}{{Jfb}El}{{Gnb}El}{{Ijb}El}{{Elb}El}{{Jlb}El}{{AGbb}El}{{Jl{Fb{Kd}}Aj}Aj}{Fd{{Cb{Fh}}}}0{AG`{{Cb{Fh}}}}{Df{{Cb{Fh}}}}{JfFh}{IjFh}{ElFh}{Jl{{Cb{Fh}}}}{AGb{{Cb{Fh}}}}{ce{}{}}000000000000{cHj{}}00000000000{AGh{{Cf{AG`c}}}{}}{Df{{Cf{AG`c}}}{}}{Kd{{Cf{AG`c}}}{}}{c{{Cf{e}}}{}{}}0{AGh{{Cf{Kdc}}}{}}{Df{{Cf{Kdc}}}{}}2{Df{{Cf{AGhc}}}{}}3{Kd{{Cf{Jfc}}}{}}4{AGh{{Cf{Jfc}}}{}}{Df{{Cf{Jfc}}}{}}6{Df{{Cf{Gnc}}}{}}{Il{{Cf{AGjc}}}{}}8{AGh{{Cf{Ijc}}}{}}{Df{{Cf{Ijc}}}{}}:{Kd{{Cf{Ijc}}}{}};{AGh{{Cf{K`c}}}{}}{Df{{Cf{Elc}}}{}}{Kd{{Cf{Elc}}}{}}>{AGh{{Cf{Elc}}}{}}{Df{{Cf{Jlc}}}{}}{c{{Cf{e}}}{}{}}{Kd{{Cf{Jlc}}}{}}{AGh{{Cf{Jlc}}}{}}2{AGh{{Cf{AGbc}}}{}}3{Df{{Cf{AGbc}}}{}}{Kd{{Cf{AGbc}}}{}}{Df{{Cf{Kfc}}}{}}666666666666666{cCh{}}0000000000000{{JfCd}AGb}{{IjCd}AGb}{{ElCd}AGb}```````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````{{FnCnCj}Af}{{EfCnCj}Af}{{Hd{Fb{{Hf{FjDh}}}}}Af}{GfH`}0{OfAHb}0{HdF`}{FjF`}0{{AnJf}AGn}{EfGl}{In{{Cb{Eb}}}}{AGl{{Cb{Eb}}}}{Fh{{Cb{Eb}}}}{HdEb}{Dn{{Cb{Eb}}}}{Gb{{Cb{Eb}}}}{Gd{{Cb{Eb}}}}{Fj{{Cb{Eb}}}}0{{AnAj}D`}{GlDn}{AHdAHf}{InAHf}{FnAHf}{H`AHf}{AHbAHf}{F`AHf}{FlAHf}{AGlAHf}{EfAHf}{GlAHf}{EbAHf}{FhAHf}{JnAHf}{HdAHf}{DnAHf}{GbAHf}{GdAHf}{{FnCn}{{Nl{Cj}}}}{{EfCn}{{Nl{Cj}}}}{ce{}{}}0000000000000000000000000000000000000000000000000{EbAj}{AHhAHh}{InIn}{EdEd}{FnFn}{H`H`}{AHbAHb}{F`F`}{FlFl}{AGlAGl}{EfEf}{GlGl}{AHjAHj}{G`G`}{EbEb}{FhFh}{JnJn}{HdHd}{DnDn}{GbGb}{GdGd}{{ce}Af{}{}}0000000000000000000{{AHjAHj}Ah}{{FhFh}Fh}{{DnEl}Dn}{{FhIj}Fh}1{{AGlfAGl}Fh}{{GdFh}F`}{{Dnc{Fb{Fh}}}DnFd}0{{GdFhc}F`Fj}{{FhdFh}Fh}7??77?777?77{{GdGdGd}Gd}8{{DnIj}Fh}{{FhEl}Dn}88:{FnCd}{{FnCn}Cd}{{EfCn}Cd}{EfCd}{GbCd}{HdCd}2{eAB`{}{{ABb{c}}}}{cAn{}}{EfAf}{GlAf}{AnAf}{{AHhAHh}Aj}{{InF`}Aj}{{InFl}Aj}{{InH`}Aj}{{InIn}Aj}{{InAHb}Aj}{{EdEd}Aj}{{FnFn}Aj}{{H`In}Aj}{{H`Gb}Aj}{{H`H`}Aj}{{AHbAHb}Aj}{{AHbDn}Aj}{{AHbGd}Aj}{{AHbJn}Aj}{{AHbEb}Aj}{{AHbAGl}Aj}{{AHbHd}Aj}{{AHbFh}Aj}{{AHbIn}Aj}{{AHbEf}Aj}{{AHbGb}Aj}{{F`Gb}Aj}{{F`In}Aj}{{F`F`}Aj}{{F`Dn}Aj}{{F`Fh}Aj}{{F`AGl}Aj}{{F`Gd}Aj}{{FlAGl}Aj}{{FlGb}Aj}{{FlIn}Aj}{{FlJn}Aj}{{FlDn}Aj}{{FlFl}Aj}{{FlGd}Aj}{{FlFh}Aj}{{AGlAGl}Aj}{{AGlFl}Aj}{{AGlAHb}Aj}{{AGlF`}Aj}{{EfEf}Aj}{{EfAHb}Aj}{{GlGl}Aj}{{AHjAHj}Aj}{{G`G`}Aj}{{EbEb}Aj}{{EbAHb}Aj}{{FhF`}Aj}{{FhFh}Aj}{{FhAHb}Aj}{{FhFl}Aj}{{JnJn}Aj}{{JnFl}Aj}{{JnAHb}Aj}{{HdHd}Aj}{{HdAHb}Aj}{{DnF`}Aj}{{DnFl}Aj}{{DnDn}Aj}{{DnAHb}Aj}{{GbGb}Aj}{{GbFl}Aj}{{GbH`}Aj}{{GbF`}Aj}{{GbAHb}Aj}{{GdFl}Aj}{{GdAHb}Aj}{{GdGd}Aj}{{GdF`}Aj}{EbAf}{EbEb}{{AHhAl}{{Cf{AfAEh}}}}{{InAl}An}0{{EdAl}An}{{FnAl}An}0{{H`Al}An}0{{AHbAl}An}0{{F`Al}An}0{{FlAl}An}0{{AGlAl}An}0{{EfAl}An}0{{AnAl}An}{{GlAl}An}0{{AHjAl}An}{{G`Al}An}{{EbAl}An}0{{AHlAl}An}{{AHnAl}An}{{FhAl}An}0{{JnAl}An}0{{HdAl}An}0{{AI`Al}An}{{DnAl}An}0{{GbAl}An}0{{AIbAl}An}{{GdAl}An}0{cc{}}000{InH`}1{GbH`}{DnAHb}{F`AHb}{JnAHb}{HdAHb}{GbAHb}{InAHb}{GdAHb}9{EbAHb}{FhAHb}{AGlAHb}{EfAHb}{InF`}{GbF`}{GdF`}{FhF`}{cc{}}{DnF`}{AGlF`}{DnFl}{JnFl}{F`Fl}{AGlFl}{GdFl}7{GbFl}{FhFl}{InFl}:::::{AIdAHj};{AIfG`}<<<<<<<<<<<{GlCd}{Eb{{Cf{CdDb}}}}{Eb{{Cf{KdDb}}}}{Eb{{Cf{hDb}}}}`{Ef{{Nl{Dh}}}}{FnCd}{EfCd}{FnEf}{Gl{{Cb{Hl}}}}{AGl{{Cb{{Hf{AGnAj}}}}}}{Eb{{Cb{Aj}}}}{GlAb}{{GdCd}F`}{{FnCnCd}{{Cb{Cj}}}}{{EfCnCd}{{Cb{Cj}}}}{Eb{{Cb{Cd}}}}{Eb{{Cb{f}}}}{{GbCd}{{Cb{F`}}}}{{GbCd}F`}{GbAIb}{Ef{{Cb{Dh}}}}{Ef{{Cb{F`}}}}{Fj{{Cb{Ed}}}}0{Eb{{Cb{Ed}}}}{EfDd}{Eb{{Cb{d}}}}{{HdCd}{{Cb{{Hf{F`Dh}}}}}}{{HdCd}{{Hf{F`Dh}}}}{HdAI`}{Gl{{Cb{F`}}}}{{EbDb}{{Cb{Eb}}}}{EfCd};:{EfAAl}{GlAAl}{{EbCd}{{Cb{Jn}}}}{InDd}{F`Dd}{AGlDd}={GlDd}{Eb{{Cb{Dd}}}}{FhDd}{JnDd}{HdDd}{DnDd}{GbDd}{GdDd}{Ef{{Cb{Ef}}}}{Gl{{Cb{Gl}}}}{Eb{{Cb{Eb}}}}{Ed{{Cb{Ed}}}}{JnCd}{Jn{{Nl{Fl}}}}{Eb{{Cb{Aj}}}}{{EfCd}{{Cb{F`}}}}{EbCd}{EbG`}{{EbCd}{{Cb{{AIh{F`Dh}}}}}}0{{EbCd}{{Cb{Ed}}}}0{EbAHn}{EbAHl}`{Ef{{Nl{F`}}}}{Eb{{Cb{Dh}}}}??>={Ef{{Cb{Dd}}}}{Gl{{Cb{Dd}}}}{Fh{{Cb{Nd}}}}{{FnCnDb}{{Cb{Cj}}}}{{EfCnDb}{{Cb{Cj}}}}{In{{Cb{Dd}}}}{Jn{{Cb{Dd}}}}{Ef{{Cb{Lf}}}}{FnAHh}{Eb{{Cb{AHh}}}}{Gl{{Cb{A`}}}}{InAG`}{AHbDf}{F`Kd}{AGlJf}{EfGn}{EbDf}{FhIj}{DnEl}{GbJl}{GdAGb}{GlAHj}{Ed{{AIh{F`Dh}}}}{EdAHb}{GlDf}{Gln}{Eb{{Cf{AjDb}}}}{Fh{{Cb{D`}}}}{EbAj}{EfAj}{GlAj}{{Inc}AfC`}{{Fnc}AfC`}{{H`c}AfC`}{{AHbc}AfC`}{{F`c}AfC`}{{Flc}AfC`}{{AGlc}AfC`}{{Efc}AfC`}{{Glc}AfC`}{{AHjc}AfC`}{{G`c}AfC`}{{Ebc}AfC`}{{Fhc}AfC`}{{Jnc}AfC`}{{Hdc}AfC`}{{Dnc}AfC`}{{Gbc}AfC`}{{Gdc}AfC`}{AnCd}{ce{}{}}000000000000{AHjAId}{G`AIf}222222222222{H`In}{AHbIn}{F`In}{FlIn}{AHbAGl}{F`AGl}{FlAGl}{AHbEf}{AHbEb}{AHbFh}{F`Fh}{FlFh}>>>>{FlJn}{AHbHd}{An}{AHbDn}{F`Dn}{FlDn}{H`Gb}{AHbGb}{F`Gb}{FlGb}{AHbGd}{F`Gd}{FlGd}{H`Aj}{AHbAj}{F`Aj}{FlAj}{EbAj}{InAj}{AGlAj}{FhAj}{DnAj}{GdAj}4{GlAj}13100987999877{JnAj}65{EfAj}5{HdAj}5{GbAj}5==<;{OfAj}04?>=<{FnAj}<<6;:493827?>={AHf{{Ff{}{{AIj{c}}}}}AIl}{AHf{{Gj{}{{AIj{c}}}}}AIn}{AHf{{Hb{}{{AIj{c}}}}}AJ`}{AHfIn}{AJbEd}{AHfFn}{AHfH`}{AHfAHb}{AHfF`}{AHfAGl}0{AHf{{Cb{Ef}}}}{AHfGl}{AHfEb}{AHfFh}0{AHfJn}{AHfHd}{AHfDn}00{AHfGb}{AHfGd}000{{c{Fb{e}}}InAGdAHd}{{AGf{Fb{AHf}}}In}{AHl{{Cb{c}}}{}}{AHn{{Cb{c}}}{}}{AI`{{Cb{c}}}{}}{AIb{{Cb{c}}}{}}{{AHjAHj}{{Cb{Ah}}}}{InAf}{AGlAf}{EfAf}{FhAf}{JnAf}{DnAf}{GbAf}{GdAf}{OfJd}0{{FnCnCd}Af}{{EfCnCd}Af}{EbAf}{{FnCnDb}Af}{{EfCnDb}Af}{{InIn}Af}{{AGlAGl}Af}{{EfEf}Af}{{EbEb}Af}{{FhFh}Af}{{JnJn}Af}{{HdHd}Af}{{DnDn}Af}{{GbGb}Af}{{GdGd}Af}{{Ef{ACb{Ef}}}Aj}{{GlCd}Af}{{EbCd}{{Cf{AfDb}}}}{{FnCnCd}Af}{{Ebh}{{Cf{AfDb}}}}{{FnCd}Af}{{EfCd}Af}{{GlHl}Af}{{GlAj}Af}{{EbAj}Af}{{GlAb}Af}2{{EbCd}Af}{{GbCdc}AjFj}{{EfDb}Af}{{GlFj}Af}{{EfAAl}Af}{{GlAAl}Af}{{GlJnCd}Af}{{EbJnCd}{{Cf{AfDb}}}}{{FjDb}Af}0{{InDb}Af}{{F`Db}Af}{{AGlDb}Af}{{GlDb}Af}{{EbDb}{{Cf{AfDb}}}}{{FhDb}Af}{{HdDb}Af}{{DnDb}Af}{{GbDb}Af}{{GdDb}Af}{{EbAj}Af}{{EbCdc}AjFj}{{EfCdCd}Af}{{EfEf}Af}{{Ef{Cb{Db}}}Af}{{Gl{Cb{Db}}}Af}{{EfLf}Af}{{FnAj}Af}{{FnAHh}Af}{{GlAj}Af}{{Gl{Cb{A`}}}Af}1{{GlAHj}Af}{{Gln}Af}{{EbAj}{{Cf{AfDb}}}}{ce{}{}}0000000000000000000{cHj{}}000000000000000{Fn{{AIh{F`Eb}}}}{c{{Cf{e}}}{}{}}{H`{{Cf{Inc}}}{}}{F`{{Cf{Inc}}}{}}2{AHb{{Cf{Inc}}}{}}{Fl{{Cf{Inc}}}{}}44444{AHb{{Cf{F`c}}}{}}{Fl{{Cf{F`c}}}{}}{AHb{{Cf{Flc}}}{}}7{F`{{Cf{AGlc}}}{}}8{Eb{{Cf{AGlc}}}{}}{Fl{{Cf{AGlc}}}{}}{AHb{{Cf{AGlc}}}{}}{AHb{{Cf{Efc}}}{}}<<<<<{AHb{{Cf{Ebc}}}{}}==={Eb{{Cf{Fhc}}}{}}{Fl{{Cf{Fhc}}}{}}?{AHb{{Cf{Fhc}}}{}}{F`{{Cf{Fhc}}}{}}{Fl{{Cf{Jnc}}}{}}{AHb{{Cf{Jnc}}}{}}{c{{Cf{e}}}{}{}}0{AHb{{Cf{Hdc}}}{}}{Eb{{Cf{Hdc}}}{}}2{Fl{{Cf{Dnc}}}{}}3{Eb{{Cf{Dnc}}}{}}{AHb{{Cf{Dnc}}}{}}{F`{{Cf{Dnc}}}{}}{F`{{Cf{Gbc}}}{}}{AHb{{Cf{Gbc}}}{}}{H`{{Cf{Gbc}}}{}}9{Fl{{Cf{Gbc}}}{}}:{F`{{Cf{Gdc}}}{}}{Fl{{Cf{Gdc}}}{}}<{AHb{{Cf{Gdc}}}{}}========================={cCh{}}000000000000000000000000{{EfAj}Aj}{EfAf}0","c":[1675,2098,2099,2100,2101,2102,2103,2104,2105,2106],"p":[[5,"AddressSpace",0],[6,"IntPredicate",0],[6,"FloatPredicate",0],[6,"AtomicOrdering",0],[6,"AtomicRMWBinOp",0],[6,"OptimizationLevel",0],[6,"GlobalVisibility",0],[6,"ThreadLocalMode",0],[6,"DLLStorageClass",0],[6,"InlineAsmDialect",0],[1,"unit"],[6,"Ordering",3182],[1,"bool"],[5,"Formatter",3183],[8,"Result",3183],[1,"u16"],[6,"LLVMIntPredicate",3184],[6,"LLVMRealPredicate",3184],[6,"LLVMAtomicOrdering",3184],[6,"LLVMAtomicRMWBinOp",3184],[6,"LLVMVisibility",3184],[6,"LLVMDLLStorageClass",3184],[6,"LLVMInlineAsmDialect",3184],[10,"Hasher",3185],[6,"Option",3186],[1,"u32"],[6,"Result",3187],[5,"TypeId",3188],[5,"Attribute",253],[8,"LLVMAttributeRef",3189],[6,"AttributeLoc",253],[1,"u64"],[1,"str"],[5,"CStr",3190],[6,"AnyTypeEnum",1721],[5,"BasicBlock",295],[8,"LLVMBasicBlockRef",3189],[5,"InstructionIter",295],[5,"PointerValue",2212],[5,"ContextRef",517],[5,"InstructionValue",2212],[5,"BasicValueUse",2212],[5,"FunctionValue",2212],[5,"Builder",339],[8,"LLVMBuilderRef",3189],[5,"PointerType",1721],[6,"BuilderError",339],[6,"BasicValueEnum",2212],[1,"slice"],[10,"BasicType",1721],[10,"IntMathValue",2212],[5,"IntValue",2212],[10,"BasicValue",2212],[6,"BasicMetadataValueEnum",2212],[5,"CallSiteValue",2212],[6,"InstructionOpcode",2212],[5,"StructValue",2212],[5,"VectorValue",2212],[10,"AggregateValue",2212],[1,"i32"],[10,"FloatMathValue",2212],[5,"GlobalValue",2212],[5,"FunctionType",1721],[6,"AggregateValueEnum",2212],[10,"PointerMathValue",2212],[5,"PhiValue",2212],[1,"tuple"],[5,"DILocation",631],[5,"String",3191],[5,"Comdat",477],[8,"LLVMComdatRef",3189],[6,"ComdatSelectionKind",477],[6,"LLVMComdatSelectionKind",3192],[5,"Context",517],[10,"AsContextRef",517],[8,"LLVMContextRef",3189],[5,"IntType",1721],[1,"u8"],[5,"ArrayValue",2212],[5,"Module",1172],[5,"MemoryBuffer",1153],[5,"LLVMString",1461],[5,"FloatType",1721],[17,"Output"],[10,"FnOnce",3193],[5,"StructType",1721],[5,"MetadataValue",2212],[5,"MetadataType",1721],[5,"TargetData",1505],[6,"BasicTypeEnum",1721],[5,"VoidType",1721],[5,"DataLayout",619],[8,"c_char",3194],[10,"AsDIScope",631],[5,"DIScope",631],[5,"DIFile",631],[5,"DICompileUnit",631],[5,"DINamespace",631],[5,"DISubprogram",631],[5,"DIType",631],[5,"DIDerivedType",631],[5,"DIBasicType",631],[5,"DICompositeType",631],[5,"DILexicalBlock",631],[5,"DIGlobalVariableExpression",631],[5,"DebugInfoBuilder",631],[8,"LLVMDIBuilderRef",3189],[8,"LLVMMetadataRef",3189],[5,"DILocalVariable",631],[5,"DIExpression",631],[5,"DISubroutineType",631],[6,"DWARFEmissionKind",631],[6,"DWARFSourceLanguage",631],[1,"i64"],[5,"Range",3195],[8,"DIFlags",631],[8,"LLVMDWARFTypeEncoding",631],[5,"Vec",3196],[8,"c_uint",3197],[6,"LLVMDWARFEmissionKind",3198],[6,"LLVMDWARFSourceLanguage",3198],[5,"ExecutionEngine",1047],[10,"AnyValue",2212],[1,"usize"],[8,"LLVMExecutionEngineRef",3199],[5,"JitFunction",1047],[10,"Copy",3200],[1,"fn"],[6,"RemoveModuleError",1047],[10,"Error",3201],[10,"Clone",3202],[6,"FunctionLookupError",1047],[10,"UnsafeFunctionPointer",1047],[5,"Rc",3203],[5,"GenericValue",2212],[8,"c_int",3197],[5,"Intrinsic",1137],[8,"LLVMMemoryBufferRef",3189],[5,"Path",3204],[5,"ObjectFile",1317],[6,"FlagBehavior",1172],[6,"Linkage",1172],[8,"LLVMModuleRef",3189],[8,"LLVMPassManagerRef",3189],[10,"Borrow",3205],[5,"FunctionIterator",1172],[5,"GlobalIterator",1172],[6,"LLVMLinkage",3184],[6,"LLVMModuleFlagBehavior",3184],[5,"Ref",3206],[5,"TargetTriple",1505],[10,"AsRef",3207],[5,"PassManager",1418],[5,"TargetMachine",1505],[5,"PassBuilderOptions",1418],[5,"File",3208],[8,"LLVMObjectFileRef",3209],[5,"SectionIterator",1317],[8,"LLVMSectionIteratorRef",3209],[5,"Section",1317],[5,"RelocationIterator",1317],[8,"LLVMRelocationIteratorRef",3209],[5,"Relocation",1317],[5,"SymbolIterator",1317],[8,"LLVMSymbolIteratorRef",3209],[5,"Symbol",1317],[8,"LLVMPassBuilderOptionsRef",3210],[10,"PassManagerSubType",1418],[10,"Debug",3183],[17,"Input"],[6,"LoadLibraryError",1461],[5,"Error",3183],[5,"Target",1505],[8,"LLVMTargetRef",3211],[8,"LLVMTargetMachineRef",3211],[8,"LLVMTargetDataRef",3212],[6,"CodeModel",1505],[6,"RelocMode",1505],[6,"FileType",1505],[5,"InitializationConfig",1505],[6,"ByteOrdering",1505],[5,"TargetMachineOptions",1505],[10,"AnyType",1721],[5,"ArrayType",1721],[5,"VectorType",1721],[10,"AsTypeRef",1721],[8,"LLVMTypeRef",3189],[6,"BasicMetadataTypeEnum",1721],[6,"StringRadix",1721],[5,"FloatValue",2212],[1,"f64"],[5,"FieldTypesIter",1721],[6,"AnyValueEnum",2212],[10,"AsValueRef",2212],[8,"LLVMValueRef",3189],[6,"LLVMTailCallKind",2212],[6,"UnnamedAddress",2212],[5,"OperandIter",2212],[5,"OperandUseIter",2212],[5,"IncomingIter",2212],[5,"FieldValueIter",2212],[6,"LLVMUnnamedAddr",3184],[6,"LLVMOpcode",3184],[6,"Either",3213],[17,"BaseType"],[10,"IntMathType",1721],[10,"FloatMathType",1721],[10,"PointerMathType",1721],[8,"LLVMUseRef",3189],[10,"DIFlagsConstants",631]],"b":[[454,"impl-Debug-for-BuilderError"],[455,"impl-Display-for-BuilderError"],[555,"impl-PartialEq%3CContextRef%3C\'_%3E%3E-for-Context"],[556,"impl-PartialEq-for-Context"],[557,"impl-PartialEq-for-ContextRef%3C\'ctx%3E"],[558,"impl-PartialEq%3CContext%3E-for-ContextRef%3C\'_%3E"],[1069,"impl-JitFunction%3C\'_,+unsafe+extern+%22C%22+fn(L,+M)+-%3E+Output%3E"],[1070,"impl-JitFunction%3C\'_,+unsafe+extern+%22C%22+fn(K,+L,+M)+-%3E+Output%3E"],[1071,"impl-JitFunction%3C\'_,+unsafe+extern+%22C%22+fn(J,+K,+L,+M)+-%3E+Output%3E"],[1072,"impl-JitFunction%3C\'_,+unsafe+extern+%22C%22+fn(M)+-%3E+Output%3E"],[1073,"impl-JitFunction%3C\'_,+unsafe+extern+%22C%22+fn(I,+J,+K,+L,+M)+-%3E+Output%3E"],[1074,"impl-JitFunction%3C\'_,+unsafe+extern+%22C%22+fn(C,+D,+E,+F,+G,+H,+I,+J,+K,+L,+M)+-%3E+Output%3E"],[1075,"impl-JitFunction%3C\'_,+unsafe+extern+%22C%22+fn(F,+G,+H,+I,+J,+K,+L,+M)+-%3E+Output%3E"],[1076,"impl-JitFunction%3C\'_,+unsafe+extern+%22C%22+fn(H,+I,+J,+K,+L,+M)+-%3E+Output%3E"],[1077,"impl-JitFunction%3C\'_,+unsafe+extern+%22C%22+fn(E,+F,+G,+H,+I,+J,+K,+L,+M)+-%3E+Output%3E"],[1078,"impl-JitFunction%3C\'_,+unsafe+extern+%22C%22+fn()+-%3E+Output%3E"],[1079,"impl-JitFunction%3C\'_,+unsafe+extern+%22C%22+fn(A,+B,+C,+D,+E,+F,+G,+H,+I,+J,+K,+L,+M)+-%3E+Output%3E"],[1080,"impl-JitFunction%3C\'_,+unsafe+extern+%22C%22+fn(G,+H,+I,+J,+K,+L,+M)+-%3E+Output%3E"],[1081,"impl-JitFunction%3C\'_,+unsafe+extern+%22C%22+fn(D,+E,+F,+G,+H,+I,+J,+K,+L,+M)+-%3E+Output%3E"],[1082,"impl-JitFunction%3C\'_,+unsafe+extern+%22C%22+fn(B,+C,+D,+E,+F,+G,+H,+I,+J,+K,+L,+M)+-%3E+Output%3E"],[1093,"impl-Display-for-FunctionLookupError"],[1094,"impl-Debug-for-FunctionLookupError"],[1095,"impl-Display-for-RemoveModuleError"],[1096,"impl-Debug-for-RemoveModuleError"],[1479,"impl-Display-for-LLVMString"],[1480,"impl-Debug-for-LLVMString"],[1481,"impl-Debug-for-LoadLibraryError"],[1482,"impl-Display-for-LoadLibraryError"],[1593,"impl-Debug-for-TargetTriple"],[1594,"impl-Display-for-TargetTriple"],[1892,"impl-Display-for-ArrayType%3C\'_%3E"],[1893,"impl-Debug-for-ArrayType%3C\'ctx%3E"],[1894,"impl-Display-for-AnyTypeEnum%3C\'_%3E"],[1895,"impl-Debug-for-AnyTypeEnum%3C\'ctx%3E"],[1896,"impl-Display-for-BasicTypeEnum%3C\'_%3E"],[1897,"impl-Debug-for-BasicTypeEnum%3C\'ctx%3E"],[1898,"impl-Debug-for-BasicMetadataTypeEnum%3C\'ctx%3E"],[1899,"impl-Display-for-BasicMetadataTypeEnum%3C\'_%3E"],[1900,"impl-Display-for-FloatType%3C\'_%3E"],[1901,"impl-Debug-for-FloatType%3C\'ctx%3E"],[1902,"impl-Debug-for-FunctionType%3C\'_%3E"],[1903,"impl-Display-for-FunctionType%3C\'_%3E"],[1905,"impl-Debug-for-IntType%3C\'ctx%3E"],[1906,"impl-Display-for-IntType%3C\'_%3E"],[1907,"impl-Display-for-MetadataType%3C\'_%3E"],[1908,"impl-Debug-for-MetadataType%3C\'ctx%3E"],[1909,"impl-Debug-for-PointerType%3C\'ctx%3E"],[1910,"impl-Display-for-PointerType%3C\'_%3E"],[1911,"impl-Debug-for-StructType%3C\'ctx%3E"],[1912,"impl-Display-for-StructType%3C\'_%3E"],[1914,"impl-Debug-for-VectorType%3C\'ctx%3E"],[1915,"impl-Display-for-VectorType%3C\'_%3E"],[1916,"impl-Debug-for-VoidType%3C\'ctx%3E"],[1917,"impl-Display-for-VoidType%3C\'_%3E"],[1929,"impl-From%3CPointerType%3C\'ctx%3E%3E-for-AnyTypeEnum%3C\'ctx%3E"],[1930,"impl-From%3CVectorType%3C\'ctx%3E%3E-for-AnyTypeEnum%3C\'ctx%3E"],[1931,"impl-From%3CFloatType%3C\'ctx%3E%3E-for-AnyTypeEnum%3C\'ctx%3E"],[1933,"impl-From%3CIntType%3C\'ctx%3E%3E-for-AnyTypeEnum%3C\'ctx%3E"],[1934,"impl-From%3CArrayType%3C\'ctx%3E%3E-for-AnyTypeEnum%3C\'ctx%3E"],[1935,"impl-From%3CFunctionType%3C\'ctx%3E%3E-for-AnyTypeEnum%3C\'ctx%3E"],[1936,"impl-From%3CStructType%3C\'ctx%3E%3E-for-AnyTypeEnum%3C\'ctx%3E"],[1937,"impl-From%3CVoidType%3C\'ctx%3E%3E-for-AnyTypeEnum%3C\'ctx%3E"],[1938,"impl-From%3CIntType%3C\'ctx%3E%3E-for-BasicTypeEnum%3C\'ctx%3E"],[1939,"impl-From%3CPointerType%3C\'ctx%3E%3E-for-BasicTypeEnum%3C\'ctx%3E"],[1940,"impl-From%3CArrayType%3C\'ctx%3E%3E-for-BasicTypeEnum%3C\'ctx%3E"],[1942,"impl-From%3CFloatType%3C\'ctx%3E%3E-for-BasicTypeEnum%3C\'ctx%3E"],[1943,"impl-From%3CVectorType%3C\'ctx%3E%3E-for-BasicTypeEnum%3C\'ctx%3E"],[1944,"impl-From%3CStructType%3C\'ctx%3E%3E-for-BasicTypeEnum%3C\'ctx%3E"],[1945,"impl-From%3CVectorType%3C\'ctx%3E%3E-for-BasicMetadataTypeEnum%3C\'ctx%3E"],[1946,"impl-From%3CMetadataType%3C\'ctx%3E%3E-for-BasicMetadataTypeEnum%3C\'ctx%3E"],[1947,"impl-From%3CFloatType%3C\'ctx%3E%3E-for-BasicMetadataTypeEnum%3C\'ctx%3E"],[1948,"impl-From%3CArrayType%3C\'ctx%3E%3E-for-BasicMetadataTypeEnum%3C\'ctx%3E"],[1949,"impl-From%3CIntType%3C\'ctx%3E%3E-for-BasicMetadataTypeEnum%3C\'ctx%3E"],[1950,"impl-From%3CBasicTypeEnum%3C\'ctx%3E%3E-for-BasicMetadataTypeEnum%3C\'ctx%3E"],[1951,"impl-From%3CStructType%3C\'ctx%3E%3E-for-BasicMetadataTypeEnum%3C\'ctx%3E"],[1952,"impl-From%3CPointerType%3C\'ctx%3E%3E-for-BasicMetadataTypeEnum%3C\'ctx%3E"],[2142,"impl-TryFrom%3CBasicMetadataTypeEnum%3C\'ctx%3E%3E-for-ArrayType%3C\'ctx%3E"],[2143,"impl-TryFrom%3CAnyTypeEnum%3C\'ctx%3E%3E-for-ArrayType%3C\'ctx%3E"],[2144,"impl-TryFrom%3CBasicTypeEnum%3C\'ctx%3E%3E-for-ArrayType%3C\'ctx%3E"],[2147,"impl-TryFrom%3CBasicMetadataTypeEnum%3C\'ctx%3E%3E-for-BasicTypeEnum%3C\'ctx%3E"],[2148,"impl-TryFrom%3CAnyTypeEnum%3C\'ctx%3E%3E-for-BasicTypeEnum%3C\'ctx%3E"],[2152,"impl-TryFrom%3CBasicTypeEnum%3C\'ctx%3E%3E-for-FloatType%3C\'ctx%3E"],[2154,"impl-TryFrom%3CBasicMetadataTypeEnum%3C\'ctx%3E%3E-for-FloatType%3C\'ctx%3E"],[2155,"impl-TryFrom%3CAnyTypeEnum%3C\'ctx%3E%3E-for-FloatType%3C\'ctx%3E"],[2160,"impl-TryFrom%3CBasicMetadataTypeEnum%3C\'ctx%3E%3E-for-IntType%3C\'ctx%3E"],[2161,"impl-TryFrom%3CAnyTypeEnum%3C\'ctx%3E%3E-for-IntType%3C\'ctx%3E"],[2163,"impl-TryFrom%3CBasicTypeEnum%3C\'ctx%3E%3E-for-IntType%3C\'ctx%3E"],[2166,"impl-TryFrom%3CAnyTypeEnum%3C\'ctx%3E%3E-for-PointerType%3C\'ctx%3E"],[2167,"impl-TryFrom%3CBasicTypeEnum%3C\'ctx%3E%3E-for-PointerType%3C\'ctx%3E"],[2169,"impl-TryFrom%3CBasicMetadataTypeEnum%3C\'ctx%3E%3E-for-PointerType%3C\'ctx%3E"],[2170,"impl-TryFrom%3CAnyTypeEnum%3C\'ctx%3E%3E-for-StructType%3C\'ctx%3E"],[2172,"impl-TryFrom%3CBasicTypeEnum%3C\'ctx%3E%3E-for-StructType%3C\'ctx%3E"],[2173,"impl-TryFrom%3CBasicMetadataTypeEnum%3C\'ctx%3E%3E-for-StructType%3C\'ctx%3E"],[2175,"impl-TryFrom%3CBasicMetadataTypeEnum%3C\'ctx%3E%3E-for-VectorType%3C\'ctx%3E"],[2177,"impl-TryFrom%3CAnyTypeEnum%3C\'ctx%3E%3E-for-VectorType%3C\'ctx%3E"],[2178,"impl-TryFrom%3CBasicTypeEnum%3C\'ctx%3E%3E-for-VectorType%3C\'ctx%3E"],[2523,"impl-PartialEq%3CBasicValueEnum%3C\'ctx%3E%3E-for-ArrayValue%3C\'ctx%3E"],[2524,"impl-PartialEq%3CBasicMetadataValueEnum%3C\'ctx%3E%3E-for-ArrayValue%3C\'ctx%3E"],[2525,"impl-PartialEq%3CAggregateValueEnum%3C\'ctx%3E%3E-for-ArrayValue%3C\'ctx%3E"],[2526,"impl-PartialEq-for-ArrayValue%3C\'ctx%3E"],[2527,"impl-PartialEq%3CAnyValueEnum%3C\'ctx%3E%3E-for-ArrayValue%3C\'ctx%3E"],[2530,"impl-PartialEq%3CArrayValue%3C\'ctx%3E%3E-for-AggregateValueEnum%3C\'ctx%3E"],[2531,"impl-PartialEq%3CStructValue%3C\'ctx%3E%3E-for-AggregateValueEnum%3C\'ctx%3E"],[2532,"impl-PartialEq-for-AggregateValueEnum%3C\'ctx%3E"],[2533,"impl-PartialEq-for-AnyValueEnum%3C\'ctx%3E"],[2534,"impl-PartialEq%3CPointerValue%3C\'ctx%3E%3E-for-AnyValueEnum%3C\'ctx%3E"],[2535,"impl-PartialEq%3CVectorValue%3C\'ctx%3E%3E-for-AnyValueEnum%3C\'ctx%3E"],[2536,"impl-PartialEq%3CMetadataValue%3C\'ctx%3E%3E-for-AnyValueEnum%3C\'ctx%3E"],[2537,"impl-PartialEq%3CInstructionValue%3C\'ctx%3E%3E-for-AnyValueEnum%3C\'ctx%3E"],[2538,"impl-PartialEq%3CFloatValue%3C\'ctx%3E%3E-for-AnyValueEnum%3C\'ctx%3E"],[2539,"impl-PartialEq%3CPhiValue%3C\'ctx%3E%3E-for-AnyValueEnum%3C\'ctx%3E"],[2540,"impl-PartialEq%3CIntValue%3C\'ctx%3E%3E-for-AnyValueEnum%3C\'ctx%3E"],[2541,"impl-PartialEq%3CArrayValue%3C\'ctx%3E%3E-for-AnyValueEnum%3C\'ctx%3E"],[2542,"impl-PartialEq%3CFunctionValue%3C\'ctx%3E%3E-for-AnyValueEnum%3C\'ctx%3E"],[2543,"impl-PartialEq%3CStructValue%3C\'ctx%3E%3E-for-AnyValueEnum%3C\'ctx%3E"],[2544,"impl-PartialEq%3CStructValue%3C\'ctx%3E%3E-for-BasicValueEnum%3C\'ctx%3E"],[2545,"impl-PartialEq%3CArrayValue%3C\'ctx%3E%3E-for-BasicValueEnum%3C\'ctx%3E"],[2546,"impl-PartialEq-for-BasicValueEnum%3C\'ctx%3E"],[2547,"impl-PartialEq%3CPointerValue%3C\'ctx%3E%3E-for-BasicValueEnum%3C\'ctx%3E"],[2548,"impl-PartialEq%3CIntValue%3C\'ctx%3E%3E-for-BasicValueEnum%3C\'ctx%3E"],[2549,"impl-PartialEq%3CFloatValue%3C\'ctx%3E%3E-for-BasicValueEnum%3C\'ctx%3E"],[2550,"impl-PartialEq%3CVectorValue%3C\'ctx%3E%3E-for-BasicValueEnum%3C\'ctx%3E"],[2551,"impl-PartialEq%3CFloatValue%3C\'ctx%3E%3E-for-BasicMetadataValueEnum%3C\'ctx%3E"],[2552,"impl-PartialEq%3CStructValue%3C\'ctx%3E%3E-for-BasicMetadataValueEnum%3C\'ctx%3E"],[2553,"impl-PartialEq%3CArrayValue%3C\'ctx%3E%3E-for-BasicMetadataValueEnum%3C\'ctx%3E"],[2554,"impl-PartialEq%3CMetadataValue%3C\'ctx%3E%3E-for-BasicMetadataValueEnum%3C\'ctx%3E"],[2555,"impl-PartialEq%3CPointerValue%3C\'ctx%3E%3E-for-BasicMetadataValueEnum%3C\'ctx%3E"],[2556,"impl-PartialEq-for-BasicMetadataValueEnum%3C\'ctx%3E"],[2557,"impl-PartialEq%3CVectorValue%3C\'ctx%3E%3E-for-BasicMetadataValueEnum%3C\'ctx%3E"],[2558,"impl-PartialEq%3CIntValue%3C\'ctx%3E%3E-for-BasicMetadataValueEnum%3C\'ctx%3E"],[2559,"impl-PartialEq-for-FloatValue%3C\'ctx%3E"],[2560,"impl-PartialEq%3CBasicMetadataValueEnum%3C\'ctx%3E%3E-for-FloatValue%3C\'ctx%3E"],[2561,"impl-PartialEq%3CAnyValueEnum%3C\'ctx%3E%3E-for-FloatValue%3C\'ctx%3E"],[2562,"impl-PartialEq%3CBasicValueEnum%3C\'ctx%3E%3E-for-FloatValue%3C\'ctx%3E"],[2563,"impl-PartialEq-for-FunctionValue%3C\'ctx%3E"],[2564,"impl-PartialEq%3CAnyValueEnum%3C\'ctx%3E%3E-for-FunctionValue%3C\'ctx%3E"],[2568,"impl-PartialEq-for-InstructionValue%3C\'ctx%3E"],[2569,"impl-PartialEq%3CAnyValueEnum%3C\'ctx%3E%3E-for-InstructionValue%3C\'ctx%3E"],[2570,"impl-PartialEq%3CBasicValueEnum%3C\'ctx%3E%3E-for-IntValue%3C\'ctx%3E"],[2571,"impl-PartialEq-for-IntValue%3C\'ctx%3E"],[2572,"impl-PartialEq%3CAnyValueEnum%3C\'ctx%3E%3E-for-IntValue%3C\'ctx%3E"],[2573,"impl-PartialEq%3CBasicMetadataValueEnum%3C\'ctx%3E%3E-for-IntValue%3C\'ctx%3E"],[2574,"impl-PartialEq-for-MetadataValue%3C\'ctx%3E"],[2575,"impl-PartialEq%3CBasicMetadataValueEnum%3C\'ctx%3E%3E-for-MetadataValue%3C\'ctx%3E"],[2576,"impl-PartialEq%3CAnyValueEnum%3C\'ctx%3E%3E-for-MetadataValue%3C\'ctx%3E"],[2577,"impl-PartialEq-for-PhiValue%3C\'ctx%3E"],[2578,"impl-PartialEq%3CAnyValueEnum%3C\'ctx%3E%3E-for-PhiValue%3C\'ctx%3E"],[2579,"impl-PartialEq%3CBasicValueEnum%3C\'ctx%3E%3E-for-PointerValue%3C\'ctx%3E"],[2580,"impl-PartialEq%3CBasicMetadataValueEnum%3C\'ctx%3E%3E-for-PointerValue%3C\'ctx%3E"],[2581,"impl-PartialEq-for-PointerValue%3C\'ctx%3E"],[2582,"impl-PartialEq%3CAnyValueEnum%3C\'ctx%3E%3E-for-PointerValue%3C\'ctx%3E"],[2583,"impl-PartialEq-for-StructValue%3C\'ctx%3E"],[2584,"impl-PartialEq%3CBasicMetadataValueEnum%3C\'ctx%3E%3E-for-StructValue%3C\'ctx%3E"],[2585,"impl-PartialEq%3CAggregateValueEnum%3C\'ctx%3E%3E-for-StructValue%3C\'ctx%3E"],[2586,"impl-PartialEq%3CBasicValueEnum%3C\'ctx%3E%3E-for-StructValue%3C\'ctx%3E"],[2587,"impl-PartialEq%3CAnyValueEnum%3C\'ctx%3E%3E-for-StructValue%3C\'ctx%3E"],[2588,"impl-PartialEq%3CBasicMetadataValueEnum%3C\'ctx%3E%3E-for-VectorValue%3C\'ctx%3E"],[2589,"impl-PartialEq%3CAnyValueEnum%3C\'ctx%3E%3E-for-VectorValue%3C\'ctx%3E"],[2590,"impl-PartialEq-for-VectorValue%3C\'ctx%3E"],[2591,"impl-PartialEq%3CBasicValueEnum%3C\'ctx%3E%3E-for-VectorValue%3C\'ctx%3E"],[2595,"impl-Display-for-ArrayValue%3C\'_%3E"],[2596,"impl-Debug-for-ArrayValue%3C\'_%3E"],[2598,"impl-Display-for-CallSiteValue%3C\'_%3E"],[2599,"impl-Debug-for-CallSiteValue%3C\'ctx%3E"],[2600,"impl-Display-for-AggregateValueEnum%3C\'_%3E"],[2601,"impl-Debug-for-AggregateValueEnum%3C\'ctx%3E"],[2602,"impl-Debug-for-AnyValueEnum%3C\'ctx%3E"],[2603,"impl-Display-for-AnyValueEnum%3C\'_%3E"],[2604,"impl-Debug-for-BasicValueEnum%3C\'ctx%3E"],[2605,"impl-Display-for-BasicValueEnum%3C\'_%3E"],[2606,"impl-Display-for-BasicMetadataValueEnum%3C\'_%3E"],[2607,"impl-Debug-for-BasicMetadataValueEnum%3C\'ctx%3E"],[2608,"impl-Debug-for-FloatValue%3C\'ctx%3E"],[2609,"impl-Display-for-FloatValue%3C\'_%3E"],[2610,"impl-Display-for-FunctionValue%3C\'_%3E"],[2611,"impl-Debug-for-FunctionValue%3C\'_%3E"],[2613,"impl-Display-for-GlobalValue%3C\'_%3E"],[2614,"impl-Debug-for-GlobalValue%3C\'ctx%3E"],[2617,"impl-Display-for-InstructionValue%3C\'_%3E"],[2618,"impl-Debug-for-InstructionValue%3C\'ctx%3E"],[2621,"impl-Debug-for-IntValue%3C\'ctx%3E"],[2622,"impl-Display-for-IntValue%3C\'_%3E"],[2623,"impl-Debug-for-MetadataValue%3C\'_%3E"],[2624,"impl-Display-for-MetadataValue%3C\'_%3E"],[2625,"impl-Debug-for-PhiValue%3C\'ctx%3E"],[2626,"impl-Display-for-PhiValue%3C\'_%3E"],[2628,"impl-Display-for-PointerValue%3C\'_%3E"],[2629,"impl-Debug-for-PointerValue%3C\'ctx%3E"],[2630,"impl-Debug-for-StructValue%3C\'ctx%3E"],[2631,"impl-Display-for-StructValue%3C\'_%3E"],[2633,"impl-Debug-for-VectorValue%3C\'ctx%3E"],[2634,"impl-Display-for-VectorValue%3C\'_%3E"],[2639,"impl-From%3CArrayValue%3C\'ctx%3E%3E-for-AggregateValueEnum%3C\'ctx%3E"],[2641,"impl-From%3CStructValue%3C\'ctx%3E%3E-for-AggregateValueEnum%3C\'ctx%3E"],[2642,"impl-From%3CPointerValue%3C\'ctx%3E%3E-for-AnyValueEnum%3C\'ctx%3E"],[2643,"impl-From%3CBasicValueEnum%3C\'ctx%3E%3E-for-AnyValueEnum%3C\'ctx%3E"],[2644,"impl-From%3CMetadataValue%3C\'ctx%3E%3E-for-AnyValueEnum%3C\'ctx%3E"],[2645,"impl-From%3CPhiValue%3C\'ctx%3E%3E-for-AnyValueEnum%3C\'ctx%3E"],[2646,"impl-From%3CStructValue%3C\'ctx%3E%3E-for-AnyValueEnum%3C\'ctx%3E"],[2647,"impl-From%3CArrayValue%3C\'ctx%3E%3E-for-AnyValueEnum%3C\'ctx%3E"],[2648,"impl-From%3CVectorValue%3C\'ctx%3E%3E-for-AnyValueEnum%3C\'ctx%3E"],[2650,"impl-From%3CInstructionValue%3C\'ctx%3E%3E-for-AnyValueEnum%3C\'ctx%3E"],[2651,"impl-From%3CIntValue%3C\'ctx%3E%3E-for-AnyValueEnum%3C\'ctx%3E"],[2652,"impl-From%3CFloatValue%3C\'ctx%3E%3E-for-AnyValueEnum%3C\'ctx%3E"],[2653,"impl-From%3CFunctionValue%3C\'ctx%3E%3E-for-AnyValueEnum%3C\'ctx%3E"],[2654,"impl-From%3CArrayValue%3C\'ctx%3E%3E-for-BasicValueEnum%3C\'ctx%3E"],[2655,"impl-From%3CStructValue%3C\'ctx%3E%3E-for-BasicValueEnum%3C\'ctx%3E"],[2656,"impl-From%3CVectorValue%3C\'ctx%3E%3E-for-BasicValueEnum%3C\'ctx%3E"],[2657,"impl-From%3CIntValue%3C\'ctx%3E%3E-for-BasicValueEnum%3C\'ctx%3E"],[2659,"impl-From%3CPointerValue%3C\'ctx%3E%3E-for-BasicValueEnum%3C\'ctx%3E"],[2660,"impl-From%3CFloatValue%3C\'ctx%3E%3E-for-BasicValueEnum%3C\'ctx%3E"],[2661,"impl-From%3CPointerValue%3C\'ctx%3E%3E-for-BasicMetadataValueEnum%3C\'ctx%3E"],[2662,"impl-From%3CMetadataValue%3C\'ctx%3E%3E-for-BasicMetadataValueEnum%3C\'ctx%3E"],[2663,"impl-From%3CBasicValueEnum%3C\'ctx%3E%3E-for-BasicMetadataValueEnum%3C\'ctx%3E"],[2664,"impl-From%3CFloatValue%3C\'ctx%3E%3E-for-BasicMetadataValueEnum%3C\'ctx%3E"],[2665,"impl-From%3CVectorValue%3C\'ctx%3E%3E-for-BasicMetadataValueEnum%3C\'ctx%3E"],[2667,"impl-From%3CStructValue%3C\'ctx%3E%3E-for-BasicMetadataValueEnum%3C\'ctx%3E"],[2668,"impl-From%3CIntValue%3C\'ctx%3E%3E-for-BasicMetadataValueEnum%3C\'ctx%3E"],[2669,"impl-From%3CArrayValue%3C\'ctx%3E%3E-for-BasicMetadataValueEnum%3C\'ctx%3E"],[2939,"impl-FloatValue%3C\'ctx%3E"],[2940,"impl-FloatMathValue%3C\'ctx%3E-for-FloatValue%3C\'ctx%3E"],[2944,"impl-IntMathValue%3C\'ctx%3E-for-IntValue%3C\'ctx%3E"],[2945,"impl-IntValue%3C\'ctx%3E"],[2948,"impl-IntMathValue%3C\'ctx%3E-for-PointerValue%3C\'ctx%3E"],[2949,"impl-PointerValue%3C\'ctx%3E"],[2950,"impl-PointerMathValue%3C\'ctx%3E-for-PointerValue%3C\'ctx%3E"],[2952,"impl-PointerMathValue%3C\'ctx%3E-for-VectorValue%3C\'ctx%3E"],[2953,"impl-FloatMathValue%3C\'ctx%3E-for-VectorValue%3C\'ctx%3E"],[2954,"impl-VectorValue%3C\'ctx%3E"],[2955,"impl-IntMathValue%3C\'ctx%3E-for-VectorValue%3C\'ctx%3E"],[3073,"impl-TryFrom%3CAggregateValueEnum%3C\'ctx%3E%3E-for-ArrayValue%3C\'ctx%3E"],[3074,"impl-TryFrom%3CBasicValueEnum%3C\'ctx%3E%3E-for-ArrayValue%3C\'ctx%3E"],[3076,"impl-TryFrom%3CAnyValueEnum%3C\'ctx%3E%3E-for-ArrayValue%3C\'ctx%3E"],[3077,"impl-TryFrom%3CBasicMetadataValueEnum%3C\'ctx%3E%3E-for-ArrayValue%3C\'ctx%3E"],[3083,"impl-TryFrom%3CAnyValueEnum%3C\'ctx%3E%3E-for-BasicValueEnum%3C\'ctx%3E"],[3084,"impl-TryFrom%3CBasicMetadataValueEnum%3C\'ctx%3E%3E-for-BasicValueEnum%3C\'ctx%3E"],[3087,"impl-TryFrom%3CBasicValueEnum%3C\'ctx%3E%3E-for-FloatValue%3C\'ctx%3E"],[3089,"impl-TryFrom%3CInstructionValue%3C\'ctx%3E%3E-for-FloatValue%3C\'ctx%3E"],[3090,"impl-TryFrom%3CBasicMetadataValueEnum%3C\'ctx%3E%3E-for-FloatValue%3C\'ctx%3E"],[3091,"impl-TryFrom%3CAnyValueEnum%3C\'ctx%3E%3E-for-FloatValue%3C\'ctx%3E"],[3102,"impl-TryFrom%3CInstructionValue%3C\'ctx%3E%3E-for-IntValue%3C\'ctx%3E"],[3103,"impl-TryFrom%3CBasicMetadataValueEnum%3C\'ctx%3E%3E-for-IntValue%3C\'ctx%3E"],[3105,"impl-TryFrom%3CAnyValueEnum%3C\'ctx%3E%3E-for-IntValue%3C\'ctx%3E"],[3106,"impl-TryFrom%3CBasicValueEnum%3C\'ctx%3E%3E-for-IntValue%3C\'ctx%3E"],[3107,"impl-TryFrom%3CBasicMetadataValueEnum%3C\'ctx%3E%3E-for-MetadataValue%3C\'ctx%3E"],[3108,"impl-TryFrom%3CAnyValueEnum%3C\'ctx%3E%3E-for-MetadataValue%3C\'ctx%3E"],[3111,"impl-TryFrom%3CAnyValueEnum%3C\'ctx%3E%3E-for-PhiValue%3C\'ctx%3E"],[3112,"impl-TryFrom%3CInstructionValue%3C\'ctx%3E%3E-for-PhiValue%3C\'ctx%3E"],[3114,"impl-TryFrom%3CBasicMetadataValueEnum%3C\'ctx%3E%3E-for-PointerValue%3C\'ctx%3E"],[3116,"impl-TryFrom%3CInstructionValue%3C\'ctx%3E%3E-for-PointerValue%3C\'ctx%3E"],[3117,"impl-TryFrom%3CAnyValueEnum%3C\'ctx%3E%3E-for-PointerValue%3C\'ctx%3E"],[3118,"impl-TryFrom%3CBasicValueEnum%3C\'ctx%3E%3E-for-PointerValue%3C\'ctx%3E"],[3119,"impl-TryFrom%3CBasicValueEnum%3C\'ctx%3E%3E-for-StructValue%3C\'ctx%3E"],[3120,"impl-TryFrom%3CAnyValueEnum%3C\'ctx%3E%3E-for-StructValue%3C\'ctx%3E"],[3121,"impl-TryFrom%3CAggregateValueEnum%3C\'ctx%3E%3E-for-StructValue%3C\'ctx%3E"],[3123,"impl-TryFrom%3CBasicMetadataValueEnum%3C\'ctx%3E%3E-for-StructValue%3C\'ctx%3E"],[3125,"impl-TryFrom%3CBasicValueEnum%3C\'ctx%3E%3E-for-VectorValue%3C\'ctx%3E"],[3126,"impl-TryFrom%3CBasicMetadataValueEnum%3C\'ctx%3E%3E-for-VectorValue%3C\'ctx%3E"],[3128,"impl-TryFrom%3CAnyValueEnum%3C\'ctx%3E%3E-for-VectorValue%3C\'ctx%3E"]]}],\ ["inkwell_internals",{"doc":"These macros are only intended to be used by inkwell …","t":"XXX","n":["llvm_enum","llvm_versioned_item","llvm_versions"],"q":[[0,"inkwell_internals"]],"d":["This attribute macro allows you to decorate an enum …","This attribute is used to decorate enums, structs, or …","This macro can be used to specify version constraints for …"],"i":[0,0,0],"f":"```","c":[],"p":[],"b":[]}],\ ["is_terminal",{"doc":"is-terminal is a simple utility that answers one question:","t":"KHM","n":["IsTerminal","is_terminal","is_terminal"],"q":[[0,"is_terminal"]],"d":["Extension trait to check whether something is a terminal.","Returns true if this is a terminal.","Returns true if this is a terminal."],"i":[0,0,2],"f":"`{cbd}{db}","c":[],"p":[[1,"bool"],[10,"IsTerminal",0]],"b":[]}],\ ["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":[]}],\ -["itertools",{"doc":"Extra iterator adaptors, functions and macros.","t":"PPGPGGPPGKPPPPPPGKPPPKGPPPHNNNNHNNNNNNNNNNNNNNNNNNNNNHNNNNNNNNNNNNNNNNNHQNNNNNNNNNNNNNNNHNNNNNNNHNHNNNNNNNNNNNNHNNNNNNNHNNNNNHNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNHNNNNNNNNNNNNNNNNNNNNNNNNNNHNNHNHNNNNNNNNNNNNNNNNNNNNQNNNNNNNNHQHNNNNHNHNNNNNNNNNNNNNNNNNNNNNNNNHNNNHNNHNHNNNNNNNHNHMNNNNNNNNNNNNNNHNNNNNNNNNHNNNHMNNNNNNNNNNNNNNNHNNHHHNNNNNNNHHHNNNNNNNNNNNNNNHNNNNHNNNNNCNNNNNNNNNNNCNNNNNNNNNNNNNNNNNNNNNNNNHNNNNNNNNNNHHNNFFFFIFFFIIIIIIFFFFFFFFFIFFFIFFFIFIIIIFIFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNONNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNONNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNK","n":["Both","Continue","Diff","Done","Either","EitherOrBoth","First","FirstMismatch","FoldWhile","Itertools","Last","Left","Left","Longer","Middle","MinMax","MinMaxResult","MultiUnzip","NoElements","OneElement","Only","PeekingNext","Position","Right","Right","Shorter","all","all","all_equal","all_equal_value","all_unique","any","any","as_deref","as_deref_mut","as_mut","as_mut","as_mut","as_mut","as_mut","as_mut","as_mut","as_mut","as_pin_mut","as_pin_ref","as_ref","as_ref","as_ref","as_ref","as_ref","as_ref","as_ref","as_ref","assert_equal","at_most_one","batching","borrow","borrow","borrow","borrow","borrow","borrow","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","both","cartesian_product","cause","chain","chain","chunks","circular_tuple_windows","clone","clone","clone","clone","clone","clone","clone_from","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","cloned","cmp","coalesce","collect","collect_tuple","collect_vec","combinations","combinations_with_replacement","concat","concat","cons_tuples","consume","contains","count","counts","counts_by","dedup","dedup_by","dedup_by_with_count","dedup_with_count","deref","deref_mut","description","diff_with","dropping","dropping_back","duplicates","duplicates_by","either","either_into","either_with","enumerate","eq","eq","eq","eq","eq","equal","exactly_one","expect_left","expect_right","extend","factor_err","factor_first","factor_into_iter","factor_iter","factor_iter_mut","factor_none","factor_ok","factor_second","fill_buf","filter_map_ok","filter_ok","find","find_map","find_or_first","find_or_last","find_position","flatten_ok","flip","flip","flush","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fold","fold","fold1","fold_ok","fold_options","fold_results","fold_while","for_each","foreach","format","format_with","from","from","from","from","from","from","from","from","group_by","has_left","has_right","hash","hash","insert_both","insert_left","insert_right","interleave","interleave","interleave_shortest","intersperse","intersperse","intersperse_with","intersperse_with","into","into","into","into","into","into","into","into_future","into_group_map","into_group_map_by","into_grouping_map","into_grouping_map_by","into_inner","into_inner","into_iter","into_iter","into_left","into_option","into_right","iproduct","is_both","is_done","is_left","is_left","is_right","is_right","iter","iter_mut","iterate","izip","join","join","just_left","just_right","k_smallest","kmerge","kmerge","kmerge_by","kmerge_by","last","left","left","left_and_right","left_and_then","left_and_then","left_or","left_or_default","left_or_else","left_or_insert","left_or_insert_with","len","map","map_any","map_either","map_either_with","map_into","map_left","map_left","map_ok","map_results","map_right","map_right","max","max_set","max_set_by","max_set_by_key","merge","merge","merge_by","merge_join_by","merge_join_by","min","min_set","min_set_by","min_set_by_key","minmax","minmax_by","minmax_by_key","multi_cartesian_product","multipeek","multipeek","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multizip","next","next_back","next_tuple","nth","or","or_default","or_else","pad_using","partial_cmp","partition","partition","partition_map","partition_result","peek_nth","peeking_next","peeking_take_while","permutations","poll","position","position_max","position_max_by","position_max_by_key","position_min","position_min_by","position_min_by_key","position_minmax","position_minmax_by","position_minmax_by_key","positions","powerset","process_results","process_results","product1","put_back","put_back_n","rciter","read","read_exact","read_line","read_to_end","read_to_string","read_until","reduce","repeat_call","repeat_n","rev","rfind","rfold","right","right","right_and_then","right_and_then","right_or","right_or_default","right_or_else","right_or_insert","right_or_insert_with","seek","set_from","size_hint","sorted","sorted","sorted_by","sorted_by_cached_key","sorted_by_key","sorted_unstable","sorted_unstable","sorted_unstable_by","sorted_unstable_by_key","source","step","structs","sum1","take_while_inclusive","take_while_ref","tee","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_string","traits","tree_fold1","try_collect","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_len","tuple_combinations","tuple_windows","tuples","type_id","type_id","type_id","type_id","type_id","type_id","unfold","unique","unique_by","unwrap_left","unwrap_right","update","while_some","with_position","write","write_all","write_fmt","zip","zip_eq","zip_eq","zip_longest","Batching","Chunk","Chunks","CircularTupleWindows","Coalesce","Combinations","CombinationsWithReplacement","ConsTuples","Dedup","DedupBy","DedupByWithCount","DedupWithCount","Duplicates","DuplicatesBy","ExactlyOneError","FilterMapOk","FilterOk","FlattenOk","Format","FormatWith","Group","GroupBy","GroupingMap","GroupingMapBy","Groups","Interleave","InterleaveShortest","Intersperse","IntersperseWith","IntoChunks","Iterate","KMerge","KMergeBy","MapInto","MapOk","MapResults","Merge","MergeBy","MergeJoinBy","MultiPeek","MultiProduct","PadUsing","PeekNth","PeekingTakeWhile","Permutations","Positions","Powerset","ProcessResults","Product","PutBack","PutBackN","RcIter","RepeatCall","RepeatN","Step","TakeWhileInclusive","TakeWhileRef","Tee","TupleBuffer","TupleCombinations","TupleWindows","Tuples","Unfold","Unique","UniqueBy","Update","WhileSome","WithPosition","Zip","ZipEq","ZipLongest","aggregate","all","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","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","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","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","collect","collect","collect","collect","count","count","count","count","count","count","count","count","count","count","drop","drop","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","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","fold","fold","fold","fold","fold","fold","fold","fold","fold","fold","fold","fold","fold","fold","fold","fold","fold","fold","fold","fold","fold","fold","fold","fold","fold_first","fold_with","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","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","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into_buffer","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_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_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_iter","into_iter","into_iter","into_iter","into_iter","into_iter","into_iter","into_iter","into_iter","into_parts","k","last","last","last","max","max_by","max_by_key","min","min_by","min_by_key","minmax","minmax_by","minmax_by_key","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","n","new","next","next","next","next","next","next","next","next","next","next","next","next","next","next","next","next","next","next","next","next","next","next","next","next","next","next","next","next","next","next","next","next","next","next","next","next","next","next","next","next","next","next","next","next","next","next","next","next","next","next","next","next","next","next","next","next","next","next","next","next","next","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","next_back","next_back","next_back","next_back","next_back","next_back","next_back","next_back","next_back","next_back","next_back","next_back","next_back","next_back","next_back","next_back","next_back","next_back","next_back","next_back","next_back","next_if","next_if_eq","nth","nth","peek","peek","peek_mut","peek_nth","peek_nth_mut","peeking_next","peeking_next","peeking_next","peeking_next","peeking_next","peeking_next","product","put_back","put_back","rciter","reset_peek","rfold","rfold","rfold","rfold","size_hint","size_hint","size_hint","size_hint","size_hint","size_hint","size_hint","size_hint","size_hint","size_hint","size_hint","size_hint","size_hint","size_hint","size_hint","size_hint","size_hint","size_hint","size_hint","size_hint","size_hint","size_hint","size_hint","size_hint","size_hint","size_hint","size_hint","size_hint","size_hint","size_hint","size_hint","size_hint","size_hint","size_hint","size_hint","size_hint","size_hint","size_hint","size_hint","size_hint","size_hint","size_hint","size_hint","size_hint","size_hint","size_hint","size_hint","size_hint","size_hint","size_hint","size_hint","size_hint","size_hint","size_hint","size_hint","size_hint","size_hint","size_hint","size_hint","size_hint","size_hint","size_hint","size_hint","size_hint","size_hint","state","sum","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_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_from","try_from","try_from","try_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","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","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_value","HomogeneousTuple"],"q":[[0,"itertools"],[412,"itertools::structs"],[1879,"itertools::traits"],[1880,"core::iter::traits::collect"],[1881,"core::ops::function"],[1882,"core::iter::traits::iterator"],[1883,"core::option"],[1884,"core::result"],[1885,"core::ops::deref"],[1886,"core::ops::deref"],[1887,"core::convert"],[1888,"std::path"],[1889,"core::ffi::c_str"],[1890,"core::pin"],[1891,"core::convert"],[1892,"core::iter::adapters::chain"],[1893,"core::clone"],[1894,"core::iter::adapters::cloned"],[1895,"core::cmp"],[1896,"core::cmp"],[1897,"std::io"],[1898,"core::cmp"],[1899,"core::cmp"],[1900,"core::ops::function"],[1901,"core::fmt"],[1902,"core::iter::traits::collect"],[1903,"std::io::error"],[1904,"std::io"],[1905,"alloc::vec::into_iter"],[1906,"core::default"],[1907,"core::iter::traits::exact_size"],[1908,"core::cmp"],[1909,"core::task::wake"],[1910,"core::task::poll"],[1911,"core::future::future"],[1912,"core::iter::traits::accum"],[1913,"std::io"],[1914,"std::io"],[1915,"core::fmt"],[1916,"core::marker"]],"d":["Both values are present.","Continue folding with this value","A type returned by the diff_with function.","Fold is complete and will return this value","The enum Either with variants Left and Right is a general …","Value that either holds a single A or B, or both.","This is the first element.","The index of the first non-matching element along with …","An enum used for controlling the execution of fold_while.","An Iterator blanket implementation that provides extra …","This is the last element.","A value of type L.","Only the left value of type A is present.","The total number of elements that were in I along with the …","This is neither the first nor the last element.","More than one element in the iterator, the first element …","MinMaxResult is an enum returned by minmax.","An iterator that can be unzipped into multiple collections.","Empty iterator","Iterator with one element, so the minimum and maximum are …","This is the only element.","An iterator that allows peeking at an element before …","The first component of the value yielded by WithPosition. …","A value of type R.","Only the right value of type B is present.","The total number of elements that were in J along with the …","Test whether the predicate holds for all elements in the …","","Check whether all elements compare equal.","If there are elements and they are all equal, return a …","Check whether all elements are unique (non equal).","Test whether the predicate holds for any elements in the …","","Converts from &EitherOrBoth<A, B> to EitherOrBoth<&_, &_> …","Converts from &mut EitherOrBoth<A, B> to …","","","","","","","Convert &mut Either<L, R> to Either<&mut L, &mut R>.","Converts from &mut EitherOrBoth<A, B> to …","Convert Pin<&mut Either<L, R>> to …","Convert Pin<&Either<L, R>> to Either<Pin<&L>, Pin<&R>>, …","Convert &Either<L, R> to Either<&L, &R>.","","","","","","","Converts from &EitherOrBoth<A, B> to EitherOrBoth<&A, &B>.","Assert that two iterables produce equal sequences, with …","If the iterator yields no elements, Ok(None) will be …","A “meta iterator adaptor”. Its closure receives a …","","","","","","","","","","","","","If Both, return Some containing the left and right values. …","Return an iterator adaptor that iterates over the …","","Takes two iterables and creates a new iterator over both …","Chain zero or more iterators together into one sequence.","Return an iterable that can chunk the iterator.","Return an iterator over all windows, wrapping back to the …","","","","","","","","","","","","","","Create an iterator that clones each element from &T to T","","Return an iterator adaptor that uses the passed-in closure …","","Collects all items from the iterator into a tuple of a …",".collect_vec() is simply a type specialization of …","Return an iterator adaptor that iterates over the k-length …","Return an iterator that iterates over the k-length …","Combine all an iterator’s elements into one element by …","Combine all an iterator’s elements into one element by …","Create an iterator that maps for example iterators of …","","Returns true if the given item is present in this iterator.","","Collect the items in this iterator and return a HashMap …","Collect the items in this iterator and return a HashMap …","Remove duplicates from sections of consecutive identical …","Remove duplicates from sections of consecutive identical …","Remove duplicates from sections of consecutive identical …","Remove duplicates from sections of consecutive identical …","","","","Compares every element yielded by both i and j with the …","Consume the first n elements from the iterator eagerly, …","Consume the last n elements from the iterator eagerly, and …","Return an iterator adaptor that produces elements that …","Return an iterator adaptor that produces elements that …","Apply one of two functions depending on contents, unifying …","Convert the contained value into T","Like either, but provide some context to whichever of the …","Iterate iterable with a running index.","","","","","","Return true if both iterables produce equal sequences …","If the iterator yields exactly one element, that element …","Returns the left value","Returns the right value","","Factors out a homogenous type from an Either of Result.","Factor out a homogeneous type from an either of pairs.","Converts an Either of Iterators to be an Iterator of Either…","Borrows an Either of Iterators to be an Iterator of Eithers","Mutably borrows an Either of Iterators to be an Iterator …","Factors out None from an Either of Option.","Factors out a homogenous type from an Either of Result.","Factor out a homogeneous type from an either of pairs.","","Return an iterator adaptor that filters and transforms …","Return an iterator adaptor that filters every Result::Ok …","","","Find the value of the first element satisfying a predicate …","Find the value of the first element satisfying a predicate …","Find the position and value of the first element …","Return an iterator adaptor that flattens every Result::Ok …","Convert Either<L, R> to Either<R, L>.","Convert EitherOrBoth<A, B> to EitherOrBoth<B, A>.","","","","","","","","","Perform a fold operation over the iterable.","","Accumulator of the elements in the iterator.","Fold Result values from an iterator.","Fold Option values from an iterator.","See .fold_ok().","An iterator method that applies a function, producing a …","","Run the closure f eagerly on each element of the iterator.","Format all iterator elements, separated by sep.","Format all iterator elements, separated by sep.","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 iterable that can group iterator elements. …","If Left, or Both, return true. Otherwise, return false.","If Right, or Both, return true, otherwise, return false.","","","Set self to Both(..), containing the specified left and …","Sets the left value of this instance, and returns a …","Sets the right value of this instance, and returns a …","Create an iterator that interleaves elements in i and j.","Alternate elements from two iterators until both have run …","Alternate elements from two iterators until at least one …","Iterate iterable with a particular value inserted between …","An iterator adaptor to insert a particular value between …","Iterate iterable with a particular value created by a …","An iterator adaptor to insert a particular value created …","","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","","Return a HashMap of keys mapped to Vecs of values. Keys …","Return an Iterator on a HashMap. Keys mapped to Vecs of …","Constructs a GroupingMap to be used later with one of the …","Constructs a GroupingMap to be used later with one of the …","Extract the value of an either over two equivalent types.","Return the value in the continue or done.","","Convert the inner value to an iterator.","If Left or Both, return the left value. Otherwise, convert …","into_option creates an Option of type (T, T). The returned …","If Right or Both, return the right value. Otherwise, …","Create an iterator over the “cartesian product” of …","If Both, return true. Otherwise, return false.","Return true if self is Done, false if it is Continue.","Return true if the value is the Left variant.","If Left, return true. Otherwise, return false. Exclusive …","Return true if the value is the Right variant.","If Right, return true. Otherwise, return false. Exclusive …","Borrow the inner value as an iterator.","Mutably borrow the inner value as an iterator.","Creates a new iterator that infinitely applies function to …","Create an iterator running multiple iterators in lockstep.","Combine all iterator elements into one String, separated …","Combine all iterator elements into one String, separated …","If Left, return Some with the left value. If Right or Both…","If Right, return Some with the right value. If Left or Both…","Sort the k smallest elements into a new iterator, in …","Create an iterator that merges elements of the contained …","Return an iterator adaptor that flattens an iterator of …","Create an iterator that merges elements of the contained …","Return an iterator adaptor that flattens an iterator of …","","Convert the left side of Either<L, R> to an Option<L>.","If Left, or Both, return Some with the left value. …","Return tuple of options corresponding to the left and …","Apply the function f on the value in the Left variant if …","Apply the function f on the value a in Left(a) or …","Return left value or given value","Return left or a default","Returns left value or computes it from a closure","Returns a mutable reference to the left value. If the left …","If the left value is not present, replace it the value …","","Map f over the contained value and return the result in the","Apply the functions f and g on the value a and b …","Apply the functions f and g to the Left and Right variants …","Similar to map_either, with an added context ctx …","Convert each item of the iterator using the Into trait.","Apply the function f on the value in the Left variant if …","Apply the function f on the value a in Left(a) or …","Return an iterator adaptor that applies the provided …","See .map_ok().","Apply the function f on the value in the Right variant if …","Apply the function f on the value b in Right(b) or …","Return the maximum value of the iterable.","Return all maximum elements of an iterator.","Return all maximum elements of an iterator, as determined …","Return all maximum elements of an iterator, as determined …","Create an iterator that merges elements in i and j.","Return an iterator adaptor that merges the two base …","Return an iterator adaptor that merges the two base …","Return an iterator adaptor that merge-joins items from the …","Create an iterator that merges items from both this and …","Return the minimum value of the iterable.","Return all minimum elements of an iterator.","Return all minimum elements of an iterator, as determined …","Return all minimum elements of an iterator, as determined …","Return the minimum and maximum elements in the iterator.","Return the minimum and maximum element of an iterator, as …","Return the minimum and maximum element of an iterator, as …","Return an iterator adaptor that iterates over the …","An iterator adaptor that allows the user to peek at …","An iterator adaptor that allows the user to peek at …","Converts an iterator of tuples into a tuple of containers.","Unzip this iterator into multiple collections.","","","","","","","","","","","","","","Converts an iterator of tuples into a tuple of containers.","An iterator that generalizes .zip() and allows running …","","","Advances the iterator and returns the next items grouped …","","Returns a tuple consisting of the l and r in Both(l, r), …","Returns a tuple consisting of the l and r in Both(l, r), …","Returns a tuple consisting of the l and r in Both(l, r), …","Return an iterator adaptor that pads the sequence to a …","","Partition a sequence using predicate pred so that elements …","","Collect all iterator elements into one of two partitions. …","Partition a sequence of Results into one list of all the Ok…","A drop-in replacement for std::iter::Peekable which adds a …","Pass a reference to the next iterator element to the …","Return an iterator adaptor that borrows from this iterator …","Return an iterator adaptor that iterates over all …","","","Return the position of the maximum element in the iterator.","Return the position of the maximum element in the …","Return the position of the maximum element in the …","Return the position of the minimum element in the iterator.","Return the position of the minimum element in the …","Return the position of the minimum element in the …","Return the positions of the minimum and maximum elements in","Return the postions of the minimum and maximum elements of …","Return the postions of the minimum and maximum elements of …","Return an iterator adaptor that yields the indices of all …","Return an iterator that iterates through the powerset of …","“Lift” a function of the values of an iterator so that …","“Lift” a function of the values of the current …","Iterate over the entire iterator and multiply all the …","Create an iterator where you can put back a single item","Create an iterator where you can put back multiple values …","Return an iterator inside a Rc<RefCell<_>> wrapper.","","","","","","","Return either value of left, right, or apply a function f …","An iterator source that produces elements indefinitely by …","Create an iterator that produces n repetitions of element.","Iterate iterable in reverse.","","","Convert the right side of Either<L, R> to an Option<R>.","If Right, or Both, return Some with the right value. …","Apply the function f on the value in the Right variant if …","Apply the function f on the value b in Right(b) or …","Return right value or given value","Return right or a default","Returns right value or computes it from a closure","Returns a mutable reference to the right value. If the …","If the right value is not present, replace it the value …","","Assign to each reference in self from the from iterator, …","","Sort all iterator elements into a new iterator in …","Sort all iterator elements into a new iterator in …","Sort all iterator elements into a new iterator in …","Sort all iterator elements into a new iterator in …","Sort all iterator elements into a new iterator in …","Sort all iterator elements into a new iterator in …","Sort all iterator elements into a new iterator in …","Sort all iterator elements into a new iterator in …","Sort all iterator elements into a new iterator in …","","Return an iterator adaptor that steps n elements in the …","The concrete iterator types.","Iterate over the entire iterator and add all the elements.","Returns an iterator adaptor that consumes elements while …","Return an iterator adaptor that borrows from a Clone-able …","Split into an iterator pair that both yield all elements …","","","","","","","","Traits helpful for using certain Itertools methods in …","Accumulate the elements in the iterator in a tree-like …",".try_collect() is more convenient way of writing …","","","","","","","","","","","","","Returns the length of the iterator if one exists. …","Return an iterator adaptor that iterates over the …","Return an iterator over all contiguous windows producing …","Return an iterator that groups the items in tuples of a …","","","","","","","Creates a new unfold source with the specified closure as …","Return an iterator adaptor that filters out elements that …","Return an iterator adaptor that filters out elements that …","Returns the left value","Returns the right value","Return an iterator adaptor that applies a mutating function","Return an iterator adaptor that filters Option<A> iterator …","Return an iterator adaptor that combines each element with …","","","","Converts the arguments to iterators and zips them.","Iterate i and j in lock step.","Create an iterator which iterates over both this and the …","Create an iterator which iterates over both this and the …","A “meta iterator adaptor”. Its closure receives a …","An iterator for the elements in a single chunk.","An iterator that yields the Chunk iterators.","An iterator over all windows, wrapping back to the first …","An iterator adaptor that may join together adjacent …","An iterator to iterate through all the k-length …","An iterator to iterate through all the n-length …","An iterator that maps an iterator of tuples like …","An iterator adaptor that removes repeated duplicates.","An iterator adaptor that removes repeated duplicates, …","An iterator adaptor that removes repeated duplicates, …","An iterator adaptor that removes repeated duplicates, …","An iterator adapter to filter out duplicate elements.","An iterator adapter to filter for duplicate elements.","Iterator returned for the error case of …","An iterator adapter to filter and apply a transformation …","An iterator adapter to filter values within a nested …","An iterator adaptor that flattens Result::Ok values and …","Format all iterator elements lazily, separated by sep.","Format all iterator elements lazily, separated by sep.","An iterator for the elements in a single group.","GroupBy is the storage for the lazy grouping operation.","GroupingMap is an intermediate struct for efficient …","GroupingMapBy is an intermediate struct for efficient …","An iterator that yields the Group iterators.","An iterator adaptor that alternates elements from two …","An iterator adaptor that alternates elements from the two …","An iterator adaptor to insert a particular value between …","An iterator adaptor to insert a particular value created …","ChunkLazy is the storage for a lazy chunking operation.","An iterator that infinitely applies function to value and …","An iterator adaptor that merges an abitrary number of base …","An iterator adaptor that merges an abitrary number of base …","An iterator adapter to apply Into conversion to each …","An iterator adapter to apply a transformation within a …","See MapOk.","An iterator adaptor that merges the two base iterators in …","An iterator adaptor that merges the two base iterators in …","An iterator adaptor that merge-joins items from the two …","See multipeek() for more information.","An iterator adaptor that iterates over the cartesian …","An iterator adaptor that pads a sequence to a minimum …","See peek_nth() for more information.","An iterator adaptor that takes items while a closure …","An iterator adaptor that iterates through all the k…","An iterator adapter to get the positions of each element …","An iterator to iterate through the powerset of the …","An iterator that produces only the T values as long as the …","An iterator adaptor that iterates over the cartesian …","An iterator adaptor that allows putting back a single item …","An iterator adaptor that allows putting multiple items in …","A wrapper for Rc<RefCell<I>>, that implements the Iterator …","See repeat_call for more information.","An iterator that produces n repetitions of an element.","An iterator adaptor that steps a number elements in the …","An iterator adaptor that consumes elements while the given …","An iterator adaptor that borrows from a Clone-able iterator","One half of an iterator pair where both return the same …","An iterator over a incomplete tuple.","An iterator to iterate through all combinations in a Clone…","An iterator over all contiguous windows that produces …","An iterator that groups the items in tuples of a specific …","See unfold for more information.","An iterator adapter to filter out duplicate elements.","An iterator adapter to filter out duplicate elements.","An iterator adapter to apply a mutating function to each …","An iterator adaptor that filters Option<A> iterator …","An iterator adaptor that wraps each element in an Position.","See multizip for more information.","An iterator which iterates two other iterators …","An iterator which iterates two other iterators …","This is the generic way to perform any operation on a …","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","Groups elements from the GroupingMap source by key and …","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","Groups elements from the GroupingMap source by key and …","","","","","","","","","","Groups elements from the GroupingMap source by key and …","Groups elements from the GroupingMap source by key and …","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","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).","Return a buffer with the produced items that was not …","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","Split the PutBack into its parts.","Returns the length of a combination produced by this …","","","","Groups elements from the GroupingMap source by key and …","Groups elements from the GroupingMap source by key and …","Groups elements from the GroupingMap source by key and …","Groups elements from the GroupingMap source by key and …","Groups elements from the GroupingMap source by key and …","Groups elements from the GroupingMap source by key and …","Groups elements from the GroupingMap source by key and …","Groups elements from the GroupingMap source by key and …","Groups elements from the GroupingMap source by key and …","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","Returns the (current) length of the pool from which …","Create a new TakeWhileInclusive from an iterator and a …","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","Works exactly like the next_if method in …","Works exactly like the next_if_eq method in …","","","Works exactly like .next() with the only difference that …","Works exactly like the peek method in std::iter::Peekable","Works exactly like the peek_mut method in …","Returns a reference to the nth value without advancing the …","Returns a mutable reference to the nth value without …","","","","","","","Groups elements from the GroupingMap source by key and …","Put back a single value to the front of the iterator.","Puts x in front of the iterator. The values are yielded in …","The boxed iterator.","Reset the peeking “cursor”","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","Internal state that will be passed to the closure on the …","Groups elements from the GroupingMap source by key and …","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","put back value value (builder method)","Implemented for homogeneous tuples of size up to 12."],"i":[12,36,0,36,0,0,35,33,0,0,35,5,12,33,35,34,0,0,34,34,35,0,0,5,12,33,0,5,8,8,8,0,5,12,12,5,5,5,5,5,5,5,12,5,5,5,5,5,5,5,5,5,12,0,8,8,5,33,12,34,35,36,5,33,12,34,35,36,12,8,5,0,0,8,8,5,33,12,34,35,36,5,5,33,12,34,35,36,0,5,8,5,8,8,8,8,0,8,0,5,8,5,8,8,8,8,8,8,5,5,5,0,8,8,8,8,5,5,5,0,5,12,34,35,36,0,8,5,5,5,5,5,5,5,5,5,5,5,5,8,8,5,5,8,8,8,8,5,12,5,5,5,33,12,34,35,36,0,5,8,8,8,8,8,5,8,8,8,5,5,33,12,12,34,35,36,8,12,12,5,12,12,12,12,0,8,8,0,8,0,8,5,5,33,12,34,35,36,5,8,8,8,8,5,36,5,5,12,34,12,0,12,36,5,12,5,12,5,5,0,0,0,8,12,12,8,0,8,0,8,5,5,12,12,5,12,5,5,5,12,12,5,5,12,5,5,8,5,12,8,8,5,12,0,8,8,8,0,8,8,0,8,0,8,8,8,8,8,8,8,0,8,0,101,5,5,5,5,5,5,5,5,5,5,5,5,5,8,0,5,5,8,5,12,12,12,8,5,0,5,8,8,0,106,8,8,5,5,8,8,8,8,8,8,8,8,8,8,8,0,8,8,0,0,0,5,5,5,5,5,5,12,0,0,0,5,5,5,12,5,12,5,5,5,12,12,5,8,5,0,8,8,8,8,0,8,8,8,5,8,0,8,8,8,8,5,33,12,34,35,36,5,0,8,8,5,33,12,34,35,36,5,33,12,34,35,36,8,8,8,8,5,33,12,34,35,36,0,8,8,5,5,8,8,8,5,5,5,0,0,8,8,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,84,116,129,44,70,77,76,78,149,147,30,148,90,96,107,108,113,140,99,80,81,116,26,25,126,139,131,69,68,112,138,45,46,24,145,84,83,100,104,105,114,117,118,121,120,135,86,128,130,146,133,132,31,137,136,143,144,102,129,44,70,77,76,78,149,147,30,148,90,96,107,108,113,140,99,80,81,116,26,25,126,139,131,69,68,112,138,45,46,24,145,84,83,100,104,105,114,117,118,121,120,135,86,128,130,146,133,132,31,137,136,143,144,102,44,70,77,76,30,90,96,108,113,140,99,80,81,116,26,25,126,139,131,69,68,112,138,45,46,24,145,84,83,100,104,105,117,118,121,120,135,86,128,146,133,132,31,137,136,143,144,102,44,70,77,76,30,90,96,108,113,140,99,80,81,116,26,25,126,139,131,69,68,112,138,45,46,24,145,84,83,100,104,105,117,118,121,120,135,86,128,146,133,132,31,137,136,143,144,102,69,68,138,84,44,96,108,113,99,116,131,45,137,136,147,148,129,44,70,77,76,76,76,76,76,76,76,76,76,90,96,107,108,113,140,99,80,81,116,26,25,126,139,131,69,68,112,138,45,46,24,24,84,83,100,104,105,114,117,118,121,120,135,86,128,130,146,133,132,31,137,136,143,144,102,113,140,80,81,116,26,139,131,69,68,112,138,46,46,46,46,46,46,46,46,46,46,24,84,83,100,104,105,114,117,121,128,144,84,84,129,44,70,77,76,78,149,147,30,148,90,96,107,108,113,140,99,80,81,116,26,25,126,139,131,69,68,112,138,45,46,24,145,84,83,100,104,105,114,117,118,121,120,135,86,128,130,146,133,132,31,137,136,143,144,102,102,102,102,102,102,102,102,102,102,102,102,102,129,44,70,77,76,78,149,147,30,148,90,96,107,108,113,140,99,80,81,116,26,25,126,139,131,69,68,112,138,45,46,24,145,84,83,100,104,105,114,117,118,121,120,135,86,128,130,146,133,132,31,137,136,143,144,102,133,129,44,70,78,149,147,30,148,90,96,107,108,113,140,99,80,81,116,26,25,126,139,131,69,68,112,138,45,46,24,145,83,100,104,105,114,117,118,118,121,120,135,86,128,130,146,133,132,31,137,136,143,144,102,116,44,96,99,116,84,84,84,84,84,84,84,84,84,129,129,129,129,129,129,129,129,129,129,129,129,129,149,147,147,147,147,147,147,147,147,147,147,147,147,147,148,148,148,148,148,148,148,148,148,148,148,148,148,90,90,90,90,90,90,90,90,90,90,90,90,90,96,96,96,96,96,96,96,96,96,96,96,96,96,107,107,107,107,107,107,107,107,107,107,107,107,107,140,80,80,80,80,80,80,80,80,80,80,80,80,80,81,81,81,81,81,81,81,81,81,81,81,81,81,116,116,116,116,116,116,116,116,116,116,116,116,116,26,25,25,25,25,25,25,25,25,25,25,25,25,25,126,126,126,126,126,126,126,126,126,126,126,126,126,139,139,139,139,139,139,139,139,139,139,139,139,139,131,131,131,131,131,131,131,131,131,131,131,131,138,138,138,138,138,138,138,138,138,138,138,138,138,46,46,46,46,46,46,46,46,46,46,46,46,46,24,24,24,24,24,24,24,24,24,24,24,24,24,83,83,83,83,83,83,83,83,83,83,83,83,83,100,100,100,100,100,100,100,100,100,100,100,100,100,104,104,104,104,104,104,104,104,104,104,104,104,104,105,105,105,105,105,105,105,105,105,105,105,105,105,114,114,114,114,114,114,114,114,114,114,114,114,114,117,117,117,117,117,117,117,117,117,117,117,117,117,118,118,118,118,118,118,118,118,118,118,118,118,118,121,121,121,121,121,121,121,121,121,121,121,121,121,120,120,120,120,120,120,120,120,120,120,120,120,120,135,135,135,135,135,135,135,135,135,135,135,135,135,86,86,86,86,86,86,86,86,86,86,86,86,86,128,128,128,128,128,128,128,128,128,128,128,128,128,130,130,130,130,130,130,130,130,130,130,130,130,130,146,146,146,146,146,146,146,146,146,146,146,146,146,133,133,133,133,133,133,133,133,133,133,133,133,132,132,132,132,132,132,132,132,132,132,132,132,31,31,31,31,31,31,31,31,31,31,31,31,137,137,137,137,137,137,137,137,137,137,137,137,137,136,136,136,136,136,136,136,136,136,136,136,136,136,143,102,102,102,102,102,102,102,102,102,102,102,102,102,44,128,129,44,70,149,147,148,90,96,107,108,113,140,99,80,81,116,26,25,126,139,131,69,68,112,138,45,46,46,46,46,46,46,46,46,46,46,24,145,83,100,104,105,114,117,118,121,120,135,86,128,130,146,133,132,31,137,136,143,144,102,102,102,102,102,102,102,102,102,102,102,102,70,112,138,46,46,46,46,46,46,46,46,46,46,104,118,121,137,136,144,102,102,102,102,102,102,102,102,102,102,102,102,105,105,96,116,100,105,105,105,105,107,116,100,105,117,121,84,116,117,118,100,112,104,121,144,129,44,70,90,96,107,108,113,140,99,80,81,116,26,126,139,131,69,68,112,138,45,46,46,46,46,46,46,46,46,46,46,24,83,100,104,105,114,117,118,121,120,86,128,130,146,133,132,31,137,136,143,144,102,102,102,102,102,102,102,102,102,102,102,102,135,84,44,70,77,76,30,90,96,108,113,140,99,80,81,116,26,25,126,139,131,69,68,112,138,45,46,24,145,84,83,100,104,105,117,118,121,120,135,86,128,146,133,132,31,137,136,143,144,102,77,76,24,129,44,70,77,76,78,149,147,30,148,90,96,107,108,113,140,99,80,81,116,26,25,126,139,131,69,68,112,138,45,46,24,145,84,83,100,104,105,114,117,118,121,120,135,86,128,130,146,133,132,31,137,136,143,144,102,129,44,70,77,76,78,149,147,30,148,90,96,107,108,113,140,99,80,81,116,26,25,126,139,131,69,68,112,138,45,46,24,145,84,83,100,104,105,114,117,118,121,120,135,86,128,130,146,133,132,31,137,136,143,144,102,129,44,70,77,76,78,149,147,30,148,90,96,107,108,113,140,99,80,81,116,26,25,126,139,131,69,68,112,138,45,46,24,145,84,83,100,104,105,114,117,118,121,120,135,86,128,130,146,133,132,31,137,136,143,144,102,116,0],"f":"``````````````````````````{{ce}bd{{h{}{{f{b}}}}}}{{{j{ce}}g}bl{{l{}{{n{}}}}}{{h{}{{f{b}}}}}}{A`b}{A`{{Af{c{Ad{{Ab{cc}}}}}}}{}}132{{{Ah{ce}}}AhAjAj}{{{Ah{ce}}}AhAlAl}{{{j{ce}}}An{{B`{An}}}{{B`{An}}}}{{{j{ce}}}Bb{{B`{Bb}}}{{B`{Bb}}}}{{{j{ce}}}Bd{{B`{Bd}}}{{B`{Bd}}}}{{{j{eg}}}{{Bf{c}}}{}{{B`{{Bf{c}}}}}{{B`{{Bf{c}}}}}}{{{j{eg}}}c{}{{B`{c}}}{{B`{c}}}}{{{j{ce}}}Bh{{B`{Bh}}}{{B`{Bh}}}}{{{j{ce}}}{{j{ce}}}{}{}}{{{Ah{ce}}}{{Ah{ce}}}{}{}}{{{Bj{{j{ce}}}}}{{j{{Bj{c}}{Bj{e}}}}}{}{}}02{{{j{ce}}}An{{Bl{An}}}{{Bl{An}}}}{{{j{ce}}}Bd{{Bl{Bd}}}{{Bl{Bd}}}}{{{j{ce}}}Bh{{Bl{Bh}}}{{Bl{Bh}}}}{{{j{ce}}}Bb{{Bl{Bb}}}{{Bl{Bb}}}}{{{j{eg}}}{{Bf{c}}}{}{{Bl{{Bf{c}}}}}{{Bl{{Bf{c}}}}}}{{{j{eg}}}c{}{{Bl{c}}}{{Bl{c}}}}7{{ce}Bndd}{A`{{Af{{Ad{c}}{C`{A`}}}}}{}}{{A`e}{{Cb{A`e}}}{}{{h{A`}{{f{{Ad{c}}}}}}}}{ce{}{}}00000000000{{{Ah{ce}}}{{Ad{{Ab{ce}}}}}{}{}}{{A`c}{{Cd{A`}}}d}{{{j{ce}}}{{Ad{Cf}}}CfCf}{{ce}Chd{{d{}{{n{}}}}}}`{{A`Cj}{{Cl{A`}}}}{A`{{Cn{A`c}}}{`D`}}{{{j{ce}}}{{j{ce}}}D`D`}{{{Db{ce}}}{{Db{ce}}}ll}{{{Ah{ce}}}{{Ah{ce}}}D`D`}{{{Dd{c}}}{{Dd{c}}}D`}{DfDf}{{{Dh{c}}}{{Dh{c}}}D`}{{{j{ce}}{j{ce}}}BnD`D`}{{ce}Bn{}{}}00000{eDjD`{{d{}{{n{c}}}}}}{{{j{ce}}{j{ce}}}DlDnDn}{{A`e}{{E`{A`e}}}{}{{h{cc}{{f{{Af{c{Ab{cc}}}}}}}}}}{{{j{ce}}}gl{{l{}{{n{}}}}}Eb}{A`{{Ad{c}}}Ed}{A`{{Ef{c}}}{}}{{A`Cj}{{Eh{A`}}}}{{A`Cj}{{Ej{A`}}}}{c{}d}{A`c{}}{e{{El{c}}}{}{{d{}{{n{c}}}}}}{{{j{ce}}Cj}BnEnEn}{{A`c}bF`}{{{j{ce}}}Cjl{{l{}{{n{}}}}}}{A`{{Fb{cCj}}}{}}{{A`g}{{Fb{eCj}}}{}{FdFf}{{h{c}{{f{e}}}}}}{A`{{Fh{A`}}}}{{A`e}{{Fj{A`e}}}{}{{h{cc}{{f{b}}}}}}{{A`e}{{Fl{A`e}}}{}{{h{cc}{{f{b}}}}}}{A`{{Fn{A`}}}}{{{j{ce}}}{}Aj{{Aj{}{{G`{}}}}}}{{{j{ce}}}{}Al{{Al{}{{G`{}}}}}}{{{j{ce}}}BbCfCf}{{ceg}{{Ad{Db}}}dd{{Gb{}{{f{b}}}}}}{{A`Cj}A`}0{A`{{Gd{A`}}}}{{A`g}{{Gf{A`eg}}}{}{FdFf}{{h{c}{{f{e}}}}}}{{{j{ce}}ik}g{}{}{}{{Gh{c}{{f{g}}}}}{{Gh{e}{{f{g}}}}}}{{{j{eg}}}c{}{{Gj{c}}}{{Gj{c}}}}{{{j{ce}}gkm}i{}{}{}{}{{Gh{gc}{{f{i}}}}}{{Gh{ge}{{f{i}}}}}}{cGld}{{{j{ce}}{j{ce}}}bF`F`}{{{Ah{ce}}{Ah{ce}}}bF`F`}{{{Dd{c}}{Dd{c}}}bF`}{{DfDf}b}{{{Dh{c}}{Dh{c}}}bF`}{{ce}bdd}{A`{{Af{c{C`{A`}}}}}{}}{{{j{ce}}Bb}c{}Gn}{{{j{ce}}Bb}eGn{}}{{{j{eg}}i}Bn{}{{H`{c}}}{{H`{c}}}{{d{}{{n{c}}}}}}{{{j{{Af{ce}}{Af{ge}}}}}{{Af{{j{cg}}e}}}{}{}{}}{{{j{{Ab{ce}}{Ab{cg}}}}}{{Ab{c{j{eg}}}}}{}{}{}}{{{j{ce}}}Hbdd}{{{j{ce}}}Hb{}{}}0{{{j{{Ad{c}}{Ad{e}}}}}{{Ad{{j{ce}}}}}{}{}}{{{j{{Af{ce}}{Af{cg}}}}}{{Af{c{j{eg}}}}}{}{}{}}{{{j{{Ab{ce}}{Ab{ge}}}}}{{Ab{{j{cg}}e}}}{}{}{}}{{{j{ce}}}{{Af{{Bf{Hd}}Hf}}}EnEn}{{A`g}{{Hh{A`g}}}{}{}{{h{c}{{f{{Ad{e}}}}}}}}{{A`e}{{Hj{A`e}}}{}{{h{c}{{f{b}}}}}}{{{j{ce}}g}Adl{{l{}{{n{}}}}}{{h{}{{f{b}}}}}}{{{j{ce}}i}{{Ad{g}}}l{{l{}{{n{}}}}}{}{{h{}{{f{{Ad{g}}}}}}}}{{A`e}{{Ad{c}}}{}{{h{c}{{f{b}}}}}}0{{A`e}{{Ad{{Ab{Cjc}}}}}{}{{h{c}{{f{b}}}}}}{A`{{Hl{A`ce}}}d{}}{{{j{ce}}}{{j{ec}}}{}{}}{{{Ah{ce}}}{{Ah{ec}}}{}{}}{{{j{ce}}}{{Af{BnHf}}}HnHn}{{{j{ce}}I`}{{Af{BnIb}}}GnGn}{{{j{ce}}I`}{{Af{BnIb}}}IdId}{{{Db{ce}}I`}Ifll}{{{Ah{ce}}I`}IfGnGn}{{{Dd{c}}I`}IfGn}{{DfI`}If}{{{Dh{c}}I`}IfGn}{{ceg}ed{}{{h{e}{{f{e}}}}}}{{{j{ce}}gi}gl{{l{}{{n{}}}}}{}{{h{g}{{f{g}}}}}}{{A`e}{{Ad{c}}}{}{{h{cc}{{f{c}}}}}}{{A`cg}{{Af{ci}}}{}{}{{h{ce}{{f{c}}}}}{}}{{A`cg}{{Ad{c}}}{}{}{{h{ce}{{f{c}}}}}}1{{A`cg}{{Dh{c}}}{}{}{{h{ce}{{f{{Dh{c}}}}}}}}{{{j{ce}}g}Bnl{{l{}{{n{}}}}}h}{{A`e}Bn{}{{h{c}}}}{{A`Bb}{{Ih{A`}}}}{{A`Bbe}{{Ij{A`e}}}{}{{h{ch}{{f{If}}}}}}{cc{}}{{{Af{ce}}}{{j{ec}}}{}{}}1{{{j{ce}}}{{Ah{ce}}}{}{}}2222{{A`g}{{Il{eA`g}}}{}F`{{h{c}{{f{e}}}}}}{{{Ah{ce}}}b{}{}}0{{{j{ce}}g}BnFfFfIn}{{{Ah{ce}}g}BnFfFfIn}{{{Ah{ce}}ce}{{Ab{ce}}}{}{}}{{{Ah{ce}}c}c{}{}}{{{Ah{ce}}e}e{}{}}{{ce}J`d{{d{}{{n{}}}}}}{{A`e}{{J`{A`}}}{}{{d{}{{n{c}}}}}}{{A`e}{{Jb{A`}}}{}{{d{}{{n{c}}}}}}{cJdd}{{A`c}{{Jd{A`}}}{}}{{ce}{{Jf{e}}}d{{h{}{{f{}}}}}}{{A`e}{{Jf{A`e}}}{}{{h{}{{f{c}}}}}}{{{j{ce}}}{{Af{ec}}}{}{}}{ce{}{}}00000{c{}{}}{A`{{Fb{c{Ef{e}}}}}{FfFd}{}}{{A`g}{{Fb{e{Ef{c}}}}}{}{FfFd}{{Gb{c}{{f{e}}}}}}{A`{{Jh{A`}}}}{{A`g}{{Jj{A`g}}}{}{FfFd}{{h{c}{{f{e}}}}}}{{{j{cc}}}c{}}{{{Dh{c}}}c{}}7{{{j{ce}}}jd{{d{}{{n{}}}}}}{{{Ah{ce}}}c{}{{Gj{c}}}}{{{Dd{c}}}{{Ad{{Ab{cc}}}}}D`}{{{Ah{ec}}}c{}{{Gj{c}}}}`{{{Ah{ce}}}b{}{}}{{{Dh{c}}}b{}}{{{j{ce}}}b{}{}}202{{{j{ce}}}j{}{}}0{{ce}{{Jl{ce}}}{}{{h{c}{{f{c}}}}}}`{{cBb}Jnd}{{A`Bb}Jn}{{{Ah{ce}}}{{Ad{c}}}{}{}}{{{Ah{ce}}}{{Ad{e}}}{}{}}{{A`Cj}{{K`{c}}}{}}{cKbd}{A`Kb}{{ce}{{Kd{e}}}d`}{{A`c}{{Kd{c}}}{{h{}{{f{b}}}}}}{{{j{ce}}}Adl{{l{}{{n{}}}}}}{{{j{ce}}}{{Ad{c}}}{}{}}8{{{Ah{ce}}}{{Ab{{Ad{c}}{Ad{e}}}}}{}{}}{{{j{ce}}i}{{j{ge}}}{}{}{}{{Gh{c}{{f{{j{ge}}}}}}}}{{{Ah{ce}}i}{{Ah{ge}}}{}{}{}{{Gh{c}{{f{{Ah{ge}}}}}}}}{{{j{ce}}c}c{}{}}{{{j{ce}}}cKf{}}{{{j{ce}}g}c{}{}{{Gh{e}{{f{c}}}}}}{{{Ah{ce}}c}c{}{}}{{{Ah{ce}}g}c{}{}{{Gh{}{{f{c}}}}}}{{{j{ce}}}CjKh{{Kh{}{{n{}}}}}}{{{j{cc}}g}{{j{ee}}}{}{}{{Gh{c}{{f{e}}}}}}{{{Ah{ce}}im}{{Ah{gk}}}{}{}{}{{Gh{c}{{f{g}}}}}{}{{Gh{e}{{f{k}}}}}}{{{j{ce}}im}{{j{gk}}}{}{}{}{{Gh{c}{{f{g}}}}}{}{{Gh{e}{{f{k}}}}}}{{{j{ce}}gko}{{j{im}}}{}{}{}{}{{Gh{gc}{{f{i}}}}}{}{{Gh{ge}{{f{m}}}}}}{A`{{Kj{A`c}}}{}}{{{j{ce}}i}{{j{ge}}}{}{}{}{{Gh{c}{{f{g}}}}}}{{{Ah{ce}}i}{{Ah{ge}}}{}{}{}{{Gh{c}{{f{g}}}}}}{{A`g}{{Kl{A`g}}}{}{}{{h{c}{{f{e}}}}}}0{{{j{ce}}i}{{j{cg}}}{}{}{}{{Gh{e}{{f{g}}}}}}{{{Ah{ce}}i}{{Ah{cg}}}{}{}{}{{Gh{e}{{f{g}}}}}}{cAdd}{A`{{Ef{c}}}{}}{{A`e}{{Ef{c}}}{}{{h{cc}{{f{Dl}}}}}}{{A`g}{{Ef{c}}}{}Dn{{h{c}{{f{e}}}}}}{{ce}Knd{{d{}{{n{}}}}}}{{A`e}{{Kn{A`}}}{}{{d{}{{n{c}}}}}}{{A`eg}{{L`{A`g}}}{}{{d{}{{n{c}}}}}{{h{cc}{{f{b}}}}}}{{cei}{{Lb{i}}}dd{}{{h{}{{f{g}}}}}}{{A`ci}{{Lb{A`i}}}d{}{}{{h{e}{{f{g}}}}}}8765{A`{{Dd{c}}}{}}{{A`e}{{Dd{c}}}{}{{h{cc}{{f{Dl}}}}}}{{A`g}{{Dd{c}}}{}Ld{{h{c}{{f{e}}}}}}{A`Lf}{cLhd}{A`{{Lh{A`}}}}{ced{}}{Ljc{}}{cBn{}}{c{{Ab{egikmoAaAc}}}{}{}{}{}{}{}{}{}{}}{c{{Ab{eg}}}{}{}{}}{c{{Ab{egikm}}}{}{}{}{}{}{}}{c{{Ab{egikmoAaAcAeAgAi}}}{}{}{}{}{}{}{}{}{}{}{}{}}{c{{Ab{egi}}}{}{}{}{}}{c{{Ab{egikmoAaAcAeAg}}}{}{}{}{}{}{}{}{}{}{}{}}{c{{Ab{egikmoAaAcAe}}}{}{}{}{}{}{}{}{}{}{}}{c{{Ab{egikmo}}}{}{}{}{}{}{}{}}{c{{Ab{egik}}}{}{}{}{}{}}{c{{Ab{egikmoAaAcAeAgAiAk}}}{}{}{}{}{}{}{}{}{}{}{}{}{}}{c{{Ab{e}}}{}{}}{c{{Ab{egikmoAa}}}{}{}{}{}{}{}{}{}}{A`c{}}{c{{Ll{e}}}{}{}}{{{j{ce}}}Adl{{l{}{{n{}}}}}}{{{j{ce}}}AdLn{{Ln{}{{n{}}}}}}{A`{{Ad{c}}}Ed}{{{j{ce}}Cj}Adl{{l{}{{n{}}}}}}{{{Ah{ce}}ce}{{Ab{ce}}}{}{}}{{{Ah{ce}}}{{Ab{ce}}}KfKf}{{{Ah{ce}}gi}{{Ab{ce}}}{}{}{{Gh{}{{f{c}}}}}{{Gh{}{{f{e}}}}}}{{A`Cje}{{M`{A`e}}}{}{{h{Cj}{{f{c}}}}}}{{{j{ce}}{j{ce}}}{{Ad{Dl}}}LdLd}{{eg}Cj{}{{d{}{{n{c}}}}}{{h{c}{{f{b}}}}}}{{{j{ce}}g}{{Ab{ii}}}l{{l{}{{n{}}}}}{{h{}{{f{b}}}}}{KfH`}}{{A`i}{{Ab{km}}}{}{}{}{{h{c}{{f{{j{eg}}}}}}}{Kf{H`{e}}}{Kf{H`{g}}}}{A`{{Ab{ei}}}{}{Kf{H`{c}}}{}{Kf{H`{g}}}}{cMbd}{{Mde}{{Ad{c}}}{}{{Gh{c}{{f{b}}}}}}{{A`e}{{Mf{A`e}}}{}{{h{c}{{f{b}}}}}}{{A`Cj}{{Mh{A`}}}}{{{Bj{{j{ce}}}}Mj}MlMn{{Mn{}{{f{}}}}}}{{{j{ce}}g}{{Ad{Cj}}}l{{l{}{{n{}}}}}{{h{}{{f{b}}}}}}{A`{{Ad{Cj}}}}{{A`e}{{Ad{Cj}}}{}{{h{cc}{{f{Dl}}}}}}{{A`g}{{Ad{Cj}}}{}Dn{{h{c}{{f{e}}}}}}210{A`{{Dd{Cj}}}}{{A`e}{{Dd{Cj}}}{}{{h{cc}{{f{Dl}}}}}}{{A`g}{{Dd{Cj}}}{}Ld{{h{c}{{f{e}}}}}}{{A`e}{{N`{A`e}}}{}{{h{c}{{f{b}}}}}}{A`{{Nb{A`}}}}{{gk}{{Af{ie}}}{}{}{{d{}{{n{{Af{ce}}}}}}}{}{{Gh{{Nd{e}}}{{f{i}}}}}}{{A`g}{{Af{ec}}}{}{}{{Gh{{Nd{A`c}}}{{f{e}}}}}}{A`{{Ad{e}}}{}{{Nf{c}}}}{cNhd}{cNjd}{cNld}{{{j{ce}}{Bf{Hd}}}{{Af{CjHf}}}NnNn}{{{j{ce}}{Bf{Hd}}}{{Af{BnHf}}}NnNn}{{{j{ce}}Jn}{{Af{CjHf}}}EnEn}{{{j{ce}}{Ef{Hd}}}{{Af{CjHf}}}NnNn}{{{j{ce}}Jn}{{Af{CjHf}}}NnNn}{{{j{ce}}Hd{Ef{Hd}}}{{Af{CjHf}}}EnEn}{{{Ah{cc}}e}c{}{{Gh{cc}{{f{c}}}}}}{e{{O`{e}}}{}{{h{}{{f{c}}}}}}{{cCj}{{Ob{c}}}D`}{cOdd}{{{j{ce}}g}AdLn{{Ln{}{{n{}}}}}{{h{}{{f{b}}}}}}{{{j{ce}}gi}gLn{{Ln{}{{n{}}}}}{}{{h{g}{{f{g}}}}}}{{{j{ce}}}{{Ad{e}}}{}{}}{{{Ah{ce}}}{{Ad{e}}}{}{}}{{{j{ce}}i}{{j{cg}}}{}{}{}{{Gh{e}{{f{{j{cg}}}}}}}}{{{Ah{ce}}i}{{Ah{cg}}}{}{}{}{{Gh{e}{{f{{Ah{cg}}}}}}}}{{{j{ce}}e}e{}{}}{{{j{ce}}}e{}Kf}{{{j{ce}}g}e{}{}{{Gh{c}{{f{e}}}}}}{{{Ah{ce}}e}e{}{}}{{{Ah{ce}}g}e{}{}{{Gh{}{{f{e}}}}}}{{{j{ce}}Of}{{Af{OhHf}}}OjOj}{{A`e}Cj{}{{d{}{{n{c}}}}}}{{{j{ce}}}{{Ab{Cj{Ad{Cj}}}}}l{{l{}{{n{}}}}}}{cK`d}{A`{{K`{c}}}{}}{{A`e}{{K`{c}}}{}{{h{cc}{{f{Dl}}}}}}{{A`g}{{K`{c}}}{}Dn{{h{c}{{f{e}}}}}}03210{{{j{ce}}}{{Ad{Cf}}}CfCf}{{A`Cj}{{Ol{A`}}}}`{A`{{Ad{e}}}{}{{On{c}}}}{{A`e}{{A`{A`e}}}{}{{h{c}{{f{b}}}}}}{{A`e}{{Ab{A`e}}}{}{{h{c}{{f{b}}}}}}{A`{{Ab{{Ad{A`}}{Ad{A`}}}}}}{ce{}{}}00000{cJn{}}`{{A`e}{{Ad{c}}}{}{{h{cc}{{f{c}}}}}}{A`{{Af{ce}}}{}{}}{c{{Af{e}}}{}{}}00000000000{A`{{Af{Cj{Ab{Cj{Ad{Cj}}}}}}}}{A`{{Af{A`c}}}{{`{A`}}}}{A`{{Ah{A`c}}}Ed}{A`{{Aj{A`c}}}Ed}{cAl{}}00000{{cg}{{An{cg}}}{}{}{{h{c}{{f{{Ad{e}}}}}}}}{A`{{AA`{A`}}}}{{A`g}{{AAb{A`eg}}}{}{FdFf}{{h{c}{{f{e}}}}}}{{{j{ce}}}c{}Gn}{{{j{ce}}}eGn{}}{{A`e}{{AAd{A`e}}}{}{{h{c}}}}{A`{{AAf{A`}}}}{A`{{AAh{A`}}}}{{{j{ce}}{Bf{Hd}}}{{Af{CjHf}}}HnHn}{{{j{ce}}{Bf{Hd}}}{{Af{BnHf}}}HnHn}{{{j{ce}}AAj}{{Af{BnHf}}}HnHn}{{ce}AAldd}{{ce}AAndd}{{A`c}{{AAn{A`}}}d}{{A`c}{{AB`{A`}}}d}```````````````````````````````````````````````````````````````````````{{{Jh{g}}k}{{Fb{ci}}}{FfFd}{}{{l{}{{n{{Ab{ce}}}}}}}{}{{h{{Ad{i}}ce}{{f{{Ad{i}}}}}}}}{{{Nh{c}}g}bl{}{{h{e}{{f{b}}}}}}{ce{}{}}000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000{{{Eh{c}}}{{Eh{c}}}{D`l}}{{{Hl{gce}}}{{Hl{gce}}}d{}{{l{}{{n{{Af{ce}}}}}}D`}}{{{Ij{ce}}}{{Ij{ce}}}{}{}}{{{Ih{c}}}{{Ih{c}}}D`}{{{Cl{c}}}{{Cl{c}}}{D`l}}{{{Kd{ce}}}{{Kd{ce}}}{lD`}D`}{{{L`{ceg}}}{{L`{ceg}}}llD`}{{{Mh{c}}}{{Mh{c}}}{D`l}}{{{Nb{c}}}{{Nb{c}}}{D`l}}{{{AAh{c}}}{{AAh{c}}}{D`l}}{{{Lf{c}}}{{Lf{c}}}{lD`D`}}{{{J`{ce}}}{{J`{ce}}}D`D`}{{{Jb{ce}}}{{Jb{ce}}}{lD`}{{l{}{{n{}}}}D`}}{{{Nh{c}}}{{Nh{c}}}{lD`}}{{{Cd{ce}}}{{Cd{ce}}}{lD`}D`}{{{Cb{ce}}}{{Cb{ce}}}D`D`}{{{Ol{c}}}{{Ol{c}}}D`}{{{AAf{c}}}{{AAf{c}}}D`}{{{Af{ce}}}{{Af{ce}}}{lD`}{{`{c}}D`}}{{{Hj{ce}}}{{Hj{ce}}}D`D`}{{{Hh{ce}}}{{Hh{ce}}}D`D`}{{{N`{ce}}}{{N`{ce}}}D`D`}{{{AAd{ce}}}{{AAd{ce}}}D`D`}{{{Ej{c}}}{{Ej{c}}}{lD`}}{{{El{ec}}}{{El{ec}}}{}{D`{l{}{{n{c}}}}}}{{{C`{c}}}{{C`{c}}}{lD`}}{{{ABb{c}}}{{ABb{c}}}{lD`}}{{{Jh{c}}}{{Jh{c}}}D`}{{{Jf{ce}}}{{Jf{ce}}}{lD`}D`}{{{Lh{c}}}{{Lh{c}}}{lD`}}{{{M`{ce}}}{{M`{ce}}}D`D`}{{{Mb{c}}}{{Mb{c}}}{lD`}}{{{Nj{c}}}{{Nj{c}}}{D`l}}{{{Nl{c}}}{{Nl{c}}}{}}{{{Ob{c}}}{{Ob{c}}}D`}{{{O`{c}}}{{O`{c}}}D`}{{{An{ce}}}{{An{ce}}}D`D`}{{{Jl{ce}}}{{Jl{ce}}}D`D`}{{{A`{ce}}}{{A`{ce}}}D`D`}{{{ABd{c}}}{{ABd{c}}}{EdD`}}{{{Aj{ce}}}{{Aj{ce}}}{{l{}{{n{}}}}D`}{EdD`}}{{{Ah{ce}}}{{Ah{ce}}}{{l{}{{n{}}}}D`}{EdD`}}{{{Cn{ce}}}{{Cn{ce}}}{{l{}{{n{}}}}D`D`}{`D`D`}}{{{AAb{ceg}}}{{AAb{ceg}}}{D`l}D`D`}{{{AA`{c}}}{{AA`{c}}}{lD`}}{{{AAn{ce}}}{{AAn{ce}}}D`D`}{{{AB`{ce}}}{{AB`{ce}}}D`D`}{{{Ll{c}}}{{Ll{c}}}D`}{{ce}Bn{}{}}00000000000000000000000000000000000000000000000{{{Hj{gi}}}m{}{}{{l{}{{n{{Af{ce}}}}}}}{{h{c}{{f{b}}}}}{}{{Eb{k}}}}{{{Hh{gk}}}o{}{}{{l{}{{n{{Af{ce}}}}}}}{}{{h{c}{{f{{Ad{i}}}}}}}{}{{Eb{m}}}}{{{AAd{ce}}}ilh{}{{Eb{g}}}}{{{Jh{g}}}{{Fb{ci}}}{FfFd}{}{{l{}{{n{{Ab{ce}}}}}}}{Kf{H`{e}}}}{{{Eh{c}}}Cjl}{{{L`{ceg}}}Cjll`}{{{Mh{c}}}Cjl}{{{Nb{c}}}Cjl}{{{Lf{c}}}Cj{lD`}}{{{Nh{c}}}Cjl}{{{Af{ce}}}Cjl{{`{c}}}}{{{Ej{c}}}Cjl}{{{AAb{ceg}}}Cjl{FdFf}{{h{}{{f{e}}}}}}{{{AA`{c}}}Cjl}{{{ABf{ceg}}}Bn{}l{}}{{{ABh{c}}}Bnl}{{{Ab{ce}}I`}If{lGn}{}}{{{Eh{c}}I`}If{lGn}}{{{Hl{gce}}I`}Ifd{}{{l{}{{n{{Af{ce}}}}}}Gn}}{{{Ij{ce}}I`}Ifl{{h{h}{{f{If}}}}}}{{{Ih{c}}I`}Ifl}00000000{{{Kd{ce}}I`}If{lGn}{}}{{{L`{ceg}}I`}If{lGn}{lGn}{}}{{{Mf{ce}}I`}If{lGn}{}}{{{Mh{c}}I`}If{lGn}}{{{Nb{c}}I`}If{lGn}}{{{AAh{c}}I`}Ifl}{{{Lf{c}}I`}If{lD`Gn}}{{{J`{ce}}I`}IfGnGn}{{{Jb{ce}}I`}If{lGn}{{l{}{{n{}}}}Gn}}{{{Nh{c}}I`}If{lGn}}{{{Cd{ce}}I`}If{lGn}Gn}{{{Cb{ce}}I`}IfGn{}}{{{Ol{c}}I`}IfGn}{{{AAf{c}}I`}IfGn}{{{Af{ce}}I`}If{lGn}{{`{c}}Gn}}{{{Hj{ce}}I`}IfGn{}}{{{Hh{ce}}I`}IfGn{}}{{{N`{ce}}I`}IfGn{}}{{{AAd{ce}}I`}IfGn{}}{{{Ej{c}}I`}If{lGn}}{{{El{ec}}I`}IfGn{{l{}{{n{c}}}}Gn}}{{{C`{c}}I`}If{lGn}}{{{C`{c}}I`}Ifl}{{{Jh{c}}I`}IfGn}{{{Jf{ce}}I`}If{lGn}Gn}{{{Lh{c}}I`}If{lGn}}{{{M`{ce}}I`}IfGn{}}{{{Mb{c}}I`}If{lGn}}{{{Nd{ce}}I`}IfGnGn}{{{Nj{c}}I`}If{Gnl}}{{{Nl{c}}I`}IfGn}{{{Ob{c}}I`}IfGn}{{{O`{c}}I`}If{}}{{{An{ce}}I`}IfGn{}}{{{Jl{ce}}I`}IfGn{}}{{{A`{ce}}I`}If{lGn}{}}{{{Ad{c}}I`}If{lGn}}{{{ABd{c}}I`}If{EdGn}}{{{Aj{ce}}I`}If{{l{}{{n{}}}}Gn}{EdGn}}{{{Ah{ce}}I`}If{{l{}{{n{}}}}Gn}{EdGn}}{{{Cn{ce}}I`}If{{l{}{{n{}}}}D`Gn}{`D`Gn}}{{{AAb{ceg}}I`}If{lGn}{GnFfFd}{}}{{{AA`{c}}I`}If{lGn}}{{{AAn{ce}}I`}IfGnGn}{{{AB`{ce}}I`}IfGnGn}{{{Ll{c}}I`}IfGn}{{{Nb{c}}ei}el{}{}{{h{eg}{{f{e}}}}}}{{{AAh{c}}ei}el{}{}{{h{eg}{{f{e}}}}}}{{{J`{ce}}gk}gl{{l{}{{n{}}}}}{}{}{{h{gi}{{f{g}}}}}}{{{Jb{ce}}gk}gl{{l{}{{n{}}}}}{}{}{{h{gi}{{f{g}}}}}}{{{Nh{c}}ei}el{}{}{{h{eg}{{f{e}}}}}}{{{Cd{ce}}gk}gl{D`l}{}{}{{h{gi}{{f{g}}}}}}{{{AAf{e}}gk}g{}{{l{}{{n{{Ad{c}}}}}}}{}{}{{h{gi}{{f{g}}}}}}{{{Af{ce}}gk}gl{{`{c}}}{}{}{{h{gi}{{f{g}}}}}}{{{Hj{gi}}ko}k{}{}{{l{}{{n{{Af{ce}}}}}}}{{h{c}{{f{b}}}}}{}{}{{h{km}{{f{k}}}}}}{{{Hh{gk}}mAa}m{}{}{{l{}{{n{{Af{ce}}}}}}}{}{{h{c}{{f{{Ad{i}}}}}}}{}{}{{h{mo}{{f{m}}}}}}{{{N`{ce}}gk}gl{{h{}{{f{b}}}}}{}{}{{h{gi}{{f{g}}}}}}{{{AAd{ce}}gk}glh{}{}{{h{gi}{{f{g}}}}}}{{{El{Ac{Ab{{Ab{cegikmo}}Aa}}}}AeAi}Ae{}{}{}{}{}{}{}{}{{l{}{{n{{Ab{{Ab{cegikmo}}Aa}}}}}}}{}{}{{h{AeAg}{{f{Ae}}}}}}{{{El{m{Ab{{Ab{cegi}}k}}}}oAc}o{}{}{}{}{}{{l{}{{n{{Ab{{Ab{cegi}}k}}}}}}}{}{}{{h{oAa}{{f{o}}}}}}{{{El{k{Ab{{Ab{ceg}}i}}}}mAa}m{}{}{}{}{{l{}{{n{{Ab{{Ab{ceg}}i}}}}}}}{}{}{{h{mo}{{f{m}}}}}}{{{El{Ak{Ab{{Ab{cegikmoAaAcAeAg}}Ai}}}}AmBa}Am{}{}{}{}{}{}{}{}{}{}{}{}{{l{}{{n{{Ab{{Ab{cegikmoAaAcAeAg}}Ai}}}}}}}{}{}{{h{AmAo}{{f{Am}}}}}}{{{El{Ai{Ab{{Ab{cegikmoAaAcAe}}Ag}}}}AkAo}Ak{}{}{}{}{}{}{}{}{}{}{}{{l{}{{n{{Ab{{Ab{cegikmoAaAcAe}}Ag}}}}}}}{}{}{{h{AkAm}{{f{Ak}}}}}}{{{El{i{Ab{{Ab{ce}}g}}}}ko}k{}{}{}{{l{}{{n{{Ab{{Ab{ce}}g}}}}}}}{}{}{{h{km}{{f{k}}}}}}{{{El{Aa{Ab{{Ab{cegikm}}o}}}}AcAg}Ac{}{}{}{}{}{}{}{{l{}{{n{{Ab{{Ab{cegikm}}o}}}}}}}{}{}{{h{AcAe}{{f{Ac}}}}}}{{{El{Ae{Ab{{Ab{cegikmoAa}}Ac}}}}AgAk}Ag{}{}{}{}{}{}{}{}{}{{l{}{{n{{Ab{{Ab{cegikmoAa}}Ac}}}}}}}{}{}{{h{AgAi}{{f{Ag}}}}}}{{{El{o{Ab{{Ab{cegik}}m}}}}AaAe}Aa{}{}{}{}{}{}{{l{}{{n{{Ab{{Ab{cegik}}m}}}}}}}{}{}{{h{AaAc}{{f{Aa}}}}}}{{{El{Ag{Ab{{Ab{cegikmoAaAc}}Ae}}}}AiAm}Ai{}{}{}{}{}{}{}{}{}{}{{l{}{{n{{Ab{{Ab{cegikmoAaAc}}Ae}}}}}}}{}{}{{h{AiAk}{{f{Ai}}}}}}{{{C`{c}}ei}el{}{}{{h{eg}{{f{e}}}}}}{{{Jh{g}}ik}{{Fb{ci}}}{FfFd}{}{{l{}{{n{{Ab{ce}}}}}}}D`{{h{ice}{{f{i}}}}}}{{{Jf{ce}}gk}gl`{}{}{{h{gi}{{f{g}}}}}}{{{Lh{c}}ei}el{}{}{{h{eg}{{f{e}}}}}}{{{M`{ce}}gk}gl{{h{Cj}{{f{}}}}}{}{}{{h{gi}{{f{g}}}}}}{{{Mb{c}}ei}el{}{}{{h{eg}{{f{e}}}}}}{{{Nd{ge}}im}i{}{}{{l{}{{n{{Af{ce}}}}}}}{}{}{{h{ik}{{f{i}}}}}}{{{Nj{c}}ei}el{}{}{{h{eg}{{f{e}}}}}}{{{Ob{c}}ei}eD`{}{}{{h{eg}{{f{e}}}}}}{{{A`{ce}}gk}gl{{h{}{{f{b}}}}}{}{}{{h{gi}{{f{g}}}}}}{{{AB`{ce}}gk}gll{}{}{{h{gi}{{f{g}}}}}}{{{Jh{g}}i}{{Fb{ce}}}{FfFd}{}{{l{}{{n{{Ab{ce}}}}}}}{{h{ece}{{f{e}}}}}}{{{Jh{g}}km}{{Fb{ci}}}{FfFd}{}{{l{}{{n{{Ab{ce}}}}}}}{}{{h{ce}{{f{i}}}}}{{h{ice}{{f{i}}}}}}{cc{}}000000000000000000000000000000000000000000000000000000{{{Ab{cegikmoAaAcAeAg}}}{{Ll{Ab}}}ddddddddddd}1{{{Ab{cegikmoAaAc}}}{{Ll{Ab}}}ddddddddd}{{{Ab{cegikmoAa}}}{{Ll{Ab}}}dddddddd}{{{Ab{cegikm}}}{{Ll{Ab}}}dddddd}{{{Ab{cegi}}}{{Ll{Ab}}}dddd}{{{Ab{cegikmo}}}{{Ll{Ab}}}ddddddd}{{{Ab{ce}}}{{Ll{Ab}}}dd}{{{Ab{cegik}}}{{Ll{Ab}}}ddddd}{{{Ab{cegikmoAaAcAeAgAi}}}{{Ll{Ab}}}dddddddddddd}{{{Ab{cegikmoAaAcAe}}}{{Ll{Ab}}}dddddddddd}{{{Ab{c}}}{{Ll{Ab}}}d}{{{Ab{ceg}}}{{Ll{Ab}}}ddd}{ce{}{}}0000000000000000000000000000000000000000000000000000000{{{Aj{ce}}}{{ABd{e}}}{{l{}{{n{}}}}}Ed}111{{{Il{ceg}}}iF`l{{h{}{{f{c}}}}}{}}22{{{Cl{c}}}el{}}333333333333333333333333333333{{{Nl{c}}}{{Nl{c}}}l}4444444444444444{{{Nh{c}}}{{Ab{Adc}}}l}{{{Eh{c}}}Cjl}{{{L`{ceg}}}{{Ad{i}}}ll`{}}{{{Lf{c}}}{{Ad{e}}}{lD`}{}}{{{Nh{c}}}{{Ad{e}}}l{}}{{{Jh{g}}}{{Fb{ce}}}{FfFd}Dn{{l{}{{n{{Ab{ce}}}}}}}}{{{Jh{g}}i}{{Fb{ce}}}{FfFd}{}{{l{}{{n{{Ab{ce}}}}}}}{{h{cee}{{f{Dl}}}}}}{{{Jh{g}}k}{{Fb{ce}}}{FfFd}{}{{l{}{{n{{Ab{ce}}}}}}}Dn{{h{ce}{{f{i}}}}}}210{{{Jh{g}}}{{Fb{c{Dd{e}}}}}{FfFd}Dn{{l{}{{n{{Ab{ce}}}}}}}}{{{Jh{g}}i}{{Fb{c{Dd{e}}}}}{FfFd}{}{{l{}{{n{{Ab{ce}}}}}}}{{h{cee}{{f{Dl}}}}}}{{{Jh{g}}k}{{Fb{c{Dd{e}}}}}{FfFd}{}{{l{}{{n{{Ab{ce}}}}}}}Dn{{h{ce}{{f{i}}}}}}{c{{Ab{egi}}}{}{}{}{}}{c{{Ab{egikm}}}{}{}{}{}{}{}}{cBn{}}{c{{Ab{e}}}{}{}}{c{{Ab{eg}}}{}{}{}}{c{{Ab{egik}}}{}{}{}{}{}}{c{{Ab{egikmoAaAcAeAgAiAk}}}{}{}{}{}{}{}{}{}{}{}{}{}{}}{c{{Ab{egikmoAaAcAeAgAi}}}{}{}{}{}{}{}{}{}{}{}{}{}}{c{{Ab{egikmoAaAcAeAg}}}{}{}{}{}{}{}{}{}{}{}{}}{c{{Ab{egikmoAaAcAe}}}{}{}{}{}{}{}{}{}{}{}}{c{{Ab{egikmoAaAc}}}{}{}{}{}{}{}{}{}{}}{c{{Ab{egikmoAa}}}{}{}{}{}{}{}{}{}}{c{{Ab{egikmo}}}{}{}{}{}{}{}{}}8;4<76301589:2:7;0<68392145370126;5948:<;859<34:716025:43210;7<896804:98<7;51263769:8<;0123451:98<7;02345686:;257<1389049:543210;7<8609654321:;7<859643210;7<878654:2910;3<9:38<7;216540;81562043:97<;7123459:680<;47<89:032651<30:7124695;801;7<896:2345;25698<70:431;012345698:<77;0123456:<892:01345698<7;12345690:;7<89643210;7<85::65432109;7<896524310;:8<7210;7<83456:9:1604;3927<583;298<574016530;2918<7642645398<7;017;:98654321<051:98<76;0234848321<:906;75{{{Eh{c}}}Cjl}{{ce}{{A`{ce}}}l{{h{}{{f{b}}}}}}{{{Ab{ce}}}{{Ad{g}}}{lD`}{{h{}{{f{b}}}}}{}}{{{Eh{c}}}{{Ad{e}}}l{}}{{{Hl{gce}}}{{Ad{i}}}d{}{{l{}{{n{{Af{ce}}}}}}}{}}{{{ABj{ceg}}}{{Ad{i}}}F`l{{h{}{{f{c}}}}}{}}{{{ABf{ceg}}}{{Ad{i}}}F`l{{h{}{{f{c}}}}}{}}{{{ABh{c}}}{{Ad{e}}}l{}}{{{Kd{ce}}}{{Ad{g}}}l`{}}{{{L`{ceg}}}{{Ad{i}}}ll`{}}{{{Mf{ce}}}{{Ad{g}}}Md{{h{}{{f{b}}}}}{}}{{{Mh{c}}}{{Ad{e}}}l{}}{{{Nb{c}}}{{Ad{e}}}l{}}{{{AAh{c}}}{{Ad{e}}}l{}}{{{Lf{c}}}{{Ad{e}}}{lD`}{}}{{{J`{ce}}}{{Ad{g}}}l{{l{}{{n{}}}}}{}}{{{Jb{ce}}}{{Ad{g}}}l{{l{}{{n{}}}}}{}}{{{Nh{c}}}{{Ad{e}}}l{}}{{{Cd{ce}}}{{Ad{g}}}l{D`l}{}}{{{Cb{cg}}}{{Ad{i}}}l{}{{h{c}{{f{{Ad{e}}}}}}}{}}{{{Ol{c}}}{{Ad{e}}}l{}}{{{AAf{e}}}{{Ad{g}}}{}{{l{}{{n{{Ad{c}}}}}}}{}}{{{Af{ce}}}{{Ad{g}}}l{{`{c}}}{}}{{{Hj{gi}}}{{Ad{k}}}{}{}{{l{}{{n{{Af{ce}}}}}}}{{h{c}{{f{b}}}}}{}}{{{Hh{gk}}}{{Ad{m}}}{}{}{{l{}{{n{{Af{ce}}}}}}}{}{{h{c}{{f{{Ad{i}}}}}}}{}}{{{N`{ce}}}{{Ad{g}}}l{{h{}{{f{b}}}}}{}}{{{AAd{ce}}}{{Ad{g}}}lh{}}{{{Ej{c}}}{{Ad{e}}}l{}}{{{El{Ae{Ab{{Ab{cegikmoAa}}Ac}}}}}{{Ad{Ag}}}{}{}{}{}{}{}{}{}{}{{l{}{{n{{Ab{{Ab{cegikmoAa}}Ac}}}}}}}{}}{{{El{o{Ab{{Ab{cegik}}m}}}}}{{Ad{Aa}}}{}{}{}{}{}{}{{l{}{{n{{Ab{{Ab{cegik}}m}}}}}}}{}}{{{El{Ag{Ab{{Ab{cegikmoAaAc}}Ae}}}}}{{Ad{Ai}}}{}{}{}{}{}{}{}{}{}{}{{l{}{{n{{Ab{{Ab{cegikmoAaAc}}Ae}}}}}}}{}}{{{El{i{Ab{{Ab{ce}}g}}}}}{{Ad{k}}}{}{}{}{{l{}{{n{{Ab{{Ab{ce}}g}}}}}}}{}}{{{El{Ac{Ab{{Ab{cegikmo}}Aa}}}}}{{Ad{Ae}}}{}{}{}{}{}{}{}{}{{l{}{{n{{Ab{{Ab{cegikmo}}Aa}}}}}}}{}}{{{El{Ai{Ab{{Ab{cegikmoAaAcAe}}Ag}}}}}{{Ad{Ak}}}{}{}{}{}{}{}{}{}{}{}{}{{l{}{{n{{Ab{{Ab{cegikmoAaAcAe}}Ag}}}}}}}{}}{{{El{m{Ab{{Ab{cegi}}k}}}}}{{Ad{o}}}{}{}{}{}{}{{l{}{{n{{Ab{{Ab{cegi}}k}}}}}}}{}}{{{El{Ak{Ab{{Ab{cegikmoAaAcAeAg}}Ai}}}}}{{Ad{Am}}}{}{}{}{}{}{}{}{}{}{}{}{}{{l{}{{n{{Ab{{Ab{cegikmoAaAcAeAg}}Ai}}}}}}}{}}{{{El{k{Ab{{Ab{ceg}}i}}}}}{{Ad{m}}}{}{}{}{}{{l{}{{n{{Ab{{Ab{ceg}}i}}}}}}}{}}{{{El{Aa{Ab{{Ab{cegikm}}o}}}}}{{Ad{Ac}}}{}{}{}{}{}{}{}{{l{}{{n{{Ab{{Ab{cegikm}}o}}}}}}}{}}{{{C`{c}}}{{Ad{e}}}l{}}{{{ABb{c}}}{{Ad{e}}}l{}}{{{Jf{ce}}}{{Ad{g}}}l`{}}{{{Lh{c}}}{{Ad{e}}}l{}}{{{M`{ce}}}{{Ad{g}}}l{{h{Cj}{{f{}}}}}{}}{{{Mb{c}}}{{Ad{e}}}l{}}{{{Nd{ge}}}{{Ad{i}}}{}{}{{l{}{{n{{Af{ce}}}}}}}{}}{{{Nj{c}}}{{Ad{e}}}l{}}{{{Nl{e}}}{{Ad{g}}}{}{{l{}{{n{c}}}}}{}}{{{Ob{c}}}{{Ad{e}}}D`{}}{{{O`{e}}}{{Ad{g}}}{}{{h{}{{f{c}}}}}{}}{{{An{cg}}}{{Ad{i}}}{}{}{{h{c}{{f{{Ad{e}}}}}}}{}}{{{Jl{ce}}}{{Ad{g}}}{}{{h{c}{{f{c}}}}}{}}{{{A`{ce}}}{{Ad{g}}}l{{h{}{{f{b}}}}}{}}{{{Ad{c}}}{{Ad{e}}}l{}}{{{ABd{c}}}{{Ad{e}}}Ed{}}{{{Aj{ce}}}{{Ad{g}}}{{l{}{{n{}}}}}Ed{}}{{{Ah{ce}}}{{Ad{g}}}{{l{}{{n{}}}}}{EdD`}{}}{{{Cn{ce}}}{{Ad{g}}}{{l{}{{n{}}}}D`}{`D`}{}}{{{AAb{ceg}}}{{Ad{i}}}l{FdFf}{{h{}{{f{e}}}}}{}}{{{AA`{c}}}{{Ad{e}}}l{}}{{{AAn{ce}}}{{Ad{g}}}ll{}}{{{AB`{ce}}}{{Ad{g}}}ll{}}{{{Ll{{Ab{c}}}}}{{Ad{e}}}l{}}{{{Ll{{Ab{cegikmoAaAcAeAg}}}}}{{Ad{Ai}}}lllllllllll{}}{{{Ll{{Ab{ceg}}}}}{{Ad{i}}}lll{}}{{{Ll{{Ab{cegik}}}}}{{Ad{m}}}lllll{}}{{{Ll{{Ab{cegikmoAa}}}}}{{Ad{Ac}}}llllllll{}}{{{Ll{{Ab{cegi}}}}}{{Ad{k}}}llll{}}{{{Ll{{Ab{cegikm}}}}}{{Ad{o}}}llllll{}}{{{Ll{{Ab{cegikmo}}}}}{{Ad{Aa}}}lllllll{}}{{{Ll{{Ab{ce}}}}}{{Ad{g}}}ll{}}{{{Ll{{Ab{cegikmoAaAcAeAgAi}}}}}{{Ad{Ak}}}llllllllllll{}}{{{Ll{{Ab{cegikmoAaAcAe}}}}}{{Ad{Ag}}}llllllllll{}}{{{Ll{{Ab{cegikmoAaAc}}}}}{{Ad{Ae}}}lllllllll{}}{{{Hl{gce}}}{{Ad{i}}}d{}{{Ln{}{{n{{Af{ce}}}}}}}{}}{{{N`{ce}}}{{Ad{g}}}{LnKh}{{h{}{{f{b}}}}}{}}{{{AAd{ce}}}{{Ad{g}}}Lnh{}}{{{El{m{Ab{{Ab{cegi}}k}}}}}{{Ad{o}}}{}{}{}{}{}{{Ln{}{{n{{Ab{{Ab{cegi}}k}}}}}}}{}}{{{El{i{Ab{{Ab{ce}}g}}}}}{{Ad{k}}}{}{}{}{{Ln{}{{n{{Ab{{Ab{ce}}g}}}}}}}{}}{{{El{Ak{Ab{{Ab{cegikmoAaAcAeAg}}Ai}}}}}{{Ad{Am}}}{}{}{}{}{}{}{}{}{}{}{}{}{{Ln{}{{n{{Ab{{Ab{cegikmoAaAcAeAg}}Ai}}}}}}}{}}{{{El{Ac{Ab{{Ab{cegikmo}}Aa}}}}}{{Ad{Ae}}}{}{}{}{}{}{}{}{}{{Ln{}{{n{{Ab{{Ab{cegikmo}}Aa}}}}}}}{}}{{{El{Ae{Ab{{Ab{cegikmoAa}}Ac}}}}}{{Ad{Ag}}}{}{}{}{}{}{}{}{}{}{{Ln{}{{n{{Ab{{Ab{cegikmoAa}}Ac}}}}}}}{}}{{{El{k{Ab{{Ab{ceg}}i}}}}}{{Ad{m}}}{}{}{}{}{{Ln{}{{n{{Ab{{Ab{ceg}}i}}}}}}}{}}{{{El{Aa{Ab{{Ab{cegikm}}o}}}}}{{Ad{Ac}}}{}{}{}{}{}{}{}{{Ln{}{{n{{Ab{{Ab{cegikm}}o}}}}}}}{}}{{{El{Ag{Ab{{Ab{cegikmoAaAc}}Ae}}}}}{{Ad{Ai}}}{}{}{}{}{}{}{}{}{}{}{{Ln{}{{n{{Ab{{Ab{cegikmoAaAc}}Ae}}}}}}}{}}{{{El{Ai{Ab{{Ab{cegikmoAaAcAe}}Ag}}}}}{{Ad{Ak}}}{}{}{}{}{}{}{}{}{}{}{}{{Ln{}{{n{{Ab{{Ab{cegikmoAaAcAe}}Ag}}}}}}}{}}{{{El{o{Ab{{Ab{cegik}}m}}}}}{{Ad{Aa}}}{}{}{}{}{}{}{{Ln{}{{n{{Ab{{Ab{cegik}}m}}}}}}}{}}{{{M`{ce}}}{{Ad{g}}}{LnKh}{{h{Cj}{{f{}}}}}{}}{{{Nl{c}}}{{Ad{e}}}Ln{}}{{{Ob{c}}}{{Ad{e}}}D`{}}{{{AAb{ceg}}}{{Ad{i}}}Ln{FdFf}{{h{}{{f{e}}}}}{}}{{{AA`{c}}}{{Ad{e}}}Ln{}}{{{AB`{ce}}}{{Ad{g}}}{LnKh}{LnKh}{}}{{{Ll{{Ab{cegikmoAaAcAeAgAi}}}}}{{Ad{Ak}}}{LnKh}{LnKh}{LnKh}{LnKh}{LnKh}{LnKh}{LnKh}{LnKh}{LnKh}{LnKh}{LnKh}{LnKh}{}}{{{Ll{{Ab{cegikmoAaAc}}}}}{{Ad{Ae}}}{LnKh}{LnKh}{LnKh}{LnKh}{LnKh}{LnKh}{LnKh}{LnKh}{LnKh}{}}{{{Ll{{Ab{cegikmoAaAcAeAg}}}}}{{Ad{Ai}}}{LnKh}{LnKh}{LnKh}{LnKh}{LnKh}{LnKh}{LnKh}{LnKh}{LnKh}{LnKh}{LnKh}{}}{{{Ll{{Ab{cegikm}}}}}{{Ad{o}}}{LnKh}{LnKh}{LnKh}{LnKh}{LnKh}{LnKh}{}}{{{Ll{{Ab{cegikmoAaAcAe}}}}}{{Ad{Ag}}}{LnKh}{LnKh}{LnKh}{LnKh}{LnKh}{LnKh}{LnKh}{LnKh}{LnKh}{LnKh}{}}{{{Ll{{Ab{ceg}}}}}{{Ad{i}}}{LnKh}{LnKh}{LnKh}{}}{{{Ll{{Ab{ce}}}}}{{Ad{g}}}{LnKh}{LnKh}{}}{{{Ll{{Ab{c}}}}}{{Ad{e}}}{LnKh}{}}{{{Ll{{Ab{cegi}}}}}{{Ad{k}}}{LnKh}{LnKh}{LnKh}{LnKh}{}}{{{Ll{{Ab{cegikmoAa}}}}}{{Ad{Ac}}}{LnKh}{LnKh}{LnKh}{LnKh}{LnKh}{LnKh}{LnKh}{LnKh}{}}{{{Ll{{Ab{cegikmo}}}}}{{Ad{Aa}}}{LnKh}{LnKh}{LnKh}{LnKh}{LnKh}{LnKh}{LnKh}{}}{{{Ll{{Ab{cegik}}}}}{{Ad{m}}}{LnKh}{LnKh}{LnKh}{LnKh}{LnKh}{}}{{{Mb{c}}e}Adl{{Gh{}{{f{b}}}}}}{{{Mb{c}}e}AdlABl}{{{L`{ceg}}Cj}{{Ad{i}}}ll`{}}{{{Nh{c}}Cj}{{Ad{e}}}l{}}{{{Lh{c}}}Adl}{{{Mb{c}}}Adl}0{{{Mb{c}}Cj}Adl}0{{{Mf{ce}}i}{{Ad{g}}}Md{{h{}{{f{b}}}}}{}{{Gh{g}{{f{b}}}}}}{{{Nh{c}}g}{{Ad{e}}}l{}{{Gh{e}{{f{b}}}}}}{{{Lh{c}}g}{{Ad{e}}}l{}{{Gh{e}{{f{b}}}}}}{{{Mb{c}}g}{{Ad{e}}}l{}{{Gh{e}{{f{b}}}}}}{{{Nj{c}}g}{{Ad{e}}}l{}{{Gh{e}{{f{b}}}}}}{{{Ob{c}}g}{{Ad{e}}}D`{}{{Gh{e}{{f{b}}}}}}{{{Jh{g}}}{{Fb{ce}}}{FfFd}{}{{l{}{{n{{Ab{ce}}}}}}}}{{{Nh{c}}}Bnl}{{{Nj{c}}}Bnl}`{{{Lh{c}}}Bnl}{{{N`{ce}}gk}g{LnKh}{{h{}{{f{b}}}}}{}{}{{h{gi}{{f{g}}}}}}{{{M`{ce}}gk}g{LnKh}{{h{Cj}{{f{}}}}}{}{}{{h{gi}{{f{g}}}}}}{{{Ob{c}}ei}eD`{}{}{{h{eg}{{f{e}}}}}}{{{AB`{ce}}gk}g{LnKh}{LnKh}{}{}{{h{gi}{{f{g}}}}}}{{{Ab{ce}}}{{Ab{Cj{Ad{Cj}}}}}{lD`}{{h{}{{f{b}}}}}}{{{Eh{c}}}{{Ab{Cj{Ad{Cj}}}}}l}{{{Hl{gce}}}{{Ab{Cj{Ad{Cj}}}}}d{}{{l{}{{n{{Af{ce}}}}}}}}{{{Kd{ce}}}{{Ab{Cj{Ad{Cj}}}}}l`}{{{L`{ceg}}}{{Ab{Cj{Ad{Cj}}}}}ll`}{{{Mf{ce}}}{{Ab{Cj{Ad{Cj}}}}}Md{{h{}{{f{b}}}}}}{{{Mh{c}}}{{Ab{Cj{Ad{Cj}}}}}l}{{{Nb{c}}}{{Ab{Cj{Ad{Cj}}}}}l}{{{AAh{c}}}{{Ab{Cj{Ad{Cj}}}}}l}{{{Lf{c}}}{{Ab{Cj{Ad{Cj}}}}}{lD`}}{{{J`{ce}}}{{Ab{Cj{Ad{Cj}}}}}l{{l{}{{n{}}}}}}{{{Jb{ce}}}{{Ab{Cj{Ad{Cj}}}}}l{{l{}{{n{}}}}}}{{{Nh{c}}}{{Ab{Cj{Ad{Cj}}}}}l}{{{Cd{ce}}}{{Ab{Cj{Ad{Cj}}}}}l{D`l}}{{{Ol{c}}}{{Ab{Cj{Ad{Cj}}}}}l}{{{AAf{e}}}{{Ab{Cj{Ad{Cj}}}}}{}{{l{}{{n{{Ad{c}}}}}}}}{{{Af{ce}}}{{Ab{Cj{Ad{Cj}}}}}l{{`{c}}}}{{{Hj{gi}}}{{Ab{Cj{Ad{Cj}}}}}{}{}{{l{}{{n{{Af{ce}}}}}}}{{h{c}{{f{b}}}}}}{{{Hh{gk}}}{{Ab{Cj{Ad{Cj}}}}}{}{}{{l{}{{n{{Af{ce}}}}}}}{}{{h{c}{{f{{Ad{i}}}}}}}}{{{N`{ce}}}{{Ab{Cj{Ad{Cj}}}}}l{{h{}{{f{b}}}}}}{{{AAd{ce}}}{{Ab{Cj{Ad{Cj}}}}}lh}{{{Ej{c}}}{{Ab{Cj{Ad{Cj}}}}}l}{{{El{Ac{Ab{{Ab{cegikmo}}Aa}}}}}{{Ab{Cj{Ad{Cj}}}}}{}{}{}{}{}{}{}{}{{l{}{{n{{Ab{{Ab{cegikmo}}Aa}}}}}}}}{{{El{Ak{Ab{{Ab{cegikmoAaAcAeAg}}Ai}}}}}{{Ab{Cj{Ad{Cj}}}}}{}{}{}{}{}{}{}{}{}{}{}{}{{l{}{{n{{Ab{{Ab{cegikmoAaAcAeAg}}Ai}}}}}}}}{{{El{k{Ab{{Ab{ceg}}i}}}}}{{Ab{Cj{Ad{Cj}}}}}{}{}{}{}{{l{}{{n{{Ab{{Ab{ceg}}i}}}}}}}}{{{El{Ag{Ab{{Ab{cegikmoAaAc}}Ae}}}}}{{Ab{Cj{Ad{Cj}}}}}{}{}{}{}{}{}{}{}{}{}{{l{}{{n{{Ab{{Ab{cegikmoAaAc}}Ae}}}}}}}}{{{El{Ai{Ab{{Ab{cegikmoAaAcAe}}Ag}}}}}{{Ab{Cj{Ad{Cj}}}}}{}{}{}{}{}{}{}{}{}{}{}{{l{}{{n{{Ab{{Ab{cegikmoAaAcAe}}Ag}}}}}}}}{{{El{o{Ab{{Ab{cegik}}m}}}}}{{Ab{Cj{Ad{Cj}}}}}{}{}{}{}{}{}{{l{}{{n{{Ab{{Ab{cegik}}m}}}}}}}}{{{El{i{Ab{{Ab{ce}}g}}}}}{{Ab{Cj{Ad{Cj}}}}}{}{}{}{{l{}{{n{{Ab{{Ab{ce}}g}}}}}}}}{{{El{m{Ab{{Ab{cegi}}k}}}}}{{Ab{Cj{Ad{Cj}}}}}{}{}{}{}{}{{l{}{{n{{Ab{{Ab{cegi}}k}}}}}}}}{{{El{Ae{Ab{{Ab{cegikmoAa}}Ac}}}}}{{Ab{Cj{Ad{Cj}}}}}{}{}{}{}{}{}{}{}{}{{l{}{{n{{Ab{{Ab{cegikmoAa}}Ac}}}}}}}}{{{El{Aa{Ab{{Ab{cegikm}}o}}}}}{{Ab{Cj{Ad{Cj}}}}}{}{}{}{}{}{}{}{{l{}{{n{{Ab{{Ab{cegikm}}o}}}}}}}}{{{C`{c}}}{{Ab{Cj{Ad{Cj}}}}}l}{{{Jf{ce}}}{{Ab{Cj{Ad{Cj}}}}}l`}{{{Lh{c}}}{{Ab{Cj{Ad{Cj}}}}}l}{{{M`{ce}}}{{Ab{Cj{Ad{Cj}}}}}l{{h{Cj}{{f{}}}}}}{{{Mb{c}}}{{Ab{Cj{Ad{Cj}}}}}l}{{{Nd{ge}}}{{Ab{Cj{Ad{Cj}}}}}{}{}{{l{}{{n{{Af{ce}}}}}}}}{{{Nj{c}}}{{Ab{Cj{Ad{Cj}}}}}l}{{{Nl{e}}}{{Ab{Cj{Ad{Cj}}}}}{}{{l{}{{n{c}}}}}}{{{Ob{c}}}{{Ab{Cj{Ad{Cj}}}}}D`}{{{O`{e}}}{{Ab{Cj{Ad{Cj}}}}}{}{{h{}{{f{c}}}}}}{{{Jl{ce}}}{{Ab{Cj{Ad{Cj}}}}}{}{{h{c}{{f{c}}}}}}{{{A`{ce}}}{{Ab{Cj{Ad{Cj}}}}}l{{h{}{{f{b}}}}}}{{{Ad{c}}}{{Ab{Cj{Ad{Cj}}}}}l}{{{ABd{c}}}{{Ab{Cj{Ad{Cj}}}}}Ed}{{{Aj{ce}}}{{Ab{Cj{Ad{Cj}}}}}{{l{}{{n{}}}}}Ed}{{{Ah{ce}}}{{Ab{Cj{Ad{Cj}}}}}{{l{}{{n{}}}}}{EdD`}}{{{Cn{ce}}}{{Ab{Cj{Ad{Cj}}}}}{{l{}{{n{}}}}D`}{`D`}}{{{AAb{ceg}}}{{Ab{Cj{Ad{Cj}}}}}l{FdFf}{{h{}{{f{e}}}}}}{{{AA`{c}}}{{Ab{Cj{Ad{Cj}}}}}l}{{{AAn{ce}}}{{Ab{Cj{Ad{Cj}}}}}ll}{{{AB`{ce}}}{{Ab{Cj{Ad{Cj}}}}}ll}{{{Ll{{Ab{ceg}}}}}{{Ab{Cj{Ad{Cj}}}}}lll}{{{Ll{{Ab{cegikmoAaAcAe}}}}}{{Ab{Cj{Ad{Cj}}}}}llllllllll}{{{Ll{{Ab{c}}}}}{{Ab{Cj{Ad{Cj}}}}}l}{{{Ll{{Ab{cegikmoAaAc}}}}}{{Ab{Cj{Ad{Cj}}}}}lllllllll}{{{Ll{{Ab{cegikmo}}}}}{{Ab{Cj{Ad{Cj}}}}}lllllll}{{{Ll{{Ab{cegikmoAaAcAeAgAi}}}}}{{Ab{Cj{Ad{Cj}}}}}llllllllllll}{{{Ll{{Ab{ce}}}}}{{Ab{Cj{Ad{Cj}}}}}ll}{{{Ll{{Ab{cegik}}}}}{{Ab{Cj{Ad{Cj}}}}}lllll}{{{Ll{{Ab{cegikmoAaAcAeAg}}}}}{{Ab{Cj{Ad{Cj}}}}}lllllllllll}{{{Ll{{Ab{cegikmoAa}}}}}{{Ab{Cj{Ad{Cj}}}}}llllllll}{{{Ll{{Ab{cegi}}}}}{{Ab{Cj{Ad{Cj}}}}}llll}{{{Ll{{Ab{cegikm}}}}}{{Ab{Cj{Ad{Cj}}}}}llllll}`{{{Jh{g}}}{{Fb{ce}}}{FfFd}{}{{l{}{{n{{Ab{ce}}}}}}}}{ce{}{}}00000000000000000000000000000000000000000000000{cJn{}}00{c{{Af{e}}}{}{}}000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000{cAl{}}0000000000000000000000000000000000000000000000000000000{{{Nh{c}}}{{Nh{c}}}l}`","c":[159,162,165,250,332,359,408,447,464,466],"p":[[1,"bool"],[10,"IntoIterator",1880],[17,"Output"],[10,"FnMut",1881],[6,"Either",0],[10,"Iterator",1882],[17,"Item"],[10,"Itertools",0],[1,"tuple"],[6,"Option",1883],[6,"Result",1884],[6,"EitherOrBoth",0],[10,"Deref",1885],[10,"DerefMut",1885],[5,"OsStr",1886],[10,"AsMut",1887],[1,"str"],[5,"Path",1888],[1,"slice"],[5,"CStr",1889],[5,"Pin",1890],[10,"AsRef",1887],[1,"unit"],[5,"ExactlyOneError",412],[5,"Batching",412],[5,"Product",412],[10,"Error",1891],[5,"Chain",1892],[1,"usize"],[5,"IntoChunks",412],[5,"CircularTupleWindows",412],[10,"Clone",1893],[6,"Diff",0],[6,"MinMaxResult",0],[6,"Position",0],[6,"FoldWhile",0],[5,"Cloned",1894],[6,"Ordering",1895],[10,"Ord",1895],[8,"Coalesce",412],[10,"FromIterator",1880],[10,"HomogeneousTuple",1879],[5,"Vec",1896],[5,"Combinations",412],[5,"CombinationsWithReplacement",412],[5,"ConsTuples",412],[10,"BufRead",1897],[10,"PartialEq",1895],[5,"HashMap",1898],[10,"Eq",1895],[10,"Hash",1899],[8,"Dedup",412],[8,"DedupBy",412],[8,"DedupByWithCount",412],[8,"DedupWithCount",412],[17,"Target"],[10,"Fn",1881],[8,"Duplicates",412],[8,"DuplicatesBy",412],[10,"FnOnce",1881],[10,"Into",1887],[5,"Enumerate",1900],[10,"Debug",1901],[10,"Extend",1880],[5,"IterEither",1902],[1,"u8"],[5,"Error",1903],[5,"FilterMapOk",412],[5,"FilterOk",412],[5,"FlattenOk",412],[10,"Write",1897],[5,"Formatter",1901],[5,"Error",1901],[10,"Display",1901],[8,"Result",1901],[5,"Format",412],[5,"FormatWith",412],[5,"GroupBy",412],[10,"Hasher",1899],[5,"Interleave",412],[5,"InterleaveShortest",412],[8,"Intersperse",412],[5,"IntersperseWith",412],[5,"GroupingMap",412],[8,"GroupingMapBy",412],[5,"Iterate",412],[5,"String",1904],[5,"IntoIter",1905],[8,"KMerge",412],[5,"KMergeBy",412],[10,"Default",1906],[10,"ExactSizeIterator",1907],[8,"MapInto",412],[8,"MapOk",412],[8,"Merge",412],[5,"MergeBy",412],[8,"MergeJoinBy",412],[10,"PartialOrd",1895],[5,"MultiProduct",412],[5,"MultiPeek",412],[10,"MultiUnzip",0],[5,"Zip",412],[10,"DoubleEndedIterator",1908],[5,"PadUsing",412],[5,"PeekNth",412],[10,"PeekingNext",0],[5,"PeekingTakeWhile",412],[5,"Permutations",412],[5,"Context",1909],[6,"Poll",1910],[10,"Future",1911],[5,"Positions",412],[5,"Powerset",412],[5,"ProcessResults",412],[10,"Product",1912],[5,"PutBack",412],[5,"PutBackN",412],[5,"RcIter",412],[10,"Read",1897],[5,"RepeatCall",412],[5,"RepeatN",412],[5,"Rev",1913],[6,"SeekFrom",1897],[1,"u64"],[10,"Seek",1897],[5,"Step",412],[10,"Sum",1912],[5,"TakeWhileInclusive",412],[5,"TakeWhileRef",412],[5,"Tee",412],[5,"TupleCombinations",412],[5,"TupleWindows",412],[5,"Tuples",412],[5,"TypeId",1914],[5,"Unfold",412],[5,"Unique",412],[5,"UniqueBy",412],[5,"Update",412],[5,"WhileSome",412],[5,"WithPosition",412],[5,"Arguments",1901],[5,"Zip",1915],[5,"ZipEq",412],[5,"ZipLongest",412],[5,"Chunks",412],[5,"TupleBuffer",412],[5,"Group",412],[5,"Chunk",412],[5,"Groups",412],[10,"Sized",1916]],"b":[[35,"impl-AsMut%3COsStr%3E-for-Either%3CL,+R%3E"],[36,"impl-AsMut%3Cstr%3E-for-Either%3CL,+R%3E"],[37,"impl-AsMut%3CPath%3E-for-Either%3CL,+R%3E"],[38,"impl-AsMut%3C%5BTarget%5D%3E-for-Either%3CL,+R%3E"],[39,"impl-AsMut%3CTarget%3E-for-Either%3CL,+R%3E"],[40,"impl-AsMut%3CCStr%3E-for-Either%3CL,+R%3E"],[41,"impl-Either%3CL,+R%3E"],[45,"impl-Either%3CL,+R%3E"],[46,"impl-AsRef%3COsStr%3E-for-Either%3CL,+R%3E"],[47,"impl-AsRef%3CPath%3E-for-Either%3CL,+R%3E"],[48,"impl-AsRef%3CCStr%3E-for-Either%3CL,+R%3E"],[49,"impl-AsRef%3Cstr%3E-for-Either%3CL,+R%3E"],[50,"impl-AsRef%3C%5BTarget%5D%3E-for-Either%3CL,+R%3E"],[51,"impl-AsRef%3CTarget%3E-for-Either%3CL,+R%3E"],[150,"impl-Debug-for-Either%3CL,+R%3E"],[151,"impl-Display-for-Either%3CL,+R%3E"],[713,"impl-LowerHex-for-Format%3C\'a,+I%3E"],[714,"impl-Pointer-for-Format%3C\'a,+I%3E"],[715,"impl-Octal-for-Format%3C\'a,+I%3E"],[716,"impl-Display-for-Format%3C\'a,+I%3E"],[717,"impl-UpperExp-for-Format%3C\'a,+I%3E"],[718,"impl-Debug-for-Format%3C\'a,+I%3E"],[719,"impl-Binary-for-Format%3C\'a,+I%3E"],[720,"impl-LowerExp-for-Format%3C\'a,+I%3E"],[721,"impl-UpperHex-for-Format%3C\'a,+I%3E"],[743,"impl-Debug-for-ExactlyOneError%3CI%3E"],[744,"impl-Display-for-ExactlyOneError%3CI%3E"],[780,"impl-Iterator-for-ConsTuples%3CIter,+((F,+G,+H,+I,+J,+K,+L),+X)%3E"],[781,"impl-Iterator-for-ConsTuples%3CIter,+((I,+J,+K,+L),+X)%3E"],[782,"impl-Iterator-for-ConsTuples%3CIter,+((J,+K,+L),+X)%3E"],[783,"impl-Iterator-for-ConsTuples%3CIter,+((B,+C,+D,+E,+F,+G,+H,+I,+J,+K,+L),+X)%3E"],[784,"impl-Iterator-for-ConsTuples%3CIter,+((C,+D,+E,+F,+G,+H,+I,+J,+K,+L),+X)%3E"],[785,"impl-Iterator-for-ConsTuples%3CIter,+((K,+L),+X)%3E"],[786,"impl-Iterator-for-ConsTuples%3CIter,+((G,+H,+I,+J,+K,+L),+X)%3E"],[787,"impl-Iterator-for-ConsTuples%3CIter,+((E,+F,+G,+H,+I,+J,+K,+L),+X)%3E"],[788,"impl-Iterator-for-ConsTuples%3CIter,+((H,+I,+J,+K,+L),+X)%3E"],[789,"impl-Iterator-for-ConsTuples%3CIter,+((D,+E,+F,+G,+H,+I,+J,+K,+L),+X)%3E"],[858,"impl-From%3C(A,+B,+C,+D,+E,+F,+G,+H,+I,+J,+K)%3E-for-Zip%3C(%3CA+as+IntoIterator%3E::IntoIter,+%3CB+as+IntoIterator%3E::IntoIter,+%3CC+as+IntoIterator%3E::IntoIter,+%3CD+as+IntoIterator%3E::IntoIter,+%3CE+as+IntoIterator%3E::IntoIter,+%3CF+as+IntoIterator%3E::IntoIter,+%3CG+as+IntoIterator%3E::IntoIter,+%3CH+as+IntoIterator%3E::IntoIter,+%3CI+as+IntoIterator%3E::IntoIter,+%3CJ+as+IntoIterator%3E::IntoIter,+%3CK+as+IntoIterator%3E::IntoIter)%3E"],[860,"impl-From%3C(A,+B,+C,+D,+E,+F,+G,+H,+I)%3E-for-Zip%3C(%3CA+as+IntoIterator%3E::IntoIter,+%3CB+as+IntoIterator%3E::IntoIter,+%3CC+as+IntoIterator%3E::IntoIter,+%3CD+as+IntoIterator%3E::IntoIter,+%3CE+as+IntoIterator%3E::IntoIter,+%3CF+as+IntoIterator%3E::IntoIter,+%3CG+as+IntoIterator%3E::IntoIter,+%3CH+as+IntoIterator%3E::IntoIter,+%3CI+as+IntoIterator%3E::IntoIter)%3E"],[861,"impl-From%3C(A,+B,+C,+D,+E,+F,+G,+H)%3E-for-Zip%3C(%3CA+as+IntoIterator%3E::IntoIter,+%3CB+as+IntoIterator%3E::IntoIter,+%3CC+as+IntoIterator%3E::IntoIter,+%3CD+as+IntoIterator%3E::IntoIter,+%3CE+as+IntoIterator%3E::IntoIter,+%3CF+as+IntoIterator%3E::IntoIter,+%3CG+as+IntoIterator%3E::IntoIter,+%3CH+as+IntoIterator%3E::IntoIter)%3E"],[862,"impl-From%3C(A,+B,+C,+D,+E,+F)%3E-for-Zip%3C(%3CA+as+IntoIterator%3E::IntoIter,+%3CB+as+IntoIterator%3E::IntoIter,+%3CC+as+IntoIterator%3E::IntoIter,+%3CD+as+IntoIterator%3E::IntoIter,+%3CE+as+IntoIterator%3E::IntoIter,+%3CF+as+IntoIterator%3E::IntoIter)%3E"],[863,"impl-From%3C(A,+B,+C,+D)%3E-for-Zip%3C(%3CA+as+IntoIterator%3E::IntoIter,+%3CB+as+IntoIterator%3E::IntoIter,+%3CC+as+IntoIterator%3E::IntoIter,+%3CD+as+IntoIterator%3E::IntoIter)%3E"],[864,"impl-From%3C(A,+B,+C,+D,+E,+F,+G)%3E-for-Zip%3C(%3CA+as+IntoIterator%3E::IntoIter,+%3CB+as+IntoIterator%3E::IntoIter,+%3CC+as+IntoIterator%3E::IntoIter,+%3CD+as+IntoIterator%3E::IntoIter,+%3CE+as+IntoIterator%3E::IntoIter,+%3CF+as+IntoIterator%3E::IntoIter,+%3CG+as+IntoIterator%3E::IntoIter)%3E"],[865,"impl-From%3C(A,+B)%3E-for-Zip%3C(%3CA+as+IntoIterator%3E::IntoIter,+%3CB+as+IntoIterator%3E::IntoIter)%3E"],[866,"impl-From%3C(A,+B,+C,+D,+E)%3E-for-Zip%3C(%3CA+as+IntoIterator%3E::IntoIter,+%3CB+as+IntoIterator%3E::IntoIter,+%3CC+as+IntoIterator%3E::IntoIter,+%3CD+as+IntoIterator%3E::IntoIter,+%3CE+as+IntoIterator%3E::IntoIter)%3E"],[867,"impl-From%3C(A,+B,+C,+D,+E,+F,+G,+H,+I,+J,+K,+L)%3E-for-Zip%3C(%3CA+as+IntoIterator%3E::IntoIter,+%3CB+as+IntoIterator%3E::IntoIter,+%3CC+as+IntoIterator%3E::IntoIter,+%3CD+as+IntoIterator%3E::IntoIter,+%3CE+as+IntoIterator%3E::IntoIter,+%3CF+as+IntoIterator%3E::IntoIter,+%3CG+as+IntoIterator%3E::IntoIter,+%3CH+as+IntoIterator%3E::IntoIter,+%3CI+as+IntoIterator%3E::IntoIter,+%3CJ+as+IntoIterator%3E::IntoIter,+%3CK+as+IntoIterator%3E::IntoIter,+%3CL+as+IntoIterator%3E::IntoIter)%3E"],[868,"impl-From%3C(A,+B,+C,+D,+E,+F,+G,+H,+I,+J)%3E-for-Zip%3C(%3CA+as+IntoIterator%3E::IntoIter,+%3CB+as+IntoIterator%3E::IntoIter,+%3CC+as+IntoIterator%3E::IntoIter,+%3CD+as+IntoIterator%3E::IntoIter,+%3CE+as+IntoIterator%3E::IntoIter,+%3CF+as+IntoIterator%3E::IntoIter,+%3CG+as+IntoIterator%3E::IntoIter,+%3CH+as+IntoIterator%3E::IntoIter,+%3CI+as+IntoIterator%3E::IntoIter,+%3CJ+as+IntoIterator%3E::IntoIter)%3E"],[869,"impl-From%3C(A,)%3E-for-Zip%3C(%3CA+as+IntoIterator%3E::IntoIter,)%3E"],[870,"impl-From%3C(A,+B,+C)%3E-for-Zip%3C(%3CA+as+IntoIterator%3E::IntoIter,+%3CB+as+IntoIterator%3E::IntoIter,+%3CC+as+IntoIterator%3E::IntoIter)%3E"],[1492,"impl-Iterator-for-ConsTuples%3CIter,+((E,+F,+G,+H,+I,+J,+K,+L),+X)%3E"],[1493,"impl-Iterator-for-ConsTuples%3CIter,+((H,+I,+J,+K,+L),+X)%3E"],[1494,"impl-Iterator-for-ConsTuples%3CIter,+((D,+E,+F,+G,+H,+I,+J,+K,+L),+X)%3E"],[1495,"impl-Iterator-for-ConsTuples%3CIter,+((K,+L),+X)%3E"],[1496,"impl-Iterator-for-ConsTuples%3CIter,+((F,+G,+H,+I,+J,+K,+L),+X)%3E"],[1497,"impl-Iterator-for-ConsTuples%3CIter,+((C,+D,+E,+F,+G,+H,+I,+J,+K,+L),+X)%3E"],[1498,"impl-Iterator-for-ConsTuples%3CIter,+((I,+J,+K,+L),+X)%3E"],[1499,"impl-Iterator-for-ConsTuples%3CIter,+((B,+C,+D,+E,+F,+G,+H,+I,+J,+K,+L),+X)%3E"],[1500,"impl-Iterator-for-ConsTuples%3CIter,+((J,+K,+L),+X)%3E"],[1501,"impl-Iterator-for-ConsTuples%3CIter,+((G,+H,+I,+J,+K,+L),+X)%3E"],[1525,"impl-Iterator-for-Zip%3C(A,)%3E"],[1526,"impl-Iterator-for-Zip%3C(A,+B,+C,+D,+E,+F,+G,+H,+I,+J,+K)%3E"],[1527,"impl-Iterator-for-Zip%3C(A,+B,+C)%3E"],[1528,"impl-Iterator-for-Zip%3C(A,+B,+C,+D,+E)%3E"],[1529,"impl-Iterator-for-Zip%3C(A,+B,+C,+D,+E,+F,+G,+H)%3E"],[1530,"impl-Iterator-for-Zip%3C(A,+B,+C,+D)%3E"],[1531,"impl-Iterator-for-Zip%3C(A,+B,+C,+D,+E,+F)%3E"],[1532,"impl-Iterator-for-Zip%3C(A,+B,+C,+D,+E,+F,+G)%3E"],[1533,"impl-Iterator-for-Zip%3C(A,+B)%3E"],[1534,"impl-Iterator-for-Zip%3C(A,+B,+C,+D,+E,+F,+G,+H,+I,+J,+K,+L)%3E"],[1535,"impl-Iterator-for-Zip%3C(A,+B,+C,+D,+E,+F,+G,+H,+I,+J)%3E"],[1536,"impl-Iterator-for-Zip%3C(A,+B,+C,+D,+E,+F,+G,+H,+I)%3E"],[1540,"impl-DoubleEndedIterator-for-ConsTuples%3CIter,+((I,+J,+K,+L),+X)%3E"],[1541,"impl-DoubleEndedIterator-for-ConsTuples%3CIter,+((K,+L),+X)%3E"],[1542,"impl-DoubleEndedIterator-for-ConsTuples%3CIter,+((B,+C,+D,+E,+F,+G,+H,+I,+J,+K,+L),+X)%3E"],[1543,"impl-DoubleEndedIterator-for-ConsTuples%3CIter,+((F,+G,+H,+I,+J,+K,+L),+X)%3E"],[1544,"impl-DoubleEndedIterator-for-ConsTuples%3CIter,+((E,+F,+G,+H,+I,+J,+K,+L),+X)%3E"],[1545,"impl-DoubleEndedIterator-for-ConsTuples%3CIter,+((J,+K,+L),+X)%3E"],[1546,"impl-DoubleEndedIterator-for-ConsTuples%3CIter,+((G,+H,+I,+J,+K,+L),+X)%3E"],[1547,"impl-DoubleEndedIterator-for-ConsTuples%3CIter,+((D,+E,+F,+G,+H,+I,+J,+K,+L),+X)%3E"],[1548,"impl-DoubleEndedIterator-for-ConsTuples%3CIter,+((C,+D,+E,+F,+G,+H,+I,+J,+K,+L),+X)%3E"],[1549,"impl-DoubleEndedIterator-for-ConsTuples%3CIter,+((H,+I,+J,+K,+L),+X)%3E"],[1556,"impl-DoubleEndedIterator-for-Zip%3C(A,+B,+C,+D,+E,+F,+G,+H,+I,+J,+K,+L)%3E"],[1557,"impl-DoubleEndedIterator-for-Zip%3C(A,+B,+C,+D,+E,+F,+G,+H,+I)%3E"],[1558,"impl-DoubleEndedIterator-for-Zip%3C(A,+B,+C,+D,+E,+F,+G,+H,+I,+J,+K)%3E"],[1559,"impl-DoubleEndedIterator-for-Zip%3C(A,+B,+C,+D,+E,+F)%3E"],[1560,"impl-DoubleEndedIterator-for-Zip%3C(A,+B,+C,+D,+E,+F,+G,+H,+I,+J)%3E"],[1561,"impl-DoubleEndedIterator-for-Zip%3C(A,+B,+C)%3E"],[1562,"impl-DoubleEndedIterator-for-Zip%3C(A,+B)%3E"],[1563,"impl-DoubleEndedIterator-for-Zip%3C(A,)%3E"],[1564,"impl-DoubleEndedIterator-for-Zip%3C(A,+B,+C,+D)%3E"],[1565,"impl-DoubleEndedIterator-for-Zip%3C(A,+B,+C,+D,+E,+F,+G,+H)%3E"],[1566,"impl-DoubleEndedIterator-for-Zip%3C(A,+B,+C,+D,+E,+F,+G)%3E"],[1567,"impl-DoubleEndedIterator-for-Zip%3C(A,+B,+C,+D,+E)%3E"],[1614,"impl-Iterator-for-ConsTuples%3CIter,+((F,+G,+H,+I,+J,+K,+L),+X)%3E"],[1615,"impl-Iterator-for-ConsTuples%3CIter,+((B,+C,+D,+E,+F,+G,+H,+I,+J,+K,+L),+X)%3E"],[1616,"impl-Iterator-for-ConsTuples%3CIter,+((J,+K,+L),+X)%3E"],[1617,"impl-Iterator-for-ConsTuples%3CIter,+((D,+E,+F,+G,+H,+I,+J,+K,+L),+X)%3E"],[1618,"impl-Iterator-for-ConsTuples%3CIter,+((C,+D,+E,+F,+G,+H,+I,+J,+K,+L),+X)%3E"],[1619,"impl-Iterator-for-ConsTuples%3CIter,+((H,+I,+J,+K,+L),+X)%3E"],[1620,"impl-Iterator-for-ConsTuples%3CIter,+((K,+L),+X)%3E"],[1621,"impl-Iterator-for-ConsTuples%3CIter,+((I,+J,+K,+L),+X)%3E"],[1622,"impl-Iterator-for-ConsTuples%3CIter,+((E,+F,+G,+H,+I,+J,+K,+L),+X)%3E"],[1623,"impl-Iterator-for-ConsTuples%3CIter,+((G,+H,+I,+J,+K,+L),+X)%3E"],[1645,"impl-Iterator-for-Zip%3C(A,+B,+C)%3E"],[1646,"impl-Iterator-for-Zip%3C(A,+B,+C,+D,+E,+F,+G,+H,+I,+J)%3E"],[1647,"impl-Iterator-for-Zip%3C(A,)%3E"],[1648,"impl-Iterator-for-Zip%3C(A,+B,+C,+D,+E,+F,+G,+H,+I)%3E"],[1649,"impl-Iterator-for-Zip%3C(A,+B,+C,+D,+E,+F,+G)%3E"],[1650,"impl-Iterator-for-Zip%3C(A,+B,+C,+D,+E,+F,+G,+H,+I,+J,+K,+L)%3E"],[1651,"impl-Iterator-for-Zip%3C(A,+B)%3E"],[1652,"impl-Iterator-for-Zip%3C(A,+B,+C,+D,+E)%3E"],[1653,"impl-Iterator-for-Zip%3C(A,+B,+C,+D,+E,+F,+G,+H,+I,+J,+K)%3E"],[1654,"impl-Iterator-for-Zip%3C(A,+B,+C,+D,+E,+F,+G,+H)%3E"],[1655,"impl-Iterator-for-Zip%3C(A,+B,+C,+D)%3E"],[1656,"impl-Iterator-for-Zip%3C(A,+B,+C,+D,+E,+F)%3E"]]}],\ +["itertools",{"doc":"Extra iterator adaptors, functions and macros.","t":"PPGPGGPPGKPPPPPPGKPPPKGPPPHNNNNHNNNNNNNNNNNNNNNNNNNNNHNNNNNNNNNNNNNNNNNHQNNNNNNNNNNNNNNNNHNNNNNNNHNHNNNNNNNNNNNNHNNNNNNNHNNNNNHNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNHNNNNNNNNNNNNNNNNNNNNNNNNNHNNHNHNNNNNNNNNNNNNNNNNNNNQNNNNNNNNHQHNNNNNNNNNHNHNNNNNNNNNNNNNNNNNNNNNNNHNNNHNNHNHNNNNNNNHNHMNNNNNNNNNNNNNNHNNNNNNNNNHNNNHMNNNNNNNNNNNNNNNHNNHHHNNNNNNNHHNNNNNNNNNNNNNNHNNNNHNNNNCNNNNNNNNNNNNCNNNNNNNNNNNNNNNNNNNNNNNNNHNNNNNNNNNNHHNNFFFFFIFFFIIIIIIFFFFFFFIFIFFFIFFFIFIIIFIFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNONNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNONNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNKKRM","n":["Both","Continue","Diff","Done","Either","EitherOrBoth","First","FirstMismatch","FoldWhile","Itertools","Last","Left","Left","Longer","Middle","MinMax","MinMaxResult","MultiUnzip","NoElements","OneElement","Only","PeekingNext","Position","Right","Right","Shorter","all","all","all_equal","all_equal_value","all_unique","any","any","as_deref","as_deref_mut","as_mut","as_mut","as_mut","as_mut","as_mut","as_mut","as_mut","as_mut","as_pin_mut","as_pin_ref","as_ref","as_ref","as_ref","as_ref","as_ref","as_ref","as_ref","as_ref","assert_equal","at_most_one","batching","borrow","borrow","borrow","borrow","borrow","borrow","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","both","cartesian_product","cause","chain","chain","chunk_by","chunks","circular_tuple_windows","clone","clone","clone","clone","clone","clone","clone_from","clone_into","clone_into","clone_into","clone_into","clone_into","clone_into","cloned","cmp","coalesce","collect","collect_tuple","collect_vec","combinations","combinations_with_replacement","concat","concat","cons_tuples","consume","contains","count","counts","counts_by","dedup","dedup_by","dedup_by_with_count","dedup_with_count","deref","deref_mut","description","diff_with","dropping","dropping_back","duplicates","duplicates_by","either","either_into","either_with","enumerate","eq","eq","eq","eq","eq","equal","exactly_one","expect_left","expect_right","extend","factor_err","factor_first","factor_into_iter","factor_iter","factor_iter_mut","factor_none","factor_ok","factor_second","fill_buf","filter_map_ok","filter_ok","find","find_map","find_or_first","find_or_last","find_position","flatten_ok","flip","flip","flush","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fold","fold","fold1","fold_ok","fold_options","fold_while","for_each","format","format_with","from","from","from","from","from","from","from","from","get","group_by","has_left","has_right","hash","hash","insert_both","insert_left","insert_right","interleave","interleave","interleave_shortest","intersperse","intersperse","intersperse_with","intersperse_with","into","into","into","into","into","into","into","into_future","into_group_map","into_group_map_by","into_grouping_map","into_grouping_map_by","into_inner","into_inner","into_iter","into_iter","into_left","into_option","into_right","iproduct","is_both","is_done","is_left","is_left","is_right","is_right","iter","iter_mut","iterate","izip","join","join","just_left","just_right","k_largest","k_largest_by","k_largest_by_key","k_smallest","k_smallest_by","k_smallest_by_key","kmerge","kmerge","kmerge_by","kmerge_by","last","left","left","left_and_right","left_and_then","left_and_then","left_or","left_or_default","left_or_else","left_or_insert","left_or_insert_with","len","map","map_any","map_either","map_either_with","map_into","map_left","map_left","map_ok","map_right","map_right","max","max_set","max_set_by","max_set_by_key","merge","merge","merge_by","merge_join_by","merge_join_by","min","min_set","min_set_by","min_set_by_key","minmax","minmax_by","minmax_by_key","multi_cartesian_product","multipeek","multipeek","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multizip","next","next_back","next_tuple","nth","or","or_default","or_else","pad_using","partial_cmp","partition","partition","partition_map","partition_result","peek_nth","peeking_next","peeking_take_while","permutations","poll","position","position_max","position_max_by","position_max_by_key","position_min","position_min_by","position_min_by_key","position_minmax","position_minmax_by","position_minmax_by_key","positions","powerset","process_results","process_results","product1","put_back","put_back_n","rciter","read","read_exact","read_line","read_to_end","read_to_string","read_until","reduce","repeat_n","rev","rfind","rfold","right","right","right_and_then","right_and_then","right_or","right_or_default","right_or_else","right_or_insert","right_or_insert_with","seek","set_from","size_hint","sorted","sorted","sorted_by","sorted_by_cached_key","sorted_by_key","sorted_unstable","sorted_unstable","sorted_unstable_by","sorted_unstable_by_key","source","structs","sum1","tail","take_while_inclusive","take_while_ref","tee","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_string","traits","tree_fold1","tree_reduce","try_collect","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_len","tuple_combinations","tuple_windows","tuples","type_id","type_id","type_id","type_id","type_id","type_id","unfold","unique","unique_by","unwrap_left","unwrap_right","update","while_some","with_position","write","write_all","write_fmt","zip","zip_eq","zip_eq","zip_longest","Batching","Chunk","ChunkBy","Chunks","CircularTupleWindows","Coalesce","Combinations","CombinationsWithReplacement","ConsTuples","Dedup","DedupBy","DedupByWithCount","DedupWithCount","Duplicates","DuplicatesBy","ExactlyOneError","FilterMapOk","FilterOk","FlattenOk","Format","FormatWith","Group","GroupBy","GroupingMap","GroupingMapBy","Groups","Interleave","InterleaveShortest","Intersperse","IntersperseWith","IntoChunks","Iterate","KMerge","KMergeBy","MapInto","MapOk","Merge","MergeBy","MergeJoinBy","MultiPeek","MultiProduct","PadUsing","PeekNth","PeekingTakeWhile","Permutations","Positions","Powerset","ProcessResults","Product","PutBack","PutBackN","RcIter","RepeatN","TakeWhileInclusive","TakeWhileRef","Tee","TupleBuffer","TupleCombinations","TupleWindows","Tuples","Unfold","Unique","UniqueBy","Update","WhileSome","WithPosition","Zip","ZipEq","ZipLongest","aggregate","all","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","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","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","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","collect","collect","collect","collect","count","count","count","count","count","count","count","count","count","drop","drop","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","fmt","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","fold","fold","fold","fold","fold","fold","fold","fold","fold","fold","fold","fold","fold","fold","fold","fold","fold","fold","fold","fold","fold","fold","fold","fold","fold","fold","fold_first","fold_with","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","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","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into_buffer","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_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_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_iter","into_iter","into_iter","into_iter","into_iter","into_iter","into_iter","into_parts","k","last","last","max","max_by","max_by_key","min","min_by","min_by_key","minmax","minmax_by","minmax_by_key","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","multiunzip","n","next","next","next","next","next","next","next","next","next","next","next","next","next","next","next","next","next","next","next","next","next","next","next","next","next","next","next","next","next","next","next","next","next","next","next","next","next","next","next","next","next","next","next","next","next","next","next","next","next","next","next","next","next","next","next","next","next","next","next","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","next_back","next_back","next_back","next_back","next_back","next_back","next_back","next_back","next_back","next_back","next_back","next_back","next_if","next_if_eq","nth","nth","nth","nth","nth","peek","peek","peek_mut","peek_nth","peek_nth_mut","peeking_next","peeking_next","peeking_next","peeking_next","peeking_next","peeking_next","product","put_back","put_back","rciter","reduce","reset_peek","rfold","rfold","rfold","rfold","rfold","rfold","size_hint","size_hint","size_hint","size_hint","size_hint","size_hint","size_hint","size_hint","size_hint","size_hint","size_hint","size_hint","size_hint","size_hint","size_hint","size_hint","size_hint","size_hint","size_hint","size_hint","size_hint","size_hint","size_hint","size_hint","size_hint","size_hint","size_hint","size_hint","size_hint","size_hint","size_hint","size_hint","size_hint","size_hint","size_hint","size_hint","size_hint","size_hint","size_hint","size_hint","size_hint","size_hint","size_hint","size_hint","size_hint","size_hint","size_hint","size_hint","size_hint","size_hint","size_hint","size_hint","size_hint","size_hint","size_hint","size_hint","size_hint","size_hint","size_hint","size_hint","size_hint","size_hint","size_hint","state","sum","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_owned","to_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_from","try_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","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","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_value","HomogeneousTuple","IteratorIndex","Output","index"],"q":[[0,"itertools"],[416,"itertools::structs"],[1824,"itertools::traits"],[1828,"core::iter::traits::collect"],[1829,"core::ops::function"],[1830,"core::iter::traits::iterator"],[1831,"core::option"],[1832,"core::result"],[1833,"core::ops::deref"],[1834,"core::ops::deref"],[1835,"core::convert"],[1836,"core::ffi::c_str"],[1837,"std::path"],[1838,"core::pin"],[1839,"core::convert"],[1840,"core::iter::adapters::chain"],[1841,"core::cmp"],[1842,"core::clone"],[1843,"core::iter::adapters::cloned"],[1844,"core::cmp"],[1845,"std::io"],[1846,"std::collections::hash::map"],[1847,"core::cmp"],[1848,"core::ops::function"],[1849,"core::fmt"],[1850,"core::iter::traits::collect"],[1851,"std::io::error"],[1852,"std::io"],[1853,"alloc::vec::into_iter"],[1854,"core::default"],[1855,"core::iter::traits::exact_size"],[1856,"core::cmp"],[1857,"core::task::wake"],[1858,"core::task::poll"],[1859,"core::future::future"],[1860,"core::iter::traits::accum"],[1861,"std::io"],[1862,"std::io"],[1863,"core::any"],[1864,"core::fmt"],[1865,"core::marker"]],"d":["Both values are present.","Continue folding with this value","A type returned by the diff_with function.","Fold is complete and will return this value","The enum Either with variants Left and Right is a general …","Value that either holds a single A or B, or both.","This is the first element.","The index of the first non-matching element along with …","An enum used for controlling the execution of fold_while.","An Iterator blanket implementation that provides extra …","This is the last element.","A value of type L.","Only the left value of type A is present.","The total number of elements that were in I along with the …","This is neither the first nor the last element.","More than one element in the iterator, the first element …","MinMaxResult is an enum returned by minmax.","An iterator that can be unzipped into multiple collections.","Empty iterator","Iterator with one element, so the minimum and maximum are …","This is the only element.","An iterator that allows peeking at an element before …","The first component of the value yielded by WithPosition. …","A value of type R.","Only the right value of type B is present.","The total number of elements that were in J along with the …","Test whether the predicate holds for all elements in the …","","Check whether all elements compare equal.","If there are elements and they are all equal, return a …","Check whether all elements are unique (non equal).","Test whether the predicate holds for any elements in the …","","Converts from &EitherOrBoth<A, B> to EitherOrBoth<&_, &_> …","Converts from &mut EitherOrBoth<A, B> to …","Convert &mut Either<L, R> to Either<&mut L, &mut R>.","","","","","","","Converts from &mut EitherOrBoth<A, B> to …","Convert Pin<&mut Either<L, R>> to …","Convert Pin<&Either<L, R>> to Either<Pin<&L>, Pin<&R>>, …","","Convert &Either<L, R> to Either<&L, &R>.","","","","","","Converts from &EitherOrBoth<A, B> to EitherOrBoth<&A, &B>.","Assert that two iterables produce equal sequences, with …","If the iterator yields no elements, Ok(None) will be …","A “meta iterator adaptor”. Its closure receives a …","","","","","","","","","","","","","If Both, return Some containing the left and right values. …","Return an iterator adaptor that iterates over the …","","Takes two iterables and creates a new iterator over both …","Chain zero or more iterators together into one sequence.","Return an iterable that can group iterator elements. …","Return an iterable that can chunk the iterator.","Return an iterator over all windows, wrapping back to the …","","","","","","","","","","","","","","Create an iterator that clones each element from &T to T.","","Return an iterator adaptor that uses the passed-in closure …","","Collects all items from the iterator into a tuple of a …",".collect_vec() is simply a type specialization of …","Return an iterator adaptor that iterates over the k-length …","Return an iterator that iterates over the k-length …","Combine all an iterator’s elements into one element by …","Combine all an iterator’s elements into one element by …","Create an iterator that maps for example iterators of …","","Returns true if the given item is present in this iterator.","","Collect the items in this iterator and return a HashMap …","Collect the items in this iterator and return a HashMap …","Remove duplicates from sections of consecutive identical …","Remove duplicates from sections of consecutive identical …","Remove duplicates from sections of consecutive identical …","Remove duplicates from sections of consecutive identical …","","","","Compares every element yielded by both i and j with the …","Consume the first n elements from the iterator eagerly, …","Consume the last n elements from the iterator eagerly, and …","Return an iterator adaptor that produces elements that …","Return an iterator adaptor that produces elements that …","Apply one of two functions depending on contents, unifying …","Convert the contained value into T","Like either, but provide some context to whichever of the …","Iterate iterable with a running index.","","","","","","Return true if both iterables produce equal sequences …","If the iterator yields exactly one element, that element …","Returns the left value","Returns the right value","","Factors out a homogenous type from an Either of Result.","Factor out a homogeneous type from an either of pairs.","Converts an Either of Iterators to be an Iterator of Either…","Borrows an Either of Iterators to be an Iterator of Eithers","Mutably borrows an Either of Iterators to be an Iterator …","Factors out None from an Either of Option.","Factors out a homogenous type from an Either of Result.","Factor out a homogeneous type from an either of pairs.","","Return an iterator adaptor that filters and transforms …","Return an iterator adaptor that filters every Result::Ok …","","","Find the value of the first element satisfying a predicate …","Find the value of the first element satisfying a predicate …","Find the position and value of the first element …","Return an iterator adaptor that flattens every Result::Ok …","Convert Either<L, R> to Either<R, L>.","Convert EitherOrBoth<A, B> to EitherOrBoth<B, A>.","","","","","","","","","Perform a fold operation over the iterable.","","Accumulator of the elements in the iterator.","Fold Result values from an iterator.","Fold Option values from an iterator.","An iterator method that applies a function, producing a …","","Format all iterator elements, separated by sep.","Format all iterator elements, separated by sep.","Returns the argument unchanged.","","Returns the argument unchanged.","Returns the argument unchanged.","","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns an iterator over a subsection of the iterator.","See .chunk_by().","If Left, or Both, return true. Otherwise, return false.","If Right, or Both, return true, otherwise, return false.","","","Set self to Both(..), containing the specified left and …","Sets the left value of this instance, and returns a …","Sets the right value of this instance, and returns a …","Create an iterator that interleaves elements in i and j.","Alternate elements from two iterators until both have run …","Alternate elements from two iterators until at least one …","Iterate iterable with a particular value inserted between …","An iterator adaptor to insert a particular value between …","Iterate iterable with a particular value created by a …","An iterator adaptor to insert a particular value created …","","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","","Return a HashMap of keys mapped to Vecs of values. Keys …","Return an Iterator on a HashMap. Keys mapped to Vecs of …","Constructs a GroupingMap to be used later with one of the …","Constructs a GroupingMap to be used later with one of the …","Extract the value of an either over two equivalent types.","Return the value in the continue or done.","","Convert the inner value to an iterator.","If Left or Both, return the left value. Otherwise, convert …","into_option creates an Option of type (T, T). The returned …","If Right or Both, return the right value. Otherwise, …","Create an iterator over the “cartesian product” of …","If Both, return true. Otherwise, return false.","Return true if self is Done, false if it is Continue.","Return true if the value is the Left variant.","If Left, return true. Otherwise, return false. Exclusive …","Return true if the value is the Right variant.","If Right, return true. Otherwise, return false. Exclusive …","Borrow the inner value as an iterator.","Mutably borrow the inner value as an iterator.","Creates a new iterator that infinitely applies function to …","Create an iterator running multiple iterators in lockstep.","Combine all iterator elements into one String, separated …","Combine all iterator elements into one String, separated …","If Left, return Some with the left value. If Right or Both…","If Right, return Some with the right value. If Left or Both…","Sort the k largest elements into a new iterator, in …","Sort the k largest elements into a new iterator using the …","Return the elements producing the k largest outputs of the …","Sort the k smallest elements into a new iterator, in …","Sort the k smallest elements into a new iterator using the …","Return the elements producing the k smallest outputs of …","Create an iterator that merges elements of the contained …","Return an iterator adaptor that flattens an iterator of …","Create an iterator that merges elements of the contained …","Return an iterator adaptor that flattens an iterator of …","","Convert the left side of Either<L, R> to an Option<L>.","If Left, or Both, return Some with the left value. …","Return tuple of options corresponding to the left and …","Apply the function f on the value in the Left variant if …","Apply the function f on the value a in Left(a) or …","Return left value or given value","Return left or a default","Returns left value or computes it from a closure","Returns a mutable reference to the left value. If the left …","If the left value is not present, replace it the value …","","Map f over the contained value and return the result in the","Apply the functions f and g on the value a and b …","Apply the functions f and g to the Left and Right variants …","Similar to map_either, with an added context ctx …","Convert each item of the iterator using the Into trait.","Apply the function f on the value in the Left variant if …","Apply the function f on the value a in Left(a) or …","Return an iterator adaptor that applies the provided …","Apply the function f on the value in the Right variant if …","Apply the function f on the value b in Right(b) or …","Return the maximum value of the iterable.","Return all maximum elements of an iterator.","Return all maximum elements of an iterator, as determined …","Return all maximum elements of an iterator, as determined …","Create an iterator that merges elements in i and j.","Return an iterator adaptor that merges the two base …","Return an iterator adaptor that merges the two base …","Return an iterator adaptor that merge-joins items from the …","Create an iterator that merges items from both this and …","Return the minimum value of the iterable.","Return all minimum elements of an iterator.","Return all minimum elements of an iterator, as determined …","Return all minimum elements of an iterator, as determined …","Return the minimum and maximum elements in the iterator.","Return the minimum and maximum element of an iterator, as …","Return the minimum and maximum element of an iterator, as …","Return an iterator adaptor that iterates over the …","An iterator adaptor that allows the user to peek at …","An iterator adaptor that allows the user to peek at …","Converts an iterator of tuples into a tuple of containers.","Unzip this iterator into multiple collections.","","","","","","","","","","","","","","Converts an iterator of tuples into a tuple of containers.","An iterator that generalizes .zip() and allows running …","","","Advances the iterator and returns the next items grouped …","","Returns a tuple consisting of the l and r in Both(l, r), …","Returns a tuple consisting of the l and r in Both(l, r), …","Returns a tuple consisting of the l and r in Both(l, r), …","Return an iterator adaptor that pads the sequence to a …","","Partition a sequence using predicate pred so that elements …","","Collect all iterator elements into one of two partitions. …","Partition a sequence of Results into one list of all the Ok…","A drop-in replacement for std::iter::Peekable which adds a …","Pass a reference to the next iterator element to the …","Return an iterator adaptor that borrows from this iterator …","Return an iterator adaptor that iterates over all …","","","Return the position of the maximum element in the iterator.","Return the position of the maximum element in the …","Return the position of the maximum element in the …","Return the position of the minimum element in the iterator.","Return the position of the minimum element in the …","Return the position of the minimum element in the …","Return the positions of the minimum and maximum elements in","Return the postions of the minimum and maximum elements of …","Return the postions of the minimum and maximum elements of …","Return an iterator adaptor that yields the indices of all …","Return an iterator that iterates through the powerset of …","“Lift” a function of the values of an iterator so that …","“Lift” a function of the values of the current …","Iterate over the entire iterator and multiply all the …","Create an iterator where you can put back a single item","Create an iterator where you can put back multiple values …","Return an iterator inside a Rc<RefCell<_>> wrapper.","","","","","","","Return either value of left, right, or apply a function f …","Create an iterator that produces n repetitions of element.","Iterate iterable in reverse.","","","Convert the right side of Either<L, R> to an Option<R>.","If Right, or Both, return Some with the right value. …","Apply the function f on the value in the Right variant if …","Apply the function f on the value b in Right(b) or …","Return right value or given value","Return right or a default","Returns right value or computes it from a closure","Returns a mutable reference to the right value. If the …","If the right value is not present, replace it the value …","","Assign to each reference in self from the from iterator, …","","Sort all iterator elements into a new iterator in …","Sort all iterator elements into a new iterator in …","Sort all iterator elements into a new iterator in …","Sort all iterator elements into a new iterator in …","Sort all iterator elements into a new iterator in …","Sort all iterator elements into a new iterator in …","Sort all iterator elements into a new iterator in …","Sort all iterator elements into a new iterator in …","Sort all iterator elements into a new iterator in …","","The concrete iterator types.","Iterate over the entire iterator and add all the elements.","Consumes the iterator and return an iterator of the last n …","Returns an iterator adaptor that consumes elements while …","Return an iterator adaptor that borrows from a Clone-able …","Split into an iterator pair that both yield all elements …","","","","","","","","Traits helpful for using certain Itertools methods in …","See .tree_reduce().","Accumulate the elements in the iterator in a tree-like …",".try_collect() is more convenient way of writing …","","","","","","","","","","","","","Returns the length of the iterator if one exists. …","Return an iterator adaptor that iterates over the …","Return an iterator over all contiguous windows producing …","Return an iterator that groups the items in tuples of a …","","","","","","","Creates a new unfold source with the specified closure as …","Return an iterator adaptor that filters out elements that …","Return an iterator adaptor that filters out elements that …","Returns the left value","Returns the right value","Return an iterator adaptor that applies a mutating function","Return an iterator adaptor that filters Option<A> iterator …","Return an iterator adaptor that combines each element with …","","","","Converts the arguments to iterators and zips them.","Zips two iterators but panics if they are not of the same …","Create an iterator which iterates over both this and the …","Create an iterator which iterates over both this and the …","A “meta iterator adaptor”. Its closure receives a …","An iterator for the elements in a single chunk.","ChunkBy is the storage for the lazy grouping operation.","An iterator that yields the Chunk iterators.","An iterator over all windows, wrapping back to the first …","An iterator adaptor that may join together adjacent …","An iterator to iterate through all the k-length …","An iterator to iterate through all the n-length …","An iterator that maps an iterator of tuples like …","An iterator adaptor that removes repeated duplicates.","An iterator adaptor that removes repeated duplicates, …","An iterator adaptor that removes repeated duplicates, …","An iterator adaptor that removes repeated duplicates, …","An iterator adapter to filter out duplicate elements.","An iterator adapter to filter for duplicate elements.","Iterator returned for the error case of …","An iterator adapter to filter and apply a transformation …","An iterator adapter to filter values within a nested …","An iterator adaptor that flattens Result::Ok values and …","Format all iterator elements lazily, separated by sep.","Format all iterator elements lazily, separated by sep.","An iterator for the elements in a single group.","See ChunkBy.","GroupingMap is an intermediate struct for efficient …","GroupingMapBy is an intermediate struct for efficient …","An iterator that yields the Group iterators.","An iterator adaptor that alternates elements from two …","An iterator adaptor that alternates elements from the two …","An iterator adaptor to insert a particular value between …","An iterator adaptor to insert a particular value created …","ChunkLazy is the storage for a lazy chunking operation.","An iterator that infinitely applies function to value and …","An iterator adaptor that merges an abitrary number of base …","An iterator adaptor that merges an abitrary number of base …","An iterator adapter to apply Into conversion to each …","An iterator adapter to apply a transformation within a …","An iterator adaptor that merges the two base iterators in …","An iterator adaptor that merges the two base iterators in …","An iterator adaptor that merge-joins items from the two …","See multipeek() for more information.","An iterator adaptor that iterates over the cartesian …","An iterator adaptor that pads a sequence to a minimum …","See peek_nth() for more information.","An iterator adaptor that takes items while a closure …","An iterator adaptor that iterates through all the k…","An iterator adapter to get the positions of each element …","An iterator to iterate through the powerset of the …","An iterator that produces only the T values as long as the …","An iterator adaptor that iterates over the cartesian …","An iterator adaptor that allows putting back a single item …","An iterator adaptor that allows putting multiple items in …","A wrapper for Rc<RefCell<I>>, that implements the Iterator …","An iterator that produces n repetitions of an element.","An iterator adaptor that consumes elements while the given …","An iterator adaptor that borrows from a Clone-able iterator","One half of an iterator pair where both return the same …","An iterator over a incomplete tuple.","An iterator to iterate through all combinations in a Clone…","An iterator over all contiguous windows that produces …","An iterator that groups the items in tuples of a specific …","See unfold for more information.","An iterator adapter to filter out duplicate elements.","An iterator adapter to filter out duplicate elements.","An iterator adapter to apply a mutating function to each …","An iterator adaptor that filters Option<A> iterator …","An iterator adaptor that wraps each element in an Position.","See multizip for more information.","An iterator which iterates two other iterators …","An iterator which iterates two other iterators …","This is the generic way to perform any operation on a …","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","Groups elements from the GroupingMap source by key and …","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","Groups elements from the GroupingMap source by key and …","","","","","","","","","","See .reduce().","Groups elements from the GroupingMap source by key and …","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","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).","Return a buffer with the produced items that was not …","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","Split the PutBack into its parts.","Returns the length of a combination produced by this …","","","Groups elements from the GroupingMap source by key and …","Groups elements from the GroupingMap source by key and …","Groups elements from the GroupingMap source by key and …","Groups elements from the GroupingMap source by key and …","Groups elements from the GroupingMap source by key and …","Groups elements from the GroupingMap source by key and …","Groups elements from the GroupingMap source by key and …","Groups elements from the GroupingMap source by key and …","Groups elements from the GroupingMap source by key and …","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","Returns the (current) length of the pool from which …","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","Works exactly like the next_if method in …","Works exactly like the next_if_eq method in …","","","","","","Works exactly like .next() with the only difference that …","Works exactly like the peek method in std::iter::Peekable.","Works exactly like the peek_mut method in …","Returns a reference to the nth value without advancing the …","Returns a mutable reference to the nth value without …","","","","","","","Groups elements from the GroupingMap source by key and …","Put back a single value to the front of the iterator.","Puts x in front of the iterator.","The boxed iterator.","Groups elements from the GroupingMap source by key and …","Reset the peeking “cursor”","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","Internal state that will be passed to the closure on the …","Groups elements from the GroupingMap source by key and …","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","put back value value (builder method)","Implemented for homogeneous tuples of size up to 12.","Used by Itertools::get to know which iterator to turn …","The type returned for this type of index.","Returns an adapted iterator for the current index."],"i":[12,38,0,38,0,0,37,35,0,0,37,5,12,35,37,36,0,0,36,36,37,0,0,5,12,35,0,5,8,8,8,0,5,12,12,5,5,5,5,5,5,5,12,5,5,5,5,5,5,5,5,5,12,0,8,8,5,35,12,36,37,38,5,35,12,36,37,38,12,8,5,0,0,8,8,8,5,35,12,36,37,38,5,5,35,12,36,37,38,0,5,8,5,8,8,8,8,0,8,0,5,8,5,8,8,8,8,8,8,5,5,5,0,8,8,8,8,5,5,5,0,5,12,36,37,38,0,8,5,5,5,5,5,5,5,5,5,5,5,5,8,8,5,5,8,8,8,8,5,12,5,5,5,35,12,36,37,38,0,5,8,8,8,8,5,8,8,5,5,35,12,12,36,37,38,8,8,12,12,5,12,12,12,12,0,8,8,0,8,0,8,5,5,35,12,36,37,38,5,8,8,8,8,5,38,5,5,12,36,12,0,12,38,5,12,5,12,5,5,0,0,0,8,12,12,8,8,8,8,8,8,0,8,0,8,5,5,12,12,5,12,5,5,5,12,12,5,5,12,5,5,8,5,12,8,5,12,0,8,8,8,0,8,8,0,8,0,8,8,8,8,8,8,8,0,8,0,101,5,5,5,5,5,5,5,5,5,5,5,5,5,8,0,5,5,8,5,12,12,12,8,5,0,5,8,8,0,106,8,8,5,5,8,8,8,8,8,8,8,8,8,8,8,0,8,8,0,0,0,5,5,5,5,5,5,12,0,0,5,5,5,12,5,12,5,5,5,12,12,5,8,5,0,8,8,8,8,0,8,8,8,5,0,8,8,8,8,8,5,35,12,36,37,38,5,0,8,8,8,5,35,12,36,37,38,5,35,12,36,37,38,8,8,8,8,5,35,12,36,37,38,0,8,8,5,5,8,8,8,5,5,5,0,0,8,8,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,84,116,128,46,70,77,76,29,148,146,32,147,90,96,107,108,113,139,99,80,81,116,26,25,138,130,69,68,112,137,47,48,24,144,84,83,100,104,105,114,117,118,120,134,86,127,129,145,132,131,33,136,135,142,143,102,128,46,70,77,76,29,148,146,32,147,90,96,107,108,113,139,99,80,81,116,26,25,138,130,69,68,112,137,47,48,24,144,84,83,100,104,105,114,117,118,120,134,86,127,129,145,132,131,33,136,135,142,143,102,46,70,77,76,32,90,96,108,113,139,99,80,81,116,26,25,138,130,69,68,112,137,47,48,24,144,84,83,100,104,105,117,118,120,134,86,127,145,132,131,33,136,135,142,143,102,46,70,77,76,32,90,96,108,113,139,99,80,81,116,26,25,138,130,69,68,112,137,47,48,24,144,84,83,100,104,105,117,118,120,134,86,127,145,132,131,33,136,135,142,143,102,69,68,137,84,46,108,113,99,116,130,47,136,135,146,147,128,46,70,77,77,76,76,76,76,76,76,76,76,76,90,96,107,108,113,139,99,80,81,116,26,25,138,130,69,68,112,137,47,48,24,24,84,83,100,104,105,114,117,118,120,134,86,127,129,145,132,131,33,136,135,142,143,102,70,96,113,139,80,81,116,26,138,130,69,68,112,137,48,48,48,48,48,48,48,48,48,48,24,84,83,100,104,105,114,117,120,127,143,84,84,128,46,70,77,76,29,148,146,32,147,90,96,107,108,113,139,99,80,81,116,26,25,138,130,69,68,112,137,47,48,24,144,84,83,100,104,105,114,117,118,120,134,86,127,129,145,132,131,33,136,135,142,143,102,102,102,102,102,102,102,102,102,102,102,102,102,128,46,70,77,76,29,148,146,32,147,90,96,107,108,113,139,99,80,81,116,26,25,138,130,69,68,112,137,47,48,24,144,84,83,100,104,105,114,117,118,120,134,86,127,129,145,132,131,33,136,135,142,143,102,132,128,46,70,29,148,146,32,147,90,96,107,108,113,139,99,80,81,116,26,25,138,130,69,68,112,137,47,48,24,144,83,100,104,105,114,117,118,118,120,134,86,127,129,145,132,131,33,136,135,142,143,102,116,46,99,116,84,84,84,84,84,84,84,84,84,128,128,128,128,128,128,128,128,128,128,128,128,128,148,146,146,146,146,146,146,146,146,146,146,146,146,146,147,147,147,147,147,147,147,147,147,147,147,147,147,90,90,90,90,90,90,90,90,90,90,90,90,90,96,96,96,96,96,96,96,96,96,96,96,96,96,107,107,107,107,107,107,107,107,107,107,107,107,107,139,80,80,80,80,80,80,80,80,80,80,80,80,80,81,81,81,81,81,81,81,81,81,81,81,81,81,116,116,116,116,116,116,116,116,116,116,116,116,116,26,25,25,25,25,25,25,25,25,25,25,25,25,25,138,138,138,138,138,138,138,138,138,138,138,138,138,130,130,130,130,130,130,130,130,130,130,130,130,137,137,137,137,137,137,137,137,137,137,137,137,137,48,48,48,48,48,48,48,48,48,48,48,48,48,24,24,24,24,24,24,24,24,24,24,24,24,24,83,83,83,83,83,83,83,83,83,83,83,83,83,100,100,100,100,100,100,100,100,100,100,100,100,100,104,104,104,104,104,104,104,104,104,104,104,104,104,105,105,105,105,105,105,105,105,105,105,105,105,105,114,114,114,114,114,114,114,114,114,114,114,114,114,117,117,117,117,117,117,117,117,117,117,117,117,117,118,118,118,118,118,118,118,118,118,118,118,118,118,120,120,120,120,120,120,120,120,120,120,120,120,120,134,134,134,134,134,134,134,134,134,134,134,134,134,86,86,86,86,86,86,86,86,86,86,86,86,86,127,127,127,127,127,127,127,127,127,127,127,127,127,129,129,129,129,129,129,129,129,129,129,129,129,129,145,145,145,145,145,145,145,145,145,145,145,145,145,132,132,132,132,132,132,132,132,132,132,132,132,131,131,131,131,131,131,131,131,131,131,131,131,33,33,33,33,33,33,33,33,33,33,33,33,136,136,136,136,136,136,136,136,136,136,136,136,136,135,135,135,135,135,135,135,135,135,135,135,135,135,142,102,102,102,102,102,102,102,102,102,102,102,102,102,46,128,46,70,148,146,147,90,96,107,108,113,139,99,80,81,116,26,25,138,130,69,68,112,137,47,48,48,48,48,48,48,48,48,48,48,24,144,83,100,104,105,114,117,118,120,134,86,127,129,145,132,131,33,136,135,142,143,102,102,102,102,102,102,102,102,102,102,102,102,70,112,137,104,114,118,120,136,135,143,102,102,102,102,102,102,102,102,102,102,102,102,105,105,46,96,113,116,47,100,105,105,105,105,107,116,100,105,117,120,84,116,117,118,84,100,70,112,104,114,120,143,128,46,70,90,96,107,108,113,139,99,80,81,116,26,138,130,69,68,112,137,47,48,48,48,48,48,48,48,48,48,48,24,83,100,104,105,114,117,118,120,86,127,129,145,132,131,33,136,135,142,143,102,102,102,102,102,102,102,102,102,102,102,102,134,84,46,70,77,76,32,90,96,108,113,139,99,80,81,116,26,25,138,130,69,68,112,137,47,48,24,144,84,83,100,104,105,117,118,120,134,86,127,145,132,131,33,136,135,142,143,102,77,76,24,128,46,70,77,76,29,148,146,32,147,90,96,107,108,113,139,99,80,81,116,26,25,138,130,69,68,112,137,47,48,24,144,84,83,100,104,105,114,117,118,120,134,86,127,129,145,132,131,33,136,135,142,143,102,128,46,70,77,76,29,148,146,32,147,90,96,107,108,113,139,99,80,81,116,26,25,138,130,69,68,112,137,47,48,24,144,84,83,100,104,105,114,117,118,120,134,86,127,129,145,132,131,33,136,135,142,143,102,128,46,70,77,76,29,148,146,32,147,90,96,107,108,113,139,99,80,81,116,26,25,138,130,69,68,112,137,47,48,24,144,84,83,100,104,105,114,117,118,120,134,86,127,129,145,132,131,33,136,135,142,143,102,116,0,0,78,78],"f":"``````````````````````````{{ce}bd{{h{}{{f{b}}}}}}{{{j{ce}}g}bl{{l{}{{n{}}}}}{{h{}{{f{b}}}}}}{A`b}{A`{{Af{c{Ad{{Ab{cc}}}}}}}{}}132{{{Ah{ce}}}AhAjAj}{{{Ah{ce}}}AhAlAl}{{{j{ce}}}{{j{ce}}}{}{}}{{{j{ce}}}An{{B`{An}}}{{B`{An}}}}{{{j{ce}}}Bb{{B`{Bb}}}{{B`{Bb}}}}{{{j{eg}}}c{}{{B`{c}}}{{B`{c}}}}{{{j{eg}}}{{Bd{c}}}{}{{B`{{Bd{c}}}}}{{B`{{Bd{c}}}}}}{{{j{ce}}}Bf{{B`{Bf}}}{{B`{Bf}}}}{{{j{ce}}}Bh{{B`{Bh}}}{{B`{Bh}}}}{{{Ah{ce}}}{{Ah{ce}}}{}{}}{{{Bj{{j{ce}}}}}{{j{{Bj{c}}{Bj{e}}}}}{}{}}0{{{j{ce}}}Bb{{Bl{Bb}}}{{Bl{Bb}}}}9{{{j{ce}}}An{{Bl{An}}}{{Bl{An}}}}{{{j{ce}}}Bf{{Bl{Bf}}}{{Bl{Bf}}}}{{{j{ce}}}Bh{{Bl{Bh}}}{{Bl{Bh}}}}{{{j{eg}}}c{}{{Bl{c}}}{{Bl{c}}}}{{{j{eg}}}{{Bd{c}}}{}{{Bl{{Bd{c}}}}}{{Bl{{Bd{c}}}}}}7{{ce}Bndd}{A`{{Af{{Ad{c}}{C`{A`}}}}}{}}{{A`e}{{Cb{A`e}}}{}{{h{A`}{{f{{Ad{c}}}}}}}}{ce{}{}}00000000000{{{Ah{ce}}}{{Ad{{Ab{ce}}}}}{}{}}{{A`c}{{Cd{A`}}}d}{{{j{ce}}}{{Ad{Cf}}}CfCf}{{ce}Chd{{d{}{{n{}}}}}}`{{A`g}{{Cj{eA`g}}}{}Cl{{h{c}{{f{e}}}}}}{{A`Cn}{{D`{A`}}}}{A`{{Db{A`c}}}{`Dd}}{{{j{ce}}}{{j{ce}}}DdDd}{{{Df{ce}}}{{Df{ce}}}ll}{{{Ah{ce}}}{{Ah{ce}}}DdDd}{{{Dh{c}}}{{Dh{c}}}Dd}{DjDj}{{{Dl{c}}}{{Dl{c}}}Dd}{{{j{ce}}{j{ce}}}BnDdDd}{{ce}Bn{}{}}00000{eDnDd{{d{}{{n{c}}}}}}{{{j{ce}}{j{ce}}}E`EbEb}{{A`e}{{Ed{A`e}}}{}{{h{cc}{{f{{Af{c{Ab{cc}}}}}}}}}}{{{j{ce}}}gl{{l{}{{n{}}}}}Ef}{A`{{Ad{c}}}Eh}{A`{{Ej{c}}}{}}{{A`Cn}{{El{A`}}}}{{A`Cn}{{En{A`}}}}{c{}d}{A`c{}}{e{{F`{c}}}{}{{d{}{{n{c}}}}}}{{{j{ce}}Cn}BnFbFb}{{A`c}bCl}{{{j{ce}}}Cnl{{l{}{{n{}}}}}}{A`{{Fd{cCn}}}{}}{{A`g}{{Fd{eCn}}}{}{FfFh}{{h{c}{{f{e}}}}}}{A`{{Fj{A`}}}}{{A`e}{{Fl{A`e}}}{}{{h{cc}{{f{b}}}}}}{{A`e}{{Fn{A`e}}}{}{{h{cc}{{f{b}}}}}}{A`{{G`{A`}}}}{{{j{ce}}}{}Aj{{Aj{}{{Gb{}}}}}}{{{j{ce}}}{}Al{{Al{}{{Gb{}}}}}}{{{j{ce}}}BhCfCf}{{ceg}{{Ad{Df}}}dd{{h{}{{f{b}}}}}}{{A`Cn}A`}0{A`{{Gd{A`}}}}{{A`g}{{Gf{A`eg}}}{}{FfFh}{{h{c}{{f{e}}}}}}{{{j{ce}}ik}g{}{}{}{{Gh{c}{{f{g}}}}}{{Gh{e}{{f{g}}}}}}{{{j{eg}}}c{}{{Gj{c}}}{{Gj{c}}}}{{{j{ce}}gkm}i{}{}{}{}{{Gh{gc}{{f{i}}}}}{{Gh{ge}{{f{i}}}}}}{cGld}{{{j{ce}}{j{ce}}}bClCl}{{{Ah{ce}}{Ah{ce}}}bClCl}{{{Dh{c}}{Dh{c}}}bCl}{{DjDj}b}{{{Dl{c}}{Dl{c}}}bCl}{{ce}bdd}{A`{{Af{c{C`{A`}}}}}{}}{{{j{ce}}Bh}c{}Gn}{{{j{ce}}Bh}eGn{}}{{{j{eg}}i}Bn{}{{H`{c}}}{{H`{c}}}{{d{}{{n{c}}}}}}{{{j{{Af{ce}}{Af{ge}}}}}{{Af{{j{cg}}e}}}{}{}{}}{{{j{{Ab{ce}}{Ab{cg}}}}}{{Ab{c{j{eg}}}}}{}{}{}}{{{j{ce}}}Hbdd}{{{j{ce}}}Hb{}{}}0{{{j{{Ad{c}}{Ad{e}}}}}{{Ad{{j{ce}}}}}{}{}}{{{j{{Af{ce}}{Af{cg}}}}}{{Af{c{j{eg}}}}}{}{}{}}{{{j{{Ab{ce}}{Ab{ge}}}}}{{Ab{{j{cg}}e}}}{}{}{}}{{{j{ce}}}{{Af{{Bd{Hd}}Hf}}}FbFb}{{A`g}{{Hh{A`g}}}{}{}{{h{c}{{f{{Ad{e}}}}}}}}{{A`e}{{Hj{A`e}}}{}{{h{c}{{f{b}}}}}}{{{j{ce}}g}Adl{{l{}{{n{}}}}}{{h{}{{f{b}}}}}}{{{j{ce}}i}{{Ad{g}}}l{{l{}{{n{}}}}}{}{{h{}{{f{{Ad{g}}}}}}}}{{A`e}{{Ad{c}}}{}{{h{c}{{f{b}}}}}}0{{A`e}{{Ad{{Ab{Cnc}}}}}{}{{h{c}{{f{b}}}}}}{A`{{Hl{A`ce}}}d{}}{{{j{ce}}}{{j{ec}}}{}{}}{{{Ah{ce}}}{{Ah{ec}}}{}{}}{{{j{ce}}}{{Af{BnHf}}}HnHn}{{{j{ce}}I`}{{Af{BnIb}}}GnGn}{{{j{ce}}I`}{{Af{BnIb}}}IdId}{{{Df{ce}}I`}Ifll}{{{Ah{ce}}I`}IfGnGn}{{{Dh{c}}I`}IfGn}{{DjI`}If}{{{Dl{c}}I`}IfGn}{{ceg}ed{}{{h{e}{{f{e}}}}}}{{{j{ce}}gi}gl{{l{}{{n{}}}}}{}{{h{g}{{f{g}}}}}}{{A`e}{{Ad{c}}}{}{{h{cc}{{f{c}}}}}}{{A`cg}{{Af{ci}}}{}{}{{h{ce}{{f{c}}}}}{}}{{A`cg}{{Ad{c}}}{}{}{{h{ce}{{f{c}}}}}}{{A`cg}{{Dl{c}}}{}{}{{h{ce}{{f{{Dl{c}}}}}}}}{{{j{ce}}g}Bnl{{l{}{{n{}}}}}h}{{A`Bh}{{Ih{A`}}}}{{A`Bhe}{{Ij{A`e}}}{}{{h{ch}{{f{If}}}}}}{cc{}}{{{Af{ce}}}{{j{ec}}}{}{}}11{{{j{ce}}}{{Ah{ce}}}{}{}}222{{A`c}{}{{Il{A`}}}}{{A`g}{{Cj{eA`g}}}{}Cl{{h{c}{{f{e}}}}}}{{{Ah{ce}}}b{}{}}0{{{j{ce}}g}BnFhFhIn}{{{Ah{ce}}g}BnFhFhIn}{{{Ah{ce}}ce}{{Ab{ce}}}{}{}}{{{Ah{ce}}c}c{}{}}{{{Ah{ce}}e}e{}{}}{{ce}J`d{{d{}{{n{}}}}}}{{A`e}{{J`{A`}}}{}{{d{}{{n{c}}}}}}{{A`e}{{Jb{A`}}}{}{{d{}{{n{c}}}}}}{cJdd}{{A`c}{{Jd{A`}}}{}}{{ce}{{Jf{e}}}d{{h{}{{f{}}}}}}{{A`e}{{Jf{A`e}}}{}{{h{}{{f{c}}}}}}{{{j{ce}}}{{Af{ec}}}{}{}}{ce{}{}}00000{c{}{}}{A`{{Fd{c{Ej{e}}}}}{FhFf}{}}{{A`g}{{Fd{e{Ej{c}}}}}{}{FhFf}{{h{c}{{f{e}}}}}}{A`{{Jh{A`}}}}{{A`g}{{Jj{A`g}}}{}{FhFf}{{h{c}{{f{e}}}}}}{{{j{cc}}}c{}}{{{Dl{c}}}c{}}7{{{j{ce}}}jd{{d{}{{n{}}}}}}{{{Ah{ce}}}c{}{{Gj{c}}}}{{{Dh{c}}}{{Ad{{Ab{cc}}}}}Dd}{{{Ah{ec}}}c{}{{Gj{c}}}}`{{{Ah{ce}}}b{}{}}{{{Dl{c}}}b{}}{{{j{ce}}}b{}{}}202{{{j{ce}}}j{}{}}0{{ce}{{Jl{ce}}}{}{{h{c}{{f{c}}}}}}`{{cBh}Jnd}{{A`Bh}Jn}{{{Ah{ce}}}{{Ad{c}}}{}{}}{{{Ah{ce}}}{{Ad{e}}}{}{}}{{A`Cn}{{K`{c}}}{}}{{A`Cne}{{K`{c}}}{}{{h{cc}{{f{E`}}}}}}{{A`Cng}{{K`{c}}}{}Eb{{h{c}{{f{e}}}}}}210{cKbd}{A`Kb}{{ce}{{Kd{e}}}d`}{{A`c}{{Kd{c}}}{{h{}{{f{b}}}}}}{{{j{ce}}}Adl{{l{}{{n{}}}}}}{{{j{ce}}}{{Ad{c}}}{}{}}:{{{Ah{ce}}}{{Ab{{Ad{c}}{Ad{e}}}}}{}{}}{{{j{ce}}i}{{j{ge}}}{}{}{}{{Gh{c}{{f{{j{ge}}}}}}}}{{{Ah{ce}}i}{{Ah{ge}}}{}{}{}{{Gh{c}{{f{{Ah{ge}}}}}}}}{{{j{ce}}c}c{}{}}{{{j{ce}}}cKf{}}{{{j{ce}}g}c{}{}{{Gh{e}{{f{c}}}}}}{{{Ah{ce}}c}c{}{}}{{{Ah{ce}}g}c{}{}{{Gh{}{{f{c}}}}}}{{{j{ce}}}CnKh{{Kh{}{{n{}}}}}}{{{j{cc}}g}{{j{ee}}}{}{}{{Gh{c}{{f{e}}}}}}{{{Ah{ce}}im}{{Ah{gk}}}{}{}{}{{Gh{c}{{f{g}}}}}{}{{Gh{e}{{f{k}}}}}}{{{j{ce}}im}{{j{gk}}}{}{}{}{{Gh{c}{{f{g}}}}}{}{{Gh{e}{{f{k}}}}}}{{{j{ce}}gko}{{j{im}}}{}{}{}{}{{Gh{gc}{{f{i}}}}}{}{{Gh{ge}{{f{m}}}}}}{A`{{Kj{A`c}}}{}}{{{j{ce}}i}{{j{ge}}}{}{}{}{{Gh{c}{{f{g}}}}}}{{{Ah{ce}}i}{{Ah{ge}}}{}{}{}{{Gh{c}{{f{g}}}}}}{{A`g}{{Kl{A`g}}}{}{}{{h{c}{{f{e}}}}}}{{{j{ce}}i}{{j{cg}}}{}{}{}{{Gh{e}{{f{g}}}}}}{{{Ah{ce}}i}{{Ah{cg}}}{}{}{}{{Gh{e}{{f{g}}}}}}{cAdd}{A`{{Ej{c}}}{}}{{A`e}{{Ej{c}}}{}{{h{cc}{{f{E`}}}}}}{{A`g}{{Ej{c}}}{}Eb{{h{c}{{f{e}}}}}}{{ce}Knd{{d{}{{n{}}}}}}{{A`e}{{Kn{A`}}}{}{{d{}{{n{c}}}}}}{{A`eg}{{L`{A`g}}}{}{{d{}{{n{c}}}}}{{h{cc}{{f{b}}}}}}{{cei}{{Lb{i}}}dd{}{{h{}{{f{g}}}}}}{{A`ci}{{Lb{A`i}}}d{}{}{{h{e}{{f{g}}}}}}8765{A`{{Dh{c}}}{}}{{A`e}{{Dh{c}}}{}{{h{cc}{{f{E`}}}}}}{{A`g}{{Dh{c}}}{}Ld{{h{c}{{f{e}}}}}}{A`Lf}{cLhd}{A`{{Lh{A`}}}}{ced{}}{Ljc{}}{cBn{}}{c{{Ab{egikmoAaAcAe}}}{}{}{}{}{}{}{}{}{}{}}{c{{Ab{egikmoAaAcAeAgAiAk}}}{}{}{}{}{}{}{}{}{}{}{}{}{}}{c{{Ab{egikmoAaAcAeAg}}}{}{}{}{}{}{}{}{}{}{}{}}{c{{Ab{egikmoAaAcAeAgAi}}}{}{}{}{}{}{}{}{}{}{}{}{}}{c{{Ab{egikmoAaAc}}}{}{}{}{}{}{}{}{}{}}{c{{Ab{egikmoAa}}}{}{}{}{}{}{}{}{}}{c{{Ab{egikmo}}}{}{}{}{}{}{}{}}{c{{Ab{egikm}}}{}{}{}{}{}{}}{c{{Ab{egik}}}{}{}{}{}{}}{c{{Ab{egi}}}{}{}{}{}}{c{{Ab{eg}}}{}{}{}}{c{{Ab{e}}}{}{}}{A`c{}}{c{{Ll{e}}}{}{}}{{{j{ce}}}Adl{{l{}{{n{}}}}}}{{{j{ce}}}AdLn{{Ln{}{{n{}}}}}}{A`{{Ad{c}}}Eh}{{{j{ce}}Cn}Adl{{l{}{{n{}}}}}}{{{Ah{ce}}ce}{{Ab{ce}}}{}{}}{{{Ah{ce}}}{{Ab{ce}}}KfKf}{{{Ah{ce}}gi}{{Ab{ce}}}{}{}{{Gh{}{{f{c}}}}}{{Gh{}{{f{e}}}}}}{{A`Cne}{{M`{A`e}}}{}{{h{Cn}{{f{c}}}}}}{{{j{ce}}{j{ce}}}{{Ad{E`}}}LdLd}{{eg}Cn{}{{d{}{{n{c}}}}}{{h{c}{{f{b}}}}}}{{{j{ce}}g}{{Ab{ii}}}l{{l{}{{n{}}}}}{{h{}{{f{b}}}}}{KfH`}}{{A`i}{{Ab{km}}}{}{}{}{{h{c}{{f{{j{eg}}}}}}}{Kf{H`{e}}}{Kf{H`{g}}}}{A`{{Ab{ei}}}{}{Kf{H`{c}}}{}{Kf{H`{g}}}}{cMbd}{{Mde}{{Ad{c}}}{}{{Gh{c}{{f{b}}}}}}{{A`e}{{Mf{A`e}}}{}{{h{c}{{f{b}}}}}}{{A`Cn}{{Mh{A`}}}}{{{Bj{{j{ce}}}}Mj}MlMn{{Mn{}{{f{}}}}}}{{{j{ce}}g}{{Ad{Cn}}}l{{l{}{{n{}}}}}{{h{}{{f{b}}}}}}{A`{{Ad{Cn}}}}{{A`e}{{Ad{Cn}}}{}{{h{cc}{{f{E`}}}}}}{{A`g}{{Ad{Cn}}}{}Eb{{h{c}{{f{e}}}}}}210{A`{{Dh{Cn}}}}{{A`e}{{Dh{Cn}}}{}{{h{cc}{{f{E`}}}}}}{{A`g}{{Dh{Cn}}}{}Ld{{h{c}{{f{e}}}}}}{{A`e}{{N`{A`e}}}{}{{h{c}{{f{b}}}}}}{A`{{Nb{A`}}}}{{gk}{{Af{ie}}}{}{}{{d{}{{n{{Af{ce}}}}}}}{}{{Gh{{Nd{e}}}{{f{i}}}}}}{{A`g}{{Af{ec}}}{}{}{{Gh{{Nd{A`c}}}{{f{e}}}}}}{A`{{Ad{e}}}{}{{Nf{c}}}}{cNhd}{cNjd}{cNld}{{{j{ce}}{Bd{Hd}}}{{Af{CnHf}}}NnNn}{{{j{ce}}{Bd{Hd}}}{{Af{BnHf}}}NnNn}{{{j{ce}}Jn}{{Af{CnHf}}}FbFb}{{{j{ce}}{Ej{Hd}}}{{Af{CnHf}}}NnNn}{{{j{ce}}Jn}{{Af{CnHf}}}NnNn}{{{j{ce}}Hd{Ej{Hd}}}{{Af{CnHf}}}FbFb}{{{Ah{cc}}e}c{}{{Gh{cc}{{f{c}}}}}}{{cCn}{{O`{c}}}Dd}{cObd}{{{j{ce}}g}AdLn{{Ln{}{{n{}}}}}{{h{}{{f{b}}}}}}{{{j{ce}}gi}gLn{{Ln{}{{n{}}}}}{}{{h{g}{{f{g}}}}}}{{{j{ce}}}{{Ad{e}}}{}{}}{{{Ah{ce}}}{{Ad{e}}}{}{}}{{{j{ce}}i}{{j{cg}}}{}{}{}{{Gh{e}{{f{{j{cg}}}}}}}}{{{Ah{ce}}i}{{Ah{cg}}}{}{}{}{{Gh{e}{{f{{Ah{cg}}}}}}}}{{{j{ce}}e}e{}{}}{{{j{ce}}}e{}Kf}{{{j{ce}}g}e{}{}{{Gh{c}{{f{e}}}}}}{{{Ah{ce}}e}e{}{}}{{{Ah{ce}}g}e{}{}{{Gh{}{{f{e}}}}}}{{{j{ce}}Od}{{Af{OfHf}}}OhOh}{{A`e}Cn{}{{d{}{{n{c}}}}}}{{{j{ce}}}{{Ab{Cn{Ad{Cn}}}}}l{{l{}{{n{}}}}}}{cK`d}{A`{{K`{c}}}{}}{{A`e}{{K`{c}}}{}{{h{cc}{{f{E`}}}}}}{{A`g}{{K`{c}}}{}Eb{{h{c}{{f{e}}}}}}03210{{{j{ce}}}{{Ad{Cf}}}CfCf}`{A`{{Ad{e}}}{}{{Oj{c}}}}{{A`Cn}{{Ol{c}}}{}}{{A`e}{{On{A`e}}}{}{{h{c}{{f{b}}}}}}{{A`e}{{A`{A`e}}}{}{{h{c}{{f{b}}}}}}{A`{{Ab{{Ab{A`}}{Ab{A`}}}}}}{ce{}{}}00000{cJn{}}`{{A`e}{{Ad{c}}}{}{{h{cc}{{f{c}}}}}}0{A`{{Af{ce}}}{}{}}{c{{Af{e}}}{}{}}00000000000{A`{{Af{Cn{Ab{Cn{Ad{Cn}}}}}}}}{A`{{Ad{A`c}}}{{`{A`}}}}{A`{{Af{A`c}}}Eh}{A`{{Ah{A`c}}}Eh}{cAj{}}00000{{cg}{{Al{cg}}}{}{}{{h{c}{{f{{Ad{e}}}}}}}}{A`{{An{A`}}}}{{A`g}{{AA`{A`eg}}}{}{FfFh}{{h{c}{{f{e}}}}}}{{{j{ce}}}c{}Gn}{{{j{ce}}}eGn{}}{{A`e}{{AAb{A`e}}}{}{{h{c}}}}{A`{{AAd{A`}}}}{A`{{AAf{A`}}}}{{{j{ce}}{Bd{Hd}}}{{Af{CnHf}}}HnHn}{{{j{ce}}{Bd{Hd}}}{{Af{BnHf}}}HnHn}{{{j{ce}}AAh}{{Af{BnHf}}}HnHn}{{ce}AAjdd}{{ce}AAldd}{{A`c}{{AAl{A`}}}d}{{A`c}{{AAn{A`}}}d}`````````````````````````````````````````````````````````````````````{{{Jh{g}}k}{{Fd{ci}}}{FhFf}{}{{l{}{{n{{Ab{ce}}}}}}}{}{{h{{Ad{i}}ce}{{f{{Ad{i}}}}}}}}{{{Nh{c}}g}bl{}{{h{e}{{f{b}}}}}}{ce{}{}}00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000{{{El{c}}}{{El{c}}}{Ddl}}{{{Hl{gce}}}{{Hl{gce}}}d{}{{l{}{{n{{Af{ce}}}}}}Dd}}{{{Ij{ce}}}{{Ij{ce}}}{}{}}{{{Ih{c}}}{{Ih{c}}}Dd}{{{D`{c}}}{{D`{c}}}{Ddl}}{{{Kd{ce}}}{{Kd{ce}}}{lDd}Dd}{{{L`{ceg}}}{{L`{ceg}}}llDd}{{{Mh{c}}}{{Mh{c}}}{Ddl}}{{{Nb{c}}}{{Nb{c}}}{Ddl}}{{{AAf{c}}}{{AAf{c}}}{Ddl}}{{{Lf{c}}}{{Lf{c}}}{lDdDd}}{{{J`{ce}}}{{J`{ce}}}DdDd}{{{Jb{ce}}}{{Jb{ce}}}{lDd}{{l{}{{n{}}}}Dd}}{{{Nh{c}}}{{Nh{c}}}{lDd}}{{{Cd{ce}}}{{Cd{ce}}}{lDd}Dd}{{{Cb{ce}}}{{Cb{ce}}}DdDd}{{{AAd{c}}}{{AAd{c}}}Dd}{{{Ad{ce}}}{{Ad{ce}}}{lDd}{{`{c}}Dd}}{{{Hj{ce}}}{{Hj{ce}}}DdDd}{{{Hh{ce}}}{{Hh{ce}}}DdDd}{{{N`{ce}}}{{N`{ce}}}DdDd}{{{AAb{ce}}}{{AAb{ce}}}DdDd}{{{En{c}}}{{En{c}}}{lDd}}{{{F`{ec}}}{{F`{ec}}}{}{Dd{l{}{{n{c}}}}}}{{{C`{c}}}{{C`{c}}}{lDd}}{{{AB`{c}}}{{AB`{c}}}{lDd}}{{{Jh{c}}}{{Jh{c}}}Dd}{{{Jf{ce}}}{{Jf{ce}}}{lDd}Dd}{{{Lh{c}}}{{Lh{c}}}{lDd}}{{{M`{ce}}}{{M`{ce}}}DdDd}{{{Mb{c}}}{{Mb{c}}}{lDd}}{{{Nj{c}}}{{Nj{c}}}{Ddl}}{{{Nl{c}}}{{Nl{c}}}{}}{{{O`{c}}}{{O`{c}}}Dd}{{{Al{ce}}}{{Al{ce}}}DdDd}{{{Jl{ce}}}{{Jl{ce}}}DdDd}{{{On{ce}}}{{On{ce}}}DdDd}{{{ABb{c}}}{{ABb{c}}}{EhDd}}{{{Ah{ce}}}{{Ah{ce}}}{{l{}{{n{}}}}Dd}{EhDd}}{{{Af{ce}}}{{Af{ce}}}{{l{}{{n{}}}}Dd}{EhDd}}{{{Db{ce}}}{{Db{ce}}}{{l{}{{n{}}}}DdDd}{`DdDd}}{{{AA`{ceg}}}{{AA`{ceg}}}{Ddl}DdDd}{{{An{c}}}{{An{c}}}{lDd}}{{{AAl{ce}}}{{AAl{ce}}}DdDd}{{{AAn{ce}}}{{AAn{ce}}}DdDd}{{{Ll{c}}}{{Ll{c}}}Dd}{{ce}Bn{}{}}000000000000000000000000000000000000000000000{{{Hj{gi}}}m{}{}{{l{}{{n{{Af{ce}}}}}}}{{h{c}{{f{b}}}}}{}{{Ef{k}}}}{{{Hh{gk}}}o{}{}{{l{}{{n{{Af{ce}}}}}}}{}{{h{c}{{f{{Ad{i}}}}}}}{}{{Ef{m}}}}{{{AAb{ce}}}ilh{}{{Ef{g}}}}{{{Jh{g}}}{{Fd{ci}}}{FhFf}{}{{l{}{{n{{Ab{ce}}}}}}}{Kf{H`{e}}}}{{{El{c}}}Cnl}{{{Mh{c}}}Cnl}{{{Nb{c}}}Cnl}{{{Lf{c}}}Cn{lDd}}{{{Nh{c}}}Cnl}{{{Ad{ce}}}Cnl{{`{c}}}}{{{En{c}}}Cnl}{{{AA`{ceg}}}Cnl{FfFh}{{h{}{{f{e}}}}}}{{{An{c}}}Cnl}{{{ABd{ceg}}}Bn{}l{}}{{{ABf{c}}}Bnl}{{{A`{ce}}I`}If{lGn}{}}{{{El{c}}I`}If{lGn}}{{{Hl{gce}}I`}Ifd{}{{l{}{{n{{Af{ce}}}}}}Gn}}{{{Ij{ce}}I`}Ifl{{h{h}{{f{If}}}}}}0{{{Ih{c}}I`}Ifl}00000000{{{Kd{ce}}I`}If{lGn}{}}{{{L`{ceg}}I`}If{lGn}{lGn}{}}{{{Mf{ce}}I`}If{lGn}{}}{{{Mh{c}}I`}If{lGn}}{{{Nb{c}}I`}If{lGn}}{{{AAf{c}}I`}Ifl}{{{Lf{c}}I`}If{lDdGn}}{{{J`{ce}}I`}IfGnGn}{{{Jb{ce}}I`}If{lGn}{{l{}{{n{}}}}Gn}}{{{Nh{c}}I`}If{lGn}}{{{Cd{ce}}I`}If{lGn}Gn}{{{Cb{ce}}I`}IfGn{}}{{{AAd{c}}I`}IfGn}{{{Ad{ce}}I`}If{lGn}{{`{c}}Gn}}{{{Hj{ce}}I`}IfGn{}}{{{Hh{ce}}I`}IfGn{}}{{{N`{ce}}I`}IfGn{}}{{{AAb{ce}}I`}IfGn{}}{{{En{c}}I`}If{lGn}}{{{F`{ec}}I`}IfGn{{l{}{{n{c}}}}Gn}}{{{C`{c}}I`}Ifl}{{{C`{c}}I`}If{lGn}}{{{Jh{c}}I`}IfGn}{{{Jf{ce}}I`}If{lGn}Gn}{{{Lh{c}}I`}If{lGn}}{{{M`{ce}}I`}IfGn{}}{{{Mb{c}}I`}If{lGn}}{{{Nd{ce}}I`}IfGnGn}{{{Nj{c}}I`}If{Gnl}}{{{Nl{c}}I`}IfGn}{{{O`{c}}I`}IfGn}{{{Al{ce}}I`}IfGn{}}{{{Jl{ce}}I`}IfGn{}}{{{On{ce}}I`}If{lGn}{}}{{{Ab{c}}I`}If{lGn}}{{{ABb{c}}I`}If{EhGn}}{{{Ah{ce}}I`}If{{l{}{{n{}}}}Gn}{EhGn}}{{{Af{ce}}I`}If{{l{}{{n{}}}}Gn}{EhGn}}{{{Db{ce}}I`}If{{l{}{{n{}}}}DdGn}{`DdGn}}{{{AA`{ceg}}I`}If{lGn}{GnFhFf}{}}{{{An{c}}I`}If{lGn}}{{{AAl{ce}}I`}IfGnGn}{{{AAn{ce}}I`}IfGnGn}{{{Ll{c}}I`}IfGn}{{{Hl{gce}}im}id{}{{l{}{{n{{Af{ce}}}}}}}{}{}{{h{ik}{{f{i}}}}}}{{{L`{ceg}}im}ill`{}{}{{h{ik}{{f{i}}}}}}{{{Nb{c}}ei}el{}{}{{h{eg}{{f{e}}}}}}{{{AAf{c}}ei}el{}{}{{h{eg}{{f{e}}}}}}{{{J`{ce}}gk}gl{{l{}{{n{}}}}}{}{}{{h{gi}{{f{g}}}}}}{{{Jb{ce}}gk}gl{{l{}{{n{}}}}}{}{}{{h{gi}{{f{g}}}}}}{{{Nh{c}}ei}el{}{}{{h{eg}{{f{e}}}}}}{{{Cd{ce}}gk}gl{Ddl}{}{}{{h{gi}{{f{g}}}}}}{{{AAd{e}}gk}g{}{{l{}{{n{{Ad{c}}}}}}}{}{}{{h{gi}{{f{g}}}}}}{{{Ad{ce}}gk}gl{{`{c}}}{}{}{{h{gi}{{f{g}}}}}}{{{Hj{gi}}ko}k{}{}{{l{}{{n{{Af{ce}}}}}}}{{h{c}{{f{b}}}}}{}{}{{h{km}{{f{k}}}}}}{{{Hh{gk}}mAa}m{}{}{{l{}{{n{{Af{ce}}}}}}}{}{{h{c}{{f{{Ad{i}}}}}}}{}{}{{h{mo}{{f{m}}}}}}{{{N`{ce}}gk}gl{{h{}{{f{b}}}}}{}{}{{h{gi}{{f{g}}}}}}{{{AAb{ce}}gk}glh{}{}{{h{gi}{{f{g}}}}}}{{{F`{Ag{Ab{{Ab{cegikmoAaAc}}Ae}}}}AiAm}Ai{}{}{}{}{}{}{}{}{}{}{{l{}{{n{{Ab{{Ab{cegikmoAaAc}}Ae}}}}}}}{}{}{{h{AiAk}{{f{Ai}}}}}}{{{F`{o{Ab{{Ab{cegik}}m}}}}AaAe}Aa{}{}{}{}{}{}{{l{}{{n{{Ab{{Ab{cegik}}m}}}}}}}{}{}{{h{AaAc}{{f{Aa}}}}}}{{{F`{Ak{Ab{{Ab{cegikmoAaAcAeAg}}Ai}}}}AmBa}Am{}{}{}{}{}{}{}{}{}{}{}{}{{l{}{{n{{Ab{{Ab{cegikmoAaAcAeAg}}Ai}}}}}}}{}{}{{h{AmAo}{{f{Am}}}}}}{{{F`{Aa{Ab{{Ab{cegikm}}o}}}}AcAg}Ac{}{}{}{}{}{}{}{{l{}{{n{{Ab{{Ab{cegikm}}o}}}}}}}{}{}{{h{AcAe}{{f{Ac}}}}}}{{{F`{Ac{Ab{{Ab{cegikmo}}Aa}}}}AeAi}Ae{}{}{}{}{}{}{}{}{{l{}{{n{{Ab{{Ab{cegikmo}}Aa}}}}}}}{}{}{{h{AeAg}{{f{Ae}}}}}}{{{F`{k{Ab{{Ab{ceg}}i}}}}mAa}m{}{}{}{}{{l{}{{n{{Ab{{Ab{ceg}}i}}}}}}}{}{}{{h{mo}{{f{m}}}}}}{{{F`{Ai{Ab{{Ab{cegikmoAaAcAe}}Ag}}}}AkAo}Ak{}{}{}{}{}{}{}{}{}{}{}{{l{}{{n{{Ab{{Ab{cegikmoAaAcAe}}Ag}}}}}}}{}{}{{h{AkAm}{{f{Ak}}}}}}{{{F`{Ae{Ab{{Ab{cegikmoAa}}Ac}}}}AgAk}Ag{}{}{}{}{}{}{}{}{}{{l{}{{n{{Ab{{Ab{cegikmoAa}}Ac}}}}}}}{}{}{{h{AgAi}{{f{Ag}}}}}}{{{F`{i{Ab{{Ab{ce}}g}}}}ko}k{}{}{}{{l{}{{n{{Ab{{Ab{ce}}g}}}}}}}{}{}{{h{km}{{f{k}}}}}}{{{F`{m{Ab{{Ab{cegi}}k}}}}oAc}o{}{}{}{}{}{{l{}{{n{{Ab{{Ab{cegi}}k}}}}}}}{}{}{{h{oAa}{{f{o}}}}}}{{{C`{c}}ei}el{}{}{{h{eg}{{f{e}}}}}}{{{Jh{g}}ik}{{Fd{ci}}}{FhFf}{}{{l{}{{n{{Ab{ce}}}}}}}Dd{{h{ice}{{f{i}}}}}}{{{Jf{ce}}gk}gl`{}{}{{h{gi}{{f{g}}}}}}{{{Lh{c}}ei}el{}{}{{h{eg}{{f{e}}}}}}{{{M`{ce}}gk}gl{{h{Cn}{{f{}}}}}{}{}{{h{gi}{{f{g}}}}}}{{{Mb{c}}ei}el{}{}{{h{eg}{{f{e}}}}}}{{{Nd{ge}}im}i{}{}{{l{}{{n{{Af{ce}}}}}}}{}{}{{h{ik}{{f{i}}}}}}{{{Nj{c}}ei}el{}{}{{h{eg}{{f{e}}}}}}{{{O`{c}}ei}eDd{}{}{{h{eg}{{f{e}}}}}}{{{On{ce}}gk}gl{{h{}{{f{b}}}}}{}{}{{h{gi}{{f{g}}}}}}{{{AAn{ce}}gk}gll{}{}{{h{gi}{{f{g}}}}}}{{{Jh{g}}i}{{Fd{ce}}}{FhFf}{}{{l{}{{n{{Ab{ce}}}}}}}{{h{ece}{{f{e}}}}}}{{{Jh{g}}km}{{Fd{ci}}}{FhFf}{}{{l{}{{n{{Ab{ce}}}}}}}{}{{h{ce}{{f{i}}}}}{{h{ice}{{f{i}}}}}}{cc{}}00000000000000000000000000000000000000000000000000000{{{Ab{c}}}{{Ll{Ab}}}d}{{{Ab{ceg}}}{{Ll{Ab}}}ddd}{{{Ab{cegikm}}}{{Ll{Ab}}}dddddd}{{{Ab{cegikmoAa}}}{{Ll{Ab}}}dddddddd}{{{Ab{cegi}}}{{Ll{Ab}}}dddd}{{{Ab{cegikmoAaAc}}}{{Ll{Ab}}}ddddddddd}{{{Ab{cegikmoAaAcAeAg}}}{{Ll{Ab}}}ddddddddddd}{{{Ab{cegikmoAaAcAe}}}{{Ll{Ab}}}dddddddddd}{{{Ab{cegikmoAaAcAeAgAi}}}{{Ll{Ab}}}dddddddddddd}{{{Ab{ce}}}{{Ll{Ab}}}dd}{{{Ab{cegik}}}{{Ll{Ab}}}ddddd}{{{Ab{cegikmo}}}{{Ll{Ab}}}ddddddd}{ce{}{}}00000000000000000000000000000000000000000000000000000{{{Ah{ce}}}{{ABb{e}}}{{l{}{{n{}}}}}Eh}111{{{Cj{ceg}}}iCll{{h{}{{f{c}}}}}{}}22{{{D`{c}}}el{}}33333333333333333333333333333{{{Nl{c}}}{{Nl{c}}}l}444444444444444{{{Nh{c}}}{{Ab{Adc}}}l}{{{El{c}}}Cnl}{{{Lf{c}}}{{Ad{e}}}{lDd}{}}{{{Nh{c}}}{{Ad{e}}}l{}}{{{Jh{g}}}{{Fd{ce}}}{FhFf}Eb{{l{}{{n{{Ab{ce}}}}}}}}{{{Jh{g}}i}{{Fd{ce}}}{FhFf}{}{{l{}{{n{{Ab{ce}}}}}}}{{h{cee}{{f{E`}}}}}}{{{Jh{g}}k}{{Fd{ce}}}{FhFf}{}{{l{}{{n{{Ab{ce}}}}}}}Eb{{h{ce}{{f{i}}}}}}210{{{Jh{g}}}{{Fd{c{Dh{e}}}}}{FhFf}Eb{{l{}{{n{{Ab{ce}}}}}}}}{{{Jh{g}}i}{{Fd{c{Dh{e}}}}}{FhFf}{}{{l{}{{n{{Ab{ce}}}}}}}{{h{cee}{{f{E`}}}}}}{{{Jh{g}}k}{{Fd{c{Dh{e}}}}}{FhFf}{}{{l{}{{n{{Ab{ce}}}}}}}Eb{{h{ce}{{f{i}}}}}}{c{{Ab{egikmoAa}}}{}{}{}{}{}{}{}{}}{c{{Ab{e}}}{}{}}{c{{Ab{egi}}}{}{}{}{}}{c{{Ab{egikmoAaAcAe}}}{}{}{}{}{}{}{}{}{}{}}{c{{Ab{egikmoAaAc}}}{}{}{}{}{}{}{}{}{}}{c{{Ab{egikmoAaAcAeAg}}}{}{}{}{}{}{}{}{}{}{}{}}{c{{Ab{egikmoAaAcAeAgAi}}}{}{}{}{}{}{}{}{}{}{}{}{}}{c{{Ab{eg}}}{}{}{}}{c{{Ab{egikmoAaAcAeAgAiAk}}}{}{}{}{}{}{}{}{}{}{}{}{}{}}{c{{Ab{egik}}}{}{}{}{}{}}{c{{Ab{egikmo}}}{}{}{}{}{}{}{}}{c{{Ab{egikm}}}{}{}{}{}{}{}}{cBn{}}5204798<13:65;<5607:4;98231213<8974:5;06126087;459<:35201364:<7;9851;32<6894:7051<46:302;7859<0;5:31289764520;<58:1463797<21983064:5;2546798<13:;2;65:3410<897;0798<2134:5631046;7:98<52674;:25309<18231:95864<;073;7409658<21:346<8910;5:72<890764213:5;0;:312<8975647640;5:83129<7:146239580<;<6432810;5:97;91467280<5:31:0346;52<87945267;910<38:96;45:312<807;385<:261749:9312;<486753;856719<:240:;5312<89764:;2135467980<565312<89704:;{{{El{c}}}Cnl}{{{A`{ce}}}{{Ad{g}}}{lDd}{{h{}{{f{b}}}}}{}}{{{El{c}}}{{Ad{e}}}l{}}{{{Hl{gce}}}{{Ad{i}}}d{}{{l{}{{n{{Af{ce}}}}}}}{}}{{{ABh{ceg}}}{{Ad{i}}}Cll{{h{}{{f{c}}}}}{}}{{{ABd{ceg}}}{{Ad{i}}}Cll{{h{}{{f{c}}}}}{}}{{{ABf{c}}}{{Ad{e}}}l{}}{{{Kd{ce}}}{{Ad{g}}}l`{}}{{{L`{ceg}}}{{Ad{i}}}ll`{}}{{{Mf{ce}}}{{Ad{g}}}Md{{h{}{{f{b}}}}}{}}{{{Mh{c}}}{{Ad{e}}}l{}}{{{Nb{c}}}{{Ad{e}}}l{}}{{{AAf{c}}}{{Ad{e}}}l{}}{{{Lf{c}}}{{Ad{e}}}{lDd}{}}{{{J`{ce}}}{{Ad{g}}}l{{l{}{{n{}}}}}{}}{{{Jb{ce}}}{{Ad{g}}}l{{l{}{{n{}}}}}{}}{{{Nh{c}}}{{Ad{e}}}l{}}{{{Cd{ce}}}{{Ad{g}}}l{Ddl}{}}{{{Cb{cg}}}{{Ad{i}}}l{}{{h{c}{{f{{Ad{e}}}}}}}{}}{{{AAd{e}}}{{Ad{g}}}{}{{l{}{{n{{Ad{c}}}}}}}{}}{{{Ad{ce}}}{{Ad{g}}}l{{`{c}}}{}}{{{Hj{gi}}}{{Ad{k}}}{}{}{{l{}{{n{{Af{ce}}}}}}}{{h{c}{{f{b}}}}}{}}{{{Hh{gk}}}{{Ad{m}}}{}{}{{l{}{{n{{Af{ce}}}}}}}{}{{h{c}{{f{{Ad{i}}}}}}}{}}{{{N`{ce}}}{{Ad{g}}}l{{h{}{{f{b}}}}}{}}{{{AAb{ce}}}{{Ad{g}}}lh{}}{{{En{c}}}{{Ad{e}}}l{}}{{{F`{Ag{Ab{{Ab{cegikmoAaAc}}Ae}}}}}{{Ad{Ai}}}{}{}{}{}{}{}{}{}{}{}{{l{}{{n{{Ab{{Ab{cegikmoAaAc}}Ae}}}}}}}{}}{{{F`{i{Ab{{Ab{ce}}g}}}}}{{Ad{k}}}{}{}{}{{l{}{{n{{Ab{{Ab{ce}}g}}}}}}}{}}{{{F`{Aa{Ab{{Ab{cegikm}}o}}}}}{{Ad{Ac}}}{}{}{}{}{}{}{}{{l{}{{n{{Ab{{Ab{cegikm}}o}}}}}}}{}}{{{F`{o{Ab{{Ab{cegik}}m}}}}}{{Ad{Aa}}}{}{}{}{}{}{}{{l{}{{n{{Ab{{Ab{cegik}}m}}}}}}}{}}{{{F`{Ac{Ab{{Ab{cegikmo}}Aa}}}}}{{Ad{Ae}}}{}{}{}{}{}{}{}{}{{l{}{{n{{Ab{{Ab{cegikmo}}Aa}}}}}}}{}}{{{F`{Ai{Ab{{Ab{cegikmoAaAcAe}}Ag}}}}}{{Ad{Ak}}}{}{}{}{}{}{}{}{}{}{}{}{{l{}{{n{{Ab{{Ab{cegikmoAaAcAe}}Ag}}}}}}}{}}{{{F`{Ak{Ab{{Ab{cegikmoAaAcAeAg}}Ai}}}}}{{Ad{Am}}}{}{}{}{}{}{}{}{}{}{}{}{}{{l{}{{n{{Ab{{Ab{cegikmoAaAcAeAg}}Ai}}}}}}}{}}{{{F`{k{Ab{{Ab{ceg}}i}}}}}{{Ad{m}}}{}{}{}{}{{l{}{{n{{Ab{{Ab{ceg}}i}}}}}}}{}}{{{F`{m{Ab{{Ab{cegi}}k}}}}}{{Ad{o}}}{}{}{}{}{}{{l{}{{n{{Ab{{Ab{cegi}}k}}}}}}}{}}{{{F`{Ae{Ab{{Ab{cegikmoAa}}Ac}}}}}{{Ad{Ag}}}{}{}{}{}{}{}{}{}{}{{l{}{{n{{Ab{{Ab{cegikmoAa}}Ac}}}}}}}{}}{{{C`{c}}}{{Ad{e}}}l{}}{{{AB`{c}}}{{Ad{e}}}l{}}{{{Jf{ce}}}{{Ad{g}}}l`{}}{{{Lh{c}}}{{Ad{e}}}l{}}{{{M`{ce}}}{{Ad{g}}}l{{h{Cn}{{f{}}}}}{}}{{{Mb{c}}}{{Ad{e}}}l{}}{{{Nd{ge}}}{{Ad{i}}}{}{}{{l{}{{n{{Af{ce}}}}}}}{}}{{{Nj{c}}}{{Ad{e}}}l{}}{{{Nl{e}}}{{Ad{g}}}{}{{l{}{{n{c}}}}}{}}{{{O`{c}}}{{Ad{e}}}Dd{}}{{{Al{cg}}}{{Ad{i}}}{}{}{{h{c}{{f{{Ad{e}}}}}}}{}}{{{Jl{ce}}}{{Ad{g}}}{}{{h{c}{{f{c}}}}}{}}{{{On{ce}}}{{Ad{g}}}l{{h{}{{f{b}}}}}{}}{{{Ab{c}}}{{Ad{e}}}l{}}{{{ABb{c}}}{{Ad{e}}}Eh{}}{{{Ah{ce}}}{{Ad{g}}}{{l{}{{n{}}}}}Eh{}}{{{Af{ce}}}{{Ad{g}}}{{l{}{{n{}}}}}{EhDd}{}}{{{Db{ce}}}{{Ad{g}}}{{l{}{{n{}}}}Dd}{`Dd}{}}{{{AA`{ceg}}}{{Ad{i}}}l{FfFh}{{h{}{{f{e}}}}}{}}{{{An{c}}}{{Ad{e}}}l{}}{{{AAl{ce}}}{{Ad{g}}}ll{}}{{{AAn{ce}}}{{Ad{g}}}ll{}}{{{Ll{{Ab{cegikmoAa}}}}}{{Ad{Ac}}}llllllll{}}{{{Ll{{Ab{cegi}}}}}{{Ad{k}}}llll{}}{{{Ll{{Ab{cegikmoAaAc}}}}}{{Ad{Ae}}}lllllllll{}}{{{Ll{{Ab{ce}}}}}{{Ad{g}}}ll{}}{{{Ll{{Ab{cegikmoAaAcAe}}}}}{{Ad{Ag}}}llllllllll{}}{{{Ll{{Ab{cegikmo}}}}}{{Ad{Aa}}}lllllll{}}{{{Ll{{Ab{cegik}}}}}{{Ad{m}}}lllll{}}{{{Ll{{Ab{cegikmoAaAcAeAg}}}}}{{Ad{Ai}}}lllllllllll{}}{{{Ll{{Ab{ceg}}}}}{{Ad{i}}}lll{}}{{{Ll{{Ab{cegikmoAaAcAeAgAi}}}}}{{Ad{Ak}}}llllllllllll{}}{{{Ll{{Ab{cegikm}}}}}{{Ad{o}}}llllll{}}{{{Ll{{Ab{c}}}}}{{Ad{e}}}l{}}{{{Hl{gce}}}{{Ad{i}}}d{}{{Ln{}{{n{{Af{ce}}}}}}}{}}{{{N`{ce}}}{{Ad{g}}}{LnKh}{{h{}{{f{b}}}}}{}}{{{AAb{ce}}}{{Ad{g}}}Lnh{}}{{{M`{ce}}}{{Ad{g}}}{LnKh}{{h{Cn}{{f{}}}}}{}}{{{Nd{ge}}}{{Ad{i}}}{}{}{{l{}{{n{{Af{ce}}}}}}Ln}{}}{{{Nl{c}}}{{Ad{e}}}Ln{}}{{{O`{c}}}{{Ad{e}}}Dd{}}{{{AA`{ceg}}}{{Ad{i}}}Ln{FfFh}{{h{}{{f{e}}}}}{}}{{{An{c}}}{{Ad{e}}}Ln{}}{{{AAn{ce}}}{{Ad{g}}}{LnKh}{LnKh}{}}{{{Ll{{Ab{cegikmo}}}}}{{Ad{Aa}}}{LnKh}{LnKh}{LnKh}{LnKh}{LnKh}{LnKh}{LnKh}{}}{{{Ll{{Ab{cegikm}}}}}{{Ad{o}}}{LnKh}{LnKh}{LnKh}{LnKh}{LnKh}{LnKh}{}}{{{Ll{{Ab{cegikmoAaAcAeAgAi}}}}}{{Ad{Ak}}}{LnKh}{LnKh}{LnKh}{LnKh}{LnKh}{LnKh}{LnKh}{LnKh}{LnKh}{LnKh}{LnKh}{LnKh}{}}{{{Ll{{Ab{cegikmoAaAcAeAg}}}}}{{Ad{Ai}}}{LnKh}{LnKh}{LnKh}{LnKh}{LnKh}{LnKh}{LnKh}{LnKh}{LnKh}{LnKh}{LnKh}{}}{{{Ll{{Ab{cegikmoAaAc}}}}}{{Ad{Ae}}}{LnKh}{LnKh}{LnKh}{LnKh}{LnKh}{LnKh}{LnKh}{LnKh}{LnKh}{}}{{{Ll{{Ab{cegik}}}}}{{Ad{m}}}{LnKh}{LnKh}{LnKh}{LnKh}{LnKh}{}}{{{Ll{{Ab{c}}}}}{{Ad{e}}}{LnKh}{}}{{{Ll{{Ab{ceg}}}}}{{Ad{i}}}{LnKh}{LnKh}{LnKh}{}}{{{Ll{{Ab{cegi}}}}}{{Ad{k}}}{LnKh}{LnKh}{LnKh}{LnKh}{}}{{{Ll{{Ab{ce}}}}}{{Ad{g}}}{LnKh}{LnKh}{}}{{{Ll{{Ab{cegikmoAa}}}}}{{Ad{Ac}}}{LnKh}{LnKh}{LnKh}{LnKh}{LnKh}{LnKh}{LnKh}{LnKh}{}}{{{Ll{{Ab{cegikmoAaAcAe}}}}}{{Ad{Ag}}}{LnKh}{LnKh}{LnKh}{LnKh}{LnKh}{LnKh}{LnKh}{LnKh}{LnKh}{LnKh}{}}{{{Mb{c}}e}Adl{{Gh{}{{f{b}}}}}}{{{Mb{c}}e}AdlABj}{{{El{c}}Cn}{{Ad{e}}}l{}}{{{L`{ceg}}Cn}{{Ad{i}}}ll`{}}{{{Nb{c}}Cn}{{Ad{e}}}l{}}{{{Nh{c}}Cn}{{Ad{e}}}l{}}{{{En{c}}Cn}{{Ad{e}}}l{}}{{{Lh{c}}}Adl}{{{Mb{c}}}Adl}0{{{Mb{c}}Cn}Adl}0{{{Mf{ce}}i}{{Ad{g}}}Md{{h{}{{f{b}}}}}{}{{Gh{g}{{f{b}}}}}}{{{Nh{c}}g}{{Ad{e}}}l{}{{Gh{e}{{f{b}}}}}}{{{Lh{c}}g}{{Ad{e}}}l{}{{Gh{e}{{f{b}}}}}}{{{Mb{c}}g}{{Ad{e}}}l{}{{Gh{e}{{f{b}}}}}}{{{Nj{c}}g}{{Ad{e}}}l{}{{Gh{e}{{f{b}}}}}}{{{O`{c}}g}{{Ad{e}}}Dd{}{{Gh{e}{{f{b}}}}}}{{{Jh{g}}}{{Fd{ce}}}{FhFf}{}{{l{}{{n{{Ab{ce}}}}}}}}{{{Nh{c}}}Adl}{{{Nj{c}}}Bnl}`{{{Jh{g}}i}{{Fd{ce}}}{FhFf}{}{{l{}{{n{{Ab{ce}}}}}}}{{h{ece}{{f{e}}}}}}{{{Lh{c}}}Bnl}{{{Hl{gce}}im}id{}{{Ln{}{{n{{Af{ce}}}}}}}{}{}{{h{ik}{{f{i}}}}}}{{{N`{ce}}gk}g{LnKh}{{h{}{{f{b}}}}}{}{}{{h{gi}{{f{g}}}}}}{{{M`{ce}}gk}g{LnKh}{{h{Cn}{{f{}}}}}{}{}{{h{gi}{{f{g}}}}}}{{{Nd{ge}}im}i{}{}{{l{}{{n{{Af{ce}}}}}}Ln}{}{}{{h{ik}{{f{i}}}}}}{{{O`{c}}ei}eDd{}{}{{h{eg}{{f{e}}}}}}{{{AAn{ce}}gk}g{LnKh}{LnKh}{}{}{{h{gi}{{f{g}}}}}}{{{A`{ce}}}{{Ab{Cn{Ad{Cn}}}}}{lDd}{{h{}{{f{b}}}}}}{{{El{c}}}{{Ab{Cn{Ad{Cn}}}}}l}{{{Hl{gce}}}{{Ab{Cn{Ad{Cn}}}}}d{}{{l{}{{n{{Af{ce}}}}}}}}{{{Kd{ce}}}{{Ab{Cn{Ad{Cn}}}}}l`}{{{L`{ceg}}}{{Ab{Cn{Ad{Cn}}}}}ll`}{{{Mf{ce}}}{{Ab{Cn{Ad{Cn}}}}}Md{{h{}{{f{b}}}}}}{{{Mh{c}}}{{Ab{Cn{Ad{Cn}}}}}l}{{{Nb{c}}}{{Ab{Cn{Ad{Cn}}}}}l}{{{AAf{c}}}{{Ab{Cn{Ad{Cn}}}}}l}{{{Lf{c}}}{{Ab{Cn{Ad{Cn}}}}}{lDd}}{{{J`{ce}}}{{Ab{Cn{Ad{Cn}}}}}l{{l{}{{n{}}}}}}{{{Jb{ce}}}{{Ab{Cn{Ad{Cn}}}}}l{{l{}{{n{}}}}}}{{{Nh{c}}}{{Ab{Cn{Ad{Cn}}}}}l}{{{Cd{ce}}}{{Ab{Cn{Ad{Cn}}}}}l{Ddl}}{{{AAd{e}}}{{Ab{Cn{Ad{Cn}}}}}{}{{l{}{{n{{Ad{c}}}}}}}}{{{Ad{ce}}}{{Ab{Cn{Ad{Cn}}}}}l{{`{c}}}}{{{Hj{gi}}}{{Ab{Cn{Ad{Cn}}}}}{}{}{{l{}{{n{{Af{ce}}}}}}}{{h{c}{{f{b}}}}}}{{{Hh{gk}}}{{Ab{Cn{Ad{Cn}}}}}{}{}{{l{}{{n{{Af{ce}}}}}}}{}{{h{c}{{f{{Ad{i}}}}}}}}{{{N`{ce}}}{{Ab{Cn{Ad{Cn}}}}}l{{h{}{{f{b}}}}}}{{{AAb{ce}}}{{Ab{Cn{Ad{Cn}}}}}lh}{{{En{c}}}{{Ab{Cn{Ad{Cn}}}}}l}{{{F`{o{Ab{{Ab{cegik}}m}}}}}{{Ab{Cn{Ad{Cn}}}}}{}{}{}{}{}{}{{l{}{{n{{Ab{{Ab{cegik}}m}}}}}}}}{{{F`{m{Ab{{Ab{cegi}}k}}}}}{{Ab{Cn{Ad{Cn}}}}}{}{}{}{}{}{{l{}{{n{{Ab{{Ab{cegi}}k}}}}}}}}{{{F`{i{Ab{{Ab{ce}}g}}}}}{{Ab{Cn{Ad{Cn}}}}}{}{}{}{{l{}{{n{{Ab{{Ab{ce}}g}}}}}}}}{{{F`{k{Ab{{Ab{ceg}}i}}}}}{{Ab{Cn{Ad{Cn}}}}}{}{}{}{}{{l{}{{n{{Ab{{Ab{ceg}}i}}}}}}}}{{{F`{Aa{Ab{{Ab{cegikm}}o}}}}}{{Ab{Cn{Ad{Cn}}}}}{}{}{}{}{}{}{}{{l{}{{n{{Ab{{Ab{cegikm}}o}}}}}}}}{{{F`{Ac{Ab{{Ab{cegikmo}}Aa}}}}}{{Ab{Cn{Ad{Cn}}}}}{}{}{}{}{}{}{}{}{{l{}{{n{{Ab{{Ab{cegikmo}}Aa}}}}}}}}{{{F`{Ae{Ab{{Ab{cegikmoAa}}Ac}}}}}{{Ab{Cn{Ad{Cn}}}}}{}{}{}{}{}{}{}{}{}{{l{}{{n{{Ab{{Ab{cegikmoAa}}Ac}}}}}}}}{{{F`{Ak{Ab{{Ab{cegikmoAaAcAeAg}}Ai}}}}}{{Ab{Cn{Ad{Cn}}}}}{}{}{}{}{}{}{}{}{}{}{}{}{{l{}{{n{{Ab{{Ab{cegikmoAaAcAeAg}}Ai}}}}}}}}{{{F`{Ag{Ab{{Ab{cegikmoAaAc}}Ae}}}}}{{Ab{Cn{Ad{Cn}}}}}{}{}{}{}{}{}{}{}{}{}{{l{}{{n{{Ab{{Ab{cegikmoAaAc}}Ae}}}}}}}}{{{F`{Ai{Ab{{Ab{cegikmoAaAcAe}}Ag}}}}}{{Ab{Cn{Ad{Cn}}}}}{}{}{}{}{}{}{}{}{}{}{}{{l{}{{n{{Ab{{Ab{cegikmoAaAcAe}}Ag}}}}}}}}{{{C`{c}}}{{Ab{Cn{Ad{Cn}}}}}l}{{{Jf{ce}}}{{Ab{Cn{Ad{Cn}}}}}l`}{{{Lh{c}}}{{Ab{Cn{Ad{Cn}}}}}l}{{{M`{ce}}}{{Ab{Cn{Ad{Cn}}}}}l{{h{Cn}{{f{}}}}}}{{{Mb{c}}}{{Ab{Cn{Ad{Cn}}}}}l}{{{Nd{ge}}}{{Ab{Cn{Ad{Cn}}}}}{}{}{{l{}{{n{{Af{ce}}}}}}}}{{{Nj{c}}}{{Ab{Cn{Ad{Cn}}}}}l}{{{Nl{e}}}{{Ab{Cn{Ad{Cn}}}}}{}{{l{}{{n{c}}}}}}{{{O`{c}}}{{Ab{Cn{Ad{Cn}}}}}Dd}{{{Jl{ce}}}{{Ab{Cn{Ad{Cn}}}}}{}{{h{c}{{f{c}}}}}}{{{On{ce}}}{{Ab{Cn{Ad{Cn}}}}}l{{h{}{{f{b}}}}}}{{{Ab{c}}}{{Ab{Cn{Ad{Cn}}}}}l}{{{ABb{c}}}{{Ab{Cn{Ad{Cn}}}}}Eh}{{{Ah{ce}}}{{Ab{Cn{Ad{Cn}}}}}{{l{}{{n{}}}}}Eh}{{{Af{ce}}}{{Ab{Cn{Ad{Cn}}}}}{{l{}{{n{}}}}}{EhDd}}{{{Db{ce}}}{{Ab{Cn{Ad{Cn}}}}}{{l{}{{n{}}}}Dd}{`Dd}}{{{AA`{ceg}}}{{Ab{Cn{Ad{Cn}}}}}l{FfFh}{{h{}{{f{e}}}}}}{{{An{c}}}{{Ab{Cn{Ad{Cn}}}}}l}{{{AAl{ce}}}{{Ab{Cn{Ad{Cn}}}}}ll}{{{AAn{ce}}}{{Ab{Cn{Ad{Cn}}}}}ll}{{{Ll{{Ab{cegikmoAaAcAeAg}}}}}{{Ab{Cn{Ad{Cn}}}}}lllllllllll}{{{Ll{{Ab{cegikmoAaAcAeAgAi}}}}}{{Ab{Cn{Ad{Cn}}}}}llllllllllll}{{{Ll{{Ab{ceg}}}}}{{Ab{Cn{Ad{Cn}}}}}lll}{{{Ll{{Ab{cegikmoAaAc}}}}}{{Ab{Cn{Ad{Cn}}}}}lllllllll}{{{Ll{{Ab{cegikmo}}}}}{{Ab{Cn{Ad{Cn}}}}}lllllll}{{{Ll{{Ab{cegi}}}}}{{Ab{Cn{Ad{Cn}}}}}llll}{{{Ll{{Ab{cegik}}}}}{{Ab{Cn{Ad{Cn}}}}}lllll}{{{Ll{{Ab{ce}}}}}{{Ab{Cn{Ad{Cn}}}}}ll}{{{Ll{{Ab{cegikmoAa}}}}}{{Ab{Cn{Ad{Cn}}}}}llllllll}{{{Ll{{Ab{cegikmoAaAcAe}}}}}{{Ab{Cn{Ad{Cn}}}}}llllllllll}{{{Ll{{Ab{cegikm}}}}}{{Ab{Cn{Ad{Cn}}}}}llllll}{{{Ll{{Ab{c}}}}}{{Ab{Cn{Ad{Cn}}}}}l}`{{{Jh{g}}}{{Fd{ce}}}{FhFf}{}{{l{}{{n{{Ab{ce}}}}}}}}{ce{}{}}000000000000000000000000000000000000000000000{cJn{}}00{c{{Af{e}}}{}{}}00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000{cAj{}}00000000000000000000000000000000000000000000000000000{{{Nh{c}}}{{Nh{c}}}l}```{{{Il{}{{f{c}}}}e}c{{l{}{{n{}}}}}l}","c":[160,176,376,401,412,438,476,795,1610],"p":[[1,"bool"],[10,"IntoIterator",1828],[17,"Output"],[10,"FnMut",1829],[6,"Either",0],[10,"Iterator",1830],[17,"Item"],[10,"Itertools",0],[1,"tuple"],[6,"Option",1831],[6,"Result",1832],[6,"EitherOrBoth",0],[10,"Deref",1833],[10,"DerefMut",1833],[5,"OsStr",1834],[10,"AsMut",1835],[5,"CStr",1836],[1,"slice"],[5,"Path",1837],[1,"str"],[5,"Pin",1838],[10,"AsRef",1835],[1,"unit"],[5,"ExactlyOneError",416],[5,"Batching",416],[5,"Product",416],[10,"Error",1839],[5,"Chain",1840],[5,"ChunkBy",416],[10,"PartialEq",1841],[1,"usize"],[5,"IntoChunks",416],[5,"CircularTupleWindows",416],[10,"Clone",1842],[6,"Diff",0],[6,"MinMaxResult",0],[6,"Position",0],[6,"FoldWhile",0],[5,"Cloned",1843],[6,"Ordering",1841],[10,"Ord",1841],[8,"Coalesce",416],[10,"FromIterator",1828],[10,"HomogeneousTuple",1824],[5,"Vec",1844],[5,"Combinations",416],[5,"CombinationsWithReplacement",416],[5,"ConsTuples",416],[10,"BufRead",1845],[5,"HashMap",1846],[10,"Eq",1841],[10,"Hash",1847],[8,"Dedup",416],[8,"DedupBy",416],[8,"DedupByWithCount",416],[8,"DedupWithCount",416],[17,"Target"],[8,"Duplicates",416],[8,"DuplicatesBy",416],[10,"FnOnce",1829],[10,"Into",1835],[5,"Enumerate",1848],[10,"Debug",1849],[10,"Extend",1828],[5,"IterEither",1850],[1,"u8"],[5,"Error",1851],[5,"FilterMapOk",416],[5,"FilterOk",416],[5,"FlattenOk",416],[10,"Write",1845],[5,"Formatter",1849],[5,"Error",1849],[10,"Display",1849],[8,"Result",1849],[5,"Format",416],[5,"FormatWith",416],[10,"IteratorIndex",1824],[10,"Hasher",1847],[5,"Interleave",416],[5,"InterleaveShortest",416],[8,"Intersperse",416],[5,"IntersperseWith",416],[5,"GroupingMap",416],[8,"GroupingMapBy",416],[5,"Iterate",416],[5,"String",1852],[5,"IntoIter",1853],[8,"KMerge",416],[5,"KMergeBy",416],[10,"Default",1854],[10,"ExactSizeIterator",1855],[8,"MapInto",416],[8,"MapOk",416],[8,"Merge",416],[5,"MergeBy",416],[8,"MergeJoinBy",416],[10,"PartialOrd",1841],[5,"MultiProduct",416],[5,"MultiPeek",416],[10,"MultiUnzip",0],[5,"Zip",416],[10,"DoubleEndedIterator",1856],[5,"PadUsing",416],[5,"PeekNth",416],[10,"PeekingNext",0],[5,"PeekingTakeWhile",416],[5,"Permutations",416],[5,"Context",1857],[6,"Poll",1858],[10,"Future",1859],[5,"Positions",416],[5,"Powerset",416],[5,"ProcessResults",416],[10,"Product",1860],[5,"PutBack",416],[5,"PutBackN",416],[5,"RcIter",416],[10,"Read",1845],[5,"RepeatN",416],[5,"Rev",1861],[6,"SeekFrom",1845],[1,"u64"],[10,"Seek",1845],[10,"Sum",1860],[5,"IntoIter",1862],[5,"TakeWhileInclusive",416],[5,"TakeWhileRef",416],[5,"Tee",416],[5,"TupleCombinations",416],[5,"TupleWindows",416],[5,"Tuples",416],[5,"TypeId",1863],[5,"Unfold",416],[5,"Unique",416],[5,"UniqueBy",416],[5,"Update",416],[5,"WhileSome",416],[5,"WithPosition",416],[5,"Arguments",1849],[5,"Zip",1864],[5,"ZipEq",416],[5,"ZipLongest",416],[5,"Chunks",416],[5,"TupleBuffer",416],[5,"Group",416],[5,"Chunk",416],[5,"Groups",416],[10,"Sized",1865]],"b":[[35,"impl-Either%3CL,+R%3E"],[36,"impl-AsMut%3COsStr%3E-for-Either%3CL,+R%3E"],[37,"impl-AsMut%3CCStr%3E-for-Either%3CL,+R%3E"],[38,"impl-AsMut%3CTarget%3E-for-Either%3CL,+R%3E"],[39,"impl-AsMut%3C%5BTarget%5D%3E-for-Either%3CL,+R%3E"],[40,"impl-AsMut%3CPath%3E-for-Either%3CL,+R%3E"],[41,"impl-AsMut%3Cstr%3E-for-Either%3CL,+R%3E"],[45,"impl-AsRef%3CCStr%3E-for-Either%3CL,+R%3E"],[46,"impl-Either%3CL,+R%3E"],[47,"impl-AsRef%3COsStr%3E-for-Either%3CL,+R%3E"],[48,"impl-AsRef%3CPath%3E-for-Either%3CL,+R%3E"],[49,"impl-AsRef%3Cstr%3E-for-Either%3CL,+R%3E"],[50,"impl-AsRef%3CTarget%3E-for-Either%3CL,+R%3E"],[51,"impl-AsRef%3C%5BTarget%5D%3E-for-Either%3CL,+R%3E"],[151,"impl-Debug-for-Either%3CL,+R%3E"],[152,"impl-Display-for-Either%3CL,+R%3E"],[705,"impl-Display-for-FormatWith%3C\'a,+I,+F%3E"],[706,"impl-Debug-for-FormatWith%3C\'a,+I,+F%3E"],[707,"impl-Display-for-Format%3C\'a,+I%3E"],[708,"impl-Pointer-for-Format%3C\'a,+I%3E"],[709,"impl-Binary-for-Format%3C\'a,+I%3E"],[710,"impl-UpperHex-for-Format%3C\'a,+I%3E"],[711,"impl-Debug-for-Format%3C\'a,+I%3E"],[712,"impl-Octal-for-Format%3C\'a,+I%3E"],[713,"impl-LowerExp-for-Format%3C\'a,+I%3E"],[714,"impl-LowerHex-for-Format%3C\'a,+I%3E"],[715,"impl-UpperExp-for-Format%3C\'a,+I%3E"],[736,"impl-Display-for-ExactlyOneError%3CI%3E"],[737,"impl-Debug-for-ExactlyOneError%3CI%3E"],[774,"impl-Iterator-for-ConsTuples%3CIter,+((D,+E,+F,+G,+H,+I,+J,+K,+L),+X)%3E"],[775,"impl-Iterator-for-ConsTuples%3CIter,+((H,+I,+J,+K,+L),+X)%3E"],[776,"impl-Iterator-for-ConsTuples%3CIter,+((B,+C,+D,+E,+F,+G,+H,+I,+J,+K,+L),+X)%3E"],[777,"impl-Iterator-for-ConsTuples%3CIter,+((G,+H,+I,+J,+K,+L),+X)%3E"],[778,"impl-Iterator-for-ConsTuples%3CIter,+((F,+G,+H,+I,+J,+K,+L),+X)%3E"],[779,"impl-Iterator-for-ConsTuples%3CIter,+((J,+K,+L),+X)%3E"],[780,"impl-Iterator-for-ConsTuples%3CIter,+((C,+D,+E,+F,+G,+H,+I,+J,+K,+L),+X)%3E"],[781,"impl-Iterator-for-ConsTuples%3CIter,+((E,+F,+G,+H,+I,+J,+K,+L),+X)%3E"],[782,"impl-Iterator-for-ConsTuples%3CIter,+((K,+L),+X)%3E"],[783,"impl-Iterator-for-ConsTuples%3CIter,+((I,+J,+K,+L),+X)%3E"],[851,"impl-From%3C(A,)%3E-for-Zip%3C(%3CA+as+IntoIterator%3E::IntoIter,)%3E"],[852,"impl-From%3C(A,+B,+C)%3E-for-Zip%3C(%3CA+as+IntoIterator%3E::IntoIter,+%3CB+as+IntoIterator%3E::IntoIter,+%3CC+as+IntoIterator%3E::IntoIter)%3E"],[853,"impl-From%3C(A,+B,+C,+D,+E,+F)%3E-for-Zip%3C(%3CA+as+IntoIterator%3E::IntoIter,+%3CB+as+IntoIterator%3E::IntoIter,+%3CC+as+IntoIterator%3E::IntoIter,+%3CD+as+IntoIterator%3E::IntoIter,+%3CE+as+IntoIterator%3E::IntoIter,+%3CF+as+IntoIterator%3E::IntoIter)%3E"],[854,"impl-From%3C(A,+B,+C,+D,+E,+F,+G,+H)%3E-for-Zip%3C(%3CA+as+IntoIterator%3E::IntoIter,+%3CB+as+IntoIterator%3E::IntoIter,+%3CC+as+IntoIterator%3E::IntoIter,+%3CD+as+IntoIterator%3E::IntoIter,+%3CE+as+IntoIterator%3E::IntoIter,+%3CF+as+IntoIterator%3E::IntoIter,+%3CG+as+IntoIterator%3E::IntoIter,+%3CH+as+IntoIterator%3E::IntoIter)%3E"],[855,"impl-From%3C(A,+B,+C,+D)%3E-for-Zip%3C(%3CA+as+IntoIterator%3E::IntoIter,+%3CB+as+IntoIterator%3E::IntoIter,+%3CC+as+IntoIterator%3E::IntoIter,+%3CD+as+IntoIterator%3E::IntoIter)%3E"],[856,"impl-From%3C(A,+B,+C,+D,+E,+F,+G,+H,+I)%3E-for-Zip%3C(%3CA+as+IntoIterator%3E::IntoIter,+%3CB+as+IntoIterator%3E::IntoIter,+%3CC+as+IntoIterator%3E::IntoIter,+%3CD+as+IntoIterator%3E::IntoIter,+%3CE+as+IntoIterator%3E::IntoIter,+%3CF+as+IntoIterator%3E::IntoIter,+%3CG+as+IntoIterator%3E::IntoIter,+%3CH+as+IntoIterator%3E::IntoIter,+%3CI+as+IntoIterator%3E::IntoIter)%3E"],[857,"impl-From%3C(A,+B,+C,+D,+E,+F,+G,+H,+I,+J,+K)%3E-for-Zip%3C(%3CA+as+IntoIterator%3E::IntoIter,+%3CB+as+IntoIterator%3E::IntoIter,+%3CC+as+IntoIterator%3E::IntoIter,+%3CD+as+IntoIterator%3E::IntoIter,+%3CE+as+IntoIterator%3E::IntoIter,+%3CF+as+IntoIterator%3E::IntoIter,+%3CG+as+IntoIterator%3E::IntoIter,+%3CH+as+IntoIterator%3E::IntoIter,+%3CI+as+IntoIterator%3E::IntoIter,+%3CJ+as+IntoIterator%3E::IntoIter,+%3CK+as+IntoIterator%3E::IntoIter)%3E"],[858,"impl-From%3C(A,+B,+C,+D,+E,+F,+G,+H,+I,+J)%3E-for-Zip%3C(%3CA+as+IntoIterator%3E::IntoIter,+%3CB+as+IntoIterator%3E::IntoIter,+%3CC+as+IntoIterator%3E::IntoIter,+%3CD+as+IntoIterator%3E::IntoIter,+%3CE+as+IntoIterator%3E::IntoIter,+%3CF+as+IntoIterator%3E::IntoIter,+%3CG+as+IntoIterator%3E::IntoIter,+%3CH+as+IntoIterator%3E::IntoIter,+%3CI+as+IntoIterator%3E::IntoIter,+%3CJ+as+IntoIterator%3E::IntoIter)%3E"],[859,"impl-From%3C(A,+B,+C,+D,+E,+F,+G,+H,+I,+J,+K,+L)%3E-for-Zip%3C(%3CA+as+IntoIterator%3E::IntoIter,+%3CB+as+IntoIterator%3E::IntoIter,+%3CC+as+IntoIterator%3E::IntoIter,+%3CD+as+IntoIterator%3E::IntoIter,+%3CE+as+IntoIterator%3E::IntoIter,+%3CF+as+IntoIterator%3E::IntoIter,+%3CG+as+IntoIterator%3E::IntoIter,+%3CH+as+IntoIterator%3E::IntoIter,+%3CI+as+IntoIterator%3E::IntoIter,+%3CJ+as+IntoIterator%3E::IntoIter,+%3CK+as+IntoIterator%3E::IntoIter,+%3CL+as+IntoIterator%3E::IntoIter)%3E"],[860,"impl-From%3C(A,+B)%3E-for-Zip%3C(%3CA+as+IntoIterator%3E::IntoIter,+%3CB+as+IntoIterator%3E::IntoIter)%3E"],[861,"impl-From%3C(A,+B,+C,+D,+E)%3E-for-Zip%3C(%3CA+as+IntoIterator%3E::IntoIter,+%3CB+as+IntoIterator%3E::IntoIter,+%3CC+as+IntoIterator%3E::IntoIter,+%3CD+as+IntoIterator%3E::IntoIter,+%3CE+as+IntoIterator%3E::IntoIter)%3E"],[862,"impl-From%3C(A,+B,+C,+D,+E,+F,+G)%3E-for-Zip%3C(%3CA+as+IntoIterator%3E::IntoIter,+%3CB+as+IntoIterator%3E::IntoIter,+%3CC+as+IntoIterator%3E::IntoIter,+%3CD+as+IntoIterator%3E::IntoIter,+%3CE+as+IntoIterator%3E::IntoIter,+%3CF+as+IntoIterator%3E::IntoIter,+%3CG+as+IntoIterator%3E::IntoIter)%3E"],[1451,"impl-Iterator-for-ConsTuples%3CIter,+((D,+E,+F,+G,+H,+I,+J,+K,+L),+X)%3E"],[1452,"impl-Iterator-for-ConsTuples%3CIter,+((K,+L),+X)%3E"],[1453,"impl-Iterator-for-ConsTuples%3CIter,+((G,+H,+I,+J,+K,+L),+X)%3E"],[1454,"impl-Iterator-for-ConsTuples%3CIter,+((H,+I,+J,+K,+L),+X)%3E"],[1455,"impl-Iterator-for-ConsTuples%3CIter,+((F,+G,+H,+I,+J,+K,+L),+X)%3E"],[1456,"impl-Iterator-for-ConsTuples%3CIter,+((C,+D,+E,+F,+G,+H,+I,+J,+K,+L),+X)%3E"],[1457,"impl-Iterator-for-ConsTuples%3CIter,+((B,+C,+D,+E,+F,+G,+H,+I,+J,+K,+L),+X)%3E"],[1458,"impl-Iterator-for-ConsTuples%3CIter,+((J,+K,+L),+X)%3E"],[1459,"impl-Iterator-for-ConsTuples%3CIter,+((I,+J,+K,+L),+X)%3E"],[1460,"impl-Iterator-for-ConsTuples%3CIter,+((E,+F,+G,+H,+I,+J,+K,+L),+X)%3E"],[1483,"impl-Iterator-for-Zip%3C(A,+B,+C,+D,+E,+F,+G,+H)%3E"],[1484,"impl-Iterator-for-Zip%3C(A,+B,+C,+D)%3E"],[1485,"impl-Iterator-for-Zip%3C(A,+B,+C,+D,+E,+F,+G,+H,+I)%3E"],[1486,"impl-Iterator-for-Zip%3C(A,+B)%3E"],[1487,"impl-Iterator-for-Zip%3C(A,+B,+C,+D,+E,+F,+G,+H,+I,+J)%3E"],[1488,"impl-Iterator-for-Zip%3C(A,+B,+C,+D,+E,+F,+G)%3E"],[1489,"impl-Iterator-for-Zip%3C(A,+B,+C,+D,+E)%3E"],[1490,"impl-Iterator-for-Zip%3C(A,+B,+C,+D,+E,+F,+G,+H,+I,+J,+K)%3E"],[1491,"impl-Iterator-for-Zip%3C(A,+B,+C)%3E"],[1492,"impl-Iterator-for-Zip%3C(A,+B,+C,+D,+E,+F,+G,+H,+I,+J,+K,+L)%3E"],[1493,"impl-Iterator-for-Zip%3C(A,+B,+C,+D,+E,+F)%3E"],[1494,"impl-Iterator-for-Zip%3C(A,)%3E"],[1505,"impl-DoubleEndedIterator-for-Zip%3C(A,+B,+C,+D,+E,+F,+G)%3E"],[1506,"impl-DoubleEndedIterator-for-Zip%3C(A,+B,+C,+D,+E,+F)%3E"],[1507,"impl-DoubleEndedIterator-for-Zip%3C(A,+B,+C,+D,+E,+F,+G,+H,+I,+J,+K,+L)%3E"],[1508,"impl-DoubleEndedIterator-for-Zip%3C(A,+B,+C,+D,+E,+F,+G,+H,+I,+J,+K)%3E"],[1509,"impl-DoubleEndedIterator-for-Zip%3C(A,+B,+C,+D,+E,+F,+G,+H,+I)%3E"],[1510,"impl-DoubleEndedIterator-for-Zip%3C(A,+B,+C,+D,+E)%3E"],[1511,"impl-DoubleEndedIterator-for-Zip%3C(A,)%3E"],[1512,"impl-DoubleEndedIterator-for-Zip%3C(A,+B,+C)%3E"],[1513,"impl-DoubleEndedIterator-for-Zip%3C(A,+B,+C,+D)%3E"],[1514,"impl-DoubleEndedIterator-for-Zip%3C(A,+B)%3E"],[1515,"impl-DoubleEndedIterator-for-Zip%3C(A,+B,+C,+D,+E,+F,+G,+H)%3E"],[1516,"impl-DoubleEndedIterator-for-Zip%3C(A,+B,+C,+D,+E,+F,+G,+H,+I,+J)%3E"],[1568,"impl-Iterator-for-ConsTuples%3CIter,+((H,+I,+J,+K,+L),+X)%3E"],[1569,"impl-Iterator-for-ConsTuples%3CIter,+((I,+J,+K,+L),+X)%3E"],[1570,"impl-Iterator-for-ConsTuples%3CIter,+((K,+L),+X)%3E"],[1571,"impl-Iterator-for-ConsTuples%3CIter,+((J,+K,+L),+X)%3E"],[1572,"impl-Iterator-for-ConsTuples%3CIter,+((G,+H,+I,+J,+K,+L),+X)%3E"],[1573,"impl-Iterator-for-ConsTuples%3CIter,+((F,+G,+H,+I,+J,+K,+L),+X)%3E"],[1574,"impl-Iterator-for-ConsTuples%3CIter,+((E,+F,+G,+H,+I,+J,+K,+L),+X)%3E"],[1575,"impl-Iterator-for-ConsTuples%3CIter,+((B,+C,+D,+E,+F,+G,+H,+I,+J,+K,+L),+X)%3E"],[1576,"impl-Iterator-for-ConsTuples%3CIter,+((D,+E,+F,+G,+H,+I,+J,+K,+L),+X)%3E"],[1577,"impl-Iterator-for-ConsTuples%3CIter,+((C,+D,+E,+F,+G,+H,+I,+J,+K,+L),+X)%3E"],[1598,"impl-Iterator-for-Zip%3C(A,+B,+C,+D,+E,+F,+G,+H,+I,+J,+K)%3E"],[1599,"impl-Iterator-for-Zip%3C(A,+B,+C,+D,+E,+F,+G,+H,+I,+J,+K,+L)%3E"],[1600,"impl-Iterator-for-Zip%3C(A,+B,+C)%3E"],[1601,"impl-Iterator-for-Zip%3C(A,+B,+C,+D,+E,+F,+G,+H,+I)%3E"],[1602,"impl-Iterator-for-Zip%3C(A,+B,+C,+D,+E,+F,+G)%3E"],[1603,"impl-Iterator-for-Zip%3C(A,+B,+C,+D)%3E"],[1604,"impl-Iterator-for-Zip%3C(A,+B,+C,+D,+E)%3E"],[1605,"impl-Iterator-for-Zip%3C(A,+B)%3E"],[1606,"impl-Iterator-for-Zip%3C(A,+B,+C,+D,+E,+F,+G,+H)%3E"],[1607,"impl-Iterator-for-Zip%3C(A,+B,+C,+D,+E,+F,+G,+H,+I,+J)%3E"],[1608,"impl-Iterator-for-Zip%3C(A,+B,+C,+D,+E,+F)%3E"],[1609,"impl-Iterator-for-Zip%3C(A,)%3E"]]}],\ ["lalrpop_util",{"doc":"","t":"FPPGPPPNNNNNNNNNNNONNONNNNNNNNNQCNNNNNCNNNNNNNNNOOOOOOOFFFNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNPRPRIPPRRPIIFKKPRGRRRIRRIPPPMMMNNNNNOMOMMMNNNMNNMMMMMMMMMNNNNNNMOOOOOOOOO","n":["ErrorRecovery","ExtraToken","InvalidToken","ParseError","UnrecognizedEof","UnrecognizedToken","User","borrow","borrow","borrow_mut","borrow_mut","clone","clone","clone_into","clone_into","cmp","cmp","description","dropped_tokens","eq","eq","error","fmt","fmt","fmt","from","from","from","from","into","into","lalrpop_mod","lexer","map_error","map_location","map_token","partial_cmp","partial_cmp","state_machine","to_owned","to_owned","to_string","try_from","try_from","try_into","try_into","type_id","type_id","error","expected","expected","location","location","token","token","Matcher","MatcherBuilder","Token","borrow","borrow","borrow","borrow_mut","borrow_mut","borrow_mut","clone","clone_into","cmp","eq","fmt","fmt","from","from","from","into","into","into","into_iter","matcher","new","next","partial_cmp","to_owned","to_string","try_from","try_from","try_from","try_into","try_into","try_into","type_id","type_id","type_id","Accept","Action","Err","Error","ErrorRecovery","ExtraToken","InvalidToken","Location","NonterminalIndex","Ok","ParseError","ParseResult","Parser","ParserAction","ParserDefinition","Reduce","ReduceIndex","SimulatedReduce","StateIndex","Success","Symbol","SymbolTriple","Token","TokenIndex","TokenTriple","UnrecognizedEof","UnrecognizedToken","User","action","as_reduce","as_shift","borrow","borrow","borrow_mut","borrow_mut","drive","dropped_tokens","eof_action","error","error_action","error_recovery_symbol","expected_tokens","expected_tokens_from_states","from","from","goto","into","into","is_error","is_reduce","is_shift","reduce","simulate_reduce","start_location","start_state","token_to_index","token_to_symbol","try_from","try_from","try_into","try_into","type_id","type_id","uses_error_recovery","error","expected","expected","location","location","token","token","nonterminal_produced","states_to_pop"],"q":[[0,"lalrpop_util"],[48,"lalrpop_util::ParseError"],[55,"lalrpop_util::lexer"],[92,"lalrpop_util::state_machine"],[156,"lalrpop_util::state_machine::ParseError"],[163,"lalrpop_util::state_machine::SimulatedReduce"],[165,"core::clone"],[166,"core::cmp"],[167,"core::cmp"],[168,"core::fmt"],[169,"core::ops::function"],[170,"core::cmp"],[171,"core::result"],[172,"core::any"],[173,"core::fmt"],[174,"core::convert"],[175,"core::iter::traits::collect"],[176,"core::marker"],[177,"core::iter::traits::iterator"],[178,"alloc::vec"]],"d":["","Generated by the parser when it encounters additional, …","Generated by the parser when it encounters a token (or …","","Generated by the parser when it encounters an EOF it did …","Generated by the parser when it encounters a token it did …","Custom error type.","","","","","","","","","","","","","","","","","","","Returns the argument unchanged.","","","Returns the argument unchanged.","Calls U::from(self).","Calls U::from(self).","Define a module using the generated parse from a .lalrpop …","","","","","","","","","","","","","","","","","","The set of expected tokens: these names are taken from the …","The set of expected tokens: these names are taken from the …","","The end of the final token","The unexpected token of type T with a span given by the …","","","","","","","","","","","","","","","","","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","","","","","","","","","","","","","","","","","","Identifies an action.","Contains the error value","Represents a “user error” – this can get produced by …","","Generated by the parser when it encounters additional, …","Generated by the parser when it encounters a token (or …","Represents a location in the input text. If you are using …","Identifies a nonterminal.","Contains the success value","","","","","","","Identifies a reduction.","","Identifies a state. Typically an i8, i16, or i32 …","Type produced by reducing the start symbol.","The type representing things on the LALRPOP stack. …","","The type emitted by the user’s tokenizer (excluding the …","We assign a unique index to each token in the grammar, …","","Generated by the parser when it encounters an EOF it did …","Generated by the parser when it encounters a token it did …","Custom error type.","Given the top-most state and the pending terminal, returns …","","","","","","","","","Action to take if EOF occurs in the given state. This …","","Returns the action to take if an error occurs in the given …","Given error information, creates an error recovery symbol …","Returns the expected tokens in a given state. This is used …","Returns the expected tokens in a given state. This is used …","Returns the argument unchanged.","Returns the argument unchanged.","If we reduce to a nonterminal in the given state, what …","Calls U::from(self).","Calls U::from(self).","","","","Execute a reduction in the given state: that is, execute …","Returns information about how many states will be popped …","Returns a location representing the “start of the input…","Returns the initial state.","Converts the user’s tokens into an internal index; this …","“Upcast” a terminal into a symbol so we can push it …","","","","","","","True if this grammar supports error recovery.","","The set of expected tokens: these names are taken from the …","The set of expected tokens: these names are taken from the …","","The end of the final token","The unexpected token of type T with a span given by the …","","",""],"i":[0,1,1,0,1,1,1,1,3,1,3,1,3,1,3,1,3,1,3,1,3,3,1,1,3,1,1,1,3,1,3,0,0,1,1,1,1,3,0,1,3,1,1,3,1,3,1,3,54,55,56,57,55,56,58,0,0,0,25,26,23,25,26,23,23,23,23,23,23,23,25,26,23,25,26,23,26,25,25,26,23,23,23,25,26,23,25,26,23,25,26,23,53,42,45,42,0,47,47,42,42,45,0,0,0,0,0,53,42,0,42,42,42,0,42,42,0,47,47,47,42,44,44,53,59,53,59,59,49,42,49,42,42,42,42,53,59,42,53,59,44,44,44,42,42,42,42,42,42,53,59,53,59,53,59,42,54,55,56,57,55,56,58,60,60],"f":"```````{ce{}{}}000{{{b{ceg}}}{{b{ceg}}}ddd}{{{f{ceg}}}{{f{ceg}}}ddd}{{ce}h{}{}}0{{{b{ceg}}{b{ceg}}}jlll}{{{f{ceg}}{f{ceg}}}jlll}{{{b{ceg}}}n{A`Ab}{A`Ab}{A`Ab}}`{{{b{ceg}}{b{ceg}}}AdAfAfAf}{{{f{ceg}}{f{ceg}}}AdAfAfAf}`{{{b{ceg}}Ah}AjA`A`A`}{{{b{ceg}}Ah}AjAbAbAb}{{{f{ceg}}Ah}AjA`A`A`}{cc{}}{c{{b{egc}}}{}{}{}}{Alc{}}2>>``{{{b{ceg}}k}{{b{cei}}}{}{}{}{}{{B`{g}{{An{i}}}}}}{{{b{ceg}}k}{{b{ieg}}}{}{}{}{}{{Bb{c}{{An{i}}}}}}{{{b{ceg}}k}{{b{cig}}}{}{}{}{}{{B`{e}{{An{i}}}}}}{{{b{ceg}}{b{ceg}}}{{Bd{j}}}BfBfBf}{{{f{ceg}}{f{ceg}}}{{Bd{j}}}BfBfBf}`{ce{}{}}0{cBh{}}{c{{Bj{e}}}{}{}}000{cBl{}}0``````````333333{BnBn}{{ce}h{}{}}{{BnBn}j}{{BnBn}Ad}{{BnAh}{{Bj{hC`}}}}{{BnAh}Aj}{cc{}}00::::{{Cbn}{{Cd{c}}}{}}{e{{Bj{CbCf}}}{{Ch{n}}}{{Cn{}{{Cj{{Cl{cAd}}}}}}}}{{{Cd{c}}}{{Bd{e}}}{}{}}{{BnBn}{{Bd{j}}}}>=<<<<<<;;;````````````````````````````{{{Ed{}{{D`{c}}{Db{e}}{Dd{g}}{Df{i}}{Dh{k}}{Dj{m}}{Dl{o}}{Dn{Aa}}{E`{Ac}}{Eb{Ae}}}}oi}Aa{dA`}{}{dA`}{EfdA`}{}{}{EfdA`}Eh{EfdA`}{EfdA`}}{EhBd}0{ce{}{}}000{{ce}{{Ej{c}}}Ed{{F`{}{{Cj{{Bj{{El{c}}{En{c}}}}}}}}}}`{{{Ed{}{{D`{c}}{Db{e}}{Dd{g}}{Df{i}}{Dh{k}}{Dj{m}}{Dl{o}}{Dn{Aa}}{E`{Ac}}{Eb{Ae}}}}o}Aa{dA`}{}{dA`}{EfdA`}{}{}{EfdA`}Eh{EfdA`}{EfdA`}}`0{{{Ed{}{{D`{c}}{Db{e}}{Dd{g}}{Df{i}}{Dh{k}}{Dj{m}}{Dl{o}}{Dn{Aa}}{E`{Ac}}{Eb{Ae}}}}{Fb{{Ed{}{{D`{c}}{Db{e}}{Dd{g}}{Df{i}}{Dh{k}}{Dj{m}}{Dl{o}}{Dn{Aa}}{E`{Ac}}{Eb{Ae}}}}}}}k{dA`}{}{dA`}{EfdA`}{}{}{EfdA`}Eh{EfdA`}{EfdA`}}{{{Ed{}{{D`{c}}{Db{e}}{Dd{g}}{Df{i}}{Dh{k}}{Dj{m}}{Dl{o}}{Dn{Aa}}{E`{Ac}}{Eb{Ae}}}}o}{{Fd{Bh}}}{dA`}{}{dA`}{EfdA`}{}{}{EfdA`}Eh{EfdA`}{EfdA`}}{{{Ed{}{{D`{c}}{Db{e}}{Dd{g}}{Df{i}}{Dh{k}}{Dj{m}}{Dl{o}}{Dn{Aa}}{E`{Ac}}{Eb{Ae}}}}{Ff{o}}}{{Fd{Bh}}}{dA`}{}{dA`}{EfdA`}{}{}{EfdA`}Eh{EfdA`}{EfdA`}}<<{{{Ed{}{{D`{c}}{Db{e}}{Dd{g}}{Df{i}}{Dh{k}}{Dj{m}}{Dl{o}}{Dn{Aa}}{E`{Ac}}{Eb{Ae}}}}oAe}o{dA`}{}{dA`}{EfdA`}{}{}{EfdA`}Eh{EfdA`}{EfdA`}}66{EhAd}00{{{Ed{}{{D`{c}}{Db{e}}{Dd{g}}{Df{i}}{Dh{k}}{Dj{m}}{Dl{o}}{Dn{Aa}}{E`{Ac}}{Eb{Ae}}}}Ac{Bd{c}}{Fd{o}}{Fd{{Fh{{Ed{}{{D`{c}}{Db{e}}{Dd{g}}{Df{i}}{Dh{k}}{Dj{m}}{Dl{o}}{Dn{Aa}}{E`{Ac}}{Eb{Ae}}}}}}}}}{{Bd{{Ej{{Ed{}{{D`{c}}{Db{e}}{Dd{g}}{Df{i}}{Dh{k}}{Dj{m}}{Dl{o}}{Dn{Aa}}{E`{Ac}}{Eb{Ae}}}}}}}}}{dA`}{}{dA`}{EfdA`}{}{}{EfdA`}Eh{EfdA`}{EfdA`}}{{{Ed{}{{D`{c}}{Db{e}}{Dd{g}}{Df{i}}{Dh{k}}{Dj{m}}{Dl{o}}{Dn{Aa}}{E`{Ac}}{Eb{Ae}}}}Ac}{{Fj{{Ed{}{{D`{c}}{Db{e}}{Dd{g}}{Df{i}}{Dh{k}}{Dj{m}}{Dl{o}}{Dn{Aa}}{E`{Ac}}{Eb{Ae}}}}}}}{dA`}{}{dA`}{EfdA`}{}{}{EfdA`}Eh{EfdA`}{EfdA`}}{{{Ed{}{{D`{c}}{Db{e}}{Dd{g}}{Df{i}}{Dh{k}}{Dj{m}}{Dl{o}}{Dn{Aa}}{E`{Ac}}{Eb{Ae}}}}}c{dA`}{}{dA`}{EfdA`}{}{}{EfdA`}Eh{EfdA`}{EfdA`}}{{{Ed{}{{D`{c}}{Db{e}}{Dd{g}}{Df{i}}{Dh{k}}{Dj{m}}{Dl{o}}{Dn{Aa}}{E`{Ac}}{Eb{Ae}}}}}o{dA`}{}{dA`}{EfdA`}{}{}{EfdA`}Eh{EfdA`}{EfdA`}}{{{Ed{}{{D`{c}}{Db{e}}{Dd{g}}{Df{i}}{Dh{k}}{Dj{m}}{Dl{o}}{Dn{Aa}}{E`{Ac}}{Eb{Ae}}}}g}{{Bd{i}}}{dA`}{}{dA`}{EfdA`}{}{}{EfdA`}Eh{EfdA`}{EfdA`}}{{{Ed{}{{D`{c}}{Db{e}}{Dd{g}}{Df{i}}{Dh{k}}{Dj{m}}{Dl{o}}{Dn{Aa}}{E`{Ac}}{Eb{Ae}}}}ig}k{dA`}{}{dA`}{EfdA`}{}{}{EfdA`}Eh{EfdA`}{EfdA`}}{c{{Bj{e}}}{}{}}000{cBl{}}0{{{Ed{}{{D`{c}}{Db{e}}{Dd{g}}{Df{i}}{Dh{k}}{Dj{m}}{Dl{o}}{Dn{Aa}}{E`{Ac}}{Eb{Ae}}}}}Ad{dA`}{}{dA`}{EfdA`}{}{}{EfdA`}Eh{EfdA`}{EfdA`}}`````````","c":[],"p":[[6,"ParseError",0],[10,"Clone",165],[5,"ErrorRecovery",0],[1,"unit"],[6,"Ordering",166],[10,"Ord",166],[1,"str"],[10,"Debug",167],[10,"Display",167],[1,"bool"],[10,"PartialEq",166],[5,"Formatter",167],[8,"Result",167],[1,"never"],[17,"Output"],[10,"FnOnce",168],[10,"FnMut",168],[6,"Option",169],[10,"PartialOrd",166],[5,"String",170],[6,"Result",171],[5,"TypeId",172],[5,"Token",55],[5,"Error",167],[5,"MatcherBuilder",55],[5,"Matcher",55],[5,"BuildError",173],[10,"AsRef",174],[17,"Item"],[1,"tuple"],[10,"IntoIterator",175],[17,"Location"],[17,"Error"],[17,"Token"],[17,"TokenIndex"],[17,"Symbol"],[17,"Success"],[17,"StateIndex"],[17,"Action"],[17,"ReduceIndex"],[17,"NonterminalIndex"],[10,"ParserDefinition",92],[10,"Copy",176],[10,"ParserAction",92],[8,"ParseResult",92],[8,"TokenTriple",92],[8,"ParseError",92],[10,"Iterator",177],[8,"ErrorRecovery",92],[5,"Vec",178],[1,"slice"],[8,"SymbolTriple",92],[6,"SimulatedReduce",92],[15,"User",48],[15,"UnrecognizedEof",48],[15,"UnrecognizedToken",48],[15,"InvalidToken",48],[15,"ExtraToken",48],[5,"Parser",92],[15,"Reduce",163]],"b":[[22,"impl-Debug-for-ParseError%3CL,+T,+E%3E"],[23,"impl-Display-for-ParseError%3CL,+T,+E%3E"],[68,"impl-Display-for-Token%3C\'a%3E"],[69,"impl-Debug-for-Token%3C\'input%3E"]]}],\ ["lazy_static",{"doc":"A macro for declaring lazily evaluated statics.","t":"KHQ","n":["LazyStatic","initialize","lazy_static"],"q":[[0,"lazy_static"]],"d":["Support trait for enabling a few common operation on lazy …","Takes a shared reference to a lazy static and initializes …",""],"i":[0,0,0],"f":"`{cbd}`","c":[],"p":[[1,"unit"],[10,"LazyStatic",0]],"b":[]}],\ ["libc",{"doc":"libc - Raw FFI bindings to platforms’ system libraries","t":"SSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSHSSSSSSSSSSHSSSSSSSSHSHSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSHHHHHSSSHHHHHHHSHSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSGSSSSSSSSSSSFSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSIFFIIFIFFIIFFIIFIFIFIISSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSHHHSHSSSSSSSGSSSSSSSSSSSSSSSSSSSSSSSSSSSSSHSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSHSSHSSSSSSSSHSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSHSSSSSSSHSSSSSSSSSSSHSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSHSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSISSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSHSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSHSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSHSSSSSHSSSSSSSSSSHSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSHHHHSSSSSSSHHSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSHHSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSHSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSHSHSHHHHSSSSHHSHSHSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSUUFUFFFUFFHFIOOOOIOIIIIIOOIFIIIIOOOOOOOOOOOHOFFFOOHHOOOOOHHHHOHOOOOOOFHHOFOOOOOOOOOOHOHOOOHOOOOOOOHOOOHOOHHFHOOOOOOOOOOOOOOOOOOOOOFFFFHHHHHHOOOHOHIIINNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNHHOOOOOOOIIIOOIOOOOOOIIOOOOIIIIIIIGOHOOIOFFOOOOOFIFIOHHHHHHOOOOOOOOOHOHHHOOOHHHHHHHHIOIHNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNFHHHHOOOOFOOOOOHOOOOHFOOHHOHHOOOOOOOOOOOOOOOOHOOOOOOOOOOOIHOFFHHHFHHHHOOOOHHHOOOOOOOOHOOOOOOOOOOOFHOHHHHOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOHOOOOOOOOOOOOHHHHHHOOOOHHHFHHHOOOOOOHOHHIHOOHHHHHHHHHOOHOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOHOOHHFHHFHHHHHHHOOOFHHHHHHFFFOOFFFFFFHHHHHHHHHFHOOOOOOOOOOOOOOOOOOHFHFHNOOHHOOHHHGGOHHHOOOHHHHOHHOOHHHONNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNOOIHHHHHHHIFOOHHHHHHHHHHHHHHHOOHHOHHFHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHOOIOOOOOOOOHHFFHHHHHHHOOOOHIOFOOOOOOOOOOOHOOOOOOFHFOHHHIOOOOOOIIHOHOFHHOOOOOOOFOOFOOOOOOOFOOOOOOOOOOOOOOOOOOOOOFFFFFIFIOOOOHIIHFHHHFFFFFOOIIIIOOOOOOOOOINNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNIFHHHOOFOFFFFOOOOOFOOOOHHHHHHHHHHHHHOOOOFFOOOOOOFOOOHOOOOOOOIOHHOOOOOOOOOOOOHHHFOOOOOOOOOOOOHFHHHHHHOIHHHHIHHHHHHHHHOHOOHHHFHFHHHHHHOOFOOOFOOOHHHHHHHHHOHOHHHHHHHHHHHHHHHHHHFOOOOOOFOOIOOOOOHHFHOOHOOHHHHHHHIOOOOHHOOOOOOOOOOOOOOOOOOHHFFIOOOOOIHOHOOFHHHHOOOOOOOOOOOOOIHOOOHIHOOIHHFFOFOOFIOOOOOFFOOOOOOOOOOOOOOOHHHFOOOOOOIIOOOOHHFHHHHHHHFOOOOOOOOOOOOOOOOOOOOOOOOOOFOOOOFHHHOHHOOOIOOOOIOHHHFHOOHHHHHHHHHHHHHHHHHHIHHHHHHHHHHHHHHIHHOOOHHHHHHHOHOIHHHHOOOOFHHHHHHHHHHHHHHHHHHFHHFHHHHHFHHHHHFHHHHHHHHFHHHHHHHHHHHHIHHHHHFHHHHHHHHHHHHFHIHHHFHHHHHHHHHHFHHHHHHHHHHHHHIIHFFFIHHHHHHHHHOOOOOOOHHHHHHHHHOOOOOOOOHHOOOOOOOOOOOOOOOOHHHHHHHHHHHHHOOOHHHHHHFHHFIOOHHHHHHOOOOHOOOOOOOOOHHOOOOOIOOOOIFFOOHOOOOOOOOOOOOOOOOOOOFOOOOOOOOOOOOOOOOFOOOOOOOOOOOOOOOOOOIOOOOOOOOOOOOHOHFOOHHHHHHOFOOOOHOHHHHIFFFFFFFOOFOFOFFOFHHHHOHOHHOOOHOOHFHHHHOFHHFFOOOOOHOOOOHHHHHHFOOHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHOOOOOOOOOOOOOOOOOOOOOOOOOOOOHOOHHIHHHFHNOONONNNNNFHHHHHOOOOFHIFHHOHFOOHHFHHFHHOOOOOOOOOOOOOOOOOOOOOOOOIHOOOOOOOOOOOOOOHFFFFFFFFFFFFFFFHHIOOOOOOOOOIHHFHHOOOOOOOOOHOOOOOOOOOOOOOOOOOOOOIOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOFOOOOFHFHFHFHOFHFHFHFOHHHHHHHHHHHHHHHHHHHHHHHOHHHHHHHHHHHHHHHOOOOOOOOOOOOOOOOOOOOOOOOIOOOOOOHHHOOOOOOOHHHHHHHHFHHOHOOHIHHHHHHHHHHFFOOHOOOIHHHHHHIHHHHFFFGOFFFFFOOOOOOOOOOOHHHFOOOOOHOOOHOOHHNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNHHOOOOOOOOOOOOOOOOOONNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNOOOOOOOOOOOOOOOOFFOOIFFFFFIIIIIIHHHHHHHHHHOOOOIHFFFHOOOOOOOOOOOOFHHHHFHFOOOOOOOOOOHHHHHHHOIHHOOFHHHOOOOFFFFFFFFFFO","n":["ABDAY_1","ABDAY_2","ABDAY_3","ABDAY_4","ABDAY_5","ABDAY_6","ABDAY_7","ABMON_1","ABMON_10","ABMON_11","ABMON_12","ABMON_2","ABMON_3","ABMON_4","ABMON_5","ABMON_6","ABMON_7","ABMON_8","ABMON_9","ABS_CNT","ABS_MAX","ACCOUNTING","ADDR_COMPAT_LAYOUT","ADDR_LIMIT_32BIT","ADDR_LIMIT_3GB","ADDR_NO_RANDOMIZE","ADFS_SUPER_MAGIC","ADJ_ESTERROR","ADJ_FREQUENCY","ADJ_MAXERROR","ADJ_MICRO","ADJ_NANO","ADJ_OFFSET","ADJ_OFFSET_SINGLESHOT","ADJ_OFFSET_SS_READ","ADJ_SETOFFSET","ADJ_STATUS","ADJ_TAI","ADJ_TICK","ADJ_TIMECONST","AFFS_SUPER_MAGIC","AFS_SUPER_MAGIC","AF_ALG","AF_APPLETALK","AF_ASH","AF_ATMPVC","AF_ATMSVC","AF_AX25","AF_BLUETOOTH","AF_BRIDGE","AF_CAIF","AF_CAN","AF_DECnet","AF_ECONET","AF_IB","AF_IEEE802154","AF_INET","AF_INET6","AF_IPX","AF_IRDA","AF_ISDN","AF_IUCV","AF_KEY","AF_LLC","AF_LOCAL","AF_MPLS","AF_NETBEUI","AF_NETLINK","AF_NETROM","AF_NFC","AF_PACKET","AF_PHONET","AF_PPPOX","AF_RDS","AF_ROSE","AF_ROUTE","AF_RXRPC","AF_SECURITY","AF_SNA","AF_TIPC","AF_UNIX","AF_UNSPEC","AF_VSOCK","AF_WANPIPE","AF_X25","AF_XDP","AIO_ALLDONE","AIO_CANCELED","AIO_NOTCANCELED","AI_ADDRCONFIG","AI_ALL","AI_CANONNAME","AI_NUMERICHOST","AI_NUMERICSERV","AI_PASSIVE","AI_V4MAPPED","ALG_OP_DECRYPT","ALG_OP_ENCRYPT","ALG_SET_AEAD_ASSOCLEN","ALG_SET_AEAD_AUTHSIZE","ALG_SET_DRBG_ENTROPY","ALG_SET_IV","ALG_SET_KEY","ALG_SET_KEY_BY_KEY_SERIAL","ALG_SET_OP","ALT_DIGITS","AM_STR","ARPD_FLUSH","ARPD_LOOKUP","ARPD_UPDATE","ARPHRD_ADAPT","ARPHRD_APPLETLK","ARPHRD_ARCNET","ARPHRD_ASH","ARPHRD_ATM","ARPHRD_AX25","ARPHRD_BIF","ARPHRD_CAN","ARPHRD_CHAOS","ARPHRD_CISCO","ARPHRD_CSLIP","ARPHRD_CSLIP6","ARPHRD_DDCMP","ARPHRD_DLCI","ARPHRD_ECONET","ARPHRD_EETHER","ARPHRD_ETHER","ARPHRD_EUI64","ARPHRD_FCAL","ARPHRD_FCFABRIC","ARPHRD_FCPL","ARPHRD_FCPP","ARPHRD_FDDI","ARPHRD_FRAD","ARPHRD_HDLC","ARPHRD_HIPPI","ARPHRD_HWX25","ARPHRD_IEEE1394","ARPHRD_IEEE802","ARPHRD_IEEE80211","ARPHRD_IEEE80211_PRISM","ARPHRD_IEEE80211_RADIOTAP","ARPHRD_IEEE802154","ARPHRD_IEEE802_TR","ARPHRD_INFINIBAND","ARPHRD_IPDDP","ARPHRD_IPGRE","ARPHRD_IRDA","ARPHRD_LAPB","ARPHRD_LOCALTLK","ARPHRD_LOOPBACK","ARPHRD_METRICOM","ARPHRD_NETROM","ARPHRD_NONE","ARPHRD_PIMREG","ARPHRD_PPP","ARPHRD_PRONET","ARPHRD_RAWHDLC","ARPHRD_ROSE","ARPHRD_RSRVD","ARPHRD_SIT","ARPHRD_SKIP","ARPHRD_SLIP","ARPHRD_SLIP6","ARPHRD_TUNNEL","ARPHRD_TUNNEL6","ARPHRD_VOID","ARPHRD_X25","ARPOP_InREPLY","ARPOP_InREQUEST","ARPOP_NAK","ARPOP_REPLY","ARPOP_REQUEST","ARPOP_RREPLY","ARPOP_RREQUEST","ATF_COM","ATF_DONTPUB","ATF_MAGIC","ATF_NETMASK","ATF_PERM","ATF_PUBL","ATF_USETRAILERS","AT_BASE","AT_BASE_PLATFORM","AT_CLKTCK","AT_EACCESS","AT_EGID","AT_EMPTY_PATH","AT_ENTRY","AT_EUID","AT_EXECFD","AT_EXECFN","AT_FDCWD","AT_FLAGS","AT_GID","AT_HWCAP","AT_HWCAP2","AT_IGNORE","AT_MINSIGSTKSZ","AT_NOTELF","AT_NO_AUTOMOUNT","AT_NULL","AT_PAGESZ","AT_PHDR","AT_PHENT","AT_PHNUM","AT_PLATFORM","AT_RANDOM","AT_RECURSIVE","AT_REMOVEDIR","AT_SECURE","AT_STATX_DONT_SYNC","AT_STATX_FORCE_SYNC","AT_STATX_SYNC_AS_STAT","AT_STATX_SYNC_TYPE","AT_SYMLINK_FOLLOW","AT_SYMLINK_NOFOLLOW","AT_SYSINFO_EHDR","AT_UID","AUTOFS_SUPER_MAGIC","B0","B1000000","B110","B115200","B1152000","B1200","B134","B150","B1500000","B1800","B19200","B200","B2000000","B230400","B2400","B2500000","B300","B3000000","B3500000","B38400","B4000000","B460800","B4800","B50","B500000","B57600","B576000","B600","B75","B921600","B9600","BINDERFS_SUPER_MAGIC","BLKIOMIN","BLKIOOPT","BLKPBSZGET","BLKSSZGET","BOOT_TIME","BOTHER","BPF_ABS","BPF_ADD","BPF_ALU","BPF_AND","BPF_B","BPF_DIV","BPF_FS_MAGIC","BPF_H","BPF_IMM","BPF_IND","BPF_JA","BPF_JEQ","BPF_JGE","BPF_JGT","BPF_JMP","BPF_JSET","BPF_JUMP","BPF_K","BPF_LD","BPF_LDX","BPF_LEN","BPF_LL_OFF","BPF_LSH","BPF_MAXINSNS","BPF_MEM","BPF_MEMWORDS","BPF_MISC","BPF_MISCOP","BPF_MOD","BPF_MSH","BPF_MUL","BPF_NEG","BPF_NET_OFF","BPF_OR","BPF_RET","BPF_RSH","BPF_RVAL","BPF_ST","BPF_STMT","BPF_STX","BPF_SUB","BPF_W","BPF_X","BPF_XOR","BRKINT","BS0","BS1","BSDLY","BTRFS_SUPER_MAGIC","BUFSIZ","BUS_ADRALN","BUS_ADRERR","BUS_MCEERR_AO","BUS_MCEERR_AR","BUS_OBJERR","CANFD_BRS","CANFD_ESI","CANFD_MAX_DLC","CANFD_MAX_DLEN","CANFD_MTU","CANXL_HDR_SIZE","CANXL_MAX_DLC","CANXL_MAX_DLC_MASK","CANXL_MAX_DLEN","CANXL_MAX_MTU","CANXL_MIN_DLC","CANXL_MIN_DLEN","CANXL_MIN_MTU","CANXL_MTU","CANXL_PRIO_BITS","CANXL_PRIO_MASK","CANXL_SEC","CANXL_XLF","CAN_BCM","CAN_EFF_FLAG","CAN_EFF_ID_BITS","CAN_EFF_MASK","CAN_ERR_FLAG","CAN_ERR_MASK","CAN_INV_FILTER","CAN_ISOTP","CAN_J1939","CAN_MAX_DLC","CAN_MAX_DLEN","CAN_MCNET","CAN_MTU","CAN_NPROTO","CAN_RAW","CAN_RAW_ERR_FILTER","CAN_RAW_FD_FRAMES","CAN_RAW_FILTER","CAN_RAW_FILTER_MAX","CAN_RAW_JOIN_FILTERS","CAN_RAW_LOOPBACK","CAN_RAW_RECV_OWN_MSGS","CAN_RAW_XL_FRAMES","CAN_RTR_FLAG","CAN_SFF_ID_BITS","CAN_SFF_MASK","CAN_TP16","CAN_TP20","CBAUD","CBAUDEX","CGROUP2_SUPER_MAGIC","CGROUP_SUPER_MAGIC","CIBAUD","CLD_CONTINUED","CLD_DUMPED","CLD_EXITED","CLD_KILLED","CLD_STOPPED","CLD_TRAPPED","CLOCAL","CLOCK_BOOTTIME","CLOCK_BOOTTIME_ALARM","CLOCK_MONOTONIC","CLOCK_MONOTONIC_COARSE","CLOCK_MONOTONIC_RAW","CLOCK_PROCESS_CPUTIME_ID","CLOCK_REALTIME","CLOCK_REALTIME_ALARM","CLOCK_REALTIME_COARSE","CLOCK_TAI","CLOCK_THREAD_CPUTIME_ID","CLONE_CHILD_CLEARTID","CLONE_CHILD_SETTID","CLONE_CLEAR_SIGHAND","CLONE_DETACHED","CLONE_FILES","CLONE_FS","CLONE_INTO_CGROUP","CLONE_IO","CLONE_NEWCGROUP","CLONE_NEWIPC","CLONE_NEWNET","CLONE_NEWNS","CLONE_NEWPID","CLONE_NEWTIME","CLONE_NEWUSER","CLONE_NEWUTS","CLONE_PARENT","CLONE_PARENT_SETTID","CLONE_PIDFD","CLONE_PTRACE","CLONE_SETTLS","CLONE_SIGHAND","CLONE_SYSVSEM","CLONE_THREAD","CLONE_UNTRACED","CLONE_VFORK","CLONE_VM","CLOSE_RANGE_CLOEXEC","CLOSE_RANGE_UNSHARE","CMSG_DATA","CMSG_FIRSTHDR","CMSG_LEN","CMSG_NXTHDR","CMSG_SPACE","CMSPAR","CODA_SUPER_MAGIC","CODESET","CPU_ALLOC_SIZE","CPU_CLR","CPU_COUNT","CPU_COUNT_S","CPU_EQUAL","CPU_ISSET","CPU_SET","CPU_SETSIZE","CPU_ZERO","CR0","CR1","CR2","CR3","CRAMFS_MAGIC","CRDLY","CREAD","CRNCYSTR","CRTSCTS","CS","CS5","CS6","CS7","CS8","CSIGNAL","CSIZE","CSTOPB","CTL_ABI","CTL_BUS","CTL_BUS_ISA","CTL_CPU","CTL_DEBUG","CTL_DEV","CTL_FS","CTL_KERN","CTL_NET","CTL_VM","CTRL_ATTR_FAMILY_ID","CTRL_ATTR_FAMILY_NAME","CTRL_ATTR_HDRSIZE","CTRL_ATTR_MAXATTR","CTRL_ATTR_MCAST_GROUPS","CTRL_ATTR_MCAST_GRP_ID","CTRL_ATTR_MCAST_GRP_NAME","CTRL_ATTR_MCAST_GRP_UNSPEC","CTRL_ATTR_OPS","CTRL_ATTR_OP_FLAGS","CTRL_ATTR_OP_ID","CTRL_ATTR_OP_UNSPEC","CTRL_ATTR_UNSPEC","CTRL_ATTR_VERSION","CTRL_CMD_DELFAMILY","CTRL_CMD_DELMCAST_GRP","CTRL_CMD_DELOPS","CTRL_CMD_GETFAMILY","CTRL_CMD_GETMCAST_GRP","CTRL_CMD_GETOPS","CTRL_CMD_NEWFAMILY","CTRL_CMD_NEWMCAST_GRP","CTRL_CMD_NEWOPS","CTRL_CMD_UNSPEC","DAY_1","DAY_2","DAY_3","DAY_4","DAY_5","DAY_6","DAY_7","DCCP_SERVICE_LIST_MAX_LEN","DCCP_SOCKOPT_AVAILABLE_CCIDS","DCCP_SOCKOPT_CCID","DCCP_SOCKOPT_CCID_RX_INFO","DCCP_SOCKOPT_CCID_TX_INFO","DCCP_SOCKOPT_CHANGE_L","DCCP_SOCKOPT_CHANGE_R","DCCP_SOCKOPT_GET_CUR_MPS","DCCP_SOCKOPT_PACKET_SIZE","DCCP_SOCKOPT_QPOLICY_ID","DCCP_SOCKOPT_QPOLICY_TXQLEN","DCCP_SOCKOPT_RECV_CSCOV","DCCP_SOCKOPT_RX_CCID","DCCP_SOCKOPT_SEND_CSCOV","DCCP_SOCKOPT_SERVER_TIMEWAIT","DCCP_SOCKOPT_SERVICE","DCCP_SOCKOPT_TX_CCID","DEAD_PROCESS","DEBUGFS_MAGIC","DEVPTS_SUPER_MAGIC","DIR","DS","DT_BLK","DT_CHR","DT_DIR","DT_FIFO","DT_LNK","DT_REG","DT_SOCK","DT_UNKNOWN","D_FMT","D_T_FMT","Dl_info","E2BIG","EACCES","EADDRINUSE","EADDRNOTAVAIL","EADV","EAFNOSUPPORT","EAGAIN","EAI_AGAIN","EAI_BADFLAGS","EAI_FAIL","EAI_FAMILY","EAI_MEMORY","EAI_NODATA","EAI_NONAME","EAI_OVERFLOW","EAI_SERVICE","EAI_SOCKTYPE","EAI_SYSTEM","EALREADY","EBADE","EBADF","EBADFD","EBADMSG","EBADR","EBADRQC","EBADSLT","EBFONT","EBUSY","ECANCELED","ECHILD","ECHO","ECHOCTL","ECHOE","ECHOK","ECHOKE","ECHONL","ECHOPRT","ECHRNG","ECOMM","ECONNABORTED","ECONNREFUSED","ECONNRESET","ECRYPTFS_SUPER_MAGIC","EDEADLK","EDEADLOCK","EDESTADDRREQ","EDOM","EDOTDOT","EDQUOT","EEXIST","EFAULT","EFBIG","EFD_CLOEXEC","EFD_NONBLOCK","EFD_SEMAPHORE","EFLAGS","EFS_SUPER_MAGIC","EHOSTDOWN","EHOSTUNREACH","EHWPOISON","EIDRM","EILSEQ","EINPROGRESS","EINTR","EINVAL","EIO","EISCONN","EISDIR","EISNAM","EI_ABIVERSION","EI_CLASS","EI_DATA","EI_MAG0","EI_MAG1","EI_MAG2","EI_MAG3","EI_NIDENT","EI_OSABI","EI_PAD","EI_VERSION","EKEYEXPIRED","EKEYREJECTED","EKEYREVOKED","EL2HLT","EL2NSYNC","EL3HLT","EL3RST","ELFCLASS32","ELFCLASS64","ELFCLASSNONE","ELFCLASSNUM","ELFDATA2LSB","ELFDATA2MSB","ELFDATANONE","ELFDATANUM","ELFMAG0","ELFMAG1","ELFMAG2","ELFMAG3","ELFOSABI_AIX","ELFOSABI_ARM","ELFOSABI_ARM_AEABI","ELFOSABI_FREEBSD","ELFOSABI_GNU","ELFOSABI_HPUX","ELFOSABI_IRIX","ELFOSABI_LINUX","ELFOSABI_MODESTO","ELFOSABI_NETBSD","ELFOSABI_NONE","ELFOSABI_OPENBSD","ELFOSABI_SOLARIS","ELFOSABI_STANDALONE","ELFOSABI_SYSV","ELFOSABI_TRU64","ELIBACC","ELIBBAD","ELIBEXEC","ELIBMAX","ELIBSCN","ELNRNG","ELOOP","EMEDIUMTYPE","EMFILE","EMLINK","EMPTY","EMSGSIZE","EMULTIHOP","EM_386","EM_68HC05","EM_68HC08","EM_68HC11","EM_68HC12","EM_68HC16","EM_68K","EM_860","EM_88K","EM_960","EM_AARCH64","EM_ALPHA","EM_ARC","EM_ARC_A5","EM_ARM","EM_AVR","EM_COLDFIRE","EM_CRIS","EM_D10V","EM_D30V","EM_FAKE_ALPHA","EM_FIREPATH","EM_FR20","EM_FR30","EM_FX66","EM_H8S","EM_H8_300","EM_H8_300H","EM_H8_500","EM_HUANY","EM_IA_64","EM_JAVELIN","EM_M32","EM_M32R","EM_ME16","EM_MIPS","EM_MIPS_RS3_LE","EM_MIPS_X","EM_MMA","EM_MMIX","EM_MN10200","EM_MN10300","EM_NCPU","EM_NDR1","EM_NONE","EM_OPENRISC","EM_PARISC","EM_PCP","EM_PDSP","EM_PJ","EM_PPC","EM_PPC64","EM_PRISM","EM_RCE","EM_RH32","EM_S370","EM_S390","EM_SH","EM_SPARC","EM_SPARC32PLUS","EM_SPARCV9","EM_ST100","EM_ST19","EM_ST7","EM_ST9PLUS","EM_STARCORE","EM_SVX","EM_TILEGX","EM_TILEPRO","EM_TINYJ","EM_TRICORE","EM_V800","EM_V850","EM_VAX","EM_VPP500","EM_X86_64","EM_XTENSA","EM_ZSP","ENAMETOOLONG","ENAVAIL","ENETDOWN","ENETRESET","ENETUNREACH","ENFILE","ENOANO","ENOATTR","ENOBUFS","ENOCSI","ENODATA","ENODEV","ENOENT","ENOEXEC","ENOKEY","ENOLCK","ENOLINK","ENOMEDIUM","ENOMEM","ENOMSG","ENONET","ENOPKG","ENOPROTOOPT","ENOSPC","ENOSR","ENOSTR","ENOSYS","ENOTBLK","ENOTCONN","ENOTDIR","ENOTEMPTY","ENOTNAM","ENOTRECOVERABLE","ENOTSOCK","ENOTSUP","ENOTTY","ENOTUNIQ","ENXIO","EOF","EOPNOTSUPP","EOVERFLOW","EOWNERDEAD","EPERM","EPFNOSUPPORT","EPIPE","EPOLLERR","EPOLLET","EPOLLEXCLUSIVE","EPOLLHUP","EPOLLIN","EPOLLMSG","EPOLLONESHOT","EPOLLOUT","EPOLLPRI","EPOLLRDBAND","EPOLLRDHUP","EPOLLRDNORM","EPOLLWAKEUP","EPOLLWRBAND","EPOLLWRNORM","EPOLL_CLOEXEC","EPOLL_CTL_ADD","EPOLL_CTL_DEL","EPOLL_CTL_MOD","EPROTO","EPROTONOSUPPORT","EPROTOTYPE","ERA","ERANGE","ERA_D_FMT","ERA_D_T_FMT","ERA_T_FMT","EREMCHG","EREMOTE","EREMOTEIO","ERESTART","ERFKILL","EROFS","ES","ESHUTDOWN","ESOCKTNOSUPPORT","ESPIPE","ESRCH","ESRMNT","ESTALE","ESTRPIPE","ETH_ALEN","ETH_DATA_LEN","ETH_FCS_LEN","ETH_FRAME_LEN","ETH_HLEN","ETH_P_1588","ETH_P_8021AD","ETH_P_8021AH","ETH_P_8021Q","ETH_P_80221","ETH_P_802_2","ETH_P_802_3","ETH_P_802_3_MIN","ETH_P_802_EX1","ETH_P_AARP","ETH_P_AF_IUCV","ETH_P_ALL","ETH_P_AOE","ETH_P_ARCNET","ETH_P_ARP","ETH_P_ATALK","ETH_P_ATMFATE","ETH_P_ATMMPOA","ETH_P_AX25","ETH_P_BATMAN","ETH_P_BPQ","ETH_P_CAIF","ETH_P_CANFD","ETH_P_CONTROL","ETH_P_CUST","ETH_P_DDCMP","ETH_P_DEC","ETH_P_DIAG","ETH_P_DNA_DL","ETH_P_DNA_RC","ETH_P_DNA_RT","ETH_P_DSA","ETH_P_ECONET","ETH_P_EDSA","ETH_P_FCOE","ETH_P_FIP","ETH_P_HDLC","ETH_P_IEEE802154","ETH_P_IEEEPUP","ETH_P_IEEEPUPAT","ETH_P_IP","ETH_P_IPV6","ETH_P_IPX","ETH_P_IRDA","ETH_P_LAT","ETH_P_LINK_CTL","ETH_P_LOCALTALK","ETH_P_LOOP","ETH_P_LOOPBACK","ETH_P_MACSEC","ETH_P_MOBITEX","ETH_P_MPLS_MC","ETH_P_MPLS_UC","ETH_P_MVRP","ETH_P_PAE","ETH_P_PAUSE","ETH_P_PHONET","ETH_P_PPPTALK","ETH_P_PPP_DISC","ETH_P_PPP_MP","ETH_P_PPP_SES","ETH_P_PRP","ETH_P_PUP","ETH_P_PUPAT","ETH_P_QINQ1","ETH_P_QINQ2","ETH_P_QINQ3","ETH_P_RARP","ETH_P_SCA","ETH_P_SLOW","ETH_P_SNAP","ETH_P_TDLS","ETH_P_TEB","ETH_P_TIPC","ETH_P_TRAILER","ETH_P_TR_802_2","ETH_P_WAN_PPP","ETH_P_WCCP","ETH_P_X25","ETH_ZLEN","ETIME","ETIMEDOUT","ETOOMANYREFS","ETXTBSY","ET_CORE","ET_DYN","ET_EXEC","ET_HIOS","ET_HIPROC","ET_LOOS","ET_LOPROC","ET_NONE","ET_NUM","ET_REL","EUCLEAN","EUNATCH","EUSERS","EV_CNT","EV_CURRENT","EV_MAX","EV_NONE","EV_NUM","EWOULDBLOCK","EXDEV","EXFULL","EXIT_FAILURE","EXIT_SUCCESS","EXT2_SUPER_MAGIC","EXT3_SUPER_MAGIC","EXT4_SUPER_MAGIC","EXTA","EXTB","EXTPROC","Elf32_Addr","Elf32_Chdr","Elf32_Ehdr","Elf32_Half","Elf32_Off","Elf32_Phdr","Elf32_Section","Elf32_Shdr","Elf32_Sym","Elf32_Word","Elf64_Addr","Elf64_Chdr","Elf64_Ehdr","Elf64_Half","Elf64_Off","Elf64_Phdr","Elf64_Section","Elf64_Shdr","Elf64_Sxword","Elf64_Sym","Elf64_Word","Elf64_Xword","F2FS_SUPER_MAGIC","FALLOC_FL_COLLAPSE_RANGE","FALLOC_FL_INSERT_RANGE","FALLOC_FL_KEEP_SIZE","FALLOC_FL_PUNCH_HOLE","FALLOC_FL_UNSHARE_RANGE","FALLOC_FL_ZERO_RANGE","FANOTIFY_METADATA_VERSION","FAN_ACCESS","FAN_ACCESS_PERM","FAN_ALLOW","FAN_ATTRIB","FAN_AUDIT","FAN_CLASS_CONTENT","FAN_CLASS_NOTIF","FAN_CLASS_PRE_CONTENT","FAN_CLOEXEC","FAN_CLOSE","FAN_CLOSE_NOWRITE","FAN_CLOSE_WRITE","FAN_CREATE","FAN_DELETE","FAN_DELETE_SELF","FAN_DENY","FAN_ENABLE_AUDIT","FAN_EPIDFD","FAN_EVENT_INFO_TYPE_DFID","FAN_EVENT_INFO_TYPE_DFID_NAME","FAN_EVENT_INFO_TYPE_ERROR","FAN_EVENT_INFO_TYPE_FID","FAN_EVENT_INFO_TYPE_NEW_DFID_NAME","FAN_EVENT_INFO_TYPE_OLD_DFID_NAME","FAN_EVENT_INFO_TYPE_PIDFD","FAN_EVENT_ON_CHILD","FAN_FS_ERROR","FAN_INFO","FAN_MARK_ADD","FAN_MARK_DONT_FOLLOW","FAN_MARK_EVICTABLE","FAN_MARK_FILESYSTEM","FAN_MARK_FLUSH","FAN_MARK_IGNORE","FAN_MARK_IGNORED_MASK","FAN_MARK_IGNORED_SURV_MODIFY","FAN_MARK_IGNORE_SURV","FAN_MARK_INODE","FAN_MARK_MOUNT","FAN_MARK_ONLYDIR","FAN_MARK_REMOVE","FAN_MODIFY","FAN_MOVE","FAN_MOVED_FROM","FAN_MOVED_TO","FAN_MOVE_SELF","FAN_NOFD","FAN_NONBLOCK","FAN_NOPIDFD","FAN_ONDIR","FAN_OPEN","FAN_OPEN_EXEC","FAN_OPEN_EXEC_PERM","FAN_OPEN_PERM","FAN_Q_OVERFLOW","FAN_RENAME","FAN_REPORT_DFID_NAME","FAN_REPORT_DFID_NAME_TARGET","FAN_REPORT_DIR_FID","FAN_REPORT_FID","FAN_REPORT_NAME","FAN_REPORT_PIDFD","FAN_REPORT_TARGET_FID","FAN_REPORT_TID","FAN_RESPONSE_INFO_AUDIT_RULE","FAN_RESPONSE_INFO_NONE","FAN_UNLIMITED_MARKS","FAN_UNLIMITED_QUEUE","FDPIC_FUNCPTRS","FD_CLOEXEC","FD_CLR","FD_ISSET","FD_SET","FD_SETSIZE","FD_ZERO","FF0","FF1","FFDLY","FF_CNT","FF_MAX","FICLONE","FICLONERANGE","FILE","FILENAME_MAX","FIOASYNC","FIOCLEX","FIONBIO","FIONCLEX","FIONREAD","FIOQSIZE","FLUSHO","FOPEN_MAX","FS","FS_BASE","FS_IOC32_GETFLAGS","FS_IOC32_GETVERSION","FS_IOC32_SETFLAGS","FS_IOC32_SETVERSION","FS_IOC_GETFLAGS","FS_IOC_GETVERSION","FS_IOC_SETFLAGS","FS_IOC_SETVERSION","FUSE_SUPER_MAGIC","FUTEXFS_SUPER_MAGIC","FUTEX_BITSET_MATCH_ANY","FUTEX_CLOCK_REALTIME","FUTEX_CMD_MASK","FUTEX_CMP_REQUEUE","FUTEX_CMP_REQUEUE_PI","FUTEX_FD","FUTEX_LOCK_PI","FUTEX_LOCK_PI2","FUTEX_OP","FUTEX_OP_ADD","FUTEX_OP_ANDN","FUTEX_OP_CMP_EQ","FUTEX_OP_CMP_GE","FUTEX_OP_CMP_GT","FUTEX_OP_CMP_LE","FUTEX_OP_CMP_LT","FUTEX_OP_CMP_NE","FUTEX_OP_OPARG_SHIFT","FUTEX_OP_OR","FUTEX_OP_SET","FUTEX_OP_XOR","FUTEX_PRIVATE_FLAG","FUTEX_REQUEUE","FUTEX_TRYLOCK_PI","FUTEX_UNLOCK_PI","FUTEX_WAIT","FUTEX_WAIT_BITSET","FUTEX_WAIT_REQUEUE_PI","FUTEX_WAKE","FUTEX_WAKE_BITSET","FUTEX_WAKE_OP","F_ADD_SEALS","F_CANCELLK","F_DUPFD","F_DUPFD_CLOEXEC","F_GETFD","F_GETFL","F_GETLEASE","F_GETLK","F_GETOWN","F_GETPIPE_SZ","F_GET_SEALS","F_LOCK","F_NOTIFY","F_OFD_GETLK","F_OFD_SETLK","F_OFD_SETLKW","F_OK","F_RDLCK","F_SEAL_FUTURE_WRITE","F_SEAL_GROW","F_SEAL_SEAL","F_SEAL_SHRINK","F_SEAL_WRITE","F_SETFD","F_SETFL","F_SETLEASE","F_SETLK","F_SETLKW","F_SETOWN","F_SETPIPE_SZ","F_TEST","F_TLOCK","F_ULOCK","F_UNLCK","F_WRLCK","GENL_ADMIN_PERM","GENL_CMD_CAP_DO","GENL_CMD_CAP_DUMP","GENL_CMD_CAP_HASPOL","GENL_ID_CTRL","GENL_ID_PMCRAID","GENL_ID_VFS_DQUOT","GENL_MAX_ID","GENL_MIN_ID","GENL_NAMSIZ","GENL_UNS_ADMIN_PERM","GLOB_ABORTED","GLOB_ALTDIRFUNC","GLOB_APPEND","GLOB_BRACE","GLOB_DOOFFS","GLOB_ERR","GLOB_MARK","GLOB_NOCHECK","GLOB_NOESCAPE","GLOB_NOMAGIC","GLOB_NOMATCH","GLOB_NOSORT","GLOB_NOSPACE","GLOB_ONLYDIR","GLOB_PERIOD","GLOB_TILDE","GLOB_TILDE_CHECK","GRND_INSECURE","GRND_NONBLOCK","GRND_RANDOM","GRPQUOTA","GS","GS_BASE","HOSTFS_SUPER_MAGIC","HPFS_SUPER_MAGIC","HUGETLBFS_MAGIC","HUGETLB_FLAG_ENCODE_16GB","HUGETLB_FLAG_ENCODE_16MB","HUGETLB_FLAG_ENCODE_1GB","HUGETLB_FLAG_ENCODE_1MB","HUGETLB_FLAG_ENCODE_256MB","HUGETLB_FLAG_ENCODE_2GB","HUGETLB_FLAG_ENCODE_2MB","HUGETLB_FLAG_ENCODE_32MB","HUGETLB_FLAG_ENCODE_512KB","HUGETLB_FLAG_ENCODE_512MB","HUGETLB_FLAG_ENCODE_64KB","HUGETLB_FLAG_ENCODE_8MB","HUGETLB_FLAG_ENCODE_MASK","HUGETLB_FLAG_ENCODE_SHIFT","HUPCL","HWTSTAMP_FILTER_ALL","HWTSTAMP_FILTER_NONE","HWTSTAMP_FILTER_NTP_ALL","HWTSTAMP_FILTER_PTP_V1_L4_DELAY_REQ","HWTSTAMP_FILTER_PTP_V1_L4_EVENT","HWTSTAMP_FILTER_PTP_V1_L4_SYNC","HWTSTAMP_FILTER_PTP_V2_DELAY_REQ","HWTSTAMP_FILTER_PTP_V2_EVENT","HWTSTAMP_FILTER_PTP_V2_L2_DELAY_REQ","HWTSTAMP_FILTER_PTP_V2_L2_EVENT","HWTSTAMP_FILTER_PTP_V2_L2_SYNC","HWTSTAMP_FILTER_PTP_V2_L4_DELAY_REQ","HWTSTAMP_FILTER_PTP_V2_L4_EVENT","HWTSTAMP_FILTER_PTP_V2_L4_SYNC","HWTSTAMP_FILTER_PTP_V2_SYNC","HWTSTAMP_FILTER_SOME","HWTSTAMP_TX_OFF","HWTSTAMP_TX_ON","HWTSTAMP_TX_ONESTEP_P2P","HWTSTAMP_TX_ONESTEP_SYNC","IBSHIFT","ICANON","ICRNL","IEXTEN","IFA_ADDRESS","IFA_ANYCAST","IFA_BROADCAST","IFA_CACHEINFO","IFA_FLAGS","IFA_F_DADFAILED","IFA_F_DEPRECATED","IFA_F_HOMEADDRESS","IFA_F_MANAGETEMPADDR","IFA_F_MCAUTOJOIN","IFA_F_NODAD","IFA_F_NOPREFIXROUTE","IFA_F_OPTIMISTIC","IFA_F_PERMANENT","IFA_F_SECONDARY","IFA_F_STABLE_PRIVACY","IFA_F_TEMPORARY","IFA_F_TENTATIVE","IFA_LABEL","IFA_LOCAL","IFA_MULTICAST","IFA_UNSPEC","IFF_ALLMULTI","IFF_ATTACH_QUEUE","IFF_AUTOMEDIA","IFF_BROADCAST","IFF_DEBUG","IFF_DETACH_QUEUE","IFF_DORMANT","IFF_DYNAMIC","IFF_ECHO","IFF_LOOPBACK","IFF_LOWER_UP","IFF_MASTER","IFF_MULTICAST","IFF_MULTI_QUEUE","IFF_NAPI","IFF_NAPI_FRAGS","IFF_NOARP","IFF_NOFILTER","IFF_NOTRAILERS","IFF_NO_CARRIER","IFF_NO_PI","IFF_ONE_QUEUE","IFF_PERSIST","IFF_POINTOPOINT","IFF_PORTSEL","IFF_PROMISC","IFF_RUNNING","IFF_SLAVE","IFF_TAP","IFF_TUN","IFF_TUN_EXCL","IFF_UP","IFF_VNET_HDR","IFLA_ADDRESS","IFLA_AF_SPEC","IFLA_ALLMULTI","IFLA_ALT_IFNAME","IFLA_BROADCAST","IFLA_CARRIER","IFLA_CARRIER_CHANGES","IFLA_CARRIER_DOWN_COUNT","IFLA_CARRIER_UP_COUNT","IFLA_COST","IFLA_EVENT","IFLA_EXT_MASK","IFLA_GROUP","IFLA_GRO_MAX_SIZE","IFLA_GSO_MAX_SEGS","IFLA_GSO_MAX_SIZE","IFLA_IFALIAS","IFLA_IFNAME","IFLA_IF_NETNSID","IFLA_INFO_DATA","IFLA_INFO_KIND","IFLA_INFO_SLAVE_DATA","IFLA_INFO_SLAVE_KIND","IFLA_INFO_UNSPEC","IFLA_INFO_XSTATS","IFLA_LINK","IFLA_LINKINFO","IFLA_LINKMODE","IFLA_LINK_NETNSID","IFLA_MAP","IFLA_MASTER","IFLA_MAX_MTU","IFLA_MIN_MTU","IFLA_MTU","IFLA_NET_NS_FD","IFLA_NET_NS_PID","IFLA_NEW_IFINDEX","IFLA_NEW_NETNSID","IFLA_NUM_RX_QUEUES","IFLA_NUM_TX_QUEUES","IFLA_NUM_VF","IFLA_OPERSTATE","IFLA_PAD","IFLA_PARENT_DEV_BUS_NAME","IFLA_PARENT_DEV_NAME","IFLA_PERM_ADDRESS","IFLA_PHYS_PORT_ID","IFLA_PHYS_PORT_NAME","IFLA_PHYS_SWITCH_ID","IFLA_PORT_SELF","IFLA_PRIORITY","IFLA_PROMISCUITY","IFLA_PROP_LIST","IFLA_PROTINFO","IFLA_PROTO_DOWN","IFLA_PROTO_DOWN_REASON","IFLA_QDISC","IFLA_STATS","IFLA_STATS64","IFLA_TARGET_NETNSID","IFLA_TSO_MAX_SEGS","IFLA_TSO_MAX_SIZE","IFLA_TXQLEN","IFLA_UNSPEC","IFLA_VFINFO_LIST","IFLA_VF_PORTS","IFLA_WEIGHT","IFLA_WIRELESS","IFLA_XDP","IFNAMSIZ","IF_LINK_MODE_DEFAULT","IF_LINK_MODE_DORMANT","IF_LINK_MODE_TESTING","IF_NAMESIZE","IF_OPER_DORMANT","IF_OPER_DOWN","IF_OPER_LOWERLAYERDOWN","IF_OPER_NOTPRESENT","IF_OPER_TESTING","IF_OPER_UNKNOWN","IF_OPER_UP","IGNBRK","IGNCR","IGNPAR","IMAXBEL","INADDR_ANY","INADDR_BROADCAST","INADDR_LOOPBACK","INADDR_NONE","INIT_PROCESS","INLCR","INOTIFY_MAX_QUEUED_EVENTS","INOTIFY_MAX_USER_INSTANCES","INOTIFY_MAX_USER_WATCHES","INPCK","INPUT_PROP_CNT","INPUT_PROP_MAX","INT_MAX","INT_MIN","IN_ACCESS","IN_ALL_EVENTS","IN_ATTRIB","IN_CLOEXEC","IN_CLOSE","IN_CLOSE_NOWRITE","IN_CLOSE_WRITE","IN_CREATE","IN_DELETE","IN_DELETE_SELF","IN_DONT_FOLLOW","IN_EXCL_UNLINK","IN_IGNORED","IN_ISDIR","IN_MASK_ADD","IN_MASK_CREATE","IN_MODIFY","IN_MOVE","IN_MOVED_FROM","IN_MOVED_TO","IN_MOVE_SELF","IN_NONBLOCK","IN_ONESHOT","IN_ONLYDIR","IN_OPEN","IN_Q_OVERFLOW","IN_UNMOUNT","IP6T_SO_ORIGINAL_DST","IPC_CREAT","IPC_EXCL","IPC_INFO","IPC_NOWAIT","IPC_PRIVATE","IPC_RMID","IPC_SET","IPC_STAT","IPDEFTTL","IPOPT_CLASS","IPOPT_CLASS_MASK","IPOPT_CONTROL","IPOPT_COPIED","IPOPT_COPY","IPOPT_END","IPOPT_EOL","IPOPT_LSRR","IPOPT_MEASUREMENT","IPOPT_MINOFF","IPOPT_NOOP","IPOPT_NOP","IPOPT_NUMBER","IPOPT_NUMBER_MASK","IPOPT_OFFSET","IPOPT_OLEN","IPOPT_OPTVAL","IPOPT_RA","IPOPT_RESERVED1","IPOPT_RESERVED2","IPOPT_RR","IPOPT_SEC","IPOPT_SID","IPOPT_SSRR","IPOPT_TIMESTAMP","IPOPT_TS","IPOPT_TS_PRESPEC","IPOPT_TS_TSANDADDR","IPOPT_TS_TSONLY","IPPROTO_AH","IPPROTO_BEETPH","IPPROTO_COMP","IPPROTO_DCCP","IPPROTO_DSTOPTS","IPPROTO_EGP","IPPROTO_ENCAP","IPPROTO_ESP","IPPROTO_ETHERNET","IPPROTO_FRAGMENT","IPPROTO_GRE","IPPROTO_HOPOPTS","IPPROTO_ICMP","IPPROTO_ICMPV6","IPPROTO_IDP","IPPROTO_IGMP","IPPROTO_IP","IPPROTO_IPIP","IPPROTO_IPV6","IPPROTO_MAX","IPPROTO_MH","IPPROTO_MPLS","IPPROTO_MPTCP","IPPROTO_MTP","IPPROTO_NONE","IPPROTO_PIM","IPPROTO_PUP","IPPROTO_RAW","IPPROTO_ROUTING","IPPROTO_RSVP","IPPROTO_SCTP","IPPROTO_TCP","IPPROTO_TP","IPPROTO_UDP","IPPROTO_UDPLITE","IPTOS_ECN","IPTOS_ECN_CE","IPTOS_ECN_ECT0","IPTOS_ECN_ECT1","IPTOS_ECN_MASK","IPTOS_ECN_NOT_ECT","IPTOS_LOWDELAY","IPTOS_MINCOST","IPTOS_PREC","IPTOS_PREC_CRITIC_ECP","IPTOS_PREC_FLASH","IPTOS_PREC_FLASHOVERRIDE","IPTOS_PREC_IMMEDIATE","IPTOS_PREC_INTERNETCONTROL","IPTOS_PREC_MASK","IPTOS_PREC_NETCONTROL","IPTOS_PREC_PRIORITY","IPTOS_PREC_ROUTINE","IPTOS_RELIABILITY","IPTOS_THROUGHPUT","IPTOS_TOS","IPTOS_TOS_MASK","IPV6_2292DSTOPTS","IPV6_2292HOPLIMIT","IPV6_2292HOPOPTS","IPV6_2292PKTINFO","IPV6_2292PKTOPTIONS","IPV6_2292RTHDR","IPV6_ADDRFORM","IPV6_ADDR_PREFERENCES","IPV6_ADD_MEMBERSHIP","IPV6_AUTHHDR","IPV6_AUTOFLOWLABEL","IPV6_CHECKSUM","IPV6_DONTFRAG","IPV6_DROP_MEMBERSHIP","IPV6_DSTOPTS","IPV6_FLOWINFO","IPV6_FLOWINFO_FLOWLABEL","IPV6_FLOWINFO_PRIORITY","IPV6_FLOWINFO_SEND","IPV6_FLOWLABEL_MGR","IPV6_FREEBIND","IPV6_HDRINCL","IPV6_HOPLIMIT","IPV6_HOPOPTS","IPV6_IPSEC_POLICY","IPV6_JOIN_ANYCAST","IPV6_LEAVE_ANYCAST","IPV6_MINHOPCOUNT","IPV6_MTU","IPV6_MTU_DISCOVER","IPV6_MULTICAST_ALL","IPV6_MULTICAST_HOPS","IPV6_MULTICAST_IF","IPV6_MULTICAST_LOOP","IPV6_NEXTHOP","IPV6_ORIGDSTADDR","IPV6_PATHMTU","IPV6_PKTINFO","IPV6_PMTUDISC_DO","IPV6_PMTUDISC_DONT","IPV6_PMTUDISC_INTERFACE","IPV6_PMTUDISC_OMIT","IPV6_PMTUDISC_PROBE","IPV6_PMTUDISC_WANT","IPV6_PREFER_SRC_CGA","IPV6_PREFER_SRC_COA","IPV6_PREFER_SRC_HOME","IPV6_PREFER_SRC_NONCGA","IPV6_PREFER_SRC_PUBLIC","IPV6_PREFER_SRC_PUBTMP_DEFAULT","IPV6_PREFER_SRC_TMP","IPV6_RECVDSTOPTS","IPV6_RECVERR","IPV6_RECVFRAGSIZE","IPV6_RECVHOPLIMIT","IPV6_RECVHOPOPTS","IPV6_RECVORIGDSTADDR","IPV6_RECVPATHMTU","IPV6_RECVPKTINFO","IPV6_RECVRTHDR","IPV6_RECVTCLASS","IPV6_ROUTER_ALERT","IPV6_ROUTER_ALERT_ISOLATE","IPV6_RTHDR","IPV6_RTHDRDSTOPTS","IPV6_RTHDR_LOOSE","IPV6_RTHDR_STRICT","IPV6_TCLASS","IPV6_TRANSPARENT","IPV6_UNICAST_HOPS","IPV6_UNICAST_IF","IPV6_V6ONLY","IPV6_XFRM_POLICY","IPVERSION","IP_ADD_MEMBERSHIP","IP_ADD_SOURCE_MEMBERSHIP","IP_BIND_ADDRESS_NO_PORT","IP_BLOCK_SOURCE","IP_CHECKSUM","IP_DEFAULT_MULTICAST_LOOP","IP_DEFAULT_MULTICAST_TTL","IP_DROP_MEMBERSHIP","IP_DROP_SOURCE_MEMBERSHIP","IP_FREEBIND","IP_HDRINCL","IP_IPSEC_POLICY","IP_MINTTL","IP_MSFILTER","IP_MTU","IP_MTU_DISCOVER","IP_MULTICAST_ALL","IP_MULTICAST_IF","IP_MULTICAST_LOOP","IP_MULTICAST_TTL","IP_NODEFRAG","IP_OPTIONS","IP_ORIGDSTADDR","IP_PASSSEC","IP_PKTINFO","IP_PKTOPTIONS","IP_PMTUDISC_DO","IP_PMTUDISC_DONT","IP_PMTUDISC_INTERFACE","IP_PMTUDISC_OMIT","IP_PMTUDISC_PROBE","IP_PMTUDISC_WANT","IP_RECVERR","IP_RECVFRAGSIZE","IP_RECVOPTS","IP_RECVORIGDSTADDR","IP_RECVTOS","IP_RECVTTL","IP_RETOPTS","IP_ROUTER_ALERT","IP_TOS","IP_TRANSPARENT","IP_TTL","IP_UNBLOCK_SOURCE","IP_UNICAST_IF","IP_XFRM_POLICY","ISIG","ISOFS_SUPER_MAGIC","ISTRIP","ITIMER_PROF","ITIMER_REAL","ITIMER_VIRTUAL","IUTF8","IWEVASSOCREQIE","IWEVASSOCRESPIE","IWEVCUSTOM","IWEVEXPIRED","IWEVFIRST","IWEVGENIE","IWEVMICHAELMICFAILURE","IWEVPMKIDCAND","IWEVQUAL","IWEVREGISTERED","IWEVTXDROP","IW_AUTH_80211_AUTH_ALG","IW_AUTH_ALG_LEAP","IW_AUTH_ALG_OPEN_SYSTEM","IW_AUTH_ALG_SHARED_KEY","IW_AUTH_CIPHER_AES_CMAC","IW_AUTH_CIPHER_CCMP","IW_AUTH_CIPHER_GROUP","IW_AUTH_CIPHER_GROUP_MGMT","IW_AUTH_CIPHER_NONE","IW_AUTH_CIPHER_PAIRWISE","IW_AUTH_CIPHER_TKIP","IW_AUTH_CIPHER_WEP104","IW_AUTH_CIPHER_WEP40","IW_AUTH_DROP_UNENCRYPTED","IW_AUTH_FLAGS","IW_AUTH_INDEX","IW_AUTH_KEY_MGMT","IW_AUTH_KEY_MGMT_802_1X","IW_AUTH_KEY_MGMT_PSK","IW_AUTH_MFP","IW_AUTH_MFP_DISABLED","IW_AUTH_MFP_OPTIONAL","IW_AUTH_MFP_REQUIRED","IW_AUTH_PRIVACY_INVOKED","IW_AUTH_ROAMING_CONTROL","IW_AUTH_ROAMING_DISABLE","IW_AUTH_ROAMING_ENABLE","IW_AUTH_RX_UNENCRYPTED_EAPOL","IW_AUTH_TKIP_COUNTERMEASURES","IW_AUTH_WPA_ENABLED","IW_AUTH_WPA_VERSION","IW_AUTH_WPA_VERSION_DISABLED","IW_AUTH_WPA_VERSION_WPA","IW_AUTH_WPA_VERSION_WPA2","IW_CUSTOM_MAX","IW_ENCODE_ALG_AES_CMAC","IW_ENCODE_ALG_CCMP","IW_ENCODE_ALG_NONE","IW_ENCODE_ALG_PMK","IW_ENCODE_ALG_TKIP","IW_ENCODE_ALG_WEP","IW_ENCODE_DISABLED","IW_ENCODE_ENABLED","IW_ENCODE_EXT_GROUP_KEY","IW_ENCODE_EXT_RX_SEQ_VALID","IW_ENCODE_EXT_SET_TX_KEY","IW_ENCODE_EXT_TX_SEQ_VALID","IW_ENCODE_FLAGS","IW_ENCODE_INDEX","IW_ENCODE_MODE","IW_ENCODE_NOKEY","IW_ENCODE_OPEN","IW_ENCODE_RESTRICTED","IW_ENCODE_SEQ_MAX_SIZE","IW_ENCODE_TEMP","IW_ENCODING_TOKEN_MAX","IW_ENC_CAPA_4WAY_HANDSHAKE","IW_ENC_CAPA_CIPHER_CCMP","IW_ENC_CAPA_CIPHER_TKIP","IW_ENC_CAPA_WPA","IW_ENC_CAPA_WPA2","IW_ESSID_MAX_SIZE","IW_EV_CHAR_PK_LEN","IW_EV_LCP_PK_LEN","IW_EV_POINT_PK_LEN","IW_FREQ_AUTO","IW_FREQ_FIXED","IW_GENERIC_IE_MAX","IW_MAX_AP","IW_MAX_BITRATES","IW_MAX_ENCODING_SIZES","IW_MAX_FREQUENCIES","IW_MAX_SPY","IW_MAX_TXPOWER","IW_MICFAILURE_COUNT","IW_MICFAILURE_GROUP","IW_MICFAILURE_KEY_ID","IW_MICFAILURE_PAIRWISE","IW_MICFAILURE_STAKEY","IW_MLME_ASSOC","IW_MLME_AUTH","IW_MLME_DEAUTH","IW_MLME_DISASSOC","IW_MODE_ADHOC","IW_MODE_AUTO","IW_MODE_INFRA","IW_MODE_MASTER","IW_MODE_MESH","IW_MODE_MONITOR","IW_MODE_REPEAT","IW_MODE_SECOND","IW_PMKID_CAND_PREAUTH","IW_PMKID_LEN","IW_PMKSA_ADD","IW_PMKSA_FLUSH","IW_PMKSA_REMOVE","IW_POWER_ALL_R","IW_POWER_FORCE_S","IW_POWER_MAX","IW_POWER_MIN","IW_POWER_MODE","IW_POWER_MODIFIER","IW_POWER_MULTICAST_R","IW_POWER_ON","IW_POWER_PERIOD","IW_POWER_RELATIVE","IW_POWER_REPEATER","IW_POWER_TIMEOUT","IW_POWER_TYPE","IW_POWER_UNICAST_R","IW_PRIV_SIZE_FIXED","IW_PRIV_SIZE_MASK","IW_PRIV_TYPE_ADDR","IW_PRIV_TYPE_BYTE","IW_PRIV_TYPE_CHAR","IW_PRIV_TYPE_FLOAT","IW_PRIV_TYPE_INT","IW_PRIV_TYPE_MASK","IW_PRIV_TYPE_NONE","IW_QUAL_ALL_INVALID","IW_QUAL_ALL_UPDATED","IW_QUAL_DBM","IW_QUAL_LEVEL_INVALID","IW_QUAL_LEVEL_UPDATED","IW_QUAL_NOISE_INVALID","IW_QUAL_NOISE_UPDATED","IW_QUAL_QUAL_INVALID","IW_QUAL_QUAL_UPDATED","IW_QUAL_RCPI","IW_RETRY_LIFETIME","IW_RETRY_LIMIT","IW_RETRY_LONG","IW_RETRY_MAX","IW_RETRY_MIN","IW_RETRY_MODIFIER","IW_RETRY_ON","IW_RETRY_RELATIVE","IW_RETRY_SHORT","IW_RETRY_TYPE","IW_SCAN_ALL_ESSID","IW_SCAN_ALL_FREQ","IW_SCAN_ALL_MODE","IW_SCAN_ALL_RATE","IW_SCAN_CAPA_BSSID","IW_SCAN_CAPA_CHANNEL","IW_SCAN_CAPA_ESSID","IW_SCAN_CAPA_MODE","IW_SCAN_CAPA_NONE","IW_SCAN_CAPA_RATE","IW_SCAN_CAPA_TIME","IW_SCAN_CAPA_TYPE","IW_SCAN_DEFAULT","IW_SCAN_MAX_DATA","IW_SCAN_THIS_ESSID","IW_SCAN_THIS_FREQ","IW_SCAN_THIS_MODE","IW_SCAN_THIS_RATE","IW_SCAN_TYPE_ACTIVE","IW_SCAN_TYPE_PASSIVE","IW_TXPOW_DBM","IW_TXPOW_MWATT","IW_TXPOW_RANGE","IW_TXPOW_RELATIVE","IW_TXPOW_TYPE","IXANY","IXOFF","IXON","J1939_EE_INFO_NONE","J1939_EE_INFO_RX_ABORT","J1939_EE_INFO_RX_DPO","J1939_EE_INFO_RX_RTS","J1939_EE_INFO_TX_ABORT","J1939_FILTER_MAX","J1939_IDLE_ADDR","J1939_MAX_UNICAST_ADDR","J1939_NLA_BYTES_ACKED","J1939_NLA_DEST_ADDR","J1939_NLA_DEST_NAME","J1939_NLA_PAD","J1939_NLA_PGN","J1939_NLA_SRC_ADDR","J1939_NLA_SRC_NAME","J1939_NLA_TOTAL_SIZE","J1939_NO_ADDR","J1939_NO_NAME","J1939_NO_PGN","J1939_PGN_ADDRESS_CLAIMED","J1939_PGN_ADDRESS_COMMANDED","J1939_PGN_MAX","J1939_PGN_PDU1_MAX","J1939_PGN_REQUEST","JFFS2_SUPER_MAGIC","KERNEL_VERSION","KERN_ACCT","KERN_ACPI_VIDEO_FLAGS","KERN_BOOTLOADER_TYPE","KERN_CADPID","KERN_COMPAT_LOG","KERN_CORE_PATTERN","KERN_CORE_USES_PID","KERN_CTLALTDEL","KERN_DOMAINNAME","KERN_HOTPLUG","KERN_HPPA_PWRSW","KERN_HPPA_UNALIGNED","KERN_HZ_TIMER","KERN_IA64_UNALIGNED","KERN_IEEE_EMULATION_WARNINGS","KERN_MAX_LOCK_DEPTH","KERN_MAX_THREADS","KERN_MODPROBE","KERN_MSGMAX","KERN_MSGMNB","KERN_MSGMNI","KERN_MSGPOOL","KERN_NAMETRANS","KERN_NGROUPS_MAX","KERN_NMI_WATCHDOG","KERN_NODENAME","KERN_OSRELEASE","KERN_OSREV","KERN_OSTYPE","KERN_OVERFLOWGID","KERN_OVERFLOWUID","KERN_PANIC","KERN_PANIC_ON_NMI","KERN_PANIC_ON_OOPS","KERN_PIDMAX","KERN_PPC_HTABRECLAIM","KERN_PPC_L2CR","KERN_PPC_POWERSAVE_NAP","KERN_PPC_ZEROPAGED","KERN_PRINTK","KERN_PRINTK_RATELIMIT","KERN_PRINTK_RATELIMIT_BURST","KERN_PROF","KERN_PTY","KERN_RANDOM","KERN_RANDOMIZE","KERN_REALROOTDEV","KERN_RTSIGMAX","KERN_RTSIGNR","KERN_S390_USER_DEBUG_LOGGING","KERN_SECUREMASK","KERN_SEM","KERN_SETUID_DUMPABLE","KERN_SG_BIG_BUFF","KERN_SHMALL","KERN_SHMMAX","KERN_SHMMNI","KERN_SHMPATH","KERN_SPARC_REBOOT","KERN_SPARC_SCONS_PWROFF","KERN_SPARC_STOP_A","KERN_SPIN_RETRY","KERN_SYSRQ","KERN_TAINTED","KERN_UNKNOWN_NMI_PANIC","KERN_VERSION","KEXEC_ARCH_MASK","KEXEC_FILE_NO_INITRAMFS","KEXEC_FILE_ON_CRASH","KEXEC_FILE_UNLOAD","KEXEC_ON_CRASH","KEXEC_PRESERVE_CONTEXT","KEYCTL_ASSUME_AUTHORITY","KEYCTL_CAPABILITIES","KEYCTL_CAPS0_BIG_KEY","KEYCTL_CAPS0_CAPABILITIES","KEYCTL_CAPS0_DIFFIE_HELLMAN","KEYCTL_CAPS0_INVALIDATE","KEYCTL_CAPS0_MOVE","KEYCTL_CAPS0_PERSISTENT_KEYRINGS","KEYCTL_CAPS0_PUBLIC_KEY","KEYCTL_CAPS0_RESTRICT_KEYRING","KEYCTL_CAPS1_NS_KEYRING_NAME","KEYCTL_CAPS1_NS_KEY_TAG","KEYCTL_CHOWN","KEYCTL_CLEAR","KEYCTL_DESCRIBE","KEYCTL_DH_COMPUTE","KEYCTL_GET_KEYRING_ID","KEYCTL_GET_PERSISTENT","KEYCTL_GET_SECURITY","KEYCTL_INSTANTIATE","KEYCTL_INSTANTIATE_IOV","KEYCTL_INVALIDATE","KEYCTL_JOIN_SESSION_KEYRING","KEYCTL_LINK","KEYCTL_MOVE","KEYCTL_NEGATE","KEYCTL_PKEY_DECRYPT","KEYCTL_PKEY_ENCRYPT","KEYCTL_PKEY_QUERY","KEYCTL_PKEY_SIGN","KEYCTL_PKEY_VERIFY","KEYCTL_READ","KEYCTL_REJECT","KEYCTL_RESTRICT_KEYRING","KEYCTL_REVOKE","KEYCTL_SEARCH","KEYCTL_SESSION_TO_PARENT","KEYCTL_SETPERM","KEYCTL_SET_REQKEY_KEYRING","KEYCTL_SET_TIMEOUT","KEYCTL_SUPPORTS_DECRYPT","KEYCTL_SUPPORTS_ENCRYPT","KEYCTL_SUPPORTS_SIGN","KEYCTL_SUPPORTS_VERIFY","KEYCTL_UNLINK","KEYCTL_UPDATE","KEY_CNT","KEY_MAX","KEY_REQKEY_DEFL_DEFAULT","KEY_REQKEY_DEFL_GROUP_KEYRING","KEY_REQKEY_DEFL_NO_CHANGE","KEY_REQKEY_DEFL_PROCESS_KEYRING","KEY_REQKEY_DEFL_REQUESTOR_KEYRING","KEY_REQKEY_DEFL_SESSION_KEYRING","KEY_REQKEY_DEFL_THREAD_KEYRING","KEY_REQKEY_DEFL_USER_KEYRING","KEY_REQKEY_DEFL_USER_SESSION_KEYRING","KEY_SPEC_GROUP_KEYRING","KEY_SPEC_PROCESS_KEYRING","KEY_SPEC_REQKEY_AUTH_KEY","KEY_SPEC_REQUESTOR_KEYRING","KEY_SPEC_SESSION_KEYRING","KEY_SPEC_THREAD_KEYRING","KEY_SPEC_USER_KEYRING","KEY_SPEC_USER_SESSION_KEYRING","LC_ADDRESS","LC_ADDRESS_MASK","LC_ALL","LC_ALL_MASK","LC_COLLATE","LC_COLLATE_MASK","LC_CTYPE","LC_CTYPE_MASK","LC_IDENTIFICATION","LC_IDENTIFICATION_MASK","LC_MEASUREMENT","LC_MEASUREMENT_MASK","LC_MESSAGES","LC_MESSAGES_MASK","LC_MONETARY","LC_MONETARY_MASK","LC_NAME","LC_NAME_MASK","LC_NUMERIC","LC_NUMERIC_MASK","LC_PAPER","LC_PAPER_MASK","LC_TELEPHONE","LC_TELEPHONE_MASK","LC_TIME","LC_TIME_MASK","LED_CNT","LED_MAX","LINUX_REBOOT_CMD_CAD_OFF","LINUX_REBOOT_CMD_CAD_ON","LINUX_REBOOT_CMD_HALT","LINUX_REBOOT_CMD_KEXEC","LINUX_REBOOT_CMD_POWER_OFF","LINUX_REBOOT_CMD_RESTART","LINUX_REBOOT_CMD_RESTART2","LINUX_REBOOT_CMD_SW_SUSPEND","LINUX_REBOOT_MAGIC1","LINUX_REBOOT_MAGIC2","LINUX_REBOOT_MAGIC2A","LINUX_REBOOT_MAGIC2B","LINUX_REBOOT_MAGIC2C","LIO_NOP","LIO_NOWAIT","LIO_READ","LIO_WAIT","LIO_WRITE","LM_ID_BASE","LM_ID_NEWLM","LOCK_EX","LOCK_NB","LOCK_SH","LOCK_UN","LOGIN_PROCESS","LOG_ALERT","LOG_AUTH","LOG_AUTHPRIV","LOG_CONS","LOG_CRIT","LOG_CRON","LOG_DAEMON","LOG_DEBUG","LOG_EMERG","LOG_ERR","LOG_FACMASK","LOG_FTP","LOG_INFO","LOG_KERN","LOG_LOCAL0","LOG_LOCAL1","LOG_LOCAL2","LOG_LOCAL3","LOG_LOCAL4","LOG_LOCAL5","LOG_LOCAL6","LOG_LOCAL7","LOG_LPR","LOG_MAIL","LOG_NDELAY","LOG_NEWS","LOG_NFACILITIES","LOG_NOTICE","LOG_NOWAIT","LOG_ODELAY","LOG_PERROR","LOG_PID","LOG_PRIMASK","LOG_SYSLOG","LOG_USER","LOG_UUCP","LOG_WARNING","L_tmpnam","Lmid_t","MADV_COLD","MADV_COLLAPSE","MADV_DODUMP","MADV_DOFORK","MADV_DONTDUMP","MADV_DONTFORK","MADV_DONTNEED","MADV_DONTNEED_LOCKED","MADV_FREE","MADV_HUGEPAGE","MADV_HWPOISON","MADV_KEEPONFORK","MADV_MERGEABLE","MADV_NOHUGEPAGE","MADV_NORMAL","MADV_PAGEOUT","MADV_POPULATE_READ","MADV_POPULATE_WRITE","MADV_RANDOM","MADV_REMOVE","MADV_SEQUENTIAL","MADV_SOFT_OFFLINE","MADV_UNMERGEABLE","MADV_WILLNEED","MADV_WIPEONFORK","MAP_32BIT","MAP_ANON","MAP_ANONYMOUS","MAP_DENYWRITE","MAP_EXECUTABLE","MAP_FAILED","MAP_FILE","MAP_FIXED","MAP_FIXED_NOREPLACE","MAP_GROWSDOWN","MAP_HUGETLB","MAP_HUGE_16GB","MAP_HUGE_16MB","MAP_HUGE_1GB","MAP_HUGE_1MB","MAP_HUGE_256MB","MAP_HUGE_2GB","MAP_HUGE_2MB","MAP_HUGE_32MB","MAP_HUGE_512KB","MAP_HUGE_512MB","MAP_HUGE_64KB","MAP_HUGE_8MB","MAP_HUGE_MASK","MAP_HUGE_SHIFT","MAP_LOCKED","MAP_NONBLOCK","MAP_NORESERVE","MAP_POPULATE","MAP_PRIVATE","MAP_SHARED","MAP_SHARED_VALIDATE","MAP_STACK","MAP_SYNC","MAP_TYPE","MAXTC","MAXTTL","MAX_ADDR_LEN","MAX_IPOPTLEN","MAX_LINKS","MCAST_BLOCK_SOURCE","MCAST_EXCLUDE","MCAST_INCLUDE","MCAST_JOIN_GROUP","MCAST_JOIN_SOURCE_GROUP","MCAST_LEAVE_GROUP","MCAST_LEAVE_SOURCE_GROUP","MCAST_MSFILTER","MCAST_UNBLOCK_SOURCE","MCL_CURRENT","MCL_FUTURE","MCL_ONFAULT","MEMBARRIER_CMD_GLOBAL","MEMBARRIER_CMD_GLOBAL_EXPEDITED","MEMBARRIER_CMD_PRIVATE_EXPEDITED","MEMBARRIER_CMD_PRIVATE_EXPEDITED_RSEQ","MEMBARRIER_CMD_PRIVATE_EXPEDITED_SYNC_CORE","MEMBARRIER_CMD_QUERY","MEMBARRIER_CMD_REGISTER_GLOBAL_EXPEDITED","MEMBARRIER_CMD_REGISTER_PRIVATE_EXPEDITED","MEMBARRIER_CMD_REGISTER_PRIVATE_EXPEDITED_RSEQ","MEMBARRIER_CMD_REGISTER_PRIVATE_EXPEDITED_SYNC_CORE","MFD_ALLOW_SEALING","MFD_CLOEXEC","MFD_EXEC","MFD_HUGETLB","MFD_HUGE_16GB","MFD_HUGE_16MB","MFD_HUGE_1GB","MFD_HUGE_1MB","MFD_HUGE_256MB","MFD_HUGE_2GB","MFD_HUGE_2MB","MFD_HUGE_32MB","MFD_HUGE_512KB","MFD_HUGE_512MB","MFD_HUGE_64KB","MFD_HUGE_8MB","MFD_HUGE_MASK","MFD_HUGE_SHIFT","MFD_NOEXEC_SEAL","MINIX2_SUPER_MAGIC","MINIX2_SUPER_MAGIC2","MINIX3_SUPER_MAGIC","MINIX_SUPER_MAGIC","MINIX_SUPER_MAGIC2","MINSIGSTKSZ","MLOCK_ONFAULT","MMAP_PAGE_ZERO","MNT_DETACH","MNT_EXPIRE","MNT_FORCE","MODULE_INIT_IGNORE_MODVERSIONS","MODULE_INIT_IGNORE_VERMAGIC","MOD_CLKA","MOD_CLKB","MOD_ESTERROR","MOD_FREQUENCY","MOD_MAXERROR","MOD_MICRO","MOD_NANO","MOD_OFFSET","MOD_STATUS","MOD_TAI","MOD_TIMECONST","MON_1","MON_10","MON_11","MON_12","MON_2","MON_3","MON_4","MON_5","MON_6","MON_7","MON_8","MON_9","MOVE_MOUNT_BENEATH","MOVE_MOUNT_F_AUTOMOUNTS","MOVE_MOUNT_F_EMPTY_PATH","MOVE_MOUNT_F_SYMLINKS","MOVE_MOUNT_SET_GROUP","MOVE_MOUNT_T_AUTOMOUNTS","MOVE_MOUNT_T_EMPTY_PATH","MOVE_MOUNT_T_SYMLINKS","MPOL_BIND","MPOL_DEFAULT","MPOL_F_NUMA_BALANCING","MPOL_F_RELATIVE_NODES","MPOL_F_STATIC_NODES","MPOL_INTERLEAVE","MPOL_LOCAL","MPOL_PREFERRED","MREMAP_DONTUNMAP","MREMAP_FIXED","MREMAP_MAYMOVE","MSC_CNT","MSC_MAX","MSDOS_SUPER_MAGIC","MSG_CMSG_CLOEXEC","MSG_CONFIRM","MSG_COPY","MSG_CTRUNC","MSG_DONTROUTE","MSG_DONTWAIT","MSG_EOR","MSG_ERRQUEUE","MSG_EXCEPT","MSG_FASTOPEN","MSG_FIN","MSG_INFO","MSG_MORE","MSG_NOERROR","MSG_NOSIGNAL","MSG_NOTIFICATION","MSG_OOB","MSG_PEEK","MSG_RST","MSG_STAT","MSG_SYN","MSG_TRUNC","MSG_TRYHARD","MSG_WAITALL","MSG_WAITFORONE","MSG_ZEROCOPY","MS_ACTIVE","MS_ASYNC","MS_BIND","MS_DIRSYNC","MS_INVALIDATE","MS_I_VERSION","MS_KERNMOUNT","MS_LAZYTIME","MS_MANDLOCK","MS_MGC_MSK","MS_MGC_VAL","MS_MOVE","MS_NOATIME","MS_NODEV","MS_NODIRATIME","MS_NOEXEC","MS_NOSUID","MS_NOUSER","MS_POSIXACL","MS_PRIVATE","MS_RDONLY","MS_REC","MS_RELATIME","MS_REMOUNT","MS_RMT_MASK","MS_SHARED","MS_SILENT","MS_SLAVE","MS_STRICTATIME","MS_SYNC","MS_SYNCHRONOUS","MS_UNBINDABLE","M_ARENA_MAX","M_ARENA_TEST","M_CHECK_ACTION","M_GRAIN","M_KEEP","M_MMAP_MAX","M_MMAP_THRESHOLD","M_MXFAST","M_NLBLKS","M_PERTURB","M_TOP_PAD","M_TRIM_THRESHOLD","NCCS","NCP_SUPER_MAGIC","NDA_CACHEINFO","NDA_DST","NDA_IFINDEX","NDA_LINK_NETNSID","NDA_LLADDR","NDA_MASTER","NDA_PORT","NDA_PROBES","NDA_SRC_VNI","NDA_UNSPEC","NDA_VLAN","NDA_VNI","NETLINK_ADD_MEMBERSHIP","NETLINK_AUDIT","NETLINK_BROADCAST_ERROR","NETLINK_CAP_ACK","NETLINK_CONNECTOR","NETLINK_CRYPTO","NETLINK_DNRTMSG","NETLINK_DROP_MEMBERSHIP","NETLINK_ECRYPTFS","NETLINK_EXT_ACK","NETLINK_FIB_LOOKUP","NETLINK_FIREWALL","NETLINK_GENERIC","NETLINK_GET_STRICT_CHK","NETLINK_INET_DIAG","NETLINK_IP6_FW","NETLINK_ISCSI","NETLINK_KOBJECT_UEVENT","NETLINK_LISTEN_ALL_NSID","NETLINK_LIST_MEMBERSHIPS","NETLINK_NETFILTER","NETLINK_NFLOG","NETLINK_NO_ENOBUFS","NETLINK_PKTINFO","NETLINK_RDMA","NETLINK_ROUTE","NETLINK_RX_RING","NETLINK_SCSITRANSPORT","NETLINK_SELINUX","NETLINK_SOCK_DIAG","NETLINK_TX_RING","NETLINK_UNUSED","NETLINK_USERSOCK","NETLINK_XFRM","NET_802","NET_ATALK","NET_AX25","NET_BRIDGE","NET_CORE","NET_DCCP","NET_DECNET","NET_ECONET","NET_ETHER","NET_IPV4","NET_IPV6","NET_IPX","NET_IRDA","NET_LLC","NET_NETFILTER","NET_NETROM","NET_ROSE","NET_SCTP","NET_TR","NET_UNIX","NET_X25","NEW_TIME","NFNETLINK_V0","NFNLGRP_ACCT_QUOTA","NFNLGRP_CONNTRACK_DESTROY","NFNLGRP_CONNTRACK_EXP_DESTROY","NFNLGRP_CONNTRACK_EXP_NEW","NFNLGRP_CONNTRACK_EXP_UPDATE","NFNLGRP_CONNTRACK_NEW","NFNLGRP_CONNTRACK_UPDATE","NFNLGRP_NFTABLES","NFNLGRP_NFTRACE","NFNLGRP_NONE","NFNL_BATCH_GENID","NFNL_BATCH_UNSPEC","NFNL_MSG_BATCH_BEGIN","NFNL_MSG_BATCH_END","NFNL_SUBSYS_ACCT","NFNL_SUBSYS_COUNT","NFNL_SUBSYS_CTHELPER","NFNL_SUBSYS_CTNETLINK","NFNL_SUBSYS_CTNETLINK_EXP","NFNL_SUBSYS_CTNETLINK_TIMEOUT","NFNL_SUBSYS_HOOK","NFNL_SUBSYS_IPSET","NFNL_SUBSYS_NFTABLES","NFNL_SUBSYS_NFT_COMPAT","NFNL_SUBSYS_NONE","NFNL_SUBSYS_OSF","NFNL_SUBSYS_QUEUE","NFNL_SUBSYS_ULOG","NFPROTO_ARP","NFPROTO_BRIDGE","NFPROTO_DECNET","NFPROTO_INET","NFPROTO_IPV4","NFPROTO_IPV6","NFPROTO_NETDEV","NFPROTO_NUMPROTO","NFPROTO_UNSPEC","NFQA_CAP_LEN","NFQA_CFG_CMD","NFQA_CFG_FLAGS","NFQA_CFG_F_CONNTRACK","NFQA_CFG_F_FAIL_OPEN","NFQA_CFG_F_GSO","NFQA_CFG_F_MAX","NFQA_CFG_F_SECCTX","NFQA_CFG_F_UID_GID","NFQA_CFG_MASK","NFQA_CFG_PARAMS","NFQA_CFG_QUEUE_MAXLEN","NFQA_CFG_UNSPEC","NFQA_CT","NFQA_CT_INFO","NFQA_EXP","NFQA_GID","NFQA_HWADDR","NFQA_IFINDEX_INDEV","NFQA_IFINDEX_OUTDEV","NFQA_IFINDEX_PHYSINDEV","NFQA_IFINDEX_PHYSOUTDEV","NFQA_L2HDR","NFQA_MARK","NFQA_PACKET_HDR","NFQA_PAYLOAD","NFQA_PRIORITY","NFQA_SECCTX","NFQA_SKB_CSUMNOTREADY","NFQA_SKB_CSUM_NOTVERIFIED","NFQA_SKB_GSO","NFQA_SKB_INFO","NFQA_TIMESTAMP","NFQA_UID","NFQA_UNSPEC","NFQA_VERDICT_HDR","NFQA_VLAN","NFQA_VLAN_PROTO","NFQA_VLAN_TCI","NFQA_VLAN_UNSPEC","NFQNL_CFG_CMD_BIND","NFQNL_CFG_CMD_NONE","NFQNL_CFG_CMD_PF_BIND","NFQNL_CFG_CMD_PF_UNBIND","NFQNL_CFG_CMD_UNBIND","NFQNL_COPY_META","NFQNL_COPY_NONE","NFQNL_COPY_PACKET","NFQNL_MSG_CONFIG","NFQNL_MSG_PACKET","NFQNL_MSG_VERDICT","NFQNL_MSG_VERDICT_BATCH","NFS_SUPER_MAGIC","NFT_BREAK","NFT_BYTEORDER_HTON","NFT_BYTEORDER_NTOH","NFT_CHAIN_MAXNAMELEN","NFT_CMP_EQ","NFT_CMP_GT","NFT_CMP_GTE","NFT_CMP_LT","NFT_CMP_LTE","NFT_CMP_NEQ","NFT_CONTINUE","NFT_CT_BYTES","NFT_CT_DIRECTION","NFT_CT_DST","NFT_CT_EXPIRATION","NFT_CT_HELPER","NFT_CT_L3PROTOCOL","NFT_CT_LABELS","NFT_CT_MARK","NFT_CT_PKTS","NFT_CT_PROTOCOL","NFT_CT_PROTO_DST","NFT_CT_PROTO_SRC","NFT_CT_SECMARK","NFT_CT_SRC","NFT_CT_STATE","NFT_CT_STATUS","NFT_DATA_RESERVED_MASK","NFT_DATA_VALUE","NFT_DATA_VALUE_MAXLEN","NFT_DATA_VERDICT","NFT_DYNSET_F_INV","NFT_DYNSET_OP_ADD","NFT_DYNSET_OP_UPDATE","NFT_GOTO","NFT_JUMP","NFT_LIMIT_F_INV","NFT_LIMIT_PKTS","NFT_LIMIT_PKT_BYTES","NFT_LOOKUP_F_INV","NFT_META_BRI_IIFNAME","NFT_META_BRI_OIFNAME","NFT_META_CGROUP","NFT_META_CPU","NFT_META_IIF","NFT_META_IIFGROUP","NFT_META_IIFNAME","NFT_META_IIFTYPE","NFT_META_L4PROTO","NFT_META_LEN","NFT_META_MARK","NFT_META_NFPROTO","NFT_META_NFTRACE","NFT_META_OIF","NFT_META_OIFGROUP","NFT_META_OIFNAME","NFT_META_OIFTYPE","NFT_META_PKTTYPE","NFT_META_PRANDOM","NFT_META_PRIORITY","NFT_META_PROTOCOL","NFT_META_RTCLASSID","NFT_META_SECMARK","NFT_META_SKGID","NFT_META_SKUID","NFT_MSG_DELCHAIN","NFT_MSG_DELOBJ","NFT_MSG_DELRULE","NFT_MSG_DELSET","NFT_MSG_DELSETELEM","NFT_MSG_DELTABLE","NFT_MSG_GETCHAIN","NFT_MSG_GETGEN","NFT_MSG_GETOBJ","NFT_MSG_GETOBJ_RESET","NFT_MSG_GETRULE","NFT_MSG_GETSET","NFT_MSG_GETSETELEM","NFT_MSG_GETTABLE","NFT_MSG_MAX","NFT_MSG_NEWCHAIN","NFT_MSG_NEWGEN","NFT_MSG_NEWOBJ","NFT_MSG_NEWRULE","NFT_MSG_NEWSET","NFT_MSG_NEWSETELEM","NFT_MSG_NEWTABLE","NFT_MSG_TRACE","NFT_NAT_DNAT","NFT_NAT_SNAT","NFT_NG_INCREMENTAL","NFT_NG_RANDOM","NFT_OBJ_MAXNAMELEN","NFT_PAYLOAD_CSUM_INET","NFT_PAYLOAD_CSUM_NONE","NFT_PAYLOAD_LL_HEADER","NFT_PAYLOAD_NETWORK_HEADER","NFT_PAYLOAD_TRANSPORT_HEADER","NFT_QUEUE_FLAG_BYPASS","NFT_QUEUE_FLAG_CPU_FANOUT","NFT_QUEUE_FLAG_MASK","NFT_QUOTA_F_INV","NFT_RANGE_EQ","NFT_RANGE_NEQ","NFT_REG32_00","NFT_REG32_01","NFT_REG32_02","NFT_REG32_03","NFT_REG32_04","NFT_REG32_05","NFT_REG32_06","NFT_REG32_07","NFT_REG32_08","NFT_REG32_09","NFT_REG32_10","NFT_REG32_11","NFT_REG32_12","NFT_REG32_13","NFT_REG32_14","NFT_REG32_15","NFT_REG32_SIZE","NFT_REG_1","NFT_REG_2","NFT_REG_3","NFT_REG_4","NFT_REG_SIZE","NFT_REG_VERDICT","NFT_REJECT_ICMPX_ADMIN_PROHIBITED","NFT_REJECT_ICMPX_HOST_UNREACH","NFT_REJECT_ICMPX_NO_ROUTE","NFT_REJECT_ICMPX_PORT_UNREACH","NFT_REJECT_ICMPX_UNREACH","NFT_REJECT_ICMP_UNREACH","NFT_REJECT_TCP_RST","NFT_RETURN","NFT_SET_ANONYMOUS","NFT_SET_CONSTANT","NFT_SET_ELEM_INTERVAL_END","NFT_SET_EVAL","NFT_SET_INTERVAL","NFT_SET_MAP","NFT_SET_MAXNAMELEN","NFT_SET_POL_MEMORY","NFT_SET_POL_PERFORMANCE","NFT_SET_TIMEOUT","NFT_TABLE_MAXNAMELEN","NFT_TRACETYPE_POLICY","NFT_TRACETYPE_RETURN","NFT_TRACETYPE_RULE","NFT_TRACETYPE_UNSPEC","NFT_USERDATA_MAXLEN","NFULA_CFG_CMD","NFULA_CFG_FLAGS","NFULA_CFG_MODE","NFULA_CFG_NLBUFSIZ","NFULA_CFG_QTHRESH","NFULA_CFG_TIMEOUT","NFULA_CFG_UNSPEC","NFULA_CT","NFULA_CT_INFO","NFULA_GID","NFULA_HWADDR","NFULA_HWHEADER","NFULA_HWLEN","NFULA_HWTYPE","NFULA_IFINDEX_INDEV","NFULA_IFINDEX_OUTDEV","NFULA_IFINDEX_PHYSINDEV","NFULA_IFINDEX_PHYSOUTDEV","NFULA_L2HDR","NFULA_MARK","NFULA_PACKET_HDR","NFULA_PAYLOAD","NFULA_PREFIX","NFULA_SEQ","NFULA_SEQ_GLOBAL","NFULA_TIMESTAMP","NFULA_UID","NFULA_UNSPEC","NFULA_VLAN","NFULA_VLAN_PROTO","NFULA_VLAN_TCI","NFULA_VLAN_UNSPEC","NFULNL_CFG_CMD_BIND","NFULNL_CFG_CMD_NONE","NFULNL_CFG_CMD_PF_BIND","NFULNL_CFG_CMD_PF_UNBIND","NFULNL_CFG_CMD_UNBIND","NFULNL_CFG_F_CONNTRACK","NFULNL_CFG_F_SEQ","NFULNL_CFG_F_SEQ_GLOBAL","NFULNL_COPY_META","NFULNL_COPY_NONE","NFULNL_COPY_PACKET","NFULNL_MSG_CONFIG","NFULNL_MSG_PACKET","NF_ACCEPT","NF_DROP","NF_INET_FORWARD","NF_INET_LOCAL_IN","NF_INET_LOCAL_OUT","NF_INET_NUMHOOKS","NF_INET_POST_ROUTING","NF_INET_PRE_ROUTING","NF_IP6_FORWARD","NF_IP6_LOCAL_IN","NF_IP6_LOCAL_OUT","NF_IP6_NUMHOOKS","NF_IP6_POST_ROUTING","NF_IP6_PRE_ROUTING","NF_IP6_PRI_CONNTRACK","NF_IP6_PRI_CONNTRACK_DEFRAG","NF_IP6_PRI_CONNTRACK_HELPER","NF_IP6_PRI_FILTER","NF_IP6_PRI_FIRST","NF_IP6_PRI_LAST","NF_IP6_PRI_MANGLE","NF_IP6_PRI_NAT_DST","NF_IP6_PRI_NAT_SRC","NF_IP6_PRI_RAW","NF_IP6_PRI_SECURITY","NF_IP6_PRI_SELINUX_FIRST","NF_IP6_PRI_SELINUX_LAST","NF_IP_FORWARD","NF_IP_LOCAL_IN","NF_IP_LOCAL_OUT","NF_IP_NUMHOOKS","NF_IP_POST_ROUTING","NF_IP_PRE_ROUTING","NF_IP_PRI_CONNTRACK","NF_IP_PRI_CONNTRACK_CONFIRM","NF_IP_PRI_CONNTRACK_DEFRAG","NF_IP_PRI_CONNTRACK_HELPER","NF_IP_PRI_FILTER","NF_IP_PRI_FIRST","NF_IP_PRI_LAST","NF_IP_PRI_MANGLE","NF_IP_PRI_NAT_DST","NF_IP_PRI_NAT_SRC","NF_IP_PRI_RAW","NF_IP_PRI_SECURITY","NF_IP_PRI_SELINUX_FIRST","NF_IP_PRI_SELINUX_LAST","NF_MAX_VERDICT","NF_NETDEV_INGRESS","NF_NETDEV_NUMHOOKS","NF_QUEUE","NF_REPEAT","NF_STOLEN","NF_STOP","NF_VERDICT_BITS","NF_VERDICT_FLAG_QUEUE_BYPASS","NF_VERDICT_MASK","NF_VERDICT_QBITS","NF_VERDICT_QMASK","NILFS_SUPER_MAGIC","NI_DGRAM","NI_IDN","NI_MAXHOST","NI_NAMEREQD","NI_NOFQDN","NI_NUMERICHOST","NI_NUMERICSERV","NL0","NL1","NLA_ALIGN","NLA_ALIGNTO","NLA_F_NESTED","NLA_F_NET_BYTEORDER","NLA_TYPE_MASK","NLDLY","NLMSG_DONE","NLMSG_ERROR","NLMSG_MIN_TYPE","NLMSG_NOOP","NLMSG_OVERRUN","NLM_F_ACK","NLM_F_APPEND","NLM_F_ATOMIC","NLM_F_CREATE","NLM_F_DUMP","NLM_F_DUMP_FILTERED","NLM_F_DUMP_INTR","NLM_F_ECHO","NLM_F_EXCL","NLM_F_MATCH","NLM_F_MULTI","NLM_F_REPLACE","NLM_F_REQUEST","NLM_F_ROOT","NOEXPR","NOFLSH","NOSTR","NSFS_MAGIC","NTF_EXT_LEARNED","NTF_MASTER","NTF_OFFLOADED","NTF_PROXY","NTF_ROUTER","NTF_SELF","NTF_USE","NTP_API","NT_ASRS","NT_AUXV","NT_FPREGSET","NT_GWINDOWS","NT_LWPSINFO","NT_LWPSTATUS","NT_PLATFORM","NT_PRCRED","NT_PRFPREG","NT_PRFPXREG","NT_PRPSINFO","NT_PRSTATUS","NT_PRXREG","NT_PSINFO","NT_PSTATUS","NT_TASKSTRUCT","NT_UTSNAME","NUD_DELAY","NUD_FAILED","NUD_INCOMPLETE","NUD_NOARP","NUD_NONE","NUD_PERMANENT","NUD_PROBE","NUD_REACHABLE","NUD_STALE","OCFS2_SUPER_MAGIC","OCRNL","OFDEL","OFILL","OLCUC","OLD_TIME","ONLCR","ONLRET","ONOCR","OPENPROM_SUPER_MAGIC","OPEN_TREE_CLOEXEC","OPEN_TREE_CLONE","OPOST","ORIG_RAX","OVERLAYFS_SUPER_MAGIC","O_ACCMODE","O_APPEND","O_ASYNC","O_CLOEXEC","O_CREAT","O_DIRECT","O_DIRECTORY","O_DSYNC","O_EXCL","O_FSYNC","O_LARGEFILE","O_NDELAY","O_NOATIME","O_NOCTTY","O_NOFOLLOW","O_NONBLOCK","O_PATH","O_RDONLY","O_RDWR","O_RSYNC","O_SYNC","O_TMPFILE","O_TRUNC","O_WRONLY","PACKET_ADD_MEMBERSHIP","PACKET_DROP_MEMBERSHIP","PACKET_MR_ALLMULTI","PACKET_MR_MULTICAST","PACKET_MR_PROMISC","PACKET_MR_UNICAST","PARENB","PARMRK","PARODD","PATH_MAX","PENDIN","PF_ALG","PF_APPLETALK","PF_ASH","PF_ATMPVC","PF_ATMSVC","PF_AX25","PF_BLUETOOTH","PF_BRIDGE","PF_CAIF","PF_CAN","PF_DECnet","PF_DUMPCORE","PF_ECONET","PF_EXITING","PF_FORKNOEXEC","PF_IB","PF_IDLE","PF_IEEE802154","PF_INET","PF_INET6","PF_IO_WORKER","PF_IPX","PF_IRDA","PF_ISDN","PF_IUCV","PF_KEY","PF_KSWAPD","PF_KTHREAD","PF_LLC","PF_LOCAL","PF_LOCAL_THROTTLE","PF_MASKOS","PF_MASKPROC","PF_MCE_EARLY","PF_MCE_PROCESS","PF_MEMALLOC","PF_MEMALLOC_NOFS","PF_MEMALLOC_NOIO","PF_MEMALLOC_PIN","PF_MPLS","PF_NETBEUI","PF_NETLINK","PF_NETROM","PF_NFC","PF_NOFREEZE","PF_NO_SETAFFINITY","PF_NPROC_EXCEEDED","PF_PACKET","PF_PHONET","PF_POSTCOREDUMP","PF_PPPOX","PF_R","PF_RANDOMIZE","PF_RDS","PF_ROSE","PF_ROUTE","PF_RXRPC","PF_SECURITY","PF_SIGNALED","PF_SNA","PF_SUPERPRIV","PF_TIPC","PF_UNIX","PF_UNSPEC","PF_USED_MATH","PF_USER_WORKER","PF_VCPU","PF_VSOCK","PF_W","PF_WANPIPE","PF_WQ_WORKER","PF_X","PF_X25","PF_XDP","PIDFD_NONBLOCK","PIPE_BUF","PM_STR","POLLERR","POLLHUP","POLLIN","POLLNVAL","POLLOUT","POLLPRI","POLLRDBAND","POLLRDHUP","POLLRDNORM","POLLWRBAND","POLLWRNORM","POSIX_FADV_DONTNEED","POSIX_FADV_NOREUSE","POSIX_FADV_NORMAL","POSIX_FADV_RANDOM","POSIX_FADV_SEQUENTIAL","POSIX_FADV_WILLNEED","POSIX_MADV_DONTNEED","POSIX_MADV_NORMAL","POSIX_MADV_RANDOM","POSIX_MADV_SEQUENTIAL","POSIX_MADV_WILLNEED","POSIX_SPAWN_RESETIDS","POSIX_SPAWN_SETPGROUP","POSIX_SPAWN_SETSCHEDPARAM","POSIX_SPAWN_SETSCHEDULER","POSIX_SPAWN_SETSID","POSIX_SPAWN_SETSIGDEF","POSIX_SPAWN_SETSIGMASK","POSIX_SPAWN_USEVFORK","PRIO_MAX","PRIO_MIN","PRIO_PGRP","PRIO_PROCESS","PRIO_USER","PROC_SUPER_MAGIC","PROT_EXEC","PROT_GROWSDOWN","PROT_GROWSUP","PROT_NONE","PROT_READ","PROT_WRITE","PR_CAPBSET_DROP","PR_CAPBSET_READ","PR_CAP_AMBIENT","PR_CAP_AMBIENT_CLEAR_ALL","PR_CAP_AMBIENT_IS_SET","PR_CAP_AMBIENT_LOWER","PR_CAP_AMBIENT_RAISE","PR_ENDIAN_BIG","PR_ENDIAN_LITTLE","PR_ENDIAN_PPC_LITTLE","PR_FPEMU_NOPRINT","PR_FPEMU_SIGFPE","PR_FP_EXC_ASYNC","PR_FP_EXC_DISABLED","PR_FP_EXC_DIV","PR_FP_EXC_INV","PR_FP_EXC_NONRECOV","PR_FP_EXC_OVF","PR_FP_EXC_PRECISE","PR_FP_EXC_RES","PR_FP_EXC_SW_ENABLE","PR_FP_EXC_UND","PR_FP_MODE_FR","PR_FP_MODE_FRE","PR_GET_CHILD_SUBREAPER","PR_GET_DUMPABLE","PR_GET_ENDIAN","PR_GET_FPEMU","PR_GET_FPEXC","PR_GET_FP_MODE","PR_GET_KEEPCAPS","PR_GET_NAME","PR_GET_NO_NEW_PRIVS","PR_GET_PDEATHSIG","PR_GET_SECCOMP","PR_GET_SECUREBITS","PR_GET_SPECULATION_CTRL","PR_GET_THP_DISABLE","PR_GET_TID_ADDRESS","PR_GET_TIMERSLACK","PR_GET_TIMING","PR_GET_TSC","PR_GET_UNALIGN","PR_MCE_KILL","PR_MCE_KILL_CLEAR","PR_MCE_KILL_DEFAULT","PR_MCE_KILL_EARLY","PR_MCE_KILL_GET","PR_MCE_KILL_LATE","PR_MCE_KILL_SET","PR_MPX_DISABLE_MANAGEMENT","PR_MPX_ENABLE_MANAGEMENT","PR_SCHED_CORE","PR_SCHED_CORE_CREATE","PR_SCHED_CORE_GET","PR_SCHED_CORE_MAX","PR_SCHED_CORE_SCOPE_PROCESS_GROUP","PR_SCHED_CORE_SCOPE_THREAD","PR_SCHED_CORE_SCOPE_THREAD_GROUP","PR_SCHED_CORE_SHARE_FROM","PR_SCHED_CORE_SHARE_TO","PR_SET_CHILD_SUBREAPER","PR_SET_DUMPABLE","PR_SET_ENDIAN","PR_SET_FPEMU","PR_SET_FPEXC","PR_SET_FP_MODE","PR_SET_KEEPCAPS","PR_SET_MM","PR_SET_MM_ARG_END","PR_SET_MM_ARG_START","PR_SET_MM_AUXV","PR_SET_MM_BRK","PR_SET_MM_END_CODE","PR_SET_MM_END_DATA","PR_SET_MM_ENV_END","PR_SET_MM_ENV_START","PR_SET_MM_EXE_FILE","PR_SET_MM_MAP","PR_SET_MM_MAP_SIZE","PR_SET_MM_START_BRK","PR_SET_MM_START_CODE","PR_SET_MM_START_DATA","PR_SET_MM_START_STACK","PR_SET_NAME","PR_SET_NO_NEW_PRIVS","PR_SET_PDEATHSIG","PR_SET_PTRACER","PR_SET_PTRACER_ANY","PR_SET_SECCOMP","PR_SET_SECUREBITS","PR_SET_SPECULATION_CTRL","PR_SET_THP_DISABLE","PR_SET_TIMERSLACK","PR_SET_TIMING","PR_SET_TSC","PR_SET_UNALIGN","PR_SET_VMA","PR_SET_VMA_ANON_NAME","PR_SPEC_DISABLE","PR_SPEC_DISABLE_NOEXEC","PR_SPEC_ENABLE","PR_SPEC_FORCE_DISABLE","PR_SPEC_INDIRECT_BRANCH","PR_SPEC_NOT_AFFECTED","PR_SPEC_PRCTL","PR_SPEC_STORE_BYPASS","PR_TASK_PERF_EVENTS_DISABLE","PR_TASK_PERF_EVENTS_ENABLE","PR_TIMING_STATISTICAL","PR_TIMING_TIMESTAMP","PR_TSC_ENABLE","PR_TSC_SIGSEGV","PR_UNALIGN_NOPRINT","PR_UNALIGN_SIGBUS","PTHREAD_ADAPTIVE_MUTEX_INITIALIZER_NP","PTHREAD_COND_INITIALIZER","PTHREAD_CREATE_DETACHED","PTHREAD_CREATE_JOINABLE","PTHREAD_ERRORCHECK_MUTEX_INITIALIZER_NP","PTHREAD_EXPLICIT_SCHED","PTHREAD_INHERIT_SCHED","PTHREAD_MUTEX_ADAPTIVE_NP","PTHREAD_MUTEX_DEFAULT","PTHREAD_MUTEX_ERRORCHECK","PTHREAD_MUTEX_INITIALIZER","PTHREAD_MUTEX_NORMAL","PTHREAD_MUTEX_RECURSIVE","PTHREAD_MUTEX_ROBUST","PTHREAD_MUTEX_STALLED","PTHREAD_ONCE_INIT","PTHREAD_PRIO_INHERIT","PTHREAD_PRIO_NONE","PTHREAD_PRIO_PROTECT","PTHREAD_PROCESS_PRIVATE","PTHREAD_PROCESS_SHARED","PTHREAD_RECURSIVE_MUTEX_INITIALIZER_NP","PTHREAD_RWLOCK_INITIALIZER","PTHREAD_STACK_MIN","PTRACE_ATTACH","PTRACE_CONT","PTRACE_DETACH","PTRACE_EVENT_CLONE","PTRACE_EVENT_EXEC","PTRACE_EVENT_EXIT","PTRACE_EVENT_FORK","PTRACE_EVENT_SECCOMP","PTRACE_EVENT_STOP","PTRACE_EVENT_VFORK","PTRACE_EVENT_VFORK_DONE","PTRACE_GETEVENTMSG","PTRACE_GETFPREGS","PTRACE_GETFPXREGS","PTRACE_GETREGS","PTRACE_GETREGSET","PTRACE_GETSIGINFO","PTRACE_GETSIGMASK","PTRACE_GET_RSEQ_CONFIGURATION","PTRACE_GET_SYSCALL_INFO","PTRACE_INTERRUPT","PTRACE_KILL","PTRACE_LISTEN","PTRACE_O_EXITKILL","PTRACE_O_MASK","PTRACE_O_SUSPEND_SECCOMP","PTRACE_O_TRACECLONE","PTRACE_O_TRACEEXEC","PTRACE_O_TRACEEXIT","PTRACE_O_TRACEFORK","PTRACE_O_TRACESECCOMP","PTRACE_O_TRACESYSGOOD","PTRACE_O_TRACEVFORK","PTRACE_O_TRACEVFORKDONE","PTRACE_PEEKDATA","PTRACE_PEEKSIGINFO","PTRACE_PEEKSIGINFO_SHARED","PTRACE_PEEKTEXT","PTRACE_PEEKUSER","PTRACE_POKEDATA","PTRACE_POKETEXT","PTRACE_POKEUSER","PTRACE_SEIZE","PTRACE_SETFPREGS","PTRACE_SETFPXREGS","PTRACE_SETOPTIONS","PTRACE_SETREGS","PTRACE_SETREGSET","PTRACE_SETSIGINFO","PTRACE_SETSIGMASK","PTRACE_SINGLESTEP","PTRACE_SYSCALL","PTRACE_SYSCALL_INFO_ENTRY","PTRACE_SYSCALL_INFO_EXIT","PTRACE_SYSCALL_INFO_NONE","PTRACE_SYSCALL_INFO_SECCOMP","PTRACE_SYSEMU","PTRACE_SYSEMU_SINGLESTEP","PTRACE_TRACEME","PT_DYNAMIC","PT_GNU_EH_FRAME","PT_GNU_RELRO","PT_GNU_STACK","PT_HIOS","PT_HIPROC","PT_HISUNW","PT_INTERP","PT_LOAD","PT_LOOS","PT_LOPROC","PT_LOSUNW","PT_NOTE","PT_NULL","PT_NUM","PT_PHDR","PT_SHLIB","PT_SUNWBSS","PT_SUNWSTACK","PT_TLS","P_ALL","P_PGID","P_PID","P_PIDFD","QCMD","QFMT_VFS_OLD","QFMT_VFS_V0","QFMT_VFS_V1","QIF_ALL","QIF_BLIMITS","QIF_BTIME","QIF_ILIMITS","QIF_INODES","QIF_ITIME","QIF_LIMITS","QIF_SPACE","QIF_TIMES","QIF_USAGE","QNX4_SUPER_MAGIC","QNX6_SUPER_MAGIC","Q_GETFMT","Q_GETINFO","Q_GETQUOTA","Q_QUOTAOFF","Q_QUOTAON","Q_SETINFO","Q_SETQUOTA","Q_SYNC","R10","R11","R12","R13","R14","R15","R8","R9","RADIXCHAR","RAND_MAX","RAX","RBP","RBX","RB_AUTOBOOT","RB_DISABLE_CAD","RB_ENABLE_CAD","RB_HALT_SYSTEM","RB_KEXEC","RB_POWER_OFF","RB_SW_SUSPEND","RCX","RDI","RDTGROUP_SUPER_MAGIC","RDX","READ_IMPLIES_EXEC","REG_BADBR","REG_BADPAT","REG_BADRPT","REG_CR2","REG_CSGSFS","REG_EBRACE","REG_EBRACK","REG_ECOLLATE","REG_ECTYPE","REG_EEND","REG_EESCAPE","REG_EFL","REG_ENOSYS","REG_EPAREN","REG_ERANGE","REG_ERPAREN","REG_ERR","REG_ESIZE","REG_ESPACE","REG_ESUBREG","REG_EXTENDED","REG_ICASE","REG_NEWLINE","REG_NOMATCH","REG_NOSUB","REG_NOTBOL","REG_NOTEOL","REG_OLDMASK","REG_R10","REG_R11","REG_R12","REG_R13","REG_R14","REG_R15","REG_R8","REG_R9","REG_RAX","REG_RBP","REG_RBX","REG_RCX","REG_RDI","REG_RDX","REG_RIP","REG_RSI","REG_RSP","REG_STARTEND","REG_TRAPNO","REISERFS_SUPER_MAGIC","REL_CNT","REL_MAX","RENAME_EXCHANGE","RENAME_NOREPLACE","RENAME_WHITEOUT","REP_CNT","REP_MAX","RESOLVE_BENEATH","RESOLVE_CACHED","RESOLVE_IN_ROOT","RESOLVE_NO_MAGICLINKS","RESOLVE_NO_SYMLINKS","RESOLVE_NO_XDEV","RIP","RLIM64_INFINITY","RLIMIT_AS","RLIMIT_CORE","RLIMIT_CPU","RLIMIT_DATA","RLIMIT_FSIZE","RLIMIT_LOCKS","RLIMIT_MEMLOCK","RLIMIT_MSGQUEUE","RLIMIT_NICE","RLIMIT_NLIMITS","RLIMIT_NOFILE","RLIMIT_NPROC","RLIMIT_RSS","RLIMIT_RTPRIO","RLIMIT_RTTIME","RLIMIT_SIGPENDING","RLIMIT_STACK","RLIM_INFINITY","RLIM_NLIMITS","RLIM_SAVED_CUR","RLIM_SAVED_MAX","RSI","RSP","RTA_CACHEINFO","RTA_DST","RTA_ENCAP","RTA_ENCAP_TYPE","RTA_EXPIRES","RTA_FLOW","RTA_GATEWAY","RTA_IIF","RTA_MARK","RTA_METRICS","RTA_MFC_STATS","RTA_MP_ALGO","RTA_MULTIPATH","RTA_NEWDST","RTA_OIF","RTA_PAD","RTA_PREF","RTA_PREFSRC","RTA_PRIORITY","RTA_PROTOINFO","RTA_SESSION","RTA_SRC","RTA_TABLE","RTA_TTL_PROPAGATE","RTA_UID","RTA_UNSPEC","RTA_VIA","RTCF_DIRECTSRC","RTCF_DOREDIRECT","RTCF_LOG","RTCF_MASQ","RTCF_NAT","RTCF_VALVE","RTEXT_FILTER_BRVLAN","RTEXT_FILTER_BRVLAN_COMPRESSED","RTEXT_FILTER_CFM_CONFIG","RTEXT_FILTER_CFM_STATUS","RTEXT_FILTER_MRP","RTEXT_FILTER_SKIP_STATS","RTEXT_FILTER_VF","RTF_ADDRCLASSMASK","RTF_ADDRCONF","RTF_ALLONLINK","RTF_BROADCAST","RTF_CACHE","RTF_DEFAULT","RTF_DYNAMIC","RTF_FLOW","RTF_GATEWAY","RTF_HOST","RTF_INTERFACE","RTF_IRTT","RTF_LINKRT","RTF_LOCAL","RTF_MODIFIED","RTF_MSS","RTF_MTU","RTF_MULTICAST","RTF_NAT","RTF_NOFORWARD","RTF_NONEXTHOP","RTF_NOPMTUDISC","RTF_POLICY","RTF_REINSTATE","RTF_REJECT","RTF_STATIC","RTF_THROW","RTF_UP","RTF_WINDOW","RTF_XRESOLVE","RTLD_DEEPBIND","RTLD_DEFAULT","RTLD_DI_CONFIGADDR","RTLD_DI_LINKMAP","RTLD_DI_LMID","RTLD_DI_ORIGIN","RTLD_DI_PROFILENAME","RTLD_DI_PROFILEOUT","RTLD_DI_SERINFO","RTLD_DI_SERINFOSIZE","RTLD_DI_TLS_DATA","RTLD_DI_TLS_MODID","RTLD_GLOBAL","RTLD_LAZY","RTLD_LOCAL","RTLD_NEXT","RTLD_NODELETE","RTLD_NOLOAD","RTLD_NOW","RTMGRP_DECnet_IFADDR","RTMGRP_DECnet_ROUTE","RTMGRP_IPV4_IFADDR","RTMGRP_IPV4_MROUTE","RTMGRP_IPV4_ROUTE","RTMGRP_IPV4_RULE","RTMGRP_IPV6_IFADDR","RTMGRP_IPV6_IFINFO","RTMGRP_IPV6_MROUTE","RTMGRP_IPV6_PREFIX","RTMGRP_IPV6_ROUTE","RTMGRP_LINK","RTMGRP_NEIGH","RTMGRP_NOTIFY","RTMGRP_TC","RTMSG_AR_FAILED","RTMSG_CONTROL","RTMSG_DELDEVICE","RTMSG_DELROUTE","RTMSG_DELRULE","RTMSG_NEWDEVICE","RTMSG_NEWROUTE","RTMSG_NEWRULE","RTMSG_OVERRUN","RTM_DELACTION","RTM_DELADDR","RTM_DELADDRLABEL","RTM_DELLINK","RTM_DELMDB","RTM_DELNEIGH","RTM_DELNETCONF","RTM_DELNSID","RTM_DELQDISC","RTM_DELROUTE","RTM_DELRULE","RTM_DELTCLASS","RTM_DELTFILTER","RTM_F_CLONED","RTM_F_EQUALIZE","RTM_F_FIB_MATCH","RTM_F_LOOKUP_TABLE","RTM_F_NOTIFY","RTM_F_PREFIX","RTM_GETACTION","RTM_GETADDR","RTM_GETADDRLABEL","RTM_GETANYCAST","RTM_GETDCB","RTM_GETLINK","RTM_GETMDB","RTM_GETMULTICAST","RTM_GETNEIGH","RTM_GETNEIGHTBL","RTM_GETNETCONF","RTM_GETNSID","RTM_GETQDISC","RTM_GETROUTE","RTM_GETRULE","RTM_GETSTATS","RTM_GETTCLASS","RTM_GETTFILTER","RTM_NEWACTION","RTM_NEWADDR","RTM_NEWADDRLABEL","RTM_NEWCACHEREPORT","RTM_NEWLINK","RTM_NEWMDB","RTM_NEWNDUSEROPT","RTM_NEWNEIGH","RTM_NEWNEIGHTBL","RTM_NEWNETCONF","RTM_NEWNSID","RTM_NEWPREFIX","RTM_NEWQDISC","RTM_NEWROUTE","RTM_NEWRULE","RTM_NEWSTATS","RTM_NEWTCLASS","RTM_NEWTFILTER","RTM_SETDCB","RTM_SETLINK","RTM_SETNEIGHTBL","RTNLGRP_BRVLAN","RTNLGRP_DCB","RTNLGRP_DECnet_IFADDR","RTNLGRP_DECnet_ROUTE","RTNLGRP_DECnet_RULE","RTNLGRP_IPV4_IFADDR","RTNLGRP_IPV4_MROUTE","RTNLGRP_IPV4_MROUTE_R","RTNLGRP_IPV4_NETCONF","RTNLGRP_IPV4_ROUTE","RTNLGRP_IPV4_RULE","RTNLGRP_IPV6_IFADDR","RTNLGRP_IPV6_IFINFO","RTNLGRP_IPV6_MROUTE","RTNLGRP_IPV6_MROUTE_R","RTNLGRP_IPV6_NETCONF","RTNLGRP_IPV6_PREFIX","RTNLGRP_IPV6_ROUTE","RTNLGRP_IPV6_RULE","RTNLGRP_LINK","RTNLGRP_MCTP_IFADDR","RTNLGRP_MDB","RTNLGRP_MPLS_NETCONF","RTNLGRP_MPLS_ROUTE","RTNLGRP_ND_USEROPT","RTNLGRP_NEIGH","RTNLGRP_NEXTHOP","RTNLGRP_NONE","RTNLGRP_NOP2","RTNLGRP_NOP4","RTNLGRP_NOTIFY","RTNLGRP_NSID","RTNLGRP_PHONET_IFADDR","RTNLGRP_PHONET_ROUTE","RTNLGRP_STATS","RTNLGRP_TC","RTNLGRP_TUNNEL","RTN_ANYCAST","RTN_BLACKHOLE","RTN_BROADCAST","RTN_LOCAL","RTN_MULTICAST","RTN_NAT","RTN_PROHIBIT","RTN_THROW","RTN_UNICAST","RTN_UNREACHABLE","RTN_UNSPEC","RTN_XRESOLVE","RTPROT_BOOT","RTPROT_KERNEL","RTPROT_REDIRECT","RTPROT_STATIC","RTPROT_UNSPEC","RT_ADDRCLASS","RT_CLASS_DEFAULT","RT_CLASS_LOCAL","RT_CLASS_MAIN","RT_CLASS_MAX","RT_CLASS_UNSPEC","RT_LOCALADDR","RT_SCOPE_HOST","RT_SCOPE_LINK","RT_SCOPE_NOWHERE","RT_SCOPE_SITE","RT_SCOPE_UNIVERSE","RT_TABLE_COMPAT","RT_TABLE_DEFAULT","RT_TABLE_LOCAL","RT_TABLE_MAIN","RT_TABLE_UNSPEC","RT_TOS","RUN_LVL","RUSAGE_CHILDREN","RUSAGE_SELF","RUSAGE_THREAD","RWF_APPEND","RWF_DSYNC","RWF_HIPRI","RWF_NOWAIT","RWF_SYNC","R_OK","SA_NOCLDSTOP","SA_NOCLDWAIT","SA_NODEFER","SA_ONSTACK","SA_RESETHAND","SA_RESTART","SA_SIGINFO","SCHED_BATCH","SCHED_DEADLINE","SCHED_FIFO","SCHED_FLAG_ALL","SCHED_FLAG_DL_OVERRUN","SCHED_FLAG_KEEP_ALL","SCHED_FLAG_KEEP_PARAMS","SCHED_FLAG_KEEP_POLICY","SCHED_FLAG_RECLAIM","SCHED_FLAG_RESET_ON_FORK","SCHED_FLAG_UTIL_CLAMP","SCHED_FLAG_UTIL_CLAMP_MAX","SCHED_FLAG_UTIL_CLAMP_MIN","SCHED_IDLE","SCHED_NORMAL","SCHED_OTHER","SCHED_RESET_ON_FORK","SCHED_RR","SCM_CREDENTIALS","SCM_J1939_DEST_ADDR","SCM_J1939_DEST_NAME","SCM_J1939_ERRQUEUE","SCM_J1939_PRIO","SCM_RIGHTS","SCM_TIMESTAMP","SCM_TIMESTAMPING","SCM_TIMESTAMPING_OPT_STATS","SCM_TIMESTAMPING_PKTINFO","SCM_TIMESTAMPNS","SCM_TXTIME","SCM_WIFI_STATUS","SCTP_ABORT","SCTP_ADAPTATION_LAYER","SCTP_ADDR_OVER","SCTP_ALL_ASSOC","SCTP_ASSOCINFO","SCTP_AUTHINFO","SCTP_AUTH_ACTIVE_KEY","SCTP_AUTH_CHUNK","SCTP_AUTH_DEACTIVATE_KEY","SCTP_AUTH_DELETE_KEY","SCTP_AUTH_KEY","SCTP_AUTOCLOSE","SCTP_AUTO_ASCONF","SCTP_CONTEXT","SCTP_CURRENT_ASSOC","SCTP_DEFAULT_SEND_PARAM","SCTP_DEFAULT_SNDINFO","SCTP_DELAYED_ACK","SCTP_DELAYED_ACK_TIME","SCTP_DELAYED_SACK","SCTP_DISABLE_FRAGMENTS","SCTP_DSTADDRV4","SCTP_DSTADDRV6","SCTP_ENABLE_CHANGE_ASSOC_REQ","SCTP_ENABLE_RESET_ASSOC_REQ","SCTP_ENABLE_RESET_STREAM_REQ","SCTP_ENABLE_STRRESET_MASK","SCTP_EOF","SCTP_EVENTS","SCTP_FRAGMENT_INTERLEAVE","SCTP_FUTURE_ASSOC","SCTP_GET_ASSOC_ID_LIST","SCTP_GET_ASSOC_NUMBER","SCTP_GET_PEER_ADDR_INFO","SCTP_HMAC_IDENT","SCTP_INIT","SCTP_INITMSG","SCTP_I_WANT_MAPPED_V4_ADDR","SCTP_LOCAL_AUTH_CHUNKS","SCTP_MAXSEG","SCTP_MAX_BURST","SCTP_NODELAY","SCTP_NOTIFICATION","SCTP_NXTINFO","SCTP_PARTIAL_DELIVERY_POINT","SCTP_PEER_ADDR_PARAMS","SCTP_PEER_ADDR_THLDS","SCTP_PEER_ADDR_THLDS_V2","SCTP_PEER_AUTH_CHUNKS","SCTP_PRIMARY_ADDR","SCTP_PRINFO","SCTP_PR_INDEX","SCTP_PR_POLICY","SCTP_PR_PRIO_ENABLED","SCTP_PR_RTX_ENABLED","SCTP_PR_SCTP_ALL","SCTP_PR_SCTP_MASK","SCTP_PR_SCTP_MAX","SCTP_PR_SCTP_NONE","SCTP_PR_SCTP_PRIO","SCTP_PR_SCTP_RTX","SCTP_PR_SCTP_TTL","SCTP_PR_SET_POLICY","SCTP_PR_TTL_ENABLED","SCTP_RCVINFO","SCTP_RECVNXTINFO","SCTP_RECVRCVINFO","SCTP_REUSE_PORT","SCTP_RTOINFO","SCTP_SACK_IMMEDIATELY","SCTP_SENDALL","SCTP_SET_PEER_PRIMARY_ADDR","SCTP_SNDINFO","SCTP_SNDRCV","SCTP_STATUS","SCTP_STREAM_RESET_INCOMING","SCTP_STREAM_RESET_OUTGOING","SCTP_UNORDERED","SECCOMP_ADDFD_FLAG_SEND","SECCOMP_ADDFD_FLAG_SETFD","SECCOMP_FILTER_FLAG_LOG","SECCOMP_FILTER_FLAG_NEW_LISTENER","SECCOMP_FILTER_FLAG_SPEC_ALLOW","SECCOMP_FILTER_FLAG_TSYNC","SECCOMP_FILTER_FLAG_TSYNC_ESRCH","SECCOMP_FILTER_FLAG_WAIT_KILLABLE_RECV","SECCOMP_GET_ACTION_AVAIL","SECCOMP_GET_NOTIF_SIZES","SECCOMP_MODE_DISABLED","SECCOMP_MODE_FILTER","SECCOMP_MODE_STRICT","SECCOMP_RET_ACTION","SECCOMP_RET_ACTION_FULL","SECCOMP_RET_ALLOW","SECCOMP_RET_DATA","SECCOMP_RET_ERRNO","SECCOMP_RET_KILL","SECCOMP_RET_KILL_PROCESS","SECCOMP_RET_KILL_THREAD","SECCOMP_RET_LOG","SECCOMP_RET_TRACE","SECCOMP_RET_TRAP","SECCOMP_SET_MODE_FILTER","SECCOMP_SET_MODE_STRICT","SECCOMP_USER_NOTIF_FLAG_CONTINUE","SECURITYFS_MAGIC","SEEK_CUR","SEEK_DATA","SEEK_END","SEEK_HOLE","SEEK_SET","SELFMAG","SELINUX_MAGIC","SEM_FAILED","SFD_CLOEXEC","SFD_NONBLOCK","SHM_EXEC","SHM_HUGETLB","SHM_LOCK","SHM_NORESERVE","SHM_R","SHM_RDONLY","SHM_REMAP","SHM_RND","SHM_UNLOCK","SHM_W","SHORT_INODE","SHUT_RD","SHUT_RDWR","SHUT_WR","SIGABRT","SIGALRM","SIGBUS","SIGCHLD","SIGCONT","SIGEV_NONE","SIGEV_SIGNAL","SIGEV_THREAD","SIGEV_THREAD_ID","SIGFPE","SIGHUP","SIGILL","SIGINT","SIGIO","SIGIOT","SIGKILL","SIGPIPE","SIGPOLL","SIGPROF","SIGPWR","SIGQUIT","SIGRTMAX","SIGRTMIN","SIGSEGV","SIGSTKFLT","SIGSTKSZ","SIGSTOP","SIGSYS","SIGTERM","SIGTRAP","SIGTSTP","SIGTTIN","SIGTTOU","SIGUNUSED","SIGURG","SIGUSR1","SIGUSR2","SIGVTALRM","SIGWINCH","SIGXCPU","SIGXFSZ","SIG_BLOCK","SIG_DFL","SIG_ERR","SIG_IGN","SIG_SETMASK","SIG_UNBLOCK","SIOCADDMULTI","SIOCADDRT","SIOCDARP","SIOCDELMULTI","SIOCDELRT","SIOCDIFADDR","SIOCDRARP","SIOCETHTOOL","SIOCGARP","SIOCGHWTSTAMP","SIOCGIFADDR","SIOCGIFBR","SIOCGIFBRDADDR","SIOCGIFCONF","SIOCGIFCOUNT","SIOCGIFDSTADDR","SIOCGIFENCAP","SIOCGIFFLAGS","SIOCGIFHWADDR","SIOCGIFINDEX","SIOCGIFMAP","SIOCGIFMEM","SIOCGIFMETRIC","SIOCGIFMTU","SIOCGIFNAME","SIOCGIFNETMASK","SIOCGIFPFLAGS","SIOCGIFSLAVE","SIOCGIFTXQLEN","SIOCGIWAP","SIOCGIWAPLIST","SIOCGIWAUTH","SIOCGIWENCODE","SIOCGIWENCODEEXT","SIOCGIWESSID","SIOCGIWFRAG","SIOCGIWFREQ","SIOCGIWGENIE","SIOCGIWMODE","SIOCGIWNAME","SIOCGIWNICKN","SIOCGIWNWID","SIOCGIWPOWER","SIOCGIWPRIV","SIOCGIWRANGE","SIOCGIWRATE","SIOCGIWRETRY","SIOCGIWRTS","SIOCGIWSCAN","SIOCGIWSENS","SIOCGIWSPY","SIOCGIWSTATS","SIOCGIWTHRSPY","SIOCGIWTXPOW","SIOCGMIIPHY","SIOCGMIIREG","SIOCGRARP","SIOCGSKNS","SIOCIWFIRST","SIOCIWFIRSTPRIV","SIOCIWLAST","SIOCIWLASTPRIV","SIOCOUTQNSD","SIOCSARP","SIOCSHWTSTAMP","SIOCSIFADDR","SIOCSIFBR","SIOCSIFBRDADDR","SIOCSIFDSTADDR","SIOCSIFENCAP","SIOCSIFFLAGS","SIOCSIFHWADDR","SIOCSIFHWBROADCAST","SIOCSIFLINK","SIOCSIFMAP","SIOCSIFMEM","SIOCSIFMETRIC","SIOCSIFMTU","SIOCSIFNAME","SIOCSIFNETMASK","SIOCSIFPFLAGS","SIOCSIFSLAVE","SIOCSIFTXQLEN","SIOCSIWAP","SIOCSIWAUTH","SIOCSIWCOMMIT","SIOCSIWENCODE","SIOCSIWENCODEEXT","SIOCSIWESSID","SIOCSIWFRAG","SIOCSIWFREQ","SIOCSIWGENIE","SIOCSIWMLME","SIOCSIWMODE","SIOCSIWNICKN","SIOCSIWNWID","SIOCSIWPMKSA","SIOCSIWPOWER","SIOCSIWPRIV","SIOCSIWRANGE","SIOCSIWRATE","SIOCSIWRETRY","SIOCSIWRTS","SIOCSIWSCAN","SIOCSIWSENS","SIOCSIWSPY","SIOCSIWSTATS","SIOCSIWTHRSPY","SIOCSIWTXPOW","SIOCSMIIREG","SIOCSRARP","SIOCWANDEV","SIOGIFINDEX","SI_LOAD_SHIFT","SKF_AD_ALU_XOR_X","SKF_AD_CPU","SKF_AD_HATYPE","SKF_AD_IFINDEX","SKF_AD_MARK","SKF_AD_MAX","SKF_AD_NLATTR","SKF_AD_NLATTR_NEST","SKF_AD_OFF","SKF_AD_PAY_OFFSET","SKF_AD_PKTTYPE","SKF_AD_PROTOCOL","SKF_AD_QUEUE","SKF_AD_RANDOM","SKF_AD_RXHASH","SKF_AD_VLAN_TAG","SKF_AD_VLAN_TAG_PRESENT","SKF_AD_VLAN_TPID","SKF_LL_OFF","SKF_NET_OFF","SK_MEMINFO_BACKLOG","SK_MEMINFO_DROPS","SK_MEMINFO_FWD_ALLOC","SK_MEMINFO_OPTMEM","SK_MEMINFO_RCVBUF","SK_MEMINFO_RMEM_ALLOC","SK_MEMINFO_SNDBUF","SK_MEMINFO_WMEM_ALLOC","SK_MEMINFO_WMEM_QUEUED","SMACK_MAGIC","SMB_SUPER_MAGIC","SND_CNT","SND_MAX","SOCK_CLOEXEC","SOCK_DCCP","SOCK_DGRAM","SOCK_NONBLOCK","SOCK_PACKET","SOCK_RAW","SOCK_RDM","SOCK_SEQPACKET","SOCK_STREAM","SOF_TIMESTAMPING_OPT_CMSG","SOF_TIMESTAMPING_OPT_ID","SOF_TIMESTAMPING_OPT_PKTINFO","SOF_TIMESTAMPING_OPT_STATS","SOF_TIMESTAMPING_OPT_TSONLY","SOF_TIMESTAMPING_OPT_TX_SWHW","SOF_TIMESTAMPING_RAW_HARDWARE","SOF_TIMESTAMPING_RX_HARDWARE","SOF_TIMESTAMPING_RX_SOFTWARE","SOF_TIMESTAMPING_SOFTWARE","SOF_TIMESTAMPING_SYS_HARDWARE","SOF_TIMESTAMPING_TX_ACK","SOF_TIMESTAMPING_TX_HARDWARE","SOF_TIMESTAMPING_TX_SCHED","SOF_TIMESTAMPING_TX_SOFTWARE","SOF_TXTIME_DEADLINE_MODE","SOF_TXTIME_REPORT_ERRORS","SOL_AAL","SOL_ALG","SOL_ATM","SOL_BLUETOOTH","SOL_CAIF","SOL_CAN_BASE","SOL_CAN_J1939","SOL_CAN_RAW","SOL_DCCP","SOL_DECNET","SOL_ICMPV6","SOL_IP","SOL_IPV6","SOL_IRDA","SOL_IUCV","SOL_LLC","SOL_NETBEUI","SOL_NETLINK","SOL_NFC","SOL_PACKET","SOL_PNPIPE","SOL_PPPOL2TP","SOL_RAW","SOL_RDS","SOL_RXRPC","SOL_SOCKET","SOL_TCP","SOL_TIPC","SOL_TLS","SOL_UDP","SOL_X25","SOL_XDP","SOMAXCONN","SO_ACCEPTCONN","SO_ATTACH_BPF","SO_ATTACH_FILTER","SO_ATTACH_REUSEPORT_CBPF","SO_ATTACH_REUSEPORT_EBPF","SO_BINDTODEVICE","SO_BINDTOIFINDEX","SO_BPF_EXTENSIONS","SO_BROADCAST","SO_BSDCOMPAT","SO_BUSY_POLL","SO_CNX_ADVICE","SO_COOKIE","SO_DEBUG","SO_DETACH_BPF","SO_DETACH_FILTER","SO_DETACH_REUSEPORT_BPF","SO_DOMAIN","SO_DONTROUTE","SO_EE_OFFENDER","SO_EE_ORIGIN_ICMP","SO_EE_ORIGIN_ICMP6","SO_EE_ORIGIN_LOCAL","SO_EE_ORIGIN_NONE","SO_EE_ORIGIN_TIMESTAMPING","SO_EE_ORIGIN_TXSTATUS","SO_ERROR","SO_GET_FILTER","SO_INCOMING_CPU","SO_INCOMING_NAPI_ID","SO_J1939_ERRQUEUE","SO_J1939_FILTER","SO_J1939_PROMISC","SO_J1939_SEND_PRIO","SO_KEEPALIVE","SO_LINGER","SO_LOCK_FILTER","SO_MARK","SO_MAX_PACING_RATE","SO_MEMINFO","SO_NOFCS","SO_NO_CHECK","SO_OOBINLINE","SO_ORIGINAL_DST","SO_PASSCRED","SO_PASSSEC","SO_PEEK_OFF","SO_PEERCRED","SO_PEERGROUPS","SO_PEERNAME","SO_PEERSEC","SO_PRIORITY","SO_PROTOCOL","SO_RCVBUF","SO_RCVBUFFORCE","SO_RCVLOWAT","SO_RCVTIMEO","SO_RCVTIMEO_NEW","SO_REUSEADDR","SO_REUSEPORT","SO_RXQ_OVFL","SO_SECURITY_AUTHENTICATION","SO_SECURITY_ENCRYPTION_NETWORK","SO_SECURITY_ENCRYPTION_TRANSPORT","SO_SELECT_ERR_QUEUE","SO_SNDBUF","SO_SNDBUFFORCE","SO_SNDLOWAT","SO_SNDTIMEO","SO_SNDTIMEO_NEW","SO_TIMESTAMP","SO_TIMESTAMPING","SO_TIMESTAMPING_NEW","SO_TIMESTAMPNS","SO_TIMESTAMPNS_NEW","SO_TIMESTAMP_NEW","SO_TXTIME","SO_TYPE","SO_WIFI_STATUS","SO_ZEROCOPY","SPLICE_F_GIFT","SPLICE_F_MORE","SPLICE_F_MOVE","SPLICE_F_NONBLOCK","SS","SS_DISABLE","SS_ONSTACK","STATX_ALL","STATX_ATIME","STATX_ATTR_APPEND","STATX_ATTR_AUTOMOUNT","STATX_ATTR_COMPRESSED","STATX_ATTR_DAX","STATX_ATTR_ENCRYPTED","STATX_ATTR_IMMUTABLE","STATX_ATTR_MOUNT_ROOT","STATX_ATTR_NODUMP","STATX_ATTR_VERITY","STATX_BASIC_STATS","STATX_BLOCKS","STATX_BTIME","STATX_CTIME","STATX_DIOALIGN","STATX_GID","STATX_INO","STATX_MNT_ID","STATX_MODE","STATX_MTIME","STATX_NLINK","STATX_SIZE","STATX_TYPE","STATX_UID","STATX__RESERVED","STA_CLK","STA_CLOCKERR","STA_DEL","STA_FLL","STA_FREQHOLD","STA_INS","STA_MODE","STA_NANO","STA_PLL","STA_PPSERROR","STA_PPSFREQ","STA_PPSJITTER","STA_PPSSIGNAL","STA_PPSTIME","STA_PPSWANDER","STA_RONLY","STA_UNSYNC","STDERR_FILENO","STDIN_FILENO","STDOUT_FILENO","STICKY_TIMEOUTS","ST_APPEND","ST_IMMUTABLE","ST_MANDLOCK","ST_NOATIME","ST_NODEV","ST_NODIRATIME","ST_NOEXEC","ST_NOSUID","ST_RDONLY","ST_RELATIME","ST_SYNCHRONOUS","ST_WRITE","SW_CNT","SW_MAX","SYNC_FILE_RANGE_WAIT_AFTER","SYNC_FILE_RANGE_WAIT_BEFORE","SYNC_FILE_RANGE_WRITE","SYN_CNT","SYN_MAX","SYSFS_MAGIC","SYS__sysctl","SYS_accept","SYS_accept4","SYS_access","SYS_acct","SYS_add_key","SYS_adjtimex","SYS_afs_syscall","SYS_alarm","SYS_arch_prctl","SYS_bind","SYS_bpf","SYS_brk","SYS_capget","SYS_capset","SYS_chdir","SYS_chmod","SYS_chown","SYS_chroot","SYS_clock_adjtime","SYS_clock_getres","SYS_clock_gettime","SYS_clock_nanosleep","SYS_clock_settime","SYS_clone","SYS_clone3","SYS_close","SYS_close_range","SYS_connect","SYS_copy_file_range","SYS_creat","SYS_create_module","SYS_delete_module","SYS_dup","SYS_dup2","SYS_dup3","SYS_epoll_create","SYS_epoll_create1","SYS_epoll_ctl","SYS_epoll_ctl_old","SYS_epoll_pwait","SYS_epoll_pwait2","SYS_epoll_wait","SYS_epoll_wait_old","SYS_eventfd","SYS_eventfd2","SYS_execve","SYS_execveat","SYS_exit","SYS_exit_group","SYS_faccessat","SYS_faccessat2","SYS_fadvise64","SYS_fallocate","SYS_fanotify_init","SYS_fanotify_mark","SYS_fchdir","SYS_fchmod","SYS_fchmodat","SYS_fchown","SYS_fchownat","SYS_fcntl","SYS_fdatasync","SYS_fgetxattr","SYS_finit_module","SYS_flistxattr","SYS_flock","SYS_fork","SYS_fremovexattr","SYS_fsconfig","SYS_fsetxattr","SYS_fsmount","SYS_fsopen","SYS_fspick","SYS_fstat","SYS_fstatfs","SYS_fsync","SYS_ftruncate","SYS_futex","SYS_futex_waitv","SYS_futimesat","SYS_get_kernel_syms","SYS_get_mempolicy","SYS_get_robust_list","SYS_get_thread_area","SYS_getcpu","SYS_getcwd","SYS_getdents","SYS_getdents64","SYS_getegid","SYS_geteuid","SYS_getgid","SYS_getgroups","SYS_getitimer","SYS_getpeername","SYS_getpgid","SYS_getpgrp","SYS_getpid","SYS_getpmsg","SYS_getppid","SYS_getpriority","SYS_getrandom","SYS_getresgid","SYS_getresuid","SYS_getrlimit","SYS_getrusage","SYS_getsid","SYS_getsockname","SYS_getsockopt","SYS_gettid","SYS_gettimeofday","SYS_getuid","SYS_getxattr","SYS_init_module","SYS_inotify_add_watch","SYS_inotify_init","SYS_inotify_init1","SYS_inotify_rm_watch","SYS_io_cancel","SYS_io_destroy","SYS_io_getevents","SYS_io_setup","SYS_io_submit","SYS_io_uring_enter","SYS_io_uring_register","SYS_io_uring_setup","SYS_ioctl","SYS_ioperm","SYS_iopl","SYS_ioprio_get","SYS_ioprio_set","SYS_kcmp","SYS_kexec_file_load","SYS_kexec_load","SYS_keyctl","SYS_kill","SYS_landlock_add_rule","SYS_landlock_create_ruleset","SYS_landlock_restrict_self","SYS_lchown","SYS_lgetxattr","SYS_link","SYS_linkat","SYS_listen","SYS_listxattr","SYS_llistxattr","SYS_lookup_dcookie","SYS_lremovexattr","SYS_lseek","SYS_lsetxattr","SYS_lstat","SYS_madvise","SYS_mbind","SYS_membarrier","SYS_memfd_create","SYS_memfd_secret","SYS_migrate_pages","SYS_mincore","SYS_mkdir","SYS_mkdirat","SYS_mknod","SYS_mknodat","SYS_mlock","SYS_mlock2","SYS_mlockall","SYS_mmap","SYS_modify_ldt","SYS_mount","SYS_mount_setattr","SYS_move_mount","SYS_move_pages","SYS_mprotect","SYS_mq_getsetattr","SYS_mq_notify","SYS_mq_open","SYS_mq_timedreceive","SYS_mq_timedsend","SYS_mq_unlink","SYS_mremap","SYS_msgctl","SYS_msgget","SYS_msgrcv","SYS_msgsnd","SYS_msync","SYS_munlock","SYS_munlockall","SYS_munmap","SYS_name_to_handle_at","SYS_nanosleep","SYS_newfstatat","SYS_nfsservctl","SYS_open","SYS_open_by_handle_at","SYS_open_tree","SYS_openat","SYS_openat2","SYS_pause","SYS_perf_event_open","SYS_personality","SYS_pidfd_getfd","SYS_pidfd_open","SYS_pidfd_send_signal","SYS_pipe","SYS_pipe2","SYS_pivot_root","SYS_pkey_alloc","SYS_pkey_free","SYS_pkey_mprotect","SYS_poll","SYS_ppoll","SYS_prctl","SYS_pread64","SYS_preadv","SYS_preadv2","SYS_prlimit64","SYS_process_madvise","SYS_process_mrelease","SYS_process_vm_readv","SYS_process_vm_writev","SYS_pselect6","SYS_ptrace","SYS_putpmsg","SYS_pwrite64","SYS_pwritev","SYS_pwritev2","SYS_query_module","SYS_quotactl","SYS_quotactl_fd","SYS_read","SYS_readahead","SYS_readlink","SYS_readlinkat","SYS_readv","SYS_reboot","SYS_recvfrom","SYS_recvmmsg","SYS_recvmsg","SYS_remap_file_pages","SYS_removexattr","SYS_rename","SYS_renameat","SYS_renameat2","SYS_request_key","SYS_restart_syscall","SYS_rmdir","SYS_rseq","SYS_rt_sigaction","SYS_rt_sigpending","SYS_rt_sigprocmask","SYS_rt_sigqueueinfo","SYS_rt_sigreturn","SYS_rt_sigsuspend","SYS_rt_sigtimedwait","SYS_rt_tgsigqueueinfo","SYS_sched_get_priority_max","SYS_sched_get_priority_min","SYS_sched_getaffinity","SYS_sched_getattr","SYS_sched_getparam","SYS_sched_getscheduler","SYS_sched_rr_get_interval","SYS_sched_setaffinity","SYS_sched_setattr","SYS_sched_setparam","SYS_sched_setscheduler","SYS_sched_yield","SYS_seccomp","SYS_security","SYS_select","SYS_semctl","SYS_semget","SYS_semop","SYS_semtimedop","SYS_sendfile","SYS_sendmmsg","SYS_sendmsg","SYS_sendto","SYS_set_mempolicy","SYS_set_mempolicy_home_node","SYS_set_robust_list","SYS_set_thread_area","SYS_set_tid_address","SYS_setdomainname","SYS_setfsgid","SYS_setfsuid","SYS_setgid","SYS_setgroups","SYS_sethostname","SYS_setitimer","SYS_setns","SYS_setpgid","SYS_setpriority","SYS_setregid","SYS_setresgid","SYS_setresuid","SYS_setreuid","SYS_setrlimit","SYS_setsid","SYS_setsockopt","SYS_settimeofday","SYS_setuid","SYS_setxattr","SYS_shmat","SYS_shmctl","SYS_shmdt","SYS_shmget","SYS_shutdown","SYS_sigaltstack","SYS_signalfd","SYS_signalfd4","SYS_socket","SYS_socketpair","SYS_splice","SYS_stat","SYS_statfs","SYS_statx","SYS_swapoff","SYS_swapon","SYS_symlink","SYS_symlinkat","SYS_sync","SYS_sync_file_range","SYS_syncfs","SYS_sysfs","SYS_sysinfo","SYS_syslog","SYS_tee","SYS_tgkill","SYS_time","SYS_timer_create","SYS_timer_delete","SYS_timer_getoverrun","SYS_timer_gettime","SYS_timer_settime","SYS_timerfd_create","SYS_timerfd_gettime","SYS_timerfd_settime","SYS_times","SYS_tkill","SYS_truncate","SYS_tuxcall","SYS_umask","SYS_umount2","SYS_uname","SYS_unlink","SYS_unlinkat","SYS_unshare","SYS_uselib","SYS_userfaultfd","SYS_ustat","SYS_utime","SYS_utimensat","SYS_utimes","SYS_vfork","SYS_vhangup","SYS_vmsplice","SYS_vserver","SYS_wait4","SYS_waitid","SYS_write","SYS_writev","S_IEXEC","S_IFBLK","S_IFCHR","S_IFDIR","S_IFIFO","S_IFLNK","S_IFMT","S_IFREG","S_IFSOCK","S_IREAD","S_IRGRP","S_IROTH","S_IRUSR","S_IRWXG","S_IRWXO","S_IRWXU","S_ISGID","S_ISUID","S_ISVTX","S_IWGRP","S_IWOTH","S_IWRITE","S_IWUSR","S_IXGRP","S_IXOTH","S_IXUSR","TAB0","TAB1","TAB2","TAB3","TABDLY","TCA_CHAIN","TCA_DUMP_INVISIBLE","TCA_FCNT","TCA_HW_OFFLOAD","TCA_KIND","TCA_OPTIONS","TCA_PAD","TCA_RATE","TCA_STAB","TCA_STATS","TCA_STATS2","TCA_UNSPEC","TCA_XSTATS","TCFLSH","TCGETA","TCGETS","TCGETS2","TCGETX","TCIFLUSH","TCIOFF","TCIOFLUSH","TCION","TCOFLUSH","TCOOFF","TCOON","TCP_CC_INFO","TCP_CM_INQ","TCP_CONGESTION","TCP_COOKIE_TRANSACTIONS","TCP_CORK","TCP_DEFER_ACCEPT","TCP_FASTOPEN","TCP_FASTOPEN_CONNECT","TCP_FASTOPEN_KEY","TCP_FASTOPEN_NO_COOKIE","TCP_INFO","TCP_INQ","TCP_KEEPCNT","TCP_KEEPIDLE","TCP_KEEPINTVL","TCP_LINGER2","TCP_MAXSEG","TCP_MD5SIG","TCP_MD5SIG_EXT","TCP_MD5SIG_MAXKEYLEN","TCP_NODELAY","TCP_NOTSENT_LOWAT","TCP_QUEUE_SEQ","TCP_QUICKACK","TCP_REPAIR","TCP_REPAIR_OPTIONS","TCP_REPAIR_QUEUE","TCP_REPAIR_WINDOW","TCP_SAVED_SYN","TCP_SAVE_SYN","TCP_SYNCNT","TCP_THIN_DUPACK","TCP_THIN_LINEAR_TIMEOUTS","TCP_TIMESTAMP","TCP_ULP","TCP_USER_TIMEOUT","TCP_WINDOW_CLAMP","TCP_ZEROCOPY_RECEIVE","TCSADRAIN","TCSAFLUSH","TCSANOW","TCSBRK","TCSBRKP","TCSETA","TCSETAF","TCSETAW","TCSETS","TCSETS2","TCSETSF","TCSETSF2","TCSETSW","TCSETSW2","TCSETX","TCSETXF","TCSETXW","TCXONC","TFD_CLOEXEC","TFD_NONBLOCK","TFD_TIMER_ABSTIME","TFD_TIMER_CANCEL_ON_SET","THOUSEP","TIMER_ABSTIME","TIME_BAD","TIME_DEL","TIME_ERROR","TIME_INS","TIME_OK","TIME_OOP","TIME_WAIT","TIOCCBRK","TIOCCONS","TIOCEXCL","TIOCGDEV","TIOCGETD","TIOCGEXCL","TIOCGICOUNT","TIOCGLCKTRMIOS","TIOCGPGRP","TIOCGPKT","TIOCGPTLCK","TIOCGPTN","TIOCGPTPEER","TIOCGRS485","TIOCGSERIAL","TIOCGSID","TIOCGSOFTCAR","TIOCGWINSZ","TIOCINQ","TIOCLINUX","TIOCMBIC","TIOCMBIS","TIOCMGET","TIOCMIWAIT","TIOCMSET","TIOCM_CAR","TIOCM_CD","TIOCM_CTS","TIOCM_DSR","TIOCM_DTR","TIOCM_LE","TIOCM_RI","TIOCM_RNG","TIOCM_RTS","TIOCM_SR","TIOCM_ST","TIOCNOTTY","TIOCNXCL","TIOCOUTQ","TIOCPKT","TIOCSBRK","TIOCSCTTY","TIOCSERCONFIG","TIOCSERGETLSR","TIOCSERGETMULTI","TIOCSERGSTRUCT","TIOCSERGWILD","TIOCSERSETMULTI","TIOCSERSWILD","TIOCSETD","TIOCSIG","TIOCSLCKTRMIOS","TIOCSPGRP","TIOCSPTLCK","TIOCSRS485","TIOCSSERIAL","TIOCSSOFTCAR","TIOCSTI","TIOCSWINSZ","TIOCVHANGUP","TLS_1_2_VERSION","TLS_1_2_VERSION_MAJOR","TLS_1_2_VERSION_MINOR","TLS_1_3_VERSION","TLS_1_3_VERSION_MAJOR","TLS_1_3_VERSION_MINOR","TLS_CIPHER_AES_GCM_128","TLS_CIPHER_AES_GCM_128_IV_SIZE","TLS_CIPHER_AES_GCM_128_KEY_SIZE","TLS_CIPHER_AES_GCM_128_REC_SEQ_SIZE","TLS_CIPHER_AES_GCM_128_SALT_SIZE","TLS_CIPHER_AES_GCM_128_TAG_SIZE","TLS_CIPHER_AES_GCM_256","TLS_CIPHER_AES_GCM_256_IV_SIZE","TLS_CIPHER_AES_GCM_256_KEY_SIZE","TLS_CIPHER_AES_GCM_256_REC_SEQ_SIZE","TLS_CIPHER_AES_GCM_256_SALT_SIZE","TLS_CIPHER_AES_GCM_256_TAG_SIZE","TLS_CIPHER_CHACHA20_POLY1305","TLS_CIPHER_CHACHA20_POLY1305_IV_SIZE","TLS_CIPHER_CHACHA20_POLY1305_KEY_SIZE","TLS_CIPHER_CHACHA20_POLY1305_REC_SEQ_SIZE","TLS_CIPHER_CHACHA20_POLY1305_SALT_SIZE","TLS_CIPHER_CHACHA20_POLY1305_TAG_SIZE","TLS_GET_RECORD_TYPE","TLS_RX","TLS_SET_RECORD_TYPE","TLS_TX","TMPFS_MAGIC","TMP_MAX","TOSTOP","TRACEFS_MAGIC","TUN_FLT_ALLMULTI","TUN_F_CSUM","TUN_F_TSO4","TUN_F_TSO6","TUN_F_TSO_ECN","TUN_F_UFO","TUN_F_USO4","TUN_F_USO6","TUN_PKT_STRIP","TUN_READQ_SIZE","TUN_TAP_DEV","TUN_TUN_DEV","TUN_TX_TIMESTAMP","TUN_TYPE_MASK","T_FMT","T_FMT_AMPM","UDF_SUPER_MAGIC","UDP_CORK","UDP_ENCAP","UDP_GRO","UDP_NO_CHECK6_RX","UDP_NO_CHECK6_TX","UDP_SEGMENT","UINPUT_MAX_NAME_SIZE","UINPUT_VERSION","UIO_MAXIOV","UMOUNT_NOFOLLOW","UNAME26","USBDEVICE_SUPER_MAGIC","USER_PROCESS","USRQUOTA","UTIME_NOW","UTIME_OMIT","VDISCARD","VEOF","VEOL","VEOL2","VERASE","VINTR","VKILL","VLNEXT","VMADDR_CID_ANY","VMADDR_CID_HOST","VMADDR_CID_HYPERVISOR","VMADDR_CID_LOCAL","VMADDR_CID_RESERVED","VMADDR_PORT_ANY","VMIN","VM_BLOCK_DUMP","VM_DIRTY_BACKGROUND","VM_DIRTY_EXPIRE_CS","VM_DIRTY_RATIO","VM_DIRTY_WB_CS","VM_DROP_PAGECACHE","VM_HUGETLB_GROUP","VM_HUGETLB_PAGES","VM_LAPTOP_MODE","VM_LEGACY_VA_LAYOUT","VM_LOWMEM_RESERVE_RATIO","VM_MAX_MAP_COUNT","VM_MIN_FREE_KBYTES","VM_MIN_SLAB","VM_MIN_UNMAPPED","VM_NR_PDFLUSH_THREADS","VM_OVERCOMMIT_MEMORY","VM_OVERCOMMIT_RATIO","VM_PAGEBUF","VM_PAGE_CLUSTER","VM_PANIC_ON_OOM","VM_PERCPU_PAGELIST_FRACTION","VM_SWAPPINESS","VM_SWAP_TOKEN_TIMEOUT","VM_VDSO_ENABLED","VM_VFS_CACHE_PRESSURE","VM_ZONE_RECLAIM_MODE","VQUIT","VREPRINT","VSTART","VSTOP","VSUSP","VSWTC","VT0","VT1","VTDLY","VTIME","VWERASE","WCONTINUED","WCOREDUMP","WEXITED","WEXITSTATUS","WHOLE_SECONDS","WIFCONTINUED","WIFEXITED","WIFSIGNALED","WIFSTOPPED","WIRELESS_EXT","WNOHANG","WNOWAIT","WSTOPPED","WSTOPSIG","WTERMSIG","WUNTRACED","W_EXITCODE","W_OK","W_STOPCODE","XATTR_CREATE","XATTR_REPLACE","XDP_COPY","XDP_MMAP_OFFSETS","XDP_OPTIONS","XDP_OPTIONS_ZEROCOPY","XDP_PGOFF_RX_RING","XDP_PGOFF_TX_RING","XDP_PKT_CONTD","XDP_RING_NEED_WAKEUP","XDP_RX_RING","XDP_SHARED_UMEM","XDP_STATISTICS","XDP_TX_RING","XDP_UMEM_COMPLETION_RING","XDP_UMEM_FILL_RING","XDP_UMEM_PGOFF_COMPLETION_RING","XDP_UMEM_PGOFF_FILL_RING","XDP_UMEM_REG","XDP_UMEM_UNALIGNED_CHUNK_FLAG","XDP_USE_NEED_WAKEUP","XDP_USE_SG","XDP_ZEROCOPY","XENFS_SUPER_MAGIC","XFS_SUPER_MAGIC","XSK_UNALIGNED_BUF_ADDR_MASK","XSK_UNALIGNED_BUF_OFFSET_SHIFT","XTABS","X_OK","YESEXPR","YESSTR","_IOFBF","_IOLBF","_IONBF","_PC_2_SYMLINKS","_PC_ALLOC_SIZE_MIN","_PC_ASYNC_IO","_PC_CHOWN_RESTRICTED","_PC_FILESIZEBITS","_PC_LINK_MAX","_PC_MAX_CANON","_PC_MAX_INPUT","_PC_NAME_MAX","_PC_NO_TRUNC","_PC_PATH_MAX","_PC_PIPE_BUF","_PC_PRIO_IO","_PC_REC_INCR_XFER_SIZE","_PC_REC_MAX_XFER_SIZE","_PC_REC_MIN_XFER_SIZE","_PC_REC_XFER_ALIGN","_PC_SOCK_MAXBUF","_PC_SYMLINK_MAX","_PC_SYNC_IO","_PC_VDISABLE","_POSIX_VDISABLE","_SC_2_CHAR_TERM","_SC_2_C_BIND","_SC_2_C_DEV","_SC_2_C_VERSION","_SC_2_FORT_DEV","_SC_2_FORT_RUN","_SC_2_LOCALEDEF","_SC_2_PBS","_SC_2_PBS_ACCOUNTING","_SC_2_PBS_CHECKPOINT","_SC_2_PBS_LOCATE","_SC_2_PBS_MESSAGE","_SC_2_PBS_TRACK","_SC_2_SW_DEV","_SC_2_UPE","_SC_2_VERSION","_SC_ADVISORY_INFO","_SC_AIO_LISTIO_MAX","_SC_AIO_MAX","_SC_AIO_PRIO_DELTA_MAX","_SC_ARG_MAX","_SC_ASYNCHRONOUS_IO","_SC_ATEXIT_MAX","_SC_AVPHYS_PAGES","_SC_BARRIERS","_SC_BASE","_SC_BC_BASE_MAX","_SC_BC_DIM_MAX","_SC_BC_SCALE_MAX","_SC_BC_STRING_MAX","_SC_CHARCLASS_NAME_MAX","_SC_CHAR_BIT","_SC_CHAR_MAX","_SC_CHAR_MIN","_SC_CHILD_MAX","_SC_CLK_TCK","_SC_CLOCK_SELECTION","_SC_COLL_WEIGHTS_MAX","_SC_CPUTIME","_SC_C_LANG_SUPPORT","_SC_C_LANG_SUPPORT_R","_SC_DELAYTIMER_MAX","_SC_DEVICE_IO","_SC_DEVICE_SPECIFIC","_SC_DEVICE_SPECIFIC_R","_SC_EQUIV_CLASS_MAX","_SC_EXPR_NEST_MAX","_SC_FD_MGMT","_SC_FIFO","_SC_FILE_ATTRIBUTES","_SC_FILE_LOCKING","_SC_FILE_SYSTEM","_SC_FSYNC","_SC_GETGR_R_SIZE_MAX","_SC_GETPW_R_SIZE_MAX","_SC_HOST_NAME_MAX","_SC_INT_MAX","_SC_INT_MIN","_SC_IOV_MAX","_SC_IPV6","_SC_JOB_CONTROL","_SC_LEVEL1_DCACHE_ASSOC","_SC_LEVEL1_DCACHE_LINESIZE","_SC_LEVEL1_DCACHE_SIZE","_SC_LEVEL1_ICACHE_ASSOC","_SC_LEVEL1_ICACHE_LINESIZE","_SC_LEVEL1_ICACHE_SIZE","_SC_LEVEL2_CACHE_ASSOC","_SC_LEVEL2_CACHE_LINESIZE","_SC_LEVEL2_CACHE_SIZE","_SC_LEVEL3_CACHE_ASSOC","_SC_LEVEL3_CACHE_LINESIZE","_SC_LEVEL3_CACHE_SIZE","_SC_LEVEL4_CACHE_ASSOC","_SC_LEVEL4_CACHE_LINESIZE","_SC_LEVEL4_CACHE_SIZE","_SC_LINE_MAX","_SC_LOGIN_NAME_MAX","_SC_LONG_BIT","_SC_MAPPED_FILES","_SC_MB_LEN_MAX","_SC_MEMLOCK","_SC_MEMLOCK_RANGE","_SC_MEMORY_PROTECTION","_SC_MESSAGE_PASSING","_SC_MONOTONIC_CLOCK","_SC_MQ_OPEN_MAX","_SC_MQ_PRIO_MAX","_SC_MULTI_PROCESS","_SC_NETWORKING","_SC_NGROUPS_MAX","_SC_NL_ARGMAX","_SC_NL_LANGMAX","_SC_NL_MSGMAX","_SC_NL_NMAX","_SC_NL_SETMAX","_SC_NL_TEXTMAX","_SC_NPROCESSORS_CONF","_SC_NPROCESSORS_ONLN","_SC_NZERO","_SC_OPEN_MAX","_SC_PAGESIZE","_SC_PAGE_SIZE","_SC_PASS_MAX","_SC_PHYS_PAGES","_SC_PII","_SC_PII_INTERNET","_SC_PII_INTERNET_DGRAM","_SC_PII_INTERNET_STREAM","_SC_PII_OSI","_SC_PII_OSI_CLTS","_SC_PII_OSI_COTS","_SC_PII_OSI_M","_SC_PII_SOCKET","_SC_PII_XTI","_SC_PIPE","_SC_POLL","_SC_PRIORITIZED_IO","_SC_PRIORITY_SCHEDULING","_SC_RAW_SOCKETS","_SC_READER_WRITER_LOCKS","_SC_REALTIME_SIGNALS","_SC_REGEXP","_SC_REGEX_VERSION","_SC_RE_DUP_MAX","_SC_RTSIG_MAX","_SC_SAVED_IDS","_SC_SCHAR_MAX","_SC_SCHAR_MIN","_SC_SELECT","_SC_SEMAPHORES","_SC_SEM_NSEMS_MAX","_SC_SEM_VALUE_MAX","_SC_SHARED_MEMORY_OBJECTS","_SC_SHELL","_SC_SHRT_MAX","_SC_SHRT_MIN","_SC_SIGNALS","_SC_SIGQUEUE_MAX","_SC_SINGLE_PROCESS","_SC_SPAWN","_SC_SPIN_LOCKS","_SC_SPORADIC_SERVER","_SC_SSIZE_MAX","_SC_SS_REPL_MAX","_SC_STREAMS","_SC_STREAM_MAX","_SC_SYMLOOP_MAX","_SC_SYNCHRONIZED_IO","_SC_SYSTEM_DATABASE","_SC_SYSTEM_DATABASE_R","_SC_THREADS","_SC_THREAD_ATTR_STACKADDR","_SC_THREAD_ATTR_STACKSIZE","_SC_THREAD_CPUTIME","_SC_THREAD_DESTRUCTOR_ITERATIONS","_SC_THREAD_KEYS_MAX","_SC_THREAD_PRIORITY_SCHEDULING","_SC_THREAD_PRIO_INHERIT","_SC_THREAD_PRIO_PROTECT","_SC_THREAD_PROCESS_SHARED","_SC_THREAD_ROBUST_PRIO_INHERIT","_SC_THREAD_ROBUST_PRIO_PROTECT","_SC_THREAD_SAFE_FUNCTIONS","_SC_THREAD_SPORADIC_SERVER","_SC_THREAD_STACK_MIN","_SC_THREAD_THREADS_MAX","_SC_TIMEOUTS","_SC_TIMERS","_SC_TIMER_MAX","_SC_TRACE","_SC_TRACE_EVENT_FILTER","_SC_TRACE_EVENT_NAME_MAX","_SC_TRACE_INHERIT","_SC_TRACE_LOG","_SC_TRACE_NAME_MAX","_SC_TRACE_SYS_MAX","_SC_TRACE_USER_EVENT_MAX","_SC_TTY_NAME_MAX","_SC_TYPED_MEMORY_OBJECTS","_SC_TZNAME_MAX","_SC_T_IOV_MAX","_SC_UCHAR_MAX","_SC_UINT_MAX","_SC_UIO_MAXIOV","_SC_ULONG_MAX","_SC_USER_GROUPS","_SC_USER_GROUPS_R","_SC_USHRT_MAX","_SC_V6_ILP32_OFF32","_SC_V6_ILP32_OFFBIG","_SC_V6_LP64_OFF64","_SC_V6_LPBIG_OFFBIG","_SC_V7_ILP32_OFF32","_SC_V7_ILP32_OFFBIG","_SC_V7_LP64_OFF64","_SC_V7_LPBIG_OFFBIG","_SC_VERSION","_SC_WORD_BIT","_SC_XBS5_ILP32_OFF32","_SC_XBS5_ILP32_OFFBIG","_SC_XBS5_LP64_OFF64","_SC_XBS5_LPBIG_OFFBIG","_SC_XOPEN_CRYPT","_SC_XOPEN_ENH_I18N","_SC_XOPEN_LEGACY","_SC_XOPEN_REALTIME","_SC_XOPEN_REALTIME_THREADS","_SC_XOPEN_SHM","_SC_XOPEN_STREAMS","_SC_XOPEN_UNIX","_SC_XOPEN_VERSION","_SC_XOPEN_XCU_VERSION","_SC_XOPEN_XPG2","_SC_XOPEN_XPG3","_SC_XOPEN_XPG4","__NFT_REG_MAX","__SIZEOF_PTHREAD_BARRIERATTR_T","__SIZEOF_PTHREAD_BARRIER_T","__SIZEOF_PTHREAD_CONDATTR_T","__SIZEOF_PTHREAD_COND_T","__SIZEOF_PTHREAD_MUTEXATTR_T","__SIZEOF_PTHREAD_MUTEX_T","__SIZEOF_PTHREAD_RWLOCKATTR_T","__SIZEOF_PTHREAD_RWLOCK_T","__UT_HOSTSIZE","__UT_LINESIZE","__UT_NAMESIZE","__WALL","__WCLONE","__WNOTHREAD","__c_anonymous_ifc_ifcu","__c_anonymous_ifr_ifru","__c_anonymous_ifru_map","__c_anonymous_ptrace_syscall_info_data","__c_anonymous_ptrace_syscall_info_entry","__c_anonymous_ptrace_syscall_info_exit","__c_anonymous_ptrace_syscall_info_seccomp","__c_anonymous_sockaddr_can_can_addr","__c_anonymous_sockaddr_can_j1939","__c_anonymous_sockaddr_can_tp","__errno_location","__exit_status","__fsword_t","__glibc_reserved1","__glibc_reserved2","__glibc_reserved3","__glibc_reserved4","__kernel_rwf_t","__key","__priority_which_t","__rlimit_resource_t","__s16","__s32","__s64","__seq","__statx_timestamp_pad1","__syscall_ulong_t","__timeval","__u16","__u32","__u64","__u8","__unused1","__unused10","__unused11","__unused2","__unused3","__unused4","__unused5","__unused6","__unused7","__unused8","__unused9","_exit","_f","_libc_fpstate","_libc_fpxreg","_libc_xmmreg","_st","_xmm","abort","abs","absflat","absfuzz","absinfo","absmax","absmin","accept","accept4","access","acct","actime","addmntent","addr","addr","addr","addr","addr","addr_mask","addrinfo","adjtime","adjtimex","af","af_alg_iv","ai_addr","ai_addrlen","ai_canonname","ai_family","ai_flags","ai_next","ai_protocol","ai_socktype","aio_buf","aio_buf","aio_cancel","aio_data","aio_error","aio_fildes","aio_fildes","aio_flags","aio_fsync","aio_key","aio_lio_opcode","aio_lio_opcode","aio_nbytes","aio_nbytes","aio_offset","aio_offset","aio_read","aio_reqprio","aio_reqprio","aio_resfd","aio_return","aio_rw_flags","aio_sigevent","aio_suspend","aio_write","aiocb","alarm","ar_hln","ar_hrd","ar_op","ar_pln","ar_pro","arch","arch","arena","arena","args","args","args","arp_dev","arp_flags","arp_flags","arp_ha","arp_ha","arp_netmask","arp_netmask","arp_pa","arp_pa","arpd_request","arphdr","arpreq","arpreq_old","asctime_r","atexit","atof","atoi","atol","atoll","attack_length","attack_level","auth_keynumber","backtrace","base_addr","bind","blkcnt64_t","blkcnt_t","blksize_t","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","borrow","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","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","borrow_mut","brk","bsearch","bufferram","bustype","button","c_cc","c_cc","c_cflag","c_cflag","c_char","c_double","c_float","c_iflag","c_iflag","c_int","c_ispeed","c_ispeed","c_lflag","c_lflag","c_line","c_line","c_long","c_longlong","c_oflag","c_oflag","c_ospeed","c_ospeed","c_schar","c_short","c_uchar","c_uint","c_ulong","c_ulonglong","c_ushort","c_void","calcnt","calloc","can_addr","can_dlc","can_err_mask_t","can_family","can_filter","can_frame","can_id","can_id","can_id","can_ifindex","can_mask","canfd_frame","canid_t","canxl_frame","cc_t","center","cfgetispeed","cfgetospeed","cfmakeraw","cfsetispeed","cfsetospeed","cfsetspeed","cgid","cgroup","ch_addralign","ch_addralign","ch_reserved","ch_size","ch_size","ch_type","ch_type","chdir","child_tid","chmod","chown","chroot","chunk_size","chunk_size","cipher_type","clearenv","clearerr","clock_adjtime","clock_getcpuclockid","clock_getres","clock_gettime","clock_nanosleep","clock_settime","clock_t","clockid","clockid_t","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone","clone_args","close","close_range","closedir","closelog","cmd","cmsg_len","cmsg_level","cmsg_type","cmsghdr","code","code","code","codes_ptr","codes_size","connect","constant","consumer","consumer","cookie","copy_file_range","cpu_set_t","cr","cr","creat","creat64","cs","ctermid","ctime_r","cuid","currency_symbol","custom_data","custom_len","cwd","cwd","d_ino","d_ino","d_name","d_name","d_off","d_off","d_reclen","d_reclen","d_type","d_type","daemon","data","data","data","data","deadband","decimal_point","delay","desc","desc","dest_offset","dev","dev_t","difftime","direction","dirent","dirent64","dirfd","dirname","dl_iterate_phdr","dl_phdr_info","dladdr","dladdr1","dlclose","dlerror","dli_fbase","dli_fname","dli_saddr","dli_sname","dlinfo","dlmopen","dlopen","dlpi_addr","dlpi_adds","dlpi_name","dlpi_phdr","dlpi_phnum","dlpi_subs","dlpi_tls_data","dlpi_tls_modid","dlsym","dma","domainname","dqb_bhardlimit","dqb_bsoftlimit","dqb_btime","dqb_curinodes","dqb_curspace","dqb_ihardlimit","dqb_isoftlimit","dqb_itime","dqb_valid","dqblk","drand48","ds","dup","dup2","dup3","duplocale","e_ehsize","e_ehsize","e_entry","e_entry","e_exit","e_flags","e_flags","e_ident","e_ident","e_machine","e_machine","e_phentsize","e_phentsize","e_phnum","e_phnum","e_phoff","e_phoff","e_shentsize","e_shentsize","e_shnum","e_shnum","e_shoff","e_shoff","e_shstrndx","e_shstrndx","e_termination","e_type","e_type","e_version","e_version","eaccess","ee_code","ee_data","ee_errno","ee_info","ee_origin","ee_pad","ee_type","effect","effect_id","eflags","element","end_level","endgrent","endmntent","endpwent","endservent","endspent","endutxent","entry","envelope","envelope","envelope","epoll_create","epoll_create1","epoll_ctl","epoll_event","epoll_pwait","epoll_wait","erand48","errcnt","error","error","es","esterror","esterror","euidaccess","event_len","eventfd","eventfd_read","eventfd_t","eventfd_write","events","events","execl","execle","execlp","execv","execve","execveat","execvp","execvpe","exit","exit","exit_signal","explicit_bzero","exponent","f_bavail","f_bavail","f_bavail","f_bavail","f_bfree","f_bfree","f_bfree","f_bfree","f_blocks","f_blocks","f_blocks","f_blocks","f_bsize","f_bsize","f_bsize","f_bsize","f_favail","f_favail","f_ffree","f_ffree","f_ffree","f_ffree","f_files","f_files","f_files","f_files","f_flag","f_flag","f_flags","f_frsize","f_frsize","f_frsize","f_frsize","f_fsid","f_fsid","f_fsid","f_fsid","f_namelen","f_namelen","f_namemax","f_namemax","f_spare","f_type","f_type","faccessat","fade_length","fade_level","fallocate","fallocate64","fanotify_event_metadata","fanotify_init","fanotify_mark","fanotify_response","fchdir","fchmod","fchmodat","fchown","fchownat","fclose","fcntl","fd","fd","fd","fd_set","fdatasync","fdopen","fdopendir","feof","ferror","fexecve","ff_condition_effect","ff_constant_effect","ff_effect","ff_effects_max","ff_effects_max","ff_envelope","ff_periodic_effect","ff_ramp_effect","ff_replay","ff_rumble_effect","ff_trigger","fflush","fgetc","fgetgrent_r","fgetpos","fgetpos64","fgetpwent_r","fgets","fgetspent_r","fgetxattr","file_clone_range","fileno","filter","flag","flags","flags","flags","flags","flags","flags","flags","flags","flags","flags","flags","flags","flags","flags","flags","flat","flistxattr","flock","flock","flock64","fmemopen","fmt","fop","fop","fopen","fopen64","fordblks","fordblks","fork","forkpty","fpathconf","fpos64_t","fpos_t","fpregs","fprintf","fputc","fputs","fr","fr","frac_digits","fread","fread_unlocked","free","freeaddrinfo","freehigh","freeifaddrs","freelocale","freeram","freeswap","fremovexattr","freopen","freopen64","freq","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","from","fs","fs_base","fsblkcnt_t","fscanf","fseek","fseeko","fseeko64","fsetpos","fsetpos64","fsetxattr","fsfilcnt_t","fsid_t","fsmblks","fsmblks","fstat","fstat64","fstatat","fstatat64","fstatfs","fstatfs64","fstatvfs","fstatvfs64","fsync","ftell","ftello","ftello64","ftok","ftruncate","ftruncate64","ftw","ftw","futimens","futimes","fuzz","fwrite","gai_strerror","genlmsghdr","getaddrinfo","getauxval","getchar","getchar_unlocked","getcontext","getcwd","getdomainname","getdtablesize","getegid","getentropy","getenv","geteuid","getgid","getgrent","getgrent_r","getgrgid","getgrgid_r","getgrnam","getgrnam_r","getgrouplist","getgroups","gethostid","gethostname","getifaddrs","getline","getloadavg","getlogin","getmntent","getmntent_r","getnameinfo","getopt","getopt_long","getpeername","getpgid","getpgrp","getpid","getppid","getpriority","getprotobyname","getprotobynumber","getpt","getpwent","getpwent_r","getpwnam","getpwnam_r","getpwuid","getpwuid_r","getrandom","getresgid","getresuid","getrlimit","getrlimit64","getrusage","getservbyname","getservbyport","getservent","getsid","getsockname","getsockopt","getspent","getspent_r","getspnam","getspnam_r","gettid","gettimeofday","getuid","getutxent","getutxid","getutxline","getxattr","gid","gid","gid_t","gl_flags","gl_flags","gl_offs","gl_offs","gl_pathc","gl_pathc","gl_pathv","gl_pathv","glob","glob64","glob64_t","glob_t","globfree","globfree64","gmtime","gmtime_r","gnu_basename","gnu_get_libc_release","gnu_get_libc_version","gr_gid","gr_mem","gr_name","gr_passwd","grantpt","greg_t","gregs","group","group","grouping","gs","gs_base","h_addr_list","h_addrtype","h_aliases","h_length","h_name","ha","has_arg","hasmntopt","hblkhd","hblkhd","hblks","hblks","headroom","headroom","hostent","hstrerror","hwtstamp_config","i387","iconv","iconv_close","iconv_open","iconv_t","id","id","id","id","id","id","id_t","idtype_t","if_freenameindex","if_index","if_indextoname","if_name","if_nameindex","if_nameindex","if_nametoindex","ifa_addr","ifa_data","ifa_flags","ifa_ifu","ifa_name","ifa_netmask","ifa_next","ifaddrs","ifc_ifcu","ifc_len","ifconf","ifcu_buf","ifcu_req","ifr6_addr","ifr6_ifindex","ifr6_prefixlen","ifr_ifru","ifr_name","ifreq","ifru_addr","ifru_broadaddr","ifru_data","ifru_dstaddr","ifru_flags","ifru_hwaddr","ifru_ifindex","ifru_map","ifru_metric","ifru_mtu","ifru_netmask","ifru_newname","ifru_slave","imr_address","imr_ifindex","imr_interface","imr_interface","imr_multiaddr","imr_multiaddr","imr_multiaddr","imr_sourceaddr","in6_addr","in6_ifreq","in6_pktinfo","in6_rtmsg","in_addr","in_addr_t","in_pktinfo","in_port_t","index","info","info","info","initgroups","ino64_t","ino_t","inotify_add_watch","inotify_event","inotify_init","inotify_init1","inotify_rm_watch","input_absinfo","input_event","input_id","input_keymap_entry","input_mask","instruction_pointer","instruction_pointer","int16_t","int32_t","int64_t","int8_t","int_curr_symbol","int_frac_digits","int_n_cs_precedes","int_n_sep_by_space","int_n_sign_posn","int_p_cs_precedes","int_p_sep_by_space","int_p_sign_posn","interval","intmax_t","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","into","intptr_t","iocb","ioctl","ioperm","iopl","iov_base","iov_len","iovec","ip","ip_mreq","ip_mreq_source","ip_mreqn","ipc_perm","ipi6_addr","ipi6_ifindex","ipi_addr","ipi_ifindex","ipi_spec_dst","ipv6_mreq","ipv6mr_interface","ipv6mr_multiaddr","irq","is_error","isalnum","isalpha","isatty","isblank","iscntrl","isdigit","isgraph","islower","isprint","ispunct","isspace","isupper","isxdigit","it_interval","it_interval","it_value","it_value","itimerspec","itimerval","iv","iv","iv","iv","ivlen","j1939","j1939_filter","jf","jitcnt","jitter","jrand48","jt","k","keepcost","keepcost","key","key","key","key_t","keycode","kill","killpg","l_len","l_len","l_linger","l_onoff","l_pid","l_pid","l_start","l_start","l_type","l_type","l_whence","l_whence","labs","lchown","lcong48","lconv","left_coeff","left_saturation","len","len","len","len","len","len","len","len","length","level","lgetxattr","linger","link","linkat","lio_listio","listen","listxattr","llistxattr","loads","locale_t","localeconv","localtime","localtime_r","lockf","loff_t","login_tty","lrand48","lremovexattr","lseek","lseek64","lsetxattr","lstat","lstat64","lutimes","machine","madvise","magic","magnitude","major","makecontext","makedev","mallinfo","mallinfo","mallinfo2","mallinfo2","malloc","malloc_info","malloc_trim","malloc_usable_size","mallopt","mask","mask","max_align_t","maxerror","maxerror","maximum","mcontext_t","mem_end","mem_start","mem_unit","memalign","memchr","memcmp","memcpy","memfd_create","memmem","memmove","memrchr","memset","metadata_len","mincore","minimum","minor","mkdir","mkdirat","mkdtemp","mkfifo","mkfifoat","mknod","mknodat","mkostemp","mkostemps","mkstemp","mkstemps","mktime","mlock","mlock2","mlockall","mmap","mmap64","mmsghdr","mnt_dir","mnt_freq","mnt_fsname","mnt_opts","mnt_passno","mnt_type","mntent","mode","mode","mode_t","modes","modtime","mon_decimal_point","mon_grouping","mon_thousands_sep","mount","mprotect","mq_attr","mq_close","mq_curmsgs","mq_flags","mq_getattr","mq_maxmsg","mq_msgsize","mq_open","mq_receive","mq_send","mq_setattr","mq_timedreceive","mq_timedsend","mq_unlink","mqd_t","mr_address","mr_alen","mr_ifindex","mr_type","mrand48","mremap","msg","msg_control","msg_controllen","msg_ctime","msg_flags","msg_hdr","msg_iov","msg_iovlen","msg_len","msg_lrpid","msg_lspid","msg_name","msg_namelen","msg_perm","msg_qbytes","msg_qnum","msg_rtime","msg_stime","msgctl","msgget","msghdr","msginfo","msglen_t","msgmap","msgmax","msgmnb","msgmni","msgpool","msgqnum_t","msgrcv","msgseg","msgsnd","msgssz","msgtql","msqid_ds","msync","munlock","munlockall","munmap","mxcr_mask","mxcr_mask","mxcsr","mxcsr","n_cs_precedes","n_sep_by_space","n_sign_posn","name","name","name","name","name","name_mask","name_t","nanosleep","negative_sign","newfd","newfd_flags","newlocale","nfds_t","nice","nl_family","nl_groups","nl_item","nl_langinfo","nl_langinfo_l","nl_mmap_hdr","nl_mmap_req","nl_pid","nl_pktinfo","nla_len","nla_type","nlattr","nlink_t","nlmsg_flags","nlmsg_len","nlmsg_pid","nlmsg_seq","nlmsg_type","nlmsgerr","nlmsghdr","nm_block_nr","nm_block_size","nm_frame_nr","nm_frame_size","nm_gid","nm_group","nm_len","nm_pid","nm_status","nm_uid","nodename","nr","nr","nr","nr","nrand48","ntp_adjtime","ntp_gettime","ntptimeval","nxt_assoc_id","nxt_flags","nxt_length","nxt_ppid","nxt_sid","off","off64_t","off_t","offset","offset","old","op","open","open64","open_how","open_memstream","open_wmemstream","openat","openat64","opendir","openlog","openpty","option","options","ordblks","ordblks","orig_rax","p_aliases","p_align","p_align","p_cs_precedes","p_filesz","p_filesz","p_flags","p_flags","p_memsz","p_memsz","p_name","p_offset","p_offset","p_paddr","p_paddr","p_proto","p_sep_by_space","p_sign_posn","p_type","p_type","p_vaddr","p_vaddr","packet_mreq","pad","pad","pad","parent_tid","passwd","pathconf","pause","pclose","period","perror","personality","pgn","pgn","pgn_mask","pgn_t","phase","pid","pid","pid","pid_t","pidfd","pipe","pipe2","poll","pollfd","popen","port","positive_sign","posix_basename","posix_fadvise","posix_fadvise64","posix_fallocate","posix_fallocate64","posix_madvise","posix_memalign","posix_openpt","posix_spawn","posix_spawn_file_actions_addchdir_np","posix_spawn_file_actions_addclose","posix_spawn_file_actions_addclosefrom_np","posix_spawn_file_actions_adddup2","posix_spawn_file_actions_addfchdir_np","posix_spawn_file_actions_addopen","posix_spawn_file_actions_addtcsetpgrp_np","posix_spawn_file_actions_destroy","posix_spawn_file_actions_init","posix_spawn_file_actions_t","posix_spawnattr_destroy","posix_spawnattr_getflags","posix_spawnattr_getpgroup","posix_spawnattr_getschedparam","posix_spawnattr_getschedpolicy","posix_spawnattr_getsigdefault","posix_spawnattr_getsigmask","posix_spawnattr_init","posix_spawnattr_setflags","posix_spawnattr_setpgroup","posix_spawnattr_setschedparam","posix_spawnattr_setschedpolicy","posix_spawnattr_setsigdefault","posix_spawnattr_setsigmask","posix_spawnattr_t","posix_spawnp","ppoll","ppsfreq","pr_policy","pr_value","prctl","pread","pread64","preadv","preadv2","preadv64","preadv64v2","precision","printf","prio","priority_t","prlimit","prlimit64","process_vm_readv","process_vm_writev","procs","producer","producer","product","protoent","pselect","pthread_atfork","pthread_attr_destroy","pthread_attr_getaffinity_np","pthread_attr_getguardsize","pthread_attr_getinheritsched","pthread_attr_getschedparam","pthread_attr_getschedpolicy","pthread_attr_getstack","pthread_attr_getstacksize","pthread_attr_init","pthread_attr_setaffinity_np","pthread_attr_setdetachstate","pthread_attr_setguardsize","pthread_attr_setinheritsched","pthread_attr_setschedparam","pthread_attr_setschedpolicy","pthread_attr_setstacksize","pthread_attr_t","pthread_barrier_destroy","pthread_barrier_init","pthread_barrier_t","pthread_barrier_wait","pthread_barrierattr_destroy","pthread_barrierattr_getpshared","pthread_barrierattr_init","pthread_barrierattr_setpshared","pthread_barrierattr_t","pthread_cancel","pthread_cond_broadcast","pthread_cond_destroy","pthread_cond_init","pthread_cond_signal","pthread_cond_t","pthread_cond_timedwait","pthread_cond_wait","pthread_condattr_destroy","pthread_condattr_getclock","pthread_condattr_getpshared","pthread_condattr_init","pthread_condattr_setclock","pthread_condattr_setpshared","pthread_condattr_t","pthread_create","pthread_detach","pthread_exit","pthread_getaffinity_np","pthread_getattr_np","pthread_getcpuclockid","pthread_getname_np","pthread_getschedparam","pthread_getspecific","pthread_join","pthread_key_create","pthread_key_delete","pthread_key_t","pthread_kill","pthread_mutex_consistent","pthread_mutex_destroy","pthread_mutex_init","pthread_mutex_lock","pthread_mutex_t","pthread_mutex_timedlock","pthread_mutex_trylock","pthread_mutex_unlock","pthread_mutexattr_destroy","pthread_mutexattr_getprotocol","pthread_mutexattr_getpshared","pthread_mutexattr_getrobust","pthread_mutexattr_init","pthread_mutexattr_setprotocol","pthread_mutexattr_setpshared","pthread_mutexattr_setrobust","pthread_mutexattr_settype","pthread_mutexattr_t","pthread_once","pthread_once_t","pthread_rwlock_destroy","pthread_rwlock_init","pthread_rwlock_rdlock","pthread_rwlock_t","pthread_rwlock_tryrdlock","pthread_rwlock_trywrlock","pthread_rwlock_unlock","pthread_rwlock_wrlock","pthread_rwlockattr_destroy","pthread_rwlockattr_getkind_np","pthread_rwlockattr_getpshared","pthread_rwlockattr_init","pthread_rwlockattr_setkind_np","pthread_rwlockattr_setpshared","pthread_rwlockattr_t","pthread_self","pthread_setaffinity_np","pthread_setname_np","pthread_setschedparam","pthread_setschedprio","pthread_setspecific","pthread_sigmask","pthread_sigqueue","pthread_spin_destroy","pthread_spin_init","pthread_spin_lock","pthread_spin_trylock","pthread_spin_unlock","pthread_spinlock_t","pthread_t","ptrace","ptrace_peeksiginfo_args","ptrace_rseq_configuration","ptrace_syscall_info","ptrdiff_t","ptsname","ptsname_r","putchar","putchar_unlocked","putenv","putgrent","putpwent","puts","pututxline","pw_dir","pw_gecos","pw_gid","pw_name","pw_passwd","pw_shell","pw_uid","pwrite","pwrite64","pwritev","pwritev2","pwritev64","pwritev64v2","qsort","qsort_r","quotactl","r10","r11","r12","r13","r14","r15","r8","r9","raise","rand","rax","rbp","rbx","rcv_assoc_id","rcv_context","rcv_cumtsn","rcv_flags","rcv_ppid","rcv_sid","rcv_ssn","rcv_tsn","rcx","rdi","rdp","rdp","rdx","read","readahead","readdir","readdir64","readdir64_r","readdir_r","readlink","readlinkat","readv","realloc","reallocarray","realpath","reboot","rec_seq","rec_seq","rec_seq","recv","recvfrom","recvmmsg","recvmsg","regcomp","regerror","regex_t","regexec","regfree","regmatch_t","regoff_t","regs","release","remap_file_pages","remove","removexattr","rename","renameat","renameat2","replay","req","request_id","request_id","res_init","reserved","reserved","resolution","resolve","response","ret_data","retval","retval","revents","rewind","rewinddir","right_coeff","right_saturation","rip","rip","rip","rlim64_t","rlim_cur","rlim_cur","rlim_max","rlim_max","rlim_t","rlimit","rlimit64","rm_eo","rm_so","rmdir","rseq_abi_pointer","rseq_abi_size","rsi","rsp","rt_class","rt_dev","rt_dst","rt_flags","rt_gateway","rt_genmask","rt_irtt","rt_metric","rt_mtu","rt_pad1","rt_pad2","rt_pad3","rt_pad4","rt_tos","rt_window","rtentry","ru_idrss","ru_inblock","ru_isrss","ru_ixrss","ru_majflt","ru_maxrss","ru_minflt","ru_msgrcv","ru_msgsnd","ru_nivcsw","ru_nsignals","ru_nswap","ru_nvcsw","ru_oublock","ru_stime","ru_utime","rusage","rx","rx","rx_dropped","rx_dropped","rx_fill_ring_empty_descs","rx_filter","rx_id","rx_invalid_descs","rx_invalid_descs","rx_ring_full","s6_addr","s_addr","s_aliases","s_name","s_port","s_proto","sa_data","sa_family","sa_family_t","sa_flags","sa_mask","sa_restorer","sa_sigaction","salg_family","salg_feat","salg_mask","salg_name","salg_type","salt","salt","salt","sbrk","scancode","scanf","sched_attr","sched_deadline","sched_flags","sched_get_priority_max","sched_get_priority_min","sched_getaffinity","sched_getcpu","sched_getparam","sched_getscheduler","sched_nice","sched_param","sched_period","sched_policy","sched_priority","sched_priority","sched_rr_get_interval","sched_runtime","sched_setaffinity","sched_setparam","sched_setscheduler","sched_yield","sctp_assoc_t","sctp_authinfo","sctp_initmsg","sctp_nxtinfo","sctp_prinfo","sctp_rcvinfo","sctp_sndinfo","sctp_sndrcvinfo","sdt","seccomp","seccomp_data","seccomp_data","seccomp_notif","seccomp_notif","seccomp_notif_addfd","seccomp_notif_resp","seccomp_notif_resp","seccomp_notif_sizes","seed48","seekdir","select","sem_close","sem_ctime","sem_destroy","sem_flg","sem_getvalue","sem_init","sem_nsems","sem_num","sem_op","sem_open","sem_otime","sem_perm","sem_post","sem_t","sem_timedwait","sem_trywait","sem_unlink","sem_wait","semaem","sembuf","semctl","semget","semid_ds","seminfo","semmap","semmni","semmns","semmnu","semmsl","semop","semopm","semume","semusz","semvmx","send","sendfile","sendfile64","sendmmsg","sendmsg","sendto","servent","set_tid","set_tid_size","setbuf","setcontext","setdomainname","setegid","setenv","seteuid","setfsgid","setfsuid","setgid","setgrent","setgroups","sethostid","sethostname","setlocale","setlogmask","setmntent","setns","setpgid","setpriority","setpwent","setregid","setresgid","setresuid","setreuid","setrlimit","setrlimit64","setservent","setsid","setsockopt","setspent","settimeofday","setuid","setutxent","setvbuf","setxattr","sgetspent_r","sh_addr","sh_addr","sh_addralign","sh_addralign","sh_entsize","sh_entsize","sh_flags","sh_flags","sh_info","sh_info","sh_link","sh_link","sh_name","sh_name","sh_offset","sh_offset","sh_size","sh_size","sh_type","sh_type","sharedram","shift","shm_atime","shm_cpid","shm_ctime","shm_dtime","shm_lpid","shm_nattch","shm_open","shm_perm","shm_segsz","shm_unlink","shmat","shmatt_t","shmctl","shmdt","shmget","shmid_ds","shutdown","si_addr","si_code","si_errno","si_pid","si_signo","si_status","si_stime","si_uid","si_utime","si_value","sigaction","sigaction","sigaddset","sigaltstack","sigdelset","sigemptyset","sigev_notify","sigev_notify_thread_id","sigev_signo","sigev_value","sigevent","sigfillset","sighandler_t","siginfo_t","sigismember","signal","signal","signalfd","signalfd_siginfo","signature","significand","sigpending","sigprocmask","sigset_t","sigsuspend","sigtimedwait","sigval","sigwait","sigwaitinfo","sin6_addr","sin6_family","sin6_flowinfo","sin6_port","sin6_scope_id","sin_addr","sin_family","sin_port","sin_zero","sinfo_assoc_id","sinfo_context","sinfo_cumtsn","sinfo_flags","sinfo_ppid","sinfo_ssn","sinfo_stream","sinfo_timetolive","sinfo_tsn","sinit_max_attempts","sinit_max_init_timeo","sinit_max_instreams","sinit_num_ostreams","sival_ptr","size","size_t","sleep","sll_addr","sll_family","sll_halen","sll_hatype","sll_ifindex","sll_pkttype","sll_protocol","smblks","smblks","snd_assoc_id","snd_context","snd_flags","snd_ppid","snd_sid","snprintf","sock_extended_err","sock_filter","sock_fprog","sock_txtime","sockaddr","sockaddr_alg","sockaddr_can","sockaddr_in","sockaddr_in6","sockaddr_ll","sockaddr_nl","sockaddr_storage","sockaddr_un","sockaddr_vm","sockaddr_xdp","socket","socketpair","socklen_t","sp_expire","sp_flag","sp_inact","sp_lstchg","sp_max","sp_min","sp_namp","sp_pwdp","sp_warn","speed_t","splice","sprintf","spwd","srand","srand48","src_fd","src_length","src_offset","srcfd","ss","ss_family","ss_flags","ss_size","ss_sp","sscanf","ssi_addr","ssi_addr_lsb","ssi_arch","ssi_band","ssi_call_addr","ssi_code","ssi_errno","ssi_fd","ssi_int","ssi_overrun","ssi_pid","ssi_ptr","ssi_signo","ssi_status","ssi_stime","ssi_syscall","ssi_tid","ssi_trapno","ssi_uid","ssi_utime","ssize_t","st_atime","st_atime","st_atime_nsec","st_atime_nsec","st_blksize","st_blksize","st_blocks","st_blocks","st_ctime","st_ctime","st_ctime_nsec","st_ctime_nsec","st_dev","st_dev","st_gid","st_gid","st_info","st_info","st_ino","st_ino","st_mode","st_mode","st_mtime","st_mtime","st_mtime_nsec","st_mtime_nsec","st_name","st_name","st_nlink","st_nlink","st_other","st_other","st_rdev","st_rdev","st_shndx","st_shndx","st_size","st_size","st_size","st_size","st_space","st_uid","st_uid","st_value","st_value","stabil","stack","stack_pointer","stack_size","stack_t","stamp","start_code","start_level","start_stack","stat","stat","stat64","stat64","statfs","statfs","statfs64","statfs64","status","statvfs","statvfs","statvfs64","statvfs64","statx","statx","statx_timestamp","stbcnt","stpcpy","stpncpy","strcasecmp","strcasestr","strcat","strchr","strchrnul","strcmp","strcoll","strcpy","strcspn","strdup","strerror","strerror_r","strftime","strftime_l","strlen","strncasecmp","strncat","strncmp","strncpy","strndup","strnlen","strong_magnitude","strpbrk","strptime","strrchr","strsignal","strspn","strstr","strtod","strtof","strtok","strtok_r","strtol","strtoll","strtoul","strtoull","strxfrm","stx_atime","stx_attributes","stx_attributes_mask","stx_blksize","stx_blocks","stx_btime","stx_ctime","stx_dev_major","stx_dev_minor","stx_dio_mem_align","stx_dio_offset_align","stx_gid","stx_ino","stx_mask","stx_mnt_id","stx_mode","stx_mtime","stx_nlink","stx_rdev_major","stx_rdev_minor","stx_size","stx_uid","sun_family","sun_path","suseconds_t","sval","svm_cid","svm_family","svm_port","svm_reserved1","svm_zero","swapcontext","swapoff","swapon","swd","swd","sxdp_family","sxdp_flags","sxdp_ifindex","sxdp_queue_id","sxdp_shared_umem_fd","symlink","symlinkat","sync","sync_file_range","syncfs","syscall","sysconf","sysctl","sysinfo","sysinfo","syslog","sysname","system","tai","tai","tcdrain","tcflag_t","tcflow","tcflush","tcgetattr","tcgetpgrp","tcgetsid","tcsendbreak","tcsetattr","tcsetpgrp","tee","telldir","termios","termios2","thousands_sep","tick","time","time","time","time","time_t","timegm","timer_create","timer_delete","timer_getoverrun","timer_gettime","timer_settime","timer_t","timerfd_create","timerfd_gettime","timerfd_settime","times","timespec","timeval","timex","timezone","tls","tls12_crypto_info_aes_gcm_128","tls12_crypto_info_aes_gcm_256","tls12_crypto_info_chacha20_poly1305","tls_crypto_info","tm","tm_gmtoff","tm_hour","tm_isdst","tm_mday","tm_min","tm_mon","tm_sec","tm_wday","tm_yday","tm_year","tm_zone","tmpfile","tmpfile64","tmpnam","tms","tms_cstime","tms_cutime","tms_stime","tms_utime","tolerance","tolower","totalhigh","totalram","totalswap","toupper","tp","trigger","truncate","truncate64","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_from","try_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_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","try_into","ttyname","ttyname_r","tv_nsec","tv_nsec","tv_sec","tv_sec","tv_sec","tv_sec","tv_usec","tv_usec","tx","tx","tx_id","tx_invalid_descs","tx_invalid_descs","tx_ring_empty_descs","tx_type","type_","type_","type_","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","type_id","u","u","u64","u_ar0","u_comm","u_debugreg","u_dsize","u_fpstate","u_fpvalid","u_ssize","u_tsize","uc_flags","uc_link","uc_mcontext","uc_sigmask","uc_stack","ucontext_t","ucred","uid","uid","uid_t","uinput_abs_setup","uinput_ff_erase","uinput_ff_upload","uinput_setup","uinput_user_dev","uint16_t","uint32_t","uint64_t","uint8_t","uintmax_t","uintptr_t","umask","umount","umount2","uname","ungetc","unlink","unlinkat","unlockpt","unsetenv","unshare","uordblks","uordblks","updated","uptime","useconds_t","uselocale","user","user_fpregs_struct","user_regs_struct","usleep","usmblks","usmblks","ut_addr_v6","ut_exit","ut_host","ut_id","ut_line","ut_pid","ut_session","ut_tv","ut_type","ut_user","utimbuf","utime","utimensat","utimes","utmpname","utmpx","utmpxname","utsname","val","val","value","value","vendor","vers","version","version","version","version","vfork","vhangup","vmsplice","wait","wait4","waitid","waitpid","waveform","wchar_t","wcslen","wcstombs","wd","weak_magnitude","winsize","wmemchr","write","writev","ws_col","ws_row","ws_xpixel","ws_ypixel","xdp_desc","xdp_mmap_offsets","xdp_mmap_offsets_v1","xdp_options","xdp_ring_offset","xdp_ring_offset_v1","xdp_statistics","xdp_statistics_v1","xdp_umem_reg","xdp_umem_reg_v1","xmm_space"],"q":[[0,"libc"],[9172,"core::fmt"],[9173,"core::fmt"],[9174,"core::any"]],"d":["","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","maximum number of services provided on the same listening …","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","IP6 Auth Header","","IP Payload Comp. Protocol","DCCP","IP6 destination option","exterior gateway protocol","encapsulation header","IP6 Encap Sec. Payload","Ethernet-within-IPv6 encapsulation.","IP6 fragmentation header","General Routing Encap.","Hop-by-hop option header","","","xns idp","group mgmt protocol","","for compatibility","","","","","Multipath TCP","","IP6 no next header","Protocol indep. multicast","pup","raw IP packet","IP6 routing header","resource reservation","SCTP","","tp-4 w/ class negotiation","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","WARNING: The PartialEq, Eq and Hash implementations of this","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","Equivalent to C’s void type when used as a pointer.","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","Returns the argument unchanged.","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","GNU version of basename(3), defined in string.h.","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","interface name, e.g. “en0”","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","Calls U::from(self).","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","POSIX version of basename(3), defined in libgen.h.","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","The 64-bit libc on Solaris and illumos only has readdir_r. …","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","",""],"i":[0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,167,167,167,167,0,212,0,0,0,0,0,212,154,0,0,0,0,0,0,166,166,166,166,166,166,166,166,166,166,166,0,192,0,0,0,208,208,0,0,140,140,88,140,140,0,0,0,0,21,0,108,110,182,183,187,110,0,0,0,233,0,43,43,43,43,43,43,43,43,155,188,0,188,0,155,188,188,0,188,155,188,155,188,155,188,0,155,188,188,0,188,155,0,0,0,0,54,54,54,54,54,112,176,160,161,112,173,175,52,52,53,52,53,52,53,52,53,0,0,0,0,0,0,0,0,0,0,79,79,130,0,121,0,0,0,0,245,20,21,22,23,24,25,26,27,28,29,30,31,32,33,34,35,36,246,247,248,37,38,39,40,19,41,42,43,44,15,45,46,47,48,49,50,51,52,53,54,55,56,57,58,59,60,249,61,62,63,64,65,66,67,68,12,69,70,71,72,73,74,236,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,18,107,108,109,110,4,111,112,113,114,115,116,117,118,119,120,121,122,123,124,125,126,127,128,129,130,131,132,133,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,7,5,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,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,245,20,21,22,23,24,25,26,27,28,29,30,31,32,33,34,35,36,246,247,248,37,38,39,40,19,41,42,43,44,15,45,46,47,48,49,50,51,52,53,54,55,56,57,58,59,60,249,61,62,63,64,65,66,67,68,12,69,70,71,72,73,74,236,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,18,107,108,109,110,4,111,112,113,114,115,116,117,118,119,120,121,122,123,124,125,126,127,128,129,130,131,132,133,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,7,5,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,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,0,0,192,73,78,159,221,159,221,0,0,0,159,221,0,159,221,159,221,159,221,0,0,159,221,159,221,0,0,0,0,0,0,0,0,166,0,152,231,0,152,0,0,109,231,232,152,109,0,0,0,0,82,0,0,0,0,0,0,212,219,169,170,169,169,170,169,170,0,219,0,0,0,182,183,132,0,0,0,0,0,0,0,0,0,150,0,0,20,21,22,23,24,25,26,27,28,29,30,31,32,33,34,35,36,37,38,39,40,19,41,42,43,44,15,45,46,47,48,49,50,51,52,53,54,55,56,57,58,59,60,61,62,63,64,65,66,67,68,12,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,18,107,108,109,110,4,111,112,113,114,115,116,117,118,119,120,121,122,123,124,125,126,127,128,129,130,131,132,133,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,7,5,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,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,0,0,0,0,0,100,5,5,5,0,72,88,4,76,76,0,166,178,180,103,0,0,179,181,0,0,209,0,0,212,48,83,83,208,215,137,148,137,148,137,148,137,148,137,148,0,114,231,232,233,82,48,77,178,180,120,102,0,0,85,0,0,0,0,0,0,0,0,0,0,47,47,47,47,0,0,0,89,89,89,89,89,89,89,89,0,121,59,64,64,64,64,64,64,64,64,64,0,0,209,0,0,0,0,90,91,90,91,156,90,91,90,91,90,91,90,91,90,91,90,91,90,91,90,91,90,91,90,91,156,90,91,90,91,0,18,18,18,18,18,18,18,86,87,209,207,81,0,0,0,0,0,0,189,80,81,83,0,0,0,0,0,0,0,166,115,118,209,166,167,0,226,0,0,0,0,29,56,0,0,0,0,0,0,0,0,0,189,219,0,206,196,203,204,217,196,203,204,217,196,203,204,217,196,203,204,217,204,217,196,203,204,217,196,203,204,217,204,217,203,196,203,204,217,196,203,204,217,196,203,204,217,203,196,203,0,79,79,0,0,0,0,0,0,0,0,0,0,0,0,0,29,104,226,0,0,0,0,0,0,0,0,0,0,139,140,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,111,123,75,114,115,116,147,150,172,178,182,186,214,219,232,233,234,74,0,0,0,0,0,236,208,215,0,0,160,161,0,0,0,0,0,211,0,0,0,179,181,48,0,0,0,0,192,0,0,192,192,0,0,0,166,245,20,21,22,23,24,25,26,27,28,29,30,31,32,33,34,35,36,246,247,248,37,38,39,40,19,41,42,43,44,15,45,46,47,48,49,50,51,52,53,54,55,56,57,58,59,60,249,61,62,63,64,65,66,67,68,12,69,70,71,72,73,74,236,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,18,107,108,109,110,4,111,112,113,114,115,116,117,118,119,120,121,122,123,124,125,126,127,128,129,130,131,132,133,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,7,5,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,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,209,209,0,0,0,0,0,0,0,0,0,0,160,161,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,208,215,0,0,74,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,98,212,0,61,158,61,158,61,158,61,158,0,0,0,0,0,0,0,0,0,0,0,20,20,20,20,0,0,211,0,162,48,209,209,27,27,27,27,27,102,123,0,160,161,160,161,182,183,0,0,0,210,0,0,0,0,85,114,115,116,139,140,0,0,0,69,0,69,0,0,0,50,50,50,50,50,50,50,0,146,146,0,145,145,122,122,122,144,144,0,143,143,143,143,143,143,143,143,143,143,143,143,143,39,39,38,40,38,39,40,40,0,0,0,0,0,0,0,0,75,133,134,135,0,0,0,0,0,0,0,0,0,0,0,0,0,112,176,0,0,0,0,48,48,48,48,48,48,48,48,78,0,245,20,21,22,23,24,25,26,27,28,29,30,31,32,33,34,35,36,246,247,248,37,38,39,40,19,41,42,43,44,15,45,46,47,48,49,50,51,52,53,54,55,56,57,58,59,60,249,61,62,63,64,65,66,67,68,12,69,70,71,72,73,74,236,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,18,107,108,109,110,4,111,112,113,114,115,116,117,118,119,120,121,122,123,124,125,126,127,128,129,130,131,132,133,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,7,5,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,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,0,0,0,0,0,28,28,0,102,0,0,0,0,101,101,49,49,49,0,26,26,121,174,0,0,0,0,0,0,0,0,0,0,0,0,0,33,66,33,66,0,0,133,134,135,141,141,151,0,4,166,166,0,4,4,160,161,133,134,135,0,75,0,0,197,198,31,31,197,198,197,198,197,198,197,198,0,0,0,0,82,82,75,103,111,182,183,187,232,233,77,80,0,0,0,0,0,0,0,0,192,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,59,0,210,83,0,0,0,0,0,0,0,0,0,0,0,0,103,226,0,166,167,74,0,121,121,192,0,0,0,0,0,0,0,0,0,226,0,74,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,99,99,99,99,99,99,0,212,234,0,166,21,48,48,48,0,0,0,0,142,142,0,142,142,0,0,0,0,0,0,0,0,68,68,68,68,0,0,118,7,7,193,7,55,7,7,55,193,193,7,7,193,193,193,193,193,0,0,0,0,0,70,70,70,70,70,0,0,70,0,70,70,0,0,0,0,0,208,215,208,215,48,48,48,108,110,123,139,140,110,0,0,48,116,116,0,0,0,136,136,0,0,0,0,0,136,0,119,119,0,0,117,117,117,117,117,0,0,163,163,163,163,164,164,164,164,164,164,59,112,172,173,175,0,0,0,0,128,128,128,128,128,172,0,0,83,166,86,176,0,0,0,0,0,0,0,0,0,0,0,187,160,161,209,36,94,95,48,94,95,94,95,94,95,36,94,95,94,95,36,48,48,94,95,94,95,0,176,192,214,219,0,0,0,0,83,0,0,108,110,110,0,83,98,114,226,0,219,0,0,0,0,0,121,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,0,0,0,0,0,0,0,166,129,129,0,0,0,0,0,0,0,166,0,233,0,0,0,0,0,192,178,180,73,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,62,62,62,62,62,62,62,0,0,0,0,0,0,0,0,0,209,209,209,209,209,209,209,209,0,0,209,209,209,127,127,127,127,127,127,127,127,209,209,208,215,209,0,0,0,0,0,0,0,0,0,0,0,0,0,133,134,135,0,0,0,0,0,0,0,0,0,0,0,210,59,0,0,0,0,0,0,85,102,86,87,0,100,226,74,234,104,175,86,87,29,0,0,82,82,208,209,215,0,24,131,24,131,0,0,0,106,106,0,214,214,209,209,165,165,165,165,165,165,165,165,165,165,165,165,165,165,165,0,25,25,25,25,25,25,25,25,25,25,25,25,25,25,25,25,0,179,181,184,185,184,147,107,184,185,184,235,37,35,35,35,35,19,19,0,195,195,195,195,138,138,138,138,138,133,134,135,0,75,0,0,149,149,0,0,0,0,0,0,149,0,149,149,46,149,0,149,0,0,0,0,0,0,0,0,0,0,0,0,233,189,0,113,0,113,0,0,113,0,0,0,0,0,194,0,71,0,0,194,71,71,0,194,194,0,0,0,0,0,0,171,0,0,0,0,0,171,171,171,171,171,0,171,171,171,171,0,0,0,0,0,0,0,219,219,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,96,97,96,97,96,97,96,97,96,97,96,97,96,97,96,97,96,97,96,97,192,166,213,213,213,213,213,213,0,213,213,0,0,0,0,0,0,0,0,199,199,199,199,199,199,199,199,199,199,0,0,0,0,0,0,60,60,60,60,0,0,0,0,0,0,210,0,0,214,206,0,0,0,0,0,0,0,0,42,42,42,42,42,41,41,41,41,125,125,125,125,125,125,125,125,125,124,124,124,124,32,149,0,0,44,44,44,44,44,44,44,160,161,126,126,126,126,126,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,63,63,63,63,63,63,63,63,63,0,0,0,0,0,0,120,120,120,116,209,58,200,200,200,0,65,65,65,65,65,65,65,65,65,65,65,65,65,65,65,65,65,65,65,65,0,201,202,201,202,201,202,201,202,201,202,201,202,201,202,201,202,92,93,201,202,201,202,201,202,201,202,92,93,201,202,92,93,201,202,92,93,92,93,201,202,215,201,202,92,93,166,219,176,219,0,102,210,81,210,0,0,0,0,0,0,0,0,166,0,0,0,0,0,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,84,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,153,153,153,153,153,153,153,153,153,153,153,153,153,153,153,153,153,153,153,153,153,153,57,57,0,174,105,105,105,105,105,0,0,0,208,215,177,177,177,177,177,0,0,0,0,0,0,0,0,0,0,0,59,0,166,167,0,0,0,0,0,0,0,0,0,0,0,0,0,0,48,166,0,72,166,167,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,219,0,0,0,0,0,45,45,45,45,45,45,45,45,45,45,45,0,0,0,0,34,34,34,34,166,0,192,192,192,0,151,85,0,0,245,20,21,22,23,24,25,26,27,28,29,30,31,32,33,34,35,36,246,247,248,37,38,39,40,19,41,42,43,44,15,45,46,47,48,49,50,51,52,53,54,55,56,57,58,59,60,249,61,62,63,64,65,66,67,68,12,69,70,71,72,73,74,236,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,18,107,108,109,110,4,111,112,113,114,115,116,117,118,119,120,121,122,123,124,125,126,127,128,129,130,131,132,133,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,7,5,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,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,245,20,21,22,23,24,25,26,27,28,29,30,31,32,33,34,35,36,246,247,248,37,38,39,40,19,41,42,43,44,15,45,46,47,48,49,50,51,52,53,54,55,56,57,58,59,60,249,61,62,63,64,65,66,67,68,12,69,70,71,72,73,74,236,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,18,107,108,109,110,4,111,112,113,114,115,116,117,118,119,120,121,122,123,124,125,126,127,128,129,130,131,132,133,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,7,5,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,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,0,0,23,154,22,23,154,157,22,157,179,181,107,184,185,184,147,72,76,85,245,20,21,22,23,24,25,26,27,28,29,30,31,32,33,34,35,36,246,247,248,37,38,39,40,19,41,42,43,44,15,45,46,47,48,49,50,51,52,53,54,55,56,57,58,59,60,249,61,62,63,64,65,66,67,68,12,69,70,71,72,73,74,236,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,18,107,108,109,110,4,111,112,113,114,115,116,117,118,119,120,121,122,123,124,125,126,127,128,129,130,131,132,133,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,7,5,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,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,85,176,56,210,210,210,210,210,210,210,210,216,216,216,216,216,0,0,98,212,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,160,161,102,192,0,0,0,0,0,0,160,161,190,190,190,190,190,190,190,190,190,190,0,0,0,0,0,0,0,0,115,123,72,74,73,226,59,73,100,132,0,0,0,0,0,0,0,83,0,0,0,103,84,0,0,0,0,30,30,30,30,0,0,0,0,0,0,0,0,0,0,215],"f":"``````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````{{bdff}h}``````````{dd}````````0`{{bd}h}``````````````````````````````````````````````````````````````````````````````````````````````````````````````````{jl}{nj}{A`A`}{{nj}j}1```{AbAd}{{AfAh}Aj}{AhAb}{{AfAh}Ab}{{AhAh}Al}{{AfAh}Al}4`{AhAj}`````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````{{AbAn}Aj}{{AbAn}Al}1`{AnAj}`````````````````````````````````````{{AbAbAbAb}Ab}````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````{B`B`}``0````````0```````````````````````````````````````````````````0```````0```````````0```````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````{{BbBbBb}Bb}`````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````{AbAb}`````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````{{AbAb}Ab}```````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````{BbBb}`````{BbAl}``````````5```````````````````````````````````````````````````````````````````````````````````````````````````33{AbAl}0```````{{AbAb}Aj}1```````````````````````````````````````````````````````````````````````````````````````{{}Ab}0`````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````{BdBf}```````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````3`7`3333````77`6`7````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````{ce{}{}}0000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000````````````````````````````````````````````````````````````````````````````````````````{BhBh}{BjBj}{BlBl}{BnBn}{C`C`}{CbCb}{CdCd}{CfCf}{ChCh}{CjCj}{ClCl}{CnCn}{D`D`}{DbDb}{DdDd}{DfDf}{DhDh}{DjDj}{DlDl}{DnDn}{E`E`}{BfBf}{EbEb}{EdEd}{EfEf}{EhEh}{AnAn}{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}{AhAh}{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}{BdBd}{MfMf}{MhMh}{MjMj}{MlMl}{hh}{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}{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}{nn}{jj}{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}{AGjAGj}{AGlAGl}{AGnAGn}{AH`AH`}{AHbAHb}{AHdAHd}{AHfAHf}{AHhAHh}{AHjAHj}{AHlAHl}{AHnAHn}{AI`AI`}{AIbAIb}{AIdAId}{AIfAIf}{AIhAIh}{AIjAIj}{AIlAIl}{AInAIn}{AJ`AJ`}{AJbAJb}{AJdAJd}{AJfAJf}{AJhAJh}{AJjAJj}{AJlAJl}{AJnAJn}{AK`AK`}{AKbAKb}{AKdAKd}{AKfAKf}{AKhAKh}{AKjAKj}{AKlAKl}{AKnAKn}{AL`AL`}{ALbALb}{ALdALd}{ALfALf}{ALhALh}{ALjALj}{ALlALl}{ALnALn}{AM`AM`}{AMbAMb}{AMdAMd}{AMfAMf}``````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````{{AMhAMj}{{AMn{AjAMl}}}}```````````````````````````````{cc{}}000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000```````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````{ce{}{}}000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````{AN`A`}`{{A`A`}AN`}```````````````````````````````1`````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````{AHnAMh}``{AHnANb}`{AHnAb}{AHnANd}{AHnANf}1{AHnD`}```````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````{c{{AMn{e}}}{}{}}0000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000````````````````````{cANh{}}000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000``````````````````````````````````````````````````````````````````````````````````````````````````````````````````","c":[732,1444,3277,3286,3745,4742,5162,6819,6820,6821,6822,7107,7108,9084,9085,9086,9087,9140],"p":[[8,"__u16",0],[8,"__u32",0],[8,"__u8",0],[5,"sock_filter",0],[5,"cmsghdr",0],[8,"c_uchar",0],[5,"msghdr",0],[8,"c_uint",0],[8,"c_int",0],[8,"size_t",0],[1,"usize"],[5,"cpu_set_t",0],[1,"unit"],[1,"bool"],[5,"fd_set",0],[1,"u8"],[1,"u32"],[5,"sock_extended_err",0],[5,"sockaddr",0],[5,"group",0],[5,"utimbuf",0],[5,"timeval",0],[5,"timespec",0],[5,"rlimit",0],[5,"rusage",0],[5,"ipv6_mreq",0],[5,"hostent",0],[5,"iovec",0],[5,"pollfd",0],[5,"winsize",0],[5,"linger",0],[5,"sigval",0],[5,"itimerval",0],[5,"tms",0],[5,"servent",0],[5,"protoent",0],[5,"in_addr",0],[5,"ip_mreq",0],[5,"ip_mreqn",0],[5,"ip_mreq_source",0],[5,"sockaddr_in",0],[5,"sockaddr_in6",0],[5,"addrinfo",0],[5,"sockaddr_ll",0],[5,"tm",0],[5,"sched_param",0],[5,"Dl_info",0],[5,"lconv",0],[5,"in_pktinfo",0],[5,"ifaddrs",0],[5,"in6_rtmsg",0],[5,"arpreq",0],[5,"arpreq_old",0],[5,"arphdr",0],[5,"mmsghdr",0],[5,"epoll_event",0],[5,"sockaddr_un",0],[5,"sockaddr_storage",0],[5,"utsname",0],[5,"sigevent",0],[5,"glob_t",0],[5,"passwd",0],[5,"spwd",0],[5,"dqblk",0],[5,"signalfd_siginfo",0],[5,"itimerspec",0],[5,"fsid_t",0],[5,"packet_mreq",0],[5,"if_nameindex",0],[5,"msginfo",0],[5,"sembuf",0],[5,"input_event",0],[5,"input_id",0],[5,"input_absinfo",0],[5,"input_keymap_entry",0],[5,"input_mask",0],[5,"ff_replay",0],[5,"ff_trigger",0],[5,"ff_envelope",0],[5,"ff_constant_effect",0],[5,"ff_ramp_effect",0],[5,"ff_condition_effect",0],[5,"ff_periodic_effect",0],[5,"ff_rumble_effect",0],[5,"ff_effect",0],[5,"uinput_ff_upload",0],[5,"uinput_ff_erase",0],[5,"uinput_abs_setup",0],[5,"dl_phdr_info",0],[5,"Elf32_Ehdr",0],[5,"Elf64_Ehdr",0],[5,"Elf32_Sym",0],[5,"Elf64_Sym",0],[5,"Elf32_Phdr",0],[5,"Elf64_Phdr",0],[5,"Elf32_Shdr",0],[5,"Elf64_Shdr",0],[5,"ucred",0],[5,"mntent",0],[5,"genlmsghdr",0],[5,"in6_pktinfo",0],[5,"arpd_request",0],[5,"inotify_event",0],[5,"fanotify_response",0],[5,"sockaddr_vm",0],[5,"regmatch_t",0],[5,"__c_anonymous_sockaddr_can_tp",0],[5,"__c_anonymous_sockaddr_can_j1939",0],[5,"can_filter",0],[5,"j1939_filter",0],[5,"sock_fprog",0],[5,"seccomp_data",0],[5,"seccomp_notif_sizes",0],[5,"seccomp_notif",0],[5,"seccomp_notif_resp",0],[5,"seccomp_notif_addfd",0],[5,"nlmsghdr",0],[5,"nlmsgerr",0],[5,"nlattr",0],[5,"file_clone_range",0],[5,"__c_anonymous_ifru_map",0],[5,"in6_ifreq",0],[5,"option",0],[5,"sctp_initmsg",0],[5,"sctp_sndrcvinfo",0],[5,"sctp_sndinfo",0],[5,"sctp_rcvinfo",0],[5,"sctp_nxtinfo",0],[5,"sctp_prinfo",0],[5,"sctp_authinfo",0],[5,"rlimit64",0],[5,"tls_crypto_info",0],[5,"tls12_crypto_info_aes_gcm_128",0],[5,"tls12_crypto_info_aes_gcm_256",0],[5,"tls12_crypto_info_chacha20_poly1305",0],[5,"sockaddr_nl",0],[5,"dirent",0],[5,"sockaddr_alg",0],[5,"uinput_setup",0],[5,"uinput_user_dev",0],[5,"af_alg_iv",0],[5,"mq_attr",0],[20,"__c_anonymous_ifr_ifru",0],[5,"ifreq",0],[20,"__c_anonymous_ifc_ifcu",0],[5,"ifconf",0],[5,"hwtstamp_config",0],[5,"dirent64",0],[5,"sched_attr",0],[5,"sock_txtime",0],[20,"__c_anonymous_sockaddr_can_can_addr",0],[5,"sockaddr_can",0],[5,"statx",0],[5,"statx_timestamp",0],[5,"aiocb",0],[5,"__exit_status",0],[5,"__timeval",0],[5,"glob64_t",0],[5,"termios",0],[5,"mallinfo",0],[5,"mallinfo2",0],[5,"nl_pktinfo",0],[5,"nl_mmap_req",0],[5,"nl_mmap_hdr",0],[5,"rtentry",0],[5,"timex",0],[5,"ntptimeval",0],[5,"regex_t",0],[5,"Elf64_Chdr",0],[5,"Elf32_Chdr",0],[5,"seminfo",0],[5,"ptrace_peeksiginfo_args",0],[5,"__c_anonymous_ptrace_syscall_info_entry",0],[5,"__c_anonymous_ptrace_syscall_info_exit",0],[5,"__c_anonymous_ptrace_syscall_info_seccomp",0],[5,"ptrace_syscall_info",0],[5,"sockaddr_xdp",0],[5,"xdp_ring_offset",0],[5,"xdp_mmap_offsets",0],[5,"xdp_ring_offset_v1",0],[5,"xdp_mmap_offsets_v1",0],[5,"xdp_umem_reg",0],[5,"xdp_umem_reg_v1",0],[5,"xdp_statistics",0],[5,"xdp_statistics_v1",0],[5,"xdp_options",0],[5,"xdp_desc",0],[5,"iocb",0],[20,"__c_anonymous_ptrace_syscall_info_data",0],[5,"utmpx",0],[5,"sigset_t",0],[5,"sysinfo",0],[5,"msqid_ds",0],[5,"semid_ds",0],[5,"sigaction",0],[5,"statfs",0],[5,"flock",0],[5,"flock64",0],[5,"siginfo_t",0],[5,"stack_t",0],[5,"stat",0],[5,"stat64",0],[5,"statfs64",0],[5,"statvfs64",0],[5,"pthread_attr_t",0],[5,"_libc_fpxreg",0],[5,"_libc_xmmreg",0],[5,"_libc_fpstate",0],[5,"user_regs_struct",0],[5,"user",0],[5,"mcontext_t",0],[5,"ipc_perm",0],[5,"shmid_ds",0],[5,"ptrace_rseq_configuration",0],[5,"user_fpregs_struct",0],[5,"ucontext_t",0],[5,"statvfs",0],[5,"max_align_t",0],[5,"clone_args",0],[5,"sem_t",0],[5,"termios2",0],[5,"pthread_mutexattr_t",0],[5,"pthread_rwlockattr_t",0],[5,"pthread_condattr_t",0],[5,"pthread_barrierattr_t",0],[5,"fanotify_event_metadata",0],[5,"pthread_cond_t",0],[5,"pthread_mutex_t",0],[5,"pthread_rwlock_t",0],[5,"pthread_barrier_t",0],[5,"can_frame",0],[5,"canfd_frame",0],[5,"canxl_frame",0],[5,"open_how",0],[5,"in6_addr",0],[6,"c_void",0],[5,"Formatter",9172],[5,"Error",9172],[6,"Result",9173],[8,"dev_t",0],[8,"pid_t",0],[8,"c_long",0],[8,"uid_t",0],[5,"TypeId",9174],[6,"DIR",0],[6,"FILE",0],[6,"fpos_t",0],[6,"timezone",0],[6,"fpos64_t",0]],"b":[]}],\ @@ -69,7 +69,7 @@ var searchIndex = new Map(JSON.parse('[\ ["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}{{Fhd}{{E`{Dd}}}}{{FhAn}{{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}}}{}{}}00{C`{{l{Ehj}}}}1{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-Display-for-Error"],[127,"impl-Debug-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-SetMatches"],[196,"impl-IntoIterator-for-%26SetMatches"],[285,"impl-TryFrom%3C%26str%3E-for-Regex"],[286,"impl-TryFrom%3CString%3E-for-Regex"],[456,"impl-Display-for-Regex"],[457,"impl-Debug-for-Regex"],[495,"impl-Index%3C%26str%3E-for-Captures%3C\'h%3E"],[496,"impl-Index%3Cusize%3E-for-Captures%3C\'h%3E"],[521,"impl-IntoIterator-for-SetMatches"],[522,"impl-IntoIterator-for-%26SetMatches"],[607,"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":"PGPFPFPFFGGPPFFFFPFPPNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNONNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNCNNNNNNNNNNNNNNNNNNNNNNNNNNCNNNNNNNNNCNNNNNNNNNNNNNNNNNNNNNONNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNCOOOOOFPFFPGPNNNNNNNNNNNNNNNNNNCNNNNNNNNNNNNNNNNNNNNNNNNCNNNNNNNNNNNNNNNNNNNNNOOOFFFFFNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNFFFFNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNFFFFFFFFFNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNCPPFFPPFFPFPPPPFPFPFGFPGNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNONNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNONNNNNCNNNNNNNNONNNNNNNNNNNNNNNNNNOONNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNOOOOOOOOOOOFFFFFFNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNCCCCCCCCCCCCCFFFFFNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNFFFFFFNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNFFNNNNNNNNNNNNNNNNNNNHHFFFFFFFNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNFNNNNNNNNNNNPPPGFFFPPPFPPPPPPPPPPPPNNNONNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNFFNNNNNNNNNNNNNNNNNNNNNFNNNNNNNNNNNNNNNNNNNTTTTTTFFFTTTFFFFTTTNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNFNNNNNNNNNNNNNNNNNNFNNNNNNNNNNNNNNNNNNNNNNNNNNNNHHHHNNNNNNNFFFONNNNNNONNNNNNNNNNNNNNNNNNNNNN","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","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","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","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","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"],[248,"regex_automata::MatchErrorKind"],[253,"regex_automata::hybrid"],[325,"regex_automata::hybrid::StartError"],[328,"regex_automata::hybrid::dfa"],[458,"regex_automata::hybrid::regex"],[531,"regex_automata::meta"],[724,"regex_automata::nfa"],[725,"regex_automata::nfa::thompson"],[969,"regex_automata::nfa::thompson::State"],[980,"regex_automata::nfa::thompson::pikevm"],[1087,"regex_automata::util"],[1100,"regex_automata::util::alphabet"],[1181,"regex_automata::util::captures"],[1300,"regex_automata::util::escape"],[1321,"regex_automata::util::interpolate"],[1323,"regex_automata::util::iter"],[1417,"regex_automata::util::lazy"],[1429,"regex_automata::util::look"],[1572,"regex_automata::util::pool"],[1595,"regex_automata::util::prefilter"],[1615,"regex_automata::util::primitives"],[1771,"regex_automata::util::start"],[1790,"regex_automata::util::syntax"],[1830,"regex_automata::util::wire"],[1863,"core::cmp"],[1864,"core::ops::range"],[1865,"core::fmt"],[1866,"core::fmt"],[1867,"core::convert"],[1868,"core::hash"],[1869,"core::convert"],[1870,"core::ops::range"],[1871,"core::result"],[1872,"core::any"],[1873,"core::error"],[1874,"regex_syntax::hir"],[1875,"core::borrow"],[1876,"regex_syntax::error"],[1877,"alloc::sync"],[1878,"alloc::vec"],[1879,"core::iter::traits::collect"],[1880,"core::ops::function"],[1881,"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 …","","","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 …","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 …","","","","","","","","","","","","","","","","","","","","","","","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 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,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,131,132,133,131,134,0,37,0,0,37,0,37,36,37,38,39,36,37,38,39,36,37,38,39,36,37,38,39,39,39,0,39,36,36,37,37,38,38,39,36,37,38,39,39,36,37,38,39,39,39,39,39,39,39,39,0,36,37,36,37,38,39,36,37,38,36,37,38,39,36,37,38,39,36,37,38,39,135,136,137,0,0,0,0,0,41,41,47,46,42,48,41,47,46,42,48,42,42,42,41,41,46,46,47,41,47,46,42,48,41,47,46,42,48,41,42,41,46,48,41,47,46,42,48,41,47,46,42,48,46,46,41,48,46,46,46,46,41,46,46,46,46,46,46,41,47,46,42,48,46,41,41,41,47,46,46,41,41,47,46,42,41,41,41,41,41,41,46,46,47,41,47,47,47,47,46,46,48,41,41,41,46,42,42,41,47,46,42,48,41,47,46,42,48,41,47,46,42,48,41,41,41,41,41,41,47,46,42,48,46,0,0,0,0,53,53,55,56,53,54,55,56,53,54,54,54,54,55,53,54,53,54,55,54,54,55,55,55,56,53,54,55,53,53,55,56,53,54,55,56,53,54,56,55,53,55,53,54,55,56,55,53,55,55,53,53,54,54,53,54,55,56,53,54,55,56,53,54,55,55,56,53,54,0,0,0,0,0,0,0,0,0,57,57,60,59,66,64,67,68,65,57,58,60,59,66,64,67,68,65,57,58,58,58,58,58,59,57,59,59,59,60,59,65,57,58,60,59,65,57,58,59,58,66,64,59,59,57,57,57,57,59,59,60,60,59,66,64,67,68,65,57,58,60,59,66,64,67,68,65,57,58,57,57,57,59,57,57,57,57,57,57,57,57,57,57,57,57,57,59,57,57,66,64,67,68,60,59,66,64,67,68,65,57,58,66,64,67,68,59,59,57,57,59,65,59,65,57,58,59,66,64,67,68,57,57,57,60,59,57,66,64,65,59,59,59,59,59,59,59,59,68,60,60,59,59,59,58,60,60,59,65,57,58,60,60,59,66,64,67,68,65,57,58,60,59,66,64,67,68,65,57,58,60,59,66,64,67,68,65,57,58,57,57,59,59,0,69,81,0,0,81,81,0,0,81,0,81,69,81,81,0,69,0,81,0,0,0,81,0,73,73,73,73,73,73,73,73,73,73,44,73,52,69,80,75,44,81,82,83,78,84,73,52,69,80,75,44,81,82,83,78,84,73,80,80,80,80,44,52,73,73,52,69,80,75,44,81,82,83,78,73,52,69,80,75,44,81,82,83,78,44,44,80,73,73,52,69,78,81,82,83,78,73,73,52,69,80,75,75,44,81,82,83,78,84,73,52,69,80,75,44,81,82,83,78,84,52,73,52,52,73,52,52,73,73,52,52,44,44,44,78,73,52,69,80,75,44,81,82,83,78,84,84,44,69,81,69,44,44,52,44,44,44,82,83,78,82,83,78,78,73,44,44,73,52,80,44,44,84,78,52,73,73,44,44,0,52,73,73,73,73,52,75,75,78,44,73,44,44,44,44,80,73,52,69,80,75,44,81,82,83,78,75,82,83,73,52,69,80,75,44,81,82,83,78,84,73,52,69,80,75,44,81,82,83,78,84,73,52,69,80,75,44,81,82,83,78,84,52,52,138,138,139,140,141,141,140,140,142,140,143,0,0,0,0,0,0,88,92,89,88,93,91,90,92,89,88,93,91,90,89,89,89,88,88,88,92,89,88,90,92,89,88,90,88,89,88,88,92,88,88,92,89,88,93,91,90,92,89,88,93,91,90,88,92,88,92,92,89,88,93,91,90,93,91,88,92,90,88,92,89,88,90,88,88,93,91,88,92,90,88,88,88,89,89,92,89,88,90,92,89,88,93,91,90,92,89,88,93,91,90,92,89,88,93,91,90,88,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,45,87,87,87,87,45,95,96,94,87,45,95,96,94,87,45,87,45,87,45,45,45,87,45,87,87,45,95,96,94,87,45,95,96,94,45,45,87,45,95,96,94,95,96,94,87,87,45,87,45,95,96,94,87,45,45,45,45,87,45,87,45,95,96,94,87,45,95,96,94,87,45,95,96,94,87,0,0,0,0,0,0,63,70,70,63,98,70,99,100,97,63,98,70,99,100,97,63,63,98,70,99,100,63,98,70,99,100,98,100,70,63,70,70,63,63,63,98,70,99,99,100,97,63,98,70,99,100,97,63,63,63,63,63,70,70,63,63,63,63,63,98,70,99,100,97,98,100,97,63,63,63,70,70,98,100,97,63,70,70,63,98,100,70,70,63,70,63,99,70,70,63,98,70,99,100,99,63,98,70,99,100,97,63,98,70,99,100,97,63,98,70,99,100,97,0,0,105,104,105,104,104,104,105,104,105,104,105,104,104,105,104,105,104,105,104,0,0,0,0,0,0,0,0,0,108,108,109,110,111,108,112,114,115,109,110,111,108,112,114,115,108,108,109,110,111,108,112,114,115,109,110,111,108,112,114,115,109,110,111,109,110,108,112,114,109,110,111,108,112,114,115,108,108,109,110,111,112,114,115,108,108,109,110,111,112,114,115,108,108,108,109,110,111,108,112,114,115,109,110,111,108,112,114,115,109,110,111,108,112,114,115,0,116,116,116,116,116,116,116,116,116,116,116,77,77,77,0,0,0,0,77,77,77,0,77,77,77,77,77,77,77,77,77,77,77,77,77,77,86,86,77,86,120,85,119,77,86,120,85,119,119,77,86,120,85,119,77,86,120,85,119,86,86,86,86,86,86,86,86,86,86,85,86,77,86,77,86,120,85,119,119,77,86,120,85,119,77,86,85,86,86,77,86,120,85,119,120,86,85,85,85,85,85,85,85,85,85,85,85,85,85,85,85,85,85,85,86,86,85,85,85,120,86,86,77,86,86,85,86,86,86,86,86,77,86,120,85,119,119,77,86,120,85,119,77,86,120,85,119,77,86,120,85,119,86,86,0,0,123,121,123,121,121,121,123,121,123,121,123,123,121,123,121,123,121,123,121,123,121,0,49,49,49,49,49,49,49,49,49,49,49,49,49,49,49,49,49,49,49,124,6,74,124,6,74,0,0,0,124,6,74,0,0,0,0,124,6,74,124,6,74,124,6,74,124,6,74,124,6,74,126,31,127,71,124,126,74,31,127,71,124,126,74,31,127,71,124,126,74,31,127,71,124,126,74,31,127,71,124,74,124,74,71,124,126,74,31,127,71,124,126,126,74,31,31,127,127,71,124,124,126,74,74,31,127,124,6,74,124,6,74,71,71,124,74,71,124,126,74,31,127,124,6,74,71,124,6,74,124,6,74,124,6,74,71,124,74,124,6,74,71,124,126,74,31,127,126,31,127,71,124,124,124,124,124,126,74,74,74,74,74,31,127,71,124,126,74,31,127,71,124,126,74,31,127,0,50,50,50,50,50,50,50,50,50,50,50,50,50,50,50,50,50,50,0,51,51,51,51,51,51,51,51,51,51,51,51,51,51,51,51,51,51,51,51,51,51,51,51,51,51,51,51,0,0,0,0,51,51,51,51,51,51,51,0,0,0,128,128,129,130,128,129,130,128,128,129,129,130,130,128,129,130,128,129,130,129,130,128,129,130,128,129,130,128,129,130],"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}{Bhl}{cc{}}0{cb{Bj{Bn{{Bl{Bh}}}}}}1{{{Bb{h}}}n}222222222{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}}}}{Db{{D`{lCn}}}}{c{{D`{e}}}{}{}}{Dd{{D`{lCn}}}}{h{{D`{lCn}}}}22222222222{{fl}{{D`{B`Ad}}}}333333333333{cDf{}}00000000000{dAj}`````````````99999999{DhDh}{DjDj}{DlDl}{DnDn}{{ce}j{}{}}000{{DnDn}An}{{}Dn}`{{DnDn}B`}{{DhBd}Bf}0{{DjBd}Bf}0{{DlBd}Bf}0{{DnBd}Bf}{cc{}}000{{Dnc}jC`}{ce{}{}}000{DnB`}00000{{DnDn}{{Cd{An}}}}`{Dh{{Cd{E`}}}}{Dj{{Cd{E`}}}}4444{cCj{}}00{c{{D`{e}}}{}{}}0000000{cDf{}}000````````{{}{{D`{EbDh}}}}8888888888{{EdEf}{{D`{EbDh}}}}{{EdEh}{{D`{EbDh}}}}{{Ed{Bl{c}}}{{D`{EbDh}}}{{Bn{Ef}}}}{{}Ed}{EbEj}{{ElB`}El}{{Elh}El}{Enh}{EbEb}{EnEn}{ElEl}{EdEd}{F`F`}{{ce}j{}{}}0000{{}El}{{EdEl}Ed}{EbEn}2{{F`F`}B`}{{EbBd}Bf}{{EnBd}Bf}{{ElBd}Bf}{{EdBd}Bf}{{F`Bd}Bf}{cc{}}0000{ElB`}{Elh}{EbEl}{F`{{Cd{A`}}}}{ElAh}{El{{Cd{h}}}}{{ElEh}{{D`{hDh}}}}1{EbEh}{El{{Cd{Fb}}}}{{ElBh}B`}9999{ce{}{}}0000{{ElAh}El}{{EbEnDn}h}{{EbEnDnh}l}{Ebh}{Enh}{{El{Cd{h}}}El}0{{}{{D`{EbDh}}}}{Ef{{D`{EbDh}}}}{EbEn}{{}El}{{}Ed}{{{Bl{c}}}{{D`{EbDh}}}{{Bn{Ef}}}}{{EbEnDn}{{D`{DnDl}}}}{{EbEnDnBh}{{D`{DnDl}}}}{{EbEnDnBh}Dn}0;{{El{Cd{Fb}}}El}{{ElBhB`}El}{{EnEb}j}{{EbEn}j}{{Enh}j}0?0{{ElB`}El}0{{}F`}{{EbEnFd}{{D`{DnDj}}}}{{EbEnb}{{D`{DnAj}}}}03{{EdFf}Ed}{{EdFh}Ed}{ce{}{}}0000{c{{D`{e}}}{}{}}000000000{{EbEnb}{{D`{{Cd{A`}}Aj}}}}{{EbEnbF`}{{D`{jAj}}}}01{{EbEnbf}{{D`{jAj}}}}{cDf{}}0000;````{Fj{{Ch{EnEn}}}}066666666{{FlEf}{{D`{FnDh}}}}{{FlEbEb}Fn}{{Fl{Bl{c}}}{{D`{FnDh}}}{{Bn{Ef}}}}{{}Fl}{FjFj}{FlFl}{{ce}j{}{}}0{FnFj}4{{FlEl}Fl}{{FnFjc}{{Cd{Ab}}}{{Cb{b}}}}{{FnFjc}G`{{Cb{b}}}}{{FnBd}Bf}{{G`Bd}Bf}{{FjBd}Bf}{{FlBd}Bf}{FnEb}{FjEn}0{cc{}}000{ce{}{}}0000{{FnFjc}B`{{Cb{b}}}}{Fjh}{Ef{{D`{FnDh}}}}>{{}Fl}{{{Bl{c}}}{{D`{FnDh}}}{{Bn{Ef}}}}{G`{{Cd{Ab}}}}{Fnh}{{FjFn}j}{{FnFj}j}<;;{{FlFf}Fl}{{FlFh}Fl};;{c{{D`{e}}}{}{}}0000000{{FnFjb}{{D`{{Cd{Ab}}Aj}}}}{cDf{}}000`````````{{GbB`}Gb}0??????????????????{{GdEf}{{D`{GfGh}}}}{{GdGj}{{D`{GfGh}}}}{{Gd{Bl{c}}}{{D`{GfGh}}}{{Bn{Ef}}}}{{Gd{Bl{c}}}{{D`{GfGh}}}{{Gl{Gj}}}}{{}Gd}5{{GfcGn}j{{Cb{b}}}}{{Gfc}H`{{Cb{b}}}}{Gfh}{GhGh}{GfGf}{HbHb}{GbGb}{GdGd}{{ce}j{}{}}0000{{}Gb}{{GdGb}Gd}{Hdh}{H`h}{GfHb}{GfGn}5{{GbB`}Gb}{{Gb{Cd{h}}}Gb}0{{Gfc}{{Cd{Ab}}}{{Cb{b}}}}{{Gfc}Hd{{Cb{b}}}}{{GhBd}Bf}0{{GfBd}Bf}{{HdBd}Bf}{{H`Bd}Bf}{{HfBd}Bf}{{HhBd}Bf}{{HbBd}Bf}{{GbBd}Bf}{{GdBd}Bf}{cc{}}00000000{GbB`}00{GfGb}1{Gb{{Cd{h}}}}02{Gbh}{GbBh}{GbAh}353{Gb{{Cd{Fb}}}}6{GbHj}{GfHl}{{GbB`}Gb}{{Gbh}Gb}{Hdb}{H`b}{Hfb}{Hhb}{ce{}{}}000000000000{GfB`}{{Gfc}B`{{Cb{b}}}}{{GbBh}Gb}{{GbAh}Gb}{Gfh}{Hbh}{Ef{{D`{GfGh}}}}{GfHb}{{}Gb}{{}Gd}{{{Bl{c}}}{{D`{GfGh}}}{{Bn{Ef}}}}{Hd{{Cd{Ab}}}}{H`{{Cd{Gn}}}}{Hf{{Cd{n}}}}{Hh{{Cd{n}}}}{{Gb{Cd{h}}}Gb}{{GbB`}Gb}1{Gh{{Cd{l}}}}={{Gb{Cd{Fb}}}Gb}{HdGf}{H`Gf}{{HbGf}j}{{Gfb}{{Cd{Ab}}}}{{GfbGn}j}{{GfHbbGn}j}{{Gfb}{{Cd{A`}}}}{{GfHbb}{{Cd{A`}}}}{{Gfb{Bl{{Cd{Hn}}}}}{{Cd{l}}}}{{GfHbb{Bl{{Cd{Hn}}}}}{{Cd{l}}}}{{GfHbb}{{Cd{Ab}}}}{Hh{{Ch{h{Cd{h}}}}}}{Gh{{Cd{h}}}}{Gh{{Cd{E`}}}}{{Gfc}Hf{{Cb{b}}}}{{Gfch}Hh{{Cb{b}}}}{Gf{{Cd{h}}}}{{GdFf}Gd}{Gh{{Cd{I`}}}}{ce{}{}}0000{cCj{}}{c{{D`{e}}}{}{}}00000000000000000{cDf{}}00000000{{GbB`}Gb}{{GbHj}Gb}{{Gfbf}j}{{GfHbbf}j}````````````````````````{{IbIdDd}{{D`{IdIf}}}}{{IbIdDd{Cd{{Ih{Ef}}}}}{{D`{IdIf}}}}{Ib{{D`{IdIf}}}}0{{IbIdIj}{{D`{IdIf}}}}1{{IbIl}{{D`{IdIf}}}}{{Ib{In{Il}}}{{D`{IdIf}}}}{{Ib{In{Id}}}{{D`{IdIf}}}}0{{}Eh}??????????????????????{{IbIdId}{{D`{EhIf}}}}{{J`Ef}{{D`{EhIf}}}}{{J`Gj}{{D`{EhIf}}}}{{J`{Bl{c}}}{{D`{EhIf}}}{{Bn{Ef}}}}{{J`{Bl{c}}}{{D`{EhIf}}}{{Gl{Gj}}}}{EhEj}{{FhB`}Fh}{Ibj}{IbIb}{FhFh}{HjHj}{J`J`}{IfIf}{EhEh}{JbJb}{JdJd}{JfJf}{IlIl}{{ce}j{}{}}000000000{{}J`}{{}Fh}{{J`Fh}J`}{Ibl}{{}Ib}3{{}Hj}`{{JbJb}B`}{{JdJd}B`}{{JfJf}B`}{{IlIl}B`}{{IbId}{{D`{lIf}}}}{{IbBd}Bf}{{FhBd}Bf}{{HjBd}Bf}{{J`Bd}Bf}{{IfBd}Bf}0{{EhBd}Bf}{{JbBd}Bf}{{JdBd}Bf}{{JfBd}Bf}{{IlBd}Bf}{{JhBd}Bf}{cc{}}0000000000{FhB`}{IbJj}{FhJj}{Fh{{Cd{h}}}}{IbB`}44{Ib{{Cd{h}}}}15{FhHj}{EhHl}{EhB`}0{{Ilc}jC`}{ce{}{}}000000000002{HjB`}{JbB`}144{{FhJj}Fh}{EhJj}{EhJl}0{{Jd{Bl{Bh}}h}{{Cd{Id}}}}{{Jf{Bl{Bh}}h}{{Cd{Id}}}}{{Il{Bl{Bh}}h}B`}{{JdBh}{{Cd{Id}}}}{{JfBh}{{Cd{Id}}}}{{IlBh}B`}{{IlJn}B`}{Ibh}{Ehh}{{}Eh}{{}Ib}{{}Fh}{{}J`}{Ef{{D`{EhIf}}}}{{{Bl{c}}}{{D`{EhIf}}}{{Bn{Ef}}}}{Jh{{Cd{l}}}}`{{Fh{Cd{h}}}Fh}{{IbIdId}{{D`{jIf}}}}:9{EhJh}`{{FhB`}Fh}{{IbJj}j}{{IbB`}j}{{Ib{Cd{h}}}{{D`{jIf}}}}13{If{{Cd{h}}}}{If{{Cd{E`}}}}`{EhId}{Ib{{D`{lIf}}}}{{Ehl}{{Cd{Id}}}}2{{EhId}Jb}{Eh{{Bl{Jb}}}}{{J`Ff}J`}{ce{}{}}000000000{cCj{}}``{c{{D`{e}}}{}{}}000000000000000000000{cDf{}}0000000000?{{FhHj}Fh}`````````````````{{}{{D`{K`If}}}}555555555555{{KbEf}{{D`{K`If}}}}{{KbEh}{{D`{K`If}}}}{{Kb{Bl{c}}}{{D`{K`If}}}{{Bn{Ef}}}}{{}Kb}{{K`KdcGn}j{{Cb{b}}}}{{K`Kdc}Kf{{Cb{b}}}}{KhKh}{KbKb}{K`K`}{KdKd}{{ce}j{}{}}000{{}Kh}{{KbKh}Kb}{K`Kd}{K`Gn}3{{K`Kdc}{{Cd{Ab}}}{{Cb{b}}}}{{K`Kdc}Kj{{Cb{b}}}}{{KhBd}Bf}{{KbBd}Bf}{{K`Bd}Bf}{{KjBd}Bf}{{KfBd}Bf}{{KdBd}Bf}{cc{}}00000{K`Kh}{KhAh}{K`Eh}{Kh{{Cd{Fb}}}}{ce{}{}}0000000{{K`Kdc}B`{{Cb{b}}}}{{KhAh}Kh}{Kdh}{{}{{D`{K`If}}}}{{}Kh}{{}Kb}{Ef{{D`{K`If}}}}{K`Kd}{Eh{{D`{K`If}}}}{{{Bl{c}}}{{D`{K`If}}}{{Bn{Ef}}}}{Kj{{Cd{Ab}}}}{Kf{{Cd{Gn}}}}{K`h}{{Kh{Cd{Fb}}}Kh}{{KdK`}j}{{K`Kd}j}{{K`KdbGn}j}{{K`Kdb{Bl{{Cd{Hn}}}}}{{Cd{l}}}}{{KbFf}Kb}{{KbFh}Kb}{ce{}{}}000{c{{D`{e}}}{}{}}00000000000{cDf{}}00000{{K`Kdbf}j}``````````````````{Ejh}{Jn{{Cd{Cl}}}}{Jn{{Cd{Bh}}}}{Jnh}7777777777{JnJn}{EjEj}{{ce}j{}{}}0{{JnJn}An}{{}Ej}{{EjJn}Kl}1{hJn}{EjJn}{{JnJn}B`}{{JnBd}Bf}{{EjBd}Bf}{{KnBd}Bf}{{L`Bd}Bf}{{KlBd}Bf}{cc{}}0000{{EjBh}Bh}{{EjJn}h}{ce{}{}}0000000{{JnBh}B`}{JnB`}{EjB`}1{EjKn}{Kn{{Cd{Jn}}}}{L`{{Cd{Jn}}}}{Kl{{Cd{Jn}}}}{{JnJn}{{Cd{An}}}}{{Ejc}L`{{Cf{Bh}}}}{{EjBhBh}j}{{}Ej}{Ejh}<<{c{{D`{e}}}{}{}}000000000{cDf{}}0000{BhJn}``````{HlGn}{Hlh}{HlLb}{ce{}{}}00000000000{Gnj}{GnGn}{LdLd}{HlHl}{LfLf}{LhLh}{{ce}j{}{}}0000{Ldh}{Lhh}{{}Hl}=0<{{GnEf}{{Ch{Ef{Lj{Ef}}}}}}{{Gn{Bl{Bh}}}{{Ch{{Bl{Bh}}{Lj{{Bl{Bh}}}}}}}}{{GnBd}Bf}{{LdBd}Bf}{{HlBd}Bf}{{LfBd}Bf}0{{LhBd}Bf}{{LbBd}Bf}{cc{}}00000{{Gnh}{{Cd{n}}}}{{GnEf}{{Cd{n}}}}{Gn{{Cd{Ab}}}}{GnHl}{Gnh}{{Hll}h}{Hlh}{{Gn{Bl{Bh}}{Bl{Bh}}}{{In{Bh}}}}{{Gn{Bl{Bh}}{Bl{Bh}}{In{Bh}}}j}{{GnEfEf}Cj}{{GnEfEfCj}j}{ce{}{}}00000000{GnB`}{GnLd}{HlGn}8{g{{D`{HlLf}}}{{Bn{Ef}}}{{Ln{}{{Ll{{Cd{c}}}}}}}{{Ln{}{{Ll{e}}}}}}{Ld{{Cd{{Cd{n}}}}}}{Lh{{Cd{{Cd{Ef}}}}}}{Lb{{Cd{{Ch{lh{Cd{Ef}}}}}}}}{Gn{{Cd{l}}}}={{Hll}Lh}{{Gn{Cd{l}}}j}{Ld{{Ch{h{Cd{h}}}}}}{Lh{{Ch{h{Cd{h}}}}}}{{Hllh}{{Cd{h}}}}{Hlh}{Gn{{Bl{{Cd{Hn}}}}}}{{Hllh}{{Cd{{Ch{hh}}}}}}1{Lf{{Cd{E`}}}}{{HllEf}{{Cd{h}}}}{{Hllh}{{Cd{Ef}}}}{ce{}{}}0000{cCj{}}{c{{D`{e}}}{}{}}00000000000{cDf{}}00000``3333{M`M`}{{ce}j{}{}}{{MbBd}Bf}{{M`Bd}Bf}{cc{}}0888666655{{{Bl{Bh}}ce{In{Bh}}}j{{Md{h{In{Bh}}}}}{{Md{Ef}{{Mf{{Cd{h}}}}}}}}{{EfceCj}j{{Md{hCj}}}{{Md{Ef}{{Mf{{Cd{h}}}}}}}}```````{{Mhc}{{Cd{Ab}}}{{Md{b}{{Mf{{D`{{Cd{Ab}}Aj}}}}}}}}{{Mhc}{{Cd{A`}}}{{Md{b}{{Mf{{D`{{Cd{A`}}Aj}}}}}}}}<<<<<<<<<<<<<<{MhMh}8{{{Mj{c}}Bd}Bf{}}{{{Ml{c}}Bd}Bf{}}{{{Mn{c}}Bd}Bf{}}{{MhBd}Bf}{{{N`{c}}Bd}BfNb}{{{Nd{c}}Bd}BfNb}{{{Nf{c}}Bd}BfNb}<<<<<<<{{{Mj{c}}}{{N`{c}}}{}}{{{Ml{c}}}{{Nd{c}}}{}}{{{Mn{c}}}{{Nf{c}}}{}}{{{Mj{c}}}b{}}{{{Ml{c}}}b{}}{Mhb}{{{N`{c}}}b{}}{{{Nd{c}}}b{}}{ce{}{}}000000{{MhGnc}{{Mn{c}}}{{Md{bGn}{{Mf{{D`{jAj}}}}}}}}{{Mhc}{{Mj{c}}}{{Md{b}{{Mf{{D`{{Cd{A`}}Aj}}}}}}}}222222{{Mhc}{{Ml{c}}}{{Md{b}{{Mf{{D`{{Cd{Ab}}Aj}}}}}}}}{bMh}{{{Mj{c}}}{{Cd{{D`{A`Aj}}}}}{{Md{b}{{Mf{{D`{{Cd{A`}}Aj}}}}}}}}{{{Ml{c}}}{{Cd{{D`{AbAj}}}}}{{Md{b}{{Mf{{D`{{Cd{Ab}}Aj}}}}}}}}{{{Mn{c}}}{{Cd{{D`{GnAj}}}}}{{Md{bGn}{{Mf{{D`{jAj}}}}}}}}{{{N`{c}}}{{Cd{A`}}}{{Md{b}{{Mf{{D`{{Cd{A`}}Aj}}}}}}}}{{{Nd{c}}}{{Cd{Ab}}}{{Md{b}{{Mf{{D`{{Cd{Ab}}Aj}}}}}}}}{{{Nf{c}}}{{Cd{Gn}}}{{Md{bGn}{{Mf{{D`{jAj}}}}}}}}:{{Mhc}{{D`{{Cd{Ab}}Aj}}}{{Md{b}{{Mf{{D`{{Cd{Ab}}Aj}}}}}}}}{{Mhc}{{D`{{Cd{A`}}Aj}}}{{Md{b}{{Mf{{D`{{Cd{A`}}Aj}}}}}}}}{c{{D`{e}}}{}{}}0000000000000{cDf{}}000000`>>{{{Nh{ce}}}c{}{{Nj{}{{Mf{c}}}}}}{{{Nh{ce}}Bd}BfNb{{Nj{}{{Mf{c}}}}}}{cc{}}2{ce{}{}}{c{{Nh{ec}}}{}{}}665```````````````````````{IjNl}{IjDd}{Jl{{D`{jNn}}}}`4444444444{{}{{D`{jNn}}}}{IjIj}{JlJl}{O`O`}{JjJj}{NnNn}{{ce}j{}{}}0000{{JlIj}B`}{JlB`}0000000{{}Jl}{{}Jj}1{{IjIj}B`}{{JlJl}B`}{{IjBd}Bf}{{JlBd}Bf}{{O`Bd}Bf}{{JjBd}Bf}{{NnBd}Bf}0{cc{}}0000{Dd{{Cd{Ij}}}}:{JjBh}{{JlIj}Jl}{{JlJl}Jl}{ce{}{}}00000?{{Jj{Bl{Bh}}h}B`}000000000{{Jj{Bl{Bh}}h}{{D`{B`Nn}}}}0110000{JlO`}{Jlh}{{JjIj{Bl{Bh}}h}B`}{{JjJl{Bl{Bh}}h}B`}{{}Jj}{O`{{Cd{Ij}}}}{{{Bl{Bh}}}Jl};{IjIj}{{JlIj}j}{{JlJl}j}{{JjBh}Jj}211{IjJl}?>>>>>{cCj{}}{c{{D`{e}}}{}{}}000000000{cDf{}}0000{{JlJl}Jl}{{Jl{Bl{Bh}}}j}``{ce{}{}}000{{{Ob{ce}}}cOd{{Nj{}{{Mf{c}}}}}}0{{{Of{ce}}Bd}BfNb{}}{{{Ob{ce}}Bd}Bf{OdNb}{{Nj{}{{Mf{c}}}}}}{cc{}}0{{{Of{ce}}}{{Ob{ce}}}Od{{Nj{}{{Mf{c}}}}}}55{c{{Of{ec}}}{}{}}{{{Ob{ce}}}jOd{{Nj{}{{Mf{c}}}}}};;;;::`77{FbFb}{{ce}j{}{}}{{Fb{Bl{Bh}}n}{{Cd{n}}}}{{FbBd}Bf}7{{AhGj}{{Cd{Fb}}}}{{Ah{Bl{c}}}{{Cd{Fb}}}{{Gl{Gj}}}}={FbB`}{Fbh}0{{Ah{Bl{c}}}{{Cd{Fb}}}{{Bn{{Bl{Bh}}}}}}6{ce{}{}}{c{{D`{e}}}{}{}}0{cDf{}}```````````````````{OhOj}{lOj}{IdOj}{OhDd}{lDd}{IdDd}{OhDb}{lDb}{IdDb}{Ohh}{lh}{Idh}{OlDb}{CnDb}{OnDb}{ce{}{}}00000000000{HnHn}{OhOh}{OlOl}{IdId}{CnCn}{OnOn}{{ce}j{}{}}00000{{HnHn}An}{{OhOh}An}{{IdId}An}{{}Oh}{{}Id}{{HnHn}B`}{{OhOh}B`}{{OlOl}B`}{{IdId}B`}{{CnCn}B`}{{OnOn}B`}{{HnBd}Bf}{{OhBd}Bf}{{OlBd}Bf}0{{IdBd}Bf}{{CnBd}Bf}0{{OnBd}Bf}0{cc{}}{BhOh}11{BhId}222{{{Lj{Bh}}}{{D`{OhOl}}}}{{{Lj{Bh}}}{{D`{lCn}}}}{{{Lj{Bh}}}{{D`{IdOn}}}}{{{Lj{Bh}}}Oh}{{{Lj{Bh}}}l}{{{Lj{Bh}}}Id}{Hnh}{{Hnc}jC`}{{Ohc}jC`}{{Idc}jC`}{ce{}{}}00000{hOh}{hl}{hId}{h{{Cd{Hn}}}}{h{{D`{OhOl}}}}{h{{D`{lCn}}}}{h{{D`{IdOn}}}}654{Ohh}{lh}{Idh}{{HnHn}{{Cd{An}}}}{{OhOh}{{Cd{An}}}}{{IdId}{{Cd{An}}}}{Oh{{Lj{Bh}}}}{l{{Lj{Bh}}}}{Id{{Lj{Bh}}}}{ce{}{}}00000{cCj{}}00{c{{D`{e}}}{}{}}{Db{{D`{OhOl}}}}?1{Cl{{D`{OhOl}}}}{Dd{{D`{OhOl}}}}3{Dd{{D`{IdOn}}}}{Db{{D`{IdOn}}}}5{Cl{{D`{IdOn}}}}{h{{D`{IdOn}}}}77777777{cDf{}}00000`{{Fdd}Fd};;{FdFd}{{ce}j{}{}}{{FdBd}Bf}{cc{}}{bFd}0{Fdd}{Fd{{Cd{Bh}}}}{ce{}{}}{{Fd{Cd{Bh}}}Fd}{{}Fd}2{c{{D`{e}}}{}{}}0<`33{{FfB`}Ff}{FfFf};1{{}Ff}2{{FfBd}Bf};{FfB`}000{FfBh}1{FfDd}22226:{{FfBh}Ff}7{{FfDd}Ff}68{Ef{{D`{GjI`}}}}{{{Bl{c}}}{{D`{{In{Gj}}I`}}}{{Bn{Ef}}}}{{{Bl{c}}Ff}{{D`{{In{Gj}}I`}}}{{Bn{Ef}}}}{{EfFf}{{D`{GjI`}}}}<{ce{}{}}>>{cDf{}}>>````111111`{{{A`{ce}}Bd}Bf{NbBj}Nb}{{AbBd}Bf}0{{AdBd}Bf}0{cc{}}00555{cCj{}}0{c{{D`{e}}}{}{}}00000666","c":[787,845],"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",1863],[1,"bool"],[5,"Range",1864],[5,"Formatter",1865],[8,"Result",1865],[1,"u8"],[10,"Sized",1866],[1,"slice"],[10,"AsRef",1867],[10,"Hasher",1868],[10,"Into",1867],[6,"Option",1869],[10,"RangeBounds",1864],[1,"tuple"],[5,"String",1870],[1,"u16"],[5,"PatternIDError",1615],[6,"Result",1871],[1,"u64"],[1,"u32"],[5,"TypeId",1872],[5,"BuildError",253],[6,"StartError",253],[5,"CacheError",253],[5,"LazyStateID",253],[10,"Error",1873],[5,"DFA",328],[5,"Builder",328],[1,"str"],[5,"NFA",725],[5,"ByteClasses",1100],[5,"Config",328],[5,"Cache",328],[5,"OverlappingState",328],[5,"Prefilter",1595],[5,"Config",1771],[5,"Config",1790],[5,"Config",725],[5,"Cache",458],[5,"Builder",458],[5,"Regex",458],[5,"FindMatches",458],[5,"Config",531],[5,"Builder",531],[5,"Regex",531],[5,"BuildError",531],[5,"Hir",1874],[10,"Borrow",1875],[5,"Captures",1181],[5,"CapturesMatches",531],[5,"Cache",531],[5,"FindMatches",531],[5,"Split",531],[5,"SplitN",531],[6,"WhichCaptures",725],[5,"GroupInfo",1181],[5,"NonMaxUsize",1615],[6,"Error",1876],[5,"Builder",725],[5,"StateID",1615],[5,"BuildError",725],[5,"Arc",1877],[6,"Look",1429],[5,"Transition",725],[5,"Vec",1878],[5,"Compiler",725],[6,"State",725],[5,"SparseTransitions",725],[5,"DenseTransitions",725],[5,"PatternIter",725],[5,"LookMatcher",1429],[5,"LookSet",1429],[5,"Unit",1100],[5,"PikeVM",980],[5,"Builder",980],[5,"Cache",980],[5,"CapturesMatches",980],[5,"Config",980],[5,"FindMatches",980],[5,"ByteClassElements",1100],[5,"ByteClassIter",1100],[5,"ByteClassRepresentatives",1100],[5,"GroupInfoAllNames",1181],[5,"CapturesPatternIter",1181],[5,"GroupInfoError",1181],[5,"GroupInfoPatternNames",1181],[1,"array"],[17,"Item"],[10,"IntoIterator",1879],[5,"DebugByte",1300],[5,"DebugHaystack",1300],[10,"FnMut",1880],[17,"Output"],[5,"Searcher",1323],[5,"TryHalfMatchesIter",1323],[5,"TryMatchesIter",1323],[5,"TryCapturesIter",1323],[5,"HalfMatchesIter",1323],[10,"Debug",1865],[5,"MatchesIter",1323],[5,"CapturesIter",1323],[5,"Lazy",1417],[10,"Fn",1880],[1,"char"],[5,"UnicodeWordBoundaryError",1429],[5,"LookSetIter",1429],[5,"PoolGuard",1572],[10,"Send",1866],[5,"Pool",1572],[5,"SmallIndex",1615],[1,"i32"],[5,"SmallIndexError",1615],[5,"StateIDError",1615],[5,"AlignAs",1830],[5,"SerializeError",1830],[5,"DeserializeError",1830],[15,"Quit",248],[15,"HaystackTooLong",248],[15,"UnsupportedAnchored",248],[15,"GaveUp",248],[15,"Quit",325],[15,"Cache",325],[15,"UnsupportedAnchored",325],[15,"BinaryUnion",969],[15,"Union",969],[15,"Capture",969],[15,"Look",969],[15,"Match",969],[15,"ByteRange",969]],"b":[[82,"impl-PartialEq%3CRange%3Cusize%3E%3E-for-Span"],[83,"impl-PartialEq-for-Span"],[97,"impl-Debug-for-PatternSetInsertError"],[98,"impl-Display-for-PatternSetInsertError"],[102,"impl-Display-for-MatchError"],[103,"impl-Debug-for-MatchError"],[205,"impl-TryFrom%3Cu16%3E-for-PatternID"],[206,"impl-TryFrom%3Cu64%3E-for-PatternID"],[208,"impl-TryFrom%3Cu32%3E-for-PatternID"],[209,"impl-TryFrom%3Cusize%3E-for-PatternID"],[280,"impl-Display-for-BuildError"],[281,"impl-Debug-for-BuildError"],[282,"impl-Display-for-StartError"],[283,"impl-Debug-for-StartError"],[284,"impl-Debug-for-CacheError"],[285,"impl-Display-for-CacheError"],[591,"impl-Debug-for-BuildError"],[592,"impl-Display-for-BuildError"],[826,"impl-Display-for-BuildError"],[827,"impl-Debug-for-BuildError"],[1224,"impl-Display-for-GroupInfoError"],[1225,"impl-Debug-for-GroupInfoError"],[1495,"impl-Debug-for-UnicodeWordBoundaryError"],[1496,"impl-Display-for-UnicodeWordBoundaryError"],[1686,"impl-Debug-for-SmallIndexError"],[1687,"impl-Display-for-SmallIndexError"],[1689,"impl-Debug-for-PatternIDError"],[1690,"impl-Display-for-PatternIDError"],[1691,"impl-Display-for-StateIDError"],[1692,"impl-Debug-for-StateIDError"],[1746,"impl-TryFrom%3Cu64%3E-for-SmallIndex"],[1747,"impl-TryFrom%3Cusize%3E-for-SmallIndex"],[1749,"impl-TryFrom%3Cu16%3E-for-SmallIndex"],[1750,"impl-TryFrom%3Cu32%3E-for-SmallIndex"],[1752,"impl-TryFrom%3Cu32%3E-for-StateID"],[1753,"impl-TryFrom%3Cu64%3E-for-StateID"],[1755,"impl-TryFrom%3Cu16%3E-for-StateID"],[1756,"impl-TryFrom%3Cusize%3E-for-StateID"],[1842,"impl-Display-for-SerializeError"],[1843,"impl-Debug-for-SerializeError"],[1844,"impl-Debug-for-DeserializeError"],[1845,"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}{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`}`````{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{}}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`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-Debug-for-UnicodeWordError"],[34,"impl-Display-for-UnicodeWordError"],[35,"impl-From%3CError%3E-for-Error"],[37,"impl-From%3CError%3E-for-Error"],[493,"impl-Debug-for-Error"],[494,"impl-Display-for-Error"],[495,"impl-Debug-for-ErrorKind"],[496,"impl-Display-for-ErrorKind"],[501,"impl-Display-for-Ast"],[502,"impl-Debug-for-Ast"],[1131,"impl-Display-for-Error"],[1132,"impl-Debug-for-Error"],[1133,"impl-Display-for-ErrorKind"],[1134,"impl-Debug-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"]]}],\ +["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-Debug-for-UnicodeWordError"],[34,"impl-Display-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-Debug-for-ErrorKind"],[496,"impl-Display-for-ErrorKind"],[501,"impl-Display-for-Ast"],[502,"impl-Debug-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-Display-for-CaseFoldError"],[1154,"impl-Debug-for-CaseFoldError"],[1432,"impl-From%3Cu8%3E-for-Literal"],[1433,"impl-From%3Cchar%3E-for-Literal"]]}],\ ["same_file",{"doc":"This crate provides a safe and simple cross platform way …","t":"FNNNNNNNNNNNNNNNHNNNNNN","n":["Handle","as_file","as_file_mut","as_raw_fd","borrow","borrow_mut","dev","eq","fmt","from","from_file","from_path","hash","ino","into","into_raw_fd","is_same_file","stderr","stdin","stdout","try_from","try_into","type_id"],"q":[[0,"same_file"],[23,"std::fs"],[24,"std::os::fd::raw"],[25,"core::fmt"],[26,"core::fmt"],[27,"std::path"],[28,"core::convert"],[29,"core::hash"],[30,"core::result"],[31,"core::any"]],"d":["A handle to a file that can be tested for equality with …","Return a reference to the underlying file.","Return a mutable reference to the underlying file.","","","","Return the underlying device number of this handle.","","","Returns the argument unchanged.","Construct a handle from a file.","Construct a handle from a path.","","Return the underlying inode number of this handle.","Calls U::from(self).","","Returns true if the two file paths may correspond to the …","Construct a handle from stderr.","Construct a handle from stdin.","Construct a handle from stdout.","","",""],"i":[0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,0,1,1,1,1,1,1],"f":"`{bd}0{bf}{ce{}{}}0{bh}{{bb}j}{{bl}n}{cc{}}{d{{A`{b}}}}{c{{A`{b}}}{{Ad{Ab}}}}{{bc}AfAh}678{{ce}{{A`{j}}}{{Ad{Ab}}}{{Ad{Ab}}}}{{}{{A`{b}}}}00{c{{Aj{e}}}{}{}}0{cAl{}}","c":[],"p":[[5,"Handle",0],[5,"File",23],[8,"RawFd",24],[1,"u64"],[1,"bool"],[5,"Formatter",25],[8,"Result",25],[8,"Result",26],[5,"Path",27],[10,"AsRef",28],[1,"unit"],[10,"Hasher",29],[6,"Result",30],[5,"TypeId",31]],"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}0{{cFj}{{Af{FdG`}}}{}}2{{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}}088{{{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-SeqAccess%3C\'de%3E-for-MapDeserializer%3C\'de,+I,+E%3E"],[1406,"impl-MapAccess%3C\'de%3E-for-MapDeserializer%3C\'de,+I,+E%3E"],[1579,"impl-SerializeMap-for-Impossible%3COk,+Error%3E"],[1580,"impl-SerializeTupleVariant-for-Impossible%3COk,+Error%3E"],[1581,"impl-SerializeStruct-for-Impossible%3COk,+Error%3E"],[1582,"impl-SerializeTupleStruct-for-Impossible%3COk,+Error%3E"],[1583,"impl-SerializeStructVariant-for-Impossible%3COk,+Error%3E"],[1584,"impl-SerializeTuple-for-Impossible%3COk,+Error%3E"],[1585,"impl-SerializeSeq-for-Impossible%3COk,+Error%3E"],[1595,"impl-SerializeSeq-for-Impossible%3COk,+Error%3E"],[1596,"impl-SerializeTuple-for-Impossible%3COk,+Error%3E"],[1604,"impl-SerializeStructVariant-for-Impossible%3COk,+Error%3E"],[1605,"impl-SerializeStruct-for-Impossible%3COk,+Error%3E"],[1606,"impl-SerializeTupleVariant-for-Impossible%3COk,+Error%3E"],[1607,"impl-SerializeTupleStruct-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":[]}],\ diff --git a/src-files.js b/src-files.js index 891bed142..26b6f22ed 100644 --- a/src-files.js +++ b/src-files.js @@ -43,7 +43,7 @@ var srcIndex = new Map(JSON.parse('[\ ["inkwell_internals",["",[],["cfg.rs","enum.rs","lib.rs"]]],\ ["is_terminal",["",[],["lib.rs"]]],\ ["is_terminal_polyfill",["",[],["lib.rs"]]],\ -["itertools",["",[["adaptors",[],["coalesce.rs","map.rs","mod.rs","multi_product.rs"]]],["combinations.rs","combinations_with_replacement.rs","concat_impl.rs","cons_tuples_impl.rs","diff.rs","duplicates_impl.rs","either_or_both.rs","exactly_one_err.rs","extrema_set.rs","flatten_ok.rs","format.rs","free.rs","group_map.rs","groupbylazy.rs","grouping_map.rs","impl_macros.rs","intersperse.rs","k_smallest.rs","kmerge_impl.rs","lazy_buffer.rs","lib.rs","merge_join.rs","minmax.rs","multipeek_impl.rs","pad_tail.rs","peek_nth.rs","peeking_take_while.rs","permutations.rs","powerset.rs","process_results_impl.rs","put_back_n_impl.rs","rciter_impl.rs","repeatn.rs","size_hint.rs","sources.rs","take_while_inclusive.rs","tee.rs","tuple_impl.rs","unique_impl.rs","unziptuple.rs","with_position.rs","zip_eq_impl.rs","zip_longest.rs","ziptuple.rs"]]],\ +["itertools",["",[["adaptors",[],["coalesce.rs","map.rs","mod.rs","multi_product.rs"]]],["combinations.rs","combinations_with_replacement.rs","concat_impl.rs","cons_tuples_impl.rs","diff.rs","duplicates_impl.rs","either_or_both.rs","exactly_one_err.rs","extrema_set.rs","flatten_ok.rs","format.rs","free.rs","group_map.rs","groupbylazy.rs","grouping_map.rs","impl_macros.rs","intersperse.rs","iter_index.rs","k_smallest.rs","kmerge_impl.rs","lazy_buffer.rs","lib.rs","merge_join.rs","minmax.rs","multipeek_impl.rs","pad_tail.rs","peek_nth.rs","peeking_take_while.rs","permutations.rs","powerset.rs","process_results_impl.rs","put_back_n_impl.rs","rciter_impl.rs","repeatn.rs","size_hint.rs","sources.rs","take_while_inclusive.rs","tee.rs","tuple_impl.rs","unique_impl.rs","unziptuple.rs","with_position.rs","zip_eq_impl.rs","zip_longest.rs","ziptuple.rs"]]],\ ["lalrpop_util",["",[],["lexer.rs","lib.rs","state_machine.rs"]]],\ ["lazy_static",["",[],["inline_lazy.rs","lib.rs"]]],\ ["libc",["",[["unix",[["linux_like",[["linux",[["arch",[["generic",[],["mod.rs"]]],["mod.rs"]],["gnu",[["b64",[["x86_64",[],["align.rs","mod.rs","not_x32.rs"]]],["mod.rs"]]],["align.rs","mod.rs"]]],["align.rs","mod.rs","non_exhaustive.rs"]]],["mod.rs"]]],["align.rs","mod.rs"]]],["fixed_width_ints.rs","lib.rs","macros.rs"]]],\ diff --git a/src/anyhow/backtrace.rs.html b/src/anyhow/backtrace.rs.html index 0bfdf9c14..f1711601a 100644 --- a/src/anyhow/backtrace.rs.html +++ b/src/anyhow/backtrace.rs.html @@ -1,4 +1,4 @@ -backtrace.rs - source